1 Preliminaries

The concept of metric type or b-metric space was introduced and studied by Bakhtin [1] and Czerwik [2]. Since then several papers have dealt with fixed point theory for single-valued and multivalued operators in b-metric and cone b-metric spaces (see [312] and references therein). Khmasi and Hussain [13] and Hussain and Shah [14] discussed KKM mappings and related results in metric and cone metric type spaces.

Definition 1.1 Let X be a set. Let D:X×X[0,) be a function which satisfies

  1. (1)

    D(x,y)=0 if and only if x=y;

  2. (2)

    D(x,y)=D(y,x), for any x,yX;

  3. (3)

    D(x,y)K(D(x,z)+D(z,y)), for any points x,y,zX, for some constant K1.

The pair (X,D) is called a metric type space.

Definition 1.2 Let (X,D) be a metric type space.

  1. (1)

    The sequence { x n } converges to xX if and only if lim n D( x n ,x)=0.

  2. (2)

    The sequence { x n } is Cauchy if and only if lim n , m D( x n , x m )=0.

(X,D) is complete if and only if any Cauchy sequence in X is convergent.

Example 1.3 Let X be the set of Lebesgue measurable functions on [0,1] such that

0 1 | f ( x ) | 2 dx<.

Define D:X×X[0,) by

D(f,g)= 0 1 | f ( x ) g ( x ) | 2 dx.

Then D satisfies the following properties:

  1. (1)

    D(f,g)=0 if and only if f=g;

  2. (2)

    D(f,g)=D(g,f), for any f,gX;

  3. (3)

    D(f,g)2(D(f,h)+D(h,g)), for any functions f,g,hX.

Example 1.4 Let (R,||) be metric space. Define

  1. (1)

    D 1 (x,y)= | x y | 2 for any x,yX;

  2. (2)

    D 2 (x,y)= | x y | 2 + | 1 x 1 y | 2 , for any x,yX.

Then (R, D i ), i=1,2 are metric type spaces with K=2.

Definition 1.5 Let (X,D) be a metric type space. A subset AX is said to be open if and only if for any aA, there exists ε>0 such that the open ball B o (a,ε)A. The family of all open subsets of X will be denoted by τ.

Theorem 1.6 ([13])

τ defines a topology on (X,D).

Theorem 1.7 ([13])

Let (X,D) be a metric type space and τ be the topology defined above. Then for any nonempty subset AX we have

  1. (1)

    A is closed if and only if for any sequence { x n } in A which converges to x, we have xA;

  2. (2)

    if we define A ¯ to be the intersection of all closed subsets of X which contains A, then for any x A ¯ and for any ε>0, we have

    B o (a,ε)A.

Theorem 1.8 ([13])

Let (X,D) be a metric type space and τ be the topology defined above. Let AX. The following properties are equivalent:

  1. (1)

    A is compact;

  2. (2)

    For any sequence { x n } in A, there exists a subsequence { x n k } of { x n } which converges, and lim n k x n k A.

Definition 1.9 The subset A is called sequentially compact if and only if for any sequence { x n } in A, there exists a subsequence { x n k } of { x n } which converges, and lim n k x n k A. Also A is called totally bounded if for any ε>0 there exits x 1 , x 2 ,, x n A such that

A B o ( x 1 ,ε) B o ( x n ,ε).

Theorem 1.10 ([13])

Let (X,D) be a metric type space and τ be the topology defined above. Let AX. The following properties are equivalent:

  1. (1)

    A is compact if and only if A is sequentially compact.

  2. (2)

    If A is compact, then A is totally bounded.

Corollary 1.11 Every closed subset of a complete metric type space is complete.

Theorem 1.12 ([15])

Let (X,D) be a metric type space and suppose that { x n } and { y n } converge to x,yX, respectively. Then we have

  1. (1)
    1 K 2 D(x,y) lim inf n D( x n , y n ) lim sup n D( x n , y n ) K 2 D(x,y).

    In particular, if x=y, then lim n D( x n , y n )=0.

  2. (2)

    Moreover, for each zX, we have

    1 K D(x,z) lim inf n D( x n ,z) lim sup n D( x n ,z)KD(x,y).

2 Topologically complete metrizable type spaces

