1 Introduction and preliminaries

Fixed point theory is one of the core research areas in nonlinear functional analysis since it has a broad range of application potential in various fields such as engineering, economics, computer science, and many others. Banach contraction mapping principle [1] is considered to be the initial and fundamental result in this direction. Fixed point theory and hence the Banach contraction mapping principle have evidently attracted many prominent mathematicians due to their wide application potential. Consequently, the number of publications in this theory increases rapidly; we refer the reader to [219].

In this paper, by introducing a new notion of (αψ,βφ)-contractive mappings, we aim to establish a more general result to collect/combine a number of existing results in the literature.

We start by recalling the notion of altering distance function introduced by Khan et al. [12] as follows.

Definition 1.1 A function ψ:[0,+)[0,+) is called an altering distance function if the following properties are satisfied:

  • ψ(t) is continuous and nondecreasing.

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

Now, we present a definition, which will be useful later.

Definition 1.2 Let X be a set, and let ℛ be a binary relation on X. We say that T:XX is an ℛ-preserving mapping if

x,yX:xRyTxRTy.

In the sequel, let ℕ denote the set of all non-negative integers, let ℝ denote the set of all real numbers.

Example 1.1 Let X=R and a function T:XX defined as Tx= e x .

Define α(x,y):X×X[0,) and β(x,y):X×X[0,) by

