1 Introduction and preliminaries

The Banach contraction principle [1] is a popular tool in solving existence problems in many branches of mathematics (see, e.g., [24]). Extensions of this principle were obtained either by generalizing the domain of the mapping or by extending the contractive condition on the mappings [59]. Initially, existence of fixed points in ordered metric spaces was investigated and applied by Ran and Reurings [10]. Since then, a number of results have been proved in the framework of ordered metric spaces (see [1118]). Contractive conditions involving a pair of mappings are further additions to the metric fixed point theory and its applications (for details, see [1923]).

Recently, Wardowski [24] introduced a new contraction called F-contraction and proved a fixed point result as a generalization of the Banach contraction principle [1]. In this paper, we introduce an F-contraction with respect to a self-mapping on a metric space and obtain common fixed point results in an ordered metric space. In the last section, we give some results on periodic point properties of a mapping and a pair of mappings in a metric space. We begin with some basic known definitions and results which will be used in the sequel. Throughout this article, ℕ, R + , ℝ denote the set of natural numbers, the set of positive real numbers and the set of real numbers, respectively.

Definition 1 Let f and g be self-mappings on a set X. If fx=gx=w for some x in X, then x is called a coincidence point of f and g and w is called a coincidence point of f and g. Furthermore, if fgx=gfx whenever x is a coincidence point of f and g, then f and g are called weakly compatible mappings [22].

Let C(f,g)={xX:fx=gx} (F(f,g)={xX:x=fx=gx}) denote the set of all coincidence points (the set of all common fixed points) of self-mappings f and g.

Definition 2 ([25])

Let (X,d) be a metric space and f,g:XX. The mapping f is called a g-contraction if there exists α(0,1) such that

d(fx,fy)αd(gx,gy)

holds for all x,yX.

In 1976, Jungck [25] obtained the following useful generalization of the Banach contraction principle.

Theorem 1 Let g be a continuous self-mapping on a complete metric space (X,d). Then g has a fixed point in X if and only if there exists a g-contraction mapping f:XX such that f commutes with g and g(X)f(X).

Let Ϝ be the collection of all mappings F: R + R that satisfy the following conditions:

  1. (C1)

    F is strictly increasing, that is, for all α,β R + such that α<β implies that F(α)<F(β).

  2. (C2)

    For every sequence { α n } n N of positive real numbers, lim n α n =0 and lim n F( α n )= are equivalent.

  3. (C3)

    There exists k(0,1) such that

    lim α 0 + α k F(α)=0.

Definition 3 ([24])

Let (X,d) be a metric space and FϜ. A mapping f:XX is said to be an F-contraction on X if there exists τ>0 such that

d(fx,fy)>0implies thatτ+F ( d ( f x , f y ) ) F ( d ( x , y ) )
(1)

for all x,yX.

Note that every F-contraction is continuous (see [24]). We extend the above definition to two mappings.

Definition 4 Let (X,d) be a metric space, FϜ and f,g:XX. The mapping f is said to be an F-contraction with respect to g on X if there exists τ>0 such that

τ+F ( d ( f x , f y ) ) F ( d ( g x , g y ) )
(2)

for all x,yX satisfying min{d(fx,fy),d(gx,gy)}>0.

By different choices of mappings F in (1) and (2), one obtains a variety of contractions [24].

Example 1 Let F 1 : R + R be given by F 1 (α)=ln(α). It is clear that FϜ. Suppose that f:XX is an F-contraction with respect to a self-mapping g on X. From (2) we have

τ+ln ( d ( f x , f y ) ) ln ( d ( g x , g y ) ) ,

which implies that

d(fx,fy) e τ d(gx,gy).

Therefore an F 1 -contraction map f with respect to g reduces to a g-contraction mapping.

Now we give an example of an F-contraction with respect to a self-mapping g on X which is not a g-contraction on X.

Example 2 Consider the following sequence of partial sums { S n } n N [[24], Example 2.5]:

S 1 = 1 , S 2 = 1 + 2 , S 3 = 1 + 2 + 3 , S n = 1 + 2 + + n = n ( n + 1 ) 2 , n N .

Let X={ S n :nN} and d be the usual metric on X. Let f:XX and g:XX be defined as

