Skip to main content

Fixed point theorems in ordered metric spaces via w-distances

Abstract

The purpose of this paper is to prove some fixed point theorems in a complete metric space equipped with a partial ordering employing generalized distances together with altering distance functions.

MSC:54H25, 47H10.

1 Introduction

The existing literature of metric fixed point theory contains numerous noted generalizations of the Banach contraction mapping principle (e.g., [1] and [2]). One variety of such generalizations is the contractive fixed point theorems contained in Khan et al. [1] wherein the authors utilized altering functions to alter the distance between two points in a metric space. Such altering functions are also sometimes referred to as control functions.

The following altering distance function is instrumental in our forthcoming results.

Definition A (cf. [1])

A map ϕ:[0,∞)→[0,∞) is said to be an altering distance function if

  1. (a)

    Ï• is continuous and nondecreasing and

  2. (b)

    Ï•(t)=0 if and only if t=0.

Using the function Ï•, Khan et al. [1] proved the following result.

Theorem A (cf. [1])

Let T be a self-mapping defined on a complete metric space (X,d) satisfying the condition

ϕ ( d ( T x , T y ) ) ≤c⋅ϕ ( d ( x , y ) )

for x,y∈X and 0<c<1, where ϕ is the earlier described altering distance function. Then T has a unique fixed point.

In the recent past, the idea of altering function has been utilized by many researchers (e.g., [1–12]). Quite recently, Alber and Guerre-Delabriere [13] initiated the study of weakly contractive mappings which were initially confined to Hilbert spaces. Rhoades [11] utilized this idea in the context of complete metric spaces and proved the following interesting theorem.

Theorem B (cf. [11])

Let T be a self-mapping defined on a complete metric space (X,d) satisfying the condition

d(Tx,Ty)≤d(x,y)−ϕ ( d ( x , y ) )

for x,y∈X, where ϕ is the earlier described altering distance function. Then T has a unique fixed point.

In fact, Alber and Guerre-Delabriere assumed the additional assumption lim t → ∞ ϕ(t)=∞ (on ϕ). But Rhoades [11] proved his theorem without this requirement on ϕ.

In [5], Dutta and Choudhury presented a generalization of Theorem B by proving the following result.

Theorem C (cf. [5])

Let T be a self-mapping defined on a complete metric space (X,d) satisfying the condition

ψ ( d ( T x , T y ) ) ≤ψ ( d ( x , y ) ) −ϕ ( d ( x , y ) ) , for x,y∈X,

where ψ and ϕ are altering distance functions. Then T has a unique fixed point.

The purpose of this paper is to prove some fixed point theorems in ordered metric spaces employing a w-distance as well as altering functions. Recall that the concept of w-distance was initiated by Kada, Suzuki, and Takahashi [7] and was primarily utilized to improve Caristi’s fixed point theorem [4], Ekeland’s variational principle [6], and the nonconvex minimization theorems whose descriptions and details are available in Takahashi [14]. The existence of a fixed point on partially ordered metric spaces has been a relatively new development in metric fixed point theory. In [10], Ran and Reurings proved an analogue of Banach’s fixed point theorem in a partially ordered metric space besides discussing some applications to matrix equations. In fact, Ran and Reurings have weakened the usual contraction condition but merely up to monotone operators. Proving new fixed point theorems in an ordered metric space setting to improve earlier stated theorems have been a subject of vigorous research interest; for the literature of this kind one can be referred to [5, 8, 9, 15]. Our results, in this paper, not only generalize the analogous fixed point theorems but are relatively simpler and more natural than the related ones. Our improvements in this paper are indeed four-fold:

  1. (i)

    a generalized distance is used instead of metric,

  2. (ii)

    a relatively more general contraction condition is used,

  3. (iii)

    the continuity of the involved mapping is weakened to orbital continuity, and

  4. (iv)

    the comparability conditions used by earlier authors are also sharpened.

2 Preliminaries

Before presenting our results, we collect relevant definitions and results which will be needed in the proof of our main results.

Definition 1 Let X be a nonempty set. Then (X,d,⪯) is called a partially ordered metric space if

  1. (i)

    (X,⪯) is a partially ordered set and

  2. (ii)

    (X,d) is a metric space.

Definition 2 Let (X,⪯) be a partially ordered set. Then

  1. (a)

    elements x,y∈X are called comparable with respect to ‘⪯’ if either x⪯y or y⪯x;

  2. (b)

    a mapping T:X→X is called nondecreasing with respect to ‘⪯’ if x⪯y implies Tx⪯Ty.

Definition 3 [7, 16]

Let (X,d) be a metric space. Then a function p:X×X→[0,∞) is called a w-distance on X if the following conditions are satisfied:

  1. (a)

    p(x,z)≤p(x,y)+p(y,z) for any x,y,z∈X,

  2. (b)

    for any x∈X, p(x,⋅):X→[0,∞) is lower semi-continuous (i.e., if x∈X and y n →y in X, then p(x,y)≤ lim inf n p(x, y n )),

  3. (c)

    for any ϵ>0, there exists δ>0 such that p(x,z)≤δ and p(z,y)≤δ imply d(x,y)≤ϵ.

Clearly, every metric is a w-distance but not conversely. The following example substantiates this fact.

