Next Article in Journal
Stability Analysis and Bifurcation Control of a Fractional Order Predator Prey System
Previous Article in Journal
Automatic Picking Method for the First Arrival Time of Microseismic Signals Based on Fractal Theory and Feature Fusion
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Semi-Rings, Semi-Vector Spaces, and Fractal Interpolation

Department of Mathematics, Technical University of Munich, Boltzmannstrasse 3, 85748 Munich, Germany
Fractal Fract. 2025, 9(11), 680; https://doi.org/10.3390/fractalfract9110680
Submission received: 29 September 2025 / Revised: 21 October 2025 / Accepted: 22 October 2025 / Published: 23 October 2025
(This article belongs to the Special Issue Applications of Fractal Interpolation in Mathematical Functions)

Abstract

In this paper, we introduce fractal interpolation on complete semi-vector spaces. This approach is motivated by the requirements of the preservation of positivity or monotonicity of functions for some models in approximation and interpolation theory. The setting in complete semi-vector spaces does not requite additional assumptions but is intrinsically built into the framework. For the purposes of this paper, fractal interpolation in the complete semi-vector spaces C + and L p + is considered.

1. Introduction

This paper introduces fractal interpolation and solutions of the fractal interpolation problem in complete semi-vector spaces. This approach is motivated by the necessity in approximation theory to preserve the positivity, monotonicity, or convexity of functions f. In each case, ± f ( k ) 0 for k = 0 , 1 , 2 , respectively. Fractal interpolation in these situations has been carried out but needed additional requirements. The interested reader may find numerous articles on this in the fractal literature.
The convenient setting of semi-vector spaces provides a means of only considering positive functions from the onset. Once it has been established that certain such semi-vector spaces are complete, they lend themselves to fractal interpolation and the application of the Banach fixed point theorem.
The structure of this paper is as follows: For the reader not familiar with the setting of semi-rings, semi-vector spaces, and related topics, we review and introduce these concepts in Section 2. This section forms the foundation for the remainder of this article. The two types of complete semi-vector spaces, namely C + I (continuous positive functions on a compact interval I R ) and L p + I (classes of positive functions in the Lebesgue spaces L p + I , p [ 1 , ] ) are defined here. For the sake of completeness, self-containment of the presentation, and the underlying foundational scope of fractal interpolation, we also provide the reader with the concepts of iterated function systems and fractal interpolation in Section 3. There, the fundamental object of a Read–Bajraktarević operator is introduced. In Section 5, we describe fractal interpolation in the complete semi-vector spaces C + I and L p + I and derive conditions that guarantee the existence of fractal functions in each of these two spaces. We briefly dwell on fractal sequences and series in C + I and L p + I . The section closes by describing a semi-linear fractal operator on each of these two spaces and presenting some of its properties. A conclusion and future research directions complete the paper.

2. Semi-Rings, Semi-Vector Spaces, and Related Results

In this section, we introduce those concepts from the areas of semi-rings and semi-vector spaces that are relevant for this paper. The interested reader can refer to [1,2] and the references given therein for more details. The definitions and examples presented in this section can be found in [1,3,4].

2.1. Definitions and Examples

