Next Article in Journal
Qualitative Analyses of Integro-Fractional Differential Equations with Caputo Derivatives and Retardations via the Lyapunov–Razumikhin Method
Next Article in Special Issue
Fixed Points Results for Various Types of Tricyclic Contractions
Previous Article in Journal
Non-Standard Discrete RothC Models for Soil Carbon Dynamics
Previous Article in Special Issue
Some Fixed Point Results in b-Metric Spaces and b-Metric-Like Spaces with New Contractive Mappings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Banach Contraction Principle and Meir–Keeler Type of Fixed Point Theorems for Pre-Metric Spaces

Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 802, Taiwan
Axioms 2021, 10(2), 57; https://doi.org/10.3390/axioms10020057
Submission received: 6 March 2021 / Revised: 3 April 2021 / Accepted: 5 April 2021 / Published: 9 April 2021
(This article belongs to the Special Issue Theory and Application of Fixed Point)

Abstract

:
The fixed point theorems in so-called pre-metric spaces is investigated in this paper. The main issue in the pre-metric space is that the symmetric condition is not assumed to be satisfied, which can result in four different forms of triangle inequalities. In this case, the fixed point theorems in pre-metric space will have many different styles based on the different forms of triangle inequalities.

1. Introduction

In this paper, we consider a so-called pre-metric space that does not assume the symmetric condition. We first recall the basic concept of (conventional) metric space as follows.
Given a nonempty universal set X, let d : X × X R + be a nonnegative real-valued function defined on the product set X × X . Recall that ( X , d ) is a metric space when the following conditions are satisfied:
  • d ( x , y ) = 0 implies x = y for any x , y X ;
  • d ( x , x ) = 0 for any x X ;
  • d ( x , y ) = d ( y , x ) for any x , y X ;
  • d ( x , z ) d ( x , y ) + d ( y , z ) for any x , y , z X .
Different kinds of spaces that weaken the above conditions have been proposed. Wilson [1] says that ( X , d ) is a quasi-metric space when the symmetric condition is not satisfied. More precisely, ( X , d ) is a quasi-metric space when the following conditions are satisfied:
  • d ( x , y ) = 0 if and only if x = y for any x , y X ;
  • d ( x , z ) d ( x , y ) + d ( y , z ) for any x , y , z X .
Many authors (by referring to [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16] and the references therein) also defined the different type of quasi-metric space as follows:
  • d ( x , y ) = 0 = d ( y , x ) if and only if x = y for any x , y X ;
  • d ( x , z ) d ( x , y ) + d ( y , z ) for any x , y , z X .
In the Wilson’s sense, it is obvious that we also have d ( y , x ) = 0 if and only if y = x . Wilson [17] also says that ( X , d ) is a semi-metric space when the triangle inequality is not satisfied. More precisely, the following conditions are satisfied:
  • d ( x , y ) = 0 if and only if x = y for any x , y X ;
  • d ( x , y ) = d ( y , x ) for any x , y X .
Matthews [11] proposed the concept of partial metric space that satisfies the following conditions:
  • x = y if and only if d ( x , x ) = d ( x , y ) = d ( y , y ) for any x , y X ;
  • d ( x , x ) d ( x , y ) for any x , y X ;
  • d ( x , y ) = d ( y , x ) for any x , y X .
  • d ( x , z ) d ( x , y ) + d ( y , z ) d ( y , y ) for any x , y , z X .
The partial metric space does not assume the self-distance condition d ( x , x ) = 0 .
In this paper, we consider a so-called pre-metric space by assuming that
d ( x , y ) = 0   implies   x = y   for   any   x , y X .
The triangle inequality always plays a very important role in the study of metric space. Without considering the symmetric condition, the triangle inequalities can be considered in four different forms by referring to Wu [18]. The purpose of this paper is to establish the fixed point theorems in pre-metric space based on the different forms of triangle inequalities. We separately study the Banach contraction principle and Meir–Keeler type of fixed point theorems for pre-metric spaces. On the other hand, three types of contraction functions are considered in this paper. We also mention that the Meir–Keeler type of fixed point theorems in the context of b-metric spaces have been studied by Pavlović and Radenović [19].
This paper is organized as follows. In Section 2, four different forms of triangle inequalities in pre-metric space are presented. Many basic properties are also provided for further study. In Section 3, based on the different forms of triangle inequalities, many concepts of Cauchy sequences in pre-metric space are proposed in order to establish the fixed point theorems in pre-metric space. In Section 4, three different types of contraction functions are considered to establish the fixed point theorems using the different forms of triangle inequalities.

2. Pre-Metric Spaces

We formally introduce the basic concept of pre-metric space by considering four different forms of triangle inequalities as follows.
Definition 1.
Given a nonempty universal set X, let d be a mapping from X × X into R + .
  • The metric d is said to satisfy the ⋈-triangle inequality when the following inequality is satisfied:
    d ( x , y ) + d ( y , z ) d ( x , z )   f o r   a l l   x , y , z X .
  • The metric d is said to satisfy the ▹-triangle inequality when the following inequality is satisfied:
    d ( x , y ) + d ( z , y ) d ( x , z )   f o r   a l l   x , y , z X .
  • The metric d is said to satisfy the ◃-triangle inequality when the following inequality is satisfied:
    d ( y , x ) + d ( y , z ) d ( x , z )   f o r   a l l   x , y , z X .
  • The metric d is said to satisfy the ⋄-triangle inequality when the following inequality is satisfied:
    d ( y , x ) + d ( z , y ) d ( x , z )   f o r   a l l   x , y , z X .
Suppose that d satisfies the symmetric condition. It is clear to see that all the concepts of ⋈-triangle inequality, ▹-triangle inequality, ◃-triangle inequality and ⋄-triangle inequality described above are all equivalent. This means that the pre-metric space extends the concept of (conventional) metric space.
Remark 1.
Now, we represent some interesting observations that are used in the study.
  • Suppose that the metric d satisfies the -triangle inequality. Then, we have
    d ( a , b ) + d ( b , c ) + d ( c , d ) d ( a , c ) + d ( c , d ) d ( a , d ) .
    We also see that
    d ( b , a ) + d ( c , b ) = d ( c , b ) + d ( b , a ) d ( c , a ) ,
    which implies
    d ( b , a ) + d ( c , b ) + d ( d , c ) d ( d , a ) .
    In general, we can have the following inequalities
    d ( x 1 , x 2 ) + d ( x 2 , x 3 ) + + d ( x p , x p + 1 ) d ( x 1 , x p + 1 )
    and
    d ( x 2 , x 1 ) + d ( x 3 , x 2 ) + + d ( x p + 1 , x p ) d ( x p + 1 , x 1 ) .
  • Suppose that the metric d satisfies the -triangle inequality. Since
    d ( a , b ) + d ( c , b ) d ( a , c )   a n d   d ( c , b ) + d ( a , b ) d ( c , a ) ,
    we see that
    d ( a , b ) + d ( c , b ) = d ( c , b ) + d ( a , b ) max d ( a , c ) , d ( c , a ) .
    Therefore, we obtain
    d ( a , b ) + d ( c , b ) + d ( d , c ) max d ( a , d ) , d ( d , a ) .
    In general, we can have the following inequalities
    d ( x 1 , x 2 ) + d ( x 3 , x 2 ) + d ( x 4 , x 3 ) + + d ( x p + 1 , x p ) max d ( x 1 , x p + 1 ) , d ( x p + 1 , x 1 ) .
  • Suppose that the metric d satisfies the -triangle inequality. Since
    d ( b , a ) + d ( b , c ) = d ( b , c ) + d ( b , a ) max d ( a , c ) , d ( c , a ) ,
    we see that
    d ( b , a ) + d ( b , c ) + d ( c , d ) max d ( a , d ) , d ( d , a ) .
    In general, we can have the following inequalities
    d ( x 2 , x 1 ) + d ( x 2 , x 3 ) + d ( x 3 , x 4 ) + + d ( x p , x p + 1 ) max d ( x 1 , x p + 1 ) , d ( x p + 1 , x 1 ) .
  • Suppose that the metric d satisfies the ⋄-triangle inequality. Then, we have
    d ( a , b ) + d ( b , c ) + d ( d , c ) = d ( b , c ) + d ( a , b ) + d ( d , c ) d ( c , a ) + d ( d , c ) d ( a , d )
    and
    d ( b , a ) + d ( c , b ) + d ( c , d ) d ( a , c ) + d ( c , d ) = d ( c , d ) + d ( a , c ) d ( d , a ) .
    In general, we consider the following cases.
    (a)  
    Suppose that p is an even number. Then, we have the following inequalities
    d ( x 1 , x 2 ) + d ( x 2 , x 3 ) + d ( x 4 , x 3 ) + d ( x 4 , x 5 ) + d ( x 6 , x 5 ) + d ( x 6 , x 7 ) + + d ( x p , x p + 1 ) d ( x p + 1 , x 1 )
    and
    d ( x 2 , x 1 ) + d ( x 3 , x 2 ) + d ( x 3 , x 4 ) + d ( x 5 , x 4 ) + d ( x 5 , x 6 ) + d ( x 7 , x 6 ) + + d ( x p + 1 , x p ) d ( x 1 , x p + 1 ) .
    (b)  
    Suppose that p is an odd number. Then, we have the following inequalities
    d ( x 1 , x 2 ) + d ( x 2 , x 3 ) + d ( x 4 , x 3 ) + d ( x 4 , x 5 ) + d ( x 6 , x 5 ) + d ( x 6 , x 7 ) + + d ( x p , x p + 1 ) d ( x 1 , x p + 1 )
    and
    d ( x 2 , x 1 ) + d ( x 3 , x 2 ) + d ( x 3 , x 4 ) + d ( x 5 , x 4 ) + d ( x 5 , x 6 ) + d ( x 7 , x 6 ) + + d ( x p + 1 , x p ) d ( x p + 1 , x 1 ) .