α(x,y)={ 1 if  x y , 2 otherwise ; β(x,y)={ 1 if  x y , 0 otherwise .

Define the first binary relation R 1 by x R 1 y if and only if α(x,y)1, and define the second binary relation by x R 2 y if and only if β(x,y)1. Then, we easily obtain that T is simultaneously R 1 -preserving and R 2 -preserving.

Definition 1.3 Let NN. We say that ℛ is N-transitive on X if

x 0 , x 1 ,, x N + 1 X: x i R x i + 1 for all i{0,1,,N} x 0 R x N + 1 .

The following remark is a consequence of the previous definition.

Remark 1.1 Let NN. We have:

  1. (i)

    If ℛ is transitive, then it is N-transitive for all NN.

  2. (ii)

    If ℛ is N-transitive, then it is kN-transitive for all kN.

Definition 1.4 Let (X,d) be a metric space and R 1 , R 2 two binary relations on X. We say that (X,d) is ( R 1 , R 2 )-regular if for every sequence { x n } in X such that x n xX as n+, and

x n R 1 x n + 1 , x n R 2 x n + 1 for all nN,

there exists a subsequence { x n ( k ) } such that

x n ( k ) R 1 x, x n ( k ) R 2 xfor all kN.

Definition 1.5 We say that a subset D of X is ( R 1 , R 2 )-directed if for all x,yD, there exists zX such that

(x R 1 z)(y R 1 z)and(x R 2 z)(y R 2 z).

2 Main results

Before we start the introduction of the concept (αψ,βφ)-contractive mappings, we introduce the notion of a pair of generalized altering distance as follows:

Definition 2.1 We say that the pair of functions (ψ,φ) is a pair of generalized altering distance where ψ,φ:[0,+)[0,+) if the following hypotheses hold:

  1. (a1)

    ψ is continuous;

  2. (a2)

    ψ is nondecreasing;

  3. (a3)

    lim n φ( t n )=0 lim n t n =0.

The condition (a3) was introduced by Popescu in [15] and Moradi and Farajzadeh in [14].

Definition 2.2 Let (X,d) be a metric space, and let T:XX be a given mapping. We say that T is (αψ,βφ)-contractive mappings if there exists a pair of generalized distance (ψ,φ) such that

ψ ( d ( T x , T y ) ) α(x,y)ψ ( d ( x , y ) ) β(x,y)φ ( d ( x , y ) ) for all x,yX,
(1)

where α,β:X×X[0,+).

In the sequel, the binary relations R 1 and R 2 are defined as following.

Definition 2.3 Let X be a set and α,β:X×X[0,+) are two mappings. We define two binary relations R 1 and R 2 on X by

x,yX:x R 1 yα(x,y)1

and

x,yX:x R 2 yβ(x,y)1.

Now we are ready to state our first main result.

Theorem 2.1 Let (X,d) be a complete metric space, NN{0}, and let T:XX be an (αψ,βφ)-contractive mapping satisfying the following conditions:

  1. (i)

    R i is N-transitive for i=1,2;

  2. (ii)

    T is R i -preserving for i=1,2;

  3. (iii)

    there exists x 0 X such that x 0 R i T x 0 for i=1,2;

  4. (iv)

    T is continuous.

Then, T has a fixed point, that is, there exists x X such that T x = x .

Proof Let x 0 X such that x 0 R i T x 0 for i=1,2. Define the sequence { x n } in X by

x n + 1 =T x n for all n0.

If x n = x n + 1 for some n0, then x = x n is a fixed point T. Assume that x n x n + 1 for all n0. From (ii) and (iii), we have

x 0 R 1 T x 0 α( x 0 ,T x 0 )=α( x 0 , x 1 )1α(T x 0 ,T x 1 )=α( x 1 , x 2 )1.

Similarly, we have

x 0 R 2 T x 0 β( x 0 ,T x 0 )=β( x 0 , x 1 )1β(T x 0 ,T x 1 )=β( x 1 , x 2 )1.

By induction, from (ii) it follows that

α( x n , x n + 1 )1for all n0,
(2)

and, similarly, we have

β( x n , x n + 1 )1for all n0.
(3)

Substituting x= x n and y= x n + 1 in (1), we obtain

ψ ( d ( T x n , T x n + 1 ) ) α( x n , x n + 1 )ψ ( d ( x n , x n + 1 ) ) β( x n , x n + 1 )φ ( d ( x n , x n + 1 ) ) .

So, by (2) and (3) it follows that

ψ ( d ( x n + 1 , x n + 2 ) ) ψ ( d ( x n , x n + 1 ) ) φ ( d ( x n , x n + 1 ) ) .
(4)

Using the monotone property of the ψ-function, we get

d( x n + 1 , x n + 2 )d( x n , x n + 1 ).

It follows that {d( x n , x n + 1 )} is monotone decreasing, and, consequently, there exists r0 such that

d( x n , x n + 1 )ras n.

Letting n+ in (4), we obtain

ψ(r)ψ(r) lim n φ ( d ( x n , x n + 1 ) ) ,

which implies that lim n φ(d( x n , x n + 1 ))=0, then by (a3) we get

d( x n , x n + 1 )0as n.
(5)

On the other hand, by (2) and (i), we obtain

α( x m , x m + k N + 1 )1for all m,k0.
(6)

Similarly, by (3) and (i), we get

β( x m , x m + k N + 1 )1for all m,k0.
(7)

Now, for some m,k0, substituting x= x m and y= x m in (1), where m :=m+kN+1, we get

ψ ( d ( T x m , T x m ) ) α( x m , x m )ψ ( d ( x m , x m ) ) β( x m , x m )φ ( d ( x m , x m ) ) .

So, by (6) and (7), we have

ψ ( d ( x m + 1 , x m + 1 ) ) ψ ( d ( x m , x m ) ) φ ( d ( x m , x m ) ) .
(8)

Using the monotone property of the ψ-function, we get

d( x m + 1 , x m + 1 )d( x m , x m ).

It follows that {d( x m , x m )} is monotone decreasing and consequently, there exists s0 such that

d( x m , x m )sas m.

Letting m+, we obtain

ψ(s)ψ(s) lim m + φ ( d ( x m , x m ) ) ,

which implies that lim m + φ(d( x m , x m ))=0, then by (a3) we get

d( x m , x m )0as m.
(9)

Next, we claim that { x n } is a Cauchy sequence. Suppose if we obtain a contradiction, that T is not a Cauchy sequence. Then, there exists ε>0, for which we can find subsequences { x m ( k ) } and { x n ( k ) } of { x n } with n(k)>m(k)>k such that

d( x m ( k ) , x n ( k ) )ε.
(10)

Further, corresponding to m(k), we can choose n(k) in such a way that it is the smallest integer with n(k)>m(k) and satisfying (10). Then

d( x m ( k ) , x n ( k ) 1 )<ε.
(11)

Then we have

εd( x m ( k ) , x n ( k ) )d( x m ( k ) , x n ( k ) 1 )+d( x n ( k ) 1 , x n ( k ) )<ε+d( x n ( k ) 1 , x n ( k ) ).
(12)

Letting k and using (5),

lim k d( x m ( k ) , x n ( k ) )=ε.
(13)

Furthermore, for each k0, there exist μ k , η k >0 such that m (k):=m(k)+N μ k +1=n(k)+ η k . Hence, by (11) we have

εd( x m ( k ) , x m ( k ) )d( x m ( k ) , x n ( k ) 1 )+ i = n ( k ) 1 m ( k ) 1 d( x i , x i + 1 )<ε+ i = n ( k ) 1 m ( k ) 1 d( x i , x i + 1 ).
(14)

Again, letting k and using (5),

lim k d( x m ( k ) , x m ( k ) )=ε.
(15)

On the other hand, we have

d ( x m ( k ) , x m ( k ) ) d ( x m ( k ) , x m ( k ) 1 ) + d ( x m ( k ) 1 , x m ( k ) 1 ) + d ( x m ( k ) 1 , x m ( k ) ) , d ( x m ( k ) 1 , x m ( k ) 1 ) d ( x m ( k ) 1 , x m ( k ) ) + d ( x m ( k ) , x m ( k ) ) + d ( x m ( k ) , x m ( k ) 1 ) .

Letting k in the above inequalities, using (5), (9) and (15), we obtain

lim k d( x m ( k ) 1 , x m ( k ) 1 )=ε.
(16)

By setting x= x m ( k ) 1 and y= x m ( k ) 1 , in (1), we get

ψ ( d ( T x m ( k ) 1 , T x m ( k ) 1 ) ) α ( x m ( k ) 1 , x m ( k ) 1 ) ψ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) β ( x m ( k ) 1 , x m ( k ) 1 ) φ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) ,

