2. Preliminaries
In this section, we recall some definitions and properties to use in our result.
Definition 1 ([
1]).
Let . A function is called a partial metric on X if it satisfies: and ;
;
;
.
Then, the pair is called a partial metric space.
Obviously, if
, then, from
and
, we have
, but the converse may not be true. Moreover, if
is a partial metric space, then the function
defined by
is a metric on
X.
Example 1 ([
1]).
Let and . Define ; the p is a partial metric on X and the corresponding metric is . Every partial metric p on X generates a topology on X with a base, which is defined by the family of open balls , where and .
Definition 2 ([
13,
14,
15]).
Let . A function , defined by , is called a modular metric on X if it satisfies the following: and ;
and .
If in lieu of
, we write
and then
is called the pseudomodular metric on
X. Note that the function
is non-decreasing. Indeed,
and
such that
; from
and
, we obtain
Moreover, we say that
is convex if it satisfies the axioms
of Definition 2 and the following:
Now, we define the following definition, a general form of convex modular metric on X.
Definition 3. A modular metric ω defined on a non-empty set X is said to be a weak convex modular if it satisfies the axioms of Definition 2 such that there exists a function satisfying the following: Obviously, every convex modular metric is a weak convex modular metric but the converse may not be true. Moreover, every (weak) convex modular metric is a modular metric but the converse may not be true. In fact, by setting , then and , so and infer directly the axiom of Definition 2.
Let
be an arbitrary set. For given
, we define
and
Then, the two sets
and
are called modular spaces centered at
. It is obvious that
. If
is an arbitrary, then
and
are written as
and
. If
is a modular metric on
X, then the modular space
is a metric space equipped with a non-trivial metric given by
Further, if
is a convex modular on
X, then
, and this common space can be equipped with a metric
defined by
If a modular metric on X is finite and , and , then is a metric on X.
Example 2 ([
17]).
Let be a metric space. Define and . Then, ω is a modular metric on X. Moreover, ω is convex and hence it is a weak convex modular metric on X. Lemma 1 ([
14]).
Let ω be a modular metric on a set X, given a sequence in and . Then, as if and only if as . A similar assertion holds for Cauchy sequences. Example 3. Define and . Obviously, ω satisfies the axioms and of Definition 2. Therefore, ω is a modular metric but not a convex modular metric on X.
In fact, , and we have Note that and . Thus, ω is not a convex modular metric on X.
Definition 4 ([
16]).
Let and be a function defined by , which is called a partial modular metric on X if it satisfies the following axioms::
and ;
and ;
and .
As in Definition 1, the self-distance in Definition 4 of a partial modular metric need not be restricted to zero, i.e., . Note that if , then, from , it follows that In order to avoid this limitation, we modify the axioms and in Definition 4 and restate them as follows.
Definition 5. Let and be a function defined by , which is called a partial modular metric on X if it retains the axioms and of Definition 4 with the following:
;
.
Obviously, if , then, from and , we have , but the converse may not be true. It is not difficult to see that a partial modular metric on X is a modular metric but the converse may not be true. If a partial modular metric on X possesses a finite value and is independent of the parameter that is , , then is a partial metric on X.
Definition 6. A partial modular metric on X is said to be convex if, in addition to the axioms and , it satisfies the following:. Definition 7. A partial modular metric on X is said to be weakly convex if it satisfies the axioms and the following:, where is a function. Now, we define the following definitions as in the modular metric:
Definition 8. Let be a partial modular metric on a set X. For given , we definefor some and Then, two sets and are called partial modular spaces centered at . It is obvious that . We write and , if is arbitrary.
Remark 1. For every , the function is non-increasing. Indeed, and , from and , and we obtain Lemma 2. Let be a partial modular metric on a non-empty set X. Define Then, is a modular metric on X.
Proof. Obviously, holds of Definition 2. For and , we have
If
, then
. Suppose
, then
From
of Definition 5, we obtain
Thus, by the second part of of Definition 5, .
From of Definition 5, we obtain
and and .
Now, by
of Definition 5, we have
Thus, satisfies the axioms and of Definition 2 and hence is a modular metric. □
Remark 2. (i) Let be a modular metric induced by partial modular metric on a non-empty set X, and then shall denote the modular space with respect to modular metric .
(ii) Let ω be a modular metric on X and ; then,defines a partial modular metric on X and the corresponding modular metric is or . Moreover, is (weakly) convex if ω is a (weakly) convex modular metric with on X. Example 4. Let . Define a function bywhere , and . Then, is a partial modular metric on X. Example 5. Let be a metric space and a function be defined bywhere . We see that . However, is not a partial modular metric on X. Indeed, by the first part of of Definition 5, and . Example 6. Then, is a partial modular metric on X. It is obvious that and of Definition 5 hold. For , and , we have Thus, is a partial modular metric on X.
Example 7. Let be a set. Define and . It is obvious that and of Definition 5 hold. Now, we show that is a partial modular metric and but not (weakly) convex on X.
For , and , we have Then, is a partial modular metric on X. On the other hand, and , and we have To show that is not convex on X, , taking , then This shows that is not convex and, hence, it is not a weakly convex partial modular metric on X.
Example 8. Let be a partial modular metric on a non-empty set X. Define and . Then, is convex and hence it is a weakly convex partial modular metric on X.
Example 9. For any non-empty set X, define and . Then, is weakly convex but is not a convex partial modular metric on X.
Definition 9. Let be a partial modular metric on a non-empty set X and be a sequence in a partial modular space ; then,
- (i)
is said to be convergent to a point , if and only if, for every , there exists such that and . We write ;
- (ii)
a sequence is a Cauchy in if , for some . In this case, . Thus, if is a Cauchy sequence in , then ;
- (iii)
a partial modular space is said to be complete if every Cauchy sequence converges to a point such that
Remark 3. - (i)
Ifis a Cauchy sequence in, i.e.,, then - (ii)
If is a Cauchy sequence in that converges to some point , then - (iii)
A sequence in is a Cauchy sequence if it is a Cauchy sequence in , i.e., .
Lemma 3. Let be a partial modular on X and be a sequence in . Then,
- (i)
is a Cauchy sequence in if it is a Cauchy sequence in the modular space induced by partial modular metric ;
- (ii)
a partial modular space is complete if and only if the modular space induced by is complete. Furthermore,
Definition 10 ([
18]).
A continuous function is called a class function if, for any , the following conditions hold:- (i)
;
- (ii)
implies or .
Example 10 ([
18]).
The following are examples of the class function:- (i)
;
- (ii)
;
- (iii)
.
Definition 11 ([
19]).
A control function is called an altering distance if the following conditions hold:- (i)
ψ is non-decreasing and continuous;
- (ii)
if and only if
We denote by Ψ the set of all altering distance functions.
Example 11 ([
20]).
The following examples are the altering distance functions:- (i)
;
- (ii)
where
Definition 12 ([
18]).
A control function is called an ultra-altering distance if the following conditions hold:- (i)
φ is continuous;
- (ii)
and
Φ denotes the set of all ultra-altering distance functions.
Definition 13 ([
21]).
A triplet , where and is monotonically increasing ifFurther, we say that the triplet is strictly monotonically increasing if Example 12 ([
21]).
Consider a class function . Define by andObviously, the triplet is monotonically increasing.
Definition 14 ([
22]).
Let and be two self-mappings on a non-empty set X; then, they are said to be weakly compatible if they commute at their coincidence points, i.e., , for some . Definition 15 ([
23]).
Let and be two self-mappings. If , for some , then x is called a coincidence point of and , and u is called a point of coincidence (briefly, ) of and . Lemma 4 ([
23]).
If and are weakly compatible self-mappings on a non-empty set X, and if and have a unique point of coincidence , then u is the unique common fixed-point and .