Definition 2
(Wu [18]). Given a nonempty universal set X, let d be a mapping from X × X into R + . We say that ( X , d ) is a pre-metric space when d ( x , y ) = 0 implies x = y for any x , y X .
Proposition 1
(Wu [18]). Given a nonempty universal set X, let d be a mapping from X × X into R + . Suppose that the following conditions are satisfied:
  • d ( x , x ) = 0 for all x X ;
  • d satisfies the -triangle inequality or the ◃-triangle inequality or the -triangle inequality.
Then d satisfies the symmetric condition.
We also remark that Proposition 4.4 in Wu [18] is redundant and it can be omitted.

3. Cauchy Sequences in Pre-Metric Space

Let ( X , d ) be a pre-metric space. Many different concepts of limit are proposed below because of lacking the symmetric condition.
Definition 3.
Let ( X , d ) be a pre-metric space, and let { x n } n = 1 be a sequence in X.
  • We write x n d x as n when d ( x n , x ) 0 as n .
  • We write x n d x as n when d ( x , x n ) 0 as n .
  • We write x n d x as n when
    lim n d ( x n , x ) = lim n d ( x , x n ) = 0 .
The uniqueness of limits are given below.
Proposition 2
(Wu [18]). Let ( X , d ) be a pre-metric space, and let { x n } n = 1 be a sequence in X.
(i)  
Suppose that the metric d satisfies the -triangle inequality or -triangle inequality. If x n d x and x n d y , then x = y .
(ii)  
Suppose that the metric d satisfies the -triangle inequality. If x n d x and x n d y , then x = y . In other words, the d -limit is unique.
(iii)  
Suppose that the metric d satisfies the -triangle inequality. If x n d x and x n d y , then x = y . In other words, the d -limit is unique.
Without the symmetric condition, the different concepts of Cauchy sequences are also presented below.
Definition 4.
Let ( X , d ) be a pre-metric space, and let { x n } n = 1 be a sequence in X.
  • We say that { x n } n = 1 is a>-Cauchy sequence when, given any ϵ > 0 , there exists an integer N such that d ( x m , x n ) < ϵ for all pairs ( m , n ) of integers m and n with m > n N .
  • We say that { x n } n = 1 is a<-Cauchy sequence when, given any ϵ > 0 , there exists an integer N such that d ( x n , x m ) < ϵ for all pairs ( m , n ) of integers m and n with m > n N .
  • We say that { x n } n = 1 is a Cauchy sequence when, given any ϵ > 0 , there exists an integer N such that d ( x m , x n ) < ϵ and d ( x n , x m ) < ϵ for all pairs ( m , n ) of integers m and n with m , n N and m n .
We can also consider the different concepts of completeness for pre-metric space.
Definition 5.
Let ( X , d ) be a pre-metric space.
  • We say that ( X , d ) is ( > , ) -complete when each >-Cauchy sequence is convergent in the sense of x n d x .
  • We say that ( X , d ) is ( > , ) -complete when each >-Cauchy sequence is convergent in the sense of x n d x .
  • We say that ( X , d ) is ( < , ) -complete when each <-Cauchy sequence is convergent in the sense of x n d x .
  • We say that ( X , d ) is ( < , ) -complete when each <-Cauchy sequence is convergent in the sense of x n d x .
  • We say that ( X , d ) is ◃-complete when each Cauchy sequence is convergent in the sense of x n d x .
  • We say that ( X , d ) is ▹-complete when each Cauchy sequence is convergent in the sense of x n d x .
Based on the above different concepts of completeness, we establish many fixed point theorems in pre-metric space by using the different types of triangle inequalities. Next, we present some examples to demonstrate the completeness.
Let S be a bounded subset S of R k containing infinitely many points. The Bolzano–Weierstrass theorem says that there exists at least one accumulation point of S, where the concept of accumulation point is based on the usual topology induced by the conventional metric. When the metric does not satisfy the symmetric condition, Wu [18] has proposed two different concepts of open balls given by
B ( x ; r ) = y X : d ( x , y ) < r
and
B ( x ; r ) = y X : d ( y , x ) < r ,
which can induces two respective topologies as follows
τ = O X : x O   if   and   only   if   there   exist   r > 0   such   that   x B ( x ; r ) O .
and
τ = O X : x O   if   and   only   if   there   exist   r > 0   such   that   x B ( x ; r ) O .
In this case, we can similarly define the concepts of ◃-accumulation point and ▹-accumulation point based on the open balls B ( x ; r ) and B ( x ; r ) , respectively. Therefore, we can similarly obtain the ◃-type of Bolzano–Weierstrass theorem and ▹-type of Bolzano–Weierstrass theorem by considering the ◃-accumulation point and ▹-accumulation point, respectively, which is used to present the completeness in R .
Example 1.
We are going to claim that every >-Cauchy sequence in R + is convergent in the sense of x n d x with respect to a pre-metric d : R + × R + R + defined by
d ( x , y ) = x i f   x > y 0 i f   x = y 2 y x i f   x < y ,
where the symmetric condition is not satisfied and d satisfies the ⋈-triangle inequality.
Let T = { x 1 , x 2 , , x n , } be a >-Cauchy sequence in R + . We are going to show that T is -bounded. Given ϵ = 1 , there is an integer N such that d ( x n , x N ) < 1 for each n > N . This means that x n B ( x N ; 1 ) for each n N . We define
r = 1 + max d ( x 1 , 0 ) , , d ( x N , 0 ) .
  • For n N , we have
    d ( x n , 0 ) max d ( x 1 , 0 ) , , d ( x N , 0 ) < r .
  • For n > N , using the -triangle inequality, we have
    d ( x n , 0 ) d ( x n , x N ) + d ( x N , 0 ) < 1 + d ( x N , 0 ) r .
