Skip to Content
AxiomsAxioms
  • Article
  • Open Access

28 April 2026

13 Pages

A Fixed-Point Theorem for Mappings Satisfying a Contractive Condition Involving Tρ

,
,
and
1
“Vinča” Institute of Nuclear Sciences-National Institute of the Republic of Serbia, University of Belgrade, Mike Petrovića Alasa 12-14, 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 University Center, El-Bayadh 32000, Algeria
4
Department of Mathematics, IPEIS, Sfax University, Road of Menzel Chaker Km 0.5, Sfax 3000, Tunisia

Abstract

We prove that a self-mapping T on a complete metric space ( X , D ) , satisfying a generalized contractive condition involving its ρ -th iterate T ρ ( ρ ∈ N , ρ ≥ 2 ) and a uniform coefficient bound L < 1 , possesses a unique fixed point. The proof establishes that the Picard iteration sequence is Cauchy with the further assumption of continuity of T, and fixed point uniqueness follows directly from the contractive inequality.

1. Introduction

Fixed-point theory represents one of the fundamental pillars of modern mathematical analysis, with wide-ranging applications in various fields such as differential and integral equations, and mathematical economics. The origins of this theory date back to the famous Banach fixed-point theorem [1] published in 1922, which states that every contraction mapping on a complete metric space possesses a unique fixed point.
Since then, the theory has witnessed important developments through various generalizations of contraction conditions. In 1968, Kannan [2] introduced a generalization by replacing the distance between the two images with a combination of distances between points and their images. This was followed by Chatterjea’s work [3] in 1972, and then Singh [4,5] who extended the scope of these results. However, the most significant generalizations came from Ćirić [6,7] who introduced a more general contractive condition combining several distances. Subsequently, contributions from Reich [8,9,10,11] and Hardy and Rogers [12] provided even more comprehensive formulations. In a comprehensive comparative study, Rhoades [13] analyzed and classified different types of contractive mappings. The concept of generalized metric spaces, introduced by Mustafa and Sims [14], has opened new directions in fixed-point theory. Recently, Bekri and Fabiano [15] contributed to this evolving field by investigating Singh–Chatterjee type contractive mappings.
This work aims to present a new theorem in fixed-point theory, where we study self-mappings T on a complete metric space ( X , D ) satisfying a generalized contractive condition involving the ρ -fold iteration T ρ (where ρ ≥ 2 ). The proposed condition is characterized by the existence of coefficient functions a , b , c , d : X × X → [ 0 , ∞ ) satisfying the uniform bound L < 1 such that:
D ( T x , T y ) ≤ a ( x , y ) D ( x , y ) + b ( x , y ) D ( x , T ρ x ) + c ( x , y ) D ( y , T ρ y ) + d ( x , y ) [ D ( x , T ρ y ) + D ( y , T ρ x ) ] .
The main significance of this work lies in demonstrating that despite using T ρ instead of T in the contractive conditions, one can prove the existence of a unique fixed point for T. This constitutes an important extension of classical theory, as we have shown through examples that the class of mappings covered by our theorem (with ρ ≥ 2 ) is strictly larger than the class covered by traditional generalized contractions such as Ćirić’s condition (which corresponds to ρ = 1 ).
This paper is organized as follows: after the introduction, Section 2 presents the preliminary concepts and auxiliary results. Section 3 is devoted to proving the main theorem in three stages: constructing a Cauchy sequence via Picard iteration, proving that its limit is a fixed point of T, and then proving the uniqueness of this point. Section 4 provides illustrative examples, including one showing that T ( x ) = − x / ( 1 + x 2 ) satisfies the theorem’s conditions with ρ = 2 despite failing any Ćirić-type contractive condition with ρ = 1 . Section 5 is dedicated to applying the results to a nonlinear Fredholm integral equation of the second kind and to a Second-Order Boundary Value Problem. The paper concludes with a final Section 6 presenting conclusions and a discussion of the results.

2. Preliminaries

Let ( X , D ) be a complete metric space, and let T : X → X be a continuous mapping. Fix an integer ρ ≥ 2 , and suppose there exist functions
a , b , c , d : X × X → [ 0 , ∞ )
such that for all x , y ∈ X ,
D ( T x , T y ) ≤ a ( x , y ) D ( x , y ) + b ( x , y ) D ( x , T ρ x ) + c ( x , y ) D ( y , T ρ y ) + d ( x , y ) D ( x , T ρ y ) + D ( y , T ρ x ) ,
and the coefficients satisfy the uniform bound
sup x , y ∈ X a ( x , y ) + b ( x , y ) + c ( x , y ) + 2 d ( x , y ) = : L < 1 .
Here, T ρ denotes the ρ -fold composition of T with itself: T ρ = T ∘ T ∘ … ∘ T ︸ ρ times .
Theorem 1. 
Under assumptions (2) and (3), the mapping T has a unique fixed point in X; that is, there exists a unique x * ∈ X such that
T x * = x * .
The proof proceeds in three stages: (i) construction of a Cauchy sequence via Picard iteration, (ii) verification that its limit is a fixed point of T, and (iii) proof of uniqueness.

