Next Article in Journal
Multi-Strategy Market Dynamics Analysis: A Novel Framework for Agent-Based Economic Modeling with Reinforcement Learning
Previous Article in Journal
Hybrid Dual Volume Learning for Iterative Fusion and Adaptive Depth Refinement for Shape from Focus
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed Point Results in Convex Double-Controlled Metric-Type Spaces and Applications

by
Nazli Kadioglu Karaca
Department of Mathematics, Faculty of Science, Atatürk University, Erzurum 25240, Turkey
Mathematics 2026, 14(10), 1620; https://doi.org/10.3390/math14101620
Submission received: 11 March 2026 / Revised: 20 April 2026 / Accepted: 1 May 2026 / Published: 10 May 2026
(This article belongs to the Topic Fixed Point Theory and Measure Theory)

Abstract

This paper investigates fixed point results in convex double-controlled metric-type spaces. By introducing a convex structure on double-controlled metric-type spaces, we study the convergence of the Mann iteration process for contractive mappings in this framework. Under suitable conditions on the control functions, we establish the existence and uniqueness of fixed points and prove that the Mann iterative sequence converges to the fixed point. In addition, we investigate the stability of the Mann iteration process and establish a data dependence result. Finally, an application to a Fredholm integral equation is presented to illustrate the applicability of the obtained results.

1. Introduction

Fixed point theory constitutes an important area of research with numerous applications in nonlinear analysis, optimization theory, as well as differential and integral equations. A central result in this field is the contraction principle introduced by Banach [1]. Owing to its simplicity and effectiveness, the Banach fixed point theorem has become one of the fundamental tools of fixed point theory and has motivated a wide range of subsequent investigations.
Over time, several researchers have focused on extending the Banach contraction principle in two main directions. One approach consists of modifying or weakening the contractive conditions, while the other involves enlarging the class of spaces in which fixed point results can be established. In this context, many generalizations of metric spaces have been proposed. Among these, b-metric spaces, introduced by Bakhtin [2] and later investigated by Czerwik [3], have received considerable attention. Numerous fixed point results for various classes of contractive mappings have been obtained in this setting, making b-metric spaces an active topic of research [4,5,6,7,8,9,10,11].
Further developments in this direction led to the introduction of more flexible structures. Kamran et al. [12] introduced extended b-metric spaces, where the triangle inequality is controlled by a function instead of a constant. Later, Mlaiki et al. [13] introduced controlled metric-type spaces, where control functions are used in the triangle inequality to obtain a more general framework for fixed point results. As a further generalization, Abdeljawad et al. [14] introduced double-controlled metric-type spaces in which two different control functions appear in the triangle inequality. Various fixed point results for different types of contractive mappings have been established in this setting [15,16,17,18,19,20,21,22,23].
In 1970, Takahashi [24] introduced the concept of convex structure in metric spaces. Later, Goebel and Kirk [25] studied the convergence properties of different iterative processes using such convex structures. Based on these ideas, Chen et al. [26] studied convex b-metric spaces and obtained convergence results using Mann’s iteration process in these spaces, together with applications to integral equations.
Motivated by these developments, it is natural to study convex structures in more general metric-type spaces. In particular, the investigation of iterative methods in double-controlled metric-type spaces equipped with a convex structure is of considerable interest. However, studies involving iterative processes in such spaces are still limited in the existing literature. This motivates further research on convex double-controlled metric-type spaces and the behavior of iterative methods in this setting.
The aim of this paper is to investigate fixed point results in convex double-controlled metric-type spaces. Using Mann’s iteration process, we establish convergence results for contractive mappings in this framework. Furthermore, we investigate certain stability properties of this iteration process and present illustrative examples demonstrating the applicability of the obtained results. These results extend some existing fixed point results in the literature and contribute to the study of iterative methods in generalized metric-type spaces.
In particular, the main novelty of this work lies in extending the results obtained in convex b-metric spaces to the more general framework of convex double-controlled metric-type spaces. Unlike the setting of Yildirim [11], where the control is governed by a single constant, the present framework involves two control functions, which leads to additional technical difficulties in the analysis of iterative processes.
Moreover, we also establish stability and data dependence results for the Mann iteration process in this generalized setting, which have not been addressed in the context of convex double-controlled metric-type spaces.

2. Preliminaries

