A new approach to coincidence and common fixed points under a homotopy of families of mappings in b-metric spaces
Anuradha Gupta and Manu Rohilla∗
Abstract
In this paper we derive coincidence and common fixed point results under order homotopies of families of mappings in preordered b-metric spaces.
Mathematics Subject Classification: 54H25, 06A06.
Keywords: b-metric space, common fixed point, concordantly isotone mappings, coincidence point, preorder, order homotopy.
Introduction and Preliminaries
Throughout this paper, N denotes the set of natural numbers. Bakhtin [4] and Czerwik [5] generalized the concept of metric spaces and introduced the notion of b-metric spaces as follows:
Definition 1.1**.**
Let X be a nonempty set. A b-metric is a function d:X×X→[0,∞) such that for all x,y,z∈X and a constant s≥1, the following conditions are satisfied:**
*(i) d(x,y)=0 if and only if x=y, ***
(ii) d(x,y)=d(y,x),**
(iii) d(x,y)≤s[d(x,z)+d(z,y)].
The pair (X,d) is called a b-metric space and the number s is called the coefficient of (X,d). If we take s=1, then (X,d) reduces to a metric space.**
Let X be a nonempty set equipped with a binary relation ≼. Then the relation ≼ is
(i) reflexive: if x≼x for all x∈X,
(ii) antisymmetric: if x≼y and y≼x, then x=y for all x,y∈X,
(iii) transitive: if x≼y and y≼z, then x≼z for all x,y,z∈X.
A binary relation ≼ is said to be a preorder if it is reflexive and transitive. A preorder is said to be a partial order if it is antisymmetric. Let (X,d,≼) be a b-metric space with coefficient s≥1 equipped with a binary relation ≼. Motivated by Kamihigashi and Stachurski [8] we define the following axiom:
d is s-regular if for all x,y,z∈ we have
[TABLE]
Evidently, if d is regular in the sense of Kamihigashi and Stachurski [8], then d is s-regular but the converse is not true as illustrated by the following example:
Let X=[0,∞) and define d:X×X→[0,∞) by
[TABLE]
Then (X,d) is a b-metric space with coefficient s=2. Suppose that X is equipped with a preorder relation defined by: for x,y∈X, x≼y if and only if x≤y. It can be easily observed that if x≼y≼z, then max{d(x,y),d(y,z)}≤4d(x,z) for all x,y,z∈X. This implies that d is s-regular. Also, 1≼2≼3 but max{d(1,2),d(2,3)}=25≰d(1,3). Therefore, d is not regular.
Kamihigashi and Stachurski [8] and Batsari et al. [3] established fixed point results of order-preserving self mappings in spaces equipped with a transitive binary relation and some distance measures. Recently, Fomenko and Podoprikhin [6, 10] generalized the results of Arutyunov [1, 2] to the case of families of multivalued mappings in partially ordered sets. They [7, 10] introduced the notion of order homotopy and proved that common fixed point and coincidence point properties are preserved under homotopies of families of mappings in ordered sets.
In this paper we establish results on preservation of coincidence points and common fixed points under order homotopies of families of mappings. The main objective of the paper is to develop a new approach and obtain sufficient conditions to gurantee the existence of coincidence and common fixed points under order homotopies of families of mappings in preordered s-regular b-metric spaces. We have generalized the results of [7, 9] to the case of preordered s-regular b-metric spaces and preordered regular metric spaces. This approach has enabled us to replace the classical approach of considering the underlying space to be complete by a preordered space and b-metric function satisfying the axiom of s-regularity. As a consequence we establish coincidence and common fixed points results under order homotopic families of mappings in the context of metric spaces and b-metric spaces from a unique point of view. An example demonstrating the utility of the results obtained is also provided.
Coincidence point results
In this section we prove some coincidence point results under a homotopy of families of mappings in preordered s-regular b-metric spaces. As a consequence, we formulate coincidence and fixed point results in preordered regular metric spaces.
For formulating the results, we recall some definitions and notions introduced by Fomenko and Podoprikhin [7, 9].
Definition 2.1**.**
Let (X,≼) be a preordered set. A mapping T:X→X* covers (covers from above) a mapping S:X→X on a set A⊂X if and only if for any x∈A such that S(x)≼T(x) (S(x)≽T(x)) then there exists an element y∈X satisfying y≼x (y≽x) and T(y)=S(x). If A=X, then we say that T covers (covers from above) S.*
Let (X,≼) be a preordered set. A mapping T:X→X is said to be isotone if for all x,y∈X
[TABLE]
Let T,S:X→X be a pair of self mappings on a preordered set (X,≼). Let C(T,S,≼) denote the set of chains C such that for all x,y∈C we have
(i) T(x)≼S(x),
(ii) x≺y implies S(x)≼T(y),
(iii) S(C)⊂T(X).
Let C∗(T,S,≼) denote the set of chains C such that for all x,y∈C we have
(i) T(x)≽S(x),
(ii) x≺y implies T(x)≼S(y),
(iii) S(C)⊂T(X).
Recall that the dual order of ≼ is the order ≼∗ defined by: x≼y if and only if y≼∗x. It can be easily observed that C∗(T,S,≼)=C(T,S,≼∗). For a fixed element x0∈X define the set
[TABLE]
Recall that an element x∈X is said to a minimal (maximal) element of X if and only if for every other element y∈X we have x≼y (x≽y).
Theorem 2.2**.**
Let (X,d,≼) be a preordered s-regular b-metric space. Let T,S:X→X be self mappings and there exists x0∈X such that T(x0)≼S(x0). Suppose that the following conditions are satisfied:
(i) the mapping T is isotone,
(ii) the mapping S covers the mapping T on the set OX(x0),
(iii) any chain C∈C(x0,T,S,≼) has a lower bound w∈X satisfying w≼T(w) and there exists z∈X such that
[TABLE]
Then the set \mboxCoin(T,S)∩OX(x0) is nonempty and contains a minimal element.
Proof.
The proof is divided into four steps where the existence of an element in \mboxCoin(T,S)∩OX(x0) is proven in Steps 1 to Step 3 and its minimality is established in Step 4.
Step 1 Set
[TABLE]
We show that V is a nonempty set. Since ≼ is reflexive, x0∈OX(x0). Also, T(x0)≼S(x0). By (ii) there exists x1∈X satisfying
[TABLE]
Since T is isotone, T(x1)≼S(x1). Also, S(x1)=T(x0)∈T(OX(x0)) which implies that x1∈V. Define an ordered relation on V as follows: v1⊑v2 if either v1=v2 or v1≺v2 and S(v1)≼T(v2). It is easily seen that ⊑ is reflexive and antisymmetric. Suppose that v1,v2,v3∈V, v1⊑v2 and v2⊑v3. If v1=v2 or v2=v3, then evidently, v1⊑v3. If v1≺v2, v2≺v3, S(v1)≼T(v2) and S(v2)≼T(v3), then v1≺v3. Also, v2∈V gives T(v2)≼S(v2) which implies that S(v1)≼T(v3). Therefore, v1⊑v3 which gives ⊑ is a partial order on V. By Hausdorff maximal principle, there exists a maximal chain C⊂V with respect to the order ⊑.
Step 2 We show that C∈C(x0,T,S,≼). By the definition of V we have C⊂OX(x0), S(C)⊂T(OX(x0)) and T(x)≼S(x) for all x∈C. Let x,y∈C and x≺y. Since C is a chain, x⊑y which gives S(x)≼T(y). Therefore, C∈C(x0,T,S,≼). By (iii), there exists a lower bound w∈X of C with respect to the order ≼.
Step 3 It is to be shown that w∈\mboxCoin(T,S)∩OX(x0). Since w is a lower bound of C, w≼x for all x∈C. Also, C⊂OX(x0) and ≼ is transitive. Therefore, w≼x0 which implies that w∈OX(x0). Consider
[TABLE]
Since Si(z)≼S(w)≼T(w) for all i∈N and d is s-regular, d(Si(z),S(w))≤s2d(Si(z),T(w)). Therefore, (2) becomes
[TABLE]
Also, w≼T(w) and T is isotone gives T(w)≼T2(w). Continuing likewise we get w≼T(w)≼Ti(w) for all i∈N. Therefore, Si(z)≼T(w)≼Ti(w) which gives d(Si(z),T(w))≤s2d(Si(z),Ti(w)). Using (2.2) we have
[TABLE]
Letting i→∞ we get T(w)=S(w). Therefore, w∈\mboxCoin(T,S)∩OX(x0).
Step 4 We claim that w is a minimal element of the set \mboxCoin(T,S)∩OX(x0). Assume on the contrary, there exists u∈\mboxCoin(T,S)∩OX(x0) satisfying u≺w. Since T is isotone, T(u)≼T(w) which implies that S(u)≼T(w). Therefore, u⊑w. As w is a lower bound of C, w≼x for all x∈C. Therefore, T(w)≼T(x) which implies that S(w)≼T(w). This gives u⊑w⊑x. As C is a maximal chain with respect to ⊑, u∈C which gives w≼u, a contradiction. Hence, w is a minimal element of the set \mboxCoin(T,S)∩OX(x0).
∎
The dual version of Theorem 2.2 can be stated as follows:
Theorem 2.3**.**
Let (X,d,≼) be a preordered s-regular b-metric space. Let T,S:X→X be self mappings and there exists x0∈X such that T(x0)≽S(x0). Suppose that the following conditions hold:
(i) the mapping T is isotone,
(ii) the mapping S covers the mapping T from above on the set OX∗(x0),
(iii) any chain C∈C∗(x0,T,S,≼) has an upper bound w∈X satisfying w≽T(w) and there exists z∈X such that
[TABLE]
Then the set \mboxCoin(T,S)∩OX∗(x0) is nonempty and contains a maximal element.
Podoprikhin and Fomenko [9] generalized the notion of order homotopy of isotone mappings introduced by Walker [11] as follows:
Let (X,≼) be a preordered set. A pair of mappings T,S:X→X are said to be order homotopic if there exists a finite sequence of mappings Hi:X→X (i=1,2,…,n) such that
[TABLE]
where Hi≼Hj if and only if Hi(x)≼Hj(x) for all x∈X.
Theorem 2.4**.**
Let (X,≼) be a preordered s-regular b-metric space. Let (T,S) and (T~,S~) be a pair of self mappings on X. Suppose that there are homotopies {Ht}0≤t≤n and {Kt}0≤t≤n between these pair of mappings such that
[TABLE]
Suppose that x0∈\mboxCoin(T,S) and the following conditions are satisfied:
(i) for each odd t, 1≤t≤n, Kt is isotone, the mapping Ht covers the mapping Kt and any chain C∈C(x0,Kt,Ht,≼) has a lower bound w∈X satisfying w≼Kt(w) and there exists z∈X such that for all i∈N we have
[TABLE]
(ii) for each even t, 1≤t≤n, Ht is isotone, the mapping Kt covers the mapping Ht and any chain C′∈C(x0,Ht,Kt,≼) has a lower bound w′∈X satisfying w′≼Ht(w′) and there exists z′∈X such that for all i∈N we have
[TABLE]
Then there exists a chain
[TABLE]
such that for every t, 1≤t≤n, xt∈\mboxCoin(Ht,Kt)∩OX(xt−1) and xt is a minimal element of the set \mboxCoin(Ht,Kt)∩OX(xt−1).
Proof.
Since x0∈\mboxCoin(H0,K0), K1(x0)≼K0(x0)=H0(x0)≼H1(x0) which implies that K1(x0)≼H1(x0). Using (i) we infer that all the conditions of Theorem 2.2 are satisfied. Therefore, there exists x1∈\mboxCoin(H1,K1)∩OX(x0) such that x1 is a minimal element of the set \mboxCoin(H1,K1)∩OX(x0). Consider H2(x1)≼H1(x1)=K1(x1)≼K2(x1) which gives H2(x1)≼K2(x1). As C(x1,H2,K2,≼)⊂C(x0,H2,K2,≼) and using (ii) we deduce that all the conditions of Theorem 2.2 are satisfied. Therefore, there exists x2∈\mboxCoin(H2,K2)∩OX(x1) such that x2 is a minimal element of the set \mboxCoin(H2,K2)∩OX(x1). Repeating this process we obtain a chain
[TABLE]
where xt∈\mboxCoin(Ht,Kt)∩OX(xt−1) and xt is a minimal element of the set \mboxCoin(Ht,Kt)∩OX(xt−1), 1≤t≤n.
∎
The following result is an immediate consequence of Theorem 2.2 and Theorem 2.3:
Theorem 2.5**.**
Let (X,d,≼) be a preordered s-regular b-metric space. Let (T,S) and (T~,S~) be a pair of self mappings on X. Suppose that there are homotopies {Ht}0≤t≤n and {Kt}0≤t≤n between these pair of mappings such that
[TABLE]
Suppose that the mappings Ht are isotone, 1≤t≤n, x0∈\mboxCoin(T,S) and the following conditions are satisfied:
(i) for each odd t, 1≤t≤n, the mapping Kt covers the mapping Ht from the above and any chain C∈C∗(Ht,Kt,≼) has an upper bound w∈X satisfying w≽Ht(w) and there exists z∈X such that for all i∈N we have
[TABLE]
(ii) for each even t, 1≤t≤n, the mapping Kt covers the mapping Ht and any chain C∈C(Ht,Kt,≼) has a lower bound w′∈X satisfying w′≼Ht(w′) and there exists z′∈X such that for all i∈N we have
[TABLE]
Then there exists a fence
[TABLE]
such that for each odd t, 1≤t≤n, xt∈\mboxCoin(Ht,Kt)∩OX∗(xt−1) and xt is a maximal element of the set \mboxCoin(Ht,Kt)∩OX∗(xt−1) and for each even t, 1≤t≤n, xt∈\mboxCoin(Ht,Kt)∩OX(xt−1) and xt is a minimal element of the set \mboxCoin(Ht,Kt)∩OX(xt−1).
Evidently, the identity mapping I:X→X covers (covers from above) any mapping T:X→X. Therefore, we have the following fixed point result under a homotopy of self mappings:
Theorem 2.6**.**
Let (X,d,≼) be a preordered s-regular b-metric space. Let T,T~:X→X be isotone mappings and {Ht}0≤t≤n be homotopy between T and T~ such that
[TABLE]
Suppose that x0∈\mboxFix(T) and the following conditions are satisfied:
(i) for each odd t, 1≤t≤n, any chain C∈C∗(Ht,I,≼) has an upper bound w∈X and there exists z∈X such that for all i∈N we have
[TABLE]
(ii) for each even t, 1≤t≤n, any chain C∈C(Ht,T,≼) has a lower bound w′∈X and there exists z′∈X such that for all i∈N we have
[TABLE]
Then there exists a fence
[TABLE]
such that for each odd t, 1≤t≤n, xt∈\mboxFix(Ht)∩OX∗(xt−1) and xt is a maximal element of the set \mboxFix(Ht)∩OX∗(xt−1) and for each even t, 1≤t≤n, xt∈\mboxFix(Ht)∩OX(xt−1) and xt is a minimal element of the set \mboxFix(Ht)∩OX(xt−1).
Remark 2.7**.**
In Theorems 2.2-2.6 if we assume (X,d,≼) is a preordered regular metric space, then also the results hold.**
We conclude this section with the following example to illustrate the efficiency of our results:
Example 2.8**.**
Let X=[0,2] and define d:X×X→[0,∞) by d(x,y)=(x−y)2. Then (X,d) is a b-metric space with coefficient s=2 and d is 2-regular. Suppose that X is equipped with a preorder given by: for x,y∈X, x≼y if and only if x≤y. Define T,H,T~:X→X by
[TABLE]
Then T≼H≽T~.
Clearly, x0=0∈\mboxFix(T) and OX∗(x0)=[0,2]. Also, every chain C∈C∗(H,I,≼) has an upper bound w=1 and there exists z=1+i1∈X, i∈N such that
[TABLE]
and
[TABLE]
Also, every chain C∈C(T~,I,≼) has a lower bound w′=0.2 and z′=0.2−2i2+4i∈X, i∈N such that
[TABLE]
and
[TABLE]
Then all the conditions of Theorem 2.6 are satisfied for a preordered 2-regular b-metric space. Therefore, we get a fence x0≼x1≽x2, where x0=0, x1=1 and x2=0.2. It is observed that x1∈\mboxFix(H)∩OX∗(x0) and x1 is a maximal element of the set \mboxFix(H)∩OX∗(x0). Also, OX(x1)=[0,1], x2∈\mboxFix(T~)∩OX(x1) and x2 is a minimal element of the set \mboxFix(T~)∩OX(x1).**
Common Fixed Point Results
In this section we prove some common fixed point results under a homotopy of families of mappings in preordered s-regular b-metric spaces.
Fomenko and Podoprikhin [6] introduced the notion of concordantly isotone mappings as follows:
Let (X,≼) be a preordered set, I be a nonempty set and a family of mappings F={fα}α∈I, where fα:X→X for all α∈I. The family F is said to be condordantly isotone if for all x,y∈X
[TABLE]
Let C1(F,≼) denote the set of chains C⊂α∈I⋃fα(X) such that
(i) fα(x)≼x for all x∈C and α∈I,
(ii) x≺y implies x≼fα(y) for all x,y∈C and α∈I.
Let C1∗(F,≼) denote the set of chains C⊂α∈I⋃fα(X) such that
(i) fα(x)≽x for all x∈C and α∈I,
(ii) x≺y implies fα(x)≼y for all x,y∈C and α∈I.
Observe that C1∗(F,≼)=C1(F,≼∗). For a fixed element x0∈X define the set
[TABLE]
Theorem 3.1**.**
Let (X,d,≼) be a preordered s-regular b-metric space in which a point x0 is fixed and F={fα}α∈I be a concordantly isotone family of mappings verifying fα(x0)≼x0 for all α∈I. Suppose that for any chain C∈C1(x0,F,≼) there exists w∈X such that w is a common lower bound of the chains fα(C) for each α∈I and there exists z∈X and β∈I satisfying
[TABLE]
Then the set \mboxComFix(F)∩OX(x0) is nonempty and contains a minimal element.
Proof.
The proof is divided into three steps where the existence of an element in \mboxComFix(F)∩OX(x0) is estalished in Steps 1 and 2 and its minimality is proven in Step 3.
Step 1 We show that C1(x0,F,≼) is nonempty. Since fα(x0)≼x0,
[TABLE]
Also, fα(x0)≼x0 and F is concordantly isotone implies that fβ(fα(x0))≼fα(x0) for all β∈I. Therefore, {fα(x0)}∈C1(x0,F,≼) which gives C1(x0,F,≼) is nonempty. Define an ordered relation on C1(x0,F,≼) as follows: C1⊵C2 if and only if C1⊂C2. It is easily seen that ⊵ is a partial order on C1(x0,F,≼). Then by Hausdorff maximal principle, there exists a maximal chain C in C(x0,F,≼) containing {fα(x0)} with respect to the order ⊵. By our assumption there exists w∈X such that w is a common lower bound of the chains fα(C) for each α∈I and there exists z∈X and β∈I satisfying
[TABLE]
Step 2 In this step we show that w∈\mboxComFix(F)∩OX(x0). Since w is a common lower bound of the chains fα(C) for all α∈I. Then w≼fα(x) for all x∈C and α∈I. As fα(x0)∈C,
[TABLE]
Then transitivity of ≼ implies that w∈OX(x0). Consider
[TABLE]
Since fα(w)≼w and F is concordantly isotone, fα(fα(w))≼fα(w). Proceeding likewise we have fαi(w)≼fα(w)≼w for all i∈N. Therefore, for all i∈N
[TABLE]
As d is s-regular, d(fα(w),fβi(z))≤s2d(fαi(w),fβi(z)). Also, fαi(w)≼w≼fβi(z) and d is s-regular gives d(w,fβi(z))≤s2d(fαi(w),fβi(z)). Therefore, (3.1) becomes
[TABLE]
Letting i→∞ we get fα(w)=w for all α∈I. Therefore, w∈\mboxComFix(F)∩OX(x0).
Step 3 We claim that w is a minimal element of the set \mboxComFix(F)∩OX(x0). Assume on the contrary, there exists v∈\mboxComFix(F)∩OX(x0) satisfying v≺w. As v=fα(v)∈α∈I⋃fα(OX(x0)), v∈OX(x0)∩α∈I⋃fα(OX(x0)). Since ≼ is reflexive, fα(v)≼v for all α∈I. Therefore, fα(x)≼x for all x∈C∪{v} and α∈I. As w is a common lower bound of the chains fα(C) and v≺w, v≼w≼fα(x)≼x for all x∈C and α∈I. Then transitivity of ≼ implies that v≼x for all x∈C. Since F is concordantly isotone, fβ(v)≼fα(x) which gives v≼fα(x) for all x∈C and α∈I. Therefore, C∪{v} is a chain in C1(x0,F,≼) but this contradicts the maximality of C. Hence, w is a minimal element of the set \mboxComFix(F)∩OX(x0).‘
∎
The dual version of Theorem 3.1 can be stated as follows:
Theorem 3.2**.**
Let (X,d,≼) be a preordered s-regular b-metric space in which a point x0 is fixed and F={fα}α∈I be a concordantly isotone family of mappings verifying fα(x0)≽x0 for all α∈I. Suppose that for any chain C∈C1∗(x0F,≼) there exists w∈X such that w is a common upper bound of the chains fα(C) for each α∈I and there exists z∈X and β∈I satisfying
[TABLE]
Then the set \mboxComFix(F)∩OX∗(x0) is nonempty and contains a maximal element.
Theorem 3.3**.**
Let (X,d,≼) be a preordered s-regular b-metric space. Let F={fα}α∈I and G={gα}α∈I be a pair of families of self mappings on X. Suppose that {Ht,α}0≤t≤n be a homotopy between fα and gα such that
[TABLE]
Suppose that x0∈\mboxComFix(F) and the following conditions are satisfied:
(i) for each t, 1≤t≤n, the family Ht={Ht,α}α∈I is concordantly isotone,
(ii) for each odd t, 1≤t≤n, for any chain C∈C1∗(Ht,≼) there exists w∈X such that w is a common upper bound of the chains Ht,α(C) for all α∈I and there exists z∈X and β∈I satisfying
[TABLE]
(iii) for each even t, 1≤t≤n, for any chain C∈C1(Ht,≼) there exists w′∈X such that w′ is a common lower bound of the chains Ht,α(C) for all α∈I and there exists z′∈X and γ∈I satisfying
[TABLE]
Then there exists a fence
[TABLE]
such that for each odd t, 1≤t≤n, xt∈\mboxComFix(Ht)∩OX∗(xt−1) and xt is a maximal element of the set \mboxComFix(Ht)∩OX∗(xt−1) and for each even t, 1≤t≤n, xt∈\mboxComFix(Ht)∩OX(xt−1) and xt is a minimal element of the set \mboxComFix(Ht)∩OX(xt−1).
Proof.
Since x0∈\mboxComFix(F), H1,α(x0)≽H0,α(x0)=fα(x0)=x0 for all α∈I. This gives H1,α(x0)≽x0 for all α∈I. Using C1∗(x0,H1,≼)⊂C1∗(H1,≼), (i) and (ii) we deduce that all the conditions of Theorem 3.2 are satisfied. Therefore, there exists x1∈\mboxComFix(H1)∩OX∗(x0) such that x1 is a maximal element of the set \mboxComFix(H1)∩OX∗(x0). Also, H2,α(x1)≼H1,α(x1)=x1 for all α∈I and C1(x1,H2,≼)⊂C1(H2,≼). Using (i) and (iii) we conclude that all the conditions of Theorem 3.1 are satisfied. Therefore, there exists x2∈\mboxComFix(H2)∩OX(x1) such that x2 is a minimal element of the set \mboxComFix(H2)∩OX(x1). Proceeding likewise we get a fence
[TABLE]
where for each odd t, 1≤t≤n, xt∈\mboxComFix(Ht)∩OX∗(xt−1) and xt is a maximal element of the set \mboxComFix(Ht)∩OX∗(xt−1) and for each even t, 1≤t≤n, xt∈\mboxComFix(Ht)∩OX(xt−1) and xt is a minimal element of the set \mboxComFix(Ht)∩OX(xt−1).
∎
Remark 3.4**.**
It is observed that Theorems 3.1-3.3 hold if we take (X,d,≼) to be a preordered regular metric space.**
Acknowledgements
∗corresponding author
The corresponding author is supported by UGC Non-NET fellowship (Ref.No. Sch/139/Non-NET/ Math./Ph.D./2017-18/1028).