Fixed point theorems for Reich type contractions on metric spaces with a graph

https://doi.org/10.1016/j.na.2012.02.009Get rights and content

Abstract

Let (X,d) be a metric space endowed with a graph G such that the set V(G) of vertices of G coincides with X. We define the notion of G-Reich type maps and obtain a fixed point theorem for such mappings. This extends and subsumes many recent results which were obtained for other contractive type mappings on ordered metric spaces and for cyclic operators.

Introduction

Let T be a selfmap of a metric space (X,d). Following Petruşel and Rus [1], we say that T is a Picard operator (abbr., PO) if T has a unique fixed point x and limnTnx=x for all xX and is called a weakly Picard operator (abbr. WPO) if the sequence (Tnx)nN converges, for all xX and the limit (which may depends on x) is a fixed point of T.

Let (X,d) be a metric space. Let Δ denote the diagonal of the Cartesian product X×X. Consider a directed graph G such that the set V(G) of its vertices coincides with X, and the set E(G) of its edges contains all loops, i.e., E(G)Δ. We assume G has no parallel edges, so we can identify G with the pair (V(G),E(G)). Moreover, we may treat G as a weighted graph (see [2, p. 309]) by assigning to each edge the distance between its vertices. By G1 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(G1)={(x,y)(y,x)G}. The letter G̃ denotes the undirected graph obtained from G by ignoring the direction of edges. Actually, it will be more convenient for us to treat G̃ as a directed graph for which the set of its edges is symmetric. Under this convention, E(G̃)=E(G)E(G1). We call (V,E) a subgraph of G if VV(G),EE(G) and, for any edge (x,y)E,x,yV.

Now we recall a few basic notions concerning the connectivity of graphs. All of them can be found, e.g., in [2]. If x and y are vertices in a graph G, then a path in G from x to y of length N(NN) is a sequence (xi)i=0N of N+1 vertices such that x0=x,xN=y and (xn1,xn)E(G) for i=1,,N. A graph G is connected if there is a path between any two vertices. G is weakly connected if G̃ is connected. If G is such that E(G) is symmetric and x is a vertex in G, then the subgraph Gx 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(Gx)=[x]G, where [x]G is the equivalence class of the following relation R defined on V(G) by the rule: yRz if there is a path in G from y to z. Clearly, Gx is connected.

Now we discuss some types of continuity of mappings. The first of them is well known and often used in the metric fixed point theory.

Definition 1

A mapping T:XX is called orbitally continuous if for all xX and any sequence (kn)nN of positive integers, TknxyX implies T(Tknx)Ty as n.

Definition 2

A mapping T:XX is called orbitally G-continuous if given xX and a sequence (xn)nN, xnxand(xn,xn+1)E(G)for nN imply TxnTx.

Recently, some results have appeared giving sufficient conditions for a mapping to be a PO if (X,d) is endowed with a graph. The first result in this direction was given by Jachymski [3] who also presented its applications to the Kelisky–Rivlin theorem on iterates of the Bernstein operators on the space C[0,1].

Definition 3 [3, Definition 2.1]

We say that a mapping f:XX is a Banach G-contraction or simply a G-contraction if f preserves edges of G, i.e., x,yX((x,y)E(G)(f(x),f(y))E(G)) and f decreases weights of edges of G in the following way: α(0,1),x,yX((x,y)E(G)d(f(x),f(y))αd(x,y)).

The main result in [3] is giving by the next theorem.

Theorem 1 [3, Theorem 3.2]

Let (X,d) be complete, and let the triple (X,d,G) have the following property.

For any (xn)nN in X, if xnx and (xn,xn+1)E(G) for nNthen there is a subsequence (xkn)nN with (xkn,x)E(G)for nN.

Let f:XX be a Banach G-contraction, and Xf={xX|(x,fx)E(G)} . Then the following statements hold.

  • 1.

    card Fixf=card{[x]G̃|xXf}.

  • 2.

    FixfiffXf.

  • 3.

    f has a unique fixed point iff there exists x0Xf such that Xf[x0]G̃.

  • 4.

    For any xXf,f|[x]G̃ is a PO.

  • 5.

    If Xf and G is weakly connected, then f is a PO.

  • 6.

    If X{[x]G̃|xG}then f|X is a WPO.

  • 7.

    If fE(G), then f is a WPO.

Subsequently, Bega et al. [4] extended Theorem 1 for set valued mappings.

Definition 4 [4, Definition 2.6]

Let F:XX be a set valued mapping with nonempty closed and bounded values. The mapping F is said to be a G-contraction if there exists a k(0,1) such that D(Fx,Fy)kd(x,y)for all x,yE(G) and if uFx and vFy are such that d(u,v)kd(x,y)+α,for each α>0 then (u,v)E(G).

Theorem 2 [4, Theorem 3.1]

Let (X,d) be a complete metric space and suppose that the triple (X,d,G) has the property.