Then, we see that T B ( 0 ; r ) , which says that T is -bounded. Using the Bolzano–Weierstrass theorem, the sequence T has a -accumulation point x * R + . Next we are going to show that x n d x * . Given any ϵ > 0 , there exists an integer N such that n > m N implies d ( x n , x m ) < ϵ / 2 . Since x * is a -accumulation point of the sequence T, it follows that the open ball B ( x * ; ϵ / 2 ) contains a point x m for m N , i.e., d ( x m , x * ) < ϵ / 2 . Therefore, for n > N , using the -triangle inequality, we have
d ( x n , x * ) d ( x n , x m ) + d ( x m , x * ) < ϵ 2 + ϵ 2 = ϵ ,
which shows that x n d x * . In other words, the pre-metric space ( R , d ) is ( > , ) -complete
Example 2.
Continued from Example 1, we are going to claim that every <-Cauchy sequence in R + is convergent in the sense of x n d x . Let T = { x 1 , x 2 , , x n , } be a <-Cauchy sequence in R + . We are going to show that T is -bounded. Given ϵ = 1 , there is an integer N such that d ( x N , x n ) < 1 for each n > N . This means that x n B ( x N ; 1 ) for each n N . We define
r = 1 + max d ( 0 , x 1 ) , , d ( 0 , x N ) .
  • For n N , we have
    d ( 0 , x n ) max d ( 0 , x 1 ) , , d ( 0 , x N ) < r .
  • For n > N , using the -triangle inequality, we have
    d ( 0 , x n ) d ( 0 , x N ) + d ( x N , x n ) < 1 + d ( 0 , x N ) r .
Then, we see that T B ( 0 ; r ) , which says that T is -bounded. Using the Bolzano–Weierstrass theorem, the sequence T has a -accumulation point x R + . Next we are going to show that x n d x . Given any ϵ > 0 , there exists an integer N such that n > m N implies d ( x m , x n ) < ϵ / 2 . Since x is a -accumulation point of the sequence T, it follows that the open ball B ( x ; ϵ / 2 ) contains a point x m for m N , i.e., d ( x , x m ) < ϵ / 2 . Therefore, for n > N , using the -triangle inequality, we have
d ( x , x n ) d ( x , x m ) + d ( x m , x n ) < ϵ 2 + ϵ 2 = ϵ ,
which shows that x n d x . In other words, the pre-metric space ( R , d ) is ( < , ) -complete
Example 3.
Continued from Examples 1 and 2, we are going to claim that the pre-metric space ( R , d ) is simultaneously -complete and -complete. Let T = { x 1 , x 2 , , x n , } be a Cauchy sequence in R + . It means that T is both a >-Cauchy sequence and <-Cauchy sequence in R + . Examples 1 and 2 say that there exist x * and x satisfying x n d x * and x n d x . In other words, the pre-metric space ( R , d ) is simultaneously -complete and -complete. We also remark that x * x in general.

4. Banach Contraction Principle for Pre-Metric Spaces