3. Proof of Theorem 1

Fix an arbitrary x 0 ∈ X , and define the Picard iteration sequence
x n : = T n x 0 , n = 0 , 1 , 2 , … .
For convenience, denote
s n : = D ( x n , x n + 1 ) , t n : = D ( x n , x n + ρ ) = D ( x n , T ρ x n ) , n ≥ 0 .
Note that t n measures the ρ -step displacement from x n .
We first establish a fundamental estimate for the sequence { t n } .
Lemma 1. 
The sequence { t n } satisfies
t n + 1 ≤ L · max { t n , t n + ρ } , ∀ n ≥ 0 .
Proof. 
Apply inequality (2) to the pair ( x n , x n + ρ ) . Using T ρ x n = x n + ρ and T ρ x n + ρ = x n + 2 ρ , we compute
t n + 1 = D ( x n + 1 , x n + ρ + 1 ) = D ( T x n , T x n + ρ ) ≤ a n ′ D ( x n , x n + ρ ) + b n ′ D ( x n , T ρ x n ) + c n ′ D ( x n + ρ , T ρ x n + ρ ) + d n ′ D ( x n , T ρ x n + ρ ) + D ( x n + ρ , T ρ x n ) ,
where a n ′ = a ( x n , x n + ρ ) , etc. Now observe
  • D ( x n , x n + ρ ) = t n ,
  • D ( x n , T ρ x n ) = D ( x n , x n + ρ ) = t n ,
  • D ( x n + ρ , T ρ x n + ρ ) = D ( x n + ρ , x n + 2 ρ ) = t n + ρ ,
  • D ( x n , T ρ x n + ρ ) = D ( x n , x n + 2 ρ ) ≤ D ( x n , x n + ρ ) + D ( x n + ρ , x n + 2 ρ ) = t n + t n + ρ ,
  • D ( x n + ρ , T ρ x n ) = D ( x n + ρ , x n + ρ ) = 0 .
Substituting these bounds yields
t n + 1 ≤ a n ′ t n + b n ′ t n + c n ′ t n + ρ + d n ′ ( t n + t n + ρ ) = ( a n ′ + b n ′ + d n ′ ) t n + ( c n ′ + d n ′ ) t n + ρ ≤ ( a n ′ + b n ′ + c n ′ + 2 d n ′ ) · max { t n , t n + ρ } ≤ L · max { t n , t n + ρ } ,
where the last inequality follows from (3). This completes the proof. □
Let u n : = sup k ≥ n t k . We first show that the sequence { t n } is bounded. Indeed, t 0 = D ( x 0 , T ρ x 0 ) is a finite non-negative real number. We claim that for all n ≥ 0 ,
t n ≤ t 0 L ⌊ n / ρ ⌋ .
We prove this by induction. For n = 0 , the inequality holds trivially. Assume that it holds for all indices up to n. Then, using the estimate t n + 1 ≤ L max { t n , t n + ρ } from Lemma 1 and the induction hypothesis, we obtain
t n + 1 ≤ L · t 0 L ⌊ n / ρ ⌋ = t 0 L ⌊ n / ρ ⌋ + 1 ≤ t 0 L ⌊ ( n + 1 ) / ρ ⌋ ,
where the last inequality follows from the fact that ⌊ ( n + 1 ) / ρ ⌋ ≤ ⌊ n / ρ ⌋ + 1 . Consequently, t n ≤ t 0 for all n, and, thus,
u 0 = sup n ≥ 0 t n ≤ t 0 < ∞ .
Hence, ( u n ) is a well-defined non-increasing sequence bounded below by zero, and, therefore, it converges.
From Lemma 1,
t n + 1 ≤ L u n ,
so taking supremum over all k ≥ n + 1 gives
u n + 1 = sup k ≥ n + 1 t k ≤ L u n .
Iterating yields
u n ≤ L n u 0 , hence t n ≤ u n ≤ u 0 L n ∀ n ≥ 0 .
In particular,
lim n → ∞ t n = 0 .
Next, we show that the full Picard sequence { x n } is Cauchy.
Lemma 2. 
The Picard sequence { x n } defined by x n = T n x 0 is a Cauchy sequence in ( X , D ) .
Proof. 
Let s n = D ( x n , x n + 1 ) and t n = D ( x n , x n + ρ ) = D ( x n , T ρ x n ) . From Lemma 2 and the subsequent argument, we have the exponential decay
t n ≤ t 0 L n for all n ≥ 0 .
Now, apply the contraction condition (2) to the pair ( x n , x n − 1 )
s n = D ( T x n , T x n − 1 ) ≤ a ( x n , x n − 1 ) D ( x n , x n − 1 ) + b ( x n , x n − 1 ) D ( x n , T ρ x n ) + c ( x n , x n − 1 ) D ( x n − 1 , T ρ x n − 1 ) + d ( x n , x n − 1 ) D ( x n , T ρ x n − 1 ) + D ( x n − 1 , T ρ x n ) .
Estimate each term using the triangle inequality
  • D ( x n , x n − 1 ) = s n − 1 ,
  • D ( x n , T ρ x n ) = t n ,
  • D ( x n − 1 , T ρ x n − 1 ) = t n − 1 ,
  • D ( x n , T ρ x n − 1 ) = D ( x n , x n − 1 + ρ ) ≤ D ( x n , x n − 1 ) + D ( x n − 1 , x n − 1 + ρ ) = s n − 1 + t n − 1 ,
  • D ( x n − 1 , T ρ x n ) = D ( x n − 1 , x n + ρ ) ≤ D ( x n − 1 , x n ) + D ( x n , x n + ρ ) = s n − 1 + t n .
