Next Article in Journal
Controllability and Minimum-Energy Control of Fractional Differential Systems with Time-Varying State and Control Delays
Next Article in Special Issue
Nonlinear F-Contractions in Relational Metric Space and Applications to Fractional Differential Equations
Previous Article in Journal
Solvability, Ulam–Hyers Stability, and Kernel Analysis of Multi-Order σ-Hilfer Fractional Systems: A Unified Theoretical Framework
Previous Article in Special Issue
Fixed-Point Results in Fuzzy S-Metric Space with Applications to Fractals and Satellite Web Coupling Problem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Unified Framework for Generalized Symmetric Contractions and Economic Dynamics via Fractional Differential Equations

1
School of Science, Hainan Tropical Ocean University, Sanya 572000, China
2
Abdus Salam School of Mathematical Sciences, Governement College University, Lahore 54600, Pakistan
3
Center for Mathematical Research, University of Sanya, Sanya 572022, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2026, 10(1), 22; https://doi.org/10.3390/fractalfract10010022
Submission received: 26 November 2025 / Revised: 16 December 2025 / Accepted: 25 December 2025 / Published: 29 December 2025

Abstract

This study has developed a unified framework for modeling economic growth through Caputo fractional differential equations. The framework has established the existence and uniqueness of solutions by employing a generalized fixed-point approach. In particular, the analysis has introduced and utilized new classes of symmetric operators, including symmetric Lipschitz-type mappings, symmetric Kannan-type contractions, and symmetric Chatterjea-type contractions. These mappings are based on a refined symmetric Lipschitz condition that enables the examination of the behavior of their iterative sequences. The study has focused on several forms of symmetric contractions defined on metric spaces endowed with a binary relation, providing a setting that generalizes and unifies various existing fixed-point theorems. This framework has extended classical results by Goebel and Sims, Goebel and Japon-Pineda, and others. Finally, to illustrate the practical significance of the theoretical findings, the developed results have been applied to demonstrate the existence of solutions for fractional models of economic growth and a related Fredholm integral equation.

1. Introduction

The fundamental Banach fixed-point result [1], introduced in 1922 in Banach’s thesis, remains a cornerstone in the theory of metric fixed points. According to this result, any Banach contraction mapping T on a complete metric space ( X ,   d ) , possesses a unique fixed point x * X , i.e., T x * = x * . Specifically, a mapping T is known as a Banach contraction if for all x ,   y X , the distance between T x and T y satisfies the condition
d ( T x ,   T y ) μ · d ( x ,   y )
for μ [ 0 ,   1 ) . This principle, known for its reliability and implementation, has become an indispensable tool for proving the presence of solutions to a wide variety of problems in mathematics and the applied sciences, including integral and differential equations across fields such as physics, engineering, biology, social sciences, etc.
In the years following its introduction, Banach’s contraction theorem inspired numerous extensions and generalizations. Prominent contributions from Edelstein [2], Rakotch [3], Boyd and Wong [4], Meir and Keeler [5], Reich [6], Matkowski [7], and others have expanded the scope of the theorem, exploring different types of contractions, the role of completeness, and various related fixed point results. Notably, the theorem’s applicability has been broadened with new contractive conditions and extensions to broader domains, as discussed in the works of Nadler [8] and others. For further developments on metric fixed point theory and its applications, the recent research by Joshi and Bose [9], Almezel et al. [10], and Hammad and Manuel [11,12] offers valuable insights. These extensions not only retain the original power of the Banach contraction principle but also explore its use in solving more complex problems across diverse scientific areas.
Various modifications of the Lipschitz condition have been proposed, based on different distance measures. These include six specific distances, as follows: d ( x ,   y ) , d ( T x ,   T y ) , d ( x ,   T x ) , d ( y ,   T y ) , d ( x ,   T y ) , and d ( y ,   T x ) for all x ,   y X . In its classical form, the Lipschitz condition typically involves an inequality between two of these distances: ( x ,   y ) and ( T x ,   T y ) , which ensures that an operator is continuous or uniformly continuous. However, several authors have explored alternative inequalities that involve some or all of these six distances. While these alternative conditions offer insight, they do not always guarantee the continuity of the mapping in question.
In addition, Kannan [13] and Chatterjea [14] contractions have been studied extensively due to their importance in proving the presence of fixed points. An operator T : X X is classified as a Kannan contraction if we find a constant μ [ 0 ,   1 2 ) such that
d ( T x ,   T y ) μ d ( x ,   T x ) + d ( y ,   T y ) for all x ,   y X .
Similarly, an operator T : X X is referred to as a Chatterjea contraction if we find a constant μ [ 0 ,   1 2 ) for which
d ( T x ,   T y ) μ d ( x ,   T y ) + d ( y ,   T x ) for all x ,   y X .
Alam and Imdad [15] gave a weaker form of the Banach contraction condition, applying it only to point pairs connected by a specific binary relation, rather than throughout the whole space. This viewpoint inspired substantial research on fixed point theory in the framework of binary relations, commonly known as relational metric spaces. In particular, Din and his collaborators (see [16,17]) explored extensions of Perov’s classical fixed point theorems within this context.
Goebel and Pineda [18] and Goebel and Sims [19] introduced a new class of mappings termed ( τ ,   β ) -Lipschitz mappings. Consider τ = ( τ 1 ,   τ 2 ,   ,   τ k ) , where each τ j R , with the conditions j = 1 k τ j = 1 and τ j 0 for all τ j , and τ 1 ,   τ k > 0 . We then refer to τ as a multi-index, and the number k is called the length of the multi-index τ . For further information on ( τ ,   β ) -Lipschitz mappings, see the works of Goebel and Japon-Pineda [18], where they introduce a new type of nonexpansiveness that generalizes traditional Lipschitz conditions, offering a broader framework for studying fixed-point theory. Their approach is further expanded by Goebel and Sims [19], who explore mean Lipschitzian mappings, which offer insights into the behavior of mappings under more relaxed Lipschitz conditions. Additionally, the work of Asem et al. [20] on ( τ ,   k ) -cyclic contractions delves into the relationships between such mappings and the existence of fixed points, contributing to a deeper understanding of cyclic iterations and their convergence properties. These contributions collectively highlight the versatility and applicability of ( τ ,   β ) -Lipschitz mappings in modern fixed point theory.
Motivated by the concept of ( τ ,   β ) -Lipschitz mappings, ( τ ,   β ) -nonexpansive mappings with multi-indices [18,19], and utilizing the technique introduced by Alam and Imdad [15], we initiated the development of ( τ ,   β ,   R ) -type symmetric nonexpansive mappings with multi-indices. We also define the concept of ( τ ,   β ,   R ) -type symmetric Kannan contractions and ( τ ,   β ,   R ) -type symmetric Chatterjea contractions with some multi-indices, and establish related fixed point results. Finally, we provide several detailed examples to verify our findings and present an existence condition to show the presence of a solution for an integral equation. We also study the existence and uniqueness of solutions for economic growth models with fractional differential equations using generalized fixed-point techniques.

2. Preliminaries

We now introduce the following consolidated definitions and notations that will be used throughout the paper.
Definition 1
([15,21,22,23,24,25,26,27]). Let ( X ,   d ) be a metric space, T : X X a mapping, and R X 2 a nonempty binary relation. Then,
1. 
R 1 = { ( x ,   y ) : ( y ,   x ) R } , R # = R Δ X , and R s = R R 1 denote the inverse, reflexive, and symmetric closure relations of the binary relation R , respectively.
2. 
Elements x ,   y X are R -comparable if ( x ,   y ) R or ( y ,   x ) R , denoted [ x ,   y ] R . It is also important to note that [ x ,   y ] R if and only if [ x ,   y ] R s .
3. 
A sequence { x j } X is R -preserving if ( x j ,   x j + 1 ) R for all j.
4. 
R is T -closed if ( x ,   y ) R ( T x ,   T y ) R ; in this case, R and R s remain T j -closed.
5. 
( X ,   d ) is R -complete if every R -preserving Cauchy sequence converges.
6. 
T is R -continuous if convergence of a R -preserving sequence { x j } x implies T x j T x .
7. 
R is d-self-closed if every convergent R -preserving sequence has a subsequence { x j l } with [ x j l ,   x ] R .
8. 
A subset B X is R -directed if for all x ,   y B there exists q X such that ( x ,   q ) ,   ( y ,   q ) R .
9. 
A path of length k in R from x to y is a sequence { q 0 ,   ,   q k } X with q 0 = x , q k = y , and ( q i ,   q i + 1 ) R for all 0 i < k .
10. 
Denote Fix ( T ) = { x X : T ( x ) = x } , R T = { x X : ( x ,   T ( x ) ) R } , and Paths ( x ,   y ; R ) as the set of all R -paths connecting x and y .
11. 
If Paths ( x ,   y ; R ) is non-empty for all x ,   y X , then X is called R -connected.
Furthermore, Alam et al. [23] extended the findings of [15] by introducing even more relaxed conditions. This allowed them to prove the presence and uniqueness of fixed points for self-mappings defined with respect to binary relations, as further supported by [28].
Definition 2
([23]). The self-mapping T is R -preserving contraction if there exists μ [ 0 ,   1 ) such that
f o r a l l x ,   y X w i t h ( x ,   y ) R d ( T x ,   T y ) μ d ( x ,   y ) .
Theorem 1
([23]). Let ( X ,   d ) be a metric space with a binary relation R defined on X , and let T be a self-mapping on X . Assume further that the following assumptions are satisfied:
1. 
( X ,   d ) is R -complete;
2. 
R is T -closed;
3. 
either T is R -continuous or R is d-self-closed;
4. 
R T is non-empty;
5. 
T is an R -preserving contraction.
Then, T admits at least one fixed point. Furthermore, if the image T ( X ) is R s -connected, the fixed point of T is unique.
Example 1.
Let X = R be the set of real numbers equipped with the usual metric given by d ( x ,   y ) = | x y | . Define the binary relation R over X as R : = { ( x ,   y ) | x [ 0 ,   1 ] & y [ 1 ,   2 ] } and mapping T : X X by T ( x ) = sin ( x ) . Then T is a R -preserving contraction. In fact, for all ( x ,   y ) R , we have
d ( T x ,   T y ) = 1 9 | sin x sin y | 1 9 | x y | = 1 9 d ( x ,   y ) .
All other assumptions of Theorem 1 are fulfilled. Therefore, the operator T admits a unique fixed point, namely x * = { 0 } .
Goebel and Pineda [18], as well as Goebel and Sims [19], introduced a new class of mappings, referred to as ( τ ,   β ) -Lipschitz mappings, defined as follows:
Definition 3
([18,19]). Let us consider a metric space ( X ,   d ) and let A be a nonempty subset of X . A mapping T : A A is known as a ( τ ,   β ) -Lipschitzian with constant μ [ 0 ,   ) if one finds a multi-index τ = ( τ 1 ,   τ 2 ,   ,   τ k ) of length k, and a parameter β [ 1 ,   ) , such that
j = 1 k τ j · d ( T j x ,   T j y ) β μ [ d ( x ,   y ) ] β
for all x ,   y A .
The smallest μ that satisfies the ( τ ,   β ) -Lipschitz condition is called the ( τ ,   β ) -Lipschitz constant. The mapping T is termed a ( τ ,   β ) -contraction if μ < 1 , and ( τ ,   β ) -nonexpansive if μ = 1 . Similarly, when β = 1 , we call T a τ -contraction or τ -nonexpansive if Equation (5) holds with μ < 1 or μ = 1 , respectively. If τ is not explicitly specified with β = 1 in Equation (5), then T is referred to as a mean Lipschitzian mapping.
Example 2
([29]). Let X = [ 0 ,   ) be equipped with the standard metric d ( x ,   y ) = | x y | . Define a self-mapping T : X X by T ( x ) = x + a , where a > 0 . Then, for β 1 and τ = ( τ 1 ,   τ 2 ) ( 0 ,   1 ) 2 , the mapping satisfies the following:
τ 1 T x T y β + τ 2 T 2 x T 2 y β = x y β
for all x ,   y X . This shows that a T is ( τ ,   β ) -nonexpansive with multi-index τ of length k = 2 .