Definition 1
([3]). Let G be a nonempty set and s 1 be a given real number. A mapping d c : G × G [ 0 , ) is called a bmetric on G if the following conditions hold for all ð , , G :
1. 
d c ( ð , ) = 0 ð = ;
2. 
d c ( ð , ) = d c ( , ð ) ;
3. 
d c ( ð , ) s d c ( ð , ) + d c ( , ) .
Then, the pair ( G , d c ) is called a b-metric space.
The notion of extended b-metric spaces was introduced by Kamran et al. in 2017 [12].
Definition 2
([12]). Let G be a nonempty set and θ : G × G [ 1 , ) be a function. A mapping d c : G × G [ 0 , ) is called an extended b metric on G if the following conditions hold for all ð , , G :
1. 
d c ( ð , ) = 0 ð = ;
2. 
d c ( ð , ) = d c ( , ð ) ;
3. 
d c ( ð , ) θ ( ð , ) d c ( ð , ) + d c ( , ) .
The pair ( G , d c ) is then referred to as an extended b-metric space.
Later, Mlaiki et al. [13] proposed a broader framework extending b-metric spaces.
Definition 3
([13]). Let G be a nonempty set, and let α : G × G [ 1 , ) be a function. A mapping d c : G × G [ 0 , ) is said to define a controlled metric-type structure on G if for every ð , , G , the following are true:
1. 
d c ( ð , ) = 0 if and only if ð = ;
2. 
d c ( ð , ) = d c ( , ð ) ;
3. 
d c ( ð , ) α ( ð , ) d c ( ð , ) + α ( , ) d c ( , ) .
In such a case, the pair ( G , d c ) is called a controlled metric-type space.
A further generalization was presented by Abdeljawad et al. [14] in 2018.
Definition 4
([14]). Let α , μ : G × G [ 1 , ) be two control functions. A mapping d c : G × G [ 0 , ) is called a double controlled metric-type if the following hold for all ð , , G :
1. 
d c ( ð , ) = 0 ð = ;
2. 
d c ( ð , ) = d c ( , ð ) ;
3. 
d c ( ð , ) α ( ð , ) d c ( ð , ) + μ ( , ) d c ( , ) .
The space ( G , d c ) equipped with such a function will be called a double-controlled metric-type space (DCMTS).
Remark 1
([14]). Every controlled metric-type space may be viewed as a particular case of a double-controlled metric-type space when the two control functions coincide. The reverse implication does not hold in general.
The standard topological notions such as convergence, Cauchy sequences, and completeness in double-controlled metric-type spaces are defined in the usual manner.
Definition 5
([14]). Let ( G , d c ) be a DCMTS:
(1) 
A sequence ð n G is said to converge to ð G if for every ε > 0 , there exists an integer N ε such that d c ( ð n , ð ) < ε whenever n N ε . It is written as lim n ð n = ð .
(2) 
A sequence ð n is called a Cauchy sequence if for every ε > 0 , there exists an integer N ε such that d c ( ð n , ð m ) < ε for all m , n N ε .
(3) 
( G , d c ) is said to be complete if every Cauchy sequence is convergent.
Definition 6
([24]). Let G , and let I = [ 0 , 1 ] . Define the mapping d c : G × G [ 0 , ) . Then, a continuous mapping ω : G × G × I G is called a convex structure on G if for every o , ð , G and λ I , we have
d c ( o , ω ( ð , ; λ ) ) λ d c ( o , ð ) + ( 1 λ ) d c ( o , ) .

3. Main Results

3.1. Convergence Results

