Skip to Content
MathematicsMathematics
  • Article
  • Open Access

6 August 2026

17 Pages

Asymmetric Cross-Iterate Ćirić–Reich–Rus Contraction: Existence, Uniqueness, and Comparative Analysis

,
and
1
“Vinča” Institute of Nuclear Sciences—National Institute of the Republic of Serbia, University of Belgrade, 11351 Belgrade, Serbia
2
Laboratory of Fundamental and Applied Mathematics, University of Oran 1, Ahmed Ben Bella, Es-Senia 31000, Algeria
3
Department of Sciences and Technology, Institute of Sciences, Nour-Bachir El-Bayadh University Center, El-Bayadh 32000, Algeria
4
Department of Mathematics and Statistics, College of Science, King Faisal University, Al Ahsa 31982, Saudi Arabia

Abstract

We introduce a novel generalization of the classical Ćirić–Reich–Rus (CRR) contraction, termed the Asymmetric Cross-Iterate CRR (ACI-CRR). The contraction condition involves distinct iterate orders p ≠ q in an asymmetric cross-coupled form. We establish the existence and uniqueness of a fixed point under the assumption of continuity. We then analyze the symmetric case p = q , demonstrating that continuity is indispensable for p > 1 , and contrast this with the classical p = q = 1 case where continuity is unnecessary. We conclude with a structural example and a conjecture regarding the necessity of continuity in higher-iterate asymmetric contractions.

1. Introduction

Fixed-point theory stands as one of the fundamental pillars of modern mathematical analysis, playing a pivotal role in studying the existence and stability of solutions for a wide range of differential, integral, and partial differential equations. Since Banach [1] introduced his celebrated principle in 1922, which states that every contraction mapping on a complete metric space possesses a unique fixed point, the theory has undergone remarkable development over the decades. Numerous mathematicians have contributed to extending the scope of this principle to encompass broader classes of mappings, among them Ćirić [2], Reich [3], and Rus [4], who introduced a significant generalization now known as the Ćirić–Reich–Rus (CRR) contraction, which incorporates additional terms involving images of the points themselves.
In this context, this research paper aims to introduce an innovative generalization of the classical CRR contraction concept, which we designate as the “Asymmetric Cross-Iterate Ćirić–Reich–Rus contraction” (ACI-CRR). This novel generalization is characterized by a contraction condition that relies on distinct iterative orders p ≠ q in an asymmetric cross-coupled form, thereby breaking the traditional symmetry and introducing directional dependence in the contraction mechanism. This innovation enables the modeling of systems with multi-level memory, distributed delays, and hierarchical feedback—phenomena commonly encountered in numerous scientific and engineering applications.
The paper systematically investigates this new class of contractions. First, we establish the existence and uniqueness of the fixed point under the assumption of continuity of the mapping T when p ≠ q (Theorem 1). We then analyze the symmetric case p = q , demonstrating that continuity is indispensable when p > 1 , while it can be dispensed with in the classical case p = q = 1 (Theorem 2). This subtle distinction reveals a significant structural threshold in the theory of higher-iterate contractions.
Furthermore, we provide a Ulam–Hyers stability analysis [5,6,7] for this new framework (Theorem 3), with an explicit computation of the stability constant that depends on the iteration depths p and q, illustrating how stability deteriorates linearly with the iterative depth q and the weight c.
Additionally, we strengthen the theoretical foundations of the proposed framework by embedding it within the general theory of retraction–displacement conditions [8]. This approach provides a unified and elegant proof of Ulam–Hyers stability, establishes Tykhonov well-posedness of the fixed-point problem, and offers deep insight into the structural role of continuity in higher-iterate contractions. Specifically, we demonstrate that the retraction–displacement condition holds for the ACI-CRR contraction in both the classical symmetric case p = q = 1 (without any continuity assumption) and the asymmetric/higher-iterate case under continuity and the strengthened condition a + b p + c q < 1 . This analysis not only confirms the Ulam–Hyers stability results obtained in Section 5 but also reveals why continuity is indispensable when p , q > 1 or p ≠ q , while being unnecessary in the classical setting p = q = 1 .
A comparative analysis between the Ulam–Hyers stability and retraction–displacement approaches is also provided, highlighting their complementary roles and the relative sharpness of their respective stability constants.
We also apply the theoretical results to integral equations of Volterra, Hammerstein, and perturbed types (Theorems 5–7), demonstrating the practical importance of the proposed framework.
We conclude the study with a comparative analysis highlighting the advantages of the new framework relative to the classical and symmetric cases, accompanied by a structural example illustrating the ability of asymmetric contraction to enforce strong contraction even in the presence of discontinuous mappings. Finally, we propose a conjecture (Section 10) regarding the necessity of continuity in the case p ≠ q without continuity, opening new avenues for research into weakened continuity conditions.
The paper is organized as follows: Section 2 presents the fundamental definitions and preliminaries. Section 3 addresses the first main result concerning existence and uniqueness of the fixed point with continuity. Section 4 discusses the symmetric case p = q and establishes the necessity of continuity. Section 5 is devoted to the Ulam–Hyers stability analysis. Section 6 presents a retraction–displacement analysis of the ACI-CRR framework, establishing Tykhonov well-posedness and providing deeper insight into the role of continuity, along with a comparative analysis between the two stability approaches. Section 7 presents applications to integral equations. Section 8 discusses the theoretical implications and advantages of the new framework. Section 9 presents a comparative example, while Section 10 presents a conjecture. Section 11 concludes with findings and future research directions.

2. Preliminaries