Substituting these bounds
s n ≤ a n s n − 1 + b n t n + c n t n − 1 + d n ( s n − 1 + t n − 1 ) + ( s n − 1 + t n ) = ( a n + 2 d n ) s n − 1 + ( b n + d n ) t n + ( c n + d n ) t n − 1 ,
where a n = a ( x n , x n − 1 ) , etc.
By the coefficient bound (3), we have
a n + 2 d n ≤ L , b n + d n ≤ L , c n + d n ≤ L .
Therefore,
s n ≤ L s n − 1 + L t n + L t n − 1 .
Using the exponential decay (6) t n ≤ t 0 L n and t n − 1 ≤ t 0 L n − 1 , we obtain
s n ≤ L s n − 1 + L ( t 0 L n ) + L ( t 0 L n − 1 ) = L s n − 1 + t 0 ( L n + 1 + L n ) .
Let K = t 0 ( L + 1 ) . Then
s n ≤ L s n − 1 + K L n .
Divide both sides by L n
s n L n ≤ s n − 1 L n − 1 + K .
Iterating this inequality
s n L n ≤ s 0 L 0 + n K = s 0 + n K .
Hence,
s n ≤ ( s 0 + n K ) L n .
Since L < 1 , the series ∑ n = 0 ∞ s n converges by the root test (or comparison to a convergent series). Therefore, for any m > n ,
D ( x n , x m ) ≤ ∑ k = n m − 1 s k ≤ ∑ k = n ∞ s k → 0 as n → ∞ ,
which proves that { x n } is Cauchy. □
Since ( X , D ) is complete, there exists x * ∈ X such that
lim n → ∞ x n = x * .
We now prove that x * is a fixed point of T.
Lemma 3. 
T x * = x * .
Proof. 
By construction, x n + 1 = T x n for all n ≥ 0 . Since x n → x * and T is continuous, we have
T x * = T lim n → ∞ x n = lim n → ∞ T x n = lim n → ∞ x n + 1 = x * .
Hence, x * is a fixed point of T. □
Finally, we verify uniqueness.
Lemma 4. 
The fixed point of T is unique.
Proof. 
Suppose x * , y * ∈ X satisfy T x * = x * and T y * = y * . Then T ρ x * = x * and T ρ y * = y * . Substituting into (2) gives
D ( x * , y * ) = D ( T x * , T y * ) ≤ a ( x * , y * ) D ( x * , y * ) + b ( x * , y * ) · 0 + c ( x * , y * ) · 0 + d ( x * , y * ) D ( x * , y * ) + D ( y * , x * ) = a ( x * , y * ) + 2 d ( x * , y * ) D ( x * , y * ) ≤ L D ( x * , y * ) ,
where the last inequality uses (3). Since L < 1 , this implies ( 1 − L ) D ( x * , y * ) ≤ 0 , hence D ( x * , y * ) = 0 , i.e., x * = y * . □

4. Illustrative Examples

In this section, we present two explicit examples that clarify the scope of Theorem 1. The first demonstrates a nontrivial mapping satisfying the contractive condition (2) with ρ = 2 . The second shows that the class of mappings covered by our theorem with ρ ≥ 2 is strictly larger than the class covered by classical generalized contractions such as those of Ćirić (which correspond to ρ = 1 ).

4.1. Example Satisfying the ρ = 2 Condition

