Next Article in Journal
Study of Quantum Difference Coupled Impulsive System with Respect to Another Function
Next Article in Special Issue
New Fixed Point Theorems for Generalized Meir–Keeler Type Nonlinear Mappings with Applications to Fixed Point Theory
Previous Article in Journal
Evaporation of Primordial Charged Black Holes: Timescale and Evolution of Thermodynamic Parameters
Previous Article in Special Issue
Fixed Point of α-Modular Nonexpanive Mappings in Modular Vector Spaces 𝓁p(·)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Common Fixed Point Results of Tower Mappings in (Pseudo)modular Metric Spaces

by
Daniel Francis
1,2,
Godwin Amechi Okeke
2 and
Safeer Hussain Khan
3,*
1
Department of Mathematics, College of Physical and Applied Sciences, Michael Okpara University of Agriculture, Umudike, Umuahia P.O. Box 7267, Abia State, Nigeria
2
Functional Analysis and Optimization Research Group Laboratory (FANORG), Department of Mathematics, School of Physical Sciences, Federal University of Technology, Owerri, Owerri P.O. Box 1526, Imo State, Nigeria
3
Department of Mathematics and Statistics, North Carolina A&T State University, Greensboro, NC 27411, USA
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(7), 896; https://doi.org/10.3390/sym16070896
Submission received: 7 April 2024 / Revised: 13 May 2024 / Accepted: 15 May 2024 / Published: 14 July 2024

Abstract

:
In this paper, we prove the existence and uniqueness of common fixed point of tower type contractive mappings in complete metric (pseudo)modular spaces involving the theoretic relation. However, the newly introduced contraction in this paper further characterize and includes in their full strength several existing results in metrical fixed point theory. Some nontrivial supportive examples were given to justify our result. Our results generalize, improve, and unify some existing results.

1. Introduction

The concept of tower function(s) cut across some areas of science and the problem is sometimes how to identify them. In elementary real analysis, the function n n n for n N is actually a tower function and it is well known that lim n n n = , lim n n n = 0 , lim n 0 n n = 1 , lim n n 1 n = 1 , etc. However, in the study of matrix algebra, we do encounter the matrices of the type, A A , exp ( A A ) , where A is a square matrix. Sometimes, the evaluation(s) of these matrices are highly provocative. It is technically believed that whenever a function is raised to power itself or to order function(s), then we can say that such a function possesses a tower function. Some prototypes are of the form N N , R N N , R R , etc. The ideas above are also applicable in building technology. We can now cast some idea of life science into tower function.
Imagine a pregnant woman went to a radiologist for a scan. Naturally, the woman’s chromosome is x; then, the radiologist informs her that she is carrying two female babies. This miracle is indeed a tower function with respect to time when we allow it to be function upon function(s). Suppose that the result of the scan says two baby boys; this is also a tower function with respect to time, i.e., x x y y . Finally, if the scan says a boy and a girl, then it is also a tower function with respect to time, i.e., x x y x , etc. This concept is naturally a tower function; again, if it is two baby girls, then it is also a tower function with respect to time, i.e., x x x x , etc. We allow the positions of the babies to be upwards directed.
In probability theory, the three-tower problem and the concept looks slightly different; a randomly chosen gambler loses a coin and another randomly chosen gambler obtains it. The game continues until one of the three gamblers is ruined.
Somewhere in combinatorial set theory we do encounter tower of infinite ordinals and in elementary calculus, integration of a tower function of the type x x x x · · · x · · · is interesting in its own right, and this is also called the infinite Sophomores type dream. When it becomes numeric, it becomes an Ackermann number. In particular, the Sophomores dream tower is of the type x x x x . In metrical fixed point theories, especially, contraction mappings involving such towers appeared first in Okeke and Francis [1].
In [2], the celebrated contraction principle due to S. Banach, which appeared in the literature in 1922, is one of the most important and useful results in the metric fixed point theory due to its numerous applications. In Banach’s theorem, X is taken to be a complete metric space with a metric d and f : X X is required to be a contraction; that is, there must exist 0 L < 1 such that d ( f ( x ) , f ( y ) ) L d ( x , y ) for all x , y X . The conclusion is that f has a fixed point, in fact exactly one of them. This has encountered many extensions/generalizations, as recorded in [3,4,5,6,7,8,9,10,11,12,13] and references therein. Among these generalizations, we prefer the one given by Geraghty [5].
More than a decade ago, Amini-Harandi and Emami [14] characterized the result of Geraghty in the context of a partially ordered complete metric space with some application to ordinary differential equations. Gordji et al. [15] defined the notion of ψ -Geraghty type contraction and supposedly improved and extended the results of Amini-Harandi and Emami [14]. Cho et al. [16] defined the concept of α -Geraghty contraction type maps in the setting of a metric space and proved the existence and uniqueness of a fixed point of such maps in the context of a complete metric space. Popescu [17] generalized the results obtained by Cho et al. [16] and gave other conditions to prove the existence and uniqueness of a fixed point of α -Geraghty contraction type maps in the context of a complete metric space. See also [18,19] for other results for the fixed point theory.
It is interesting to know that some results that involved the Banach contraction mapping principle and its allied results involving partially ordered metric spaces have been optimized to the theoretic relation by replacing the partial order relation with a locally H -transitive relation, which remains an optimal condition of transitivity, as recorded in [20,21,22,23,24] and some of their references therein.
Recently, Okeke and Francis [1] first defined a new class of nonlinear mappings in metric spaces, called metric tower mappings, and proved the existence of a fixed point of Geraghty tower-type mappings in complete metric spaces and gave some nontrivial examples that justified the newly defined contraction mapping. Francis and Okeke [25], defined rational type Geraghty tower contraction mapping and proved the existence of finite and infinite rational Geraghty tower theorem(s) in complete metric spaces.
In 2010, Chistyakov [26] introduced modular metric space as a natural extension and generalization of classical modular in the sense of Nakano [27] and classical metric spaces in the sense of Fre’chet [28]. In fact, metric modular space is a parameterized metric space in extended real line, which may not obey the famous triangular inequality. Chistyakov [29] extended the famous Banach contraction mapping principle in the setting of modular metric space. Furthermore, similar extension have been carried out by Mongkolkeha et al. [30], and while their results contained some bugs, these were eventually solved. In the spirit of modular metric spaces, Chaipunya et al. [31] extended the results in Geraghty [5] by defining more classes satisfying Geraghty functions, while Okeke et al. [32] provided a Geraghty-type class that contained several results in the literature. There are numerous studies on Geraghty contraction in various spaces, such as multiplicative, b metric spaces, partial metric spaces, extended modular metric spaces, G metric spaces, modular G metric spaces, etc. Interested reader should consult [3,13,15,18,19,32] and the references therein for other results for fixed point theory.
In this paper, we give a tower type contraction maps which further characterize and include the results in Amini-Harandi and Emami [14], and some other related contraction types in the literature. We also give a nontrivial supportive example to justify our claims. The results are new and interesting in their own right. The results we establish in this paper extend, improve, and generalize some existing results in the literature.

2. Preliminaries