3. Main Results

In this section, we introduced the concept of ( τ ,   β ,   R ) -type symmetric nonexpansive mappings with multi-indices. We also defined the notions of ( τ ,   β ,   R ) -type symmetric Kannan contractions and ( τ ,   β ,   R ) -type symmetric Chatterjea contractions for certain multi-indices, and established corresponding fixed point results. Lastly, we presented several detailed examples to illustrate and validate our findings.
Definition 4.
A mapping T : X X is referred to as a ( τ ,   β ,   R ) -type symmetric Lipschitzian if, for some multi-index τ of length k and β [ 1 ,   ) , there exists a constant μ 0 such that
j = 1 k τ j d T j x ,   T j y β μ d x ,   y β
for all x ,   y X with ( x ,   y ) R .
The smallest μ satisfying the ( τ ,   β ,   R ) -type symmetric Lipschitz condition is termed the corresponding Lipschitz constant. The mapping T is called a ( τ ,   β ,   R ) -type contraction if μ < 1 , and non-expansive if μ = 1 . When β = 1 and τ is unspecified, T is referred to as a mean-theoretic order R -contraction if μ < 1 or an R -non-expansive mapping if μ = 1 . If R = X 2 , then a ( τ ,   β ,   R ) -type contraction reduces to a ( τ ,   β ) -contraction. Moreover, if β = 1 in (6), the mapping T is referred to as a ( τ ,   R ) -type contraction.
Definition 5.
A mapping T : X X is said to be a ( τ ,   β ,   R ) -type symmetric Kannan contraction if, for some multi-index τ of length k and β [ 1 ,   ) , there exists a constant μ [ 0 ,   1 2 ) such that
j = 1 k τ j d T j x ,   T j y β μ d x ,   T x β + d y ,   T y β
for all x ,   y X with ( x ,   y ) R .
Definition 6.
A mapping T : X X is termed a ( τ ,   β ,   R ) -type symmetric Chatterjea contraction if, for some multi-index τ of length k and β [ 1 ,   ) , there exists a constant μ [ 0 ,   1 2 ) such that
j = 1 k τ j d T j x ,   T j y β μ d x ,   T y β + d y ,   T x β
for all x ,   y X with ( x ,   y ) R .
For simplicity, we focus on the multi-index τ of length k = 2 in this section. This simplification aids in better illustrating the concepts, although the method can be generalized to indices of higher dimensions.
Example 3.
Consider X = [ 0 ,   1 ] equipped with the standard metric d ( x ,   y ) = | x y | . Define the binary relation R and self-mapping T as given below:
R = ( x ,   y ) X × X : x 5 8 ,   1 & y 1 2 ,   1
and
T x = 1 + x 2 2 for all x X .
Additionally, T 2 x = 5 + 2 x 2 + x 4 8 for all x X . Then for all ( x ,   y ) R , we have
| T x T y | = 1 2 x 2 y 2 = x + y 2 | x y | | x y | .
Also, we have the following:
T 2 x T 2 y 1 4 x 2 y 2 + 1 8 x 4 y 4 | x y | .
So, for any β 1 , we get
τ 1 d ( T x ,   T y ) β + τ 2 d T 2 x ,   T 2 y β d ( x ,   y ) β
for all ( x ,   y ) R . It is evident that T constitutes a ( τ ,   β ,   R ) -type symmetric nonexpansive mapping, where the multi-index τ has a length of k = 2 .
For additional examples of ( τ ,   β ,   R ) -type symmetric contraction mappings, as well as ( τ ,   β ,   R ) -type symmetric Kannan contractions and ( τ ,   β ,   R ) -type symmetric Chatterjea contractions, we direct the reader to Examples 4, 5, and 7 for further clarification and detailed illustrations.
Theorem 2.
Consider ( X ,   d ) as a metric space, equipped with a binary relation R and a self-mapping T on X . Suppose that the following assumptions are fulfilled:
1. 
( X ,   d ) is R -complete;
2. 
R is T -closed;
3. 
either T is R -continuous or R is d-self-closed;
4. 
R T is non-empty;
5. 
T is a ( τ ,   β ,   R ) -type symmetric contraction with constant μ < δ = min { τ 1 ,   τ 2 } .
Then, T has a fixed point.
Proof. 
In lieu of assumption (4), there exists a x 0 R T , that is, x 0 ,   T x 0 R . Define a Picard sequence { x n } at the initial guess x 0 , that is, x n + 1 = T x n , for all n N . As x 0 ,   T x 0 R , using assumption (2), we obtain
( x 0 ,   T x 0 ) ,   ( T x 0 ,   T T x 0 ) ,   ( T T x 0 ,   T T T x 0 ) ,   R ,
which further implies that
x n ,   x n + 1 R ,   for all n N { 0 } .
This indicates that the Picard sequence x n maintains the relation R throughout its iterations, making it a R -preserving sequence. If there exists some n * N such that x n * + 1 = x n * , then T x n * = x n * , i.e., x n * Fix ( T ) . From this point onward in the proof, we proceed under the assumption that x n + 1 x n , for all n 0 . Setting ξ = max d x 0 ,   T x 0 ,   d T x 0 ,   T 2 x 0 , we have d x 0 ,   T x 0 ξ and d T x 0 ,   T 2 x 0 ξ .
Now, we discuss the following cases.
Case (i): When 2 μ < τ 1 and setting φ β = μ δ < 1 . Taking x = x 0 and y = T x 0 in (4), we obtain the following:
τ 1 d T x 0 ,   T 2 x 0 β τ 1 d T x 0 ,   T 2 x 0 β + τ 2 d T 2 x 0 ,   T 3 x 0 β μ d x 0 ,   T x 0 β μ ξ β d T x 0 ,   T 2 x 0 β μ τ 1 ξ β μ δ ξ β .
It follows that:
d T x 0 ,   T 2 x 0 φ ξ .
Again, taking x = T x 0 and y = T 2 x 0 in (4), we obtain the following:
τ 1 d T 2 x 0 ,   T 3 x 0 β τ 1 d T 2 x 0 ,   T 3 x 0 β + τ 2 d T 3 x 0 ,   T 4 x 0 β μ d T x 0 ,   T 2 x 0 β = μ ( φ ξ ) β d T 2 x 0 ,   T 3 x 0 β μ δ ( φ ξ ) β = φ 2 ξ β .
Therefore, d T 2 x 0 ,   T 3 x 0 φ 2 ξ . And from (4), we obtain the following:
τ 1 d T 3 x 0 ,   T 4 x 0 β τ 1 d T 3 x 0 ,   T 4 x 0 β + τ 2 d T 4 x 0 ,   T 5 x 0 β μ d T 2 x 0 ,   T 3 x 0 β = μ ( φ 2 ξ ) β d T 3 x 0 ,   T 4 x 0 β ( φ 3 ξ ) β .
Therefore, d T 3 x 0 ,   T 4 x 0 φ 3 ξ . Additionally, we have the following:
τ 1 d T 4 x 0 ,   T 5 x 0 β τ 1 d T 4 x 0 ,   T 5 x 0 β + τ 2 d T 5 x 0 ,   T 6 x 0 β μ d T 3 x 0 ,   T 4 x 0 β d T 4 x 0 ,   T 5 x 0 β φ 4 ξ .
Similarly, we obtain the following:
d T n x 0 ,   T n + 1 x 0 φ n ξ ,   for all n N { 0 } .
Hence, we have d T n x 0 ,   T n + 1 x 0 0 as n . We now aim to demonstrate that the sequence { x n } forms a Cauchy sequence in the space X . To this end, consider any n 0 0 , and let n n 0 , p 1 ; then we get
d T n x 0 ,   T n + p x 0 d T n x 0 ,   T n + 1 x 0 + d T n + 1 x 0 ,   T n + 2 x 0 + + d T n + p 1 x 0 ,   T n + p x 0 φ n 1 + φ + φ 2 + + φ p 1 ξ φ n 1 φ ξ .
Taking limit as n , we obtain d T n x 0 ,   T n + p x 0 0 , which means that { x n } is a R -preserving Cauchy sequence in X .
Case (ii): When μ < τ 2 and setting φ β = μ δ < 1 . Taking x = x 0 and y = T x 0 in (4), we have the following:
τ 2 d T 2 x 0 ,   T 3 x 0 β τ 1 d T x 0 ,   T 2 x 0 β + τ 2 d T 2 x 0 ,   T 3 x 0 β μ d x 0 ,   T x 0 β = μ ξ d T 2 x 0 ,   T 3 x 0 β μ τ 2 ξ β μ δ ξ β = ( φ ξ ) β .
Therefore, we obtain the following:
d T 2 x 0 ,   T 3 x 0 φ ξ .
Again, taking x = T x 0 and y = T 2 x 0 in (4), we obtain the following:
τ 2 d T 3 x 0 ,   T 4 x 0 β τ 1 d T 2 x 0 ,   T 3 x 0 β + τ 2 d T 3 x 0 ,   T 4 x 0 β μ d T x 0 ,   T 2 x 0 β = μ ξ d T 3 x 0 ,   T 4 x 0 φ ξ .
And
τ 2 d T 4 x 0 ,   T 5 x 0 β τ 1 d T 3 x 0 ,   T 4 x 0 β + τ 2 d T 4 x 0 ,   T 5 x 0 β μ d T 2 x 0 ,   T 3 x 0 β d T 4 x 0 ,   T 5 x 0 φ 2 ξ .
Additionally, we have the following:
d T 5 x 0 ,   T 6 x 0 φ 2 ξ .
Moreover, we obtain the following:
τ 2 d T 6 x 0 ,   T 7 x 0 β τ 1 d T 5 x 0 ,   T 6 x 0 β + τ 2 d T 6 x 0 ,   T 7 x 0 β μ d T 4 x 0 ,   T 5 x 0 β d T 6 x 0 ,   T 7 x 0 φ 3 ξ .
Further, we obtain the following:
τ 2 d T 7 x 0 ,   T 8 x 0 β τ 1 d T 6 x 0 ,   T 7 x 0 β + τ 2 d T 7 x 0 ,   T 8 x 0 β μ d T 5 x 0 ,   T 6 x 0 β d T 7 x 0 ,   T 8 x 0 φ 3 ξ .
Proceeding with the same steps as previously outlined, we arrive at the following:
d T m x 0 ,   T m + 1 x 0 φ l ξ ,
whenever m = 2 l or m = 2 l + 1 , it shows that d T m x 0 ,   T m + 1 x 0 0 as m + . To demonstrate that the sequence { x n } is Cauchy in X , consider the two possible subcases by selecting positive integers m and n such that m < n = m + q .
Subcase (a): For m = 2 l , where l ,   q 1 , we have
d T m x 0 ,   T m + q x 0 = d T 2 l x 0 ,   T 2 l + q x 0 d T 2 l x 0 ,   T 2 l + 1 x 0 + d T 2 l + 1 x 0 ,   T 2 l + 2 x 0 + d T 2 l + 2 x 0 ,   T 2 l + 3 x 0 + + d T 2 l + q 2 x 0 ,   T 2 l + q 1 x 0 + d T 2 l + q 1 x 0 ,   T 2 l + q x 0 φ l ξ + φ l ξ + φ l + 1 ξ + φ l + 1 ξ + 2 φ l 1 + φ + φ 2 + ξ 2 φ l 1 1 φ ξ .
Subcase (b): Similarly, for m = 2 l + 1 with l ,   q 1 , we obtain the following:
d T m x 0 ,   T m + q x 0 = d T 2 l + 1 x 0 ,   T 2 l + q + 1 x 0 d T 2 l + 1 x 0 ,   T 2 l + 2 x 0 + d T 2 l + 2 x 0 ,   T 2 l + 3 x 0 + d T 2 l + 3 x 0 ,   T 2 l + 4 x 0 + + d T 2 l + q 1 x 0 ,   T 2 l + q x 0 + d T 2 l + q x 0 ,   T 2 l + q + 1 x 0 φ l ξ + φ l + 1 ξ + φ l + 1 ξ + φ l + 2 ξ + 2 φ l 1 + φ + φ 2 + ξ 2 φ l 1 1 φ ξ .
Letting l in all sub-cases and noting that φ < 1 , it follows that
d T m x 0 ,   T m + 1 x 0 0 .
Therefore, { x n } forms a R -preserving Cauchy sequence in X . Consequently, in all cases considered, the sequence retains the R -preserving property. Given that X is R -complete, there exists a point q X such that x n = T n x 0 q as n + .
Finally, to establish that q is a fixed point of T , assumption (3) is employed. Assuming T is R -continuous, and given that the sequence { x k } is R -preserving with x k q , the R -continuity of T ensures that x k + 1 = T ( x k ) T ( q ) . By the uniqueness of the limit, we conclude that T ( q ) = q . Thus, q is a fixed point of T .
Alternatively, suppose that R is d-self-closed. Since the sequence { x n } is preserved under R and converges to q , ∃ { x n k } from { x n } for which, for all n N , the pair [ x n k ,   q ] lies within R . By invoking assumption (5) and Definition 1(1), we deduce that [ x n k ,   q ] R and x n k q , which leads to the following conclusion:
τ 1 d ( x n k + 1 ,   T q ) β + τ 2 d ( x n k + 2 ,   T 2 q ) β = τ 1 d ( T x n k ,   T q ) β + τ 2 d ( T 2 x n k ,   T 2 q ) β μ d ( x n k ,   q ) β .
Taking the limit as n , we obtain
τ 1 d ( q ,   T q ) β + τ 2 d ( q ,   T 2 q ) β 0 .
This implies that d ( q ,   T q ) = 0 and d ( q ,   T 2 q ) = 0 . Therefore, T q = q , and hence, Fix ( T ) . □
To ensure that the fixed point is unique, we impose stronger conditions on the contraction mapping as well as the associated relation. These supplementary constraints prevent the existence of multiple distinct fixed points, thereby guaranteeing that the fixed point set contains exactly one element, that is, it is a singleton.
Theorem 3.
If all the hypotheses outlined in Theorem 2 hold, and in addition, for any pair of elements x ,   y X , there exists at least one path connecting them within the relation R , that is,
Paths ( x ,   y ; R ) ,  
then the self-mapping T possesses exactly one fixed point.
Proof. 
The existence part of the result follows directly from Theorem 2. We now proceed to prove the uniqueness part. Suppose, for contradiction, that the operator T has two distinct fixed points, denoted by x * and y * . Then, there exists a finite sequence (or path) { q 0 ,   q 1 ,   ,   q m } X such that
q 0 = x * ,   q m = y * ,   [ q i ,   q i + 1 ] R for each i ( 0 i m 1 ) .
Since R is T -closed, so by Definition 1(4), we obtain
[ T k q j ,   T k q j + 1 ] R ,   for all k N { 0 } .
Utilizing the triangle inequality in conjunction with the contraction-type condition for all k N , we get
τ 1 k d ( x * ,   y * ) = τ 1 k d ( T k x * ,   T k y * ) τ 1 k j = 0 m 1 d ( T k q j ,   T k q j + 1 ) τ 1 k j = 0 m 1 d ( T k q j ,   T k q j + 1 ) β + τ 2 j = 0 m 1 d ( T k + 1 q j ,   T k + 1 q j + 1 ) β = τ 1 k 1 j = 0 m 1 τ 1 d ( T k q j ,   T k q j + 1 ) β + τ 2 d ( T k + 1 q j ,   T k + 1 q j + 1 ) β τ 1 k 1 j = 0 m 1 μ d T k 1 q j ,   T k 1 q j + 1 β = μ τ 1 k 1 j = 0 m 1 d T k 1 q j ,   T k 1 q j + 1 β μ τ 1 k 2 j = 0 m 1 τ 1 d T k 1 q j ,   T k 1 q j + 1 β + τ 2 d ( T k q j ,   T k q j + 1 ) β μ τ 1 k 2 j = 0 m 1 μ d T k 1 q j ,   T k 1 q j + 1 β = μ 2 τ 1 k 2 j = 0 m 1 d T k 1 q j ,   T k 1 q j + 1 β μ k j = 0 m 1 d q j ,   q j + 1 β d ( x * ,   y * ) μ τ 1 k · j = 0 m 1 d q j ,   q j + 1 β 0 as k .
Thus, we conclude that x * = y * , which leads to a contradiction. Therefore, the set F i x ( T ) must be a singleton set. □
The following example is presented to illustrate the above result.
Example 4.
Let X = [ 0 ,   1 ] and define a metric d on X by d ( x ,   y ) : = | x y | 1 2 for all x ,   y X . Then ( X ,   d ) is a complete metric space. Consider the binary relation
R : = ( x ,   y ) X 2 : x [ 0 ,   1 2 ] ,   y [ 0 ,   1 ] { ( y ,   x ) X 2 : y [ 0 ,   1 2 ] ,   x [ 0 ,   1 ] } ,  
and define the mapping T : X X by T x = 1 x 2 4 for all x X . Then, we obtain T 2 x = 15 + 2 x 2 x 4 64 for all x X . For all ( x ,   y ) R , we have
[ d ( T x ,   T y ) ] 2 = | T x T y | = 1 4 | x 2 y 2 | 1 2 | x y | = 1 2 [ d ( x ,   y ) ] 2 ,  
and
[ d ( T 2 x ,   T 2 y ) ] 2 = | T 2 x T 2 y | 5 16 | x y | = 5 16 [ d ( x ,   y ) ] 2 .
We consider the multi-index τ = ( τ 1 ,   τ 2 ) , where τ 1 = τ 2 = 1 2 . Then, for all ( x ,   y ) R , we get
τ 1 [ d ( T x ,   T y ) ] 2 + τ 2 [ d ( T 2 x ,   T 2 y ) ] 2 μ [ d ( x ,   y ) ] 2 ,  
where
μ = 1 2 + 5 16 = 13 16 < σ : = min { τ 1 ,   τ 2 } = 1 2 .
Moreover, there exists 0 X such that ( 0 ,   T 0 ) R , R is T -closed and T is continuous. Hence, all the assumptions of Theorem 2 are satisfied, and therefore Fix ( T ) .
Furthermore, for any x ,   y X , we have Paths ( x ,   y ; R ) . Consequently, by Theorem 3, Fix ( T ) = { 5 2 } ,   which is a singleton set.
By considering the binary relation R on X as R = X 2 , we can deduce the main result of Khan et al. [29] as follows.
Corollary 1
([29]). Consider ( X ,   d ) as a complete metric space, and let T be a self-mapping on X that satisfies the conditions of a ( τ ,   β ) -type contraction, where τ is a multi-index of length k = 2 and μ + τ 1 < 1 . In this case, the set of fixed points Fix ( T ) contains exactly one element.
Proof. 
Consider a multi-index τ = ( τ 1 ,   τ 2 ) of length k = 2 , where τ 1 + τ 2 = 1 . Therefore, we can express τ 2 as 1 τ 1 . The condition μ + τ 1 < 1 implies that
μ 1 τ 1 = μ τ 2 μ δ < 1 .
From this, we deduce that μ < δ , where δ = min { τ 1 ,   τ 2 } . Furthermore, all the other conditions of Theorem 3 are met, and thus, Fix ( T ) contains exactly one element. □
Next, we state and prove the fixed point result for a ( τ ,   β ,   R ) -type Kannan contraction mapping, which is as follows:
Theorem 4.
Consider ( X ,   d ) as a metric space, where R represents a binary relation on X , and T is a self-mapping of X . Assume that the following conditions hold:
1. 
( X ,   d ) is R -complete;
2. 
R is T -closed;
3. 
either T is R -continuous or R is d-self-closed;
4. 
R T is non-empty;
5. 
T is a ( τ ,   β ,   R ) -type symmetric Kannan contraction with constant μ < δ = 1 2 min { τ 1 ,   τ 2 } .
Then, T has a fixed point.
Proof. 
Using the same steps as in Theorem 2, we can define a Picard sequence x n such that ( x n ,   x n + 1 ) R and x n x n + 1 for all n N { 0 } . Next, assume ξ = max d x 0 ,   T x 0 ,   d T x 0 ,   T 2 x 0 , then we have d x 0 ,   T x 0 ξ and d T x 0 ,   T 2 x 0 ξ . Now, we show that the sequence d x n ,   x n + 1 = d T n x 0 ,   T n + 1 x 0 is a monotone decreasing sequence of positive real numbers. As
τ 1 d T x n ,   T x n + 1 β + τ 2 d T 2 x n ,   T 2 x n + 1 β μ d x n ,   T x n β + d x n + 1 ,   T x n + 1 β τ 1 d x n + 1 ,   x n + 2 β + τ 2 d x n + 2 ,   x n + 3 β μ d x n ,   x n + 1 β + d x n + 1 ,   x n + 2 β .
Therefore, we obtain
τ 1 d x n + 1 ,   x n + 2 β τ 1 d x n + 1 ,   x n + 2 β + τ 2 d x n + 2 ,   x n + 3 β μ d x n ,   x n + 1 β + d x n + 1 ,   x n + 2 β .
If for some n N , we have d x n ,   x n + 1 < d x n + 1 ,   x n + 2 , then
τ 1 d x n + 1 ,   x n + 2 β 2 μ d x n + 1 ,   x n + 2 β 1 2 μ τ 1 = μ τ 1 2 μ δ .
This leads to a contradiction, and hence we have d x n + 1 ,   x n + 2 d x n ,   x n + 1 for all n N { 0 } . Thus, d x n ,   x n + 1 = d T n x 0 ,   T n + 1 x 0 is a monotone decreasing sequence of positive real numbers. Setting:
ξ = d x 0 ,   T x 0 d T n x 0 ,   T n + 1 x 0 β d T n + 1 x 0 ,   T n + 2 x 0 β .
Now, as in Theorem 2, the following cases arise:
Case (i): If 2 μ < τ 1 and then define φ β = μ δ < 1 . Taking x = x 0 and y = T x 0 in (7), we obtain the following:
τ 1 d T x 0 ,   T 2 x 0 β τ 1 d T x 0 ,   T 2 x 0 β + τ 2 d T 2 x 0 ,   T 3 x 0 β μ d x 0 ,   T x 0 β + d T x 0 ,   T 2 x 0 β 2 μ ξ d T x 0 ,   T 2 x 0 β 2 μ τ 1 ξ β = μ τ 1 2 ξ β μ δ ξ β = φ ξ β d T x 0 ,   T 2 x 0 φ ξ .
Again, taking x = T x 0 and y = T 2 x 0 in (7), we get
τ 1 d T 2 x 0 ,   T 3 x 0 β τ 1 d T 2 x 0 ,   T 3 x 0 β + τ 2 d T 3 x 0 ,   T 4 x 0 β μ d T x 0 ,   T 2 x 0 β + d T 2 x 0 ,   T 3 x 0 β 2 μ d T x 0 ,   T 2 x 0 β = 2 μ φ ξ β d T 2 x 0 ,   T 3 x 0 μ τ 1 2 φ ξ β μ δ φ ξ β = φ 2 ξ .
Additionally, from (7), we have
τ 1 d T 3 x 0 ,   T 4 x 0 β τ 1 d T 3 x 0 ,   T 4 x 0 β + τ 2 d T 4 x 0 ,   T 5 x 0 β μ d T 2 x 0 ,   T 3 x 0 β + d T 3 x 0 ,   T 4 x 0 β 2 μ d T 2 x 0 ,   T 3 x 0 β = 2 μ φ 2 ξ β d T 3 x 0 ,   T 4 x 0 φ 3 ξ .
Similarly, we obtain the following:
d T 4 x 0 ,   T 5 x 0 φ 4 ξ .
In general, we obtain the following:
d T n x 0 ,   T n + 1 x 0 φ n ξ ,   for all n N { 0 } .
Therefore, d T n x 0 ,   T n + 1 x 0 0 as n + .
Case (ii): When 2 μ < τ 2 and setting φ β = μ δ < 1 . Taking x = x 0 and y = T x 0 in (7), we have the following:
τ 2 d T 2 x 0 ,   T 3 x 0 β τ 1 d T x 0 ,   T 2 x 0 β + τ 2 d T 2 x 0 ,   T 3 x 0 β μ d x 0 ,   T x 0 β + d T x 0 ,   T 2 x 0 β 2 μ ξ d T 2 x 0 ,   T 3 x 0 β 2 μ τ 2 ξ β = μ τ 2 2 ξ β μ δ ξ β = ( φ ξ ) β .
Therefore, we obtain the following:
d T 2 x 0 ,   T 3 x 0 φ ξ .
Again, taking x = T x 0 and y = T 2 x 0 in (5), we obtain
τ 2 d T 3 x 0 ,   T 4 x 0 β τ 1 d T 2 x 0 ,   T 3 x 0 β + τ 2 d T 3 x 0 ,   T 4 x 0 β μ d T x 0 ,   T 2 x 0 β + d T 2 x 0 ,   T 3 x 0 β 2 μ ξ β d T 3 x 0 ,   T 4 x 0 β μ τ 2 2 ξ β μ δ ξ β d T 3 x 0 ,   T 4 x 0 φ ξ
and also
τ 2 d T 4 x 0 ,   T 5 x 0 β τ 1 d T 3 x 0 ,   T 4 x 0 β + τ 2 d T 4 x 0 ,   T 5 x 0 β μ d T 2 x 0 ,   T 3 x 0 β + d T 3 x 0 ,   T 4 x 0 β 2 μ ξ β d T 4 x 0 ,   T 5 x 0 φ 2 ξ .
Additionally, we get
d T 5 x 0 ,   T 6 x 0 φ 2 ξ .
Further, we obtain the following: d T 6 x 0 ,   T 7 x 0 φ 3 ξ , and d T 7 x 0 ,   T 8 x 0 φ 3 ξ . Thus, in general, it follows that
d T m x 0 ,   T m + 1 x 0 φ l ξ ,
whenever m = 2 l or m = 2 l + 1 . Therefore, d T m x 0 ,   T m + 1 x 0 0 as m .
Following the same reasoning as in Theorem 2, it can be established that, in all cases, the sequence x n is a R -preserving Cauchy sequence in X . Given that X is R -complete, there exists a point q X such that x n = T n x 0 converges to q as n .
Using assumption (3), we show that q is a fixed point of T . Assume that T is R -continuous. Since the sequence { x k } is an R -preserving sequence and converges to q , the R -continuity of T implies that x k + 1 = T ( x k ) converges to T ( q ) . Due to the uniqueness of the limit, it follows that T ( q ) = q , which confirms that q is a fixed point of T .
Alternatively, assume that R is a d-self-closed binary relation. Given that the sequence { x n } is preserved by R and converges to q , there exists a subsequence { x n k } from { x n } such that, for every n N , the pair [ x n k ,   q ] is contained within R . By invoking assumption (5) and Definition 1(1), we deduce that [ x n k ,   q ] R and x n k q , which leads to the following conclusion:
τ 1 d x n k + 1 ,   T q β τ 1 d x n k + 1 ,   T q β + τ 2 d x n k + 2 ,   T 2 q β = τ 1 d T x n k ,   T q β + τ 2 d T 2 x n k ,   T 2 q β μ d x n k ,   T x n k β + d q ,   T q β = μ d x n k ,   x n k + 1 β + d q ,   T q β .
Taking the limit as n , we obtain
d q ,   T q β μ τ 1 d q ,   T q β μ δ d q ,   T q β 1 μ δ [ d ( q ,   T q ) ] β 0 .
This implies that 1 μ δ [ d ( q ,   T q ) ] β 0 , and consequently, d ( q ,   T q ) = 0 . Therefore, Fix ( T ) . □
To establish the uniqueness of the fixed point for a ( τ ,   β ,   R ) -type Kannan contraction mapping, we additionally assume the following condition:
Theorem 5.
If all the conditions specified in Theorem 4 are satisfied, and for every pair of elements x ,   y X , they are comparable with respect to the binary relation R , then Fix ( T ) must be a singleton.
Proof. 
Let q ,   q * Fix ( T ) . Then [ q ,   q * ] R and so using Definition 1(1) and inequality (5), we get
τ 1 d T q ,   T q * β + τ 2 d T 2 q ,   T 2 q * β μ d q ,   T q β + d q * ,   T q * β τ 1 + τ 2 d q ,   q * β 0 .
This leads to the conclusion that τ 1 + τ 2 = 0 , which is a contradiction. Therefore, Fix ( T ) must be a singleton. □
Example 5.
Let X = [ 0 ,   1 ] with the usual metric d ( x ,   y ) = | x y | and T : X X is defined by
T x = 1 5 ,   0 x 1 2 ,   1 5 ( 1 x ) ,   1 2 < x 1
and construct a binary relation R : = { ( x ,   y ) X 2 : x ,   y [ 0 ,   1 2 ] } . Notice that there exists 1 2 X such that ( 1 2 ,   T 1 2 ) = ( 1 2 ,   1 5 ) R , also whenever ( x ,   y ) R , then ( T x ,   T y ) = ( 1 5 ,   1 5 ) R showing that the binary relation R is T -closed.
Now for any ( x ,   y ) R and taking β = 5 , τ 1 = 1 , and τ 2 = 1 2 , we get
| T x T y | = 1 5 1 5 = 0
as well as
| T 2 x T 2 y | = 1 5 1 5 = 0 .
Therefore, we further obtain
τ 1 [ d ( T x ,   T y ) ] 5 + τ 2 [ d ( T 2 x ,   T 2 y ) ] 5 = 0 .
Hence, the following inequality holds
τ 1 [ d ( T x ,   T y ) ] β + τ 2 [ d ( T 2 x ,   T 2 y ) ] β μ d x ,   T x β + d y ,   T y β
for all ( x ,   y ) R with β = 5 , τ 1 = 1 2 , τ 2 = 1 2 and μ = 1 5 . This shows that T is a ( τ ,   5 ,   R ) -type symmetric Kannan contraction mapping of multi-index τ of length k = 2 with μ = 1 5 < δ = 1 2 min ( τ 1 ,   τ 2 ) = 1 4 . Therefore, all the conditions of Theorem 4 are satisfied, which leads to the conclusion that Fix ( T ) .
In the following example, we modify the binary relation, and its impact can be clearly observed. This change leads to a different structure in the mapping behavior and fixed-point analysis.
Example 6.
Let X = [ 0 ,   1 ] with the usual metric d ( x ,   y ) = | x y | and T : X X be given as
T x = 1 5 ,   0 x 1 2 ,   1 5 ( 1 x ) ,   1 2 < x 1 .
We construct a binary relation R = R 1 R 1 1 , where R 1 : = { ( x ,   y ) X 2 : x [ 0 ,   1 2 ] & y [ 1 5 ,   1 ] } . Notice that there exists 1 2 X such that ( 1 2 ,   T 1 2 ) = ( 1 2 ,   1 5 ) R , also whenever ( x ,   y ) R , then either ( T x ,   T y ) R 1 or ( T x ,   T y ) R 1 1 which implies ( T x ,   T y ) R , and it shows that the binary relation R is T -closed.
Now, for ( x ,   y ) R , we have two cases, either ( x ,   y ) R 1 or ( x ,   y ) R 1 1 . When ( x ,   y ) R 1 , we discuss more subcases:
Subcase (1):  If x 0 ,   1 2 and y 1 2 ,   1 , then | T x T y | = 1 5 1 5 ( 1 y ) = 1 5 y and T 2 x T 2 y = 1 5 1 5 = 0 . So by taking β = 1 , τ 1 = τ 2 = 1 2 , we get
τ 1 d ( T x ,   T y ) + τ 2 d T 2 x ,   T 2 y = 1 2 1 5 1 5 ( 1 y ) + 1 5 1 5 = 1 2 1 5 y = 1 5 y 2 .
It can also be noticed that
6 y 1 5 y 2 = 7 y 2 10 > 0 ,   for all y 1 2 ,   1 .
Therefore, we have
τ 1 d ( T x ,   T y ) + τ 2 d T 2 x ,   T 2 y = 1 5 y 2 1 5 | x T x | + 6 y 1 5 = 1 5 | x T x | + y 1 5 ( 1 y ) = μ d ( x ,   T x ) + d ( y ,   T y )
for all x 0 ,   1 2 and y 1 2 ,   1 , where μ = 1 5 .
Subcase (2): If x 0 ,   1 2 and y [ 1 5 ,   1 2 ] , then the above inequality holds trivially due to the constant function.
Similarly, due to the symmetric property of metric d, above inequality, that is, (5) also holds when ( x ,   y ) R 1 1 .
Hence, for all ( x ,   y ) R , we get
τ 1 [ d ( T x ,   T y ) ] β + τ 2 [ d T 2 x ,   T 2 y ] β μ [ d ( x ,   T x ) ] β + [ d ( y ,   T y ) ] β ,  
where β = 1 ,   τ = ( τ 1 ,   τ 2 ) = ( 1 2 ,   1 2 ) and μ = 1 5 .
This demonstrates that T is a ( τ ,   1 ,   R ) -type symmetric Kannan contraction mapping with a multi-index τ of length k = 2 , where μ = 1 5 < δ = 1 2 min τ 1 ,   τ 2 = 1 4 . Therefore, all the conditions of Theorem 4 are satisfied, and thus, Fix ( T ) . Furthermore, it is evident that every pair of elements in X is comparable. Therefore, by Theorem 5, the set Fix ( T ) contains exactly one element.
By taking the binary relation R on X as R = X 2 in Theorem 5, we can derive the following result.
Corollary 2.
Let ( X ,   d ) be a complete metric space, and T : X X be a ( τ ,   β ) -type Kannan contraction with constant μ < δ = 1 2 min { τ 1 ,   τ 2 } . Then, T has a unique fixed point.
Theorem 6.
Consider ( X ,   d ) as a metric space, where R is a binary relation defined on X , and T is a self-mapping on X . Assume that the following conditions are met:
1. 
( X ,   d ) is R -complete;
2. 
R is T -closed;
3. 
either T is R -continuous or R is d-self-closed;
4. 
R T is non-empty;
5. 
T is a ( τ ,   β ,   R ) -type symmetric Chatterjea contraction with constant μ < δ = 1 2 p min { τ 1 ,   τ 2 } .
Then, T has a fixed point.
Proof. 
Using the same steps as in Theorem 2, we can define a Picard sequence x n such that ( x n ,   x n + 1 ) R and x n x n + 1 for all n N { 0 } . Next, assume ξ = max d x 0 ,   T x 0 ,   d T x 0 ,   T 2 x 0 , then we have d x 0 ,   T x 0 ξ and d T x 0 ,   T 2 x 0 ξ . We now demonstrate that { d ( x n ,   x n + 1 ) } forms a monotone decreasing sequence of positive real numbers. From inequality (8), we get
τ 1 [ d ( T x n ,   T x n + 1 ) ] β + τ 2 [ d ( T 2 x n ,   T 2 x n + 1 ) ] β μ [ d ( x n ,   T x n + 1 ) ] β + d ( x n + 1 ,   T x n ) ] β
τ 1 [ d ( x n + 1 ,   x n + 2 ) ] β + τ 2 [ d ( x n + 2 ,   x n + 3 ) ] β μ [ d ( x n ,   x n + 2 ) ] β .
We obtain
τ 1 [ d ( x n + 1 ,   x n + 2 ) ] β τ 1 [ d ( x n + 1 ,   x n + 2 ) ] β + τ 2 [ d ( x n + 2 ,   x n + 3 ) ] β μ [ d ( x n ,   x n + 2 ) ] β [ d ( x n + 1 ,   x n + 2 ) ] β μ τ 1 d ( x n ,   x n + 1 ) + d ( x n + 1 ,   x n + 2 ) β .
If for some n N , we have d ( x n ,   x n + 1 ) < d ( x n + 1 ,   x n + 2 ) , then
[ d ( x n + 1 ,   x n + 2 ) ] β 2 β μ τ 1 [ d ( x n + 1 ,   x n + 2 ) ] β 1 2 β μ τ 1 = μ τ 1 2 β μ δ .
This leads to a contradiction, and therefore, we have d ( x n + 1 ,   x n + 2 ) d ( x n ,   x n + 1 ) for all n N { 0 } . Consequently, { d ( x n ,   x n + 1 ) } = { d ( T n x 0 ,   T n + 1 x 0 ) } is a monotone decreasing sequence of positive real numbers. By setting
ξ = d ( x 0 ,   T x 0 ) [ d ( T n x 0 ,   T n + 1 x 0 ) ] β [ d ( T n + 1 x 0 ,   T n + 2 x 0 ) ] β .
Proceeding as in Theorem 2, we consider the following distinct cases.
Case (i): If 2 β μ < τ 1 and then by setting φ β = μ δ < 1 . Taking x = x 0 and y = T x 0 in (8), we get
τ 1 [ d ( T x 0 ,   T 2 x 0 ) ] β τ 1 [ d ( T x 0 ,   T 2 x 0 ) ] β + τ 2 [ d ( T 2 x 0 ,   T 3 x 0 ) ] β μ [ d ( x 0 ,   T 2 x 0 ) ] β + [ d ( T x 0 ,   T x 0 ) ] β μ d ( x 0 ,   T x 0 ) + d ( T x 0 ,   T 2 x 0 ) β [ d ( T x 0 ,   T 2 x 0 ) ] β 2 β μ τ 1 ξ β = μ τ 1 2 β ξ β μ δ ξ β = ( φ ξ ) β d ( T x 0 ,   T 2 x 0 ) φ ξ .
Again, taking x = T x 0 and y = T 2 x 0 in (8), we obtain
τ 1 [ d ( T 2 x 0 ,   T 3 x 0 ) ] β τ 1 [ d ( T 2 x 0 ,   T 3 x 0 ) ] β + τ 2 [ d ( T 3 x 0 ,   T 4 x 0 ) ] β μ [ d ( T x 0 ,   T 3 x 0 ) ] β + [ d ( T 2 x 0 ,   T 2 x 0 ) ] β μ d ( T x 0 ,   T 2 x 0 ) + d ( T 2 x 0 ,   T 3 x 0 ) β [ d ( T 2 x 0 ,   T 3 x 0 ) ] β μ τ 1 2 β ( φ ξ ) β μ δ ( φ ξ ) β = ( φ 2 ξ ) β d ( T 2 x 0 ,   T 3 x 0 ) φ 2 ξ .
Similarly, we obtain the following:
d ( T 3 x 0 ,   T 4 x 0 ) φ 3 ξ ,   and d ( T 4 x 0 ,   T 5 x 0 ) φ 4 ξ .
In general, we can conclude that
d ( T n x 0 ,   T n + 1 x 0 ) φ n ξ ,   for all n N { 0 } .
Therefore, d T n x 0 ,   T n + 1 x 0 0 as n + . By following the same approach as in Theorem 2, we can establish that x n forms a R -preserving Cauchy sequence.
Case (ii): When 2 β μ < τ 2 and setting φ β = μ δ < 1 . Taking x = x 0 and y = T x 0 in (8), we have the following:
τ 2 [ d ( T 2 x 0 ,   T 3 x 0 ) ] β τ 1 [ d ( T x 0 ,   T 2 x 0 ) ] β + τ 2 [ d ( T 2 x 0 ,   T 3 x 0 ) ] β μ [ d ( x 0 ,   T 2 x 0 ) ] β + [ d ( T x 0 ,   T x 0 ) ] β [ d ( T 2 x 0 ,   T 3 x 0 ) ] β 2 β μ τ 2 ξ β = μ τ 2 2 β ξ β μ δ ξ β = ( φ ξ ) β d ( T 2 x 0 ,   T 3 x 0 ) φ ξ .
Again, taking x = T x 0 and y = T 2 x 0 in (8), we obtain the following:
τ 2 [ d ( T 3 x 0 ,   T 4 x 0 ) ] β τ 1 [ d ( T 2 x 0 ,   T 3 x 0 ) ] β + τ 2 [ d ( T 3 x 0 ,   T 4 x 0 ) ] β μ [ d ( T x 0 ,   T 3 x 0 ) ] β + [ d ( T 2 x 0 ,   T 2 x 0 ) ] β [ d ( T 3 x 0 ,   T 4 x 0 ) ] β μ τ 2 2 β ξ β μ δ ξ β d ( T 3 x 0 ,   T 4 x 0 ) φ ξ
and also, we get
τ 2 [ d ( T 4 x 0 ,   T 5 x 0 ) ] β τ 1 [ d ( T 3 x 0 ,   T 4 x 0 ) ] β + τ 2 [ d ( T 4 x 0 ,   T 5 x 0 ) ] β μ [ d ( T 2 x 0 ,   T 4 x 0 ) ] β + [ d ( T 3 x 0 ,   T 3 x 0 ) ] β 2 β μ ( φ ξ ) β [ d ( T 4 x 0 ,   T 5 x 0 ) ] β μ τ 2 2 β ( φ ξ ) β μ δ ( φ ξ ) β = ( φ 2 ξ ) β d ( T 4 x 0 ,   T 5 x 0 ) φ 2 ξ .
Similarly, we can get
d ( T 5 x 0 ,   T 6 x 0 ) φ 2 ξ and d ( T 6 x 0 ,   T 7 x 0 ) φ 3 ξ .
Therefore, in general, we can conclude that
d ( T m x 0 ,   T m + 1 x 0 ) φ l ξ ,
whenever m = 2 l or m = 2 l + 1 , it follows that d ( T m x 0 ,   T m + 1 x 0 ) 0 as m .
By applying the same method as in Theorem 2, it can be proven that, in all scenarios, the sequence x n forms a R -preserving Cauchy sequence within X . Given that X is R -complete, there exists a point q X such that x n = T n x 0 q as n + .
In conclusion, using assumption (3), we show that q is a fixed point of T . Assume that T is R -continuous. Since the sequence { x k } is R -preserving and converges to q , the R -continuity of T ensures that x k + 1 = T ( x k ) converges to T ( q ) . Due to the uniqueness of the limit, we deduce that T ( q ) = q , which means that q is a fixed point of T .
One the other hand, let us assume that R is d-self-closed. Since the sequence { x n } is preserved under R and converges to q , there exists a subsequence { x n k } from { x n } such that for every n N , the pair [ x n k ,   q ] lies within R . By invoking assumption (5) and Definition 1(1), we deduce that [ x n k ,   q ] R and x n k q , which leads to the following conclusion:
τ 1 d x n k + 1 ,   T q β τ 1 d x n k + 1 ,   T q β + τ 2 d x n k + 2 ,   T 2 q β = τ 1 d T x n k ,   T q β + τ 2 d T 2 x n k ,   T 2 q β μ d x n k ,   T q β + d q ,   T x n k β = μ d x n k ,   T q β + d q ,   x n k + 1 β .
Taking the limit as n , we obtain
d q ,   T q β μ τ 1 d q ,   T q β μ δ d q ,   T q β 1 μ δ [ d ( q ,   T q ) ] β 0 .
This leads to 1 μ δ [ d ( q ,   T q ) ] β 0 , and consequently, d ( q ,   T q ) = 0 . Therefore, Fix ( T ) . □
To establish the uniqueness of the fixed point for a ( τ ,   β ,   R ) -type Chatterjea contraction mapping, we additionally assume the following condition:
Theorem 7.
If all the conditions of Theorem 6 are satisfied with τ 1 2 μ < 1 , and every pair of elements x ,   y X is comparable under the relation R , then the set of fixed points of T , contains exactly one element.
Proof. 
Let q ,   q * Fix ( T ) . Then [ q ,   q * ] R and so using Definition 1(1) and inequality (6), we get
τ 1 d T q ,   T q * β τ 1 d T q ,   T q * β + τ 2 d T 2 q ,   T 2 q * β μ d q ,   T q * β + d q * ,   T q β τ 1 2 μ d q ,   q * β 0 .
This implies that d q ,   q * = 0 . Consequently, Fix ( T ) must consist of a single point. □
By considering the binary relation R on X as R = X 2 in Theorem 7, we can deduce the following result.
Corollary 3.
Let ( X ,   d ) be a complete metric space, and T : X X be a ( τ ,   β ) -type Chatterjea contraction mapping with constant μ < δ = 1 2 p min { τ 1 ,   τ 2 } . Then, T has a unique fixed point.
Example 7.
Let X = [ 0 ,   1 ] with the usual metric d ( x ,   y ) = | x y | and binary relation R = { ( x ,   y ) X 2 : x [ 0 ,   1 2 ] & y [ 0 ,   1 ] } . Define T : X X as T ( x ) = x 2 5 , for all x X . Then, we obtain T 2 ( x ) = x 4 125 .
Note that there exists 1 2 X such that 1 2 ,   T 1 2 = 1 2 ,   1 20 R . Moreover, whenever ( x ,   y ) R , it follows that ( T x ,   T y ) R as T [ 0 ,   1 2 ] [ 0 ,   1 2 ] and T [ 0 ,   1 ] [ 0 ,   1 ] . This demonstrates that the binary relation R is T -closed.
Next, for every ( x ,   y ) R , we have
| T ( x ) T ( y ) | = 1 5 | x 2 y 2 | = x + y 5 | x y | 3 10 | x y |
and
| T 2 ( x ) T 2 ( y ) | = x 4 125 y 4 125 = ( x 2 + y 2 ) ( x + y ) 125 | x y | 3 200 | x y | .
It can be also seen that for ( x ,   y ) R , that is x [ 0 ,   1 2 ] and y [ 0 ,   1 ] , we have 1 5 ( x + y + 5 ) 1 with
| x y | 1 5 ( x + y + 5 ) ( x y ) = 1 5 ( x 2 y 2 ) + ( x y ) = 1 5 x 2 y + x 1 5 y 2 1 5 x 2 y 2 + x 1 5 y 2 .
By taking β = 1 and τ = ( τ 1 ,   τ 2 ) = ( 1 2 ,   1 2 ) , we get
τ 1 | T ( x ) T ( y ) | β + τ 2 | T 2 ( x ) T 2 ( y ) | β 1 2 3 10 + 3 200 | x y | 63 400 | x T ( y ) | β + | y T ( x ) | β .
Hence, for all ( x ,   y ) R , we conclude that inequality (8) holds with μ = 63 400 = 0.1575 < δ = 1 2 min { τ 1 ,   τ 2 } = 1 4 = 0.25 .
This demonstrates that T is a ( τ ,   1 ,   R ) -type symmetric Chatterjea contraction mapping with a multi-index τ of length k = 2 . Therefore, all the conditions of Theorem 6 are satisfied, and thus, Fix ( T ) . Furthermore, it is evident that every pair of elements in X is comparable. Therefore, by Theorem 7, the set Fix ( T ) contains exactly one element.