Let X = R equipped with the standard metric D ( x , y ) = | x − y | , which is complete. Define the mapping T : X → X by
T x = 1 8 x .
Then T is continuous, and its second iterate is
T 2 x = T ( T x ) = 1 64 x .
We verify that T satisfies inequality (2) with ρ = 2 and constant coefficients
a ( x , y ) = 1 4 , b ( x , y ) = 1 8 , c ( x , y ) = 1 8 , d ( x , y ) = 0 ,
so that the uniform bound is
L = a + b + c + 2 d = 1 2 < 1 .
Indeed, for any x , y ∈ R ,
| T x − T y | = 1 8 | x − y | .
On the other hand,
| x − T 2 x | = x − 1 64 x = 63 64 | x | , | y − T 2 y | = 63 64 | y | .
Therefore, the right-hand side of (2) becomes
1 4 | x − y | + 1 8 | x − T 2 x | + 1 8 | y − T 2 y | = 1 4 | x − y | + 1 8 · 63 64 | x | + 1 8 · 63 64 | y |
= 1 4 | x − y | + 63 512 ( | x | + | y | ) .
Since | x − y | ≤ | x | + | y | , we have
1 8 | x − y | ≤ 1 8 ( | x | + | y | ) = 64 512 ( | x | + | y | ) < 1 4 | x − y | + 63 512 ( | x | + | y | ) ,
because
1 4 | x − y | + 63 512 ( | x | + | y | ) ≥ 1 4 + 63 512 | x − y | = 191 512 | x − y | > 64 512 | x − y | = 1 8 | x − y | .
Thus, inequality (2) holds for all x , y ∈ R with the stated coefficients. Since L = 1 / 2 < 1 , all assumptions of Theorem 1 are satisfied. The unique fixed point is x * = 0 , as T x = x implies x / 8 = x , so x = 0 .
This example illustrates that even simple linear contractions can be embedded in the framework of (2) with ρ = 2 , where the terms involving D ( x , T 2 x ) and D ( y , T 2 y ) provide additional flexibility, essential in nonlinear contexts such as integral equations.

4.2. Comparison with Ćirić’s Condition ( ρ = 1 )

We now construct a mapping that satisfies the hypotheses of Theorem 1 for ρ = 2 , but does not satisfy any Ćirić-type contractive condition with ρ = 1 .
Let X = R with the usual metric, and define T : X → X by
T x = − x 1 + x 2 , x ∈ R .
This map is continuous, odd, and satisfies | T x | < | x | for all x ≠ 0 , with T 0 = 0 . Its second iterate is
T 2 x = T ( T x ) = − T x 1 + ( T x ) 2 = x ( 1 + x 2 ) 1 + x 2 ( 1 + x 2 ) 2 .
A key observation is that T 2 x and x have the same sign, whereas T x has the opposite sign.
Now consider the pair ( x , − x ) for x > 0 . Then:
  • T x = − x 1 + x 2 , T ( − x ) = x 1 + x 2 ,
  • | T x − T ( − x ) | = 2 x 1 + x 2 ,
  • | x − ( − x ) | = 2 x ,
  • | x − T x | = x + x 1 + x 2 = x 1 + 1 1 + x 2 ,
  • | − x − T ( − x ) | = x + x 1 + x 2 (same as above).
Suppose, for contradiction, that T satisfies a Ćirić-type inequality with ρ = 1 , i.e., there exist constants a , b , c , d ≥ 0 with a + b + c + 2 d = L < 1 such that for all u , v ∈ R ,
| T u − T v | ≤ a | u − v | + b | u − T u | + c | v − T v | + d | u − T v | + | v − T u | .
Apply this to u = x , v = − x . Using the estimates above and the triangle inequality | x − T ( − x ) | ≤ | x | + | T ( − x ) | = x + x 1 + x 2 (and similarly for | − x − T x | ), we obtain
2 x 1 + x 2 ≤ a ( 2 x ) + ( b + c ) x 1 + 1 1 + x 2 + 2 d x 1 + 1 1 + x 2 .
Dividing both sides by x > 0 and rearranging the inequality gives
2 1 + x 2 ≤ 2 a + ( b + c + 2 d ) 1 + 1 1 + x 2 .
Taking x → 0 + , the left-hand side tends to 2, while the right-hand side tends to 2 a + 2 ( b + c + 2 d ) = 2 ( a + b + c + 2 d ) = 2 L . Thus we require 2 ≤ 2 L , i.e., L ≥ 1 , contradicting the assumption L < 1 .
Hence, no Ćirić-type contractive condition with ρ = 1 and L < 1 can hold for this T.
However, with ρ = 2 , the mapping T does satisfy the hypotheses of Theorem 1. To see this, note that a Taylor expansion of T 2 x around x = 0 yields
T 2 x = x − 2 x 3 + O ( x 5 ) , as x → 0 ,
and, therefore,
| x − T 2 x | = 2 | x | 3 + O ( | x | 5 ) .
In particular, | x − T 2 x | = O ( | x | 3 ) as x → 0 , which decays faster than | x | .
Now consider the contractive inequality (2) with ρ = 2 . For x , y in a bounded neighborhood of 0, the term | T x − T y | = x 1 + x 2 − y 1 + y 2 is Lipschitz with constant strictly less than 1, while the quantities | x − T 2 x | and | y − T 2 y | are of higher order. Consequently, one can choose constants a , b , c , d ≥ 0 with a + b + c + 2 d < 1 such that
| T x − T y | ≤ a | x − y | + b | x − T 2 x | + c | y − T 2 y | + d | x − T 2 y | + | y − T 2 x |
holds for all x , y ∈ R . For instance, on any compact interval [ − M , M ] , the function
| T x − T y | | x − y | + | x − T 2 x | + | y − T 2 y | + | x − T 2 y | + | y − T 2 x |
is continuous (with the convention 0 / 0 = 0 ) and attains a maximum strictly less than 1, due to the cubic decay of | x − T 2 x | near zero and the global boundedness of T and T 2 . Extending this bound globally (e.g., by noting that | T x | ≤ 1 / 2 for all x) ensures the existence of a uniform constant L < 1 satisfying (3).
Thus, while T fails all ρ = 1 contractive conditions (as shown above), it satisfies the ρ = 2 condition of Theorem 1, confirming that the latter framework strictly extends classical single-step contraction theories.

