1 Introduction and preliminaries

In 1957, Isbel [1] (see also [2]) posed an interesting problem: If { f n } n N is a family of commuting continuous self-mappings of [0,1] then do there exist common fixed points for { f n }? It was only in 1969 that Boyce [3] and Huneke [4] independently proved that there exist two continuous commuting self-mappings of the unit interval [0,1] without a common fixed point.

The well-known Banach contraction principle states that if a self-mapping f of a complete metric space (X,d) satisfies the condition

  1. (i)

    d(fx,fy)kd(x,y), 0k<1,

for each x,yX, then f has a unique fixed point, that is, there exists a unique zX such that f(z)=z.

A fixed point of a self-mapping of a metric space X can also be considered to be a common fixed point of f with the identity mapping on X. An innate question that comes up in this context is whether the identity mapping can be replaced by another self-mapping g of X to obtain common fixed points of f and g. In 1968, Goebel [5] studied this problem and obtained the following coincidence theorem.

Theorem 1.1 Let A be an arbitrary set and X be a metric space with the metric d. Suppose, moreover, that f, g are two mappings defined on the set A with the values in X. If f(A)g(A), g(A) is a complete subspace of X and for all x,yA:

  1. (i)

    d(fx,fy)kd(gx,gy), 0k<1,

then f and g have a coincidence point, that is, there exists zA such that f(z)=g(z).

The condition (i) of Theorem 1.1 appears to have been studied first by Machuca [6] in 1967 under some heavy topological conditions (see also [5, 7]).

It may be observed that the conclusion of Theorem 1.1 is not true (take A=X) if we drop completeness of g(A). This can be seen by the following example.

Example 1.2 [8]

Let X=[2,20] and let d be the usual metric on X. Define self-mappings f and g on X as follows:

f x = 6 if  2 x 5 , f x = x + 5 5 if  x > 5 , g x = 12 if  2 x 5 , g x = x + 1 3 if  x > 5 .

Then f and g satisfy the following conditions of Theorem 1.1, but they do not have a coincidence point:

  1. (i)

    fA=(2,5]{6}, gA=(2,7]{12} and fAgA, for A=X;

  2. (ii)

    f and g satisfy contraction condition d(fx,fy) 3 5 d(gx,gy).

Fixed point theorems are statements containing sufficient conditions that ensure the existence of a fixed point. Therefore, one of the central concerns in fixed point theory is to find a minimal set of sufficient conditions which guarantee a fixed point or a common fixed point as the case may be. Common fixed point theorems for contractive type mappings necessarily require a commutativity condition, a condition on the ranges of the mappings, continuity of one or more mappings besides a contractive condition. And every significant fixed point or common fixed point theorem attempts to weaken or obtain a necessary version of one or more of these conditions [9].

In 1976, using condition (i) of Theorem 1.1, Jungck [10] obtained common fixed point for commuting mappings by using a constructive procedure of sequence of iterates.

Theorem 1.3 [10]

Let (X,d) be a complete metric space and let f and g be commuting self-maps of X satisfying the conditions:

  1. (i)

    fXgX;

  2. (ii)

    d(fx,fy)kd(gx,gy), for all x,yX and some 0k<1.

If g is continuous then f and g have a unique common fixed point.

The essence of Jungck’s theorem has been used by several workers to obtain interesting common fixed point theorems for both commuting and noncommuting pairs of mappings satisfying contractive type conditions. The constructive technique of Jungck’s theorem has been further improved and extended by various researchers to establish common fixed point theorems for three mappings, four mappings and sequence of mappings (see also [1117]).

Generalizations of Jungck’s contraction condition have been extensively used to study common fixed points of contractive mappings. If f and g are two self-mappings of a metric space (X,d), general contractive conditions assume the following form.

  1. (a)

    ϕ-type contractive condition (in the sense of Boyd and Wong [18]);

    d(fx,fy)ϕ ( d ( g x , g y ) ) ,

where ϕ: R + R + is such that ϕ is upper semi-continuous from the right and ϕ(t)<t for each t>0.

(b) Given ϵ>0 there exists a δ>0 such that

ϵd(gx,gy)<ϵ+δd(fx,fy)<ϵ.

Condition (b) is also referred to as a Meir-Keeler type (ϵ,δ) contractive condition [19]. It can easily be seen that if f and g satisfy (b) then f and g also satisfy the contractive condition

d(fx,fy)<d(gx,gy).

In some results the contractive condition (b) has been replaced by a slightly weaker contractive condition of the following form.

  1. (c)

    Given ϵ>0 there exists a δ>0 such that

    ϵ<d(gx,gy)<ϵ+δd(fx,fy)ϵ.

Jachymski [20] has shown that the contractive condition (c) implies (b) but not conversely.

In the setting of common fixed point theorems, the Meir-Keeler type (ϵ,δ) contractive condition alone is not sufficient to guarantee the existence of a common fixed point. While assuming the (ϵ,δ) contractive condition, the existence of a common fixed point is ensured either by imposing some additional restriction on δ or by assuming some additional condition besides the (ϵ,δ) contractive condition or by imposing strong conditions on the continuity of mappings (for references see [9, 2128]).

In 1982, Sessa gave the weaker version of the commutativity condition, namely the weakly commuting condition. In subsequent years Jungck [29, 30], Tivari and Singh [31], Pathak [32, 33], Jungck et al. [34], Jungck and Pathak [35], Pant [36], Pathak et al. [37], Al-Thagafi and Shahzad [38], Hussain et al. [39], Pant and Bisht [40], Bisht and Shahzad [41], and many others have considered several generalizations of commuting mappings or weaker notions of commutativity, see Table 1. Now, it has been shown that weak compatibility is the minimal noncommuting condition for the existence of common fixed points of contractive type mapping pairs. In recent works several authors claimed to introduce some weaker noncommuting notions and showed that their introduced noncommuting conditions contain weak compatibility as a proper subclass. This is, however, of no use when searching for common fixed points. In fact most of the generalized commutativity notions fall in the subclass of weak compatibility in the setting of a unique common fixed point (or unique point of coincidence). These generalizations are novel but for their actual applications one should go beyond contractive conditions, since contractive conditions do not allow for more than one point of coincidence or fixed point.

Table 1 Some weaker forms of commuting mappings

In 2010, Haghi et al. [68] presented the following lemma, which is a consequence of the axiom of choice, and they showed that some coincidence point and common fixed point generalizations in fixed point theory are not real generalizations as they could easily be obtained from the corresponding fixed point theorems. Therefore, one should take care in obtaining real generalizations in fixed point theory (for more details see [68]).

Lemma 1.4 [68]

Let X be a nonempty set and f:XX a function. Then there exists a subset EX such that f(E)=f(X) and f:EX is one-to-one.

2 Comparison of weaker forms of commuting mappings

Let f and g be self-mappings of a set X. If w=fx=gx for some x in X, then x is called a coincidence point of f and g, and w is called a point of coincidence (POC) of f and g. The set of coincidence points (CP) of f and g will be denoted by C(f,g). Let PC(f,g) represent the set of points of coincidence of f and g. A point xX is a common fixed point of f and g if x=fx=gx. The set of all common fixed points of f and g is denoted by F(f,g).

Two self-mappings f and g of a metric space (X,d) are said to be commuting iff fgx=gfx for all x in X.

The study of common fixed points of pair of self-mappings satisfying contractive type conditions becomes interesting in view of the fact that even commuting continuous mappings on such nicely behaved entities as compact convex sets may fail to have a coincidence or common fixed point. When we extend such studies to the class of noncommuting contractive type mapping pair, it becomes still more interesting [36].

The first ever attempt to relax the commutativity of mappings to a smaller subset of the domain of mappings was initiated by Sessa [42] who in 1982 gave the notion of weak commutativity.

Definition 2.1 (Sessa [42])

Two self-mappings f and g of a metric space (X,d) are called weakly commuting iff d(fgx,gfx)d(fx,gx) for all x in X.

Notice that commuting mappings are obviously weakly commuting. However, a weakly commuting mappings need not be commuting.

Example 2.2 Let X=[0,1] be equipped with the usual metric d on X. Define constant mappings f and g:XX by

fx=aandgx=b,ab.

Then f and g are weakly commuting but not commuting since d(fgx,gfx)=|ab|=d(fx,gx).

In order to enlarge the domain of noncommuting mappings, Pathak [32, 33] obtained several new classes of noncommuting notions, namely, weak commuting, weak∗∗ commuting mappings.

Definition 2.3 (Pathak [32])

Two self-mappings f and g of a metric space (X,d) are called weak commuting iff d(fgx,gfx)d( f 2 x, g 2 x) for all x in X.

Definition 2.4 (Pathak [33])

Two self-mappings f and g of a metric space (X,d) are called weak∗∗ commuting iff fXgX and, for any xX,

d ( f 2 g 2 x , g 2 f 2 x ) d ( f 2 g x , g f 2 x ) d ( f g 2 x , g 2 f x ) d(fgx,gfx)d ( f 2 x , g 2 x ) .