Throughout the article, N = { n Z | n 0 } is the set of nonnegative integers and R + = { x R | x > 0 } is the set of positive real numbers. By a relation (or a binary relation) ⊑ on a set A, we mean a subset of A × A . The following results and definitions will be useful in this paper.
Following [24], A is a set, ⊑ is a relation on A, and f , g are self mappings. We begin with the definitions involving a set theoretic relation.
Definition 1
([23]). A pair of elements u , v A satisfying either ( u , v ) or ( v , u ) is said to be -comparative. We shall denote such a pair by [ u , v ] .
Definition 2
([33]). For each pair u , v A , if [ u , v ] , we say that is a complete relation.
Definition 3
([33]). The inverse of is a relation 1 defined by 1 : = { ( u , v ) A × A : ( v , u ) } .
Definition 4
([33]). The symmetric closure of is a relation s defined by s : = 1 .
Proposition 1
([23]). ( u , v ) s [ u , v ] .
Definition 5
([33]). For any subset B A , the relation on B defined by | B : = B × B , which is referred as the restriction of on B.
Definition 6
([23]). For each pair of elements u , v A with ( u , v ) , if ( f u , f v ) , then is termed as f-closed.
Remark 1.
We can improve Definition 6 in the following way: For each pair of elements u , v A with ( u , v ) , if ( f u , g v ) , then is termed as ( f , g ) -closed. The idea here coincides with that of Definition 6 if f = g .
Proposition 2
([21]). If is f-closed, then is f n -closed, n N .
Definition 7
([23]). If a sequence { x n } A verifies ( x n , x n + 1 ) n N , then we say that { x n } is -preserving.
Definition 8
([23]).is called ρ-self-closed if each -preserving convergent sequence in A has a subsequence whose terms are -comparative with the limit.
Definition 9
(f-Transitive relation [21]). Given a map f: X X , we say that a relation on X is f-transitive if ( f u , f w ) for all u , v , w X such that ( f u , f v ) , ( f v , f w ) .
From Definition 9, we introduce the following concept.
Definition 10
( ( f , g ) -Transitive relation). Let f , g : X X , we say that a relation on X is ( f , g ) -transitive if ( f u , g w ) for all u , v , w X such that ( f u , f v ) , ( f v , g w ) , ( f u , g v ) , ( g v , g w ) .
Definition 11
([21,24]).is termed as locally f-transitive if for any - preserving sequence { x n } f ( A ) , the relation | B (whereas B : = { x n : n N } ) is transitive.
Following [21], we have the definitions below.
Definition 12.
is called locally ( f , g ) -transitive if for any - preserving sequence { x n } f ( A ) g ( A ) , the relation | B (whereas B : = { x n : n N } ) is transitive.
Remark 2.
If f = g , coincide with Definition 11.
Definition 13
([22]). f is termed as -continuous at x * A if for every -preserving sequence { x n } A verifying x n x * ,   f ( x n ) f ( x * ) .   A -continuous map at each point of A is referred as -continuous.
Definition 14
([33]). A binary relation ⊑ defined on any nonempty set A is said to be:
(1) 
Reflexive if ( u , u ) for all u A ;
(2) 
Symmetric if ( u , v ) implies ( v , u ) ;
(3) 
Transitive if ( u , v ) , ( v , w ) implies ( u , w ) ;
(4) 
Dichotomous if [ u , v ] for all u , v A ;
(5) 
Trichotomous if [ u , v ] or u = v for all u , v A ;
(6) 
Equivalent if ⊑ is reflexive, symmetric, and transitive.
Definition 15
([22]). A metric space ( A , ρ ) is referred as -complete if each - preserving Cauchy sequence in A converges.
Definition 16
([34]). A partially ordered set is a pair ( A , ) , where A is a set and is a binary relation on A such that:
(1) 
u u for every u A ;
(2) 
if u and v belong to A and u v and v u , then u = v ;
(3) 
if u , v and r belong to A and u v and v r , then u r .
Definition 17
([5]). S is the class of functions α : R + [ 0 , 1 ) with:
(i) 
R + = { t R | t > 0 } ;
(ii) 
α ( t n ) 1 t n 0 as n .
Definition 18
([31]). For each n N , let S n denote the class of n-tuples of functions ( β 1 , β 2 , β 3 , , β n ) , where for each i { 1 , 2 , , n } , β i : R + { } [ 0 , 1 ) and the following implications holds: β ( t k ) : = β 1 ( t k ) + β 2 ( t k ) + + β n ( t k ) 1 implies t k 0 .
It follows that, for each m { 1 , 2 , , n } , if ( β 1 , β 2 , β 3 , , β m ) S m , then { β 1 , β 2 , β 3 , , β m , 0 , 0 , 0 , 0 n m e n t r i e s } S n , where 0 is a zero function.
Remark 3.
Note that, if ( β , β , , β n e n t r i e s ) S n , then we also have the following: β ( t k ) 1 n implies t k 0 .
Remark 4.
The class of function defined in Definition 17 can equally put to work when we define more functions other than α in that class, S.
Theorem 1
([5]). Let X be a complete metric space. Let f : X X with d ( f ( x ) , f ( y ) ) < d ( x , y ) , for all x , y X . Let x 0 X and set f ( x n 1 ) = x n for all n > 0 . Then, x n x * in X, with x * a unique fixed point of f, if and only if for any two subsequences x h n and x h k with x h n x h k , we have that Π n 1 only if d n 0 .
Remark 5.
In Theorem 1, we take for any pair of sequences x n and y n with x n y n , we write d n = d ( x n , y n ) and Π n = d ( f ( x n ) , f ( y n ) ) d ( x n , y n ) .
Theorem 2
([5]). Let f : X X be a contraction on a complete metric space. Let x 0 X and set f ( x n 1 ) = x n for all n > 0 . Then x n x * in X, where x * a unique fixed point of f in X, if and only if there exists an α in S such that for all n , m :
d ( f ( x n ) , f ( x m ) ) α ( d ( x n , x m ) ) d ( x n , x m ) .
Theorem 3
([5]). Let ( X , ρ ) be a complete metric space and T : X X such that there is an α S satisfying
ρ ( T x , T y ) α ( ρ ( x , y ) ) ρ ( x , y ) ,
for all x , y X . Then, the sequence { x k } k N defined by T x k 1 = x k converges to a unique fixed point of T in X for k 1 .
The functions ω of the form ω : ( 0 , ) × X × X [ 0 , ] , where X is a fixed nonempty set (with at least two elements). Due to the disparity of the arguments, we may (and will) write ω λ ( x , y ) = ω ( λ , x , y ) for all λ > 0 and x , y X . In this way, ω = { ω λ } λ > 0 is a one-parameter family of functions ω λ : X × X [ 0 , ] . On the other hand, given x , y X , we may set ω x , y ( λ ) = ω ( λ , x , y ) for all λ > 0 , so that ω x , y : ( 0 , ) [ 0 , ] .
Definition 19
([35]). A function ω : ( 0 , ) × X × X [ 0 , ] is said to be a metric modular (or simply modular) on X if it satisfies the following three axioms:
(i) given x , y X , x = y if and only if ω λ ( x , y ) = 0 for all λ > 0 ;
(ii) ω λ ( x , y ) = ω λ ( y , x ) for all λ > 0 and x , y X ;
(iii) ω λ + μ ( x , y ) ω λ ( x , z ) + ω μ ( z , y ) for all λ , μ > 0 and x , y , z X .
Weaker and stronger versions of conditions (i) and (iii) will be of great importance. If, instead of (i), the function ω satisfies (only) a weaker condition:
(i′) ω λ ( x , x ) = 0 for all λ > 0 and x X ,
then ω is said to be a pseudomodular on X. Furthermore, if, instead of (i), the function ω satisfies (i) and a stronger condition:
( i s ) given x , y X with x y , ω λ ( x , y ) 0 for all λ > 0 , then ω is called a strict modular on X .
A modular (or pseudomodular, or strict modular) ω on X is said to be convex if, instead of (iii), it satisfied the (stronger) inequality (iv):
(iv) ω λ + μ ( x , y ) λ λ + μ ω λ ( x , z ) + μ λ + μ ω μ ( z , y ) for all λ , μ > 0 and x , y , z X .
Remark 6.
(a) The assumption ω : ( 0 , ) × X × X ( , + ] in the definition of a pseudomodular does not lead to a greater generality: in fact, setting y = x and μ = λ > 0 in (iii) and taking into account (i’) and (ii), we find:
0 = ω 2 λ ( x , x ) ω λ ( x , z ) + ω λ ( z , x ) = 2 ω λ ( x , z ) ,
thus, ω λ ( x , z ) 0 or ω λ ( x , z ) = for all λ > 0 and x , z X .
(b) If ω λ ( x , y ) = ω λ is independent of x , y X , then, by (i), ω 0 . Note that ω 0 is only a pseudomodular on X (by virtue of (i) ).
If ω λ ( x , y ) = ω ( x , y ) does not depend on λ > 0 , then axioms (i)–(iii) mean that ω is an extended metric (extended pseudometric if (i) is replaced by ( i ) ) on X ; ω is a metric on X if, in addition, it assumes finite values.
(c) Axiom (i) can be written as ( x = y ) ( ω λ ( x , y ) = 0 ) and part ( i ) in it—as ( x y ) ( ω λ ( x , y ) 0 ) . Condition ( i s ) says that ( x y ) ( ω λ ( x , y ) 0 ) for all λ > 0 , and thus, it implies ( i ) . In other words, ( i s ) means that if ω λ ( x , y ) = 0 for some λ > 0 (and not necessarily for all λ > 0 as in ( i ) ) , then x = y . Thus, ( i ) + ( i s ) ( i ) ( i ) .
Following [35], we have the essential property of a pseudomodular ω on X is its monotonicity: given x , y X , the function ω x , y : ( 0 , ) [ 0 , ] is nonincreasing on ( 0 , ) . In fact, if 0 < μ < λ , then axioms (iii) (with z = x ) and (i’ ) imply:
ω λ ( x , y ) = ω ( λ μ ) + μ ( x , y ) ω λ μ ( x , x ) + ω μ ( x , y ) = ω μ ( x , y ) .
As a consequence, given x , y X , at each point λ > 0 , the limit from the right:
( ω + 0 ) λ ( x , y ) ω λ + 0 ( x , y ) = lim μ λ + 0 ω μ ( x , y ) = sup { ω μ ( x , y ) : μ > λ }
and the limit from the left:
( ω 0 ) λ ( x , y ) ω λ 0 ( x , y ) = lim μ λ 0 ω μ ( x , y ) = inf { ω μ ( x , y ) : 0 < μ < λ } ,
exist in [ 0 , ] , and the following inequalities hold, for all 0 < μ < λ :
ω λ + 0 ( x , y ) ω λ ( x , y ) ω λ 0 ( x , y ) ω μ + 0 ( x , y ) ω μ ( x , y ) ω μ 0 ( x , y )
To see this, by the monotonicity of ω , for any 0 < μ < μ 1 < λ 1 < λ , we have:
ω λ ( x , y ) ω λ 1 ( x , y ) ω μ 1 ( x , y ) ω μ ( x , y )
and it remains to pass to the limits as λ 1 λ 0 and μ 1 μ + 0 .
Remark 7.
For any x i X , the set X ω ( x i ) = { x X s u c h t h a t lim λ ω λ ( x , x i ) = 0 } is called a modular metric space generated by x i and induced by ω. If its generator x i does not play any role in the situation (that is, X ω is independent of generators), we shall write X ω instead of X ω ( x i ) .
A metric modular on X ω is said to be nonincreasing with respect to λ > 0 if for any x , y X ω and 0 < μ < λ such that ω λ ( x , y ) ω λ μ ( x , x ) + ω μ ( x , y ) = ω μ ( x , y ) for any x , y X and λ > 0 . We set ω λ + ( x , y ) : = lim ϵ 0 ω λ + ϵ ( x , y ) and ω λ ( x , y ) : = lim ϵ 0 ω λ ϵ ( x , y )
Remark 8.
For any x , y X ω , if a metric modular ω on X ω has a finite value and ω λ ( x , y ) = ω μ ( x , y ) for all λ , μ > 0 , then d ( x , y ) = ω λ ( x , y ) is a metric on X ω .
Remark 9.
Let ω be a modular on X and let X ω be any one of the modular sets defined by ω. Then, d ω ( x , y ) = inf { λ > 0 : ω λ ( x , y ) λ x , y X ω } define a metric on X ω . If the modular ω is convex, then the modular space can be endowed with another metric d ω * given by d ω * ( x , y ) = inf { λ > 0 : ω λ ( x , y ) 1 x , y X ω } . These metrics on the modular set are strongly equivalent: d ω d ω * 2 d ω , as recorded in [26].
Definition 20
([35], Sec. 2.1, page 19). Let ( X , ω ) be a modular space. Fix x 0 X . Set X ω = X ω ( x 0 ) = { x X : ω λ ( x , x 0 ) = 0 a s λ } and X ω * = X ω * ( x 0 ) = { x X : ω λ ( x , x 0 ) < f o r λ > 0 } , where X ω and X ω * are said to be modular spaces centered at x 0 .
Definition 21
([26]). A metric modular on X is said to be nonincreasing with respect to λ > 0 if for any x , y X and 0 < μ < λ such that ω λ ( x , y ) ω λ μ ( x , x ) + ω μ ( x , y ) = ω μ ( x , y ) for any x , y X and λ > 0 . We set ω λ + ( x , y ) : = lim ϵ 0 ω λ + ϵ ( x , y ) and ω λ ( x , y ) : = lim ϵ 0 ω λ ϵ ( x , y ) .
Definition 22
([31]). Let X ω be a modular metric space and { x n } n N be a sequence in X ω . Then
(a) 
A point x X ω is called a limit of { x n } n N if for each λ , ϵ > 0 there exists N N such that ω λ ( x n , x ) < ϵ for all n N .
A sequence that has a limit is said to be convergent or converges to x, which we write as lim n x n = x .
(b) 
A sequence { x n } n N X ω is said to be a modular Cauchy sequence if for each λ , ϵ > 0 , there exists N N such that ω λ ( x n , x m ) < ϵ whenever n , m N .
(c) 
If every modular Cauchy sequence in X ω converges in X ω , then X ω is said to be complete modular metric space.
Following [21,31], we give the following definitions via binary relation in metric modular space.
Definition 23.
A modular metric space, X ω is said to be -complete if each - preserving Cauchy sequence in X ω converges.
Remark 10.
Here, modular completeness and continuity are replaced by their relational analogs, i.e., -completeness and -continuity;
Definition 24
([30]). Let ω be a metric modular on X and X ω a modular metric space induced by ω and T : X ω X ω . A mapping T is called a contraction if for each x , y X ω and for all λ > 0 , there exists 0 k < 1 such that ω λ ( T x , T y ) k ω λ ( x , y ) .
Definition 25
([25]). Let ( X , ω ) be a modular metric space and T : X ω X ω such that there are { α , β , γ , δ , ϵ } F G e r . Then, T is called a Geraghty metric modular tower contraction map if for all λ > 0 , then:
ω λ ( T x , T y ) α ( ω λ ( x , y ) ) ω λ ( x , y ) A β B γ C δ D ϵ ;
where A β : = β ( ω λ ( x , y ) ) ω λ ( x , T x ) , B γ : = γ ( ω λ ( x , y ) ) ω λ ( y , T y ) , C δ : = δ ( ω λ ( x , y ) ) ω λ ( x , T y ) ; D ϵ : = ϵ ( ω λ ( x , y ) ) ω λ ( y , T x ) , for all distinct x , y X ω .
Remark 11.
We can possibly interchange position(s) of A β , B γ , C δ , and D ϵ in Definition 25.
Following the construction by Okeke et al. [32] and Okeke and Francis [1], it will be useful before spelling out the results of Section 3. The following analogy will help. For each n N , let F n G e r be the class of n-tuples of functions { μ 1 , μ 2 , μ n } and for each i { 1 , 2 , 3 , , n } , the map μ i : R + { } [ 0 , 1 ) , so that we have the following μ ( t k ) : = μ 1 ( t k ) μ 2 ( t k ) μ n ( t k ) 1 t k 0 . Now for each m { 1 , 2 , , n } , suppose that { μ 1 , μ 2 , μ m } F m G e r , then { μ 1 , μ 2 , μ m , 0 , 0 , 0 , 0 n m t i m e s } F m G e r , where 0 is a zero function. Again, if { μ , μ , μ } n t i m e s F n G e r , then μ ( t k ) 1 n implies t k 0 as k . If { μ 1 , μ 2 , μ n } F n G e r , then π ( μ 1 , μ 2 , μ n ) F n G e r is a permutation of ( μ 1 , μ 2 , μ n ) . If ( μ 1 , μ 2 , μ n ) F n G e r , then its subsequences i.e; ( μ n 1 , μ n 2 , μ n m ) F m G e r for each m { 1 , 2 , , n } . μ n i μ n j for all i , j { 1 , 2 , , m } , where μ n i { μ 1 , μ 2 , μ n } .
We will in this work take the class of functions in Definition 18 as F G e r , the class of all Geraghty functions.

3. Main Results

We start this section with a striking theorem concerning tower mappings in (pseudo)modular metric spaces.
Theorem 4.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω and { α , δ , ϵ } F G e r , λ Γ : = ( 0 , ) satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ O ϵ A δ O ϵ ,
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) for all k N , is ( f , g ) -closed and locally ( f , g ) -transitive, and u , v X ω are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ) g ( X ) ; f is ( g , ) -nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω which is -comparable to u and v, i.e., [ u , v ] so that f and g have a unique common fixed point in X ω .
Proof. 
Suppose that X ω = , then there is nothing to prove. Observe that in particular, if g (or f) is injective on the set of all coincidence points of f and g , then f and g have a unique coincidence point, which is also the common fixed point of f and g . Henceforth, we take X ω . Let x 0 X ω such that g x 0 f x 0 . If  f ( X ω ) g ( X ω ) , then there exists a Picard sequence of  ( f , g ) based on any x 0 X ω . Indeed, let x 0 X ω . Since f x 0 f ( X ω ) g ( X ω ) , there exists x 1 X ω such that g x 1 = f x 0 . Analogously, since f x 1 f ( X ω ) g ( X ω ) , there exists x 2 X ω such that g x 2 = f x 1 . Repeating this argument by the inductive hypothesis, we can find a Picard sequence of ( f , g ) based on x 0 . Since f ( X ω ) g ( X ω ) , the above assertion guarantees the existence of a Picard sequence { x n } of ( f , g ) , that is, g x n + 1 = f x n , for all n 0 . Regarding that f is a ( g , ) nondecreasing mapping, we observe that g x 0 f x 0 = g x 1 implies g x 1 = f x 0 f x 1 = g x 2 . Inductively, we obtain:
g x 0 g x 1 g x 2 g x 3 g x n 1 g x n g x n + 1 .
This implies that ( g x n , g x n + 1 ) . If there exists n 0 such that g x n 0 = g x n 0 + 1 , then g x n 0 = g x n 0 + 1 = f x n 0 , that is, f and g have a coincidence point, which completes the existence part of the proof. On the contrary case, assume that g x n g x n + 1 for all n N , λ Γ , that is, ω λ ( g x n , g x n + 1 ) > 0 for all n 0 . Regarding inequality (10), we set u = x n and v = x n + 1 in inequality (9). Then we get, for all n N :
ω λ ( g x n + 1 , g x n + 2 ) = ω λ ( f x n , f x n + 1 ) = ω λ ( f u , f v ) α ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) A δ O ϵ A δ O ϵ ;
where A δ : = δ ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) ; O ϵ : = ϵ ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n + 1 , f x n ) .
Thus, A δ : = δ ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) ; O ϵ : = ϵ ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n + 1 , g x n + 1 ) .
Therefore, inequality (11) collapses to:
ω λ ( g x n + 1 , g x n + 2 ) α ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) .
Then, the sequence { ω λ ( g x n , g x n + 1 ) } n N is nonincreasing sequence and bounded below, so lim n ω λ ( g x n , g x n + 1 ) = 0 . Assume that > 0 , then from inequality (12), we obtain:
ω λ ( g x n + 1 , g x n + 2 ) ω λ ( g x n , g x n + 1 ) α ( ω λ ( g x n , g x n + 1 ) ) ,
for n = 1 , 2 , 3 , . Then, from inequality (13), we get 1 lim n α ( ω λ ( g x n , g x n + 1 ) ) and since α F G e r , this implies that = 0 . Then, lim n ω λ ( g x n , g x n + 1 ) = 0 . Now we show that { g x n } n N is a modular preserving Cauchy sequence in X ω . On the contrary, assume that for each n , m N , and n > m :
lim n , m ω λ ( g x n , g x m ) > 0 .
By triangle inequality:
ω λ ( g x n , g x m ) ω λ 3 ( g x n , g x n + 1 ) + ω λ 3 ( g x n + 1 , g x m + 1 ) + ω λ 3 ( g x m + 1 , g x m ) .
Hence, from inequality (12), we have ω λ ( g x n , g x m ) [ 1 α ( ω λ ( g x n , g x m ) ) ] 1 [ ω λ ( g x n , g x n + 1 ) + ω λ ( g x n + 1 , g x m ) ] .
Since lim sup n , m ω λ ( g x n , g x m ) > 0 and lim n ω λ ( g x n , g x n + 1 ) = 0 , then lim n lim sup m ( 1 α ( ω λ ( g x n , g x m ) ) ) 1 = + , from which we obtain lim n , m sup α ( ω λ ( g x n , g x m ) ) = 1 . However, α F G e r , we get:
lim n , m sup ω λ ( g x n , g x m ) = 0 .
This contradicts inequality (14) and shows that { g x n } n 1 is a modular preserving Cauchy sequence in X ω .
Due to ⊑-completeness of ( X ω , d ω ) , then there exists z X ω such that lim n g x n = z , i.e., for all λ Γ , lim n ω λ ( g x n , z ) 0 . Indeed, it suffices to show that given a sequence  { g x n } X ω and z X ω , we have: g x n z if and only if ω λ ( g x n , z ) 0 for all λ > 0 . Now, let g x n z . Given ϵ > 0 , there exists n 0 = n 0 ( ϵ ) N such that d ω ( g x n , z ) < ϵ for all n n 0 ( ϵ ) . By inequality (6) and Theorem 2.2.11(a) of ([35], Sec. 2.2), ω ϵ ( g x n , z ) ω ϵ 0 ( g x n , z ) < ϵ for all n n 0 ( ϵ ) . Hence, if λ > 0 , then, for any n n 0 ( min { ϵ , λ } ) , we find, by inequality (3), that ω λ ( g x n , z ) ω min { ϵ , λ } ( g x n , z ) < min { ϵ , λ } ϵ , and thus, ω λ ( g x n , z ) 0 . Conversely, if ϵ > 0 , then ω ϵ ( g x n , z ) 0 , and thus, there is n 1 ( ϵ ) N such that ω ϵ ( g x n , z ) ϵ for all n n 1 ( ϵ ) . By Remark 9, d ω implies d ω ( g x n , z ) ϵ for n n 1 ( ϵ ) , i.e., d ω ( g x n , z ) 0 . Therefore, lim n g x n = z is justified. As g and f are ⊑-continuous, g g x n g z and f g x n f z as n . On the other hand, recall that g and f commute, so we have that g g x n + 1 = g f x n = f g x n = f z for all n 0 . Therefore, by the uniqueness of the limit of a preserving modular ⊑-convergent sequence, i.e., we invoke Theorem 4.1.1 of ([35], Sec. 4.1.1) and we conclude that g z = f z , that is, z is a coincidence point of f and g .
Suppose that x * and z * are coincidence points of f and g respectively, then there exists w X ω such that g x * g w and g z * g w . We claim that g x * = g z * . In fact, this is immediate from properties of binary relation. Without loss of generality, assume that x * and z * are two coincidence points of f and g and let w X ω be such that g x * g w and g z * g w . Let { w n } be a Picard sequence of ( f , g ) based on the point w 0 = w . As x * w and z * w and f is a ( g , ) nondecreasing mapping, then g x * = f x * f w 0 = g w 1 and g z * = f z * f w 0 = g w 1 . Similarly, by induction, it is easy to prove that g x * g w n and g z * g w n for all n N . Applying the inequality (9), for all n N , λ Γ :
ω λ ( g x * , g w n + 1 ) = ω λ ( f x * , f w n ) = ω λ ( f u , f v ) α ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) A δ O ϵ A δ O ϵ ;
where A δ : = δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) ; O ϵ : = ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g w n , f x * ) , so that:
ω λ ( g x * , g w n + 1 ) α ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) A δ O ϵ A δ O ϵ ;
where A δ : = δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) ; O ϵ : = ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g w n , g x * ) . Now we see the possibility of the limiting processes; put d ω : = ω λ ( g x * , g w n + 1 ) , so that:
d ω α ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) A δ O ϵ A δ O ϵ = α ( ω λ ( g x * , g w n ) ) exp ln ω λ ( g x * , g w n ) A δ O ϵ A δ O ϵ = α ( ω λ ( g x * , g w n ) ) exp A δ O ϵ A δ O ϵ ln ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i ln i ω λ ( g x * , g w n ) i ! α ( ω λ ( g x * , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i ω λ ( g x * , g w n ) i ! = α ( ω λ ( g x * , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i i ! ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 1 i ! exp ln A δ O ϵ A δ O ϵ i ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 1 i ! exp O ϵ A δ O ϵ i ln A δ ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j ln j A δ ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j A δ ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 1 i ! j ! exp ( ln O ϵ A δ O ϵ i j δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ln k O ϵ δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k O ϵ δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g w n , g x * ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ϵ ( ω λ ( g x * , g w n ) ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! exp ln A δ O ϵ i j k ϵ ( ω λ ( g x * , g w n ) ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l ln l A δ ϵ ( ω λ ( g x * , g w n ) ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l A δ ϵ ( ω λ ( g x * , g w n ) ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) ϵ ( ω λ ( g x * , g w n ) ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) δ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ 2 ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ( ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g w n , g x * ) ) i j k l δ 2 ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) = α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g x * , g w n ) ) ω λ i j k l ( g w n , g x * ) δ 2 ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g x * , g w n ) ) ω λ ( g w n , g x * ) δ 2 ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g x * , g w n ) ) δ 2 ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) α ( ω λ ( g x * , g w n ) ) i = 0 j = 0 k = 0 l = 0 ϵ i j k l + 1 ( ω λ ( g x * , g w n ) ) δ 2 ( ω λ ( g x * , g w n ) ) i ! j ! k ! l ! ω λ ( g x * , g w n ) = i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g x * , g w n ) ) ϵ i j k l + 1 ( ω λ ( g x * , g w n ) ) δ 2 ( ω λ ( g x * , g w n ) ) i ! j ! k ! l ! ω λ ( g x * , g w n ) i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g x * , g w n ) ) ϵ i j k l ( ω λ ( g x * , g w n ) ) ϵ ( ω λ ( g x * , g w n ) ) δ 2 ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) .
Thus, by taking the limit as n , from inequality (47), we see clearly that:
lim n ω λ ( g x * , g w n ) = 0 λ Γ .
Therefore, from Equation (19), we have that { g w n } g x * as n . Similarly, replacing g x * in inequality (18) with g z * , it can be proved that:
ω λ ( g z * , g w n + 1 ) i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g z * , g w n ) ) ϵ i j k l ( ω λ ( g z * , g w n ) ) ϵ ( ω λ ( g z * , g w n ) ) δ 2 ( ω λ ( g z * , g w n ) ) ω λ ( g z * , g w n ) .
Thus:
1 lim inf n i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g z * , g w n ) ) ϵ i j k l ( ω λ ( g z * , g w n ) ) ϵ ( ω λ ( g z * , g w n ) ) δ 2 ( ω λ ( g z * , g w n ) ) ,
hence, inequality (21) implies that:
lim n ω λ ( g z * , g w n ) = 0 ,
Therefore, from Equation (22), we get { g w n } g z * as n . As a consequence, we have that g x * = g z * , which justified our claim. Next, we show that, for all coincidence point x * of f and g, the point ξ = f x * is a common fixed point of f and g. Let x * X ω be an arbitrary coincidence point of f and g and let ξ = f x * = g x * . As f and g commutes, if f and g are commuting mappings and x * is a coincidence point of f and g , then ξ = f x * is also a coincidence point of f and g. It follows from f ξ = f g x * = g f x * = g ξ , so that ξ = f x * is also a coincidence point of f and g. Then, f ξ = g ξ . Moreover, by our previous claim, we have that g x * = g ξ . In particular, f ξ = g ξ = g x * = f x * = ξ . Therefore, ξ is a common fixed point of f and g .
Finally, we prove that f and g have a unique common fixed point. Let ξ and z be two common fixed points of f and g, that is, ξ = f ξ = g ξ and z = f z = g z .
For any ξ , z X ω , there exists w X ω which is ⊑-comparable to both ξ and z, i.e., [ ξ , z ] . Suppose that ξ < z which implies that ω λ ( ξ , z ) > 0 for all λ Γ , so by triangle inequality we have that:
ω λ ( ξ , z ) = ω λ ( f ( ξ ) , f ( z ) ) ω λ 2 ( ξ , f ( w n ) ) + ω λ 2 ( z , f ( w n ) ) ω λ ( g ( ξ ) , f ( w n ) ) + ω λ ( g ( z ) , f ( w n ) ) = ω λ ( f ( ξ ) , f ( w n ) ) + ω λ ( f ( z ) , f ( w n ) ) .
Monotonicity implies that f ( w n ) is ⊑-comparable to f ( ξ ) = ξ and f ( z ) = z for n = 1 , 2 , 3 , . Moreover, inequality (23) splits into two fold claims.
Claim a.
ω λ ( ξ , f ( w n ) ) = ω λ ( f ( ξ ) , f ( w n ) ) α ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) A δ O ϵ A δ O ϵ ,
where A δ : = δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) ; O ϵ : = ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g w n , f ξ ) , and hence, A δ : = δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) ; O ϵ : = ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g w n , g ξ ) .
From inequality (24), we get Θ d ω : = ω λ ( ξ , f ( w n ) ) . Thus:
Θ d ω = ω λ ( f ( ξ ) , f ( w n ) ) α ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) A δ O ϵ A δ O ϵ = α ( ω λ ( g ξ , g w n ) ) exp ln ω λ ( g ξ , g w n ) A δ O ϵ A δ O ϵ = α ( ω λ ( g ξ , g w n ) ) exp A δ O ϵ A δ O ϵ ln ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i ln i ω λ ( g ξ , g w n ) i ! α ( ω λ ( g ξ , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i ω λ ( g ξ , g w n ) i ! = α ( ω λ ( g ξ , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i i ! ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 1 i ! exp ln A δ O ϵ A δ O ϵ i ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 1 i ! exp O ϵ A δ O ϵ i ln A δ ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j ln j A δ ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j A δ ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 1 i ! j ! exp ( ln O ϵ A δ O ϵ i j δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ln k O ϵ δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k O ϵ δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g w n , g ξ ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ϵ ( ω λ ( g ξ , g w n ) ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! exp ln A δ O ϵ i j k ϵ ( ω λ ( g ξ , g w n ) ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l ln l A δ ϵ ( ω λ ( g ξ , g w n ) ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l A δ ϵ ( ω λ ( g ξ , g w n ) ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) ϵ ( ω λ ( g ξ , g w n ) ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) δ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ 2 ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ( ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g w n , g ξ ) ) i j k l δ 2 ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g ξ , g w n ) ) ω λ i j k l ( g w n , g ξ ) δ 2 ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g ξ , g w n ) ) ω λ ( g w n , g ξ ) δ 2 ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 ϵ i j k l + 1 ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) i ! j ! k ! l ! ω λ ( g ξ , g w n ) = i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g ξ , g w n ) ) ϵ i j k l + 1 ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) i ! j ! k ! l ! ω λ ( g ξ , g w n ) i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g ξ , g w n ) ) ϵ i j k l + 1 ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = α ( ω λ ( g ξ , g w n ) ) i = 0 j = 0 k = 0 l = 0 ϵ i j k l ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) = i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g ξ , g w n ) ) ϵ i j k l ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) ω λ ( g ξ , g w n ) .
From Inequality (12), we get;
1 lim n inf i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g ξ , g w n ) ) ϵ i j k l ( ω λ ( g ξ , g w n ) ) ϵ ( ω λ ( g ξ , g w n ) ) δ 2 ( ω λ ( g ξ , g w n ) ) ,
and thus, inequality (26) implies that lim n ω λ ( g ξ , g w n ) = 0 , for all λ Γ . Hence:
lim n ω λ ( ξ , f ( w n ) ) = 0 = lim n ω λ ( f ( ξ ) , f ( w n ) ) = lim n ω λ ( g ( ξ ) , f ( w n ) ) .
Again, for any z X ω , there exists w X ω which is ⊑-comparable to z. Monotonicity implies that f ( w n ) is ⊑-comparable to f ( z ) = z for n = 1 , 2 , 3 , . Moreover, from inequality (23).
Claim b.
ω λ ( z , f ( w n ) ) = ω λ ( f ( z ) , f ( w n ) ) α ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) A δ O ϵ A δ O ϵ ,
where A δ : = δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) ; O ϵ : = ϵ ( ω λ ( g z , g w n ) ) ω λ ( g w n , f z ) , and hence, A δ : = δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) ; O ϵ : = ϵ ( ω λ ( g z , g w n ) ) ω λ ( g w n , g z ) .
From inequality (28), we see that:
Φ d ω = ω λ ( f ( z ) , f ( w n ) ) α ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) A δ O ϵ A δ O ϵ = α ( ω λ ( g z , g w n ) ) exp ln ω λ ( g z , g w n ) A δ O ϵ A δ O ϵ = α ( ω λ ( g z , g w n ) ) exp A δ O ϵ A δ O ϵ ln ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i ln i ω λ ( g z , g w n ) i ! α ( ω λ ( g z , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i ω λ ( g z , g w n ) i ! = α ( ω λ ( g z , g w n ) ) i = 0 A δ O ϵ A δ O ϵ i i ! ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 1 i ! exp ln A δ O ϵ A δ O ϵ i ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 1 i ! exp O ϵ A δ O ϵ i ln A δ ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j ln j A δ ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j A δ ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 1 i ! j ! O ϵ A δ O ϵ i j δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 1 i ! j ! exp ( ln O ϵ A δ O ϵ i j δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ln k O ϵ δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k O ϵ δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ϵ ( ω λ ( g z , g w n ) ) ω λ ( g w n , g z ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! A δ O ϵ i j k ϵ ( ω λ ( g z , g w n ) ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 1 i ! j ! k ! exp ln A δ O ϵ i j k ϵ ( ω λ ( g z , g w n ) ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l ln l A δ ϵ ( ω λ ( g z , g w n ) ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l A δ ϵ ( ω λ ( g z , g w n ) ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) ϵ ( ω λ ( g z , g w n ) ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) δ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! O ϵ i j k l δ 2 ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ( ϵ ( ω λ ( g z , g w n ) ) ω λ ( g w n , g z ) ) i j k l δ 2 ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g z , g w n ) ) ω λ i j k l ( g w n , g z ) δ 2 ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g z , g w n ) ) ω λ ( g w n , g z ) δ 2 ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 1 i ! j ! k ! l ! ϵ i j k l ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 ϵ i j k l + 1 ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) i ! j ! k ! l ! ω λ ( g z , g w n ) = i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g z , g w n ) ) ϵ i j k l + 1 ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) i ! j ! k ! l ! ω λ ( g z , g w n ) i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g z , g w n ) ) ϵ i j k l + 1 ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = α ( ω λ ( g z , g w n ) ) i = 0 j = 0 k = 0 l = 0 ϵ i j k l ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) = i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g z , g w n ) ) ϵ i j k l ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) ω λ ( g z , g w n ) ,
where Φ d ω : = ω λ ( z , f ( w n ) ) .
From Inequality (29), we get:
1 lim n inf i = 0 j = 0 k = 0 l = 0 α ( ω λ ( g z , g w n ) ) ϵ i j k l ( ω λ ( g z , g w n ) ) ϵ ( ω λ ( g z , g w n ) ) δ 2 ( ω λ ( g z , g w n ) ) ,
and thus, inequality (30) implies that lim n ω λ ( g z , g w n ) = 0 λ Γ . Hence:
lim n ω λ ( z , f ( w n ) ) = 0 = lim n ω λ ( f ( z ) , f ( w n ) ) = lim n ω λ ( g ( z ) , f ( w n ) ) .
Finally, using inequalities (24) and (28), inequality (23) becomes ω λ ( ξ , z ) ω λ ( ξ , f ( w n ) ) + ω λ ( z , f ( w n ) ) = ω λ ( f ( ξ ) , f ( w n ) ) + ω λ ( f ( z ) , f ( w n ) ) = ω λ ( g ( ξ ) , f ( w n ) ) + ω λ ( g ( z ) , f ( w n ) ) , using Equations (27), (31) and on taking the limit as n yields ω λ ( ξ , z ) = 0 for all λ Γ , which is a contradiction. Therefore, ξ = z . Hence, ξ = f ( ξ ) = g ( ξ ) . □
Remark 12.
Theorem 4 is a generalization and further characterization of results in Amini-Harand and Emami [14], Geraghty [5], Banach [2], Alam et al. [20], Alam and Imdad [22,23], and Chisyakov [29]. Again, it is a common practice in analysis that whenever existence proof is made, then the uniqueness follows easily, but the case in this paper is entirely different.
Example 1.
Let X ω = [ 0 , 1 ] { } . Define the operators f , g : X ω X ω by:
g u = { u 2 ,     i f   u X ω 0 ,     i f   u = 0 1 2 ,     i f   u = 1 .
and:
f u = { u 2 ,     i f   u X ω 0 ,     i f   u = 0
Then, the maps satisfy all the conditions in Theorem 4.
Indeed, it suffices to show that inequality (9) and other conditions of Theorem 4 hold, where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω and for all λ Γ .
Now, ω λ ( f u , f v ) = ω λ ( u 2 , v 2 ) = 1 2 ω λ ( u , v ) :
ω λ ( g u , g v ) = ω λ ( u 2 , v 2 ) 1 2 ω λ ( u , v ) .
ω λ ( g v , f u ) = ω λ ( v 2 , u 2 ) 1 2 ω λ ( u , v ) .
Thus, we get:
ω λ ( f u , f v ) = 1 2 ω λ ( u , v ) 1 2 α ( 1 2 ω λ ( u , v ) ) ω λ ( u , v ) ω λ ( u , v ) 2 ω λ ( u , v ) 2 ω λ ( u , v ) 2 ω λ ( u , v ) 2 .
It is clear that δ ( 1 2 ω λ ( u , v ) ) = 1 2 < 1 and ϵ ( 1 2 ω λ ( u , v ) ) = 1 2 < 1 . Now, we estimate α ( 1 2 ω λ ( u , v ) ) . The right hand side of inequality (34) becomes:
ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) = exp ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ln ( ω λ ( u , v ) ) = i = 0 ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ω λ i ( u , v ) i ! ln i ( ω λ ( u , v ) ) i = 0 ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ω λ i ( u , v ) i ! ω λ ( u , v ) = i = 0 exp ω λ ( u , v ) ω λ ( u , v ) ω λ i ( u , v ) ln ω λ ( u , v ) ω λ ( u , v ) i ! = i = 0 j = 0 ω λ ( u , v ) ω λ ( u , v ) ω λ i j ( u , v ) ln j ω λ ( u , v ) i ! j ! ω λ ( u , v ) i = 0 j = 0 ω λ ( u , v ) ω λ ( u , v ) ω λ i j ( u , v ) i ! j ! ω λ ( u , v ) ω λ ( u , v ) i = 0 j = 0 j = 0 ω λ ( u , v ) ω λ i j k ( u , v ) i ! j ! k ! ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) i = 0 j = 0 j = 0 l = 0 ω λ i j k l ( u , v ) i ! j ! k ! l ! ln l ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) ω λ ( u , v ) i = 0 j = 0 j = 0 l = 0 ω λ i j k l + 4 ( u , v ) i ! j ! k ! l ! i = 0 j = 0 j = 0 l = 0 ω λ ( u , v ) i ! j ! k ! l ! = i = 0 j = 0 j = 0 l = 0 1 i ! j ! k ! l ! ω λ ( u , v ) .
Take α ( 1 2 ω λ ( u , v ) ) = i = 0 j = 0 j = 0 l = 0 1 i ! j ! k ! l ! . By classical analysis, i = 0 j = 0 j = 0 l = 0 1 i ! j ! k ! l ! is convergent. Then, there exists bounded z X ω such that i = 0 j = 0 j = 0 l = 0 | z | i ! j ! k ! l ! 1 2 . Therefore, the right hand side of inequality (34) becomes 1 2 ω λ ( u , v ) .
Hence:
ω λ ( f u , f v ) = 1 2 ω λ ( u , v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ O ϵ A δ O ϵ = 1 2 ω λ ( u , v ) .
Therefore:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ O ϵ A δ O ϵ ;
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω . Hence, all the conditions of Theorem 4 are satisfied. The trivial common fixed point is at u = 0 .
Corollary 1.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω and { α , δ , ϵ } F G e r , λ Γ : = ( 0 , ) satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ O ϵ ;
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) for all k N , ⊑ is ( f , g ) -closed and locally ( f , g ) -transitive and u , v X ω are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ) g ( X ) ; f is ( g , ) -nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω which is -comparable to u and v, so that f and g have a unique common fixed point in X ω .
Corollary 2.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω and { α , δ , ϵ } F G e r , γ R + and λ Γ satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ γ O ϵ A δ O ϵ ;
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) . For all k N , is ( f , g ) -closed and locally ( f , g ) -transitive and u , v X ω are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ω ) g ( X ω ) ; f is ( g , ) -nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω which is -comparable to u and v, so that f and g have a unique common fixed point in X ω .
Proof. 
We give the proof in two cases.
(a) Observe that if γ = 0 , then inequality (38) reduced to:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) λ Γ .
Observe that in particular, if g (or f) is injective on the set of all coincidence points of f and g , then f and g have a unique coincidence point, which is also the common fixed point of f and g . Let x 0 X ω such that g x 0 f x 0 . If  f ( X ω ) g ( X ω ) , then there exists a Picard sequence of  ( f , g ) based on any x 0 X ω . Indeed, let x 0 X ω . Since f x 0 f ( X ω ) g ( X ω ) , there exists x 1 X ω such that g x 1 = f x 0 . Analogously, since f x 1 f ( X ω ) g ( X ω ) , there exists x 2 X ω such that g x 2 = f x 1 . Repeating this argument by the inductive hypothesis, we can find a Picard sequence of ( f , g ) based on x 0 . Since f ( X ω ) g ( X ω ) , the above assertion guarantees the existence of a Picard sequence { x n } of ( f , g ) , that is, g x n + 1 = f x n , for all n 0 . Regarding that f is a ( g , ) nondecreasing mapping, we observe that g x 0 f x 0 = g x 1 implies g x 1 = f x 0 f x 1 = g x 2 . Inductively, we obtain:
g x 0 g x 1 g x 2 g x 3 g x n 1 g x n g x n + 1 .
This implies that ( g x n , g x n + 1 ) . If there exists n 0 such that g x n 0 = g x n 0 + 1 , then g x n 0 = g x n 0 + 1 = f x n 0 , that is, f and g have a coincidence point, which completes the existence part of the proof. On the contrary case, assume that g x n g x n + 1 for all n N and for all λ Γ , that is, ω λ ( g x n , g x n + 1 ) > 0 for all n 0 . Regarding inequality (40), we set u = x n and v = x n + 1 in inequality (38). Then, we get, for all n N :
ω λ ( g x n + 1 , g x n + 2 ) = ω λ ( f x n , f x n + 1 ) = ω λ ( f u , f v ) α ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) .
Therefore, inequality (41) collapse to:
ω λ ( g x n + 1 , g x n + 2 ) α ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) .
Then, the sequence { ω λ ( g x n , g x n + 1 ) } n N is nonincreasing sequence and bounded below, so lim n ω λ ( g x n , g x n + 1 ) = 0 . Assume that > 0 , then from inequality (42), we obtain:
ω λ ( g x n + 1 , g x n + 2 ) ω λ ( g x n , g x n + 1 ) α ( ω λ ( g x n , g x n + 1 ) ) ,
for n = 1 , 2 , 3 , . Then, from inequality (43), we get i lim n α ( ω λ ( g x n , g x n + 1 ) ) and since α F G e r this implies that = 0 . Then lim n ω λ ( g x n , g x n + 1 ) = 0 for some λ Γ . Now, we show that { g x n } n N is a preserving modular Cauchy sequence in X ω . On the contrary, assume that for each n , m N , and n > m :
lim n , m ω λ ( g x n , g x m ) > 0 .
By triangle inequality:
ω λ ( g x n , g x m ) ω λ 3 ( g x n , g x n + 1 ) + ω λ 3 ( g x n + 1 , g x m + 1 ) + ω λ 3 ( g x m + 1 , g x m ) .
Hence, from inequality (42), we have ω λ ( g x n , g x m ) [ 1 α ( ω λ ( g x n , g x m ) ) ] 1 [ ω λ ( g x n , g x n + 1 ) + ω λ ( g x n + 1 , g x m ) ] .
Since lim sup n , m ω λ ( g x n , g x m ) > 0 and lim n ω λ ( g x n , g x n + 1 ) = 0 , for some λ Γ , then lim n lim sup m ( 1 α ( ω λ ( g x n , g x m ) ) ) 1 = + , from which we obtain lim n , m sup α ( ω λ ( g x n , g x m ) ) = 1 . However, with α F G e r , we get:
lim n , m sup ω λ ( g x n , g x m ) = 0 .
This contradicts inequality (44) and shows that { g x n } n 1 is a preserving modular Cauchy sequence in X ω .
Due to the ⊑-completeness of ( X ω , d ω ) , there exists z X ω such that lim n g x n = z , i.e., for all λ Γ , lim n ω λ ( g x n , z ) 0 . Indeed, it suffices to show that given a sequence  { g x n } X ω  and  z X ω we have g x n z  if and only if  ω λ ( g x n , z ) 0  for all  λ > 0 . Now, let g x n z . Given ϵ > 0 , there exists n 0 = n 0 ( ϵ ) N such that d ω ( g x n , z ) < ϵ for all n n 0 ( ϵ ) . By inequality (6) and Theorem 2.2.11(a) of [35], ω ϵ ( g x n , z ) ω ϵ 0 ( g x n , z ) < ϵ for all n n 0 ( ϵ ) . Hence, if λ > 0 , then, for any n n 0 ( min { ϵ , λ } ) we find, by inequality (3), that ω λ ( g x n , z ) ω min { ϵ , λ } ( g x n , z ) < min { ϵ , λ } ϵ , and thus, ω λ ( g x n , z ) 0 . Conversely, if ϵ > 0 , then ω ϵ ( g x n , z ) 0 , and thus, there is n 1 ( ϵ ) N such that ω ϵ ( g x n , z ) ϵ for all n n 1 ( ϵ ) . By Remark 9, d ω implies d ω ( g x n , z ) ϵ for n n 1 ( ϵ ) , i.e., d ω ( g x n , z ) 0 . Therefore, lim n g x n = z is justified. As g and f are ⊑-continuous, g g x n g z and f g x n f z as n . On the other hand, recall that g and f commute, so we have that g g x n + 1 = g f x n = f g x n = f z for all n 0 . Therefore, by the uniqueness of the limit of a ⊑-convergent sequence, we conclude that g z = f z , that is, z is a coincidence point of f and g.
Suppose that x * and z * are coincidence points of f and g respectively, then there exists w X ω such that g x * g w and g z * g w . We claim that g x * = g z * . In fact, this is immediate from properties of binary relation. Without loss of generality, assume that x * and z * are two coincidence points of f and g and let w X ω be such that g x * g w and g z * g w . Let { w n } be a Picard sequence of ( f , g ) based on the point w 0 = w . As x * w and z * w and f is a ( g , ) nondecreasing mapping, then g x * = f x * f w 0 = g w 1 and g z * = f z * f w 0 = g w 1 . Similarly, by induction, it is easy to prove that g x * g w n and g z * g w n for all n N . Applying the inequality (38), for all k N :
ω λ ( g x * , g w n + 1 ) = ω λ ( f x * , f w n ) = ω λ ( f u , f v ) α ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) ,
so that:
ω λ ( g x * , g w n + 1 ) α ( ω λ ( g x * , g w n ) ) ω λ ( g x * , g w n ) .
Thus, by taking the limit as n , from inequality (47), we can see clearly that:
lim n ω λ ( g x * , g w n ) = 0 λ Γ .
Therefore, from Equation (48) { g w n } g x * as n . Similarly, replacing g x * in inequality (47) with g z * , it can be proved that:
lim n ω λ ( g z * , g w n ) = 0 λ Γ .
Therefore, from Equation (49) { g w n } g z * as n . As a consequence, we have that g x * = g z * , which justifies our claim. Next, we show that, for all coincidence point x * of f and g, the point ξ = f x is a common fixed point of f and g. Let x * X be an arbitrary coincidence point of f and g and let ξ = f x = g x . As f and g commute, if f and g are commuting mappings and x * is a coincidence point of f and g , then ξ = f x is also a coincidence point of f and g. It follows from f ξ = f g x * = g f x * = g ξ , so that ξ = f x * is also a coincidence point of f and g. Then, f ξ = g ξ . Moreover, by our previous claim, we have that g x * = g ξ . In particular, f ξ = g ξ = g x * = f x * = ξ . Therefore, ξ is a common fixed point of f and g . Now the conclusion follow
(b) We suppose that γ 0 . Copy the proof of Theorem 4. □
Corollary 3.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω and { α , δ , ϵ } F G e r , λ Γ satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ A ϵ A δ A ϵ ;
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) for all k N , λ Γ , ⊑ is ( f , g ) -closed and locally ( f , g ) -transitive and u , v X ω are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ω ) g ( X ω ) ; f is ( g , ) -nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω which is -comparable to u and v, then f and g have a unique common fixed point in X ω .
Proof. 
Observe that in particular, if g (or f) is injective on the set of all coincidence points of f and g , then f and g have a unique coincidence point, which is also the common fixed point of f and g . Let x 0 X ω such that g x 0 f x 0 . If  f ( X ω ) g ( X ω ) , then there exists a Picard sequence of  ( f , g ) based on any x 0 X ω . Indeed, let x 0 X ω . Since f x 0 f ( X ω ) g ( X ω ) , there exists x 1 X ω such that g x 1 = f x 0 . Analogously, since f x 1 f ( X ω ) g ( X ω ) , there exists x 2 X ω such that g x 2 = f x 1 . Repeating this argument by the inductive hypothesis, we can find a Picard sequence of ( f , g ) based on x 0 . Since f ( X ω ) g ( X ω ) , the above assertion guarantees the existence of a Picard sequence { x n } of ( f , g ) , that is, g x n + 1 = f x n , for all n 0 . Regarding that f is a ( g , ) -nondecreasing mapping, we observe that g x 0 f x 0 = g x 1 implies g x 1 = f x 0 f x 1 = g x 2 . Inductively, we obtain:
g x 0 g x 1 g x 2 g x 3 g x n 1 g x n g x n + 1 .
This implies that ( g x n , g x n + 1 ) . If there exists n 0 such that g x n 0 = g x n 0 + 1 , then g x n 0 = g x n 0 + 1 = f x n 0 , that is, f and g have a coincidence point, which completes the existence part of the proof. On the contrary case, assume that g x n g x n + 1 for all n N , that is, ω λ ( g x n , g x n + 1 ) > 0 for all n 0 , λ Γ . Regarding inequality (51), we set u = x n and v = x n + 1 in inequality (50). Then, we get, for all n N :
ω λ ( g x n + 1 , g x n + 2 ) = ω λ ( f x n , f x n + 1 ) = ω λ ( f u , f v ) α ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) A δ A ϵ A δ A ϵ ;
where A δ : = δ ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) .
Thus, A δ : = δ ( ω λ ( g x n , g x n + 1 ) ) ω λ ( g x n , g x n + 1 ) . Carefully following the proof of Theorem 4, the conclusion follows. □
Corollary 4.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω for all λ Γ and { α , δ , ϵ } F G e r , γ R + satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ γ A ϵ A δ A ϵ ;
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) < for all k N , ⊑ is ( f , g ) -closed and locally ( f , g ) -transitive and u , v X λ are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ω ) g ( X ω ) ; f is ( g , ) nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω , which is -comparable to u and v, then f and g have a unique common fixed point in X ω .
Proof. 
We give the proof in three cases.
(a) Observe that if γ = 0 , then inequality (53) is reduced to:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) λ Γ .
Observe that in particular, if g (or f) is injective on the set of all coincidence points of f and g , then f and g have a unique coincidence point, which is also the common fixed point of f and g . Let x 0 X ω such that g x 0 f x 0 . If  f ( X ω ) g ( X ω ) , then there exists a Picard sequence of  ( f , g ) based on any x 0 X ω . Indeed, let x 0 X ω . Since f x 0 f ( X ω ) g ( X ω ) , there exists x 1 X ω such that g x 1 = f x 0 . Analogously, since f x 1 f ( X ω ) g ( X ω ) , there exists x 2 X ω such that g x 2 = f x 1 . Repeating this argument by the inductive hypothesis, we can find a Picard sequence of ( f , g ) based on x 0 . Since f ( X ω ) g ( X ω ) , the above assertion guarantees the existence of a Picard sequence { x n } of ( f , g ) , that is, g x n + 1 = f x n , for all n 0 . Regarding that f is a ( g , ) nondecreasing mapping, we observe that g x 0 f x 0 = g x 1 implies g x 1 = f x 0 f x 1 = g x 2 . Part (a) of Corollary 2 finishes the proof of (a).
(b) Observe also that if γ = 1 , then inequality (53) is reduced to:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ A ϵ A δ A ϵ ;
and the Corollary 3 finishes the proof of (b).
(c) Now we suppose that γ R . With little effort, Corollary 3 concludes the proof of (c). □
Corollary 5.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω and { α , δ , ϵ } F G e r , λ Γ satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ min O ϵ 1 + O ϵ , A δ 1 + O ϵ ,
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) for all k N , ⊑ is ( f , g ) -closed and locally ( f , g ) -transitive and u , v X ω are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ω ) g ( X ω ) ; f is ( g , ) -nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω which is -comparable to u and v, so that f and g have a unique common fixed point in X ω .
Proof. 
It follows from proof of part (a) of Corollary 2. □
Corollary 6.
Let ( X ω , ) be a binary relation on (pseudo)modular set X ω and suppose that there exists a metric modular d ω in X ω such that ( X ω , d ω ) is a -complete metric (pseudo)modular space. Let f , g be nondecreasing self mappings on X ω for all λ Γ and { α , δ , ϵ } F G e r satisfying:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ max O ϵ 1 + O ϵ , A δ 1 + O ϵ ;
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for all distinct close u , v X ω and ln k ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) , ω λ k ( g u , g v ) ω λ ( g u , g v ) for all k N , ⊑ is ( f , g ) -closed and locally ( f , g ) -transitive and u , v X ω are -comparable. Assuming that there exists x 0 X ω such that g x 0 f x 0 ; f ( X ω ) g ( X ω ) ; f is ( g , ) -nondecreasing; g is -continuous and commutes with f and { g u k } k N -converges to u * , so that g u k g u * for each k 1 and f is a -continuous mapping. Then, f and g have, at least, a coincidence point, that is, there exists z X ω such that f z = g z . Furthermore, for any u , v X ω , there exists w X ω , which is -comparable to u and v, so that f and g have a unique common fixed point in X ω .
Question: Is it possible to have a common unique fixed point in Theorem 4 if we replace inequality (9) with an infinite type of the form? That is:
ω λ ( f u , f v ) α ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) A δ O ϵ A δ O ϵ · · · · ,
where A δ : = δ ( ω λ ( g u , g v ) ) ω λ ( g u , g v ) ; O ϵ : = ϵ ( ω λ ( g u , g v ) ) ω λ ( g v , f u ) , for u , v X ω .