We start by defining the concept of a convex double-controlled metric-type space.
Definition 7.
Let ( G , d c ) be a double-controlled metric-type space with control functions α , μ : G × G [ 1 , ) . Assume that ω : G × G × I G is a convex structure on G. Then, the triple ( G , d c , ω ) will be called a convex double-controlled metric-type space (convex DCMTS).
For a mapping : G G , the classical Mann iteration can be adapted to the convex DCMTS framework as follows:
ð n + 1 = ω ( ð n , ð n ; δ n ) , n N ,
where δ n [ 0 , 1 ] . The sequence ð n generated in this way will be referred to as the Mann iteration sequence associated with .
We now provide examples illustrating a convex DCMTS.
Example 1.
Let G = R 2 , and for any ð , G , define the metric d c : G × G [ 0 , ) by
d c ( ð , ) = ð p , p > 1 ,
where ð = max ð 1 1 , ð 2 2 for ð = ( ð 1 , ð 2 ) and = ( 1 , 2 ) in R 2 .
Let the convex structure ω : G × G × [ 0 , 1 ] G be given by
ω ( ð , ; λ ) = λ ð + ( 1 λ ) .
Then, ( G , d c , ω ) is a convex DCMTS with control functions α ( ð , ) = μ ( ð , ) = 2 p 1 for all ð , G , where α , μ : G × G [ 1 , ) .
Clearly, for all ð , G , d c ( ð , ) = 0 if and only if ð = and d c is symmetric.
Also, for any ð , , G , we have
ð ð +
and since p > 1 , by taking the pth power and using a + b p 2 p 1 a p + b p , for a , b 0 , we deduce that
ð p 2 p 1 ð p + p .
From the inequalities in Equations (2) and (3), we get
d c ( ð , ) = ð p 2 p 1 ð p + p 2 p 1 d c ( ð , ) + d c ( , ) .
Thus, d c satisfies the double-controlled metric-type inequality with control functions α ( ð , ) = μ ( ð , ) = 2 p 1 . Therefore, ( G , d c , ω ) is a DCMTS with α and μ .
It remains to verify that the function ω satisfies the inequality in Equation (1).
For any o , ð , G , we get
d c ( o , ω ( ð , ; λ ) ) = o ω p λ o ð + ( 1 λ ) o p λ o ð p + ( 1 λ ) o p λ d c ( o , ð ) + ( 1 λ ) d c ( o , ) .
Hence, ( G , d c , ω ) is a convex DCMTS with α and μ .
Example 2.
Let G = [ 0 , ) , and for any ð , G , define the metric d c : G × G [ 0 , ) by
d c ( ð , ) = e ð 1 .
Also, define the convex structure ω : G × G × [ 0 , 1 ] G , given by
ω ( ð , ; λ ) = λ ð + ( 1 λ ) , for λ [ 0 , 1 ] .
Let the control functions α , μ : G × G [ 1 , ) be given by
α ( ð , ) = e ð + 1 2 a n d μ ( ð , ) = e ð + 1 2 .
Then, ( G , d c , ω ) is a convex DCMTS with control functions α , μ .
Indeed, it is clear that for all ð , G , d c ( ð , ) = 0 if and only if ð = and d c is symmetric.
For any ð , , G , using the triangle inequality ð ð + and the fact that the function t e t 1 is increasing and convex on [ 0 , ) , we obtain
d c ( ð , ) = e ð 1 e ð + 1 = e 2 ð + 2 2 1 1 2 e 2 ð 1 + 1 2 e 2 1 = 1 2 e ð 1 e ð + 1 + 1 2 e 1 e + 1 e ð + 1 2 d c ( ð , ) + e + 1 2 d c ( , ) = α ( ð , ) d c ( ð , ) + μ ( , ) d c ( , ) .
Thus, the double-controlled metric-type inequality holds. Therefore, ( G , d c , ω ) is a DCMTS with α and μ .
Next, for any o , ð , G and λ [ 0 , 1 ] , we have
d c ( o , ω ( ð , ; λ ) ) = e o ω ( ð , ; λ ) 1 e λ o ð + ( 1 λ ) o 1 ,
and since the function t e t 1 is increasing and convex on [ 0 , ) , it follows that
d c ( o , ω ( ð , ; λ ) ) λ e o ð 1 + ( 1 λ ) e o 1 = λ d c ( o , ð ) + ( 1 λ ) d c ( o , ) .
Hence, ( G , d c , ω ) is a convex DCMTS with α and μ .
On the other hand, ( G , d c ) is not a b-metric space. Indeed, assume that there exists s 1 such that
d c ( ð , ) s d c ( ð , ) + d c ( , )
for all ð , , G . By taking ð = 0 ,   = 2 n ,   = n , we obtain
e 2 n 1 2 s e n 1 ,
which implies
e n + 1 2 s .
However, for n , we have e n + 1 2 , which is a contradiction. Therefore, ( G , d c ) is not a b-metric space.
We now present a Banach contraction result for complete convex double-controlled metric-type spaces via Mann’s iteration process.
Theorem 1.
Let ( G , d c , ω ) be a complete convex DCMTS with control functions α , μ : G × G [ 1 , ) and ℜ : G G be a contraction mapping; that is, there exists β [ 0 , 1 ) such that
d c ( ð , ) β d c ( ð , ) , f o r a l l ð , G .
Fix ð 0 G , and define Mann’s iteration process by
ð n + 1 = ω ð n , ð n ; δ n , n N ,
where δ n [ 0 , 1 ) . Let ð G be an arbitrary point, and set
Ω : = ð , ð n , ð n : n N .
Assume that the control functions are bounded on Ω × Ω , i.e., there exist constants ξ , ϖ 1 such that
α ( ð , ) ξ , μ ( ð , ) ϖ , f o r a l l ð , , Ω .
Since the control functions are bounded on Ω × Ω , let us define
κ : = max ξ , ϖ .
In addition, if β κ 4 < 1 and 0 δ n < 1 κ 4 β 1 β for each n N , then ℜ has a unique fixed point ð G , and Mann’s iteration sequence ð n converges to ð .
Proof. 
Observe that for each n N , we have
d c ( ð n , ð n + 1 ) = d c ð n , ω ð n , ð n ; δ n 1 δ n d c ( ð n , ð n ) .
By using the double-controlled metric-type inequality together with the convex structure, we estimate the term d c ( ð n , ð n ) as follows:
d c ( ð n , ð n ) α ð n , ð n 1 d c ð n , ð n 1 + μ ð n 1 , ð n d c ð n 1 , ð n α ð n , ð n 1 d c ω ð n 1 , ð n 1 ; δ n 1 , ð n 1 + μ ð n 1 , ð n β d c ð n 1 , ð n = α ð n , ð n 1 d c ω ð n 1 , ð n 1 ; δ n 1 , ð n 1 + μ ð n 1 , ð n β d c ð n 1 , ω ð n 1 , ð n 1 ; δ n 1 α ð n , ð n 1 δ n 1 d c ð n 1 , ð n 1 + 1 δ n 1 d c ð n 1 , ð n 1 + μ ð n 1 , ð n β δ n 1 d c ð n 1 , ð n 1 + 1 δ n 1 d c ð n 1 , ð n 1 = α ð n , ð n 1 δ n 1 d c ð n 1 , ð n 1 + μ ð n 1 , ð n β 1 δ n 1 d c ð n 1 , ð n 1 = α ð n , ð n 1 δ n 1 + μ ð n 1 , ð n β 1 δ n 1 d c ð n 1 , ð n 1 ξ δ n 1 + ϖ β 1 δ n 1 d c ð n 1 , ð n 1 .
Let us take κ : = max ξ , ϖ and define γ n 1 = κ δ n 1 + β 1 δ n 1 . Under the assumptions β κ 4 < 1 and 0 δ n < 1 κ 4 β 1 β , we get
d c ( ð n , ð n ) γ n 1 d c ð n 1 , ð n 1 < 1 κ 3 d c ð n 1 , ð n 1 ,
from which it follows that d c ( ð n , ð n ) is decreasing and bounded below by zero. Therefore, there exists c 0 such that
lim n d c ( ð n , ð n ) = c .
We now prove that c = 0 . Assume, on the contrary, that c > 0 . Passing to the limit as n in the inequality in Equation (5) gives
c 1 κ 3 c < c ,
which is a contradiction. Hence, we get that c = 0 . Moreover, we have
d c ( ð n , ð n + 1 ) 1 δ n d c ( ð n , ð n ) < d c ( ð n , ð n ) ,
which shows that lim n d c ( ð n , ð n + 1 ) = 0 .
We now verify that ð n forms a Cauchy sequence. Suppose the contrary. Then, there exist ε 0 > 0 and the subsequences ð θ ( s ) and ð η ( s ) of ð n such that θ ( s ) > η ( s ) > s , with
d c ð θ ( s ) , ð η ( s ) ε 0
and
d c ð θ ( s ) 1 , ð η ( s ) < ε 0 .
Then, we conclude that
ε 0 d c ð θ ( s ) , ð η ( s ) α ð θ ( s ) , ð η ( s ) + 1 d c ð θ ( s ) , ð η ( s ) + 1 + μ ð η ( s ) + 1 , ð η ( s ) d c ð η ( s ) + 1 , ð η ( s ) ξ d c ð θ ( s ) , ð η ( s ) + 1 + ϖ d c ð η ( s ) + 1 , ð η ( s ) κ d c ð θ ( s ) , ð η ( s ) + 1 + d c ð η ( s ) + 1 , ð η ( s ) .
By taking the limit superior on both sides of the above inequality and using the fact that lim n d c ( ð n , ð n + 1 ) = 0 , we obtain
ε 0 κ lim n sup d c ð θ ( s ) , ð η ( s ) + 1 .
In noticing that
d c ð θ ( s ) , ð η ( s ) + 1 = d c ω ð θ ( s ) 1 , ð θ ( s ) 1 ; δ θ ( s ) 1 , ð η ( s ) + 1 δ θ ( s ) 1 d c ð θ ( s ) 1 , ð η ( s ) + 1 + 1 δ θ ( s ) 1 d c ð θ ( s ) 1 , ð η ( s ) + 1 δ θ ( s ) 1 d c ð θ ( s ) 1 , ð η ( s ) + 1 + 1 δ θ ( s ) 1 α ð θ ( s ) 1 , ð η ( s ) + 1 d c ð θ ( s ) 1 , ð η ( s ) + 1 + μ ð η ( s ) + 1 , ð η ( s ) + 1 d c ð η ( s ) + 1 , ð η ( s ) + 1 δ θ ( s ) 1 d c ð θ ( s ) 1 , ð η ( s ) + 1 + 1 δ θ ( s ) 1 α ð θ ( s ) 1 , ð η ( s ) + 1 β d c ð θ ( s ) 1 , ð η ( s ) + 1 + μ ð η ( s ) + 1 , ð η ( s ) + 1 d c ð η ( s ) + 1 , ð η ( s ) + 1 δ θ ( s ) 1 + 1 δ θ ( s ) 1 α ð θ ( s ) 1 , ð η ( s ) + 1 β d c ð θ ( s ) 1 , ð η ( s ) + 1 + 1 δ θ ( s ) 1 μ ð η ( s ) + 1 , ð η ( s ) + 1 d c ð η ( s ) + 1 , ð η ( s ) + 1 δ θ ( s ) 1 + 1 δ θ ( s ) 1 α ð θ ( s ) 1 , ð η ( s ) + 1 β α ð θ ( s ) 1 , ð η ( s ) d c ð θ ( s ) 1 , ð η ( s ) + μ ð η ( s ) , ð η ( s ) + 1 d c ð η ( s ) , ð η ( s ) + 1 + 1 δ θ ( s ) 1 μ ð η ( s ) + 1 , ð η ( s ) + 1 d c ð η ( s ) + 1 , ð η ( s ) + 1 δ θ ( s ) 1 + 1 δ θ ( s ) 1 ξ β ξ d c ð θ ( s ) 1 , ð η ( s ) + ϖ d c ð η ( s ) , ð η ( s ) + 1 + 1 δ θ ( s ) 1 ϖ d c ð η ( s ) + 1 , ð η ( s ) + 1 κ 2 δ θ ( s ) 1 + 1 δ θ ( s ) 1 β d c ð θ ( s ) 1 , ð η ( s ) + d c ð η ( s ) , ð η ( s ) + 1 + 1 δ θ ( s ) 1 κ d c ð η ( s ) + 1 , ð η ( s ) + 1 ,
we deduce that
1 κ ε 0 lim n sup d c ð θ ( s ) , ð η ( s ) + 1 κ 2 1 κ 4 ε 0 < 1 κ ε 0 ,
which is a contradiction. Hence, the sequence ð n is a Cauchy sequence in G. Since G is complete, there exists ð G such that lim n d c ( ð n , ð ) = 0 .
Finally, we verify that ð is a fixed point of . Observe that
d c ð , ð α ð , ð n d c ð , ð n + μ ð n , ð d c ð n , ð α ð , ð n d c ð , ð n + μ ð n , ð α ð n , ð n d c ð n , ð n + μ ð n , ð d c ð n , ð α ð , ð n d c ð , ð n + μ ð n , ð α ð n , ð n d c ð n , ð n + μ ð n , ð β d c ð n , ð ξ d c ð , ð n + ϖ ξ d c ð n , ð n + ϖ β d c ð n , ð κ d c ð , ð n + κ 2 d c ð n , ð n + κ 2 β d c ð n , ð .
Letting n yields d c ð , ð = 0 . Therefore, ð = ð . Thus, ð is a fixed point of .
To prove the uniqueness, suppose that G is another fixed point of , i.e., = . Then, we have
d c ð , = d c ð , β d c ð , .
Since 0 β < 1 , this implies d c ð , = 0 and hence ð = . Therefore, the fixed point is unique.
This completes the proof. □
An example is provided below to show how the above theorem can be applied.
Example 3.
Let G = [ 0 , ) and fix ð 0 G and choose λ ( 0 , 1 ) such that λ e ð 0 + 1 2 4 < 1 . Define : G G by
ð = λ ð 1 + ð .
For any ð , , G , we define the function d c : G × G [ 0 , ) by
d c ( ð , ) = e ð 1
while the mapping ω : G × G × [ 0 , 1 ] G is defined by
ω ( ð , ; δ ) = δ ð + ( 1 δ ) .
Let the control functions be given by
α ( ð , ) = e ð + 1 2 a n d μ ( , ) = e ð + 1 2 ,
and Mann’s iteration be defined by
ð n + 1 = ω ð n , ð n ; δ n , n N ,
where δ n [ 0 , 1 ) .
Then, ( G , d c , ω ) is a complete convex DCMTS with control functions α and μ, and ℜ has a unique fixed point in G.
Indeed, for all ð , G , it is clear that d c ( ð , ) = 0 if and only if ð = and d c is symmetric.
For any ð , , G , using the triangle inequality ð ð + , we obtain
d c ð , = e ð 1 e ð + 1 .
Set a = e ð ,   b = e . Then, a , b 1 , and therefore
d c ð , a b 1 .
Now, using
a b 1 a 2 1 + b 2 1 2 ,
we obtain
d c ð , e 2 ð 1 2 + e 2 1 2 e ð + 1 2 e ð 1 + e + 1 2 e 1 = α ( ð , ) d c ( ð , ) + μ ( , ) d c ( , ) .
Thus, d c satisfies the double-controlled metric-type inequality. Therefore, ( G , d c , ω ) is a DCMTS with α and μ .
Next, for any o , ð , G and λ [ 0 , 1 ] , we have
d c ( o , ω ( ð , ; λ ) ) = e o ω ( ð , ; λ ) 1 e λ o ð + ( 1 λ ) o 1 ,
and since the exponential function is convex, it follows that
d c ( o , ω ( ð , ; λ ) ) λ e o ð 1 + ( 1 λ ) e o 1 = λ d c ( o , ð ) + ( 1 λ ) d c ( o , ) .
Hence, ( G , d c , ω ) is a convex DCMTS with α and μ .
We now show that G , d c is complete. Let ð n be a Cauchy sequence in G . Then, we have
lim n , m d c ð n , ð m = lim n , m e ð n ð m 1 = 0 .
Hence, it follows that
lim n , m ð n ð m = 0 .
Thus, ð n is a Cauchy sequence in the usual metric on [ 0 , ) . Since [ 0 , ) is complete, there exists ð [ 0 , ) such that lim n ð n = ð in the usual metric. Consequently, we have
lim n d c ð n , ð = lim n e ð n ð 1 = 0 .
Therefore, G , d c is complete.
Now, for all ð , G , we have
ð = λ ð 1 + ð λ 1 + λ ð 1 + ð 1 + λ ð
and therefore
d c ð , = e ð 1 e λ ð 1 .
Now, since the exponential function is convex and 0 < λ < 1 , we have
e λ ð = e 1 λ 0 + λ ð 1 λ e 0 + λ e ð .
Therefore, we have
e λ ð 1 λ e ð 1
and hence, we obtain
d c ð , λ d c ð , .
Thus, ℜ is a contraction with a constant β = λ .
Mann’s iteration is
ð n + 1 = ω ð n , ð n ; δ n = δ n ð n + 1 δ n λ ð n 1 + ð n .
Since ð n 1 + ð n ð n for ð n 0 , we get
ð n + 1 δ n ð n + 1 δ n λ ð n = δ n + 1 δ n λ ð n .
Let ρ n = δ n + 1 δ n λ . Since ρ n ( 0 , 1 ) , by induction, we get
0 ð n ρ n n ð 0 ð 0 ,
and hence the sequence ð n is bounded, and for n , we get that ð n 0 .
Set Ω : = 0 , ð n , ð n : n N . Using 0 ð n ð 0 , we find that
α ( ð n , ð n + 1 ) = e ð n ð n + 1 + 1 2 e ð 0 + 1 2 ,
and
μ ( ð n , ð n + 1 ) = e ð n ð n + 1 + 1 2 e ð 0 + 1 2 .
Thus, the control functions are bounded on Ω × Ω , and one may take
κ = e ð 0 + 1 2 < .
Through the choice of λ, we have β κ 4 = λ e ð 0 + 1 2 4 < 1 .
Finally, solving
ð = ð = λ ð 1 + ð
gives ð = 0 . Hence, the only fixed point of ℜ is zero in G .
Therefore, all hypotheses of Theorem 1 are satisfied, and the Mann iteration converges strongly to a unique fixed point of ℜ.

