1 Introduction

The well known Banach's fixed point theorem asserts that: If (X, d) is a complete metric space and f : XX is a mapping such that

d ( f ( x ) , f ( y ) ) λ d ( x , y )

for all x, yX and some λ ∈ [0,1), then f has a unique fixed point in X. Kannan [1] extended Banach's fixed point theorem to the class of maps f : XX satisfying the following contractive condition:

d ( f ( x ) , f ( y ) ) λ [ d ( x , f ( x ) ) + d ( y , f ( y ) ) ]

for all x, yX and some λ ∈ (0,1/ 2). Reich [2] generalized both results using the contractive condition:

d ( f ( x ) , f ( y ) ) α d ( x , y ) + β d ( x , f ( x ) ) + γ d ( y , f ( y ) )

for each x, yX, where α, β, γ are nonnegative real numbers statisfying α + β + γ < 1.

Matkowski [3] used the following contractive condition:

d ( f ( x ) , f ( y ) ) φ ( d ( x , y ) )

for all x, yX, where φ : ℝ+ → ℝ+ is a nondecreasing function such that lim n φ n ( t ) =0 for all t > 0.

In 1994, Matthews [4] introduced the notion of a partial metric space and obtained a generalization of Banach's fixed point theorem for partial metric spaces. Recently, Altun et al. [5] (see also Altun and Sadarangani [6]) gave some generalized versions of the fixed point theorem of Matthews [4]. Di Bari and Vetro [7] obtained some results concerning cyclic mappings in the framework of partial metric spaces. We recall below the definition of partial metric space and some of its properties (see [4, 5, 8, 9]).

Definition 1 A partial metric on a nonempty set X is a function p : X × X → ℝ+ such that for all x, y, z, ∈ X:

p1 x = yp (x, x) = p (x, y) = p (y, y),

p2 p (x, x) ≤ p(x, y),

p3 p(x, y) = p(y, x),

p4 p(x, y) ≤ p(x, z) + p(z, y) - p(z, z).

A partial metric space is a pair (X, p) where X is a nonempty set and p is a partial metric on X. The function p (x, y) = max{x, y} for all x, y ∈ ℝ+ defines a partial metric on ℝ+. Other interesting examples of partial metric spaces can be found in [4, 10, 11]. It is known [8] that each partial metric p on X generates a T0 topology τ p on X which has as a base the family of open p-balls {B p (x, ε) : xX, ε > 0}, where B p (x, ε) = {yX : p (x, y) < p (x, x) + ε} for all xX and ε > 0.

If p is a partial metric on X, then the function ps: X × X → ℝ+ given by

p s ( x , y ) = 2 p ( x , y ) - p ( x , x ) - p ( y , y )

defines a metric on X (see [12]).

Let (X, p) be a partial metric space.

A sequence {x n } in a partial metric space (X, p) converges to a point xX [4, 5, 8] if and only if p ( x , x ) = lim n p ( x , x n ) .

A sequence {x n } in a partial metric space (X, p) is called a Cauchy sequence [4, 5, 8] if there exists (and is finite) lim n , m p ( x n , x m ) .

A partial metric space (X, p) is said to be complete [4, 5, 8] if every Cauchy sequence {x n } in X converges, with respect to τ p , to a point xX such that p ( x , x ) = lim n , m p ( x n , x m ) .

It is evident that every closed subset of a complete partial metric space is complete.

Lemma 2 [4, 5, 8] Let (X, p) be a partial metric space.

  1. (1)

    {x n } is a Cauchy sequence in (X, p) if and only if it is a Cauchy sequence in the metric space (X,ps).

  2. (2)

    A partial metric space (X, p) is complete if and only if the metric space (X, ps) is complete. Furthermore, lim n p s ( x n , x ) =0 if and only if

    p ( x , x ) = lim n p ( x n , x ) = lim n , m p ( x n , x m ) .

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

(i) X i , i = 1,..., m are nonempty sets;

(ii) f (X1) ⊂ X2,..., f (Xm- 1) ⊂ X m , f (X m ) ⊂ X1.

Definition 4 [13] A function φ : ℝ+ → ℝ+ is called a comparison function if it satisfies:

(i) φ is monotone increasing, i.e., t1t2 implies φ (t1) ≤ φ(t2), for any t1,t2 ∈ ℝ+;

