Skip to Content
MathematicsMathematics
  • Article
  • Open Access

24 September 2026

24 Pages

Permutation Contractions in Complete b-Metric Spaces: Fixed Point Results and Applications

Computer Science and Engineering Department, College of Applied Studies, King Saud University, Riyadh 11437, Saudi Arabia

Abstract

Permutation contractions have recently been investigated as a flexible generalization of classical contractive conditions through suitable combinations of orbit distances. In this paper, we study permutation contractions on a complete b-metric space and establish a generalized Banach-type fixed point theorem ensuring the existence and uniqueness of a fixed point. We further derive a per-term dominated version in which each orbital distance is controlled by the base distance, leading to a global contractive condition and a corresponding fixed point theorem. As a consequence, suitable Kannan- and restricted Hardy–Rogers-type fixed point results are obtained under additional assumptions. To illustrate the applicability of the theoretical results, we apply the obtained fixed point principles to prove the existence and uniqueness of solutions of a linear system of equations and to the existence of a solution for a second-order boundary value problem. These results demonstrate that permutation contractions provide a flexible framework for extending fixed point techniques in b-metric spaces.

1. Introduction and Preliminaries

Fixed point (FP) theory provides a fundamental framework for the analysis of nonlinear problems arising in analysis, differential equations [1,2], integral equations [3,4], and applied mathematics. The classical Banach contraction principle [5] is one of the central results in this area, establishing the existence and uniqueness of an FP for a contraction on a complete metric space. Since its introduction, numerous generalizations have been developed by modifying either the underlying space or the contractive condition. In particular, Kannan-type contractions [6,7,8] and Chatterjea-type contractions [9] have provided important extensions of the classical Banach principle by incorporating different combinations of distances. These developments show that the choice of the distances appearing in a contractive condition can substantially enlarge the class of mappings for which FP results remain valid.
In parallel with these developments, the classical metric framework has been extended in numerous directions to accommodate more flexible notions of distance and to broaden the scope of FP theory. Among the early developments, Branciari introduced rectangular metric spaces [10,11] by replacing the classical triangle inequality with a four-point inequality, while Matthews [12,13] proposed partial metric spaces in which the self-distance of a point need not vanish. Further generalizations include quasi-metric spaces, cone metric spaces and dislocated metric spaces, each providing a distinct modification of the underlying metric structure while preserving suitable properties for convergence and FP analysis. In this continuing development, b-metric spaces, introduced by Czerwik in [14], have emerged as a particularly useful and widely studied framework in which the standard triangle inequality is relaxed by means of a constant b ≥ 1 . The triangle inequality makes the b-metric spaces particularly suitable for studying nonlinear operators for which the standard metric framework is too restrictive [15,16]. FP principles in these spaces provide useful tools for treating a broad range of nonlinear problems. Let us recall the definition of a b-metric space.
Definition 1.
Let Υ be a nonempty set and b ≥ 1 . A b-metric is a function B ̲ : Y × Y → [ 0 , ∞ ) such that for all a 1 , a 2 , a 3 ∈ Y ,
1.
B ̲ ( a 1 , a 2 ) = 0 ⟺ a 1 = a 2 ;
2.
B ̲ ( a 1 , a 2 ) = B ̲ ( a 2 , a 1 ) ;
3.
B ̲ ( a 1 , a 2 ) ≤ b [ B ̲ ( a 1 , a 3 ) + B ̲ ( a 3 , a 2 ) ] .
From this perspective, the generalization of the underlying distance structure is closely connected with the broader question of which metric quantities should enter a contractive condition. Classical contraction schemes typically involve only a finite collection of distances associated with two points and their first images. A more flexible approach is obtained by considering distances along the entire orbit of the mapping. For a self-map F : Y → Y , this leads naturally to the family of ( p , q ) -orbit distances B ̲ p , q ( e , h ) = B ̲ ( F p e , F q h ) , p , q ∈ N . Such a formulation simultaneously encompasses the distance between the original points, the distance between their images, mixed point–image distances, and displacement terms of the form ( B ̲ ( e , F e ) ) and ( B ̲ ( h , F h ) ) . It therefore provides a natural mechanism for placing various classical contraction conditions within a common orbit-based framework.
Recently, Ayoob and Mlaiki [17] developed a permutation contraction framework in which the contractive condition involves an infinite weighted collection of orbital distances B ̲ ( F p x , F q y ) with the terms arranged according to an arbitrary permutation. Their results provide a unified formulation encompassing several classical contraction conditions, including some contractions, and establish corresponding FP results in a complete metric spaces. This framework contains many familiar contraction schemes as special cases while allowing interactions between arbitrarily high iterates of the mapping. In particular, it provides a unified setting in which the structure of the contractive condition is determined not only by the mapping itself but also by the selection, weighting, and permutation of orbit distances. The following definition introduce the orbit and orbit distances needed next to define the permutation contraction.
Definition 2
([17]). Let ( Y , B ̲ ) be a metric space and let F : Y → Y be a self-map. For any u ∈ Y , the (forward) orbit of u under F is defined by
O ( u ) = { F n u : n ∈ N } .
For a pair ( u , v ) ∈ Y × Y and integers p , q ∈ N , the ( p , q ) -orbit distance is defined by
B ̲ p , q ( u , v ) = B ̲ F p u , F q v ∈ [ 0 , ∞ ) .
To systematically enumerate all such ( p i , q i ) -orbit distances, fix a bijection
ι : N ⟶ N × N , ι ( i ) = ( p i , q i ) ,
and define the corresponding infinite sequence
B ̲ i ( u , v ) = B ̲ p i , q i ( u , v ) = B ̲ F p i u , F q i v , i ∈ N .
As particular cases, the metric distances underlying the classical contraction conditions can be recovered as follows.
Remark 1.
Many of the standard contractive conditions encountered in FP theory admit a common description in terms of distances between suitable iterates of the mapping. This observation motivates the introduction of the general distance expression B ̲ p , q ( u , v ) , from which a number of familiar configurations emerge as special instances. The principal cases are listed below:
B ̲ 0 , 0 ( u , v ) = B ̲ ( u , v ) , ( t h e d i s t a n c e b e t w e e n t h e i n i t i a l p o i n t s ) B ̲ 1 , 1 ( u , v ) = B ̲ ( F u , F v ) , ( t h e d i s t a n c e b e t w e e n t h e i r f i r s t i m a g e s ) B ̲ 0 , 1 ( u , v ) = B ̲ ( u , F v ) , ( a m i x e d p o i n t – i m a g e d i s t a n c e ) B ̲ 1 , 0 ( u , v ) = B ̲ ( F u , v ) , ( t h e c o m p l e m e n t a r y m i x e d i s t a n c e ) B ̲ 0 , 1 ( u , u ) = B ̲ ( u , F u ) , ( s e l f - d i s t a n c e o f u u n d e r F ) B ̲ 0 , 1 ( v , v ) = B ̲ ( v , F v ) , ( s e l f - d i s t a n c e o f v u n d e r F )
Severals contraction schemes can be formulated through suitable combinations of these six fundamental distances.
The permutation contraction is defined as follows:
Definition 3
([17]). Let ( Y , B ̲ ) be a metric space and F : Y → Y a self-map. Fix a permutation τ : N → N and a sequence of non-negative real numbers ( c i ) i ≥ 1 such that
Λ = ∑ i = 1 ∞ c i < 1 .
Then, F is said to be a permutation contraction if for all u , v ∈ Y ,
B ̲ ( F u , F v ) ≤ ∑ i = 1 ∞ c i B ̲ τ ( i ) ( u , v ) ,
where each B ̲ τ ( i ) ( u , v ) denotes the ( p τ ( i ) , q τ ( i ) ) -orbit distance
B ̲ τ ( i ) ( u , v ) = B ̲ F p τ ( i ) u , F q τ ( i ) v ,
with ( p j , q j ) representing the enumeration of N × N .
Concerning the convergence of the infinite series, since the non-negative coefficients ( c i ) i ≥ 1 are summable, with Λ = ∑ i = 1 ∞ c i < 1 , the infinite weighted sum in the contractive condition is well defined whenever the associated orbital distances are uniformly bounded. This requirement is fulfilled, in particular, if the Picard orbit { u ( n ) } is bounded.
Remark 2.
The permutation contraction introduced above provides a unified framework encompassing a variety of classical contractive mappings. Appropriate choices of the weights ( c i ) and the permutation τ recover several familiar contraction conditions, including the following fundamental cases:
  • Banach contraction: Choose c 1 = k with 0 ≤ k < 1 , and c i = 0 for i ≥ 2 , together with B ̲ τ ( 1 ) ( u , v ) = B ̲ ( u , v ) . Then, the inequality reduces to
    B ̲ ( F u , F v ) ≤ k B ̲ ( u , v ) .
  • Kannan contraction: Choose c 1 = c 2 = k with 0 ≤ k < 1 2 , and c i = 0 for i ≥ 3 , with B ̲ τ ( 1 ) ( u , v ) = B ̲ ( u , F u ) and B ̲ τ ( 2 ) ( u , v ) = B ̲ ( v , F v ) . Then,
    B ̲ ( F u , F v ) ≤ k B ̲ ( u , F u ) + B ̲ ( v , F v ) .
