Next Article in Journal
A Versatile Integral in Physics and Astronomy and Fox’s H-Function
Next Article in Special Issue
Exact Solutions for a Class of Wick-Type Stochastic (3+1)-Dimensional Modified Benjamin–Bona–Mahony Equations
Previous Article in Journal
A Comprehensive Survey on Parallel Submanifolds in Riemannian and Pseudo-Riemannian Manifolds

Axioms 2019, 8(4), 121; https://doi.org/10.3390/axioms8040121

Article
Best Proximity Points for Monotone Relatively Nonexpansive Mappings in Ordered Banach Spaces
by Karim Chaira 1,†, Mustapha Kabil 1,†, Abdessamad Kamouss 1,*,† and Samih Lazaiz 2,†
1
Laboratory of Mathematics and Applications, Department of Mathematics, Faculty of Sciences and Technologies Mohammedia, University Hassan II Casablanca, Casablanca 20000, Morocco
2
Laboratory of Mathematical Analysis and Applications, Department of Mathematics, Faculty of Sciences Dhar El Mahraz, University Sidi Mohamed Ben Abdellah, Fes 30050, Morocco
*
Correspondence: [email protected]
These authors contributed equally to this work.
Received: 23 September 2019 / Accepted: 25 October 2019 / Published: 1 November 2019

## Abstract

:
In this paper, we give sufficient conditions to ensure the existence of the best proximity point of monotone relatively nonexpansive mappings defined on partially ordered Banach spaces. An example is given to illustrate our results.
Keywords:
best proximity point; fixed point; monotone mappings; relatively cyclic nonexpansive mappings; partially ordered Banach spaces

## 1. Introduction

Let X be a Banach space and $A , B$ a pair of nonempty subsets of X. A cyclic mapping on $A ∪ B$ is a mapping $T : A ∪ B → A ∪ B$ such that $T ( A ) ⊆ B$ and $T ( B ) ⊆ A$. In case $A ∩ B = ⌀$, T does not possess a fixed point, that is, a solution to the equation $T x = x$. Therefore, one can consider the following minimization problem:
$( P ) : find ( x , y ) ∈ A × B such that ∥ x − T x ∥ = ∥ y − T y ∥ = d i s t ( A , B ) .$
A point $x ∈ A ∪ B$ is a best proximity point of T if x is a solution of the minimization problem $( P )$. The best proximity point notion can be seen as a generalization of fixed point notion since most fixed point theorems can be derived as corollaries of best proximity point theorems.
The first significant result of best proximity points was studied in , using the proximal normal structure, the authors proved that every cyclic relatively nonexpansive mapping from $A ∪ B$ to itself has a best proximity point provided that A and B are weakly compact and convex. Furthermore, we find in  a similar result without invoking Zorn’s lemma, i.e., without proximal normal structure. Recently, Chaira and Lazaiz  gave an extension of this last result in modular spaces. For a recent account of the theory we refer the reader to [4,5,6]. We can also find in (, pp. 27–31) an application of a best proximity point theorem to a system of differential equations.
On the other hand, the combination of metric fixed point theory and order theory allows Ran and Reurings in  to give a Banach Contraction Principle in partially ordered metric spaces. As consequence, they solved a matrix equation. Nieto and Rodríguez-López , extended the Ran–Reurings theorem in order to obtain a periodic solution for a first-order ordinary differential equation with periodic boundary conditions.
Recently, many authors studied the existence of fixed points of monotone nonexpansive mappings defined on partially ordered Banach spaces (see for example [10,11,12,13,14,15]). Recall that a self mapping T on X is said to be monotone nonexpansive if T is monotone and , for every comparable elements x and y. We should mention that monotone nonexpansive mappings may not be continuous. The interested reader can consult the book of Carl and Heikkilä  for many applications of fixed point results of monotone mappings.
In this work, motivated by the recent study of a fixed point for monotone mappings, we investigate the existence of the best proximity point of monotone relatively nonexpansive mappings in partially ordered Banach spaces.

## 2. Preliminaries and Basic Results

Let $( X , ∥ . ∥ )$ be a Banach space endowed with a partial order ⪯. Throughout, we assume that the order intervals are closed and convex. Recall that an order interval is any of the subsets
$a , → = { x ∈ X ; a ⪯ x } , ← , a = { x ∈ X ; x ⪯ a }$
for any $a ∈ X$. As a direct consequence of this, the subset
$a , b = { x ∈ X ; a ⪯ x ⪯ b } = a , → ∩ ← , b$
is also closed and convex for any $a , b ∈ X$.
We will say that $x , y ∈ X$ are comparable whenever $x ⪯ y$ or $y ⪯ x$. The linear structure of X is assumed to be compatible with the order structure in the following sense:
(i)
$x ⪯ y$ implies $x + z ⪯ y + z$ for all $x , y , z ∈ X$;
(ii)
$x ⪯ y$ implies $α x ⪯ α y$ for all $x , y ∈ X$ and $α ∈ R +$.
Let us recall the definition of a uniformly convex Banach space.
Definition 1.
Let $( X , ∥ . ∥ )$ be a Banach space. We say that X is uniformly convex (in short, UC) if for every $ϵ > 0$ we have $δ ( ϵ ) > 0$ such that
$δ ( ϵ ) = i n f 1 − x + y 2 ; x ≤ 1 ; y ≤ 1 ; x − y ≥ ϵ .$
The function δ is known as the modulus of uniform convexity of X. Note that any UC Banach space is reflexive.
A sequence ${ x n } n ∈ N$ in a partially ordered set $( X , ⪯ )$ is said to be
(i)
monotone increasing if $x n ⪯ x n + 1$, for all $n ∈ N$;
(ii)
monotone decreasing if $x n + 1 ⪯ x n$, for all $n ∈ N$;
(iii)
monotone sequence if it is either monotone increasing or decreasing.
The following technical lemmas will be useful to establish the main results.
Lemma 1.
Let X be a Banach space endowed with a partial order ⪯. Assume that ${ x n }$ and ${ y n }$ are two sequences on X which are weakly convergent to $x ¯$ and $y ¯$ respectively and $x n ⪯ y n f o r a n y n ∈ N$, then
$x ¯ ⪯ y ¯ .$
Proof.
Note that the positive sequence ${ y n − x n } n$ converges weakly to $y ¯ − x ¯$. Since closed convex subsets are also weakly closed, the positive cone is weakly closed and so we conclude that $y ¯ − x ¯$ is positive. □
Lemma 2.
 Let ${ x n }$ be a bounded monotone sequence in X, and assume that X is reflexive. Then ${ x n }$ is weakly convergent.
Lemma 3.
 Let C be a nonempty closed convex subset of a UC Banach space $( X , ∥ . ∥ )$. Let $τ : C → 0 , ∞$ be a type function, i.e., there exists a bounded sequence $x n ∈ X$ such that
for every $x ∈ C$. Then τ has a unique minimum point $z ∈ C$ such that
$τ z = inf τ x ; x ∈ C = τ 0 .$
Moreover, if ${ z n }$ is a minimizing sequence in C, i.e., $lim n → ∞ τ ( z n ) = τ 0$, then ${ z n }$ converges strongly to z.
The norm $.$ of X is said to be monotone if
$u ⪯ v ⪯ w implies max w − v , v − u ≤ w − u ,$
for any $u , v , w ∈ X$. If the norm is monotone and $x n$ is monotone increasing (respectively, decreasing), then the sequence $x n − y$ is decreasing for any y such that $x n ⪯ y$ (respectively, $y ⪯ x n$), for any $n ∈ N$. In this case,
Recall that a mapping $T : X → X$ is said to be
(i)
monotone increasing if $x ⪯ y$ implies $T ( x ) ⪯ T ( y )$, for all $x , y ∈ X$;
(ii)
monotone decreasing if $x ⪯ y$ implies $T ( y ) ⪯ T ( x )$, for all $x , y ∈ X$.
We conclude this section by extending the concept of relatively cyclic nonexpansive mapping to monotone relatively cyclic nonexpansive mapping as follows:
Definition 2.
Let $( X , ∥ . ∥ , ⪯ )$ be a Banach space endowed with a partially order and $A , B$ a pair of nonempty subset of X. The mapping $T : A ∪ B → A ∪ B$ is said to be monotone increasing (respectively decreasing) relatively cyclic nonexpansive if
1.
$T ( A ) ⊆ B$ and $T ( B ) ⊆ A ,$
2.
T is monotone increasing (respectively decreasing),
3.
, whenever $x ∈ A$ and $y ∈ B$ are comparables.

## 3. Main Result

Throughout we assumed that $( X , ∥ . ∥ , ⪯ )$ is a Banach space endowed with a partial order for which order intervals are convex and closed and the linear structure of X is assumed to be compatible with the order structure.
The following result gives sufficient conditions to obtain a fixed point theorem for a monotone increasing relatively cyclic nonexpansive mapping.
Theorem 1.
Let $A , B$ be a nonempty bounded closed convex pair in a partially ordered Banach space $( X , ∥ . ∥ , ⪯ )$. Assume that $X , ∥ . ∥$ is UC. Let $T : A ∪ B → A ∪ B$ be a monotone increasing relatively cyclic nonexpansive mapping such that $x 0 ⪯ T x 0$ for some $x 0 ∈ A$, then $A ∩ B ≠ ∅$ and there exists $a ∗ ∈ A ∩ B$ such that $T a ∗ = a ∗$.
Proof.
We assume that $x 0 ⪯ T x 0$ and we define the sequence $x n$ by $x n + 1 = T x n$ for all $n ≥ 0$. By using the monotonicity of T we get
$x 0 ⪯ x 1 ⪯ ⋯ ⪯ x n ⪯ x n + 1 ⪯ ⋯ .$
Since A and B are bounded and closed, the sequence $x n$ is bounded increasing in the reflexive space X. By Lemma 2,
$x 2 n ⇀ w x ¯ 1 ∈ A and x 2 n + 1 ⇀ w x ¯ 2 ∈ B .$
By uniqueness of the weak limit, $x ¯ = x ¯ 1 = x ¯ 2$. We claim that $A ∩ B ≠ ∅$.
Let . It is clear that K is nonempty, closed and convex set. Since $x n$ is a bounded sequence in X, we can define the type function as follows
for any $x ∈ K$. From Lemma 3, it follows that there exists a unique $a ∗ ∈ K$ such that
$τ a ∗ = inf x ∈ K τ x .$
We have
Since $x n − 1 ⪯ a ∗$ and T is monotone relatively cyclic nonexpansive mapping,
Hence, $τ T a ∗ = τ a ∗$. Thus $T a ∗ = a ∗$, which completes the proof. □
If $B = A$, we get the next result for a monotone nonexpansive mapping.
Corollary 1.
Let A be a nonempty bounded closed convex set in a partially ordered Banach space $( X , ∥ . ∥ , ⪯ )$. Let $T : A → A$ be a monotone increasing nonexpansive mapping. Assume that $X , ∥ . ∥$ is UC and there exists $x 0 ∈ A$ such that $x 0 ⪯ T x 0$, then there exists $a ∗ ∈ A$ such that $T a ∗ = a ∗$.
Now let $( A 0 ⪯ , B 0 ⪯ )$ denotes the pair obtained from $( A , B )$ upon setting
Lemma 4.
Let $A , B$ be a nonempty bounded closed convex pair in a partially ordered reflexive Banach space $( X , ∥ . ∥ , ⪯ )$. Then,
(i)
$A 0 ⪯ ≠ ∅$ if and only if $B 0 ⪯ ≠ ∅$;
(ii)
$d i s t A 0 ⪯ , B 0 ⪯ = d i s t A , B$;
(iii)
$A 0 ⪯ , B 0 ⪯$ is a closed pair;
(iv)
$A 0 ⪯ , B 0 ⪯$ is a convex pair.
Proof.
Using the definitions of $A 0 ⪯$ and $B 0 ⪯$, we can easily derive $( i )$ and $( i i )$.
(iii)
Let ${ x n } ⊂ A 0 ⪯$ be a sequence which converges to some $x ¯$ in A. Then there exists a sequence ${ y n } ⊂ B$ such that
$∥ x n − y n ∥ = dist ( A , B ) and x n ⪯ y n .$
Since B is closed and bounded in a reflexive Banach space, there exists a subsequence ${ y φ ( n ) }$ of ${ y n }$ such that $y φ ( n ) ⇀ w y ¯ ∈ B$. From Lemma 1, it follows that $x ¯ ⪯ y ¯$. On the other hand,
Therefore, we have $x ¯ ∈ A 0 ⪯$, and hence, $A 0 ⪯$ is closed. By the same arguments we get that $B 0 ⪯$ is also closed.
(iv)
Let x and $x ′$ in $A 0 ⪯$. Then there exist y and $y ′$ in B such that
${ ∥ x − y ∥ = dist ( A , B ) and x ⪯ y , ∥ x ′ − y ′ ∥ = dist ( A , B ) and x ′ ⪯ y ′ .$
By using the fact that the linear structure of X is compatible with the order structure, we get for any $t ∈ [ 0 , 1 ]$
$∥ t x + ( 1 − t ) x ′ − t y − ( 1 − t ) y ′ ∥ = ∥ t ( x − y ) + ( 1 − t ) ( x ′ − y ′ ) ∥ ≤ t ∥ x − y ∥ + ( 1 − t ) ∥ x ′ − y ′ ∥ = d i s t ( A , B ) .$
This implies that $t x + ( 1 − t ) x ′ ∈ A 0 ⪯$. It follows that $A 0 ⪯$ is convex, as claimed. Similarly we prove that $B 0 ⪯$ is also convex. □
Remark 1.
Note that if T is a monotone decreasing relatively cyclic nonexpansive mapping, we have $T A 0 ⪯ ⊂ B 0 ⪯$ and $T B 0 ⪯ ⊂ A 0 ⪯$. Indeed, let $x ∈ A 0 ⪯$ then there exists $y ∈ B$ such that
$∥ x − y ∥ = d i s t ( A , B ) a n d x ⪯ y .$
Thus,
This implies $T x ∈ B 0 ⪯$. Consequently $T A 0 ⪯ ⊂ B 0 ⪯$.
For the sake of simplicity, we use the following notation
$A T = ( x 0 , x 0 ′ ) ∈ A × A ; x 0 ⪯ T x 0 ′ ; ∥ x 0 − T x 0 ′ ∥ = d i s t A , B .$
The next lemma gives sufficient conditions such that $A T$ is nonempty.
Lemma 5.
Let $A , B$ be a nonempty bounded closed convex pair in a partially ordered Banach space $( X , ∥ . ∥ , ⪯ )$ such that $A 0 ⪯$ is nonempty. Let $T : A ∪ B → A ∪ B$ be a monotone relatively cyclic nonexpansive mapping. Then $A T$ is nonempty.
Proof.
Suppose that T is a monotone decreasing relatively cyclic nonexpansive mapping. Since $A 0 ⪯ ≠ ∅$, we can find a $x 0 ′$ in $A 0 ⪯$ such that there exists an $y ∈ B ∩ x 0 ′ , →$ satisfying $∥ x 0 ′ − y ∥ = d i s t A , B$.
Since $x 0 ′ ⪯ y$ and T is monotone decreasing relatively cyclic nonexpansive mapping, $T y ⪯ T x 0 ′$ and $∥ T x 0 ′ − T y ∥ ≤ ∥ x 0 ′ − y ∥ = d i s t A , B$, give that $T x 0 ′ ∈ B 0 ⪯$.
Next, for $T x 0 ′$ there exists an element $x 0 ∈ A 0 ⪯$ such that
$x 0 ⪯ T x 0 ′ and ∥ x 0 − T x 0 ′ ∥ = d i s t A , B .$
Now, suppose that T is a monotone increasing relatively cyclic nonexpansive mapping. Since $A 0 ⪯ ≠ ∅$, we can find a x in $A 0 ⪯$ such that there exists an $y ∈ B 0 ⪯$ satisfying $x ⪯ y$ and $∥ x − y ∥ = d i s t A , B$.
Since T is monotone increasing, $T x ⪯ T y$ and
Take $x 0 = T 2 x ∈ A$ and $x 0 ′ = T y ∈ A$. We have clearly,
$x 0 ⪯ T x 0 ′ and ∥ x 0 − T x 0 ′ ∥ = d i s t A , B .$
Thus $A T ≠ ⌀$. □
In the following, we give a best proximity result for monotone increasing relatively cyclic nonexpansive mapping.
Theorem 2.
Let $X , . , ⪯$ be a partially ordered Banach space. Assume that $X , .$ is UC. Let $A , B$ be a nonempty bounded closed convex pair in X. Let $T : A ∪ B → A ∪ B$ be a monotone increasing relatively cyclic nonexpansive mapping. Assume that T is weakly sequentially continuous, the norm $.$ of X is monotone and there exists $x 0 , x 0 ′ ∈ A T$ such that $x 0 ⪯ x 0 ′ ⪯ T 2 x 0$ then there exist $x ¯ ∈ A$ and $y ¯ ∈ B$ such that $x ¯ − T x ¯ = y ¯ − T y ¯ = d i s t A , B$.
Proof.
Suppose that there exists $x 0 , x 0 ′ ∈ A × A$ such that
$x 0 − T x 0 ′ = d i s t A , B and x 0 ⪯ x 0 ′ ⪯ T 2 x 0 .$
Let ${ x n }$ and ${ y n }$ be two sequences defined as follows:
Note that, since $x 0 ⪯ T x 0 ′$ we get $T 2 n x 0 ⪯ T 2 n + 1 x 0 ′$ for all $n ≥ 0$, that is, $x n ⪯ y n$ for all $n ≥ 0$.
Since T is monotone increasing relatively cyclic nonexpansive mapping, we get
$x n − y n = T 2 n x 0 − T 2 n + 1 x 0 ′ ≤ x 0 − T x 0 ′ = d i s t A , B ,$
that is, $x n − y n = d i s t A , B ,$ for all $n ∈ N$.
Since $x 0 ⪯ T 2 x 0$, $x 1 = T 2 x 0 ⪯ T 4 x 0 = x 2$ and by induction on n, we can get
In the same manner, we get
Since ${ x n }$ and ${ y n }$ are bounded increasing sequences in reflexive space, we get from Lemma 2, $x n ⇀ w x ¯$ and $y n ⇀ w y ¯$.
Note that $x ¯ = sup x n ; n ∈ N$ and $y ¯ = sup y n ; n ∈ N$.
Let and define the type function $τ : K → 0 , ∞$ generated by the sequence ${ x n }$, that is,
for $y ∈ K$. Using the fact that $τ$ is increasing function, we get
$τ y ¯ = inf y ∈ K τ y .$
Indeed, let $z 1 , z 2 ∈ K$ such that $z 1 ⪯ z 2$ then for all $n ∈ N$ we have
$x n ⪯ y n ⪯ z 1 ⪯ z 2 .$
Using the fact that the norm $.$ is monotone, we get
$x n − z 1 ≤ x n − z 2 ,$
hence,
$τ ( z 1 ) ≤ τ ( z 2 ) .$
From Lemma 3, it follows that there exists a unique $b ∗ ∈ K$ such that:
$τ b ∗ = inf y ∈ K τ y .$
Since $y ¯ = sup y n ; n ∈ N$ and $b ∗ ∈ K$, $y ¯ ⪯ b ∗$, that is, $τ ( y ¯ ) ⪯ τ ( b ∗ )$.
Thus, $τ ( y ¯ ) = τ ( b ∗ )$, i.e., $y ¯ = b ∗$.
We have also
hence, $T 2 y ¯ = y ¯$.
Furthermore, T is weakly sequentially continuous then $T x n ⇀ w T x ¯$ and $T y n ⇀ w T y ¯$. By the lower semi continuity of the norm, we get
Let ${ x n ′ }$ be a sequence defined by $x n ′ = T 2 n x 0 ′$, for all $n ∈ N .$ We have
$y n = T 2 n + 1 x 0 ′ = T ( T 2 n x 0 ′ ) = T x n ′ .$
Since $x 0 ′ ⪯ T 2 x 0 ′$, $T 2 n x 0 ′ ⪯ T 2 n + 2 x 0 ′$, that is, $x n ′ ⪯ x n + 1 ′$, for all $n ∈ N$. Since ${ x n ′ }$ is bounded increasing sequence in reflexive space, we get by using Lemma 2 $x n ′ ⇀ w x ′ ¯$. Since T is weakly sequentially continuous, $y n = T x n ′ ⇀ w T x ′ ¯$. By the uniqueness of the limit, $T x ′ ¯ = y ¯$, that is,
$x ¯ − T x ′ ¯ = d i s t A , B .$
Note that $x 0 ⪯ x 0 ′ ⪯ T 2 x 0 ⪯ T 2 x 0 ′$, that is, $x 0 ⪯ x 0 ′ ⪯ x 1 ⪯ x 1 ′$. Then, by induction on n, we can get
$x n ⪯ x n ′ ⪯ x n + 1 ⪯ x n + 1 ′ .$
Define the sequence ${ z n }$ as follows
Since ${ z n }$ is bounded increasing sequence in reflexive space, by using Lemma 2, we get $z n ⇀ w z ¯$. In particular, the subsequences ${ z 2 n }$ and ${ z 2 n + 1 }$ also converge to $z ¯$, that is, $z ¯ = x ¯ = x ¯ ′$. Thus, by using (3) we get $x ¯ − T x ¯ = d i s t A , B$. □
In the following, we give a best proximity result for monotone decreasing relatively cyclic nonexpansive mapping without assuming the monotonicity of the norm $.$.
Theorem 3.
Let $A , B$ be a nonempty bounded closed convex pair in a partially ordered Banach space $( X , ∥ . ∥ , ⪯ )$. Let $T : A ∪ B → A ∪ B$ be a monotone decreasing relatively cyclic nonexpansive mapping. Assume that $X , ∥ . ∥$ is UC, T is weakly sequentially continuous and there exists $x 0 , x 0 ′ ∈ A T$ such that $x 0 ′ ⪯ x 0 ⪯ T 2 x 0 ′$, then there exists $( x ¯ , y ¯ ) ∈ A × B$ such that
Proof.
Let $x 0 , x 0 ′ ∈ A T$ such that
$x 0 ′ ⪯ x 0 ⪯ T 2 x 0 ′ .$
If $A ∩ B ≠ ∅$ then $x 0 = T x 0 ′$ by Lemma 5. Since $x 0 ′ ⪯ x 0 ⪯ T 2 x 0 ′$ and T is decreasing, we get $x 0 ⪯ T x 0$ and $T x 0 ⪯ T x 0 ′ = x 0$. Thus, $T x 0 = x 0$.
If $A ∩ B = ∅$, then we consider the sequences ${ x n } a n d { z n } ⊂ A$ defined by
Since $x 0 ′ ⪯ x 0 ⪯ T 2 x 0 ′ = z 1$ and $T 2$ is a monotone increasing mapping, by induction on n, we get $T 2 n x 0 ′ ⪯ T 2 n x 0 ⪯ T 2 n + 2 x 0 ′$, which implies
$z n ⪯ x n ⪯ z n + 1 ,$
for all $n ≥ 0$. Also, since $x 0 ⪯ T x 0 ′ = T z 0$ and $T 2$ is a monotone increasing mapping, by induction on n, we get $T 2 n x 0 ⪯ T ( T 2 n x 0 ′ )$, which implies
$x n ⪯ T z n ,$
for all $n ≥ 0$. The sequences ${ x n }$ and ${ z n }$ are increasing. Indeed, $x 0 ⪯ T 2 x 0 ′ ⪯ T 2 x 0$ implies by induction on n that $T 2 n x 0 ⪯ T 2 n + 2 x 0$. Thus,
$x n ⪯ x n + 1 ,$
for all $n ∈ N .$ Since ${ x n }$ and ${ z n }$ are bounded increasing sequences in a reflexive space, we get by Lemma 2, $x n ⇀ w x ¯$ and $z n ⇀ w z ¯$. Using the fact that T is weakly sequentially continuous we conclude that $T z n ⇀ w T z ¯$.
Since T is relatively cyclic nonexpansive mapping, we get
$∥ x n − T z n ∥ = ∥ T 2 x n − 1 − T 3 z n − 1 ∥ ≤ ∥ T x n − 1 − T 2 z n − 1 ∥ ≤ ∥ x n − 1 − T z n − 1 ∥ ,$
for all n in $N ∗$. By induction on n, we prove that
for all $n ∈ N$. By the lower semi continuity of the norm, we get
It follows from the Lemma 1 and the inequality (4) that $z ¯ ⪯ x ¯ ⪯ z ¯$, and hence, $z ¯ = x ¯$.
Finally, by Equation (6) it follows that
Let $y ¯ = T x ¯$, then by inequality (5) and Lemma 1 we have $x ¯ ⪯ y ¯$ and
So the proof is complete.
We claim that $T 2 x ¯ = x ¯$ and $T 2 y ¯ = y ¯$. Indeed, since $x n + 1 = T 2 x n ⇀ w x ¯$ and $x n + 1 = T 2 x n ⇀ w T 2 x ¯$, the uniqueness of the weak limit implies that $T 2 x ¯ = x ¯$. Furthermore, $T x ¯ = y ¯$ then
$T 2 x ¯ = x ¯ ⟹ T ( T 2 x ¯ ) = T x ¯ ⟹ T 2 ( T x ¯ ) = y ¯ ⟹ T 2 y ¯ = y ¯ .$
□
The following example illustrates Theorem 3.
Example 1.
Consider $X = R 2$ with usual norm and the partially order defined by:
$( a , b ) ⪯ ( c , d ) i f f ( a ≤ c a n d b ≤ d ) ,$
for any $( a , b )$, $( c , d )$ in $R 2$. Suppose that
$A = ( x , 0 ) ∈ R 2 ; x ∈ [ 0 , 2 ] a n d$
$B = ( x , 1 ) ∈ R 2 ; x ∈ [ 2 , 4 ] ,$
we can show that $d i s t ( A , B ) = 1$, $A 0 ⪯ = { ( 2 , 0 ) }$ and $B 0 ⪯ = { ( 2 , 1 ) }$. Suppose that a mapping $T : A ∪ B → A ∪ B$ is defined as follows
${ T ( x , 0 ) = ( 2 , 1 ) ; f o r a l l ( x , 0 ) ∈ A T ( x , 1 ) = ( 4 − x , 0 ) ; f o r a l l ( x , 1 ) ∈ B .$
We have $T ( A ) ⊂ B$, $T ( B ) ⊂ A$ and T is a decreasing mapping. Also, for any $( x , 0 ) , ( x ′ , 1 ) ∈ A × B$ we have $( x , 0 ) ⪯ ( x ′ , 1 )$ and
$∥ T ( x , 0 ) − T ( x ′ , 1 ) ∥ = ∥ ( 2 , 1 ) − ( 4 − x ′ , 0 ) ∥ = ( x ′ − 2 ) 2 + 1 ∥ ( x , 0 ) − ( x ′ , 1 ) ∥ = ∥ ( x ′ − x , 1 ) ∥ = ( x ′ − x ) 2 + 1 ,$
thus, $∥ T ( x , 0 ) − T ( x ′ , 1 ) ∥ ≤ ∥ ( x , 0 ) − ( x ′ , 1 ) ∥$. Then T is a monotone decreasing relatively cyclic nonexpansive mapping.
If we choose $x 0 ′ = ( 0 , 0 )$ and $x 0 = ( 2 , 0 )$ in A we get
$x 0 ⪯ T x 0 ′ , ∥ x 0 − T x 0 ′ ∥ = d i s t A , B a n d x 0 ′ ⪯ x 0 ⪯ T 2 x 0 ′ .$
Then there exist $x ¯ = ( 2 , 0 ) ∈ A$ and $y ¯ = ( 2 , 1 ) ∈ B$ such that $T 2 x ¯ = x ¯$, $T 2 y ¯ = y ¯$ and

## Author Contributions

The authors contributed equally to this work.

## Funding

This research received no external funding.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Eldred, A.; Kirk, W.; Veeramani, P. Proximal normal structure and relatively nonexpansive mappings. Studia Math. 2005, 3, 283–293. [Google Scholar] [CrossRef]
2. Sankar Raj, V.; Veeramani, P. Best proximity pair theorems for relatively nonexpansive mappings. Appl. Gen. Topol. 2009, 10, 21–28. [Google Scholar] [CrossRef]
3. Chaira, K.; Lazaiz, S. Best proximity point theorems for cyclic relatively nonexpansive mappings in modular spaces. Abstr. Appl. Anal. 2018, 2018, 8084712. [Google Scholar] [CrossRef]
4. Espinola, R. A new approach to relatively nonexpansive mappings. Proc. Am. Math. Soc. 2008, 136, 1987–1995. [Google Scholar] [CrossRef]
5. Ggabeleh, M. Cyclic relatively nonexpansive mappings in convex metric spaces. Miskolc Math. Notes 2015, 16, 133–144. [Google Scholar] [CrossRef]
6. Chaira, K.; Lazaiz, S. Best proximity pair and fixed point results for noncyclic mappings in modular spaces. Arab J. Math. Sci. 2018, 24, 147–165. [Google Scholar] [CrossRef]
7. Veeramani, P.; Rajesh, S. Best proximity points. In Nonlinear Analysis: Approximation Theory, Optimization and Applications, 3rd ed.; Ansari, Q.H., Ed.; Springer Science + Business Media: New York, NY, USA, 2014; pp. 1–32. ISBN 978-81-322-1882-1. [Google Scholar]
8. Ran, A.C.M.; Reurings, M.C.B. A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 2004, 132, 1435–1443. [Google Scholar] [CrossRef]
9. Nieto, J.J.; Rodríguez-López, R. Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22, 223–239. [Google Scholar] [CrossRef]
10. Zhang, X. Fixed point theorems of multivalued monotone mappings in ordered metric spaces. Appl. Math. Lett. 2010, 23, 235–240. [Google Scholar] [CrossRef]
11. Bachar, M.; Khamsi, M.A. Fixed points of monotone mappings and application to integral equations. Fixed Point Theory Appl. 2015, 2015, 110. [Google Scholar] [CrossRef]
12. Pandey, R.; Pant, R.; Al-Rawashdeh, A. Fixed point results for a class of monotone nonexpansive type mappings in hyperbolic spaces. J. Funct. Spaces 2018, 2018, 5850181. [Google Scholar] [CrossRef]
13. Alfuraidan, M.R.; Jorquera, E.D.; Khamsi, M.A. Fixed point theorems for monotone Caristi inward mappings. Numer. Funct. Anal. Optim. 2018, 39, 1092–1101. [Google Scholar] [CrossRef]
14. Van Dung, N.; Hieu, N.T.; Radojević, S. Fixed point theorems for g-monotone maps on partially ordered S-metric spaces. Filomat 2014, 28, 1885–1898. [Google Scholar] [CrossRef]
15. Dehaish, B.A.B.; Khamsi, M.A. Mann iteration process for monotone nonexpansive mappings. Fixed Point Theory Appl. 2015, 2015, 177. [Google Scholar] [CrossRef]
16. Carl, S.; Heikkilä, S. Fixed Point Theory in Ordered Sets and Applications: From Differential and Integral Equations to Game Theory, 1st ed.; Springer Science + Business Media: New York, NY, USA, 2011; ISBN 978-1-4419-7584-3. [Google Scholar]
17. Alfuraidan, M.R.; Khamsi, M.A. Fibonacci Mann iteration for monotone asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 2017, 96, 307–316. [Google Scholar] [CrossRef]
18. Alfuraidan, M.; Khamsi, M.A. A fixed point theorem for monotone asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 2018, 146, 2451–2456. [Google Scholar] [CrossRef]