3.2. Stability Results

In this section, we study the stability properties of the Mann iteration process in convex double-controlled metric-type spaces. We first establish the weak stability of the iteration process. Afterward, a data dependence result is obtained. To proceed, we recall the following auxiliary lemma.
Lemma 1
([27]). Let k n and l n be the sequences of non-negative real numbers satisfying k n + 1 h k n + l n for all n N , where h [ 0 , 1 ) and lim n l n = 0 . Then, lim n k n = 0 .
The above lemma will play a key role in establishing the stability of the Mann iteration process.
We now investigate the weak stability of the iteration process defined in the previous section.
The notion of stability for iteration procedures in complete metric spaces was introduced by Qing and Rhoades [28]. We recall the definition below.
Definition 8
([28]). Let ( G , d c ) be a complete metric space, and let : G G be a mapping with a fixed point ð G . An iteration sequence ð n defined by ð n + 1   = F ( , ð n ) , for all n N , where F denotes an iteration function, is said to be ℜ-stable if ð n converges to a fixed point ð of ℜ, and if every sequence n G satisfies lim n d c n + 1 , F ( , n ) = 0 , then we have lim n n = ð .
A related notion, called weak stability of iteration procedures, was introduced by Chen et al. [26] in 2020. The definition is recalled below.
Definition 9
([26]). Let ( G , d c ) be a complete metric space, and let : G G be a mapping with a fixed point ð G . An iteration sequence ð n defined by ð n + 1   = F ( , ð n ) , for all n N , where F denotes an iteration function, is said to be weakly ℜ-stable if ð n converges to a fixed point ð of ℜ, and if every sequence n G satisfies lim n d c n + 1 , F ( , n ) = 0 , and the sequence d c n , n is bounded, then we have lim n n = ð .
Remark 2
([26]). Every ℜ-stable iterative procedure is automatically weakly ℜ-stable. In general, however, the reverse implication remains unclear.
Theorem 2.
Let ( G , d c , ω ) be a complete convex DCMTS. Suppose that the hypotheses of Theorem 1 are satisfied, and assume in addition that
lim n δ n = 0 .
Then, the Mann iteration process is weakly ℜ-stable.
Proof. 
From Theorem 1, we know that the mapping possesses a unique fixed point ð in G. Let n G be a sequence satisfying lim n d c n + 1 , ω n , n ; δ n = 0 , and assume that the sequence d c n , n is bounded. We obtain
d c n + 1 , ð α n + 1 , n + 1 d c n + 1 , ω n , n ; δ n + μ n + 1 , ð d c ω n , n ; δ n , ð α n + 1 , n + 1 d c n + 1 , ω n , n ; δ n + μ n + 1 , ð α n + 1 , n d c ω n , n ; δ n , n + μ n , ð d c n , ð α n + 1 , n + 1 d c n + 1 , ω n , n ; δ n + μ n + 1 , ð α n + 1 , n δ n d c n , n + μ n , ð β d c n , ð = α n + 1 , n + 1 d c n + 1 , ω n , n ; δ n + μ n + 1 , ð α n + 1 , n δ n d c n , n + μ n + 1 , ð μ n , ð β d c n , ð κ d c n + 1 , ω n , n ; δ n + κ 2 δ n d c n , n + κ 2 β d c n , ð .
Noticing that d c n , n is bounded, β κ 2 < 1 κ 2 < 1 , lim n d c n + 1 , ω n , n ; δ n = 0 , and lim n δ n = 0 , we can apply Lemma 1.
Consequently, we have
lim n d c n , ð = 0 .
This finishes the proof. □
Next, we turn to the study of data dependence for the Mann iteration process in convex double-controlled metric-type spaces.
In order to establish the data dependence result, we first present the following auxiliary lemma and introduce the notion of an approximate operator.
Lemma 2
([29]). Let r n be a non-negative real sequence where there exists n 0 N such that for all n > n 0 satisfying
r n + 1 1 ψ n r n + ψ n σ n ,
where ψ n 0 , 1 such that n = 0 ψ n = and σ n 0 for all n N , then
0 lim n sup r n lim n sup σ n .
Definition 10
([29]). Let , : G G be two operators. We say that ℘ is an approximate operator of ℜ for all ð G and a fixed ε > 0 if d c ( ð , ð ) ε .
We are now ready to prove the following data dependence theorem.
Theorem 3.
Let G be a complete convex DCMTS with control functions α , μ : G × G [ 1 , ) , ℜ : G G be a contraction mapping with the fixed point ð , and ℘ : G G be an approximate operator of ℜ with a fixed point . Let ð n be an iterative sequence generated by Equation (4) for ℜ, and define an iterative sequence n for ℘ as follows:
n + 1 = ω n , n ; δ n , n N ,
where δ n is a real sequence in [ 0 , 1 ) satisfying n = 0 δ n = . Assume that the control functions α , μ are bounded on Ω × Ω , where Ω is defined in Theorem 1 and α , μ satisfy α ( ð , ) ξ ,   μ ( ð , ) ϖ , for all ð , Ω , κ : = max ξ , ϖ and κ β < 1 . Then, we have
d c ð , κ ε 1 κ β .
Proof. 
From the definition of the Mann iteration process for and , we obtain
d c ð n + 1 , n + 1 = d c ω ð n , ð n ; δ n , ω n , n ; δ n δ n d c ð n , n + 1 δ n d c ð n , n δ n d c ð n , n + 1 δ n α ð n , n d c ð n , n + μ n , n d c n , n δ n d c ð n , n + 1 δ n ϖ β d c ð n , n + ε δ n d c ð n , n + 1 δ n κ β d c ð n , n + κ ε δ n + 1 δ n κ β d c ð n , n + 1 δ n κ ε .
By taking ρ n = 1 δ n , from last inequality, we have
d c ð n + 1 , n + 1 1 ρ n 1 κ β d c ð n , n + ρ n 1 κ β κ ε 1 κ β .
For κ β < 1 , it can be easily seen that all conditions in Lemma 2 are satisfied. Therefore, we get
lim n sup d c ð n , n lim n sup κ ε 1 κ β .
Since ð n ð and ð n as n , consequently, we deduce that
d c ð , κ ε 1 κ β .
The following example illustrates the above data dependence result.
Example 4.
Let G = [ 0 , 1 ] , and define the metric d c : G × G [ 0 , ) by
d c ð , = e ð 1 ,
for all ð , G . The convex structure on G is given by
ω ( ð , ; λ ) = λ ð + ( 1 λ ) , ð , G , λ [ 0 , 1 ] ,
and the control functions α ,   μ : G × G [ 1 , ) are defined by
α ( ð , ) = e ð + 1 2 a n d μ ( ð , ) = e ð + 1 2 .
Under Example 2, ( G , d c , ω ) is a convex DCMTS with the control functions α ,   μ .
Define the mapping : G G and the approximate operator : G G  by
ð = ð 5 a n d ð = ð 5 + 1 10 .
For any ð , G , we find that
d c ð , = e ð 1 = e ð 5 1 1 5 d c ð , .
Thus, ℜ is a contraction mapping with β = 1 5 , and ð = 0 is the unique fixed point of ℜ. Similarly,is also a contraction with the same constant, and = 1 8 is the unique fixed point of ℘.
Moreover, for all ð G and ε = e 1 / 10 1 , we get d c ð , ð ε .
Since ð , G , we have ð 1 . Hence, we find that
α ( ð , ) e + 1 2 a n d μ ( ð , ) e + 1 2 .
Thus, the control functions are bounded on G × G and therefore on Ω × Ω . Hence, we may take κ = e + 1 2 , and we have
κ β = e + 1 10 < 1 .
Therefore, all assumptions of the Theorem 3 are satisfied.
Then, we can find the following estimate:
d c ð , = e 0 1 8 = e 1 / 8 1 κ ε 1 κ β .
Table 1 shows that the sequences ð n and n generated by Equation (4) for ℜ and , respectively, converge to the fixed points ð = 0 and = 1 8 , where δ n = n + 1 n + 2 ,   ð 0 = 0 = 1 .
The above computations were obtained by using the MATLAB R2023b program.