Let ( X , d ) be a metric space and T : X → X a self-mapping. The classical Ćirić–Reich–Rus theorem [2,3,4,9,10] extends the Banach contraction principle [1] by incorporating terms involving the images of the points themselves. In this work, we propose a strictly more general framework where the contraction condition couples the points with different iterate orders in an asymmetric manner.
Definition 1  
(Asymmetric Cross-Iterate CRR Contraction). A mapping T : X → X is called an Asymmetric Cross-Iterate Ćirić–Reich–Rus (ACI-CRR) contraction if there exist constants a , b , c ≥ 0 with a + b + c < 1 , and integers p , q ≥ 1 with p ≠ q , such that for all x , y ∈ X ,
d ( T x , T y ) ≤ a d ( x , y ) + b d ( x , T p y ) + c d ( y , T q x ) ,
where T k denotes the k-fold composition of T.
The asymmetry p ≠ q breaks the reciprocal iterate coupling found in standard generalizations and introduces directional dependence in the contraction mechanism.

3. Main Result I: Existence and Uniqueness with Continuity ( p ≠ q )

When the mapping T is assumed to be continuous, the verification of the fixed-point property becomes direct, as the limit of the Picard sequence commutes with T.
Theorem 1.  
Let ( X , d ) be a complete metric space and T : X → X a continuous ACI-CRR contraction with p ≠ q . Then T possesses a unique fixed point z ∈ X . Moreover, for any x 0 ∈ X , the Picard iteration sequence x n + 1 = T x n converges to z.
Proof. 
Step 1: Uniqueness
Assume u , v ∈ X are fixed points. Substituting them into (1) yields
d ( u , v ) ≤ a d ( u , v ) + b d ( u , T p v ) + c d ( v , T q u ) = ( a + b + c ) d ( u , v ) .
Given a + b + c < 1 , we must have d ( u , v ) = 0 ; hence u = v .
  • Step 2: Cauchyness of the Picard Sequence
Fix x 0 ∈ X and define x n + 1 = T x n . Let
D = lim sup n , m → ∞ d ( x n , x m ) .
We will show that D = 0 , which implies that D is finite. Applying (1) to ( x n , x m ) gives
d ( x n + 1 , x m + 1 ) ≤ a d ( x n , x m ) + b d ( x n , x m + p ) + c d ( x m , x n + q ) .
Taking lim sup n , m → ∞ and using the shift invariance of lim sup for sequences in metric spaces yields
D ≤ ( a + b + c ) D .
Since a + b + c < 1 , this inequality forces D = 0 . Thus D is finite. Consequently, { x n } is Cauchy and converges to some z ∈ X .
  • Step 3: Verification that z is a Fixed Point
Since x n → z and T is continuous, T x n → T z . But T x n = x n + 1 → z . By uniqueness of limits in metric spaces, T z = z . □

4. Main Result II: The Symmetric Case p = q Without Continuity

When p = q , the cross-terms are symmetric. However, as identified in the analysis of higher-iterate contractions, continuity is strictly necessary for p > 1 to guarantee T z = z . The only case where continuity can be dropped is the classical baseline p = q = 1 . We present both to highlight the structural threshold.
Theorem 2 recalls the classical Ciric–Reich–Rus theorem (with p = q = 1 ) [2,3,4], which is included here to establish a baseline for comparison with the higher-iterate and asymmetric cases, and to highlight the structural threshold at which continuity becomes essential.
Theorem 2.  
Let ( X , d ) be complete and T : X → X satisfy
d ( T x , T y ) ≤ a d ( x , y ) + b d ( x , T y ) + c d ( y , T x ) ,
with a + b + c < 1 ( p = q = 1 ). Then T has a unique fixed point z, and x n → z , without assuming continuity of T.
Proof. 
Uniqueness and Cauchyness follow identically to Theorem 1. Let x n → z . We prove T z = z using the standard lim sup technique for p = q = 1 .
From (2) with x = x n , y = z .
d ( x n + 1 , T z ) ≤ a d ( x n , z ) + b d ( x n , T z ) + c d ( z , x n + 1 ) .
Taking lim sup n → ∞ and using d ( x n , z ) → 0 , d ( z , x n + 1 ) → 0 ,
d ( z , T z ) ≤ b lim sup n → ∞ d ( x n , T z ) .
By the triangle inequality, d ( x n , T z ) ≤ d ( x n , z ) + d ( z , T z ) → d ( z , T z ) . Thus,
d ( z , T z ) ≤ b d ( z , T z ) .
Similarly, applying (2) to ( z , x n ) yields d ( z , T z ) ≤ c d ( z , T z ) . Combining these, we obtain
d ( z , T z ) ≤ min { b , c } d ( z , T z ) .
Since a + b + c < 1 , we have min { b , c } < 1 . This forces d ( z , T z ) = 0 , hence T z = z . □
Remark 1  
(Necessity of Continuity for p > 1 ?). For p = q > 1 , the limit verification fails without continuity. Specifically, applying the condition to ( x n , z ) yields d ( z , T z ) ≤ b d ( z , T p z ) . The term d ( z , T p z ) involves the orbit of the limit point z, which is not controlled by the Cauchy property of { x n } . Without continuity, T p z can remain at a positive distance from z, preventing the contradiction d ( z , T z ) = 0 . This structural gap motivates the conjecture presented later.

5. Ulam–Hyers Stability Analysis