that is,

ψ ( d ( x m ( k ) , x m ( k ) ) ) α ( x m ( k ) 1 , x m ( k ) 1 ) ψ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) β ( x m ( k ) 1 , x m ( k ) 1 ) φ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) .

Now, using (6) and (7), we get

ψ ( d ( x m ( k ) , x m ( k ) ) ) ψ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) φ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) .

Letting k, using (15), (16) and the continuity of ψ and φ, we obtain

ψ(ε)ψ(ε) lim k φ ( d ( x m ( k ) 1 , x m ( k ) 1 ) ) ,
(17)

which implies by (a3) that ε=0, a contradiction with ε>0. Hence, our claim holds, that is, { x n } is a Cauchy sequence. Since (X,d) is a complete metric space, then there exists x X such that

x n x as n.

From the continuity of T, it follows that x n + 1 =T x n T x as n. Due to the uniqueness of the limit, we derive that T x = x , that is, x is a fixed point of T. □

Theorem 2.2 In Theorem  2.1, if we replace the continuity of T by the ( R 1 , R 2 )-regularity of (X,d), then the conclusion of Theorem  2.1 holds.

Proof Following the lines of the proof of Theorem 2.1, we get that { x n } is a Cauchy sequence. Since (X,d) is a complete metric space, then there exists x X such that x n x as n. Furthermore, the sequence { x n } satisfies (2) and (3), that is,

x n R 1 x n + 1 , x n R 2 x n + 1 for all nN.

Now, since (X,d) is ( R 1 , R 2 )-regular, then there exists a subsequence { x n ( k ) } of { x n } such that x n ( k ) R 1 x , that is, α( x n ( k ) , x )1 and x n ( k ) R 2 x , that is, β( x n ( k ) , x )1 for all k. By setting x= x n ( k ) and y= x , in (1), we obtain

ψ ( d ( x n ( k ) + 1 , T x ) ) α ( x n ( k ) , x ) ψ ( d ( x n ( k ) , x ) ) β ( x n ( k ) , x ) φ ( d ( x n ( k ) , x ) ) for all k,

that is,

ψ ( d ( x n ( k ) + 1 , T x ) ) ψ ( d ( x n ( k ) , x ) ) φ ( d ( x n ( k ) , x ) ) for all k.

Using the monotone property of the ψ-function, we get

d ( x n ( k ) + 1 , T x ) d ( x n ( k ) , x ) for all k.

Letting k in the above inequality, we get d( x ,T x )=0, that is, x =T x . □

Theorem 2.3 Adding to the hypotheses of Theorem  2.1 (respectively, Theorem  2.2) that X is ( R 1 , R 2 )-directed, we obtain uniqueness of the fixed point of T.

Proof Suppose that x and y are two fixed points of T. Since X is ( R 1 , R 2 )-directed, there exists zX such that

α ( x , z ) 1,α ( y , z ) 1
(18)

and

β ( x , z ) 1,β ( y , z ) 1.
(19)

Since T is R i -preserving for i=1,2, from (18) and (19), we get

α ( x , T n z ) 1,α ( y , T n z ) 1,n0
(20)

and

β ( x , T n z ) 1,β ( y , T n z ) 1,n0.
(21)

Using (20), (21) and (1), we have

ψ ( d ( x , T n + 1 z ) ) = ψ ( d ( T x , T ( T n z ) ) ) α ( x , T n z ) ψ ( d ( x , T n z ) ) β ( x , T n z ) φ ( d ( x , T n z ) ) ψ ( d ( x , T n z ) ) φ ( d ( x , T n z ) ) .

This implies that

ψ ( d ( x , T n + 1 z ) ) ψ ( d ( x , T n z ) ) φ ( d ( x , T n z ) ) ,n0.
(22)

Using the monotone property of the ψ-function, we get

d ( x , T n + 1 z ) d ( x , T n z ) ,n0.

It follows that {d( x , T n z)} is monotone decreasing and consequently, there exists r0 such that

d ( x , T n z ) ras n.

Letting n+ in (22), we obtain

ψ(r)ψ(r) lim n φ ( d ( x , T n z ) ) ,

which implies that lim n φ(d( x , T n z))=0, then by (a3) we get

d ( x , T n z ) 0as n.
(23)

Similarly, we get

d ( y , T n z ) 0as n.
(24)

Using (23) and (24), the uniqueness of the limit gives us x = y . □

3 Some corollaries

In this section, we derive new results from the previous theorems.

3.1 Coupled fixed point results in complete metric spaces

Let us recall the definition of a coupled fixed point introduced by Guo and Lakshmikantham in [5].

Definition 3.1 (Guo and Lakshmikantham [5])