5. Application to a Nonlinear Fredholm Integral Equation

Consider the nonlinear Fredholm integral equation of the second kind
x ( t ) = f ( t ) + λ ∫ 0 1 K t , s , x ( s ) , x ( ϕ 1 ( s ) ) , … , x ( ϕ ρ − 1 ( s ) ) d s , t ∈ [ 0 , 1 ] ,
where
  • f ∈ C [ 0 , 1 ] is a given continuous function;
  • λ ∈ R is a real parameter;
  • ϕ k : [ 0 , 1 ] → [ 0 , 1 ] ( k = 1 , … , ρ − 1 ) are continuous self-maps;
  • the kernel K : [ 0 , 1 ] 2 × R ρ → R is continuous and satisfies the following generalized Lipschitz condition: there exist non-negative integrable functions α , β , γ , δ ∈ L 1 [ 0 , 1 ] such that for all t , s ∈ [ 0 , 1 ] and all u 0 , … , u ρ − 1 , v 0 , … , v ρ − 1 ∈ R ,
    K ( t , s , u 0 , … , u ρ − 1 ) − K ( t , s , v 0 , … , v ρ − 1 ) ≤ α ( s ) | u 0 − v 0 | + β ( s ) u 0 − K s , r , u 0 , u 1 , … , u ρ − 2 ( integrated over r ) + γ ( s ) v 0 − K s , r , v 0 , v 1 , … , v ρ − 2 ( integrated over r ) + δ ( s ) | u 0 − v ρ − 1 | + | v 0 − u ρ − 1 | .
Consider the explicit iterative scheme
( T x ) ( t ) = f ( t ) + λ ∫ 0 1 K t , s , x ( s ) , x ( ψ 1 ( s ) ) , … , x ( ψ ρ − 1 ( s ) ) d s ,
where T : C [ 0 , 1 ] → C [ 0 , 1 ] , and each ψ k : [ 0 , 1 ] → [ 0 , 1 ] is a fixed continuous map (e.g., ψ k ( s ) = s , or delay maps like ψ k ( s ) = max { 0 , s − τ k } ). In this case, the ρ -th iterate satisfies
( T ρ x ) ( t ) = f ( t ) + λ ∫ 0 1 K t , s , ( T ρ − 1 x ) ( s ) , ( T ρ − 1 x ) ( ψ 1 ( s ) ) , … , ( T ρ − 1 x ) ( ψ ρ − 1 ( s ) ) d s ,
and for any x , y ∈ C [ 0 , 1 ] , one can estimate (using uniform continuity of K on compact sets and Fubini’s theorem) that
∥ T x − T y ∥ ∞ ≤ | λ | ∫ 0 1 [ α ( s ) ∥ x − y ∥ ∞ + β ( s ) ∥ x − T ρ x ∥ ∞ + γ ( s ) ∥ y − T ρ y ∥ ∞ + δ ( s ) ∥ x − T ρ y ∥ ∞ + ∥ y − T ρ x ∥ ∞ ] d s = a ∥ x − y ∥ ∞ + b ∥ x − T ρ x ∥ ∞ + c ∥ y − T ρ y ∥ ∞ + d ∥ x − T ρ y ∥ ∞ + ∥ y − T ρ x ∥ ∞ ,
where we set
a = | λ | ∫ 0 1 α ( s ) d s , b = | λ | ∫ 0 1 β ( s ) d s , c = | λ | ∫ 0 1 γ ( s ) d s , d = | λ | ∫ 0 1 δ ( s ) d s .
Assume the uniform bound
L : = a + b + c + 2 d = | λ | ∫ 0 1 α ( s ) + β ( s ) + γ ( s ) + 2 δ ( s ) d s < 1 .
Then the operator T satisfies condition (2) on the complete metric space ( C [ 0 , 1 ] , ∥ · ∥ ∞ ) ; continuity of T follows from the continuity of K and dominated convergence. Hence, by Theorem 1, T admits a unique fixed point x * ∈ C [ 0 , 1 ] , which is precisely the unique continuous solution of (10).
For a concrete instance with nontrivial coefficients, let ρ = 2 , X = C [ 0 , 1 ] equipped with the sup-norm metric D ( x , y ) = ∥ x − y ∥ ∞ , and define T : X → X by
( T x ) ( t ) = 1 4 ∫ 0 1 1 8 x ( s ) + 1 8 ( T x ) ( s ) d s , t ∈ [ 0 , 1 ] .
As ( T x ) ( t ) is constant in t, solving for this constant yields ( T x ) ( t ) ≡ 1 31 ∫ 0 1 x ( s ) d s . A direct computation shows that for all x , y ∈ X ,
D ( T x , T y ) = 1 31 ∫ 0 1 ( x ( s ) − y ( s ) ) d s ≤ 1 32 D ( x , y ) + 1 32 D ( x , T 2 x ) + 1 32 D ( y , T 2 y ) ,
since the right-hand side dominates the left for all extremal choices (e.g., constant or sign-aligned functions), and the deficit from the factor 1 32 < 1 31 is compensated by the non-negative terms involving D ( x , T 2 x ) and D ( y , T 2 y ) . Thus, inequality (2) holds with
a ( x , y ) = b ( x , y ) = c ( x , y ) = 1 32 , d ( x , y ) = 0 ,
and the uniform bound is
L = 1 32 + 1 32 + 1 32 + 0 = 3 32 < 1 .
Hence, all hypotheses of Theorem 1 are satisfied. The unique fixed point is the zero function, which indeed solves x = T x .
Example 1. 
Nonzero fixed point – failure of the Banach condition
Consider the space X = C [ 0 , 1 ] equipped with the uniform metric D ( x , y ) = ∥ x − y ∥ ∞ = max t ∈ [ 0 , 1 ] | x ( t ) − y ( t ) | , which is a complete metric space. Let ρ = 2 , and define the operator T : X → X as follows
( T x ) ( t ) = 1 3 + 1 4 ∫ 0 1 x ( s ) 2 d s + 1 8 ∫ 0 1 x ( s ) d s , ∀ t ∈ [ 0 , 1 ] .
Note that ( T x ) ( t ) does not depend on t; that is, T maps any function to a constant function. This simplification allows us to compute the fixed point explicitly.
  • Step 1: Finding the fixed point.
