Skip to main content

Fixed point theorems for φ-contractions

Abstract

This paper deals with the fixed point theorems for mappings satisfying a contractive condition involving a gauge function φ when the underlying set is endowed with a b-metric. Our results generalize/extend the main results of Proinov and thus we obtain as special cases some results of Mysovskih, Rheinboldt, Gel’man, and Huang. We also furnish an example to substantiate the validity of our results. Subsequently, an existence theorem for the solution of initial value problem has also been established.

MSC:47H10, 54H25.

1 Introduction and preliminaries

The Banach contraction principle has been extensively used to study the existence of solutions for the nonlinear Volterra integral equations and nonlinear integro-differential equations and to prove the convergence of algorithms in computational mathematics. These applications elicit the significance of fixed point theory. Therefore mathematicians have been propelled to contribute enormously in the field of fixed point theory by finding the fixed point(s) of self-mappings or nonself-mappings defined on several ambient spaces and satisfying a variety of conditions. Among these fixed point theorems only a few have practical importance, i.e., they provide a constructive method for finding fixed point(s). This provides information on the convergence rate along with error estimates. The Banach contraction principle is one of such theorems wherein the proposed iterative scheme converges linearly. Commonly, the iterative procedures serve as constructive methods in fixed point theory. Furthermore, it is also of crucial importance to have prior and posterior estimates for such methods. In this context, Proinov [1] extended the Banach contraction principle with a higher order of convergence. He proposed an iterative scheme for a mapping satisfying a contractive condition which involves a gauge function of order r1 and obtained error estimates as well. His results include as special cases some results of Mysovskih [2], Rheinboldt [3], Gel’man [4], Huang [5], and others. In [6] the authors extended the results of Proinov to the case of multivalued mappings.

For the last few decades fixed point theory has rapidly been evolving, not only in metric structure but also in many different generalized spaces and the b-metric space is one of them. The notion of a b-metric space was initiated in some works of Bourbaki, Bakhtin, Czerwik, and Heinonen. Several papers appeared which deal with the fixed point theory for single valued and multivalued functions in a b-metric space [711]etc.

Inspired by the work of Proinov [1] in this paper we investigate whether the consequences of his results hold when the underlying structure is replaced with a b-metric space. We give an affirmative answer to this question. Our results generalize main results of Proinov [1] and thus subsume many results of authors [25]. We establish an example to substantiate the validity of our results. Consequently, in Section 3 we also obtain an existence theorem for the solution of an initial value problem.

In the following we recall some auxiliary notions and results in a b-metric space [79, 11] which are needed subsequently.

Definition 1.1 [7, 11]

Let X be a nonempty set and s1 be a given real number. A function d:X×X R + is said to be a b-metric space if and only if for all x,y,zX the following conditions are satisfied:

(d1) d(x,y)=0 if and only if x=y;

(d2) d(x,y)=d(y,x);

(d3) d(x,z)s[d(x,y)+d(y,z)].

The pair (X,d) is called a b-metric space with the coefficient s.

The following example shows that the class of b-metric spaces is essentially larger than the class of metric spaces.

Example 1.2 [8, 11, 12]

  1. (1)

    Let X:= l p (R) with 0<p<1 where l p (R):={{ x n }R: n = 1 | x n | p <}. Define d:X×X R + as

    d(x,y)= ( n = 1 | x n y n | p ) 1 / p ,

where x={ x n }, y={ y n }. Then (X,d) is a b-metric space with coefficient s= 2 1 / p .

  1. (2)

    Let X:= L p [0,1] be the space of all real functions x(t), t[0,1] such that 0 1 | x ( t ) | p dt<. Define d:X×X R + as

    d(x,y)= ( 0 1 | x ( t ) y ( t ) | p d t ) 1 / p .

Then (X,d) is a b-metric space with coefficient s= 2 1 / p

A sequence { x n } in a b-metric space X is convergent if and only if there exists xX such that d( x n ,x)0 as n and we write lim n x n =x; it is Cauchy if and only if d( x n , x m )0 as m,n. A b-metric space (X,d) is complete if every Cauchy sequence in X converges.

Let (X,d) be a b-metric space; then a convergent sequence has a unique limit; every convergent sequence is Cauchy; and in general the b-metric d is not a continuous functional [13].

Definition 1.3 Let (X,d) be a b-metric space and A be a nonempty subset of X then closure A ¯ of A is the set consisting of all points of A and its limit points. Moreover, A is closed if and only if A= A ¯ .

In the following the b-metric version of Cantor’s intersection theorem is given, which can easily be established running along the same lines as in the proof of its metric version.

Theorem 1.4 [14]

Let (X,d) be a complete b-metric space, then every nested sequence of closed balls has a nonempty intersection.

Let f:DXX and there exist some xD such that the set O(x)={x,fx, f 2 x,}D. The set O(x) is known as an orbit of xD. We recall that a function G from D into the set of real numbers is said to be f-orbitally lower semi-continuous at tX if { x n }O(x) and x n t implies G(t)liminfG( x n ) [15].

Throughout this paper let J always denote an interval in R + containing 0 i.e., an interval of the form [0,R], [0,R) or [0,) ([0,0]={0} is a trivial interval). Let P n (t) denote a polynomial of the form P n (t)=1+t++ t n 1 and P 0 (t)=0. Let φ n denote the n th iterate of a function φ:JJ.

Definition 1.5 [1]

Let r1; a function φ:JJ is said to be a gauge function of order r on J if it satisfies the following conditions:

  1. (i)

    φ(λt) λ r φ(t) for all λ(0,1) and tJ,

  2. (ii)

    φ(t)<t for all tJ{0}.

