00 Fixed Point Theory and Applications
a SpringerOpen Journal
RESEARCH
Open Access
Coincidence point theorems for weak graph preserving multi-valued mapping
Aniruth Phon-on, Areeyuth Sama-Ae*, Nifatamah Makaje, Pakwan Riyapan and Saofee Busaman
"Correspondence: sassaare@gmail.com Department of Mathematics and Computer Science, Faculty of Science and Technology, Prince of Songkla University, Pattani Campus, Pattani, 94000, Thailand
Abstract
In this paper, we prove some coincidence and fixed point theorems for a new type of multi-valued weak G-contraction mapping with compact values. The results of this paper extend and generalize several known results from a complete metric space endowed with a graph. Some examples are given to illustrate the usability of our results.
MSC: 47H04;47H10
Keywords: fixed point theorem; multi-valued mapping; weak graph preserving; partially ordered set
ringer
1 Introduction
The classical contraction mapping principle of Banach states that if (X, d) is a complete metric space and f : X ^ X is a contraction mapping, i.e., d(f (x),f (y)) < ad(x,y) for all x,y e X, where a e [0,1), then f has a unique fixed point. Banach fixed point theorem plays an important role in several branches of mathematics. For instance, it has been used to study the existence of solutions of nonlinear integral equations, system of linear equations, nonlinear differential equations in Banach spaces and to prove the convergence of algorithms in computational mathematics. Because of its usefulness for mathematical theory, Banach fixed point theorem has been extended in many directions; see [1-11]. Several well-known fixed point theorems of single-valued mappings such as Banach and Schauder have been extended to multi-valued mappings in Banach spaces.
Fixed point theory of multi-valued mappings plays an important role in control theory, optimization, partial differential equations, economics, and applied science. For a metric space (X, d), we let CB(X) and Comp(X) be the set of all nonempty closed bounded subsets and the set of all nonempty compact subsets of X, respectively. A point x in X is a fixed point of a multi-valued mapping T: X ^ 2X if x is in Tx.
Nadler [12] has proved a multi-valued version of the Banach contraction principle which states that each closed and bounded value contraction map on a complete metric space has a fixed point. One of the most general fixed point theorems for multi-valued nonexpansive self-mappings was studied by Kirk and Massa in 1990 [13]. They proved the existence of fixed points in Banach spaces for which the asymptotic center of a bounded sequence in a closed convex subset is nonempty and compact.
The following theorem is the first well-known theorem of multi-valued contractions studied by Nadler in 1969 [12].
© 2014 Phon-on et al.; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Theorem 1.1 Let (X, d) be a complete metric space and T: X ^ CB(X). Assume that there exists k e [0,1) such that
H(Tx, Ty) < kd(x,y)
for all x, y e X. Then there exists z e X such that z e Tz.
Reich [14] extended Nadler's fixed point theorem as follows.
Theorem 1.2 Let (X, d) be a complete metric space and T: X ^ Comp(X). Assume that there exists a function y : [0, x) ^ [0,1) such that
limsup y(r) < 1
for each t e (0, x) and
H(Tx, Ty) < y(d(x,y))d(x,y) for all x, y e X. Then there exists z e X such that z e Tz.
The multi-valued mapping T studied by Reich [14] in Theorem 1.2 has compact value, that is, Tx is a nonempty compact subset of X for all x in the spaces X. In 1989, Mizoguchi and Takahashi [15] relaxed the compactness assumption on the mapping to closed and bounded subsets of X. They proved the following theorem as a generalization of Nadler's theorem.
Theorem 1.3 Let (X, d) be a complete metric space and T: X ^ CB(X). Assume that there exists a function y : [0, cxj) ^ [0,1) such that
limsupy(r) < 1
for each t e [0, x) and
H(Tx, Ty) < y(d(x,y))d(x,y) for all x, y e X. Then there exists z e X such that z e Tz.
In 2007, Berinde and Berinde [16] gave the definition of a multi-valued weak contraction stated as follows.
Definition 1.4 Let (X, d) be a metric space and T: X ^ CB(X) a multi-valued mapping. T is said to be a multi-valued weak contraction or a multi-valued (0,L)-weak contraction if there exist two constants 0 e (0,1) and L > 0 such that
H(Tx, Ty) < 0d(x,y) + Ld(y, Tx)
for all x, y e X.
Then they extended Theorem 1.2 to the class of multi-valued weak contraction and showed that in a complete metric space, every multi-valued weak contraction has a fixed point. In the same paper, they also introduced a class of multi-valued mappings which is more general than that of weak contraction defined as follows.
Definition 1.5 Let (X, d) be a metric space and T: X ^ CB(X) a multi-valued mapping. T is said to be a generalized multi-valued (a, L)-weak contraction if there exist a nonnegative number L and a function a : [0, x) ^ [0,1) satisfying limsupr^t+ a(r) <1 for each t e [0, x) such that
H(Tx, Ty) < a(d(x,y))d(x,y) + Ld(y, Tx)
for all x, y e X.
They showed that in a complete metric space, every generalized multi-valued (a, L)-weak contraction has a fixed point.
In 2008, Jachymski [17] introduced the concept of 'contraction concerning a graph, called G-contraction and proved some fixed point results of G-contraction in a complete metric space endowed with a graph.
Definition 1.6 Let (X, d) be a metric space and G = (V(G),E(G)) a directed graph such that V(G) = X and E(G) contains all loops, i.e., A = {(x,x) | x e Xjc E(G). We say that a mappingf: X ^ X is a G-contraction iff preserves edges of G, i.e., for every x,y e X,
(x, y) e E(G) ^ f(x),f (y)) e E(G) (1)
and there exists a e (0,1) such that x, y e X,
(x,y) e E(G) ^ df (x),f(y)) < ad(x,y).
The mapping f: X ^ X satisfying condition (1) is also called a graph-preserving mapping. Jachymski showed in [17] that under some properties on X, a G-contractionf: X ^ X has a fixed point if and only if there exists x e X such that (x,f (x)) e E(G).
Recently, Beg and Butt [18] introduced the concept of'G-contraction' for a multi-valued mapping T: X ^ CB(X) defined as follows.
Definition 1.7 Let T: X ^ CB(X) be a multi-valued mapping. The mapping T is said to be a G-contraction if there exists k e (0,1) such that
H(Tx, Ty) < kd(x,y)
for all (x, y) e E(G) and if u e Tx and v e Ty are such that
d(u, v) < kd(x, y) + a
for each a >0, then (u, v) e E(G).
They showed that if (X, d) is a complete metric space and (X, d) has Property A [18], then G-contraction mapping T : X ^ CB(X) has a fixed point if and only if there exist x e X and y e Tx such that (x,y) e E(G).
In 2011, Nicolae, O'Regan, and Petrusel [19] extended the notion of multi-valued contraction on a metric space with a graph in considering the fixed point shown below.
Theorem 1.8 LetF: X ^ X be a multi-valued map with nonempty closed values. Assume that
(1) there exists X e (0,1) such that D(F(x), F(y)) < Xd(x,y) for all (x,y) e E(G);
(2) for each (x, y) e E(G), each u e F(x) and v e F(y) satisfying d(u, v) < ad(x, y) for some a e (0,1), (u, v) e E(G) holds;
(3) X has Property A.
If there exist x0, xi e X such thatxi e [x0]G n F (x0), then F has a fixed point.
In 2013, Dinevari and Frigon [20] introduced a concept of 'G-contraction' which is weaker than that of Beg and Butt [18] and weaker than that of Nicolae, O'Regan, and Petrusel [19].
Definition 1.9 Let T : X ^ 2X be a map with nonempty values. We say that T is a G-contraction (in the sense of Dinevari and Frigon) if there exists a e (0,1) such that for all (x,y) e E(G) and all u e Tx, there exists v e Ty such that (u, v) e E(G) and d(u, v) < ad(x,y).
They showed that under some properties, weaker than Property A, on a metric space a multi-valued G-contraction with the closed value has a fixed point.
Most recently, Tiammee and Suantai [21] introduced the concept of'graph preserving' for multi-valued mappings and proved their fixed point theorem in a complete metric space endowed with a graph.
Definition 1.10 [21] Let X be a nonempty set, G = (V(G), E(G)) a directed graph such that V(G) = X, and T: X ^ CB(X). T is said to be graph preserving if
(x,y) e E(G) ^ (u, v) e E(G)
for all u e Tx and v e Ty.
Definition 1.11 [21] Let X be a nonempty set, G = (V(G),E(G)) a directed graph such that V(G) = X, g: X ^ X, and T: X ^ CB(X). T is said to be g-graph preserving if for any x, y e X, such that
(g(x),g(yi) e E(G) ^ (u, v) e E(G)
for all u e Tx and v e Ty.
Definition 1.12 Let (X, d) be a metric space, G = (V(G),E(G)) a directed graph such that V(G) = X, g : X ^ X, and T : X ^ CB(X). T is said to be a multi-valued weak G-contraction with respect to g or a (g, a,L)-G-contraction if there exists a function
a : [0, x) — [0,1) satisfying limsup a(r) < 1
r—^t+
for every t e [0, x) and a nonnegative number L with
H(Tx, Ty) < a(d(g(x),g(y)))d(g(x),g(y)) + LD(g(y), Tx) for all x,y e X such that (g(x),g(y)) e E(G).
Theorem 1.13 [21] Let (X, d) be a complete metric space, G = (V(G),E(G)) a directed graph such that V(G) = X, and g : X — X a surjective mapping. If T : X — CB(X) is a multi-valued mapping satisfying the following properties:
(1) T is a g-graph preserving mapping;
(2) there exists x0 e X such that (g(x0),y) e E(G) for some y e Tx0;
(3) X has Property A;
(4) T is a (g, a,L)-G-contraction,
then there exists u e X such thatg(u) e Tu.
The condition of T in Definition 1.11 to be g-graph preserving requires all pairs (u, v) where u e Tx and v e Ty have connecting edges whenever (g(x),g(y)) e E(G). With some modification, we are interested in proposing the new concept of'g-graph preserving' for multi-valued mappings in a complete metric space endowed with a graph and the fixed point theorem is also determined.
2 Preliminaries
Let (X, d)bea metric space. For x e X and A, B e Comp(X), define
d(x,A) = inf{d(x,y) | y e A}, D(A,B) = inf{d(x,B) | x e A}.
For each a e A, define
PB(a) = {b e B I d(a, b)=d(a,B)}.
Each element in PB(a) is called a projection point of a into B. Note that if B is compact, then PB(a) is always a nonempty set. Also, define
H(A,B) = max] supd(x, A), supd(x,B)
I xeB xeA '
The mapping H is said to be a Hausdorff metric induced by d. The next two lemmas will play central roles in our main results.
Lemma 2.1 [12] Let (X, d) be a metric space. If A, B e Comp(X) (orCB(X)) andx e A, then for each e >0, there is b e B such that
d(a, b) < H(A,B) + e.
Lemma 2.2 [15] Let (X, d) be a metric space, {Ak} C Comp(X) (or CB(X)), {xk} a sequence in X such that xk e Ak-1, and a : [0, to) ^ [0,1) a function satisfying limsupr^t+ a(r) < 1 for every t e [0, to). Suppose thatd(xk-1, xk) is a non-increasing sequence such that
H(Ak-1, Ak) < a(d(xk-1,xk))d(xk-1,xk), d(xk, xk+1) < H(Ak-1, Ak) + (a(d(xk-1, xk))) "k,
where {nk} is an increasing sequence and k, nk e N. Then {xk} is a Cauchy sequence in X.
Next we will give notions and examples of new types of multi-valued mapping with compact value which are weaker than that of Tiammee and Suantai [21].
Definition 2.3 Let X be a nonempty set and G = (V(G),E(G)) be a directed graph such that V (G) = X, and T: X ^ Comp(X). T is said to be weak graph preserving if it satisfies the following:
for each x, y e X, if (x, y) e E(G), then for each u e Tx there is v e PTy (u) such that (u, v) e E(G).
In Example 2.4, we illustrate a mapping T which is weak graph preserving but not graph preserving.
Example 2.4 Let N be a metric space with the usual metric and G = (N, E(G)) where
E(G) = {(2n -1,2n): n e N U {(2n, 1): n e N. Define T: N ^ Comp(X) by
{2k, 2k + 2} if x = 2k -1,k e N; {1} if x = 2k, k e N.
We will show that T is weak graph preserving. If (x, y) = (2k - 1,2k) where k e N, then Tx = {2k, 2k + 2} and Ty = {1}. We can see that Pjy(2k) = {1} = Pjy(2k + 2) and (2k, 1), (2k + 2,1) e E(G).
If (x,y) = (2k, 1) where k e N, then Tx = {1} and Ty = {2,4}. We can see that Pjy(1) = {2} and (1,2) e E(G). It is easy to see that (1,4) e E(G) and so T is not graph preserving.
Next we will give an another example of a weak graph-preserving mapping that is not a G-contraction in the sense of Dinevari and Frigon [20].
Example 2.5 Let X = {1,2,3,4,6,8} be a metric space with the usual metric and G = (X,E(G)) where
E(G) = {(1,1), (1,3), (2,2), (2,6), (4,2), (4,4), (4,6)}.
Define T: X — Comp(X) by
{2,4} if x = 1,4; {6,8} if x = 3; {2} if x = 2,6,8.
We will show that T is weak graph preserving. If (x, y) = (1,1) then Tx = {2,4} and Ty = {2,4}. We can see that PTy(2) = {2}, PTy(4) = {4} and (2,2), (4,4) e E(G).
If (x,y) = (1,3) then Tx = {2,4} and Ty = {6,8}. We can see that PTy(2) = {6}, PTy(4) = {6}, and (2,6), (4,6) e E(G).
If (x, y) = (2,2) or (x, y) = (2,6) then Tx = {2} and Ty = {2}. We can see that Pjy (2) = {2} and (2,2) e E(G).
If (x,y) = (4,2) or (x,y) = (4,6) then Tx = {2,4} and Ty = {2}. We can see that Pjy(2) = {2} = Pjy (4) and (2,2), (4,2) e E(G).
So, T is weak graph preserving but it is not a G-contraction in the sense of Dinevari and Frigon since for each u e Tx and v e Ty with (x,y) = (1,3), d(u, v) > 2 > ad(1,3) for all a e (0,1).
Definition 2.6 Let X be a nonempty set, G = (V(G),E(G)) a directed graph such that V(G) = X, T: X — Comp(X), and g: X — X. T is said to be weakg-graph preserving if it satisfies the following:
for each x,y e X, if (g(x),g(y)) e E(G), then for each u e Tx there is v e PTy(u) such that (u, v) e E(G).
Example 2.7 Let N be a metric space with the usual metric, G = (N,E(G)) where
E(G) = {(2n -1,2n): n e N} U {(2n, 1): n e N}. Define T: N — Comp(X) by
{2k, 2k + 2} if x = 2k -1,k e N; {1} if x = 2k, k e N,
and g: X — X by
g(x) =
2k if x = 2k + 2,k e N;
2k-1 ifx = 2k + 1,k e N;
1 if x = 1;
2 if x = 2.
We will show that T is weak g-graph preserving.
If (g(x),g(y)) = (1,2), then (x,y) = (1,2) and Tx = {2,4} and Ty = {1}. We can see that Pry (2) = {1} = PTy (4) and (2,1), (4,1) e E(G).
If (g(x),g(y)) = (2,1), then (x,y) = (2,1) and Tx = {1} and Ty = {2,4}. We can see that PTy(1) = {2} and (1,2) e E(G).
If (g(x),g(y)) = (2k -1,2k) where k e N \ {1}, then (x,y) = (2k + 1,2k + 2) and Tx = {2k + 2,2k + 4} and Ty = {1}. We can see that Pry(2k + 2) = {1} = Pry(2k + 4) and (2k + 2,1), (2k + 4,1) e E(G).
If (g(x),g(y)) = (2k, 1) where k e N \ {1}, then (x, y) = (2k + 2,1) and Tx = {1} and Ty = {2,4}. We can see that PTy (1) = {2} and (1,2) e E(G). Hence T is weak g-graph preserving.
3 Main results
We first recall Property A before the main theorem is proved.
Property A For any sequence {xn} in X, if xn — x and (xn,xn+i) e E(G) for n e N, then there is a subsequence {xnk} such that (xnk, x) e E(G) for k e N.
Theorem 3.1 Let (X, d) be a complete metric space, G = (V(G),E(G)) a directed graph such that V(G) = X, andg: X — Xa surjective map. IfT: X — Comp(X) is a multi-valued mapping satisfying the following properties:
(1) T is weak g-graph preserving;
(2) Xt = {x e X | (g(x), y) e E(G) for some y e Tx} = 0;
(3) X has Property A;
(4) T is a (g, a,L)-G-contraction,
then there exists u e X such thatg(u) e Tu.
Proof By (2), let xo e XT. Then there exists y1 e Tx0 such that (g(xo),y1) e E(G). Sinceg is surjective, there exists x1 e X such that y1 = g(x1). Thus we have (g(x0),g(x1)) e E(G). Since [a(d(g(x0),g(x1)))]n — 0, there exists n1 e N such that
|a(d(g(x0),g(x0))f1 < [1-a(d(g(x0),gfo)))]d(g(x0),g(x^).
Since Tx1 is compact, it follows that PTx1 (g(x1)) = 0. Since T is weak g-graph preserving, there exists y2 e PrX1 (g(x^) such that (g(x1),y2) e E(G) and d(g(x^,y2) = d(g(x1), Tx!). Again since g is surjective, there is x2 e X such that g(x2) = y2. By Lemma 2.1, there is y1 e Tx1 such that
d(g(x1),y1) < H(Tx0, Tx1) + [a(d(g(x0),gfo)))]n1.
It follows that
d{g (x1), g (x2)) = d(g (x1), Tx1)
< d(gfa),y1)
< H(Tx0, Tx1) + [a(d(g(x0),g(x1^]n1.
Since T is a (g, a,L)-G-contraction and (g(x1),g(x2)) e E(G), we have
d(g(x1),g(x2)) < H(Tx0, Tx1) + [a(d(g(x0),g(x1^]n1
< ^d(g(xQ),g(x1^)d(g(xQ),g(x0) + LD(g(x1), Tx0) + [a( 4g(x0), g (x1^ ]n1
< a(d(g(xo),g(xi)))d(g(x0),g(xi)) + |a(d(g(xo),g(xi))) f1
< 4g(xo),g(xi)).
Next, since [a(d(g(x1),g(x2)))]n ^ 0, there exists n2 e N such that «2 > n1 and
|a(d(g(xi),gfa)))f2 < [i-a(d(g(xi),gfe)))]d(g(xi),gfe)).
Since Tx2 is compact, it follows that PTx2(g(x2)) = 0. Since T is weakg-graph preserving, there exists y? e PTx2(g(x2)) suchthat (gfe),y?) e E(G) andd(g(x2),y?) = d(g(x2), Tx2). Again since g is surjective, there is x3 e X such that g(x3) = y3. By Lemma 2.i, there is y2 e Tx2 such that
d{g(xi),y2) < H(Txi, Tx2) + [a(d(g(xi),gfe)))]"2. It follows that
d{g (x2), gfo)) = d(g(x2), Tx2)
< 4g (x2), y2)
< H(Txi, Tx2) + [a(d(g(xi),g(x2)))]"2.
Since T is a (g, a,L)-G-contraction and (g(x2),g(x3)) e E(G), we have
^g(x2),g(x?)) < H(Txi, Tx2) + [a(d(g(xi),gfe)))]"2
< a(d(g(xi),gfe)))d(g(xi),g(x2)) + LD(g(x2), Txi)
+ (xi), g (x2))) ]"2
< a(4g(xi),gfe)))4g(xi),g(x2)) + [a(4g(xi),g(x2)))]"2
< 4g(xi),gfe)).
Continuing in this process, we produce a sequence {g(xk)} in X and an increasing sequence {nk} in N such that for each k e N, g(xk+i) e Txk, (g(xk),g(xk+i)) e E(G),
[a{d{g(xk-i),g(xk)))]"k < [i - a(d(g(xk-i),g(xk)))]d(g(xk-i),g(xk)), H(Txk-i, Txk) < ^^g(xk-i),g(xk)))d(g(xk-i),g(xk)),
d{g(xk),g(xk+i)) < H(Txk-i, Txk) + [a(d(g(xk-i),g(xk)))]«k. We note that
^g(xk),g(xk+i)) < H(Txk-i, Txk) + [a(d(g(xk-i),g(xk)))fk < a(4g(xk-i),g(xk)))4g(xk-i),g(xk))
+ [a(d(g (xk-1), g(xk))) fk < d(g(xk-1),g(xk)).
Hence, d(g(xk),g(xk+1)) < d(g(xk-1),g(xk)) and so {d(g(xk),g(xk+1))} is a non-increasing sequence. By Lemma 2.2, {g(xk)} is a Cauchy sequence in X. Since X is complete, the sequence {g(xk)} converges to a point g(u) for some u e X.By Property A in (3), there is a subsequence {g(xkn)} such that (g(xkn),g(u)) e E(G) for any n e N. Claim thatg(u) e Tu. Note that for eachg(xkn+1),
D(g(u), Tu) < d(g(u),g(x^+1)) + D(g(x*n+1), Tu)
< d(g(u),g(xkn+1)) + H(Txkn, Tu)
< d(g(u),g(xk„+1)) + a(d(g(xk„),g(u)))d(g(xk„),g(u)) + LD(g(u), Txkn)
< d(g(u),g(xk„+1)) + a(d(g(xk„),g(u)))d(g(xkH),g(u)) + Ld(g(u), g(xkH+1^.
Since g(xkn) converges to g(u) as n — x, it follows that D(g(u), Tu) = 0. Since Tu is compact, we conclude that g(u) e Tu, completing the proof. □
Remark 3.2 Theorem 3.1 is an extension of Theorem 1.13 in the case of a mapping T : X — CB(X) having compact values.
A partial order is a binary relation < over the set X which satisfies the following conditions:
(1) x < x (reflexivity);
(2) if x < y and y < x, then x = y (antisymmetry);
(3) if x < y and y < z, then x < z (transitivity),
for all x, y e X .A set with a partial order < is called a partially ordered set. We write x < y if x < y and x = y.
Definition 3.3 Let (X, <) be a partially ordered set. For each A, B c X, A < B if a < b for any a e A, b e B.
Definition 3.4 [21] Let (X, d) be a metric space endowed with a partial order <, g: X — X a surjective map, and T: X — Comp(X). T is said to be g-increasing if for any x,y e X,
g(x)<g(y) ^ Tx < Ty.
In the case g is the identity map, the mapping T is called an increasing mapping.
Corollary 3.5 Let (X, d) be a metric space endowed with a partial order <, g: X — X a surjective map and T: X — Comp(X) a multi-valued mapping. Suppose that
(1) T is g-increasing;
(2) there exist x0 e X and u e Tx0 such thatg(x0) < u;
(3) for each sequence {xk} such that g(xk) <g(xk+1) for all k e N andg(xk) converges to g(x) for some x e X, then g(xk) < g(x) for all k e N;
(4) there exist a function a : [0, to) ^ [0,1) satisfying limsupr^t+ a(r)< 1 for every t e [0, to) and a nonnegative number L with
H(Tx, Ty) < a(d(g(x),g(y)))d(g(x),g(y)) + LD(g(y), Tx)
for all x, y e X such that g(x) < g(y);
(5) the metric d is complete.
Then there exists u e X such thatg(u) e Tu.
Proof Define G = (1/(G),E(G)) where V(G) = X and E(G) = {(x,y) | x < y}. Let x,y e X be such that (g(x),g(y)) e E(G). Theng(x) <g(y) so by (1) it implies that Tx < Ty. For each u e Tx, v e Ty, u < v. Since Ty is compact, it follows that PTy (x) = 0 and PTy (x) c Ty for all x e Tx. Thus(x, v) e E(G)forall v e PTy (x) andallx e Tx. Thatis, T is weak g-graph preserving. By assumption (2), there exist x0 e X and u e Tx0 such that g(x0) < u.So (g(x0), u) e E(G) and hence the condition (2) in Theorem 3.1 is satisfied. Moreover, the conditions (3) and (4) in Theorem 3.1 are also satisfied. Therefore the result of this corollary is followed by Theorem 3.1. □
Theorem 3.6 Let (X, d) be a metric space endowed with a partial order < and T: X ^ Comp(X) a multi-valued mapping. Suppose that
(1) T is increasing;
(2) there exist x0 e X and u e Tx0 such that x0 < u;
(3) for each sequence {xk} such that xk < xk+1 for all k e N and xk converges to x for some x e X, then xk < x for all k e N;
(4) there exist a function a : [0, to) ^ [0,1) satisfying limsupr^t+ a(r)< 1 for every t e [0, to) and a nonnegative number L with
H(Tx, Ty) < a(d(x,y))d(x,y) +LD(y, Tx)
for all x, y e X with x < y;
(5) the metric d is complete.
Then there exists u e X such that u e Tu. Furthermore, if sup{a(r): r e [0, to)} < 1 and L < 1 - sup{a(r): r e [0, to)}, then T has a unique fixed point.
Proof Settingg(x) = x, by Corollary 3.5 we have Fix(T) = 0. With conditions sup{a(r): r e [0, to)} < 1 and L < 1 - sup{a(r): r e [0, to)}, we will show that T has a unique fixed point. Let u, v e Fix(T). Suppose to a contrary that u = v. Without loss of generality, assume that u < v. By the condition (4), we have
d(u, v) < H(Tu, Tv)
< a(d(u, v))d(u, v) + LD(v, Tu)
< sup{a(r): r e [0,to)}d(u, v) +Ld(u, v) = (sup{a(r): r e [0, to) } + L)d(u, v).
Since sup{a(r): r e [0, x)} + L <1, this yields d(u, v) < d(u, v), a contradiction. Therefore
Next we give an example such that T has a unique fixed point but T is neither a graph-preserving nor a multi-valued G-contraction in the sense of Nicolae, O'Regan, and Petrusel [19].
Example 3.7 Let X = {0}U{;1 : n e N U {0}} be a metric space with the usual metric d. Consider the directed graph defined by V(G) = X and
{2} if x = 1.
(1) T has a fixed point;
(2) T is not graph preserving as defined by Tiammee and Suantai [21];
(3) T is not a G-contraction in the sense of Nicolae, O'Regan, and Petrusel [19].
Proof (1) We will show that T is a (a,g,L)-G-contraction with a > 1, L > 2, and g = iX. Let (x, y) e E(G). If (x,y) = (1, ¿), then Tx = {2}, Ty = {1,1}, and
H(Tx, Ty) = 1 = 1 d(x,y) < a(d(x,y))d(x,y) + LD(y, Tx). 1 2
If (x,y) = (1,0), then Tx = {2}, Ty = {0,1}, and
H(Tx, Ty) = 1 = 1 d(x,y) < a(d(x,y))d(x,y) + LD(y, Tx).
If (x,y) = (2n, 5nrr) for all n e N, then Tx = {^n+i, 1} and Ty = {, 1}. It is easy to check that
u = v, which implies that T has a unique fixed point.
where A is the diagonal in X x X. Let T: X — Comp(X) be defined by
{0,1} if x = 0; Tx = I {^,1} if x =2n, n e N;
H(Tx, Ty) = max] sup d(a, Tx), sup d(b,
aeTy beTx
= 1 d(x, y)
< a(d(x,y))d(x,y) + LD(y, Tx).
If (x,y) = (2n, 0) for all n e N, then Tx = {^ 1} and Ty = {0,1}. We have H(Tx, Ty) = max] sup d(a, Tx), sup d(b, Ty) |
¡■aeTy beTx >
= 2n+1
= 1 d(x, y)
< a(d(x,y))d(x,y) + LD(y, Tx).
If (x,y) = (0,0) and (x,y) = (2n, 2n), then Tx = Ty which obviously implies that H(Tx, Ty) = 0. So, 2 2
H(Tx, Ty) < a(d(x,y))d(x,y) + LD(y, Tx).
Hence T is a (a,g,L)-G-contraction. Next, we will show that T is weak graph preserving. Let (x, y) e E(G).
If (x,y) = (1,1), then Tx = {1}, Ty = {1,1}, and Pry(2) = {1} and (2,1) e E(G). If (x,y) = (1,0), then Tx = {2}, Ty = {0,1}, and Pry(2) = {0,1} and (2,0) e E(G). If (x,y) = (2n, 2n+i) for all n e N, then Tx = {2n+r,1} and Ty = {n1^,!}. It is easyto see that Pry(jj+r) = {51+t}, Pry(1) = {1}, and (2n+r, j^), (1,1) e E(G).
If (x,y) = (2n, 0) for all n e N, then Tx = {^ 1} and Ty = {0,1}. We have Pry(^ = {0}, Pry(1) = {1}, and (-+■, 0), (1,1) e E(G).
If (x,y) = (0,0) then Tx = {0,1} = Ty. We have Pry(0) = {0}, Pry(1) = {1}, and (0,0), (1,1) e E(G).
If (x,y) = ((n, 2n), then Tx = Ty = {2^, 1} which obviously implies that Pry(„nr) = {„nr}, PTy (1) = {1} and (d1^, 21+t), (1,1) e E(G). So, T is weak graph preserving. Next, we can see that 21+y e T(2n) and (d, 2!^) e E(G). So the condition (2) of Theorem 3.1 is satisfied. Also, it is obvious that the condition (3) of Theorem 3.1 is satisfied. Thus all conditions of Theorem 3.1 are obtained. Therefore we can conclude that T has a fixed point and the fixed point set Fix(T) = {0}.
(2) T is not graph preserving since 2 e T 1,1 e T0 but (5,1) e E(G).
(3) T is not a multi-valued contraction in the sense of Nicolae, O'Regan, and Petrusel since (1,0) e E(G), 2 e T 1,1 e T0 and d(1,1) < ad(1,0) with a > 2 but (2,1) e E(G). □
Remark 3.8 As a consequence of Example 3.7, we can neither use Theorem 1.13 nor Theorem 1.8 to check whether or not T has a fixed point.
Competing interests
The authors declare that they have no competing interests. Authors' contributions
Allauthors read and approved the finalmanuscript.
Acknowledgements
This paper was supported by the Faculty of Science and Technology, Prince of Songkla University Pattani Campus.
Received: 20 July 2014 Accepted: 8 December 2014 Published: 18 December 2014
References
1. Bojor, F: Fixed point theorems for Reich type contraction on metric spaces with a graph. Nonlinear Anal. 75, 3895-3901 (2012)
2. Branciari, A: A fixed point theorem for mappings satisfying a generalcontractive condition of integraltype. J. Math. Anal. Appl. 29,531-536(2002)
3. Browder, FE: The fixed point theory of multi-valued mapping in topologicalspaces. Math. Ann. 177, 283-301 (1968)
4. Du, WS: New cone fixed point theorems for nonlinear multi-valued maps with applications. Appl. Math. Lett. 24(2), 172-178 (2011)
5. Feng, Y, Liu, S: Fixed point theorems for multi-valued contractive mappings and multi-valued Caristi type mappings. J. Math. Anal. Appl. 317, 103-112 (2006)
6. Khaojasten, F, Abbas, M, Costache, S: Two new types of fixed point theorems in complete metric spaces. Abstr. Appl. Anal. 2014, Article ID 325840 (2014)
7. Laza, T, Mot, G, Petrusel, G, Szentesi, S: The theory of Reich's fixed point theorem for multi-valued operators. Fixed Point Theory Appl. (2010). doi:10.1155/2010/178421
8. Minak, G, Acar, O, Altun, I: Multi-valued pseudo-Picard operators and fixed point results. J. Funct. Spaces Appl. 2013, Article ID 827458 (2013)
9. Petrusel, A, Petrusel, G: Selection theorems for multi-valued generalized contractions. Math. Morav. 9,43-52 (2005)
10. Sitthithakerngkiet, K, Plubtieng, S: Existence solutions of vector equilibrium problems and fixed point of multi-valued mappings. Abstr. Appl. Anal. 2013, Article ID 952021 (2013)
11. Ume, JS, Lee, BS, Cho, SJ: Some results on fixed point theorems for multi-valued mappings in complete metric spaces. Int. J. Math. Math. Sci. 30(6), 319-325 (2002)
12. Nadler, SB: Multi-valued contraction mappings. Pac.J. Math. 30,475-488(1969)
13. Kirk, WA, Massa, S: Remarks on asymptotic and Chebyshev centers. Houst. J. Math. 16,465-468 (1990)
14. Reich, S: Fixed points of contractive functions. Boll. Unione Mat. Ital. 5, 26-42 (1972)
15. Mizoguchi, N, Takahashi, W: Fixed point theorems for multi-valued mapping on complete metric spaces. J. Math. Anal. Appl. 141, 177-188(1989)
16. Berinde, M, Berinde, V: On a generalclass multi-valued weakly Picard mappings. J. Math. Anal. Appl. 326, 772-782 (2007)
17. Jachymski, J: Fixed the contraction principle for mappings on a metric with a graph. Proc. Am. Math. Soc. 139, 1359-1373 (2008)
18. Beg, I, Butt, AR: Fixed point for set valued mappings satisfying an implicit relation in partially ordered metric spaces. Nonlinear Anal. 71, 3699-3704 (2009)
19. Nicolae, A, O'Regan, D, Petrusel, A: Fixed point theorems for single-valued and multi-valued generalized contractions in metric spaces endowed with a graph. Georgian Math. J. 18, 307-327 (2011)
20. Dinevari, T, Frigon, T: Fixed point results for multi-valued contractions on a metric space with a graph. J. Math. Anal. Appl. 405, 507-517(2013)
21. Tiammee, J, Suantai, S: Coincidence point theorems for graph-preserving multi-valued mappings. Fixed Point Theory Appl. (2014). doi:10.1186/1687-1812-2014-70
doi:10.1186/1687-1812-2014-248
Cite this article as: Phon-on et al.: Coincidence point theorems for weak graph preserving multi-valued mapping.
Fixed Point Theory and Applications 2014 2014:248.
Submit your manuscript to a SpringerOpen journal and benefit from:
► Convenient online submission
► Rigorous peer review
► Immediate publication on acceptance
► Open access: articles freely available online
► High visibility within the field
► Retaining the copyright to your article
Submit your next manuscript at ► springeropen.com