Despite the elegance of the permutation contraction framework proposed by Ayoob and Mlaiki [17], its development and related FP theorems have so far been limited to standard metric spaces. In these spaces, the usual triangle inequality is always true. On the hand, FP theory in b-metric spaces [14,15,16] has been well developed to deal with nonlinear operators under more flexible geometric conditions. However, the existing research does not have a way to extend infinite orbital permutation contractions to spaces that have a parameter b ≥ 1 . Also, the way the structural parameter b interacts with weighted series of orbit distances has not been studied at all. This includes how relaxed triangle conditions affect the convergence rules of Kannan-type estimates and how operators can be used in value problems.
To fill this gap, in this paper, we take the permutation contraction framework and apply it to complete b-metric spaces. We show that there is an FP for infinite weighted permutation contractions under b-metric limits. We also create Kannan- and Hardy–Rogers-type conditions as specific examples. Finally, we show how these ideas work in situations like second-order boundary value problems and linear systems.
The remainder of the paper is organized as follows. Section 2 contains the main FP results for permutation contractions on a complete b-metric space ( C − B m ), including the per-term dominated case. We also obtain Kannan- and restricted Hardy–Rogers-type results as special cases. Section 3 presents applications to a linear system of equations and a second-order boundary value problem to highlight the versatility of permutation contractions in b-metric spaces. Finally, Section 4 concludes the paper and outlines possible directions for further research.

2. Main Results

2.1. Fixed Point Result for Permutation-Based Contractions

