1 Introduction and preliminaries

The classical results of Banach [1] (see also [2]) and Edelstein [3] have been the inspiration for many researchers working in the area of metric fixed point theory. In 1976, Jungck [4] generalized the Banach contraction principle by introducing the idea of commuting maps and settled the historical open problem that a pair of commuting and continuous self-mappings on the unit interval [0,1] need not have a common fixed point [5, 6]. This result of Jungck [4] made foundation to study and investigate common fixed points and their applications in various other branches of mathematical sciences in the last five decades. Since then many fixed point theorists have attempted to find weaker forms of commutativity and continuity that may ensure the existence of a common fixed point for a pair of self-mappings on a metric space. Systematic observations and comparison of commutativity-type mappings are available in [7].

Proving a common fixed point for mappings satisfying Banach-type contractive conditions involves the following steps: step one is to show that there exists a Cauchy sequence which converges to a point in X (where X is complete); the second step is to show the existence of a coincidence point by assuming suitable weaker forms of commutativity and continuity conditions; and step three automatically gives rise to the fact that this coincidence point is a unique common fixed point due to the contractive condition. Observing carefully step two, one finds that showing the existence of a coincidence point for involved maps is nothing but assuming the existence of a coincidence point itself by a suitable choice of weaker forms of commutativity and continuity conditions (see, for instance, [816]).

Keeping the above facts in mind, Jungck and Rhoades [17] utilized the notion of occasionally weakly compatible maps introduced in [18] (as a generalization of weakly compatible maps) for those pairs which do have at least one coincidence point where the maps commute (it is well known that a pair of maps without a coincidence point is always vacuously weakly compatible) and obtained fixed point theorems for such maps.

On the other hand, Singh and Mishra in [19] illustrated a technique to prove the existence of a coincidence point without assuming continuity and commutativity-type conditions. Whereas the result of Suzuki and Pathak [20] does not involve any continuity-type conditions to prove the existence of a coincidence point as well as a common fixed point for a pair of maps (but they used weaker forms of commutativity conditions). It is also worth mentioning that Suzuki and Pathak [20] did not provide any illustrative examples to discuss and highlight the above facts. It is also important to note that none of the results of Jungck [9], Singh and Mishra [19] and Suzuki and Pathak [20] can be obtained from each other due to their different characteristics. These facts are illustrated in this paper via Example 2.6 (p.10).

Motivated by the works of Jungck and Rhoades [17], Bouhadjera and Thobie [21] (respectively Hussain et al. [22] and Sintunavarat and Kumam [23]) introduced the notion of subcompatible maps (respectively the notions of occasionally weakly JH operator and occasionally weakly biased maps) as generalization of occasionally weakly compatible maps and obtained fixed point theorems for such maps. However, Dorić et al. in [24] (respectively Alghamdi et al. [25]) showed that in the event of a pair of single-valued maps, the notion of occasionally weakly compatible (respectively occasionally weakly JH operator and occasionally weakly biased maps) reduces to weak compatibility due to the unique coincidence point of the involved maps, which is always ensured by underlying contractive conditions. Hence weak compatibility remains the minimal commutativity condition for the existence of a common fixed point for a contractive pair of maps. In view of these, the various results for occasionally weakly compatible maps (occasionally weakly JH operator and occasionally weakly biased maps) obtained in [17, 21, 22, 2630], which were used under contractive conditions, do not yield real generalizations (see also [31, 32]). Considering these facts, Pant and Pant [33] (see also [34]) redefined the concept of occasionally weakly compatibility by introducing the idea of conditionally commuting maps which constitute a proper setting in the context of studying non-unique common fixed points for a pair of maps.

Possibly the first common fixed point theorem (respectively fixed point theorem) without any continuity requirement was established by Pant [12, 35] when he introduced the idea of noncompatible and reciprocal continuous maps. (However, the origin of metric fixed point theory for a single mapping without continuity requirement can be traced back to Kannan [36].) Recently, Pant et al. [37] and Pant and Bisht [38] generalized the notion of reciprocal continuity by introducing weak reciprocal continuity and conditionally reciprocal continuity and utilized the same to obtain some common fixed point theorems. In this connection, the recent paper of Gopal et al. [39] is also readable.

Motivated by the results of Pant and Bisht [38, 40], we introduce the concept of conditionally sequential absorbing and pseudo-reciprocal continuous maps, which allows us to give a comparative study of various types of commutativity conditions (e.g., compatible, weakly compatible, occasionally weakly compatible, conditionally commuting, pseudo-compatible) and continuity-type conditions (e.g., reciprocal, weak reciprocal, g-reciprocal, conditionally reciprocal, subsequential and sequential continuity of type ( A g ) and ( A f )) with these newly introduced notions in the context of existence of common fixed points of a pair of maps.