Let T : X X be a function from a nonempty set X into itself. If T ( x ) = x , we say that x X is a fixed point of T. The well-known Banach contraction principle says that any functions that are a contraction on X has a fixed point when X is taken to be a complete metric space. In this paper, we study the Banach contraction principle when X is taken to be a complete pre-metric space.
Definition 6.
Let ( X , d ) be a pre-metric space. A function T : ( X , d ) ( X , d ) is called a contraction on X when there is a real number 0 < α < 1 satisfying
d ( T ( x ) , T ( y ) ) α d ( x , y )
for any x , y X .
Given any initial element x 0 X , using the function T, we consider the iterative sequence { x n } n = 1 as follows:
x 1 = T ( x 0 ) , x 2 = T ( x 1 ) = T 2 ( x 0 ) , , x n = T n ( x 0 ) , .
We are going to show that the sequence { x n } n = 1 can converge to a fixed point of T under some suitable conditions.
Theorem 1
(Banach Contraction Principle Using the ◃-Triangle Inequality). Let ( X , d ) be a ( > , ) -complete pre-metric space or ( < , ) -complete pre-metric space such that the -triangle inequality is satisfied. Suppose that the function T : ( X , d ) ( X , d ) is a contraction on X. Then T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limit
d ( x n , x ) 0   a s   n ,
where the sequence { x n } n = 1 is generated according to ( 5 ) .
Proof. 
Given any initial element x 0 X , according to (5), we can generate the iterative sequence { x n } n = 1 . The purpose is to show that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. Since T is a contraction on X, without having the symmetric condition, we have the two cases as follows:
d ( x m + 1 , x m ) = d ( T ( x m ) , T ( x m 1 ) ) α d ( x m , x m 1 ) = α d ( T ( x m 1 ) , T ( x m 2 ) ) α 2 d ( x m 1 , x m 2 ) α m d ( x 1 , x 0 )
and
d ( x m , x m + 1 ) α m d ( x 0 , x 1 ) .
For m > n , since the ◃-triangle inequality is assumed to be satisfied, according to the third observation in Remark 1, we obtain
d ( x m , x n ) d ( x m 1 , x m ) + d ( x m 1 , x m 2 ) + + d ( x n + 1 , x n ) α m 1 · d ( x 0 , x 1 ) + α m 2 + + α n · d ( x 1 , x 0 ) α m 1 + α m 2 + + α n · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) = α n · 1 α m n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 )
and
d ( x n , x m ) α n · 1 α m n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) .
Since 0 < α < 1 , we have 1 α m n < 1 in the numerator. Therefore, we obtain
d ( x m , x n ) α n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) 0   as   n
and
d ( x n , x m ) 0   as   n ,
which shows that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. Since X is ( > , ) -complete or ( < , ) -complete, there exists x X satisfying d ( x n , x ) 0 as n .
Now, we are going to claim that x is indeed a fixed point. We have
d ( x , T ( x ) ) d ( x m , x ) + d ( x m , T ( x ) ) ( using   the   - triangle   inequality ) = d ( x m , x ) + d ( T ( x m 1 ) , T ( x ) ) d ( x m , x ) + α d ( x m 1 , x ) ( using   the   contraction )
which implies d ( x , T ( x ) ) = 0 as m . We conclude that T ( x ) = x by the condition of pre-metric space. The uniqueness will also be obtained. Assume that there is another fixed point x ¯ of T, i.e., x ¯ = T ( x ¯ ) . The contraction of function T says that
d ( x ¯ , x ) = d ( T ( x ¯ ) , T ( x ) ) α d ( x ¯ , x ) .
Since 0 < α < 1 , we conclude that d ( x ¯ , x ) = 0 , i.e., x ¯ = x . This completes the proof. □
Theorem 2
(Banach Contraction Principle Using the ▹-Triangle Inequality). Let ( X , d ) be a ( > , ) -complete pre-metric space or ( < , ) -complete pre-metric space such that the -triangle inequality is satisfied. Suppose that the function T : ( X , d ) ( X , d ) is a contraction on X. Then T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limit
d ( x , x n ) 0   a s   n ,
where the sequence { x n } n = 1 is generated according to ( 5 ) .
Proof. 
Given any initial element x 0 X , according to (5), we can generate the iterative sequence { x n } n = 1 . The purpose is to show that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. From the proof of Theorem 1, the contraction of function T says that
d ( x m + 1 , x m ) α m d ( x 1 , x 0 )   and   d ( x m , x m + 1 ) α m d ( x 0 , x 1 ) .
For m > n , since the ▹-triangle inequality is satisfied, according to the second observation in Remark 1, we obtain
d ( x m , x n ) d ( x m , x m 1 ) + d ( x m 2 , x m 1 ) + + d ( x n , x n + 1 ) α m 1 · d ( x 1 , x 0 ) + α m 2 + + α n · d ( x 0 , x 1 ) α m 1 + α m 2 + + α n · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) = α n · 1 α m n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 )
and
d ( x n , x m ) α n · 1 α m n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) ,
which also imply
d ( x m , x n ) 0   and   d ( x n , x m ) 0   as   n .
Therefore { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. Since X is ( > , ) -complete or ( < , ) -complete, there exists x X satisfying d ( x , x n ) 0 as n .
Regarding the uniqueness, we have
d ( x , T ( x ) ) d ( x , x m ) + d ( T ( x ) , x m ) ( using   the   - triangle   inequality ) = d ( x , x m ) + d ( T ( x ) , T ( x m 1 ) ) d ( x , x m ) + α d ( x , x m 1 ) ( using   the   contraction )
which implies d ( x , T ( x ) ) = 0 as m . We conclude that T ( x ) = x . The uniqueness can also be obtained from the argument in the proof of Theorem 1. This completes the proof. □
Theorem 3
(Banach Contraction Principle Using the ⋈-Triangle Inequality). Let ( X , d ) be a pre-metric space such that the -triangle inequality is satisfied. We also assume that any one of the following conditions is satisfied:
  • ( X , d ) is simultaneously ( > , ) -complete and ( > , ) -complete;
  • ( X , d ) is simultaneously ( > , ) -complete and ( < , ) -complete;
  • ( X , d ) is simultaneously ( < , ) -complete and ( > , ) -complete;
  • ( X , d ) is simultaneously ( < , ) -complete and ( < , ) -complete;
  • ( X , d ) is simultaneously ▹-complete and ◃-complete.
Suppose that the function T : ( X , d ) ( X , d ) is a contraction on X. Then T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limits
d ( x n , x ) 0   o r   d ( x , x n ) 0   a s   n ,
where the sequence { x n } n = 1 is generated according to ( 5 ) .
Proof. 
Given any initial element x 0 X , according to (5), we can generate the iterative sequence { x n } n = 1 . The purpose is to show that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. From the proof of Theorem 1, the contraction of function T says that
d ( x m + 1 , x m ) α m d ( x 1 , x 0 )   and   d ( x m , x m + 1 ) α m d ( x 0 , x 1 ) .
For m > n , since the ⋈-triangle inequality is satisfied, according to the first observation in Remark 1, we obtain
d ( x m , x n ) d ( x m , x m 1 ) + d ( x m 1 , x m 2 ) + + d ( x n + 1 , x n ) α m 1 + α m 2 + + α n · d ( x 1 , x 0 ) = α n · 1 α m n 1 α · d ( x 1 , x 0 )
and
d ( x n , x m ) d ( x m 1 , x m ) + d ( x m 2 , x m 1 ) + + d ( x n , x n + 1 ) α m 1 + α m 2 + + α n · d ( x 0 , x 1 ) = α n · 1 α m n 1 α · d ( x 0 , x 1 ) ,
which imply
d ( x m , x n ) 0   and   d ( x n , x m ) 0   as   n .
This proves that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. It follows that { x n } n = 1 is a Cauchy sequence.
Assume that X is simultaneously ( > , ) -complete and ( < , ) -complete. Then there exists x * , x X satisfying d ( x n , x * ) 0 and d ( x , x n ) 0 as n . Now, we have
d ( x , T ( x * ) ) d ( x , x m ) + d ( x m , T ( x * ) ) ( using   the   - triangle   inequality ) = d ( x , x m ) + d ( T ( x m 1 ) , T ( x * ) ) d ( x , x m ) + α d ( x m 1 , x * ) ( using   the   contraction ) ,
which implies d ( x , T ( x * ) ) = 0 as m . Therefore, we obtain T ( x * ) = x . Now, we have
d ( T ( x ) , x * ) d ( T ( x ) , x m ) + d ( x m , x * ) ( using   the   - triangle   inequality ) = d ( T ( x ) , T ( x m 1 ) ) + d ( x m , x * ) α d ( x , x m 1 ) + d ( x m , x * ) ( using   the   contraction ) ,
which implies d ( T ( x ) , x * ) = 0 as m . We also obtain T ( x ) = x * . Now, we have
T 2 ( x * ) = T ( T ( x * ) ) = T ( x ) = x *   and   T 2 ( x ) = T ( T ( x ) ) = T ( x * ) = x .
This shows that x * and x are fixed points of the composition mapping T T T 2 . The contraction of function T says that
d ( x * , x ) = d ( T 2 ( x * ) , T 2 ( x ) ) α d ( T ( x * ) , T ( x ) ) α 2 d ( x * , x ) .
Since 0 < α < 1 , i.e., 0 < α 2 < 1 , we conclude that d ( x * , x ) = 0 , i.e., x * = x . This also says that x * = x is a fixed point of T.
The uniqueness can be obtained using the argument in the proof of Theorem 1. For the other three conditions, we can similarly obtain the desired results. This completes the proof. □
Example 4.
Continued from Example 3, since the pre-metric space ( R , d ) is simultaneously -complete and -complete, any function T : ( R , d ) ( R , d ) that is a contraction on R has a unique fixed point. The concrete examples regarding functions that are contraction on R can be obtained from the literature.
Theorem 4
(Banach Contraction Principle Using the ⋄-Triangle Inequality). Let ( X , d ) be a pre-metric space such that the ⋄-triangle inequality is satisfied. We also assume that any one of the following conditions is satisfied:
  • ( X , d ) is simultaneously ( > , ) -complete and ( > , ) -complete;
  • ( X , d ) is simultaneously ( > , ) -complete and ( < , ) -complete;
  • ( X , d ) is simultaneously ( < , ) -complete and ( > , ) -complete;
  • ( X , d ) is simultaneously ( < , ) -complete and ( < , ) -complete.
Suppose that the function T : ( X , d ) ( X , d ) is a contraction on X. Then T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limits
d ( x n , x ) 0   o r   d ( x , x n ) 0   a s   n ,
where the sequence { x n } n = 1 is generated according to ( 5 ) .
Proof. 
Given any initial element x 0 X , according to (5), we can generate the iterative sequence { x n } n = 1 . The purpose is to show that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence. From the proof of Theorem 1, the contraction of function T says that
d ( x m + 1 , x m ) α m d ( x 1 , x 0 )   and   d ( x m , x m + 1 ) α m d ( x 0 , x 1 ) .
For m > n , since the ⋄-triangle inequality is satisfied, according to the fourth observation in Remark 1 by assuming m n p is an even number, we obtain
d ( x m , x n ) d ( x n , x n + 1 ) + d ( x n + 1 , x n + 2 ) + d ( x n + 3 , x n + 2 ) + d ( x n + 3 , x n + 4 ) + d ( x n + 5 , x n + 4 ) + d ( x n + 5 , x n + 6 ) + + d ( x m 1 , x m ) α n d ( x 0 , x 1 ) + α n + 1 d ( x 0 , x 1 ) + α n + 2 d ( x 1 , x 0 ) + α n + 3 d ( x 0 , x 1 ) + α n + 4 d ( x 1 , x 0 ) + α n + 5 d ( x 0 , x 1 ) + + α m 1 d ( x 0 , x 1 ) α m 1 + α m 2 + + α n · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) = α n · 1 α m n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 )
and
d ( x n , x m ) d ( x n + 1 , x n ) + d ( x n + 2 , x n + 1 ) + d ( x n + 2 , x n + 3 ) + d ( x n + 4 , x n + 3 ) + d ( x n + 4 , x n + 5 ) + d ( x n + 6 , x n + 5 ) + + d ( x m , x m 1 ) α n d ( x 1 , x 0 ) + α n + 1 d ( x 1 , x 0 ) + α n + 2 d ( x 0 , x 1 ) + α n + 3 d ( x 1 , x 0 ) + α n + 4 d ( x 0 , x 1 ) + α n + 5 d ( x 1 , x 0 ) + + α m 1 d ( x 1 , x 0 ) α m 1 + α m 2 + + α n · max d ( x 0 , x 1 ) , d ( x 1 , x 0 ) = α n · 1 α m n 1 α · max d ( x 0 , x 1 ) , d ( x 1 , x 0 )
which imply
d ( x m , x n ) 0   and   d ( x n , x m ) 0   as   n .
This proves that { x n } n = 1 is both a >-Cauchy sequence and <-Cauchy sequence.
Assume that X is simultaneously ( > , ) -complete and ( < , ) -complete. Then there exists x * , x X satisfying d ( x n , x * ) 0 and d ( x , x n ) 0 as n . Now, we have
d ( x * , T ( x ) ) d ( x m , x * ) + d ( T ( x ) , x m ) ( using   the   - triangle   inequality ) = d ( x m , x * ) + d ( T ( x ) , T ( x m 1 ) ) d ( x m , x * ) + α d ( x , x m 1 ) ( using   the   contraction ) ,
which implies d ( x * , T ( x ) ) = 0 as m . We conclude that T ( x ) = x * . We also have
d ( T ( x * ) , x ) d ( x m , T ( x * ) ) + d ( x , x m ) ( using   the   - triangle   inequality ) = d ( T ( x m 1 ) , T ( x * ) ) + d ( x , x m ) α d ( x m 1 , x * ) + d ( x , x m ) ( using   the   contraction ) ,
which implies d ( T ( x * ) , x ) = 0 as m . We conclude that T ( x * ) = x . The remaining proof follows from the same argument in the proof of Theorem 3. This completes the proof. □