Let F:X×XX be a given mapping. We say that (x,y)X×X is a coupled fixed point of F if

F(x,y)=xandF(y,x)=y.

Lemma 3.1 A pair (x,y) is a coupled fixed point of F if and only if (x,y) is a fixed point of T where T:X×XX×X is given by

T(x,y)= ( F ( x , y ) , F ( y , x ) ) for all (x,y)X×X.
(25)

Definition 3.2 Let (X,d) be a metric space and F:X×XX be a given mapping. We say that F is an (αψ,βφ)-contractive mappings if there exists a pair of generalized distance (ψ,φ) such that

ψ ( d ( F ( x , y ) , F ( u , v ) ) ) α ( ( x , y ) , ( u , v ) ) ψ ( max { d ( x , u ) , d ( y , v ) } ) β ( ( x , y ) , ( u , v ) ) φ ( max { d ( x , u ) , d ( y , v ) } ) ,

where α,β: X 2 × X 2 [0,+).

In this section, we define two binary relations S 1 and S 2 as follows.

Definition 3.3 Let X be a set, and let S 1 , S 2 be two binary relations on X×X defined by

(x,y),(u,v)X×X:(x,y) S 1 (u,v)α ( ( x , y ) , ( u , v ) ) 1

and

(x,y),(u,v)X×X:(x,y) S 2 (u,v)β ( ( x , y ) , ( u , v ) ) 1.

Definition 3.4 Let (X,d) be a metric space. We say that (X×X,d) is ( S 1 , S 2 )-biregular if for all sequences { x n , y n } in X×X such that x n xX, y n yX as n+, and

( x n , y n ) S i ( x n + 1 , y n + 1 ),( y n + 1 , x n + 1 ) S i ( y n , x n )for i=1,2 and for all nN,

there exists a subsequence { x n ( k ) , y n ( k ) } such that

( x n ( k ) , y n ( k ) ) S i (x,y),(y,x) S i ( y n ( k ) , x n ( k ) )for i=1,2 and for all kN.

Definition 3.5 We say that X×X is ( S 1 , S 2 )-bidirected if for all (x,y),(u,v)X×X, there exists ( z 1 , z 2 )X×X such that

( ( x , y ) S i ( z 1 , z 2 ) ) ( ( z 2 , z 1 ) S i ( y , x ) ) and ( ( u , v ) S i ( z 1 , z 2 ) ) ( ( z 2 , z 1 ) S i ( v , u ) ) for  i = 1 , 2 .

We have the following result.

Corollary 3.1 Let (X,d) be a complete metric space and F:X×XX be an (αψ,βφ)-contractive mapping satisfying the following conditions:

  1. (i)

    S i is N-transitive for i=1,2 (N>0);

  2. (ii)

    For all (x,y),(u,v)X×X, we have

    (x,y) S i (u,v) ( F ( x , y ) , F ( y , x ) ) S i ( F ( u , v ) , F ( v , u ) ) for i=1,2;
  3. (iii)

    There exists ( x 0 , y 0 )X×X such that

    ( x 0 , y 0 ) S i ( F ( x 0 , y 0 ) , F ( y 0 , x 0 ) ) , ( F ( y 0 , x 0 ) , F ( x 0 , y 0 ) ) S i ( y 0 , x 0 ) for i=1,2;
  4. (iv)

    F is continuous, or (X×X,d) is ( S 1 , S 2 )-biregular.

Then, F has a coupled fixed point ( x , y )X×X. Moreover, if X×X is ( S 1 , S 2 )-bidirected, then we have the uniqueness of the coupled fixed point.

Proof By Lemma 3.1, a pair (x,y) is a coupled fixed point of F if and only if (x,y) is a fixed point of T. Now, consider the complete metric space (Y,δ), where Y=X×X and

δ ( ( x , y ) , ( u , v ) ) =max { d ( x , u ) , d ( y , v ) } for all (x,y),(u,v)X×X.

From (iv), we have

ψ ( d ( F ( x , y ) , F ( u , v ) ) ) α ( ( x , y ) , ( u , v ) ) ψ ( δ ( ( x , u ) , ( y , v ) ) ) β ( ( x , y ) , ( u , v ) ) φ ( δ ( ( x , u ) , ( y , v ) ) )
(26)

and

ψ ( d ( F ( v , u ) , F ( y , x ) ) ) α ( ( v , u ) , ( y , x ) ) ψ ( δ ( ( x , u ) , ( y , v ) ) ) β ( ( v , u ) , ( y , x ) ) φ ( δ ( ( x , u ) , ( y , v ) ) ) .
(27)

Since ψ:[0,)[0,+) is nondecreasing, then ψ(max(r,s))=max(ψ(r),ψ(s)) for all r,s[0,). Hence, for all ( ξ 1 , ξ 2 ),( η 1 , η 2 )X×X, we have