The condition (i) of Definition 1.5 elicits φ(0)=0 and φ(t)/ t r is nondecreasing on J{0}. A gauge function φ:JJ is said to be a Bianchini-Grandolfi gauge function if n = 0 φ n (t)< for all tJ [16].

Subsequently, in this paper let (X,d) be a b-metric space (unless specified otherwise) with a coefficient s1. We assume that f:DXX be an operator and there exist some x 0 D such that O( x 0 )D. Let the operator f satisfy the following iterated contractive condition:

d ( f x , f 2 x ) φ ( d ( x , f x ) ) for all xO( x 0 ) such that d(x,fx)J,
(1.1)

where φ is a gauge function of order r1 on an interval J. We establish two convergence theorems for iterative processes of the type

x n + 1 =f x n ,n=0,1,2,,
(1.2)

where f satisfies (1.1).

2 b-Bianchini-Grandolfi gauge functions

In [1] Proinov proved his main results by assuming Bianchini-Grandolfi gauge functions and the mapping f satisfying the contractive condition (3.5) when the underlying space is endowed with a metric (see Corollary 3.9). But in the setting of b-metric space for some technical reasons we have to restrict ourselves to the gauge functions satisfying n = 0 s n φ n (t)< for all tJ where s is the coefficient of b-metric space. Furthermore, taking into account such a crucial condition in order to calculate prior and posterior estimates we consider the gauge functions of the form

φ(t)=t ϕ ( t ) s for all tJ,
(2.1)

where s1 is the coefficient of b-metric d and ϕ is nonnegative nondecreasing function on J such that

0ϕ(t)<1for all tJ.
(2.2)

Remark 2.1 One can always define a nonnegative nondecreasing function ϕ on J satisfying (2.1) and (2.2) as follows:

ϕ(t)={ s φ ( t ) t , if  t J { 0 } , 0 , if  t = 0 ,
(2.3)

where s is the coefficient of b-metric d.

For a fixed s1, let us consider the following simple examples of gauge functions of order r:

  1. (i)

    φ(t)= c t s , 0<c<1 is a gauge function of order 1 on J=[0,);

  2. (ii)

    φ(t)= c t r s (c>0, r>1) is a gauge function of order r on J=[0,h) where h= ( 1 c ) 1 ( r 1 ) .

It is essential to mention here that to establish the fixed point theorem (see Theorem 3.7) we do not necessarily require the gauge functions φ satisfying (2.1), (2.2). But we consider the gauge function such that n = 0 s n φ n (t)< for all tJ where s is a coefficient of b-metric space.

Lemma 2.2 Let φ be a gauge function of order r1 on J. If ϕ is a nonnegative and nondecreasing function on J satisfying (2.1) and (2.2), then:

  1. (1)

    0 ϕ ( t ) s <1 for all tJ,

  2. (2)

    ϕ(μt) μ r 1 ϕ(t) for all μ(0,1) and tJ.

Remark 2.3 When d is a simple metric, then s=1. In such case every gauge function satisfying n = 0 φ n (t)< is of the form φ(t)=tϕ(t) where ϕ is nonnegative nondecreasing function on J (see [1]). Thus in such case the condition 0ϕ(t)<1 for all tJ becomes superfluous and directly follows from Lemma 2.2.

The following lemma is fundamental to our main results.

Lemma 2.4 Let φ be a gauge function of order r1 on J. If ϕ is a nonnegative and nondecreasing function on J satisfying (2.1) and (2.2), then for every n0 we have:

  1. (1)

    φ n (t)t [ ϕ ( t ) s ] P n ( r ) for all tJ,

  2. (2)

    ϕ( φ n (t))s [ ϕ ( t ) s ] r n for all tJ.

Proof (1) Set μ= ϕ ( t ) s and let tJ. Then from Lemma 2.2 we obtain 0μ<1. For μ=0 the case is trivial. We shall prove (1) by using mathematical induction. For n=0,1 the property (1) is trivially satisfied as it reduces to an equality. Let it also hold for any integer n1, i.e.,

φ n (t)t μ P n ( r ) .

Since φ is nondecreasing on J, we obtain (as t μ P n ( r ) J because tJ and μ<1)

φ n + 1 ( t ) φ [ t μ P n ( r ) ] μ r P n ( r ) φ ( t ) μ r P n ( r ) t ϕ ( t ) s = t μ r P n ( r ) + 1 = t μ P n + 1 ( r ) .

(2) By making use of Lemma 2.2 and monotonicity of ϕ, (1) leads to the following:

ϕ ( φ n ( t ) ) ϕ ( t [ ϕ ( t ) s ] P n ( r ) ) [ ϕ ( t ) s ] ( r 1 ) P n ( r ) ϕ ( t ) = s [ ϕ ( t ) s ] 1 + ( r 1 ) P n ( r ) = s [ ϕ ( t ) s ] r n ,

which completes the proof. □

Definition 2.5 Let q1 be a fixed real number. A nondecreasing function φ:JJ is said to be a b-Bianchini-Grandolfi gauge function with a coefficient q on J if

σ(t)= n = 0 q n φ n (t)<for all tJ.
(2.4)

We note that a b-Bianchini-Grandolfi gauge function also satisfies the following functional equation:

σ(t)=qσ ( φ ( t ) ) +t.
(2.5)

It is easy to see that every b-Bianchini-Grandolfi gauge function is also a Bianchini-Grandolfi [16] gauge function but the converse may not hold. A b-Bianchini-Grandolfi gauge function having coefficient q 1 1 is also a b-Bianchini-Grandolfi gauge function having coefficient q 2 1 for every q 2 q 1 .

From now on, we always assume that the coefficient of the b-Bianchini-Grandolfi gauge function is at least as large as the coefficient of the b-metric space.

Lemma 2.6 Every gauge function of order r1 defined by (2.1) and (2.2) is a b-Bianchini-Grandolfi gauge function with coefficient s1.

Proof It is immediately follows from the first part of Lemma 2.4 and using the fact that P n (r)n for r1 and n0. □

3 Fixed point theorems

For convenience we define a function E:D R + by E(x)=d(x,fx) and assume that there exist some x 0 D such that O( x 0 )D, so that the condition (1.1) can be put in the form

E(fx)φ ( E ( x ) ) for all xO( x 0 ) such that E(x)J.
(3.1)

Lemma 3.1 Suppose x 0 X is such that O( x 0 )D. Assume that E( x 0 )J; then E( x n )J for all n0.

Proof Note that x 0 , x 1 , x 2 ,, x n are well defined and belong to D. From (3.1) we have

E( x 1 )=d( x 1 , x 2 )φ ( d ( x 0 , x 1 ) ) =φ ( E ( x 0 ) ) J ( as  E ( x 0 ) J ) .

Hence, E( x 1 )J. Similarly, iterating successively we get E( x n )J for all n0. □

Definition 3.2 Suppose x 0 D is such that O( x 0 )D and E( x 0 )J. Then for every iterate x n D, n0 we define the closed ball B ¯ ( x n , ρ n ) with center at x n and radius ρ n =sσ(E( x n )), where σ:J R + is defined by (2.4).

Lemma 3.3 Suppose x 0 D is such that O( x 0 )D and E( x 0 )J. Assume that B ¯ ( x n , ρ n )D for some n0; then x n + 1 D and B ¯ ( x n + 1 , ρ n + 1 ) B ¯ ( x n , ρ n ).

Proof Since E( x 0 )J, Lemma 3.1 implies E( x n )J for all n0. The condition (2.5) implies σ(t)t for all tJ. We have

d( x n , x n + 1 )σ ( d ( x n , x n + 1 ) ) sσ ( d ( x n , x n + 1 ) ) = ρ n .

Thus x n + 1 B ¯ ( x n , ρ n )D. Now let x B ¯ ( x n + 1 , ρ n + 1 ). As E( x n )J so that from (3.1) we have E( x n + 1 )φ(E( x n )). By making use of (2.5) we get

d ( x , x n ) s [ d ( x , x n + 1 ) + E ( x n ) ] s [ ρ n + 1 + E ( x n ) ] = s [ s σ ( E ( x n + 1 ) ) + E ( x n ) ] s [ s σ ( φ ( E ( x n ) ) ) + E ( x n ) ] = s σ ( E ( x n ) ) = ρ n .

Hence, x B ¯ ( x n , ρ n ). □

Definition 3.4 (Initial orbital point)

We say that a point x 0 D is an initial orbital point of f if E( x 0 )J and O( x 0 )D.

The following lemma is obvious.

Lemma 3.5 For every initial orbital point x 0 D of f and every n0 we have

E( x n + 1 )φ ( E ( x n ) ) andE( x n ) φ n ( E ( x 0 ) ) .

Furthermore, if φ is a gauge function of order r1 defined by (2.1) and (2.2), then

E( x n )E( x 0 ) μ P n ( r ) andϕ ( E ( x n ) ) s μ r n =ϕ( x 0 ) μ r n 1 ,

where μ= ϕ ( E ( x 0 ) ) s and ϕ is nonnegative nondecreasing on J satisfying (2.1) and (2.2).

Proof By making use of Lemma 3.1 we obtain E( x n + 1 )φ(E( x n )). Since φ is nondecreasing, it easily follows that E( x n ) φ n (E( x 0 )). Now from Lemma 2.4(1) we have

E( x n ) φ n ( E ( x 0 ) ) E( x 0 ) [ ϕ ( E ( x 0 ) ) s ] P n ( r ) =E( x 0 ) μ P n ( r ) .

By using Lemma 2.4(2) we obtain

ϕ ( E ( x n ) ) ϕ ( φ n ( E ( x 0 ) ) ) s [ ϕ ( E ( x 0 ) ) s ] r n =s μ r n .

 □

The following lemma gives bounds for inclusion radii and throughout its proof we will make use of the following facts:

0ϕ(t)<1, P j (r)j,0 μ r n <1,

where r1, μ= ϕ ( E ( x 0 ) ) s and j=0,1,2, .

Lemma 3.6 Suppose x 0 D is an initial orbital point of f and φ is a gauge function of order r1. Let ϕ be nonnegative and nondecreasing on J defined by (2.1) and (2.2). Then for radii ρ n =sσ(E( x n )), n=0,1,2, , the following estimates hold:

  1. (1)

    ρ n sE( x n ) j = 0 [ ϕ ( E ( x n ) ) ] P j ( r ) s E ( x n ) 1 ϕ ( E ( x n ) ) ,

  2. (2)

    ρ n sE( x n ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n 1 ] P j ( r ) s E ( x n ) 1 ϕ ( E ( x 0 ) ) μ r n 1 ,

  3. (3)

    ρ n sE( x 0 ) μ P n ( r ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n 1 ] P j ( r ) sE( x 0 ) μ P n ( r ) 1 ϕ ( E ( x 0 ) ) μ r n 1 ,

  4. (4)

    ρ n + 1 sφ(E( x n )) j = 0 [ ϕ ( φ ( E ( x n ) ) ) ] P j ( r ) s φ ( E ( x n ) ) 1 ϕ ( φ ( E ( x n ) ) ) ,

  5. (5)

    ρ n + 1 sφ(E( x n )) j = 0 [ ϕ ( E ( x 0 ) ) μ r n + 1 1 ] P j ( r ) s φ ( E ( x n ) ) 1 ϕ ( E ( x 0 ) ) μ r n + 1 1 ,

where μ= ϕ ( E ( x 0 ) ) s .

  1. (1)

    Proof From definition of ρ n we have

    ρ n = s σ ( E ( x n ) ) = s j = 0 s j φ j ( E ( x n ) ) s j = 0 s j E ( x n ) [ ϕ ( E ( x n ) ) s ] P j ( r ) (using Lemma 2.4) = s E ( x n ) j = 0 s j [ ϕ ( E ( x n ) ) s ] P j ( r ) s E ( x n ) j = 0 [ ϕ ( E ( x n ) ) ] j = s E ( x n ) 1 ϕ ( E ( x n ) ) .
    (3.2)
  2. (2)

    From (3.2) we have

    ρ n s E ( x n ) j = 0 [ ϕ ( E ( x n ) ) ] P j ( r ) s E ( x n ) j = 0 [ s μ r n ] P j ( r ) (using second part of Lemma 3.5) = s E ( x n ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n 1 ] P j ( r ) s E ( x n ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n 1 ] j = s E ( x n ) 1 ϕ ( E ( x 0 ) ) μ r n 1 .
  3. (3)

    By making use of first part of Lemma 3.5 above we have

    ρ n s E ( x n ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n 1 ] P j ( r ) s E ( x 0 ) μ P n ( r ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n 1 ] j s E ( x 0 ) μ P n ( r ) 1 ϕ ( E ( x 0 ) ) μ r n 1 .
  4. (4)

    Now by making use of Lemma 2.4 we have

    ρ n + 1 = s σ ( E ( x n + 1 ) ) = j = 0 s j φ ( E ( x n + 1 ) ) s E ( x n + 1 ) j = 0 s j [ ϕ ( E ( x n + 1 ) ) s ] P j ( r ) s φ ( E ( x n ) ) j = 0 [ ϕ ( φ ( E ( x n ) ) ) ] P j ( r ) ( as  E ( x n + 1 ) φ ( E ( x n ) )  and  ϕ  is nondecreasing ) s φ ( E ( x n ) ) j = 0 [ ϕ ( φ ( E ( x n ) ) ) ] j = s φ ( E ( x n ) ) 1 ϕ ( φ ( E ( x n ) ) ) .
  5. (5)

    From (4) we have

    ρ n + 1 s φ ( E ( x n ) ) j = 0 [ ϕ ( E ( x n + 1 ) ) ] P j ( r ) s φ ( E ( x n ) ) j = 0 [ ϕ ( E ( x 0 ) ) μ r n + 1 1 ] P j ( r ) (using Lemma 3.5) s φ ( E ( x n ) ) 1 ϕ ( E ( x 0 ) ) μ r n + 1 1 .

 □

Now we proceed to formulate the following fixed point theorems.

Theorem 3.7 Let f:DXX be an operator on a complete b-metric space (X,d) such that the b-metric is continuous and f satisfies (1.1) with a b-Bianchini-Grandolfi gauge function φ of order r1 on an interval J with coefficient s1. Then starting from an initial orbital point x 0 of f the iterative sequence (1.2) remains in B ¯ ( x 0 , ρ 0 ) and converges to a point ξ which belongs to each of the closed balls B ¯ ( x n , ρ n ), n=0,1,2, , where ρ n =sσ(d( x n , x n + 1 )), σ defined in (2.5) and s1 is a coefficient of b-metric space. Furthermore, for each n1 we have

d( x n + 1 , x n )φ ( d ( x n , x n 1 ) ) .

If ξD and the function E(x)=d(x,fx) on D is f-orbitally lower semi-continuous at ξ, then ξ is a fixed point of f.

Proof Since x 0 D is an initial orbital point of f, from Lemma 3.3 we have

B ¯ ( x n + 1 , ρ n + 1 ) B ¯ ( x n , ρ n )for all n0.

Thus x n B ¯ ( x 0 , ρ 0 ) for all n0. According to the definition of ρ and using Lemma 3.5 we have

ρ n = s σ ( E ( x n ) ) s σ ( φ n ( E ( x 0 ) ) ) = s j = 0 s j φ j ( φ n ( E ( x 0 ) ) ) = 1 s n 1 j = n s j φ j ( φ n ( E ( x 0 ) ) ) for all  n 0 .
(3.3)

Since φ is a b-Bianchini-Grandolfi gauge function, from (3.3) we obtain

ρ n 0as n,
(3.4)

which implies that { B ¯ ( x n , ρ n )} is a nested sequence of closed balls. By Cantor’s theorem (for complete b-metric spaces), we deduce that there exists a unique point ξ such that ξ B ¯ ( x n , ρ n ) for all n0 and x n ξ or equivalently, lim n d( x n ,ξ)=0. From (d3) of Definition 1.1 we have

d(ξ,f x n )s [ d ( ξ , x n ) + d ( x n , f x n ) ] =s [ d ( ξ , x n ) + d ( x n , x n + 1 ) ] .

Letting n and since the b-metric is continuous, we obtain

lim n d(ξ,f x n )=0.

If ξD and E(x)=d(x,fx) is f-lower semi-continuous at ξ, then

d(ξ,fξ)=E(ξ) lim n infE( x n )= lim n infd( x n , x n + 1 )=0,

which infers ξ=fξ. Furthermore, from Lemma 3.5 we obtain the following:

d ( x n , x n + 1 ) = E ( x n ) φ ( E ( x n 1 ) ) = φ ( d ( x n 1 , x n ) ) .

 □

Remark 3.8 Theorem 3.7 gives a generalization of [[1], Theorem 4.1] and extends it to the case of b-metric spaces. It reduces to [[1], Theorem 4.1] when s=1. Hence Theorem 3.7 not only extends the result of Proinov [1] but in turn it also includes results of Bianchini and Grandolfi [16] and Hicks [17] as special cases.

Corollary 3.9 [[1], Theorem 4.1]

Let (X,d) be a complete metric space and f:DXX be an operator satisfying

d ( f x , f 2 x ) φ ( d ( x , f x ) ) for all xD and fxD with d(x,fx)J,
(3.5)

where φ is a Bianchini-Grandolfi gauge function on an interval J. Then starting from an initial orbital point x 0 of f the iterative sequence { x n } remains in B ¯ ( x 0 , ρ 0 ) and converges to a point ξ which belongs to each of the closed balls B ¯ ( x n , ρ n ), n=0,1, where ρ n =σ(d( x n ,f x n )) and σ(t)= n = 0 φ n (t). Moreover, if ξD and f is continuous at ξ, then ξ is a fixed point of f.

Proof It follows from Lemma 3.1 that E( x n )J for n=0,1,2, . Thus from (3.5) we have

d ( f x , f 2 x ) φ ( d ( x , f x ) ) for all xO( x 0 ) with d(x,fx)J.
(3.6)

Thus Theorem 3.7 yields x n ξX. Also since the iterative sequence { x n }O( x 0 ) and the mapping f is continuous at point t, we have f x n fξ. Thus

E(ξ)=d(ξ,fξ) lim n s [ d ( ξ , x n + 1 ) + d ( x n + 1 , f ξ ) ] =0 lim n infE( x n ).

This implies f-orbital lower semi-continuity of E(x)=d(x,fx) at point ξ. Hence the conclusion follows from Theorem 3.7. □

Theorem 3.10 Let f:DXX be an operator on a complete b-metric space (X,d) such that the b-metric is continuous and let f satisfy (1.1) with a b-Bianchini-Grandolfi gauge function φ of order r1 and a coefficient s on an interval J. Further, suppose that x 0 D is an initial orbital point of f, then the following statements hold true.

  1. (1)

    The iterative sequence (1.2) remains in B ¯ ( x 0 , ρ 0 ) and converges with rate of convergence at least r1 to a point ξ which belongs to each of the closed balls B ¯ ( x n , ρ n ), n=0,1, , and

    ρ n =sd( x n , x n + 1 ) j = 0 [ ϕ ( d ( x n , x n + 1 ) ) ] s d ( x n , x n + 1 ) 1 ϕ ( d ( x n , x n + 1 ) ) ,
    (3.7)

where ϕ is nonnegative and nondecreasing function on J satisfying (2.1) and (2.2).

  1. (2)

    For all n0 the following prior estimate holds:

    d( x n ,ξ) E ( x 0 ) s n 1 j = n ϕ ( E ( x 0 ) ) P j ( r ) =d( x 0 ,f x 0 ) ϕ ( E ( x 0 ) ) P n ( r ) s n 1 [ 1 ϕ ( E ( x 0 ) ) r n ] .
    (3.8)
  2. (3)

    For all n1 the following posterior estimate holds:

    d ( x n , ξ ) s φ ( d ( x n , x n 1 ) ) j = 0 [ ϕ ( φ ( d ( x n , x n 1 ) ) ) ] P j ( r ) s φ ( d ( x n , x n 1 ) ) 1 ϕ [ φ ( d ( x n , x n 1 ) ) ] s φ ( d ( x n , x n 1 ) ) 1 ϕ ( d ( x n , x n 1 ) ) [ ϕ ( d ( x n , x n 1 ) ) s ] r 1 .
    (3.9)
  3. (4)

    We have

    d( x n + 1 , x n )φ ( d ( x n , x n 1 ) ) μ P n ( r ) d( x 0 ,f x 0 )
    (3.10)

for all n1.

  1. (5)

    If ξD and the function G(x)=d(x,fx) on D is f-orbitally lower semi-continuous at ξ, then ξ is a fixed point of f.

Proof (1) From Theorem 3.7 it follows that the iterative sequence (1.2) converges to tX and further t B ¯ ( x n , ρ n ) for all n=0,1,2, . Moreover, estimate (1) of Lemma 3.6 implies

ρ n sd( x n , x n + 1 ) j = 0 [ ϕ ( d ( x n , x n + 1 ) ) ] P j ( r ) s d ( x n , x n + 1 ) 1 ϕ ( d ( x n , x n + 1 ) ) .
  1. (2)

    For m>n,

    d ( x n , x m ) s d ( x n , x n + 1 ) + s 2 d ( x n + 1 , x n + 2 ) + + s m n 1 d ( x m 2 , x m 1 ) + s m n d ( x m 1 , x m ) = 1 s n 1 j = n m 1 s j E ( x j ) 1 s n 1 j = n m 1 s j φ j ( E ( x 0 ) ) ( from Lemma 3.5 , E ( x n ) φ n ( E ( x 0 ) ) ) 1 s n 1 j = n m 1 s j E ( x 0 ) [ ϕ ( E ( x 0 ) ) s ] P j ( r ) (using Lemma 2.4) E ( x 0 ) s n 1 j = n m 1 λ P j ( r ) ,

where λ=ϕ(E( x 0 )). Keeping n fixed and letting m we get

d( x n ,ξ) E ( x 0 ) s n 1 j = n λ P j ( r ) = d ( x 0 , f x 0 ) s n 1 j = n λ P j ( r ) .
(3.11)

Since

r n + r n + 1 2 r n , r n + r n + 1 + r n + 2 3 r n ,,

we have

λ r n + r n + 1 λ 2 r n , λ r n + r n + 1 + r n + 2 λ 3 r n ,.

Thus it implies

j = n λ P j ( r ) = λ P j ( r ) + λ P j + 1 ( r ) + = λ P n ( r ) [ 1 + λ r n + λ r n + r n + 1 + λ r n + r n + 1 + r n + 2 + ] λ P j ( r ) [ 1 + λ r n + λ 2 r n + λ 3 r n + ] = λ P n ( r ) 1 λ r n .
(3.12)

Hence from (3.11) we obtain

d( x n ,ξ) E ( x 0 ) s n 1 j = n ϕ ( E ( x 0 ) ) P j ( r ) =d( x 0 ,f x 0 ) ϕ ( E ( x 0 ) ) P n ( r ) s n 1 [ 1 ϕ ( E ( x 0 ) ) r n ] .
  1. (3)

    From (3.11) we have for n0,

    d( x n ,ξ) d ( x 0 , x 1 ) s n 1 j = n [ ϕ ( d ( x 0 , x 1 ) ) ] P j ( r ) .

Setting n=0, y 0 = x 0 , and y 1 = x 1 we have

d( y 0 ,ξ)sd( y 0 , y 1 ) j = 0 [ ϕ ( d ( y 0 , y 1 ) ) ] P j ( r ) .

Setting again y 0 = x n and y 1 = x n + 1 gives

d ( x n , ξ ) s d ( x n , x n + 1 ) j = 0 [ ϕ ( d ( x n , x n + 1 ) ) ] P j ( r ) s φ ( d ( x n , x n 1 ) ) j = 0 [ ϕ ( φ ( d ( x n , x n 1 ) ) ) ] P j ( r ) s φ ( d ( x n , x n 1 ) ) j = 0 [ ϕ ( φ ( d ( x n , x n 1 ) ) ) ] j = s φ ( d ( x n , x n 1 ) ) 1 ϕ ( φ ( d ( x n , x n 1 ) ) ) .
(3.13)

From Lemma 2.4(2) we obtain

ϕ ( φ ( d ( x n , x n 1 ) ) ) s [ ϕ ( d ( x n , x n 1 ) ) s ] r =ϕ ( d ( x n , x n 1 ) ) [ ϕ ( d ( x n , x n 1 ) ) s ] r 1 ,
(3.14)

which implies

1 1 ϕ ( φ ( d ( x n , x n 1 ) ) ) 1 1 ϕ ( d ( x n , x n 1 ) ) [ ϕ ( d ( x n , x n 1 ) ) s ] r 1 .
(3.15)

Thus from (3.13) and (3.15) we deduce for n1,

d ( x n , ξ ) s φ ( d ( x n , x n 1 ) ) 1 ϕ ( φ ( d ( x n , x n 1 ) ) ) s φ ( d ( x n , x n 1 ) ) 1 ϕ ( d ( x n , x n 1 ) ) [ ϕ ( d ( x n , x n 1 ) ) s ] r 1 .
  1. (4)

    We have

    d ( x n + 1 , x n ) = E ( x n ) φ ( E ( x n 1 ) ) = E ( x n 1 ) ϕ ( E ( x n 1 ) ) s E ( x 0 ) μ P n 1 ( r ) μ r n 1 ( using Lemma 2.2 ) = E ( x 0 ) μ P n 1 ( r ) + r n 1 = E ( x 0 ) μ P n ( r ) = μ P n ( r ) d ( x 0 , f x 0 ) .
  2. (5)

    Its proof runs along the same lines as the proof of Theorem 3.7. □

Remark 3.11 For s=1, Theorem 3.10 reduces to [[1], Theorem 4.2]. It also generalizes (taking s=1 and φ(t)=λt, 0<λ<1) results of Ortega and Rheinboldt [[18], Section 12.3.2], Kornstaedt [[19], Satz 4.1], Hicks and Rhoades [15], and Park [[20], Theorem 2]. The first two conclusions of Theorem 3.10 are due to Gel’man [[4], Theorem 3] (taking s=1 and φ(t)=c t r , c0, r1). It also yields some results of Hicks [[17], Theorem 3].

Corollary 3.12 Let f:XX be an operator on a complete b-metric space (X,d) such that the b-metric is continuous. Further, assume that f satisfies

d(fx,fy)φ ( d ( x , y ) ) for all x,yX with d(x,y)J,
(3.16)

where φ is a b-Bianchini-Grandolfi gauge function of order r1 on an interval J and with coefficient s1. Assume that x 0 X is such that d( x 0 ,f x 0 )J. Then the following statements hold.

  1. (i)

    The iterative sequence (1.2) converges to a fixed point ξ of f.

  2. (ii)

    The operator f has a unique fixed point in S={xX:d(x,ξ)J}.

  3. (iii)

    The estimates (3.7)-(3.10) are valid.

Proof From (3.16) we have

d(fx,fy)φ ( d ( x , y ) ) <d(x,y),

which gives the continuity of f in b-metric space (X,d). Thus conclusions (i) and (iii) follow immediately from Theorem 3.10. Let ξ be another fixed point of f in S; then d(ξ, ξ )J. It follows from (3.16) that d(ξ, ξ )φ(d(ξ, ξ )), which yields ξ =ξ. □

Remark 3.13 For s=1 when the b-metric space under consideration is a simple metric space, the above corollary coincides with [[1], Corollary 4.4]. Thus the conclusions of Corollary 3.12 are consequences of the results of Matkowski [21].

4 Application and illustrative example

The following example illuminates the degree of generality of our result.

Example 4.1 Let X:={ x 1 , x 2 , x 3 }. Define a function d:X×X R + as

d ( x 1 , x 2 ) = 1 k 2 , d ( x 2 , x 3 ) = 1 k 1 , d ( x 1 , x 3 ) = 1 k , d ( x i , x j ) = d ( x j , x i ) and d ( x i , x i ) = 0 for all  i , j = 1 , 2 , 3 ,

where k3 is any positive integers. It is an easy exercise to see that d is a b-metric with coefficient s k 2 k 2 1 >1. Define f:XX as

f x 1 = x 1 ,f x 2 = x 1 ,f x 3 = x 2 .

Setting φ(t)= t 2 on J=[0, 1 k 1 ] then φ is a b-Bianchini-Grandolfi gauge function with coefficient k 2 ( k 2 1 ) having order 2. Moreover, it is easily seen that all conditions of Theorem 3.7 are satisfied.

On the other hand, assume that x 1 , x 2 , x 3 are real numbers and the set { x 1 , x 2 , x 3 } is endowed with the Euclidean metric d e . For each gauge function φ defined on some interval [0,h) one can find 1 n 0 [0,h) for some n 0 N. In such a case, identifying x 1 = 1 n 0 , x 2 = 2 n 0 , x 3 = 3 n 0 , we assume f as defined above; then w.r.t. Euclidean metric d e we have

d e ( f 2 n 0 , f 3 n 0 ) = d e ( 1 n 0 , 2 n 0 ) = 1 n 0 φ ( d e ( 2 n 0 , 3 n 0 ) ) =φ ( 1 n 0 ) ,

which contradicts the definition of φ. Hence, one cannot invoke the main results of Proinov [[1], Theorems 4.1, 4.2, Corollary 4.4].

Theorem 4.2 Consider the following initial value problem:

x (t)=f ( t , x ( t ) ) ,x( t 0 )= x 0 .
(4.1)

Assume that the following conditions hold:

  1. (i)

    f is continuous;

  2. (ii)

    f satisfies the condition

    |f(t,x)f(t,y)|k|x(t)y(t) | r for (t,x),(t,y)R;
    (4.2)
  3. (iii)

    f is bounded on R, i.e.,

    |f(t,x)| k r 2 ,
    (4.3)

where R={(t,x):|t t 0 | ( 1 k ) r 1 ,|x x 0 | k 2 }, r2 and 0<k<1.

Then the initial value problem (4.1) has a unique solution on the interval I=[ t 0 ( 1 k ) r 1 , t 0 + ( 1 k ) r 1 ].

Proof Let C(I) be the space of all continuous real valued functions on I where I=[ t 0 ( 1 k ) r 1 , t 0 + ( 1 k ) r 1 ] with the usual supremum metric, i.e.,

d(x,y)= max t I |x(t)y(t)|.

Integrating (4.1) gives

x(t)= x 0 + t 0 t f ( τ , x ( τ ) ) dτ.
(4.4)

Indeed finding the solution of initial value problem (4.1) is equivalent to finding the fixed point of the self-mapping T:XX defined by

Tx(t)= x 0 + t 0 t f ( τ , x ( τ ) ) dτ,
(4.5)

where X={xC(I):|x(t) x 0 | k 2 ;k>0}; then X is a closed subspace of C(I). We see that if τI, then |τ t 0 | ( 1 k ) r 1 and xX gives |x(τ) x 0 | k 2 . Thus (τ,x(τ))R, and since f is continuous on R, the integral in (4.5) exists and T is defined for each xX. To see this, observe that T maps X to itself. We use (4.5) to write

| T x ( t ) x 0 | = | t 0 t f ( τ , x ( τ ) ) d τ | t 0 t | f ( τ , x ( τ ) ) | d τ k r 2 | t t 0 | ( using (4.3) ) k r 2 ( 1 k ) r 1 = k 2 .

Now by using (4.2) we have

| T x ( t ) T y ( t ) | t 0 t | f ( τ , x ( τ ) ) f ( τ , y ( τ ) ) | d τ k t 0 t | x ( τ ) y ( τ ) | r d τ k ( max τ I | x ( τ ) y ( τ ) | ) r | t t 0 | k ( max τ I | x ( τ ) y ( τ ) | ) r ( 1 k ) r 1 = ( 1 k ) r 2 ( max τ I | x ( τ ) y ( τ ) | ) r .
(4.6)

Thus (4.6) implies

d(Tx,Ty) ( 1 k ) r 2 ( d ( x , y ) ) r .
(4.7)

We take J=[0,k]. Thus it suffices to take φ(u)= ( 1 k ) r 2 u r for u[0,k], k<1; then φ is a gauge function of order r2. Also, for uJ{0} we have

φ(u)= ( 1 k ) r 2 u r = ( 1 k ) r 2 u 2 u r 2 ( 1 k ) r 2 u 2 k r 2 = u 2 <u.
(4.8)

Thus from (4.7) we obtain d(Tx,Ty)φ(d(x,y)) for all x,yX and d(x,y)J. Further, for any xX it is easily seen that d(x, x 0 ) k 2 , which yields d(x,y)k for x,yX. Therefore, all the conditions of Corollary 3.12 are satisfied. Hence the iterative sequence x n =T x n 1 ; n=1,2, converges to the unique fixed point t of T at a rate of convergence r2. On the other hand, Picard’s iterations converge to the solution linearly. □

5 Conclusion

In Section 3 we have established two convergence theorems in the setting of a b-metric such that the self-mapping satisfies a contraction condition involving a gauge function of order r1. The gauge function φ has to satisfy the condition n = 0 s n φ n (t)< where s1 is the coefficient of the underlying b-metric space. An example has been furnished to assess the degree of generality of our results. In Section 4 we established an existence theorem for the solution of an initial value problem, which not only gives the unique solution but also locates the domain for the solution.

References

  1. Proinov PD: A generalization of the Banach contraction principle with high order of convergence of successive approximations. Nonlinear Anal. 2007, 67: 2361–2369. 10.1016/j.na.2006.09.008

    Article  MathSciNet  MATH  Google Scholar 

  2. Mysovskih IP: On the convergence of L.V. Kantorovic’s method of solution of functional equations and its applications. Dokl. Akad. Nauk SSSR 1950, 70: 565–568. (in Russian)

    MathSciNet  Google Scholar 

  3. Rheinboldt WC: A unified convergence theory for a class of iterative processes. SIAM J. Numer. Anal. 1968, 5: 42–63. 10.1137/0705003

    Article  MathSciNet  MATH  Google Scholar 

  4. Gel’man A: A certain fixed-point principle. Dokl. Akad. Nauk SSSR 1950, 198: 506–508. (in Russian); Sov. Math., Dokl. 12, 813–816 (1971) (Engl. transl.)

    MathSciNet  Google Scholar 

  5. Huang ZD: On Newton’s method under Holder continuous derivative. J. Math. Anal. Appl. 2002, 270: 332–339. 10.1016/S0022-247X(02)00060-4

    Article  MathSciNet  MATH  Google Scholar 

  6. Kiran Q, Kamran T: Nadler’s type principle with higher order of convergence. Nonlinear Anal. 2008, 69: 4106–4120. 10.1016/j.na.2007.10.041

    Article  MathSciNet  MATH  Google Scholar 

  7. Bakhtin IA: The contraction mapping principle in almost metric spaces. 30. In Functional Analysis. Ul’yanovsk Gos. Ped. Inst., Ul’yanovsk; 1989:26–37.

    Google Scholar 

  8. Heinonen J: Lectures on Analysis on Metric Spaces. Springer, Berlin; 2001.

    Book  MATH  Google Scholar 

  9. Bourbaki N: Topologie générale. Hermann, Paris; 1974.

    MATH  Google Scholar 

  10. Boriceanu M, Bota M, Petruşel A: Multivalued fractals in b -metric spaces. Cent. Eur. J. Math. 2010,8(2):367–377. 10.2478/s11533-010-0009-4

    Article  MathSciNet  MATH  Google Scholar 

  11. Czerwik S: Nonlinear set-valued contraction mappings in b -metric spaces. Atti Semin. Mat. Fis. Univ. Modena 1998, 46: 263–276.

    MathSciNet  MATH  Google Scholar 

  12. Berinde V: Generalized contractions in quasimetric spaces. Seminar on Fixed Point Theory 1993, 3–9.

    Google Scholar 

  13. Czerwik S: Functional Equations and Inequalities in Several Variables. World Scientific, Singapore; 2002.

    Book  MATH  Google Scholar 

  14. Bota M, Molnar A, Varga C: On Ekeland’s variational principle in b -metric spaces. Fixed Point Theory 2011,12(1):21–28.

    MathSciNet  MATH  Google Scholar 

  15. Hicks TL, Rhoades BE: A Banach type fixed point theorem. Math. Jpn. 1979, 24: 327–330.

    MathSciNet  MATH  Google Scholar 

  16. Bianchini RM, Grandolfi M: Trasformazioni di tipo contrattivo generalizzato in uno spazio metrico. Atti Accad. Naz. Lincei, Rend. Cl. Sci. Fis. Mat. Nat. 1968, 45: 212–216.

    MathSciNet  MATH  Google Scholar 

  17. Hicks TL: Another view of fixed point theory. Math. Jpn. 1990, 35: 231–234.

    MathSciNet  MATH  Google Scholar 

  18. Ortega JM, Rheinboldt WC: Iterative Solutions of Nonlinear Equations in Several Variables. Academic Press, New York; 1970.

    Google Scholar 

  19. Kornstaedt HJ: Funktionalungleichungen und iterationsverfahren. Aequ. Math. 1975, 13: 21–45. 10.1007/BF01834116

    Article  MathSciNet  MATH  Google Scholar 

  20. Park S: A unified approach to fixed points of contractive maps. J. Korean Math. Soc. 1980, 16: 95–105.

    MATH  Google Scholar 

  21. Matkowski J: Integrable solutions of functional equations. Diss. Math. 1975, 127: 1–68.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Samreen.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

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

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Samreen, M., Kiran, Q. & Kamran, T. Fixed point theorems for φ-contractions. J Inequal Appl 2014, 266 (2014). https://doi.org/10.1186/1029-242X-2014-266

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2014-266

Keywords