(ii) (φn(t))n ∈ ℕconverges to 0 as n → ∞ for all t ∈ ℝ+.

Definition 5 [13] A function φ : ℝ+ → ℝ+ is called a (c)-comparison function if it satisfies:

(i) φ is monotone increasing;

(ii) there exist k0 ∈ ℕ, a ∈ (0,1) and a convergent series of nonnegative terms k = 1 v k such that

φ k + 1 ( t ) α φ k ( t ) + v k ,

for kk0 and any t ∈ ℝ+.

Lemma 6 [13] If φ : ℝ+ → ℝ+ is a (c)-comparison function, then the following hold:

(i) φ is a comparison function;

(ii) φ(t) < t, for any t ∈ ℝ+;

(iii) φ is continuous at 0;

(iv) the series k = 0 φ k ( t ) converges for any t ∈ ℝ+.

In [13], Păcurar and Rus discussed fixed point theorey for cyclic φ- contractions in metric spaces and in [14], Karapinar obtained a fixed point theorem for cyclic weak φ- contraction mappings still in metric spaces.

In this article, we prove some fixed point theorems for generalized contractions defined on cyclic representation in the setting of partial metric spaces.

2 Main results

Definition 7 Let (X,p) be a partial metric space. A mapping f : XX is called a φ-contraction if there exists a comparison function φ : ℝ+ → ℝ+ such that

p ( f ( x ) , f ( y ) ) φ ( p ( x , y ) )

for all x, yX.

Definition 8 Let (X, p) be a partial metric space, m a positive integer, A1,..., A m nonempty closed subsets of X and Y= i = 1 m A i . An operator f : YY is called a cyclic φ-contraction if

(i) i = 1 m A i is a cyclic representation of Y w.r.t f;

(ii) There exists a (c)-comparison function φ : ℝ+ → ℝ+ such that

p ( f ( x ) , f ( y ) ) φ ( p ( x , y ) )
(2.1)

for any xA i , yAi+1, where Am+1= A1.

Theorem 9 Let (X, p) be a complete partial metric space, m a positive integer, A1,..., A m closed nonempty subsets of X,Y= i = 1 m A i ,φ: + + a (c)-comparison function and f :YY an operator. Assume that

(i) i = 1 m A i is a cyclic representation of Y w.r.t f ;

(ii) f is a cyclic φ-contraction.

Then f has a unique fixed point x * i = 1 m A i and the Picard iteration {x n } converges to x* for any initial point x0Y.

Proof. Let x 0 Y= i = 1 m A i , and set

x n = f ( x n - 1 ) , n 1 .

For any n ≥ 0 there is i n ∈ {i, ..., m} such that x n A i n and x n + 1 A i n + 1 . Then by (2.1) we have

p ( x n , x n + 1 ) = p ( f ( x n - 1 ) , f ( x n ) ) φ ( p ( x n - 1 , x n ) ) .

Since φ is monotone increasing, we get by induction that

p ( x n , x n + 1 ) φ n ( p ( x 0 , x 1 ) ) .
(2.2)

By definition of φ, thus letting n → ∞ in (2.2), we obtain that

lim n p ( x n , x n + 1 ) = 0 .

On the other hand, since

p ( x n , x n ) p ( x n , x n + 1 ) and p ( x n + 1 , x n + 1 ) p ( x n , x n + 1 ) ,

then from (2.2) we have

p ( x n , x n ) φ n ( p ( x 0 , x 1 ) ) and p ( x n + 1 , x n + 1 ) φ n ( p ( x 0 , x 1 ) ) .
(2.3)

Thus, we have

p s ( x n , x n + 1 ) 4 φ n ( p ( x 0 , x 1 ) ) .

Since φ is a (c)-comparison function, from Lemma 6, it follows that

lim n p s ( x n , x n + 1 ) = 0 .

So for k ≥ 1, we have

p s ( x n , x n + k ) p s ( x n , x n + 1 ) + + p s ( x n + k - 1 , x n + k ) 4 m = n n + k - 1 φ m ( p ( x 0 , x 1 ) ) .

Again since φ is a (c)-comparison function, by Lemma 6, it follows that

m = 0 φ m ( p ( x 0 , x 1 ) ) < .

This implies that {x n } is a Cauchy sequence in the metric subspace (Y, ps). Since Y is closed, the subspace (Y, p) is complete. Then from Lemma 2, we have that (Y, ps) is complete. Let