4. Application to Nonlinear Fredholm Integral Equations

In this section, we utilize the results obtained earlier to establish the existence of a solution for a nonlinear Fredholm integral equation.
Let X : = { f : [ r ,   e ] R f is continuous } , and d be a metric on X defined by d ( x ,   y ) = | x y | = sup t [ r ,   e ] | x ( t ) y ( t ) | for all x ,   y X . Then, ( X ,   d ) is a complete metric space. We now consider the following nonlinear Fredholm integral equation
x ( t ) = f ( t ) + β r e ( t ,   h ,   x ( h ) ) d h
where t ,   h [ r ,   e ] and β is a constant. Assume that : [ r ,   e ] × [ r ,   e ] × X R and f : [ r ,   e ] R are continuous functions, where ( t ,   h ,   x ( h ) ) is the kernel of the equation and f is a given function.
We also define a binary relation R over X as R : = { ( x ,   y ) X 2 : x ( t ) y ( t ) for all t [ r ,   e ] } .
Theorem 8.
Consider ( X ,   d ) to be a metric space with binary relation R as defined above. Let T : X X be a nonlinear operator, defined for all t [ r ,   e ] by
T x ( t ) = f ( t ) + β r e ( t ,   h ,   x ( h ) ) d h
for all x X . Assume that the following conditions are satisfied:
1. 
there exist μ ,   τ ( 0 ,   1 ) , and β 1 such that μ < δ = min { τ ,   1 τ } and
τ | ( t ,   h ,   x ( h ) ) ( t ,   h ,   y ( h ) ) | β + ( 1 τ ) | ( t ,   h ,   T x ( h ) ) ( t ,   h ,   T y ( h ) ) | β η ( t ,   h ) | x ( h ) y ( h ) | β f o r a l l ( x ,   y ) R ;
2. 
where η : [ r ,   e ] × [ r ,   e ] R is a continuous function satisfying
sup t [ r ,   e ] r e η ( t ,   h ) d h μ β β ( e r ) β 1 .
Then, the Fredholm integral Equation (11) has a unique solution.
Proof. 
It is evident that X is a complete space, and by applying the definition of the binary relation R and the nonlinear operator T , it is straightforward to conclude that R T . Furthermore, the binary relation R is T -closed.
Next, we show that T is a ( τ ,   β ,   R ) -type symmetric contraction mapping of multi-index τ of length k = 2 for β 1 . It can be shown that T satisfies Equation (8) for β = 1 . Next, we demonstrate that T also satisfies Equation (6) for β > 1 . Given that β > 1 , there exists w > 1 such that 1 w + 1 β = 1 . Then, by applying Hölder’s inequality, for all ( x ,   y ) R , we obtain
τ | T x ( t ) T y ( t ) | β + ( 1 τ ) T 2 x ( t ) T 2 y ( t ) β = τ β β r e ( t ,   h ,   x ( h ) ) d h r e ( t ,   h ,   y ( h ) ) d h β + ( 1 τ ) β β r e ( t ,   h ,   T x ( h ) ) d h r e ( t ,   h ,   T y ( h ) ) d h β τ β β r e ( t ,   h ,   x ( h ) ) ( t ,   h ,   y ( h ) ) d h β + ( 1 τ ) β β r e ( t ,   h ,   T x ( h ) ) ( t ,   h ,   T y ( h ) ) d h β τ β β r e 1 w d h 1 w r e ( t ,   h ,   x ( h ) ) ( t ,   h ,   y ( h ) ) β d h 1 β β + ( 1 τ ) β β r e 1 w d h 1 w r e ( t ,   h ,   T x ( h ) ) ( t ,   h ,   T y ( h ) ) β d h 1 β β τ β β ( e r ) β w r e ( t ,   h ,   x ( h ) ) ( t ,   h ,   y ( h ) ) β d h + ( 1 τ ) β β ( e r ) β w r e ( t ,   h ,   T x ( h ) ) ( t ,   h ,   T y ( h ) ) β d h = ( e r ) β 1 β β r e τ ( t ,   h ,   x ( h ) ) ( t ,   h ,   y ( h ) ) β + ( 1 τ ) ( t ,   h ,   T x ( h ) ) ( t ,   h ,   T y ( h ) ) β d h ( e r ) β 1 β β r e η ( t ,   h ) | x ( h ) y ( h ) | β d h .
By taking the supremum on both sides of the inequality over the interval [ r ,   e ] , we get:
τ d ( T x ,   T y ) β + ( 1 τ ) d ( T 2 x ,   T 2 y ) β = sup t [ r ,   e ] τ | T x ( t ) T y ( t ) | β + ( 1 τ ) T 2 x ( t ) T 2 y ( t ) β ( e r ) β 1 β β sup t [ r ,   e ] r e η ( t ,   u ) d u d ( x ,   y ) β μ d ( x ,   y ) β
where μ < δ = min { τ ,   1 τ } . This demonstrates that T satisfies the inequality (6), meaning that T is a ( τ ,   β ,   R ) -type symmetric contraction mapping with a multi-index τ of length k = 2 . Therefore, all the conditions of Theorems 2 and 3 are met, implying that the integral operator T defined by (11) possesses a unique solution in X . □
Example 8.
Let r = 0 and e = 1 , and consider the nonlinear Fredholm integral equation
x ( t ) = t 2 + 1 2 0 1 t h x ( h ) d h f o r a l l t [ 0 ,   1 ] .
Let X = { f : [ 0 ,   1 ] R f is continuous } ,   endowed with the metric d ( x ,   y ) = sup t [ 0 , 1 ] | x ( t ) y ( t ) | for all x ,   y X . Then ( X ,   d ) is a complete metric space. Define the kernel ( t ,   h ,   z ) = t h z f o r a l l t ,   h [ 0 ,   1 ] ,   & z X together with f ( t ) = t 2 f o r a l l t [ 0 ,   1 ] ,   and let β = 1 . The associated integral operator T : X X is given by
( T x ) ( t ) = t 2 + 1 2 0 1 t h x ( h ) d h f o r a l l t [ 0 ,   1 ] ,  
for all x X . Define the binary relation:
R = { ( x ,   y ) X 2 : x ( t ) y ( t ) f o r a l l t [ 0 ,   1 ] } .
We now verify that the kernel satisfies the contractive condition required in Theorem 8. Fix τ = 1 2 and β = 1 . For all ( x ,   y ) R and for all t ,   h [ 0 ,   1 ] , we have
τ | ( t ,   h ,   x ( h ) ) ( t ,   h ,   y ( h ) ) | + ( 1 τ ) | ( t ,   h ,   T x ( h ) ) ( t ,   h ,   T y ( h ) ) | = 1 2 t h | x ( h ) y ( h ) | + 1 2 t h | T x ( h ) T y ( h ) | 1 2 t h | x ( h ) y ( h ) | .
Thus, condition (1) holds with η ( t ,   h ) = 1 2 t h for all t ,   h [ 0 ,   1 ] . Moreover, for condition (2), we have
sup t [ 0 , 1 ] 0 1 η ( t ,   h ) d h = sup t [ 0 , 1 ] t 4 = 1 4 .
Choose μ = 1 4 . Then
sup t [ 0 , 1 ] 0 1 η ( t ,   h ) d h = 1 4 μ β β ( e r ) β 1 = 1 4 ,  
and
μ = 1 4 < δ = min { τ ,   1 τ } = 1 2 .
Hence, all assumptions of Theorem 8 are satisfied; consequently, problem (13) has a unique solution.