In applied analysis and numerical mathematics, the stability of fixed-point equations is as crucial as existence. We establish Ulam–Hyers stability [5,6,7] for the ACI-CRR framework, explicitly tracking how the asymmetric iterate orders affect the stability constant.
Definition 2  
(Ulam–Hyers Stability).  Let T : X → X be a self-mapping on a metric space ( X , d ) with a unique fixed point z. The fixed-point equation x = T x is said to be Ulam–Hyers-stable if there exists a constant C > 0 such that for every ε > 0 and every y ∈ X satisfying
d ( y , T y ) ≤ ε ,
the inequality d ( y , z ) ≤ C ε holds.
Theorem 3  
(Ulam–Hyers Stability for ACI-CRR). Let ( X , d ) be a complete metric space and T : X → X a continuous ACI-CRR contraction with constants a , b , c ≥ 0 and integers p , q ≥ 1 with p ≠ q . Assume the coefficients satisfy the strengthened condition
α : = a + b p + c q < 1 .
Then the fixed-point equation x = T x is Ulam–Hyers-stable with explicit constant
C = 1 + c q 1 − ( a + b + c ) .
Proof. 
Let z ∈ X be the unique fixed point of T (guaranteed by Theorem 1). Fix ε > 0 and let y ∈ X satisfy d ( y , T y ) ≤ ε . We aim to bound d ( y , z ) .
  • Step 1: Initial estimate. By the triangle inequality and the contraction condition applied to ( y , z ) ,
d ( y , z ) ≤ d ( y , T y ) + d ( T y , T z ) ≤ ε + a d ( y , z ) + b d ( y , T p z ) + c d ( z , T q y ) .
Since T z = z , we have T p z = z , so d ( y , T p z ) = d ( y , z ) . Thus,
d ( y , z ) ≤ ε + ( a + b ) d ( y , z ) + c d ( z , T q y ) .
Using the triangle inequality d ( z , T q y ) ≤ d ( z , y ) + d ( y , T q y ) , we obtain
d ( y , z ) ≤ ε + ( a + b + c ) d ( y , z ) + c d ( y , T q y ) .
Rearranging terms yields
1 − ( a + b + c ) d ( y , z ) ≤ ε + c d ( y , T q y ) .
Step 2: Bounding  d ( y , T q y ) . Telescoping the orbit of y gives
d ( y , T q y ) ≤ ∑ k = 0 q − 1 d ( T k y , T k + 1 y ) .
Let
δ k : = d ( T k y , T k + 1 y ) f o r k ≥ 0 ,
and set
M : = sup k ≥ 0 δ k .
We will prove that M ≤ ϵ , which implies that M is finite since ϵ is finite.
By assumption, δ 0 = d ( y , T y ) ≤ ε . For k ≥ 1 , apply the ACI-CRR condition to the pair ( T k − 1 y , T k y ) :
δ k ≤ a δ k − 1 + b d ( T k − 1 y , T p + k − 1 y ) + c d ( T k y , T q + k − 1 y ) .
Bounding each cross-iterate distance by the sum of consecutive steps and using the definition of M, we obtain the following:
d ( T k − 1 y , T p + k − 1 y ) ≤ ∑ j = 0 p − 1 δ k − 1 + j ≤ p M , d ( T k y , T q + k − 1 y ) ≤ ∑ j = 0 q − 1 δ k + j ≤ q M .
Thus,
δ k ≤ a M + b p M + c q M = α M , ∀ k ≥ 1 .
Since δ 0 ≤ ε and δ k ≤ α M for k ≥ 1 , we have
M = sup k ≥ 0 δ k ≤ max { ε , α M } .
Because α < 1 , the inequality M ≤ α M would imply M ( 1 − α ) ≤ 0 , forcing M = 0 , which contradicts M > ε if that were the case. Hence, we must have M ≤ ε . Therefore M is finite. Consequently,
d ( y , T q y ) ≤ ∑ k = 0 q − 1 δ k ≤ q M ≤ q ε .
Step 3: Final stability bound. Substituting  d ( y , T q y ) ≤ q ε into (4), we obtain
1 − ( a + b + c ) d ( y , z ) ≤ ε + c q ε = ( 1 + c q ) ε .
Dividing by 1 − ( a + b + c ) > 0 yields
d ( y , z ) ≤ 1 + c q 1 − ( a + b + c ) ε = C ε .
This completes the proof of Ulam–Hyers stability. □
Remark 2  
(Interpretation of the Stability Constant). The strengthened condition α = a + b p + c q < 1 is necessary to close the supremum bound M ≤ ε . It reflects the fact that cross-iterate expansions introduce multiplicative factors of p and q via the triangle inequality. When p = q = 1 , condition (3) reduces to the classical a + b + c < 1 , and the constant simplifies to C = 1 + c 1 − ( a + b + c ) , matching known results for first-order CRR contractions. The explicit form of C shows that stability deteriorates linearly with the iterate depth q and the weight c, quantifying the cost of asymmetric memory in the contraction mechanism.

6. Retraction–Displacement Analysis of ACI-CRR Contractions

In this section, we apply the retraction–displacement condition [8] to the Asymmetric Cross-Iterate Ćirić–Reich-=Rus (ACI-CRR) contraction framework. This provides an elegant unified approach to establishing Ulam–Hyers stability, and Tykhonov well-posedness and offers deep insight into the structural role of continuity in higher-iterate contractions.
Definition 3  
(Retraction–Displacement Condition). Let ( X , d ) be a metric space and T : X → X be a self-mapping with a nonempty fixed-point set F T . A retraction r : X → F T is a continuous map such that r ( x ) = x for all x ∈ F T . The mapping T is said to satisfy the retraction–displacement condition if there exists an increasing function ψ : R + → R + , continuous at 0 with ψ ( 0 ) = 0 , such that
d ( x , r ( x ) ) ≤ ψ ( d ( x , T x ) ) ∀ x ∈ X .

6.1. Setup and the Natural Retraction

Let ( X , d ) be a complete metric space and T : X → X be an ACI-CRR contraction satisfying
d ( T x , T y ) ≤ a d ( x , y ) + b d ( x , T p y ) + c d ( y , T q x ) ,
with a , b , c ≥ 0 , a + b + c < 1 , and p , q ≥ 1 .
  • By Theorems 1 and 2, under appropriate conditions, T has a unique fixed point z ∈ X . Since the fixed point is unique, we define the natural retraction