We first establish the main FP theorem for permutation contractions on a C − B m . The result provides sufficient conditions, expressed through the weighted orbit-distance, that ensure the convergence of the associated Picard iteration and, consequently, the existence and uniqueness of an FP.
Theorem 1.
Let ( Y , B ̲ ) be a C − B m and let F : Y → Y be a permutation contraction in the sense that
B ̲ ( F u , F v ) ≤ ∑ i = 1 ∞ c i B ̲ τ ( i ) ( u , v ) , B ̲ p , q ( u , v ) = B ̲ ( F p u , F q v ) ,
for some non-negative weights ( c i ) i ≥ 1 with Λ = ∑ i = 1 ∞ c i < ∞ and a permutation τ : N → N of a fixed enumeration { ( p i , q i ) } i ≥ 1 of N × N . Assume there exist non-negative numbers { δ i } i ≥ 1 and { Δ i } i ≥ 1 such that for every z ∈ Y and every n ≥ 1 , one has the bound
B ̲ F n + p i z , F n − 1 + q i z ≤ δ i B ̲ F n z , F n − 1 z + Δ i B ̲ F n + 1 z , F n z , ∀ i ∈ N .
Set
M 1 = ∑ i = 1 ∞ c i δ i , M 2 = ∑ i = 1 ∞ c i Δ i .
Suppose
M 2 < 1 , b M 1 + M 2 < 1 a n d Λ > 1 b 3 − M 1 1 − M 2 .
Then, F has a unique fixed point s ∈ Y .
Proof. 
Fix u ( 0 ) ∈ Y and define u ( n ) = F n u ( 0 ) and B n = B ̲ ( u ( n + 1 ) , u ( n ) ) for n ≥ 0 . Applying (1) to the pair ( u ( n ) , u ( n − 1 ) ) and using B ̲ p , q ( u ( n ) , u ( n − 1 ) ) = B ̲ ( F n + p u ( 0 ) , F n − 1 + q u ( 0 ) ) yields
B n = B ̲ ( u ( n + 1 ) , u ( n ) ) ≤ ∑ i = 1 ∞ c i B ̲ F n + p i u ( 0 ) , F n − 1 + q i u ( 0 ) , n ≥ 1 .
By (2) with z = u ( 0 ) , we have, termwise in the sum,
B ̲ F n + p i u ( 0 ) , F n − 1 + q i u ( 0 ) ≤ δ i B n − 1 + Δ i B n , n ≥ 1 .
Upon applying (5) and (6), we deduce that
B n ≤ ∑ i = 1 ∞ c i δ i B n − 1 + ∑ i = 1 ∞ c i Δ i B n = M 1 B n − 1 + M 2 B n .
Since M 2 < 1 , inequality (7) may be rewritten as
( 1 − M 2 ) B n ≤ M 1 B n − 1 ⟹ B n ≤ α B n − 1 , α = M 1 1 − M 2 ∈ [ 0 , 1 ) .
Applying (8) successively, we obtain
B n ≤ α n B 0 = α n B ̲ ( u ( 1 ) , u ( 0 ) ) , n ≥ 0 .
From (9) and using the triangle inequality for m > n , we obtain
B ̲ ( u ( m ) , u ( n ) ) ≤ ∑ k = n m − 1 b k − n + 1 B k ≤ B 0 b 1 − n ∑ k = n m − 1 ( b α ) k ≤ B 0 b 1 − n ∑ k = n ∞ ( b α ) k ≤ b 1 − n B ̲ ( u ( 1 ) , u ( 0 ) ) ( b α ) n 1 − b α
Since b ≥ 1 and using condition (4), then b 1 − n ≤ 1 and b α < 1 . It follows that { u ( n ) } is a Cauchy sequence; since Y is complete, there exists s ∈ Y such that u ( n ) → s .
We next verify that s is an FP. Since u ( n + 1 ) = F u ( n ) and the metric is continuous, passing to the limit as n → ∞ gives
B ̲ ( F s , s ) ≤ b [ B ̲ ( F s , u ( n + 1 ) ) + B ̲ ( u ( n + 1 ) , s ) ] ⟶ b lim sup n → ∞ B ̲ ( F s , u ( n + 1 ) ) .
Applying (1) to the pair ( s , u ( n ) ) gives
B ̲ ( F s , u ( n + 1 ) ) = B ̲ ( F s , F u ( n ) ) ≤ ∑ i = 1 ∞ c i B ̲ F p i s , F q i u ( n ) .
Fixing i, the finiteness of q i ∈ N and the convergence u ( n ) → s ensure that F q i u ( n ) → F q i s . Furthermore, combining the triangle inequality with the geometric estimate in (9), we deduce that
B ̲ F p i s , F q i u ( n ) ≤ b [ B ̲ F p i s , F q i s + B ̲ F q i s , F q i u ( n ) ] → n → ∞ b B ̲ F p i s , F q i s .
The non-negativity of the series terms allows us to apply Fatou’s lemma; combined with (12) and (13), this yields
lim sup n → ∞ B ̲ ( F s , u ( n + 1 ) ) ≤ ∑ i = 1 ∞ b c i B ̲ F p i s , F q i s .
For a fixed i, we apply (2) by setting z = s and n = 1 . Thus, all indices involved in the resulting inequality are non-negative, and we obtain
B ̲ F 1 + p i s , F q i s ≤ δ i B ̲ ( F s , s ) + Δ i B ̲ ( F 2 s , F s ) .
By the triangle inequality,
B ̲ F p i s , F q i s ≤ b [ B ̲ F p i s , F 1 + p i s + B ̲ ( F p i + 1 s , F q i s ) ]
Let us prove that B ̲ F p i s , F 1 + p i s = B ̲ ( s , F s ) .
B ̲ F p i s , F 1 + p i s = B ̲ F p i ( lim n → ∞ u ( n ) ) , F 1 + p i s ( lim n → ∞ u ( n ) ) = B ̲ lim n → ∞ F p i ( u ( n ) ) , lim n → ∞ F 1 + p i ( u ( n ) ) = B ̲ lim n → ∞ ( u ( n + p i ) ) , lim n → ∞ F ( u ( n + p i ) ) = B ̲ lim n → ∞ u ( n + p i ) , F ( lim n → ∞ u ( n + p i ) ) = B ̲ ( s , F s ) .
Then, from (15), (16) and (17), we obtain
B ̲ F p i s , F q i s ≤ b B ̲ ( s , F s ) + b [ δ i B ̲ ( F s , s ) + Δ i B ̲ ( F 2 s , F s ) ] ≤ b ( 1 + b i − ) B ̲ ( s , F s ) + b b i + B ̲ ( F 2 s , F s ) .
Taking the weighted sum of the inequalities in (18) with respect to the coefficients c i and then applying (3), we arrive at
∑ i = 1 ∞ c i B ̲ F p i s , F q i s ≤ ∑ i = 1 ∞ b c i ( 1 + b i − ) B ̲ ( F s , s ) + ∑ i = 1 ∞ b b i + c i B ̲ ( F 2 s , F s ) ≤ b ( Λ + M 1 ) B ̲ ( F s , s ) + b M 2 B ̲ ( F 2 s , F s ) .
A simultaneous use of (11), (14), and (19), together with (8) applied to the orbit originating at s, yields
B ̲ ( F s , s ) ≤ b 2 ∑ i = 1 ∞ c i B ̲ F p i s , F q i s ≤ b 2 [ ( b ( Λ + M 1 ) B ̲ ( F s , s ) + b M 2 B ̲ ( F 2 s , F s ) ] ≤ b 2 [ b ( Λ + M 1 ) B ̲ ( F s , s ) + b M 2 α B ̲ ( F s , s ) ] = b 3 [ Λ + M 1 + M 2 α ] B ̲ ( F s , s ) .
Then,
1 − b 3 ( Λ + M 1 + M 2 α ) B ̲ ( F s , s ) = 0 .
From (4), we obtain that B ̲ ( F s , s ) = 0 which gives F s = s .
For uniqueness, assume that z 1 , z 2 ∈ Y both satisfy F z 1 = z 1 and F z 2 = z 2 . Consequently, F p z 1 = z 1 and F q z 2 = z 2 for all p , q ∈ N . Substituting these identities into (1), we obtain
B ̲ ( z 1 , z 2 ) = B ̲ ( F z 1 , F z 2 ) ≤ ∑ i = 1 ∞ c i B ̲ ( z 1 , z 2 ) = Λ B ̲ ( z 1 , z 2 ) .
Since Λ < 1 , (21) implies that B ̲ ( z 1 , z 2 ) = 0 ; hence, z 1 = z 2 . Therefore, the asserted result follows. □
Example 1.
Consider the C − B m with Y = R , B ̲ ( u , v ) = | u − v | 2 , with b = 2 . Note that ( Y , B ̲ ) is a C − B m and not a metric space. Define F ( u ) = u 3 , u ∈ R . Then,
F n ( u ) = u 3 n .
Choose an enumeration of N × N such that ( p 1 , q 1 ) = ( 1 , 1 ) , ( p 2 , q 2 ) = ( 2 , 2 ) and let τ be the identity permutation. Set
c 1 = 1 , c 2 = 1 10 , c i = 0 ( i ≥ 3 ) .
Hence,
Λ = ∑ i = 1 ∞ c i = 11 10 .
Moreover,
B ̲ ( F u , F v ) = 1 9 B ̲ ( u , v ) ,
while
B ̲ 1 , 1 ( u , v ) = 1 9 B ̲ ( u , v ) , B ̲ 2 , 2 ( u , v ) = 1 81 B ̲ ( u , v ) .
Therefore,
B ̲ ( F u , F v ) ≤ c 1 B ̲ 1 , 1 ( u , v ) + c 2 B ̲ 2 , 2 ( u , v ) ,
so that F is a permutation contraction. Next, choose
δ 1 = δ 2 = 3 10 , Δ 1 = 1 5 , Δ 2 = 1 10 .
Since
B ̲ ( F n + 1 z , F n z ) = 1 9 B ̲ ( F n z , F n − 1 z ) ,
and
B ̲ ( F n + 2 z , F n + 1 z ) = 1 81 B ̲ ( F n z , F n − 1 z ) ,
the two-term domination condition holds for i = 1 , 2 . Consequently,
M 1 = c 1 δ 1 + c 2 δ 2 = 33 100 ,
and
M 2 = c 1 Δ 1 + c 2 Δ 2 = 21 100 .
Thus, M 2 = 21 100 < 1 and b M 1 + M 2 = 2 33 100 + 21 100 = 87 100 < 1 .
Finally,
1 b 3 − M 1 1 − M 2 = 1 8 − 33 79 < 0 < 11 10 = Λ .
Hence, all the hypotheses of Theorem 1 are satisfied. Therefore, F has a unique FP. In fact,
F ( u ) = u ⟺ u = 0 .
Thus, the unique FP is s = 0 .
Corollary 1.
Let ( Y , B ̲ ) be a complete b-metric space with constant b ≥ 1 , and let F : Y → Y . Suppose F satisfies the classical Banach contraction condition
B ̲ ( F u , F v ) ≤ k B ̲ ( u , v ) , ∀ u , v ∈ Y ,
for some constant k with
1 2 b 3 < k < 1 b .
Then, Theorem 1 applies to F and yields a unique FP s ∈ Y .
Proof. 
Fix the enumeration { ( p i , q i ) } i ≥ 1 of N × N so that
( p 1 , q 1 ) = ( 0 , 0 ) ,
and choose the permutation τ to be the identity together with the weights
c 1 = k , c i = 0 ( i ≥ 2 ) .
Since F 0 = id Y ,
B ̲ τ ( 1 ) ( u , v ) = B ̲ 0 , 0 ( u , v ) = B ̲ ( F 0 u , F 0 v ) = B ̲ ( u , v ) ,
and because c i = 0 for i ≥ 2 , the series in (1) collapses to ∑ i = 1 ∞ c i B ̲ τ ( i ) ( u , v ) = k B ̲ ( u , v ) . Thus, (1) is exactly (22), and Λ = ∑ i = 1 ∞ c i = k .
For i = 1 , i.e., ( p 1 , q 1 ) = ( 0 , 0 ) , the left-hand side of (2) is
B ̲ F n + 0 z , F n − 1 + 0 z = B ̲ F n z , F n − 1 z ,
which coincides with the first term on the right-hand side when
δ 1 = 1 , Δ 1 = 0 .
This choice makes (2) hold as an equality for i = 1 , for every z ∈ Y and every n ≥ 1 , with no further hypothesis on F . Since c i = 0 for i ≥ 2 , any non-negative choice of δ i , Δ i satisfying (2) is admissible, and none of them contributes to M 1 and M 2 .
From (3), (25) and (28),
M 1 = ∑ i = 1 ∞ c i δ i = k · 1 = k , M 2 = ∑ i = 1 ∞ c i Δ i = k · 0 = 0 .
Moreover, with Λ = k , M 1 = k , M 2 = 0 , the three conditions in (4) become
M 2 < 1 ⇔ 0 < 1 , ( always true ) , b M 1 + M 2 < 1 ⇔ b k < 1 ⇔ k < 1 b , Λ > 1 b 3 − M 1 1 − M 2 ⇔ k > 1 b 3 − k ⇔ k > 1 2 b 3 .
These are precisely (23). Hence, all hypotheses of Theorem 1 hold, and the conclusion follows. □
Corollary 2.
Let ( Y , B ̲ ) be a C − B m , and let F : Y → Y be a mapping satisfying the Kannan contraction condition for some non-negative 0 < Λ 1 < 1 2 such
B ̲ ( F u , F v ) ≤ Λ 1 B ̲ ( u , F u ) + Λ 1 B ̲ ( v , F v ) ( ∀ u , v ∈ Y ) .
Then, F has a unique FP provided,
b Λ 1 + Λ 1 < 1 .
Proof. 
We proceed by checking the conditions required in Theorem 1. Accordingly, consider a permutation τ together with weights ( c i ) assigned to the two basic orbit distances,
B ̲ ( u , F u )   and B ̲ ( v , F v )
with respective coefficients c 1 = Λ 1 , c 2 = Λ 1 , and taking c i = 0 for the remaining indices, we see that (1) becomes precisely (29), and
Λ = ∑ i = 1 ∞ c i = 2 Λ 1 < ∞ .
Let u ( n + 1 ) = F u ( n ) and B n = B ̲ ( u ( n + 1 ) , u ( n ) ) for n ≥ 0 . Applying (29) to the pair ( u ( n ) , u ( n + 1 ) ) , we obtain
B ̲ ( u ( n + 1 ) , u ( n ) ) ≤ Λ 1 B ̲ ( u ( n ) , u ( n + 1 ) ) + Λ 1 B ̲ ( u ( n − 1 ) , u ( n ) ) ≤ Λ 1 ( B n + B n − 1 ) .
Then,
B n ≤ Λ 1 B n − 1 + Λ 1 B n .
Comparing (32) with (2) of Theorem 1, the two Kannan terms correspond to the choices,
( δ i , Δ i ) ∈ { ( 1 , 0 ) , ( 0 , 1 ) } ,
namely,
Λ 1 · B ̲ ( u ( n − 1 ) , u ( n ) ) ⇒ ( δ , Δ ) = ( 1 , 0 ) , Λ 1 · B ̲ ( u ( n ) , u ( n + 1 ) ) ⇒ ( δ , Δ ) = ( 0 , 1 ) ,
Hence, by (3),
M 1 = Λ 1 , M 2 = Λ 1 .
From (30), we immediately have
M 2 < 1 and b M 1 + M 2 < 1 .
So, the first and second conditions in (4) hold. Moreover, the third hypothesis Λ > 1 b 3 − M 1 1 + M 2 can be written as Λ = 2 Λ 1 > 1 b 3 − Λ 1 1 − Λ 1 , which is satisfied. Indeed,
Λ + M 1 1 − M 2 = 2 Λ 1 + Λ 1 1 − Λ 1 = 3 Λ 1 − 2 Λ 1 2 1 − Λ 1 > 3 Λ 1 1 − Λ 1 .
Since 0 < Λ 1 < 1 2 , then 1 1 − Λ 1 > 1 , we obtain
Λ + M 1 1 + M 2 > 3 Λ 1 > 1 ≥ 1 b 3 ( since   b ≥ 1 ) .
It follows that Theorem 1 applies directly, ensuring that F has a unique FP u * ∈ Y . □

2.2. Permutation Contractions with Termwise Domination

Theorem 2.
Consider a C − B m space ( Y , B ̲ ) together with a self-mapping F : Y → Y . Let ( c i ) i ≥ 1 be a sequence of non-negative weights, and let τ : N → N be a permutation corresponding to a fixed enumeration { ( p i , q i ) } i ≥ 1 of N × N . For u , v ∈ Y , put
B ̲ p , q ( u , v ) = B ̲ F p u , F q v , B ̲ i ( u , v ) = B ̲ p i , q i ( u , v ) .
Suppose that for all u , v ∈ Y ,
B ̲ ( F u , F v ) ≤ ∑ i = 1 ∞ c i B ̲ τ ( i ) ( u , v ) ,
B ̲ i ( u , v ) ≤ N i B ̲ ( u , v ) for each i ≥ 1 ,
for some non-negative constants ( N i ) i ≥ 1 , and that
Λ = ∑ i = 1 ∞ c i N i < 1 a n d b . Λ < 1 .
Then, F has a unique FP s ∈ Y .
Proof. 
Combining (36) with the termwise estimate (37), applied after replacing i by τ ( i ) , we obtain, for arbitrary e , h ∈ Y ,
B ̲ ( F u , F v ) ≤ ∑ i = 1 ∞ c i B ̲ τ ( i ) ( u , v )
                            ≤ ∑ i = 1 ∞ c i N τ ( i ) B ̲ ( u , v )
                              = ∑ i = 1 ∞ c i N τ ( i ) B ̲ ( u , v )
                                                    = ∑ i = 1 ∞ c i N i B ̲ ( u , v ) = Λ . B ̲ ( u , v ) ,
where the transition to (42) is justified by the fact that τ is a permutation of N and therefore leaves the value of the series in (38) unchanged. It follows that F satisfies a global Lipschitz condition with constant Λ < 1 .
Starting from an arbitrary point u ( 0 ) ∈ Y and define u ( n + 1 ) = F ( u ( n ) ) and s n = B ̲ ( u ( n + 1 ) , u ( n ) ) for n ≥ 0 . Then, applying (42) to the consecutive iterates ( u , v ) = ( u ( n ) , u ( n − 1 ) ) , we obtain
s n = B ̲ ( F u ( n ) , F u ( n − 1 ) ) ≤ Λ B ̲ ( u ( n ) , u ( n − 1 ) ) = Λ s n − 1 ( n ≥ 1 ) .
Applying (43) successively, we obtain
s n ≤ Λ n s 0 = Λ n B ̲ ( u ( 1 ) , u ( 0 ) ) , n ≥ 0 .
For m > n , applying the triangle inequality and (44), we obtain
B ̲ ( u ( m ) , u ( n ) ) ≤ ∑ k = n m − 1 b k − n + 1 B ̲ ( u ( k + 1 ) , u ( k ) ) = ∑ k = n m − 1 b k − n + 1 s k + 1 ≤ ∑ k = n ∞ b k − n + 1 Λ k + 1 s 0 = b 1 − n s 0 Λ ∑ k = n ∞ ( b Λ ) k .
Since Λ < 1 , then
B ̲ ( u ( m ) , u ( n ) ) ≤ b 1 − n s 0 ( b Λ n ) 1 − b Λ .
Knowing that b Λ < 1 and b > 1 , the quantity on the right-hand side of (45) converges to zero as n → ∞ . Therefore, ( u ( n ) ) is a Cauchy sequence in Y . The completeness of ( Y , B ̲ ) then guarantees the existence of some s ∈ Y such that
lim n → ∞ u ( n ) = s , lim n → ∞ B ̲ ( u ( n ) , s ) = 0 .
Now, we use the triangle inequality and (42) to prove that s is an FP,
B ̲ ( F s , s ) ≤ b [ B ̲ ( F s , F u ( n ) ) + B ̲ ( F u ( n ) , s ) ]
                  ≤ b [ Λ B ̲ ( s , u ( n ) ) + B ̲ ( u ( n + 1 ) , s ) ] .
Taking the limit as n → ∞ and applying (46), we deduce that B ̲ ( F s , s ) = 0 , and hence
F s = s .
To establish uniqueness, assume that s 1 , s 2 ∈ Y are two FP. From (42),
B ̲ ( s 1 , s 2 ) = B ̲ ( F s 1 , F s 2 ) ≤ Λ B ̲ ( s 1 , s 2 ) .
Since Λ < 1 , (50) implies ( 1 − Λ ) B ̲ ( s 1 , s 2 ) ≤ 0 ; hence, B ̲ ( s 1 , s 2 ) = 0 and s 1 = s 2 . □
Corollary 3.
Let ( Y , B ̲ ) be a C − B m space with constant b ≥ 1 , and let F : Y → Y satisfy the classical Banach contraction condition
B ̲ ( F u , F v ) ≤ k B ̲ ( u , v ) , ∀ u , v ∈ Y ,
for some constant k with
0 ≤ k < 1 b .
Then, F satisfies the hypotheses of Theorem 2, and consequently it has a unique FP s ∈ Y .
Proof. 
Take the sequence of pairs ( p i , q i ) = ( 0 , 0 ) for every i ≥ 1 (recall F 0 = id Y ), the identity permutation τ = id , and the weights
c 1 = k , c i = 0 ( i ≥ 2 ) .
Verification of (36). With this choice, B ̲ τ ( 1 ) ( u , v ) = B ̲ 0 , 0 ( u , v ) = B ̲ ( u , v ) , and since c i = 0 for i ≥ 2 ,
∑ i = 1 ∞ c i B ̲ τ ( i ) ( u , v ) = k B ̲ ( u , v ) .
Hence, (36) is exactly (51).
Verification of (37). Since ( p i , q i ) = ( 0 , 0 ) for every i ≥ 1 , we have B ̲ i ( u , v ) = B ̲ ( u , v ) for every i, so (37) reads B ̲ ( u , v ) ≤ N i B ̲ ( u , v ) , which holds for all u , v ∈ Y and every i ≥ 1 with the uniform choice
N i = 1 , ∀ i ≥ 1 .
Computing Λ . From (38), (53) and (55),
Λ = ∑ i = 1 ∞ c i N i = k · 1 = k .
Checking (38). The two required conditions become
Λ < 1 ⇔ k < 1 , b Λ < 1 ⇔ b k < 1 ⇔ k < 1 b .
Since b ≥ 1 , k < 1 b already implies k < 1 , so the binding requirement is exactly (52). All hypotheses of Theorem 2 hold, and the conclusion follows. □
Corollary 4.
Let the mapping F satisfy the Hardy–Rogers-type condition, for all u , v ∈ Y
B ̲ ( F u , F v ) ≤ Λ 1 B ̲ ( u , v ) + Λ 2 B ̲ ( u , F u ) + Λ 3 B ̲ ( v , F v ) + Λ 4 B ̲ ( u , F u ) + Λ 5 B ̲ ( v , F u ) ,
where Λ 1 , Λ 2 , Λ 3 , Λ 4 , Λ 5 ≥ 0 .
Assume that all the requirements of Theorem 2 hold, notably the per-term estimates B ̲ i ( u , v ) ≤ N i , B ̲ ( u , v ) for all u , v . These assumptions yield a nontrivial consequence of (58) only in the Banach setting, corresponding to Λ 2 = Λ 3 = Λ 4 = Λ 5 = 0 ; in this case,
B ̲ ( F u , F v ) ≤ Λ 1 , B ̲ ( u , v ) , Λ 1 < 1 .
Therefore, Theorem 2 does not generally provide the full Hardy–Rogers inequality (58).
Proof. 
Suppose that the five Hardy–Rogers terms are taken as the quantities B ̲ i in Theorem 2. The corresponding per–term domination would then require the existence of finite constants N i ≥ 0 satisfying, for every u , v ∈ Y ,
B ̲ ( u , F u ) ≤ N 2 B ̲ ( u , v ) , B ̲ ( v , F v ) ≤ N 3 B ̲ ( u , v ) , B ̲ ( u , F v ) ≤ N 4 B ̲ ( u , v ) , B ̲ ( v , F u ) ≤ N 5 B ̲ ( u , v ) .
Consider first the inequalities involving N 2 and N 3 . Choosing v = u makes their right-hand sides equal to zero. Hence, B ̲ ( u , F u ) = 0 and B ̲ ( v , F v ) = 0 for every u , v ∈ Y , which implies F u = u for all u. Thus, finite uniform constants N 2 and N 3 can exist only in the trivial case where F is the identity map.
The remaining cross-terms present a similar obstruction. In a general metric space and for an arbitrary self-map F , no uniform constants N 4 and N 5 can be guaranteed to satisfy
B ̲ ( u , F v ) ≤ N 4 B ̲ ( u , v ) , B ̲ ( v , F u ) ≤ N 5 B ̲ ( u , v ) ,
as u and v vary independently. Consequently, the per-term domination requirement in Theorem 2 is generally incompatible with the self-distance and cross-distance terms appearing in the Hardy–Rogers condition. The only term that naturally fits the required domination structure is the Banach term B ̲ ( u , v ) . □
Nevertheless, Theorem 2 yields the following restricted form of a Hardy–Rogers-type FP result.
Corollary 5.
Let ( Y , B ̲ ) be a C − B m and let F : Y → Y be a self-map. Suppose that there exist non-negative coefficients Λ 1 , Λ 2 , Λ 3 , Λ 4 , Λ 5 such that, for every u , v ∈ Y ,
B ̲ ( F u , F v ) ≤ Λ 1 B ̲ ( u , v ) + Λ 2 B ̲ ( u , F u ) + Λ 3 B ̲ ( v , F v ) + Λ 4 B ̲ ( u , F v ) + Λ 5 B ̲ ( v , F u ) .
Assume further that there are constants C 2 , C 3 , C 4 , C 5 ≥ 0 , independent of u and v, such that the following inequalities hold:
B ̲ ( u , F u ) ≤ C 2 B ̲ ( u , v ) , B ̲ ( v , F v ) ≤ C 3 B ̲ ( u , v ) , B ̲ ( u , F v ) ≤ C 4 B ̲ ( u , v ) , B ̲ ( v , F u ) ≤ C 5 B ̲ ( u , v ) .
If
Λ = Λ 1 + Λ 2 C 2 + Λ 3 C 3 + Λ 4 C 4 + Λ 5 C 5 < 1   a n d   b Λ < 1
then F has a unique FP s ∈ Y .
Proof. 
Using the five orbit-distance terms within Theorem 2,
B ̲ 1 ( u , v ) = B ̲ ( u , v ) , B ̲ 2 ( u , v ) = B ̲ ( u , F u ) , B ̲ 3 ( u , v ) = B ̲ ( v , F v ) , B ̲ 4 ( u , v ) = B ̲ ( u , F v ) , and B ̲ 5 ( u , v ) = B ̲ ( v , F u ) ,
and choose ( c i ) so that its nonzero components correspond exactly to these five entries, namely,
c 1 = Λ 1 , c 2 = Λ 2 , c 3 = Λ 3 , c 4 = Λ 4 , c 5 = Λ 5 , c i = 0 ( i ≥ 6 ) .
Thus, (59) is precisely the aggregation condition (36), and (60) gives the per-term domination (37) with
N 1 = 1 , N 2 = C 2 , N 3 = C 3 , N 4 = C 4 , N 5 = C 5 .
Under these choices, the requirement (38) is reduced to the condition stated in (60). Thus, Theorem 2 is applicable, and its conclusion guarantees that F possesses a unique FP. □

3. Applications

In this section, we present two applications of Corollary 2. Throughout, we use the squared supremum norm as a genuine b-metric. Recall that if for u , v ∈ R n
B ̲ ( u , v ) = ∥ u − v ∥ ∞ 2 ,
then
B ̲ ( u , z ) ≤ 2 B ̲ ( u , v ) + B ̲ ( v , z ) ,
so the corresponding b-metric coefficient is b = 2 .
The following application demonstrates the effectiveness of Corollary 2 to solve a linear system within the framework of the considered b-metric space. The system is reformulated as an FP problem for a suitably defined self-mapping on ( R n , B ̲ ) .

3.1. Application to a Linear System of Equations

Let Y = R n , endowed with the b-metric
B ̲ ( u , v ) = ∥ u − v ∥ ∞ 2 , ∥ u ∥ ∞ = max 1 ≤ i ≤ n | u i | .
Since ( R n , ∥ · ∥ ∞ ) is complete, ( Y , B ̲ ) is a complete b-metric space with b = 2 .
Consider the linear system
B u = r ,
where B = ( s i j ) 1 ≤ i , j ≤ n ∈ R n × n and r ∈ R n . Define
A = I n + B
and introduce the self-map F : Y → Y by
F u = A u − r .
Observe that u is an FP of F if and only if
u = A u − r = ( I n + B ) u − r ,
which is equivalent to
B u = r .
Theorem 3.
Assume that
λ : = ∥ I n + B ∥ ∞ = max 1 ≤ i ≤ n | 1 + s i i | + ∑ j = 1 j ≠ i n | s i j | < 1 1 + 6 .
Then, the linear system B u = r has a unique solution in R n .
Proof. 
For all u , v ∈ Y ,
∥ F u − F v ∥ ∞ = ∥ A ( u − v ) ∥ ∞ ≤ λ ∥ u − v ∥ ∞ .
Also,
∥ u − v ∥ ∞ ≤ ∥ u − F u ∥ ∞ + ∥ F u − F v ∥ ∞ + ∥ F v − v ∥ ∞ .
Hence,
∥ F u − F v ∥ ∞ ≤ λ ∥ u − F u ∥ ∞ + ∥ F u − F v ∥ ∞ + ∥ F v − v ∥ ∞ .
Since λ < 1 , we obtain
∥ F u − F v ∥ ∞ ≤ λ 1 − λ ∥ u − F u ∥ ∞ + ∥ v − F v ∥ ∞ .
Squaring both sides and using
( a + b ) 2 ≤ 2 ( a 2 + b 2 ) ,
we obtain
B ̲ ( F u , F v ) ≤ Λ 1 B ̲ ( u , F u ) + B ̲ ( v , F v ) ,
where
Λ 1 = 2 λ 2 ( 1 − λ ) 2 .
Thus, F satisfies the Kannan-type condition appearing in Corollary 2. Since λ < 1 1 + 6 , we have Λ 1 < 1 3 .
Because the b-metric coefficient is b = 2 ,
b Λ 1 + Λ 1 = 3 Λ 1 < 1 .
In particular, Λ 1 < 1 / 2 , and therefore all hypotheses of Corollary 2 are satisfied. Consequently, F has a unique FP u * ∈ Y . By the fixed-point equivalence above,
B u * = r .
Hence, the linear system has a unique solution. □
To demonstrate the applicability of the above result, we present a concrete numerical example that illustrates the geometric interpretation of Theorem 3 in R 3 . We consider a concrete 3 × 3 matrix satisfying the required contractive condition and study the corresponding iterative process. Figure 1 depicts the resulting trajectory in three-dimensional space and illustrates its convergence toward the unique FP.
Figure 1. Numerical illustration in dimension 3 of the fixed-point approach to the linear system B x = r .
Example 2.
Consider the linear system
B u = r ,
where
B = − 0.85 0.05 0.02 0.03 − 0.88 0.04 0.01 0.02 − 0.90 , r = − 0.7 − 0.5 − 0.3 .
Following the construction in Theorem 3, we set
A = I 3 + B = 0.15 0.05 0.02 0.03 0.12 0.04 0.01 0.02 0.10 .
Define T ( x ) = A x − r . Explicitly,
T ( x 1 , x 2 , x 3 ) = 0.15 x 1 + 0.05 x 2 + 0.02 x 3 + 0.7 0.03 x 1 + 0.12 x 2 + 0.04 x 3 + 0.5 0.01 x 1 + 0.02 x 2 + 0.10 x 3 + 0.3 .
Moreover,
T ( x ) = x ⟺ A x − r = x ⟺ ( I 3 − A ) x = − r ⟺ B x = r .
We now verify the contraction condition of Theorem 3. Since λ = ∥ I 3 + B ∥ ∞ = ∥ A ∥ ∞ , we calculate the three row sums:
∑ j = 1 3 | a 1 j | = 0.22 , ∑ j = 1 3 | a 2 j | = 0.19 , ∑ j = 1 3 | a 3 j | = 0.13 .
Therefore, λ = ∥ A ∥ ∞ = max { 0.22 , 0.19 , 0.13 } = 0.22 .
On the other hand, 1 1 + 6 ≈ 0.2899 . Consequently, λ = 0.22 < 0.2899 = 1 1 + 6 .
Thus, all the hypotheses of Theorem 3 are satisfied, and the linear system has a unique solution.
For completeness, the solution can be approximated by the fixed-point iteration
x ( k + 1 ) = T ( x ( k ) ) , x ( 0 ) = ( 0 , 0 , 0 ) .
The first iterates are
x ( 1 ) = T ( x ( 0 ) ) = ( 0.700000 , 0.500000 , 0.300000 ) , x ( 2 ) = T ( x ( 1 ) ) = ( 0.836000 , 0.593000 , 0.347000 ) , x ( 3 ) = T ( x ( 2 ) ) = ( 0.861990 , 0.610120 , 0.354920 ) , x ( 4 ) = T ( x ( 3 ) ) = ( 0.866903 , 0.613271 , 0.356314 ) , x ( 5 ) = T ( x ( 4 ) ) = ( 0.867825 , 0.613852 , 0.356566 ) , x ( 6 ) = T ( x ( 5 ) ) = ( 0.867998 , 0.613960 , 0.356612 ) .
Hence, x ( k ) ⟶ x * as k → ∞ , where x * ≈ ( 0.86804 , 0.61398 , 0.35662 ) .
Indeed, direct substitution gives B x * ≈ − 0.7 − 0.5 − 0.3 = r , confirming that
u * = ( 0.86804 , 0.61398 , 0.35662 ) is the unique solution of the original linear system.

3.2. Application to a Second-Order Boundary Value Problem

Consider the boundary value problem
− w ″ ( t ) = h ( t , w ( t ) ) , t ∈ [ 0 , 1 ] , w ( 0 ) = w ( 1 ) = 0 ,  
where h : [ 0 , 1 ] × R → R is continuous.
The Green function associated with the Dirichlet problem is
G ( t , s ) = t ( 1 − s ) , 0 ≤ t ≤ s ≤ 1 , s ( 1 − t ) , 0 ≤ s ≤ t ≤ 1 .
A solution of (61) is equivalently an FP of the operator F : C ( [ 0 , 1 ] , R ) → C ( [ 0 , 1 ] , R ) defined by
( F w ) ( t ) = ∫ 0 1 G ( t , s ) h ( s , w ( s ) ) d s .
Equip C ( [ 0 , 1 ] , R ) with
B ̲ ( w , ρ ) = ∥ w − ρ ∥ ∞ 2 , ∥ w ∥ ∞ = max t ∈ [ 0 , 1 ] | w ( t ) | .
This is a complete b-metric space with b = 2 .
Theorem 4.
Assume that there exists a constant L > 0 such that
| h ( t , u ) − h ( t , v ) | ≤ L | u − v |
for all t ∈ [ 0 , 1 ] and all u , v ∈ R , and suppose that
L < 8 1 + 6 .
Then, the boundary value problem (61) has a unique solution w * ∈ C 2 ( [ 0 , 1 ] ) .
Proof. 
The proof is obtained by an application of Corollary 2. More precisely, we shall verify that the operator associated with the boundary value problem satisfies all the hypotheses of this corollary. We first identify the underlying function space as a complete ( C − B ̲ m ) space and then establish the Kannan-type contractive condition.
Let X = C ( [ 0 , 1 ] , R ) and define
B ̲ ( w , ρ ) = ∥ w − ρ ∥ ∞ 2 , w , ρ ∈ X ,
where ∥ w − ρ ∥ ∞ = max t ∈ [ 0 , 1 ] | w ( t ) − ρ ( t ) | .
Since C ( [ 0 , 1 ] , R ) , equipped with the supremum norm, is a Banach space, it remains only to verify that B ̲ defines a complete b-metric.
Clearly,
B ̲ ( w , ρ ) ≥ 0 ,
and
B ̲ ( w , ρ ) = 0 ⟺ ∥ w − ρ ∥ ∞ = 0 ⟺ w = ρ .
Moreover,
B ̲ ( w , ρ ) = ∥ w − ρ ∥ ∞ 2 = ∥ ρ − w ∥ ∞ 2 = B ̲ ( ρ , w ) .
For any w , ρ , z ∈ X , the triangle inequality for the supremum norm gives
∥ w − ρ ∥ ∞ ≤ ∥ w − z ∥ ∞ + ∥ z − ρ ∥ ∞ .
Therefore,
B ̲ ( w , ρ ) = ∥ w − ρ ∥ ∞ 2 ≤ ∥ w − z ∥ ∞ + ∥ z − ρ ∥ ∞ 2 = ∥ w − z ∥ ∞ 2 + 2 ∥ w − z ∥ ∞ ∥ z − ρ ∥ ∞ + ∥ z − ρ ∥ ∞ 2 .
Using 2 a b ≤ a 2 + b 2 , we obtain B ̲ ( w , ρ ) ≤ 2 ∥ w − z ∥ ∞ 2 + 2 ∥ z − ρ ∥ ∞ 2 , and hence
B ̲ ( w , ρ ) ≤ 2 B ̲ ( w , z ) + B ̲ ( z , ρ ) .
Thus, B ̲ is a b-metric with coefficient b = 2 . Completeness follows directly from the completeness of ( C ( [ 0 , 1 ] , R ) , ∥ · ∥ ∞ ) .
Define the operator F : X → X by
( F w ) ( t ) = ∫ 0 1 G ( t , s ) h ( s , w ( s ) ) d s ,
where
G ( t , s ) = t ( 1 − s ) , 0 ≤ t ≤ s ≤ 1 , s ( 1 − t ) , 0 ≤ s ≤ t ≤ 1 .
Since h is continuous and w ∈ C ( [ 0 , 1 ] , R ) , the function s ⟼ h ( s , w ( s ) ) is continuous on [ 0 , 1 ] . Since G is continuous on [ 0 , 1 ] × [ 0 , 1 ] , it follows that
t ⟼ ∫ 0 1 G ( t , s ) h ( s , w ( s ) ) d s
is continuous. Consequently,
F w ∈ C ( [ 0 , 1 ] , R ) ,
and hence F is indeed a self-map of X.
Let w , ρ ∈ X . For every t ∈ [ 0 , 1 ] , we have
| ( F w ) ( t ) − ( F ρ ) ( t ) | = ∫ 0 1 G ( t , s ) h ( s , w ( s ) ) − h ( s , ρ ( s ) ) d s ≤ ∫ 0 1 G ( t , s ) h ( s , w ( s ) ) − h ( s , ρ ( s ) ) d s .
By the assumed Lipschitz condition,
| h ( s , w ( s ) ) − h ( s , ρ ( s ) ) | ≤ L | w ( s ) − ρ ( s ) | ,
so
| ( F w ) ( t ) − ( F ρ ) ( t ) | ≤ L ∫ 0 1 G ( t , s ) | w ( s ) − ρ ( s ) | d s ≤ L ∥ w − ρ ∥ ∞ ∫ 0 1 G ( t , s ) d s .
For a fixed t ∈ [ 0 , 1 ] , using the definition of G,
∫ 0 1 G ( t , s ) d s = ∫ 0 t s ( 1 − t ) d s + ∫ t 1 t ( 1 − s ) d s = ( 1 − t ) ∫ 0 t s d s + t ∫ t 1 ( 1 − s ) d s = ( 1 − t ) t 2 2 + t s − s 2 2 s = t s = 1 = t 2 ( 1 − t ) 2 + t 1 2 − t + t 2 2 = t 2 − t 3 2 + t 2 − t 2 + t 3 2 = t ( 1 − t ) 2 .
The function t ( 1 − t ) attains its maximum at t = 1 / 2 , and therefore
sup t ∈ [ 0 , 1 ] ∫ 0 1 G ( t , s ) d s = 1 2 1 2 1 − 1 2 = 1 8 .
Consequently,
| ( F w ) ( t ) − ( F ρ ) ( t ) | ≤ L 8 ∥ w − ρ ∥ ∞ ,
for every t ∈ [ 0 , 1 ] . Taking the supremum over t, we obtain
∥ F w − F ρ ∥ ∞ ≤ L 8 ∥ w − ρ ∥ ∞ .
Put μ = L 8 . Then, ∥ F w − F ρ ∥ ∞ ≤ μ ∥ w − ρ ∥ ∞ .
We now express the right-hand side in terms of the displacement quantities appearing in the Kannan contraction. Observe that
w − ρ = ( w − F w ) + ( F w − F ρ ) + ( F ρ − ρ ) .
Hence, by the triangle inequality,
∥ w − ρ ∥ ∞ ≤ ∥ w − F w ∥ ∞ + ∥ F w − F ρ ∥ ∞ + ∥ F ρ − ρ ∥ ∞ .
It follows that
∥ F w − F ρ ∥ ∞ ≤ μ ∥ w − ρ ∥ ∞ ≤ μ ∥ w − F w ∥ ∞ + ∥ F w − F ρ ∥ ∞ + ∥ F ρ − ρ ∥ ∞ .
Therefore,
( 1 − μ ) ∥ F w − F ρ ∥ ∞ ≤ μ ∥ w − F w ∥ ∞ + ∥ ρ − F ρ ∥ ∞ .
The hypothesis L < 8 1 + 6 implies μ = L 8 < 1 1 + 6 < 1 .
Thus, 1 − μ > 0 , and consequently,
∥ F w − F ρ ∥ ∞ ≤ μ 1 − μ ∥ w − F w ∥ ∞ + ∥ ρ − F ρ ∥ ∞ .
Squaring both sides yields
∥ F w − F ρ ∥ ∞ 2 ≤ μ 2 ( 1 − μ ) 2 ∥ w − F w ∥ ∞ + ∥ ρ − F ρ ∥ ∞ 2 .
Using again ( a + b ) 2 ≤ 2 ( a 2 + b 2 ) , we obtain
∥ F w − F ρ ∥ ∞ 2 ≤ 2 μ 2 ( 1 − μ ) 2 ∥ w − F w ∥ ∞ 2 + ∥ ρ − F ρ ∥ ∞ 2 = 2 μ 2 ( 1 − μ ) 2 B ̲ ( w , F w ) + B ̲ ( ρ , F ρ ) .
Since
B ̲ ( F w , F ρ ) = ∥ F w − F ρ ∥ ∞ 2 ,
we have
B ̲ ( F w , F ρ ) ≤ Λ 1 B ̲ ( w , F w ) + B ̲ ( ρ , F ρ ) ,
where Λ 1 = 2 μ 2 ( 1 − μ ) 2 ..
We verify explicitly the numerical condition required by Corollary 2. Since μ < 1 1 + 6 , we have 6 μ < 1 − μ .
Both sides are positive, so squaring gives
6 μ 2 < ( 1 − μ ) 2 .
Dividing by the positive number ( 1 − μ ) 2 , we obtain
6 μ 2 ( 1 − μ ) 2 < 1 .
Since Λ 1 = 2 μ 2 ( 1 − μ ) 2 , it follows that 3 Λ 1 = 6 μ 2 ( 1 − μ ) 2 < 1 . Therefore, Λ 1 < 1 3 < 1 2 .
Furthermore, because the coefficient of the b-metric is b = 2 ,
b Λ 1 + Λ 1 = 2 Λ 1 + Λ 1 = 3 Λ 1 < 1 .
Thus, F satisfies all the assumptions of Corollary 2. Hence, there exists a unique w * ∈ C ( [ 0 , 1 ] , R ) such that
F w * = w * .
Accordingly,
w * ( t ) = ∫ 0 1 G ( t , s ) h ( s , w * ( s ) ) d s , t ∈ [ 0 , 1 ] .
It remains to verify that this FP is a classical solution of the boundary value problem. Put
q ( s ) = h ( s , w * ( s ) ) .
Since h and w * are continuous, q ∈ C ( [ 0 , 1 ] ) . Using the explicit expression for G, the fixed-point equation becomes
w * ( t ) = ( 1 − t ) ∫ 0 t s q ( s ) d s + t ∫ t 1 ( 1 − s ) q ( s ) d s .
Differentiating and applying the Leibniz rule gives
w * ′ ( t ) = − ∫ 0 t s q ( s ) d s + ( 1 − t ) t q ( t ) + ∫ t 1 ( 1 − s ) q ( s ) d s − t ( 1 − t ) q ( t ) .
The two terms involving t ( 1 − t ) q ( t ) cancel, and hence
w * ′ ( t ) = − ∫ 0 t s q ( s ) d s + ∫ t 1 ( 1 − s ) q ( s ) d s .
Differentiating once more yields
w * ″ ( t ) = − t q ( t ) − ( 1 − t ) q ( t ) = − q ( t ) = − h ( t , w * ( t ) ) .
Therefore,
− w * ″ ( t ) = h ( t , w * ( t ) ) .
Moreover, evaluating the Green representation at t = 0 gives
w * ( 0 ) = 0 ,
and evaluating it at t = 1 gives
w * ( 1 ) = 0 .
Since q is continuous, the above calculation also shows that w * ″ is continuous. Hence,
w * ∈ C 2 ( [ 0 , 1 ] ) .
Thus, w * is a classical solution of the boundary value problem. The uniqueness of the FP of F implies the uniqueness of the solution. Therefore, problem (61) has a unique solution in C 2 ( [ 0 , 1 ] ) . □
Example 3.
Consider the boundary value problem
− w ″ ( t ) = w ( t ) + 1 , t ∈ [ 0 , 1 ] , w ( 0 ) = w ( 1 ) = 0 .  
Consider the function h ( t , u ) = u + 1 , which is continuous on [ 0 , 1 ] × R , and for all t ∈ [ 0 , 1 ] and u , v ∈ R ,
| h ( t , u ) − h ( t , v ) | = | ( u + 1 ) − ( v + 1 ) | = | u − v | .
Hence, the Lipschitz constant is L = 1 . Since 8 1 + 6 ≈ 2.194 , we have L = 1 < 8 1 + 6 .
Therefore, all the hypotheses of the theorem are satisfied, and the boundary value problem has a unique solution.
Indeed, the associated fixed-point operator is
( F w ) ( t ) = ∫ 0 1 G ( t , s ) w ( s ) + 1 d s ,
where
G ( t , s ) = t ( 1 − s ) , 0 ≤ t ≤ s ≤ 1 , s ( 1 − t ) , 0 ≤ s ≤ t ≤ 1 .
For w , ρ ∈ C ( [ 0 , 1 ] , R ) , we obtain
| ( F w ) ( t ) − ( F ρ ) ( t ) | = ∫ 0 1 G ( t , s ) w ( s ) − ρ ( s ) d s ≤ ∫ 0 1 G ( t , s ) | w ( s ) − ρ ( s ) | d s ≤ ∥ w − ρ ∥ ∞ ∫ 0 1 G ( t , s ) d s .
A direct calculation gives
∫ 0 1 G ( t , s ) d s = t ( 1 − t ) 2 ≤ 1 8 , t ∈ [ 0 , 1 ] .
Consequently,
∥ F w − F ρ ∥ ∞ ≤ 1 8 ∥ w − ρ ∥ ∞ .
Since B ̲ ( w , ρ ) = ∥ w − ρ ∥ ∞ 2 , it follows that
B ̲ ( F w , F ρ ) = ∥ F w − F ρ ∥ ∞ 2 ≤ 1 64 ∥ w − ρ ∥ ∞ 2 = 1 64 B ̲ ( w , ρ ) .
Thus, the induced contraction coefficient is Λ = 1 64 . In particular, Λ = 1 64 < 1 1 + 6 , so the fixed-point theorem applies directly.
Remark 3.
Under the global Lipschitz assumption on h, the classical Banach contraction principle yields the stronger numerical condition L < 8 . Indeed, the Green-function estimate gives
∥ F w − F ρ ∥ ∞ ≤ L 8 ∥ w − ρ ∥ ∞ .
However, the purpose of the present application is different: it illustrates how the Kannan-type fixed-point criterion established in Corollary 2 can be applied to the Green operator in the complete b-metric space ( C ( [ 0 , 1 ] , R ) , B ̲ ) . The resulting Kannan coefficient is
Λ 1 = 2 L 8 − L 2 ,
and, since b = 2 , the condition b Λ 1 + Λ 1 < 1 is satisfied whenever
L < 8 1 + 6 .
Thus, the application demonstrates the applicability of the proposed Kannan/permutation framework rather than an improvement over the classical Banach contraction bound for this particular boundary value problem.

4. Conclusions and Further Perspectives

This paper set out an FP framework for permutation contractions in C- B m spaces. By arranging a weighted family of orbital distances through an arbitrary permutation, we obtained a generalized Banach-type FP theorem that secures both existence and uniqueness under a suitable contractive condition.
A second contribution lies in the per-term domination framework we introduced, where each orbital distance is bounded individually in terms of the underlying distance. Working within this framework, we were also able to recover Kannan-type contractions and a restricted version of the Hardy-Rogers condition once the weights and domination assumptions are chosen appropriately.
To test the applicability of these results, we considered two rather different problems. The first is a linear system of equations, where the FP formulation yields conditions guaranteeing the existence and uniqueness of the solution. The second is a second-order boundary value problem that is chosen precisely to show that the approach is not tied to finite-dimensional algebra and extends naturally to differential equations as well.
A number of questions remain open. Perhaps the most immediate is whether the per-term domination assumptions can be relaxed further—that is, whether individual orbital distances can still be controlled under weaker hypotheses without the permutation contraction collapsing back into an ordinary global Lipschitz condition. Beyond this, it would be worth exploring analogous results in other generalized metric structures and in multivalued, cyclic, or graph-based versions of permutation contractions. We hope these directions contribute to a broader theory of orbit-dependent contractions and to closer ties between generalized metric FP theory and its applications.

Funding

This research was funded by Ongoing Research Funding program, (ORF-2026-1726), King Saud University, Riyadh, Saudi Arabia.

Data Availability Statement

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

Acknowledgments

The author would like to thank Ongoing Research Funding program, (ORF-2026-1726), King Saud University, Riyadh, Saudi Arabia for financial support.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Shehzad, U.; Batul, S.; Sagheer, D.E.S.; Ayoob, I.; Mlaiki, N. Fixed point results via fuzzy mappings in b-metric spaces and an application to differential equations. J. Inequalities Appl. 2025, 2025, 66. [Google Scholar] [CrossRef] [Scilit]
  2. Sonam, S.K.; Paul, S.K.; Bhardwaj, R. Exploring fixed point results in fuzzy bipolar metric spaces and application to differential equations. J. Comput. Appl. Math. 2026, 485, 117601. [Google Scholar] [CrossRef] [Scilit]
  3. Qawasmeh, T.; Malkawi, A.A. Fixed Point Theory in MR-Metric Spaces Fundamental Theorems and Applications to Integral Equations and Neutron Transport. Eur. J. Pure Appl. Math. 2025, 18, 6440. [Google Scholar] [CrossRef] [Scilit]
  4. Beg, I.; Ermis, T.; Gelisgen, Ö.; Abbas, M. Applications of Asymptotic Fixed Point Theorems in A-Metric Spaces to Integral Equations. J. Funct. Spaces 2025, 2025, 1727696. [Google Scholar] [CrossRef] [Scilit]
  5. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef] [Scilit]
  6. Kannan, R. Some results on fixed points. Bull. Cal. Math. Soc. 1968, 60, 71–76. [Google Scholar]
  7. Reich, S. Kannan’s fixed point theorem. Boll. Un. Mat. Ital. 1971, 4, 1–11. [Google Scholar]
  8. Saikia, J.; Debnath, P. Fixed points and attractors of iterated function systems via generalized enriched Kannan-type cyclic contractions. Optimization 2026, 1–21. [Google Scholar] [CrossRef] [Scilit]
  9. Chatterjea, S.K. Fixed-point theorems. Comptes Rendus de L’Académie Bulgare des Sci. 1972, 25, 727–730. [Google Scholar]
  10. Branciari, A. A fixed point theorem of Banach-Caccioppoli type on a class of generalized metric spaces. Publ. Math. 2000, 57, 31–37. [Google Scholar] [CrossRef] [Scilit]
  11. Mlaiki, N.; Hajji, M.; Abdeljawad, T. A New Extension of the Rectangular b-Metric Spaces. Adv. Math. Phys. 2020, 2020, 8319584. [Google Scholar] [CrossRef] [Scilit]
  12. Matthews, S.G. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef] [Scilit]
  13. Huang, M.; Jia, X.; Li, Q. Topologies and fixpoints on weak partial metric spaces. Topol. Its Appl. 2026, 377, 109601. [Google Scholar] [CrossRef] [Scilit]
  14. Czerwik, S. Contraction mappings in b-metric spaces. Acta Math. Inform. Univ. Ostrav. 1993, 1, 5–11. [Google Scholar]
  15. Devi, M.; Chauhan (Gonder), S.S.; Shukla, R. Computational Analysis of Common Fixed Points in b-Metric Spaces with Applications to Well-Posedness and Projectile Motion. Int. J. Differ. Equ. 2026, 2026, 5593734. [Google Scholar] [CrossRef] [Scilit]
  16. Alsulami, S.M.; Alarfaj, T.A. Fixed-Point Results for Ćirić Contraction Mappings in Strong b-Metric Spaces. Axioms 2026, 15, 463. [Google Scholar] [CrossRef] [Scilit]
  17. Ayoob, I.; Mlaiki, N. A generalized fixed point theorem via permutation contractions with an application to integral equations. Bound. Value Probl. 2026, 2026, 126. [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.