1 Introduction and preliminaries

In 1994, in [1] Matthews introduced the notion of a partial metric space and proved the contraction principle of Banach in this new framework. Next, many fixed-point theorems in partial metric spaces have been given by several mathematicians. Recently Haghi et al. published [2] a paper which stated that we should ‘be careful on partial metric fixed point results’ along with giving some results. They showed that fixed-point generalizations to partial metric spaces can be obtained from the corresponding results in metric spaces.

In this paper, we extend the p-metric space to an M-metric space, and we shall show that our definition is a real generalization of the p-metric by presenting some examples. In the sequel we prove some of the main theorems by generalized contractions for getting fixed points and common fixed points for mappings.

Definition 1.1 ([1], [[3], Definition 1.1])

A partial metric on a nonempty set X is a function p:X×X R + such that for all x,y,zX:

  • (p1) p(x,x)=p(y,y)=p(x,y)x=y,

  • (p2) p(x,x)p(x,y),

  • (p3) p(x,y)=p(y,x),

  • (p4) p(x,y)p(x,z)+p(z,y)p(z,z).

A partial metric space is a pair (X,p) such that X is a nonempty set and p is a partial metric on X.

Notation The following notation is useful in the sequel.

  1. 1.

    m x y :=min{m(x,x),m(y,y)},

  2. 2.

    M x y :=max{m(x,x),m(y,y)}.

Now we want to extend Definition 1.1 as follows.

Definition 1.2 Let X be a nonempty set. A function m:X×X R + is called an m-metric if the following conditions are satisfied:

  • (m1) m(x,x)=m(y,y)=m(x,y)x=y,

  • (m2) m x y m(x,y),

  • (m3) m(x,y)=m(y,x),

  • (m4) (m(x,y) m x y )(m(x,z) m x z )+(m(z,y) m z y ).

Then the pair (X,m) is called an M-metric space.

According to the above definition the condition (p1) in the definition of [1] changes to (m1), and (p2) is expressed for p(x,x) where p(y,y)=0 may become p(y,y)0. Thus we improve that condition by replacing it by min{p(x,x),p(y,y)}p(x,y), and also we improve the condition (p4) extending it to the form of (m4). In the sequel we present an example that holds for the m-metric but not for the p-metric.

Remark 1.1 For every x,yX

  1. 1.

    0 M x y + m x y =m(x,x)+m(y,y),

  2. 2.

    0 M x y m x y =|m(x,x)m(y,y)|,

  3. 3.

    M x y m x y ( M x z m x z )+( M z y m z y ).

The next examples show that m s and m w are ordinary metrics.

Example 1.1 Let X:=[0,). Then m(x,y)= x + y 2 on X is an m-metric.

Example 1.2 Let m be an m-metric. Put

  1. 1.

    m w (x,y)=m(x,y)2 m x y + M x y ,

  2. 2.

    m s (x,y)=m(x,y) m x y when xy and m s (x,y)=0 if x=y.

Then m w and m s are ordinary metrics.

Proof If m w (x,y)=0, then

m(x,y)=2 m x y M x y .
(1)

But from equation (1) and m x y m(x,y) we get m x y = M x y =m(x,x)=m(y,y), so by equation (1) we obtain m(x,y)=m(x,x)=m(y,y) and therefore x=y. For the triangle inequality it is enough that we consider Remark 1.1 and (m4). □

Remark 1.2 For every x,yX

  1. 1.

    m(x,y) M x y m w (x,y)m(x,y)+ M x y ,

  2. 2.

    (m(x,y) M x y ) m s (x,y)m(x,y).

In other words

| m w ( x , y ) m ( x , y ) | M x y , | m s ( x , y ) m ( x , y ) | M x y .

In the following example we present an example of an m-metric which is not a p-metric.

Example 1.3 Let X={1,2,3}; define