4. Applications

As an application of Theorem 1, we studied the solvability of the following Fredholm integral equation:
ð ( s ) = f ( s ) + ϱ i j K ( s , τ ) ð ( τ ) d τ , s , τ i , j .
where K :   i , j × i , j R is a continuous function and f C i , j .
Let G = C i , j denote the space of all real-valued continuous functions on the interval i , j . Let the mapping d c : G × G [ 0 , ) be defined by
d c ð , = max s i , j ð ( s ) ( s ) 2 , ð , G .
The convex structure is given by
ω ( ð , ; λ ) = λ ð + ( 1 λ ) , ð , G , λ [ 0 , 1 ] .
It follows that ( G , d c , ω ) forms a complete convex DCMTS with control functions α , μ : G × G [ 1 , ) defined by
α ( ð , ) = 1 + ð 2 , μ ( ð , ) = 1 + 2 .
Define the operator : G G by
ð ( s ) = f ( s ) + ϱ i j K ( s , τ ) ð ( τ ) d τ , ð G .
For δ n [ 0 , 1 ) , consider the Mann iteration process
ð n + 1 = ω ð n , ð n ; δ n = δ n ð n + 1 δ n ð n , n N .
Theorem 4.
Consider the linear integral in Equation (6). Let M = max s , τ i , j K ( s , τ ) . Suppose that the sequence ð n is bounded in C i , j . If
ϱ M j i < 1 ,
then the Fredholm integral in Equation (6) has a unique solution ð G , and the sequence ð n converges to ð .
Proof. 
For any ð , G = C i , j and s i , j , we have
d c ð , = max s , τ i , j ð ( s ) ( s ) 2 = max s , τ i , j ϱ i j K ( s , τ ) ð ( τ ) ( τ ) d τ 2 max s , τ i , j ϱ 2 i j K ( s , τ ) ð ( τ ) ( τ ) d τ 2 ϱ 2 M 2 j i 2 max s , τ i , j ð ( τ ) ( τ ) = ϱ 2 M 2 j i 2 d c ð , .
Since ϱ M j i < 1 , it follows that β = ϱ 2 M 2 j i 2 < 1 , and hence
d c ð , β d c ð , .
Therefore, the operator is a contraction.
Thus, all the hypotheses of Theorem 1 are satisfied. Therefore, has a unique fixed point ð G , and the Mann iteration sequence ð n converges to ð in the sense that lim n d c ( ð n , ð ) = 0 as n .
Finally, for each s , τ i , j , we find that
lim n sup i j K ( s , τ ) ð n ( τ ) ð ( τ ) d τ lim n sup i j K ( s , τ ) ð n ( τ ) ð ( τ ) d τ M j i lim n sup max ð n ( τ ) ð ( τ ) d τ = M j i lim n sup d c ( ð n ( s ) , ð ( s ) ) 1 / 2 .
Since lim n d c ( ð n , ð ) = 0 as n , we have
lim n i j K ( s , τ ) ð n ( τ ) d τ = i j K ( s , τ ) ð ( τ ) d c τ .
Substituting this equality into ð ( s ) = ð ( s ) shows that ð ( s ) satisfies the Fredholm integral in Equation (6).
Hence, ð ( s ) is the unique solution. □