r : X → { z } , r ( x ) = z ∀ x ∈ X .
This is indeed a retraction: it is continuous (as a constant map), satisfies r ( z ) = z , and for every x ∈ F T = { z } , we have r ( x ) = x . Consequently, the retraction–displacement condition reduces to finding ψ such that
d ( x , z ) ≤ ψ ( d ( x , T x ) ) ∀ x ∈ X .

6.2. Case 1: The Classical Setting p = q = 1 (No Continuity Required)

We first consider the classical case p = q = 1 . From (2), applied to the pair ( x , z ) , we obtain
d ( T x , T z ) ≤ a d ( x , z ) + b d ( x , T z ) + c d ( z , T x ) .
Since T z = z , this becomes
d ( T x , z ) ≤ ( a + b ) d ( x , z ) + c d ( T x , z ) .
Rearranging terms yields
( 1 − c ) d ( T x , z ) ≤ ( a + b ) d ( x , z ) ,
and since c < 1 , we have
d ( T x , z ) ≤ a + b 1 − c d ( x , z ) .
Using the triangle inequality,
d ( x , z ) ≤ d ( x , T x ) + d ( T x , z ) ≤ d ( x , T x ) + a + b 1 − c d ( x , z ) .
Thus,
1 − a + b 1 − c d ( x , z ) ≤ d ( x , T x ) ⇒ 1 − ( a + b + c ) 1 − c d ( x , z ) ≤ d ( x , T x ) .
Therefore,
d ( x , z ) ≤ 1 − c 1 − ( a + b + c ) d ( x , T x ) .
Hence, the retraction–displacement condition holds with
ψ ( t ) = 1 − c 1 − ( a + b + c ) t .
Notably, this result requires no continuity assumption on T, in full agreement with Theorem 2.

6.3. Case 2: Asymmetric p ≠ q or Higher-Iterate p = q > 1 (Continuity Required)

We now consider the case where either p ≠ q or p = q > 1 . From (2), applied to the pair ( x , z ) , we have
d ( T x , z ) ≤ ( a + b ) d ( x , z ) + c d ( z , T q x ) .
The challenge is to bound the term d ( z , T q x ) .

6.3.1. Step 2.1: Bounding the Consecutive Steps δ k

Define the sequence δ k : = d ( T k x , T k + 1 x ) for k ≥ 0 , and set M : = sup k ≥ 0 δ k . For k ≥ 1 , apply the ACI-CRR condition to the pair ( T k − 1 x , T k x ) .
δ k ≤ a δ k − 1 + b d ( T k − 1 x , T p + k x ) + c d ( T k x , T q + k − 1 x ) .
Using the triangle inequality, the cross-iterate distances telescope as follows
d ( T k − 1 x , T p + k x ) ≤ ∑ j = 0 p δ k − 1 + j ≤ ( p + 1 ) M ,
and
d ( T k x , T q + k − 1 x ) ≤ ∑ j = 0 q − 2 δ k + j ≤ ( q − 1 ) M .
Substituting these estimates yields
δ k ≤ [ a + b ( p + 1 ) + c ( q − 1 ) ] M = : α M , ∀ k ≥ 1 .

6.3.2. Step 2.2: Establishing the Bound M ≤ d ( x , T x )

We have δ 0 = d ( x , T x ) and δ k ≤ α M for k ≥ 1 . Therefore,
M = sup k ≥ 0 δ k ≤ max { δ 0 , α M } .
Assume the strengthened condition
α : = a + b ( p + 1 ) + c ( q − 1 ) < 1 .
If M ≤ α M , then since α < 1 , we would have M = 0 , which contradicts δ 0 > 0 (unless x = z ). Hence, we must have
M ≤ δ 0 = d ( x , T x ) .

6.3.3. Step 2.3: Final Bound for d ( z , T q x ) and Completion of the Proof

Using the triangle inequality, we can bound d ( z , T q x ) directly
d ( z , T q x ) ≤ d ( z , x ) + d ( x , T q x ) ≤ d ( x , z ) + ∑ k = 0 q − 1 δ k ≤ d ( x , z ) + q M .
Since M ≤ d ( x , T x ) , we obtain the crucial bound
d ( z , T q x ) ≤ d ( x , z ) + q d ( x , T x ) .
Substituting (26) into (17) yields
d ( T x , z ) ≤ ( a + b ) d ( x , z ) + c [ d ( x , z ) + q d ( x , T x ) ] = ( a + b + c ) d ( x , z ) + c q d ( x , T x ) .
Using the triangle inequality d ( x , z ) ≤ d ( x , T x ) + d ( T x , z ) , we obtain
d ( x , z ) ≤ d ( x , T x ) + ( a + b + c ) d ( x , z ) + c q d ( x , T x ) .
Rearranging terms yields
[ 1 − ( a + b + c ) ] d ( x , z ) ≤ ( 1 + c q ) d ( x , T x ) .
Since a + b + c < 1 , we have 1 − ( a + b + c ) > 0 . Hence,
d ( x , z ) ≤ 1 + c q 1 − ( a + b + c ) d ( x , T x ) .
Therefore, the retraction–displacement condition holds with
ψ ( t ) = 1 + c q 1 − ( a + b + c ) t .

6.4. Main Theorem: Retraction–Displacement for ACI-CRR