m ( 1 , 1 ) = 1 , m ( 2 , 2 ) = 9 , m ( 3 , 3 ) = 5 , m ( 1 , 2 ) = m ( 2 , 1 ) = 10 , m ( 1 , 3 ) = m ( 3 , 1 ) = 7 , m ( 3 , 2 ) = m ( 2 , 3 ) = 7 .

So m is an m-metric, but it is not p-metric.

Example 1.4 Let (X,d) be a metric space. Let ϕ:[0,)[ϕ(0),) be a one to one and nondecreasing or strictly increasing mapping, with ϕ(0) defined such that

ϕ(x+y)ϕ(x)+ϕ(y)ϕ(0),x,y0.

Then m(x,y)=ϕ(d(x,y)) is an m-metric.

Proof (m1), (m2), and (m3) are clear. For (m4) we have

ϕ ( d ( x , y ) ) ϕ ( d ( x , z ) + d ( z , y ) ) ϕ ( d ( x , z ) ) + ϕ ( d ( z , y ) ) ϕ ( 0 ) , ( ϕ ( d ( x , y ) ) ϕ ( 0 ) ) ( ϕ ( d ( x , z ) ) ϕ ( 0 ) ) + ( ϕ ( d ( z , y ) ) ϕ ( 0 ) ) , ( m ( x , y ) m x y ) ( m ( x , z ) m x z ) + ( m ( z , y ) m z y ) .

 □

Example 1.5 Let (X,d) be a metric space. Then m(x,y)=ad(x,y)+b where a,b>0 is an m-metric, because we can put ϕ(t)=at+b.

Remark 1.3 According to Example 1.5, by the Banach contraction

k[0,1),m(Tx,Ty)km(x,y),for all x,yX,

we have

m(Tx,Ty)=ad(Tx,Ty)+bkad(x,y)+kbd(Tx,Ty)kd(x,y)+ b ( k 1 ) a ,

which does not imply the ordinary Banach contraction

k[0,1),d(Tx,Ty)kd(x,y),for all x,yX,

for all self-maps T on X. Thus, this states that even if the m-metric m and the ordinary metric d have the same topology, the Banach contraction of the m-metric does not imply the Banach contraction of the ordinary metric d.

Lemma 1.1 Every p-metric is an m-metric.

Proof Let m be a p-metric. It is enough that we consider the following cases:

  1. 1.

    m(x,x)=m(y,y)=m(z,z),

  2. 2.

    m(x,x)<m(y,y)<m(z,z),

  3. 3.

    m(x,x)=m(y,y)<m(z,z),

  4. 4.

    m(x,x)=m(y,y)>m(z,z),

  5. 5.

    m(x,x)<m(y,y)=m(z,z),

  6. 6.

    m(x,x)>m(y,y)=m(z,z).

For example, to prove (2), we have

m ( x , y ) m ( x , z ) + m ( z , y ) m ( z , z ) , m ( x , y ) m ( x , z ) + m ( z , y ) m ( y , y ) , m ( x , y ) m ( x , x ) m ( x , z ) m ( x , x ) + m ( z , y ) m ( y , y ) , m ( x , y ) m x , y m ( x , z ) m x , z + m ( z , y ) m z , y .

 □

2 Topology for M-metric space

It is clear that each m-metric p on X generates a T 0 topology τ m on X. The set

{ B m ( x , ε ) : x X , ε > 0 } ,

where

B m (x,ε)= { y X : m ( x , y ) < m x , y + ε } ,

for all xX and ε>0, forms a base of τ m .

Definition 2.1 Let (X,m) be a m-metric space. Then:

  1. 1.

    A sequence { x n } in a M-metric space (X,m) converges to a point xX if and only if

    lim n ( m ( x n , x ) m x n , x ) =0.
    (2)
  2. 2.

    A sequence { x n } in a M-metric space (X,m) is called an m-Cauchy sequence if

    lim n , m ( m ( x n , x m ) m x n , x m ) , lim n , m ( M x n , x m m x n , x m )
    (3)

    exist (and are finite).

  3. 3.

    An M-metric space (X,m) is said to be complete if every m-Cauchy sequence { x n } in X converges, with respect to τ m , to a point xX such that

    ( lim n ( m ( x n , x ) m x n , x ) = 0 & lim n ( M x n , x m x n , x ) = 0 ) .