lim n p s ( x n , y ) = 0 .

Now Lemma 2 further implies that

p ( y , y ) = lim n p ( x n , y ) = lim n , m p ( x n , x m ) .
(2.4)

Therefore, since {x n } is a Cauchy sequence in the metric space (Y, ps), it implies that lim n , m p s ( x n , x m ) =0. Also from (2.3) we have lim n p ( x n , x n ) =0, and using the definition of pswe obtain lim n , m p ( x n , x m ) =0. Consequently, from (2.4) we have

p ( y , y ) = lim n p ( x n , y ) = lim n , m p ( x n , x m ) = 0 .

As a result, {x n } is a Cauchy sequence in the complete partial metric subspace (Y, p), and it is convergent to a point yY.

On the other hand, the sequence {x n } has an infinite number of terms in each A i , i = 1,...,m. Since (Y, p) is complete, in each A i , i = 1,..., m, we can construct a subsequence of {x n } which converges to y. Since A i , i = 1,..., m are closed, we see that

y i = 1 m A i ; i . e . ,

i = 1 m A i . Now we can consider the restriction

f | i = 1 m A i : i = 1 m A i i = 1 m A i ,

which satisfies the conditions of Theorem 1 in [5, 6], since i = 1 m A i is also closed and complete. Thus f | i = 1 m A i has a unique fixed point, say x * i = 1 m A i . We claim that for any initial value xY, we get the same limit point x * i = 1 m A i . Indeed, for xY= i = 1 m A i , by repeating the above process, the corresponding iterative sequence yields that f | i = 1 m A i has a unique fixed point, say z i = 1 m A i . Regarding that x * , z i = 1 m A i , we have x* zA i for all i, hence p (x*, z) and p (f (x*), f (z)) are well defined. Due to (2.1), we have

p ( x * , z ) = p ( f ( x * ) , f ( z ) ) φ ( p ( x * , z ) ) ,

which is a contradiction. Thus, x* is a unique fixed point of f for any initial value xY.

To prove that the Picard iteration converges to x* for any initial point xY. Let xY= i = 1 m A i . There exists i0 ∈ {1,..., m} such that x A i 0 . As x * i = 1 m A i it follows that x * A i 0 + 1 as well. Then we obtain:

p ( f ( x ) , f ( x * ) ) φ ( p ( x , x * ) ) .

By induction, it follows that:

p ( f n ( x ) , x * ) φ n ( p ( x , x * ) ) , n 0 .

Since

p ( x * , x * ) p ( f n ( x ) , x * ) ,

we have

p ( x * , x * ) φ n ( p ( x , x * ) ) .

Now letting n → ∞, and supposing xx*, we have

p ( x * , x * ) = lim n p ( f n ( x ) , x * ) = 0 ,

i.e., the Picard iteration converges to the unique fixed point of f for any initial point xY.

Theorem 10 Let f :YY as in Theorem 9. Then

n = 0 p ( f n ( x ) , f n + 1 ( x ) ) < ,

for any xY, i.e., f is a good Picard operator.

Proof. Let x = x 0 Y. Then

p ( f n ( x 0 ) , f n + 1 ( x 0 ) ) = p ( x n , x n + 1 ) φ n ( p ( x 0 , x 1 ) ) .

for all n ∈ ℕ Thus, by Lemma 6, we have

n = 0 p ( f n ( x 0 ) , f n + 1 ( x 0 ) ) n = 0 φ n ( p ( x 0 , x 1 ) ) < ,

since p(x0, x1) > 0. So, f is a good Picard operator.

Theorem 11 Let f :YY as in Theorem 9. Then

n = 0 p ( f n ( x ) , x * ) < ,

for any xY, i.e., f is a special Picard operator.

Proof. Since

p ( f n ( x ) , x * ) φ n ( p ( x , x * ) ) , n 0

holds for any xY, by Lemma 6, we have

n = 0 p ( f n ( x ) , x * ) n = 0 φ n ( p ( x , x * ) ) < .

This shows that f is a special Picard operator.

Theorem 12 (Reich type). Let (X, p) be a complete partial metric space, m a positive integer, A1,...,A m closed nonempty subsets of X,Y= i = 1 m A i , and f : YY an operator. Assume that

(i) i = 1 m A i is a cyclic representation of Y w.r.t f ;

