# Best Proximity Point Theorems for Some New Cyclic Mappings

Authors: Chi-Ming Chen; Chao-Hung Chen
Journal: Journal of Applied Mathematics
 (2012)

---

## Abstract

By using the stronger Meir-Keeler mapping, we introduce the concepts of the sMK-G-cyclic mappings, sMK-K-cyclic mappings, and sMK-C-cyclic mappings, and then we prove some best proximity point theorems for these various types of contractions. Our results generalize or improve many recent best proximity point theorems in the literature (e.g., Elderd and Veeramani, 2006; Sadiq Basha et al., 2011).


---

## Body

## 1. Introduction and Preliminaries

LetA and B be nonempty subsets of a metric space (X,d). Consider a mapping T:A∪B→A∪B, T is called a cyclic map if T(A)⊆B and T(B)⊆A. x∈A is called a best proximity point of T in A if d(x,Tx)=d(A,B) is satisfied, where d(A,B)=inf{d(x,y):x∈A,y∈B}. In 2005, Eldred et al. [1] proved the existence of a best proximity point for relatively nonexpansive mappings using the notion of proximal normal structure. In 2006, Eldred and Veeramani [2] proved the following existence theorem.Theorem 1.1 (see Theorem 3.10 in [2]).
LetA and B be nonempty closed convex subsets of a uniformly convex Banach space. Suppose f:A∪B→A∪B is a cyclic contraction, that is, f(A)⊆B and f(B)⊆A, and there exists k∈(0,1) such that
(1.1)d(fx,fy)≤kd(x,y)+(1-k)d(A,B)foreveryx∈A,y∈B.
Then there exists a unique best proximity point in A. Further, for each x∈A, {f2nx} converges to the best proximity point.Later, best proximity point theorems for various types of contractions have been obtained in [3–7]. Particularly, in [8], the authors prove some best proximity point theorems for K-cyclic mappings and C-cyclic mappings in the frameworks of metric spaces and uniformly convex Banach spaces, thereby furnishing an optimal approximate solution to the equations of the form Tx=x, where T is a non-self-K-cyclic mapping or a non-self-C-cyclic mapping.Definition 1.2 (see [8]).
A pair of mappingsT:A→B and S:B→A is said to form a K-cyclic mapping between A and B if there exists a nonnegative real number k<1/2 such that
(1.2)d(Tx,Sy)≤k[d(x,Tx)+d(y,Sy)]+(1-2k)d(A,B),
for x∈A and y∈B.Definition 1.31.3 (see [8]).
A pair of mappingsT:A→B and S:B→A is said to form a C-cyclic mapping between A and B if there exists a nonnegative real number k<1/2 such that
(1.3)d(Tx,Sy)≤k[d(x,Sy)+d(y,Tx)]+(1-2k)d(A,B),
for x∈A and y∈B.In this paper, we also recall the notion of Meir-Keeler mapping (see [9]). A function ϕ:[0,∞)→[0,∞) is said to be a Meir-Keeler mapping if, for each η>0, there exists δ>0 such that, for t∈[0,∞) with η≤t<η+δ, we have ϕ(t)<η. Generalization of the above function has been a heavily investigated branch of research. In this study, we introduce the below notion of the stronger Meir-Keeler function ψ:[0,∞)→[0,1/2).Definition 1.4.
We callψ:[0,∞)→[0,1/2) a stronger Meir-Keeler mapping if the mapping ψ satisfies the following condition:
(1.4)∀η>0∃δ>0∃γη∈[0,12)∀t∈[0,∞)(η≤t<δ+η⟹ψ(t)<γη).The following provides two example of a stronger Meir-Keeler mapping.Example 1.5.
Letψ:[0,∞)→[0,1/2) be defined by
(1.5)ψ(t)={0,ift≤1,t-12,if1<t<2,13,ift≥2.
Then ψ is a stronger Meir-Keeler mapping which is not a Meir-Keeler function.Example 1.6.
Letψ:[0,∞)→[0,1/2) be defined by
(1.6)ψ(t)=t3t+1.
Then ψ is a stronger Meir-Keeler mapping.In this paper, by using the stronger Meir-Keeler mapping, we introduce the concepts of the sMK-G-cyclic mappings, sMK-K-cyclic mappings and sMK-C-cyclic mappings, and then we prove some best proximity point theorems for these various types of contractions. Our results generalize or improve many recent best proximity point theorems in the literature (e.g., [2, 8]).


## 2. sMK-G-Cyclic Mappings

In this section, we prove the best proximity point theorems for the sMK-G-cyclic non-self mappings.Definition 2.1.
Let(X,d) be a metric space, and let A and B be nonempty subsets of X. A pair of mappings T:A→B and S:B→A is said to form an sMK-G-cyclic mapping between A and B if there is a stronger Meir-Keeler function ψ:ℝ+→[0,1/2) in X such that for x∈A and y∈B,
(2.1)d(Tx,Sy)-d(A,B)≤ψ(d(x,y))⋅[G(x,y)-2d(A,B)],
where G(x,y)=max{d(x,y),d(x,Tx),d(y,Sy),d(x,Sy),d(y,Tx)}.Lemma 2.2.
LetA and B be nonempty subsets of a metric space (X,d). Suppose that the mappings T:A→B and S:B→A form an sMK-G-cyclic mapping between A and B. Then there exists a sequence {xn} in X such that
(2.2)lim⁡n→∞d(xn,xn+1)=d(A,B).Proof.
Letx0∈A be given and let x2n+1=Tx2n and x2n+2=Sx2n+1 for each n∈ℕ∪{0}. Taking into account (2.1) and the definition of the stronger Meir-Keeler function ψ:ℝ+→[0,1/2), we have that for each n∈ℕ∪{0}(2.3)d(x2n+1,x2n+2)-d(A,B)=d(Tx2n,Sx2n+1)-d(A,B)≤ψ(d(x2n,x2n+1))⋅[G(x2n,x2n+1)-2d(A,B)],
where
(2.4)G(x2n,x2n+1)=max⁡{d(x2n,x2n+1),d(x2n,Tx2n),d(x2n+1,Sx2n+1),d(x2n,Sx2n+1),d(x2n+1,Tx2n)}=max⁡{d(x2n,x2n+1),d(x2n,x2n+1),d(x2n+1,x2n+2),d(x2n,x2n+2),d(x2n+1,x2n+1)}≤max⁡{d(x2n,x2n+1),d(x2n,x2n+1),d(x2n+1,x2n+2),d(x2n,x2n+1)+d(x2n+1,x2n+2),0}≤2⋅max⁡{d(x2n,x2n+1),d(x2n+1,x2n+2)}.
Taking into account (2.3) and (2.4), we have that for each n∈ℕ∪{0}(2.5)d(x2n+1,x2n+2)-d(A,B)≤ψ(d(x2n,x2n+1))⋅2⋅[max⁡{d(x2n,x2n+1),d(x2n+1,x2n+2)}-d(A,B)]<max⁡{d(x2n,x2n+1),d(x2n+1,x2n+2)}-d(A,B),
and so we conclude that
(2.6)d(x2n+1,x2n+2)-d(A,B)<d(x2n,x2n+1)-d(A,B),
and, for each n∈ℕ,
(2.7)d(x2n,x2n+1)-d(A,B)=d(Sx2n-1,Tx2n)-d(A,B)=d(Tx2n,Sx2n-1)-d(A,B)≤ψ(d(x2n,x2n-1))⋅[G(x2n,x2n-1)-2d(A,B)],
where
(2.8)G(x2n,x2n-1)=max⁡{d(x2n,x2n-1),d(x2n,Tx2n),d(x2n-1,Sx2n-1),d(x2n,Sx2n-1),d(x2n-1,Tx2n)}≤max⁡{d(x2n,x2n-1),d(x2n,x2n+1),d(x2n-1,x2n),d(x2n,x2n),d(x2n-1,x2n+1)}≤max⁡{d(x2n,x2n-1),d(x2n,x2n+1),d(x2n-1,x2n),0,d(x2n-1,x2n)+d(x2n,x2n+1)}≤2⋅max⁡{d(x2n-1,x2n),d(x2n,x2n+1)}.
Taking into account (2.7) and (2.8), we have that for each n∈ℕ(2.9)d(x2n,x2n+1)-d(A,B)≤ψ(d(x2n-1,x2n))⋅2⋅[max⁡{d(x2n,x2n-1),d(x2n,x2n+1)}-d(A,B)]<max⁡{d(x2n-1,x2n),d(x2n,x2n+1)}-d(A,B),
and so we conclude that
(2.10)d(x2n+1,x2n+2)-d(A,B)<d(x2n,x2n+1)-d(A,B).
Generally, by (2.6) and (2.10), we have that for each n∈ℕ(2.11)d(xn+1,xn+2)<d(xn,xn+1),d(xn+1,xn+2)-d(A,B)≤ψ(d(xn,xn+1))⋅2⋅[d(xn,xn+1)-d(A,B)].
Thus the sequence {d(xn,xn+1)}n∈ℕ∪{0} is decreasing and bounded below and hence it is convergent. Let limn→∞d(xn,xn+1)=η≥0. Then there exists n0∈ℕ and δ>0 such that for all n∈ℕ with n≥n0(2.12)η≤d(xn,xn+1)<η+δ.
Taking into account (2.12) and the definition of stronger Meir-Keeler function ψ, corresponding to η use, there exists γη∈[0,1/2) such that (2.13)ψ(d(xn,xn+1))<γη∀n≥n0.
Thus, we can deduce that for each n∈ℕ with n≥n0+1(2.14)d(xn,xn+1)-d(A,B)≤ψ(d(xn-1,xn))⋅2⋅[d(xn-1,xn)-d(A,B)]<γη⋅2⋅[d(xn-1,xn)-d(A,B)],
and so
(2.15)d(xn,xn+1)-d(A,B)<γη⋅2⋅[d(xn-1,xn)-d(A,B)]<(2γη)2⋅[d(xn-2,xn-1)-d(A,B)]<⋯<(2γη)n-n0⋅[d(xn0,xn0+1)-d(A,B)].
Since γη∈[0,1/2), we get
(2.16)lim⁡n→∞d(xn,xn+1)-d(A,B)=0,
that is, limn→∞d(xn,xn+1)=d(A,B).Lemma 2.3.
LetA and B be nonempty closed subsets of a metric space (X,d). Suppose that the mappings T:A→B and S:B→A form an sMK-G-cyclic mapping between A and B. For a fixed point x0∈A, let x2n+1=Tx2n and x2n+2=Sx2n+1. Then the sequence {xn} is bounded.Proof.
It follows from Lemma2.2 that {d(x2n-1,x2n)} is convergent and hence it is bounded. Since T:A→B and S:B→A form an sMK-G-cyclic mapping between A and B, there is a stronger Meir-Keeler function ψ:ℝ+→[0,1/2) in X such that
(2.17)d(x2n,Tx0)=d(Sx2n-1,Tx0)=d(Tx0,Sx2n-1)≤ψ(d(x0,x2n-1))⋅[G(d(x0,x2n-1))-2d(A,B)]+d(A,B),
where
(2.18)G(d(x0,x2n-1))=max⁡{d(x0,x2n-1),d(x0,Tx0),d(x2n-1,Sx2n-1),d(x0,Sx2n-1),d(x2n-1,Tx0)}=max⁡{d(x0,x2n-1),d(x0,Tx0),d(x2n-1,x2n),d(x0,x2n),d(x2n-1,Tx0)}≤max⁡{d(x0,Tx0)+d(Tx0,x2n)+d(x2n,x2n-1),d(x0,Tx0),d(x2n-1,x2n),d(x0,Tx0)+d(Tx0,x2n),d(x2n-1,x2n)+d(x2n,Tx0)}=d(x0,Tx0)+d(Tx0,x2n)+d(x2n,x2n-1).
Taking into account (2.17) and (2.18), we get
(2.19)d(x2n,Tx0)≤ψ(d(x0,x2n-1))1-ψ(d(x0,x2n-1))[d(x0,Tx0)+d(x2n,x2n-1)]+1-2ψ(d(x0,x2n-1))1-ψ(d(x0,x2n-1))d(A,B)
Therefore, the sequence {x2n} is bounded. Similarly, it can be shown that {x2n+1} is also bounded. So we complete the proof.Theorem 2.4.
LetA and B be nonempty closed subsets of a metric space. Let the mappings T:A→B and S:B→A form an sMK-G-cyclic mapping between A and B. For a fixed point x0∈A, let x2n+1=Tx2n and x2n+2=Sx2n+1. Suppose that the sequence {x2n} has a subsequence converging to some element x in A. Then, x is a best proximity point of T.Proof.
Suppose that a subsequence{x2nk} converges to x in A. It follows from Lemma 2.2 that d(x2nk-1,x2nk) converges to d(A,B). Since T:A→B and S:B→A form an sMK-G-cyclic mapping between A and B and taking into account (2.13), we have that for each 2nk∈ℕ with 2nk≥n0+1(2.20)d(x2nk,Tx)=d(Tx,x2nk)≤ψ(d(x,x2nk-1))⋅[G(x,x2nk-1)-2d(A,B)]+d(A,B)<γη⋅[G(x,x2nk-1)-2d(A,B)]+d(A,B),
where
(2.21)G(x,x2nk-1)=max⁡{d(x,x2nk-1),d(x,Tx),d(x2nk-1,Sx2nk-1),d(x,Sx2nk-1),d(x2nk-1,Tx)}=max⁡{d(x,x2nk-1),d(x,Tx),d(x2nk-1,x2nk),d(x,x2nk),d(x2nk-1,Tx)}=max⁡{d(x,x2nk)+d(x2nk,x2nk-1),d(x,Tx),d(x2nk-1,x2nk),d(x,x2nk),d(x2nk,Tx)+d(x2nk-1,x2nk)}≤d(x,x2nk)+d(x2nk,x2nk-1)+d(x2nk,Tx).
Following from (2.20) and (2.21), we obtain that
(2.22)d(x2nk,Tx)≤γη[d(x,x2nk)+d(x2nk,x2nk-1)+d(x2nk,Tx)-2d(A,B)]+d(A,B),
that is, we have that
(2.23)d(A,B)≤d(x2nk,Tx)≤γη1-γη⋅[d(x,x2nk)+d(x2nk,x2nk-1)]+[1-γη1-γη]⋅d(A,B),
letting k→∞. Then we conclude that
(2.24)d(A,B)≤d(x,Tx)≤γη1-γη⋅[d(A,B)+0]+[1-γη1-γη]⋅d(A,B).
Therefore, d(x,Tx)=d(A,B), that is, x is a best proximity point of T.


## 3.   sMK-K-Cyclic Mappings

In this section, we prove the best proximity point theorems for the sMK-K-cyclic non-self mappings.Definition 3.1.
Let(X,d) be a metric space, and let A and B be nonempty subsets of X. A pair of mappings T:A→B and S:B→A is said to form an sMK-K-cyclic mapping between A and B if there is a stronger Meir-Keeler function ψ:ℝ+→[0,1/2) in X such that, for x∈A and y∈B,
(3.1)d(Tx,Sy)-d(A,B)≤ψ(d(x,y))⋅[K(x,y)-2d(A,B)],
where K(x,y)=d(x,Tx)+d(y,Sy).Lemma 3.2.
LetA and B be nonempty subsets of a metric space (X,d). Suppose that the mappings T:A→B and S:B→A form an sMK-K-cyclic mapping between A and B. Then there exists a sequence {xn} in X such that
(3.2)lim⁡n→∞d(xn,xn+1)=d(A,B).Proof.
Letx0∈A be given and let x2n+1=Tx2n and x2n+2=Sx2n+1 for each n∈ℕ∪{0}. Taking into account (3.1) and the definition of the stronger Meir-Keeler function ψ:ℝ+→[0,1/2), we have that n∈ℕ∪{0}(3.3)d(x2n+1,x2n+2)-d(A,B)=d(Tx2n,Sx2n+1)-d(A,B)≤ψ(d(x2n,x2n+1))⋅[K(x2n,x2n+1)-2d(A,B)],
where
(3.4)K(x2n,x2n+1)=d(x2n,Tx2n)+d(x2n+1,Sx2n+1)=d(x2n,x2n+1)+d(x2n+1,x2n+2).
Taking into account (3.3) and (3.4), we have that
(3.5)d(x2n+1,x2n+2)<d(x2n,x2n+1).
Similarly, we can conclude that
(3.6)d(x2n,x2n+1)<d(x2n-1,x2n).
Generally, by (3.5) and (3.6), we have that for each n∈ℕ∪{0}(3.7)d(xn+1,xn+2)<d(xn,xn+1).
Thus the sequence {d(xn,xn+1)}n∈ℕ∪{0} is decreasing and bounded below and hence it is convergent. Let limn→∞d(xn,xn+1)-d(A,B)=η≥0. Then there exists n0∈ℕ and δ>0 such that for all n∈ℕ with n≥n0(3.8)η≤d(xn,xn+1)<η+δ.
Taking into account (3.8) and the definition of stronger Meir-Keeler function ψ, corresponding to η use, there exists γη∈[0,1/2) such that
(3.9)ψ(d(xn,xn+1))<γη∀n≥n0.
Thus, we can deduce that for each n∈ℕ with n≥n0+1(3.10)d(xn,xn+1)-d(A,B)≤ψ(d(xn-1,xn))⋅[K(xn-1,xn)-2d(A,B)]<γη⋅[d(xn-1,Txn-1)+d(xn,Sxn)-2d(A,B)]=γη⋅[d(xn-1,xn)+d(xn,xn+1)-2d(A,B)],
that is,
(3.11)d(xn,xn+1)-d(A,B)<γη1-γη⋅[d(xn-1,xn)-d(A,B)],
since γη∈[0,1/2). Therefore we get that for each n∈ℕ with n≥n0+1(3.12)d(xn,xn+1)-d(A,B)<γη1-γη⋅(d(xn-1,xn)-d(A,B))<(γη1-γη)2⋅(d(xn-2,xn-1)-d(A,B))<⋯<(γη1-γη)n-n0⋅(d(xn0,xn0+1)-d(A,B)).
Since γη∈[0,1/2), we get
(3.13)lim⁡n→∞d(xn,xn+1)-d(A,B)=0,
that is, limn→∞d(xn,xn+1)=d(A,B).Lemma 3.3.
LetA and B be nonempty closed subsets of a metric space (X,d). Suppose that the mappings T:A→B and S:B→A form an sMK-K-cyclic mapping between A and B. For a fixed point x0∈A, let x2n+1=Tx2n and x2n+2=Sx2n+1. Then the sequence {xn} is bounded.Proof.
It follows from Lemma3.2 that {d(x2n-1,x2n)} is convergent and hence it is bounded. Since T:A→B and S:B→A form an sMK-K-cyclic mapping between A and B, there is a stronger Meir-Keeler function ψ:ℝ+→[0,1/2) in X such that, for x0∈A and x2n-1∈B,
(3.14)d(x2n,Tx0)-d(A,B)=d(Sx2n-1,Tx0)-d(A,B)=d(Tx0,Sx2n-1)-d(A,B)≤ψ(d(x0,x2n-1))⋅[K(x0,x2n-1)-2d(A,B)],
where K(x0,x2n-1)=d(x0,Tx0)+d(x2n-1,Sx2n-1). So we get that
(3.15)d(x2n,Tx0)≤ψ(d(x0,x2n-1))[d(x0,Tx0)+d(x2n-1,x2n)]+[1-2ψ(d(x0,x2n-1))]d(A,B).
Therefore, the sequence {x2n} is bounded. Similarly, it can be shown that {x2n+1} is also bounded. So we complete the proof.Theorem 3.4.
LetA and B be nonempty closed subsets of a metric space. Let the mappings T:A→B and S:B→A form an sMK-K-cyclic mapping between A and B. For a fixed point x0∈A, let x2n+1=Tx2n and x2n+2=Sx2n+1. Suppose that the sequence {x2n} has a subsequence converging to some element x in A. Then, x is a best proximity point of T.Proof.
Suppose that a subsequence{x2nk} converges to x in A. It follows from Lemma 2.2 that d(x2nk-1,x2nk) converges to d(A,B). Since T:A→B and S:B→A form an sMK-K-cyclic mapping between A and B and taking into account (3.9), we have that for each 2nk∈ℕ with 2nk≥n0+1(3.16)d(x2nk,Tx)=d(Tx,x2nk)≤ψ(d(x,x2nk-1))⋅[K(x,x2nk-1)-2d(A,B)]+d(A,B)<γη⋅[K(x,x2nk-1)-2d(A,B)]+d(A,B),
where
(3.17)K(x,x2nk-1)=d(x,Tx)+d(x2nk-1,Sx2nk-1)=d(x,Tx)+d(x2nk-1,x2nk).
Following from (3.16) and (3.17), we obtain that for each 2nk∈ℕ with 2nk≥n0+1(3.18)d(A,B)≤d(x2nk,Tx)≤γη[d(x,Tx)+d(x2nk,x2nk-1)]+(1-2γη)d(A,B),
Letting k→∞. Then we conclude that d(x,Tx)=d(A,B), that is, x is a best proximity point of T.


## 4.   sMK-C-Cyclic Mappings

In this section, we prove the best proximity point theorems for the sMK-C-cyclic non-self mappings.Definition 4.1.
Let(X,d) be a metric space, and let A and B be nonempty subsets of X. A pair of mappings T:A→B and S:B→A is said to form an sMK-C-cyclic mapping between A and B if there is a stronger Meir-Keeler function ψ:ℝ+→[0,1/2) in X such that, for x∈A and y∈B,
(4.1)d(Tx,Sy)-d(A,B)≤ψ(d(x,y))⋅[C(x,y)-2d(A,B)],
where C(x,y)=d(x,Sy)+d(y,Tx).Lemma 4.2.
LetA and B be nonempty subsets of a metric space (X,d). Suppose that the mappings T:A→B and S:B→A form an sMK-C-cyclic mapping between A and B. Then there exists a sequence {xn} in X such that
(4.2)lim⁡n→∞d(xn,xn+1)=d(A,B).Proof.
Letx0∈A be given and let x2n+1=Tx2n and x2n+2=Sx2n+1 for each n∈ℕ∪{0}. Taking into account (4.1) and the definition of the stronger Meir-Keeler function ψ:ℝ+→[0,1/2), we have that n∈ℕ∪{0}(4.3)d(x2n+1,x2n+2)-d(A,B)=d(Tx2n,Sx2n+1)-d(A,B)≤ψ(d(x2n,x2n+1))⋅[C(x2n,x2n+1)-2d(A,B)],
where
(4.4)C(x2n,x2n+1)=d(x2n,Sx2n+1)+d(x2n+1,Tx2n)=d(x2n,x2n+2)+d(x2n+1,x2n+1)≤d(x2n,x2n+1)+d(x2n+1,x2n+2).
Taking into account (4.3) and (4.4), we conclude that
(4.5)d(x2n+1,x2n+2)<d(x2n,x2n+1).
Similarly, we can conclude that
(4.6)d(x2n,x2n+1)<d(x2n-1,x2n).
Generally, by (4.5) and (4.6), we have that for each n∈ℕ∪{0}(4.7)d(xn+1,xn+2)<d(xn,xn+1).
Thus the sequence {d(xn,xn+1)}n∈ℕ∪{0} is decreasing and bounded below and hence it is convergent. Let limn→∞d(xn,xn+1)=η≥0. Then there exists n0∈ℕ and δ>0 such that for all n∈ℕ with n≥n0(4.8)η≤d(xn,xn+1)<η+δ.
Taking into account (4.5) and the definition of stronger Meir-Keeler function ψ, corresponding to η use, there exists γη∈[0,1/2) such that
(4.9)ψ(d(xn,xn+1))<γη∀n≥n0.
Thus, we can deduce that for each n∈ℕ with n≥n0+1(4.10)d(xn,xn+1)-d(A,B)≤ψ(d(xn-1,xn))⋅[C(xn-1,xn)-2d(A,B)]<γη⋅[d(xn-1,Sxn)+d(xn,Txn-1)-2d(A,B)]=γη⋅[d(xn-1,xn+1)+d(xn,xn)-2d(A,B)]≤γη⋅[d(xn-1,xn)+d(xn,xn+1)+0-2d(A,B)],
that is,
(4.11)d(xn,xn+1)-d(A,B)<γη1-γη⋅[d(xn-1,xn)-d(A,B)],
since γη∈[0,1). Therefore we get that for each n∈ℕ with n≥n0+1(4.12)d(xn,xn+1)-d(A,B)<γη1-γη⋅(d(xn-1,xn)-d(A,B))<(γη1-γη)2⋅(d(xn-2,xn-1)-d(A,B))<⋯<(γη1-γη)n-n0⋅(d(xn0,xn0+1)-d(A,B)).
Since γη∈[0,1/2), we obtain that limn→∞d(xn,xn+1)=d(A,B).Lemma 4.3.
LetA and B be nonempty closed subsets of a metric space (X,d). Suppose that the mappings T:A→B and S:B→A form an sMK-C-cyclic mapping between A and B. For a fixed point x0∈A, let x2n+1=Tx2n and x2n+2=Sx2n+1. Then the sequence {xn} is bounded.Proof.
It follows from Lemma4.2 that {d(x2n-1,x2n)} is convergent and hence it is bounded. Since T:A→B and S:B→A form an sMK-C-cyclic mapping between A and B, there is a stronger Meir-Keeler function ψ:ℝ+→[0,1/2) in X such that for x0∈A and x2n-1∈B,
(4.13)d(x2n,Tx0)-d(A,B)=d(Sx2n-1,Tx0)-d(A,B)=d(Tx0,Sx2n-1)-d(A,B)≤ψ(d(x0,x2n-1))⋅[C(x0,x2n-1)-2d(A,B)],
where
(4.14)C(x0,x2n-1)=d(x0,Sx2n-1)+d(x2n-1,Tx0)=d(x0,x2n)+d(x2n-1,Tx0).
So we get that
(4.15)d(x2n,Tx0)≤ψ(d(x0,x2n-1))[d(x0,x2n)+d(x2n-1,Tx0)]+[1-2ψ(d(x0,x2n-1))]d(A,B)≤ψ(d(x0,x2n-1))[d(x2n-1,x2n)+2d(x2n,Tx0)+d(x0,Tx0)]+[1-2ψ(d(x0,x2n-1))]d(A,B).
Therefore, the sequence {x2n} is bounded. Similarly, it can be shown that {x2n+1} is also bounded. So we complete the proof.Theorem 4.4.
LetA and B be nonempty closed subsets of a metric space. Let the mappings T:A→B and S:B→A form an sMK-C-cyclic mapping between A and B. For a fixed point x0∈A, let x2n+1=Tx2n and x2n+2=Sx2n+1. Suppose that the sequence {x2n} has a subsequence converging to some element x in A. Then, x is a best proximity point of T.Proof.
Suppose that a subsequence{x2nk} converges to x in A. It follows from Lemma 2.2 that d(x2nk-1,x2nk) converges to d(A,B). Since T:A→B and S:B→A form an sMK-C-cyclic mapping between A and B and taking into account (4.9), we have that, for each 2nk∈ℕ with 2nk≥n0+1,
(4.16)d(x2nk,Tx)=d(Tx,x2nk)≤ψ(d(x,x2nk-1))⋅[C(x,x2nk-1)-2d(A,B)]+d(A,B)<γη⋅[C(x,x2nk-1)-2d(A,B)]+d(A,B),
where
(4.17)C(x,x2nk-1)=d(x,Sx2nk-1)+d(x2nk-1,Tx)=d(x,x2nk)+d(x2nk-1,Tx).
Following from (4.16) and (4.17), we obtain that
(4.18)d(x2nk,Tx)≤γη[d(x,x2nk)+d(x2nk,x2nk-1)+d(x2nk,Tx)-2d(A,B)]+d(A,B),
that is, we have that
(4.19)d(A,B)≤d(x2nk,Tx)≤γη1-γη⋅[d(x,x2nk)+d(x2nk,x2nk-1)]+[1-γη1-γη]⋅d(A,B).
Letting k→∞. Then we conclude that
(4.20)d(A,B)≤d(x,Tx)≤γη1-γη⋅[d(A,B)+0]+[1-γη1-γη]⋅d(A,B).
Therefore, d(x,Tx)=d(A,B), that is, x is a best proximity point of T.



---

*Source: 643729-2012-07-10.xml*