Lemma 2.1 Let (X,m) be a m-metric space. Then:

  1. 1.

    { x n } is an m-Cauchy sequence in (X,m) if and only if it is a Cauchy sequence in the metric space (X, m w ).

  2. 2.

    An M-metric space (X,m) is complete if and only if the metric space (X, m w ) is complete. Furthermore,

    lim n m w ( x n ,x)=0 ( lim n ( m ( x n , x ) m x n , x ) = 0 , lim n ( M x n , x m x n , x ) = 0 ) .

Likewise the above definition holds also for m s .

Lemma 2.2 Assume that x n x and y n y as n in an M-metric space (X,m). Then

lim n ( m ( x n , y n ) m x n , y n ) =m(x,y) m x y .

Proof We have

| ( m ( x n , y n ) m x n , y n ) ( m ( x , y ) m x , y ) | ( m ( x n , x ) m x n , x ) + ( m ( y , y n ) m y , y n ) .

 □

From Lemma 2.2 we deduce the following lemma.

Lemma 2.3 Assume that x n x as n in an M-metric space (X,m). Then

lim n ( m ( x n , y ) m x n , y ) =m(x,y) m x , y ,

for all yX.

Lemma 2.4 Assume that x n x and x n y as n in an M-metric space (X,m). Then m(x,y)= m x y . Furthermore, if m(x,x)=m(y,y), then x=y.

Proof By Lemma 2.2 we have

0= lim n ( m ( x n , x n ) m x n , x n ) =m(x,y) m x y .

 □

Lemma 2.5 Let { x n } be a sequence in an m-metric space (X,m), such that

r[0,1),m( x n + 1 , x n )rm( x n , x n 1 ),nN.
(4)

Then

  1. (A)

    lim n m( x n , x n 1 )=0,

  2. (B)

    lim n m( x n , x n )=0,

  3. (C)

    lim m , n m x m x n =0,

  4. (D)

    { x n } is an m-Cauchy sequence.

Proof From equation (4) we have

m( x n , x n 1 )rm( x n 1 , x n 2 ) r 2 m( x n 2 , x n 3 ) r n m( x 0 , x 1 ),

thus,

lim n m( x n , x n 1 )=0,

which implies that (A) holds.

From (m2) and (A) we have

lim n min { m ( x n , x n ) , m ( x n 1 , x n 1 ) } = lim n m x n x n 1 lim n m( x n , x n 1 )=0.

That is, (B) holds.

Clearly, (C) holds, since lim n m( x n , x n )=0. □

Theorem 2.1 The topology τ m is not Hausdorff.

Proof Let x,y,zX be such that

a:=m(x,x)<m(z,z)= a + b 2 <b:=m(y,y)

with

b 2 < k 2 <m(x,y)< M x , y =b,r:=2m(x,y)ab>0

and

max { m ( x , z ) , m ( z , y ) } ( 2 m ( x , y ) k ) ε r ;

without loss of generality we assume that for each ε>0 we have ε<r. We want to show that the intersection of the following neighborhoods is not empty:

U x = { z X : m ( x , z ) m x z < ε } , V y = { z X : m ( y , z ) m y z < ε } .

To prove z U x , we have

m ( x , z ) < ( 2 m ( x , y ) k ) ε r , m ( x , z ) m x z < ( 2 m ( x , y ) k ) ε r a < ( 2 m ( x , y ) k a ) ε r < ( 2 m ( x , y ) a b ) ε r = ε

and for z V y