Definition 1. 
A nonempty set S endowed with two binary operations + : S × S S (addition) and : S × S S (multiplication) is called a semi-ring if
(i) 
( S , + ) is a commutative monoid;
(ii)  
( S , ) is a semigroup;
(iii)  
Multiplication ∗ is distributive with respect to +, i.e., x , y , z S , ( x + y ) z = x z + y z , and x ( y + z ) = x y + x z .
To simplify the notation, we write S for ( S , + , ) unless it is necessary to avoid ambiguities. If multiplication * is commutative then S is called a commutative semi-ring and if there exists a 1 S such that x S , x 1 = 1 x = x , then S is called a semi-ring with (multiplicative) identity 1.
Definition 2. 
A semi-field is an ordered triple K : = ( K , + , ) , which is a commutative semi-ring with 1 satisfying the conditions
(i)  
x , y K ; x + y = 0 implies x = y = 0 ;
(ii)  
There are no multiplicative zero divisors in K.
Example 1. 
An example of a semi-field is the set R 0 + : = { x R : x 0 } endowed with the usual addition and multiplication of real numbers.
Now, we are ready to introduce the concept of a semi-vector space over a semi-field K.
Definition 3. 
Let V be a nonempty set endowed with the binary operations + : V × V V (vector addition) and · : K × V V (scalar multiplication). Then the ordered triple ( V , + , · ) is called a semi-vector space over the semi-field K provided that
(i)  
( V , + ) is a commutative monoid satisfying the additive cancellation law u , v , w V , u + v = u + w implies v = w ;
(ii)  
α K u , v K : α ( u + v ) = α u + α v ;
(iii)  
α , β K v V : ( α + β ) v = α v + β v ;
(iv)  
α , β K v V : ( α β ) v = α ( β v ) ;
(v)  
v V and 1 K : 1 · v = v .
To ease the notation, we write V for ( V , + , · ) unless this gives rise to confusion. We remark that the semi-vector spaces introduced here are called regular as they are required to satisfy Definition 3(i). The (unique) element 0 V V with v + 0 V = 0 V + v = v , v V will be referred to as the zero or null vector of V.
Let 0 V v V . If u V such that v + u = 0 V then v is called symmetrizable. A semi-vector space V is called simple if the only symmetrizable element is the zero vector 0 V .
Definition 4. 
Suppose V is a simple semi-vector space over the semi-field R 0 + . A nonempty subset B V is called a semi-basis of V if every 0 V v V has a unique representation in the form v = i I ( v ) v i b i where v i R + : = { x R : x > 0 } , b i B , and I ( v ) is a finite index set uniquely determined by v. The finite subset B v B given by B v : = { b i : i I ( v ) } and is uniquely determined by v. A semi-vector space is called semi-free if it admits a semi-basis.
A direct consequence of Definition 4 is the following corollary whose proof can be found in Corollary 1.7 of [4]:
Corollary 1. 
All semi-bases in a semi-free semi-vector space V have the same cardinality. This cardinality is called the semi-dimension of V.
The example below lists some semi-vector spaces. (See, for instance, also [1].)
Example 2. 
1. 
All vector spaces are semi-vector spaces. They are, however, not simple.
2. 
Let n N : = { n Z : n 1 } . The set ( R 0 + ) n : = X n i = 1 R 0 + together with the usual component-wise addition and scalar multiplication is a semi-vector space over the semi-field R 0 + , called the Euclidean semi-vector space.
3. 
For m , n N , denote by M n × m ( R 0 + ) the set of all n × m matrices with entries from R 0 + . Equipped with the usual matrix addition and matrix scalar multiplication, M n × m ( R 0 + ) forms a semi-vector space over R 0 + .
4. 
Let n N and let P n [ x ] denote the set of all polynomials with coefficients from R 0 + together with the usual addition and scalar multiplication, which is a semi-vector space over R 0 + .
Definition 5. 
A nonempty subset U of a semi-vector space ( V , + , · ) over R 0 + is called a semi-subspace of V if U satisfies
(i) 
u 1 , u 2 U , u 1 + u 2 U ;
(ii) 
α R 0 + u U , α u U .
We note that the uniqueness of 0 V and the regularity of the semi-vector space V imply that every semi-subspace U of V contains the zero vector. The following are some examples of semi-subspaces:
Example 3. 
1. 
Let Q 0 + : = { q Q : q 0 } . The semi-vector space Q 0 + over Q 0 + is a semi-subspace of R 0 + over Q 0 + .
2. 
The set of diagonal matrices in M n × n ( R 0 + ) is a semi-subspace of the latter.
Definition 6. 
Let V and W be semi-vector spaces over R 0 + and let T : V W be a map. T is called a semi-linear transformation between V and W if
(i)  
v 1 , v 2 V : T ( v 1 + v 2 ) = T v 1 + T v 2 ;
(ii)  
λ R 0 + v V : T ( λ v ) = λ T v .
In case W = V , we call T a semi-linear operator on V.
Remark 1. 
The expression semi-linear defined in Definition 6 is not to be confused with the one used in linear algebra and projective geometry where condition (ii) has the form λ R 0 + v V ; thus, it holds that T ( λ v ) = σ ( λ ) T v for some automorphism σ id of the underlying field.
Definition 7. 
Let V and W be semi-vector spaces over R 0 + . A mapping T : V W is called an affine semi-linear transformation if T T ( 0 ) is a semi-linear transformation V W .
We note that the set Hom + ( V , W ) : = { T : V W : T is semi-linear } is a semi-vector space over R 0 + .
More results regarding semi-linear vector spaces and semi-linear transformation can be found in Section 3 of [1].

2.2. Complete Semi-Vector Spaces

For the purposes of this paper, we need to introduce complete semi-vector spaces, that is, semi-vector spaces that when endowed with a norm, an inner product or a metric can be completed. The exposure here follows Section 3.1 of [1].
In the remainder of this paper, all semi-vector spaces are taken over the semi-field R 0 + unless otherwise stated. As usual, we denote the multiplication in R 0 + and the scalar multiplication of the associated semi-vector space by · or simply use juxtaposition. Moreover, we denote by N n the initial segment of N of length n, i.e., N n : = { 1 , , n } , and set N 0 , n : = N n { 0 } .
Definition 8. 
Let V be a semi-vector space. V is called a normed semi-vector space if there exists a function · : V R 0 + satisfying the conditions for a norm. V is called a Banach semi-vector space if V is complete in this norm.
Definition 9. 
Let V be a semi-vector space. V is called a pre-Hilbert semi-vector space if there exists a bilinear function · , · : V × V R 0 + on V satisfying the conditions for an inner product. V is called a Hilbert semi-vector space if V is complete with respect to this inner product.
The next results show that well-known norms on R n are also norms on ( R 0 + ) n .
Proposition 1. 
The Euclidean semi-vector space ( R 0 + ) n becomes a normed semi-vector space when endowed with the function · : ( R 0 + ) n R 0 + :
x : = ( x 1 , , x n ) i N n x i 2 .
Proof. 
See Proposition 5 in [1]. □
The norm defined in Proposition 1 will be referred to as the Euclidean or 2 + ( N n ) norm on ( R 0 + ) n .
Proposition 2. 
Let x : = ( x 1 , , x n ) , y : = ( y 1 , , y n ) ( R 0 + ) n . Set
m i : = m i ( x , y ) : = min { x i , y i } , M i : = M i ( x , y ) : = max { x i , y i } , i N n .
Define a function d : ( R 0 + ) n × ( R 0 + ) n R 0 + by
d ( x , y ) : = i N n ( M i m i ) 2 .
Then, d is a metric on ( R 0 + ) n , called the Euclidean metric on ( R 0 + ) n .
Proof. 
See Proposition 6 in [1]. □
Remark 2.  
Although max { x i , y i } min { x i , y i } = x i y i , we will continue using the max min difference instead of the absolute value. The reason will become clear in Section 2.3.
Remark 3.  
It follows from Propositions 1 and 2 that a semi-vector space V is Banach if the norm generates a metric under which every Cauchy sequence in V converges to an element of V.
Proposition 3.  
On ( R 0 + ) n , define the bilinear mapping · , · : ( R 0 + ) n × ( R 0 + ) n R 0 + by
x , y : = i N n x i y i ,
where x : = ( x 1 , , x n ) , y : = ( y 1 , , y n ) . Then, · , · defines an inner product on ( R 0 + ) n . Moreover, · , · induces the Euclidean norm on ( R 0 + ) n .
Proof. 
See Propositions 7 and 8 in [1]. □
Similarly to Remark 3, we note that an inner product on a semi-vector space V induces and norm and thus a metric on V. Hence, V becomes Hilbert if every Cauchy sequence in V converges in the metric to an element of V.
The next results relate norms and semi-linear transformations.
Definition 10.  
Let V and W be semi-vector spaces and T : V W a semi-linear transformation. The mapping T is called bounded if M > 0 such that v V , T v M v .
The above definition allows us to define a norm on bounded elements of Hom + ( V , W ) . To this end, set
T : = sup 0 V v V T v v .
The fact that Equation (1) indeed defines a norm is proven in Proposition 14 of [1].