Example 1 Let (X,d) be a metric space. A function p:X×X→[0,∞) defined by p(x,y)=k for every x,y∈X is a w-distance on X, where k is a positive real number. But p is not a metric since p(x,x)=k≠0 for any x∈X.

Definition 4 Let T:X→X be a function. Then

  1. (a)

    FT={x∈X|x=T(x)} (i.e., FT is the set of fixed points of T),

  2. (b)

    the function T is called a Picard operator (briefly, PO) if there exists x ∗ ∈X such that FT={ x ∗ } and { T n (x)} converges to x ∗ for all x∈X,

  3. (c)

    the function T is called orbitally U-continuous for any U⊂X×X if for any x∈X, T n i (x)→a∈X as i→∞ and ( T n i (x),a)∈U for any i∈N imply that T n i + 1 (x)→Ta as i→∞.

Let (X,⪯) be a partially ordered set. Let us denote by X ⪯ the subset of X×X defined by

X ⪯ = { ( x , y ) ∈ X × X | x ⪯ y  or  y ⪯ x } .

Definition 5 A map T:X→X is said to be orbitally continuous if x∈X and T n i (x)→a∈X as i→∞ imply that T n i + 1 (x)→Ta as i→∞.

The following two lemmas are crucial in the proofs of our main results.

Lemma 1 [7, 17]

Let (X,d) be a metric space equipped with a w-distance p. Let { x n } and { y n } be sequences in X, whereas { α n } and { β n } be sequences in [0,∞) converging to zero. Then the following conditions hold (for x,y,z∈X):

  1. (i)

    if p( x n ,y)≤ α n and p( x n ,z)≤ β n for n∈N, then y=z. In particular, if p(x,y)=0 and p(x,z)=0, then y=z,

  2. (ii)

    if p( x n , y n )≤ α n and p( x n ,z)≤ β n for n∈N, then lim n → ∞ d( y n ,z)=0,

  3. (iii)

    if p( x n , x m )≤ α n for n,m∈N with m>n, then { x n } is a Cauchy sequence,

  4. (iv)

    if p(y, x n )≤ α n for n∈N, then { x n } is a Cauchy sequence.

Lemma 2 [7]

Let p be a w-distance on a metric space (X,d) and { x n } be a sequence in X such that for each ϵ>0, there exists N ϵ ∈N such that m>n> N ϵ implies p( x n , x m )<ϵ (or lim m , n p( x n , x m )=0). Then { x n } is a Cauchy sequence.

3 Main results

Now, we present our main result as follows.

Theorem 1 Let (X,d,⪯) be a complete partially ordered metric space equipped with a w-distance p and T:X→X be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 ∈X such that ( x 0 ,T x 0 )∈ X ⪯ ,

  2. (b)

    there exist two altering distance functions ψ, ϕ such that

    ψ ( p ( T x , T y ) ) ≤ψ( M x , y )−ϕ( M x , y )

for all (x,y)∈ X ⪯ , where

M x , y =max { p ( x , y ) , min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } } ,
  1. (c)

    either T is orbitally continuous at x 0 or

(c′) T is orbitally X ⪯ -continuous, and there exists a subsequence { T n k x 0 } of { T n x 0 } converging to x ∗ such that ( T n k x 0 , x ∗ )∈ X ⪯ for any k∈N.

Then FT≠∅.

Proof If x 0 =T x 0 for some x 0 ∈X, then there is nothing to prove. Otherwise, let there be x 0 ∈X such that x 0 ≠T x 0 and ( x 0 ,T x 0 )∈ X ⪯ . Owing to monotonicity of T, we can write (T x 0 , T 2 x 0 )∈ X ⪯ . Continuing this process inductively, we obtain

( T n x 0 , T m x 0 ) ∈ X ⪯

for any n,m∈N. Now, we proceed to show that

lim n → ∞ p ( T n x 0 , T n + 1 x 0 ) =0.
(3.1)

Write p 0 =p( x 0 ,T x 0 ) and p n =p( T n x 0 , T n + 1 x 0 ) for any n∈N.

By using condition (b), we have

ψ ( p n ) = ψ ( p ( T n x 0 , T n + 1 x 0 ) ) ≤ ψ ( max { p ( T n − 1 x 0 , T n x 0 ) , min { p ( T n − 1 x 0 , T n x 0 ) , p ( T n x 0 , T n + 1 x 0 ) , p ( T n x 0 , T n − 1 x 0 ) , p ( T n + 1 x 0 , T n x 0 ) } } ) − ϕ ( max { p ( T n − 1 x 0 , T n x 0 ) , min { p ( T n − 1 x 0 , T n x 0 ) , p ( T n x 0 , T n + 1 x 0 ) , p ( T n x 0 , T n − 1 x 0 ) , p ( T n + 1 x 0 , T n x 0 ) } } ) ,

so that

ψ( p n )≤ψ( p n − 1 )−ϕ( p n − 1 )

for any n∈N.

Also,

ψ( p n )≤ψ( p n − 1 )−ϕ( p n − 1 )≤ψ( p n − 1 ).
(3.2)

Therefore, p n ≤ p n − 1 for every n∈N (owing to monotonicity of ψ), i.e., the sequence { p n } is decreasing so that for the nonnegative decreasing sequence { p n }, there exists some r≥0 such that