5. Meir–Keeler Type of Fixed Point Theorems for Pre-Metric Spaces

In the sequel, we are going to establish the Meir–Keeler type of fixed point theorems for pre-metric spaces. First of all, we consider the different contraction.
Definition 7.
Let ( X , d ) be a pre-metric space. A function T : ( X , d ) ( X , d ) is called a weakly strict contraction on X when the following conditions are satisfied:
  • d ( x , y ) = 0 implies d ( T ( x ) , T ( y ) ) = 0 ;
  • d ( x , y ) 0 implies d ( T ( x ) , T ( y ) ) < d ( x , y ) .
It is clear to see that if T is a contraction on X, then it is also a weakly strict contraction on X.
Theorem 5
(Fixed Points Using the ◃-Triangle Inequality). Let ( X , d ) be a ( > , ) -complete (resp. ( < , ) -complete) pre-metric space such that the -triangle inequality is satisfied. Suppose that the function T : ( X , d ) ( X , d ) is a weakly strict contraction on X, and that { T n ( x 0 ) } n = 1 forms a >-Cauchy sequence (resp. <-Cauchy sequence) for some x 0 X . Then, the function T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limit
d ( T n ( x 0 ) , x ) 0   a s   n .
Proof. 
Since { T n ( x 0 ) } n = 1 is a >-Cauchy sequence, the ( > , ) -completeness says that there exists x X satisfying d ( T n ( x 0 ) , x ) 0 as n . In other words, given any ϵ > 0 , there exists an integer N satisfying d ( T n ( x 0 ) , x ) < ϵ for n N . Regarding d ( T n ( x 0 ) , x ) , we consider two different cases as follows.
  • Suppose that d ( T n ( x 0 ) , x ) = 0 . Then, the weakly strict contraction of T says that
    d ( T n + 1 ( x 0 ) , T ( x ) ) = 0 < ϵ .
  • Suppose that d ( T n ( x 0 ) , x ) 0 . Then, the weakly strict contraction of T says that
    d ( T n + 1 ( x 0 ) , T ( x ) ) < d ( T n ( x 0 ) , x ) < ϵ   f o r   n N .
The above two cases conclude that d ( T n + 1 ( x 0 ) , T ( x ) ) 0 as n . Using the ◃-triangle inequality, we obtain
d ( T ( x ) , x ) d T n + 1 ( x 0 ) , T ( x ) + d T n + 1 ( x 0 ) , x 0   as   n ,
which shows that d ( T ( x ) , x ) = 0 , i.e., T ( x ) = x . In other words, x is a fixed point.
Regarding the uniqueness, suppose that x ¯ is another fixed point of T. i.e., T ( x ¯ ) = x ¯ . Since x x ¯ , the weakly strict contraction of T says that
d ( x , x ¯ ) = d ( T ( x ) , T ( x ¯ ) ) < d ( x , x ¯ ) .
This contradiction shows that x ¯ cannot be a fixed point of T.
When { T n ( x 0 ) } n = 1 is a <-Cauchy sequence, using the ( < , ) -completeness, we can similarly obtain the desired results. This completes the proof. □
Theorem 6
(Fixed Points Using the ▹-Triangle Inequality). Let ( X , d ) be a ( > , ) -complete (resp. ( < , ) -complete) pre-metric space such that the -triangle inequality is satisfied. Suppose that the function T : ( X , d ) ( X , d ) is a weakly strict contraction on X, and that { T n ( x 0 ) } n = 1 forms a >-Cauchy sequence (resp. <-Cauchy sequence) for some x 0 X . Then, the function T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limit
d ( x , T n ( x 0 ) ) 0   a s   n .
Proof. 
Since { T n ( x 0 ) } n = 1 is a >-Cauchy sequence, the ( > , ) -completeness says that there exists x X satisfying d ( x , T n ( x 0 ) ) 0 as n . From the proof of Theorem 5, the weakly strict contraction of T can similarly show that d ( T ( x ) , T n + 1 ( x 0 ) ) 0 as n . Using the ▹-triangle inequality, we obtain
d ( T ( x ) , x ) d T ( x ) , T n + 1 ( x 0 ) + d x , T n + 1 ( x 0 ) 0   as   n ,
which says that d ( T ( x ) , x ) = 0 , i.e., T ( x ) = x . This shows that x is a fixed point. The remaining proof follows from the proof of Theorem 5. This completes the proof. □
Theorem 7
(Fixed Points Using the ⋈-Triangle Inequality). Let ( X , d ) be a simultaneously ( > , ) -complete and ( > , ) -complete (resp. ( < , ) -complete and ( < , ) -complete) pre-metric space such that the -triangle inequality is satisfied. Suppose that the function T : ( X , d ) ( X , d ) is a weakly strict contraction on X, and that { T n ( x 0 ) } n = 1 forms a >-Cauchy sequence (resp. <-Cauchy sequence) for some x 0 X , then T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limits
d ( T n ( x 0 ) , x ) 0   o r   d ( x , T n ( x 0 ) ) 0   a s   n .
Proof. 
Since { T n ( x 0 ) } n = 1 is a >-Cauchy sequence, the ( > , ) -completeness says that there exists x * X satisfying d ( T n ( x 0 ) , x * ) 0 as n . The ( > , ) -completeness also says that there exists another x X satisfying d ( x , T n ( x 0 ) ) 0 as n . From the proof of Theorem 5, the weakly strict contraction of T can similarly show that d ( T n + 1 ( x 0 ) , T ( x * ) ) 0 and d ( T ( x ) , T n + 1 ( x 0 ) ) 0 as n . Using the ⋈-triangle inequality, we obtain
d ( T ( x ) , x * ) d T ( x ) , T n + 1 ( x 0 ) + d T n + 1 ( x 0 ) , x * 0   as   n ,
which says that d ( T ( x ) , x * ) = 0 , i.e., T ( x ) = x * . On the other hand, we also have
d ( x , T ( x * ) ) d x , T n + 1 ( x 0 ) + d T n + 1 ( x 0 ) , T ( x * ) 0   as   n ,
which says that T ( x * ) = x . By referring to (6), it follows that x * and x are fixed points of the composition mapping T T T 2 . Suppose that x * x . We want to claim T ( x * ) T ( x ) . Assume that it is not true, i.e., T ( x * ) = T ( x ) . Then, we shall have
x = T ( x * ) = T ( x ) = x * ,
which contradicts x * x . The weakly strict contraction of T also says that
d ( x * , x ) = d ( T 2 ( x * ) , T 2 ( x ) ) < d ( T ( x * ) , T ( x ) ) < d ( x * , x ) .
This contradiction shows that x * = x , and says that x * = x is a fixed point of T. The uniqueness can be obtained from the proof of Theorem 5
When { T n ( x 0 ) } n = 1 is a <-Cauchy sequence, using the ( < , ) -completeness and ( < , ) -completeness, we can similarly obtain the desired results. This completes the proof. □
Theorem 8
(Fixed Points Using the ⋄-Triangle Inequality). Let ( X , d ) be a simultaneously ( > , ) -complete and ( > , ) -complete (resp. ( < , ) -complete and ( < , ) -complete) pre-metric space such that the -triangle inequality is satisfied. Suppose that the function T : ( X , d ) ( X , d ) is a weakly strict contraction on X, and that { T n ( x 0 ) } n = 1 forms a >-Cauchy sequence (resp. <-Cauchy sequence) for some x 0 X . Then T has a unique fixed point x X . Moreover, the fixed point x is obtained by the following limits
d ( T n ( x 0 ) , x ) 0   o r   d ( x , T n ( x 0 ) ) 0   a s   n .
Proof. 
From the proof of Theorem 7, there exist x * , x X satisfying d ( T n ( x 0 ) , x * ) 0 , d ( x , T n ( x 0 ) ) 0 , d ( T n + 1 ( x 0 ) , T ( x * ) ) 0 and d ( T ( x ) , T n + 1 ( x 0 ) ) 0 as n . Using the ⋄-triangle inequality, we can obtain
d ( x * , T ( x ) ) d T n + 1 ( x 0 ) , x * + d T ( x ) , T n + 1 ( x 0 ) 0   as   n ,
which says that d ( x * , T ( x ) ) = 0 , i.e., T ( x ) = x * . We also have
d ( T ( x * ) , x ) d T n + 1 ( x 0 ) , T ( x * ) + d x , T n + 1 ( x 0 ) 0   as   n ,
which says that T ( x * ) = x . The remaining proof follows from the similar argument in the proof of Theorem 7. This completes the proof. □
Next, we consider the different fixed point theorems based on the weakly uniformly strict contraction that was proposed by Meir and Keeler [12].
Definition 8.
Let ( X , d ) be a pre-metric space. A function T : ( X , d ) ( X , d ) is called a weakly uniformly strict contraction on X when the following conditions are satisfied:
  • d ( x , y ) = 0 implies d ( T ( x ) , T ( y ) ) = 0 ;
  • given any ϵ > 0 , there exists δ > 0 such that ϵ d ( x , y ) < ϵ + δ implies d ( T ( x ) , T ( y ) ) < ϵ for any x , y X with d ( x , y ) 0 .