4. Conclusions

The results established in this paper are new, novel, and interesting. Our findings here further characterize and include in their full strength some results in the literature on the playground of binary relational metric pseudo(modular) spaces. Particularly, results such as Banach contraction mapping and Geraghty contraction, i.e., Amini-Harand and Emami [14], Geraghty [5], Banach [2], Alam et al. [20], Alam and Imdad [22,23], Chisyakov [29], etc. become special cases.

Author Contributions

All authors contributed equally to the writing of this paper. All authors have read and agreed to the published version of the manuscript.

Funding

The corresponding author, Safeer Hussain Khan, acknowledges the start-up award funding from North Carolina A&T State University, Greensboro, USA.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors wish to thank the editor and the reviewers for their useful comments and suggestions. The corresponding author, Safeer Hussain Khan, acknowledges the start-up award funding from North Carolina A&T State University, Greensboro, USA.

Conflicts of Interest

The authors declare no conflicts of interests.

References

  1. Okeke, G.A.; Francis, D. Fixed point theorems of metric tower in a complete metric spaces. J. Anal. 2024, 32, 949–991. [Google Scholar] [CrossRef]
  2. Banach, S. Sur les opérationes dans les ensembles abstraits et leur application aux équation intégrales. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  3. Chu, S.C.; Diaz, J.B. Remarks on a generalization of Banach’s mappings. J. Math. Anal. Appl. 1965, 11, 440–446. [Google Scholar] [CrossRef]
  4. Dass, B.K.; Gupta, S. An extension of Banach contraction mapping principle through rational expressions. Indian J. Pure Appl. Math. 1975, 6, 1455–1458. [Google Scholar]
  5. Geraghty, M.A. On contractive mapping. Proc. Ann. Math. Soc. 1973, 40, 604–608. [Google Scholar] [CrossRef]
  6. Hardy, G.; Rogers, T. A generalization of a fixed point theorem of Reich. Can. Math. Bull. 1973, 2, 201–206. [Google Scholar] [CrossRef]
  7. Jaggi, D.S. Some unique fixed point theorems. Indian J. Pure Appl. Math. 1977, 8, 223–230. [Google Scholar]
  8. Kannan, R. Some results on fixed points. Bull. Calcutta Math. Soc. 1968, 10, 71–76. [Google Scholar]
  9. Meir, A.; Keeler, E. A theorem on contraction mapping. J. Math. Anal. Appl. 1969, 28, 326–329. [Google Scholar] [CrossRef]
  10. Sehgal, V.M. A fixed point theorem for mappings with a contractive iterate. Proc. Am. Math. Soc. 1969, 23, 631–634. [Google Scholar] [CrossRef]
  11. Reich, S. Some remarks concerning contraction mappings. Can. Math. Bull. 1971, 14, 121–124. [Google Scholar] [CrossRef]
  12. Reich, S. Fixed points of contractive functions. Bollettino della Unione Matematica Italiana 1972, 5, 26–42. [Google Scholar]
  13. Wong, C.S. Common fixed points of two mappings. Pac. J. Math. 1973, 48, 299–312. [Google Scholar] [CrossRef]
  14. Amini-Harandi, A.; Emami, H. A fixed point theorem for contraction type maps in partially ordered metric spaces and application to ordinary differential equations. Nonlinear Anal. 2010, 72, 2238–2242. [Google Scholar] [CrossRef]
  15. Gordji, M.E.; Cho, Y.J.; Pirbavafa, S. A generalization of Geraghty’s theorem in partial ordered metric spaces and application to ordinary differential equations. Fixed Point Theory Appl. 2012, 74, 1687–1812. [Google Scholar]
  16. Cho, S.H.; Bae, J.S.; Karapinar, E. Fixed point theorems for α-Geraghty contraction type maps in metric spaces. Fixed Point Theory Appl. 2013, 2013, 329. [Google Scholar] [CrossRef]
  17. Popescu, O. Some new fixed point theorems for α-Geraghty contraction type maps in metric spaces. Fixed Point Theory Appl. 2014, 2014, 190. [Google Scholar] [CrossRef]
  18. Ciric, L.B. On contraction type mappings. Math. Balk. 1971, 1, 52–57. [Google Scholar]
  19. Ciric, L.B.; Cakic, N.; Rajovic, M.; Ume, J.S. Monotone generalized nonlinear contractions in partially ordered metric spaces. Fixed Point Theory Appl. 2008, 11, 131294. [Google Scholar]
  20. Alam, A.; George, R.; Imdad, M. Refinements to relation-theoretic contraction principle. Axioms 2022, 11, 316. [Google Scholar] [CrossRef]
  21. Alam, A.; Imdad, M. Nonlinear contractions in metric spaces under locally T-transitive binary relations. Fixed Point Theory 2018, 19, 13–24. [Google Scholar] [CrossRef]
  22. Alam, A.; Imdad, M. Relation-theoretic metrical coincidence theorems. Filomat 2017, 31, 4421–4439. [Google Scholar] [CrossRef]
  23. Alam, A.; Imdad, M. Relation-theoretic contraction principle. J. Fixed Point Theory Appl. 2015, 17, 693–702. [Google Scholar] [CrossRef]
  24. Altaweel, N.H.; Khan, F.A. Relation theoretic fixed point theorems involving certain auxiliary functions with applications. Symmetry 2022, 14, 2614. [Google Scholar] [CrossRef]
  25. Francis, D.; Okeke, G.A. Fixed point theorems satisfying rational tower-type mapping in a complete metric spaces. Int. J. Nonlinear Anal. Appl. 2024, 1–31. [Google Scholar] [CrossRef]
  26. Chistyakov, V.V. Metric Modular spaces, I: Basic concepts. Nonlinear Anal. Theory Methods Appl. 2010, 72, 1–14. [Google Scholar] [CrossRef]
  27. Nakano, H. Modulared semi-ordered linear spaces. Maruzen Tokyo 1950, 1. [Google Scholar]
  28. Fre’chet, M. Ur quelques points du calcul functionnel. Rend. Circ. Mat. Palermo 1906, 1–72. [Google Scholar] [CrossRef]
  29. Chistyakov, V.V. Fixed point theorem for contractions in metric modular spaces. arXiv 2011, arXiv:1112.55612011, 65–92. [Google Scholar]
  30. Mongkolkeha, C.; Sintunavarat, W.; Kumam, P. Fixed point theorem for contraction mappings in modular spaces. Fixed Point Theory. Appl. 2011, 2011, 93. [Google Scholar] [CrossRef]
  31. Chaipunya, P.; Cho, Y.J.; Kumam, P. Geraghty-type theorems in modular metric spaces with application to partial differential equation. Adv. Differ. Equ. 2012, 83, 1687–1847. [Google Scholar] [CrossRef]
  32. Okeke, G.A.; Francis, D.; de la Sen, M. Some fixed point theorems for mappings satisfying rational inequality in modular metric spaces with applications. Heliyon 2020, 6, e04785. [Google Scholar] [CrossRef] [PubMed]
  33. Lipschutz, S. Schaum’s Outlines of Theory and Problems of Set Theory and Related Topics; McGraw-Hill: New York, NY, USA, 1964. [Google Scholar]
  34. Schechter, E. Handbook of Analysis and Its Foundations; Academic Press: Cambridge, MA, USA, 1997. [Google Scholar]
  35. Chistyakov, V.V. Metric Modular Spaces. Theory and Applications; Springer Briefs in Mathematics; Springer International Publishing: Cham, Switzerland, 2015. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Francis, D.; Okeke, G.A.; Khan, S.H. Some Common Fixed Point Results of Tower Mappings in (Pseudo)modular Metric Spaces. Symmetry 2024, 16, 896. https://doi.org/10.3390/sym16070896

AMA Style

Francis D, Okeke GA, Khan SH. Some Common Fixed Point Results of Tower Mappings in (Pseudo)modular Metric Spaces. Symmetry. 2024; 16(7):896. https://doi.org/10.3390/sym16070896

Chicago/Turabian Style

Francis, Daniel, Godwin Amechi Okeke, and Safeer Hussain Khan. 2024. "Some Common Fixed Point Results of Tower Mappings in (Pseudo)modular Metric Spaces" Symmetry 16, no. 7: 896. https://doi.org/10.3390/sym16070896

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