We now summarize our findings in the following theorem.
Theorem 4. 
Let ( X , d ) be a complete metric space and T : X → X an ACI-CRR contraction with a + b + c < 1 and integers p , q ≥ 1 . Suppose one of the following holds
(i)
p = q = 1 (no continuity required);
(ii)
T is continuous and α : = a + b ( p + 1 ) + c ( q − 1 ) < 1 .
Then T has a unique fixed point z, and the retraction–displacement condition holds:
d ( x , z ) ≤ ψ d ( x , T x ) ∀ x ∈ X ,
where
ψ ( t ) = 1 − c 1 − ( a + b + c ) t , C a s e ( i ) , 1 + c q 1 − ( a + b + c ) t , C a s e ( ii ) .
Remark 3 
(Equivalence of Stability Constants). The assertion that both approaches yield identical constants applies within each respective case. For the asymmetric setting p ≠ q (Case (ii)), both the direct ε-based proof (Theorem 3) and the retraction–displacement approach yield the exact same constant C = 1 + c q 1 − ( a + b + c ) . For the classical symmetric setting p = q = 1 (Case (i)), both approaches yield C = 1 − c 1 − ( a + b + c ) .
A point of confusion is assuming that the formula 1 + c q 1 − ( a + b + c ) from Theorem 3 applies to the p = q = 1 case by simply setting q = 1 (which would incorrectly yield 1 + c 1 − ( a + b + c ) ). However, Theorem 3 explicitly requires p ≠ q . In the p = q = 1 case, the symmetric cross-terms allow for a tighter direct bound (yielding 1 − c instead of 1 + c ), and the retraction–displacement method naturally recovers this exact same sharp constant without any loss. This perfect agreement in both regimes confirms the consistency and sharpness of the two methods.

6.5. Consequences and Applications

6.5.1. Ulam–Hyers Stability

By the general theory of retraction–displacement conditions [8], any operator satisfying the condition has a fixed-point equation that is Ulam–Hyers-stable. Indeed, if y ∈ X satisfies d ( y , T y ) ≤ ϵ , then
d ( y , z ) ≤ ψ ( d ( y , T y ) ) ≤ ψ ( ϵ ) .
Thus, we obtain explicit stability constants.
  • For Case (i): C = 1 − c 1 − ( a + b + c ) .
  • For Case (ii): C = 1 + c q 1 − ( a + b + c ) .

6.5.2. Tykhonov Well-Posedness

The retraction–displacement condition also implies Tykhonov well-posedness of the fixed-point problem x = T x . That is, if { x n } is any sequence in X such that d ( x n , T x n ) → 0 , then x n → z . Indeed, d ( x n , z ) ≤ ψ ( d ( x n , T x n ) ) → ψ ( 0 ) = 0 .

6.5.3. Structural Insight: Why Continuity Is Necessary

The derivation reveals that the key obstacle in the asymmetric ( p ≠ q ) or higher-iterate ( p = q > 1 ) cases is the term d ( z , T q x ) . Without continuity, the iterates T n x may not converge to z, and we lose control over the orbit of the limit point. This explains why continuity is indispensable when p , q > 1 or p ≠ q , and why the classical case p = q = 1 avoids this issue entirely.

6.6. Comparative Analysis: Ulam–Hyers Stability vs. Retraction–Displacement Approach

6.6.1. Conceptual Differences

In this subsection, we provide a detailed comparison between the two stability approaches. This comparison highlights the complementary nature of both methods and demonstrates the coherence of the ACI-CRR framework, as shown in Table 1 below.
Table 1. Conceptual comparison between Ulam–Hyers stability and retraction–displacement approaches.

6.6.2. Quantitative Comparison of Stability Constants

A key contribution of our analysis is the explicit computation of stability constants via both approaches. The following Table 2 summarizes the constants obtained.
Table 2. Comparison of stability constants obtained via both approaches.
Remark 4. 
Several key observations emerge from this comparison.
1. 
Perfect Agreement: Both approaches yield identical stability constants in all cases. This confirms the coherence of both theories and demonstrates that the retraction–displacement framework, despite its abstract geometric nature, captures the exact sharp quantitative bounds of the direct ε-based approach.
2. 
Sharpness: The fact that both methods yield the same constant confirms that the bound is sharp and that no information is lost when passing to the retraction–displacement framework.
3. 
Dependence on q: Both constants grow linearly with the iterate depth q, illustrating how stability deteriorates with the number of iterations required to reach the fixed point.

6.6.3. Theoretical and Practical Advantages

Rather than viewing these approaches as competing, we emphasize their complementary nature.
  • The Ulam–Hyers approach provides quantitative error estimates that are sharp, self-contained, and directly applicable to numerical analysis.
  • The retraction–displacement approach provides qualitative structural insights. It naturally implies Tykhonov well-posedness, explains why continuity is structurally necessary for higher iterates, and offers a clear pathway for generalizing the results to broader classes of mappings (e.g., multi-valued mappings or spaces with weaker structures).

6.6.4. Conclusion of the Comparison

Both the Ulam–Hyers stability analysis and the retraction–displacement condition provide valuable and complementary perspectives on the stability of ACI-CRR contractions. The exact equivalence of their stability constants is a strong theoretical result, proving that the ACI-CRR framework is both quantitatively sharp and structurally rich.

7. Applications to Integral Equations

In this section we illustrate the applicability of the ACI-CRR framework to integral equations in Banach spaces. Throughout, we work in the space X = C ( [ 0 , 1 ] ) endowed with the supremum norm
∥ f ∥ ∞ = sup t ∈ [ 0 , 1 ] | f ( t ) | ,
which is a complete metric space.

7.1. Volterra Integral Equations