Remark 2.
We observe that if T is a weakly uniformly strict contraction on X, then T is also a weakly strict contraction on X.
Lemma 1.
Let ( X , d ) be a pre-metric space, and let T : ( X , d ) ( X , d ) be a weakly uniformly strict contraction on X. Then, the sequences { d ( T n ( x ) , T n + 1 ( x ) ) } n = 1 and { d ( T n + 1 ( x ) , T n ( x ) ) } n = 1 are decreasing to zero for any x X .
Proof. 
For convenience, we simply write T n ( x ) = x n for all n. Let c n = d ( x n , x n + 1 ) . Regarding d ( x n 1 , x n ) 0 , we consider two different cases as follows.
  • Suppose that d ( x n 1 , x n ) 0 . By Remark 2, we have
    c n = d ( x n , x n + 1 ) = d ( T n ( x ) , T n + 1 ( x ) ) < d ( T n 1 ( x ) , T n ( x ) ) = d ( x n 1 , x n ) = c n 1 .
  • Suppose that d ( x n 1 , x n ) = 0 . Then, by the first condition of Definition 8, we have
    c n = d ( T n ( x ) , T n + 1 ( x ) ) = d ( T ( x n 1 ) , T ( x n ) ) = 0 c n 1 .
The above two cases conclude that the sequence { c n } n = 1 is decreasing. We also consider the following two cases.
  • Let m be the first index in the sequence { x n } n = 1 satisfying d ( x m 1 , x m ) = 0 . Then, we want to claim
    c m 1 = c m = c m + 1 = = 0 .
    Using the first condition of Definition 8, we have
    0 = d ( T ( x m 1 ) , T ( x m ) ) = d ( T m ( x ) , T m + 1 ( x ) ) = d ( x m , x m + 1 ) = c m .
    Since d ( x m , x m + 1 ) = 0 , using the similar argument, we can also obtain c m + 1 = 0 and d ( x m + 1 , x m + 2 ) = 0 . This shows that the sequence { c n } n = 1 is indeed decreasing to zero.
  • Suppose that d ( x m , x m + 1 ) 0 for all m 1 . Since the sequence { c n } n = 1 is decreasing, we assume that c n ϵ > 0 , i.e., c n ϵ > 0 for all n. Therefore, there exists δ > 0 satisfying ϵ c m < ϵ + δ for some m, i.e., ϵ d ( x m , x m + 1 ) < ϵ + δ . Using the second condition of Definition 8, it follows that
    c m + 1 = d ( x m + 1 , x m + 2 ) = d ( T m + 1 ( x ) , T m + 2 ( x ) ) = d ( T ( x m ) , T ( x m + 1 ) ) < ϵ ,
    which contradicts c m + 1 ϵ .
