Mathematical Theory and Modeling www.iiste.

org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

193
Fixed Point and Common Fixed Point Theorems in Complete
Metric Spaces
Pushpraj Singh Choudhary
*
, Renu Praveen Pathak** and M.K. Sahu***,Ramakant Bhardwaj****
*Dept. of Mathematics & Computer Science Govt. Model Science College (Auto.) Jabalpur.
**Department of Mathematics, Late G.N. Sapkal College of Engineering,Anjaneri Hills, Nasik (M.H.), India
***Department of Mathematics,Govt PG College Gadarwara.
****Truba Institute of Engineering and Information Technology,Bhopal.
pr_singh_choudhary@yahoo.co.in, pathak_renu@yahoo.co.in

Abstract
In this paper we established a fixed point and a unique common fixed point theorems in four pair of weakly
compatible self-mappings in complete metric spaces satisfy weakly compatibility of contractive modulus.
Keywords : Fixed point, Common Fixed point, Complete metric space, Contractive modulus, Weakly
compatible maps.
Mathematical Subject Classification : 2000 MSC No. 47H10, 54H25

Introduction
The concept of the commutativity has generalised in several ways .In 1998, Jungck Rhoades [3] introduced the
notion of weakly compatible and showed that compatible maps are weakly compatible but conversely. Brian
Fisher [1] proved an important common fixed point theorem. Seesa S [9] has introduced the concept of weakly
commuting and Gerald Jungck [2] initiated the concept of compatibility. It can be easily verified that when the
two mappings are commuting then they are compatible but not conversely. Thus the study of common fixed
point of mappings satisfying contractive type condition have been a very active field of research activity during
the last three decades.
In 1922 the polished mathematician, Banach, proved a theorem ensures, under appropriate conditions, the
existence and uniqueness of a fixed point. His result is called Banach fixed point theorem or the Banach
contraction principle. This theorem provides a technique for solving a variety of a applied problems in a
mathematical science and engineering. Many authors have extended, generalized and improved Banach fixed
point theorem in a different ways. Jungck [2] introduced more generalised commuting mappings, called
compatible mappings, which are more general than commuting and weakly commuting mappings.
The main purpose of this paper is to present fixed point results for two pair of four self maps satisfying a new
contractive modulus condition by using the concept of weakly compatible maps in complete metric spaces.

Preliminaries
The definition of complete metric spaces and other results that will be needed are:
Definition 1: Let f and g two self-maps on a set X. Maps f and g are said to be commuting if
¡gx = g¡x ¡or oll xeX.
Definition 2: Let f and g two self-maps on a set X. If ¡x = gx, ¡or somc x in X tℎcn x is called coincidence
point of f and g.
Definition 3: Let f and g two self-maps defined on a set X, then f and g are said to be compatible if they
commute at coincidence points. That is, if ¡u = gu ¡or somc u e X , tℎcn ¡gu = g¡u.
Definition 4: Let f and g be two weakly compatible self-maps defined on a set X, If f and g have a unique point
of coincidence, that is, w = ¡x = gx , tℎcn w is o uniquc common ¡ixcJ point o¡ ¡ onJ g.
Definition 5: A sequence {x
n
] in a metric space (X, J)is soiJ to bc con:crgcnt to o point xe X,
denoted by lim
n→«
x
n
= x , i¡ lim
n→«
J(x
n
, x) = u.
Definition 6: A sequence {x
n
] in a metric space (X, J) is soiJ to bc Coucℎy scqucncc i¡
lim
t→«
J(x
n
, x
m
) = u ¡or oll n, m > t.
Definition 7: A metric space (X, J) is soiJ to bc Complctc i¡ every Cauchy sequence in X is convergent.
Definition 8: A function ¢: |u, ∞) → |u, ∞) is soiJ to bc o controcti:c moJulus i¡
¢: |u, ∞) → |u, ∞) onJ ¢(t) < t ¡ort > u .
Definition 9: A real valued function φ defined on R X ⊆ is said to be upper semi continuous
i¡ lim
n→«
sup ¢(t
n
) ≤ ¢(t) , ¡or c:cry scqucncc {t
n
] e X witℎ t
n
→ t os n → ∞ .
Hence it is clear that every continuous function is upper semi continuous but converse may not true.


Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

