1. Introduction

Throughout this paper, we denote by and , the sets of positive integers and real numbers, respectively. Let (X, d) be a metric space. For each xX and AX, let d(x, A) = infyAd(x, y). Denote by N ( X ) the family of all nonempty subsets of X , C ( X ) the family of all nonempty closed subsets of X and CB ( X ) the class of all nonempty closed bounded subsets of X, respectively.

For any A,BCB ( X ) , define a function H : C B ( X ) × C B ( X ) [ 0 , ) by

H ( A , B ) = max sup x B d ( x , A ) , sup x A d ( x , B ) ,

then H is said to be the Hausdorff metric on CB ( X ) induced by the metric d on X. A point x in X is a fixed point of a map T if Tx = x (when T: XX is a single-valued map) or xTx (when T: X → 2Xis a multivalued map). The set of fixed points of T is denoted by F ( T ) .

It is known that many metric fixed point theorems were motivated from the Banach contraction principle (see, e.g., [1]) that plays an important role in various fields of applied mathematical analysis. Later, Kannan [2, 3] and Chatterjea [4] established the following fixed point theorems.

Theorem K. (Kannan [2, 3]) Let (X,d) be a complete metric space and T: XX be a selfmap. Suppose that there exists γ [ 0 , 1 2 ) such that

d ( T x , T y ) γ ( d ( x , T x ) + d ( y , T y ) ) for all x , y X .

Then, T has a unique fixed point in X.

Theorem C. (Chatterjea [4]) Let (X,d) be a complete metric space and T: XX be a selfmap. Suppose that there exists γ [ 0 , 1 2 ) such that

d ( T x , T y ) γ ( d ( x , T y ) + d ( y , T x ) ) for all x , y X .

Then, T has a unique fixed point in X.

Let f be a real-valued function defined on . For c, we recall that

limsup x c f ( x ) = inf ε > 0 sup 0 < x - c < ε f ( x )

and

limsup x c + f ( x ) = inf ε > 0 sup 0 < x - c < ε f ( x ) .

Definition 1.1. [510] A function φ: [0, ∞) → [0,1) is said to be an MT-function if it satisfies Mizoguchi-Takahashi's condition ( i.e., lim supst+ φ(s) < 1 for all t ∈ [0, ∞)).

It is obvious that if φ: [0, ∞) → [0,1) is a nondecreasing function or a nonincreasing function, then φ is an MT-function. So the set of MT-functions is a rich class. But it is worth to mention that there exist functions that are not MT-functions.

Example 1.1. [8] Let φ: [0, ∞) → [0, 1) be defined by

φ ( t ) : = sin t t , if t ( 0 , π 2 ] 0 , otherwise .

Since lim sup s 0 + φ ( s ) =1,φ is not an MT-function.

Very recently, Du [8] first proved some characterizations of MT-functions.

Theorem D. [8] Let φ: [0, ∞) → [0,1) be a function. Then, the following statements are equivalent.

  1. (a)

    φ is an MT-function.

  2. (b)

    For each t ∈ [0, ∞), there exist r t ( 1 ) [ 0 , 1 ) and ε t ( 1 ) >0 such that φ ( s ) r t ( 1 ) for all s ( t , t + ε t ( 1 ) ) .

  3. (c)

    For each t ∈ [0, ∞), there exist r t ( 2 ) [ 0 , 1 ) and ε t ( 2 ) >0 such that φ ( s ) r t ( 2 ) for all s [ t , t + ε t ( 2 ) ] .

  4. (d)

    For each t ∈ [0, ∞), there exist r t ( 3 ) [ 0 , 1 ) and ε t ( 3 ) >0 such that φ ( s ) r t ( 3 ) for all s ( t , t + ε t ( 3 ) ] .

  5. (e)

    For each t ∈ [0, ∞), there exist r t ( 4 ) [ 0 , 1 ) and ε t ( 4 ) >0 such that φ ( s ) r t ( 4 ) for all s [ t , t + ε t ( 4 ) ) .

  6. (f)

    For any nonincreasing sequence {x n }nin [0, ∞), we have 0 ≤ supnφ(x n ) < 1.

  7. (g)

    φ is a function of contractive factor [10]; that is, for any strictly decreasing sequence {x n }nin [0, ∞), we have 0 ≤ supnφ(x n ) < 1.