Lemma 2.1 Let (X,D) be a metric type space and let λ(0,1) then there exists a metric type E on X such that E(x,y)λ, for each x,yX, and E and D induce the same topology on X.

Proof We define E(x,y)=min{λ,D(x,y)}. We claim that E is metric type on X. The properties (1) and (2) are immediate from the definition. For the triangle inequality, suppose that x,y,zX. Then E(x,z)λ and so E(x,z)E(x,y)+E(y,z) when either E(x,y)=λ or E(y,z)=λ. The only remaining case is when E(x,y)=D(x,y)<λ and E(y,z)=D(y,z)<λ. But D(x,z)K(D(x,y)+D(y,z)) and E(x,z)D(x,z) and so E(x,z)K(E(x,y)+E(y,z)). Thus E is a metric type on X. It only remains to show that the topology induced by E is the same as that induced by D. But we have E( x n ,x)0 if and only if min{λ,D( x n ,x)}0 if and only if D( x n ,x)0, and we are done. □

The metric type E in the above lemma is said to be bounded by λ.

Definition 2.2 Let (X,D) be a metric type space, xX and AX. We define

Δ(x,A)=inf { D ( x , y ) : y A } .

Definition 2.3 A topological space is called a (topologically complete) metrizable type space if there exists a (topologically complete) metric type D inducing the given topology on it.

Example 2.4 Let X=(0,1]. The metric type space (X, D 1 ) is not complete because the Cauchy sequence {1/n} in this space is not convergent. Now, if we consider (X, D 2 ). It is straightforward to show that (X, D 2 ) is complete. Since x n tend to x with respect to the metric type D 1 if and only if | x n x | 2 0 if and only if x n tend to x with respect to the metric type D 2 , then D 1 and D 2 are equivalent. Hence the metric type space (X, D 1 ) is topologically complete metrizable type.

Lemma 2.5 Metrizability type is preserved under countable Cartesian product.

Proof Without loss of generality we may assume that the index set is ℕ. Let {( X n , D n ):nN} be a collection of metrizable type spaces. Let τ n be the topology induced by D n on X n for nN and let (X,τ) be the Cartesian product of {( X n , τ n ):nN} with product topology. We have to prove that there is a metric type D on X which induces the topology τ. By the above lemma, we may suppose that D n is bounded by 2 n for all nN, otherwise we replace D n by another metric type which induces the same topology and which is bounded by 2 n . Points of X= n N X n are denoted as sequences x={ x n } with x n X n for nN. Define D(x,y)= n = 1 D n ( x n , y n ), for each x,yX. First note that D is well defined since n = 1 i 2 n is convergent. Also D is a metric type on X because each D n is of a metric type. Let U be the topology induced by the metric type D. We claim that U coincides with τ. If GU and x={ x n }G, then there exists r>0 such that B(x,r)G. Now choose NN such that n = 1 i 2 n < r 2 . For each n=1,2,, N 0 , let V n =B( x n , r 2 N ), where the ball is with respect to the metric type D n . Let V n = X n for n> N 0 . Put V= n N V n , then xV and V is an open set in the product topology τ on X. Furthermore VB(x,r), since for each yV

D ( x , y ) = n = 1 D n ( x n , y n ) = n = 1 N 0 D n ( x n , y n ) + n = N 0 + 1 D n ( x n , y n ) N ( r 2 N ) + n = N 0 + 1 2 n < r 2 + r 2 = r .

Hence VB(x,r)G. Therefore G is open in the product topology. Conversely suppose G is open in the product topology and let x={ x n }G. Choose a standard basic open set V such that xV and VG. Let V= n N V n , where each V n is open in X n and V n = X n for all n> N 0 . For n=1,2,, N 0 , let r n = Δ n ( x n , X n V n ), if X n V n , and r n = 2 n , otherwise, let r=min{ r 1 , r 2 ,, r N 0 }. We claim that B(x,r)V. If y={ y n }B(x,r), then D(x,y)= n = 1 D n ( x n , y n )<r and so D n ( x n , y n )<r r n for each n=1,2,, N 0 . Then y n V n , for n=1,2,, N 0 . Also for n> N 0 , y n V n = X n . Hence yV and so B(x,r,t)VG. Therefore G is open with respect to the metric type topology and τU. Hence τ and U coincide. □

Theorem 2.6 An open subspace of a complete metrizable type space is a complete metrizable type space.