(ii) for any xA i , yAi+1, where Am+1= A1, we have

p ( f ( x ) , f ( y ) ) α p ( x , y ) + β p ( x , f ( x ) ) + γ p ( y , f ( y ) ) ,
(2.5)

where α, β, γ ≥ 0 with α + β + γ < 1.

Then f has a unique fixed point x * i = 1 m A i and the Picard iteration {x n } converges to x* for any initial point x0Y if α + 2β + 2γ < 1.

Proof. Let x 0 Y= i = 1 m A i , and set

x n = f ( x n - 1 ) , n 1 .

For any n ≥ 0 there is i n ∈ {i,..., m} such that x n A i n and x n + 1 A i n + 1 . Then by (2.5) we have

p ( x n , x n + 1 ) = p ( f ( x n - 1 ) , f ( x n ) ) α p ( x n - 1 , x n ) + β p ( x n - 1 , f ( x n - 1 ) ) + γ p ( x n , f ( x n ) ) = α p ( x n - 1 , x n ) + β p ( x n - 1 , x n ) + γ p ( x n , x n + 1 ) = ( α + β ) p ( x n - 1 , x n ) + γ p ( x n , x n + 1 ) ,

which implies

p ( x n , x n + 1 ) α + β 1 - γ p ( x n - 1 , x n ) .

Therefore,

p ( x n , x n + 1 ) λ n p ( x 0 , x 1 ) ,
(2.6)

where

λ = α + β 1 - γ .

It is clear that λ ∈ [0,1), thus letting n → ∞ in (2.6), we obtain that

lim n p ( x n , x n + 1 ) = 0 .

On the other hand, since

p ( x n , x n ) p ( x n , x n + 1 ) and p ( x n + 1 , x n + 1 ) p ( x n , x n + 1 ) ,

from (2.6) we have

p ( x n , x n ) λ n p ( x 0 , x 1 ) and p ( x n + 1 , x n + 1 ) λ n p ( x 0 , x 1 ) .
(2.7)

Hence,

p s ( x n , x n + 1 ) 4 λ n p ( x 0 , x 1 ) .

This implies that

lim n p s ( x n , x n + 1 ) = 0 .

Now, for k ≥ 1, we have

p s ( x n , x n + k ) p s ( x n , x n + 1 ) + + p s ( x n + k - 1 , x n + k ) 4 λ n p ( x 0 , x 1 ) + + 4 λ n + k - 1 p ( x 0 , x 1 ) 4 λ n 1 - λ p ( x 0 , x 1 ) .

Thus {x n } is a Cauchy sequence in the metric subspace (Y, ps). Since Y is closed, the subspace (Y, p) is complete and so from Lemma 2, we have that (Y, ps) is complete. So the sequence {x n } is convergent in the metric subspace (Y, ps). Let

lim n p s ( x n , y ) = 0 .

Again from Lemma 2, we get

p ( y , y ) = lim n p ( x n , y ) = lim n , m p ( x n , x m ) .
(2.8)

As in the proof of Theorem 9, from (2.8) we have

p ( y , y ) = lim n p ( x n , y ) = lim n , m p ( x n , x m ) = 0 .

This shows that {x n } is a Cauchy sequence in the complete partial metric subspace (Y, p), and it is convergent to a point yY.

On the other hand, the sequence {x n } has an infinite number of terms in each A i , i = 1,...,m. Since (Y, p) is complete, in each A i , i = 1,..., m, we can construct a subsequence of {x n } which converges to y. Since each A i , i = 1,..., m is closed, it follows that

y i = 1 m A i ; i . e . ,

i = 1 m A i . Now we can consider the restriction

f | i = 1 m A i : i = 1 m A i i = 1 m A i ,

which satisfies the conditions of Corollary 4 in [5], as i = 1 m A i is also closed and complete. Thus, f | i = 1 m A i has a unique fixed point, say x * i = 1 m A i . We claim that for any initial value xY, we get the same limit point x * i = 1 m A i . In fact, for xY= i = 1 m A i , by repeating the above process, the corresponding iterative sequence yields that f | i = 1 m A i has a unique fixed point, say z i = 1 m A i . Since x * , z i = 1 m A i , we have x*, zA i for all i, hence p(x*,z), and p (f (x*), f (z)) are well defined. Due to (2.5),