ψ ( δ ( T ξ , T η ) ) a(ξ,η)ψ ( δ ( ξ , η ) ) b(ξ,η)φ ( δ ( ξ , η ) ) ,

where a,b:Y×Y[0,+) are the functions defined by

a ( ( ξ 1 , ξ 2 ) , ( η 1 , η 2 ) ) = max { α ( ( ξ 1 , ξ 2 ) , ( η 1 , η 2 ) ) , α ( ( η 2 , η 1 ) , ( ξ 2 , ξ 1 ) ) } , b ( ( ξ 1 , ξ 2 ) , ( η 1 , η 2 ) ) = min { β ( ( ξ 1 , ξ 2 ) , ( η 1 , η 2 ) ) , β ( ( η 2 , η 1 ) , ( ξ 2 , ξ 1 ) ) } ,

and T:YY is given by (25). We shall prove that T is (aψ,bφ)-contractive mapping.

Define two binary relations R 1 and R 2 by

ξ R 1 ηa(ξ,η)1andξ R 2 ηb(ξ,η)1for all ξ,ηX×X.

First, we claim that R j for j=1,2 are N-transitive. Let ( x i , y i )X×X for all i{0,,N} such that

( x i , y i ) R j ( x i + 1 , y i + 1 )for j=1,2 and for all i{0,,N},

that is,

a ( ( x i , y i ) , ( x i + 1 , y i + 1 ) ) 1andb ( ( x i , y i ) , ( x i + 1 , y i + 1 ) ) 1for all i{0,,N}.

By definitions of a and b, it follows that

α ( ( x i , y i ) , ( x i + 1 , y i + 1 ) ) 1 and α ( ( y i + 1 , x i + 1 ) , ( y i , x i ) ) 1 for all  i { 0 , , N } , β ( ( x i , y i ) , ( x i + 1 , y i + 1 ) ) 1 and β ( ( y i + 1 , x i + 1 ) , ( y i , x i ) ) 1 for all  i { 0 , , N }

or

( x i , y i ) S j ( x i + 1 , y i + 1 )and( x i + 1 , y i + 1 ) S j ( x i , y i )for j=1,2 and for all i{0,,N}.

Hence, by (i), we have

( x 0 , y 0 ) S j ( x N + 1 , y N + 1 )and( x N + 1 , y N + 1 ) S j ( x 0 , y 0 )for j=1,2,

that is,

α ( ( x 0 , y 0 ) , ( x N + 1 , y N + 1 ) ) 1 ; α ( ( y N + 1 , x N + 1 ) , ( y 0 , x 0 ) ) 1 ; β ( ( x 0 , y 0 ) , ( x N + 1 , y N + 1 ) ) 1 ; β ( ( y N + 1 , x N + 1 ) , ( y 0 , x 0 ) ) 1

or

( x 0 , y 0 ) R j ( x N + 1 , y N + 1 )for j=1,2.

Then our claim holds.

Let ξ=( ξ 1 , ξ 2 ),η=( η 1 , η 2 )Y such that a(ξ,η)1 and b(ξ,η)1. Using condition (ii), we obtain immediately that a(Tξ,Tη)1 and b(Tξ,Tη)1. Then T is R j -preserving for j=1,2. Moreover, from condition (iii), we know that there exists ( x 0 , y 0 )Y such that ( x 0 , y 0 ) R j T( x 0 , y 0 ) for j=1,2. If F is continuous, then T also is continuous. Then all the hypotheses of Theorem 2.1 are satisfied. If (X×X,d) is ( S 1 , S 2 )-biregular, then we easily have that (X×X,d) is ( R 1 , R 2 )-regular. Hence, Theorem 2.2 yields the result. We deduce the existence of a fixed point of T that gives us from (25) the existence of a coupled fixed point of F. Now, since X×X is ( S 1 , S 2 )-bidirected, one can easily derive that X×X is ( R 1 , R 2 )-directed by regarding Lemma 3.1 and Definition 3.5. Finally, by using Theorem 2.3, we obtain the uniqueness of the fixed point of T, that is, the uniqueness of the coupled fixed point of F. □

3.2 Fixed point results on metric spaces endowed with N-transitive binary relation

In [18], Samet and Turinci established fixed point results for contractive mappings on metric spaces, endowed with an amorphous arbitrary binary relation. Very recently, this work has been extended by Berzig in [2] to study the coincidence and common fixed points.

In this section, we establish a fixed point theorem on metric space endowed with N-transitive binary relation .

Corollary 3.2 Let X be a non-empty set endowed with a binary relation . Suppose that there is a metric d on X such that (X,d) is complete. Let T:XX satisfy the -weakly (ψ,φ)-contractive conditions, that is,

ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) φ ( d ( x , y ) ) for all xSy,

where ψ and φ are altering distance functions. Suppose also that the following conditions hold:

  1. (i)

    is N-transitive (N>0);

  2. (ii)

    T is a -preserving mapping;

  3. (iii)

    there exists x 0 X such that x 0 ST x 0 ;

  4. (iv)

    T is continuous or (X,d) is -regular.