5. Conclusions

In this paper, we introduced the concept of convex double-controlled metric-type spaces and investigated the convergence of the Mann iteration process for contractive mappings in this framework. Under suitable boundedness conditions on the control functions, we established the existence and uniqueness of fixed points and proved that the Mann iterative sequence converges to the fixed point.
Furthermore, we studied the stability behavior of the Mann iteration process and obtained a weak stability result. A data dependence theorem was also established to describe the relationship between the fixed points of an operator and its approximate operator. Finally, illustrative examples were provided to demonstrate the applicability of the obtained results.
These results extend several existing works on iterative methods for generalized metric-type spaces and contribute to the study of fixed point theory in double-controlled metric-type spaces equipped with convex structures.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  2. Bakhtin, I. The contraction mapping principle in quasimetric spaces. Funct. Anal. 1989, 30, 26–37. [Google Scholar]
  3. Czerwik, S. Contraction mappings in b-metric spaces. Acta Math. Inform. Univ. Ostrav. 1993, 1, 5–11. [Google Scholar]
  4. Boriceanu, M.; Bota, M.; Petruşel, A. Multivalued fractals in b-metric spaces. Cent. Eur. J. Math. 2010, 8, 367–377. [Google Scholar] [CrossRef]
  5. Jovanovic, M.; Kadelburg, Z.; Radenovic, S. Common fixed point results in metric-type spaces. Fixed Point Theory Appl. 2010, 1, 978121. [Google Scholar] [CrossRef]
  6. Aydi, H.; Bota, M.F.; Karapınar, E.; Mitrovic, S. A fixed point theorem for set-valued quasi-contractions in b-metric spaces. Fixed Point Theory Appl. 2012, 1, 88. [Google Scholar] [CrossRef]
  7. Aghajani, A.; Abbas, M.; Roshan, J.R. Common fixed point of generalized weak contractive mappings in partially ordered b-metric spaces. Math. Slovaca 2014, 64, 941–960. [Google Scholar] [CrossRef]
  8. Miculescu, R.; Mihail, A. New fixed point theorems for set-valued contractions in b-metric spaces. J. Fixed Point Theory Appl. 2017, 19, 2153–2163. [Google Scholar] [CrossRef]
  9. Ansari, A.H.; Aydi, H.; Kumari, P.S.; Yildirim, I. New Fixed Point Results via C-class Functions in b-Rectangular Metric Spaces. Commun. Math. Appl. 2018, 9, 109. [Google Scholar]
  10. Karapınar, E.; Agarwal, R.P. Fixed Point Theory in Generalized Metric Spaces; Springer: Berlin/Heidelberg, Germany, 2022. [Google Scholar]
  11. Yildirim, I. Fixed point results for F-Hardy-Rogers contractions via Mann’s iteration process in complete convex b-metric spaces. Sahand Commun. Math. Anal. 2022, 19, 15–32. [Google Scholar]
  12. Kamran, T.; Samreen, M.; UL Ain, Q. A generalization of b-metric space and some fixed point theorems. Mathematics 2017, 5, 19. [Google Scholar] [CrossRef]
  13. Mlaiki, N.; Aydi, H.; Souayah, N.; Abdeljawad, T. Controlled metric-type spaces and the related contraction principle. Mathematics 2018, 6, 194. [Google Scholar] [CrossRef]
  14. Abdeljawad, T.; Mlaiki, N.; Aydi, H.; Souayah, N. Double controlled metric-type spaces and some fixed point results. Mathematics 2018, 6, 320. [Google Scholar] [CrossRef]
  15. Sumaiya, T.Z.; Kalpana, G.; Thabet, A. A Different approach to fixed point theorems on triple controlled metric-type space with a numerical experiment. Dyn. Syst. Appl. 2021, 30, 111–131. [Google Scholar]
  16. Ahmad, H.; Younis, M.; Köksal, M.E. Double controlled partial metric type spaces and convergence results. J. Math. 2021, 1, 7008737. [Google Scholar] [CrossRef]
  17. Shoaib, A.; Kumam, P.; Alshoraify, S.S.; Arshad, M. Fixed point results in double controlled quasi metric type spaces. AIMS Math. 2021, 6, 1851–1864. [Google Scholar] [CrossRef]
  18. Ayoob, I.; Chuan, N.Z.; Mlaiki, N. Hardy-Rogers type contraction in double controlled metric-like spaces. AIMS Math. 2023, 8, 1362313636. [Google Scholar] [CrossRef]
  19. Ekiz Yazici, N.; Ege, O.; Mlaiki, N.; Mukheimer, A. Controlled S-metric-type spaces and applications to fractional integrals. Symmetry 2023, 15, 1100. [Google Scholar] [CrossRef]
  20. Azmi, F.M. Generalized contraction mappings in double controlled metric-type space and related fixed point theorems. J. Inequal. Appl. 2023, 2023, 87. [Google Scholar] [CrossRef]
  21. Alamgir, N.; Kiran, Q.; Ali, Y.; Aydi, H. Some fixed point results on controlled rectangular partial metric spaces with a graph structure. Carpathian Math. Publ. 2025, 17, 343–363. [Google Scholar] [CrossRef]
  22. Azmi, F.M. A New Class of (α, η, (Q, h), L)-Contractions in Triple Controlled Metric-Type Spaces with Application to Polynomial Sine-Type Equations. Axioms 2025, 14, 506. [Google Scholar] [CrossRef]
  23. Farooq, S.; Saleem, N.; Aphane, M.; Razzaque, A. Fixed-Point Results for (θ, G)-Quasirational Contraction in Triple Controlled Metric-Like Spaces with Applications. Math. Methods Appl. Sci. 2025, 48, 9920–9933. [Google Scholar] [CrossRef]
  24. Takahashi, W. A convexity in metric space and nonexpansive mappings, I. Kodai Math. Semin. Rep. 1970, 22, 142–149. [Google Scholar] [CrossRef]
  25. Goebel, K.; Kirk, W.A. Iteration processes for nonexpansive mappings. Contemp. Math. 1983, 21, 115–123. [Google Scholar]
  26. Chen, L.; Li, C.; Kaczmarek, R.; Zhao, Y. Several fixed point theorems in convex b-metric spaces and applications. Mathematics 2020, 8, 242. [Google Scholar] [CrossRef]
  27. Qihou, L. The convergence theorems of the sequence of Ishikawa iterates for hemicontractive mappings. J. Math. Anal. Appl. 1990, 148, 55–62. [Google Scholar] [CrossRef]
  28. Qing, Y.; Rhoades, B.E. T-stability of Picard iteration in metric spaces. Fixed Point Theory Appl. 2008, 2008, 418971. [Google Scholar] [CrossRef]
  29. Şoltuz, Ş.M.; Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive-like operators. Fixed Point Theory Appl. 2008, 2008, 242916. [Google Scholar] [CrossRef]
