1. Introduction and Preliminaries

Generalization of the Banach principle [1] has been heavily investigated by many authors (see [214]). In particular, there has been a number of fixed point theorems involving altering distance functions. Such functions were introduced by Khan et al. [15].

Definition 1.1. [15]The function ϕ : [0, +∞) → [0, +∞) is called an altering distance function if the following properties are satisfied:

  1. (1)

    ϕ is continuous and nondecreasing.

  2. (2)

    ϕ(t) = 0 if and only if t = 0.

Khan et al. [15] proved the following theorem.

Theorem 1.1. Let (X, d) be a complete metric space, ψ an altering distance function and T : XX satisfying

ψ ( d ( T x , T y ) ) c ψ ( d ( x , y ) )

for x, yX and 0 < c < 1. Then, T has a unique fixed point.

Existence of fixed point in partially ordered sets has been considered by many authors. Ran and Reurings [14] studied a fixed point theorem in partially ordered sets and applied their result to matrix equations. While Nieto and Rodŕiguez-López [9] studied some contractive mapping theorems in partially ordered set and applied their main theorems to obtain a unique solution for a first order ordinary differential equation. For more works in partially ordered metric spaces, we refer the reader to [1631].

Harjani and Sadarangani [7, 8] obtained some fixed point theorems in a complete ordered metric space using altering distance functions. They proved the following theorems.

Theorem 1.2. [8]Let (X, ≼) be a partially ordered set and suppose that there exists a metric d in X such that (X, d) is a complete metric space. Let f : XX be a continuous and nondecreasing mapping such that

ψ ( d ( f x , f y ) ) ψ ( d ( x , y ) ) - ϕ ( d ( x , y ) )

for comparable x, yX, where ψ and ϕ are altering distance functions. If there exists x0f (x0), then f has a fixed point.

Theorem 1.3. [8]Let (X, ≼) be a partially ordered set and suppose that there exists a metric d in X such that (X, d) is a complete metric space. Assume that X satisfies if (x n ) is a nondecreasing sequence in X such that x n x, then x n x for all n ∈ ℕ. Let f : XX be a nondecreasing mapping such that

ψ ( d ( f x , f y ) ) ψ ( d ( x , y ) ) - ϕ ( d ( x , y ) )

for comparable x, yX, where ψ and ϕ are altering distance functions. If there exists x0f (x0), then f has a fixed point.

Altun and Simsek [3] introduced the concept of weakly increasing mappings as follows:

Definition 1.2. [3]Let (X, ≼) be a partially ordered set. Two mappings f, g : XX are said to be weakly increasing if fxg(fx) and gxf(gx) for all xX.

Recently, Turkoglu [32] studied new common fixed point theorems for weakly compatible mappings on uniform spaces. While, Nashine and Samet [12] proved some new coincidence point theorems for a pair of weakly increasing mappings. Very recently, Shatanawi and Samet [33] proved some coincidence point theorems for a pair of weakly increasing mappings with respect to another map.

The aim of this article is to study new coincidence point theorems for a pair of weakly decreasing mappings satisfying (ψ, ϕ)-weakly contractive condition in an ordered metric space (X, d), where ϕ and ψ are altering distance functions.

2. Main Results

We start our study with the following definition:

Definition 2.1. Let (X, ≼) be a partially ordered set and T, f : XX be two mappings. We say that f is weakly decreasing with respect to T if the following conditions hold:

  1. (1)

    fXTX.

  2. (2)

    For all xX, we have fyfx for all yT -1(fx).

We need the following definition in our arguments.

Definition 2.2. [34]Let (X, d) be a metric space and f, g : XX. If w = fx = gx for some xX, then x is called a coincidence point of f and g, and w is called a point of coincidence of f and g. The pair {f, g} is said to be compatible if and only if

lim n + d ( f g x n , g f x n ) = 0

whenever (x n ) is a sequence in X such that

lim n + f x n = lim n + g x n = t

for some tX.

Theorem 2.1. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is a complete metric space. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

ψ ( d ( f x , f y ) ) ψ max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) - ϕ max d ( f x , f y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) ,
(1)