In 2007, Berinde and Berinde [11] proved the following interesting fixed point theorem.

Theorem BB. (Berinde and Berinde [11]) Let (X,d) be a complete metric space, T:XCB ( X ) be a multivalued map, φ: [0, ∞) → [0,1) be an MT-function and L ≥ 0. Assume that

H ( T x , T y ) φ ( d ( x , y ) ) d ( x , y ) + L d ( y , T x ) for all x , y X .

Then F ( T ) .

It is quite obvious that if let L = 0 in Theorem BB, then we can obtain Mizoguchi-Takahashi's fixed point theorem [12] that is a partial answer of Problem 9 in Reich [13, 14].

Theorem MT. (Mizoguchi and Takahashi [12]) Let (X,d) be a complete metric space, T:XCB ( X ) be a multivalued map and φ: [0, ∞) → [0,1) be an MT-function. Assume that

H ( T x , T y ) φ ( d ( x , y ) ) d ( x , y ) for all x , y X .

Then F ( T ) .

In fact, Mizoguchi-Takahashi's fixed point theorem is a generalization of Nadler's fixed point theorem, but its primitive proof is difficult. Later, Suzuki [15] give a very simple proof of Theorem MT. Recently, Du [5] established new fixed point theorems for τ0-metric (see Def. 2.1 below) and MT-functions to extend Berinde-Berinde's fixed point theorem. In [5], some generalizations of Kannan's fixed point theorem, Chatterjea's fixed point theorem and other new fixed point theorems for nonlinear multivalued contractive maps were given.

In this paper, we first establish some new fixed point theorems for MT-functions. By using these results, we can obtain some generalizations of Kannan's fixed point theorem and Chatterjea's fixed point theorem for nonlinear multivalued contractive maps in complete metric spaces. Our results generalize and improve some main results in [15, 79, 1215] and references therein.

2. Preliminaries

Let (X, d) be a metric space. Recall that a function p: X × X → [0, ∞) is called a w-distance [1, 16, 17], if the following are satisfied:

(w 1) p(x, z) ≤ p(x, y) + p(y, z) for any x, y, zX;

(w 2) for any xX,p(x, ⋅) : X → [0, ∞) is l.s.c;

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

Recently, Lin and Du introduced and studied τ-functions [5, 9, 1822]. A function p: X × X → [0, ∞) is said to be a τ-function, if the following conditions hold:

(τ 1) p(x, z) ≤ p(x, y) + p(y, z) for all x, y, zX;

(τ 2) If xX and {y n } in X with limn →∞y n = y such that p(x, y n ) ≤ M for some M = M(x) > 0, then p(x, y) ≤ M;

(τ 3) For any sequence {x n } in X with limn →∞sup{p(x n , x m ): m >n} = 0, if there exists a sequence {y n } in X such that limn →∞p(x n , y n ) = 0, then limn →∞d(x n , y n ) = 0;

(τ 4) For x, y, zX,p(x, y) = 0 and p(x, z) = 0 imply y = z.

Note that not either of the implications p(x, y) = 0 ⇔ x = y necessarily holds and p is nonsymmetric in general. It is well-known that the metric d is a w-distance and any w-distance is a τ-function, but the converse is not true; see [5, 19].

The following Lemma is essentially proved in [19]. See also [5, 8, 20, 22].

Lemma 2.1. [5, 8, 19, 20, 22] Let (X,d) be a metric space and p: X × X → [0, ∞) be any function. Then, the following hold:

  1. (a)

    If p satisfies (w 2), then p satisfies (τ 2);

  2. (b)

    If p satisfies (w 1) and (w 3), then p satisfies (τ 3);

  3. (c)

    Assume that p satisfies (τ 3). If {x n } is a sequence in X with limn →∞sup{p(x n ,x m ): m >n} = 0, then {x n } is a Cauchy sequence in X.