p ( x * , z ) = p ( f ( x * ) , f ( z ) ) α p ( x * , z ) + β p ( x * , f ( x * ) ) + γ p ( z , f ( z ) ) α p ( x * , z ) + β p ( x * , z ) + γ p ( x * , z ) ,

which is a contradiction. Thus, x* is the unique fixed point of f for any initial value xY.

To prove that the Picard iteration converges to x* for any initial point xY. Let xY= i = 1 m A i . There exists i0 ∈ {1,..., m} such that x A i 0 . As x * i = 1 m A i it follows that x * A i 0 + 1 as well. Then we obtain:

p ( f ( x ) , f ( x * ) ) α p ( x , x * ) + β p ( x , f ( x ) ) + γ p ( x * , f ( x * ) ) α p ( x , x * ) + β [ p ( x , x * ) + p ( x * , f ( x ) ) - p ( x * , x * ) ] + γ [ p ( x * , f ( x ) ) + p ( f ( x ) , f ( x * ) ) - p ( f ( x ) , f ( x ) ) ] α p ( x , x * ) + β [ p ( x , x * ) + p ( x * , f ( x ) ) ] + γ [ p ( x * , f ( x ) ) + p ( f ( x ) , f ( x * ) ) ] ,

which implies

p ( f ( x ) , f ( x * ) ) α + β 1 - β - 2 γ p ( x , x * ) .

Let

λ 1 = α + β 1 - β - 2 γ ,

and suppose that α + 2β + 2γ < 1. Then, by induction, it follows that:

p ( f n ( x ) , x * ) λ 1 n p ( x , x * ) .

Since

p ( x * , x * ) p ( f n ( x ) , x * ) ,

we have

p ( x * , x * ) λ 1 n p ( x , x * ) .

Now letting n → ∞, and supposing xx*, we have

p ( x * , x * ) = lim n p ( f n ( x ) , x * ) = 0

i.e., the Picard iteration converges to the unique fixed point of f for any initial point xY provided α + 2β + 2γ < 1.

Corollary 13 (Banach type). Let (X, p) be a complete partial metric space, m a positive integer, A1,..., A m closed nonempty subsets of X,Y= i = 1 m A i , and f :YY an operator. Assume that

(i) i = 1 m A i is a cyclic representation of Y w.r.t f ;

(ii) for any xA i , yAi+1, where Am+1= A1, we have

p ( f ( x ) , f ( y ) ) α p ( x , y ) , 0 α < 1 .

Then f has a unique fixed point x * i = 1 m A i .

Corollary 14 (Kannan type). Let (X, p) be a complete partial metric space, m a positive integer, A1,..., A m closed nonempty subsets of X,Y= i = 1 m A i , and f : YY an operator. Assume that

(i) i = 1 m A i is a cyclic representation of Y w.r.t f ;

(ii) for any xA i , yAi+1, where Am+1= A1, we have

p ( f ( x ) , f ( y ) ) β p ( x , f ( x ) ) + γ p ( y , f ( y ) ) ,

where β, γ ≥ 0 with β+γ< 1 2 .

Then f has a unique fixed point x * i = 1 m A i .

Theorem 15 Let f : YY as in Theorem 12. Then

n = 0 p ( f n ( x ) , f n + 1 ( x ) ) < ,

for any xY, i.e., f is a good Picard operator.

Proof. Let x = x 0 Y. Then, as in the proof of Theorem 12,

p ( f n ( x 0 ) , f n + 1 ( x 0 ) ) = p ( x n , x n + 1 ) λ n p ( x 0 , x 1 )

for all n ∈ ℕ. So, we have

n = 0 p ( f n ( x 0 ) , f n + 1 ( x 0 ) ) n = 0 λ n p ( x 0 , x 1 ) < ,

since λ ∈ [0,1). Thus, f is a good Picard operator.

Theorem 16 Let f : YY as in Theorem 12. If α + 2β + 2γ < 1, then

n = 0 p ( f n ( x ) , x * ) < ,

for any xY, i.e., f is a special Picard operator.

Proof. As in the proof of Theorem 12, we have

p ( f n ( x ) , x * ) λ 1 n p ( x , x * )

holds for any xY, where λ 1 = α + β 1 - β - 2 γ . Hence, if α + 2β + 2γ < 1, we have

n = 0 p ( f n ( x ) , x * ) n = 0 λ 1 n p ( x , x * ) < .

This shows that f is a special Picard operator.