Proof Let (X,D) be a complete metric type space and G an open subspace of X. If the restriction of D to G is not complete we can replace D on G by another metric type as follows. Define f:G R + by f(x)= 1 Δ ( x , X G ) (f is undefined if XG is empty, but then there is nothing to prove). For x,yG define

E(x,y)=D(x,y)+ | f ( x ) f ( y ) | .

It is clear that D is of metric type on G.

We show that E and D are of the type of equivalent metrics on G. We do this by showing that for arbitrary sequence { x n } converges to xX, D( x n , x m )0 if and only if E( x n , x m )0. Since E(x,y)D(x,y) for all x,yG, D( x n , x m )0 whenever E( x n , x m )0. To prove the converse, let D( x n , x m )0, and using Theorem 1.12, we have

lim sup n Δ ( x n , X G ) = lim sup n ( inf { D ( x n , y ) : y X G } ) lim sup n D ( x n , y ) = K D ( x , y ) .

Therefore

lim sup n Δ( x n ,XG)KΔ(x,XG).
(1)

On the other hand, there exists a y 0 XG, the positive sequence { a n } converges to zero, and n 0 N such that for every n n 0 we have

1 K 2 ( Δ ( x n , X G ) + a n ) D( x n , y 0 ).

Then

lim inf n 1 K 2 Δ ( x n , X G ) lim inf n D ( x n , y 0 ) 1 K D ( x , y 0 ) 1 K Δ ( x , X G ) ,

and

lim inf n Δ( x n ,XG)KΔ(x,XG).
(2)

By (1) and (2), we have

lim n Δ( x n ,XG)=KΔ(x,XG).

This implies |f( x n )f( x m )|0. Hence E( x n , x m )0. Therefore E and D are equivalent. Next we show that E is a complete metric type. Suppose that { x n } is a Cauchy sequence in G with respect to E. Since for each m,nN, E( x m , x n )D( x m , x n ), therefore { x n } is also a Cauchy sequence with respect to D. By completeness of (X,D), { x n } converges to point p in X. We claim that pG. Assume otherwise, then for each nN, if pXG and D( x n ,p)Δ( x n ,XG). Therefore

1 Δ ( x n , X G ) 1 D ( x n , p ) .

That is

f( x n ) 1 D ( x n , p ) .

Therefore as n, we get f( x n ). On the other hand, |f( x n )f( x m )|E( x m , x n ), for every m,nN, that is, {f( x n )} is a bounded sequence. This contradiction shows that pG. Hence { x n } converges to p with respect to E and (G,E) is a complete metrizable type space. □

Theorem 2.7 (Alexandroff)

A G δ set in a complete metric type space is a topologically complete metrizable type space.

Proof Let (X,D) be a complete metric type space and G be a G δ set in X, that is, G= n = 1 G n , where each G n is open in X. By the above theorem, there exists a complete metric type D n on G n and we may assume that D n is bounded by 2 n . Let ℋ be the Cartesian product n = 1 G n with the product topology. Then ℋ is a complete metrizable type space. Now, for each nN let f n :G G n be the inclusion map. So the evaluation map e:GH is an embedding. Image of e is the diagonal DG which is a closed subset of ℋ and by Corollary 1.11, DG is complete. Thus DG is a complete metrizable type space and so is G which is homeomorphic to it. □

3 wt-Distance

Kada et al. [16] introduced in 1996, the concept of w-distance on a metric space and proved some fixed point theorems. In this section, we introduce the definition of a wt-distance and we state a lemma which we will use in the main sections of this work.

Definition 3.1 Let (X,D) be a metric type space with constant K1. Then a function P:X×X[0,) is called a wt-distance on X if the following are satisfied:

  1. (a)

    P(x,z)K(P(x,y)+P(y,z)) for any x,y,zX;

  2. (b)

    for any xX, P(x,):X[0,) is K-lower semi-continuous;

  3. (c)

    for any ε>0, there exists δ>0 such that P(z,x)δ and P(z,y)δ imply D(x,y)ε.

Let us recall that a real-valued function f defined on a metric type space X is said to be lower K-semi-continuous at a point x 0 in X if either lim inf x n x 0 f( x n )= or f( x 0 ) lim inf x n x 0 Kf( x n ), whenever x n X for each nN and x n x 0 [17].