Let (X, d) be a metric space and p: X × X → [0, ∞) a τ-function. For each xX and A ⊆ X, let

d ( x , A ) = inf y A d ( x , y ) .

Recall that a selfmap T: XX is said to be

  1. (a)

    Kannan's type [2, 5, 16] if there exists γ [ 0 , 1 2 ) , such that d(Tx, Ty) ≤ γ{d(x, Tx)+d(y, Ty)} for all x, yX;

  2. (b)

    Chatterjea's type [3, 5] if there exists γ [ 0 , 1 2 ) , such that d(Tx, Ty) ≤ γ{d(x, Ty) + d(y, Tx)} for all x, yX.

Lemma 2.2. [5, 9, 21, 22] Let A be a closed subset of a metric space (X, d) and p: X × X → [0, ∞) be any function. Suppose that p satisfies (τ 3) and there exists uX such that p(u, u) = 0. Then, p(u, A) = 0 if and only if uA.

Recently, Du [5, 21] first has introduced the concepts of τ0-functions and τ0-metrics as follows.

Definition 2.1. [5, 9, 21, 22] Let (X, d) be a metric space. A function p: X × X → [0, ∞) is called a τ0-function if it is a τ-function on X with p(x, x) = 0 for all xX.

Remark 2.1. If p is a τ0-function then, from (τ 4), p(x, y) = 0 if and only if x = y.

Example 2.1. [5] Let X = with the metric d(x, y) = |xy| and 0 <a <b. Define the function p: X × X → [0, ∞) by

p ( x , y ) = max { a ( y - x ) , b ( x - y ) } .

Then, p is nonsymmetric, and hence, p is not a metric. It is easy to see that p is a τ0-function.

Definition 2.2. [5, 9, 21, 22] Let (X, d) be a metric space and p be a τ0-function (resp. w0-distance). For any A,BCB ( X ) , define a function D p : C B ( X ) × C B ( X ) [ 0 , ) by

D p ( A , B ) = max { δ p ( A , B ) , δ p ( B , A ) } ,

where δ p (A, B) = supxAp(x, B) and δ p (B, A) = supxBp(x, A), then D p is said to be the τ0-metric (resp. w0-metric) on CB ( X ) induced by p.

Clearly, any Hausdorff metric is a τ0-metric, but the reverse is not true. It is well-known that every τ0-metric D p is a metric on CB ( X ) ; for more detail, see [5, 9, 21, 22].

Lemma 2.3. Let (X,d) be a metric space, T:XC ( X ) be a multivalued map and {z n } be a sequence in X satisfying zn +1Tz n , n, and {z n } converge to v in X. Then, the following statements hold.

  1. (a)

    If T is closed (that is, GrT = {(x, y) ∈ X × X: yTx}, the graph of T, is closed in X × X), then F ( T ) .

  2. (b)

    Let p be a function satisfying (τ 3) and p(v, v) = 0. If limn →∞p(z n , zn +1) = 0 and the map f: X → [0, ∞) defined by f(x) = p(x, Tx) is l.s.c., then F ( T ) .

  3. (c)

    If the map g: X → [0, ∞) defined by g(x) = d(x, Tx) is l.s.c., then F ( T ) .

  4. (d)

    Let p be a function satisfying (τ 3). If limn →∞p(z n , Tv) = 0 and lim n →∞sup{p(z n , z m ): m >n} = 0, then F ( T ) .

Proof.

  1. (a)

    Since T is closed, zn +1Tz n , n and z n v as n → ∞, we have vTv. So F ( T ) .

  2. (b)

    Since z n v as n → ∞, by the lower semicontinuity of f, we obtain

    p ( v , T v ) = f ( v ) liminf m p z n , T z n lim n p z n , z n + 1 = 0 ,