Therefore, we conclude that the sequence { d ( T n ( x ) , T n + 1 ( x ) ) } n = 1 is indeed decreasing to zero for any x X . We can similarly show that the sequence { d ( T n + 1 ( x ) , T n ( x ) ) } n = 1 is decreasing to zero for any x X . This completes the proof. □
Theorem 9
(Meir–Keeler Type of Fixed Points Using the ◃-Triangle Inequality). Let ( X , d ) be a ( > , ) -complete pre-metric space such that the -triangle inequality is satisfied, and let T : ( X , d ) ( X , d ) be a weakly uniformly strict contraction on X. Then T has a unique fixed point. Moreover, the fixed point x is obtained by the following limit
d ( T n ( x 0 ) , x ) 0   a s   n   f o r   s o m e   x 0 .
Proof. 
According to Theorem 5 and Remark 2, we just need to claim that if T is a weakly uniformly strict contraction, then { T n ( x 0 ) } n = 1 = { x n } n = 1 is a >-Cauchy sequence for x 0 X . Suppose that { x n } n = 1 is not a >-Cauchy sequence. Then, there exists 2 ϵ > 0 such that, given any integer N, there exist n > m N satisfying d ( x n , x m ) > 2 ϵ . We are going to lead to a contradiction. The weakly uniformly strict contraction of T says that there exists δ > 0 satisfying
ϵ d ( x , y ) < ϵ + δ   implies   d ( T ( x ) , T ( y ) ) < ϵ   for   any   x , y X   with   d ( x , y ) 0 .
Let δ = min { δ , ϵ } . We want to show
ϵ d ( x , y ) < ϵ + δ   implies   d ( T ( x ) , T ( y ) ) < ϵ   for   any   x , y X   with   d ( x , y ) 0 .
Indeed, when δ = ϵ , i.e., ϵ < δ , we have ϵ + δ = ϵ + ϵ < ϵ + δ .
Let c n = d ( x n , x n + 1 ) and c ¯ n = d ( x n + 1 , x n ) . Since the sequences { c n } n = 1 and { c ¯ n } n = 1 are decreasing to zero by Lemma 1, we can find a common integer N satisfying
c N < δ / 3   and   c ¯ N < δ / 3 .
For n > m N , we have
d ( x n , x m ) > 2 ϵ ϵ + δ ,
which implicitly says that d ( x n , x m ) 0 . Since the sequence { c ¯ n } n = 1 is decreasing by Lemma 1 again, we can obtain
d ( x m + 1 , x m ) = c ¯ m c ¯ N < δ 3 ϵ 3 < ϵ .
For j with m < j n , using the ◃-triangle inequality, it follows that
d ( x j + 1 , x m ) d ( x j , x j + 1 ) + d ( x j , x m ) .
We want to cliam that there exists an integer j with m < j n satisfying d ( x j , x m ) 0 and
ϵ + 2 δ 3 < d ( x j , x m ) < ϵ + δ .
Let γ j = d ( x j , x m ) for j = m + 1 , , n . Using (9) and (10), we have
γ m + 1 < ϵ   and   γ n > ϵ + δ .
Let j 0 be an index satisfying
j 0 = max j [ m + 1 , n ] : γ j ϵ + 2 δ 3 .
Then, from (13), we see that m + 1 j 0 < n , which also says that j 0 is well-defined. By the definition of j 0 , it follows that j 0 + 1 n and γ j 0 + 1 > ϵ + 2 δ 3 , which also says that d ( x j 0 + 1 , x m ) 0 . Therefore, the expression (12) will be sound if we can show
ϵ + 2 δ 3 < γ j 0 + 1 < ϵ + δ .
Suppose that this is not true, i.e., γ j 0 + 1 ϵ + δ . From (11), we have
δ 3 > c N c j 0 = d ( x j 0 , x j 0 + 1 ) γ j 0 + 1 γ j 0 ϵ + δ ϵ 2 δ 3 = δ 3 .
This contradiction says that the expression (12) is sound. Since d ( x j , x m ) 0 , using (7), it follows that (12) implies
d ( x j + 1 , x m + 1 ) = d ( T ( x j ) , T ( x m ) ) < ϵ .
Using the ◃-triangle inequality and referring to (2), we can obtain
d ( x j , x m ) d ( x j + 1 , x j ) + d ( x j + 1 , x m + 1 ) + d ( x m + 1 , x m ) = c ¯ j + d ( x j + 1 , x m + 1 ) + c ¯ m < c ¯ j + ϵ + c ¯ m ( by   ( 15 ) ) c ¯ N + ϵ + c ¯ N ( since { c ¯ n } n = 1 is   decreasing ) < δ 3 + ϵ + δ 3 ( by   ( 8 ) ) = ϵ + 2 δ 3 ,
which contradicts (12). This contradiction shows that every sequence { T n ( x ) } n = 1 = { x n } n = 1 is a >-Cauchy sequence. Using Theorem 5, the proof is complete. □
Theorem 10
(Meir–Keeler Type of Fixed Points Using the ▹-Triangle Inequality). Let ( X , d ) be a ( > , ) -complete pre-metric space such that the -triangle inequality is satisfied, and let T : ( X , d ) ( X , d ) be a weakly uniformly strict contraction on X. Then T has a unique fixed point. Moreover, the fixed point x is obtained by the following limit
d ( x , T n ( x 0 ) ) 0   a s   n   f o r   s o m e   x 0 .
Proof. 
According to Theorem 6 and Remark 2, we just need to claim that if T is a weakly uniformly strict contraction, then { T n ( x 0 ) } n = 1 = { x n } n = 1 is a <-Cauchy sequence for x 0 X . Suppose that { x n } n = 1 is not a <-Cauchy sequence. Then, there exists 2 ϵ > 0 such that, given any integer N, there exist n > m N satisfying d ( x m , x n ) > 2 ϵ . Let δ = min { δ , ϵ } . For n > m N , we have
d ( x m , x n ) > 2 ϵ ϵ + δ ,
which implicitly says that d ( x m , x n ) 0 . Let c n = d ( x n , x n + 1 ) and c ¯ n = d ( x n + 1 , x n ) . Since the sequence { c n } n = 1 is decreasing by Lemma 1, we obtain
d ( x m , x m + 1 ) = c m c N < δ 3 ϵ 3 < ϵ .
For j with m < j n , using the ▹-triangle inequality, we also have
d ( x m , x j + 1 ) d ( x m , x j ) + d ( x j + 1 , x j ) .
We want to cliam that there exists an integer j with m < j n satisfying d ( x m , x j ) 0 and
ϵ + 2 δ 3 < d ( x m , x j ) < ϵ + δ .
Let γ j = d ( x m , x j ) for j = m + 1 , , n . From (16) and (17), we can also obtain (13). Let j 0 be defined in (14). Then, the expression (19) will be sound if we can show that
ϵ + 2 δ 3 < γ j 0 + 1 < ϵ + δ .
Suppose that this is not true, i.e., γ j 0 + 1 ϵ + δ . From (18) and (8), it follows that
δ 3 > c ¯ N c ¯ j 0 = d ( x j 0 + 1 , x j 0 ) γ j 0 + 1 γ j 0 ϵ + δ ϵ 2 δ 3 = δ 3 .
This contradiction says that (19) is sound. Since d ( x m , x j ) 0 , using (7), it follows that (19) implies
d ( x m + 1 , x j + 1 ) = d ( T ( x m ) , T ( x j ) ) < ϵ .
Using the ▹-triangle inequality and referring to (1), we can obtain
d ( x m , x j ) d ( x j , x j + 1 ) + d ( x m + 1 , x j + 1 ) + d ( x m , x m + 1 ) = c j + d ( x m + 1 , x j + 1 ) + c m < c j + ϵ + c m ( using   Equation   ( 20 ) ) c N + ϵ + c N ( since { c n } n = 1   is   decreasing ) < δ 3 + ϵ + δ 3 ( using   Equation   ( 8 ) ) = ϵ + 2 δ 3 ,
which contradicts (19). This contradiction shows that every sequence { T n ( x ) } n = 1 = { x n } n = 1 is a <-Cauchy sequence. Using Theorem 6, the proof is complete. □
Theorem 11
(Meir–Keeler Type of Fixed Points Using the ⋈-Triangle Inequality). Let ( X , d ) be a pre-metric space such that the -triangle inequality is satisfied. We also assume that any one of the following conditions is satisfied:
  • ( X , d ) is simultaneously ( > , ) -complete and ( > , ) -complete;
  • ( X , d ) is simultaneously ( < , ) -complete and ( < , ) -complete;
  • ( X , d ) is simultaneously -complete and -complete.