194
MAIN RESULT
In this section we established a common fixed point theorem for two pairs of weakly compatible mappings in
complete metric spaces using a contractive modulus.
Theorem 1: Let (X,d) be a complete metric space. Suppose that the mapping E, F, G and H are four self maps
of X satisfying the following condition:
(i) E(X) ⊆ E(X) onJ 0(X) ⊆ F(X)
(ii) J(0
x
, E
¡
) ≤ ¢(z(x, y))
Where ¢ is a upper semi continuous, contractive modulous and
z(x, y) = max
`
1
1
1
1
J(E
x
, F
¡
), J(E
x
, 0
x
), J(F
¡
, E
¡
),
1
2
|J(E
x
, E
¡
) + J(F
¡
, 0
x
)] ,
1
4
_
d(L
x
,P
j
)+d(L
x
,u
x
)+d(P
j
,u
x
)
1+d(L
x
,P
j
)d(L
x
,u
x
)d(P
j
,u
x
)
_ ,
3
2
_
d(P
j
,H
j
)+d(P
j
,u
x
)+d(P
j
,L
x
)
1+d(P
j
,H
j
)d(P
j
,u
x
)d(P
j
,L
x
)
_
1
1
1
1
1

(iii) The pair (G, E) and (H, F) are weakly compatible then E, F, G& H have a unique common fixed point.

Proof : Suppose C is on orbitrory point o¡ X onJ Jc¡inc tℎc scqucncc {y
n
] in X sucℎ tℎot
y
n
= 0x
n
= Fx
n+1

y
n+1
= Ex
n+1
= Ex
n+2

By (ii) we have
J(y
n
, y
n+1
) = J(0x
n
, Ex
n+1
)
( ) ( )
1
,
n n
x x
+
≤ φ λ
Where z(x
n
, x
n+1
) = mox
`
1
1
1
1
J(Ex
n
, Fx
n+1
), J(Ex
n
, 0x
n
), J(Fx
n+1
, Ex
n+1
),
1
2
|J(Ex
n
, Ex
n+1
) + J(Fx
n+1
, 0x
n
)] ,
1
4
j
d(Lx
n
,Px
n+1
)+d(Lx
n
,ux
n
)+d(Px
n+1
,ux
n
)
1+d(Lx
n
,Px
n+1
)d(Lx
n
,ux
n
)d(Px
n+1
,ux
n
)
[ ,
3
2
j
d(Px
n+1
,Hx
n+1
)+d(Px
n+1
,ux
n
)+d(Px
n+1
,Lx
n
)
1+d(Px
n+1
,Hx
n+1
)d(Px
n+1
,ux
n
)d(Px
n+1
,Lx
n
)
[
1
1
1
1
1

= mox
`
1
1
1
1
1
1
J(Ex
n-1
, 0x
n
), J(Ex
n-1
, 0x
n
), J(0x
n
, Ex
n+1
),
1
2
|J(Ex
n-1
, Ex
n+1
) + J(0x
n
, 0x
n
)] ,
1
4
_
J(Ex
n-1
, 0x
n
) + J(Ex
n-1
, 0x
n
) +J(0x
n
, 0x
n
)
1 + J(Ex
n-1
, 0x
n
)J(Ex
n-1
, 0x
n
)J(0x
n
, 0x
n
)
_ ,
S
2
_
J(0x
n
, Ex
n+1
) +J(0x
n
, 0x
n
) + J(0x
n
, Ex
n-1
)
1 + J(0x
n
, Ex
n+1
)J(0x
n
, 0x
n
)J(0x
n
, Ex
n-1
)
_
1
1
1
1
1
1
1

≤ max _J(Ex
n-1
, 0x
n
), (0x
n
, Ex
n+1
),
1
2
|J(Ex
n-1
, Ex
n+1
)]
1
4
_
J(Ex
n-1
, 0x
n
)
1
_
S
2
_
J(Ex
n-1
, Ex
n+1
)
1
__
≤ max _J(y
n-1
, y
n
), J(y
n
, y
n+1
),
1
2
|J(y
n-1
, y
n+1
)],
1
4
J(y
n-1
, y
n
),
S
2
|J(y
n-1
, y
n+1
)]_
≤ max{J(y
n-1
, y
n
), J(y
n
, y
n+1
)]
Since ¢ is a contractive modulus; z(x
n
, x
n+1
) = J(y
n
, y
n+1
) is not possiblc, Iℎus
J(y
n
, y
n+1
) ≤ ¢ J(y
n-1
, y
n
) (1)
Since ¢ is an upper semi continuous contractive modulus, Equation (1) implies that the sequence {J(y
n
, y
n+1
)]
is monotonic decreasing and continuous.
Hence there exists a real number, say r ≥ u sucℎ tℎot lim
n→«
J(y
n
, y
n+1
) = r
∴ os n → ∞ , Eq
n
(1) implics tℎot
r ≤ ¢(r)
Which is possible only If r = 0 because ¢ is a contractive modulus, Thus
lim
n→«
J(y
n
, y
n+1
) = u
Now we show that {y
n
]is a Cauchy sequence.
Let If possible we assume that {y
n
]is not a cauchy sequence , Then there exist an ∈ > u and subsequence
{n
ì
] onJ {m
ì
] sucℎ tℎot m
ì
< n
ì
< m
ì+1
onJ
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

195


( ) ( )
1
, and ,
i
m n m n
d y y d y y

≥ ∈ <∈ (2)
So that
( ) ( ) ( ) ( )
1 1 1
, , , ,
i i i i i i i
m n m n n n n n
d y y d y y d y y d y y
− − −
∈≤ ≤ + <∈+
Therefore
( ) ( ) ( ) ( )
lim , , ,
i i i i i i
m n m n m n
n
d y y d Gx Hx x x
→∞
= ≤ φ λ
i.e.
( ) ( )
,
i i
m n
x x ∈≤ φ λ (3)

Where,


( )
( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( )
, , , , , ,
1
, ,
2
, , ,
1
, max
4
1 , , ,
, , ,
3
2
1 , ,
i i i i i i
i i i i
i i i i i i
i i
i i i i i i
i i i i i i
i i i
m n m m n n
m n n m
m n m m n m
m n
m n m m n m
n n n m n m
n n n
d Ex Fx d Ex Gx d Fx Hx
d Ex Hx d Fx Gx
d Ex Fx d Ex Gx d Fx Gx
x x
d Ex Fx d Ex Gx d Fx Gx
d Fx Hx d Fx Gx d Fx Ex
d Fx Hx d Fx G
(
+
¸ ¸
(
+ +
λ =
(
+ + (
¸ ¸
+ +
+
( ) ( )
,
i i i
m n m
x d Fx Ex
¦ ¹
¦ ¦
¦ ¦
¦ ¦
¦ ¦
¦ ¦ ¦ ¦
´ `
¦ ¦
¦ ¦
¦ ¦
(
¦ ¦
(
¦ ¦
(
¦ ¦ ¸ ¸ ¹ )



( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( ) ( )
1 1 1 1
1 1
1 1 1 1
1 1 1 1
1 1
, , , , , ,
1
, , ,
2
, , ,
1
max
4
1 , , ,
, ,
3
2
i i i i i i
i i i i
i i i i i i
i i i i i i
i i i i i
m n m m n n
m n n m
m n m m n m
m n m m n m
n n n m n
d Hx Gx d Hx Gx d Gx Hx
d Hx Hx d Gx Gx
d Hx Gx d Hx Gx d Gx Gx
d Hx Gx d Hx Gx d Gx Gx
d Gx Hx d Gx Gx d Gx
− − − −
− −
− − − −
− − − −
− −
(
+
¸ ¸
(
+ +
=
(
+ (
¸ ¸
+ +
( )
( ) ( ) ( )
1 1
1 1 1 1
,
1 , , ,
i
i i i i i i
m
n n n m n m
Hx
d Gx Hx d Gx Gx d Gx Hx
− −
− − − −
¦ ¹
¦ ¦
¦ ¦
¦ ¦
¦ ¦
¦ ¦ ¦ ¦
´ `
¦ ¦
¦ ¦
¦ ¦
(
¦ ¦
(
¦ ¦
+ (
¦ ¦ ¸ ¸ ¹ )



( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( )
1 1 1 1
1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1
, , , , , ,
1
, , ,
2
, , ,
1
max
4
1 , , ,
, , ,
3
2
1 , ,
i i i i i i
i i i i
i i i i i i
i i i i i i
i i i i i i
i i i
m n m m n n
m n n m
m n m m n m
m n m m n m
n n n m n m
n n n
d y y d y y d y y
d y y d y y
d y y d y y d G y
d y y d y y d y y
d y y d y y d y y
d y y d y
− − − −
− −
− − − −
− − − −
− − − −
− −
(
+
¸ ¸
(
+ +
=
(
+ (
¸ ¸
+ +
+
( ) ( )
1 1
,
i i i
m n m
y d y y
− −
¦ ¹
¦ ¦
¦ ¦
¦ ¦
¦ ¦
¦ ¦ ¦ ¦
´ `
¦ ¦
¦ ¦
¦ ¦
(
¦ ¦
(
¦ ¦
(
¦ ¦ ¸ ¸ ¹ )

By taking limit as i → ∞ , wc gct
lim
ì→«
z(x

, x

) = mox _∈ ,u,u,
1
2
(∈ +∈),
1
4
_
∈ +u + u
1 + u
_ ,
S
2
_
u + u+∈
1 + u
__

( ) ( )
1
, and ,
i
m n m n
d y y d y y

≥ ∈ <∈
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

196
Thus we have ,lim
t→«
z(x
m
, x
n
) =∈
Therefore from (3) ∈ ≤ ¢(E)
This is a contraction because u <∈ onJ ¢ is controcti:c moJulus.
Thus {y
n
] is o coucℎy scqucncc in X,
sincc X is complctc , tℎcrc cxist o point z in X sucℎ tℎot lim
n→«
y
n
= z.
Thus lim
n→«
0x
n
= lim
n→«
Fx
n+1
= z onJ lim
n→«
Ex
n+1
= lim
n→«
Ex
n+2
= z
i. e. lim
n→«
0x
n
= lim
n→«
Fx
n+1
= lim
n→«
Ex
n+1
= lim
n→«
Ex
n+2
= z
since 0(X) ⊆ F(X) , tℎcrc cxist opoint u ∈ X sucℎ tℎot z = Eu
Then by (ii), we have
J(0u, z) ≤ J(0u, Ex
n+1
) + J(Ex
n+1
, z)
≤ ¢(z(u, x
n+1
)) + J(Ex
n+1
, z)
Where, z(u, x
n+1
) = mox
`
1
1
1
1
J(Eu, Fx
n+1
), J(Eu, 0u), J(Fx
n+1
, Ex
n+1
),
1
2
|J(Eu, Ex
n+1
) +J(Fx
n+1
, 0u)],
1
4
j
d(Lu,Px
n+1
)+d(Lu,uu)+d(Px
n+1
,uu)
1+d(Lu,Px
n+1
) d(Lu,uu) d(Px
n+1
,uu)
[ ,
3
2
j
d(Px
n+1
,Hx
n+1
)+d(Px
n+1
,uu)+d(Px
n+1
,Lu)
1+d(Px
n+1
,Hx
n+1
) d(Px
n+1
,uu) d(Px
n+1
,Lu)
[
1
1
1
1
1

= mox
`
1
1
1
1
1
1
J(z, 0x
n
), J(z, 0u), J(0x
n
, Ex
n+1
),
1
2
|J(z, Ex
n+1
) + J(0x
n
, 0u)],
1
4
_
J(z, 0x
n
) + J(z, 0u) +J(0x
n
, 0u)
1 +J(z, 0x
n
) J(z, 0u) J(0x
n
, 0u)
_ ,
S
2
_
J(0x
n
, Ex
n+1
) +J(0x
n
, 0u) + J(0x
n
, z)
1 +J(0x
n
, Ex
n+1
) J(0x
n
, 0u) J(0x
n
, z)
_
1
1
1
1
1
1
1

Taking the limit as n → ∞ yiclJs
z(u, x
n+1
) = mox
`
1
1
1
1
1
1J(z, z), J(z, 0u), J(z, z),
1
2
|J(z, z) +J(z, 0u)],
,
1
4
_
J(z, z) + J(z, 0u) + J(z, 0u)
1 +J(z, z) J(z, 0u) J(z, 0u)
_ ,
S
2
_
J(z, z) +J(z, 0u) + J(z, z)
1 + J(z, z) J(z, 0u) J(z, z)
_
1
1
1
1
1
1
1

= J(0u, z)
Thus as n → ∞, J(0u, z) ≤ ¢(J(0u, z)) + J(z, z) = ¢(J(0u, z))
I¡ 0u ≠ z tℎcn J(0u, z) > u onJ ℎcncc os ¢ is controcti:c moJulus ¢(J(0u, z)) < J(0u, z).
Iℎcrc¡orc J(0u, z) < J(0u, z) wℎicℎ is o controJiction.
Iℎus 0u = z , so Eu = 0u = z.
So u is o coinciJcncc point o¡ E onJ 0 .
Sincc tℎc poir o¡ mops 0 onJ E orc wcokly compotiblc ,
0Eu = E0u, ic. 0z = Ez .
Agoin sincc 0(X) ⊆ F(X), tℎcrc cxist o point : ∈ X sucℎ tℎot z = F:.
Iℎcn by (ii), wc ℎo:c
J(z, E:) = J(0:, E:)
≤ ¢ (z(u, :))
wℎcrc, z(u, :) = mox
`
1
1
1
1
1
1J(Eu, F:), J(Eu, 0u), J(F:, E:),
1
2
|J(Eu, E:) + J(F:, 0u)],
1
4
_
J(Eu, F:) + J(Eu, 0u) + J(F:, 0u)
1 + J(Eu, F:) J(Eu, 0u) J(F:, 0u)
_ ,
S
2
_
J(F:, E:) + J(F:, 0u) +J(F:, Eu)
1 + J(F:, E:) J(F:, 0u) J(F:, Eu)
_
1
1
1
1
1
1
1

Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

197
= mox
`
1
1
1
1
J(z, z), J(z, z), J(z, E:),
1
2
|J(z, E:) +J(z, z)],
1
4
j
d(z,z)+d(z,z)+d(z,z)
1+d(z,z) d(z,z) d(z,z)
[ ,
3
2
j
d(z,H¡)+d(z,z)+d(z,z)
1+d(z,H¡) d(z,z) d(z,z)
[
1
1
1
1
1

= J(z, E:)
Iℎus J(z, E:) ≤ ¢ J(z, E:)
I¡ E: ≠ z tℎcn J(z, E:) > u onJ ℎcncc os ¢ is controcti:c moJulus ,
¢ J(z, E:) < J(z, E:) , wℎicℎ is o controJiction.
Therefore E: = F: = z.
So : is o coinciJcncc point o¡ F onJ E.
Since the pair of maps F and H are weakly compatible,
FE: = EF: , i. c Fz = Ez.
Now we show that z is a fixed point of G.
Iℎcn by (ii), wc ℎo:c J(0z, z) = J(0z, E:)
≤ ¢ (z(z, :))
Where,
z(z, :) = mox
`
1
1
1
1
1
1J(Ez, F:), J(Ez, 0z), J(F:, E:),
1
2
|J(Ez, E:) +J(F:, 0z)],
1
4
_
J(Ez, F:) +J(Ez, 0z) + J(F:, 0z)
1 + J(Ez, F:) J(Ez, 0z) J(F:, 0z)
_ ,
S
2
_
J(F:, E:) + J(F:, 0z) +J(F:, Ez)
1 + J(F:, E:) J(F:, 0z) J(F:, Ez)
_
1
1
1
1
1
1
1

= mox
`
1
1
1
1
J(0z, z), J(0z, 0z), J(z, z),
1
2
|J(0z, z) + J(z, 0z)],
1
4
j
d(uz,z)+d(uz,uz)+d(z,uz)
1+d(uz,z) d(uz,uz) d(z,uz)
[ ,
3
2
j
d(z,z)+d(z,uz)+d(z,uz)
1+d(z,z) d(z,uz) d(z,uz)
[
1
1
1
1
1

= J(0z, z)
Iℎus J(0z, z) ≤ ¢ (J(0z, z))
I¡ 0z ≠ z tℎcn J(0z, z) > u onJ ℎcncc os ¢ is controcti:c moJulus
¢ (J(0z, z)) < J(0z, z).
Therefore 0z = z
Hence 0z = Ez = z
By (ii), we have,
J(z, Ez) = J(Ez, Ez)
( ) ( )
, z z ≤ φ λ
Where,
z(z, z) = mox
`
1
1
1
1
1
1J(Ez, Fz), J(Ez, 0z), J(Fz, Ez),
1
2
|J(Ez, Ez) + J(Fz, 0z)],
1
4
_
J(Ez, Fz) + J(Ez, 0z) + J(Fz, 0z)
1 + J(Ez, Fz) J(Ez, 0z) J(Fz, 0z)
_ ,
S
2
_
J(Fz, Ez) + J(Fz, 0z) + J(Fz, Ez)
1 +J(Fz, Ez) J(Fz, 0z) J(Fz, Ez)
_
1
1
1
1
1
1
1

= mox
`
1
1
1
1
J(z, Ez), J(z, z), J(Ez, Ez),
1
2
|J(z, Ez) +J(Ez, z)],
1
4
j
d(z,Hz)+d(z,z)+d(Hz,z)
1+d(z,Hz) d(z,z) d(Hz,z)
[ ,
3
2
j
d(Hz,Hz)+d(Hz,z)+d(Hz,z)
1+d(Hz,Hz) d(Hz,z) d(Hz,z)
[
1
1
1
1
1

= J(z, Ez)
Iℎus J(z, Ez) ≤ ¢ (J(z, Ez))
If z ≠ Ez tℎcn J(z, Ez) > u onJ ℎcncc os ¢ is ocontrocti:c moJulus ,
¢ (J(z, Ez)) < J(z, Ez)
Therefore J(z, Ez) < J(z, Ez) , wℎicℎ is o controJiction.
Hencez = Ez
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

198
Therefore Ez = Fz = z.
Therefore 0z = Ez = Ez = Fz = z , ic. z is o common ¡ixcJ point o¡ E, F, 0 onJ E.
Uniqueness : For uniqueness, Let we assume that z onJ w , (z ≠ w) orc common
¡ixcJ point o¡ E, F, 0 onJ E.
By (ii), we have,
J(z, w) = J(0z, Ew)
( ) ( )
, z w ≤ φ λ
Where,
(z, w) = mox
`
1
1
1
1
J(Ez, Fw), J(Ez, 0z), J(Fw, Ew),
1
2
|J(Ez, Ew) + J(Fw, 0z)],
1
4
j
d(Lz,Pw)+d(Lz,uz)+d(Pw,uz)
1+d(Lz,Pw) d(Lz,uz) d(Pw,uz)
[ ,
3
2
j
d(Pw,Hw)+d(Pw,uz)+d(Pw,Lz)
1+d(Pw,Hw) d(Pw,uz) d(Pw,Lz)
[
1
1
1
1
1

= mox
`
1
1
1
1
J(z, w), J(z, z), J(w, w),
1
2
|J(z, w) + J(w, z)],
1
4
j
d(z,w)+d(z,z)+d(w,z)
1+d(z,w) d(z,z) d(w,z)
[ ,
3
2
j
d(w,w)+d(w,z)+d(w,z)
1+d(w,w) d(w,z) d(w,z)
[
1
1
1
1
1

= J(z, w)
Thus J(z, w) ≤ ¢ (J(z, w))
Since z ≠ w tℎcn J(z, w) > u onJ ℎcncc os ¢ is o controcti:c moJulus ,
¢ (J(z, w)) < J(z, w)
J(z, w) < J(z, w) wℎicℎ is o controJiction.
Therefore z = w
Thus z is the unique common fixed point of E, F, G & H .
Hence the theorem.

Corollary 1 : Let (X, J) bc o complctc mctric spocc supposc tℎot tℎc moppings E, 0 onJ E orc
scl¡ mopso¡ X, Sotis¡ying tℎc ¡ollowing conJitions
(i) E(X) ⊆ E(X) onJ 0(X) ⊆ E(X)
(ii) J(0x, Ey) ≤ ¢(z(x, y))
Where ¢ is on uppcr scmi continuous , controcti:c moJulus onJ
z(x, y) = mox
`
1
1
1
1
J(E
x
, E
¡
), J(E
x
, 0
x
), J(E
¡
, E
¡
),
1
2
|J(E
x
, E
¡
) + J(E
¡
, 0
x
)] ,
1
4
_
d(L
x
,L
j
)+d(L
x
,u
x
)+d(L
j
,u
x
)
1+d(L
x
,L
j
)d(L
x
,u
x
)d(L
j
,u
x
)
_ ,
3
2
_
d(L
j
,H
j
)+d(L
j
,u
x
)+d(L
j
,L
x
)
1+d(L
j
,H
j
)d(L
j
,u
x
)d(L
j
,L
x
)
_
1
1
1
1
1

(iii) Iℎc poir (0, E) onJ (E, E) orc wcokly compotiblc
Then E, G and H have a unique common fixed point.
Proof : By taking E = F in main theorem we get the proof.

Corollary 2 : Let (X,d) be a complete metric space, suppose that the mappings E and G are self maps of X,
satisfying the following conditions :
(i) 0(X) ⊆ E(X)
(ii) J(0x, 0y) ≤ ¢(z(x, y))
Where ¢ is on uppcr scmi continuous , controcti:c moJulus onJ
z(x, y) = mox
`
1
1
1
1
1
1J(E
x
, E
¡
), J(E
x
, 0
x
), J(E
¡
, 0
¡
),
1
2
|J(E
x
, 0
¡
) + J(E
¡
, 0
x
)] ,
1
4
_
J(E
x
, E
¡
) + J(E
x
, 0
x
) + J(E
¡
, 0
x
)
1 + J(E
x
, E
¡
)J(E
x
, 0
x
)J(E
¡
, 0
x
)
_ ,
S
2
_
J(E
¡
, 0
¡
) + J(E
¡
, 0
x
) + J(E
¡
, E
x
)
1 + J(E
¡
, 0
¡
)J(E
¡
, 0
x
)J(E
¡
, E
x
)
_
1
1
1
1
1
1
1

(iii) Iℎc poir (0, E) orc wcokly compotiblc
Then E and G have a unique common fixed point.
Proof : By taking E = F and G = H in theorem 3.1 we get the proof.
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.6, 2013-Selected from International Conference on Recent Trends in Applied Sciences with Engineering Applications

199

References
[1] B.Fisher, common fixed point of four mappings. Bull. Inst. of Math. Academia. Sinicia, 11 (1983),
103-113.
[2] G. Jungck, Compatible mappings and common fixed points, Internet, I. Math. and Math. Sci., 9 (1986),
771-779.
[3] G.Jungck, and B.E. Rhoades, Fixed point for set valued functions without continuity, Indian J. Pure
Appl. Math, 29(3) (1998), 227-238.
[4] J.Matkowski, Fixed point theorems for mappings with a contractive iterates at appoint, Proc. Amer.
Math. Soc., 62(2) (1977), 344-348.
[5] Jay G. Mehta and M.L. Joshi, On common fixed point theorems in complete metric space Gen. Math.
Vol.2, No.1, (2011), pp.55-63 ISSN 2219-7184.
[6] M. Aamri and D. EiMoutawakil, Some new common fixed point theorems under strict contractive
conditions, J. Math. Anal. Appl., 270 (2002), 181-188.
[7] M. Imdad, Santosh Kumar and M. S. Khan, Remarks on fixed point theorems satisfying Implicit
relations, Radovi Math., 11 (2002), 135-143.
[8] S. Rezapour and R. Hamlbarani, Some notes on the paper : Cone Metric spaces and Fixed point
theorems of contractive mappings, Journals of Mathematical Analysis and Applications, 345(2) (2008),
719-724.
[9] S. Sessa, On a weak Commutativity condition of mappings in a fixed point considerations, Publ. Inst.
Math. Appl., Debre. 32 (1982), 149-153.


This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.

More information about the publisher can be found in the IISTE’s homepage:
http://www.iiste.org

CALL FOR PAPERS
The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. There’s no deadline for
submission. Prospective authors of IISTE journals can find the submission
instruction on the following page: http://www.iiste.org/Journals/
The IISTE editorial team promises to the review and publish all the qualified
submissions in a fast manner. All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than
those inseparable from gaining access to the internet itself. Printed version of the
journals is also available upon request of readers and authors.
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar

Sign up to vote on this title
UsefulNot useful