lim n → ∞ p n = lim n → ∞ p ( T n x 0 , T n + 1 x 0 ) =r.
(3.3)

Assume that r>0. On letting n→∞ in (3.2) besides using (3.3), we get

ψ(r)≤ψ(r)−ϕ(r)≤ψ(r),

which amounts to say that Ï•(r)=0. As Ï• is an altering (distance) function, r=0, which is a contradiction to nonzeroness of r yielding thereby

lim n → ∞ p n = lim n → ∞ p ( T n x 0 , T n + 1 x 0 ) =0,

which establishes (3.1).

Proceeding with earlier lines, we can also show that

lim n → ∞ p ( T n + 1 x 0 , T n x 0 ) =0.
(3.4)

Write p 0 =p(T x 0 , x 0 ) and p n =p( T n + 1 x 0 , T n x 0 ) for any n∈N.

Now, using (b), we get

ψ ( p n ) = ψ ( p ( T n + 1 x 0 , T n x 0 ) ) ≤ ψ ( max { p ( T n x 0 , T n − 1 x 0 ) , min { p ( T n x 0 , T n + 1 x 0 ) , p ( T n − 1 x 0 , T n x 0 ) , p ( T n + 1 x 0 , T n x 0 ) , p ( T n x 0 , T n − 1 x 0 ) } } ) − ϕ ( max { p ( T n x 0 , T n − 1 x 0 ) , min { p ( T n x 0 , T n + 1 x 0 ) , p ( T n − 1 x 0 , T n x 0 ) , p ( T n + 1 x 0 , T n x 0 ) , p ( T n x 0 , T n − 1 x 0 ) } } ) = ψ ( p n − 1 ) − ϕ ( p n − 1 ) ,

so that

ψ( p n )≤ψ( p n − 1 )−ϕ( p n − 1 )≤ψ( p n − 1 ),

which amounts to say that p n ≤ p n − 1 , i.e., a nonnegative sequence { p n } is decreasing. As earlier, we have

lim n → ∞ p ( T n + 1 x 0 , T n x 0 ) =0,

which proves (3.4). Now, we proceed to show

lim n , m → ∞ p ( T n x 0 , T m x 0 ) =0.
(3.5)

Suppose (3.5) is untrue. Then we can find a δ>0 with sequences { m k } k = 1 ∞ , { n k } k = 1 ∞ such that

p ( T n k x 0 , T m k x 0 ) ≥δ,for all k∈{1,2,3,…},
(3.6)

wherein m k > n k . By (3.1) there exists k 0 ∈N such that n k > k 0 implies

p ( T n k x 0 , T n k + 1 x 0 ) <δ.
(3.7)

Notice that in view of (3.6) and (3.7), m k ≠ n k + 1 . We can assume that m k is a minimum index such that (3.6) holds so that

p ( T n k x 0 , T r x 0 ) <δ,for r∈{ n k + 1 , n k + 2 ,…, m k −1},

which in view of (3.6) gives rise to

o < δ ≤ p ( T n k x 0 , T m k x 0 ) ≤ p ( T n k x 0 , T m k − 1 x 0 ) + p ( T m k − 1 x 0 , T m k x 0 ) < δ + p ( T m k − 1 x 0 , T m k x 0 ) ,

so that

lim k → ∞ p ( T n k x 0 , T m k x 0 ) =δ.

Next, we show that

lim sup k p ( T n k + 1 x 0 , T m k + 1 x 0 ) =ϵ<δ.

If lim sup k p( T n k + 1 x 0 , T m k + 1 x 0 )=ϵ≥δ, then there exists { k r } r = 1 ∞ such that

lim r → ∞ p ( T n k r + 1 x 0 , T m k r + 1 x 0 ) =ϵ≥δ.

Since ψ is continuous and nondecreasing and also ( T n k r x 0 , T m k r x 0 )∈ X ⪯ , on using condition (b), one gets

ψ ( p ( T n k r + 1 x 0 , T m k r + 1 x 0 ) ) ≤ψ( M T n k r x 0 , T m k r x 0 )−ϕ( M T n k r x 0 , T m k r x 0 )
(3.8)

with

M T n k r x 0 , T m k r x 0 = max { p ( T n k r x 0 , T m k r x 0 ) , min { p ( T n k r x 0 , T n k r + 1 x 0 ) , p ( T m k r x 0 , T m k r + 1 x 0 ) , p ( T n k r + 1 x 0 , T n k r x 0 ) , p ( T m k r + 1 x 0 , T m k r x 0 ) } } ,

implying thereby

lim r → ∞ M T n k r x 0 , T m k r x 0 =max{0,δ}=δ.
(3.9)

Letting k→∞ in (3.8) and using (3.9), we get

ψ(δ)≤ψ(ϵ)≤ψ(δ)−ϕ(δ)≤ψ(δ),

so that ϕ(δ)=0 implying thereby δ=0, which is a contradiction. Hence,

lim sup k p ( T n k + 1 x 0 , T m k + 1 x 0 ) <δ,

and we have

o < δ ≤ p ( T n k x 0 , T m k x 0 ) ≤ p ( T n k x 0 , T n k + 1 x 0 ) + p ( T n k + 1 x 0 , T m k + 1 x 0 ) + p ( T m k + 1 x 0 , T m k x 0 ) .

Therefore, owing to (3.1) and (3.4), we have

o < δ ≤ lim k → ∞ p ( T n k x 0 , T n k + 1 x 0 ) + lim sup k → ∞ p ( T n k + 1 x 0 , T m k + 1 x 0 ) + lim k → ∞ p ( T m k + 1 x 0 , T m k x 0 ) = lim sup k → ∞ p ( T n k + 1 x 0 , T m k + 1 x 0 ) < δ ,

which is a contradiction. Hence, (3.5) holds. Owing to Lemma 2, { T n x 0 } is a Cauchy sequence in X. Since X is a complete metric space, there exists x ∗ such that lim n → ∞ T n x 0 = x ∗ .

Now, we show that x ∗ is a fixed point of T. If (c) holds, then T n + 1 x 0 →T x ∗ (as n→∞). By lower semi-continuity of p( T n x 0 ,⋅), we have

On using (3.5), we have lim n → ∞ α n = lim n → ∞ β n =0. Now, in view of Lemma 1, we conclude that

T x ∗ = x ∗ .

Next, suppose that (c′) holds. Since { T n k x 0 } converges to x ∗ , ( T n k x 0 , x ∗ )∈ X ⪯ and T is X ⪯ -continuous, it follows that { T n k + 1 x 0 } converges to T x ∗ . As earlier, by lower semi-continuity of p( T n x 0 ,⋅), we conclude that T x ∗ = x ∗ . This completes the proof. □

Setting ψ=I (the identity mapping) in Theorem 1, we deduce the following corollary.

Corollary 1 Let (X,d,⪯) be a complete partially ordered metric space equipped with a w-distance p and T:X→X be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 ∈X such that ( x 0 ,T x 0 )∈ X ⪯ ,

  2. (b)

    there exists an altering distance function Ï• such that

    p(Tx,Ty)≤ M x , y −ϕ( M x , y )

for all (x,y)∈ X ⪯ , where

M x , y =max { p ( x , y ) , min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } } ,
  1. (c)

    either T is orbitally continuous at x 0 or

(c′) T is orbitally X ⪯ -continuous, and there exists a subsequence { T n k x 0 } of { T n x 0 } which converges to x ∗ such that ( T n k x 0 , x ∗ )∈ X ⪯ for any k∈N.

Then FT≠∅.

Choosing ψ=I (the identity mapping) and Ï•(t)=(1−α)t (for all t∈[0,∞)) in Theorem 1, we deduce the following corollary.

Corollary 2 Let (X,d,⪯) be a complete partially ordered metric space equipped with a w-distance p and T:X→X be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 ∈X such that ( x 0 ,T x 0 )∈ X ⪯ ,

  2. (b)

    if for all (x,y)∈ X ⪯ and α∈[0,1),

    p(Tx,Ty)≤α M x , y ,

where

M x , y =max { p ( x , y ) , min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } } ,
  1. (c)

    either T is orbitally continuous at x 0 or

(c′) T is orbitally X ⪯ -continuous, and there exists a subsequence { T n k x 0 } of { T n x 0 } which converges to x ∗ such that ( T n k x 0 , x ∗ )∈ X ⪯ for any k∈N.

Then FT≠∅.

As an application of Corollary 2, we can also prove the following related result.

Theorem 2 Let (X,d,⪯) be a complete partially ordered metric space equipped with a w-distance p and T:X→X be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 ∈X such that ( x 0 ,T x 0 )∈ X ⪯ ,

  2. (b)

    for all (x,y)∈ X ⪯ ,

    p(Tx,Ty)≤αp(x,y)+β ( min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } ) ,

where α,β≥0 and α+β<1,

  1. (c)

    either T is orbitally continuous at x 0 or

(c′) T is orbitally X ⪯ -continuous, and there exists a subsequence { T n k x 0 } of { T n x 0 } which converges to x ∗ such that ( T n k x 0 , x ∗ )∈ X ⪯ for any k∈N.

Then FT≠∅.

Proof On using condition (b), we can write

p ( T x , T y ) ≤ α p ( x , y ) + β ( min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } ) ≤ ( α + β ) max { p ( x , y ) , min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } } ,

where k=α+β∈[0,1). Therefore, all the conditions of Corollary 2 are satisfied, which ensures the conclusion. □

Corollary 3 Let (X,d,⪯) be a complete partially ordered metric space equipped with a w-distance p and T:X→X be a nondecreasing mapping. Suppose that

  1. (a)

    there exists x 0 ∈X such that ( x 0 ,T x 0 )∈ X ⪯ ,

  2. (b)

    for all (x,y)∈ X ⪯ ,

    ∫ 0 p ( T x , T y ) θ(ξ)dξ≤α ∫ 0 max { p ( x , y ) , min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } } θ(ξ)dξ,

where 0≤α<1, and θ: R + → R + is a Lebesgue integrable mapping which is summable and ∫ 0 ϵ θ(ξ)dξ>0 (for each ϵ>0),

  1. (c)

    either T is orbitally continuous at x 0 or

(c′) T is orbitally X ⪯ -continuous, and there exists a subsequence { T n k x 0 } of { T n x 0 } which converges to x ∗ such that ( T n k x 0 , x ∗ )∈ X ⪯ for any k∈N.