Let us give some examples of wt-distance.

Example 3.2 Let (X,D) be a metric type space. Then the metric D is a wt-distance on X.

Proof (a) and (b) are obvious. To show (c), for any ε>0, put δ= ε 2 K . Then we see that P(x,z)δ and P(z,y)δ imply D(x,y)ε. □

Example 3.3 Let X=R and D 1 (x,y)= ( x y ) 2 . Then the function P:X×X[0,) defined by P(x,y)= | x | 2 + | y | 2 for every x,yX is a wt-distance on X.

Proof (a) and (b) are obvious. To show (c), for any ε>0, put δ= ε 2 . Then we have

D 1 (x,y)= ( x y ) 2 | x | 2 + | y | 2 P(z,x)+P(z,y)δ+δ=ε.

 □

Example 3.4 Let X=R and D 1 (x,y)= ( x y ) 2 . Then the function P:X×X[0,) defined by P(x,y)= | y | 2 for every x,yX is a wt-distance on X.

Proof (a) and (b) are obvious. To show (c), for any ε>0, put δ= ε 2 . Then we have

D 1 (x,y)= ( x y ) 2 | x | 2 + | y | 2 =P(z,x)+P(z,y)δ+δ=ε.

 □

Lemma 3.5 Let (X,D) be a metric type space with constant K1 and P be a wt-distance on X. Let { x n } and { y n } be sequences in X, let { α n } and { β n } be sequences in [0,) converging to zero, and let x,y,zX. Then the following hold:

  1. (1)

    If P( x n ,y) α n and P( x n ,z) β n for any nN, then y=z. In particular, if P(x,y)=0 and P(x,z)=0, then y=z;

  2. (2)

    if P( x n , y n ) α n and P( x n ,z) β n for any nN, then D( y n ,z)0;

  3. (3)

    if P( x n , x m ) α n for any n,mN with m>n, then { x n } is a Cauchy sequence;

  4. (4)

    if P(y, x n ) α n for any nN, then { x n } is a Cauchy sequence.

Proof The proof is similar to [16]. □

4 Fixed point theorems

We introduce first the following concept.

Definition 4.1 Suppose (X,) is a partially ordered set and f:XX be a self mapping on X. We say f is inverse increasing if for x,yX,

f(x)f(y)impliesxy.
(3)

Our first main result is a fixed point theorem for graphic contractions on a partially ordered metric space endowed with a wt-distance.

Theorem 4.2 Let (X,) be a partially ordered set and let D:X×X[0,) be a metric type on X such that (X,D) is a complete metric type space with constant K1. Suppose that P is a wt-distance in (X,D). Let A:XX be a non-decreasing mapping and there exists r[0,1) such that

P ( A x , A 2 x ) rP(x,Ax),for all xAx,
(4)

and Kr<1. Suppose also that:

  1. (i)

    for every xX with xAx

    inf { P ( x , y ) + P ( x , A x ) } >0,for every yX with yAy;
    (5)
  2. (ii)

    there exists x 0 X such that x 0 A x 0 .

Then A has a fixed point in X.

Proof If A x 0 = x 0 , then the proof is finished. Suppose that

A x 0 x 0 .

Since x 0 A x 0 and A is non-decreasing, we obtain

x 0 A x 0 A 2 x 0 A n + 1 x 0 .

Hence, for each nN we have

P ( A n x 0 , A n + 1 x 0 ) r n P( x 0 ,A x 0 ).
(6)

Then, for nN with m>n, we successively have

P ( A n x 0 , A m x 0 ) K P ( A n x 0 , A n + 1 x 0 ) + K 2 P ( A n + 1 x 0 , A n + 2 x 0 ) + + K m n 2 [ P ( A m 2 x 0 , A m 1 x 0 ) + P ( A m 1 x 0 , A m x 0 ) ] r n K P ( x 0 , A x 0 ) + + r m 1 K m n 2 P ( x 0 , A x 0 ) K r n ( 1 + K r + K 2 r 2 + ) P ( x 0 , A x 0 ) K r n 1 K r P ( x 0 , A x 0 ) .

By Lemma 3.5(3), we conclude that { A n x 0 } is Cauchy sequence in (X,D). Since (X,D) is a complete metric type space, there exists zX such that