5. Application to Economic Growth Modeling via Fractional Differential Equations

Fractional differential equations (FDEs) have emerged as powerful tools in modern applied mathematics, particularly due to their capability to incorporate memory and hereditary properties into dynamical systems. In economic contexts, such memory effects are crucial, as past investments, policy decisions, or shocks can influence current economic outcomes. Caputo-type derivatives, which enable the formulation of initial conditions in the same form as classical differential equations, are particularly suited to modeling economic growth trajectories over time.
We consider the following nonlinear fractional differential equation of Caputo type:
D t e C ( q ( t ) ) = b ( t ,   q ( t ) ) , ( 0 < t < 1 ,   1 < e 2 ) ,
with boundary conditions:
q ( 0 ) = 0 , I t e R L q ( 1 ) = q ( 0 ) ,
where D t e C denotes the Caputo derivative of order e, defined as follows:
D t e C b ( t ) = 1 Γ ( k e ) 0 t ( t ψ ) k e 1 b ( k ) ( ψ ) d ψ ,
with k 1 < e < k , where k = [ e ] + 1 , the function b : [ 0 ,   1 ] × R [ 0 ,   + ) is continuous. The Riemann–Liouville fractional integral of a continuous function f is defined as follows:
I t e R L f ( t ) = 1 Γ ( e ) 0 t ( t ψ ) e 1 f ( ψ ) d ψ .
The economic variable q ( t ) can represent the gross domestic product (GDP ) or any indicator reflecting economic performance. The nonlinear kernel b ( t ,   q ( t ) ) embodies the influences of key economic drivers such as education, investment, and policy. The fractional order e captures memory-dependent dynamics, acknowledging that current economic states are shaped by past behavior.
Define an operator T : X X by:
T x ( t ) : = 1 Γ ( e ) 0 t ( t ψ ) e 1 b ( ψ ,   x ( ψ ) ) d ψ + 2 t Γ ( e ) 0 1 0 ψ ( ψ l ) e 1 b ( l ,   x ( l ) ) d l d ψ .
Notice that the solution of the fractional differential Equation (14) is precisely the fixed point of the operator T . That is, a function q X satisfies the boundary value problem if and only if it fulfills the operator equation:
T q = q .
Hence, solving the fractional model reduces to identifying the fixed point of the operator T within the complete metric space ( X ,   d ) .
Let X : = { ψ : [ 0 ,   1 ] R ψ is continuous } be equipped with the uniform norm ϕ = max ψ [ 0 , 1 ] | ϕ ( ψ ) | . Then ( X ,   · ) is a complete metric space, where the metric is induced by the norm
d ( ϕ 1 ,   ϕ 2 ) = ϕ 1 ϕ 2 for all ϕ 1 ,   ϕ 2 X .
Define a binary relation R X × X by the following:
R : = ( x ,   y ) X 2 x ( t ) y ( t ) ,   for all t [ 0 ,   1 ] .
Theorem 9.
Consider the nonlinear fractional differential Equation (14). Suppose the following conditions are satisfied:
1. 
For constants τ ( 0 ,   1 ) ,   β 1 , and a continuous function η : [ 0 ,   1 ] 2 R + , the inequality
τ b ( ψ ,   x ( ψ ) ) b ( ψ ,   y ( ψ ) ) β + ( 1 τ ) b ( ψ ,   T x ( ψ ) ) b ( ψ ,   T y ( ψ ) ) β η ( t ,   ψ ) | x ( ψ ) y ( ψ ) | β
holds for all ( x ,   y ) R .
2. 
There exists μ > 0 , such that
sup t [ 0 , 1 ] 0 1 η ( t ,   ψ ) d ψ μ 2 Γ ( e ) β ,   μ < min { τ ,   1 τ } .
Then Equation (14) has a unique solution.
Proof. 
By taking the binary relation R and the self-mapping T as given above, it is clear that the binary relation R is T -closed, T is continuous, and the set R T is also nonempty; that is, there exists some z X such that ( z ,   T z ) R .
Next, we show that T is a ( τ ,   1 τ ,   R ) -type symmetric contraction mapping, that is, for all ( x ,   y ) R , we have
τ d ( T x ,   T y ) β + ( 1 τ ) d ( T 2 x ,   T 2 y ) β μ d ( x ,   y ) β .
We begin from the left-hand side. For any pair ( x ,   y ) R and fixed t [ 0 ,   1 ] , define the following:
I ( t ) : = τ | T x ( t ) T y ( t ) | β + ( 1 τ ) | T 2 x ( t ) T 2 y ( t ) | β .
From the definition of T , we write the following:
T x ( t ) T y ( t ) = 1 Γ ( e ) 0 t ( t ψ ) e 1 [ b ( ψ ,   x ( ψ ) ) b ( ψ ,   y ( ψ ) ) ] d ψ + 2 t Γ ( e ) 0 1 0 ψ ( ψ l ) e 1 [ b ( l ,   x ( l ) ) b ( l ,   y ( l ) ) ] d l d ψ .
We now estimate each term using the triangle inequality to get
| T x ( t ) T y ( t ) | 1 Γ ( e ) 0 t ( t ψ ) e 1 | b ( ψ ,   x ( ψ ) ) b ( ψ ,   y ( ψ ) ) | d ψ + 2 t Γ ( e ) 0 1 0 ψ ( ψ l ) e 1 | b ( l ,   x ( l ) ) b ( l ,   y ( l ) ) | d l d ψ .
Now, applying Hölder’s inequality (with exponents p = 1 , q = 1 for simplicity since all terms are nonnegative and the integral bounds are finite), we raise both sides to the power β and apply ( a + b ) β 2 β 1 ( a β + b β ) ,   for a ,   b 0 ,   β 1 . Thus,
| T x ( t ) T y ( t ) | β 2 β 1 1 Γ ( e ) 0 t ( t ψ ) e 1 | b ( ψ ,   x ( ψ ) ) b ( ψ ,   y ( ψ ) ) | d ψ β + 2 t Γ ( e ) 0 1 0 ψ ( ψ l ) e 1 | b ( l ,   x ( l ) ) b ( l ,   y ( l ) ) | d l d ψ β .
A similar estimate holds for | T 2 x ( t ) T 2 y ( t ) | β with x ,   y replaced by T x ,   T y inside b . Now, apply assumption (1) to each kernel difference:
I ( t ) 2 Γ ( e ) β 0 1 η ( t ,   ψ ) | x ( ψ ) y ( ψ ) | β d ψ .
Taking the supremum over t [ 0 ,   1 ] gives:
τ [ d ( T x ,   T y ) ] β + ( 1 τ ) [ d ( T 2 x ,   T 2 y ) ] β = sup t [ 0 , 1 ] I ( t ) 2 Γ ( e ) β sup t [ 0 , 1 ] 0 1 η ( t ,   ψ ) | x ( ψ ) y ( ψ ) | β d ψ .
Finally, by assumption (2), we obtain
sup t [ 0 , 1 ] 0 1 η ( t ,   ψ ) d ψ μ 2 Γ ( e ) β ,
which yields
τ [ d ( T x ,   T y ) ] β + ( 1 τ ) [ d ( T 2 x ,   T 2 y ) ] β μ [ d ( x ,   y ) ] β .
Hence, all assumptions of Theorem 2 are satisfied. Therefore, the operator T admits a fixed point in X . Moreover, since any two elements of the space X are R -comparable, it follows from Theorem 3 that the set of fixed points is a singleton. Equivalently, the fractional differential Equation (14) has a unique solution. □
Example 9.
Consider the nonlinear fractional differential equation of Caputo type
D t e C q ( t ) = b ( t ,   q ( t ) ) f o r a l l t ( 0 ,   1 ) ,   1 < e 2 ,  
subject to the boundary conditions q ( 0 ) = 0 ,   I t e R L q ( 1 ) = q ( 0 ) . Let the nonlinear term be defined by b ( t ,   q ) = 1 4 q f o r a l l t [ 0 ,   1 ] ,   q R . Clearly, the function b : [ 0 ,   1 ] × R [ 0 ,   ) is continuous. Let X = { ψ : [ 0 ,   1 ] R ψ is continuous} be endowed with the usual metric and define the binary relation as R = { ( x ,   y ) X 2 : x ( t ) y ( t ) f o r a l l t [ 0 ,   1 ] } . Define the operator T : X X by
( T x ) ( t ) = 1 Γ ( e ) 0 t ( t ψ ) e 1 1 4 x ( ψ ) d ψ f o r a l l t [ 0 ,   1 ] .
Fix the constants β = 1 ,   and τ = 1 2 . Then, for any ( x ,   y ) R and ψ [ 0 ,   1 ] , we have
| b ( ψ ,   x ( ψ ) ) b ( ψ ,   y ( ψ ) ) | = 1 4 | x ( ψ ) y ( ψ ) | 1 4 d ( x ,   y ) .
Moreover, for all ( x ,   y ) R and ψ [ 0 ,   1 ] , we have
| b ( ψ ,   T x ( ψ ) ) b ( ψ ,   T y ( ψ ) ) | 1 4 T x T y 1 4 Γ ( e + 1 ) d ( x ,   y ) .
Hence,
τ | b ( ψ ,   x ( ψ ) ) b ( ψ ,   y ( ψ ) ) | + ( 1 τ ) | b ( ψ ,   T x ( ψ ) ) b ( ψ ,   T y ( ψ ) ) | 1 8 + 1 32 Γ ( e + 1 ) d ( x ,   y ) .
Define η ( t ,   ψ ) = 1 8 + 1 32 Γ ( e + 1 ) f o r a l l t ,   ψ [ 0 ,   1 ] . Then η is continuous and sup t [ 0 , 1 ] 0 1 η ( t ,   ψ ) d ψ = 1 8 + 1 32 Γ ( e + 1 ) . Choose μ = 1 5 . Since 1 8 + 1 32 Γ ( e + 1 ) < μ 2 Γ ( e ) ,   and μ < min { τ ,   1 τ } = 1 2 ,   all the hypotheses of Theorem 9 are satisfied. Therefore, the operator T admits a unique fixed point in X . Consequently, the nonlinear fractional boundary value problem (19) has a unique continuous solution on [ 0 ,   1 ] .