The following relevant known definitions (and results) will be needed in our subsequent discussion. A pair (f,g) of self-mappings defined on a metric space (X,d) is said to be

  1. (i)

    compatible [9] 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.

    It is clear from the above definition that f and g will be noncompatible [35] if there exists a sequence { x n } in X such that lim n f x n = lim n g x n =t for some t in X, but lim n d(fg x n ,gf x n ) is either nonzero or non-existent;

  2. (ii)

    f-compatible [41] if 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;

  3. (iii)

    g-compatible [41] if lim n (ff 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;

  4. (iv)

    weakly compatible [42] if the mappings commute at their coincidence points, i.e., fx=gx for some xX implies fgx=gfx;

  5. (v)

    occasionally weakly compatible [17] if there exists a point x in X that is a coincidence point of f and g at which f and g commute;

  6. (vi)

    subcompatible [21] iff there exists a sequence { x n } in X such that lim n d(fg x n ,gf x n )=0 with lim n f x n = lim n g x n =t for some tX;

  7. (vii)

    conditionally commuting [33] if they commute on a nonempty subset of the set of coincidence points whenever the set of their coincidence point is nonempty;

  8. (viii)

    conditionally compatible [34] 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) and lim n d(fg y n ,gf y n )=0;

  9. (ix)

    pseudo-compatible [40] 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 }.

We also recall that a pair (f,g) of self-mappings defined on a metric space (X,d) is said to be

  1. (i)

    reciprocally continuous [12, 43] iff lim n fg x n =ft and lim n gf x n =gt 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;

  2. (ii)

    weakly reciprocally continuous [37] if lim n fg x n =ft or lim n gf x n =gt 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;

  3. (iii)

    conditionally reciprocally continuous (CRC) [38] 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 } satisfying lim n f y n = lim n g y n =t (say) such that lim n fg y n =ft and lim n gf y n =gt;

  4. (iv)

    g-reciprocally continuous [40] iff lim n ff x n =ft and lim n gf x n =gt whenever { x n } is a sequence such that lim n f x n = lim n g x n =t for some t in X;

  5. (v)

    sequentially continuous of type ( A g ) [39] iff there exists a sequence { x n } in X such that lim n f x n = lim n g x n =t for some tX satisfying lim n ff x n =ft and lim n gf x n =gt;

  6. (vi)

    sequentially continuous of type ( A f ) [39] iff there exists a sequence { x n } in X such that lim n f x n = lim n g x n =t for some tX satisfying lim n fg x n =ft and lim n gg x n =gt;

  7. (vii)

    subsequentially continuous [21] iff there exists a sequence x n in X such that lim n fg x n =ft and lim n gf x n =gt with lim n f x n = lim n g x n =t for some tX.

Theorem 1.1 [40]

Let f and g be g-reciprocally continuous self-mappings of a complete metric space (X,d) such that

  1. (i)

    fXgX;

  2. (ii)

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

If f and g are pseudo-compatible, then f and g have a unique common fixed point.

Theorem 1.2 [40]

Let f and g be g-reciprocally continuous noncompatible self-mappings of a metric space (X,d) such that

  1. (i)

    fXgX;

  2. (ii)

    d(fx,fy)<max{d(gx,gy), k [ d ( f x , g x ) + d ( f y , g y ) ] 2 , d ( f x , g y ) + d ( f y , g x ) 2 }, where 1k<2;

  3. (iii)

    d(x,fx)max{d(x,gx),d(fx,gx)},

whenever the right-hand side is nonzero. If f and g are pseudo-compatible, then f and g have a unique common fixed point.

Theorem 1.3 [34]

Let f and g be conditionally compatible self-mappings of a metric space (X,d) satisfying

d(x,gx)max { d ( x , f x ) , d ( g x , f x ) } ,

whenever the right-hand side is nonzero. If f and g are noncompatible and reciprocally continuous, then f and g have a common fixed point.

Theorem 1.4 [38]

Let f and g be conditionally reciprocal continuous self-mappings of a complete metric space (X,d) such that

  1. (i)

    fXgX;

  2. (ii)

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

If f and g are either compatible or g-compatible or f-compatible, then f and g have a unique common fixed point.

Theorem 1.5 [44]

Let (X,d) be a complete metric space, let f and g be two noncompatible self-mappings on X satisfying

d(fx,fy)φ ( d ( g x , g y ) ) for all x,yX,

where φ:[0,)[0,) is a continuous from right and nondecreasing function such that φ(t)<t for all t>0. Assume that

  1. (i)

    f ( X ) ¯ g(X),

  2. (ii)

    max{d(ggx,fgx),d(ffx,gfx)}φ(d(fx,gx)) for all xX and

  3. (iii)

    φ(d(fx, f 2 x))φ(max{d(gx,gfx),d( g 2 x,gfx),d(fx,gx),d( f 2 x,gfx),d(fx,gfx),d(gx, f 2 x)}), whenever fx f 2 x.

Then f and g have a unique common fixed point. Also, f and g are discontinuous at the common fixed point.

