B. D. Pant, Sunny Chauhan ∗ , Suneel Kumar
A Common Fixed Point Theorem for Set-valued Contraction Mappings in Menger Space
Abstract. The aim of this paper is to prove a common fixed point theorem for even number of single-valued and two set-valued mappings in complete Menger space using implicit relation. Our result improves and extends the result of Chen and Chang [Com- mon fixed point theorems in Menger spaces, Int. J. Math. Math. Sci. 2006, Art. ID 75931, 15 pp].
2010 Mathematics Subject Classification: Primary: 47H10, Secondary: 54H25.
Key words and phrases: t-norm, probabilistic metric space, set-valued mappings, we- akly compatible mappings, implicit relation.
1. Introduction. There have been a number of generalizations of metric space.
One such generalization is Menger space introduced in 1942 by Karl Menger [15]
who used distribution functions instead of nonnegative real numbers as values of the metric. Schweizer and Sklar [23, 15] studied this concept and then the important development of Menger space theory was due to Sehgal and Bharucha-Reid [25].
It is also of fundamental importance in probabilistic functional analysis, nonlinear analysis and applications [2, 3]. In 1991, Mishra [17] formulated the definition of compatible maps in probabilistic metric space (shortly PM-space). This condition has further been weakened by introducing the notion of weakly compatible mappings by Singh and Jain [26] in PM-spaces. It is worth to mention that every pair of compatible maps is weakly compatible, but the converse is not always true.
In 1976, Caristi [1] proved a fixed point theorem. Since the Caristi’s fixed point theorem does not require the continuity of the mapping, it has applications in many fields. In 1993, Zhang et al. [27] proved a set-valued Caristi’s theorem in probabilistic metric spaces. Chuan [7] brought forward the concept of Caristi type hybrid fixed point in Menger PM-space. Various authors proved some fixed point theorems for multi-valued mappings in probabilistic metric spaces (see [4, 22, 9, 10, 21]). Recently,
∗
Corresponding author
Chen and Chang [6] proved a common fixed point theorem for four single valued and two set-valued mappings in complete Menger space using the notion of compatibility.
In [22], Razani and Shirdaryazdi proved a common fixed point theorem for even number of single valued mappings in complete Menger space. In [6, 18, 22], the results have been proved for continuous mappings.
In fixed point theory many authors (see [5, 13, 14, 16, 19, 20, 26]) used implicit relations as a tool to find common fixed point of mappings. These observations mo- tivated us to prove a common fixed point theorem for even number of single-valued and two set-valued mappings in complete Menger space using implicit relation. Our results never require continuity of one or more mappings.
2. Preliminaries.
Definition 2.1 ([24]) A mapping ∗ : [0, 1] × [0, 1] → [0, 1] is t-norm if ∗ is satis- fying the following conditions:
1. ∗ is commutative and associative;
2. a ∗ 1 = a for all a ∈ [0, 1];
3. c ∗ d a ∗ b whenever c a and d b and a, b, c, d ∈ [0, 1].
Definition 2.2 ([24]) A mapping F : R → R + is called a distribution function if it is non-decreasing and left continuous with inf{F (t) : t ∈ R} = 0 and sup{F (t) : t ∈ R} = 1.
We shall denote by = the set of all distribution functions defined on [−∞, ∞]
while H(t) will always denote the specific distribution function defined by H(t) =
0, if t ¬ 0;
1, if t > 0.
If X is a non-empty set, F : X × X → = is called a probabilistic distance on X and the value of F at (x, y) ∈ X × X is represented by F x,y .
Definition 2.3 ([24]) A PM-space is an ordered pair (X, F), where X is a non- empty set of elements and F is a probabilistic distance satisfying the following conditions: for all x, y, z ∈ X and t, s > 0,
1. F x,y (t) = H(t) for all t > 0 if and only x = y;
2. F x,y (0) = 0;
3. F x,y (t) = F y,x (t);
4. if F x,y (t) = 1 and F y,z (s) = 1 then F x,z (t + s) = 1.
The ordered triple (X, F, ∗) is called a Menger space if (X, F) is a PM-space, ∗ is a t-norm and the following inequality holds:
F x,y (t + s) F x,z (t) ∗ F z,y (s),
for all x, y, z ∈ X and t, s > 0.
Every metric space (X, d) can always be realized as a PM-space by considering F : X × X → = defined by F x,y (t) = H(t − d(x, y)) for all x, y ∈ X. So PM-spaces offer a wider framework than that of metric spaces and are better suited to cover even wider statistical situations.
Definition 2.4 ([3]) Let (X, F, ∗) be a Menger space and A be a non-empty subset of X. Then A is said to be probabilistically bounded if
sup
t>0 inf
x,y ∈A F x,y (t) = 1.
If X itself is probabilistically bounded, then X is said to be a probabilistically bounded space.
Throughout this paper, B(X) will denote the family of non-empty bounded subsets of a Menger space (X, F, ∗). For all A, B ∈ B(X) and for every t > 0, we define
D F A,B (t) = sup{F a,b (t); a ∈ A, b ∈ B}
and
δ F A,B (t) = inf{F a,b (t); a ∈ A, b ∈ B}.
If the set A consists of a single point a, we write
δ F A,B (t) = δ F a,B (t).
If the set B also consists of a single point b, we write
δ F A,B (t) = F a,b (t).
It follows immediately from the definition that
δ F A,B (t) = δ F B,A (t) 0,
δ F A,B (t) = 1 ⇔ A = B = {a}, for all A, B ∈ B(X).
Definition 2.5 ([24]) Let (X, F, ∗) be a Menger space with continuous t-norm.
1. A sequence {x n } in X is said to converge to a point x in X if and only if for every > 0 and λ ∈ (0, 1), there exists an integer N such that F x
n,x () > 1 − λ for all n N.
2. A sequence {x n } in X is said to be Cauchy if for every > 0 and λ ∈ (0, 1), there exists an integer N such that F x
n,x
m() > 1 − λ for all n, m N.
3. A Menger space in which every Cauchy sequence is convergent is said to be complete.
The following definition is on the lines of Jungck and Rhoades [12].
Definition 2.6 The mappings f : X → X and g : X → B(X) are said to be weakly compatible (or coincidentally commuting) if they commute at their coinci- dence points, that is gu = {fu} for some u ∈ X then fgu = gfu (Note that the term gu = {fu} implies that gu is a singleton).
Remark 2.7 If mappings f : X → X and g : X → B(X) of a Menger space (X, F, ∗) are compatible then they are weakly compatible but the converse need not be true.
3. Implicit Relation.
In 2008, Imdad and Ali [11] used the following implicit relation for the existence of common fixed points of the involved mappings.
Let Ψ be the class of all real continuous functions ψ : [0, 1] 4 → R satisfying the following conditions:
(R-1) For every u > 0, v 0 with ψ(u, v, u, v) 0 or ψ(u, v, v, u) 0, we have u > v.
(R-2) ψ(u, u, 1, 1) < 0, for all u > 0.
Example 3.1 ([11]) Define ψ : [0, 1] 4 → R as ψ(t 1 , t 2 , t 3 , t 4 ) = t 1 −φ (min{t 2 , t 3 , t 4 }), where φ : [0, 1] → [0, 1] is a continuous function such that φ(s) > s for 0 < s < 1.
Example 3.2 ([11]) Define ψ : [0, 1] 4 → R as ψ(t 1 , t 2 , t 3 , t 4 ) = t 1 −a min{t 2 , t 3 , t 4 }, where a > 1.
Example 3.3 ([11]) Define ψ : [0, 1] 4 → R as ψ(t 1 , t 2 , t 3 , t 4 ) = t 1 −at 2 −min{t 3 , t 4 }, where a > 0.
Example 3.4 ([11]) Define ψ : [0, 1] 4 → R as ψ(t 1 , t 2 , t 3 , t 4 ) = t 1 − at 2 − bt 3 − ct 4 , where a > 1, b, c 0(6= 1).
Example 3.5 ([11]) Define ψ : [0, 1] 4 → R as ψ(t 1 , t 2 , t 3 , t 4 ) = t 1 − at 2 − b(t 3 + t 4 ), where a > 1, b 0(6= 1).
Example 3.6 ([11]) Define ψ : [0, 1] 4 → R as ψ(t 1 , t 2 , t 3 , t 4 ) = t 3 1 − at 2 t 3 t 4 , where
a > 1.
4. Results.
Theorem 4.1 Let (X, F, ∗) be a complete Menger space where ∗ is a continuous t-norm. Let P 1 , P 2 , . . . , P 2n : X → X be single-valued mappings and let A, B : X → B(X) two set-valued mappings. If the following conditions are satisfied:
(1) A(X) ⊆ P 2 P 4 . . . P 2n (X), B(X) ⊆ P 1 P 3 . . . P 2n−1 (X);
(2) One of P 1 P 3 . . . P 2n−1 (X) or P 2 P 4 . . . P 2n (X) is a closed subset of X;
(3) The pairs (A, P 1 P 3 . . . P 2n−1 ) and (B, P 2 P 4 . . . P 2n ) are weakly compatible;
Suppose that
P 1 (P 3 . . . P 2n−1 ) = (P 3 . . . P 2n−1 )P 1 , P 1 P 3 (P 5 . . . P 2n−1 ) = (P 5 . . . P 2n−1 )P 1 P 3 ,
.. .
P 1 . . . P 2n−3 (P 2n−1 ) = (P 2n−1 )P 1 . . . P 2n−3 , A(P 3 . . . P 2n−1 ) = (P 3 . . . P 2n−1 )A, A(P 5 . . . P 2n−1 ) = (P 5 . . . P 2n−1 )A,
.. .
AP 2n−1 = P 2n−1 A, P 2 (P 4 . . . P 2n ) = (P 4 . . . P 2n )P 2 , P 2 P 4 (P 6 . . . P 2n ) = (P 6 . . . P 2n )P 2 P 4 ,
.. .
P 2 . . . P 2n−2 (P 2n ) = (P 2n )P 2 . . . P 2n−2 , B(P 4 . . . P 2n ) = (P 4 . . . P 2n )B, B(P 6 . . . P 2n ) = (P 6 . . . P 2n )B,
.. . BP 2n = P 2n B;
(4) There exists ψ ∈ Ψ such that
(1) ψ
δ F Ax,By (t), F P
1P
3...P
2n−1x,P
2P
4...P
2ny (t),
δ F Ax,P
1P
3...P
2n−1x (t), δ F By,P
2P
4...P
2ny (t)
0,
for all x, y ∈ X and t > 0. Then there exists a point z ∈ X such that {z} = {P 1 z } = {P 2 z } = . . . = {P 2n z } = Az = Bz.
Proof Let x 0 be an arbitrary point in X. By (1), we choose a point x 1 ∈ X such that y 0 = P 2 P 4 . . . P 2n x 1 ∈ Ax 0 . For this point x 1 there exists a point x 2 ∈ X such that y 1 = P 1 P 3 . . . P 2n−1 x 2 ∈ Bx 1 , and so on. Continuing in this manner we can construct sequences {x n } and {y n } in X as follows
y 2n = P 2 P 4 . . . P 2n x 2n+1 ∈ Ax 2n , y 2n+1 = P 1 P 3 . . . P 2n−1 x 2n+2 ∈ Bx 2n+1 , for n = 0, 1, 2, . . .. Now, using inequality (1) with x = x 2n and y = x 2n+1 , we get
ψ
δ F Ax
2n,Bx
2n+1(t), F P
1P
3...P
2n−1x
2n,P
2P
4...P
2nx
2n+1(t),
δ F Ax
2n,P
1P
3...P
2n−1x
2n(t), δ F Bx
2n+1,P
2P
4...P
2nx
2n+1(t)
0, ψ F y
2n,y
2n+1(t), F y
2n−1,y
2n(t), F y
2n,y
2n−1(t), F y
2n+1,y
2n(t)
0.
Using (R-1), we get
(2) F y
2n,y
2n+1(t) > F y
2n−1,y
2n(t).
Thus {F y
2n,y
2n+1(t), n 0} is a bounded strictly increasing sequence of positive real numbers in [0, 1] and therefore tends to a limit L(t) ¬ 1. We claim that L(t) = 1. For if L(t 0 ) < 1 for some t 0 , then letting n → ∞ in inequality (2), we get L(t 0 ) > L(t 0 ) a contradiction. Hence L(t) = 1 for all t > 0.
Claim: {y n } is a Cauchy sequence in X. Now for m 1,
F y
n,y
n+m(t) F y
n,y
n+1t 2
∗ F y
n+1,y
n+mt 2
. This yields that
n lim →∞ F y
n,y
n+m(t) lim
n →∞ F y
n,y
n+1t 2
∗ lim n
→∞ F y
n+1,y
n+mt 2
= 1 ∗ lim n
→∞ F y
n+1,y
n+mt 2
= lim
n→∞ F y
n+1,y
n+mt 2
lim
n→∞
F y
n+1,y
n+2t 4
∗ F y
n+2,y
n+mt 4
= lim
n→∞ F y
n+2,y
n+mt 4
.. .
lim
n→∞
F y
n+m−2,y
n+m−1t 2 m−1
∗ F y
n+m−1,y
n+mt 2 m−1
= 1,
and thus lim n →∞ F y
n,y
n+m(t) = 1, since ∗ is continuous and a∗1 = a for all a ∈ [0, 1].
Hence {y n } is a Cauchy sequence in X.
Now, suppose that P 2 P 4 . . . P 2n (X) is a closed subset of X, then for some u ∈ X we have z = P 2 P 4 . . . P 2n (u) ∈ P 2 P 4 . . . P 2n (X). Putting x = x 2n and y = u in inequality (1), we have
ψ
δ F Ax
2n,Bu (t), F P
1P
3...P
2n−1x
2n,P
2P
4...P
2nu (t),
δ F Ax
2n,P
1P
3...P
2n−1x
2n(t), δ F Bu,P
2P
4...P
2nu (t)
0, ψ
δ F y
2n,Bu (t), F y
2n−1,P
2P
4...P
2nu (t), F y
2n−1,y
2n(t), δ F Bu,z (t)
0, as n → ∞, we have
ψ ( δ F z,Bu (t), F z,z (t), F z,z (t), δ F Bu,z (t)) 0.
Using (R-1), we have δ F z,Bu (t) > 1 for all t > 0, which contradicts. Hence z = Bu.
Therefore, Bu = {z} = {P 2 P 4 . . . P 2n u }. Since (B, P 2 P 4 . . . P 2n ) is weakly compati- ble pair we have B(P 2 P 4 . . . P 2n u) = (P 2 P 4 . . . P 2n )Bu, hence Bz = {P 2 P 4 . . . P 2n z }.
Putting x = x 2n and y = z in inequality (1), we have
ψ
δ F Ax
2n,Bz (t), F P
1P
3...P
2n−1x
2n,P
2P
4...P
2nz (t),
δ F Ax
2n,P
1P
3...P
2n−1x
2n(t), δ F Bz,P
2P
4...P
2nz (t)
0, ψ
F y
2n,P
2P
4...P
2nz (t), F y
2n−1,P
2P
4...P
2nz (t), F y
2n−1,y
2n(t), F P
2P
4...P
2nz,P
2P
4...P
2nz (t)
0.
Taking limit as n → ∞, we have
ψ F z,P
2P
4...P
2nz (t), F y
2n−1,P
2P
4...P
2nz (t), 1, 1
0,
which contradicts (R-2). Hence z = P 2 P 4 . . . P 2n z. Therefore, Bz = {P 2 P 4 . . . P 2n z } = {z}. Since B(X) ⊆ P 1 P 3 . . . P 2n−1 (X), there exists v ∈ X such that {P 1 P 3 . . . P 2n−1 v } = Bz = {P 2 P 4 . . . P 2n z } = {z}. Putting x = v and y = z in inequality (1), we have
ψ
δ F Av,Bz (t), F P
1P
3...P
2n−1v,P
2P
4...P
2nz (t),
δ F Av,P
1P
3...P
2n−1v (t), δ F Bz,P
2P
4...P
2nz (t)
0 ψ ( δ F Av,z (t), F z,z (t), δ F Av,z (t), F z,z (t)) 0, or
ψ ( δ F Av,z (t), 1, δ F Av,z (t), 1) 0.
Using (R-1), we get δ F Av,z (t) > 1 for all t > 0, which contradicts. Hence, Av = {z}.
Since Av = {P 1 P 3 . . . P 2n−1 v } and the pair (A, P 1 P 3 . . . P 2n−1 ) is weakly compati- ble, we obtain Az = A(P 1 P 3 . . . P 2n−1 v) = (P 1 P 3 . . . P 2n−1 )Av = {P 1 P 3 . . . P 2n−1 z }.
Putting x = z and y = x 2n+1 in inequality (1), we get
ψ
δ F Az,Bx
2n+1(t), F P
1P
3...P
2n−1z,P
2P
4...P
2nx
2n+1(t),
δ F Az,P
1P
3...P
2n−1z (t), δ F Bx
2n+1,P
2P
4...P
2nx
2n+1(t)
0, ψ δ F Az,y
2n+1(t), F z,y
2n(t), δ F Az,z (t), δ F y
2n+1,y
2n(t)
0.
Taking limit as n → ∞, we have
ψ ( δ F Az,z (t), F z,z (t), δ F Az,z (t), δ F z,z (t)) 0 ψ ( δ F Az,z (t), 1, δ F Az,z (t), 1) 0.
Using (R-1), we get δ F Az,z (t) > 1 for all t > 0, which contradicts. Hence, Az =
{P 1 P 3 . . . P 2n−1 z } = {z}. Therefore, we get Az = Bz = {P 1 P 3 . . . P 2n−1 z } =
{P 2 P 4 . . . P 2n z } = {z}. Now we show that z is the fixed point of all the com-
ponent mappings. Putting x = P 3 . . . P 2n−1 z, y = z, P 1
0= P 1 P 3 . . . P 2n−1 and
P 2
0= P 2 P 4 . . . P 2n in inequality (1), we have
ψ δ F AP
3...P
2n−1z,Bz (t), F P
01
P
3...P
2n−1z,P
20z (t),
δ F AP
3...P
2n−1z,P
01
P
3...P
2n−1z (t), δ F Bz,P
02