Next Article in Journal
Stabilization and Synchronization of a New 3D Complex Chaotic System via Adaptive and Active Control Methods
Previous Article in Journal
Decision-Making with Fermatean Neutrosophic Vague Soft Sets Using a Technique for Order of Preference by Similarity to Ideal Solution
Previous Article in Special Issue
Flexible and Efficient Iterative Solutions for General Variational Inequalities in Real Hilbert Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Approach to Some Proximal Contractions with Examples of Its Application

1
Abdus Salam School of Mathematical Sciences, Government College University, Lahore 54600, Pakistan
2
Department of Mathematics, Technical University of Cluj-Napoca, 400114 Cluj-Napoca, Romania
3
Department of Mathematics, 1 Decembrie 1918 University of Alba Iulia, 510009 Alba Iulia, Romania
*
Authors to whom correspondence should be addressed.
Axioms 2025, 14(5), 382; https://doi.org/10.3390/axioms14050382
Submission received: 26 February 2025 / Revised: 9 April 2025 / Accepted: 13 May 2025 / Published: 19 May 2025
(This article belongs to the Special Issue Numerical Methods and Approximation Theory)

Abstract

:
In this article, we will introduce a new generalized proximal θ -contraction for multivalued and single-valued mappings named ( f θ κ ) C P -proximal contraction and ( f θ κ ) B P -proximal contraction. Using these newly constructed proximal contractions, we will establish new results for the coincidence best proximity point, best proximity point, and fixed point for multivalued mappings in the context of rectangular metric space. Also, we will reduce these contractions for single-valued mappings, named ( θ κ ) C P -proximal contraction and ( θ κ ) B P -proximal contraction, to establish results for the coincidence proximity point, best proximity point, and fixed point results. We will give some illustrated examples for our newly generated results with graphical representations. In the last section, we will also find the solution to the equation of motion by using our defined results.

1. Introduction

The term T ( x ) = x denotes a fixed point for a self-mapping T on a metric space. However, it is evident that not every mapping exhibits such a property. We present some examples of such mappings specified on other sets; we call them non-self-mappings and translation mappings. When this happens, our objective shifts towards identifying those elements that are very close to their images, and we call them best approximations; in fact, these approximations are actually fixed points. Some new developments in fixed point theory are discussed in [1,2].
Let T : Q , a non-self-mapping, having no fixed point. However, when we approach the image of a point under this mapping, we continuously observe progress. This highlights an important idea called best proximity. Obtaining an optimal global solution, denoted as x đ ( x , T x ) , is the key to the best proximity theorem. When we have the mapping T : Q , for all x , the distance đ ( T x , x ) is at a minimum of đ ( , Q ) . Constructing a close approximation x for the relation T x = x ensures that đ ( x , T x ) = đ ( , Q ) is satisfied.
The main concept of best proximity point was first introduced in 1997 by Sadiq Basha et al. [3,4]. The method to obtain the best proximity point was given by Eldred [5]. Umer I. et al. [6] presented fuzzy adaptations of several well-known iterative mappings. Additionally, they established various concrete conditions on real-valued functions J , S : ( 0 , 1 ] R to ensure the existence of best proximity points for generalized fuzzy ( J , S ) -iterative mappings in the framework of fuzzy metric spaces.
Youns et al. [7] established coincidence point, best proximity point, and fixed point results for multivalued proximal contractions within the framework of b-metric spaces, utilizing an alternating distance function. Komal et al. [8] obtained theorems for the best coincidence proximity points via Geraghty-type proximal cyclic contraction in metric space. Moreover, Jleli et al.’s paper [9] proposed the idea of θ -contraction. The proximity theorem has undergone various modifications and adaptations, as evidenced by works such as [10]. Sametric et al. [11] introduce a new concept of α ψ -contractive type mappings and establish fixed point theorems for such mappings in complete metric spaces, and gave applications to ordinary differential equations.
Here, we explore applications of fixed point theory in nonlinear systems. It is used to analyze the light-clock model [12], which describes mass as an emergent property of entangled photons, and to study battery capacity gaps and multipartite entanglement [13] under LOCC transformations. Fixed point theory also aids in the identification of nonlinear state-space models (NSSM) [14] and ensures the stability of solutions in the expectation maximization (EM) algorithm. Additionally, it was applied to analyze nonlinear mappings in a bionic bimanual robot teleoperation system [15] and to study the stability and convergence of hand detection and pose estimation algorithms, ensuring accurate motion transfer between human and robot.
The nonlinear nature of the diffusive wave model (DWM) [16] aligns with fixed point theory, enabling the exploration of forward and inverse problems regarding solution existence and stability. Fixed point theory is also applied to study the complex dynamics of Sun-perturbed Earth–Moon triangular libration points [17] and to analyze the Sobolev norm growth in the Hartree equation [18]. Furthermore, in the design and control of bioinspired soft robotic hands [19], fixed point theory helps analyze complex nonlinear dynamics and ensures stability and convergence, particularly in material compliance, actuator dynamics, and controller performance in uncertain environments.
After conducting a thorough analysis of the literature, we have discovered important information that has led to remarkable findings about the best coincidence proximity points in the rectangular metric space. We will introduce new θ -type proximal contractions for multivalued mappings with an alternating distance function f . We reduce our findings to the result of fixed points that are mentioned as corollaries of the notion of best proximity points. Significantly, we give descriptive examples to demonstrate the best coincidence points to fixed points with graphical representations. These examples support the validity and importance of the conclusions reported in this manuscript in addition to clarifying our findings. In the last section, we offer a concise approach to solving the equation of motion using our findings. This application not only validates our theoretical results, but also demonstrates their strength in practical, real-world scenarios.

2. Preliminaries

To set the stage for our investigation, we first gather some foundational definitions, key concepts, and well-established results. These serve as the building blocks that guide us toward formulating and achieving our new findings.
Definition 1
([20]). If the following given conditions are satisfied by the function đ : ʘ × ʘ R , where ʘ is a non-empty set, then đ is considered as a metric, such that
1.
đ ( x , y ) 0 ,
2.
đ ( x , y ) = 0 iff x = y ,
3.
đ ( x , y ) = đ ( y , x ) ,
4.
đ ( x , ζ ) + đ ( ζ , y ) đ ( x , y ) , for each x , y , ζ ʘ .
Then, we call ( ʘ , đ ) a metric space.
From [20], here, we have few examples of the distance.
Example 1.
The functions đ 1 , đ 2 , đ 3 : R × R R are given as
đ 1 ( x , y ) = x y , đ 2 ( x , y ) = 1 x 1 y , đ 3 ( x , y ) = x y ,
Then, đ 1 and đ 3 are metrics defined on R . Furthermore, đ 2 defines a metric on non-zero real numbers R { 0 } .
Example 2.
For the real numbers x 1 , y 1 , x 2 , y 2 , suppose ( x 1 , y 1 ) = ʐ 1 and ( x 2 , y 2 ) = ʐ 2 ; then, đ ( ʐ 1 , ʐ 2 ) is given as
đ ( ʐ 1 , ʐ 2 ) = x 1 x 2 , + y 1 y 2 ,
where đ is a metric defined on R 2 = ʘ .
Example 3.
Let ʘ ϕ , with the metric đ 0 and the metric space denoted as ( ʘ , đ 0 ) . The function đ 0 : ʘ × ʘ R is defined as follows:
đ 0 ( x , y ) = 0 , if x = y , 1 , if x y .
The metric đ 0 is termed a discrete metric, and ( ʘ , đ 0 ) is termed a discrete metric space.
In 2000, Branciari generalized the metric spaces concept in [21] as follows:
Definition 2.
If the conditions given below are fulfilled by the function đ : ʘ × ʘ R + , where ʘ is a non-empty set, then đ is considered to be a rectangular metric, such that
1.
đ ( x , y ) 0 ,
2.
đ ( x , y ) = 0 , x = y ,
3.
đ ( x , y ) = đ ( y , x ) ,
4.
đ ( x , ζ ) + đ ( ζ , u ) + đ ( u , y ) đ ( x , y ) for all x , y ʘ { ζ , u } .
Then, ( ʘ , đ ) is termed a rectangular metric space.
Definition 3
([21]). If a sequence { ʐ n } ( ʘ , đ ) (a rectangular metric space), then the following holds:
(i)
We can write lim n ʐ n = ʐ if and only if the sequence { ʐ n } converges to a point ʐ ʘ .
(ii)
If the sequence { ʐ n } satisfies the condition lim n , m đ ( ʐ n , ʐ m ) = 0 , then it is known to be Cauchy.
(iii)
If, in the rectangular metric space ʘ, every Cauchy sequence is convergent, then we call it a complete metric space, and vice versa.
(iv)
The uniqueness of limits is ensured for every convergent sequence in the rectangular metric space ʘ.
Definition 4.
Let ( ʘ , đ ) be a rectangular metric space with subsets ϕ and Q ϕ . Then, the following is how we define 0 and Q 0 :
0 = { x : đ ( , Q ) = đ ( x , y ) for some y Q } , Q 0 = { y Q : đ ( , Q ) = đ ( x , y ) for some x } ,
where
inf { đ ( x , y ) : x , y Q } = đ ( , Q ) ,
which is the distance between sets and Q .
Definition 5
([22]). Let ( ʘ , đ ) , a rectangular metric space, with subsets ϕ Q ; then, ( , Q ) , known to satisfy the P -property if
đ ( ʐ 1 , x 1 ) = đ ( ʐ 2 , x 2 ) = đ ( , Q ) ,
implies that
đ ( ʐ 1 , ʐ 2 ) = đ ( x 1 , x 2 )
where x 1 , x 2 Q and ʐ 1 , ʐ 2 .
Definition 6
([23]). Let f : R + R + . Upon meeting the axioms given below, it is termed an alternating distance function:
(i)
f is continuous.
(ii)
If x y , then f ( x ) f ( y ) .
(iii)
For all x > 0 , f ( x ) > 0 .
Definition 7
([9]). Let the function θ : ( 0 , ) ( 1 , ) . Upon meeting the axioms given below, the
function is termed a θ contraction, and collectively, the family of these functions is known as Θ . :
( θ 1 )
θ is non-decreasing.
( θ 2 )
For every { ʐ n } R , lim n ʐ n = 0 , if and only if lim n θ ( ʐ n ) = 1 .
( θ 3 )
For lim ʐ 0 + θ ( ʐ ) 1 ʐ k = l , k ( 0 , 1 ) and l ( 0 , ] .
A self-map T : ʘ ʘ defined on ( ʘ , đ ) , a rectangular metric space, is identified as a θ -contraction, where θ is from the family Θ , and κ ( 0 , 1 ) serves as a constant.
đ ( T ( x ) , T ( y ) ) 0 , θ ( đ ( T ( x ) , T ( y ) ) ) θ ( đ ( x , y ) ) κ
where x , y are elements of ʘ .
Example 4.
Define some functions as follows: for all t > 0 ,
1.
θ 1 ( x ) = e x ;
2.
θ 2 ( x ) = e x e x ;
3.
θ 3 ( x ) = e x ;
4.
θ 4 ( x ) = cosh ( x ) ;
5.
θ 5 ( x ) = 1 + ln ( 1 + x ) ;
6.
θ 6 ( x ) = e x e x .
Then, θ 1 , θ 2 , θ 3 , θ 4 , θ 5 , θ 6 Θ .
Definition 8
([24]). Let CB ( ʘ ) be the family of all closed, bounded subsets of ʘ. The symbol H denotes the Hausdorff distance associated with metric đ, given by
H ( , Q ) = max sup ζ D ( ζ , Q ) , sup y Q D ( y , ) ,
for Q , CB ( ʘ ) , with
D ( ζ , Q ) = inf { đ ( ζ , y ) : y Q } .
Here, we introduce a new notion as follows:
D * ( ζ , y ) = D ( ζ , y ) đ ( , Q ) ,
for ζ and y Q .
Throughout this study, we consider the rectangular metric function đ to be a continuously defined mapping.

3. Multivalued Mapping Results