which implies p(v, Tv) = 0. By Lemma 2.2, we get vF ( T ) .

  1. (c)

    Since {z n } is convergent in X, limn →∞d(z n , z n +1) = 0. Since

    d ( v , T v ) = g ( v ) liminf m d ( z n , T z n ) lim n d ( z n , z n + 1 ) = 0 ,

we have d(v,Tv) = 0 and hence vF ( T ) .

  1. (d)

    Since limn →∞sup{p(z n , z m ): m >n} = 0 and limn →∞p(z n , Tv) = 0, there exists {a n } ⊂ {z n } with limn →∞sup{p(a n , a m ): m >n} = 0 and {b n } ⊂ Tv such that limn →∞p(a n , b n ) = 0. By (τ 3), limn →∞d(a n , b n ) = 0. Since a n v as n → ∞ and d(b n ,v) ≤ d(b n ,a n ) + d(a n ,v), it implies b n v as n → ∞. By the closedness of Tv, we have vTv or vF ( T ) .   □

In this paper, we first introduce the concepts of capable maps as follows.

Definition 2.3. Let (X, d) be a metric space and T:XC ( X ) be a multivalued map. We say that T is capable if T satisfies one of the following conditions:

(D1) T is closed;

(D2) the map f: X → [0, ∞) defined by f(x) = p(x, Tx) is l.s.c;

(D3) the map g: X → [0, ∞) defined by g(x) = d(x, Tx) is l.s.c;

(D4) for each sequence {x n } in X with xn +1Tx n , n and limn →∞x n = v, we have limn →∞p(x n , Tv) = 0;

(D5) inf{p(x, z) + p(x,Tx) : xX} > 0 for every zF ( T ) .

Remark 2.2.

  1. (1)

    Let (X, ||⋅||) be a Banach space. If T:XC ( X ) is u.s.c, then T is a capable map since it is closed (for more detail, see [5, 23]).

  2. (2)

    Let (X, d) be a metric space and T:XC ( X ) be u.s.c. Since the function f: X → [0, ∞) defined by f(x) = d(x,Tx) is l.s.c. (see, e.g., [24, Lemma 3.1] and [25, Lemma 2]), T is a capable map.

  3. (3)

    Let (X, d) be a metric space and T:XCB ( X ) be a generalized multivalued (φ, L)-weak contraction [11], that is, there exists an MT-function φ and L0 such that

    H ( T x , T y ) φ ( d ( x , y ) ) d ( x , y ) + L d ( y , T x ) for all x , y X .

Then, T is a capable map. Indeed, let {x n } in X with xn +1Tx n , n and limn →∞x n = v.

Then

lim n d ( x n + 1 , T v ) lim n H ( T x n , T v ) lim n { φ ( d ( x n , v ) ) d ( x n , v ) + L d ( v , x n + 1 ) } = 0 ,

which means that T satisfies (D4).

  1. (4)

    Let (X, d) be a metric space and T: XX is a single-valued map of Kannan's type, then T is a capable map since (D5) holds; for more detail, see [[16], Corollary 3].

3. Fixed point theorems of generalized Chatterjea's type and others

Below, unless otherwise specified, let (X, d) be a complete metric space, p be a τ0-function and D p be a τ0-metric on CB ( X ) induced by p.

In this section, we will establish some fixed point theorems of generalized Chatterjea's type.

Theorem 3.1. Let T:XC ( X ) be a capable map. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that for each xX,

2 p ( y , T y ) φ ( p ( x , y ) ) p ( x , T y ) for all  y T x .
(3.1)

Then F ( T ) .

Proof. Let κ: [0, ∞) → [0,1) be defined by κ ( t ) = 1 + φ ( t ) 2 . Then

0 φ ( t ) < κ ( t ) < 1 for all  t [ 0 , ) .

Let x1X and x2Tx1. If x1 = x2, then x 1 F ( T ) and we are done. Otherwise, if x2x1, by Remark 2.1, we have p(x1,x2) > 0. If x1Tx2, then it follows from (3.1) that

2 p ( x 2 , T x 2 ) φ ( p ( x 1 , x 2 ) ) p ( x 1 , T x 2 ) = 0 ,