6. Conclusions and Future Directions

In this study, we explore the existence and uniqueness of solutions for fractional differential equations using a class of generalized symmetric operators. Our findings highlight that this approach provides a meaningful and effective way to analyze systems with memory-dependent dynamics. This work also introduces and analyzes generalized classes of mappings, including ( τ ,   β ,   R ) -type symmetric Lipschitz mappings, ( τ ,   β ,   R ) -type symmetric Kannan contractions, and ( τ ,   β ,   R ) -type symmetric Chatterjea contractions, within the context of metric spaces connected with any binary relation. By enhancing the classical Lipschitz condition, we develop a comprehensive framework that broadens the scope of traditional fixed point results. Our approach also explores the impact of symmetric and comparable relations, providing new fixed point theorems and applying these findings to prove the existence of solutions to Fredholm integral equations. The provided examples demonstrate the practical applicability and importance of our results.
A numerical investigation of the proposed results would be a valuable extension of this work and could further enrich the theoretical analysis. Another promising direction for future research is the development of algorithms based on the newly defined contraction mappings, leading to convergence results via suitable iterative schemes. Moreover, it is interesting to consider interpolative-type contractive conditions involving Kannan, Chatterjea, or other interpolative contractions introduced by Karapınar, Aydi, and other authors [30,31,32], by incorporating them into the present relation-theoretic and multi-index setting. Such an investigation may yield new fixed-point results that unify interpolative contractions with the generalized contractive conditions developed in this work.