Table 1. Convergence of the Mann iteration for and ℘.
Table 1. Convergence of the Mann iteration for and ℘.
n ( Iterative Step ) ð n n d c ð n , n
10.73333333330.76666666670.0338951135
20.58666666670.63833333330.0530251894
50.37828266670.45599733330.0808141187
100.24697955400.34110789030.0987003712
500.07681593320.19221405850.1223204036
2000.02597021470.14772393790.1294757932
10000.00721372450.13131250890.1321274041
50000.00199317550.12674402860.1328657342
10,0000.00114465080.12600221180.1329857313
n 0.00000000000.12500000000.1331484531
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kadioglu Karaca, N. Fixed Point Results in Convex Double-Controlled Metric-Type Spaces and Applications. Mathematics 2026, 14, 1620. https://doi.org/10.3390/math14101620

AMA Style

Kadioglu Karaca N. Fixed Point Results in Convex Double-Controlled Metric-Type Spaces and Applications. Mathematics. 2026; 14(10):1620. https://doi.org/10.3390/math14101620

Chicago/Turabian Style

Kadioglu Karaca, Nazli. 2026. "Fixed Point Results in Convex Double-Controlled Metric-Type Spaces and Applications" Mathematics 14, no. 10: 1620. https://doi.org/10.3390/math14101620

APA Style

Kadioglu Karaca, N. (2026). Fixed Point Results in Convex Double-Controlled Metric-Type Spaces and Applications. Mathematics, 14(10), 1620. https://doi.org/10.3390/math14101620

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop