Open Access

Fixed points of monotone nonexpansive mappings with a graph

Fixed Point Theory and Applications20152015:49

Received: 5 January 2015

Accepted: 19 March 2015

Published: 9 April 2015


In this paper, we study the existence of fixed points of monotone nonexpansive mappings defined in Banach spaces endowed with a graph. This work is a continuity of the previous results of Ran and Reurings, Nieto et al., and Jachimsky done for contraction mappings defined in metric spaces endowed with a graph.


Banach spacedirected graphfixed pointmonotone nonexpansive mappings



1 Introduction

Banach’s contraction principle [1] is remarkable in its simplicity, yet it is perhaps the most widely applied fixed point theorem in all of analysis. This is because the contractive condition on the mapping is simple and easy to test, because it requires only a complete metric space for its setting, and because it is a powerful result with a wide range of applications, including iterative methods for solving linear, nonlinear, differential, integral, and difference equations. Due to its applications in mathematics and other related disciplines, the Banach contraction principle has been generalized in many directions. Recently a version of this theorem was given in partially ordered metric spaces [2, 3] and in metric spaces endowed with a graph [46].

In this paper, we study the case of nonexpansive mappings defined in Banach spaces endowed with a graph. Nonexpansive mappings are those which have Lipschitz constant equal to 1. The fixed point theory for such mappings is rich and varied. It finds many applications in nonlinear functional analysis [7]. It is worth mentioning that such investigation is, to the best of our knowledge, new and was never carried out. This work was inspired by [8].

2 Graph basic definitions

The terminology of graph theory instead of partial ordering gives a wider picture and yields interesting generalization of the Banach contraction principle. In this section, we give the basic graph theory definitions and notations which will be used throughout.

Let G be a directed graph (digraph) with a set of vertices \(V(G)\) and a set of edges \(E(G)\) containing all the loops, i.e., \((x,x) \in E(G)\) for any \(x \in V(G)\). We also assume that G has no parallel edges (arcs), and so we can identify G with the pair \((V(G),E(G))\). Our graph theory notations and terminology are standard and can be found in all graph theory books such as [9] and [10]. Moreover, we may treat G as a weighted graph (see [10], p.309]) by assigning to each edge the distance between its vertices. By \(G^{-1}\) we denote the conversion of a graph G, i.e., the graph obtained from G by reversing the direction of edges. Thus we have
$$E\bigl(G^{-1}\bigr)=\bigl\{ (y,x) \mid (x,y)\in E(G)\bigr\} . $$
A digraph G is called an oriented graph if whenever \((u,v)\in E(G)\), then \((v,u)\notin E(G)\). The letter \(\widetilde{G}\) denotes the undirected graph obtained from G by ignoring the direction of edges. Actually, it will be more convenient for us to treat \(\widetilde{G}\) as a directed graph for which the set of its edges is symmetric. Under this convention,
$$E(\widetilde{G})=E(G)\cup E\bigl(G^{-1}\bigr). $$
We call \((V',E')\) a subgraph of G if \(V'\subseteq V(G)\), \(E'\subseteq E(G)\) and for any edge \((x,y)\in E'\), \(x, y\in V'\).
If x and y are vertices in a graph G, then a (directed) path in G from x to y of length N is a sequence \((x_{i})_{i=1}^{i=N}\) of \(N + 1\) vertices such that \(x_{0} = x\), \(x_{N} = y\) and \((x_{n-1},x_{n})\in E(G)\) for \(i = 1,\ldots,N\). A graph G is connected if there is a directed path between any two vertices. G is weakly connected if \(\widetilde{G}\) is connected. If G is such that \(E(G)\) is symmetric and x is a vertex in G, then the subgraph \(G_{x}\) consisting of all edges and vertices which are contained in some path beginning at x is called the component of G containing x. In this case \(V(G_{x}) =[x]_{G}\), where \([x]_{G}\) is the equivalence class of the following relation defined on \(V(G)\) by the rule:
$$ y \, {\mathcal{R}}\, z \mbox{ if there is a (directed) path in } G \mbox{ from } y \mbox{ to } z . $$
Clearly \(G_{x}\) is connected.

3 Monotone nonexpansive mappings

Throughout we assume that \((X, \|\cdot\|)\) is a Banach space and τ is a Hausdorff topological vector space topology on X which is weaker than the norm topology. Let C be a nonempty, convex and bounded subset of X not reduced to one point. Let G be a directed graph such that \(V(G)=C\) and \(E(G)\supseteq\Delta\). Assume that G-intervals are convex. Recall that a G-interval is any of the subsets \([a,{\rightarrow}) = \{x \in C; (a,x)\in E(G) \}\) and \(({\leftarrow} ,b] = \{x \in C; (x,b)\in E(G)\}\) for any \(a,b \in C\).

Definition 3.1

Let C be a nonempty subset of X. A mapping \(T: C \rightarrow C\) is called
  1. (1)

    G-monotone if \((T(x),T(y))\in E(G)\) whenever \((x,y)\in E(G)\) for any \(x, y \in C\);

  2. (2)
    G-monotone nonexpansive if T is G-monotone and
    $$\bigl\Vert T(x)-T(y)\bigr\Vert \leq\|x-y\|,\quad \mbox{whenever }(x,y)\in E(G) $$
    for any \(x, y \in C\).
The point \(x \in C\) is called a fixed point of T if \(T(x) = x\). The set of fixed points of T will be denoted by \(\operatorname{Fix}(T)\).

Remark 3.1

For examples of metric spaces endowed with a graph and G-monotone mappings which are Lipschitzian with respect to the graph, we refer the reader to the examples found in [5].

Let \(T: C \rightarrow C\) be a G-monotone nonexpansive mapping. Fix \(\lambda\in(0,1)\). Let \(x_{0} \in C\) be such that \((x_{0}, T(x_{0}))\in E(G)\). Define \(x_{1} = \lambda x_{0} + (1-\lambda) T(x_{0})\). Since the set \([x_{0},T(x_{0})]= [x_{0},{\rightarrow}) \cap({\leftarrow}, T(x_{0})]\) is convex, then \(x_{1} \in[x_{0}, T(x_{0})]\), i.e., \((x_{0} , x_{1})\) and \((x_{1}, T(x_{0}))\) are in \(E(G)\). Since T is G-monotone nonexpansive, we get \((T(x_{0}) , T(x_{1}))\in E(G)\) and
$$\bigl\Vert T(x_{1}) - T(x_{0})\bigr\Vert \leq \|x_{1} - x_{0}\|. $$
By induction we construct a sequence \(\{x_{n}\}\) in C such that the following hold for any \(n \geq0\):
  1. (i)

    \(x_{n+1} = \lambda x_{n} + (1-\lambda) T(x_{n})\),

  2. (ii)

    \((x_{n}, x_{n+1})\), \((x_{n}, T(x_{n}))\) and \((T(x_{n}),T(x_{n+1}))\) are in \(E(G)\),

  3. (iii)

    \(\|T(x_{n+1}) - T(x_{n})\| \leq\|x_{n+1} - x_{n}\|\).

Such a sequence is known as Krasnoselskii sequence [11] (see also [1214]). The following result is found in [15, 16].

Proposition 3.1

Under the above assumptions, we have
$$(1+n \lambda) \bigl\Vert T(x_{i}) - x_{i}\bigr\Vert \leq \bigl\Vert T(x_{i+n}) - x_{i}\bigr\Vert + (1-\lambda )^{-n} \bigl(\bigl\Vert T(x_{i}) - x_{i}\bigr\Vert - \bigl\Vert T(x_{i+n}) - x_{i+n}\bigr\Vert \bigr) $$
for any \(i, n \in\mathbb{N}\). This inequality implies
$$\lim_{n \rightarrow+\infty} \bigl\Vert x_{n} - T(x_{n}) \bigr\Vert = 0, $$
i.e., \(\{x_{n}\}\) is an approximate fixed point sequence of T.
The first part of this proposition is easy to prove via an induction argument on the index i. As for the second part, note that \(\{\|x_{n} - T(x_{n})\|\}\) is decreasing. Indeed we have \(x_{n+1} - x_{n} = (1-\lambda )(T(x_{n})-x_{n})\) for any \(n \geq0\). Therefore \(\{\|x_{n} - T(x_{n})\|\}\) is decreasing if and only if \(\{\|x_{n+1} - x_{n}\|\}\) is decreasing, which holds since
$$\|x_{n+2} - x_{n+1}\| \leq \lambda\|x_{n+1}-x_{n} \| + (1-\lambda)\bigl\Vert T(x_{n+1}) - T(x_{n})\bigr\Vert \leq\|x_{n+1}-x_{n}\| $$
for any \(n \geq0\). So if we assume that \(\lim_{n \rightarrow+\infty} \|x_{n} - T(x_{n})\| = R > 0\), then we let \(i \rightarrow+\infty\) in the main inequality to obtain
$$(1+n \lambda) R \leq\delta(C) $$
for any \(n \in\mathbb{N}\), where \(\delta(C) = \operatorname{diam}(C)\). Obviously this is a contradiction since both λ and R are not equal to 0.

Remark 3.2

We may let λ change with \(n \in\mathbb{N}\). In this case the sequence \(\{x_{n}\}\) is defined by
$$x_{n+1} = \lambda_{n} x_{n} + (1- \lambda_{n}) T(x_{n}), \quad n = 0,1,\ldots. $$
Under suitable assumptions on the sequence \(\{\lambda_{n}\}\), we will have the same conclusions as Proposition 3.1, see [17] for more details.

Before we state the main result of this paper, let us recall the definition of τ-Opial condition.

Definition 3.2

X is said to satisfy the τ-Opial condition if whenever any sequence \(\{y_{n}\}\) in X τ-converges to y, we have
$$\limsup_{n \rightarrow+\infty} \|y_{n} - y\| < \limsup _{n \rightarrow+\infty} \|y_{n} - z\| $$
for any \(z \in X\) such that \(z \neq y\).

Definition 3.3

The triple \((C, \|\cdot\|,G)\) has property (P) if and only if for any sequence \(\{x_{n}\}_{n\in\mathbb{N}}\) in C such that \((x_{n},x_{n+1})\in E(G)\) for any \(n\geq0\), and if a subsequence \(\{ x_{k_{n}}\}\) τ-converges to x, then \((x_{k_{n}},x)\in E(G)\) for all n.

Theorem 3.1

Let X be a Banach space which satisfies the τ-Opial condition. Let C be a bounded convex τ-compact nonempty subset of X not reduced to one point. Assume that \((C, \|\cdot\|,G)\) has property (P) and the G-intervals are convex. Let \(T: C \rightarrow C\) be a G-monotone nonexpansive mapping. Assume that there exists \(x_{0} \in C\) such that \((x_{0},T(x_{0}))\in E(G)\). Then T has a fixed point.


Consider the Krasnoselskii sequence \(\{x_{n}\}\), from Proposition 3.1, which starts at \(x_{0}\). Since C is τ-compact, then \(\{x_{n}\}\) will have a subsequence \(\{x_{k_{n}}\}\) which τ-converges to some point \(\omega\in C\). By properties (ii) and (P), we get \((x_{k_{n}},\omega)\in E(G)\) for any \(n \in\mathbb{N}\). Consider the type function
$$r(x) = \limsup_{n \rightarrow+\infty} \|x_{k_{n}} - x\|,\quad x \in C. $$
Then Proposition 3.1 implies
$$\lim_{n \rightarrow+\infty} \bigl\vert \|x_{k_{n}} - x\| -\bigl\Vert T(x_{k_{n}}) - x\bigr\Vert \bigr\vert \leq\lim_{n \rightarrow+\infty} \bigl\Vert x_{k_{n}} - T(x_{k_{n}}) \bigr\Vert = 0. $$
$$\limsup_{n \rightarrow+\infty} \bigl\Vert T(x_{k_{n}}) - x\bigr\Vert = \limsup_{n \rightarrow+\infty} \|x_{k_{n}} - x\|, $$
i.e., \(r(x) = \limsup_{n \rightarrow+\infty} \|T(x_{k_{n}}) - x\|\) for any \(x \in C\). In particular we have
$$r\bigl(T(\omega)\bigr) = \limsup_{n \rightarrow+\infty} \bigl\Vert T(x_{k_{n}}) - T(\omega )\bigr\Vert \leq\limsup_{n \rightarrow+\infty} \|x_{k_{n}} - \omega\| = r(\omega). $$
In fact we have \(r(T(x)) \leq r(x)\) for any \(x \in C\) which is an upper-bound of \(\{x_{k_{n}}\}\). Finally if X satisfies the τ-Opial condition, then we must have \(T(\omega) = \omega\), i.e., ω is a fixed point of T. □

Remark 3.3

The existence of \(x_{0}\in C\) such that \((x_{0},T(x_{0}))\in E(G)\) was crucial. Indeed, the Krasnoselskii sequence \(\{x_{n}\}\) will satisfy \((x_{n},x_{n+1})\in E(G)\) for every n. However, if \((T(x_{0}),x_{0})\in E(G)\) then we will have \((x_{n+1},x_{n})\in E(G)\) for every n. In this case, we need to revise property (P) into property (P) defined as follows:

The triple \((C, \|\cdot\|,G)\) has property (P) if and only if for any sequence \(\{x_{n}\}_{n\in\mathbb{N}}\) in C such that \((x_{n+1},x_{n})\in E(G)\) for any \(n\geq0\), and if a subsequence \(\{ x_{k_{n}}\}\) τ-converges to x, then \((x,x_{k_{n}})\in E(G)\) for all n.

The following results are direct consequences of Theorem 3.1.

Corollary 3.1

