Skip to main content

Coincidence and common fixed point theorems for Suzuki type hybrid contractions and applications

Abstract

Coincidence and common fixed point theorems for a class of Suzuki hybrid contractions involving two pairs of single-valued and multivalued maps in a metric space are obtained. In addition, the existence of a common solution for a certain class of functional equations arising in a dynamic programming is also discussed.

MSC:47H10, 54H25.

1 Introduction

Consistent with [1] (see also [2]), Y denotes an arbitrary nonempty set, (X,d) a metric space and CL(X) (resp. CB(X)), the collection of all nonempty closed (resp. closed bounded) subsets of X. The hyperspace (CL(X),H) (resp. (CB(X),H)) is called the generalized Hausdorff (resp. the Hausdorff) metric space induced by the metric d on X.

For nonempty subsets A, B of X, d(A,B) denotes the gap between the subsets A and B, while

ρ ( A , B ) = sup { d ( a , b ) : a A , b B } , B N ( X ) = { A : A X  and the diameter of  A  is finite } .

As usual, we write d(x,B) (resp. ρ(x,B)) for d(A,B) (resp. ρ(A,B)) when A={x}.

For the sake of brevity, we choose the following notations, wherein S, T, f, and g are maps to be defined specifically in a particular context, while x and y are elements of some specific domain:

M ( S , T ; f x , g y ) = max { d ( f x , g y ) , d ( f x , S x ) , d ( g y , T y ) , d ( S x , g y ) + d ( T y , f x ) 2 } ; M ( S x , T y ) = max { d ( x , y ) , d ( x , S x ) , d ( y , T y ) , d ( S x , y ) + d ( T y , x ) 2 } .

Let CB(X) denote the class of all nonempty closed bounded subsets of X.

A map T:XCB(X) is called a Nadler multivalued contraction if there exists k[0,1) such that, for every x,yX, H(Tx,Ty)kd(x,y).

The classical multivalued contraction theorem due to Nadler [1] states that Nadler multivalued contraction on a complete metric space X has a fixed point in X, that is, there exists zX such that zTz. For a detailed discussion of this theorem on generalized Hausdorff metric spaces and applications, one may refer to [313], and [14].

Nadler’s multivalued contraction theorem [1] has led to a rich fixed point theory for multivalued maps in nonlinear analysis (see, for instance [6, 912, 1522], and [13, 14, 23, 24]). It has various applications in mathematical sciences (see, for instance, [2, 5, 79], and [25]).

The following important result involving two pairs of hybrid maps on an arbitrary nonempty set with values in a metric space is due to Singh and Mishra [12] (see also [21]).

Theorem 1.1 Let S,T:YCL(X) and f,g:YX be such that S(Y)g(Y) and T(Y)f(Y) and one of S(Y), T(Y), f(Y) or g(Y) is a complete subspace of X. Assume there exists r[0,1) such that, for every x,yY,

H(Sx,Ty)rM(S,T;fx,gy).

Then

  1. (i)

    S and f have a coincidence point v in Y;

  2. (ii)

    T and g have a coincidence point w in Y.

Further, if Y=X, then

  1. (iii)

    S and f have a common fixed point v provided that fv is a fixed point of f, and f and S commute at v;

  2. (iv)

    T and g have a common fixed point w provided that gw is a fixed point of g, and g and T commute at w;

  3. (v)

    S, T, f, and g have a common fixed point provided that (iii) and (iv) both are true.

The following result due to Kikkawa and Suzuki [26] (see also [13, 14]) generalizes Nadler’s multivalued contraction theorem.

Theorem 1.2 Let X be a complete metric space and T:XCB(X). Assume there exists r[0,1) such that, for every x,yX,

d(x,Tx)(1+r)d(x,y)
(1.1)

implies

H(Tx,Ty)rd(x,y).
(1.2)

Then T has a fixed point in X.

Subsequently, some interesting extensions and generalizations of Theorem 1.2 have recently been obtained among others by Abbas et al. [27], Dhompongsa and Yingtaweesittikul [18], Doric̀ and Lazovic̀ [28], Kamal et al. [29], Moţ and Petruşel [19], Singh and Mishra [13, 14] and Singh et al. [10, 30], and [23].

The importance of Suzuki contraction theorem [[24], Theorem 2], Theorem 1.2 and subsequently obtained coincidence and fixed point theorems (cf. [13, 14, 18, 19, 23, 2628], and others) for maps in metric spaces satisfying Suzuki type contractive conditions is that the contractive conditions are required to be satisfied not for all points of the domain. For example, the condition (1.1) of Theorem 1.2 puts some restrictions on the domain of the map T.

In all that follows, we take a nonincreasing function φ from [0,1) onto (0,1] defined by