Theorem 5. 
Let K : [ 0 , 1 ] × [ 0 , 1 ] → R be continuous and suppose
sup t ∈ [ 0 , 1 ] ∫ 0 t | K ( t , s ) | d s ≤ L < 1 .
Then the Volterra integral equation
u ( t ) = ∫ 0 t K ( t , s ) u ( s ) d s
admits a unique solution u ∈ C ( [ 0 , 1 ] ) . Moreover, the successive approximations u n + 1 = T u n converge uniformly to u.
Proof. 
Define T : X → X by
( T f ) ( t ) = ∫ 0 t K ( t , s ) f ( s ) d s .
For any f , g ∈ X ,
| T f ( t ) − T g ( t ) | ≤ ∫ 0 t | K ( t , s ) | | f ( s ) − g ( s ) | d s ≤ L ∥ f − g ∥ ∞ .
Taking the supremum over t yields
∥ T f − T g ∥ ∞ ≤ L ∥ f − g ∥ ∞ .
Thus T is a contraction. In particular, it satisfies the ACI-CRR condition with a = L , b = c = 0 , and a + b + c < 1 .
By Theorem 1, T has a unique fixed point u, which solves (33). The convergence of Picard iterates follows directly. □

7.2. Hammerstein-Type Integral Equations

Theorem 6. 
Let K : [ 0 , 1 ] × [ 0 , 1 ] → R be continuous and let F : R → R be continuous and Lipschitz with constant L F . Assume
sup t ∈ [ 0 , 1 ] ∫ 0 1 | K ( t , s ) | d s ≤ M , a n d M L F < 1 .
Then the Hammerstein integral equation
u ( t ) = ∫ 0 1 K ( t , s ) F ( u ( s ) ) d s
has a unique solution u ∈ C ( [ 0 , 1 ] ) , and the Picard iteration converges uniformly to u.
Proof. 
Define T : X → X by
( T f ) ( t ) = ∫ 0 1 K ( t , s ) F ( f ( s ) ) d s .
For f , g ∈ X ,
| T f ( t ) − T g ( t ) | ≤ ∫ 0 1 | K ( t , s ) | | F ( f ( s ) ) − F ( g ( s ) ) | d s ≤ L F ∫ 0 1 | K ( t , s ) | | f ( s ) − g ( s ) | d s .
Hence
∥ T f − T g ∥ ∞ ≤ M L F ∥ f − g ∥ ∞ .
Since M L F < 1 , T is a contraction and thus satisfies the ACI-CRR condition with a = M L F , b = c = 0 .
The result follows from Theorem 1. □

7.3. Perturbed Volterra Equations

Theorem 7. 
Let K satisfy the assumptions of Theorem 5, and let g ∈ C ( [ 0 , 1 ] ) . Consider
u ( t ) = g ( t ) + ∫ 0 t K ( t , s ) u ( s ) d s .
Then (35) admits a unique solution u ∈ C ( [ 0 , 1 ] ) .
Proof. 
Define
( T f ) ( t ) = g ( t ) + ∫ 0 t K ( t , s ) f ( s ) d s .
Then for f , g ∈ X ,
| T f ( t ) − T g ( t ) | = ∫ 0 t K ( t , s ) ( f ( s ) − g ( s ) ) d s ≤ L ∥ f − g ∥ ∞ .
Hence ∥ T f − T g ∥ ∞ ≤ L ∥ f − g ∥ ∞ with L < 1 , so T is a contraction and satisfies the ACI-CRR condition.
By Theorem 1, T has a unique fixed point u, which solves (35). □
Remark 5. 
The above results demonstrate that ACI-CRR contractions naturally arise in integral equations. However, all applications reduce to the degenerate case b = c = 0 . Extending these results to genuinely non-degenerate ACI-CRR structures (with b , c > 0 ) in infinite-dimensional spaces remains a challenging open problem.

8. Implications and Advantages of the ACI-CRR Framework

The introduction of the Asymmetric Cross-Iterate Ćirić–Reich–Rus (ACI-CRR) contraction represents a meaningful extension of classical fixed-point theory. In this section, we discuss the theoretical implications and practical advantages of the ACI-CRR condition relative to both the classical CRR contraction and its symmetric higher-iterate counterpart.
1.
Comparison with the Classical CRR Contraction
The classical Ćirić–Reich–Rus condition typically takes the form
d ( T x , T y ) ≤ a d ( x , y ) + b d ( x , T x ) + c d ( y , T y ) ,
or its cross-coupled variant d ( T x , T y ) ≤ a d ( x , y ) + b d ( x , T y ) + c d ( y , T x ) . The ACI-CRR framework generalizes these by replacing first-order images with higher-order cross-iterates T p y and T q x . This modification yields several advantages:
  • Higher-Order Memory Modeling: Classical contractions depend only on immediate past states ( T x , T y ). ACI-CRR incorporates multi-step dependencies, making it suitable for systems with distributed delays, hierarchical feedback, or multi-scale memory effects.
  • Invariant Contraction Threshold: Despite the increased structural complexity, the sharp contraction threshold a + b + c < 1 remains sufficient for existence and uniqueness. This demonstrates that contraction strength is governed by the aggregate weight of the terms rather than their iterative depth.
  • Strict Generalization: Every classical CRR mapping is a special case of ACI-CRR with p = q = 1 . The converse is false, making ACI-CRR a strictly broader class that unifies standard, delayed, and cross-coupled contraction schemes.