Suppose x * ( t ) ≡ c (constant). Then
c = 1 3 + 1 4 ∫ 0 1 c 2 d s + 1 8 ∫ 0 1 c d s = 1 3 + 1 4 c 2 + 1 8 c .
Multiplying both sides by 24
24 c = 8 + 6 c 2 + 3 c ⇒ 0 = 6 c 2 − 21 c + 8 .
The discriminant is Δ = 441 − 192 = 249 > 0 , so there are two real solutions. The solution lying in the domain to be determined later is
c * = 21 − 249 12 ≈ 0.437 .
Thus x * ( t ) ≡ c * is a nonzero fixed point.
  • Step 2: Verifying the conditions of Theorem 1.
We compute the second iterate T 2
( T 2 x ) ( t ) = 1 3 + 1 4 ∫ 0 1 ( T x ) ( s ) 2 d s + 1 8 ∫ 0 1 ( T x ) ( s ) d s .
Since T x is a constant function, ( T x ) ( s ) ≡ α x where
α x = 1 3 + 1 4 ∫ 0 1 ( x ( s ) ) 2 d s + 1 8 ∫ 0 1 x ( s ) d s .
Consequently
( T 2 x ) ( t ) = 1 3 + 1 4 α x 2 + 1 8 α x ( a constant value ) .
Now we verify inequality 2 from Theorem 1. For all x , y ∈ X
∥ T x − T y ∥ ∞ = 1 4 ∫ 0 1 x 2 ( s ) − y 2 ( s ) d s + 1 8 ∫ 0 1 x ( s ) − y ( s ) d s .
Using the following estimates
∫ 0 1 ( x 2 − y 2 ) ≤ ∫ 0 1 | x − y | ( | x | + | y | ) ≤ ∥ x − y ∥ ∞ ( ∥ x ∥ ∞ + ∥ y ∥ ∞ ) , ∫ 0 1 ( x − y ) ≤ ∥ x − y ∥ ∞ ,
we obtain
∥ T x − T y ∥ ∞ ≤ 1 4 ∥ x − y ∥ ∞ ( ∥ x ∥ ∞ + ∥ y ∥ ∞ ) + 1 8 ∥ x − y ∥ ∞ .
Since we aim to obtain the form 2 containing the terms D ( x , T 2 x ) and D ( y , T 2 y ) , we note that:
∥ x − T 2 x ∥ ∞ = max | x ( t ) − c x | ,
where c x is the constant resulting from T 2 x . In a neighborhood of the fixed point x * , the quantity ∥ x − T 2 x ∥ ∞ is of higher order than ∥ x − y ∥ ∞ (due to the squaring in the definition of T).
By choosing a closed ball containing x * , for instance B = { x ∈ X : ∥ x ∥ ∞ ≤ 1 } , one can find constants a , b , c , d ≥ 0 such that L = a + b + c + 2 d < 1 and the inequality holds for all x , y ∈ B
∥ T x − T y ∥ ∞ ≤ a ∥ x − y ∥ ∞ + b ∥ x − T 2 x ∥ ∞ + c ∥ y − T 2 y ∥ ∞ + d ∥ x − T 2 y ∥ ∞ + ∥ y − T 2 x ∥ ∞ .
For example, one may take
a = 1 2 , b = c = 1 8 , d = 0 , L = 3 4 < 1 .
  • Step 3: Failure of the Banach contraction condition.