which implies p(x2,Tx2) = 0. Since p is a τ0-function and Tx2 is closed in X, by Lemma 2.2, x2Tx2 and x 2 F ( T ) . If x1Tx2, then p(x1,Tx2) > 0 and, by (3.1), there exists x3Tx2 such that

2 p ( x 2 , x 3 ) < κ ( p ( x 1 , x 2 ) ) p ( x 1 , x 3 ) κ ( p ( x 1 , x 2 ) ) [ p ( x 1 , x 2 ) + p ( x 2 , x 3 ) ] .

By induction, we can obtain a sequence {x n } in X satisfying xn +1Tx n , n, p(x n , xn +1) > 0

and

2 p ( x n + 1 , x n + 2 ) < κ ( p ( x n , x n + 1 ) ) [ p ( x n , x n + 1 ) + p ( x n + 1 , x n + 2 ) ]
(3.2)

By (3.2), we get

p ( x n + 1 , x n + 2 ) < κ ( p ( x n , x n + 1 ) ) 2 - κ ( p ( x n , x n + 1 ) ) p ( x n , x n + 1 )
(3.3)

Since 0 <κ(t) < 1 for all t [ 0 , ) , κ ( p ( x n , x n + 1 ) ) 2 - κ ( p ( x n , x n + 1 ) ) ( 0 , 1 ) for all n. So the sequence {p(x n , xn +1)} is strictly decreasing in [0, ∞). Since φ is an MT-function, by applying (g) of Theorem D, we have

0 sup n φ ( p ( x n , x n + 1 ) ) < 1 .

Hence, it follows that

0 < sup n κ ( p ( x n , x n + 1 ) ) = 1 2 1 + sup n φ ( p ( x n , x n + 1 ) ) < 1 .

Let λ:= supnκ(p(x n , xn +1)) and take c:= λ 2 - λ . Then λ, c ∈ (0,1). We claim that {x n } is a Cauchy sequence in X. Indeed, by (3.3), we have

p ( x n + 1 , x n + 2 ) < κ ( p ( x n , x n + 1 ) ) 2 - κ ( p ( x n , x n + 1 ) ) p ( x n , x n + 1 ) c p ( x n , x n + 1 ) .
(3.4)

It implies from (3.4) that

p ( x n + 1 , x n + 2 ) < c p ( x n , x n + 1 ) < < c n p ( x 1 , x 2 ) for each  n .

We have limn →∞sup{p(x n ,x m ): m >n} = 0. Indeed, let α n = c n - 1 1 - c p ( x 1 , x 2 ) , n . For m, n with m >n, we have

p ( x n , x m ) j = n m - 1 p ( x j , x j + 1 ) < α n .
(3.5)

Since c ∈ (0,1), limn →∞αn = 0 and, by (3.5), we get

lim n sup { p ( x n , x m ) : m > n } = 0 .
(3.6)

Applying (c) of Lemma 2.1, {x n } is a Cauchy sequence in X. By the completeness of X, there exists vX such that x n v as n → ∞. From (τ 2) and (3.5), we have

p ( x n , v ) α n for all  n .
(3.7)

Now, we verify that vF ( T ) . Applying Lemma 2.3, we know that vF ( T ) if T satisfies one of the conditions (D1), (D2), (D3) and (D4).

Finally, assume (D5) holds. On the contrary, suppose that vTv. Then, by (3.5) and (3.7), we have

0 < inf x X { p ( x , v ) + p ( x , T x ) } inf n { p ( x n , v ) + p ( x n , T x n ) } inf n { p ( x n , v ) + p ( x n , x n + 1 ) } lim n 2 α n = 0 ,

a contradiction. Therefore vF ( T ) . The proof is completed.   □

Here, we give a simple example illustrating Theorem 3.1.

Example 3.1. Let X = [0,1] with the metric d(x,y) = |x — y| for x,yX. Then, (X,d) is a complete metric space. Let T:XC ( X ) be defined by

T ( x ) = { 0 , 1 } , if  x = 0 , { 1 2 x 3 , 1 } , if  x ( 0 , 1 2 ] , { 0 , 1 2 x 3 } , if  x ( 1 2 , 1 ) , { 1 } , if  x = 1 .

and φ: [0, ∞) → [0,1) be defined by

φ ( t ) = 2 t , if  t [ 0 , 1 2 ) , 0 , if  t [ 1 2 , ) .

Then, φ is an MT-function and F ( T ) = { 0 , 1 } 0.

On the other hand, one can easily see that

d ( x , T x ) = x - 1 2 x 3 , if  x [ 0 , 1 ) , 0 , if  x = 1 .

So f(x): = d(x,Tx) is l.s.c., and hence, T is a capable map. Moreover, it is not hard to verify that for each xX,

2 p ( y , T y ) φ ( p ( x , y ) ) p ( x , T y ) for all  y T x .

Therefore, all the assumptions of Theorem 3.1 are satisfied, and we also show that F ( T ) from Theorem 3.1.

Theorem 3.2. Let T:XC ( X ) be a capable map and φ: [0, ∞) → [0,1) be an MT-function. Let k with k2. Suppose that for each xX

k p ( y , T y ) φ ( p ( x , y ) ) p ( x , T y ) for all  y T x .
(3.9)

Then F ( T ) .

Proof. Since k ≥ 2, (3.9) implies (3.1). Therefore, the conclusion follows from Theorem 3.1.   □

The following result is immediate from the definition of D p and Theorem 3.1.

Theorem 3.3. Let T:XCB ( X ) be a capable map. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that for each xX,

2 D p ( T x , T y ) φ ( p ( x , y ) ) p ( x , T y ) for all  y T x .

Then F ( T ) .

Theorem 3.4. Let T:XCB ( X ) be a capable map. Suppose that there exist two MT-functions φ, τ: [0, ∞) → [0,1) such that

2 D p ( T x , T y ) φ ( p ( x , y ) ) p ( x , T y ) + τ ( p ( x , y ) ) p ( y , T x ) for all  x , y X .

Then F ( T ) .

Proof. For each xX, let yTx be arbitrary. Since p(y,Tx) = 0, we have 2 D p ( T x , T y ) φ ( p ( x , y ) ) p ( x , T y ) . Therefore, the conclusion follows from Theorem 3.3.   □

Theorem 3.5. Let T:XCB ( X ) be a capable map. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that

2 D p ( T x , T y ) φ ( p ( x , y ) ) ( p ( x , T y ) + p ( y , T x ) ) for all  x , y X .
(3.10)

Then F ( T ) .

Proof. Let τ = φ. Then, the conclusion follows from Theorem 3.4.   □

Theorem 3.6. Let T: XX be a selfmap. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that

2 d ( T x , T y ) φ ( d ( x , y ) ) ( d ( x , T y ) + d ( y , T x ) ) for all  x , y X .
(3.11)

Then, T has a unique fixed point in X.

Proof. Let pd. Then, (3.11) and (3.10) are identical. We prove that T is a capable map. In fact, it suffices to show that (D5) holds. Assume that there exists wX with wTw and inf {d(x,w) + d(x,Tx): xX} = 0. Then, there exists a sequence {x n } in X such that limn →∞(d(x n , w) + d(x n ,Tx n )) = 0. It follows that d(x n ,w) → 0 and d(x n ,Tx n ) → 0 and hence d(w,Tx n ) → 0 or Tx n w as n → ∞. By hypothesis, we have