It is easy to check that commuting mappings are weak commuting and weak∗∗ commuting. The following example shows that the reverse implication does not hold.

Example 2.5 [32]

Consider X=[0,1] with the usual metric d on X. Define f,g:XX by

fx= x x + 3 for all xandgx= x 3 for all x.

Then f and g are weak commuting and weak∗∗ commuting but f and g are not commuting mappings.

Remark 2.6 Notice that if f 2 =f and g 2 =g, then weak commutativity or weak∗∗ commutativity reduces to weak commutativity.

Definition 2.7 (Pathak [43])

Two self-mappings f and g of a metric space (X,d) are called weakly uniformly contraction mappings iff d(fgx,ggx)d(fx,gx) and d(ffx,gfx)d(fx,gx) for all x in X.

In view of Example 2.5, we remark that commuting mappings are weakly uniformly contraction mappings. However, weakly uniformly contraction mappings need not be weakly commuting.

In 1986, Jungck generalized the concept of weak commutativity by introducing the notion of compatible mappings [30] also called asymptotically commuting mappings by Tivari and Singh [31] in an independent work. In [16] it has been shown that two continuous self-mappings of a compact metric space are compatible iff they commute on their set of coincidence points.

Definition 2.8 (Jungck [30], Tivari and Singh [31])

Two self-mappings f and g of a metric space (X,d) are called compatible or asymptotically commuting iff lim n d(fg x n ,gf x n )=0, whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

Clearly, weakly commuting mappings are compatible, but in view of Example 2.9 the converse does not hold.

Example 2.9 [30]

Let X=[0,) and d be the usual metric on X. Define f,g:XX by

fx= x 3 for all xandgx=2 x 3 for all x.

Then d(fgx,gfx)>d(fx,gx). Therefore f and g are not weakly commuting mappings. However, f and g are compatible mappings.

Remark 2.10 Notice that the notions of weak commutativity and compatibility differ in one respect. Weak commutativity is essentially a point property, while the notion of compatibility uses the machinery of sequences.

Remark 2.11 In a review of [30] Singh (Math. Rev. 89h:54030, see also [36]) has shown that for a pair of weakly commuting mappings on a metric space (X,d), there may not exist even a single sequence { x n } in X for which lim n f x n = lim n g x n =t for some t in X. In this case the mappings f and g are still compatible. The following example shows that in this situation they can be weakly commuting.

Example 2.12 Let X=[0,) and d be the usual metric on X. Define f,g:XX by

fx=xfor all xandgx=x+1for all x.

Then f and g are weakly commuting mappings but there does not exist even a single sequence for which the condition of compatibility is satisfied. However, fgx=gfx=1+x, i.e., d(fgx,gfx)=0. Hence f and g may be called vacuously compatible mappings.

Singh and Tomar [7] has also shown by an example that weak commutativity of a pair of self-mappings f and g on a metric space (X,d) depends on the choice of the metric. This is true for compatibility as well.

Example 2.13 [7]

Let X=[0,) be endowed with the usual metric. Define f,g:XX by

fx=1+xandgx=2+ x 2 .

Then d(fgx,gfx)=2x and d(fx,gx)=( x 2 x+1). One may observe that f and g are not weakly commuting on X with respect to the usual metric. But if X is endowed with the discrete metric d, then d(fgx,gfx)=1=d(fx,gx) for x>0. So, f and g are weakly commuting on X when endowed with the discrete metric.

Ever since the introduction of compatibility, the study of common fixed points has developed around compatible maps and its weaker forms and it has become an area of vigorous research activity. However, fixed point theory for noncompatible mappings is equally interesting and Pant [69] has initiated some work along these lines. One can establish fixed point theorems for such mappings pairs not only under nonexpansive conditions but also under Lipschitz type conditions even without using the usual contractive method of proof. The best examples of noncompatible maps are found among pairs of mappings which are discontinuous at their common fixed point [69]. It may be observed that the mappings f and g are said to be noncompatible if there exists a sequence { x n } in X such that for some t in X but lim n d(fg x n ,gf x n ) is either non-zero or nonexistent.

Definition 2.14 [70]

Two self-mappings f and g of a metric space (X,d) are said to satisfy the (E.A.) property if there exists a sequence { x n } in X such that

lim n f x n = lim n g x n =tfor some tX.

It may be observed that the (E.A.) property is equivalent to the previously known notion of tangential mappings introduced by Sastry et al. [55].

If f and g are both noncompatible then they do satisfy the (E.A.) property. In fact the notion of the (E.A.) property circumvents the most crucial part of fixed point theorems consisting of constructive procedures yielding a Cauchy sequence. On the other hand the (E.A.) property enables us to study the existence of common fixed point of nonexpansive or Lipschitz type conditions in the setting of noncomplete metric spaces.

Sintunavarat and Kumam [71] introduced an interesting property, namely the common limit in the range property (in short CLR g ) which completely buys the condition of closedness of the ranges of the involved mappings and has an edge over the (E.A.) property (see also [7277]).

Theorem 2.15 [71, 78]

Two self-mappings f and g of a metric space (X,d) are said to be satisfy the common limit in the range of g property (in short CLR g ) if there exists a sequence { x n } in X such that

lim n f x n = lim n g x n =gxfor some xX.

It is important to note that in the setting of metric spaces, there is no general method for the study of common fixed points of nonexpansive or Lipschitz type mappings. The notions of noncompatibility, the (E.A.) property and ( CLR g ) property are well suited for studying common fixed points of strict contractive conditions, nonexpansive type mapping pairs or Lipschitz type mapping pairs in ordinary metric spaces, which are not even complete.

Definition 2.16 (Singh and Mishra [44])

If for x 0 X there exists a sequence { x n } in X such that f x n + 1 =g x n , n=0,1,2, , then O(g,f; x 0 )={f x n :n=0,1,2,} is an orbit for g and f. Maps f and g are weakly x 0 -preorbitally commuting iff there exists a positive integer N such that d(fg x n ,gf x n )d(f x n ,g x n ) for every { x n } (nN) occurring in O(g,f; x 0 ).

Weakly commuting mappings are preorbitally commuting but the converse is not true in general.

Example 2.17 [79]

Let X=[0,) and d be the usual metric on X. Define f,g:XX by

fx=3 x 3 for all xandgx= x 3 for all x.

Then d(fgx,gfx)>d(fx,gx), i.e., f and g are not weakly commuting but f and g are preorbitally commuting mappings (e.g., take { x n }=0).

Definition 2.18 Two self-mappings f and g of a metric space (X,d) are called:

  1. (i)

    compatible of type (A) (Jungck et al. [34]) iff

    lim n d(ff x n ,gf x n )=0and lim n d(fg x n ,gg x n )=0,
  2. (ii)

    compatible of type (B) (Pathak et al. [46]) iff

    lim n d(fg x n ,gg x n ) 1 2 [ lim n d ( f g x n , f t ) + lim n d ( f t , f f x n ) ]

and

lim n d(gf x n ,ff x n ) 1 2 [ lim n d ( g f x n , g t ) + lim n d ( g t , g g x n ) ] ,
  1. (iii)

    compatible of type (C) (Pathak et al. [52]) iff

    lim n d(fg x n ,gg x n ) 1 3 [ lim n d ( f g x n , f t ) + lim n d ( f t , f f x n ) + lim n d ( f t , g g x n ) ]

and

lim n d(gf x n ,ff x n ) 1 3 [ lim n d ( g f x n , g t ) + lim n d ( g t , g g x n ) + lim n d ( g t , f f x n ) ] ,

whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

Proposition 2.19 [80]

Let f and g be continuous mappings from a metric space (X,d) into itself. Then the following are equivalent:

  1. (i)

    f and g are compatible of type (A),

  2. (ii)

    f and g are compatible of type (B),

  3. (iii)

    f and g are compatible of type (C),

  4. (iv)

    f and g are compatible.

It is clear to see that compatible mappings of type (A)compatible of type (B)compatible of type (C), but the converse is not true in general.

Example 2.20 [80]

Let X=[1,20] and d be the usual metric on X. Define f,g:XX as follows:

f x = 1 if  x = 1 , f x = 3 if  1 < x 7 , g x = x 6 if  7 < x 20 , g x = 1 if  x { 1 } ( 7 , 20 ] , g x = 2 if  1 < x 7 .

It may be observed that f and g are compatible of type (C) but neither compatible nor compatible of type (A) nor compatible of type (B) (consider the sequence { x n } given by x n =7+ 1 n :n>0).

Example 2.21 [8]

Let X=[2,12] and d be the usual metric on X. Define f,g:XX as follows:

f x = 2 if  x = 2  or  x > 5 , f x = 12 if  2 < x 5 , g 2 = 2 , g x = 12 if  2 < x 5 , g x = x + 1 3 if  x > 5 .