2.3. Some Complete Semi-Vector Spaces

Here, we introduce some complete (in the underlying metric) semi-vector spaces that are relevant to this paper. More details can be found in [1] and the references given therein.
Theorem 1. 
Let p [ 1 , ] . Define
p + : = p + ( N ) : = a : N R 0 + : n N a ( n ) p < , p [ 1 , ) ; a : N R 0 + : sup n N a ( n ) < , p = .
For a , b p + , set
d p ( a , b ) : = n N ( M n m n ) p 1 / p , p [ 1 , ) ; sup n N ( M n m n ) , p = ,
where
m n = min { a n , b n } , M n : = max { x n , y n } , n N .
Then, the semi-spaces p + endowed with the metric d p are complete.
Proof. 
See [1], pp. 10–13. □
Denote by C [ a , b ] the space of all continuous functions f : [ a , b ] R .
Definition 11. 
Suppose [ a , b ] is a nonempty interval in R 0 + . Define
C + [ a , b ] : = f C [ a , b ] : f : [ a , b ] R 0 +
and let d : C + [ a , b ] × C + [ a , b ] R 0 + be given by
d ( f , g ) : = max x [ a , b ] max { f ( x ) , g ( x ) } min { f ( x ) , g ( x ) } .
Theorem 2. 
The mapping d defined by Equation (5) is a metric on the semi-space C + [ a , b ] . When endowed with this metric, C + [ a , b ] becomes a complete metrizable space.
Proof. 
The proof can be found in Theorem 7 of [1]. □
Remark 4. 
Note that despite max { f ( x ) , g ( x ) } min { f ( x ) , g ( x ) = f ( x ) g ( x ) , C + [ a , b ] is not a closed subspace of C [ a , b ] as the scalars are only taken from R 0 + .
For p [ 0 , ] and a nonempty interval [ a , b ] R 0 + , we now introduce the semi-space
L p + [ a , b ] : = { f L p [ a , b ] : f : [ a , b ] R 0 + } ,
where L p [ a , b ] denotes the Lebesgue space of functions with exponent p on [ a , b ] and endow it with the mapping d p : L p + [ a , b ] × L p + [ a , b ] R 0 + ,
d p ( f , g ) : = [ a , b ] max { f ( t ) , g ( t ) } min { f ( t ) , g ( t ) } p d t 1 / p , p [ 1 , ) ; ess   sup t [ a , b ] max { f ( t ) , g ( t ) } min { f ( t ) , g ( t ) } , p = ,
with d t denoting Lebesgue measure.
Note that the mappings d p are well-defined as the max and min of measurable functions and the values of f and g being L p -functions are finite almost everywhere.
Theorem 3. 
The mapping d p defined in (7) is a metric on L p + [ a , b ] and with it L p + [ a , b ] becomes a complete metrizable space.
Proof. 
The verification that d p is a metric is straight-forward and the proof that L p + [ a , b ] is complete with respect to d p is similar to the one given in Theorem 7 of [1]. We leave the details to the reader. □
Replacing the Lebesgue measure in the definition of (7) by a counting measure, we obtain the semi-spaces p + .
Remark 5. 
Remark 4 also applies to the spaces L p + [ a , b ] : The latter is not a closed subspace of L p [ a , b ] .

3. Preliminaries on Iterated Function Systems

Here, we state the definition of an iterated function system and its attractor.
Let ( X , d ) be a complete metric space. For a map f : X X , define the Lipschitz constant associated with f by
Lip ( f ) = sup x , y X , x y d X f ( x ) , f ( y ) d X ( x , y ) .
The map f is said to be Lipschitz if Lip ( f ) < + and a contraction on X if Lip ( f ) < 1 .
Definition 12. 
Let 1 < n N and let F : = { f 1 , , f n } be a finite family of contractions on the complete metric space ( X , d X ) . Then the pair ( X , F ) is called a contractive iterated function system (IFS) on X .
As this article deals exclusively with contractive IFSs, we drop the adjective “contractive” in the following:
With an IFS ( X , F ) and its point maps f F , we associate a set-valued map, also denoted by F , as follows: let ( H ( X ) , h ) be the hyperspace of all nonempty compact subsets of X endowed with the Hausdorff–Pompeiu metric
h ( S 1 , S 2 ) : = max { d ( S 1 , S 2 ) , d ( S 2 , S 1 ) } ,
where d ( S 1 , S 2 ) : = sup x S 1 d ( x , S 2 ) : = sup x S 1 inf y S 2 d ( x , y ) .
Define F : H ( X ) H ( X ) by (cf. [5,6])
F ( S ) : = i = 1 n f i ( S ) .
For contractive mappings f F , the set-valued map F defined by (8) is also a Lipschitz map on H ( X ) with Lipschitz constant Lip ( F ) = max { Lip ( f i ) : i N n } < 1 . Also, the completeness of ( X , d ) implies the completeness of ( H ( X ) , h ) .
Definition 13. 
The unique fixed point A H ( X ) of the contractive set-valued map F is called the attractor of the IFS ( X , F ) .
Note that since A satisfies the self-referential equation,
A = F ( A ) = i = 1 n f i ( A ) = i 1 = 1 n i k = 1 n f i 1 f i k ( A ) ,
expressing A as a finite number of copies of itself, a characteristic of a fractal set. Hence, the attractor is, in general, a fractal set.
It follows directly from the proof of the Banach fixed point theorem that the attractor A is obtained as the limit (in the Hausdorff–Pompeiu metric) of the iterative process A k : = F ( A k 1 ) , k N :
A = lim k A k = lim k F k ( A 0 ) ,
for an arbitrary A 0 H ( X ) . Here, F k denotes the k-fold composition of F with itself.

4. Fractal Interpolation and Fractal Functions

We briefly recall some definitions and properties from fractal interpolation and fractal function theory. In the following, ( X , d X ) denotes a complete metrizable space.

4.1. Fractal Interpolation on B ( X , Y )

Consider a finite family { l i } i = 1 n of bijective contractions X X generating a partition of X in the sense that
X = i = 1 n l i ( X ) ;
l i ( X ) l j ( X ) = , i , j N n , i j .
Given another complete metrizable space ( Y , d Y ) with metric d Y , a mapping g : X Y is called bounded (with respect to the metric d Y ) if there exists M > 0 so that for all x 1 , x 2 X , d Y ( g ( x 1 ) , g ( x 2 ) ) < M .
Recall that the set B ( X , Y ) : = { g : X Y : g is bounded } when endowed with the metric
d ( g , h ) : = sup x X d Y ( g ( x ) , h ( x ) )
becomes a complete metrizable space.
Remark 6. 
Under the usual addition and scalar multiplication of functions, the space B ( X , Y ) actually becomes a metric linear space, i.e., a vector space under which the operations of vector addition and scalar multiplication are continuous. (See, for instance, [7].)
For i N n , let F i : X × Y Y be a mapping which is uniformly contractive in the second variable, i.e., there exists a c [ 0 , 1 ) so that for all y 1 , y 2 Y
d Y ( F i ( x , y 1 ) , F i ( x , y 2 ) ) c d Y ( y 1 , y 2 ) , x X , i N n .
Define an operator T : B ( X , Y ) Y X , by
T g ( x ) : = i = 1 n F i ( l i 1 ( x ) , g l i 1 ( x ) ) χ l i ( X ) ( x ) ,
where χ M denotes the characteristic function of a set M. Such operators are referred to as Read–Bajractarević (RB) operators. The operator T is well-defined and since g is bounded and each F i is contractive in the second variable, T g B ( X , Y ) .
Equivalently, Equation (15) can also be written in the form
( T g l i ) ( x ) : = F i ( x , g ( x ) ) , x X , i N n .
Moreover, Equation (14) implies that T is contractive on B ( X , Y ) :
d ( T g , T h ) = sup x X d Y ( T g ( x ) , T h ( x ) ) = sup x X d Y ( F ( l i 1 ( x ) , g ( l i 1 ( x ) ) ) , F ( l i 1 ( x ) , h ( l i 1 ( x ) ) ) ) c sup x X d Y ( g l i 1 ( x ) , h l i 1 ( x ) ) c d Y ( g , h ) .
To achieve notational simplicity, we have set F ( x , y ) : = i = 1 n F i ( x , y ) χ X ( x ) in the above equation.
Therefore, by the Banach fixed point theorem, T has a unique fixed point f in B ( X , Y ) . This unique fixed point is called the bounded fractal function generated by T and it satisfies the self-referential equation
f ( x ) = i = 1 n F i ( l i 1 ( x ) , f l i 1 ( x ) ) χ l i ( X ) ( x ) ,
or, equivalently,
f l i ( x ) = F i ( x , f ( x ) ) , x X , i N n .
Per proof of the Banach fixed point theorem, the fixed point f B ( X , Y ) is obtained as the limit of the sequence of mappings
T k ( f 0 ) d f , as k ,
where f 0 B ( X , Y ) is arbitrary.
Next, we would like to consider a special choice for the mappings F i . To this end, we require the concept of an F-space. We recall that a metric d : Y × Y R is called complete if every Cauchy sequence in Y converges with respect to d to a point of Y and translation-invariant if
d ( x + a , y + a ) = d ( x , y ) , for all x , y , a Y .
Now assume that Y is an F-space, i.e., a topological vector space whose topology is induced by a complete translation-invariant metric d; in addition, this metric is homogeneous. This setting allows us to consider mappings F i of the form
F i ( x , y ) : = q i ( x ) + S i ( x ) y , i N n ,
where q i B ( X , Y ) and S i : X R is a function.
As the metric d Y is homogeneous, the mappings (21) satisfy condition (14) provided that the functions S i are bounded on X with bounds in [ 0 , 1 ) . Then
d Y ( q i ( x ) + S i ( x ) y 1 , q i ( x ) + S i ( x ) y 2 ) = d Y ( S i ( x ) y 1 , S i ( x ) y 2 ) = | S i ( x ) | d Y ( y 1 , y 2 ) S i d Y ( y 1 , y 2 ) s d Y ( y 1 , y 2 ) .
Here, · denotes the supremum norm and s : = max { S i : i N n } . Henceforth, we will assume that all functions S i are bounded above by s [ 0 , 1 ) .
With the choice (21), the RB operator T becomes an affine operator on B ( X , Y ) of the form
T g = i = 1 n ( q i l i 1 ) χ l i ( X ) + i = 1 n ( S i l i 1 ) · ( g l i 1 ) χ l i ( X )
= T ( 0 ) + i = 1 n ( S i l i 1 ) · ( g l i 1 ) χ l i ( X ) .
Next, we exhibit the relation between the graph G ( f ) of the fixed point f of the operator T given by (15) and the attractor of an associated contractive IFS.
To this end, consider the complete metric space X × Y and define mappings w i : X × Y X × Y by
w i ( x , y ) : = ( l i ( x ) , F i ( x , y ) ) , i N n .
Assume that the mappings F i in addition to being uniformly contractive in the second variable are also uniformly Lipschitz continuous in the first variable, i.e., that there exists a constant L > 0 so that for all y Y ,
d Y ( F i ( x 1 , y ) , F i ( x 2 , y ) ) L d X ( x 1 , x 2 ) , x 1 , x 2 X , i = 1 , , n .
Denote by a : = max { a i : i N n } the largest of the contractivity constants of the l i and let θ : = 1 a 2 L . Then the mapping d θ : ( X × Y ) × ( X × Y ) R given by
d θ : = d X + θ d Y
is a metric on X × Y compatible with the product topology on X × Y .
The next theorem is a special case of a result presented in [8].
Theorem 4. 
The family F T : = ( X × Y , w 1 , w 2 , , w n ) is a contractive IFS in the metric d θ and the graph G ( f ) of the fractal function f generated by the RB operator T given by (15) is the unique attractor of F T . Moreover,
G ( T g ) = F T ( G ( g ) ) , g B ( X , Y ) ,
where F T denotes the set-valued operator (8).
Equation (25) can be represented by the following commutative diagram:
X × Y F T X × Y G G G G B ( X , Y ) T B ( X , Y )
where G is the mapping B ( X , Y ) g G ( g ) = { ( x , g ( x ) ) : x X } X × Y .
On the other hand, suppose that F = ( X × Y , w 1 , w 2 , , w n ) is an IFS whose mappings w i are of the form (24), where the functions l i are contractive injections satisfying (11) and (12) and the mappings F i are uniformly Lipschitz continuous in the first variable and uniformly contractive in the second variable. Then we can associate with the IFS F an RB operator T F of the form (15). The attractor A F of F is then the graph G ( f ) of the fixed point f of T F . (This was the original approach in [9] to define a fractal interpolation function on a compact interval in R .) The commutativity of the diagram (26) then holds with F T replaced by F and T replaced by T F .
We now specialize even further and choose an arbitrary f B ( X , Y ) and a bounded linear operator L : B ( X , Y ) B ( X , Y ) . Set (see also [10])
q i : = f l i S i · L f .
The RB operator T then reads
T g = f + ( S i l i 1 ) · ( g L f ) l i 1 , on l i ( X ) , i N n .
and, under the assumption that s < 1 , its unique fixed point f B ( X , Y ) satisfies the self-referential equation
f = f + ( S i l i 1 ) · ( f L f ) l i 1 , on l i ( X ) , i N n .
In the case of univariate fractal interpolation on the real line with X : = [ x 0 , x n ] , < x 0 < x n < + , L f can be chosen to be the affine function β whose graph connects the points ( x 0 , f ( x 0 ) ) and ( x n , f ( x n ) ) .

4.2. Fractal Interpolation on C ( X , Y )

Here, we briefly consider fractal interpolation in the complete metric space of continuous functions ( C ( X , R ) , d ) instead of ( B ( X , R ) , d ) . For this purpose, the following changes in the construction ensure that the RB operator (28) maps ( C ( X , R ) into itself:
To this end, let x 0 < x 1 < < x n 1 < x n be an increasing sequence of points in [ x 0 , x n ] and define contractive homeomorphisms l i : [ x 0 , x n ] [ x i 1 , x i ] such that x i 1 = l i ( x 0 ) and x i = l i ( x n ) . Further assume that f, L f , and S i are continuous on [ x 0 , x n ] , such that
L f ( x 0 ) : = f ( x 0 ) and L f ( x n ) : = f ( x n ) ,
and impose the (interior) join-up conditions
T f ( x j ) = T f ( x j + ) , j N n 1 .
Then, the fixed point f of the RB operator defined in Equation (28) will be a continuous function whose graph interpolates the set { ( x j , f ( x j ) ) : j = 0 , 1 , , n } . Such functions are usually referred to as fractal interpolation functions [6,9]. As the RB operator is the same at each level of recursion (20), we refer to this as stationary fractal interpolation. For the non-stationary setting, i.e., the case where the RB operator is level-dependent, we refer the interested reader to [11].
For fractal interpolation in more general function spaces, we list [12], and for the particular choice of q in (27), we list [10] as references.

5. Fractal Interpolation in Complete Semi-Vector Spaces

In this section, we consider fractal interpolation in the semi-spaces C + and L p + , p [ 1 , ] . To this end, let I : = [ x 0 , x n ] R 0 + be a given nonempty interval and let L : C + I C + I a bounded semi-linear operator in the sense of Definition 6.
Suppose that ( x j ) j N 0 , n is a strictly increasing sequence of real numbers. Further suppose that for each i N n , l i is a contractive diffeomorphism [ x 0 , x n ] [ x i 1 , x i ] with
l i ( x 0 ) = x i 1 and l i ( x n ) = x i .
Setting
I i : = [ x i 1 , x i ) , i N n 1 n 1 , x n ] , i = n ,
we have that I = i = 1 n I i with ∐ denoting disjoint union. For later, we also assume that
D l i L + I , i N n ,
where D denotes the derivative with respect to the independent variable.

5.1. Fractal Interpolation in L p + I

Let { l i : i N n } be given as in (31). Define a semi-affine RB operator T : L p + I L p + I of the form (22)
T g : = i = 1 n ( q i l i 1 ) χ l i + i = 1 n ( S i l i 1 ) · ( g l i 1 ) χ l i ,
where q i L p + I and S i L + I . The requirement on S i is based on the fact that L · L p L p . Hence, T g L p + I .
To derive conditions for T to be contractive, consider g , h L p + .
d p p ( T g , T h ) = I max { T g ( x ) , T h ( x ) } min { T g ( x ) , T h ( x ) } p d x = i = 1 n I i max { ( q i l i 1 ) ( x ) + ( S i l i 1 ) ( x ) · ( g l i 1 ) ( x ) , ( q i l i 1 ) ( x ) + ( S i l i 1 ) ( x ) · ( h l i 1 ) ( x ) } min { ( q i l i 1 ) ( x ) + ( S i l i 1 ) ( x ) · ( g l i 1 ) ( x ) , ( q i l i 1 ) ( x ) + ( S i l i 1 ) ( x ) · ( h l i 1 ) ( x ) } } p d x = i = 1 n I i max { ( S i l i 1 ) ( x ) · ( g l i 1 ) ( x ) , ( S i l i 1 ) ( x ) · ( h l i 1 ) ( x ) } min { ( S i l i 1 ) ( x ) · ( g l i 1 ) ( x ) , ( S i l i 1 ) ( x ) · ( h l i 1 ) ( x ) } } p d x i = 1 n D l i · S i p d p p ( g , h ) ,
where we used the substitution x l i ( x ) to obtain the last inequality. Note that by the assumptions on D l i and S i and the fact that L uses Banach algebra under pointwise multiplication, D l i · S i p is finite.
Thus, T is a contractive semi-affine operator on L p + I if i = 1 n D l i · S i p < 1 .
Theorem 5. 
Let contractive homeomorphism ( l i ) i N n be defined as in (31) and satisfying (33). Suppose ( q i ) i N n L p + I and ( S i ) i N n L + I . The semi-affine RB operator given by (34) is contractive on L p + I provided that
i = 1 n D l i · S i p < 1 .
The unique fixed point f of T satisfies the self-referential equation
f = i = 1 n ( q i l i 1 ) χ l i + i = 1 n ( S i l i 1 ) · ( f l i 1 ) χ l i
and graph f is the attractor of the IFS associated with T and thus is, in general, a fractal set.
Proof. 
The statements follow from the above arguments and Theorem 4. □
Note that the fixed point f depends on the the partition ( I i ) i N n , i.e., the mappings l : = ( l i ) i N n , the scaling functions S : = ( S i ) i N n , and the functions q : = ( q i ) i N n . Therefore, a more accurate notation for f should be f ( l , S , q ) . Unless necessary, we suppress the dependence of the fixed point on l , S , and q . Should f only depend on { l , S , q } , then we express this dependence as f ( ) .
Definition 14. 
The unique fixed point f ( l , S , q ) in Theorem 5 is called a fractal function of class L p + . We denote the collection of all such fractal functions by L p + : = L p + ( l , S , q ) .
Remark 7. 
If one considers a semi-affine RB operator of the form (28) with some bounded semi-linear operator L, then additional conditions need to be imposed to guarantee that such an RB operator maps L p + I into itself:
1. 
For f L p + I , L must be such that L f L p + I . This may be achieved by choosing, for instance, L f : = v · f for some v L + I .
2. 
The terms q i = f l i S i · L f must be nonnegative. A necessary condition could be f S i · L f on I.
Once these two conditions are satisfied, the statements in Theorem 5 also hold for this setting.
In the special case when ( l i ) i N n are affine functions, i.e., have the form l i = a i ( · ) + b i , where the coefficients a i and the translates b i are determined by (31), condition (35) is replaced by
max i N n { S i p } < 1 .
This is seen as follows: Tthe Lipschitz constant for D l i is given by a i = x i x i 1 x n x 0 and therefore i = 1 n D l i · S i p max i N n { S i p } i = 1 n x i x i 1 x n x 0 = max i N n { S i p } .
If, in addition, ( S i ) i N n R 0 + , then (36) simply reduces to
max i N n S i p < 1 .
Suppose that l and S are fixed. Then, the following result holds:
Proposition 4.  
The mapping ϑ : ( L p + ) n L p + ( q ) , q f ( q ) is a semi-linear isomorphism.
Proof. 
The result follows from the fact that L p + I is a semi-vector space and that the fixed point f is unique. □