For any (xn)nN in X, if xnx and (xn,xn+1)E(G) for nNthen there is a subsequence (xkn)nN with (xkn,x)E(G) for nN.

Let F:XX be a G-contraction andXf={xX:(x,u)E(G) for some uF(x)}.Then the following statements hold.

  • 1.

    For any xXF,F|[x]G̃ has a fixed point.

  • 2.

    If XF and G is weakly connected, then F has a fixed point in X.

  • 3.

    If X{[x]G̃:xXF}, then F|X has a fixed point.

  • 4.

    If FE(G)then F has a fixed point.

  • 5.

    FixF if and only if XF.

In [5], the author considered the problem of existence of a fixed point for φ-contractions in metric spaces endowed with a graph.

Definition 5

Let (X,d) be a metric space and G a graph. The mapping T:XX is said to be a (G,φ)contraction if:

  • 1.

    x,yX((x,y)E(G)(Tx,Ty)E(G));

  • 2.

    there exists a comparison function φ:R+R+ such that: d(Tx,Ty)φ(d(x,y)) for all (x,y)E(G).

Using this concept the author proved in [5] the following theorem.

Theorem 3

Let (X,d) be a metric space endowed with a graph G and T:XX be an operator. We suppose that:

  • (i)

    G is weakly connected;

  • (ii)

    for any sequence (xn)nNX with d(xn,xn+1)0there exists k,n0N such that (xkn,xkm)E(G) for all m,nNm,nn0 ;

  • (iii)a

    T is orbitally continuous

  • or

  • (iii)b

    T is orbitally G-continuous and there exists a subsequence (Tnkx0)kN of (Tnx0)nN such that (Tnkx0,x)E(G) for each kN ;

  • (iv)

    there exists a comparison function φ:R+R+ such that T is a (G,φ)contraction ;

  • (v)

    the metric d is complete.

Then T is a PO.

We recall the following concept.

Definition 6

Let (X,d) be a metric space. The operator T:XX is called a C̀iric̀–Reich–Rus operator if there exist nonnegative numbers a,b,c with a+b+c<1, such that: d(Tx,Ty)ad(x,y)+bd(x,Tx)+cd(y,Ty), for all x,yX.

Remark 1

Using the symmetry of distance, the above condition is equivalent with: there exist nonnegative numbers α and β with α+2β<1 such that: d(Tx,Ty)αd(x,y)+β[d(x,Tx)+d(y,Ty)], for all x,yX.

Reich [6], Ćirić [7] and Rus [8] proved that if (X,d) is complete, then every C̀iric̀–Reich–Rus operator has a unique fixed point. The aim of this paper is to study the existence of fixed points for C̀iric̀–Reich–Rus operator in metric spaces endowed with a graph G by introducing the concept of G-C̀iric̀–Reich–Rus operators.

Section snippets

Main results

Throughout this section, we assume that (X,d) is a metric space, and G is a directed graph such that V(G)=X,E(G)Δ and the graph G has no parallel edges. The set of all fixed points of a mapping T is denoted by FixT.

In this section, by using the idea of Jachymski [3], we will consider the following concept.

Definition 7

Let (X,d) be a metric space. The operator T:XX is said to be a G-C̀iric̀–Reich–Rus operator if:

  • 1.

    ((x,y)E(G)(Tx,Ty)E(G)),x,yX;

  • 2.

    there exists nonnegative numbers a,b,c with a+b+c<1, such

Acknowledgment

The research was supported by the Grant PN-II-ID-PCE-2011-3-0087 of the Romanian Ministry of Education and Research.

References (9)

  • A. Petruşel et al.

    Fixed point theorems in ordered L-spaces

    Proc. Amer. Math. Soc.

    (2006)
  • R. Johnsonbaugh

    Discrete Math.

    (1997)
  • J. Jachymski

    The contraction principle for mappings on a metric space with a graph

    Proc. Amer. Math. Soc.

    (2008)
  • I. Bega et al.

    The contraction principle for set valued mappings on a metric space with a graph

    Comput. Math. Appl.

    (2010)
There are more references available in the full text version of this article.

Cited by (151)

  • On a pair of fuzzy dominated mappings on closed ball in the multiplicative metric space with applications

    2022, Fuzzy Sets and Systems
    Citation Excerpt :

    Banach [7] proved significant result for contraction mappings. Due to its significance, a large number of authors proved different significant extensions of his result (see [1–39]). Bashirov et al., [8] introduced the notion of multiplicative calculus and demonstrated the fundamental theorem of multiplicative calculus.

  • Solution of differential equations with infinite delay via coupled fixed point

    2022, Heliyon
    Citation Excerpt :

    Jachymski [19] proved some interesting results in metric spaces endowed with a graph by considering graphs rather than partial order. Then after, many researchers presented some fixed point theorems [5, 6, 7, 8, 10]. Following this line, many coupled fixed point results in metric space endowed with a directed graph were considered by many authors, for example see [1, 9, 11, 12, 14].

View all citing articles on Scopus
View full text