2 d ( T x n , T w ) φ ( d ( x n , w ) ) ( ( d ( x n , T w ) + d ( w , T x n ) )
(3.12)

for all n. Letting n → ∞ in (3.12), since φ is an MT-function and d(x n ,w) → 0, we have d(w,Tw) <d(w,Tw), which is a contradiction. So (D5) holds and hence T is a capable map. Applying Theorem 3.5, F ( T ) . Suppose that there exists u,vF ( T ) with uv. Then, by (3.11), we have

2 d ( u , v ) = 2 d ( T u , T v ) φ ( d ( u , v ) ) ( ( d ( u , T v ) + d ( v , T u ) ) < 2 d ( u , v ) ,

a contradiction. Hence, F ( T ) is a singleton set.   □

Applying Theorem 3.6, we obtain the following primitive Chatterjea's fixed point theorem [3].

Corollary 3.1. [3] Let T: XX be a selfmap. Suppose that there exists γ [ 0 , 1 2 ) such that

d ( T x , T y ) γ ( d ( x , T y ) + d ( y , T x ) ) for all  x , y X .
(3.13)

Then, T has a unique fixed point in X.

Proof. Define φ: [0, ∞) → [0,1) by φ(t) = 2γ. Then, φ is an MT-function. So (3.13) implies (3.11), and the conclusion is immediate from Theorem 3.6.   □

Corollary 3.2. Let T:XCB ( X ) be a capable map. Suppose that there exist α,β [ 0 , 1 2 ) such that

D p ( T x , T y ) α p ( x , T y ) + β p ( y , T x )  for all  x , y X .
(3.14)

Then F ( T ) .

Proof. Let φ, τ: [0, ∞) → [0,1) be defined by φ(t) = 2α and τ(t) = 2β for all t ∈ [0, ∞). Then, φ and τ are MT-functions, and the conclusion follows from Theorem 3.4.   □

The following conclusion is immediate from Corollary 3.2 with α = β = γ.

Corollary 3.3. Let T:XCB ( X ) be a capable map. Suppose that there exists γ [ 0 , 1 2 ) such that

D p ( T x , T y ) γ ( p ( x , T y ) + p ( y , T x ) ) for all  x , y X .
(3.15)

Then F ( T ) .

Remark 3.1.

  1. (a)

    Corollary 3.2 and Corollary 3.3 are equivalent. Indeed, it suffices to prove that Corollary 3.2 implies Corollary 3.3. Suppose all assumptions of Corollary 3.2 are satisfied. Let γ:= max {α, β}. Then γ [ 0 , 1 2 ) and (3.14) implies (3.15), and the conclusion of Corollary 3.3 follows from Corollary 3.2.

  2. (b)

    Theorems 3.1-3.4 and Corollaries 3.1 and 3.2 all generalize and improve [5, Theorem 3.4] and the primitive Chatterjea's fixed point theorem [3].

4. Fixed point theorems of generalized Kannan's type and others

The following result is given essentially in [5, Theorem 2.1].

Theorem 4.1. Let T:XCB ( X ) be a capable map. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that for each xX,

p ( y , T y ) φ ( p ( x , y ) ) p ( x , y )  for all  y T x .
(4.1)

Then F ( T ) .

Applying Theorem 4.1, we establish the following new fixed point theorem.

Theorem 4.2. Let T:XCB ( X ) be a capable map. Suppose that there exist two MT-functions φ, τ: [0, ∞) → [0,1) such that for each xX,

2 D p ( T x , T y ) φ ( p ( x , y ) ) p ( x , T x ) + τ ( p ( x , y ) ) p ( y , T y )  for all  y T x ,
(4.2)

Then F ( T ) .

Proof. Notice that for each xX, if yTx, then (4.2) implies

2 p ( y , T y ) 2 D p ( T x , T y ) φ ( p ( x , y ) ) p ( x , T x ) + τ ( p ( x , y ) ) p ( y , T y )

and hence

p ( y , T y ) φ ( p ( x , y ) ) 2 - τ ( p ( x , y ) ) p ( x , T x ) φ ( p ( x , y ) ) p ( x , y ) .

Applying Theorem 4.1, we can get the thesis.   □

The following conclusion is immediate from Theorem 4.2.

Theorem 4.3. Let T:XCB ( X ) be a capable map. Suppose that there exist two MT-functions φ, τ: [0, ∞) → [0,1) such that

2 D p ( T x , T y ) φ ( p ( x , y ) ) p ( x , T x ) + τ ( p ( x , y ) ) p ( y , T y ) for all  x , y X .

Then F ( T ) .

Theorem 4.4. Let T:XCB ( X ) be a capable map. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that for each xX,

2 D p ( T x , T y ) φ ( p ( x , y ) ) ( p ( x , T x ) + p ( y , T y ) ) for all  y T x .

Then F ( T ) .

Theorem 4.5. Let T:XCB ( X ) be a capable map. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that

2 D p ( T x , T y ) φ ( p ( x , y ) ) ( p ( x , T x ) + p ( y , T y ) ) for all  x , y X .
(4.3)

Then F ( T ) .

Theorem 4.6. Let T: XX be a selfmap. Suppose that there exists an MT-function φ: [0, ∞) → [0,1) such that

2 d ( T x , T y ) φ ( d ( x , y ) ) ( d ( x , T x ) + d ( y , T y ) ) for all  x , y X .
(4.4)

Then, T has a unique fixed point in X.

Proof. Let p ≡ d. Then, (4.3) and (4.4) are identical. We prove that T is a capable map. In fact, it suffices to show that (D5) holds. Assume that there exists w ∈ X with wTw and inf {d(x, w) + d(x,Tx): xX} = 0. Then, there exists a sequence {x n } in X such that limn→∞ (d(x n , w) + d(x n ,Tx n )) = 0. It follows that d(x n ,w) → 0 and d(x n ,Tx n ) → 0 and hence d(w,Tx n ) → 0 or Tx n w as n → ∞. By hypothesis, we have

2 d ( T x n , T w ) φ ( d ( x n , w ) ) ( ( d ( x n , T x n ) + d ( w , T w ) )
(4.5)

for all n. Since d(x n ,w) → 0 as n → ∞ and φ is an MT-function, limn →∞φ(d(x n ,w)) < 1. Letting n → ∞ in (4.5), since Tx n w and d(x n ,Tx n ) → 0 as n → ∞, we have 2d(w,Tw) <d(w, Tw), which is a contradiction. So (D5) holds and hence T is a capable map. Applying Theorem 4.5, F ( T ) . Suppose that there exists u,vF ( T ) with uv. Then, by (4.4), we have

0 < 2 d ( u , v ) = 2 d ( T u , T v ) φ ( d ( u , v ) ) ( ( d ( u , T u ) + d ( v , T v ) ) = 0 ,

a contradiction. Hence, F ( T ) is a singleton set.   □

Applying Theorem 4.6, we obtain the primitive Kannan's fixed point theorem [2].

Corollary 4.1. Let T: XX be a selfmap. Suppose that there exists γ [ 0 , 1 2 ) such that

d ( T x , T y ) γ ( d ( x , T x ) + d ( y , T y ) ) for all  x , y X .

Then F ( T ) .

Corollary 4.2. Let T: XX be a selfmap. Suppose that there exist α,β [ 0 , 1 2 ) such that

d ( T x , T y ) α d ( x , T x ) + β d ( y , T y )  for all  x , y X .

Then F ( T ) .

Remark 4.1. Corollary 4.1 and Corollary 4.2 are indeed equivalent.

Corollary 4.3. Let T:XCB ( X ) be a capable map. Suppose that there exist α,β [ 0 , 1 2 ) such that

D p ( T x , T y ) α p ( x , T x ) + β p ( y , T y ) for all  x , y X .

Then F ( T ) .

Corollary 4.4. Let T:XCB ( X ) be a capable map. Suppose that there exists γ [ 0 , 1 2 ) such that

D p ( T x , T y ) γ ( p ( x , T x ) + p ( y , T y ) ) for all  x , y X .

Then F ( T ) .

Remark 4.2.

  1. (a)

    Corollary 4.3 and Corollary 4.4 are indeed equivalent.

  2. (b)

    Theorems 4.1-4.6 and Corollaries 4.1-4.4 all generalize and improve [5, Theorem 2.6] and the primitive Kannan's fixed point theorem [2].