lim n A n x 0 =z.

Let nN be an arbitrary but fixed. Then since { A n x 0 } converges to z in (X,D) and P( A n x 0 ,) is K-lower semi-continuous, we have

P ( A n x 0 , z ) lim inf m KP ( A n x 0 , A m x 0 ) K 2 r n 1 K r P( x 0 ,A x 0 ).

Assume that zAz. Since A n x 0 A n + 1 x 0 , by (5), we have

0 < inf { P ( A n x 0 , z ) + P ( A n x 0 , A n + 1 x 0 ) } inf { K 2 r n 1 K r P ( x 0 , A x 0 ) + r n P ( x 0 , A x 0 ) } = 0 .

This is a contradiction. Therefore, we have z=Az. □

Another result of this type is the following.

Theorem 4.3 Let (X,) be a partially ordered set, let D:X×X[0,) be of a metric type on X such that (X,D) is a complete metric type space with constant K1. Suppose that P is a wt-distance in (X,D). Let A:XX be a non-decreasing mapping and there exists r[0,1) such that

P ( A x , A 2 x ) rP(x,Ax),for all xAx
(7)

and Kr<1. Assume that one of the following assertions holds:

  1. (i)

    for every xX with xAx

    inf { P ( x , y ) + P ( x , A x ) } >0,for every yX with yAy;
    (8)
  2. (ii)

    if both { x n } and {A x n } converge to y, then y=Ay;

  3. (iii)

    A is continuous.

If there exists x 0 X with x 0 A x 0 , then A has a fixed point in X.

Proof The case (i), was proved in Theorem 4.2.

Let us prove first that (ii) ⟹ (i). Assume that there exists yX with yAy such that

inf { P ( x , y ) + P ( x , A x ) : x A x } =0.

Then there exists { z n }X such that z n A z n and

lim n { P ( z n , y ) + P ( z n , A z n ) } =0.

Then P( z n ,y)0 and P( z n ,A z n )0. By Lemma 3.5, we have that A z n y. We also have

P ( z n , A 2 z n ) P ( z n , A z n ) + P ( A z n , A 2 z n ) ( 1 + r ) P ( z n , A z n ) 0 .

Again by Lemma 3.5, we get A 2 z n y. Put x n =A z n . Then both { x n } and {A x n } converges to y. Thus, by (ii) we have y=Ay. Thus (ii) ⟹ (i) holds.

Now, we show that (iii) ⟹ (ii). Let A be continuous. Further assume that { x n } and {A x n } converges to y. Then we have

Ay=A ( lim n x n ) = lim n x n =y.

 □

5 Common fixed point theorem for commuting mappings

The following theorem was given by Jungck [18] and it represents a generalization of the Banach contraction principle in complete metric spaces.

Theorem 5.1 Let f be a continuous self mapping on a complete metric space (X,d) and let g:XX be another mapping, such that the following conditions are satisfied:

  1. (a)

    g(X)f(X);

  2. (b)

    g commutes with f;

  3. (c)

    d(g(x),g(y))kd(f(x),f(y)), for all x,yX and for some 0k<1.

Then f and g have a unique common fixed point.

The next example shows that if the mapping f:XX is continuous with respect to a metric type D on X and g:XX satisfies the condition

P ( g ( x ) , g ( y ) ) rP ( f ( x ) , f ( y ) ) ,for all x,yX and some r[0,1),

then, in general, g may be not continuous in (X,D).

Example 5.2 Let X:=(R,||) be a normed linear space. Consider Example 3.4 with wt-distance defined by

P(x,y)= | y | 2 for every x,yR.

Consider the functions f and g defined by f(x)=4 and