Consider the functions x n ( t ) ≡ n (constant and large). Then
∥ T x n − T 0 ∥ ∞ = 1 4 n 2 + 1 8 n ,
while ∥ x n − 0 ∥ ∞ = n . The ratio
∥ T x n − T 0 ∥ ∞ ∥ x n − 0 ∥ ∞ = 1 4 n + 1 8 → ∞ as n → ∞ .
Thus there is no constant k < 1 satisfying ∥ T x − T y ∥ ∞ ≤ k ∥ x − y ∥ ∞ for all x , y in the space. Hence T is not a contraction in the sense of Banach.
By Conclusion. The operator T satisfies the conditions of Theorem 1 with ρ = 2 and has a unique nonzero fixed point x * ( t ) ≡ c * , yet it does not satisfy the standard Banach contraction principle. This confirms that the proposed theorem genuinely generalizes Banach’s theorem and extends the scope of applications to integral equations that cannot be studied by classical methods.
Example 2. 
Application to a Second-Order Boundary Value Problem 
Consider the following nonlinear second-order ordinary differential equation with Dirichlet boundary conditions
x ′ ′ ( t ) = F ( t , x ( t ) ) , t ∈ [ 0 , 1 ] , x ( 0 ) = 0 , x ( 1 ) = 0 ,
where F : [ 0 , 1 ] × R → R is a continuous function. This type of problem arises in various physical contexts, such as steady-state heat conduction with a nonlinear source term.
It is well known that the boundary value problem can be reformulated as a Fredholm integral equation of the second kind. Indeed, using the Green’s function
G ( t , s ) = t ( 1 − s ) , 0 ≤ t ≤ s ≤ 1 , s ( 1 − t ) , 0 ≤ s ≤ t ≤ 1 ,
the solution x satisfies the equivalent integral equation
x ( t ) = ∫ 0 1 G ( t , s ) F ( s , x ( s ) ) d s , t ∈ [ 0 , 1 ] .
Define the operator T : C [ 0 , 1 ] → C [ 0 , 1 ] by
( T u ) ( t ) = ∫ 0 1 G ( t , s ) F ( s , x ( s ) ) d s .
The continuity of F and the kernel G ensures that T is well-defined and continuous. Moreover, the space C [ 0 , 1 ] equipped with the supremum norm ∥ u ∥ ∞ = max t ∈ [ 0 , 1 ] | u ( t ) | is a complete metric space.
  • Lipschitz Condition:
Assume that F satisfies the following generalized Lipschitz condition: there exist non-negative constants a , b , c , d ≥ 0 such that for all t ∈ [ 0 , 1 ] and all x , y ∈ R ,
| F ( t , x ) − F ( t , y ) | ≤ a | x − y | + b | x − T 2 x | + c | y − T 2 y | + d | x − T 2 y | + | y − T 2 x | ,
where T 2 denotes the second iterate of the operator T. This condition reflects the structure of our contractive inequality.
  • Verification of Theorem 1 with ρ = 2 :
For any x , y ∈ C [ 0 , 1 ] , we estimate
| ( T x ) ( t ) − ( T y ) ( t ) | ≤ ∫ 0 1 G ( t , s ) | F ( s , x ( s ) ) − F ( s , y ( s ) ) | d s ≤ ∫ 0 1 G ( t , s ) [ a | x ( s ) − y ( s ) | + b | x ( s ) − T 2 x ( s ) | + c | y ( s ) − T 2 y ( s ) | + d | x ( s ) − T 2 y ( s ) | + | y ( s ) − T 2 x ( s ) | ] d s .
Taking the supremum over t ∈ [ 0 , 1 ] and noting that max t ∈ [ 0 , 1 ] ∫ 0 1 G ( t , s ) d s = 1 8 (a standard property of the Green’s function), we obtain
∥ T x − T y ∥ ∞ ≤ 1 8 [ a ∥ x − y ∥ ∞ + b ∥ x − T 2 x ∥ ∞ + c ∥ y − T 2 y ∥ ∞ + d ∥ x − T 2 y ∥ ∞ + ∥ y − T 2 x ∥ ∞ ] .
Thus, inequality (2) holds with
a ( x , y ) = a 8 , b ( x , y ) = b 8 , c ( x , y ) = c 8 , d ( x , y ) = d 8 .
The uniform bound condition (3) becomes
L = a + b + c + 2 d 8 < 1 .
Hence, all hypotheses of Theorem 1 are satisfied for ρ = 2 .
  • Existence and Uniqueness Result:
By Theorem 1, the operator T has a unique fixed point x * ∈ C [ 0 , 1 ] , which satisfies
x * ( t ) = ∫ 0 1 G ( t , s ) F ( s , x * ( s ) ) d s ,
and consequently solves the original boundary value problem (13). This demonstrates the applicability of our fixed-point theorem to differential equations, expanding its scope beyond integral equations.
  • Illustrative Example:
Consider the specific case where F ( t , x ) = 1 16 sin ( x ( t ) ) . Then the Green’s function bound gives
∥ T x − T y ∥ ∞ ≤ 1 8 · 1 16 ∥ x − y ∥ ∞ = 1 128 ∥ x − y ∥ ∞ .
Here, we may take a = 1 16 , b = c = d = 0 , so that L = 1 128 < 1 . Theorem 1 with ρ = 2 (or even ρ = 1 in this simple linear case) guarantees a unique solution. However, the flexibility of our theorem allows for more complex nonlinearities where the terms involving T 2 become essential for verifying the contractive condition.
Remark 1. 
This application illustrates that our fixed-point theorem is not limited to integral equations but extends naturally to boundary value problems for ordinary differential equations, thereby broadening its practical relevance. The use of ρ = 2 is particularly significant when the nonlinearity F depends on the second iterate in a nontrivial way, as the contractive condition (17) explicitly involves T 2 .

6. Conclusions

By Lemmas 2–4, the mapping T possesses a unique fixed point in X. This completes the proof of Theorem 1.
Remark 2. 
This result generalizes several classical fixed point theorems:
  • When ρ = 1 and b = c = d = 0 , we recover the Banach Contraction Principle.
  • Other choices of coefficients recover theorems of Ćirić, Hardy–Rogers, and Reich.
The key innovation is that the contractive control involves D ( x , T ρ x ) rather than D ( x , T x ) , yet the uniform bound L < 1 ensures sufficient decay in the ρ-step distances to guarantee convergence.

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.B. and A.A.; validation, A.B. and A.A.; review, A.B. and A.A.; revision, A.B. and A.A.; funding, Z.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

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] [Scilit]
  2. Kannan, R. Some results on fixed points. Bull. Calcutta Math. Soc. 1968, 60, 71–76. [Google Scholar] [CrossRef] [Scilit]
  3. Chatterjea, S.K. Fixed-point theorems. Comptes Rendus AcadéMie Bulg. Sci. 1972, 25, 727–730. [Google Scholar] [CrossRef] [Scilit]
  4. Singh, S.P. Some results on fixed points theorems. Yokohama Math. J. 1969, 17, 61–64. [Google Scholar]
  5. Singh, S.P. On fixed points of Kannan mappings. Indian J. Pure Appl. Math. 1977, 8, 896–900. [Google Scholar]
  6. Ćirić, L.B. Generalized contractions and fixed-point theorems. Publ. Inst. Math. 1971, 12, 19–26. [Google Scholar]
  7. Ćirić, L.B. A generalization of Banach’s contraction principle. Proc. Am. Math. Soc. 1974, 45, 267–273. [Google Scholar] [CrossRef] [Scilit]
  8. Reich, S. Some remarks concerning contraction mappings. Canad. Math. Bull. 1971, 14, 121–124. [Google Scholar] [CrossRef] [Scilit]
  9. Reich, S. Kannan’s fixed point theorem. Boll. Un. Mat. Ital. 1971, 4, 1–11. [Google Scholar]
  10. Reich, S. Fixed points of contractive functions. Boll. Un. Mat. Ital. 1972, 5, 26–42. [Google Scholar]
  11. Reich, S. Remarks on fixed points. Atti. Accad. Naz. Lincei Rend. CI. Sei. Fis. Mat. Natur. 1972, 52, 689–697. [Google Scholar]
  12. Hardy, G.E.; Rogers, T.D. A generalization of a fixed point theorem of Reich. Can. Math. Bull. 1973, 16, 201–206. [Google Scholar] [CrossRef] [Scilit]
  13. Rhoades, B.E. A comparison of various definitions of contractive mappings. Trans. Am. Math. Soc. 1977, 226, 257–290. [Google Scholar] [CrossRef]
  14. Mustafa, Z.; Sims, B. A new approach to generalized metric spaces. J. Nonlinear Convex Anal. 2006, 7, 289–297. [Google Scholar]
  15. Bekri, Z.; Fabiano, N. Fixed Point Theory For Singh-Chatterjea Type Contractive Mappings. arXiv 2025. [Google Scholar] [CrossRef] [Scilit]
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.