Author Contributions

Conceptualization, M.W., M.D., and M.Z.; methodology, M.W., M.D., and M.Z.; software, M.W., M.D., and M.Z.; validation, M.W., M.D., and M.Z.; formal analysis, M.W., M.D., and M.Z.; investigation, M.W., M.D., and M.Z.; resources, M.W., M.D., and M.Z.; data curation, M.W., M.D., and M.Z.; writing—original draft preparation, M.W., M.D., and M.Z.; writing—review and editing, M.W., M.D., and M.Z.; visualization, M.W., M.D., and M.Z.; supervision, M.W., M.D., and M.Z.; project administration, M.W., M.D., and M.Z.; funding acquisition, M.W., M.D., and M.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research is partially supported by Sanya City Science and Technology Innovation Special Project (Grant No. 2022KJCX22); Scientific Research Foundation of Hainan Tropical Ocean University (Grant No. RHDRCZK202521).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  2. Edelstein, M. On fixed and periodic points under contractive mappings. J. Lond. Math. Soc. 1962, 1, 74–79. [Google Scholar] [CrossRef]
  3. Rakotch, E. A note on contractive mappings. Proc. Am. Math. Soc. 1962, 13, 459–465. [Google Scholar] [CrossRef]
  4. Boyd, D.W.; Wong, J.S. On nonlinear contractions. Proc. Am. Math. Soc. 1969, 20, 458–464. [Google Scholar] [CrossRef]
  5. Meir, A.; Keeler, E. A theorem on contraction mappings. J. Math. Anal. Appl. 1969, 28, 326–329. [Google Scholar] [CrossRef]
  6. Reich, S. Some remarks concerning contraction mappings. Can. Math. Bull. 1971, 14, 121–124. [Google Scholar] [CrossRef]
  7. Matkowski, J. Fixed point theorems for mappings with a contractive iterate at a point. Proc. Am. Math. Soc. 1977, 62, 344–348. [Google Scholar] [CrossRef]
  8. Nadler, S.B. Multivalued contraction mappings. Pac. J. Math. 1969, 30, 475–488. [Google Scholar] [CrossRef]
  9. Joshi, M.C.; Bose, R.K. Some Topics in Nonlinear Functional Analysis, 1st ed.; Wiley Eastern Limited: Hoboken, NJ, USA, 1985. [Google Scholar]
  10. Almezel, S.; Ansari, Q.H.; Khamsi, M.A. (Eds.) Topics in Fixed Point Theory; Springer: Berlin/Heidelberg, Germany, 2014; Volume 5. [Google Scholar]
  11. Hammad, H.A.; De La Sen, M. A tripled fixed point technique for solving a tripled-system of integral equations and Markov process in CCbMS. Adv. Differ. Equ. 2020, 2020, 567. [Google Scholar] [CrossRef]
  12. Hammad, H.A.; De la Sen, M. Analytical solution of Urysohn integral equations by fixed point technique in complex valued metric spaces. Mathematics 2019, 7, 852. [Google Scholar] [CrossRef]
  13. Kannan, R. Some results on fixed points. Bull. Calcutta Math. Soc. 1968, 60, 71–76. [Google Scholar]
  14. Chatterjea, S.K. Fixed-point theorems. Dokl. Bolg. Akad. Nauk. 1972, 25, 727–730. [Google Scholar] [CrossRef]
  15. Alam, A.; Imdad, M. Relation-theoretic contraction principle. J. Fixed Point Theory Appl. 2015, 17, 693–702. [Google Scholar] [CrossRef]
  16. Din, F.U.; Din, M.; Ishtiaq, U.; Sessa, S. Perov fixed-point results on F-contraction mappings equipped with binary relation. Mathematics 2023, 11, 238. [Google Scholar] [CrossRef]
  17. Almalki, Y.; Din, F.U.; Din, M.; Ali, M.U.; Jan, N. Perov-fixed point theorems on a metric space equipped with ordered theoretic relation. Aims Math. 2022, 11, 20199–20212. [Google Scholar] [CrossRef]
  18. Goebel, K.; Japon-Pineda, M. A new type of nonexpansiveness. In Proceedings of the 8th International Conference on Fixed Point Theory and Applications, Chiang Mai, Thailand, 16–22 July 2007; Volume 1200. [Google Scholar]
  19. Goebel, K.; Sims, B. Mean Lipschitzian mappings. Contemp. Math. 2010, 513, 157–167. [Google Scholar] [CrossRef]
  20. Asem, V.; Singh, Y.M.; Khan, M.S.; Sessa, S. On (τ, p)-cyclic contractions and related fixed point theorems. Symmetry 2023, 15, 1826. [Google Scholar] [CrossRef]
  21. Lipschutz, S. Set Theory and Related Topics; McGraw-Hill: Columbus, OH, USA, 1964. [Google Scholar]
  22. Maddux, R.D. Relation Algebras; Studies in Logic and the Foundations of Mathematics; Elsevier B.V.: Amsterdam, The Netherlands, 2006; Volume 150. [Google Scholar]
  23. Alam, A.; George, R.; Imdad, M. Refinements to relation-theoretic contraction principle. Axioms 2022, 11, 316. [Google Scholar] [CrossRef]
  24. Samet, B.; Turinici, M. Fixed point theorems on a metric space endowed with an arbitrary binary relation and applications. Commun. Math. Anal. 2012, 13, 82–97. [Google Scholar]
  25. Kolman, B.; Busby, R.C.; Ross, S. Discrete Mathematical Structures, 4th ed.; Prentice Hall.: Englewood Cliffs, NJ, USA, 1995. [Google Scholar]
  26. Din, F.U.; Alshaikey, S.; Ishtiaq, U.; Din, M.; Sessa, S. Single and multi-valued ordered-theoretic Perov fixed-point results for θ-contraction with application to nonlinear system of matrix equations. Mathematics 2024, 12, 1302. [Google Scholar] [CrossRef]
  27. Alam, A.; Imdad, M. onlinear contractions in metric spaces under locally T-transitive binary relations. arXiv 2015, arXiv:1512.00348. [Google Scholar]
  28. Shukla, S.; Radenović, S. Prešić-Boyd-Wong type results in ordered metric spaces. Int. J. Nonlinear Sci. Anal. Appl. 2014, 5, 154–166. [Google Scholar]
  29. Khan, M.S.; Singh, Y.M.; Maniu, G.; Postolache, M. On (τ, p)-convex contraction and asymptotic regularity. J. Math. Comput. Sci. 2018, 18, 132–145. [Google Scholar] [CrossRef]
  30. Karapinar, E. Revisiting the Kannan type contractions via interpolation. Adv. Theory Nonlinear Anal. Its Appl. 2018, 2, 85–87. [Google Scholar] [CrossRef]
  31. Karapinar, E.; Agarwal, R.; Aydi, H. Interpolative Reich–Rus–Ćirić type contractions on partial metric spaces. Mathematics 2018, 6, 256. [Google Scholar] [CrossRef]
  32. Karapınar, E.; Alqahtani, O.; Aydi, H. On interpolative Hardy-Rogers type contractions. Symmetry 2018, 11, 8. [Google Scholar] [CrossRef]
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

Wang, M.; Din, M.; Zhou, M. A Unified Framework for Generalized Symmetric Contractions and Economic Dynamics via Fractional Differential Equations. Fractal Fract. 2026, 10, 22. https://doi.org/10.3390/fractalfract10010022

AMA Style

Wang M, Din M, Zhou M. A Unified Framework for Generalized Symmetric Contractions and Economic Dynamics via Fractional Differential Equations. Fractal and Fractional. 2026; 10(1):22. https://doi.org/10.3390/fractalfract10010022

Chicago/Turabian Style

Wang, Min, Muhammad Din, and Mi Zhou. 2026. "A Unified Framework for Generalized Symmetric Contractions and Economic Dynamics via Fractional Differential Equations" Fractal and Fractional 10, no. 1: 22. https://doi.org/10.3390/fractalfract10010022

APA Style

Wang, M., Din, M., & Zhou, M. (2026). A Unified Framework for Generalized Symmetric Contractions and Economic Dynamics via Fractional Differential Equations. Fractal and Fractional, 10(1), 22. https://doi.org/10.3390/fractalfract10010022

Article Metrics

Back to TopTop