Sequences and Series of Fractal Functions of Type L p +

Let ( f m ) m N L p + be an L + –bounded sequence of fractal functions with the self-referential equations
f m = i N n q m , i l i 1 χ I i + i N n ( S m , i l i 1 ) · ( f m l i 1 ) χ I i , m N ,
where ( S m , i ) m N L + I and ( q m , i ) m N L p + I are Cauchy sequences.
Theorem 6. 
The bounded sequence (37) of fractal functions converges in L p + to a fractal function f L p + given by the self-referential equation
f = i N n q i l i 1 χ I i + i N n ( S i l i 1 ) · ( f l i 1 ) χ I i ,
where q i = lim m q m , i and S i = lim m S m , i .
Proof. 
For k , m N , we compute, using properties of max and min,
d p ( f m , f k ) d p i N n q m , i l i 1 χ I i , i N n q k , i l i 1 χ I i + d p i N n ( S m , i l i 1 ) · ( f m l i 1 ) χ I i , i N n ( S k , i l i 1 ) · ( f k l i 1 ) χ I i .
The first term reduces to
i N n I i max q m , i l i 1 , q k , i l i 1 min q m , i l i 1 , q k , i l i 1 p d x = i N n D l i d p ( q m , i , q k , i ) .
The second term becomes
i N n I i max ( S m , i l i 1 ) · ( f m l i 1 ) , ( S k , i l i 1 ) · ( f k l i 1 ) min ( S m , i l i 1 ) · ( f m l i 1 ) , ( S k , i l i 1 ) · ( f k l i 1 ) p d x = i N n I D l i max S m , i · f m , S k , i · f k min S m , i · f m , S k , i · f k p d x .
Adding and subtracting the term S m , i f k , we estimate
I D l i max S m , i · f m , S k , i · f k min S m , i · f m , S k , i · f k p d x D l i · S m , i p d p ( f m , f k ) + D l i · f k p d p ( S m , i , S k , i ) .
Substituting and reordering terms gives
d p ( f m , f k ) = i N n D l i d p ( q m , i , q k , i + D l i · f k p d p ( S m , i , S k , i ) 1 i N n D l i · S i p
By the hypotheses stated in the theorem, it now follows that ( f m ) m N is a Cauchy sequence and thus possesses a limit in L p + I . Taking the limit as m in (37) proves (38). □
Now suppose that for each i N n ,
q i : = k N q k , i and S i : = k N S k , i
are converging sums in L p + I and L + I , respectively, i.e., the sequences of partial sums ( k N N q k , i ) N N and ( k N N S k , i ) N N converges in L p + I and L + I , respectively.
By Proposition 4 and Theorem 6, we immediately obtain the following results concerning infinite series of fractal functions from L p + :
Proposition 5. 
Under the hypotheses of Theorem 6, the infinite series m N f m ( q ) of fractal functions f m ( q ) L p + converges in L p + I to a fractal function f ( q ) L p + satisfying the self-referential equation
f ( q ) = i N n q i l i 1 χ I i + i N n ( S i l i 1 ) · ( f ( q ) l i 1 ) χ I i ,
where q i : = k N q k , i and S i : = k N S k , i .

5.2. Fractal Interpolation in C + I

In this section, we construct continuous fractal functions from C + I into itself. To this end, we refer to Section 4.2 for the general idea. Under the same assumption on the contractive homeomorphisms l i but now with f , L f , S i C + I , we define a semi-affine RB operator T : C + I ( R 0 + ) I by
T g : = f + ( S i l i 1 ) · ( g L f ) l i 1 , on I i , i N n ,
where the subintervals I i are defined as in (32). It is clear that on the open intervals ( x i 1 , x i ) , T g is continuous and by imposing the interior join-up conditions (30), T g is also continuous at x j , j N n 1 . Hence, T g C + I . To determine a condition that enforces T to be contractive on C + I , we proceed in the usual manner using the specific expression of the RB operator T and the properties of max and min:
d ( T g , T h ) = max x I max ( S i l i 1 ( x ) ) ( g l i 1 ) ( x ) , ( S i l i 1 ( x ) ) ( h l i 1 ) ( x ) min ( S i l i 1 ( x ) ) ( g l i 1 ) ( x ) , ( S i l i 1 ( x ) ) ( h l i 1 ) ( x ) S d ( g , h ) ,
where S : = max i N n { S i } . Therefore, the following theorem holds:
Theorem 7.  
Under the aforementioned hypotheses, the semi-affine RB operator T : C + I C + I defined is contractive on C + I provided S < 1 . The unique fixed point of T is thus a self-referential function f satisfying
f : = f + ( S i l i 1 ) · ( f L f ) l i 1 , on I i , i N n .
Proof. 
The statements follow directly from the above observations. □
Definition 15.  
The self-referential function f given by (40) is termed a fractal function of class C + I . The collection of all such functions is denoted by C + .
Remark 8.  
As was noted below Theorem 5, the fixed point f C + depends on the tuple of contractive homeomorphisms l and scaling functions S , as well as the bounded semi-linear operator L. Hence, as was the case for fractal interpolation in L p + I , for fixed l and L, the fixed point f describes an entire family of fractal functions f ( S ) for the “germ function" f. Also note that if S = 0 , then f ( 0 ) = f .
One can also consider sequences and infinite series of fractal functions of type C + I . The results obtained in Theorem 6 and Proposition 5 carry over to the present setting by simply replacing the d p -metric by the sup-metric. We leave the details to the interested reader.

5.3. A Fractal Operator for Complete Semi-Vector Spaces

Let X + I { L p + I , C + I } and let X + { L p + , C + } be the corresponding space of fractal functions of this type.
We define a semi-linear fractal operator F S : X + I X + for the n-tuple of scaling functions S : = ( S i ) i N n as that operator which maps a function f X + I to the self-referential function f ( S ) satisfying the fixed point equation
F S f ( S ) = f ( S ) = f + ( S i l i 1 ) · ( f ( S ) L f ) l i 1 , on I i , i N n .
Here, the contractions ( l i ) are defined for the appropriate setting and L is the bounded semi-linear operator introduced above.
Fractal operators on different function spaces were first introduced in [10].
Theorem 8.  
For p [ 1 , ) , ( C + I , d p ) is dense in ( L p + I , d p ) .
Proof. 
The proof follows readily from Theorem 3.14 in [13] restricted to positive simple functions, i.e., to simple functions whose coefficients are from R 0 + . For details about the integration of positive functions, see [14], Chapter 9. □
Let · { · , · p } . We note that as C + I is dense in L p + I , Theorems 2.7–11 in [15] imply that there exists a norm-preserving extension of the operator L : C + I C + I to L p + I L p + I . We denote this extension again by L. Recall that in the new notation, S : = max i N n { S i } .
Then, using the fixed point Equation (41), we see that
f ( S ) f S 1 S I L f ,
and with f ( S ) = F S f and use of the triangle inequaltiy, this becomes
F S f 1 + S 1 S I L f .
Therefore, we arrive at the following result:
Proposition 6.  
Suppose that the constant function 1 is contained in the point spectrum of the semi-linear fractal operator F S : X + X + as defined in (41). Then F S satisfies the following · -estimates:
1 F S 1 + S 1 S I L
Proof. 
Only the left inequality needs to be shown. This, however, follows immediately from the fact that the constant function 1 is contained in the point spectrum of F S . □
Note that in Proposition 6, the right-hand estimate always holds, regardless of whether f = 1 is contained in the point spectrum of F S or not.

6. Conclusions and Future Research Directions

This paper introduced the novel concept of fractal interpolation in complete semi-vector spaces. In particular, the existence of fractal functions satisfying the fractal interpolation problem in the complete semi-vector spaces C + I and L p + I was investigated. Sequences and series of such fractal functions were briefly considered as well. Moreover, a semi-linear fractal operator was defined and some of the properties were presented.
The following future research directions present themselves:
  • Instead of using Banach contractions, extend the approach to, for instance, Rakotch, Matkowsi, φ -, or F -contractions. For definitions of these more general contractions which all imply the existence of a unique fixed point, we refer to [16,17,18,19,20].
  • Consider other function spaces such as Hölder, Sobolev–Slobodeckij, Besov, and Triebel–Lizorkin, to name a few.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The author would like to thank the anonymous referees for the careful reading of the manuscript and their suggestions which helped to improve this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. La Guardia, G.G.; Chagas, J.Q.; Lenzi, E.K.; Pires, L.; Zumelzu, N.; Bedregal, B. One Semi-Vector Spaces and Semi-Algebras with Applications to Fuzzy Automata. Axioms 2024, 13, 308. [Google Scholar] [CrossRef]
  2. Prakash, P.; Sertel, M.R. Topological Semivector Spaces: Convexity and Fixed Point Theory. Semigroup Forum 1974, 9, 117–138. [Google Scholar] [CrossRef]
  3. Gahler, W.; Gahler, S. Contributions to fuzzy analysis. Fuzzy Set Syst. 1999, 105, 201–204. [Google Scholar] [CrossRef]
  4. Janyska, J.; Modugno, M.; Vitolo, R. Semi-vector spaces and units of measurement. Acta Appl. Math. 2010, 110, 1249–1276. [Google Scholar]
  5. Barnsley, M.F. Fractals Everywhere; Academic Press: Orlando, FL, USA, 1988. [Google Scholar]
  6. Hutchinson, J.E. Fractals and self-similarity. Indiana Univ. Math. J. 1981, 30, 713–747. [Google Scholar] [CrossRef]
  7. Rolewicz, S. Metric Linear Spaces; Kluwer Academic: Warsaw, Poland, 1985. [Google Scholar]
  8. Barnsley, M.F.; Hegland, M.; Massopust, P.R. Numerics and Fractals. Bull. Inst. Math. Acad. Sin. 2014, 9, 389–430. [Google Scholar]
  9. Barnsley, M.F. Fractal functions and interpolation. Constr. Approx. 1986, 2, 303–329. [Google Scholar] [CrossRef]
  10. Navascués, M.A.; Chand, A.B.K. Fundamental Sets of Fractal Functions. Acta Appl. Math. 2008, 100, 247–261. [Google Scholar] [CrossRef]
  11. Massopust, P.R. Non-Stationary Fractal Interpolation. Mathematics 2019, 7, 666. [Google Scholar] [CrossRef]
  12. Massopust, P.R. Local fractal functions and function spaces. In Fractals, Wavelets and Their Applications, Proceedings of the International Workshop and Conference on Fractals and Wavelets, Kerala, India, 9–12 November 2013; Springer: Cham, Switzerland, 2013; Volume 92, pp. 245–270. [Google Scholar]
  13. Rudin, W. Real and Complex Analysis, 3rd ed.; McGraw-Hill: Singapore, 1987. [Google Scholar]
  14. Schilling, R. Measures, Integrals and Martingales, 2nd ed.; Cambridge University Press: London, UK, 2017. [Google Scholar]
  15. Kreyszig, E. Introductory Functional Analysis with Applications; John Wiley & Sons: New York, NY, USA, 1978. [Google Scholar]
  16. Boyd, D.W.; Wong, J.S. On Nonlinear Contractions. Proc. Amer. Math. Soc. 1969, 20, 458–464. [Google Scholar] [CrossRef]
  17. Matkowski, J. Integrable Solutions of Functional Equations; Instytut Matematyczny Polskiej Akademi Nauk: Warsaw, Poland, 1975. [Google Scholar]
  18. Rakotch, E. A Note on Contractive Mappings. Proc. Amer. Math. Soc. 1962, 13, 459–465. [Google Scholar] [CrossRef]
  19. Reich, S.; Zaslavski, A.J. A Fixed Point Theorem for Matkowski Contractions. J. Fixed Point Theory Appl. 2007, 8, 303–307. [Google Scholar]
  20. Wardowski, W. Fixed Points of a New Type of Contractive Mappings in Complete Metric Spaces. J. Fixed Point Theory Appl. 2012, 2012, 94. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Massopust, P. Semi-Rings, Semi-Vector Spaces, and Fractal Interpolation. Fractal Fract. 2025, 9, 680. https://doi.org/10.3390/fractalfract9110680

AMA Style

Massopust P. Semi-Rings, Semi-Vector Spaces, and Fractal Interpolation. Fractal and Fractional. 2025; 9(11):680. https://doi.org/10.3390/fractalfract9110680

Chicago/Turabian Style

Massopust, Peter. 2025. "Semi-Rings, Semi-Vector Spaces, and Fractal Interpolation" Fractal and Fractional 9, no. 11: 680. https://doi.org/10.3390/fractalfract9110680

APA Style

Massopust, P. (2025). Semi-Rings, Semi-Vector Spaces, and Fractal Interpolation. Fractal and Fractional, 9(11), 680. https://doi.org/10.3390/fractalfract9110680

Article Metrics

Back to TopTop