Herein, we explore theorems concerning multivalued coincidence points, fixed points, and best proximity points within (ʘ, đ), a complete rectangular metric space.
Definition 9.
In ( ʘ , đ ) , a rectangular metric space, let ϕ Q be two closed subsets of ʘ. Consider two mappings ( g , T ) : mapping T : CB ( Q ) and the self-mapping g : . These mappings satisfy
D ( g ʐ , T ʐ ) = đ ( , Q ) ,
Then, the point ʐ is termed a best coincidence proximity point of the couple ( g , T ) .
Remark 1.
The best coincidence point theorems provide a unified framework encompassing both best proximity and fixed points. In particular, when I = g , each coincidental best proximity point inherently serves as the best proximity point of T . Furthermore, if T simplifies to a self-map, the concept of the best proximity point seamlessly transforms into the fixed point.
Definition 10.
Consider a multivalued map T : CB ( Q ) and a self-map g : . The couple ( g , T ) is known to satisfy the ( f θ κ ) C P -proximal contraction condition if for 0 < κ < 1 and u , x , v , ʐ , the following is satisfied:
đ ( , Q ) = D g u , T ʐ đ ( , Q ) = D g v , T x
This implies that
θ ( f ( H ( T ʐ , T x ) ) ) θ ( f ( S ( u , v , ʐ , x ) ) ) κ ,
where
S ( u , v , ʐ , x ) = max D ( g u , T u ) đ ( g u , g v ) D ( g x , T u ) , đ ( g u , g v ) , đ ( g ʐ , g x ) , D * ( g v , T u ) .
Definition 11.
Consider T : CB ( Q ) , a multivalued mapping, that is termed a ( f θ κ ) B P -proximal contraction if for κ ( 0 , 1 ) and u , x , v , ʐ , the following holds:
D ( u , T ʐ ) = đ ( , Q ) D ( v , T x ) = đ ( , Q )
This implies that
θ ( f ( H ( T ʐ , T x ) ) ) θ ( f ( S ( u , v , ʐ , x ) ) ) κ ,
with
S ( u , v , ʐ , x ) = max D ( u , T u ) đ ( u , v ) D ( x , T u ) , đ ( ʐ , x ) , đ ( u , v ) , D * ( v , T u ) .
When the mapping g = I is considered, every ( f θ κ ) C P -proximal contraction naturally transitions into a ( f θ κ ) B P -proximal contraction. Here, I represents the identity mapping.
Theorem 1.
Let ( ʘ , đ ) be a complete rectangular metric space with closed subsets ϕ Q , fulfilling the P -property. Assume continuous mappings T : CB ( Q ) and g : , such that 0 ϕ , 0 g ( 0 ) , and T ( 0 ) Q 0 . Assume further that g is a continuous and injective mapping, and that the couple ( g , T ) satisfies ( f θ κ ) C P -proximal contraction, along with an alternating distance function f . Based on such premises, there is a point termed the coincidence best proximity point for the couple ( g , T ) in .
Proof. 
Let us take ʐ 0 0 , an arbitrary element. Since T ( 0 ) is a subset of Q 0 , and 0 is contained in g ( 0 ) , there is a point ʐ 1 0 such that
D ( g ʐ 1 , T ʐ 0 ) = đ ( , Q ) .
Furthermore, given that T ʐ 1 T ( 0 ) , which is a subset of Q 0 , and that 0 is within g ( 0 ) , this suggests that there is a point ʐ 2 0 such that
D ( g ʐ 2 , T ʐ 1 ) = đ ( , Q ) .
Utilizing the P -property, we have
đ ( g ʐ 1 , g ʐ 2 ) = H ( T ʐ 0 , T ʐ 1 ) .
Moreover, since the couple ( g , T ) meets the condition of ( f θ κ ) C p -proximal contraction, it follows that
θ ( f ( đ ( g ʐ 1 , g ʐ 2 ) ) ) θ ( f ( S ( ʐ 1 , ʐ 2 , ʐ 0 , ʐ 1 ) ) ) κ ,
where
S ( ʐ 1 , ʐ 2 , ʐ 0 , ʐ 1 ) = max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) , D * ( g ʐ 1 , T ʐ 0 ) , D ( g ʐ 0 , T ʐ 0 ) đ ( g ʐ 0 , g ʐ 1 ) D ( g ʐ 2 , T ʐ 0 ) , , max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) , D ( g ʐ 1 , T ʐ 0 ) D ( , Q ) , đ ( g ʐ 0 , g ʐ 1 ) + đ ( g ʐ 1 , g ʐ 2 ) + D ( g ʐ 1 , T ʐ 0 ) đ ( g ʐ 0 , g ʐ 1 ) D ( g ʐ 2 , T ʐ 0 ) , max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) , 0 , đ ( g ʐ 1 , g ʐ 2 ) max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) ,
so we can say that
S ( ʐ 1 , ʐ 2 , ʐ 0 , ʐ 1 ) max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) .
If we choose max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) = đ ( g ʐ 1 , g ʐ 2 ) , then inequality (1) becomes
θ ( f ( đ ( g ʐ 1 , g ʐ 2 ) ) ) θ ( f ( đ ( g ʐ 1 , g ʐ 2 ) ) ) κ
which is impossible.
If max đ ( g ʐ 0 , g ʐ 1 ) , đ ( g ʐ 1 , g ʐ 2 ) = đ ( g ʐ 0 , g ʐ 1 ) , then inequality (1) will be
θ ( f ( đ ( g ʐ 1 , g ʐ 2 ) ) ) θ ( f ( đ ( g ʐ 0 , g ʐ 1 ) ) ) κ ,
since we obtain
đ ( g ʐ 1 , g ʐ 2 ) đ ( g ʐ 0 , g ʐ 1 ) .
Now, let ʐ 1 be an arbitrary element in 0 . Since T ( 0 ) Q 0 and 0 is contained within g ( 0 ) , there exists an element ʐ 2 0 such that
D ( g ʐ 2 , T ʐ 1 ) = đ ( , Q ) .
Furthermore, given that T ʐ 2 T ( 0 ) , which is a subset of Q 0 , and that 0 is contained within g ( 0 ) , there is an element ʐ 3 in 0 such that
D ( g ʐ 3 , T ʐ 2 ) = đ ( , Q ) .
Utilizing the P -property, we have
đ ( g ʐ 2 , g ʐ 3 ) = H ( T ʐ 1 , T ʐ 2 ) .
Furthermore, since the couple ( g , T ) meets the condition of ( f θ κ ) C p -proximal contraction, it follows that
θ ( f ( đ ( g ʐ 2 , g ʐ 3 ) ) ) θ ( f ( S ( ʐ 2 , ʐ 3 , ʐ 1 , ʐ 2 ) ) ) κ ,
where
S ( ʐ 2 , ʐ 3 , ʐ 1 , ʐ 2 ) = max đ ( g ʐ 1 , g ʐ 1 ) , đ ( g ʐ 2 , g ʐ 3 ) , D * ( g ʐ 2 , T ʐ 1 ) , D ( g ʐ 1 , T ʐ 1 ) đ ( g ʐ 1 , g ʐ 2 ) D ( g ʐ 3 , T ʐ 1 ) , , max đ ( g ʐ 1 , g ʐ 2 ) , đ ( g ʐ 2 , g ʐ 3 ) , D ( g ʐ 2 , T ʐ 1 ) D ( , Q ) , đ ( g ʐ 1 , g ʐ 2 ) + đ ( g ʐ 2 , g ʐ 3 ) + D ( g ʐ 2 , T ʐ 1 ) đ ( g ʐ 1 , g ʐ 2 ) D ( g ʐ 3 , T ʐ 1 ) , max đ ( g ʐ 1 , g ʐ 2 ) , đ ( g ʐ 2 , g ʐ 3 ) , 0 , đ ( g ʐ 2 , g ʐ 3 ) max đ ( g ʐ 1 , g ʐ 2 ) , đ ( g ʐ 2 , g ʐ 3 ) ,
so we can say that
S ( ʐ 2 , ʐ 3 , ʐ 1 , ʐ 2 ) max đ ( g ʐ 1 , g ʐ 2 ) , đ ( g ʐ 2 , g ʐ 3 ) .
If we choose max đ ( g ʐ 1 , g x 2 ) , đ ( g ʐ 2 , g ʐ 3 ) = đ ( g ʐ 2 , g ʐ 3 ) , then inequality (2) becomes
θ ( f ( đ ( g ʐ 2 , g ʐ 3 ) ) ) θ ( f ( đ ( g ʐ 2 , g ʐ 3 ) ) ) κ
which is impossible. If max đ ( g ʐ 1 , g ʐ 2 ) , đ ( g ʐ 2 , g ʐ 3 ) = đ ( g ʐ 1 , g ʐ 2 ) , then inequality (2) will be
θ ( f ( đ ( g ʐ 2 , g ʐ 3 ) ) ) θ ( f ( đ ( g ʐ 1 , g ʐ 2 ) ) ) κ ,
since we obtain
đ ( g ʐ 2 , g ʐ 3 ) đ ( g ʐ 1 , g ʐ 2 ) .
Similarly, since ʐ n 0 and T ( 0 ) Q 0 , there is ʐ n + 1 0 , which gives
D ( g ʐ n + 1 , T ʐ n ) = đ ( , Q ) .
After selecting ʐ n + 1 , which satisfies the given condition, there exists an element ʐ n + 2 0 that meets the condition
đ ( , Q ) = D ( g ( ʐ n + 2 ) , T ( ʐ n + 1 ) )
for all positive integers n, and utilizing the P -property, we obtain
đ ( g ʐ n + 1 , g ʐ n + 2 ) = H ( T ʐ n , T ʐ n + 1 ) .
Moreover, since the couple ( g , T ) meets the condition of ( f θ κ ) C p -proximal contraction, and by applying Equations (3) and (4), we obtain
θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) θ ( f ( S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) ) ) κ ,
where
S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) = max đ ( g ʐ n , g ʐ n + 1 ) , đ ( g ʐ n + 1 , g ʐ n + 2 ) , D * ( g ʐ n + 1 , T ʐ n ) , D ( g ʐ n , T ʐ n ) đ ( g ʐ n , g ʐ n + 1 ) D ( g ʐ n + 2 , T ʐ n )
max D ( g ʐ n + 1 , T ʐ n ) D ( , Q ) , đ ( g ʐ n , g ʐ n + 1 ) , đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) + đ ( g ʐ n + 1 , g ʐ n + 2 ) + D ( g ʐ n + 2 , T ʐ n ) đ ( g ʐ n , g ʐ n + 1 ) D ( g ʐ n + 2 , T ʐ n ) max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) , đ ( g ʐ n + 1 , g ʐ n + 2 ) , 0 max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) .
So, we can say that
S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) .
If we choose max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g x n + 1 ) = đ ( g ʐ n + 1 , g ʐ n + 2 ) , then inequality (5) transforms into
θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) κ ,
which is not impossible. If max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) = đ ( g ʐ n , g ʐ n + 1 ) , then Equation (5) becomes
θ ( f ( đ ( g ʐ n , g ʐ n + 1 ) ) ) κ θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) ,
since we obtain
đ ( g ʐ n , g ʐ n + 1 ) đ ( g ʐ n + 1 , g ʐ n + 2 ) .
Therefore, the sequence { ( g ʐ n + 1 , g ʐ n + 2 ) } is monotonically nonincreasing and bounded from below. As a result, there exists λ 0 such that
0 λ = lim n đ ( g ʐ n + 1 , g ʐ n + 2 ) .
Assuming that lim n đ ( g x n + 1 , g ʐ n + 2 ) = λ > 0 , with Equations (6) and (7), we have:
θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) θ ( f ( đ ( g ʐ n 1 , g ʐ n ) ) ) κ 2 .
Proceeding with the process, we arrive at
θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) θ ( f ( đ ( g ʐ 0 , g ʐ 1 ) ) ) κ n .
As a consequence of the prior equation, we obtain
lim n θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) = 1 .
Using equation ( θ 2 ) of Definition 7 gives
lim n f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) = 0 .
Again, using equation ( θ 3 ) of Definition 7, there is a ъ ( 0 , 1 ) , such that
lim đ ( g ʐ n + 1 , g ʐ n + 2 0 ) θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1 f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ъ = l lim n θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1 f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ъ = l
So, we can write it for l < and C = l 2 as follows:
θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1 f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ъ C , n n 0
Hence, we obtain
C θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1 f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ъ l C , n n 0 , n n 0
From this, we have
l C θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1 f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ъ , n n 0
Since C = l 2 , we have
C θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1 f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ъ , n n 0
From these, we obtain
f đ ( g ʐ n + 1 , g ʐ n + 2 ) ъ 1 C θ f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) 1
By using (8), we obtain
f đ ( g ʐ n + 1 , g ʐ n + 2 ) ъ 1 C θ f ( đ ( g ʐ 0 , g ʐ 1 ) ) κ n 1
Now, by taking the limit as n , we obtain
lim n f đ ( g ʐ n + 1 , g ʐ n + 2 ) ъ = 0
Assume that y n = f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ; from this, the above inequality is given as
lim n ( y n ) ъ = 0 .
From Equation (11), it is evident that there exists an integer n 1 N such that, for any given ε > 0 ,
( y n ) ъ 0 < ε , for all n n 1 ( y n ) ъ < ε ( y n ) < ε .
Next, we aim to demonstrate that the sequence { g ʐ n } is Cauchy within the rectangular metric space ( ʘ , đ ) , which is complete too. Therefore, n , m N , we have
f ( đ ( g ʐ m , g ʐ n ) ) f ( đ ( g ʐ m , g ʐ n + 2 ) ) + y n + 1 + y n f ( đ ( g ʐ m , g ʐ n + 4 ) ) + y n + 3 + y n + 2 + y n + 1 + y n y m 1 + y m 2 + + y n + 1 + y n < ε .
Thus, for all positive integers n n 1 , p N , the above inequality will be as follows:
lim m , n f ( đ ( g ʐ m , g ʐ n ) ) < ε .
Thus, the Cauchy sequence { g ʐ n } converges within the space ( ʘ , đ ) . Suppose it converges to ʐ * in 0 , where is a closed set. This implies that the sequence { ʐ n } 0 satisfies ʐ n ʐ * . Given that ( g , T ) are continuous mappings, we conclude that
D ( g ʐ * , T ʐ * ) = đ ( , Q ) .
Thus, ʐ * is a coincidence proximity point for the couple ( g , T ) . □
Example 5.
Take a set ʘ = { 20 , 21 , 22 , 23 , 24 , 25 } with the metric đ : ʘ × ʘ [ 0 , ) defined as
đ 20 21 22 23 24 25 20 0 3 4 2 6 7 21 3 0 5 8 2 6 22 4 5 0 7 8 2 23 2 8 7 0 3 4 24 6 2 8 3 0 5 25 7 6 2 4 5 0
We see that ( ʘ , đ ) becomes a complete rectangular metric space. Given that = { 20 , 21 , 22 } and Q = { 23 , 24 , 25 } are nonempty closed subsets of ( ʘ , đ ) , meeting the P -property condition, here, 0 = , Q 0 = Q . Also, we obtain đ ( , Q ) = 2 . The map T : CB ( Q ) , defined as
T ʐ = 24 , when ʐ { 20 , 21 } { 23 , 25 } , when ʐ { 22 } ,
and g : , given as
g ʐ = 20 , when ʐ = 22 21 , when ʐ = 21 22 , when ʐ = 20 .
We see T ( 0 ) , a subset of Q 0 , and g ( 0 ) a subset of 0 . Then, ( g , T ) meets the condition of ( f θ κ ) C p -proximal contraction,
θ ( f ( H ( T ʐ , T x ) ) ) θ ( f ( S ( u , v , ʐ , x ) ) ) κ ,
for all v , x , u , ʐ . Therefore,
đ ( , Q ) = D ( g 21 , T 20 ) , đ ( , Q ) = D ( g 20 , T 22 ) ,
with x = 22 , u = 21 , ʐ = 20 , and v = 20 . After few simple steps, we obtain
H ( T 20 , T 22 ) = H ( 24 , { 23 , 25 } ) = 3 ,
and
S ( 21 , 20 , 20 , 22 ) = max đ ( g 20 , g 22 ) , đ ( g 22 , g 20 ) , D * ( g 21 , T 20 ) , D ( g 20 , T 20 ) đ ( g 20 , g 22 ) D ( g 20 , T 20 ) = max đ ( 22 , 20 ) , đ ( 20 , 22 ) , D ( 21 , 24 ) đ ( , Q ) , D ( 22 , 24 ) đ ( 22 , 20 ) D ( 22 , 24 ) = max 4 , 20 , 4 , 4 = 4 .
Take function θ as
θ ( y ) = e y .
For f = 2 T , we obtain f ( H ( T ʐ , T x ) ) = 6 , f ( S ( u , v , ʐ , x ) ) = 8 ; then, the inequality (12) will be
θ ( 6 ) θ ( 8 ) κ .
for all κ > 0.75 . As a result, all of the Theorem 1’s circumstances are met; here, point 21 is the coincidence proximity point for the couple ( g , T ) .
Corollary 1.
Let ( ʘ , đ ) (a complete rectangular metric space) with closed subsets ϕ Q meet the P -property and ϕ 0 . Let a continuous map T : CB ( Q ) with T ( 0 ) Q 0 . It follows that if T accomplishes the ( f θ κ ) B P -proximal contraction condition, then it admits a best proximity point.
Proof. 
Under the assumption that I = g , where I denotes the identity map, the remainder of the proof unfolds in accordance with Theorem 1. □
Observe that in Theorem 1, by setting = ʘ = Q , we derive the corresponding results presented below.
Corollary 2.
Assume that T : ʘ CB ( ʘ ) is a multivalued mapping on a complete rectangular metric space, and that T meets the condition of ( θ κ ) B p -proximal contraction with the function f . Under the mentioned assumptions, a fixed point for T is confirmed to exist.
Proof. 
Let = ʘ = Q . Under this assumption, the remaining part directly corresponds to Theorem 1. □
Example 6.
Consider ʘ = { 21 , 22 , 23 , 24 } ; then, we can conclude that ( ʘ , đ ) constitutes a complete rectangular metric space, where the metric function đ is given as follows:
đ ( ʐ , x ) = đ ( x , ʐ ) = 0 , if ʐ = x , 1 , if ( ʐ , x ) { ( 21 , 23 ) , ( 22 , 23 ) } , 2 , if ( ʐ , x ) { ( 21 , 24 ) , ( 22 , 24 ) , ( 23 , 24 ) } , 3 , if ( ʐ , x ) = ( 21 , 22 ) .
Also, multivalued mapping T : ʘ CB ( ʘ ) is given as
T ʐ = 21 , if ʐ = { 21 , 22 , 23 } { 22 , 23 } , if ʐ = 24 .
Now, T meets the ( f θ κ ) B P proximal contraction condition
θ ( f ( H ( T ʐ , T x ) ) ) θ ( f ( S ( ʐ , x ) ) ) ,
for all ʐ , x ʘ . Let the function θ be θ ( y ) = e y for f = 2 t .
Let ʐ { 21 , 22 , 23 } with x = 24 ; then, T ʐ = 21 , and T x = { 22 , 23 } . Therefore, H ( T ʐ , T x ) = 1 , and we also obtain
S ( ʐ , x ) = max đ ( x , T ( x ) ) , đ ( ʐ , x ) , đ ( ʐ , T y ) đ ( ʐ , x ) = max { đ ( 2 , 1 ) đ ( 2 , 4 ) , 2 , đ ( 4 , 1 ) } = max { 2 , 2 , 3 2 } = 2 .
Therefore,
f ( H ( T ʐ , T x ) ) = f ( 1 ) = 2 ( 1 ) = 2 , and f ( S ( ʐ , x ) ) = f ( 2 ) = 4 .
Now, by applying θ, we obtain
θ ( f ( H ( T ʐ , T x ) ) ) = θ ( 2 ) = e 2 = 7.3891 ,
and
θ ( f ( S ( ʐ , x ) ) ) = θ ( 4 ) = e 4 = 54.5982
All of the conditions stated in Corollary 2 are fulfilled, which confirms that 1 is a fixed point for T .

4. Single-Valued Mappings Results

This part of the manuscript explores the coincidence proximity point results within the complete rectangular metric spaces, with a particular emphasis on single-valued mappings.
Definition 12.
Let us take two mappings ( g , T ) , such that the scenario whereby g : and T : Q is termed a ( θ κ ) C p proximal contraction if for κ ( 0 , 1 ) ,
đ ( , Q ) = đ g u , T ʐ đ ( , Q ) = đ g v , T x
implying that
θ ( f ( đ ( T ʐ , T x ) ) ) θ ( f ( S ( u , v , ʐ , x ) ) ) κ ,
where
S ( u , v , ʐ , x ) = max đ ( g ʐ , g x ) , đ ( g u , g v ) , đ ( g u , T u ) đ ( g u , g v ) đ ( g x , T u ) , đ * ( g v , T u )
for all u , v , ʐ , x .
Definition 13.
Consider a map T : Q that is termed to satisfy the ( θ κ ) B P proximal contraction condition if for κ ( 0 , 1 ) ,
đ ( , Q ) = đ u , T ʐ đ ( , Q ) = đ v , T x
which implies that
θ ( f ( đ ( T ʐ , T x ) ) ) θ ( f ( S ( u , v , ʐ , x ) ) ) κ ,
where
S ( u , v , ʐ , x ) = max đ ( ʐ , x ) , đ ( u , v ) , đ ( u , T u ) đ ( u , v ) đ ( x , T u ) , đ * ( v , T u ) .
for all u , v , ʐ , x in .
While choosing g as I , ( θ κ ) C p -proximal contractions reduce to the standardized form of ( θ κ ) B p -proximal contractions.
Theorem 2.
Consider two mappings, g : and T : Q , with ϕ Q , closed subsets of ( ʘ , đ ) , with the P -property, where T ( 0 ) Q 0 and 0 g ( 0 ) . If the couple ( g , T ) of continuous maps contains injective mapping g , these mappings fulfill the condition of ( θ κ ) C p -proximal contraction. Under the mentioned assumptions, a best coincidence proximity point for the couple ( g , T ) is confirmed to exist.
Proof. 
As single-valued mappings are a special case of multivalued mappings, for ʐ n 0 and T ( 0 ) Q 0 , there is ʐ n + 1 0 , which gives
đ ( g ʐ n + 1 , T ʐ n ) = đ ( , Q ) .
After selecting ʐ n + 1 , which satisfies the given condition, there exists an element ʐ n + 2 0 that meets the condition
đ ( , Q ) = đ ( g ( ʐ n + 2 ) , T ( ʐ n + 1 ) )
For all positive integers n, utilizing the P -property, we obtain
đ ( g ʐ n + 1 , g ʐ n + 2 ) = đ ( T ʐ n , T ʐ n + 1 ) .
Moreover, since the couple ( g , T ) meets the condition of ( θ κ ) C p -proximal contraction, and by applying Equations (14) and (15), we obtain
θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) θ ( f ( S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) ) ) κ ,
where
S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) = max đ ( g ʐ n , g ʐ n + 1 ) , đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ * ( g ʐ n + 1 , T ʐ n ) , đ ( g ʐ n , T ʐ n ) đ ( g ʐ n , g ʐ n + 1 ) đ ( g ʐ n + 2 , T ʐ n ) max đ ( g ʐ n + 1 , T ʐ n ) đ ( , Q ) , đ ( g ʐ n , g ʐ n + 1 ) , đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) + đ ( g ʐ n + 1 , g ʐ n + 2 ) + đ ( g ʐ n + 2 , T ʐ n ) đ ( g ʐ n , g ʐ n + 1 ) đ ( g ʐ n + 2 , T ʐ n ) max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) , đ ( g ʐ n + 1 , g ʐ n + 2 ) , 0 max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) .
So, we can say that
S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) .
If we choose max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g x n + 1 ) = đ ( g ʐ n + 1 , g ʐ n + 2 ) , then inequality (16) transforms into
θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) κ ,
which is not impossible. If max đ ( g ʐ n + 1 , g ʐ n + 2 ) , đ ( g ʐ n , g ʐ n + 1 ) = đ ( g ʐ n , g ʐ n + 1 ) , then Equation (16) becomes
θ ( f ( đ ( g ʐ n , g ʐ n + 1 ) ) ) κ θ ( f ( đ ( g ʐ n + 1 , g ʐ n + 2 ) ) ) ,
Here, our contraction holds, and the remaining part directly corresponds to Theorem 1. □
Example 7.
Consider the set ʘ = { 17 , 18 , 19 , 20 , 21 , 22 } ; then, ( ʘ , đ ) becomes a complete rectangular metric space. Here, the metric function đ : ʘ × ʘ [ 0 , ) is
đ ( ʐ , x ) = 0 , if ʐ = x , | ʐ x | if ʐ x
Suppose that Q = { 18 , 20 , 22 } and = { 17 , 19 , 21 } are two closed subsets of ( ʘ , đ ) . We see that đ ( , Q ) = 1 and meets the P property, where 0 = and Q 0 = Q . Also, map T : Q is
T ʐ = 20 , if ʐ = 21 18 , if ʐ = { 17 , 19 } ,
and g : is
g ʐ = 21 , if ʐ = 19 19 , if ʐ = 21 17 , if ʐ = 17
We clearly see that T ( 0 ) Q 0 and g ( 0 ) 0 . Now, our aims to prove the couple ( g , T ) fulfill the condition of ( θ κ ) C p -proximal contraction,
θ ( f ( đ ( T ʐ , T x ) ) ) θ ( f ( S ( u , v , ʐ , x ) ) ) κ ,
for all u , x , v , ʐ . Since
đ ( , Q ) = đ ( g 17 , T 19 ) , đ ( , Q ) = đ ( g 19 , T 21 ) ,
here, v = 19 , ʐ = 19 , u = 17 , and x = 21 . After routine calculation, we have
đ ( T 19 , T 21 ) = đ ( 18 , 20 ) = 2 ,
and
S ( 17 , 19 , 19 , 21 ) = max đ ( g 17 , g 19 ) , đ ( g 19 , g 21 ) , đ * ( g 19 , T 17 ) , đ ( g 17 , T 17 ) đ ( g 17 , g 19 ) đ ( g 21 , T 17 ) = max đ ( g 17 , g 19 ) , đ ( g 19 , g 21 ) , đ ( g 19 , T 17 ) đ ( , Q ) , đ ( g 17 , T 17 ) đ ( g 17 , g 19 ) đ ( g 21 , T 17 ) = max đ ( 17 , 21 ) , đ ( 21 , 19 ) , đ ( 21 , 18 ) đ ( , Q ) , đ ( 17 , 18 ) đ ( 17 , 21 ) đ ( 19 , 18 ) = max 2 , 2 , 1 2 2 , 3 1 = 2 .
Here, θ functions as θ ( y ) = e y . For f = 2 t and κ > 0.26 , we calculate f ( đ ( T ʐ , T x ) ) = 2 2 , f ( S ( u , v , ʐ , x ) ) = 4 and then inequality (18), given as
θ 2 2 θ ( 4 ) κ
Thus, the requirements as per Theorem 2 are met, confirming that 17 serves as the coincidence best proximity point for the couple ( g , T ) .
Corollary 3.
Let T : Q , with Ø Q , closed subsets of ( ʘ , đ ) , satisfying the P -property, and the given metric is complete. Additionally, assume that T ( 0 ) Q 0 . The mapping T admits a proximity point if it is continuous and satisfies the ( θ κ ) B p -proximal contraction condition.
Proof. 
If we take g = I (here, I denotes the identity mapping on ), and ʐ n 0 , and T ( 0 ) Q 0 , then there is ʐ n + 1 0 , which gives
đ ( ʐ n + 1 , T ʐ n ) = đ ( , Q ) .
After selecting ʐ n + 1 , which satisfies the given condition, there exists an element ʐ n + 2 0 that meets the condition
đ ( , Q ) = đ ( ( ʐ n + 2 ) , T ( ʐ n + 1 ) )
For all positive integers n, utilizing the P -property, we obtain
đ ( ʐ n + 1 , ʐ n + 2 ) = đ ( T ʐ n , T ʐ n + 1 ) .
Moreover, since T meets the condition of ( θ κ ) B p -proximal contraction, and by applying Equations (19) and (20), we obtain
θ ( f ( đ ( ʐ n + 1 , ʐ n + 2 ) ) ) θ ( f ( S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) ) ) κ ,
where
S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) = max đ ( ʐ n , ʐ n + 1 ) , đ ( ʐ n + 1 , ʐ n + 2 ) , đ * ( ʐ n + 1 , T ʐ n ) , đ ( ʐ n , T ʐ n ) đ ( ʐ n , ʐ n + 1 ) đ ( ʐ n + 2 , T ʐ n ) max đ ( ʐ n + 1 , T ʐ n ) đ ( , Q ) , đ ( ʐ n , ʐ n + 1 ) , đ ( ʐ n + 1 , ʐ n + 2 ) , đ ( ʐ n , ʐ n + 1 ) + đ ( ʐ n + 1 , ʐ n + 2 ) + đ ( ʐ n + 2 , T ʐ n ) đ ( ʐ n , ʐ n + 1 ) đ ( ʐ n + 2 , T ʐ n ) max đ ( ʐ n + 1 , ʐ n + 2 ) , đ ( ʐ n , ʐ n + 1 ) , đ ( ʐ n + 1 , ʐ n + 2 ) , 0 max đ ( ʐ n + 1 , ʐ n + 2 ) , đ ( ʐ n , ʐ n + 1 ) .
So, we can say that
S ( ʐ n + 1 , ʐ n + 2 , ʐ n , ʐ n + 1 ) max đ ( ʐ n + 1 , ʐ n + 2 ) , đ ( ʐ n , ʐ n + 1 ) .
If we choose max đ ( ʐ n + 1 , ʐ n + 2 ) , đ ( ʐ n , x n + 1 ) = đ ( ʐ n + 1 , ʐ n + 2 ) , then inequality (21) transforms into
θ ( f ( đ ( ʐ n + 1 , ʐ n + 2 ) ) ) θ ( f ( đ ( ʐ n + 1 , ʐ n + 2 ) ) ) κ ,
which is not impossible. If max đ ( ʐ n + 1 , ʐ n + 2 ) , đ ( ʐ n , ʐ n + 1 ) = đ ( ʐ n , ʐ n + 1 ) , then Equation (21) becomes
θ ( f ( đ ( ʐ n , ʐ n + 1 ) ) ) κ θ ( f ( đ ( ʐ n + 1 , ʐ n + 2 ) ) ) ,
Here, our contraction holds, and then, the remaining part directly corresponds to Theorem 1, and we obtain a proximity point. □
The following example shows that in the best proximity study, we are dealing with two sequences at a time, which is an advantage of best proximity. We show this phenomenon numerically and graphically.
Example 8.
Let us have ʘ = C [ 0 , 3 ] , and the metric đ ( a , ) = sup ω [ 0 , 1 ] | a 8 ( ω ) 8 ( ω ) | . Let
= { α ( ω ) : α [ 0 , 1 ] }
and
Q = { α ( ω 2 ) : α [ 0 , 1 ] }
Here, đ ( , Q ) = 2 , with 0 = and Q 0 = Q . Now, non-self-mapping T : Q is defined as
T ( a ( ω ) ) = 8 9 ( ω 2 ) + ( ω 2 ) 0 1 ( a 8 ( s ) ) d s
So, T ( 0 ) Q 0 . Take a ( ω ) , ( ω ) , w ( ω ) , u ( ω ) , which gives
đ ( , Q ) = đ ( w ( ω ) , T ( a ( ω ) ) )
đ ( , Q ) = đ ( u ( ω ) , T ( ( ω ) ) )
Now,
đ ( T ( a ( ω ) ) , T ( ( ω ) ) ) = sup ω [ 0 , 1 ] 8 9 ( ω 2 ) + ( ω 2 ) 0 1 ( a 8 ( s ) ) d s 8 9 ( ω 2 ) ( ω 2 ) 0 1 ( 8 ( s ) ) d s = sup ω [ 0 , 1 ] ( ω 2 ) 0 1 ( a 8 ( s ) ) d s ( ω 2 ) 0 1 ( 8 ( s ) ) d s sup ω [ 0 , 1 ] ( ω 2 ) 0 1 a 8 ( s ) 8 ( s ) d s = ( ω 2 ) sup ω [ 0 , 1 ] a 8 ( ω ) 8 ( ω ) 0 1 d s = ( ω 2 ) đ ( a ( ω ) , ( ω ) ) ( ω 2 ) max đ ( a ( ω ) , ( ω ) ) , đ ( w ( ω ) , u ( ω ) ) , đ ( w ( ω ) , T ( w ( ω ) ) ) đ ( w ( ω ) , u ( ω ) ) đ ( ( ω ) , T ( w ( ω ) ) ) , đ ( a ( ω ) , T ( a ( ω ) ) ) đ ( a ( ω ) , ( ω ) )
( ω 2 ) S a ( ω ) , ( ω ) , w ( ω ) , u ( ω ) ( ω ) S a ( ω ) , ( ω ) , w ( ω ) , u ( ω ) .
Now, taking f ( t ) = 2 t and θ ( ζ ) = e ζ implies that
θ f đ ( T ( a ( ω ) ) , T ( ( ω ) ) θ f S ( a ( ω ) , ( ω ) , w ( ω ) , u ( ω ) ) ( ω )
Hence, ( θ κ ) B P holds. Now, we show the numerical convergence of both sequences a n and T ( a n ) in Table 1 given below, taking the initial guess a 0 = 0 .
Now, we have the graphical convergence of both sequences, which are generated at the same time and also converge at same time in different places. In Figure 1, we show the convergence of sequence a n , and in Figure 2, the convergence of T ( a n ) .

5. Fixed Point Results

If we set Q = = ʘ in Theorem 2 from the earlier section, then we obtain a fixed point and simultaneously fulfill the preceding considerations.
Definition 14.
A map T : ʘ ʘ is known to be ( θ κ ) F P -contraction, if for κ ( 0 , 1 ) , the following holds:
θ ( f ( đ ( T v , T u ) ) ) θ ( f ( S ( v , u ) ) ) κ ,
where v , u ʘ
S ( v , u ) = max { đ ( u , T v ) , đ ( v , u ) , đ ( v , T v ) đ ( v , u ) } .
Theorem 3.
Let T : ʘ ʘ be a self-mapping on ( ʘ , đ ) (a complete rectangular metric space). If T meets the condition of ( θ κ ) F P -contraction with f , then T possesses a fixed point. Here f is an alternating distance function.
Proof. 
When = ʘ = Q is considered, and for ʐ n ʘ , there is ʐ n + 1 ʘ . Moreover, since T meets the condition of ( θ κ ) F p -contraction, and by applying equation, we obtain
θ ( f ( đ ( ʐ n + 1 , ʐ n + 2 ) ) ) θ ( f ( S ( ʐ n , ʐ n + 1 ) ) ) κ ,
where
S ( ʐ n , ʐ n + 1 ) = max đ ( ʐ n + 1 , T ʐ n ) , đ ( ʐ n , ʐ n + 1 ) , đ ( ʐ n , T ʐ n ) đ ( ʐ n , ʐ n + 1 ) max đ ( ʐ n + 1 , ʐ n + 1 ) , đ ( ʐ n , ʐ n + 1 ) , đ ( ʐ n , ʐ n + 1 ) đ ( ʐ n , ʐ n + 1 ) max đ ( ʐ n , ʐ n + 1 ) .
So, Equation (23) becomes
θ ( f ( đ ( ʐ n , ʐ n + 1 ) ) ) κ θ ( f ( đ ( ʐ n + 1 , ʐ n + 2 ) ) ) ,
Here, our contraction holds, and then, the remaining part directly corresponds to Theorem 1.
Example 9.
: If we take = 1 n : n = { 6 , 7 , 8 , 9 , 10 } and Q = [ 1 , 2 ] , the metric đ : ʘ × ʘ R is as follows:
đ 1 7 , 1 8 = 0.03 = đ 1 9 , 1 10 ,
đ 1 7 , 1 10 = 0.02 = đ 1 8 , 1 9 ,
đ 1 7 , 1 9 = 0.06 = đ 1 10 , 1 8 ,
and
đ ( ʐ , x ) = | ʐ x | , all other ʐ , x ʘ .
Here, ʘ = Q . We see that ( ʘ , đ ) meets the rectangular metric conditions but does not fulfill the condition of a metric space. If we take ʐ = 1 7 , x = 1 9 and z = 1 8 , then
đ 1 7 , 1 9 = 0.06 ,
On the other hand,
đ 1 7 , 1 8 + đ 1 8 , 1 9 = 0.03 + 0.02 = 0.05 ,
which gives
đ 1 7 , 1 8 + đ 1 8 , 1 9 đ 1 7 , 1 9 ,
which shows that ( ʘ , đ ) does not fulfill the metric definition but it meets conditions of the rectangular metric.
Now, define T : ʘ ʘ , where ʘ = Q , such that
T ʐ = 1 , if ʐ 1 2 ʐ + 1 2 , if ʐ Q .
This map T meets the ( θ κ ) F p contraction condition
θ ( f ( đ ( T ʐ , T x ) ) ) θ ( f ( S ( ʐ , x ) ) ) κ ,
for all ʐ , x ʘ .
  • Case (i): If ʐ and x Q , we take ʐ = 1 7 and x = 1.5 ; then, the distance đ ( T x , T y ) = 0.25 , with S 1 7 , 1.5 = 1.357 .
  • Case (ii): If both points are taken from set Q , then we have two cases. In the first one, we select closely situated elements, whereas, in the second case, the chosen points are more distant from each other.
(a)
If ʐ = 1.1 and x = 1 , then đ ( T ʐ , T x ) = 0.05 and S ( ʐ , x ) = 0.1 .
(b)
If ʐ = 1 and x = 2 , then đ ( T ʐ , T x ) = 0.5 and S ( ʐ , x ) = 1 .
Now, θ is defined as
θ ( x ) = e x .
For f ( t ) = 2 t , with κ > 0.5 , we obtain inequality (25) in all cases.
Thus, all requirements mentioned in Theorem 3 are met. So, 1 is clearly a fixed point of T .
The following analysis investigates the convergence behavior of the sequence by considering different initial guesses. The results presented in Table 2 clearly highlight the distinct convergence behaviors observed in each scenario.
The graph below illustrates the behavior of sequences generated from various initial guesses. Figure 3 illustrates the convergence trends of these sequences, offering valuable analytical insights.

6. Application to Equation of Motion

Fixed point theory has several applications, such as in the hybrid pneumatic–electric-driven climbing robot [25], which features bionic flexible feet and involves nonlinear control systems. Fixed point theory ensures stability and convergence within the neural control framework, facilitating proper limb-to-foot coordination and enhancing the robot’s adaptability and performance in climbing. Additionally, the proposed 3D reconstruction algorithm for bubble mesostructures [26] employs nonlinear imaging techniques, where fixed point theory ensures the stability and convergence of the reconstruction process. To demonstrate the practicality of our results, we apply the proposed generalized contraction to the equation of motion, a classical second-order differential equation in mechanics.
Consider the set C [ 0 , 1 ] , a family of continuous functions defined on [ 0 , 1 ] . Let đ : C [ 0 , 1 ] × C [ 0 , 1 ] R , defined by đ ( u , v ) = sup t [ 0 , 1 ] | u ( t ) v ( t ) | . It is widely acknowledged that ( C [ 0 , 1 ] , đ ) constitutes a complete metric space.
Now, let us turn our attention to the following problem.
Problem: Let us consider a scenario where a particle with unit mass m, at time zero, is at rest, such that ʐ = 0 and 𝓉 = 0 . At 𝓉 = 0 , a force f begins to act on the particle in the direction of the x-axis, causing its velocity to abruptly change from 0 to 1. Our objective is to determine the position of the particle at time 𝓉 . This can be described by the equation of motion
m d 2 ʐ d 𝓉 2 = f ( 𝓉 , ʐ ( 𝓉 ) )
with the initial conditions ʐ ( 0 ) = 0 and ʐ ( 0 ) = 1 , where f : [ 0 , 1 ] × R R is a continuous function.
We can define the Green’s function associated with this equation as
G ( 𝓉 , s ) = 𝓉 if 0 𝓉 s 1 , 2 𝓉 s if 0 s 𝓉 1 .
Consider a function, f : R × R R , satisfying the following conditions:
  • | f ( 𝓉 , a ) f ( 𝓉 , ) | | a | for all 𝓉 [ 0 , 1 ] and a , R with f ( a , ) 0 .
  • There is ʐ 0 C [ 0 , 1 ] , which gives f ( ʐ 0 ( 𝓉 ) , T ʐ 0 ( 𝓉 ) ) 0 , 𝓉 [ 0 , 1 ] , where T : C [ 0 , 1 ] C [ 0 , 1 ] .
Now, we aim to establish the existence of a solution to the second-order differential equation.
Theorem 4.
Under the given assumptions (1)–(2), the equation of motion possesses a solution within the space C 2 ( [ 0 , 1 ] ) .
Proof. 
It is a well-established fact that finding a solution to Equation (26) is equivalent to finding ʐ C ( [ 0 , 1 ] ) that satisfies the associated integral equation.
ʐ ( 𝓉 ) = 0 1 G ( 𝓉 , s ) f ( s , ʐ ( s ) ) d s , 𝓉 [ 0 , 1 ]
Let T : C [ 0 , 1 ] C [ 0 , 1 ] , given by
T ( ʐ ( 𝓉 ) ) = 0 1 G ( 𝓉 , s ) f ( s , ʐ ( s ) ) d s .
Now, suppose that ʐ , x C [ 0 , 1 ] such that f ( ʐ ( 𝓉 ) , x ( 𝓉 ) ) 0 , 𝓉 [ 0 , 1 ] . So,
đ ( T ʐ ( 𝓉 ) , T x ( 𝓉 ) ) = T ʐ ( 𝓉 ) T x ( 𝓉 ) = 0 1 G ( 𝓉 , s ) f ( s , ʐ ( s ) ) d s 0 1 G ( 𝓉 , s ) f ( s , x ( s ) ) d s 0 1 G ( 𝓉 , s ) d s f ( s , ʐ ( s ) ) f ( s , x ( s ) ) 0 1 G ( 𝓉 , s ) d s ʐ ( s ) x ( s ) sup 0 1 G ( s , 𝓉 ) d s S ( ʐ , x )
Since 0 1 G ( 𝓉 , s ) = 𝓉 2 2 + 1 2 𝓉 [ 0 , 1 ] , sup { 0 1 G ( s , 𝓉 ) d s } = 1 2 . Hence, we obtain
đ ( T ʐ ( 𝓉 ) , x ( 𝓉 ) ) 1 2 S ( ʐ , x )
Since f ( 𝓉 ) = 2 𝓉 , we obtain
f ( đ ( T ʐ ( 𝓉 ) , T x ( 𝓉 ) ) ) f 1 2 S ( ʐ , x )
and θ ( x ) = e x ; then, by performing a simple calculation, we obtain
θ f đ ( T ʐ ( 𝓉 ) , T x ( 𝓉 ) ) θ ( f ( S ( ʐ , x ) ) ) 1 2
So, we fulfill the ( θ κ ) F P -contraction condition; then, according to Theorem 3, T has a unique fixed point, which is the solution to the equation of motion. □

7. Conclusions

We investigate the best coincidence proximity points in the context of rectangular metric space for multivalued maps. We employ the alternating distance function f and develop θ -type generalized contractions for both single-valued and multi-valued non-self-maps to examine the existence of these best coincidence, best proximity, and fixed point results. To extend the applicability of our core findings, we give examples of single-valued and multi-valued mappings. Furthermore, we showcase the practical importance of our research by applying our findings to solve problems related to the equation of motion. These results have significant implications in both the theoretical and practical realms, assisting researchers in the study of fixed point theory and addressing difficulties in mechanical and engineering disciplines.
Future directions:
One can extend this concept towards the framework of ( ϕ ψ ) -contractions [27], which represents a further generalization of several types of contraction mappings. Future research in fixed point theory can greatly enhance stability and performance across various fields. In human-exoskeleton control, fixed point methods can stabilize mode switching in multimodal systems [28]. For electrohydrodynamic flows, they can ensure the convergence of lattice Boltzmann simulations [29]. In structural mechanics, fixed point theory can improve the stability of finite element models for reinforced concrete under torsional load [30,31].

Author Contributions

M.Z., F.U.D., L.-I.C. and D.B. were equally involved in the conceptualization, design, and coordination of this study. They contributed to drafting the manuscript, aligning the sequence, and ensuring the accuracy of the content. All authors have read and agreed to the published version of the manuscript.

Funding

This study was conducted without any external financial support.

Data Availability Statement

This research is entirely theoretical, with no involvement of datasets or empirical data collection. The findings and conclusions are solely based on mathematical analysis and computational simulations.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Khan, I.; Shaheryar, M.; Din, F.U.; Ishtiaq, U.; Popa, I.L. Fixed-Point Results in Fuzzy S-Metric Space with Applications to Fractals and Satellite Web Coupling Problem. Fractal Fract. 2025, 9, 164. [Google Scholar] [CrossRef]
  2. Zahid, M.; Ud Din, F.; Shah, K.; Abdeljawad, T. Fuzzy fixed point approach to study the existence of solution for Volterra type integral equations using fuzzy Sehgal contraction. PLoS ONE 2024, 19, e0303642. [Google Scholar] [CrossRef] [PubMed]
  3. Basha, S.; Veeramani, P. Best proximity pair theorems for multi-functions with open fibres. J. Approx. Theory 2000, 103, 119–129. [Google Scholar] [CrossRef]
  4. Basha, S.; Veeramani, P. Best approximations and best proximity pairs. Acta Sci. Math. 1997, 63, 289–300. [Google Scholar]
  5. Eldred, A.A.; Veeramani, P. Existence and convergence of best proximity points. J. Math. Anal. Appl. 2006, 323, 1001–1006. [Google Scholar] [CrossRef]
  6. Ishtiaq, U.; Jahangeer, F.; Kattan, D.A.; Argyros, I.K. Generalized Common Best Proximity Point Results in Fuzzy Metric Spaces with Application. Symmetry 2023, 15, 1501. [Google Scholar] [CrossRef]
  7. Younis, M.; Ahmad, H.; Shahid, W. Best proximity points for multivalued mappings and equation of motion. J. Appl. Anal. Comp. 2024, 14, 298–316. [Google Scholar] [CrossRef]
  8. Komal, S.; Hussain, A.; Sultana, N.; Kumam, P. Coincidence best proximity points for Geraghty type proximal cyclic contractions. J. Math. Comp. Sci. 2018, 18, 98–114. [Google Scholar] [CrossRef]
  9. Jleli, M.; Samet, B. A new generalization of the Banach contraction principle. J. Inequal. Appl. 2014, 2014, 38. [Google Scholar] [CrossRef]
  10. Zahid, M.; Din, F.U.; Younis, M.; Ahmad, H.; Öztürk, M. Some Results on Multivalued Proximal Contractions with Application to Integral Equation. Mathematics 2024, 12, 3488. [Google Scholar] [CrossRef]
  11. Sametric, B.; Vetro, C.; Vetro, P. Fixed point theorem for α-ψ-contractive type mappings. Nonlinear Anal. 2012, 75, 2154–2165. [Google Scholar]
  12. Feng, G.; Yu, S.; Wang, T.; Zhang, Z. Discussion on the weak equivalence principle for a Schwarzschild gravitational field based on the light-clock model. Ann. Phys. 2025, 473, 169903. [Google Scholar] [CrossRef]
  13. Jin, Y.; Lu, G.; Sun, W. Genuine multipartite entanglement from a thermodynamic perspective. Phys. Rev. A 2024, 109, 042422. [Google Scholar] [CrossRef]
  14. Liu, X.; Lou, S.; Dai, W. Further results on “System identification of nonlinear state-space models”. Automatica 2023, 148, 110760. [Google Scholar] [CrossRef]
  15. Gao, Q.; Deng, Z.; Ju, Z.; Zhang, T. Dual-hand motion capture by using biological inspiration for bionic bimanual robot teleoperation. Cyb. Biol. Syst. 2023, 4, 52. [Google Scholar] [CrossRef]
  16. Hou, Q.; Li, Y.; Singh, V.P.; Sun, Z. Physics-informed neural network for diffusive wave model. J. Hydrol. 2024, 637, 131261. [Google Scholar] [CrossRef]
  17. Peng, L.; Liang, Y.; He, X. Transfers to Earth-Moon triangular libration points by Sun-perturbed dynamics. Adv. Space Res. 2025, 75, 2837–2855. [Google Scholar] [CrossRef]
  18. Shi, Q.; Sun, Y.; Saanouni, T. On the growth of Sobolev norms for Hartree equation. J. Evol. Equ. 2025, 25, 13. [Google Scholar] [CrossRef]
  19. Alves, S.; Babcinschi, M.; Silva, A.; Neto, D.; Fonseca, D.; Neto, P. Integrated design fabrication and control of a bioinspired multimaterial soft robotic hand. Cybor. Biol. Syst. 2023, 4, 51. [Google Scholar] [CrossRef]
  20. Frechet, M.M. Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo 1906, 22, 1–72. [Google Scholar] [CrossRef]
  21. Branciari, A. A fixed point theorem of Banach-Caccioppoli type on a class of generalized metric spaces. Publ. Math. Debr. 2000, 57, 31–37. [Google Scholar] [CrossRef]
  22. Sankar Raj, V. A best proximity point theorem for weakly contractive non-self-mappings. Nonlinear Anal. 2011, 74, 4804–4808. [Google Scholar] [CrossRef]
  23. Khan, M.S.; Swaleh, M.; Sessa, S. Fixed point theorems by altering distances between the points. Bull. Aust. Math. Soc. 1984, 30, 1–9. [Google Scholar] [CrossRef]
  24. Rockafellar, T.R.; Wets, R.J.V. Variational Analysis; Springer: Berlin, Germany, 2005. [Google Scholar]
  25. Wang, B.; Wang, Z.; Song, Y.; Zong, W.; Zhang, L.; Ji, K.; Dai, Z. GA neural coordination strategy for attachment and detachment of a climbing robot inspired by gecko locomotion. Cyb. Biol. Syst. 2023, 4, 8. [Google Scholar]
  26. Song, Y.; Huang, G.; Yin, J.; Wang, D. Three-dimensional reconstruction of bubble geometry from single-perspective images based on ray tracing algorithm. Meas. Sci. Technol. 2025, 36, 016010. [Google Scholar] [CrossRef]
  27. Erhan, I.M.; Karapınar, E.; Sekulić, T. Fixed points of (ψ,ϕ) contractions on rectangular metric spaces. Fixed Point Theory Appl. 2012, 2012, 138. [Google Scholar] [CrossRef]
  28. Zhang, W.; Yang, X.; Lin, J.; Lin, B.; Huang, Y. Experimental and numerical study on the torsional behavior of rectangular hollow reinforced concrete columns strengthened By CFRP. Structures 2024, 70, 107690. [Google Scholar] [CrossRef]
  29. Xiong, F.; Wang, L.; Huang, J.; Luo, K. A Thermodynamically Consistent Phase-Field Lattice Boltzmann Method for Two-Phase Electrohydrodynamic Flows. J. Sci. Comp. 2025, 103, 34. [Google Scholar] [CrossRef]
  30. Kou, J.; Wang, Y.; Chen, Z.; Shi, Y.; Guo, Q. Gait Planning and Multimodal Human-Exoskeleton Cooperative Control Based on Central Pattern Generator. IEEE/ASME Tran. Mech. 2024, 1–11. [Google Scholar] [CrossRef]
  31. Kou, J.; Wang, Y.; Chen, Z.; Shi, Y.; Guo, Q.; Xu, M. Flexible assistance strategy of lower limb rehabilitation exoskeleton based on admittance model. Sci. China Technol. Sci. 2024, 67, 823–834. [Google Scholar] [CrossRef]
Figure 1. Convergence behavior of sequence a n .
Figure 1. Convergence behavior of sequence a n .
Axioms 14 00382 g001
Figure 2. Convergence behavior of sequence T ( a n ) .
Figure 2. Convergence behavior of sequence T ( a n ) .
Axioms 14 00382 g002
Figure 3. Convergence behavior with various initial points.
Figure 3. Convergence behavior with various initial points.
Axioms 14 00382 g003
Table 1. Convergence of sequences a n and T ( a n ) .
Table 1. Convergence of sequences a n and T ( a n ) .
Sr. No.Sequence a n Sequence T ( a n )
000 8 9 ( ω 2 ) = 0.8889 ( ω 2 )
01 0.8889 ω 0.9322 ( ω 2 )
02 0.9322 ω 0.9522 ( ω 2 )
03 0.9522 ω 0.9640 ( ω 2 )
04 0.9640 ω 0.9717 ( ω 2 )
05 0.9717 ω 0.9772 ( ω 2 )
06 0.9772 ω 0.9813 ( ω 2 )
07 0.9813 ω 0.9869 ( ω 2 )
08 0.9869 ω 0.9888 ( ω 2 )
09 0.9888 ω 0.9904 ( ω 2 )
10 0.9904 ω 0.9918 ( ω 2 )
31 0.9997 ω 0.9998 ( ω 2 )
32 0.9998 ω 0.9999 ( ω 2 )
33 0.9999 ω ( ω 2 )
34ω ( ω 2 )
Table 2. Convergence behavior of sequences with various initial guesses.
Table 2. Convergence behavior of sequences with various initial guesses.
Sr. No. ʐ 0 = 2 1.8 1.6 1.4 1.2
11.51.41.31.21.1
21.251.21.151.11.05
31.1251.11.0751.051.025
41.06251.051.03751.0251.0125
51.031251.0251.018751.001251.00625
61.015631.01251.009381.006251.00313
71.007811.006251.004681.003131.00157
81.003911.003131.002341.001571.00079
91.001961.001571.001171.000791.00040
 ⋮ ⋮ ⋮ ⋮ ⋮ ⋮
161.000021.000011.0000111
171.000011111
1811111
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

Zahid, M.; Din, F.U.; Cotîrlă, L.-I.; Breaz, D. A Novel Approach to Some Proximal Contractions with Examples of Its Application. Axioms 2025, 14, 382. https://doi.org/10.3390/axioms14050382

AMA Style

Zahid M, Din FU, Cotîrlă L-I, Breaz D. A Novel Approach to Some Proximal Contractions with Examples of Its Application. Axioms. 2025; 14(5):382. https://doi.org/10.3390/axioms14050382

Chicago/Turabian Style

Zahid, Muhammad, Fahim Ud Din, Luminiţa-Ioana Cotîrlă, and Daniel Breaz. 2025. "A Novel Approach to Some Proximal Contractions with Examples of Its Application" Axioms 14, no. 5: 382. https://doi.org/10.3390/axioms14050382

APA Style

Zahid, M., Din, F. U., Cotîrlă, L.-I., & Breaz, D. (2025). A Novel Approach to Some Proximal Contractions with Examples of Its Application. Axioms, 14(5), 382. https://doi.org/10.3390/axioms14050382

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