It may be observed that f and g are compatible mappings of type (A), but neither commuting nor compatible mappings. To see this let us consider the sequence { x n } given by x n =5+ 1 n :n>0. Then f x n 2, g x n 2, fg x n =gg x n 12, gf x n =ff x n 2, lim n d(fg x n ,gg x n )= lim n d(ff x n ,gf x n )=0 and lim n d(fg x n ,gf x n )= lim n d(ff x n ,gg x n )0.

Examples 2.21 and 2.22 (below) show that the notions of compatible mappings and compatible of type (A) are independent to each other.

Example 2.22 [81]

Let X=R equipped with the usual metric d. Define self-mappings f and g as follows:

f(x)=xandg(x)= { 0 if  x  is an integer , 1 if  x  is not an integer .

Then for the sequence { x n }=1+ 1 n + 1 we get lim n f x n = lim n g x n =1, lim n d(fg x n ,gf x n )=0, but lim n d(ff x n ,gf x n )0, lim n d(gf x n ,gg x n )0 and lim n d(ff x n ,gg x n )0. Therefore f and g are compatible but not compatible of type (A).

Definition 2.23 (Pant [36])

Two self-mappings f and g of a metric space (X,d) are called R-weakly commuting iff there exists some positive real number R such that d(fgx,gfx)Rd(fx,gx) for all x in X.

Notice that weak commutativity of a pair of self-mappings implies their R-weak commutativity and the converse is true only when R1.

Example 2.24 [36]

Let X=[1,) be endowed with the usual metric. Define f,g:XX by

fx=2x1andgx= x 2 for all xX.

Then d(fgx,gfx)=2d(fx,gx). Thus f and g are R-weakly commuting (R=2) but are not weakly commuting.

Definition 2.25 (Pathak et al. [50])

Two self-mappings f and g of a metric space (X,d) are called:

  1. (i)

    R-weakly commuting of type ( A f ) iff there exists some positive real number R such that d(fgx,ggx)Rd(fx,gx) for all x in X.

  2. (ii)

    R-weakly commuting of type ( A g ) iff there exists some positive real number R such that d(ffx,gfx)Rd(fx,gx) for all x in X.

It may be observed that definition (ii) can be obtained from definition (i) by interchanging the role of f and g. Further, R-weakly commuting pair of self-mappings are independent of R-weakly commuting of type ( A f ) or type ( A g ). Example 2.24 shows that d(fgx,ggx)>Rd(fx,gx) for each x>1 and some R>0 (e.g., say R=4). Thus f and g are R-weakly commuting but not R-weakly commuting of type ( A f ).

The next example shows that f and g are R-weakly commuting of type ( A f ) but not R-weakly commuting mappings.

Example 2.26 [50]

Let X=[1,2] equipped with the usual metric d. Define self-mappings f and g on X as follows:

f(x)= { 1 if  x [ 1 , 1 ] , 3 4 if  x ( 1 , 5 4 ) , 1 + 1 32 x 2 if  x [ 5 4 , 2 ] , g(x)= { 1 + 1 4 x 2 if  x [ 1 , 1 ) , 1 if  x = 1 , 2 if  x ( 1 , 5 4 ) , 1 1 8 x 2 if  x [ 5 4 , 2 ] .

In this example f and g are R-weakly commuting pair ( A f ) for R=6 but not R-weakly commuting mappings [50]. Thus R-weakly commuting mappings and R-weakly commuting of ( A f ) or ( A g ) mappings are independent to each other.

It may be noted that both compatible and noncompatible mappings can be R-weakly commuting of type ( A g ) or ( A f ).

Example 2.27 [82]

Let X=[1,) be endowed with the usual metric. Define f,g:XX by

fx=2x1andgx=3x2for all xX.

Then it can be verified in this example that f and g are compatible. Furthermore, f and g are R-weakly commuting of type ( A f ) with R=3 and R-weakly commuting of type ( A g ) with R=2.

Example 2.28 [8]

Let X=[2,20] and d be the usual metric on X. Define f,g:XX as follows:

f x = 2 if  x = 2  or  x > 5 , f x = 12 if  2 < x 5 , g 2 = 2 , g x = x + 31 3 if  2 < x 5 , g x = x + 1 3 if  x > 5 .

It may be observed that f and g are R-weakly commuting of type ( A g ) since d(gfx,ggx)d(fx,gx) for all xX. To see that f and g are noncompatible, let us consider a sequence { x n } given by x n =5+ 1 n :n>0. Then f x n 2, g x n 2, fg x n 12, gf x n 2, and lim n d(fg x n ,gf x n )0.

Definition 2.29 [83]

Two self-mappings f and g of a metric space (X,d) are called R-weakly commuting of type (P) iff there exists some positive real number R such that d(ffx,ggx)Rd(fx,gx) for all x in X.

The next example depicts when two mappings representing parallel straight lines on the real plane shall be commuting, weakly commuting, R-weakly commuting or analogous definitions of R-weakly commuting mappings.

Example 2.30 [9]

Let X=R equipped with the usual metric d. Define self-mappings f and g as follows:

fx=mx+aandgx=mx+b,ab.

Then d(fgx,gfx)=d(ffx,ggx)=|m1||ab|, d(ffx,gfx)=d(fgx,ggx)=|ab| and d(fx,gx)=|ab|. Thus f and g will be:

  1. (i)

    commuting if m=1,

  2. (ii)

    weakly commuting if 0m2,

  3. (iii)

    R-weakly commuting or R-weakly commuting of type (P) if |m1|1.

Remark 2.31 If f and g are R-weakly commuting or R-weakly commuting ( A f ) or R-weakly commuting of type ( A g ) or R-weakly commuting (P) and if z is their coincidence point, i.e., fz=gz, then we get ffz=fgz=gfz=ggz. Thus at a coincidence point, all the analogous notions of R-weak commutativity including R-weak commutativity are equivalent to each other and imply their commutativity.

Definition 2.32 (Jungck and Pathak [35])

Two self-mappings f and g of a metric space (X,d) are called f-biased iff

α lim n d(f x n ,fg x n )α lim n d(g x n ,gf x n ),

where α lim n stays for lim sup n or lim inf n , whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

Similarly, the definition of g-biased can be obtained from the definition of f-biased by interchanging the role of f and g.

Jungck and Pathak [35] have shown that if f and g are compatible then they are both f-biased and g-biased, but the converse is not true.

Example 2.33 Let X=[0,1] and d be the usual metric on X. Define f,g:XX by

f x = 1 2 x , g x = 2 x for  x [ 0 , 1 2 ] , f x = 0 , g x = 1 for  x ( 1 2 , 1 ] .

Then f and g are both f-biased and g-biased but not compatible.

Definition 2.34 (Jungck and Pathak [35])

Two self-mappings f and g of a metric space (X,d) are called weakly f-biased iff

fx=gximpliesd(fgx,fx)d(gfx,gx).

Clearly, every biased mappings are weakly biased mappings (see Proposition 1.1 in [35]) but the converse is false in general.

Sahu et al. [57] have shown that intimate mappings are more general than compatible mappings.

Definition 2.35 (Sahu et al. [57])

Two self-mappings f and g of a metric space (X,d) are called f-intimate iff

α lim n d(f x n ,fg x n )α lim n d(g x n ,gg x n ),

where α lim n stays for lim sup n or lim inf n , whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

Next example [57] shows that intimate mappings need not be compatible.

Example 2.36 Let X=[0,1] and d be the usual metric on X. Define f,g:XX as follows:

fx= 2 x + 2 andgx= 1 1 + x for x[0,1].

For this let us consider the sequence { x n } given by x n = 1 n :n>0. Then f x n 1, g x n 1 and lim n d(fg x n ,f x n )< lim n d(gg x n ,g x n ), i.e., f and g are f-intimate but lim n d(fg x n ,gf x n )0.

Definition 2.37 (Cho et al. [45])

Two self-mappings f and g of a metric space (X,d) are called semi-compatible iff

  1. (i)

    ft=gt implies fgt=gft;

  2. (ii)

    lim n f x n = lim n g x n =t for some t in X implies lim n d(fg x n ,gt)=0.

It may be noted that semi-compatible mappings need not be compatible mappings.

Example 2.38 [9]

Let X=[2,6] and d be the usual metric on X. Define f,g:XX as follows:

f x = 2 if  x < 3 , f x = 4 if  x = 3 , f x = x + 21 12 if  3 < x 6 , g 2 = 2 , g x = 2 x if  2 < x 3 , g x = 2 x 3 if  3 < x 6 .

Then f and g are semi-compatible, but noncompatible mappings. To see this let us consider a decreasing sequence { x n } given by 3< x n <4 and lim n x n =3. Then f x n 2, g x n 2, fg x n 2=g2, gf x n 4, lim n d(fg x n ,gt)=0, fg2=gf2 and lim n d(fg x n ,gf x n )0.

In 1997, Pathak et al. [49] weakened the notion of compatible of type (A) by splitting it into two parts, namely f-compatible and g-compatible.

Definition 2.39 Two self-mappings f and g of a metric space (X,d) are called f-compatible (Pathak et al. [49]) iff

lim n d(fg x n ,gg x n )=0,

whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

The definition of g-compatible can be obtained from the definition of f-compatible by interchanging the role of f and g.

The following propositions have been proved in [49].

Proposition 2.40 [49]

Let f,g:(X,d)(X,d) be mappings with g continuous. Then f and g are compatible iff they are f-compatible.

Proposition 2.41 [49]

Let f and g be continuous mappings from a metric space (X,d) into itself. Then the following are equivalent:

  1. (i)

    f and g are compatible,

  2. (ii)

    f and g are f-compatible,

  3. (iii)

    f and g are g-compatible.

If f and g are discontinuous mappings then the concepts compatible, f-compatible, g-compatible are independent to each others.

Example 2.42 [49]

Let X=R and d be the usual metric on X. Define f,g:XX as follows:

f x = 1 x 3 if  x 0 , f x = 2 if  x = 0 , g x = 1 x 2 if  x 0 , g x = 1 if  x = 0 .

Then f and g are compatible but not f-compatible nor g-compatible. To see that, let us consider a sequence { x n } given by x n =n. Then f x n 0, g x n 0, lim n d(fg x n ,gf x n )=0 but lim n d(fg x n ,gf x n )= lim n d(fg x n ,gf x n )=, as n.

Example 2.43 [49]

Let X=[0,1] equipped with the usual metric d. Define self-mappings f and g as follows:

f(x)=xandg(x)= { 1 x if  0 x < 1 2 , 1 if  1 2 x 1 .

Then f and g are compatible and g-compatible but not f-compatible.

Example 2.44 [49]

Let X=[0,) and d be the usual metric on X. Define f,g:XX as follows:

f x = x if  0 x < 1 , f x = 2 if  1 x < , g x = 2 x if  0 x < 1 , f x = 2 if  1 x < .

Then f and g are both f-compatible and g-compatible but not compatible.

Definition 2.45 Two self-mappings f and g of a metric space (X,d) are called:

  1. (i)

    compatible of type (P) (Pathak et al. [47, 84, 85]) iff

    lim n d(ff x n ,gg x n )=0,
  2. (ii)

    compatible of type (C) (Singh [58]) iff

    lim n d(ff x n ,gg x n )=0and lim n d(fg x n ,gf x n )=0,

whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

Proposition 2.46 Let f,g:(X,d)(X,d) be mappings. If f and g are either compatible or compatible of type (A) or f-compatible, or g-compatible or compatible of type (P) or compatible of type (C) and fz=gz for some zX then ffz=fgz=gfz=ggz.

Proof Let { x n } be a sequence in X defined by x n =z, nN and fz=gz for some zX. Then we have lim n f x n = lim n g x n =fz=gz. Since f and g are either compatible or compatible of type (A) or f-compatible, or g-compatible or compatible of type (P) or compatible of type (C), we have d(fgz,gfz)= lim n d(fg x n ,gf x n )=0 or d(ffz,gfz)= lim n d(ff x n ,gg x n )=0=d(ggz,gfz)= lim n d(gg x n ,gf x n ) or d(ffz,gfz)= lim n d(ff x n ,gg x n )=0. Therefore, ffz=fgz=gfz=ggz. □

Definition 2.47 Two self-mappings f and g of a metric space (X,d) are called compatible mappings of type (f) (Pathak et al. [48]) iff

lim n d(gf x n ,g x n )+ lim n d(fg x n ,gf x n )= lim n d(fg x n ,f x n ),

whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

In 1996, Jungck generalized the notion of compatible mappings.

Definition 2.48 (Jungck [29], Sastry et al. [55] and Dhage [54], Shrivastava et al. [56])

Two self-maps f and g of a metric space (X,d) are called weakly compatible (partially commuting or coincidentally commuting, compatible type (N)) iff f and g commute on the set of coincidence points.

In 1998, Pant investigated existence of common fixed points for noncompatible mappings and pointwise R-weak commutativity, which he defined in 1994 [36] without giving any name.

Definition 2.49 (Pant [86])

Two self-mappings f and g are called pointwise R-weakly commuting on X iff given x in X there exists R>0 such that d(fgx,gfx)Rd(fx,gx).

It is obvious from the definition that f and g can fail to be pointwise R-weakly commuting only if there exists some x in X such that fx=gx while fgxgfx, i.e., only if they posses a coincidence point at which they do not commute.

Remark 2.50 [9]

Compatible mappings are pointwise R-weakly commuting. To see this, let fx=gx. Consider the constant sequence { x n : x n =x}. Then lim n f x n =fx=gx= lim n g x n =t. Compatibility of f and g implies that lim n d(fg x n ,gf x n )=0, i.e., d(gfx,fgx)=0 or fgx=gfx. However, pointwise R-weakly commuting mappings need not be compatible (see Example 2.52).

Remark 2.51 [9]

Pointwise R-weak commutativity is a necessary condition for the existence of common fixed points of contractive type mapping pairs. Suppose f and g be a contractive type pair of self-mappings of a metric space (X,d) having a common fixed point, say z then z=fz=gz and fgz=gfz=fz=gz=z. If possible, suppose that f and g are not pointwise R-weakly commuting. Then there exists a point w in X such that fw=gw while fgwgfw. We thus have fw=gw and fz=gz with fwfz. This is not possible in view of contractive conditions. For example, if f and g satisfy the contractive condition

d(fx,fy)<max{d(gx,gy),d(fx,gx),d(fy,gy),d(fx,gy),d(fy,gx)}, which is one of the most general contractive conditions, then we get

d(fw,fz)<max{d(gw,gz),d(fw,gw),d(fz,gz),d(fw,gz),d(fz,gw)}=d(fw,fz), a contradiction. This shows that existence of a common fixed point satisfying contractive conditions implies pointwise R-weakly commuting.

(It is also well known that pointwise R-weak commutativity is equivalent to commutativity at coincidence points and in the setting of metric spaces this notion is equivalent to weak compatibility.)

If f and g are compatible or f-compatible or g-compatible or compatible of type (A) then they are obviously weakly compatible but as shown in Example 2.52 converse is not true.

Example 2.52 Let X=R equipped with the usual metric d. Define self-mappings f and g as follows:

f(x)=[x]andg(x)= { 1 if  x 0 , 0 if  0 < x < 2 , 1 if  x 2 ,

where [x] denotes the integral part of x.

Then for the sequence { x n }= 1 n we get lim n f x n = lim n g x n =0 and lim n d(fg x n ,gf x n )0, lim n d(ff x n ,gf x n )0 and lim n d(gf x n ,gg x n )0. Therefore f and g are neither compatible nor f-compatible nor g-compatible nor compatible of type (A) nor compatible of type (P) nor compatible of type (C) but they are weakly compatible as they commute at their coincidence points x=1,1.

In order to obtain new common fixed point theorems, one should be careful to use nontrivial noncommuting conditions. For example see the following result.

In [87] the authors obtained Corollary 2.53 as a particular case of their main theorem (see Theorem 3.1 in [87] and take A=f and S=g):

Corollary 2.53 Let f and g be weakly compatible self-mappings of a complete metric space (X,d) satisfying

  1. (i)

    fXgX;

  2. (ii)

    d(fx,fy)kd(gx,gy), for all x,yX and some 0k<1.

Then f and g have a unique common fixed point in X.

In some cases the condition of completeness mentioned in the above corollary may be replaced by the (E.A.) property besides some condition on the ranges of the involved mappings [55, 70].

Corollary 2.54 Let f and g be weakly compatible self-mappings of a metric space (X,d) satisfying the (E.A.) property, and

  1. (i)

    fXgX;

  2. (ii)

    d(fx,fy)kd(gx,gy), for all x,yX and some 0k<1.

If the range of f or g is a complete subspace of X then f and g have a unique common fixed point in X.

It may be observed that the conclusions of above corollaries are not true. This can be seen from the following counter example [8].

Example 2.55 [8]

Let X=[2,20] and d be the usual metric on X. Define self-mappings f and g on X as follows:

f x = 6 if  2 x 5 , f x = x + 5 5 if  x > 5 , g x = 12 if  2 x 5 , g x = x + 1 3 if  x > 5 .

Then f and g satisfy the following conditions of above corollaries, respectively, but do not have a common fixed point.

  1. (i)

    fX=(2,5]{6}, gX=(2,7]{12} and fXgX;

  2. (ii)

    f and g satisfy a particular contraction condition d(fx,fy) 3 5 d(gx,gy);

  3. (iii)

    f and g are trivially weakly compatible;

  4. (iv)

    f and g are also tangential mappings. To see this let { x n } be the sequence in X given by x n =5+ ϵ n where ϵ n 0 as n. Then lim n f x n = lim n g x n =2.

One can see in Example 2.55 (above) that both the mappings f and g satisfy weak compatibility condition vacuously, yet f and g are common fixed point free mappings. We can redefine the notion of weak compatible mappings in the following way.

Definition 2.56 Two self-mappings f and g of a metric space (X,d) are called nontrivially weakly compatible if they commute on the set of coincidence points whenever the set of their coincidences is nonempty.

Definition 2.57 (Pathak et al. [88])

Two self-mappings f and g of a metric space (X,d) are called compatible of type (I) iff

d(t,gt)lim supd(t,fg x n ),

whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

The following examples show that weakly compatible mappings and compatible mappings of type (I) are independent from each other.

Example 2.58 [88]

Let X=[0,) and d be the usual metric on X. Define f,g:XX by

fx= { cos x if  x 1 , 0 if  x = 1

and

gx= { e x if  x 1 , 0 if  x = 1 .

Then fx=gx iff x=0 and x=1. Also at these points fgx=gfx. It means the mappings f and g are weakly compatible. It can also be noted that f and g not compatible of type (I). To see this, let { x n } be a sequence in X such that f x n t, g x n t. Then for t=1, d(t,gt)>d(t,fg x n ).

Example 2.59 [88]

Let X=[0,1) be endowed with the usual metric. Define f,g:XX by

fx=2x+1andgx= x 2 +1for all xX.

Then at x=0, fx=gx. But fgxgfx, which shows that f and g are not weakly compatible but compatible of type (I). To see this, let { x n } be a sequence in X such that f x n t, g x n t. Then for t=1, d(t,gt)<d(t,fg x n ).

Definition 2.60 (Pathak et al. [51])

Two self-mappings f and g of a metric space (X,d) are called:

  1. (i)

    g-biased of type (A) iff

    α lim n d(g x n ,gg x n )α lim n d(f x n ,fg x n ),

where α lim n stays for lim sup n or lim inf n , whenever { x n } is a sequence in X such that lim n f x n = lim n g x n =t for some t in X.

Definition 2.61 (Pathak et al. [59])

Two self-mappings f and g of a metric space (X,d) are said to be weakly compatible mappings of type (f) with index p at a point x in X iff there exists p>0 such that fx=gx implies

d ( f g x , f x ) p +d ( f g x , g f x ) p d ( g f x , g x ) p .

Definition 2.62 (Fisher and Murthy [53] (see also [89]))

Two self-mappings f and g of a metric space (X,d) are called biased mappings of type ( A f ) iff

fx=gximpliesd(gfx,fx)d(ffx,gx)for some x in X.

Definition 2.63 (Pathak and Tiwari [65])

Let f and g be mappings from a metric space (X,d) into itself. The pair of mappings f, g is said to be ϕ-weakly compatible of type (f,g) at xX, iff for every p>0, fx=gx implies

ϕ ( d ( f g x , f x ) p + 1 + d ( f g x , g f x ) p + 1 d ( f g x , f x ) + d ( f g x , g f x ) ) d ( g f x , g x ) p ,

where ϕ:[0,1)[0,1) is upper semi-continuous, non-decreasing and ϕ(t)<t for all t>0, and d(fgx,fx)+d(fgx,gfx)0.

If ϕ(t)=ht, where 0<h<1, then the pair of mappings (f,g) is said to be h-weakly compatible of type (f,g).

Example 2.64 [65]

Consider X=[0,1) with the Euclidean metric d on X and ϕ(t)= 1 2 t. Define f,g:XX by

fx=1+xandgx=1+2x.

Here for x=0 and p>0, (f,g) is ϕ-weakly compatible of type (f,g) but (f,g) is not ϕ-weakly compatible of type (g,f) for p>1. Moreover the pair (f,g) is neither weakly commuting nor weakly compatible.

In 2008, Al-Thagafi and Shahzad [38] introduced the notion of occasionally weakly compatible (OWC) mappings as a generalization of weakly compatible mappings. While the paper [38] was under review, Jungck and Rhoades [90] used the concept of OWC and proved several results under different contractive conditions. In view of the paper of Bisht and Pant [91], under contractive conditions proving existence of common fixed points by assuming OWC as presented in [90] is equivalent to proving the existence of common fixed points by assuming the existence of common fixed points.

Moreover, it was shown by Dorić et al. in [92] that in the presence of a unique point of coincidence, the OWC condition reduces to weak compatibility. Hence, a lot of generalizations obtained by using the OWC and similar conditions are not real generalizations (see also [9396]).

Definition 2.65 (Al-Thagafi and Shahzad [38])

Two self-mappings f and g of a metric space (X,d) are said to be occasionally weakly compatible (OWC) if fgx=gfx for some xC(f,g).

In [90] Jungck and Rhoades presented the following variant of OWC: Two self-mappings f and g of a metric space (X,d) are said to be occasionally weakly compatible (in the sense of Jungck and Rhoades [90]) if there exists at least one coincidence point at which f and g commute, i.e., if fx=gx for some xX, then fgx=gfx. This definition may be termed as non-trivial OWC mappings.

In [97] Al-Thagafi and Shahzad have shown that if (X,d) is a discrete metric space and C(f,g) then f and g are weakly compatible iff they are weakly commuting.

Remark 2.66 Besides commutativity of the mappings the notion of non-trivial OWC requires the mappings to have a coincidence point and, therefore, imposes a very strong condition on the mappings. By assuming the existence of a coincidence point the notion of non-trivial OWC circumvents the most crucial part of fixed point theorems consisting of constructive procedures yielding coincidence points. Conditions or constructive procedures yielding coincidence points are important parts of fixed point theorems and strong assumptions like non-trivial OWC do not and should not obviate the need for constructive procedures.

Definition 2.67 (Chen and Li [60])

Two self-mappings f and g of metric space (X,d) are said to be Banach operator pair iff the set F(g) is f-invariant, namely f(F(g))F(g).

It is easy to check that the commuting pair (f,g) is a Banach operator pair but the converse is not true in general.

Example 2.68 Let X=[1,) and d be the usual metric on X. Define f,g:XX by

fx= x 3 for all xandgx=3x2for all x.

Then F(g)={1}. Here (f,g) is a Banach operator pair but f and g are not commuting.

Definition 2.69 (Pathak and Hussain [63])

Two self-mappings f and g of a metric space (X,d) are said to be P-operators iff there is a point xX such that

xC(f,g)andd(x,fx)δ ( C ( f , g ) ) ,

where δ(A)=sup{max{d(x,y),d(y,x)}:x,yA} for AX.

Pathak and Hussain [63] have shown by means of an example that OWC mappings are P-operators. If the self-mappings f and g of X are weakly compatible, then g(C(f,g))C(f,g), and hence f and g are P-operators.

Definition 2.70 (Hussain et al. [39])

Two self-mappings f and g of a metric space (X,d) are said to be JH-operators iff there is a point w=fx=gx in PC(f,g) such that d(w,x)δ(PC(f,g)).

Example 2.71 [63]

Consider X=[0,1) with the Euclidean metric d on X. Define f,g:XX by

f x = x 2 and g x = 2 x for all  x 0 , f 0 = g 0 = 1 .

Then C(f,g)={0,2} and PC(f,g)={1,4}. Obviously f and g are P-operators and JH-operators but neither OWC mappings nor weakly compatible mappings. Further note that Ff={1} and g(1)=2F(f), which show that (g,f) is not a Banach operator pair.

Definition 2.72 (Bouhadjera and Djoudi [66], Hussain et al. [39])

Two self-mappings f and g of a metric space (X,d) are said to be occasionally weakly f-biased iff there is a point xX such that fx=gx and d(fgx,fx)d(gfx,gx).

The definition of occasionally weakly g-biased can be obtained from the definition of occasionally weakly f-biased by interchanging the role of f and g.

Bouhadjera and Djoudi [66] have shown that if f and g are OWC mappings then f and g are both occasionally weakly f-biased and g-biased. Hence OWC mappings is a subclass of occasionally weakly biased mappings.

It may be noted that nontrivially (C(f,g)ϕ) weakly f-biased and g-biased mappings, respectively, are occasionally weakly f-biased and g-biased, respectively. However, the reverse implications are not true.

Example 2.73 [66]

Let X=[0,) and d be the usual metric on X. Define f,g:XX as follows:

f x = 4 x 2 if  0 x 1 , f x = 9 x if  1 < x < , g x = 1 if  0 x 1 , g x = 3 x if  1 < x < .

Then we have fx=gx if and only if x=1/2 or x=3 and d(fg( 3 ),f( 3 ))d(gf( 3 ),g( 3 )), that is, the pair {f,g} is occasionally weakly f-biased. But, 3=d(fg( 1 2 ),f( 1 2 ))d(gf( 1 2 ),g( 1 2 )), i.e., the pair {f,g} is not weakly f-biased. Similarly we can show that g-occasionally weakly biased mappings may not be g-weakly biased mappings.

Definition 2.74 (Hussain et al. [39])

Let d:X×X[0,) be a mapping such that d(x,y)=0 iff x=y. Two self-mappings f and g on X are said to be JH-operators iff there is a point w=fx=gx in PC(f,g) such that d(w,x)δ(PC(f,g)) and d(x,w)δ(PC(f,g)) where δ(A)=sup{max{d(x,y),d(y,x)}:x,yA} for AX.

Definition 2.75 (Pathak and Rai [37])

Let d:X×X[0,) be a mapping such that d(x,y)=0 iff x=y. Two self-mappings f and g on X are said to be PD-operator pair if there is a point uX such that uC(f,g) and d(fgu,gfu)δ(PC(f,g)) where δ(A)=sup{max{d(x,y),d(y,x)}:x,yA} for AX.

Example 2.76 [37]

Let X=[0,1] and let d= | x y | 2 be the metric. Define f,g:XX by fx= x 2 and gx= x 2 , for all x0 and f0=g0=1. Since C(f,g)={0,1/2} and PC(f,g)={1,1/4}, diam(C(f,g))=1/4 and diam(PC(f,g))= 9 16 . Clearly, (f,g) is PD-operator pair, but not commuting, not weakly compatible and not OWC.

Definition 2.77 (Pant and Pant [61])

Two self-mappings f and g of a metric space (X,d) are called conditionally commuting if they commute on a nonempty subset of the set of coincidence points whenever the set of their coincidences is nonempty.

Example 2.78 [61]

Let X=[0,1] and d be the usual metric on X. Define self-mappings f and g on X as follows:

f ( x ) = ( 5 4 ( 2 x 1 ) 2 1 4 ) , g ( x ) = 1 x 3 .

Then C(f,g)={1, 1 4 } and fg1gf1. Hence f and g are conditionally commuting but not weakly compatible. Further f and g are noncompatible mappings. To see this let us consider a sequence { x n } given by x n =1 1 n . Then f x n 0, g x n 0, fg x n 0, gf x n 1 3 and lim n d(fg x n ,gf x n )0.

Remark 2.79 In this remark we highlight the difference (in terms of applicability) between the three concepts: weak compatibility, occasionally weak compatibility and conditionally commutativity. A generalized Lipschitz type pair (f,g) of self-mappings of a metric space (X,d) may exhibit any of the conditions: (i) f and g do not possess a coincidence point, (ii) f and g possess coincidence points and commute at each coincidence point, and (iii) f and g possess more than one coincidence points and commute on a proper subset of the set of their coincidence points. The notions of commuting, weak commuting, compatible, pointwise R-weak commuting, or weak compatible mappings apply in conditions (i) and (ii) but do not apply in condition (iii). The notion of non-trivial OWC mappings applies in conditions (ii) and (iii) but does not apply in condition (i) as it presupposes the existence of a coincidence point. The notions of OWC and conditional commutativity are applicable in each of the three conditions mentioned above.

In 2009, Bouhadjera and Godet-Thobie [62] introduced the notion of subcompatibile mappings.

Definition 2.80 (Bouhadjera and Godet-Thobie [62])

Two self-mappings f and g of a metric space (X,d) are called subcompatible iff there exists a sequence { x n } such that lim n f x n = lim n g x n =t and lim n d(fg x n ,gf x n )=0.

Example 2.81 [62]

Let X=[0,) and d be the usual metric on X. Define f,g:XX as follows:

f x = x 2 for all  x X , g x = x + 2 if  0 x 4  and  9 < x < , g x = x + 12 if  4 < x 9 .

Then f and g are subcompatible but not OWC. To see this consider the sequence { x n } given by x n =2+ 1 n . Then f x n 4, g x n 4, fg x n 16, gf x n 16 and lim n d(fg x n ,gf x n )=0. On the other hand, we have fx=gx iff x=2 and fg2gf2, hence mappings f and g are not OWC.

Remark 2.82 Above Example 2.81 shows that subcompatible mappings need not imply commutativity at the coincidence point. It may be observed that subcompatible mappings are independent from the compatible mappings and in the setting of a unique common fixed point (or unique point of coincidence), subcompatibility does not reduce to the class of compatibility. The following examples illustrate these facts.

Example 2.83 Let X=[0,) and d be the usual metric on X. Define f,g:XX by

fx=xfor all xandgx=2xfor all x.

Then f and g are compatible but not subcompatible.

Example 2.84 Let X=[1,8] and d be the usual metric on X. Define f,g:XX as follows:

f x = 2 if  x 2 , f x = 6 if  x > 2 , g x = 6 2 x if  x 2 , g x = 8 if  x > 2 .

It may be observed that f and g are subcompatible mappings. To see that f and g are subcompatible, let us consider the constant sequence { x n } given by x n =2. Then f x n 2, g x n 2, fg x n 2, gf x n 2, and lim n d(fg x n ,gf x n )=0. Further, if we consider { y n } given by y n =2 1 n :n>0, then f y n 2, g y n 2, and lim n d(fg y n ,gf y n )0. Thus f and g are subcompatible but not compatible.

Remark 2.85 The notion of subcompatibility imposes a strong condition on the mappings f and g by requiring the existence of a sequence { x n } such that f x n t, g x n t. Such a precondition is not required in order that f and g be compatible. In [40] Pant and Bisht introduced the notion of conditional compatibility which does not require such a precondition and yet is a proper generalization of both nontrivial compatibility and subcompatibility.

Definition 2.86 (Pant and Bisht [40])

Two self-mappings f and g of a metric space (X,d) are called conditionally compatible if and only if whenever the set of sequences { x n } satisfying lim n f x n = lim n g x n is nonempty, there exists a sequence { y n } such that lim n f y n = lim n g y n =t (say) and lim n d(fg y n ,gf y n )=0.

In [67], Pant and Bisht introduced a new notion of pseudo compatible mappings, which is a stronger version of conditionally compatible mappings.

Let f, g be self-mappings of a metric space (X,d). Then for a sequence { y n } in X satisfying lim n f x n = lim n g y n , a sequence { z n } is called an associated sequence if f y n =g z n or g y n =f z n and lim n f z n = lim n g z n .

Definition 2.87 (Pant and Bisht [67])

Two self-mappings f and g of a metric space (X,d) are called pseudo compatible iff whenever the set of sequences { x n } satisfying lim n f x n = lim n g x n is nonempty, there exists a sequence { y n } such that lim n f y n = lim n g y n =t (say), lim n d(fg y n ,gf y n )=0 and lim n d(fg z n ,gf z n )=0 for any associated sequence { z n } of { y n }.

Suzuki and Pathak [64] also extended the class of compatible type mappings and several analogous notions to almost compatible mappings and analogous notions, respectively.

Definition 2.88 Two self-mappings f and g of a metric space (X,d) are called to be almost compatible iff f and g are compatible and the following hold for every sequence { x n } in X:

(C1) f x n + 1 =g x n for nN.

(C2) {f x n } converges.

(C3) {gf x n } is bounded.

In 2013, Bisht and Shahzad [41] redefined the notion of conditionally compatible mappings by faintly compatible mappings.

Definition 2.89 (Bisht and Shahzad [41])

Two self-mappings f and g of a metric space (X,d) are called to be faintly compatible iff f and g are conditionally compatible and f and g commute at the subset of coincidence points, whenever the set of coincidence points is nonempty.

Example 2.90 Let X=[0,1] and d be the usual metric on X. Define self-mappings f and g on X as follows:

f ( x ) = 1 2 | 1 2 x | , g ( x ) = 2 3 ( 1 x ) .

Then f and g are faintly compatible but neither compatible nor weakly compatible.

Remark 2.91 In recent works several authors claimed to introduce some weaker noncommuting notions and pretended to show, weak compatibility as a proper subclass of their weaker notions. This is, however, not true. In view of the results of Dorić et al. [92] (see also Alghamdi et al. [94], Kadelburg et al. [96], Pant and Bisht [40] and Bisht and Rakocević [95]) most of the generalized commutativity notions fall in the subclass of weak compatibility in the setting of a unique common fixed point (or unique point of coincidence).

The following lemma was presented by Abbas and Jungck [98].

Lemma 2.92 [98]

If a weakly compatible (WC) pair (f,g) of self-mappings on X has a unique POC, then it has a unique common fixed point.

Jungck and Rhoades [90] established the following lemma.

Lemma 2.93 [90]

If an OWC pair (f,g) of self-mappings on X has a unique POC, then it has a unique common fixed point.

The following result is due to Dorić et al. [92].

Proposition 2.94 [92]

Let a pair of mappings (f,g) have a unique POC. Then it is WC if and only if it is OWC.

Proposition 2.95 [94]

Let d:X×X[0,) be a mapping such that d(x,y)=0 if and only if x=y. Let a pair of mappings (f,g) have a unique POC. If it is a pair of JH-operators, then it is WC.

Proposition 2.96 [94]

Let d be symmetric on X. Let a pair of mappings (f,g) have a unique POC which belongs to F(f). If it is a pair of occasionally weakly g-biased mappings, then it is WC.

Proposition 2.97 [94]

Let d be symmetric on X, and let a pair of mappings (f,g) have a unique CP, that is, C(f,g) is a singleton. If (f,g) is P-operator pair, then it is WC.

Proposition 2.98 [94]

Let d be symmetric on X, and let a pair of mappings (f,g) have a unique POC. Then it is weakly g-biased if and only if it is occasionally weakly g-biased.

Proposition 2.99 [95]

Let d:X×X[0,) be a mapping such that d(x,y)=0 if and only if x=y. Let a pair of mappings (f,g) have a unique POC. If it is a pair of PD-operators, then it is WC.

Let ϕ: R + R + be a non-decreasing function satisfying the condition ϕ(t)<t, for each t>0.

Proposition 2.100 [95]

Let d:X×X[0,) be a mapping such that d(x,y)=0 if and only if x=y. Suppose (f,g) is PD-operator pair and satisfy the condition:

d(fx,fy)ϕ ( max { d ( g x , g y ) , d ( g x , f y ) , d ( f x , g y ) , d ( g y , f y ) } )
(2.1)

for each x,yX. Then f and g are WC.

Theorem 2.101 [95]

Under the contractive condition (2.1) assumed in the above proposition, the assumption of PD-operators and the existence of a unique common fixed point are equivalent conditions.

More recently, Kadelburg et al. [96] have shown that some of noncommuting conditions which are formally distinct from each other, actually coincide in the case when the given mappings have a unique point of coincidence. Hence, many new common fixed point results cannot be incurred in this way. The following proposition was proved in [96].

Proposition 2.102 Let (X,d) be a metric space, and let f,g:XX. Let the pair (f,g) have exactly one point of coincidence. Then the noncommuting conditions weakly compatible, occasionally weakly compatible, conditionally commuting and PD-operators are equivalent, and equivalent with the condition that the pair (f,g) has a unique common fixed point.

Remark 2.103 It is important to note that majority of the noncommuting conditions before weak compatibility do not presume the existence of a coincidence point but actually establish the existence of a coincidence point by using these conditions. In fact, it can easily be established that some of these conditions, e.g., weakly commuting etc. not only imply commutativity at coincidence points but in combination with other sufficient conditions also imply the existence of the coincidence point. Thus we can say that with the inception of the definition of non-trivial OWC mappings more focus would be given to those noncommuting conditions which directly assume the existence of coincidence point, which is relatively strong condition in comparison to weakly compatible mappings.

Remark 2.104 If there are just two mappings involved, and they only have one coincidence point (which turns out to be the unique fixed point), then, of course, most of the generalizations of commutativity coincide with weak compatibility. Recently, Pant and Bisht [40] (see also [91, 95]) have shown that under contractive conditions proving existence of common fixed points by assuming several weaker noncommuting notions is equivalent to proving the existence of common fixed points by assuming the existence of common fixed points. Hence such type of results are merely redundant exercises.

3 Applications

Fixed point theory has played central role in the problems of nonlinear analysis. Common fixed point theorems have provided powerful tools in demonstrating the existence solutions to large variety of problem in applied mathematics. In this section we give some of the areas where common fixed point theorems are applicable.

3.1 Applications in differential equations

In [5] Goebel gave a nice application of the coincidence theorem (Theorem 1.1) for the solution of differential equation. He considered the following differential equation:

x ˙ =s(t,x)

(cf. [99]). Suppose that the function {s(t,x)} is defined in the half plane t0, <x<+ and satisfies Caratheodory’s conditions (cf. [100]) and Lipschitz inequality

|s(t,x)s(t,y)|L(t)|xy|,

where {L(t)} is locally integrable on the interval 0,).

If 0 t s(τ,0)dτ=O(exp 0 t L(τ)dτ) and p>1 then the transformations f and g defined by

( f x ) ( t ) = { 0 t s ( τ , x ( τ ) ) d τ + ξ } exp { p 0 t L ( τ ) d τ } , ( g x ) ( t ) = x ( t ) exp { p 0 t L ( τ ) d τ }

mappings the set A=[{x(t)}:x(t)=O(exp 0 t L(τ)dτ)] into the Banach space B of continuous functions on 0,) with the norm |x|= sup 0 , ) |x(t)|, then Theorem 1.1 assures that there exists a function { x ¯ (t)}A which satisfies f x ¯ = g x ¯ and x ¯ (t) = 0 t s(τ, x ¯ (τ))dτ+ξ is the unique solution in the sense of Caratheodory [100] with the initial condition x ¯ (0)=ξ for every ξ.

3.2 Applications in approximation theory

Fixed point theorems have been extensively used in the existence and uniqueness of invariant approximations. In 1963, Meinardus [101] utilized the Schauder fixed point theorem [102] to prove the very first result regarding invariant approximation. Afterwards, Brosowski [103] and Subrahmanyam [104] generalized the result of Meinardus under different settings. Further significant contribution in this area was made by a number of authors. They all considered one mapping or a pair of commuting mappings to show the existence of invariant approximation. In 1998, the study of invariant approximations for noncommuting mappings was initiated by Shahzad [105] (see also [106, 107]). Since then this area has been flourished further and many interesting results appeared for noncommuting mappings.

Let D be a nonempty subset of a normed space X, f and g self-mappings of D, and F(f) (respectively F(g)) the set of fixed points of f (respectively g). The self-mapping g is called:

  1. (i)

    f-contraction if gxgykfxfy for all x,yD and some k[0,1);

  2. (ii)

    f-nonexpansive if gxgyfxfy for all x,yD;

  3. (iii)

    nonexpansive if gxgyxy for all x,yD.

For pX, let δ(p,D):= inf z D zp. The set D is called:

  1. (iv)

    q-starshaped if kx+(1k)qD for all xD and all k[0,1];

  2. (v)

    convex if kx+(1k)yD for all x,yD and all k[0,1].

The self-mapping f is called:

  1. (vi)

    affine if D is convex and f(kx+(1k)y)=kfx+(1k)fy for all x,yD and all k[0,1];

  2. (vii)

    q-affine if D is q-starshaped and f(kx+(1k)q)=kfx+(1k)q for all xD and all k[0,1].

Note that fq=q whenever f is a q-affine self-mapping of a q-starshaped set D.

  1. (viii)

    R-subweakly commuting (w.r.t. q) [107] if D is q-starshaped with qF(f) and gfxfgxRδ(fx,[gx,q]) for all xD and some R>0;

  2. (ix)

    R-subcommuting (w.r.t. q) [106, 108] if D is q-starshaped with qF(f) and gfxfgx R k kgx+(1k)qfx for all xD, k(0,1] and some R>0.

In fact, R-subcommutativity (w.r.t. q) is equivalent to gfxfgxRδ(fx,[gx,q)) for all xD and some R>0. Hence, R-subweak commutativity implies R-subcommutativity. However, R-subweak commutativity is implied by R-subcommutativity whenever δ(fx,[gx,q))=δ(fx,[gx,q]) (for more details see [108]).

Let D be a q-starshaped subset of a normed space X, f and g self-maps of D with qF(f), and C q (f,g):={C(f, g k ):0k1} where g k x:=kgx+(1k)q. The self-mappings f and g are called C q -commuting [108] if fgx=gfx for all x C q (f,g). Clearly, C q -commuting self-mappings are weakly compatible. In general, the converse does not hold as the following example shows.

Example 3.1 [108]

Let X=R with the usual norm and D=[0,). Define f,g:DD by

f(x)=2xandg(x)= { x 2 if  x 2 , 1 if  x = 2 .

Then D is q-starshaped with q=0, C(f,g)={0} and C q (f,g)={0}[2,). Moreover, f and g are weakly compatible but not C q -commuting.

Note that R-subweakly commuting and R-subcommuting self-mappings are C q -commuting, but the converse does not hold in general. The following two examples show that C q -commuting and R-weakly commuting self-mappings are different classes.

Example 3.2 [108]

Let X=R with the usual norm and D=[0,). Define f,g:DD by

f x = x / 2 if  0 x < 1 , f x = x if  x 1 , g x = 1 / 2 if  0 x < 1 , g x = x 2 if  x 1 .

Then D is q-starshaped with q=1 and C q (f,g)=[1,). Moreover, f and g are C q -commuting but not R-weakly commuting for all R>0. Hence, f and g are neither R-subweakly commuting nor R-subcommuting.

Example 3.3 [108]

Let X=R with the usual norm and D=[1,). Define f,g:DD by

fx=2x1andgx= x 2 for all xD.

Then D is q-starshaped with q=1 and C q (f,g)=[1,). Moreover, f and g are R-weakly commuting with R=2 (see [36]) but not C q -commuting.

For a nonempty subset M of X and pX, let B M (p):={xM:xp=δ(p,M)}, C M I (p):={xM:Ix B M (p)} and M p :={xM:x2p}. The set B M (p) is called the set of best M-approximants to p. Let C 0 (respectively C 0 w ) denote the class of closed (respectively weakly closed) convex subsets of X containing 0. Note that B M (p) M p C 0 whenever M C 0 . A self-mapping g:XX is said to be compact on M if whenever A is a nonempty bounded subset of M, then g ( A ) ¯ is compact. A mapping h:DX is said to be demiclosed at yX if whenever { x n } is a sequence in D such that x n zD weakly and h x n y strongly, then hz=y. A Banach space X is said to satisfy Opial’s condition if whenever { x n } is a sequence in X such that x n zX weakly, then

lim inf n x n z< lim inf n x n x

holds for all xz. Note that Hilbert and l p (1<p<) spaces satisfy Opial’s condition.

In 1969, Brosowski [103] proved the following result.

Theorem 3.4 Let f be a contractive linear operator on a normed linear space X. Let M be an f-invariant subset of X and p an f-invariant point. If the set of best M-approximants to p, i.e., B M (p) is nonempty, compact, and convex, then it contains an f-invariant point.

In [104] Subrahmanyam superseded the necessity of nonemptyness of B M (p) by the assumption that M is a finite-dimensional subspace of X.

Theorem 3.5 (Subrahmanyam [104])

Let X be a normed space, f a nonexpansive self-mapping of X, M a nonempty subset of X, f(M)M, and pF(f). Then F(f) B M (p) is nonempty provided M is a finite-dimensional subspace of X.

In 1979, Singh [109] demonstrated that the Brosowski [103] result remains true if linearity of the operator f is dropped and convexity is replaced by starshaped property. Singh’s [110] result remains true when contractive nature of f is replaced by nonexpansiveness of f on B M (p){p}.

Theorem 3.6 (Singh [110])

Let f be a contractive operator on a normed linear space X. Let f(M)M and pF(f). If B M (p) is nonempty, compact, and starshaped, then it contains an f-invariant point.

Hicks and Humphries [111] observed that Theorem 5.6 of Singh is also true if the assumption f(M)M is replaced by f(M)M, where ∂M denotes the boundary of M.

Theorem 3.7 (Hicks and Humphries [111])

Let f be a contractive operator on a normed linear space X. Let f(M)M and pF(f). If B M (p) is nonempty, compact, and starshaped, then it contains an f-invariant point.

Smoluk [112] observed that the finite-dimensionality of M in Subrahmanyam’s result can be replaced by the assumptions that f is linear and that f ( D ) ¯ is compact for every bounded subset D of M.

Theorem 3.8 (Smoluk [112])

Let X be a normed space, f a nonexpansive self-mapping of X, M a nonempty subset of X, f(M)M, and pF(f). Then F(f) B M (p) is nonempty provided f is linear, M is a closed subspace of X, and f is compact on M.

Habiniak [113] dropped the linearity of f from Smoluk’s result (see also [114]).

Theorem 3.9 (Habiniak [113])

Let X be a normed space, f a nonexpansive self-mapping of X, M a nonempty subset of X, f(M)M, and pF(f). Then F(f) B M (p) is nonempty provided M is a closed subspace of X and f is compact on M.

Following [108, 115], we summarize above invariant approximation results as follows.

Theorem 3.10 Let X be a normed space, f a nonexpansive self-mapping of X, M a nonempty subset of X and pF(f). Then F(f) B M (p) is nonempty provided one of the following conditions is satisfied:

  1. (a)

    f is linear, f(M)M and B M (p) is nonempty, compact, and convex (Brosowski [103]),

  2. (b)

    f(M)M and M is a finite-dimensional subspace of X (Subrahmanyam [104]),

  3. (c)

    f(M)M, B M (p) is compact and q-starshaped (Singh [110]),

  4. (d)

    f(M)M, B M (p) is compact and q-starshaped (Hicks and Humphries [111]),

  5. (e)

    f(M)M, f is linear, M is a closed subspace of X, and f is compact on M (Smoluk [112]),

  6. (f)

    f(M)M, M is a closed subspace of X and f is compact on M (Habiniak [113]).

In 1988, Sahab et al. [116] initiated the study of approximation results for a pair of self-mappings and extended the results of Hicks and Humphries [111] and Singh [110] to commuting mappings.

Theorem 3.11 (Sahab et al. [116], see also O’Regan and Shahzad [115])

Let f and g be self-mappings of a normed space X, MX such that f(M)M, and pF(f,g). Suppose f is g-nonexpansive on B M (p){p}, g is linear and continuous on B M (p), and f and g are commuting on B M (p). If B M (p) is nonempty, compact, and q-starshaped with qF(g), and if g( B M (p))= B M (p), then B M (p)F(f,g) is nonempty.

In 1995, Jungck and Sessa [117] proved the following theorem in best approximation theory, which improves and extends several theorems summarized in Theorem 3.10.

Theorem 3.12 (Jungck and Sessa [117])

Let f and g be self-mappings of a Banach space X, MX such that f(M)M, and pF(f,g). Suppose f is g-nonexpansive on B M (p){p}, g is affine and continuous in the weak topology on B M (p), and f and g are commuting on B M (p). If B M (p) is nonempty, q-starshaped with qF(g), and g( B M (p))= B M (p), then B M (p)F(f,g) is nonempty, provided either (i) B M (p) is weakly compact, and gf is demiclosed; or (ii) B M (p) is weakly compact and X satisfies Opial’s condition.

The following results of Al-Thagafi and Shahzad [108] extend parts (a), (b), (c), and (d) of Theorem 3.10, results of Sahab et al. [116], Singh [109], and Jungck and Sessa [117].

Theorem 3.13 (Al-Thagafi and Shahzad [108])

Let X be a normed space, f and g self-maps of X with pF(f,g), and MX with f(MM)M. Suppose that B M (p) is closed and q-starshaped, f and g are C q -commuting on B M (p), g( B M (p))= B M (p), g is q-affine on B M (p), f is continuous on B M (p) and g-nonexpansive on B M (p){p}, and f ( B M ( p ) ) ¯ is compact. Then B M (p)F(f,g) is nonempty.

Theorem 3.14 (Al-Thagafi and Shahzad [108])

Let X be a Banach space, f and g self-maps of X with pF(f,g), and MX with f(MM)M. Suppose that B M (p) is weakly closed and q-starshaped, g( B M (p))= B M (p), g is q-affine and weakly continuous on B M (p), f and g are C q -commuting on B M (p), f is g-nonexpansive on B M (p){p}, f ( B M ( p ) ) ¯ w is weakly compact, and either gf is demiclosed at zero, or X satisfies Opial’s condition. Then B M (p)F(f,g) is nonempty.

The following results of Al-Thagafi and Shahzad extend parts (e) and (f) of Theorem 3.10, results of Al-Thagafi [118] and Shahzad [107].

Theorem 3.15 (Al-Thagafi and Shahzad [108])

Let X be a normed space, f and g selfmaps of X with pF(f,g), and M C 0 with f( M p )g(M)M. Suppose that gxp=xp for all xM, f is g-nonexpansive on M p {p}, and g ( M p ) ¯ is compact. Then B M (p) is nonempty, closed, and convex and f( B M (p))g( B M (p)) B M (p). If, in addition, g is nonexpansive on B M (p), then B M (p)F(g) and B M (p)F(f) are nonempty. If, for some q B M (p), g is q-affine, f and g are C q -commuting on B M (p), and f ( B M ( p ) ) ¯ g( B M (p)), then B M (p)F(f,g) is nonempty.

Theorem 3.16 (Al-Thagafi and Shahzad [108])

Let X be a normed space, f and g selfmaps of X with pF(f,g), and M C 0 with f( M p )g(M)M. Suppose that gxp=xp for all xM, f is g-nonexpansive on M p {p}, and f ( M p ) ¯ is compact. Then B M (p) is nonempty, closed, and convex and f( B M (p))g( B M (p)) B M (p). If, in addition, f is nonexpansive on B M (p), then B M (p)F(f) is nonempty. If, for some q B M (p), g is q-affine, f and g are C q -commuting on B M (p), and f ( B M ( p ) ) ¯ g( B M (p)), then B M (p)F(f,g) is nonempty.

Several other approximation results including invariant approximations results for starshaped sets and convex sets can be found in [38, 60, 105108, 115, 119129].

Some applications of the fixed point theorems to best simultaneous approximation are given in [130136]. Some other applications of approximation theory can be found in [119, 121, 132, 137140].

3.3 Several other applications

Several authors, have used common fixed point techniques, to obtain the existence and uniqueness of common solutions for certain class of the functional equations arise in dynamic programming [37, 47, 73, 82, 141]. The solutions of variational inequalities arise in the two point obstacle problem, and they have been studied by several authors as an application of several common fixed point theorems [37, 48, 59, 141]. Common fixed point theorems have also been utilized to find solutions of nonlinear integral equations [88, 142, 143] and continuous solutions for nonlinear integral inclusions [144].