2.
Advantages over the Symmetric Case ( p = q )
When p = q , the ACI-CRR condition reduces to a symmetric higher-iterate contraction. The asymmetry p ≠ q introduces structural flexibility that symmetric formulations cannot capture:
  • Directional and Non-Reciprocal Coupling: In many physical and engineered systems, influence propagates asymmetrically. For example, in directed networks or supply chains, the delay from node x to y may differ from y to x. The terms d ( x , T p y ) and d ( y , T q x ) naturally encode these non-reciprocal temporal scales, whereas p = q forces artificial symmetry.
  • Flexible Coefficient Redistribution: Asymmetry allows independent tuning of b and c relative to iterate depths. If p < q , the term d ( x , T p y ) typically exhibits faster contraction, permitting a larger coefficient b while maintaining stability. The coefficient c can be correspondingly reduced to compensate. This weight redistribution is impossible when p = q , where symmetry imposes rigid coefficient constraints.
  • Enhanced Robustness Near Discontinuities: As demonstrated in Example 1, the asymmetric structure can enforce strong contraction even for discontinuous mappings. The term d ( y , T 2 x ) provides additional “pull” toward the fixed point that a symmetric d ( y , T x ) term cannot replicate near jump discontinuities. This suggests that asymmetry can partially compensate for the lack of continuity, a property absent in symmetric higher-iterate formulations.
3.
Theoretical and Computational Implications
  • Numerical Stability in Iterative Solvers: In root-finding and optimization, symmetric cross-couplings ( p = q ) can induce oscillatory behavior when the underlying operator has an asymmetric Jacobian spectrum. The ACI-CRR condition acts as a directional damper, aligning the contraction mechanism with dominant eigen-directions and often accelerating convergence.
  • Modeling Multi-Scale Dynamics: The phase shift introduced by p ≠ q enables the framework to capture systems where different state components evolve at distinct temporal scales. This is particularly relevant in viscoelasticity, neural signal propagation, and control theory, where delayed feedback loops operate at different depths.
  • Pathways for Weakened Continuity Conditions: The failure of standard limit techniques for p , q > 1 without continuity motivates the search for minimal regularity assumptions. The ACI-CRR structure is well-suited for extensions involving orbital continuity, T-regularity, or partial metric spaces, where directional control of iterates can replace global continuity.
In summary, the ACI-CRR contraction not only generalizes classical fixed-point results but also provides a more nuanced and flexible tool for modeling asymmetric, multi-scale, and directionally dependent systems. Its structural advantages make it particularly valuable in applied mathematics, where symmetry assumptions often oversimplify real-world dynamics.

9. Comparative Examples and Conjecture

The symmetry p = q in the classical case allows direct bounding of d ( z , T z ) . In the asymmetric case p ≠ q , or the symmetric higher-iterate case p = q > 1 , the cross-terms evolve at different scales or involve higher orbits, breaking the direct limit closure.
Example 1. 
Let X = [ 0 , 1 ] with the usual metric d ( x , y ) = | x − y | . Define T : X → X by
T ( x ) = 0 , 0 ≤ x ≤ 1 2 , 0.1 , 1 2 < x ≤ 1 .
T is discontinuous at x = 1 2 since lim x → 1 2 + T ( x ) = 0.1 ≠ T ( 1 2 ) = 0 . Choose the constants
a = 0.2 , b = 0.5 , c = 0.2 , p = 1 , q = 2 .
Then a + b + c = 0.9 < 1 . We claim that for all x , y ∈ [ 0 , 1 ] ,
d ( T x , T y ) ≤ 0.2 d ( x , y ) + 0.5 d ( x , T y ) + 0.2 d ( y , T 2 x ) .
Verification: First note that T 2 x = T ( T x ) . Since T x ∈ { 0 , 0.1 } and both values lie in [ 0 , 1 2 ] , we have T ( T x ) = 0 for every x ∈ [ 0 , 1 ] . Hence T 2 x = 0 for all x, and (37) simplifies to
| T x − T y | ≤ 0.2 | x − y | + 0.5 | x − T y | + 0.2 y .
We verify the inequality by cases.
  • Case 1: x , y ≤ 1 2 . Then T x = T y = 0 , so LHS = 0 . RHS ≥ 0 , so (37) holds.
  • Case 2: x , y > 1 2 . Then T x = T y = 0.1 , so LHS = 0 . RHS ≥ 0 , so (37) holds.
  • Case 3: x ≤ 1 2 < y . Here T x = 0 and T y = 0.1 , so LHS = 0.1 . Since y > 0.5 , the term 0.2 y > 0.1 . As d ( x , y ) ≥ 0 and d ( x , T y ) ≥ 0 , the entire RHS is strictly greater than 0.1 . Hence (37) holds.
  • Case 4: y ≤ 1 2 < x . Here T x = 0.1 and T y = 0 , so LHS = 0.1 . Since T 2 x = 0 , we have d ( y , T 2 x ) = y . Thus
    R H S = 0.2 ( x − y ) + 0.5 x + 0.2 y = 0.7 x .
    Since x > 1 2 , RHS > 0.35 > 0.1 . Hence (37) holds.