2 Main results

We begin with the following example.

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

fx= { x + 2 if  x ( 2 , 3 ] , 5 otherwise , gx= { 2 x if  x ( 2 , 3 ] , 20 otherwise .

Then we can see that f(X)=(4,5](4,6]{20}=g(X) and the pair (f,g) is g-reciprocally continuous. It can be verified that d(fx,fy)kd(gx,gy) for all x,yX with k= 1 2 . Thus, f and g satisfy all the conditions of Theorem 1.1 except pseudo-compatibility. For the pseudo-compatibility, consider the only existent sequence x n = y n =2+ 1 n , then we have lim n f y n = lim n g y n =4, but lim n fg y n = lim n f(4+ 2 n )=5, lim n gf y n = lim n (4+ 1 n )=20, and so lim n d(fg y n ,gf y n )=150. Also note that the pair (f,g) is not compatible. Here, (f,g) has no coincidence point therefore it is also not an occasionally weakly compatible but vacuously weakly compatible pair.

This suggests that pseudo-compatible is stronger than weakly compatible (and occasionally weakly compatible) in the context of Theorem 1.1 (such an observation is missing in [40]).

The above example motivated us to define the following.

Definition 2.1 Two self-mappings f and g of a metric space (X,d) are called conditionally sequential absorbing 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 } satisfying lim n f y n = lim n g y n =t (say) such that lim n d(f y n ,fg y n )=0 and lim n d(g y n ,gf y n )=0.

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

fx= { 2 if  x = 2  or  x > 5 , 6 if  x ( 2 , 5 ] , gx= { 2 if  x = 2 , 2 x if  x ( 2 , 5 ] , x + 1 3 if  x > 5 .

Then the maps are conditionally sequential absorbing. To view this, consider the constant sequence x n =2. However, the pair (f,g) is not weakly compatible as they do not commute at their coincidence point x=3. It may be noted that x=2 and x=3 are two coincidence points of f and g. But in respect of the unique coincidence point (common fixed point), conditionally sequential absorbing always implies weakly compatible and hence occasionally weakly compatible and pseudo-compatible, because the maps naturally commute at their unique coincidence point (common fixed point).

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

fx=1xandgx= ( 1 x ) 2 for all xX.

Then f and g are weakly compatible but not conditionally sequential absorbing. Here, x=0 and x=1 are two coincidence points.

Remark 2.1 In Example 2.1, the pair (f,g) is vacuously weakly compatible but not conditionally sequential absorbing and not pseudo-compatible. Note that f and g do not have any coincidence point. In Example 2.2, the pair (f,g) is conditionally sequential absorbing but not weakly compatible. In Example 2.3, the pair (f,g) is weakly compatible but not conditionally sequential absorbing.

Thus, as definitions, weakly compatible, pseudo-compatible and conditionally sequential absorbing are very different. However, in the context of a unique coincidence point, conditionally sequential absorbing is stronger than weakly compatible, which will be shown in our Example 2.6.

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

fx= { x 3 if  x [ 0 , 1 ] , 2 x 1 if  x > 1 , gx= { x 2 if  x [ 0 , 1 ] , 3 x 2 if  x > 1 .

Let us consider the sequence x n = 1 n for n=1,2, . Then

lim n f x n = lim n 1 3 n = 0 , lim n g x n = lim n 1 2 n = 0 , lim n f g x n = lim n 1 6 n = 0 = f ( 0 ) , lim n g f x n = lim n 1 6 n = 0 = g ( 0 ) .

Thus f and g are conditionally reciprocal continuous and subsequentially continuous. We can see that f and g are neither weak reciprocal continuous nor g-reciprocal continuous. To see this, consider the sequence x n =1+ 1 n for n=1,2, , then

lim n f x n = lim n ( 1 + 2 n ) = 1 , lim n g x n = lim n ( 1 + 3 n ) = 1 , lim n f g x n = lim n ( 1 + 6 n ) = 1 f ( 1 ) , lim n g f x n = lim n ( 1 + 6 n ) = 1 g ( 1 ) , lim n f f x n = lim n ( 1 + 4 n ) = 1 f ( 1 ) , lim n g g x n = lim n ( 1 + 9 n ) = 1 g ( 1 ) .

Note that f and g do not have a coincidence point.

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

fx=xandgx=x+1for all xX.

Then it is easy to see that the pair (f,g) is reciprocal continuous, weak reciprocally continuous and conditionally reciprocally continuous but neither subsequentially continuous nor sequentially continuous of type ( A g ) and ( A f ). Note that the pair has no coincidence point.

In view of the above examples, we observe that in the event of no coincidence point, subsequential continuity as well as sequential continuity of type ( A g ) and ( A f ) are different from reciprocal continuity (respectively g-reciprocal and conditionally reciprocal continuity). However, in the context of a unique coincidence point (common fixed point), subsequential continuity as well as sequential continuity of type ( A g ) and ( A f ) are equivalent to conditionally reciprocal continuity.

The motivation of the following definition can be predicted from the proof of the last step in our Theorem 2.1.

Definition 2.2 Two self-mappings f and g of a metric space (X,d) are called pseudo-reciprocal continuous (PRC) (with respect to conditionally sequential absorbing) 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 } (satisfying lim n f y n = lim n g y n =t (say), lim n d(f y n ,fg y n )=0 and lim n d(g y n ,gf y n )=0) such that lim n fg y n =ft and lim n gf y n =gt.

Common fixed point theorems

Assume that ϕ,ψ:[0,)[0,) are two functions such that

  1. (a)

    ϕ is nondecreasing, continuous and ϕ(0)=0<ϕ(t) for every t>0;

  2. (b)

    ψ is nondecreasing, right-continuous, and ψ(t)<t for every t>0.

To prove our first result, we use the following lemma.

Lemma 2.1 [45]

For every function ψ:[0,)[0,), let ψ n be the nth iterate of ψ. Then the following hold:

  1. (i)

    if ψ is nondecreasing, then for each t>0, lim n ψ n (t)=0 implies ψ(t)<t;

  2. (ii)

    if ψ is right-continuous with ψ(t)<t for t>0, then lim n ψ n (t)=0.

Theorem 2.1 Let f and g be two pseudo-reciprocal continuous (w.r.t. conditionally sequential absorbing) self-mappings of a complete metric space (X,d) such that fXgX, and let ϕ,ψ:[0,)[0,) be two functions satisfying (a) and (b). If for all x,yX,

ϕ ( d ( f x , f y ) ) ψ ( ϕ ( M ( x , y ) ) ) ,
(2.1)

where

M(x,y)=max { d ( g x , g y ) , d ( f x , g x ) , d ( f y , g y ) , d ( g x , f y ) + d ( f x , g y ) 2 } ,

then f and g have a unique common fixed point provided (f,g) is conditionally sequential absorbing.

Proof Let x 0 X and since fXgX, so we have a sequence { p n } defined by

p n =f x n =g x n + 1 .
(2.2)

Now we show that { p n } is a Cauchy sequence. We have

M ( x n , x n + 1 ) = max { d ( g x n , g x n + 1 ) , d ( f x n , g x n ) , d ( f x n + 1 , g x n + 1 ) , d ( g x n , f x n + 1 ) + d ( f x n , g x n + 1 ) 2 } = max { d ( p n 1 , p n ) , d ( p n , p n 1 ) , d ( p n + 1 , p n ) , d ( p n 1 , p n + 1 ) + d ( p n , p n ) 2 } = max { d ( p n 1 , p n ) , d ( p n + 1 , p n ) , d ( p n 1 , p n + 1 ) 2 } = max { d ( p n 1 , p n ) , d ( p n + 1 , p n ) } .

If we suppose M( x n , x n + 1 )=d( p n , p n + 1 ), then

ϕ ( d ( f x n , f x n + 1 ) ) ψ ( ϕ ( M ( x n , x n + 1 ) ) ) = ψ ( ϕ ( d ( p n , p n + 1 ) ) ) = ψ ( ϕ ( d ( f x n , f x n + 1 ) ) ) < ϕ ( d ( f x n , f x n + 1 ) ) ,

which is a contradiction. Therefore

M( x n , x n + 1 )=d( p n 1 , p n ).

Similarly,

M( x n , x n 1 )=d( p n 1 , p n 2 ).

If for some n we have either p n = p n 1 or p n = p n + 1 , then by condition (2.1) we obtain that the sequence { p n } is definitely constant and thus it is a Cauchy sequence. Suppose p n p n 1 for each n, then from condition (2.1) we have

ϕ ( d ( p n , p n 1 ) ) = ϕ ( d ( f x n , f x n 1 ) ) ψ ( ϕ ( M ( x n , x n 1 ) ) ) = ψ ( ϕ ( d ( p n 1 , p n 2 ) ) ) < ϕ ( d ( p n 1 , p n 2 ) ) ,

and for all nN,

ϕ ( d ( p n , p n + 1 ) ) <ϕ ( d ( p n 1 , p n ) ) .

Now, we have

ϕ ( d ( p n + 1 , p n ) ) ψ ( ϕ ( d ( p n , p n 1 ) ) ) ψ n ( ϕ ( d ( p 0 , p 1 ) ) ) ,
(2.3)

and then, by Lemma 2.1(ii),

lim n ψ n ( ϕ ( d ( p n + 1 , p n ) ) ) = 0 lim n ϕ ( d ( p n + 1 , p n ) ) = 0 lim n d ( p n + 1 , p n ) = 0 .
(2.4)

Now we prove that { p n } is Cauchy.

Suppose not, then ϵ>0 such that d( p n , p m )2ϵ for infinite value of m and n with m<n. This assumes that there exist two sequences { m k }, { n k } of natural numbers with m k < n k such that

d( p m k , p n k + 1 )>ϵ.
(2.5)

It is not restrictive to suppose that n k is the least positive integer exceeding m k and satisfying (2.5). We have

ϵ < d ( p m k , p n k + 1 ) d ( p m k , p n k 1 ) + d ( p n k 1 , p n k ) + d ( p n k , p n k + 1 ) ϵ + d ( p n k 1 , p n k ) + d ( p n k , p n k + 1 ) .

Then

d( p m k , p n k + 1 )ϵas k.
(2.6)

We note

d ( p m k , p n k + 1 ) d ( p m k , p m k + 1 ) d ( p n k + 2 , p n k + 1 ) d ( p m k + 1 , p n k + 2 ) d ( p m k , p n k + 1 ) d ( p m k , p m k + 1 ) d ( p n k + 2 , p n k + 1 ) ,

and therefore

d( p m k + 1 , p n k + 2 )ϵas k.
(2.7)

Now, we have

M ( x n k + 2 , x m k + 1 ) = max { d ( p m k , p n k + 1 ) , d ( p n k + 1 , p n k + 2 ) , d ( p m k , p m k + 1 ) , d ( p m k + 1 , p n k + 1 ) + d ( p m k , p n k + 2 ) 2 } = d ( p m k , p n k + 1 ) + d k ,
(2.8)

where d k 0 as k+ and d k 0 for all k. Then from

ϕ ( d ( p m k + 1 , p n k + 2 ) ) = ϕ ( d ( f x n k + 2 , f x m k + 1 ) ) ψ ( ϕ ( M ( x n k + 2 , x m k + 1 ) ) ) = ψ ( ϕ ( d ( p m k , p n k + 1 ) + d k ) ) ,
(2.9)

as k+, ϕ being continuous and ψ right-continuous, we get

ϕ(ϵ)ψ ( ϕ ( ϵ ) ) <ϕ(ϵ).

This is a contradiction. Therefore { p n } is a Cauchy sequence. Since (X,d) is a complete metric space, therefore tX such that

p n =f x n =g x n + 1 tas n.
(2.10)

Since the pair (f,g) is conditionally sequential absorbing, therefore there exists a sequence { y n } in X such that f y n u, g y n u (say) satisfying

lim n d(f y n ,fg y n )=0and lim n d(g y n ,gf y n )=0,
(2.11)

and by pseudo-reciprocal continuity (w.r.t. conditionally sequential absorbing) of (f,g), we have

lim n fg y n =fuand lim n gf y n =gu.
(2.12)

In view of (2.11) and (2.12), we get fu=gu=u, i.e., u is a common fixed point of f and g. The uniqueness of a common fixed point follows easily from contractive condition (2.1). □

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

fx= { 1 + x 2 if  x [ 0 , 1 2 ) , 1 2 if  x [ 1 2 , 1 ] , gx= { 1 2 + x if  x [ 0 , 1 2 ) , 1 2 if  x = 1 2 , 4 5 if  x ( 1 2 , 1 ] .

Then f and g satisfy all the conditions of Theorem 2.1 with f(X)=[ 1 2 , 3 4 )[ 1 2 ,1)=g(X). Here, f and g are conditionally sequential absorbing and pseudo-reciprocal continuous (w.r.t. conditionally sequential absorbing) in respect of the constant sequence x n = 1 2 . Let us consider the sequence x n = 1 n + 2 , then

lim n f x n = lim n ( 1 2 + 1 2 n + 4 ) = 1 2 = lim n ( 1 2 + 1 n + 2 ) = lim n g x n , lim n f g x n = lim n f ( 1 2 + 1 n + 2 ) = 1 2 = f ( 1 2 ) , lim n g f x n = lim n g ( 1 2 + 1 2 n + 4 ) = 4 5 g ( 1 2 ) , lim n f f x n = lim n f ( 1 2 + 1 2 n + 4 ) = 1 2 = f ( 1 2 ) , lim n g g x n = lim n g ( 1 2 + 1 n + 2 ) = 4 5 g ( 1 2 ) .

Thus, (f,g) is not a reciprocal as well as not a g-reciprocal continuous pair. Also the pair (f,g) is neither compatible, f-compatible nor g-compatible.

If we take ϕ(t)=t and ψ(t)=kt, k[0,1), then it can be verified that f and g satisfy contraction condition (2.1) with k= 5 6 . Here, x= 1 2 is the unique common fixed point of f and g, which is also a point of discontinuity.

On the other hand, notice that at x=1, f and g do not satisfy the condition

max { d ( g g x , f g x ) , d ( f f x , g f x ) } φ ( d ( f x , g x ) )

used in Theorem 1.5. Here, it is worth noting that none of the earlier relevant theorems, for example, Theorem 1.1, Theorem 1.4 and Theorem 1.5, can be used in the context of this example. One more interesting part of this example is that neither f(X) nor g(X) is closed. Thus the result of Singh and Mishra [19] cannot be applicable in the context of this example.

Theorem 2.2 Let f and g be pseudo-reciprocal continuous (w.r.t. conditionally sequential absorbing) and noncompatible self-mappings of a metric space (X,d) satisfying

d(fx,fy)<max { d ( g x , g y ) , k [ d ( f x , g x ) + d ( f y , g y ) ] 2 , d ( f x , g y ) + d ( f y , g x ) 2 } ,
(2.13)

where 1k<2. If f and g are conditionally sequential absorbing, then f and g have a unique common fixed point.

Proof Since f and g are noncompatible maps, there exists a sequence { x n } in X such that f x n t and g x n t for some t in X but either lim n d(fg x n ,gf x n )0 or the limit does not exist. Also, the pair (f,g) is conditionally sequential absorbing; therefore, there exists a sequence { y n } in X such that lim n f y n = lim n g y n =u (say) with lim n d(f y n ,fg y n )=0 and lim n d(g y n ,gf y n )=0. Now, by the pseudo-reciprocal continuity (w.r.t. conditionally sequential absorbing) of the pair (f,g), we have fg y n fu and gf y n gu. In view of these limits, we get u is a common fixed point of f and g.

Now, suppose that there exists another common fixed point w of f and g such that wu. Then, on using (2.13), we have

d(fw,fu)<max { d ( g w , g u ) , k [ d ( f w , g w ) + d ( f u , g u ) ] 2 , d ( f w , g u ) + d ( f u , g w ) 2 } .

Thus, we have d(w,u)< k 2 d(w,u)<d(w,u), a contradiction and hence w=u. □

Example 2.7 Again consider Example 2.6 wherein the pair (f,g) satisfies all the conditions of Theorem 2.2 for all k[1,2). Note that at x=0, f and g do not satisfy the condition

d(x,fx)max { d ( x , g x ) , d ( f x , g x ) } ,

whenever the right-hand side is nonzero. Thus Theorem 2.2 is a genuine extension and improvement of Theorem 1.2 due to Pant and Bisht [40].

Observation The proof of Theorem 2.1, Theorem 2.2 and examples above immediately suggest us defining another type of continuity as follows.

Definition 2.3 Two self-mappings f and g of a metric space (X,d) are called pseudo-reciprocal continuous (PRC) (with respect to pseudo-compatible) 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 } (satisfying 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 }) such that lim n fg y n =ft and lim n gf y n =gt.

However, the notions of pseudo-compatibility and pseudo-reciprocal continuity (w.r.t. pseudo-compatibility) are no more applicable in the context of the existence of non-unique common fixed points for a pair of maps. This fact is illustrated in Example 2.11 below. At the same time, conditionally sequential absorbing and pseudo-reciprocal continuity (w.r.t. conditionally sequential absorbing) are easily applicable.

Theorem 2.3 Let f and g be reciprocal (or g-reciprocal) continuous and noncompatible self-mappings of a metric space (X,d) satisfying (2.13). Then the pair (f,g) has a unique common fixed point provided it is conditionally sequential absorbing. Moreover, f and g are discontinuous at the common fixed point.

Proof Since f and g are noncompatible, there exists a sequence { x n } in X such that lim n f x n = lim n g x n =t for some tX, but lim n d(fg x n ,gf x n ) is either nonzero or not existent. Also, since f and g are conditionally sequential absorbing and lim n f x n = lim n g x n =t, there exists a sequence { y n } in X, satisfying lim n f y n = lim n g y n =u (say), such that lim n d(f y n ,fg y n )=0 and lim n d(g y n ,gf y n )=0. The reciprocal continuity of the pair (f,g) implies that lim n fg y n =fu and lim n gf y n =gu. Thus, in view of these limits, we obtain fu=gu=u. If we consider the pair (f,g) g-reciprocal continuous, then we have lim n ff y n =fu and lim n gf y n =gu. Since lim n d(g y n ,gf y n )=0, so we have gu=u. Now, suppose fuu. On using (2.13), we get d(fu,u)< k 2 d(fu,u)<d(fu,u), a contradiction and hence fu=u. Thus u is a common fixed point of f and g. Applying (2.13), we can show the uniqueness of the common fixed point.

We now show that f and g are discontinuous at the common fixed point u. If possible, suppose f is continuous at u. Then, considering the sequence { x n } of the present theorem and on using (2.13), we get t=u and hence by the continuity of f, we have ff x n fu=u and fg x n fu=u. Now, reciprocal (or g-reciprocal) continuity of the pair (f,g) implies that gf x n gu=u. This further yields that lim n d(fg x n ,gf x n )=0, which contradicts the fact that lim n d(fg x n ,gf x n ) is either nonzero or non-existent. Hence f is discontinuous at the fixed point.

Next, suppose that g is continuous at u. Then, for the sequence { x n }, we get gf x n gu=u and gg x n gu=u. If (f,g) is reciprocal continuous, then we have fg x n fu=u, and if it is g-reciprocal continuous, then on using (2.13), we get fg x n fu=u. Thus, we obtain lim n d(fg x n ,gf x n )=0, a contradiction. Therefore f and g are discontinuous at their common fixed point. □

Example 2.8 Let X=[2,20] with the usual metric d. Define f,g:XX as follows:

fx= { 2 if  x = 2 , x > 5 , 4 if  2 < x 5 , gx= { 2 if  x = 2 , x 8 , 20 if  2 < x 5 , x + 1 3 if  5 < x < 8 .

Then f and g satisfy all the conditions of Theorem 2.3. It can be verified in this example that f and g satisfy contractive condition (2.13) for all k[1,2). To see that f and g are noncompatible, consider the sequence { x n } in X such that x n =5+ ϵ n , then f x n 2, g x n =(2+ ϵ n 3 )2, fg x n 4, gf x n 2, and so lim n d(fg x n ,gf x n )0. Also here the pair (f,g) is g-reciprocal continuous. To see this, let { x n } be a sequence in X such that lim n f x n = lim n g x n =t for some t in X. Then t=2, x n =2 or x n =5+ ϵ n , ff x n 2=f(2) and gf x n 2=g(2). The pair (f,g) is conditionally sequential absorbing in respect of the constant sequence { y n } given by y n =2. Here, x=2 is the unique common fixed point where f and g are discontinuous.

Note that at x=8, f and g do not satisfy the condition

d(x,fx)max { d ( x , g x ) , d ( f x , g x ) } ,

whenever the right-hand side is nonzero. Also notice that at x=3, f and g do not satisfy

max { d ( g g x , f g x ) , d ( f f x , g f x ) } φ ( d ( f x , g x ) ) .

Thus, Theorem 2.3 is a genuine extension and improvement of Theorem 1.2 due to Pant and Bisht [40] and Theorem 1.5 due to Rezapour and Shahzad [44].

In the absence of contractive condition (2.13), the following corollaries are straightforward from Theorems 2.2 and 2.3.

Corollary 2.1 Let f and g be pseudo-reciprocal continuous (w.r.t. conditionally sequential absorbing) and noncompatible self-mappings of a metric space (X,d). Then f and g have a common fixed point provided it is conditionally sequential absorbing.

Corollary 2.2 Let f and g be reciprocal (or g-reciprocal) continuous and noncompatible self-mappings of a metric space (X,d). Then the pair (f,g) has a common fixed point provided it is conditionally sequential absorbing.

The following examples illustrate the above corollaries.

Example 2.9 Consider X=[2,23] and let d be the usual metric on X. Define f,g:XX as

f x = { 2 if  x { 2 } ( 5 , 7 ) ( 7 , 10 ) ( 10 , 11 ) ( 11 , 12 ) if  x ( 12 , 13 ) ( 13 , 21 ) ( 21 , 23 ) , x + 5 2 if  2 < x 5 , 7 if  x = 7 , 23 , 12 if  x = 10 , 11 if  x = 11 , 13 , 11.5 if  x = 12 , 10 if  x = 21 , g x = { 2 if  x { 2 } [ 7 , 10 ) ( 10 , 11 ) ( 11 , 12 ) ( 12 , 13 ) if  x ( 13 , 21 ) ( 21 , 22 ) ( 22 , 23 ) , 6 if  2 < x 5 , x + 1 3 if  x ( 5 , 7 ) , 11 if  x = 10 , 11 , 13 , 22 , 11.6 if  x = 12 , 10 if  x = 21 , 7 if  x = 23 .

Here f and g satisfy all the conditions of Corollary 2.1. In view of the constant sequence x n =2 or x n =11, the pair (f,g) is conditionally sequential absorbing and pseudo-reciprocal continuous (w.r.t. conditionally sequential absorbing). For noncompatibility as well as non-reciprocal continuity, let us consider the sequence x n =5+( 1 n ), then we have

f x n 2 , g x n = ( 2 + 1 3 n ) 2 lim n f g x n = lim n ( 7 2 + 1 6 n ) = 7 2 f ( 2 ) , lim n g f x n = 2 = g ( 2 ) ,

and so lim n d(fg x n ,gf x n )0. Here, 2 and 11 are two common fixed points of f and g. Also the pair is not weakly compatible as f and g do not commute at their coincidence point x=23.

Note that at x=13 and y=22 the present example does not satisfy condition (2.13) for any k[1,2) and also Lipschitz-type condition used in [33] for any k0. Also notice that at x=21, the involved maps do not satisfy any of the conditions:

  1. (i)

    d(x,fx)max{d(x,gx),d(fx,gx)},

  2. (ii)

    d(x,gx)max{d(x,gx),d(gx,fx)},

  3. (iii)

    d(x,gx)max{d(x,fx),d(gx,fx)}, and

  4. (iv)

    d(fx, f 2 x)max{d(gx,gfx),d(fx,gx),d( f 2 x,gfx),d(fx,gfx),d(gx, f 2 x)},

whenever the right-hand side is nonzero. Here, it is worth noting that none of the Theorem 1.3 due to Pant and Bisht [34] and the main results contained in Pant and Pant [33] and Gopal et al. [46] can be used in the context of Corollary 2.1.

Example 2.10 Consider X=[2,23] and let d be the usual metric on X. Define f,g:XX as

f x = { 2 if  x [ 2 , 7 ) ( 7 , 10 ) ( 10 , 11 ) ( 11 , 12 ) if  x ( 12 , 13 ) ( 13 , 21 ) ( 21 , 23 ) , 7 if  x = 7 , 23 , 12 if  x = 10 , 11 if  x = 11 , 13 , 11.5 if  x = 12 , 10 if  x = 21 , g x = { 2 if  x { 2 } ( 5 , 10 ) ( 10 , 11 ) ( 11 , 12 ) ( 12 , 13 ) if  x ( 13 , 21 ) ( 21 , 22 ) ( 22 , 23 ) , 6 if  x ( 2 , 5 ] , 11 if  x = 10 , 11 , 13 , 22 , 11.6 if  x = 12 , 10 if  x = 21 , 7 if  x = 23 .

In this example the pair (f,g) is noncompatible as well as reciprocal continuous and satisfies all the conditions of Corollary 2.2. Let us consider the sequence x n =23, then f x n 7, g x n 7 and

f g x n 7 = f ( 7 ) , g f x n 2 = g ( 7 ) ,

therefore lim n d(fg x n ,gf x n )0, and so (f,g) is noncompatible. Here, 2 and 11 are two common fixed points of f and g.

Finally, we present an example which shows that the requirement of conditionally sequential absorbing property is necessary for producing common fixed points of mappings satisfying non-expansive or Lipschitz-type conditions besides exhibiting the limitations of commuting properties of the pairs utilized in earlier related results of Pant and Bisht [34], Pant and Pant [33] and Jungck and Rhoades [17].

Example 2.11 Let X=[2,20] endowed with the usual metric d and f,g:XX by

fx= { 6 if  2 x < 6  or  x > 6 , 13 2 if  x = 6 , gx= { 5 if  2 x 5 , x + 7 2 if  5 < x 6 , 10 if  6 < x < 13 / 2  or  x > 13 / 2 , 6 if  x = 13 / 2 .

Then by a routine calculation, it can be verified that f ( X ) ¯ g(X) and d(fx,fy)kd(gx,gy) for all x,yX, where k0. Also, f and g are a noncompatible and weakly commuting (and hence occasionally weakly compatible and conditionally commuting) pair. In order to show that (f,g) is noncompatible, the sequence x n =5+1/n; n>1, nN satisfies the requirements. Also, it is straightforward to verify that the pair (f,g) is pseudo-compatible as well as pseudo-reciprocal continuous (w.r.t. pseudo-compatible), but the pair is not conditionally sequential absorbing in respect of x n =6 or 5+1/n. On the other hand, at x=6, it can be verified that the mappings f and g do not satisfy any one of the conditions described by (i), (ii), (iii) or (iv) mentioned earlier. Notice that the estimated pair has no common fixed point.

Observations The following definitions can be considered as variants of conditionally sequential absorbing. Two self-mappings f and g of a metric space (X,d) are called conditionally sequential absorbing

  1. (i)

    of type (A) 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 } satisfying lim n f y n = lim n g y n =t (say) such that lim n d(f y n ,ff y n )=0 and lim n d(g y n ,gf y n )=0;

  2. (ii)

    of type (B) 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 } satisfying lim n f y n = lim n g y n =t (say) such that lim n d(f y n ,fg y n )=0 and lim n d(g y n ,gg y n )=0;

  3. (iii)

    of type (C) 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 } satisfying lim n f y n = lim n g y n =t (say) such that lim n d(f y n ,ff y n )=0 and lim n d(g y n ,gg y n )=0.

We can have some more variants by interchanging the place of f and g. In respect of these variants, we can also define the corresponding pseudo-reciprocal continuity, for example, two self-mappings f and g of a metric space (X,d) are called pseudo-reciprocal continuous of type (A) 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 } (satisfying lim n f y n = lim n g y n =t (say), lim n d(f y n ,ff y n )=0 and lim n d(g y n ,gf y n )=0) such that lim n ff y n =ft and lim n gf y n =gt.

Remark 2.2 The conclusion of our previous results will remain true if we replace the conditionally sequential absorbing and pseudo-reciprocal continuity by any one of the above variants of conditionally sequential absorbing and corresponding pseudo-reciprocal continuity. However, in the context of a unique coincidence or common fixed point, all these variants coincide with each others.