g(x)={ 1 , if  x Q , 0 , if  x R Q .

Then

P ( g ( x ) , g ( y ) ) = | g ( y ) | 2 1 ( 1 3 ) P ( f ( x ) , f ( y ) ) = | f ( y ) | 2 3 = 16 3 .

Definition 5.3 Let (X,) be a partially ordered set and g,h:XX. By definition, we say that g is h-non-decreasing if for x,yX,

h(x)h(y)impliesg(x)g(y).
(9)

Our next result is a generalization of the above mentioned result of Jungck [18], for the case of a weak contraction with respect to a wt-distance.

Theorem 5.4 Let (X,) be a partially ordered set, let D:X×X[0,) be a metric type on X such that (X,D) is a complete metric type space with constant K1. Suppose that P is a wt-distance on X. Let f,g:XX be mappings that satisfy the following conditions:

  1. (a)

    g(X)f(X);

  2. (b)

    g is f-non-decreasing and f is inverse increasing;

  3. (c)

    g commutes with f and f, g are continuous in (X,D);

  4. (d)

    P(g(x),g(y))rP(f(x),f(y)) for all x,yX with xy and some 0<r<1 such that rK<1.

  5. (e)

    there exists x 0 X such that:

    1. (i)

      f( x 0 )g( x 0 ) and

    2. (ii)

      f( x 0 )f(g( x 0 )).

Then f and g have a common fixed point uX. Moreover, if g(v)= g 2 (v) for all vX, then P(u,u)=0.

Proof We claim that for every f(x)g(x)

inf { P ( f ( x ) , g ( x ) ) + P ( f ( x ) , z ) + P ( g ( x ) , z ) + P ( g ( x ) , g ( g ( x ) ) ) } >0

for every zX with g(z)g(g(z)). For the moment suppose the claim is true. Let x 0 X with f( x 0 )g( x 0 ). By (a) we can find x 1 X such that f( x 1 )=g( x 0 ). By induction, we can define a sequence { x n } n X such that

f( x n )=g( x n 1 ).
(10)

Since f( x 0 )g( x 0 ) and f( x 1 )=g( x 0 ), we have

f( x 0 )f( x 1 ).
(11)

Then from (b),

g( x 0 )g( x 1 ),

that means, by (10), that f( x 1 )f( x 2 ). Again by (b) we get

g( x 1 )g( x 2 ),

that is, f( x 2 )f( x 3 ). By this procedure, we obtain

g( x 0 )g( x 1 )g( x 2 )g( x 3 )g( x n )g( x n + 1 ).
(12)

Hence from (10) and (12) we have f( x n 1 )f( x n ) and by (3) we have x n 1 x n . By induction we get

P ( f ( x n ) , f ( x n + 1 ) ) = P ( g ( x n 1 ) , g ( x n ) ) r P ( f ( x n 1 ) , f ( x n ) ) r n P ( f ( x 0 ) , f ( x 1 ) )

for n=1,2, . This implies that, for m,nN with m>n,

P ( f ( x n ) , f ( x m ) ) K m n 2 [ P ( f ( x m 1 , f ( x m ) ) + p ( f ( x m 2 ) , f ( x m 1 ) ) ] + + K P ( f ( x n ) , f ( x n + 1 ) ) < K r n ( 1 + K r + K r 2 + ) P ( f ( x 0 ) , f ( x 1 ) ) K r n 1 K r P ( f ( x 0 ) , f ( x 1 ) ) .

Thus, by Lemma 3.5, we find that {f( x n )} is a Cauchy sequence in (X,D). Since (X,D) is complete, there exists yX such that lim n f( x n )=y. As a result the sequence g( x n 1 )=f( x n ) tends to y as n+ and hence { g ( f ( x n ) ) } n converges to g(y) as n+. However, g(f( x n ))=f(g( x n )), by the commutativity of f and g, implies that f(g( x n )) converges to f(y) as n+. Because limit is unique, we get f(y)=g(y) and, thus, f(f(y))=f(g(y)). On the other hand, by K-lower semi-continuity of P(x,) we have, for each nN,

P ( f ( x n ) , y ) lim inf m P ( f ( x n ) , f ( x m ) ) K 2 r n 1 K r P ( f ( x 0 ) , f ( x 1 ) ) , P ( g ( x n ) , y ) lim inf m P ( f ( x n + 1 ) , f ( x m ) ) K 2 r n 1 K r P ( f ( x 0 ) , f ( x 1 ) ) .

Notice that, by (11), (10), and (9), we obtain f( x 0 )f(f( x 1 )) and thus, by (9), we get g( x 0 )g(f( x 1 )). Then

f( x 1 )g ( f ( x 1 ) ) =f ( g ( x 1 ) ) =f ( f ( x 2 ) ) .

By (9) we get g( x 1 )g(f( x 2 )) and thus f( x 2 )f(g( x 2 )). Continuing this process we get

f( x n )f ( g ( x n ) ) ,n=0,1,2,3,,

and by (3) we get

x n g( x n ),n=0,1,2,3,.

Using now the condition (d), we have

P ( g ( x n ) , g ( g ( x n ) ) ) r P ( f ( x n ) , f ( g ( x n ) ) ) = r P ( g ( x n 1 ) , g ( g ( x n 1 ) ) ) r 2 P ( f ( x n 1 ) , f ( g ( x n 1 ) ) ) = r 2 P ( g ( x n 2 ) , g ( g ( x n 2 ) ) ) r n P ( f ( x 1 ) , g ( f ( x 1 ) ) ) .

We will show that g(y)=g(g(y)). Suppose, by contradiction, that g(y)g(g(y)). Then we have

0 < inf { P ( f ( x ) , g ( x ) ) + P ( f ( x ) , y ) + P ( g ( x ) , y ) + P ( g ( x ) , g ( g ( x ) ) ) : x X } inf { P ( f ( x n ) , g ( x n ) ) + P ( f ( x n ) , y ) + P ( g ( x n ) , y ) + P ( g ( x n ) , g ( g ( x n ) ) ) : n N } = inf { P ( f ( x n ) , f ( x n + 1 ) ) + P ( f ( x n ) , y ) + P ( g ( x n ) , y ) + P ( g ( x n ) , g ( g ( x n ) ) ) : n N } inf n { r n P ( f ( x 0 ) , f ( x 1 ) ) + K 2 r n 1 K r P ( f ( x 0 ) , f ( x 1 ) ) + K 2 r n + 1 1 K r P ( f ( x 0 ) , f ( x 1 ) ) + r n P ( f ( x 1 ) , g ( f ( x 1 ) ) ) : n N } = 0 .

This is a contradiction. Therefore g(y)=g(g(y)). Thus, g(y)=g(g(y))=f(g(y)). Hence u:=g(y) is a common fixed point of f and g.

Furthermore, since g(v)=g(g(v)) for all vX, we have

P ( g ( y ) , g ( y ) ) = P ( g ( g ( y ) ) , g ( g ( y ) ) ) r P ( f ( g ( y ) ) , f ( g ( y ) ) ) = r P ( g ( y ) , g ( y ) ) ,

which implies that P(g(y),g(y))=0.

Now it remains to prove the initial claim. Assume that there exists yX with g(y)g(g(y)) and

inf { P ( f ( x ) , g ( x ) ) + P ( f ( x ) , y ) + p ( g ( x ) , y ) + P p ( g ( x ) , g ( g ( x ) ) ) : x X } =0.

Then there exists { x n } such that

lim n { P ( f ( x n ) , g ( x n ) ) + P ( f ( x n ) , y ) + P ( g ( x n ) , y ) + P ( g ( x n ) , g ( g ( x n ) ) ) } =0.

Since P(f( x n ),g( x n ))0 and P(f( x n ),y)0, by Lemma 3.5, we have

lim n g( x n )=y.
(13)

Also, since P(g( x n ),y)0 and P(g( x n ),g(g( x n )))0, by Lemma 3.5, we have

lim n g ( g ( x n ) ) =y.
(14)

By (13), (14), and the continuity of g we have

g(y)=g ( lim n g ( x n ) ) = lim n g ( g ( x n ) ) =y.

Therefore, g(y)=g(g(y)), which is a contradiction. Hence, if g(y)g(g(y)), then

inf { P ( f ( x ) , g ( x ) ) + P ( f ( x ) , y ) + P ( g ( x ) , y ) + P ( g ( x ) , g ( g ( x ) ) ) : x X } >0.

 □

Example 5.5 Let X:=(R,||) be a normed linear space. Consider Example 3.4 with wt-distance defined by

P(x,y)= | y | 2 for every x,yR.

Consider the functions f and g defined by f(x)=3x and g(x)= 2 x. Then

P ( g ( x ) , g ( y ) ) = | g ( y ) | 2 =2 y 2 ( 1 3 ) P ( f ( x ) , f ( y ) ) = | f ( y ) | 2 3 = 9 y 2 3 .

Put K=2. Then all conditions of Theorem 5.4 hold and u=0 is the common fixed point of f and g and P(0,0)= | 0 | 2 =0.