Then FT≠∅.

Proof Choose ψ(t)= ∫ 0 t θ(ξ)dξ and Ï•(t)=(1−α) ∫ 0 t θ(ξ)dξ (for all t∈[0,∞)). Clearly, ψ and Ï• are altering distance functions. Now, in view of Theorem 1, result follows. □

Remark 1 In Theorem 1, let p=d, and ψ=I (identity) and Ï•=(1−α)t (0≤α<1). Then Theorem 1 is the classical Banach fixed point theorem.

Lemma 3 Let (X,d,⪯) be a complete partially ordered metric space and T:X→X be a map wherein p is a w-distance on (X,d). If

  1. (a)

    x ∗ ∈FT,

  2. (b)

    there exist two altering distance functions ψ, ϕ such that

    ψ ( p ( T x , T y ) ) ≤ψ( M x , y )−ϕ( M x , y )

for all (x,y)∈ X ⪯ , with

M x , y =max { p ( x , y ) , min { p ( x , T x ) , p ( y , T y ) , p ( T x , x ) , p ( T y , y ) } } ,

then p( x ∗ , x ∗ )=0.

Proof Suppose p( x ∗ , x ∗ )≠0. As ( x ∗ , x ∗ )∈ X ⪯ and

M x ∗ , x ∗ = max { p ( x ∗ , x ∗ ) , min { p ( x ∗ , T x ∗ ) , p ( x ∗ , T x ∗ ) , p ( T x ∗ , x ∗ ) , p ( T x ∗ , x ∗ ) } } = p ( x ∗ , x ∗ ) .

Therefore,

ψ ( p ( T x ∗ , T x ∗ ) ) =ψ ( p ( x ∗ , x ∗ ) ) ≤ψ ( p ( x ∗ , x ∗ ) ) −ϕ ( p ( x ∗ , x ∗ ) ) ≤ψ ( p ( x ∗ , x ∗ ) ) ,

which amounts to say that ϕ(p( x ∗ , x ∗ ))=0. As ϕ is an altering distance function, we infer that p( x ∗ , x ∗ )=0. This completes the proof. □

In what follows, we give a sufficient condition for the uniqueness of a fixed point in Theorem 1 which runs as follows:

(A): for every x,y∈X, there exists a lower bound or an upper bound.

In [9], it is proved that condition (A) is equivalent to the following one:

(B): for every x,y∈X, there exists z=c(x,y)∈X for which (x,z)∈ X ⪯ and (y,z)∈ X ⪯ .

4 Results with uniqueness

Theorem 3 With the addition of condition (B) to the hypotheses of Theorem  1, the fixed point of T turns out to be unique. Moreover,

lim n → ∞ T n (x)= x ∗

for every x∈X provided x ∗ ∈FT, i.e., the map T:X→X is a Picard operator.

Proof Following the proof of Theorem 1, FT≠∅. Suppose there exist two fixed points x ∗ and y ∗ of T in X. We distinguish two cases.

Case 1: If ( y ∗ , x ∗ )∈ X ⪯ , owing to condition (b) (of Theorem 1) and Lemma 3, we have

ψ ( p ( T y ∗ , T x ∗ ) ) ≤ψ( M y ∗ , x ∗ )−ϕ( M y ∗ , x ∗ ).

As

M y ∗ , x ∗ = max { p ( y ∗ , x ∗ ) , min { p ( y ∗ , T y ∗ ) , p ( x ∗ , T x ∗ ) , p ( T y ∗ , y ∗ ) , p ( T x ∗ , x ∗ ) } } = p ( y ∗ , x ∗ ) ,

therefore

ψ ( p ( T y ∗ , T x ∗ ) ) ≤ψ ( p ( y ∗ , x ∗ ) ) −ϕ ( p ( y ∗ , x ∗ ) ) ≤ψ ( p ( y ∗ , x ∗ ) ) ,

which amounts to say that ϕ(p( y ∗ , x ∗ ))=0. As ϕ is an altering distance function, therefore, for every n∈N,

p ( y ∗ , x ∗ ) =0.

Also, in view of Lemma 3, we get p( y ∗ , y ∗ )=0, and by using Lemma 1, we have y ∗ = x ∗ , i.e., the fixed point of T is unique.

Case 2: If ( x ∗ , y ∗ )∉ X ⪯ , then owing to condition (B), there exists z∈X such that ( x ∗ ,z)∈ X ⪯ and ( y ∗ ,z)∈ X ⪯ . As (z, x ∗ )∈ X ⪯ , due to monotonicity of T, we get ( T n − 1 z, x ∗ )∈ X ⪯ for any n∈N, and henceforth

ψ ( p ( T n z , x ∗ ) ) =ψ ( p ( T n z , T x ∗ ) ) ≤ψ( M T n − 1 z , x ∗ )−ϕ( M T n − 1 z , x ∗ ),

with

therefore

ψ ( p ( T n z , x ∗ ) ) = ψ ( p ( T n z , T x ∗ ) ) ≤ ψ ( p ( T n − 1 z , x ∗ ) ) − ϕ ( p ( T n − 1 z , x ∗ ) ) ≤ ψ ( p ( T n − 1 z , x ∗ ) ) .