where ϕ and ψ are altering distance functions. Assume that T and f satisfy the following hypotheses:

  1. (i)

    f is weakly decreasing with respect to T.

  2. (ii)

    The pair {T, f} is compatible.

  3. (iii)

    f and T are continuous.

Then, T and f have a coincidence point.

Proof. Let x0X. Since fXTX, we choose x1X such that fx0 = Tx1. Also, since fXTX, we choose x2X such that fx1 = Tx2. Continuing this process, we can construct a sequences (x n ) in X such that Txn+1= fx n . Now, since x1T-1(fx0) and x2T-1(fx1), by using the assumption that f is weakly decreasing with respect to T, we obtain

f x 0 f x 1 f x 2 .

By induction on n, we conclude that

f x 0 f x 1 f x n f x n + 1 .

Hence,

T x 1 T x 2 T x n T x n + 1 .

If T x n 0 + 1 =T x n 0 for some n0X, then f x n 0 = T x n 0 . Thus, x n 0 is a coincidence point of T and f. Hence, we may assume that Txn+1 Tx n for all n ∈ ℕ.

Since Tx n and Txn+1are comparable, then by (1), we have

ψ ( d ( T x n + 1 , T x n + 2 ) ) = ψ ( d ( f x n , f x n + 1 ) ) ψ max d ( T x n , T x n + 1 ) , d ( f x n , T x n ) , d ( f x n + 1 , T x n + 1 ) , 1 2 ( d ( f x n , T x n + 1 ) + d ( T x n , f x n + 1 ) ) - ϕ max d ( T x n , T x n + 1 ) , d ( f x n , T x n ) , d ( f x n + 1 , T x n + 1 ) , 1 2 ( d ( f x n , T x n + 1 ) + d ( T x n , f x n + 1 ) ) = ψ max d ( T x n , T x n + 1 ) , d ( T x n + 2 , T x n + 1 ) , 1 2 d ( T x n , T x n + 2 ) - ϕ max d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) , 1 2 d ( T x n , T x n + 2 ) ψ max d ( T x n , T x n + 1 ) , d ( T x n + 2 , T x n + 1 ) , 1 2 d ( T x n , T x n + 2 ) - ϕ ( max { d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) } ) ψ ( max { d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) } ) - ϕ ( max { d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) } ) ψ ( max { d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) } ) .

If

max { d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) } = d ( T x n + 1 , T x n + 2 ) ,

then