Let C be a bounded closed convex nonempty subset of \(l_{p}\), \(1 < p < +\infty\). Let τ be the weak topology. Let G be the digraph defined on \(l_{p}\) by \((\{\alpha_{n}\} ,\{\beta_{n}\})\in E(G)\) iff \(\alpha_{n} \leq\beta_{n}\) for any \(n \geq1\). Then any G-monotone nonexpansive mapping \(T: C \rightarrow C\) has a fixed point provided there exists a point \(x_{0} \in C\) such that \((x_{0},T(x_{0}))\in E(G)\) or \((T(x_{0}),x_{0})\in E(G)\).

Remark 3.4

The case of \(p=1\) is not interesting for the weak-topology since \(l_{1}\) is a Schur Banach space. But if we consider the weak-topology \(\sigma(l_{1}, c_{0})\) on \(l_{1}\) or the pointwise convergence topology, then \(l_{1}\) satisfies the weak-Opial condition. In this case we have a similar conclusion of Corollary 3.1 for \(l_{1}\).

Corollary 3.2

Let C be a bounded closed convex nonempty subset of \(L_{p}\), \(1 \leq p < +\infty\). Let τ be the almost everywhere convergence topology. Let G be the digraph defined on \(L_{p}\) by \((f , g)\in E(G)\) if and only if \(f(t) \leq g(t)\) almost everywhere. Assume that C is almost everywhere compact. Then any G-monotone nonexpansive mapping \(T: C \rightarrow C\) has a fixed point provided there exists a point \(f_{0} \in C\) such that \((f_{0},T(f_{0}))\in E(G)\) or \((T(f_{0}),f_{0})\in E(G)\).



The author acknowledges King Fahd University of Petroleum and Minerals for supporting this research. The author thanks the referees for their valuable suggestions including the reference [5].

Open Access This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.

Authors’ Affiliations

Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals


  1. Banach, S: Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 3, 133-181 (1922) MATHGoogle Scholar
  2. Nieto, JJ, Rodríguez-López, R: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 22, 223-239 (2005) View ArticleMATHMathSciNetGoogle Scholar
  3. Ran, ACM, Reurings, MCB: A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 132, 1435-1443 (2004) View ArticleMATHMathSciNetGoogle Scholar
  4. Alfuraidan, MR: Remarks on monotone multivalued mappings on a metric space with a graph. Preprint Google Scholar
  5. Bojor, F: Fixed point theorems for Reich type contractions on metric spaces with a graph. Nonlinear Anal. 75(9), 3895-3901 (2012) View ArticleMATHMathSciNetGoogle Scholar
  6. Jachymski, J: The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 136, 1359-1373 (2007) View ArticleMathSciNetGoogle Scholar
  7. Browder, FE: Nonexpansive nonlinear operators in a Banach space. Proc. Natl. Acad. Sci. USA 54, 1041-1044 (1965) View ArticleMATHMathSciNetGoogle Scholar
  8. Bachar, M, Khamsi, MA: Fixed points of monotone nonexpansive mappings. Preprint Google Scholar
  9. Diestel, R: Graph Theory. Springer, New York (2000) Google Scholar
  10. Johnsonbaugh, R: Discrete Mathematics. Prentice Hall, New York (1997) MATHGoogle Scholar
  11. Krasnoselskii, MA: Two observations about the method of successive approximations. Usp. Mat. Nauk 10, 123-127 (1955) MathSciNetGoogle Scholar
  12. Berinde, V: Iterative Approximation of Fixed Points, 2nd edn. Lecture Notes in Mathematics, vol. 1912. Springer, Berlin (2007) MATHGoogle Scholar
  13. Chidume, C: Geometric Properties of Banach Spaces and Nonlinear Iterations. Lecture Notes in Mathematics, vol. 1965. Springer, London (2009) MATHGoogle Scholar
  14. Ishikawa, S: Fixed points and iteration of a nonexpansive mapping in a Banach space. Proc. Am. Math. Soc. 59, 65-71 (1976) View ArticleMATHMathSciNetGoogle Scholar
  15. Goebel, K, Kirk, WA: Iteration processes for nonexpansive mappings. Contemp. Math. 21, 115-123 (1983) View ArticleMATHMathSciNetGoogle Scholar
  16. Goebel, K, Kirk, WA: Topics in Metric Fixed Point Theory. Cambridge Stud. Adv. Math., vol. 28. Cambridge University Press, Cambridge (1990) View ArticleMATHGoogle Scholar
  17. Kirk, WA: Fixed point theory for nonexpansive mappings II. In: Sine, RC (ed.) Fixed Points and Nonexpansive Mappings. Contemporary Mathematics, vol. 18, pp. 121-140 (1983) View ArticleGoogle Scholar


© Alfuraidan; licensee Springer. 2015