Since ψ is a nondecreasing function, therefore p( T n z, x ∗ )≤p( T n − 1 z, x ∗ ), i.e., the nonnegative sequence {p( T n z, x ∗ )} is decreasing. As earlier, we have

lim n → ∞ p ( T n z , x ∗ ) =0.

Also, since (z, y ∗ )∈ X ⪯ , therefore proceeding as earlier, we can prove that

lim n → ∞ p ( T n z , y ∗ ) =0.

By using this and Lemma 1, we infer that y ∗ = x ∗ , i.e., the fixed point of T is unique.

Now, we proceed to show

lim n → ∞ T n (x)= x ∗

for every x∈X provided x ∗ ∈ F T . We distinguish two cases.

Case 1: Let x∈X and ( x ∗ ,x)∈ X ⪯ . As earlier, we have

lim n → ∞ p ( T n x ∗ , T n x ) =0.

Also, in view of Lemma 3, we have

lim n → ∞ p ( T n x ∗ , x ∗ ) =0,

and by using Lemma 1, we get

lim n → ∞ T n (x)= x ∗ .

Case 2: Let x∈X and ( x ∗ ,x)∉ X ⪯ . Owing to condition (B), there exists some z in X such that ( x ∗ ,z)∈ X ⪯ and (x,z)∈ X ⪯ . As earlier, we can prove lim n → ∞ p( T n z, x ∗ )=0 and lim n → ∞ p( x ∗ , T n z)=0. By the triangular inequality,

p ( T n z , T n z ) ≤p ( T n z , x ∗ ) +p ( x ∗ , T n z ) ,

one gets

lim n → ∞ p ( T n z , T n z ) =0.

Since (x,z)∈ X ⪯ , due to monotonicity of T, we can write (Tx,Tz)∈ X ⪯ . Continuing this process inductively, we obtain

( T n x , T n z ) ∈ X ⪯ .

Now, we proceed to show that

lim inf n p ( T n z , T n x ) =0.

Suppose lim inf n p( T n z, T n x)=δ>0. Since lim n → ∞ p( T n z, T n z)=0, then for arbitrary ϵ (0<ϵ<δ), there exists N 1 ∈N such that for every n> N 1 , we have p( T n z, T n z)<ϵ. Also, since lim inf n p( T n z, T n x)=δ>ϵ>0, then there exists N 2 ∈N such that for every n> N 2 , we have p( T n z, T n x)>ϵ. Therefore, for every n>N=max{ N 1 , N 2 }, we have

Now, on using (b), for every n>N, we get

ψ ( p ( T n z , T n x ) ) ≤ψ ( p ( T n − 1 z , T n − 1 x ) ) −ϕ ( p ( T n − 1 z , T n − 1 x ) ) ≤ψ ( p ( T n − 1 z , T n − 1 x ) ) .

Therefore, as ψ is an altering distance function, we get the nonnegative sequence {p( T n z, T n x)} is decreasing. As earlier, we can prove lim n → ∞ p( T n z, T n x)=0, which is indeed a contradiction to nonzeroness of δ, implying thereby

lim inf n p ( T n z , T n x ) =0.

Also, since ( x ∗ ,z)∈ X ⪯ , therefore using the arguments of the earlier case, we can prove

lim n → ∞ p ( T n z , T n x ∗ ) =0,

and by lower semi-continuity p( T n z,â‹…), we have

As lim n → ∞ α n = lim n → ∞ β n =0, thus, in view of Lemma 1, we conclude that

lim n → ∞ T n (x)= x ∗ .

This completes the proof. □

Corollary 4 With the addition of condition (B) to the hypotheses of Corollary  1 (or Corollary  2, Corollary  3) the fixed point of T turns out to be unique. Moreover,

lim n → ∞ T n (x)= x ∗

for every x∈X provided x ∗ ∈FT, i.e., the map T:X→X is a Picard operator.

Corollary 5 With the addition of condition (B) to the hypotheses of Theorem  2, the fixed point of T turns out to be unique. Moreover,

lim n → ∞ T n (x)= x ∗ ,

for every x∈X provided x ∗ ∈FT, i.e., the map T:X→X is a Picard operator.

5 Illustrative examples

In what follows, we furnish two illustrative examples wherein one demonstrates Theorem 1 on the existence of a fixed point, while the other one exhibits the uniqueness of the fixed point in respect of Theorem 3.

Example 2 Consider X=[0,1] equipped with the usual metric d(x,y)=|x−y| for all x,y∈X, and p=d to be a w-distance on (X,d). Define an order relation ⪯ on X as

x⪯y⇔x=yor [ x , y ∈ { 0 } ∪ { 1 n : n = 2 , 3 , … }  with  x ≤ y ] ,

where ≤ is usual order. Then it is clear that

X ⪯ = { ( x , y ) ∈ X × X : x = y  or  x , y ∈ { 0 } ∪ { 1 n : n = 2 , 3 , … } } .

Let T:X→X be given by