Suppose that T : ( X , d ) ( X , d ) is a weakly uniformly strict contraction on X. Then T has a unique fixed point. Moreover, the fixed point x is obtained by the following limits
d ( T n ( x 0 ) , x ) 0   o r   d ( x , T n ( x 0 ) ) 0   a s   n .
Proof. 
According to Theorem 7 and Remark 2, we just need to claim that if T is a weakly uniformly strict contraction, then { T n ( x 0 ) } n = 1 = { x n } n = 1 is both a <-Cauchy sequence and >-Cauchy sequence for x 0 X . Suppose that { x n } n = 1 is not a <-Cauchy sequence. Then, there exists 2 ϵ > 0 such that, given any integer N, there exist n > m N satisfying d ( x m , x n ) > 2 ϵ . We are going to follow the similar proof of Theorem 10.
Let δ = min { δ , ϵ } , and let γ j = d ( x m , x j ) for j = m + 1 , , n . For j with m < j n , using the ⋈-triangle inequality, we have
d ( x m , x j + 1 ) d ( x m , x j ) + d ( x j , x j + 1 ) ,
which implies
δ 3 > c N c j 0 = d ( x j 0 , x j 0 + 1 ) γ j 0 + 1 γ j 0 ϵ + δ ϵ 2 δ 3 = δ 3 .
This contradiction shows that there exists an integer j with m < j n satisfying d ( x m , x j ) 0 and
ϵ + 2 δ 3 < d ( x m , x j ) < ϵ + δ ,
which implies
d ( x m + 1 , x j + 1 ) = d ( T ( x m ) , T ( x j ) ) < ϵ .
Using the ⋈-triangle inequality, we can obtain
d ( x m , x j ) d ( x m , x m + 1 ) + d ( x m + 1 , x j + 1 ) + d ( x j + 1 , x j ) = c m + d ( x m + 1 , x j + 1 ) + c ¯ j < c m + ϵ + c ¯ j ( by   ( 22 ) ) c N + ϵ + c ¯ N ( since { c n } n = 1   and   { c ¯ n } n = 1 are   decreasing   ) < δ 3 + ϵ + δ 3 ( by   ( 8 ) ) = ϵ + 2 δ 3 ,
which contradicts (21). This contradiction shows that every sequence { T n ( x ) } n = 1 = { x n } n = 1 is a <-Cauchy sequence.
Suppose that { x n } n = 1 is not a >-Cauchy sequence. Then, there exists 2 ϵ > 0 such that, given any integer N, there exist n > m N satisfying d ( x n , x m ) > 2 ϵ . Let δ = min { δ , ϵ } , and let γ j = d ( x j , x m ) for j = m + 1 , , n . For j with m < j n , using the ⋈-triangle inequality, we have
d ( x j + 1 , x m ) d ( x j + 1 , x j ) + d ( x j , x m ) ,
which implies
δ 3 > c ¯ N c ¯ j 0 = d ( x j 0 + 1 , x j 0 ) γ j 0 + 1 γ j 0 ϵ + δ ϵ 2 δ 3 = δ 3 .
This contradiction shows that there exists an integer j with m < j n satisfying d ( x j , x m ) 0 and
ϵ + 2 δ 3 < d ( x j , x m ) < ϵ + δ ,
which implies
d ( x j + 1 , x m + 1 ) = d ( T ( x j ) , T ( x m ) ) < ϵ .
Using the ⋈-triangle inequality, we can obtain
d ( x j , x m ) d ( x j , x j + 1 ) + d ( x j + 1 , x m + 1 ) + d ( x m + 1 , x m ) = c j + d ( x j + 1 , x m + 1 ) + c ¯ m < c j + ϵ + c ¯ m ( by   ( 24 ) ) c N + ϵ + c ¯ N ( since { c n } n = 1   and   { c ¯ n } n = 1   are   decreasing ) < δ 3 + ϵ + δ 3 ( by   ( 8 ) ) = ϵ + 2 δ 3 ,
which contradicts (23). This contradiction shows that every sequence { T n ( x ) } n = 1 = { x n } n = 1 is a >-Cauchy sequence. Using Theorem 7, the proof is complete. □
Example 5.
Continued from Example 3, since the pre-metric space ( R , d ) is simultaneously -complete and -complete, any function T : ( R , d ) ( R , d ) that is a weakly uniformly strict contraction on R has a unique fixed point. The concrete examples regarding functions that are weakly uniformly strict contraction on R can be obtained from the literature.
We finally remark that the Meir–Keeler type of fixed point theorem based on the ⋄-triangle inequality cannot be obtained by using an argument similar to Theorem 11. In other words, we need to design a different argument to obtain the Meir–Keeler type of fixed point theorem based on the ⋄-triangle inequality. It is also possible that we cannot establish the Meir–Keeler type of fixed point theorem based on the ⋄-triangle inequality. Therefore, this problem remains open and could be the subject future research.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Wilson, W.A. On Semi-metric spaces. Am. J. Math. 1931, 53, 361–373. [Google Scholar] [CrossRef]
  2. Alegre, C.; Marín, J. Modified w-distances on quasi-metric spaces and a fixed point theorem on complete quasi-metric spaces. Topol. Its Appl. 2016, 203, 32–41. [Google Scholar] [CrossRef]
  3. Ali-Akbari, M.; Pourmahdian, M. Completeness of hyperspaces of compact subsets of quasi-metric spaces. Acta Math. Hung. 2010, 127, 260–272. [Google Scholar] [CrossRef]
  4. Cao, J.; Rodríguez-López, J. On hyperspace topologies via distance functionals in quasi-metric spaces. Acta Math. Hung. 2006, 112, 249–268. [Google Scholar] [CrossRef]
  5. Cobzas, S. Completeness in quasi-metric spaces and Ekeland Variational Principle. Topol. Its Appl. 2011, 158, 1073–1084. [Google Scholar] [CrossRef] [Green Version]
  6. Collins Agyingi, A.; Haihambo, P.; Künzi, H.-P.A. Endpoints in T0-quasi-metric spaces. Topol. Its Appl. 2014, 168, 82–93. [Google Scholar] [CrossRef]
  7. Doitchinov, D. On completeness in quasi-metric spaces. Topol. Its Appl. 1988, 30, 127–148. [Google Scholar] [CrossRef] [Green Version]
  8. Künzi, H.-P.A. A construction of the B-completion of a T0-quasi-metric space. Topol. Its Appl. 2014, 170, 25–39. [Google Scholar] [CrossRef]
  9. Künzi, H.-P.A.; Kivuvu, C.M. The B-completion of a T0-quasi-metric space. Topol. Its Appl. 2009, 156, 2070–2081. [Google Scholar] [CrossRef] [Green Version]
  10. Künzi, H.-P.A.; Yildiz, F. Convexity structures in T0-quasi-metric spaces. Topol. Its Appl. 2016, 200, 2–18. [Google Scholar] [CrossRef]
  11. Matthews, S.G. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef]
  12. Meir, A.; Keeler, E. A Theorem on Contraction Mappings. J. Math. Anal. Appl. 1969, 28, 326–329. [Google Scholar] [CrossRef] [Green Version]
  13. Romaguera, S.; Antonino, J.A. On convergence complete strong quasi-metrics. Acta Math. Hung. 1994, 64, 65–73. [Google Scholar] [CrossRef]
  14. Triebel, H. A new approach to function spaces on quasi-metric spaces. Rev. Mater. Complut. 2005, 18, 7–48. [Google Scholar] [CrossRef] [Green Version]
  15. Ume, J.S. A minimization theorem in quasi-metric spaces and its applications. Int. J. Math. Math. Sci. 2002, 31, 443–447. [Google Scholar] [CrossRef] [Green Version]
  16. Vitolo, P. A representation theorem for quasi-metric spaces. Topol. Its Appl. 1995, 65, 101–104. [Google Scholar] [CrossRef] [Green Version]
  17. Wilson, W.A. On Quasi-metric spaces. Am. J. Math. 1931, 53, 675–684. [Google Scholar] [CrossRef]
  18. Wu, H.-C. Pre-Metric Spaces Along with Different Types of Triangle Inequalities. Axiom 2018, 7, 34. [Google Scholar] [CrossRef] [Green Version]
  19. Pavlović, M.V.; Radenović, S. A note on the Meir-Keeler theorem in the context of b-metric spaces. Vojnoteh. Glas./Mil. Tech. Cour. 2019, 67, 1–12. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wu, H.-C. Banach Contraction Principle and Meir–Keeler Type of Fixed Point Theorems for Pre-Metric Spaces. Axioms 2021, 10, 57. https://doi.org/10.3390/axioms10020057

AMA Style

Wu H-C. Banach Contraction Principle and Meir–Keeler Type of Fixed Point Theorems for Pre-Metric Spaces. Axioms. 2021; 10(2):57. https://doi.org/10.3390/axioms10020057

Chicago/Turabian Style

Wu, Hsien-Chung. 2021. "Banach Contraction Principle and Meir–Keeler Type of Fixed Point Theorems for Pre-Metric Spaces" Axioms 10, no. 2: 57. https://doi.org/10.3390/axioms10020057

APA Style

Wu, H. -C. (2021). Banach Contraction Principle and Meir–Keeler Type of Fixed Point Theorems for Pre-Metric Spaces. Axioms, 10(2), 57. https://doi.org/10.3390/axioms10020057

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop