Stability of Fixed Points of Partial Contractivities and Fractal Surfaces

: In this paper, a large class of contractions is studied that contains Banach and Matkowski maps as particular cases. Sufficient conditions for the existence of fixed points are proposed in the framework of b-metric spaces. The convergence and stability of the Picard iterations are analyzed, giving error estimates for the fixed-point approximation. Afterwards, the iteration proposed by Kirk in 1971 is considered, studying its convergence, stability, and error estimates in the context of a quasi-normed space. The properties proved can be applied to other types of contractions, since the self-maps defined contain many others as particular cases. For instance, if the underlying set is a metric space, the contractions of type Kannan, Chatterjea, Zamfirescu, ´Ciri´c, and Reich are included in the class of contractivities studied in this paper. These findings are applied to the construction of fractal surfaces on Banach algebras, and the definition of two-variable frames composed of fractal mappings with values in abstract Hilbert spaces.


Introduction
M. Fréchet introduced a mapping to measure what he called "l'écart des deux éléments" (distance between two points) in his doctoral thesis [1], presented at the Faculty of Sciences of Paris and published in Italy in 1906.The conditions of this mapping are the axioms of a metric space.The name of metric space, however, is due to F. Hausdorff, who treated the topic in his book "Grundzüge der Mergenlehre" of 1914 [2].Previously, Hilbert [3] and Riemann [4] had shaken the foundations of classical geometry, proposing new axiomatic systems, with precedents in Gauss, Lobachevsky, and Bolyai.
Nowadays, the conditions of a mapping being a distance have been modified in very different ways, giving rise to a great variety of distance spaces (see, for instance, the books [5,6]).
Particularly interesting are the metrics associated with discrete mathematics, that concerns the knowledge and control of complex systems (see [7]).As an example, one may mention the Hamming distance, that measures the number of different bits of two code words, and it quantifies the error of transmission [8].
In this paper, we work with a generalization of a metric space, called in the literature the b-metric or quasi-metric space, that substitutes the triangular inequality by a more general condition.Closely related to metric theory (that gives rise to a class of topological spaces) is fixed-point theory, that establishes conditions for a self-map T : X → X in order to have a fixed point.The problem of finding a fixed point is intrinsically linked to the sought for solutions of one or several equations, since the equality x = Tx admits the form x − Tx = 0, in the case of an underlying vector space X.Important and recent applications of fixed-point theorems can be found in references [9,10], for instance.But these are not the only implications of the theory, since this area of mathematical knowledge has given rise to modern fields of research like fractal theory and others.
The content of this paper can be summarized as follows.In Section 2, the dynamics of a large class of contractions called (φ − ψ)-contractivities [11,12] is explored.Some sufficient conditions for the existence of fixed points are proposed, and the convergence of the Picard iterations for their approximation is studied for both cases, single-and multivalued mappings.Some error estimates for the Picard approximation are also given.For a study of multivalued mappings in b-metric spaces the reader may consult the reference [13].
Section 3 studies the stability of the fixed points' (φ − ψ)-partial contractivities, proving that they are asymptotically stable in the case of their existence.
Section 4 analyzes the iterative algorithm for fixed-point approximation proposed by Kirk in reference [14], when it is applied to a (φ − ψ)-contractivity defined on a quasinormed space.
The properties proved can be applied to other types of contractions, since the selfmaps considered contain many others as particular cases.For instance, if the underlaying set is a metric space, the contractions of type Kannan, Chatterjea, Zamfirescu, Ćirić, and Reich are included in the class of contractivities studied in this paper (see Corollary 2.2 of reference [11]).
Section 5 considers fractal surfaces whose values lie on Banach algebras.The mappings defining the surfaces are fixed points of an operator on a Bochner functional space.The convergence and stability of Picard and Kirk iterations for their approximation are analyzed, giving in both cases an estimate of the error.
Section 6 studies a particular case, where the vertical contraction is linear and bounded.Fractal convolutions of mappings and operators are defined, and the construction of bivariate fractal frames of the Bochner space of square-integrable mappings on a Hilbert space is undertaken, considering fractal perturbations of standard frames in the same space.

Existence of Fixed Points and Convergence of Picard Iterations
In this section, we explore the dynamics of a large class of contractions [11,12].We provide sufficient conditions for the existence of fixed points, and the convergence of the Picard iterations for their approximation for both single-and multivalued mappings.Some "a priori" error estimates for the Picard approximation are also given.
Let us start with the definition of b-metric space.
Definition 1.A b-metric space X is a set endowed with a mapping d : X × X → R + with the following properties: d(x, y) = d(y, x) for any x, y ∈ X.

3.
There exists s ≥ 1 such that d(x, y) ≤ s(d(x, z) + d(z, y)) for any x, y, z ∈ X.The constant s is the index of the b-metric space, and d is called a b-metric.
Example 1.The spaces l p (R) for 0 < p < 1 are b-metric spaces of index s = 2 1/p with respect to the functional Other examples can be found in reference [15], for instance.Given any x 0 , x 1 , . . .x n ∈ X, where X is a b-metric space with index s, one has the following inequality for n ≥ 2: The next definition can be read in reference [16].
Definition 2. A map φ : R + → R + is called a comparison function if it satisfies the following conditions: • φ is increasing.

•
φ n (δ) tends to zero when n tends to infinity for any δ > 0. Let X be a b-metric space.A map T : X → X such that d(Tx, Ty) ≤ φ(d(x, y)) for any x, y ∈ X, where φ is a comparison function, is called a φ-contraction or a Matkowski contraction [17].
The first aim of this article is the presentation of a new concept of contractivity, presenting maps that include the usual φ-contractions like a particular case, according to the following definition [11,12].Definition 3. Let X be a b-metric space, and T : X → X be a self-map such that for any x, y ∈ X, d(Tx, Ty) ≤ φ(d(x, y)) + ψ(d(x, Tx)). ( If φ is a comparison function, ψ is positive, and ψ(0) = 0, then T is a (φ − ψ)-partial contractivity.
If ψ is the null function, we have a standard φ-contraction.If further φ(δ) = aδ, where 0 < a < 1, then T is a Banach contraction.
Remark 1.Let us note that, unlike the φ-contractive case, a partial contractivity need not be continuous.
In previous articles, we proved that several well known contractivities, like Zamfirescu or quasi-contractions, belong to the class of (φ − ψ)-partial contractivities, when the constants associated satisfy some restrictions (see, for instance, [12]).The next result can be read in Proposition 15 of the same reference.Proposition 1.Let X be a b-metric space and T : X → X be a (φ − ψ)-partial contractivity.If T has a fixed point, it is unique.
We start with a result concerning the orbit separations in the case where ψ(t) = Bt, for B ≥ 0.
Example 5.The absolute value of a real number ϕ(δ) = |δ| is a sublinear function.In general, a seminorm is sublinear.
Proposition 2. Let X be a b-metric space and T : X → X be a (φ − ψ)-partial contractivity, where φ is a sublinear comparison function and ψ(t) = Bt, for B ≥ 0.Then, for all n ≥ 1, where Id denotes the identity map.
Proof.For n = 1 the result is clear since by definition of (φ − ψ)-partial contractivity.Let us assume that Formula (3) is valid for n = k and any x, y ∈ X: and let us prove it for n = k + 1.By definition of (φ − ψ)-partial contractivity for T k x, T k y, Applying the subadditivity of φ and the inductive hypothesis in the first term of the last sum, For the second summand, applying the inductive hypothesis for x and Tx, we have Let us consider the map φ((φ Developing both binomials, and bearing in mind the property of the combinatorial numbers, for k ∈ N and j = 1, . . ., k, we obtain that Thus, adding ( 5) and ( 6), and consequently, the result.
Applying iteratively the definition of the contractivity, The conditions on the comparison function φ imply that d(T n x, T n y) → 0, when n tends to infinity.
Remark 2. For the inequality (4), the hypotheses of sublinearity of φ and linearity of ψ are not required.
Corollary 1.Let X be a b-metric space and T : X → X be a partial contractivity, that is to say, φ(δ) = aδ and ψ(t) = Bt, for B ≥ 0.Then, for all n ≥ 1, Consequently, d Proof.The rates of orbit separation are straightforward consequences of the expressions (3) and ( 4).
Corollary 2. Let X be a b-metric space and T : X → X be a partial contractivity, that is to say, φ(δ) = aδ and ψ(t) = Bt, for B ≥ 0.Then, for all n ≥ 1, If a + B < 1, T is asymptotically regular, that it to say, and all the orbits are bounded.If a + B > 1, the orbit of an element x ∈ X may be unbounded.For B = 0 all the orbits are bounded and they are stable in the sense of Lagrange.
Proof.It suffices to take y = Tx in the inequality (7) to obtain the inequality.The second result comes also from the fact that if a + B < 1, T has a fixed point, it is unique (see reference [11]), and all the orbits are convergent to the fixed point, and consequently, they are bounded.
Remark 3. In fact, according to (3), T is asymptotically regular if there exists r ∈ R with 0 < r < 1 such that (φ + B.Id)(δ) ≤ rδ < 1 for any δ > 0, since substituting y = Tx into inequality (3), d(T n x, T n+1 x) ≤ r n d(x, Tx) and d(T n x, T n+1 x) tends to zero when n tends to infinity.Proposition 3. Let X be a b-metric space and T : X → X be a (φ − ψ)-partial contractivity.Let us assume that there is a fixed point x * ∈ X, then for all n ≥ 1 Consequently, the Picard iterations of any x ∈ X are convergent to the fixed point and the order of convergence is Proof.It suffices to apply the definition of (φ − ψ)-partial contractivity.
In the following, we give a result of fixed-point existence for (φ − ψ)-partial contractivities where ψ(t) = Bt.Theorem 1.If X is a complete b-metric space, T : X → X is a (φ − ψ)-partial contractivity where ψ(δ) = Bδ, and there exists a real constant k such that 0 < k < 1 satisfying the inequality for all δ ≥ 0, then T has a unique fixed point and T n x tends to x * for any x ∈ X.

Remark 4.
For the case φ(δ) = aδ, and 0 < a < 1, we obtain a partial contractivity, and the sufficient conditions for the existence of fixed point are a + B < 1 and X is complete.This result was proved in reference [11].
In the next theorem, we give an estimation of the error in the fixed-point approximation.Considering the sequence of Picard iterations (x n ) defined as x n = T n x, it is clear, by definition of (φ − ψ)-partial contractivity, that However, it is difficult to know the distance between an element x 0 and the sought fixed point, thus we will give an error estimation in terms of d(x 0 , x 1 ), a quantity easier to find.
Using (13) in the first term of the right-hand side, Taking limits when j tends to infinity, the second and third terms of the right-hand side tend to zero, due to the hypothesis of the theorem and inequality (11), respectively.Then, Corollary 3. In the particular case where φ(δ) = aδ with 0 < a < 1, we have the following "a priori" error estimation for partial contractivities such that (a + B)s < 1: In the case where B = 0, T is a Banach contraction, and the former expression generalizes the inequality given by Bakhtin [19,20] for this type of map.
The next result concerns set-valued maps satisfying a condition of partial contractivity type.Let us start with some definitions.Given a metric space X, let us con-sider the set of all nonempty bounded subsets of X, B(X).Let us define the functional Let us consider the distance of a point to a set d(a, B) = inf{d(a, b) : b ∈ B}.Theorem 3. Let X be a complete b-metric space, and let τ : X → B(X) be a set-valued map.Assume that there exist a ∈ R, 0 < a < 1, and B > 0 such that a + B < 1, satisfying the inequality D(τ(x), τ(y)) ≤ ad(x, y) + Bd(x, τ(x)) (14) for any x, y ∈ X.Then, τ has a fixed point x * ∈ X, τ(x * ) = {x * } and there exists a partial contractivity T : X → X whose unique fixed point is x * .Additionally, Proof.Let us define a map T : X → X such that Tx ∈ τ(x) and let us see that T is a partial contractivity: for any x, y ∈ X.Consequently, T is a partial contractivity.Since a + B < 1, T has a fixed point x * ∈ X.By definition of T, x * ∈ τ(x * ), and consequently, it is a fixed point of τ as well.Applying the contractivity condition (14), for any x, y ∈ X.The constants a, B satisfy the conditions of Theorem 3 and τ has as a unique fixed point x = 0, since 0 ∈ τ(0) = {0} and, if x ̸ = 0, x does not belong to τ(x).

Stability of Fixed Points of a (φ − ψ)-Partial Contractivity
In this paragraph, we study the fixed-point stability (φ − ψ)-partial contractivities.We consider (φ − ψ)-contractivities as described in Definition 3. Let Fix(T) denote the set of fixed points of T. Let us remember that if a (φ − ψ)-partial contractivity has a fixed point, it is unique.Let N(x * ) denote the set of neighborhoods of x * ∈ X. Definition 5. Le X be a b-metric space, T : X → X and G ⊆ X.Then, G is positively invariant if T(G) ⊆ G. Proposition 4. If X is a b-metric space, and T is a (φ − ψ)-partial contractivity with a fixed point x * , then any (open or closed) ball centered at the fixed point x * is a positively invariant set.
If x * is stable and there exists V ∈ N(x * ) such that lim n→∞ T n x = x * for any x ∈ V, then x * is asymptotically stable.Proposition 5. Le X be a b-metric space, and T : X → X be a (φ − ψ)-partial contractivity such that Fix(T) ̸ = ∅.Then, the Picard iterations (T n x) converge for any x ∈ X to the fixed point with asymptotical stability.
Consequently, T n (B(x * , r)) ⊆ B(x * , r) ⊆ U for all n ≥ 0, and x * is stable.Moreover, due to the definition of the comparison function.Hence, x * is asymptotically stable, and it is a global attractor, as proved previously.

Convergence and Stability of the Kirk Iterations
In this section, the iterative algorithm for fixed-point approximation proposed by Kirk in reference [14] is analyzed for when it is applied to a (φ − ψ)-contractivity defined on a quasi-normed space.

Definition 7. If E is a real linear space, the mapping | • |
There exists s ≥ If E is complete with respect to the b-metric induced by the quasi-norm, then E is a quasi-Banach space.Obviously, if s = 1 then E is a normed space.
The index of a quasi-norm is called sometimes the modulus of concavity of X.
Let us define the Kirk operator T K : X → X, where X is a quasi-normed space, as Kirk proved that the set of fixed points of a nonexpansive mapping T in a Banach space agrees with the set of fixed points of T K , that is to say, Fix(T) = Fix(T K ).He proved also that if Fix(T) ̸ = ∅ and X is uniformly convex, then T K is asymptotically regular, that is to say, lim n→∞ Let us study the convergence and stability of this algorithm for the approximation of the fixed point of a (φ − ψ)-partial contractivity T in a quasi-normed space.If y 0 := y ∈ X and x * ∈ Fix(T), Applying the definition of (φ − ψ)-partial contractivity, defining φ 0 := Id as always.Let us assume that the map ϕ : R + → R + defined as is a comparison function.In this case, we have and, in general, Consequently, the Kirk iterations are convergent to the fixed point x * with asymptotic stability as in the previous section.For the particular case where φ(δ) = aδ, assuming that the Kirk algorithm is convergent and stable since, from ( 18), we have The order of convergence of the iteration is O(r n ).In the normed case, where s = 1, this is always true since due to the conditions on α i , and we have the following theorem: Theorem 4. If X is a normed space, T : X → X is a (φ − ψ)-partial contractivity where ϕ(δ) = aδ, 0 < a < 1, and x * ∈ X is a fixed point, the Kirk iteration (T n K x) is convergent, asymptotically stable and asymptotically regular for any values of α i and x ∈ X.
Kirk proved that the iterates of his algorithm converge weakly to a fixed point of a nonexpansive mapping, according to the next theorem [14].
Theorem 5. Let X be a uniformly convex Banach space, K be a closed, bounded, and convex subset of X, and T : K → K be a nonexpansive mapping.Then, for x ∈ K the sequence (T n K x) converges weakly to a fixed point of T.
We give in the following a variant of this theorem.Theorem 6.Let X be a quasi-Banach space, K be a closed and convex subset of X, and T : K → K be a (φ − ψ)-contraction where ψ is the null function.Then, Fix(T) ̸ = ∅, Fix(T) = {x * }, and the Kirk iterations converge strongly to the fixed point x * for any x ∈ K if the map ϕ defined in ( 17) is a comparison function.
Proof.A (φ − ψ)-contractivity where ψ = 0 is a nonexpansive mapping, since for any x, y ∈ K. But, according to the hypotheses, T is also a φ-contraction on a complete b-metric space, consequently it has a single fixed point [23] and the Picard iterations are strongly convergent to it.Due to (18), the Kirk iterations have the same properties if ϕ is a comparison function.

Banach-Valued Fractal Surfaces
In this section, we define fractal surfaces whose values lie on Banach algebras.The convergence and stability of Picard and Kirk iterations for their approximation are also analyzed, giving in both cases an estimate of the error.
The mappings defining the surfaces are fixed points of an operator on the space of bivariate p-integrable maps on a Banach algebra A, B p (I × J, A), where I and J are real compact intervals.For 1 ≤ p < ∞ this space is Banach with respect to the norm where || • || is the norm in A. For 0 < p < 1, the space is quasi-Banach with modulus of concavity s = 2 1/p−1 .Consequently, in all the cases B p (I × J, A) is a complete b-metric space.
Let us consider partitions for the intervals I and J, x 0 < x 1 < . . .< x M for I = [x 0 , x M ], and y 0 < y 1 < . . .< y N for J = [y 0 , y N ], M, N > 1.Let us consider subintervals Let us define the affine maps satisfying the conditions for i = 1, 2, . . ., M and j = 1, 2, . . ., N. Given two maps f , g ∈ B p (I × J, A), let us define for (x, y) ∈ I × J and A ∈ A, with the same ranges of indexes.The case where A = R and R ij (x, y, z) = α ij z was treated in reference [24].
Let us define the operator for x ∈ I i , and y ∈ J j .In order to simplify the notation, let us define for any i, j and write for (x, y) Using the fact that S ij is a φ-contraction, Consequently, But ∑ M i=1 ∑ N j=1 c i e j = 1 due to conditions (20), and thus, T is a φ-contraction, and consequently, is a (φ − ψ)-contractivity with ψ = 0. Since B p (I × J, A) is quasi-Banach, and thus, a complete b-metric space, T has a single fixed point f φ ∈ B p (I × J, A), and the Picard iterations of any point are convergent to it.The graph of f φ has a fractal structure (see Theorem 5 of reference [25]).The order of convergence is for any h ∈ B p (I × J, A).In the particular case where φ(t) = at for 0 < a < 1, according to Corollary 3, for 1 ≤ p < ∞, and for 0 < p < 1, if as < 1, with s = 2 1/p−1 .
The fixed point f φ satisfies the functional equation for (x, y) ∈ I i × J j .Let us consider now the Kirk iteration, and the case where φ ij (δ) = a ij δ.Let us define a := max ij a ij and assume that Denoting the Kirk iterates as ĥn , bearing in mind the estimation (19), for n ≥ 0. Thus, the Kirk iterations are convergent with a rate of convergence O(r n ).This is always true in the normed case (1 due to the definition of α i .Consequently, the Kirk iteration is convergent in the normed case for any values of the coefficients, with asymptotic stability.Since the Kirk operator T K is also a Banach contraction if r < 1, we obtain error estimates for Kirk iterations as well: for 1 ≤ p < ∞, and for 0 < p < 1, if rs < 1, where s = 2 1/p−1 , and r is defined as in (27) in this second case.

Fractal Surfaces with Linear Vertical Contractions
Let us consider in this section the case where the vertical contraction operator S ij : B p (I × J, A) → B p (I × J, A), defined as S ij (h)(x, y) = R ij (x, y, h(x, y)) (see (21)), is linear and bounded.
We will define fractal convolutions of mappings and operators, and we will construct bivariate fractal frames of the Hilbert space B 2 (I × J, A) as fractal perturbations of standard frames in this space.
For the first part of (23), we have then T is a Banach contraction in a quasi-Banach space.Consequently, it has a fixed point f φ that is a bivariate mapping f φ (x, y) whose values are in the algebra A. Some choices for a linear operator may be S ij (g) = λ ij (g • c), where c : I × J → I × J and λ ij : R × R → R or S ij (g) = λ ij (g • v), with v : I × J → A, where • represents the product in the algebra A. In the first case, for c = Id we have the classical vertical contraction of the fractal interpolation functions.The estimation of the Picard iterations for the approximation of the fixed point f φ (24) and ( 25) holds in this case as well, substituting a by C, and considering the hypothesis Cs < 1 in the second error estimation (s ̸ = 1).
We can define the operator F φ : B p (I × J, A) → B p (I × J, A) that applies every map into its fractal perturbation: F φ ( f ) = f φ , considering the partition, functions u i , v j , operators S ij , and mapping g ∈ B p (I × J, A).It is an easy exercise to check that whenever Cs < 1. If, additionally, f and g are related by a linear and bounded operator L, that is to say, g = L f , then F φ is linear and bounded and This operator was defined by the author and studied for single-variable real maps and several functional spaces in reference [26].
Modulating the distance between a mapping f (x, y) and its fractal associated f φ (x, y), one can obtain fractal bases of several functional spaces (see, for instance, [25]).Given that f φ is obtained by the action of two bivariate mappings f and g, it is possible to define a binary internal operation * φ in the space B p (I × J, A) as f * φ g := f φ .This was called in the real case the fractal convolution of f and g.This operation is linear, that is to say, The details are similar to the real univariate case.
Let us denote by L(B p (I × J, A)) the space of linear and bounded operators on B p (I × J, A).Based on the fractal convolution of maps, it is possible to define an internal operation in the set of operators as for any f ∈ B p (I × J, A), and U, V ∈ L(B p (I × J, A)).The linearity and boundedness of U, V, and P imply that the operator is well defined.
In the following, we consider the case 1 ≤ p < ∞.
Theorem 7. Let U, V ∈ L(B p (I × J, A)) and let us assume that U is invertible such that |V f | p ≤ |U f | p for any f ∈ B p (I × J, A).Then, U * φ V is invertible and Proof.The proof is similar to that given in Theorem 8 of reference [25].
In the case where p = 2 and A = H is a Hilbert space, B 2 (I × J, H) is Hilbert as well, with respect to the inner product: < f , g >= I×J < f (x, y), g(x, y) > dxdy.
In the following, we consider p = 2 and we prove that given a frame ( f m ) ∞ m=0 of bivariate functions f m (x, y) ∈ H, we can construct Hilbert-valued fractal frames with two variables of type (U( f m ) * φ V( f m )) ∞ m=0 .Let us start by defining a frame in a Hilbert space.Definition 8.A sequence ( f m ) ∞ m=0 ⊆ X, where X is a Hilbert space is a frame if there exist real positive constants A, B such that for any f ∈ X, where || • || denotes the norm associated with the inner product in X.A and B are the bounds of the frame.
Theorem 8. Let U, V ∈ L(B 2 (I × J, H)) satisfy the hypotheses given in Theorem 7, and ( f m ) ∞ m=0 ⊆ B 2 (I × J, H) be a frame with bounds A, B. Then, ((U * φ V) f m ) ∞ m=0 is also a frame with bounds A φ and B φ , defined as Proof.Let (U * φ V) + be the adjoint operator of (U * φ V), and g ∈ B 2 (I × J, H).Applying the frame inequalities of ( f m ) ∞ m=0 for f = (U * φ V) + g one obtains using ( 35) and (36) one has and we have the right inequality for the sequence ((U * φ V) f m ) ∞ m=0 .For Theorem 7 we know that (U * φ V) is an invertible operator.Then, Hence, by (32) and ( 33), (U( f m ) * φ V( f m )) is also a frame and its bounds are A φ and B φ , defined as

Remark 5 .
Let us notice that we use the same notation for the norms of maps and linear operators (| • | p ) in order to simplify the text.