m ( y , z ) < ( 2 m ( x , y ) k ) ε r , m ( x , z ) m y z < ( 2 m ( x , y ) k ) ε r a + b 2 < ( 2 m ( x , y ) k ) ε r a + b 2 ε r < ( 2 m ( x , y ) k a + b 2 ) ε r < ( 2 m ( x , y ) a b ) ε r = ε ,

so we can find x,yX such that for all nonempty neighborhoods U x of x and V y of y we have U x V y . □

3 Fixed point results on M-metric space

Theorem 3.1 Let (X,m) be a complete M-metric space and let T:XX be a mapping satisfying the following condition:

k[0,1) such that m(Tx,Ty)km(x,y)for all x,yX.
(5)

Then T has a unique fixed point.

Proof Let x 0 X and x n :=T x n 1 , so we have

m( x n , x n 1 )=m(T x n 1 ,T x n 2 )km( x n 1 , x n 2 )
(6)

and so (A), (B), (C), and (D) of Lemma 2.5 hold. By completeness of X we get x n x for some xX. Thus by equation (5) m(T x n ,Tx)km( x n ,x)0. Hence by (m2) m T x n , T x m(T x n ,Tx)0 so by equation (2) T x n Tx.

Contraction (5) implies that m( x n ,T x n )0 and m(Tx,Tx)<m(x,x). Since m x n , T x n 0, by Lemma 2.2, we get m(x,Tx)= m x , T x =m(Tx,Tx).

On the other hand, by Lemma 2.2 and x n =T x n 1 x,

0= lim n ( m ( x n , T x n ) m x n , T x n ) = lim n ( m ( x n , x n 1 ) m x n , T x n ) =m(x,x) m x , T x ,

thus m(x,x)=m(x,Tx). Since m(x,Tx)= m x , T x =m(Tx,Tx) now by (m1) x=Tx. Uniqueness by the contraction (5) is clear. □

Theorem 3.2 Let (X,m) be a complete M-metric space and let T:XX be a mapping satisfying the following condition:

k[0, 1 2 ) such that m(Tx,Ty)k ( m ( x , T x ) + m ( y , T y ) ) for all x,yX.
(7)

Then T has an unique fixed point.

Proof Let x 0 X and x n :=T x n 1 , so we have

m ( x n , x n 1 ) = m ( T x n 1 , T x n 2 ) k ( m ( x n 1 , x n ) + m ( x n 2 , x n 1 ) ) .

So

m( x n , x n 1 )rm( x n 2 , x n 1 ),

where 0r= k 1 k <1.

By Lemma 2.5 and completeness of X, x n x for some xX. So

m( x n ,x) m x n , x 0, M x n , x m x n , x 0,

and since m x n , x 0, we have m( x n ,x)0 and M x n , x 0. Therefore by Remark 1.1, m(x,x)=0= m x , T x ;

m( x n + 1 ,Tx)=m(T x n ,Tx)k ( m ( x n , x n + 1 ) + m ( x , T x ) ) ,

hence by m( x n , x n + 1 )0

lim sup n m( x n + 1 ,Tx)= lim sup n m(T x n ,Tx)km(x,Tx).

On the other hand

m(x,Tx) m x , T x m(x, x n )+m( x n ,Tx)

implies that

m(x,Tx) lim sup n ( m ( x , x n ) + m ( x n , T x ) ) km(x,Tx),

because m x , T x =0 and m( x n ,x)0. So m(x,Tx)=0. Now by contraction (7) we have m(Tx,Tx)2km(x,Tx)=0, so m(Tx,Tx)=0=m(x,x)=m(x,Tx), thus x=Tx by (m1). □

The next theorem is still open.

Theorem 3.3 Let (X,m) be a complete M-metric space and let T:XX be a mapping satisfying the following condition:

k[0, 1 2 ) such that m(Tx,Ty)k ( m ( x , T y ) + m ( T x , y ) ) for all x,yX.
(8)

Then T has a unique fixed point.