Then T has a fixed point. Moreover, if X is -directed, we have the uniqueness of the fixed point.

Proof In order to link this theorem to the main result, we define the mapping α:X×X[0,+) by

α(x,y)={ 1 if  x S y  or  x = y , 1 + ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) + φ ( d ( x , y ) ) φ ( d ( x , y ) ) + ψ ( d ( x , y ) ) otherwise ,
(28)

and we define the mapping β:X×X[0,+) by

β(x,y)={ 1 if  x S y  or  x = y , ψ ( d ( x , y ) ) φ ( d ( x , y ) ) + ψ ( d ( x , y ) ) otherwise .
(29)

Next, by using (28), (29) and Definition 2.3, the conclusion follows directly from Theorems 2.1, 2.2 and 2.3. □

3.3 Fixed point results for cyclic contractive mappings

In [13], Kirk et al. have generalized the Banach contraction principle. They obtained a new fixed point results for cyclic contractive mappings.

Theorem 3.1 (Kirk et al. [13])

For i{1,,N}, let A i be a nonempty closed subsets of a complete metric space (X,d), and let T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    T( A i ) A i + 1 for all i{1,,N} with A N + 1 := A 1 ;

  2. (ii)

    there exists k(0,1) such that

    d(Tx,Ty)kd(x,y).

Then T has a unique fixed point in i = 1 N A i .

Let us define the binary relations R 1 and R 2 .

Definition 3.6 Let X be a nonempty set and let A i , i{1,,N} be nonempty closed subsets of X. We define two binary relations R k for k=1,2 by

x,yX:x R k y(x,y)Γ:= i = 1 N ( A i × A i + 1 )with  A N + 1 := A 1 .

Now, based on Theorem 2.2, we will derive a more general result for cyclic mappings.

Corollary 3.3 For i{1,,N}, let A i be nonempty closed subsets of a complete metric space (X,d), and let T:XX be a given mapping. Suppose that the following conditions hold:

  1. (i)

    T( A i ) A i + 1 for all i{1,,N} with A N + 1 := A 1 ;

  2. (ii)

    there exist two altering distance functions ψ and φ such that

    ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) φ ( d ( x , y ) ) for all (x,y) A i × A i + 1 for all i{1,,N}.

Then T has a unique fixed point in i = 1 N A i .

Proof Let Y:= i = 1 N A i . For all i{1,,N}, we have by assumption that each A i is nonempty closed subset of the complete metric space X, which implies that (Y,d) is complete.

Define the mapping α:Y×Y[0,+) by

α(x,y)={ 1 if  ( x , y ) Γ  or  x = y , 1 + ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) + φ ( d ( x , y ) ) φ ( d ( x , y ) ) + ψ ( d ( x , y ) ) otherwise ,

and define the mapping β:Y×Y[0,+) by

β(x,y)={ 1 if  ( x , y ) Γ  or  x = y , ψ ( d ( x , y ) ) φ ( d ( x , y ) ) + ψ ( d ( x , y ) ) otherwise .

Hence, Definition 2.3 is equivalent to Definition 3.6.

We start by checking that R 1 and R 2 are N-transitive. Indeed, let x 0 ,, x N + 1 Y such that x k R 1 x k + 1 and x k R 2 x k + 1 for all k{0,,N}, that is, α( x k , x k + 1 )1 and β( x k , x k + 1 )1 for all k{0,,N} such that

x 0 A i , x 1 A i + 1 ,, x k A i + k ,, x N + 1 A i + N + 1 = A i + 1 ,

which implies that ( x 0 , x N + 1 ) A i × A i + 1 Y. Hence, we obtain α( x 0 , x N + 1 )1 and β( x 0 , x N + 1 )1, that is, x 0 R 1 x N + 1 and x 0 R 2 x N + 1 , which implies that R 1 and R 2 are N-transitive.

Next, from (ii) and the definition of α and β, we can write

ψ ( d ( T x , T y ) ) α(x,y)ψ ( d ( x , y ) ) β(x,y)φ ( d ( x , y ) )

for all x,yY. Thus, T is (αψ,βφ)-contractive mapping.

We claim next that T is R 1 -preserving and R 2 -preserving. Indeed, let x,yY such that x R 1 y and x R 2 y, that is, α(x,y)1 and β(x,y)1; hence, there exists i{1,,N} such that x A i , y A i + 1 . Thus, (Tx,Ty) A i + 1 × A i + 2 Γ, then α(Tx,Ty)1 and β(Tx,Ty)1, that is, Tx R 1 Ty and Tx R 2 Ty. Hence, our claim holds.

Also, from (i), for any x 0 A i for all i{1,,N}, we have ( x 0 ,T x 0 ) A i × A i + 1 , which implies that α( x 0 ,T x 0 )1 and β( x 0 ,T x 0 )1, that is, x 0 R 1 T x 0 and x 0 R 2 T x 0 .

Now, we claim that Y is ( R 1 , R 2 )-regular. Let { x n } be a sequence in Y such that x n xY as n, and

x n R 1 x n + 1 , x n R 2 x n + 1 for all n,

that is,

α( x n , x n + 1 )1,β( x n , x n + 1 )1for all n.

It follows that there exist i,j{1,,N} such that

x n A i + n for all nNandx A j ,

so

x ( j i 1 + N ) + k N A j 1 + ( k + 1 ) N = A j 1 for all kN.

By letting

n(k):=(ji1+N)+kNfor all kN,

we conclude that the subsequence { x n ( k ) } satisfies

( x n ( k ) ,x) A j 1 × A j Γfor all kN,

hence α( x n ( k ) ,x)1 and β( x n ( k ) ,x)1 for all k, that is, x n ( k ) R 1 x and x n ( k ) R 2 x, which proves our claim.

Hence, all the hypotheses of Theorem 2.2 are satisfied on (Y,d), and we deduce that T has a fixed point x in Y. Since x A i for some i{1,,N} and x =T x A i + 1 for all i{1,,N}, then x i = 1 N A i .

Moreover, it is easy to check that X is ( R 1 , R 2 )-directed. Indeed, let x,yY with x A i , y A j , i,j{1,,N}. For z= x Y, we have ((α(x,z)1)(α(y,z)1)) and ((β(x,z)1)(β(y,z)1)). Thus, X is ( R 1 , R 2 )-directed.

Finally, the uniqueness follows by Theorem 2.3. □

4 Related fixed point theorems

In this section, we show that many existing results in the literature can be deduced from our results.

4.1 Classical fixed point results

Corollary 4.1 (Dutta and Choudhury [4])

Let (X,d) be a complete metric space, and let T:XX be a self-mapping satisfying the inequality

ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) φ ( d ( x , y ) ) for all x,yX,

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

Proof Let α,β:X×X[0,+) be the mapping defined by α(x,y)=β(x,y)=1 for all x,yX. Then T is (αψ,βφ)-contractive mappings. It is easy to show that all the hypotheses of Theorems 2.1 and 2.2 are satisfied. Consequently, T has a unique fixed point. □

Corollary 4.2 (Rhoades [17])

Let (X,d) be a complete metric space, and let T:XX be a self-mapping satisfying the inequality

d(Tx,Ty)d(x,y)φ ( d ( x , y ) ) for all x,yX,

where φ is an altering distance functions. Then T has a unique fixed point.

Proof Following the lines of the proof of Corollary 4.1, by taking ψ(t)=t, we get the desired result. □

4.2 Fixed point results in partially ordered metric spaces

We start by defining the binary relations R i for i=1,2 and the concept of ≤-directed.

Definition 4.1 Let (X,) be a partially ordered set.

  1. 1.

    We define two binary relations R 1 and R 2 on X by

    x,yX:x R i yxyfor i=1,2.
  2. 2.

    We say that X is ≤-directed if for all x,yX there exists a zX such that xz and yz.

Corollary 4.3 (Harjani and Sadarangani [8])

Let (X,) be a partially ordered set and d be a metric on X such that (X,d) is complete. Suppose that the mapping T:XX is weakly contractive, that is,

ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) φ ( d ( x , y ) ) for all xy,

where ψ and φ are altering distance functions. Suppose also that the following conditions hold:

  1. (i)

    T is a nondecreasing mapping;

  2. (ii)

    there exists x 0 X with x 0 T x 0 ;

If either:

  1. (iii)

    T is continuous or,

(iii′) for every sequence { x n } in X such that x n xX, and { x n } is a nondecreasing sequence, there exists a subsequence { x n ( k ) } such that x n ( k ) x for all k0.

Then T has a fixed point. Moreover, if X is ≤-directed, we have the uniqueness of the fixed point.

Proof Using Definition 2.3, we can define the binary relations R 1 and R 2 by the mappings α,β:X×X[0,+):

α(x,y)={ 1 if  x y , 1 + ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) + φ ( d ( x , y ) ) φ ( d ( x , y ) ) + ψ ( d ( x , y ) ) if  x y ,

and

β(x,y)={ 1 if  x y , ψ ( d ( x , y ) ) φ ( d ( x , y ) ) + ψ ( d ( x , y ) ) if  x y .

In case xy, the functions α and β are well defined, because the altering functions φ(d(x,y)) and ψ(d(x,y)) are null only, and only if d(x,y)=0, that is, x=y which is not the case.

We can verify easily that R 1 and R 2 are 1-transitive.

Next, we claim that T is (αψ,βφ)-contractive mappings. Indeed, in case xy, we easily get

ψ ( d ( T x , T y ) ) α(x,y)ψ ( d ( x , y ) ) β(x,y)φ ( d ( x , y ) ) ,

and in case xy, we have

α(x,y)ψ ( d ( x , y ) ) β(x,y)φ ( d ( x , y ) ) =ψ ( d ( x , y ) ) +ψ ( d ( T x , T y ) ) ψ ( d ( T x , T y ) ) ,

hence, our claim holds.

Moreover, from the monotone property of T, we get

x , y X , x R 1 y α ( x , y ) 1 x y T x T y α ( T x , T y ) 1 T x R 1 T y ,

and similarly, we have

x , y X , x R 2 y β ( x , y ) 1 x y T x T y β ( T x , T y ) 1 T x R 2 T y .

Thus T is R i -preserving for i=1,2. Now, if condition (iii) is satisfied, that is, T is continuous, the existence of a fixed point follows from Theorem 2.1. Suppose now, that the condition (iii′) is satisfied, and let { x n } be a nondecreasing sequence in X, that is, α( x n , x n + 1 )1 and β( x n , x n + 1 )1 for all n. Suppose also that x n xX as n. From (iii′), there exists a subsequence { x n ( k ) } such that x n ( k ) x for all k. This implies from the definition of α and β that α( x n ( k ) ,x)1 and β( x n ( k ) ,x)1 for all k, which implies x n ( k ) R i x for i=1,2 and for all k. In this case, the existence of a fixed point follows from Theorem 2.2.

To show the uniqueness, suppose that X is ≤-directed, that is, for all x,yX there exists a zX such that xz and yz, which implies from the definition of α and β that (α(x,z)1)(α(y,z)1) and (β(x,z)1)(β(y,z)1). Hence, Theorem 2.3 gives us the uniqueness of this fixed point. □

4.3 Coupled fixed point theorems

Next, in order to prove a coupled fixed point results in partially ordered set, we need to define an order relation on the set X×X.

Let (X,) be a partially ordered set endowed with a metric d, and let F:X×XX be a given mapping. We endow the product set X×X with the partial order:

(x,y),(u,v)X×X,(x,y)(u,v)xu,yv.

Definition 4.2 Let X be a set and binary relations S k for k=1,2 on X×X defined by

(x,y),(u,v)X×X:(x,y) S k (u,v)(x,y)(u,v).

Corollary 4.4 (Harjani et al. [6])

Let (X,d) be a partially ordered set and suppose that there exists a metric d in X such that (X,d) is a complete metric space. Suppose that the mapping F:X×XX is weakly (ψ,φ)-contractive, that is,

ψ ( F ( x , y ) , F ( u , v ) ) ψ ( max { d ( x , u ) , d ( y , v ) } ) φ ( max { d ( x , u ) , d ( y , v ) } ) for all ( x , y ) ( u , v ) ,

where ψ and φ are altering distance functions. Suppose also that the following conditions hold:

  1. (i)

    F is a mixed monotone mapping;

  2. (ii)

    there exists x 0 , y 0 X with ( x 0 , y 0 )(F x 0 ,F y 0 );

  3. (iii)

    F is continuous or (X×X,d) is ( S 1 , S 2 )-biregular.

Then F has a coupled fixed point ( x , y )X×X. Moreover, if X×X is ( S 1 , S 2 )-bidirected, we have the uniqueness of the fixed point.

Proof The conclusions then follows directly from Corollary 3.1. □

4.4 Fixed point results for cyclic contractive mappings

In this section, we will derive from our results the fixed point theorem of Karapınar and Sadarangani [11] for cyclic weak (φψ)-contractive mappings.

Definition 4.3 (Păcurar and Rus [16])

Let X be a nonempty set, m a positive integer and T:XX an operator. By definition, X= i = 1 m X i is a cyclic representation of X with respect to T if

  1. 1.

    X i , i=1,,m are nonempty sets;

  2. 2.

    T( X 1 ) X 2 ,,T( X m 1 ) X m , T( X m ) X 1 .

Definition 4.4 (Karapınar and Sadarangani [10])

Let (X,d) be a metric space, let m be a positive integer, let A 1 , A 2 ,, A m be closed non-empty subsets of X, and let Y:= i = 1 m A i . An operator T:YY is called a cyclic weak (φψ)-contraction if

  1. 1.

    i = 1 m A i is a cyclic representation of Y with respect to T, and

  2. 2.

    φ:[0,)[0,) is an altering distance function such that

    ψ ( d ( T x , T y ) ) ψ ( d ( x , y ) ) φ ( d ( x , y ) )
    (30)

for any x A i , y A i + 1 , where A m + 1 := A 1 .

Corollary 4.5 (Karapınar and Sadarangani [10])

Let (X,d) be a complete metric space, let m be a positive integer, let A 1 , A 2 ,, A m be closed non-empty subsets of X and let Y= i = 1 m A i . Suppose that φ:[0,)[0,) is an altering distance function, and T is a cyclic weak φ-contraction, where Y= i = 1 m A i is a cyclic representation of Y with respect to T. Then, T has a unique fixed point z i = 1 m A i .

Proof The proof follows immediately from Corollary 3.3. □