All cases satisfy (37). Therefore T is an ACI-CRR contraction with p = 1 , q = 2 , and a + b + c < 1 , despite being discontinuous. The unique fixed point is z = 0 (since T ( 0 ) = 0 and T n x = 0 for all n ≥ 2 ).
Example 2 
(ACI-CRR Contraction with Non-Zero Fixed Point). Let X = [ 0 , 1 ] with the usual metric. Define T : X → X by
T ( x ) = 1 4 , 0 ≤ x ≤ 1 2 , 1 3 , 1 2 < x ≤ 1 .
This mapping is discontinuous at x = 1 2 . Choose p = 1 , q = 2 , a = 1 10 , b = 3 5 , and c = 1 5 . Then a + b + c = 1 10 + 3 5 + 1 5 = 9 10 < 1 .
Verification: First note that T ( x ) ∈ { 1 4 , 1 3 } , and both values are ≤ 1 2 . Hence T 2 ( x ) = 1 4 for all x ∈ [ 0 , 1 ] .
The ACI-CRR condition with p = 1 and q = 2 becomes
d ( T x , T y ) ≤ 1 10 d ( x , y ) + 3 5 d ( x , T y ) + 1 5 d ( y , T 2 x ) .
| T x − T y | ≤ 1 10 | x − y | + 3 5 | x − T y | + 1 5 y − 1 4 .
We verify by cases:
  • Case 1: x , y ≤ 1 2 . Then T x = T y = 1 4 , so LHS = 0 . The inequality (39) holds.
  • Case 2: x , y > 1 2 . Then T x = T y = 1 3 , so LHS = 0 . The inequality (39) holds.
  • Case 3: x ≤ 1 2 < y . Then T x = 1 4 and T y = 1 3 , so
    L H S = 1 4 − 1 3 = 1 12 ≈ 0.0833 .
    Since y > 1 2 ,
    R H S = 1 10 | x − y | + 3 5 x − 1 3 + 1 5 y − 1 4 .
    The term 3 5 | x − 1 3 | is at least 3 5 · 1 6 = 1 10 when x ∈ [ 0 , 1 2 ] (the minimum occurs at x = 1 2 , giving | 1 2 − 1 3 | = 1 6 ). Thus RHS ≥ 1 10 > 1 12 . The inequality (39) holds.
  • Case 4: y ≤ 1 2 < x . Then T x = 1 3 and T y = 1 4 , so L H S = 1 12 .
    Since T 2 x = 1 4 ,
    R H S = 1 10 | x − y | + 3 5 x − 1 4 + 1 5 y − 1 4 .
    Since x > 1 2 ,
    3 5 x − 1 4 > 3 5 · 1 4 = 3 20 = 0.15 > 1 12 ≈ 0.0833 .
    Hence RHS > 1 12 , so the inequality (39) holds.
The unique fixed point is z = 1 4 , since T ( 1 4 ) = 1 4 and T n x = 1 4 for all n ≥ 2 .
This example demonstrates that the ACI-CRR framework can accommodate non-zero fixed points while maintaining the asymmetric cross-iterate structure.
These examples demonstrate that the asymmetric cross-iterate structure can enforce strong contraction even in the presence of discontinuities. While Theorem 1 assumes continuity to guarantee fixed-point existence in the general case, the example shows that continuity is a sufficient rather than necessary condition. It aligns with Section 10 by illustrating that asymmetric couplings can sometimes compensate for lack of continuity, though this is not guaranteed for arbitrary discontinuous mappings.
The failure of the limit argument for p , q > 1 without continuity, combined with the structural phase shift in the asymmetric case, suggests that the Picard limit may not commute with T when iterates are decoupled.

10. Conjecture

Let ( X , d ) be a complete metric space and T : X → X satisfy the ACI-CRR condition (1) with p ≠ q and a + b + c < 1 . If T is not continuous, then T does not necessarily possess a fixed point, and the Picard sequence may converge to a point z with T z ≠ z . The same holds for the symmetric case p = q > 1 without continuity.
This conjecture is motivated by the fact that without continuity, the cross-iterate terms d ( x , T p y ) and d ( y , T q x ) cannot be simultaneously controlled in the limit. The phase shift introduced by p ≠ q (or the higher orbit depth p > 1 ) breaks the reciprocal bounding mechanism that guarantees d ( z , T z ) = 0 in the classical p = q = 1 setting. Proving or disproving this conjecture, or identifying minimal weak-continuity conditions (e.g., orbital continuity, T-regularity) that recover existence, remains an open problem.

11. Conclusions

We have established that the Asymmetric Cross-Iterate Ćirić–Reich–Rus contraction guarantees a unique fixed point when the mapping is continuous. We demonstrated that the symmetric case p = q > 1 similarly requires continuity, while the classical p = q = 1 case uniquely avoids this assumption. The asymmetric structure offers greater flexibility in modeling directional dynamics but appears to inherently rely on continuity for fixed-point verification. Future work will focus on verifying Section 10 and exploring weakened continuity conditions that might recover existence in the asymmetric or higher-iterate settings.

Author Contributions

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

Funding

This work was supported by the Deanship of Scientific Research, Vice-Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [KFU264275].

Data Availability Statement

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

Acknowledgments

The authors express their gratitude for all the support from the Deanship of Scientific Research, Vice-Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia.

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] [Scilit]
  2. Ćirić, L.B. A Generalization of Banach’s Contraction Principle. Proc. Am. Math. Soc. 1974, 45, 267–273. [Google Scholar] [CrossRef] [Scilit]
  3. Reich, S. Some Fixed Point Problems. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. 1974, 57, 194–198. [Google Scholar]
  4. Rus, I.A. Generalized Contractions and Applications; Cluj University Press: Cluj, România, 2001. [Google Scholar]
  5. Ulam, S.M. Problems in Modern Mathematics; Wiley: Hoboken, NJ, USA, 1940; Chapter VI. [Google Scholar]
  6. Hyers, D.H. On the stability of the linear functional equation. Proc. Nat. Acad. Sci. USA 1941, 27, 222–224. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  7. Rassias, T.M. On the stability of the linear mapping in Banach spaces. Proc. Am. Math. Soc. 1978, 72, 297–300. [Google Scholar] [CrossRef] [Scilit]
  8. Berinde, V.; Petrusel, A.; Rus, I.A.; Serban, M.A. The retraction–displacement condition in the theory of fixed point equation with a convergent iterative algorithm. In Mathematical Analysis, Approximation Theory and Their Applications; Rassias, T.M., Gupta, V., Eds.; Springer: Berlin/Heidelberg, Germany, 2016; pp. 75–106. [Google Scholar]
  9. Berinde, V. Iterative Approximation of Fixed Points; North-Holland: Amsterdam, The Netherlands, 2007. [Google Scholar]
  10. Rhoades, B.E. A comparison of various definitions of contractive mappings. Trans. Am. Math. Soc. 1977, 226, 257–290. [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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.