f S n ={ S n 1 , if  n > 1 , S 1 , if  n = 1 , g S n ={ S n + 1 , if  n > 1 , S 1 , if  n = 1 .

Let F 1 : R + R be given by F 1 (α)=ln(α). As

lim n d ( f S n , f S 1 ) d ( g S n , g S 1 ) = lim n S n 1 S 1 S n + 1 S 1 =1,

so f is not a g-contraction. If we take F 2 (α)=ln(α)+α, then F 2 Ϝ and f is an F 2 -contraction with respect to a mapping g (taking τ=2). Indeed, the following holds:

d ( f S n , f S 1 ) d ( g S n , g S 1 ) e d ( f S n , f S 1 ) d ( g S n , g S 1 ) = S n 1 S 1 S n + 1 S 1 e S n 1 S 1 S n + 1 + S 1 = n 2 n 2 n 2 + 3 n e 4 n 2 e 2

for all n>1. For all m,nN with m>n>1, we have

d ( f S m , f S n ) d ( g S m , g S n ) e d ( f S m , f S n ) d ( g S m , g S n ) = S m 1 S n 1 S m + 1 S n + 1 e S m 1 S n 1 S m + 1 + S n + 1 = m 2 + m n 2 n m 2 + 3 m n 2 3 n e 2 ( m n ) e 2 .

Definition 5 ([26], Dominance condition)

Let (X,) be a partially ordered set. A self-mapping f on X is said to be (i) a dominated map if fxx for each x in X, (ii) a dominating map if xfx for each x in X.

Example 3 Let X=[0,1] be endowed with the usual ordering and f,g:XX defined by gx= x n for some nN and fx=kx for some real number k1. Note that

gx= x n xandxkx=fx

for all x in X. Thus g is dominated and f is a dominating map.

Definition 6 Let (X,) be a partially ordered set. Two mappings f,g:XX are said to be weakly increasing if fxgfx and gxfgx for all x in X (see [27]).

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

Definition 8 Let (X,) be a partial ordered set, then x, y in X are called comparable elements if either xy or yx holds true. Moreover, we define ΔX×X by

Δ= { ( x , y ) X × X : x y  or  y x } .

Definition 9 An ordered metric space (X,d,) is said to have the sequential limit comparison property if for every non-decreasing sequence (non-increasing sequence) { x n } n N in X such that x n x implies that x n x (x x n ).

2 Common fixed point results in ordered metric spaces

We present the following theorem as a generalization of results in [25] and [[24], Theorem 2.1].

Theorem 2 Let (X,) be a partially ordered set such that there exists a metric d on X, and let f:XX be an F-contraction with respect to g:XX on Δ with f(X)g(X). Assume that f is dominating and g is dominated. Then

  1. (a)

    f and g have a coincidence point in X provided that g(X) is complete and has the sequential limit comparison property.

  2. (b)

    C(f,g) is well ordered if and only if C(f,g) is a singleton.

  3. (c)

    f and g have a unique common fixed point if f and g are weakly compatible and C(f,g) is well ordered.

Proof (a) Let x 0 be an arbitrary point of X. Since the range of g contains the range of f, there exists a point x 1 in X such that f( x 0 )=g( x 1 ). As f is dominating and g is dominated, so we have

x 0 f x 0 =g x 1 x 1 .

Hence ( x 0 , x 1 )Δ. Continuing this process, having chosen x n in X, we obtain x n + 1 in X such that

x n f x n =g x n + 1 x n + 1 .

So, we obtain ( x n , x n + 1 )Δ for every nN{0}. For the sake of simplicity, take

γ n =d(g x n ,g x n + 1 )
(3)

for all nN{0}. If there exists n 0 N{0} for which x n 0 + 1 = x n 0 , then f x n 0 =g x n 0 + 1 implies that f x n 0 + 1 =g x n 0 + 1 , that is, x n 0 + 1 C(f,g). Now we assume that x n + 1 x n for all nN{0}. As f is an F-contraction with respect to g on Δ, so we obtain

F ( γ n ) = F ( d ( g x n , g x n + 1 ) ) = F ( d ( f x n 1 , f x n ) ) F ( d ( g x n 1 , g x n ) ) τ = F ( d ( f x n 2 , f x n 1 ) ) τ F ( d ( g x n 2 , g x n 1 ) ) 2 τ F ( d ( g x 1 , g x 2 ) ) ( n 1 ) τ = F ( γ 1 ) ( n 1 ) τ .

That is,

F( γ n )F( γ 1 )(n1)τ.

On taking limit as n, we obtain lim n F( γ n )=. Hence lim n γ n =0 by (C2). Now, by (C3), there exists k(0,1) such that lim n γ n k F( γ n )=0. Note that

γ n k F( γ n ) γ n k F( γ 1 ) γ n k ( F ( γ 1 ) ( n 1 ) τ ) γ n k F( γ 1 )= γ n k (n1)τ0.
(4)

Taking limit as n in (4), we have lim n (n1) γ n k =0. Consequently, lim n n γ n k =0. Thus there exists n 1 in ℕ such that n γ n k 1 for all n n 1 , that is, γ n 1/ n 1 / k for all n n 1 . Now, for integers m>n1, we obtain

d ( g x n , g x m ) d ( g x n , g x n + 1 ) + d ( g x n + 1 , g x n + 2 ) + + d ( g x m 1 , g x m ) < i = n γ i i = n 1 i 1 k < .

This shows that { g x n } n N is a Cauchy sequence in g(X). As g(X) is complete, so there exists q in g(X) such that lim n g x n =q. Let pX be such that g(p)=q. The sequential limit comparison property implies that g x n + 1 q. As x n f x n =g x n + 1 q=g(p)p so ( x n ,p)Δ. Hence from (2) we have

F ( d ( g x n , f p ) ) =F ( d ( f x n 1 , f p ) ) F ( d ( g x n 1 , g p ) ) τ.

Since lim n d(g x n 1 ,gp)=0, therefore by (C2) we have lim n F(d(g x n 1 ,gp))=. Hence lim n F(d(g x n ,fp))= implies that lim n d(g x n ,fp)=0. That is, lim n g x n =fp. Uniqueness of limit implies fp=gp, that is, pC(f,g).

(b) Now suppose that C(f,g) is well ordered. We prove that C(f,g) is a singleton. Assume on the contrary that there exists another point w in X such that fw=gw with wp. Since C(f,g) is well ordered, so (w,p)Δ. Now from (2) we have

τF ( d ( g w , g p ) ) F ( d ( f w , f p ) ) =0,

a contradiction. Therefore w=p. Hence f and g have a unique coincidence point p in X. The converse follows immediately.

  1. (c)

    Now if f and g are weakly compatible mappings, then we have fq=fgp=gfp=gq, that is, q is the coincidence point of f and g. But q is the only point of coincidence of f and g, so fq=gq=q. Hence q is the unique common fixed point of f and g. □

Example 4 Let X=[0,5] be endowed with usual metric and usual order. Define mappings f,g:XX by

gx={ 0 if  x [ 0 , 3 ) , 3 if  x [ 3 , 5 ) , 5 if  x = 5 , fx={ 3 if  x [ 0 , 3 ) , 5 if  x [ 3 , 5 ] .

Clearly, g is dominated and f is dominating. Define F: R + R as F(x)=ln(x). If x[0,3) and y[3,5), then

F ( d ( f x , f y ) ) = F ( d ( 3 , 5 ) ) = F ( 2 ) = ln ( 2 ) 0.693 < F ( d ( g x , g y ) ) = F ( d ( 0 , 3 ) ) = F ( 3 ) = ln ( 3 ) 1.098 .

Hence, for τ(0,0.40], inequality (2) is satisfied. Similarly, for x[0,3) and y=5, we have

F ( d ( f x , f y ) ) = F ( d ( 3 , 5 ) ) = F ( 2 ) = ln ( 2 ) 0.693 < F ( d ( g x , g y ) ) = F ( d ( 0 , 5 ) ) = F ( 5 ) = ln ( 5 ) 1.6094 .

Hence, for τ(0,0.9164], inequality (2) is satisfied. We can take a τ(0,0.40] so that

τ+F ( d ( f x , f y ) ) F ( d ( g x , g y ) )

is satisfied for all x,y[0,5], whenever min{d(fx,fy),d(gx,gy)}>0. Hence f is an F-contraction with respect to g on [0,5]. Hence all the conditions of Theorem 2 are satisfied. Moreover, x=5 is the coincidence point of f and g. Also note that f and g are weakly compatible and x=5 is the common fixed point of g and f as well.

Now we give a common fixed point result without imposing any type of commutativity condition for self-mappings f and g on X. Moreover, we relax the dominance conditions on f and g as well.

Theorem 3 Let (X,) be a partially ordered set such that there exists a complete metric d on X. If self-mappings f and g on X are weakly increasing and for some τ>0 satisfy

τ+F ( d ( f x , g y ) ) F ( d ( x , y ) )
(5)

for all (x,y)Δ such that min{d(fx,gy),d(x,y)}>0, then F(f,g), provided that X has the sequential limit comparison property. Further, f and g have a unique common fixed point if and only if F(f,g) is well ordered.

Proof Let x 0 be an arbitrary point of X. Define a sequence { x n } n N in X as follows: x 2 n + 1 =f x 2 n and x 2 n + 2 =g x 2 n + 1 . Since f and g are weakly increasing, we have x 2 n + 1 =f x 2 n gf x 2 n =g x 2 n + 1 = x 2 n + 2 and x 2 n + 2 =g x 2 n + 1 fg x 2 n + 1 =f x 2 n + 2 = x 2 n + 3 . Hence ( x 2 n + 1 , x 2 n + 2 )Δ and ( x 2 n + 2 , x 2 n + 3 )Δ for every nN{0}. Now define

γ 2 n =d( x 2 n + 1 , x 2 n + 2 )
(6)

for all nN{0}. Using (5) the following holds for every nN{0}:

F ( γ 2 n ) = F ( d ( x 2 n + 1 , x 2 n + 2 ) ) = F ( d ( f x 2 n , g x 2 n + 1 ) ) F ( d ( x 2 n , x 2 n + 1 ) ) τ = F ( γ 2 n 1 ) τ .

Similarly,

F ( γ 2 n + 1 ) = F ( d ( x 2 n + 3 , x 2 n + 2 ) ) = F ( d ( f x 2 n + 2 , g x 2 n + 1 ) ) F ( d ( x 2 n + 1 , x 2 n + 2 ) ) τ = F ( γ 2 n ) τ .

Therefore, for all nN{0}, we have

F ( γ n ) F ( γ n 1 ) τ F ( γ n 2 ) 2 τ F ( d ( x 1 , x 2 ) ) n τ = F ( γ 0 ) n τ .

Thus

F( γ n )F( γ 0 )nτ.
(7)

Taking limit as n in (7), we get

lim n F( γ n )=.

By (C2) and (C3) we get lim n γ n =0 and k(0,1) such that lim n γ n k F( γ n )=0. Note that

γ n k F( γ n ) γ n k F( γ 0 ) γ n k ( F ( γ 0 ) n τ ) γ n k F( γ 0 )= γ n k nτ0.
(8)

By taking limit as n in (8), we get lim n n γ n k =0. This implies that there exists n 1 such that n γ n k 1 for all n n 1 . Consequently, we obtain γ n 1/ n 1 / k for all n n 1 . Now, for integers m>n1, we have

d( x n , x m )d( x n , x n + 1 )+d( x n + 1 , x n + 2 )++d( x m 1 , x m )< i = n γ i i = n 1 i 1 k <.

This shows that { x n } n N is a Cauchy sequence in X, so there exists p in X such that lim n x n =p. As X has the sequential limit comparison property, so ( x n ,p),( x 2 n ,p),( x 2 n + 1 ,p)Δ. Therefore

lim n F ( d ( x 2 n + 1 , g p ) ) = lim n F ( d ( f x 2 n , g p ) ) F ( d ( x 2 n , p ) ) τ.

Since lim n d( x 2 n ,p)=0, by (C2) we have lim n F(d( x 2 n ,p))=. This implies lim n F(d( x 2 n + 1 ,gp))=, which further implies that lim n d( x 2 n + 1 ,gp)=0. Hence d(p,gp)=0 and p=gp. Similarly, we obtain p=fp. This shows that p is a common fixed point of g and f. Now suppose that F(f,g) is well ordered. We prove that F(f,g) is a singleton. Assume on the contrary that there exists another point q in X such that q=fq=gq with qp. Obviously, (q,p)Δ. So, from (5) we have τF(d(q,p))F(d(fq,gp))=0, a contradiction. Therefore q=p. Hence g and f have a unique common fixed point p in X. The converse follows immediately. □

3 Periodic point results in metric spaces

If x is a fixed point of the self-mapping f, then x is a fixed point of f n for every nN, but the converse is not true. In the sequel, we denote by F(f) the set of all fixed points of f.

Example 5 Let f:[0,1][0,1] be given by

f(x)=1x.

Then f has a unique fixed point x=1/2. Note that f n x=x holds for every even natural number n and x in [0,1]. On the other hand, define a mapping g:[0,π][0,π] as

g(x)=cosx.

Then g has the same fixed point as g n for every n.

Definition 10 The self-mapping f is said to have the property P if F( f n )=F(f) for every nN. A pair (f,g) of self-mappings is said to have the property Q if F(f)F(g)=F( f n )F( g n ).

For further details on these properties, we refer to [20, 28].

Let (X,d) be a metric space and f:XX be a self-mapping. The set O(x)={x,fx,, f n x,} is called the orbit of x [29]. A mapping f is called orbitally continuous at p if lim n f n x=p implies that lim n f n + 1 x=fp. A mapping f is orbitally continuous on X if f is orbitally continuous for all xX.

In this section we prove some periodic point results for self-mappings on complete metric spaces.

Theorem 4 Let X be a nonempty set such that there exists a complete metric d on X. Suppose that f:XX satisfies

τ+F ( d ( f x , f 2 x ) ) F ( d ( x , f x ) )
(9)

for some τ>0 and for all x in X such that d(fx, f 2 x)>0. Then f has the property P provided that f is orbitally continuous on X.

Proof First we show that F(f). Let x 0 X. Define a sequence { x n } n N in X, such that x n + 1 =f x n , for all nN{0}. Denote γ n =d( x n , x n + 1 ) for all nN{0}. If there exists n 0 N{0} for which x n 0 + 1 = x n 0 , then f x n 0 = x n 0 and the proof is finished. Suppose that x n + 1 x n for all nN{0}. Using (9), we obtain

F ( γ n ) = F ( d ( x n , x n + 1 ) ) = F ( d ( f x n 1 , f 2 x n 1 ) ) F ( d ( x n 1 , f x n 1 ) ) τ = F ( d ( f x n 2 , f 2 x n 2 ) ) τ F ( d ( x n 2 , f x n 2 ) ) 2 τ F ( d ( x 1 , x 2 ) ) ( n 1 ) τ = F ( d ( f x 0 , f 2 x 1 ) ) ( n 1 ) τ F ( d ( x 0 , x 1 ) ) n τ = F ( γ 0 ) n τ

for every nN{0}. By taking limit as n in the above inequality, we obtain that lim n F( γ n )=, which together with (C2) gives lim n γ n =0. From (C3), there exists k(0,1) such that lim n γ n k F( γ n )=0. Note that

γ n k F ( γ n ) γ n k F ( γ 0 ) γ n k ( F ( γ 0 ) n τ ) γ n k F ( γ 0 ) = γ n k n τ 0 .

On taking limit as n, we get lim n n γ n k =0. Hence there exists n 1 such that n γ n k 1 for all n n 1 . Consequently γ n 1/ n 1 / k for all n n 1 . Now, for integers m>n1 such that

d ( f n x 0 , f m x 0 ) = d ( x n , x m ) d ( x n , x n + 1 ) + d ( x n + 1 , x n + 2 ) + + d ( x m 1 , x m ) < i = n γ i i = n 1 i 1 k < .

This shows that { f n x 0 } n N is a Cauchy sequence. Since { f n x 0 :nN}O( x 0 )X and X is complete, which implies that there exists x in X such that lim n f n x 0 =x. Since f is orbitally continuous at x, so x= lim n f n x 0 =f( lim n f n 1 x 0 )=fx. Hence f has a fixed point and F( f n )=F(f) is true for n=1. Now assume n>1. Suppose on the contrary that uF( f n ) but uF(f), then d(u,fu)=α>0. Now consider

F ( α ) = F ( d ( u , f u ) ) = F ( d ( f ( f n 1 u ) , f 2 ( f n 1 u ) ) ) F ( d ( f n 1 u , f n u ) ) τ F ( d ( f n 2 u , f n 1 u ) ) 2 τ F ( d ( u , f u ) ) n τ .

Thus F(α) lim n F(d(u,fu))nτ=. Hence F(α)=. By (C2) α=0, a contradiction. So uF(f). □

Theorem 5 Let (X,) be a partially ordered set such that there exists a complete metric d on X and f, g self-mappings on X. Further assume that f, g are weakly increasing and satisfy

τ+F ( d ( f x , g y ) ) F ( d ( x , y ) )

for some τ>0, for all x, y in X such that min{d(fx,gy),d(x,y)}>0. Then f and g have the property Q provided that X has the sequential limit comparison property.

Proof By Theorem 3, f and g have a common fixed point. Suppose on the contrary that

uF ( f n ) F ( g n )

but uF(f)F(g), then there are three possibilities (a) uF(f)F(g), (b) uF(g)F(f), (c) uF(f) and uF(g). Without loss of generality, let uF(g), that is, d(u,gu)=α>0, so we get

F ( α ) = F ( d ( u , g u ) ) = F ( d ( f ( f n 1 u ) , g ( g n u ) ) ) F ( d ( f n 1 u , g n u ) ) τ F ( d ( f n 2 u , g n 1 u ) ) 2 τ F ( d ( u , g u ) ) n τ .

As lim n F(d(u,gu))nτ=, so we have F(α)=. By (C2) α=0, a contradiction. Hence uF(g)F(f). □