T(x)={ 0 , if  x = 0 , 1 n + 1 , if  x = 1 n , 2 2 , otherwise .

Obviously, (X,d,⪯) is a complete partially ordered metric space. It is easy to see that T is nondecreasing. Also, there is x 0 =0 in X such that x 0 =0⪯0=T x 0 , i.e., ( x 0 ,T x 0 )∈ X ⪯ , and T satisfies (c′).

We now show that T satisfies (b) with ψ,ϕ:[0,∞)→[0,∞) which are defined as

ψ(t)= t 2 andϕ(t)= t 4 ( t ∈ [ 0 , ∞ ) ) .

If (x,y)∈ X ⪯ and x=y, then p(Tx,Ty)=p(x,y)=0. Otherwise, if (x,y)∈ X ⪯ with x≠y, then either x= 1 n , y=0 or x= 1 n , y= 1 m (m>n≥2), which evolve into two cases as follows.

Case 1. If x= 1 n (n≥2) and y=0, then

M 1 n , 0 =max { p ( 1 n , 0 ) , min { p ( 1 n , T 1 n ) , p ( 0 , 0 ) , p ( T 1 n , 1 n ) , p ( 0 , 0 ) } } = 1 n

and

ψ ( M 1 n , 0 ) − ϕ ( M 1 n , 0 ) = ( 1 n ) 2 − ( 1 n ) 4 > 1 n 2 − 1 n 2 ( n + 1 ) = n n 2 ( n + 1 ) = 1 n ( n + 1 ) > 1 ( n + 1 ) 2 = ψ ( p ( T x , T y ) ) .

Case 2. Next, if x= 1 n and y= 1 m (m>n≥2), then

M 1 n , 1 m = max { p ( 1 n , 1 m ) , min { p ( 1 n , T 1 n ) , p ( 1 m , T 1 m ) , p ( T 1 n , 1 n ) , p ( T 1 m , 1 m ) } } = max { | 1 n − 1 m | , min { | 1 n − 1 n + 1 | , | 1 m − 1 m + 1 | } } .

For m>n≥2, we have

| 1 n − 1 n + 1 | ≤ | 1 n − 1 m |

which is equivalent to

1 n ( n + 1 ) ≤ ( m − n ) m n

or

m n + 1 ≤(m−n).

The preceding inequality holds as

m n + 1 ≤1≤(m−n),

so that

M 1 n , 1 m = | 1 n − 1 m | .

Also (with m>n≥2),

ψ ( p ( T x , T y ) ) ≤ψ( M x , y )−ϕ( M x , y )

or

| 1 n + 1 − 1 m + 1 | 2 ≤ | 1 n − 1 m | 2 − | 1 n − 1 m | 4

or

( m − n ) 2 ( n + 1 ) 2 ( m + 1 ) 2 ≤ ( m − n ) 2 ( m n ) 2 − ( m − n ) 4 ( m n ) 4

or

( m − n ) 4 ( m n ) 4 ≤ ( m − n ) 2 ( m n ) 2 − ( m − n ) 2 ( n + 1 ) 2 ( m + 1 ) 2

or

( m − n ) 2 ( m n ) 2 ≤ ( ( n + 1 ) ( m + 1 ) − m n ) ( ( n + 1 ) ( m + 1 ) + m n ) ( n + 1 ) 2 ( m + 1 ) 2 .

Therefore,

( 1 m − 1 n ) 2 ≤ ( n + m + 1 ) ( ( n + 1 ) ( m + 1 ) + m n ) ( n + 1 ) 2 ( m + 1 ) 2 .
(I)

Also, we can write

( 1 m − 1 n ) 2 ≤ 1 m 2 ≤ 1 ( n + 1 ) m = m ( n + 1 ) m 2 ≤ m ( n + 1 ) ( m + 1 ) ≤ m ( n + 1 ) ( m + 1 ) + 1 m + 1 = m + n + 1 ( n + 1 ) ( m + 1 ) ≤ ( m + n + 1 ) ( n + 1 ) ( m + 1 ) ( n + 1 ) 2 ( m + 1 ) 2 + ( m + n + 1 ) ( m n ) ( n + 1 ) 2 ( m + 1 ) 2 = ( n + m + 1 ) ( ( n + 1 ) ( m + 1 ) + m n ) ( n + 1 ) 2 ( m + 1 ) 2 ,

which amounts to say that the inequality (I) holds and so does the inequality (b) (of Theorem 1).

Thus, all the conditions of Theorem 1 are satisfied implying thereby the existence of a fixed point of the map T which are indeed two in number, namely 0 and 2 2 . Here, it is worth pointing out that condition (B) does not hold in respect of this example.

We give another example that illustrates Theorem 3.

Example 3 Let X={0}∪{ 1 2 n :n≥1}, where (X,d,≤) is a complete partially ordered metric space with a metric d and usual order ≤. Clearly, condition (B) holds in X.

We define p:X×X→[0,∞) by p(x,y)=y. Let Ï•(t)= 1 4 t and ψ(t)= 1 2 t. Assume that T:X→X by Tx= x 32 for any x∈X. Obviously, Ï• and ψ are altering distance functions, it is easy to see that T is nondecreasing and self-map. Also, there is x 0 =0 in X such that ( x 0 ,T x 0 )∈ X ⪯ , and T satisfies (c′) (of Theorem 3). Now, we show that T satisfies (b) (of Theorem 3). If y=0, clearly, condition (b) is satisfied. Now, suppose that y= 1 2 m , then we have

M x , 1 2 m = max { p ( x , 1 2 m ) , min { p ( x , T x ) , p ( 1 2 m , T 1 2 m ) , p ( T x , x ) , p ( T 1 2 m , 1 2 m ) } } = 1 2 m .

By making use of condition (b), one gets

ψp(Tx,Ty)=ψ ( 1 32 ⋅ 2 m ) ≤ψ ( 1 2 m ) −ϕ ( 1 2 m ) ,

so that

1 2 ( 1 32 ⋅ 2 m ) ≤ 1 2 ( 1 2 m ) − 1 4 ( 1 2 m ) ,

or

1 2 m + 6 ≤ 1 2 m + 1 − 1 2 m + 2 = 1 2 m + 2 .

The preceding inequality holds and so does the inequality (b) (of Theorem 3).

Thus, all the conditions of Theorem 3 are satisfied. We note that x=0 is a unique fixed point for T. Moreover lim n → ∞ T n (x)= lim n → ∞ x 32 n =0.

References

  1. Khan MS, Swaleh M, Sessa S: Fixed point theorems by altering distances between the points. Bull. Aust. Math. Soc. 1984, 30: 1–9. 10.1017/S0004972700001659

    Article  MathSciNet  Google Scholar 

  2. Reich S: Some fixed point problems. Atti Accad. Naz. Lincei, Rend. Cl. Sci. Fis. Mat. Nat. 1974, 57: 194–198.

    Google Scholar 

  3. Babu GVR, Lalitha B, Sandhya ML: Common fixed point theorems involving two generalized altering distance functions in four variables. Proc. Jangjeon Math. Soc. 2007, 10: 83–93.

    MathSciNet  Google Scholar 

  4. Caristi J: Fixed point theorems for mapping satisfying inwardness conditions. Trans. Am. Math. Soc. 1976, 215: 241–251.

    Article  MathSciNet  Google Scholar 

  5. Dutta PN, Choudhury BS: A generalization of contraction principle in metric spaces. Fixed Point Theory Appl. 2008., 2008: Article ID 406368

    Google Scholar 

  6. Ekeland I: Nonconvex minimization problem. Bull. Am. Math. Soc. 1979, 1: 443–474. 10.1090/S0273-0979-1979-14595-6

    Article  MathSciNet  Google Scholar 

  7. Kada O, Suzuki T, Takahashi W: Nonconvex minimization theorems and fixed point theorems in complete metric spaces. Math. Jpn. 1996, 44: 381–391.

    MathSciNet  Google Scholar 

  8. Nashine HK, Altun I: Fixed point theorems for generalized weakly contractive condition in ordered metric spaces. Fixed Point Theory Appl. 2011., 2011: Article ID 132367

    Google Scholar 

  9. Nieto JJ, Rodríguez-López R: Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations. Order 2005, 22: 223–239. 10.1007/s11083-005-9018-5

    Article  MathSciNet  Google Scholar 

  10. Ran ACM, Reurings MCB: A fixed point theorem in partially ordered sets and some applications to matrix equations. Proc. Am. Math. Soc. 2004, 132: 1435–1443. 10.1090/S0002-9939-03-07220-4

    Article  MathSciNet  Google Scholar 

  11. Rhoades BE: Some theorems on weakly contractive maps. Nonlinear Anal. 2001, 47: 2683–2693. 10.1016/S0362-546X(01)00388-1

    Article  MathSciNet  Google Scholar 

  12. Sastry KPR, Babu GVR: Some fixed point theorems by altering distances between the points. Indian J. Pure Appl. Math. 1999, 30: 641–647.

    MathSciNet  Google Scholar 

  13. Alber YI, Guerre-Delabriere S: Principles of weakly contractive maps in Hilbert spaces. Operator Theory, Advances and Applications 98. In New Results in Operator Theory and Its Applications. Edited by: Gohberg Y, Lyubich Y. Birkhäuser, Basel; 1997:7–22.

    Chapter  Google Scholar 

  14. Takahashi W: Existence theorems generalizing fixed point theorems for multivalued mappings. Pitman Research Notes in Mathematics Series 252. In Fixed Point Theory Appl.. Edited by: Thera MA, Baillon JB. Wiley, New York; 1991:397–406.

    Google Scholar 

  15. Altun I, Simsek H: Some fixed point theorems on ordered metric spaces and application. Fixed Point Theory Appl. 2010., 2010: Article ID 621469

    Google Scholar 

  16. Suzuki T: Generalized distance and existence theorems in complete metric spaces. J. Math. Anal. Appl. 2001, 253: 440–458. 10.1006/jmaa.2000.7151

    Article  MathSciNet  Google Scholar 

  17. Suzuki T: Several fixed point theorems in complete metric space. Yokohama Math. J. 1997, 44: 61–72.

    MathSciNet  Google Scholar 

Download references

Acknowledgements

Both authors are grateful to two anonymous referees for their fruitful suggestions and observations.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohammad Imdad.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally and significantly in this research work. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Imdad, M., Rouzkard, F. Fixed point theorems in ordered metric spaces via w-distances. Fixed Point Theory Appl 2012, 222 (2012). https://doi.org/10.1186/1687-1812-2012-222

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2012-222

Keywords