ψ ( d ( T x n + 1 , T x n + 2 ) ψ ( d ( T x n + 1 , T x n + 2 ) ) - ϕ ( d ( T x n + 1 , T x n + 2 ) ) .

So, ϕ(d(Txn+1, Txn+2)) = 0 and hence d(Txn+1, Txn+2) = 0, a contradiction.

Thus,

max { d ( T x n , T x n + 1 ) , d ( T x n + 1 , T x n + 2 ) } = d ( T x n , T x n + 1 ) .

Therefore, we have

ψ ( d ( T x n + 1 , T x n + 2 ) ) ψ ( d ( T x n , T x n + 1 ) ) - ϕ ( d ( T x n , T x n + 1 ) ) ψ ( d ( T x n , T x n + 1 ) ) .
(2)

Since ψ is a nondecreasing function, we get that {d(Txn+1, Tx n ): n ∈ ℕ} is a nonincreasing sequence. Hence, there is r ≥ 0 such that

lim n + d ( T x n , T x n + 1 ) = r .

Letting n → +∞ in (2) and using the continuity of ψ and ϕ, we get that

ψ ( r ) ψ ( r ) - ϕ ( r ) .

Thus, ϕ(r) = 0 and hence r = 0. Therefore,

lim n + d ( T x n , T x n + 1 ) = 0 .
(3)

Now, we prove that (Tx n ) is a Cauchy sequence in X. Suppose to the contrary; that is, (Tx n ) is not a Cauchy sequence. Then, there exists ε > 0 for which we can find two subsequences of positive integers (Txm(i)) and (Txn(i)) such that n(i) is the smallest index for which

n ( i ) > m ( i ) > i , d ( T x m ( i ) , T x n ( i ) ) ε .
(4)

This means that

d ( T x m ( i ) , T x n ( i ) - 1 ) < ε .
(5)

From (4), (5) and the triangular inequality, we have

ε d ( T x m ( i ) , T x n ( i ) ) d ( T x m ( i ) , T x n ( i ) - 1 ) + d ( T x n ( i ) - 1 , T x n ( i ) ) < ε + d ( T x n ( i ) - 1 , T x n ( i ) ) .

On letting i → +∞ in above inequality and using (3), we have

lim i + d ( T x m ( i ) , T x n ( i ) ) = lim i + d ( T x m ( i ) , T x n ( i ) - 1 ) = ε .
(6)

Also,

ε d ( T x n ( i ) , T x m ( i ) ) d ( T x n ( i ) , T x m ( i ) + 1 ) + d ( T x m ( i ) + 1 , T x m ( i ) ) d ( T x n ( i ) , T x n ( i ) - 1 ) + d ( T x n ( i ) - 1 , T x m ( i ) + 1 ) + d ( T x m ( i ) + 1 , T x m ( i ) ) d ( T x n ( i ) , T x n ( i ) - 1 ) + d ( T x n ( i ) - 1 , T x m ( i ) ) + 2 d ( T x m ( i ) + 1 , T x m ( i ) ) d ( T x n ( i ) , T x n ( i ) - 1 ) + ε + 2 d ( T x m ( i ) + 1 , T x m ( i ) ) .

Letting i → +∞ in the above inequalities and using (3), we get that

lim i + d ( T x n ( i ) - 1 , T x m ( i ) + 1 ) = lim i + d ( T x n ( i ) , T x m ( i ) + 1 ) = ε .
(7)

Since Txn(i)-1and Txm(i)are comparable, by (1), we have

ψ ( d ( T x n ( i ) , T x m ( i ) + 1 ) ) = ψ ( d ( f x n ( i ) 1 , f x m ( i ) ) ψ ( m a x { d ( T x n ( i ) 1 , T x m ( i ) ) , d ( f x n ( i ) 1 , T x n ( i ) 1 ) , d ( f x m ( i ) , T x m ( i ) ) , 1 2 ( d ( f x n ( i ) 1 , T x m ( i ) ) + d ( T x n ( i ) 1 , f x m ( i ) ) ) } ) ϕ ( m a x { d ( T x n ( i ) 1 , T x m ( i ) ) , d ( f x n ( i ) 1 , T x n ( i ) 1 ) , d ( f x m ( i ) , T x m ( i ) ) , 1 2 ( d ( f x n ( i ) 1 , T x m ( i ) ) + d ( T x n ( i ) 1 , f x m ( i ) ) ) } ) = ψ ( m a x { d ( T x n ( i ) 1 , T x m ( i ) ) , d ( T x n ( i ) , T x n ( i ) 1 ) , d ( T x m ( i ) + 1 , T x m ( i ) ) , 1 2 ( d ( T x n ( i ) , T x m ( i ) ) + d ( T x n ( i ) 1 , T x m ( i ) + 1 ) ) } ) ϕ ( m a x { d ( T x n ( i ) 1 , T x m ( i ) ) , d ( T x n ( i ) , T x n ( i ) 1 ) , d ( T x m ( i ) + 1 , T x m ( i ) ) , 1 2 ( d ( T x n ( i ) , T x m ( i ) ) + d ( T x n ( i ) 1 , T x m ( i ) + 1 ) ) } ) .

Letting i → +∞ in the above inequalities, and using (3), (6) and (7), we get that

ψ ( ε ) ψ ( ε ) - ϕ ( ε ) .

Therefore, ϕ(ε) = 0 and hence ε = 0, a contradiction. Thus, {Tx n } is a Cauchy sequence in the complete metric space X. Therefore, there exists uX such that

lim n + T x n = u .

By the continuity of T, we have

lim n + T ( T x n ) = T u .

Since Txn+1= fx n u, Tx n u, and the pair {T, f} is compatible, we have

lim n + d ( f ( T x n ) , T ( f x n ) ) = 0 .

By the triangular inequality, we have

d ( f u , T u ) d ( f u , f ( T x n ) ) + d ( f ( T x n ) , T ( f x n ) ) + d ( T ( f x n ) , T u ) .

Letting n → +∞ and using the fact that T and f are continuous, we get that d(fu, Tu) = 0. Hence, fu = Tu, that is, u is a coincidence point of T and f.

Theorem 2.2. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

ψ ( d ( f x , f y ) ) ψ max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) - ϕ max d ( f x , f y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) ,
(8)

where ϕ and ψ are altering distance functions. Suppose that the following hypotheses are satisfied:

  1. (i)

    If (x n ) is a nonincreasing sequence in X with respect tosuch that x n xX as n → +∞, then x n x for all n ∈ ℕ.

  2. (ii)

    f is weakly decreasing with respect to T.

  3. (iii)

    TX is a complete subspace of X.

Then, T and f have a coincidence point.

Proof. Following the proof of Theorem 2.1, we have (Tx n ) is a Cauchy sequence in (TX, d). Since TX is complete, there is vX such that

lim n + T x n = T v = u .

Since {Tx n } is a nonincreasing sequence in X. By hypotheses, we have Tx n Tv for all n ∈ ℕ. Thus, by (8), we have

ψ ( d ( T x n + 1 , f v ) ) = ψ ( f x n , f v ) ψ max d ( T x n , T v ) , d ( f x n , T x n ) , d ( f v , T v ) , 1 2 ( d ( f x n , T v ) + d ( f v , T x n ) ) - ϕ max d ( T x n , T v ) , d ( f x n , T x n ) , d ( f v , T v ) , 1 2 ( d ( f x n , T v ) + d ( f v , T x n ) ) = ψ max d ( T x n , T v ) , d ( T x n + 1 , T x n ) , d ( f v , T v ) , 1 2 ( d ( T x n + 1 , T v ) + d ( f v , T x n ) ) - ϕ max d ( T x n , T v ) , d ( T x n + 1 , T x n ) , d ( f v , T v ) , 1 2 ( d ( T x n + 1 , T v ) + d ( f v , T x n ) ) .

Letting n → +∞ in the above inequalities, we get that

ψ ( d ( T v , f v ) ) ψ ( d ( T v , f v ) ) - ϕ ( d ( T v , f v ) ) .

Hence, ϕ(d(Tv, fv)) = 0. Since ϕ is an altering distance function, we get that d(Tv, fv) = 0. Therefore, Tv = fv. Thus, v is a coincidence point of T and f.

By taking ψ(t) = t and ϕ(t) = (1 - k)t, k ∈ [0, 1) in Theorems 2.1 and 2.2, we have the following two results.

Corollary 2.1. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is a complete metric space. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

d ( f x , f y ) k max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Assume that T and f satisfy the following hypotheses:

  1. (i)

    f is weakly decreasing with respect to T.

  2. (ii)

    The pair {T, f} is compatible.

  3. (iii)

    f and T are continuous.

If k ∈ [0, 1), then T and f have a coincidence point.

Corollary 2.2. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

d ( f x , f y ) k max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Suppose that the following hypotheses are satisfied:

  1. (i)

    If (x n ) is a nonincreasing sequence in X with respect tosuch that x n xX as n → +∞, then x n x for all n ∈ ℕ.

  2. (ii)

    f is weakly decreasing with respect to T.

  3. (iii)

    TX is a complete subspace of X.

If k ∈ [0, 1), then T and f have a coincidence point.

Corollary 2.3. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is a complete metric space. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

d ( f x , f y ) a 1 d ( T x , T y ) + a 2 d ( f x , T x ) + a 3 d ( f y , T y ) + a 4 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Assume that T and f satisfy the following hypotheses:

  1. (i)

    f is weakly decreasing with respect to T.

  2. (ii)

    The pair {T, f} is compatible.

  3. (iii)

    f and T are continuous.

If a1 + a2 + a3 + a4 ∈ [0, 1), then T and f have a coincidence point.

Proof. Follows from Corollary 2.1 by noting that

a 1 d ( T x , T y ) + a 2 d ( f x , T x ) + a 3 d ( f y , T y ) + a 4 2 ( d ( f x , T y ) + d ( f y , T x ) ) ( a 1 + a 2 + a 3 + a 4 ) max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Corollary 2.4. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is a complete metric space. Let f : XX be a map such that for all comparable x, yX, we have

ψ ( d ( f x , f y ) ) ψ max d ( x , y ) , d ( f x , x ) , d ( f y , y ) , 1 2 ( d ( f x , y ) + d ( f y , x ) ) - ϕ max d ( x , y ) , d ( f x , x ) , d ( f y , y ) , 1 2 ( d ( f x , y ) + d ( f y , x ) ) ,

where ϕ and ψ are altering distance functions. Assume that f satisfies the following hypotheses:

  1. (i)

    f(fx) ≼ fx for all xX.

  2. (ii)

    f is continuous.

Then, f has a fixed point.

Proof. Follows from Theorem 2.1 by taking T = i X (the identity map).

Corollary 2.5. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is complete. Let f : XX be a map such that for all comparable x, yX, we have

ψ ( d ( f x , f y ) ) ψ max d ( x , y ) , d ( f x , x ) , d ( f y , y ) , 1 2 ( d ( f x , y ) + d ( f y , x ) ) - ϕ max d ( x , y ) , d ( f x , x ) , d ( f y , y ) , 1 2 ( d ( f x , y ) + d ( f y , x ) ) ,

where ϕ and ψ are altering distance functions. Suppose that the following hypotheses are satisfied:

  1. (i)

    If (x n ) is a nonincreasing sequence in X with respect tosuch that x n xX as n → +∞, then x n x for all n ∈ ℕ.

  2. (ii)

    f(fx) ≼ fx for all xX.

Then, f has a fixed point.

Proof. Follows from Theorem 2.2 by taking T = i X (the identity map).

By taking ψ(t) = t and ϕ(t) = (1 - k)t, k ∈ [0, 1) in Corollaries 2.4 and 2.5, we have the following results.

Corollary 2.6. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is a complete metric space. Let f : XX be a map such that for all comparable x, yX, we have

d ( f x , f y ) k max d ( x , y ) , d ( f x , x ) , d ( f y , y ) , 1 2 ( d ( f x , y ) + d ( f y , x ) ) .

Assume f satisfies the following hypotheses:

  1. (i)

    f(fx) ≼ fx for all xX.

  2. (ii)

    f is continuous.

If k ∈ [0, 1), then f has a fixed point.

Corollary 2.7. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is complete. Let f : XX be a map such that for all comparable x, yX, we have

d ( f x , f y ) k max d ( x , y ) , d ( f x , x ) , d ( f y , y ) , 1 2 ( d ( f x , y ) + d ( f y , x ) ) .

Suppose that the following hypotheses are satisfied:

  1. (i)

    If (x n ) is a nonincreasing sequence in X with respect tosuch that x n xX as n → +∞, then x n x for all n ∈ ℕ.

  2. (ii)

    f(fx) ≼ fx for all xX.

If k ∈ [0, 1), then f has a fixed point.

Now, we introduce an example to support our results.

Example 2.1. Let X = [0, +∞). Define d : X × X → ℝ by d(x, y) = |x - y|. Define f, T : XX by

f ( x ) = 1 1 6 x 4 , 0 x 1 ; 1 1 6 x , x > 1

and

T ( x ) = x 2 , 0 x 1 ; x , x > 1 .

Then,

  1. (1)

    fXTX.

  2. (2)

    f and T are continuous.

  3. (3)

    The pair {f, T} is compatible.

  4. (4)

    f is weakly decreasing with respect to T.

  5. (5)

    For all x, yX, we have

    d ( f x , f y ) 1 4 max d ( T x , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Proof. The proof of (1) and (2) is clear.

To prove (3), let (x n ) be any sequence in X such that

lim n + f x n = lim n + T x n = t

for some tX. Since 0f x n 1 1 6 , we have 0t 1 1 6 . Since Tx n t as n → +∞, we have (x n ) has at most only finitely many elements greater than 1. Thus, f x n = 1 1 6 x n 4 and T x n = x n 2 for all n ∈ ℕ except at most for finitely many elements. Thus, we have x n 2 t 4 and x n t as n → +∞. By uniqueness of limit, we get that t =2 t 4 and hence t = 0. Thus, x n → 0 as n → +∞. Since f and T are continuous, we have fx n f 0 = 0 and Tx n T 0 = 0 as n → +∞. Therefore,

lim n + d ( T ( f x n ) , f ( T x n ) ) = d ( T 0 , f 0 ) = d ( 0 , 0 ) = 0 .

Thus, the pair {f, T} is compatible.

To prove f is weakly decreasing with respect to T, let x, yX be such that yT-1(fx). If x ∈ [0, 1], then

T y = 1 1 6 x 4 0 , 1 1 6 .

In this case, we must have Ty = y2. Thus, y 2 = 1 1 6 x 4 . Hence, y= 1 4 x 2 . Therefore,

f y = f 1 4 x 2 = 1 1 6 1 4 x 2 4 1 1 6 x 4 = f x .

If x > 1, then fx= 1 1 6 x 0 , 1 1 6 . Thus, Ty=fx 0 , 1 1 6 . In this case, we have Ty = y2. Thus,

y 2 = 1 1 6 x .

So,

y = 1 4 x 4 .

Therefore,

f y = f 1 4 x 4 = 1 1 6 1 2 5 6 x 1 1 6 x 1 1 6 x = f x .

Therefore, f is weakly decreasing with respect to T.

To prove (5), let x, yX.

Case 1: If x, y ∈ [0, 1], then

| f x - f y | = 1 1 6 x 4 - 1 1 6 y 4 = 1 1 6 | x 2 + y 2 | | x 2 - y 2 | 1 8 | T x - T y | = 1 8 d ( T x , T y ) 1 4 max d ( T x , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Case 2: If x, y ∈ (1, +∞), then

| f x - f y | = 1 1 6 x - 1 1 6 y = 1 1 6 1 x - 1 y = 1 1 6 y - x x y = 1 1 6 y - x x y ( y + x ) 1 3 2 | y - x | = 1 3 2 d ( T x , T y ) 1 4 max d ( T x , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Case 3: (x ∈ [0, 1] and y ∈ (1, +∞)) or (y ∈ [0, 1] and x ∈ (1, +∞)).

Without loss of generality, we may assume that x ∈ [0, 1] and y ∈ (1, +∞). Then,

| f x - f y | = 1 1 6 x 4 - 1 y = 1 1 6 x 2 - 1 y 4 x 2 + 1 y 4 1 8 x 2 - 1 y 4 .

If

1 y 4 x 2 ,

then

| f x - f y | 1 8 1 y 4 - x 2 1 8 ( y - x 2 ) = 1 8 d ( T y , T x ) 1 4 max d ( T x , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

If

x 2 1 y 4 ,

then

| f x - f y | 1 8 x 2 - 1 y 4 1 8 x 2 - 1 1 6 y 4 1 8 x 2 - 1 1 6 y = 1 8 d ( T x , f y ) 1 4 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) 1 4 max d ( T x , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) .

Thus, f and T satisfy all the hypotheses of Corollary 2.1. Therefore, T and f have a coincidence point. Here (0, 0) is the coincidence point of f and T.

3. Applications

Denote by Λ the set of functions λ : [0, +∞) → [0, +∞) satisfying the following hypotheses:

  1. (1)

    λ is a Lebesgue-integrable mapping on each compact of [0, +∞).

  2. (2)

    For every ε > 0, we have 0 ε λ ( s ) ds>0.

It is an easy matter to see that the mapping ψ : [0, +∞) → [0, +∞) defined by

ψ ( t ) = 0 t λ ( s ) d s

is an altering distance function. Now, we have the following results:

Theorem 3.1. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X such that (X, d) is a complete metric space. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

0 d ( f x , f y ) λ ( s ) d s 0 max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) λ ( s ) d s - 0 max d ( f x , f y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) μ ( s ) d s ,

where λ, μ ∈ Λ. Assume that T and f satisfy the following hypotheses:

  1. (1)

    f is weakly decreasing with respect to T.

  2. (2)

    The pair {T, f} is compatible.

  3. (3)

    f and T are continuous.

Then, T and f have a coincidence point.

Proof. Follows from Theorem 2.1 by taking ψ ( t ) = 0 t λ ( s ) ds and ϕ ( t ) = 0 t μ ( s ) ds.   □

Theorem 3.2. Let (X, ≼) be a partially ordered set and suppose that there exists a metric d on X. Let T, f : XX be two maps such that for all x, yX with Tx and Ty are comparable, we have

0 d ( f x , f y ) λ ( s ) d s 0 max d ( T x , T y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) λ ( s ) d s - 0 max d ( f x , f y ) , d ( f x , T x ) , d ( f y , T y ) , 1 2 ( d ( f x , T y ) + d ( f y , T x ) ) μ ( s ) d s ,

where λ, μ ∈ Λ. Suppose that the following hypotheses are satisfied:

  1. (1)

    If (x n ) is a nonincreasing sequence in X with respect tosuch that x n xX as n → +∞, then x n x for all n ∈ ℕ.

  2. (2)

    f is weakly decreasing with respect to T.

  3. (3)

    TX is a complete subspace of X.

Then, T and f have a coincidence point.

Proof. Follows from Theorem 2.2 by taking ψ ( t ) = 0 t λ ( s ) ds and ϕ ( t ) = 0 t μ ( s ) ds.   □

Now, our aim is to give an existence theorem for a solution of the following integral equation:

u ( t ) = 0 T K ( t , s , u ( s ) ) d s + g ( t ) , t [ 0 , T ] ,
(9)

where T > 0. Let X = C([0, T]) be the set of all continuous functions defined on [0, T]. Define

d : X × X +

by

d ( x , y ) = sup t [ 0 , T ] | x ( t ) - y ( t ) | .

Then, (X, d) is a complete metric space. Define an ordered relation ≤ on X by

x y iff  x ( t ) y ( t ) , t [ 0 , T ] .

Then, (X, ≤) is a partially ordered set. Now, we prove the following result.

Theorem 3.3. Suppose the following hypotheses hold:

  1. (1)

    K : [0, T] × [0, T] × ℝ+ → ℝ+ and g : ℝ → ℝ are continuous.

  2. (2)

    For each t, s ∈ [0, T], we have

    K ( t , s , 0 T K ( s , τ , u ( τ ) ) d τ + g ( s ) ) K ( t , s , u ( s ) ) .
  3. (3)

    There exist a continuous function G : [0, T] × [0, T] → [0, +∞] such that

    | K ( t , s , u ) - K ( t , s , v ) | G ( t , s ) | u - v |

for each comparable u, v ∈ ℝ and each t, s ∈ [0, T].

  1. (4)

    sup t [ 0 , T ] 0 T G ( t , s ) dsr for some r < 1.

Then, the integral equation (9) has a solution uC([0, T]).

Proof. Define f : C([0, T]) → C([0, T]) by

f x ( t ) = 0 T K ( t , s , x ( s ) ) d s + g ( t ) , t [ 0 , T ] .

Now, we have

f ( f x ( t ) ) = 0 T K ( t , s , f x ( s ) ) d s + g ( t ) = 0 T K t , s , 0 T K ( s , τ , x ( τ ) ) d τ + g ( s ) d s + g ( t ) 0 T K ( t , s , x ( s ) ) d s + g ( t ) = f x ( t ) .

Thus, we have f(fx) ≤ fx for all xC([0, T]).

For x, yC([0, T]) with xy, we have

d ( f x , f y ) = sup t [ 0 , T ] | f x ( t ) - f y ( t ) | = sup t [ 0 , T ] 0 T K ( t , s , x ( s ) ) - K ( t , s , y ( s ) ) d s sup t [ 0 , T ] 0 T | K ( t , s , x ( s ) ) - K ( t , s , y ( s ) ) | d s sup t [ 0 , T ] 0 T G ( t , s ) | x ( s ) - y ( s ) | d s sup t [ 0 , T ] | x ( t ) - y ( t ) | sup t [ 0 , T ] 0 T G ( t , s ) d s = d ( x , y ) sup t [ 0 , T ] 0 T G ( t , s ) d s r d ( x , y ) .

Moreover, if (f n ) is a nonincreasing sequence in C([0, T]) such that f n f as n → +∞, then f n f for all n ∈ ℕ (see [9]). Thus, all the required hypotheses of Corollary 2.7 are satisfied. Thus, there exist a solution uC([0, T]) of the integral equation (9).