φ(r)={ 1 if  0 r < 1 2 , 1 r if  1 2 r < 1 .

Recently, Singh et al. [10] obtained the following coincidence and common fixed point theorem which generalizes a result of Doric̀ and Lazovic̀ [28] and some other results from [3, 26], and [21].

Theorem 1.3 Let S,T:YCL(X) and f:YX be such that S(Y)f(Y) and T(Y)f(Y). Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { d ( f x , S x ) , d ( f y , T y ) } d(fx,fy)

implies

H(Sx,Ty)rM(Sx,Ty;fx,fy).

If one of S(Y), T(Y) or f(Y) is a complete subspace of X, then there exists a point zY such that fzSzTz.

Further, if Y=X, and fz is a fixed point of f, then fz is common fixed point of S and T provided that f is IT (Itoh-Takahashi)-commuting [13]with S and T at z.

Now a natural question arises whether Theorem 1.1 can further be generalized. In this paper, we answer this question affirmatively under tight minimal conditions. Our main result (Theorem 2.2) also presents an extension of Theorem 1.3 for a quadruplet of maps. Some recent results are discussed as special cases. Further, using two corollaries of the main result (Theorem 2.2), we obtain other common fixed point theorems for multivalued and single-valued maps on metric spaces. We also deduce the existence of common solution for a certain class of functional equations arising in dynamic programming. Examples are given to justify applications.

2 Main results

The following definition is due to Itoh and Takahashi [31] (see also [13]).

Definition 2.1 Let T:XCL(X) and f:XX. Then the hybrid pair (T,f) is IT-commuting at zX if fTzTfz.

Evidently a pair of commuting multivalued map T:XCL(X) and a single-valued map f:XX are IT-commuting but the reverse implication is not true [[32], p.2]. However, a pair of single-valued maps f,g:XX are IT-commuting (also called weakly compatible by Jungck and Rhoades [33]) at xX if fgx=gfx when fx=gx.

We shall need the following lemma, essentially due to Nadler [1] (see also [3], [[2], p.61], [[9], p.76].

Lemma 2.1 If A,BCL(X) and aA, then for each ε>0, there exists bB such that d(a,b)H(A,B)+ε.

Let C(S,f) denote the collection of all coincidence points of S and f, that is, C(S,f)={zY:fzSz} when S:YCL(X) and f:YX; and C(S,f)={zY:fz=Sz} when S,f:YX. The following is the main result of this section.

Theorem 2.2 Let S,T:YCL(X) and f,g:YX be such that S(Y)g(Y) and T(Y)f(Y). Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { d ( f x , S x ) , d ( g y , T y ) } d(fx,gy)

implies

H(Sx,Ty)rM(S,T;fx,gy).

If one of S(Y), T(Y), f(Y) or g(Y) is a complete subspace of X, then

  1. (I)

    C(S,f) is nonempty, i.e. there exists a point zY such that fzSz;

  2. (II)

    C(T,g) is nonempty, i.e. there exists a point z 1 Y such that g z 1 T z 1 .

Furthermore, if Y=X, then

  1. (III)

    S and f have a common fixed point provided that the maps S and f are IT-commuting just at coincidence point z and fz is fixed point of f;

  2. (IV)

    T and g have a common fixed point provided that the maps T and g are IT-commuting just at coincidence point z 1 and g z 1 is fixed point of g;

  3. (V)

    S, T, f, and g have a common fixed point provided that both (III) and (IV) are true.

Proof Without loss of generality, we may take r>0 and f, g non-constant maps.

Let ε>0 be such that β=r+ε<1. We construct two sequences { x n } and { y n } in Y as follows.

Let x 0 Y and y 0 =g x 1 S x 0 . By Lemma 2.1, there exists y 1 =f x 2 T x 1 such that

d(f x 2 ,g x 1 )H(S x 0 ,T x 1 )+εM(S,T;f x 0 ,g x 1 ).

Similarly, there exists y 2 =g x 3 S x 2 such that

d(f x 2 ,g x 3 )H(S x 2 ,T x 1 )+εM(S,T;f x 2 ,g x 1 ).

Continuing in this manner, we find a sequence { y n } in Y such that

y 2 n =g x 2 n + 1 S x 2 n , y 2 n + 1 =f x 2 n + 2 T x 2 n + 1

and

d ( f x 2 n , g x 2 n + 1 ) H ( S x 2 n , T x 2 n 1 ) + ε M ( S , T ; f x 2 n , g x 2 n 1 ) , d ( f x 2 n + 2 , g x 2 n + 1 ) H ( S x 2 n , T x 2 n + 1 ) + ε M ( S , T ; f x 2 n , g x 2 n + 1 ) .

Now, we show that, for any nN,

d( y 2 n , y 2 n 1 )βd( y 2 n 1 , y 2 n 2 ).
(2.1)

Suppose if d(g x 2 n 1 ,T x 2 n 1 )d(f x 2 n ,S x 2 n ), then

φ(r)min { d ( f x 2 n , S x 2 n ) , d ( g x 2 n 1 , T x 2 n 1 ) } d(f x 2 n ,g x 2 n 1 ).

Therefore by the assumption,

d ( f x 2 n , g x 2 n + 1 ) H ( S x 2 n , T x 2 n 1 ) + ε M ( S , T ; f x 2 n , g x 2 n 1 ) r M ( S , T ; f x 2 n , g x 2 n 1 ) + ε M ( S , T ; f x 2 n , g x 2 n 1 ) = β M ( S , T ; f x 2 n , g x 2 n 1 ) = β max { d ( f x 2 n , g x 2 n 1 ) , d ( f x 2 n , S x 2 n ) , d ( g x 2 n 1 , T x 2 n 1 ) , d ( g x 2 n 1 , S x 2 n ) + d ( f x 2 n , T x 2 n 1 ) 2 } .

This yields (2.1). Suppose if d(f x 2 n ,S x 2 n )d(g x 2 n 1 ,T x 2 n 1 ), then

φ(r)min { d ( f x 2 n , S x 2 n ) , d ( g x 2 n 1 , T x 2 n 1 ) } d(f x 2 n ,g x 2 n 1 ).

Therefore by the assumption,

d ( f x 2 n , g x 2 n + 1 ) H ( S x 2 n , T x 2 n 1 ) + ε M ( S , T ; f x 2 n , g x 2 n 1 ) r M ( S , T ; f x 2 n , g x 2 n 1 ) + ε M ( S , T ; f x 2 n , g x 2 n 1 ) = β M ( S , T ; f x 2 n , g x 2 n 1 ) = β max { d ( f x 2 n , g x 2 n 1 ) , d ( f x 2 n , S x 2 n ) , d ( g x 2 n 1 , T x 2 n 1 ) , d ( g x 2 n 1 , S x 2 n ) + d ( f x 2 n , T x 2 n 1 ) 2 } β max { d ( f x 2 n , g x 2 n 1 ) , d ( f x 2 n , g x 2 n + 1 ) } ,

yielding (2.1). So, in both cases we obtain (2.1). In an analogous manner, we show that

d( y 2 n + 1 , y 2 n )βd( y 2 n , y 2 n 1 ).
(2.2)

We conclude from (2.1) and (2.2) that, for any nN,

d( y n + 1 , y n )βd( y n , y n 1 ).

Therefore the sequence { y n } is Cauchy. Assume that the subspace g(Y) is complete. Notice that the sequence { y 2 n } is contained in g(Y) and has a limit in g(Y). Call it u. Let z f 1 u. Then zY and fz=u. The subsequence { y 2 n + 1 } also converges to u. Let z 1 g 1 u. Then

g z 1 =u.
(2.3)

Now we show that, for any gyX{fz},

d(u,Ty)rmax { d ( u , g y ) , d ( g y , T y ) } ,
(2.4)

and for any fyX{gz},

d(u,Sy)rmax { d ( u , f y ) , d ( f y , S y ) } .
(2.5)

Since f x 2 n fz, there exists n 0 N (natural numbers) such that

d(f x 2 n ,fz) 1 3 d(fz,gy)qfor gyfz and all n n 0 .

Also g x 2 n + 1 fz, there exists n 1 N such that

d(g x 2 n + 1 ,fz) 1 3 d(fz,gy)for gyfz and all n n 1 .

Then as in [[24], p.1862] (see also [28]),

φ ( r ) d ( f x 2 n , S x 2 n ) d ( f x 2 n , S x 2 n ) d ( f x 2 n , g x 2 n + 1 ) 2 3 d ( f z , g y ) = d ( f z , g y ) 1 3 d ( f z , g y ) d ( f z , g y ) d ( f x 2 n , f z ) d ( f x 2 n , g y ) .

Therefore

φ(r)d(f x 2 n ,S x 2 n )d(f x 2 n ,gy).
(2.6)

Now, either d(f x 2 n ,S x 2 n )d(gy,Ty) or d(gy,Ty)d(f x 2 n ,S x 2 n ).

In either case, by (2.6) and the assumption,

d ( f x 2 n + 1 , T y ) H ( S x 2 n , T y ) r M ( S , T ; f x 2 n , g y ) r max { d ( f x 2 n , g y ) , d ( f x 2 n , S x 2 n ) , d ( g y , T y ) , d ( f x 2 n , T y ) + d ( g y , S x 2 n ) 2 } .

Making n,

d ( u , T y ) r max { d ( u , g y ) , d ( u , u ) , d ( g y , T y ) , d ( u , T y ) + d ( u , g y ) 2 } , r max { d ( u , g y ) , d ( g y , T y ) , d ( u , T y ) + d ( u , g y ) 2 } ,

that is, d(u,Ty)rmax{d(u,gy),d(gy,Ty)}.

This yields (2.4), that is,

d(fz,Ty)rmax { d ( f z , g y ) , d ( g y , T y ) } .

Analogously, we can prove (2.5), that is,

d(g z 1 ,Sy)rmax { d ( g z 1 , f y ) , d ( f y , S y ) } .

Now, we show that C(S,f) is nonempty.

First we consider the case 0r< 1 2 .

Suppose fzSz. Then as in [[18], p.6], let gaSz be such that 2rd(ga,fz)<d(Sz,fz).

Since gaSz implies gafz, we have from (2.4) and (2.5),

d(fz,Ta)rmax { d ( f z , g a ) , d ( g a , T a ) } .
(2.7)

On the other hand, since φ(r)d(fz,Sz)d(fz,Sz)d(fz,ga),

φ(r)min { d ( f z , S z ) , d ( g a , T a ) } d(fz,ga).

Therefore, by the given assumption,

d ( g a , T a ) H ( S z , T a ) r max { d ( f z , g a ) , d ( f z , S z ) , d ( g a , T a ) , d ( f z , T a ) + d ( g a , S z ) 2 } = r max { d ( f z , g a ) , d ( g a , T a ) } .

This gives d(ga,Ta)H(Sz,Ta)rd(fz,ga)<d(fz,ga).

So by (2.7), d(fz,Ta)rd(fz,ga).

Therefore,

d ( f z , S z ) d ( f z , T a ) + H ( S z , T a ) r d ( f z , g a ) + r d ( f z , g a ) = 2 r d ( f z , g a ) < d ( f z , S z ) .

This contradicts fzSz. Consequently fzSz, and C(S,f) is nonempty.

In an analogous manner, we can prove in the case 0r< 1 2 that C(T,g) is nonempty.

Now we consider the case 1 2 r<1.

We first show that

H(Sz,Ty)rmax { d ( f z , g y ) , d ( f z , S z ) , d ( g y , T y ) , d ( g y , S z ) + d ( f z , T y ) 2 } .

Assume that fzgy. Then for every nN, there exists z n Ty such that

d(fz, z n )d(fz,Ty)+ 1 n d(fz,gy).

Therefore

d ( g y , T y ) d ( g y , z n ) d ( g y , f z ) + d ( f z , z n ) d ( g y , f z ) + d ( f z , T y ) + 1 n d ( f z , g y ) .
(2.8)

So, using (2.5), the inequality (2.8) implies

d(gy,Ty)d(fz,gy)+rmax { d ( f z , g y ) , d ( g y , T y ) } + 1 n d(fz,gy).
(2.9)

If d(fz,gy)d(gy,Ty), then (2.9) gives

d ( g y , T y ) d ( f z , g y ) + r d ( f z , g y ) + 1 n d ( f z , g y ) = ( 1 + r + 1 n ) d ( f z , g y ) .

Making n,

d(gy,Ty)(1+r)d(fz,gy).

Thus

φ(r)d(gy,Ty)=(1r)d(gy,Ty) ( 1 1 + r ) d(gy,Ty)d(fz,gy).

Then

φ(r)min { d ( f z , S z ) , d ( g y , T y ) } d(fz,gy),

and by the assumption,

H(Sz,Ty)rmax { d ( f z , g y ) , d ( f z , S z ) , d ( g y , T y ) , d ( g y , S z ) + d ( f z , T y ) 2 } .
(2.10)

If d(fz,gy)<d(gy,Ty), then (2.9) gives

d(gy,Ty)d(fz,gy)+rd(gy,Ty)+ 1 n d(fz,gy),

that is, (1r)d(gy,Ty)(1+ 1 n )d(fz,gy).

Making n,

φ(r)d(gy,Ty)d(fz,gy).

Then φ(r)min{d(fz,Sz),d(gy,Ty)}d(fz,gy), and by the assumption, we get (2.10).

Now taking y= u 2 n + 1 in (2.10) and passing to the limit, we obtain d(fz,Sz)rd(fz,Sz).

This gives fzSz, that is, z is a coincidence point of f and S. Analogously, fzTz. Thus (I) and (II) are completely proved.

Further, if Y=X, and fz is a fixed point of f, and S and f are IT-commuting at z, then fSzSfz. Therefore, fzSz implies ffzfSzSfz, so fzSfz. This proves that u=fz is a common fixed point of f and S. Therefore (2.3) implies that u is a common fixed point of f and S. This proves (III). Analogously, T and g have a common fixed point g z 1 . Therefore (2.3) implies that u is a common fixed point of T and g. This proves (IV). Now (V) is immediate. □

Remark 2.1 In Theorem 2.2, the hypothesis ‘fz is a fixed point of f’ is essential for the existence of a common fixed point of S and f (see [22, 34] and the following example). Similarly, the hypothesis ‘g z 1 is a fixed point of g’ is essential for the existence of a common fixed point of T and g.

Example 2.3 Let X= R + (nonnegative reals) be endowed with the usual metric. Define for xX, fx=2 x 2 , gx=2 x 3 , Sx=[ 1 4 , x 2 + 1 4 ] and Tx=[ 1 4 , x 3 + 1 4 ]. Then S(X)=T(X)=[ 1 4 ,)X=f(X)=g(X), and all other hypotheses of Theorem 2.2 with Y=X= R + are satisfied for r= 1 2 =φ(r). Notice that g z 1 =T z 1 = 1 2 , where z 1 = 4 1 / 3 . Thus g and T have a coincidence at z 1 , but g z 1 = 1 2 is not a fixed point of g and hence not a common fixed point of g and T. Note that z= 1 2 is a coincidence point of f and S, and Sf(z)=[ 1 8 , 1 2 ][ 1 4 , 1 2 ]=fS(z), that is, f and S are IT-commuting at z. Evidently, z=f(z) is a common fixed point of f and S.

The following result due to Singh et al. [35] extends and generalizes certain results of [10, 12, 26] and others.

Corollary 2.4 Let S:YCL(X) and f,g:YX be such that S(Y)f(Y)g(Y). Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { d ( f x , S x ) , d ( g y , S y ) } d(fx,gy)

implies

H(Sx,Sy)rM(S;fx,gy).

If one of S(Y), f(Y) or g(Y) is a complete subspace of X, then

  1. (I)

    C(S,f) is nonempty, i.e. there exists a point zY such that fzSz;

  2. (II)

    C(S,g) is nonempty, i.e. there exists a point z 1 Y such that g z 1 S z 1 .

Furthermore, if Y=X, then

  1. (III)

    S and f have a common fixed point provided that the maps S and f are IT-commuting just at coincidence point z and fz is fixed point of f;

  2. (IV)

    S and g have a common fixed point provided that the maps S and g are IT-commuting just at coincidence point z 1 and g z 1 is fixed point of g;

  3. (V)

    S, f, and g have a common fixed point provided that both (III) and (IV) are true.

Proof It follows from Theorem 2.2 when T=S. □

We remark that in general the coincidence points z and z 1 guaranteed by Theorem 2.2 or Corollary 2.4 may be different. However, if we take f=g in Theorem 2.2, the maps S, T, and f have a common coincidence point. So we have a slightly sharp result.

Corollary 2.5 Theorem  1.3.

Proof It follows from Theorem 2.2 when g=f. □

The following result extends and generalizes certain results of [28, 36] and others.

Corollary 2.6 [23]

Let X be a complete metric space and S,T:XCL(X). Assume there exists r[0,1) such that, for every x,yX,

φ(r)min { d ( x , S x ) , d ( y , T y ) } d(x,y)impliesH(Sx,Ty)rM(Sx,Ty).

Then there exists an element zX such that zSzTz.

Proof It follows from Theorem 2.2 when Y=X and f and g are the identity maps on Y=X. □

The following result due to Doric̀ and Lazovic̀ [28] generalizes many fixed point theorems from [13, 26] and [37].

Corollary 2.7 Let X be a complete metric space and S:XCL(X). Assume there exists r[0,1) such that, for every x,yX,

φ(r)d(x,Sx)d(x,y)impliesH(Sx,Sy)rM(Sx,Sy).

Then there exists an element zX such that zSz.

Proof It follows from Theorem 2.2 when Y=X, T=S, and f, g are the identity maps on X. □

The following result extends a common fixed point theorem of [[10], Theorem 2.8].

Corollary 2.8 Let f,g,P,Q:YX be such that P(Y)g(Y), Q(Y)f(Y), and one of P(Y) or Q(Y) or f(Y) or g(Y) is complete subspace of X. Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { d ( f x , P x ) , d ( g y , Q y ) } d(fx,gy)

implies

d(Px,Qy)rM(P,Q;fx,gy).

Then C(P,f) and C(Q,g) are nonempty. Further, if Y=X, and if f, g, P, and Q are commuting at a common coincidence point, then f, g, P, and Q have a unique common fixed point, that is, there exists a unique point zX such that fz=gz=Pz=Qz=z.

Proof Set Sx={Px} and Tx={Qx} for every xY. Then it easily comes from Theorem 2.2 that C(P,f) and C(Q,g) are nonempty. Furthermore, if Y=X and f and g commute, respectively, with P and Q at z, then ffz=fPz=Pfz, ffz=fQz=Qfz, ggz=gPz=Pgz, and ggz=gQz=Qgz.

Also φ(r)min{d(fz,Pz),d(ffz,Qfz)}=0d(fz,ffz), and this implies

d ( P z , Q f z ) r max { d ( f z , f f z ) , d ( f z , P z ) , d ( f f z , Q f z ) , d ( f z , Q f z ) + d ( f f z , P z ) 2 } = r d ( P z , Q f z ) .

This says that fz is fixed point of f and P. Analogously gz is fixed point of g and Q. The uniqueness of the common fixed point follows easily. □

The following result extends and generalizes coincidence and common fixed point theorems of Goebel [38], Jungck [39], Fisher [40], and others.

Corollary 2.9 [35]

Let f,g,P:YX be such that P(Y)f(Y)g(Y). Let P(Y) or f(Y) or g(Y) be a complete subspace of X. Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { d ( f x , P x ) , d ( g y , P y ) } d(fx,gy)

implies

d(Px,Py)rM(P;fx,gy).

Then C(P,f) and C(P,g) are nonempty. Further, if Y=X and if P commutes with f and g at a common coincidence point, then f, g, and P have a unique common fixed point, that is, there exists a unique point zX such that fz=gz=Pz=z.

Proof It follows from Corollary 2.8 when Q=P. □

Corollary 2.10 Let (X,d) be a complete metric space and f,g:XX be onto maps. Assume there exists r[0,1) such that, for every x,yX,

φ(r)min { d ( x , f x ) , d ( y , g y ) } d(fx,gy)impliesd(x,y)r M 1 (fx,gy).

Then f and g have a unique common fixed point.

Proof It follows from Corollary 2.8 when Y=X and P, Q both are the identity maps on X. □

Corollary 2.11 Let (X,d) be a complete metric space and f:XX be an onto map. Assume there exists r[0,1) such that, for every x,yX,

φ(r)d(x,fx)d(fx,fy)impliesd(x,y)rM(fx,fy).

Then f has a unique fixed point.

Proof It follows from Corollary 2.10 when f=g. □

The following example shows that Theorem 2.2 is indeed more general than Theorem 1.1.

Example 2.12 Consider a metric space X={(0,0),(0,1),(1,0),(1,2),(2,1)}, where d is defined by

d [ ( x 1 , x 2 ) , ( y 1 , y 2 ) ] =| x 1 y 1 |+| x 2 y 2 |.

Let S, T, f and g:XX be such that

S ( x 1 , x 2 ) = { ( 0 , 0 ) if  ( x 1 , x 2 ) ( 1 , 2 ) , ( 2 , 1 ) , ( 1 , 0 ) if  ( x 1 , x 2 ) = ( 1 , 2 ) , ( 0 , 1 ) if  ( x 1 , x 2 ) = ( 2 , 1 ) , T ( x 1 , x 2 ) = { ( 0 , 0 ) if  ( x 1 , x 2 ) ( 1 , 2 ) , ( 2 , 1 ) , ( 0 , 1 ) if  ( x 1 , x 2 ) = ( 1 , 2 ) , ( 1 , 0 ) if  ( x 1 , x 2 ) = ( 2 , 1 ) , f ( x 1 , x 2 ) = { ( x 2 , x 1 ) if  ( x 1 , x 2 ) ( 1 , 2 ) , ( 2 , 1 ) , ( x 1 , x 2 ) if  ( x 1 , x 2 ) = ( 1 , 2 ) , ( 2 , 1 )

and

g( x 1 , x 2 )=( x 1 , x 2 )for all ( x 1 , x 2 )X.

Then S, T, f, and g do not satisfy the assumption in Theorem 1.1 at x=(1,2), y=(1,2) or at x=(2,1), y=(2,1). However,

d(Sx,Ty) 1 2 max { d ( f x , g y ) , d ( f x , S x ) , d ( g y , T y ) , d ( S x , g y ) + d ( T y , f x ) 2 }

if (x,y)((1,2),(1,2)) and (x,y)((2,1),(2,1)).

Since at (x,y)=((1,2),(1,2)), φ(r)min{d(fx,Sx),d(gy,Ty)}=φ(r)min{d(f(1,2),S(1,2)),d(g(1,2),T(1,2))}=φ(r)min{2,2}=2φ(r).

Here we note that the value of r is 1/2, so by definition, φ(r)=1/2, so φ(r)min{d(fx,Sx),d(gy,Ty)}=1>0=d(fx,gy).

Thus S, T, f, and g satisfy the assumption of Theorem 2.2 (and also Corollary 2.8).

In the following example, we show that two multivalued maps and two single-valued maps satisfy all the hypotheses of Theorem 2.2 to ensure common coincidence points of pairwise maps.

Example 2.13 Let Y={a,b,c,d} and X={2,3,4,5,7}. Let d be the usual metric on X, and S, T, f, and g be defined on Y with values in X as

S ( x ) = { { 2 , 3 , 4 } if  x = a , b , c , { 2 } if  x = d , T ( x ) = { { 2 , 3 , 4 } if  x = a , b , c , { 3 } if  x = d , f ( x ) = { 4 if  x = a , 2 if  x = b , 3 if  x = c , 7 if  x = d

and

g(x)={ 2 if  x = a , 4 if  x = b , 3 if  x = c , 5 if  x = d .

Notice that S(Y)g(Y) and T(Y)f(Y). Further, all other conditions of Theorem 2.2 are readily verified with r=2/3 and φ(r)=1/3. Evidently, faSa, fbSb, fcSc, and gaTa, gbTb, gcTc. Moreover, C(f,S)=C(g,T)={b,c,d}.

Now we give an application of Corollary 2.8.

Theorem 2.14 Let S,T:YBN(X) and f,g:YX be such that S(Y)g(Y), T(Y)f(Y), and let one of S(Y), T(Y), f(Y) or g(Y) be a complete subspace of X. Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { ρ ( f x , S x ) , ρ ( g y , T y ) } d(fx,gy)
(2.11)

implies

ρ(Sx,Ty)rmax { d ( f x , g y ) , ρ ( f x , S x ) , ρ ( g y , T y ) , d ( f x , T y ) + d ( g y , S x ) 2 } .
(2.12)

Then C(S,f) and C(T,g) are nonempty.

Proof Choose λ(0,1). Define single-valued maps h 1 , h 2 :XX as follows. For each xX, let h 1 x be a point of Sx which satisfies

d(fx, h 1 x) r λ ρ(fx,Sx).

Similarly, for each yX, let h 2 y be a point of Ty such that

d(gy, h 2 y) r λ ρ(gy,Ty).

Since h 1 xSx and h 2 yTy,

d(fx, h 1 x)ρ(fx,Sx)andd(gy, h 2 y)ρ(gy,Ty).

So (2.11) gives

φ(r)min { d ( f x , h 1 x ) , d ( g y , h 2 y ) } φ(r)min { ρ ( f x , S x ) , ρ ( g y , T y ) } d(fx,gy),
(2.13)

and this implies (2.12). Therefore

d ( h 1 x , h 2 y ) ρ ( S x , T y ) r r λ max { r λ d ( f x , g y ) , r λ ρ ( f x , S x ) , r λ ρ ( g y , T y ) , r λ d ( f x , T y ) + r λ d ( g y , S x ) 2 } r 1 λ max { d ( f x , g y ) , d ( f x , h 1 x ) , d ( g y , h 2 y ) , d ( f x , h 2 y ) + d ( g y , h 1 x ) 2 } .

So (2.13), viz., φ( r )min{d(fx, h 1 x),d(gy, h 2 y)}d(fx,gy) implies

d ( h 1 x , h 2 y ) r max { d ( f x , g y ) , d ( f x , h 1 x ) , d ( g y , h 2 y ) , d ( f x , h 2 y ) + d ( g y , h 1 x ) 2 } ,

where r = r 1 λ <1.

Hence by Corollary 2.8, there exist z 1 , z 2 Y such that h 1 z 1 =f z 1 and h 2 z 2 =g z 2 . This implies that z 1 is a coincidence point of f and S, and z 2 is a coincidence point of g and T. □

Corollary 2.15 Let S:YBN(X) and f,g:YX be such that S(Y)f(Y)g(Y), and let one of S(Y), f(Y) or g(Y) be a complete subspace of X. Assume there exists r[0,1) such that, for every x,yY,

φ(r)min { ρ ( f x , S x ) , ρ ( g y , S y ) } d(fx,gy)
(2.14)

implies

ρ(Sx,Sy)rmax { d ( f x , g y ) , ρ ( f x , S x ) , ρ ( g y , S y ) , d ( f x , S y ) + d ( g y , S x ) 2 } .
(2.15)

Then C(S,f) and C(S,g) are nonempty.

Proof It follows from Theorem 2.14 when T=S. □

Corollary 2.16 [10]

Let S,T:YBN(X) and f:YX be such that S(Y)f(Y), T(Y)f(Y) and let S(Y) or T(Y) or f(Y) be a complete subspace of X. Assume there exists r[0,1) such that, for every x,yX,

φ(r)min { ρ ( f x , S x ) , ρ ( f y , T y ) } d(fx,fy)

implies

ρ(Sx,Ty)rmax { d ( f x , f y ) , ρ ( f x , S x ) , ρ ( f y , T y ) , d ( f x , T y ) + d ( f y , S x ) 2 } .

Then there exists zY such that fzSzTz.

Proof It follows from Theorem 2.14 when g=f. □

Corollary 2.17 [23]

Let X be a complete metric space and let S,T:XBN(X). Assume there exists r[0,1) such that, for every x,yX,

φ(r)min { ρ ( x , S x ) , ρ ( y , T y ) } d(x,y)

implies

ρ(Sx,Ty)rmax { d ( x , y ) , ρ ( x , S x ) , ρ ( y , T y ) , d ( x , T y ) + d ( y , S x ) 2 } .

Then there exists a unique point zX such that zSzTz.

Proof It follows from Theorem 2.14 when f and g are the identity maps on X. □

Corollary 2.18 Let S:YBN(X) and f:YX be such that S(Y)f(Y), and let S(Y) or f(Y) be a complete subspace of X. Assume there exists r[0,1) such that, for every x,yY,

φ(r)ρ(fx,Sx)d(fx,fy)

implies

ρ(Sx,Sy)rmax { d ( f x , f y ) , ρ ( f x , S x ) , ρ ( f y , S y ) , d ( f x , S y ) + d ( f y , S x ) 2 } .

Then there exists zY such that fzSz.

Proof It follows from Theorem 2.14 when g=f and T=S. □

Corollary 2.19 Let X be a complete metric space and let S:XBN(X). Assume there exists r[0,1) such that, for every x,yX,

φ(r)ρ(x,Sx)d(x,y)

implies

ρ(Sx,Sy)rmax { d ( x , y ) , ρ ( x , S x ) , ρ ( y , S y ) , d ( x , S y ) + d ( y , S x ) 2 } .

Then there exists a unique point zX such that zSz.

Proof It follows from Theorem 2.14 that S has a fixed point when f=g is the identity map on X and T=S. The uniqueness of the fixed point follows easily. □

3 Applications

Throughout this section, we assume that U and V are Banach spaces, WU and DV. Let R denote the field of reals, τ:W×DW, g, g :W×DR and G 1 , G 2 , F 1 , F 2 :W×D×RR. Considering W and D as the state and decision spaces respectively, the problem of dynamic programming reduces to the problem of solving the functional equations:

p i = sup y D { g ( x , y ) + G i ( x , y , p ( τ ( x , y ) ) ) } ,xW,i=1,2,
(3.1a)
q i = sup y D { g ( x , y ) + F i ( x , y , q ( τ ( x , y ) ) ) } ,xW,i=1,2.
(3.1b)

Indeed, in the multistage process, some functional equations arise in a natural way (cf. Bellman [41] and Bellman and Lee [42]; see also [10, 4347], and [23]). In this section, we study the existence of a common solution of the functional equations (3.1a) and (3.1b) arising in dynamic programming.

Let B(W) denote the set of all bounded real-valued functions on W. For an arbitrary hB(W), define h= sup x W |h(x)|. Then (B(W),) is a Banach space. Suppose that the following conditions hold:

(DP-1) G 1 , G 2 , F 1 , F 2 , g, and g are bounded.

(DP-2) Let φ(r) be defined as in the previous sections. Assume that there exists r[0,1) such that, for every (x,y)W×D, h,kB(W), and tW,

φ(r)min { | J 1 h ( t ) A 1 h ( t ) | , | J 2 k ( t ) A 2 k ( t ) | } | J 1 h(t) J 2 k(t)|

implies

| G 1 ( x , y , h ( t ) ) G 2 ( x , y , k ( t ) ) |rM( A 1 , A 2 ; J 1 h, J 2 k),

where

M ( A 1 , A 2 ; J 1 h , J 2 k ) = max { | J 1 h ( t ) J 2 k ( t ) | , | J 1 h ( t ) A 1 h ( t ) | , | J 2 k ( t ) A 2 k ( t ) | , | J 1 h ( t ) A 2 k ( t ) | + | J 2 k ( t ) A 1 h ( t ) | 2 } ,

and A 1 , A 2 , J 1 , and J 2 are defined as follows:

A i h ( x ) = sup y D { g ( x , y ) + G i ( x , y , h ( τ ( x , y ) ) ) } , x W , h B ( W ) , i = 1 , 2 , J i h ( x ) = q = sup y D { g ( x , y ) + F i ( x , y , h ( τ ( x , y ) ) ) } , x W , h B ( W ) , i = 1 , 2 .

(DP-3) For any h,kB(W), there exist u,vB(W) such that

A 1 h(x)= J 1 u(x)and A 2 k(x)= J 2 v(x),xW.

(DP-4) There exist h,kB(W) such that

J 1 h(x)= A 1 h(x)implies J 1 A 1 h(x)= A 1 J 1 h(x)

and

J 2 k(x)= A 2 k(x)implies J 2 A 2 k(x)= A 2 J 2 k(x).

Theorem 3.1 Assume the conditions (DP-1)-(DP-4) hold. Let J(B(W)) be a closed convex subspace of B(W). Then the functional equations (3.1a) and (3.1b), i=1,2, have a unique bounded common solution in B(W).

Proof For any h,kB(W), let d(h,k)=sup{|h(x)k(x)|:xW}. Then (B(W),d) is a complete metric space.

Let λ be an arbitrary positive number and h 1 , h 2 B(W). Pick xW, and choose y 1 , y 2 D such that

A j h j <g(x, y j )+ G j ( x , y j , h j ( x j ) ) +λ, x i =(x, y i ),i=1,2,
(3.1)

where x j =τ(x, y j ).

Further,

A 1 h 1 g(x, y 2 )+ G 1 ( x , y 2 , h 1 ( x 2 ) ) ,
(3.2)
A 2 h 2 g(x, y 1 )+ G 2 ( x , y 1 , h 2 ( x 1 ) ) .
(3.3)

Therefore, the first inequality in (DP-2) becomes

φ ( r ) min { | J 1 h 1 ( x ) A 1 h 1 ( x ) | , | J 2 h 2 ( x ) A 2 h 2 ( x ) | } | J 1 h 1 ( x ) J 2 h 2 ( x ) | ,
(3.4)

and this together with (3.1), (3.3), and (3.4) implies

A 1 h 1 A 2 h 2 < G 1 ( x , y 1 , h 1 ( x 1 ) ) G 2 ( x , y , h 2 ( x 1 ) ) + λ | G 1 ( x , y 1 , h 1 ( x 1 ) ) G 2 ( x , y 1 , h 2 ( x 1 ) ) | + λ r M ( A 1 , A 2 ; J 1 h 1 , J 2 h 2 ) + λ .
(3.5)

Similarly, (3.1), (3.2), and (3.4) imply

A 2 h 2 (x) A 1 h 1 (x)rM( A 1 , A 2 ; J 1 h 1 , J 2 h 2 )+λ.
(3.6)

So, from (3.5) and (3.6), we obtain

| A 1 h 1 (x) A 2 h 2 (x)|rM( A 1 , A 2 ; J 1 h 1 , J 2 h 2 )+λ.
(3.7)

As λ>0 is arbitrary and (3.7) is true for any xW, taking supremum, we find from (3.4) and (3.7) that

φ(r)min { d ( J 1 h 1 , A 1 h 1 ) , d ( J 2 h 2 , A 2 h 2 ) } d( J 1 h 1 , J 2 h 2 )

implies

d( A 1 h 1 , A 2 h 2 )rM( A 1 , A 2 ; J 1 h 1 , J 2 h 2 ).

Therefore, Corollary 2.8 applies, wherein A 1 , A 2 , J 1 , and J 2 correspond, respectively, to the maps P, Q, f, and g. So A 1 , A 2 , J 1 , and J 2 have a unique common fixed point h , that is, h (x) is the unique bounded common solution of the functional equations (3.1a) and (3.1b), i=1,2. □

Now we furnish an example in support of Theorem 3.1.

Example 3.2 Let X=Y=R be a Banach space endowed with the standard norm defined by x=|x|, for all xX. Suppose W=[0,1]X be the state space, and D=[0,)Y be the decision space.

Define τ:W×DW by

τ(x,y)= x y 2 + 1 ,xW,yD.

For any h,kB(W), and i=1,2, define p i , q i :WR by

p i (x)= q i (x)= x 2 + 1 2 .

Define G i ,F:W×D×RR by

G 1 ( x , y , t ) = 1 4 { x ( x + 1 ) ( y + 1 ) sin y y + 1 + 2 } ; G 2 ( x , y , t ) = 1 4 { x ( x + 1 ) ( 2 y + 1 ) sin y y + 1 + 2 } ; F 1 ( x , y , t ) = 1 2 x + y + 1 + 1 2 sin t ; F 2 ( x , y , t ) = 1 2 x + 3 y + 1 + 1 2 sin t ; g ( x , y ) = x 2 y 2 x + y 2 and g ( x , y ) = x 2 y 5 x + y 5 .

Notice that G 1 , G 2 , F 1 , F 2 , g, and g are bounded. Also

J 1 h ( x ) = sup y D { g ( x , y ) + F 1 ( x , y , h ( τ ( x , y ) ) ) } = x 2 + 1 2 = q 1 ( x ) , x W , h B ( W ) ; J 2 k ( x ) = sup y D { g ( x , y ) + F 2 ( x , y , k ( τ ( x , y ) ) ) } = x 2 + 1 2 = q 2 ( x ) , x W , h B ( W ) ; A 1 h ( x ) = sup y D { g ( x , y ) + G 1 ( x , y , h ( τ ( x , y ) ) ) } = x 2 + 1 2 = p 1 ( x ) , x W , h B ( W ) ; A 2 k ( x ) = sup y D { g ( x , y ) + G 2 ( x , y , k ( τ ( x , y ) ) ) } = x 2 + 1 2 = p 2 ( x ) , x W , h B ( W ) .

We see that

φ ( r ) min { | J 1 h ( t ) A 1 h ( t ) | , | J 2 k ( t ) A 2 k ( t ) | } = φ ( r ) min { | q 1 ( x ) p 1 ( x ) | , | q 2 ( x ) p 2 ( x ) | } = 0 = | J 1 h ( t ) J 2 k ( t ) | .

Thus

φ(r)min { | J h ( t ) A 1 h ( t ) | , | J k ( t ) A 2 k ( t ) | } =|Jh(t)Jk(t)|,

and this implies

| G 1 ( x , y , h ( t ) ) G 2 ( x , y , k ( t ) ) |=0rM ( A 1 , A 2 ; J h ( t ) , J k ( t ) ) .

Finally for any h,kB(W) with A 1 h=Jh, we have A 1 Jh= p 1 (x)=q(x)=JJh=J A 1 h, that is, J A 1 h= A 1 Jh, and with A 2 k=Jk, we have A 2 Jk= p 2 (x)=q(x)=JJk=J A 2 k, that is, J A 2 k= A 2 Jk.

Thus all the assumptions of Theorem 3.1 are satisfied. So the system of equations (3.1a) and (3.1b) has a unique solution in B(W).

Corollary 3.3 Suppose that the following conditions hold:

  1. (i)

    G, F 1 , F 2 , g, and g are bounded.

  2. (ii)

    Let φ(r) be defined as in the previous sections. Assume that there exists r[0,1) such that, for every (x,y)W×D, h,kB(W), and tW,

    φ(r)min { | J 1 h ( t ) A h ( t ) | , | J 2 k ( t ) A k ( t ) | } | J 1 h(t) J 2 k(t)|

implies

|G ( x , y , h ( t ) ) G ( x , y , k ( t ) ) |rM(A; J 1 h, J 2 k),

where

M ( A ; J 1 h , J 2 k ) = max { | J 1 h ( t ) J 2 k ( t ) | , | J 1 h ( t ) A h ( t ) | , | J 2 k ( t ) A k ( t ) | , | J 1 h ( t ) A k ( t ) | + | J 2 k ( t ) A h ( t ) | 2 } ,

and A, J 1 , and J 2 are defined as follows:

A h ( x ) = sup y D { g ( x , y ) + G ( x , y , h ( τ ( x , y ) ) ) } , x W , h B ( W ) , J i h ( x ) = q = sup y D { g ( x , y ) + F i ( x , y , h ( τ ( x , y ) ) ) } , x W , h B ( W ) , i = 1 , 2 .
  1. (iii)

    For any h,kB(W), there exist u,vB(W) such that

    Ah(x)= J 1 u(x)andAk(x)= J 2 v(x),xW.
  2. (iv)

    There exist h,kB(W) such that

    J 1 h(x)=Ah(x)implies J 1 Ah(x)=A J 1 h(x)

and

J 2 k(x)=Ak(x)implies J 2 Ak(x)=A J 2 k(x).

Then the functional equations (3.1a) and (3.1b), i=1,2, have a unique bounded common solution in B(W).

Proof It follows from Theorem 3.1 when G 1 = G 2 =G. □

Corollary 3.4 [10]

Suppose that the following conditions hold:

  1. (i)

    G 1 , G 2 , F, g, and g are bounded.

  2. (ii)

    Assume there exists r[0,1) such that, for every (x,y)W×D, h,kB(W) and tW,

    φ(r)min { | J h ( t ) A 1 h ( t ) | , | J k ( t ) A 2 k ( t ) | } |Jh(t)Jk(t)|

implies

| G 1 ( x , y , h ( t ) ) G 2 ( x , y , k ( t ) ) | r max { | J h ( t ) J k ( t ) | , | J h ( t ) A 1 h ( t ) | , | J k ( t ) A 2 k ( t ) | , | J h ( t ) A 2 k ( t ) | + | J k ( t ) A 1 h ( t ) | 2 } ,

where A 1 , A 2 , and J are defined as follows:

A i h ( x ) = sup y D { g ( x , y ) + G i ( x , y , h ( τ ( x , y ) ) ) } , x W , h B ( W ) , i = 1 , 2 , J h ( x ) = q = sup y D { g ( x , y ) + F ( x , y , h ( τ ( x , y ) ) ) } , x W , h B ( W ) .
  1. (iii)

    For any h,kB(W), there exist u,vB(W) such that

    A 1 h(x)=Ju(x)and A 2 k(x)=Jv(x),xW.
  2. (iv)

    There exist h,kB(W) such that

    Jh(x)= A 1 h(x)impliesJ A 1 h(x)= A 1 Jh(x)

and

Jk(x)= A 2 k(x)impliesJ A 2 k(x)= A 2 Jk(x).

Then the functional equations (3.1a) and (3.1b) with F 1 = F 2 =F possesses a unique bounded common solution in W.

Proof It follows from Theorem 3.1 when F 1 = F 2 =F. □

As an immediate consequence of Theorem 3.1 and Corollary 2.6, we obtain the following.

Corollary 3.5 [23]

Suppose that the following conditions hold:

  1. (i)

    G 1 , G 2 , and g are bounded.

  2. (ii)

    There exists r [0,1) such that, for every (x,y)W×D, h,kB(W), and tW,

    φ(r)min { | h ( t ) A 1 h ( t ) | , | k ( t ) A 2 k ( t ) | } |h(t)k(t)|

implies

| G 1 ( x , y , h ( t ) ) G 2 ( x , y , k ( t ) ) | r max { | h ( t ) k ( t ) | , | h ( t ) A 1 h ( t ) | , | k ( t ) A 2 k ( t ) | , | h ( t ) A 2 k ( t ) | + | k ( t ) A 1 h ( t ) | 2 } ,

where A 1 and A 2 are defined as follows:

A i h(x)= sup y D { g ( x , y ) + G i ( x , y , h ( τ ( x , y ) ) ) } ,xW,hB(W),i=1,2.

Then the functional equation (3.1a) possesses a unique bounded solution in W.

Proof It follows from Corollary 3.4 when g=0, τ(x,y)=x, and F(x,y,t)=t as the assumption (DP-3) becomes redundant in this context. □

The following result generalizes a recent result of Singh and Mishra [[11], Corollary 4.2], which in turn extends certain results from [42] and [43].

Corollary 3.6 Suppose that the following conditions hold:

  1. (i)

    G and g are bounded.

  2. (ii)

    There exists r[0,1) such that, for every (x,y)W×D, h,kB(W), and tW,

    φ(r)|h(t)Kh(t)||h(t)k(t)|

implies

|G ( x , y , h ( t ) ) G ( x , y , k ( t ) ) |rmaxM ( K , K ; h ( t ) , k ( t ) ) ,

where K is defined as

Ah(x)= sup y D { g ( x , y ) + G ( x , y , h ( τ ( x , y ) ) ) } ,xW,hB(W).

Then the functional equation (3.1a) with G 1 = G 2 =G possesses a unique bounded solution in W.

Proof It follows from Corollary 3.5 when G 1 = G 2 =G. □

References

  1. Nadler SB Jr.: Multivalued contraction mappings. Pac. J. Math. 1969, 30: 475–488. 10.2140/pjm.1969.30.475

    Article  MathSciNet  Google Scholar 

  2. Khamsi MA, Kirk WA: An Introduction to Metric Spaces and Fixed Point Theory. Wiley, New York; 2001.

    Book  Google Scholar 

  3. C̀iric̀ LB: Fixed points for generalized multivalued contractions. Mat. Vesn. 1972, 9(24):265–272.

    MathSciNet  Google Scholar 

  4. Covitz H, Nadler SB Jr.: Multivalued contraction mappings in generalized metric spaces. Isr. J. Math. 1970, 8: 5–11. 10.1007/BF02771543

    Article  MathSciNet  Google Scholar 

  5. Czerwik S Scientific Publications of the University of Silesia 428. In Fixed Point Theorems and Special Solutions of Functional Equations. Silesian University, Katowice; 1980.

    Google Scholar 

  6. Hadzic̀ O: A coincidence theorem for multivalued mappings in metric spaces. Stud. Univ. Babeş-Bolyai, Math. 1981, 26(4):65–67.

    MathSciNet  Google Scholar 

  7. Nadler SB Jr.: Hyperspaces of Sets. Dekker, New York; 1978.

    Google Scholar 

  8. Petruşel A, Rus IA: The theory of a metric fixed point theorem for multivalued operators. In Proc. Ninth International Conference on Fixed Point Theory and Its Applications. Yokohama Publ., Yokohama; 2011:161–175. Changhua, Taiwan, 16–22 July 2009

    Google Scholar 

  9. Rus IA: Generalized Contractions and Applications. Cluj University Press, Cluj-Napoca; 2001.

    Google Scholar 

  10. Singh SL, Chugh R, Kamal R: Suzuki type hybrid contractions and applications. Indian J. Math. 2014, 56(1):49–76.

    MathSciNet  Google Scholar 

  11. Singh SL, Mishra SN: Coincidence points, hybrid fixed and stationary points of orbitally weakly dissipative maps. Math. Jpn. 1994, 39: 451–459.

    MathSciNet  Google Scholar 

  12. Singh SL, Mishra SN: On general hybrid contractions. J. Aust. Math. Soc. A 1999, 66: 244–254. 10.1017/S1446788700039331

    Article  MathSciNet  Google Scholar 

  13. Singh SL, Mishra SN: Coincidence theorems for certain classes of hybrid contractions. Fixed Point Theory Appl. 2010., 2010: Article ID 898109

    Google Scholar 

  14. Singh SL, Mishra SN: Fixed point theorems for single-valued and multi-valued maps. Nonlinear Anal. 2011, 74: 2243–2248. 10.1016/j.na.2010.11.029

    Article  MathSciNet  Google Scholar 

  15. Baillon JB, Singh SL: Nonlinear hybrid contractions on product spaces. Far East J. Math. Sci. 1993, 1: 117–127.

    MathSciNet  Google Scholar 

  16. Baskaran R, Subrahmanyam PV: Common coincidence and fixed points. J. Math. Phys. Sci. 1984, 18: 329–343.

    MathSciNet  Google Scholar 

  17. Beg I, Azam A: Common fixed points for commuting and compatible maps. Discuss. Math., Differ. Incl. 1996, 16: 121–135.

    MathSciNet  Google Scholar 

  18. Dhompongsa S, Yingtaweesittikul H: Fixed points for multivalued mappings and the metric completeness. Fixed Point Theory Appl. 2009., 2009: Article ID 972395

    Google Scholar 

  19. Moţ G, Petruşel A: Fixed point theory for a new type of contractive multi-valued operators. Nonlinear Anal. 2009, 70(9):3371–3377. 10.1016/j.na.2008.05.005

    Article  MathSciNet  Google Scholar 

  20. Reich S: Fixed points of multi-valued functions. Atti Accad. Naz. Lincei, Rend. Cl. Sci. Fis. Mat. Nat. 1971, 8(51):32–35.

    Google Scholar 

  21. Singh SL, Mishra SN: Nonlinear hybrid contractions. J. Natur. Phys. Sci. 1991/94, 5–8: 191–206.

    MathSciNet  Google Scholar 

  22. Singh SL, Mishra SN: Coincidence and fixed points of nonself hybrid contractions. J. Math. Anal. Appl. 2001, 256(2):486–497. 10.1006/jmaa.2000.7301

    Article  MathSciNet  Google Scholar 

  23. Singh SL, Mishra SN, Chugh R, Kamal R: General common fixed point theorems and applications. J. Appl. Math. 2012., 2012: Article ID 902312

    Google Scholar 

  24. Suzuki T: A generalized Banach contraction principle that characterizes metric completeness. Proc. Am. Math. Soc. 2008, 136(5):1861–1869.

    Article  Google Scholar 

  25. Wegrzyk R: Fixed point theorems for multivalued functions and their applications to functional equations. Diss. Math. 1982, 201: 1–28.

    MathSciNet  Google Scholar 

  26. Kikkawa M, Suzuki T: Three fixed point theorems for generalized contractions with constants in complete metric spaces. Nonlinear Anal. 2008, 69(9):2942–2949. 10.1016/j.na.2007.08.064

    Article  MathSciNet  Google Scholar 

  27. Abbas M, Ali B, Mishra SN:Fixed points of multivalued Suzuki-Zamfirescu-(f;g) contraction mappings. Mat. Vesn. 2014, 66(1):58–72.

    MathSciNet  Google Scholar 

  28. Doric̀ D, Lazovic̀ R: Some Suzuki-type fixed point theorems for generalized multivalued mappings and applications. Fixed Point Theory Appl. 2011., 2011: Article ID 40

    Google Scholar 

  29. Kamal, R, Chugh, R, Singh, SL, Mishra, SN: New common fixed point theorems for multivalued maps. Appl. Gen. Topol. (2013)

    Google Scholar 

  30. Singh SL, Chugh R, Kamal R: Suzuki type common fixed point theorems and applications. Fixed Point Theory 2013, 14(2):1–9.

    MathSciNet  Google Scholar 

  31. Itoh S, Takahashi W: Single-valued mappings, multivalued mappings and fixed point theorems. J. Math. Anal. Appl. 1977, 59(3):514–521. 10.1016/0022-247X(77)90078-6

    Article  MathSciNet  Google Scholar 

  32. Singh SL, Hashim AM: New coincidence and fixed point theorems for strictly contractive hybrid maps. Aust. J. Math. Anal. Appl. 2005, 2(1):1–7.

    MathSciNet  Google Scholar 

  33. Jungck G, Rhoades BE: Fixed points for set-valued functions without continuity. Indian J. Pure Appl. Math. 1988, 29(3):227–238.

    MathSciNet  Google Scholar 

  34. Naimpally SA, Singh SL, Whitfield JHM: Coincidence theorems for hybrid contractions. Math. Nachr. 1986, 127: 177–180. 10.1002/mana.19861270112

    Article  MathSciNet  Google Scholar 

  35. Singh SL, Kamal R, De la Sen M, Chugh R: A new type of coincidence and common fixed point theorem with applications. Abstr. Appl. Anal. 2014., 2014: Article ID 642378

    Google Scholar 

  36. C̀iric̀ LB: On a family of contractive maps and fixed points. Publ. Inst. Math. (Belgr.) 1974, 17(31):45–51.

    MathSciNet  Google Scholar 

  37. Damjanovic̀ B, Doric̀ D: Multivalued generalizations of the Kannan fixed point theorem. Filomat 2011, 25(1):125–131. 10.2298/FIL1101125D

    Article  MathSciNet  Google Scholar 

  38. Goebel K: A coincidence theorem. Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 1968, 16: 733–735.

    MathSciNet  Google Scholar 

  39. Jungck G: Commuting mappings and fixed points. Am. Math. Mon. 1976, 83(4):261–263. 10.2307/2318216

    Article  MathSciNet  Google Scholar 

  40. Fisher B: Mappings with a common fixed point. Math. Semin. Notes Kobe Univ. 1979, 7: 81–84.

    Google Scholar 

  41. Bellman R II. In Methods of Nonlinear Analysis. Academic Press, New York; 1973.

    Google Scholar 

  42. Bellman R, Lee ES: Functional equations in dynamic programming. Aequ. Math. 1978, 17(1):1–18. 10.1007/BF01818535

    Article  MathSciNet  Google Scholar 

  43. Bhakta PC, Mitra S: Some existence theorems for functional equations arising in dynamic programming. J. Math. Anal. Appl. 1984, 98(2):348–362. 10.1016/0022-247X(84)90254-3

    Article  MathSciNet  Google Scholar 

  44. Pathak HK, Cho YJ, Kang SM, Lee BS: Fixed point theorems for compatible mappings of type (P) and applications to dynamic programming. Matematiche 1995, 50(1):15–33.

    MathSciNet  Google Scholar 

  45. Pathak HK, Deepmala : Some existing theorems for solvability of certain function equations arising in dynamic programming. Bull. Calcutta Math. Soc. 2012, 104(3):237–244.

    MathSciNet  Google Scholar 

  46. Pathak HK, Tiwari R: Common fixed points for weakly compatible mappings and applications in dynamic programming. Ital. J. Pure Appl. Math. 2013, 30: 253–268.

    MathSciNet  Google Scholar 

  47. Singh SL, Mishra SN: On a Ljubomir C̀iric̀ fixed point theorem for nonexpansive type maps with applications. Indian J. Pure Appl. Math. 2002, 33(4):531–542.

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank the referees for their deep understanding, appreciation, and suggestions to improve upon the original typescript. They are also thankful to the Spanish Government for its support of this research through Grant DPI2012-30651, and to the Basque Government for its support of this research trough Grants IT378-10 and SAIOTEK S-PE12UN015. Further, they acknowledge the financial support by the University of Basque Country through Grant UFI 2011/07.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manuel De la Sen.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, S.L., Kamal, R. & De la Sen, M. Coincidence and common fixed point theorems for Suzuki type hybrid contractions and applications. Fixed Point Theory Appl 2014, 147 (2014). https://doi.org/10.1186/1687-1812-2014-147

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2014-147

Keywords