R E S E A R C H
Open Access
Fixed points and strict fixed points for
multivalued contractions of Reich type on
metric spaces endowed with a graph
Cristian Chifu
1, Gabriela Petru¸sel
1*and Monica-Felicia Bota
2*Correspondence:
gabi.petrusel@tbs.ubbcluj.ro 1Department of Business,
Babe¸s-Bolyai University Cluj-Napoca, Horea street, No. 7, Cluj-Napoca, Romania Full list of author information is available at the end of the article
Abstract
The purpose of this paper is to present some strict fixed point theorems for
multivalued operators satisfying a Reich-type condition on a metric space endowed with a graph. The well-posedness of the fixed point problem is also studied.
MSC: 47H10; 54H25
Keywords: fixed point; strict fixed point; metric space endowed with a graph; well-posed problem
1 Preliminaries
A new approach in the theory of fixed points was recently given by Jachymski [] and Gwóźdź-Lukawska and Jachymski [] by using the context of metric spaces endowed with a graph. Other recent results for single-valued and multivalued operators in such metric spaces are given by Nicolae, O’Regan and Petruşel in [] and by Beg, Butt and Radojevic in [].
Let (X,d) be a metric space and letbe the diagonal ofX×X. LetGbe a directed graph such that the setV(G) of its vertices coincides withXand⊆E(G), whereE(G) is the set of the edges of the graph. Assume also thatGhas no parallel edges and, thus, one can identifyGwith the pair (V(G),E(G)).
Ifxandyare vertices ofG, then a path inGfromxtoyof lengthk∈Nis a finite sequence (xn)n∈{,,,...,k} of vertices such thatx=x,xk=yand (xi–,xi)∈E(G) fori∈ {, , . . . ,k}.
Notice that a graphGis connected if there is a path between any two vertices and it is weakly connected ifG˜ is connected, whereG˜ denotes the undirected graph obtained from Gby ignoring the direction of edges.
Denote byG–the graph obtained fromGby reversing the direction of edges. Thus,
EG–=(x,y)∈X×X: (y,x)∈E(G). (∗)
Since it is more convenient to treatG˜ as a directed graph for which the set of its edges is symmetric, under this convention, we have that
E(G) =˜ E(G)∪EG–. (∗∗)
If Gis such thatE(G) is symmetric, then forx∈V(G), the symbol [x]G denotes the
equivalence class of the relationdefined onV(G) by the rule:
yz if there is a path inGfromytoz.
Let us consider the following families of subsets of a metric space (X,d):
P(X) :=Y∈P(X)|Y=∅; Pb(X) :=
Y∈P(X)|Yis bounded;
Pcl(X) :=
Y∈P(X)|Yis closed; Pcp(X) :=
Y∈P(X)|Yis compact.
The gap functional between the setsAandBin the metric space (X,d) is given by
D:P(X)×P(X)→R+∪ {+∞}, D(A,B) =inf
d(a,b)|a∈A,b∈B.
In particular, ifx∈XthenD(x,B) :=D({x},B). The Pompeiu-Hausdorff functional is defined by
H:P(X)×P(X)→R+∪ {+∞},
H(A,B) =max
sup
a∈A
D(a,B),sup
b∈B
D(A,b)
.
The diameter generalized functional generated bydis given by
δ:P(X)×P(X)→R+∪ {+∞},
δ(A,B) =supd(a,b)|a∈A,b∈B.
In particular, we denote byδ(A) :=δ(A,A) the diameter of the setA.
Let (X,d) be a metric space. IfT :X→P(X) is a multivalued operator, thenx∈Xis called a fixed point forT if and only ifx∈T(x). The setFix(T) :={x∈X|x∈T(x)}is called the fixed point set ofT, whileSFix(T) ={x∈X| {x}=Tx}is called the strict fixed point set ofT.Graph(T) :={(x,y)|y∈T(x)}denotes the graph ofT.
Definition . Letϕ:R+→R+be a mapping. Thenϕis called a strong comparison func-tion if the following asserfunc-tions hold:
(i) ϕis increasing;
(ii) ϕn(t)→asn→ ∞for allt∈R+;
(iii) ∞n=ϕn(t) <∞for allt∈R+.
Definition . Let (X,d) be a complete metric space, letGbe a directed graph, and let T:X→Pb(X) be a multivalued operator. By definition,T is called a (δ,ϕ)-G-contraction if there existsϕ:R+→R+, a strong comparison function, such that
δT(x),T(y)≤ϕd(x,y) for all (x,y)∈E(G).
[, ]). The equality betweenFix(T) andSFix(T) and the well-posedness of the fixed point problem are also studied.
Our results also generalize and extend some fixed point theorems in partially ordered complete metric spaces given in Harjani and Sadarangani [], Nicolaeet al.[], Nieto and Rodríguez-López [] and [], Nietoet al.[], O’Regan and Petruşel [], Petruşel and Rus [], and Ran and Reurings [].
2 Fixed point and strict fixed point theorems
We begin this section by presenting a strict fixed point theorem for a Reich type contrac-tion with respect to the funccontrac-tionalδ.
Theorem . Let(X,d)be a complete metric space and let G be a directed graph such that the triple(X,d,G)satisfies the following property:
(P) for any sequence(xn)n∈N⊂X with xn→x as n→ ∞,
there exists a subsequence(xkn)n∈Nof (xn)n∈Nsuch that(xkn,x)∈E(G).
Let T:X→Pb(X)be a multivalued operator.Suppose that the following assertions hold:
(i) There existsa,b,c∈R+withb= anda+b+c< such that
δT(x),T(y)≤ad(x,y) +bδx,T(x)+cδy,T(y)
for all(x,y)∈E(G). (ii) For eachx∈X,the set
˜
XT(x) := y∈T(x) : (x,y)∈E(G)andδ
x,T(x)≤qd(x,y)
for someq∈
, –a–c b
is nonempty.
Then we have:
(a) Fix(T) =SFix(T)=∅;
(b) If we additionally suppose that
x∗,y∗∈Fix(T) ⇒ x∗,y∗∈E(G),
thenFix(T) =SFix(T) ={x∗}.
Proof (a) Letx∈X. SinceX˜T(x)=∅, there existsx∈T(x) and <q<–ab–c such that (x,x)∈E(G) and
δx,T(x)
≤qd(x,x).
By (i) we have that
δx,T(x)
≤δT(x),T(x)
≤ad(x,x) +bδ
x,T(x)
+cδx,T(x)
≤ad(x,x) +bqd(x,x) +cδ
x,T(x)
Hence,
δx,T(x)
≤a+bq
–c d(x,x). (.)
For x ∈X, since X˜T(x)=∅, we get again that there exists x ∈ T(x) such that
δ(x,T(x))≤qd(x,x) and (x,x)∈E(G). Then
d(x,x)≤δ
x,T(x)
≤a+bq
–c d(x,x). (.)
On the other hand, by (i), we have that
δx,T(x)
≤δT(x),T(x)
≤ad(x,x) +bδ
x,T(x)
+cδx,T(x)
≤ad(x,x) +bqd(x,x) +cδ
x,T(x)
.
Using (.) we obtain
δx,T(x)
≤a+bq
–c d(x,x)≤
a+bq –c
d(x,x). (.)
Forx∈X, we haveX˜T(x)=∅, and so there existsx∈T(x) such thatδ(x,T(x))≤ qd(x,x) and (x,x)∈E(G).
Then
d(x,x)≤δ
x,T(x)
≤
a+bq
–c
d(x,x). (.)
By these procedures, we obtain a sequence (xn)n∈Nwith the following properties:
() (xn,xn+)∈E(G)for eachn∈N;
() d(xn,xn+)≤(a–+bqc )nd(x,x)for eachn∈N;
() δ(xn,T(xn))≤(a–+bqc)nd(x,x)for eachn∈N.
From () we obtain that the sequence (xn)n∈N is Cauchy. Since the metric spaceXis complete, we get that the sequence is convergent,i.e.,xn→x∗asn→ ∞. By the property
(P), there exists a subsequence (xkn)n∈Nof (xn)n∈Nsuch that (xkn,x∗)∈E(G) for eachn∈N.
We have
δx∗,Tx∗≤dx∗,xkn+
+δxkn+,T
x∗≤dx∗,xkn+
+δT(xkn),T
x∗
≤dx∗,xkn+
+adxkn,x∗
+bδxkn,T(xkn)
+cδx∗,Tx∗
≤dx∗,xkn+
+adxkn,x∗
+b
a+bq
–c kn
d(x,x) +cδ
x∗,Tx∗,
δx∗,Tx∗≤ –cd
x∗,xkn+
+ a
–cd
xkn,x∗
+ b
–c
a+bq –c
kn
d(x,x). (.)
Butd(x∗,xkn+)→ asn→ ∞andd(xkn,x∗)→ asn→ ∞. Hence,δ(x∗,T(x∗)) = ,
BecauseSFix(T)⊂Fix(T), we need to show thatFix(T)⊂SFix(T).
Letx∗∈Fix(T)⇒x∗∈T(x∗). Because⊂E(G), we have that (x∗,x∗)∈E(G). Using (ii) withx=y=x∗, we obtain
δTx∗≤adx∗,x∗+bδx∗,Tx∗+cδx∗,Tx∗.
So,δ(T(x∗))≤(b+c)δ(x∗,T(x∗)). Becausex∗∈T(x∗), we get thatδ(x∗,T(x∗))≤δ(T(x∗)). Hence, we have
δTx∗≤(b+c)δTx∗. (.)
Suppose thatcard(T(x∗)) > . This implies thatδ(T(x∗)) > . Thus from (.) we obtain thatb+c> , which contradicts the hypothesisa+b+c< .
Thusδ(T(x∗)) = ⇒T(x∗) ={x∗},i.e.,x∗∈SFix(T) andFix(T)⊂SFix(T). Hence,Fix(T) =SFix(T)=∅.
(b) Suppose that there existx∗,y∗∈Fix(T) =SFix(T) withx∗=y∗. We have that
• x∗∈SFix(T)⇒δ(x∗,T(x∗)) = ; • y∗∈SFix(T)⇒δ(y∗,T(y∗)) = ; • (x∗,y∗)∈E(G).
Using (i) we obtain
dx∗,y∗=δTx∗,Ty∗≤adx∗,y∗+bδx∗,Tx∗+cδy∗,Ty∗.
Thus,d(x∗,y∗)≤ad(x∗,y∗), which implies thata≥, which is a contradiction.
Hence,Fix(T) =SFix(T) ={x∗}.
Next we present some examples and counterexamples of multivalued operators which satisfy the hypothesis in Theorem ..
Example . LetX:={(, ), (, ), (, ), (, )}andT:X→Pcl(X) be given by
T(x) = ⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩
{(, )}, x= (, ),
{(, )}, x= (, ),
{(, ), (, )}, x= (, ),
{(, ), (, )}, x= (, ).
(.)
LetE(G) :={((, ), (, )), ((, ), (, )), ((, ), (, ))} ∪.
Notice that all the hypotheses in Theorem . are satisfied (the condition (i) is verified fora=c= .,b= . and soFix(T) =SFix(T) ={(, )}.
The following remarks show that it is not possible to have elements inFT\SFT.
Remark . If we suppose that there existsx∈FT\SFT, then, since (x,x)∈, we get
Remark . If, in the previous theorem, instead of the property (P), we suppose thatT has a closed graph, then we obtain again the conclusionFix(T) =SFix(T)=∅.
Remark . If, in the above remark, we additionally suppose that
x∗,y∗∈Fix(T) ⇒ x∗,y∗∈E(G),
thenFix(T) =SFix(T) ={x∗}.
The next result presents a strict fixed point theorem where the operatorT satisfies a (δ,ϕ)-G-contractive condition onE(G).
Theorem . Let(X,d)be a complete metric space and let G be a directed graph such that the triple(X,d,G)satisfies the following property:
(P) for any sequence(xn)n∈N⊂X with xn→x as n→ ∞,
there exists a subsequence(xkn)n∈Nof (xn)n∈Nsuch that(xkn,x)∈E(G).
Let T:X→Pb(X)be a multivalued operator.Suppose that the following assertions hold:
(i) T is a(δ,ϕ)-G-contraction. (ii) For eachx∈X,the set
˜
XT:= y∈T(x) : (x,y)∈E(G)andδ
x,T(x)≤qd(x,y)for someq∈
, –a–c b
is nonempty.
Then we have:
(a) Fix(T) =SFix(T)=∅;
(b) If,in addition,the following implication holds:
x∗,y∗∈Fix(T) ⇒ x∗,y∗∈E(G),
thenFix(T) =SFix(T) ={x∗}.
Proof (a) Letx∈X. Then, since X˜T(x) is nonempty, there existx ∈T(x) and q∈ ],–ab–c[ such that (x,x)∈E(G) and
δx,T(x)
≤qd(x,x).
By (i) we have that
δx,T(x)
≤δT(x),T(x)
≤ϕd(x,x)
.
Forx∈X, by the same approach as before, there existsx∈T(x) such thatδ(x,T(x))≤ qd(x,x) and (x,x)∈E(G).
We have
d(x,x)≤δ
x,T(x)
≤δT(x),T(x)
≤ϕd(x,x)
On the other hand, by (i) we have that
δx,T(x)
≤δT(x),T(x)
≤ϕd(x,x)
≤ϕd(x,x)
.
By the same procedure, for x ∈X there exists x ∈T(x) such that δ(x,T(x))≤ qd(x,x) and (x,x)∈E(G). Thus
d(x,x)≤δ
x,T(x)
≤ϕd(x,x)
. (.)
We have
δx,T(x)
≤δT(x),T(x)
≤ϕd(x,x)
≤ϕd(x,x)
.
By these procedures, we obtain a sequence (xn)n∈Nwith the following properties:
() (xn,xn+)∈E(G)for eachn∈N;
() d(xn,xn+)≤ϕn(d(x,x))for eachn∈N;
() δ(xn,T(xn))≤ϕn(d(x,x))for eachn∈N.
By (), using the properties ofϕ, we obtain that the sequence (xn)n∈Nis Cauchy. Since the
metric space is complete, we have that the sequence is convergent,i.e.,xn→x∗asn→ ∞.
By the property (P), we get that there exists a subsequence (xkn)n∈Nof (xn)n∈Nsuch that
(xkn,x∗)∈E(G) for eachn∈N.
We shall prove now thatx∗∈SFix(T). We have
δx∗,Tx∗≤dx∗,xkn+
+δxkn+,T
x∗≤dx∗,xkn+
+δT(xkn),T
x∗
≤dx∗,xkn+
+ϕdxkn,x∗
.
Sinced(x∗,xkn+)→ asn→ ∞andϕ is continuous in withϕ() = , we get that δ(x∗,T(x∗)) = .
Hence,x∗∈SFix(T)⇒SFix(T)=∅. We shall prove now thatFix(T) =SFix(T).
BecauseSFix(T)⊂Fix(T), we need to show thatFix(T)⊂SFix(T).
Letx∗∈Fix(T). Because⊂E(G), we have that (x∗,x∗)∈E(G). Using (i) withx=y=x∗, we obtain
δTx∗≤ϕdx∗,x∗= .
Hence,x∗∈SFix(T) and the proof of this conclusion is complete.
(b) Suppose that there existx∗,y∗∈Fix(T) =SFix(T) withx∗=y∗. We have that
• x∗∈SFix(T)⇒δ(x∗,T(x∗)) = ; • y∗∈SFix(T)⇒δ(y∗,T(y∗)) = ; • (x∗,y∗)∈E(G).
Using (i) we obtain
dx∗,y∗=δTx∗,Ty∗≤ϕdx∗,y∗<dx∗,y∗.
In the next result, the operatorTsatisfies another contractive condition with respect to
δonE(G)∩Graph(T).
Theorem . Let(X,d)be a complete metric space,let G be a directed graph,and let T: X→Pb(X)be a multivalued operator.Suppose that f:X→R+defined f(x) :=δ(x,T(x))is a lower semicontinuous mapping.Suppose that the following assertions hold:
(i) There exista,b∈R+,withb= anda+b< ,such that
δy,T(y)≤ad(x,y) +bδx,T(x) for all(x,y)∈E(G)∩Graph(T).
(ii) For eachx∈X,the set
˜
XT(x) := y∈T(x) : (x,y)∈E(G)andδ
x,T(x)≤qd(x,y)for someq∈
, –a b
is nonempty.
ThenFix(T) =SFix(T)=∅.
Proof Letx∈X. Then, sinceX˜T(x) is nonempty, there existx∈T(x) and <q<–ba such that
δx,T(x)
≤qd(x,x)
and (x,x)∈E(G). Sincex∈T(x), we get that (x,x)∈E(G)∩Graph(T). By (i), takingy=xandx=x, we have that
δx,T(x)
≤ad(x,x) +bδ
x,T(x)
≤ad(x,x) +bqd(x,x).
Hence,
δx,T(x)
≤(a+bq)d(x,x). (.)
Forx∈X(sinceX˜T(x)=∅), there existsx∈T(x) such thatδ(x,T(x))≤qd(x,x) and (x,x)∈E(G). Butx∈T(x) and so (x,x)∈E(G)∩Graph(T).
Then
d(x,x)≤δ
x,T(x)
≤(a+bq)d(x,x). (.)
By (i), takingy=xandx=x, we have that
δx,T(x)
≤ad(x,x) +bδ
x,T(x)
≤ad(x,x) +bqd(x,x) = (a+bq)d(x,x)≤(a+bq)d(x,x).
By these procedures, we obtain a sequence (xn)n∈Nwith the following properties:
() d(xn,xn+)≤(a+bq)nd(x,x)for eachn∈N;
() δ(xn,T(xn))≤(a+bq)nd(x,x)for eachn∈N.
From () we obtain that the sequence (xn)n∈N is Cauchy. Since the metric spaceXis complete, we have that the sequence is convergent,i.e.,xn→x∗asn→ ∞. Now, by the
lower semicontinuity of the functionf, we have
≤fx∗≤lim inf
n→∞ f(xn) = .
Thusf(x∗) = , which means thatδ(x∗,T(x∗)) = . Thusx∗∈SFix(T).
Letx∗∈Fix(T). Then (x∗,x∗)∈Graph(T) and hence (x∗,x∗)∈E(G)∩Graph(T). Using (i) withx=y=x∗, we obtain
δTx∗=δx∗,Tx∗≤adx∗,x∗+bδx∗,Tx∗.
So,δ(T(x∗))≤bδ(T(x∗)). If we suppose thatcardT(x∗) > , thenδ(T(x∗)) > . Thus,b≥, which contradicts the hypothesis.
Thusδ(T(x∗)) = and soT(x∗) ={x∗}. The proof is now complete.
Remark . Example . satisfies the conditions from Theorem . fora= . andb= ..
3 Well-posedness of the fixed point problem
In this section we present some well-posedness results for the fixed point problem. We consider both the well-posedness and the well-posedness in the generalized sense for a multivalued operatorT.
We begin by recalling the definition of these notions from [] and [].
Definition . Let (X,d) be a metric space and letT:X→P(X) be a multivalued opera-tor. By definition, the fixed point problem is well posed forTwith respect toHif:
(i) SFix(T) ={x∗};
(ii) If(xn)n∈Nis a sequence inXsuch thatH(xn,T(xn))→asn→ ∞, thenxn d
→x∗as
n→ ∞.
Definition . Let (X,d) be a metric space and letT:X→P(X) be a multivalued opera-tor. By definition, the fixed point problem is well posed in the generalized sense forTwith respect toHif:
(i) SFixT=∅;
(ii) If(xn)n∈Nis a sequence inXsuch thatH(xn,T(xn))→asn→ ∞, then there exists
a subsequence(xkn)n∈Nof(xn)n∈Nsuch thatxkn
d
→x∗asn→ ∞.
In our first result we will establish the well-posedness of the fixed point problem for the operatorT, whereTis a Reich-typeδ-contraction.
Theorem . Let(X,d)be a complete metric space and let G be a directed graph such that the triple(X,d,G)satisfies the property(P).
Let T:X→Pb(X)be a multivalued operator.Suppose that
(ii) ifx∗,y∗∈Fix(T),then(x∗,y∗)∈E(G);
(iii) for any sequence(xn)n∈N,xn∈XwithH(xn,T(xn))→asn→ ∞,we have
(xn,x∗)∈E(G).
In these conditions the fixed point problem is well posed for T with respect to H.
Proof From (i) and (ii) we obtain thatSFix(T) ={x∗}. Let (xn)n∈N⊂Xbe a sequence which
satisfies (iii). It is obvious thatH(xn,T(xn)) =δ(xn,T(xn)),
dxn,x∗
≤δxn,T
x∗≤δxn,T(xn)
+δT(xn),T
x∗
≤δxn,T(xn)
+adxn,x∗
+bδxn,T(xn)
+cδx∗,Tx∗.
Thus
dxn,x∗
≤ +b
–aδ
xn,T(xn)
→ asn→ ∞.
Hence,xn→x∗asn→ ∞.
Remark . If we replace the property (P) with the condition thatT has a closed graph, we reach the same conclusion.
The next result deals with the well-posedness of the fixed point problem in the general-ized sense.
Theorem . Let(X,d)be a complete metric space and let G be a directed graph such that the triple(X,d,G)satisfies the property(P).
Let T:X→Pb(X)be a multivalued operator.Suppose that
(i) conditions(i)and(ii)in Theorem.hold;
(ii) for any sequence(xn)n∈N,xn∈XwithH(xn,T(xn))→asn→ ∞,there exists a
subsequence(xkn)n∈Nsuch that(xkn,x∗)∈E(G)andH(xkn,T(xkn))→.
In these conditions the fixed point problem is well posed in the generalized sense for T with respect to H.
Proof From (i) we have thatSFix(T)=∅. Let (xn)n∈N⊂Xbe a sequence which satisfies
(ii). Then there exists a subsequence (xkn)n∈Nsuch that (xkn,x∗)∈E(G).
We haveH(xkn,T(xkn)) =δ(xkn,T(xkn)),
dxkn,x∗
≤δxkn,T
x∗≤δxkn,T(xkn)
+δT(xkn),T
x∗
≤δxkn,T(xkn)
+adxkn,x∗
+bδxkn,T(xkn)
+cδx∗,Tx∗.
Thus
dxkn,x∗
≤ +b
–aδ
xkn,T(xkn)
→ asn→ ∞.
Hence,xkn→x∗.
Next we consider the case where the operatorTsatisfies aϕ-contraction condition.
Theorem . Let(X,d)be a complete metric space and let G be a directed graph such that the triple(X,d,G)satisfies the property(P).
Let T:X→Pb(X)be a multivalued operator.Suppose that
(i) conditions(i)and(ii)in Theorem.hold;
(ii) the following implication holds:x∗,y∗∈Fix(T)implies(x∗,y∗)∈E(G);
(iii) the functionψ:R+→R+,given byψ(t) =t–ϕ(t),has the following property:if
ψ(tn)→asn→ ∞,thentn→asn→ ∞;
(iv) for any sequence(xn)n∈N⊂XwithH(xn,T(xn))→asn→ ∞,we have
(xn,x∗)∈E(G)for alln∈N.
In these conditions the fixed point problem is well posed for T with respect to H.
Proof From (i) and (ii) we obtain thatSFix(T) ={x∗}. Let (xn)n∈N,xn∈Xbe a sequence
which satisfies (iv). It is obvious thatH(xn,T(xn)) =δ(xn,T(xn)),
dxn,x∗
≤δxn,T
x∗≤δxn,T(xn)
+δT(xn),T
x∗
≤δxn,T(xn)
+ϕdxn,x∗
.
Thus
dxn,x∗
–ϕdxn,x∗
≤δxn,T(xn)
→ asn→ ∞.
Using condition (iii), we get thatd(xn,x∗)→ asn→ ∞. Hence,xn→x∗.
Remark . If we replace the property (P) with the condition thatThas a closed graph, we reach the same conclusion.
The next result gives a well-posedness (in the generalized sense) criterion for the fixed point problem.
Theorem . Let(X,d)be a complete metric space and let G be a directed graph such that
the triple(X,d,G)satisfies the property(P).
Let T:X→Pb(X)be a multivalued operator.Suppose that
(i) the conditions(i)and(ii)in Theorem.hold;
(ii) the functionψ:R+→R+,givenψ(t) =t–ϕ(t),has the following property:for any sequence(tn)n∈N,there exists a subsequence(xkn)n∈Nsuch that ifψ(tkn)→as
n→ ∞,thentkn→asn→ ∞;
(iii) for any sequence(xn)n∈N,xn∈XwithH(xn,T(xn))→asn→ ∞,there exists a
subsequence(xkn)n∈Nsuch that(xkn,x∗)∈E(G)andH(xkn,T(xkn))→.
In these conditions the fixed point problem is well posed in the generalized sense for T with respect to H.
Proof From (i) we have thatSFix(T)=∅. Let (xn)n∈N,xn∈Xbe a sequence which satisfies
We haveH(xkn,T(xkn)) =δ(xkn,T(xkn)),
dxkn,x∗
≤δxkn,T
x∗≤δxkn,T(xkn)
+δT(xkn),T
x∗
≤δxkn,T(xkn)
+ϕdxkn,x∗
.
Thus
dxkn,x
∗–ϕdx
kn,x
∗≤δx
kn,T(xkn)
→ asn→ ∞.
Using condition (ii), we get thatd(xkn,x∗)→ asn→ ∞. Hence,xn→x∗.
Remark . If we replace the property (P) with the condition thatThas a closed graph, we reach the same conclusion.
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors read and approved the final manuscript. The authors have equal contributions to this paper.
Author details
1Department of Business, Babe¸s-Bolyai University Cluj-Napoca, Horea street, No. 7, Cluj-Napoca, Romania.2Department
of Mathematics, Babe¸s-Bolyai University Cluj-Napoca, Kogalniceanu street, No. 1, Cluj-Napoca, Romania.
Acknowledgements
The third author is supported by a grant of the Romanian National Authority for Scientific Research, CNCS UEFISCDI, project number PN-II-ID-PCE-2011-3-0094.
Received: 8 May 2013 Accepted: 10 July 2013 Published: 29 July 2013
References
1. Jachymski, J: The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc.136, 1359-1373 (2008)
2. Gwó´zd´z-Lukawska, G, Jachymski, J: IFS on a metric space with a graph structure and extensions of the Kelisky-Rivlin theorem. J. Math. Anal. Appl.356, 453-463 (2009)
3. Nicolae, A, O’Regan, D, Petru¸sel, A: Fixed point theorems for singlevalued and multivalued generalized contractions in metric spaces endowed with a graph. Georgian Math. J.18, 307-327 (2011)
4. Beg, I, Butt, AR, Radojevic, S: The contraction principle for set valued mappings on a metric space with a graph. Comput. Math. Appl.60, 1214-1219 (2010)
5. Reich, S: Fixed point of contractive functions. Boll. Unione Mat. Ital.5, 26-42 (1972)
6. Reich, S: Some problems and recent results in fixed point theory. In: Topol. Methods in Nonlinear Funct. Anal. Contemporary Math., vol. 21, pp. 179-187 (1983)
7. Harjani, J, Sadarangani, K: Fixed point theorems for weakly contractive mappings in partially ordered sets. Nonlinear Anal.71, 3403-3410 (2009)
8. Nieto, JJ, Rodríguez-López, R: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order22, 223-239 (2005)
9. Nieto, JJ, Rodríguez-López, R: Existence and uniqueness of fixed points in partially ordered sets and applications to ordinary differential equations. Acta Math. Sin. Engl. Ser.23, 2205-2212 (2007)
10. Nieto, JJ, Pouso, RL, Rodríguez-López, R: Fixed point theorems in ordered abstract spaces. Proc. Am. Math. Soc.135, 2505-2517 (2007)
11. O’Regan, D, Petru¸sel, A: Fixed point theorems in ordered metric spaces. J. Math. Anal. Appl.341, 1241-1252 (2008) 12. Petru¸sel, A, Rus, IA: Fixed point theorems in orderedL-spaces. Proc. Am. Math. Soc.134, 411-418 (2006)
13. Ran, ACM, Reurings, MC: A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc.132, 1435-1443 (2004)
14. Petru¸sel, A, Rus, IA: Well-posedness of the fixed point problem for multivalued operators. In: Cârj˘a, O, Vrabie, II (eds.) Applied Analysis and Differential Equations, pp. 295-306. World Scientific, Hackensack (2007)
15. Petru¸sel, A, Rus, IA, Yao, J-C: Well-posedness in the generalized sense of the fixed point problems for multivalued operators. Taiwan. J. Math.11, 903-914 (2007)
doi:10.1186/1687-1812-2013-203