Next Article in Journal
New Results on F-Contractions in Complete Metric Spaces
Next Article in Special Issue
Introduction to the Class of Prefractal Graphs
Previous Article in Journal
Early Mathematics Learning and Teaching in Chinese Preschools: A Content Analysis of Teaching Reference Books for Preschool Teachers
Previous Article in Special Issue
Quasiperiodic Patterns of the Complex Dimensions of Nonlattice Self-Similar Strings, via the LLL Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Binary Operations in Metric Spaces Satisfying Side Inequalities

by
María A. Navascués
1,*,†,
Pasupathi Rajan
2,† and
Arya Kumar Bedabrata Chand
2,†
1
Departamento de Matemática Aplicada, Escuela de Ingeniería y Arquitectura, Universidad de Zaragoza, 50018 Zaragoza, Spain
2
Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2022, 10(1), 11; https://doi.org/10.3390/math10010011
Submission received: 2 November 2021 / Revised: 15 December 2021 / Accepted: 17 December 2021 / Published: 21 December 2021
(This article belongs to the Special Issue Fractal and Computational Geometry)

Abstract

:
The theory of metric spaces is a convenient and very powerful way of examining the behavior of numerous mathematical models. In a previous paper, a new operation between functions on a compact real interval called fractal convolution has been introduced. The construction was done in the framework of iterated function systems and fractal theory. In this article we extract the main features of this association, and consider binary operations in metric spaces satisfying properties as idempotency and inequalities related to the distance between operated elements with the same right or left factor (side inequalities). Important examples are the logical disjunction and conjunction in the set of integers modulo 2 and the union of compact sets, besides the aforementioned fractal convolution. The operations described are called in the present paper convolutions of two elements of a metric space E . We deduce several properties of these associations, coming from the considered initial conditions. Thereafter, we define self-operators (maps) on E by using the convolution with a fixed component. When E is a Banach or Hilbert space, we add some hypotheses inspired in the fractal convolution of maps, and construct in this way convolved Schauder and Riesz bases, Bessel sequences and frames for the space.
MSC:
54E35; 46B15; 42C15; 28A80

1. Introduction

Fréchet [1] introduced the concept of metric space in 1906. A metric space is a set with specific structure determined by certain axioms. These axioms form an abstraction of the notion of distance, which empowers a unified treatment of diverse distinct cases under a single formalism. The nature of particular metric plays a crucial role in the investigation of various problems in differential geometry, non-Euclidean geometry, computer graphics, physics, mechanics, and engineering. The structure of metric space contains remarkable particular cases such as Banach and Hilbert spaces [2,3]. The latter are endowed with an additional structure of vector spaces that enriches the geometric structure, and their theory is the mathematical doctrine for non-relativistic quantum mechanics. Convolution is an important mathematical operation defined in various senses in the literature. Lahti [4] used the concept of discrete convolution in quasi-open sets to prove that every function of bounded variation (BV function) can be approximated in the B V and L norms by BV functions whose jump sets are of finite Hausdorff measure. Pap and Štajner [5] introduced the notion of generalized pseudo-convolution which can be used as a basic notion in many different theories of probabilistic metric spaces, information theory, fuzzy numbers, optimization, and system theory. In this paper, we consider binary operations in metric spaces satisfying properties as idempotency and inequalities related to the distance between operated elements with the same right or left factor (side inequalities). They are not related in any way with the topical addition and multiplication by a scalar.
The association has been inspired by a fractal convolution defined in the framework of fractal interpolation functions (see the references [6,7]), generalizing it. The term “fractal convolution” is due to the curly forms typical of the graph of this type of mappings (See Figure 1 and Figure 2), born from the cooperation of the functions implied. The proposed structure may find applications in the field of Discrete Mathematics, Function and Information Theory.
The convolution defined in this article does not enjoy, in general, the nice algebraic properties of the classical convolution of functions (associativity, commutativity, etc.). However it owns other properties that will be described in the following sections, in terms of the distance between operated and original elements. These properties are inherited by the convolution subsets. The classical convolution of two functions f and g computes basically a kind of weighted value of f and in this sense may perform a smoothing on it. In the fractal convolution, f represents a trend pattern and g shapes the small oscillations around it (see Figure 1 and Figure 2). Fractal convolution endows the graph of f with a fractal structure, that enriches the geometric content of the same. Taking some “scale factors” of the model as zero, one obtains the component function f. In this sense, the fractal convolution provides a family of mappings that contains the original. This can be of great interest to approach optimization problems, due to the wider spectrum of the elements to be chosen.
There is an extensive bibliography about extensions of metric spaces (pseudo, quasi, generalized, ultra, fuzzy, probabilistic, etc.), however there are very few articles concerning operations in abstract metric spaces. Some authors generalize the concept of distance to maps of type d : X × X G , where G owns an algebraic structure composed of binary operations and/or relations ([8]). In the reference [9], the authors endow the interval [ 0 , ) with an operation, and this serves to define the concept of T-metric space. Triangular norms (t-norms) ([10]) are binary operations in [ 0 , 1 ] that support the concept of fuzzy metric space, and opens a branch of the fuzzy logic. An extension is given in [11]. The reference [12] defines an R-metric related to an ordered algebraic structure.
As said previously, the references to operations in metric spaces are scarce. That is why this article may be of interest for the readers. Beginning from the concept of convolution, we define the self-map in the metric space E by using the convolution with a fixed component (partial or one-sided convolution). Some fundamental properties of this type of operators are discussed in Section 2. Section 3 studies the convolution and partial convolution defined on subsets of E, showing some of their characteristics. For instance, we prove that a convolution can be induced on the space H ( E ) of non-empty compact subsets of E. In Section 4, we assume that E to be a normed vector space and the linearity in the operation. Then, the partial convolution induced by fixing the null element turns out to be a linear operator on E. The last part of this section is devoted to study the action of the above partial convolution on a Schauder basis. Finally, in Section 5, we assume E to be a Hilbert space and we construct Bessel sequences and Riesz bases on E, and we prove that if ( e m ) is a frame, then the sequence of images by the partial operator applied on ( e m ) is also a frame (under certain conditions).

2. Convolution in Metric Spaces

Definition 1.
Let ( E , d ) be a metric space. A convolution is a binary operation : E × E E , such that
1. 
∧ is idempotent: e e = e , e E ;
2. 
There exist k , k 0 , such that for any e , e , e E ,
d ( e e , e e ) k d ( e , e ) ,
d ( e e , e e ) k d ( e , e ) .

2.1. Particular Cases

1.
First we consider an example in Boolean Algebra, see for instance [13]. Let Z 2 (integers modulo 2) be the metric space with metric d defined as follows: d ( 0 , 0 ) = d ( 1 , 1 ) = 0 , d ( 0 , 1 ) = d ( 1 , 0 ) = c > 0 . Let ∨ be the logical disjunction: 0 0 = 0 , 0 1 = 1 , 1 0 = 1 , 1 1 = 1 . This operator satisfies (1) and (2) with k = k = 1 ,
e = 0 , e = 0 , e = 0 d ( e e , e e ) = d ( 0 , 0 ) = 0 d ( e , e ) = 0 . e = 0 , e = 1 d ( e e , e e ) = d ( 0 , 1 ) = c d ( e , e ) = c . e = 1 , e = 1 d ( e e , e e ) = d ( 1 , 1 ) = 0 d ( e , e ) = 0 .
e = 1 , e = 0 , e = 0 d ( e e , e e ) = d ( 1 , 1 ) = 0 d ( e , e ) = 0 . e = 0 , e = 1 d ( e e , e e ) = d ( 1 , 1 ) = 0 d ( e , e ) = c . e = 1 , e = 1 d ( e e , e e ) = d ( 1 , 1 ) = 0 d ( e , e ) = 0 .
In this case, ∨ is commutative.
2.
Let ( Z 2 , d ) be a metric space defined as in the above example and ∧ be the logical conjunction on E defined by 0 0 = 0 , 0 1 = 0 , 1 0 = 0 , 1 1 = 1 , then ∧ is a commutative convolution operator on E;
3.
Fractal convolution of functions: In many real-world phenomena, such as signal and image processing, economic and climatic series, bioelectric recordings, cartography, etc., the scientists need to manage irregular and sharp forms, and the standard functions often fall short to approach them. Barnsley [14] introduced the idea of data interpolation using the fractal methodology of iterated function systems. In this way, non-smooth self-similar functions were constructed in the last decades of the twentieth century. Nowadays fractal functions constitute a method of approximation of non-differentiable mappings, providing suitable tools for the description of irregular signals ([6,15,16,17,18,19]). Navascués [6] defined the fractal convolution of two maps defined on a real interval, on the basis of a special type of fractal interpolation function as follows:
Let Δ : t 0 < t 1 < t N be any partition of the interval I = [ t 0 , t N ] and let I n = [ t n 1 , t n ] , for all n N N : = { 1 , 2 , , N } . We define L n : I I n by
L n ( t ) = a n t + b n ,
where
a n = t n t n 1 t N t 0 , b n = t N t n 1 t 0 t n t N t 0 .
Fix a scale function α ( L ( I ) ) N , we assume that
C : = e s s u p { | α n ( t ) | : t I ; n N N } < 1 .
Now, let L p ( I ) be the Lebesgue space with the norm
h p : = I | h ( t ) | p d t 1 / p for 1 p < .
For any f , b L p ( I ) , define an operator T f , b : L p ( I ) L p ( I ) called Read-Bajraktarević (R-B) operator by
T f , b h ( t ) : = f ( t ) + ( α n L n 1 ) ( t ) . ( h b ) L n 1 ( t ) , t I n , n N N .
Using the fact C < 1 , it can be verified that the R-B operator T f , b is a contractive map on the Banach space ( L p ( I ) , . p ) . By the Banach contraction principle [20] (which states that every contraction map on a complete metric space has a unique fixed point), T f , b has a unique fixed point f Δ , b α L p ( I ) .
For fixed Δ , α , define a binary operation : L p ( I ) × L p ( I ) L p ( I ) by
( f , b ) = f b : = f Δ , b α .
The new map is called the fractal convolution of f and b. It can be verified that the fractal convolution is a bounded linear operator (see the references [6,7]).
Proposition 1
([7]). Let f , f , b , b L p ( I ) . Then
f b f b p C 1 C b b p ,
f b f b p 1 1 C f f p .
That is ∧ is a convolution on L p ( I ) .
Figure 1 represents the fractal convolution f b of the functions f ( t ) = e 5 t cos ( 3 π t 2 ) and b ( t ) = cos ( π t 2 ) in the interval I = [ 0 , 3 ] . The partition Δ is uniform with N = 6 , and the scale functions are the maps α n ( t ) = ( 3 t ) / 10 for all n = 1 , 2 , , 6 . The result is a continuous function.
Figure 2 shows the fractal convolution f b of the functions f ( t ) = 4 t 2 and b ( t ) = t 2 t 2 , in the interval I = [ 0 , 3 ] . The partition Δ is uniform with N = 6 , and the scale functions are the maps α n ( t ) = ( 3 t ) / 10 for all n = 1 , 2 , , 6 . The outcome is a discontinuous function.
4.
Define a distance between two non-empty subsets R and S of a metric space ( E , d ) by
d ( R , S ) : = inf { d ( r , s ) : r R , s S } .
Note that d, defined as above, is not a metric. Let C B ( E ) be the set of all non-empty closed and bounded subsets of E. Define h : C B ( E ) × C B ( E ) R + , such that for any R , S C B ( E ) ,
h ( R , S ) : = max { sup r R d ( r , S ) , sup s S d ( s , R ) } .
Let H ( E ) C B ( E ) be the set of all non-empty compact subsets of E. The map h is a metric on H ( E ) (as well as on C B ( E ) ) called the Hausdorff metric [21].
Lemma 1.
([22]). If { A i } i J and { B i } i J are finite collections of compact subsets of a metric space ( E , d ) , then h ( i J A i , i J B i ) sup i J h ( A i , B i ) .
Define : H ( E ) × H ( E ) H ( E ) by
( R , S ) : = R S , R , S H ( E ) .
Our claim is that ∧ is a convolution on H ( E ) with respect to the Hausdorff metric. By using Lemma 1, take A 1 = R , A 2 = S , B 1 = R and B 2 = S , we obtain
h ( ( R , S ) , ( R , S ) ) h ( S , S ) .
Since ∧ is commutative, we obtain
h ( ( S , R ) , ( S , R ) ) h ( S , S ) .
5.
Let us consider an Euclidean space E. For two vectors x , y E let us define their convolution as the element
x y : = x + y 2 .
The inner operation so defined satisfies the conditions imposed to be a convolution, taking as k and k any numbers greater or equal than 1 / 2 .

2.2. Some Properties of the Convolution Operation

In this subsection, we study some elementary properties of the convolution and side convolutions in general metric spaces.
Note that, if ∧ is a convolution on a metric space ( E , d ) with constants k , k as in Definition 1, then for any e , e , f , f E ,
d ( e e , f f ) d ( e e , e f ) + d ( e f , f f ) d ( e e , f f ) k d ( e , f ) + k d ( e , f ) .
We define a convolution operator Q : E × E E by
Q ( e , e ) = e e , e , e E ,
and also define the partial convolution operators from Q as follows:
Definition 2.
Let ∧ be a convolution on a metric space ( E , d ) , for any e E , define
Q e 1 ( e ) : = Q ( e , e ) : E E
e e e ,
and
Q e 2 ( e ) : = Q ( e , e ) : E E
e e e .
The operators Q e 1 and Q e 2 are called the partial or one-sided convolutions with e.
Hereafter, we will see some interesting properties of the above operators.
Proposition 2.
If ( E , d ) is a metric space and Q is a convolution operator on E × E as defined in the above, then the operator Q is a Lipschitz function with Lipschitz constant ( k + k ) with respect to the Euclidean metric d 2 . In particular, Q is continuous.
Proof. 
Let e , e , f , f E . By (3), we have
d ( e e , f f ) k d ( e , f ) + k d ( e , f ) k [ d ( e , f ) ] 2 + [ d ( e , f ) ] 2 + k [ d ( e , f ) ] 2 + [ d ( e , f ) ] 2 = ( k + k ) d 2 ( ( e , e ) , ( f , f ) ) .
Proposition 3.
For any e E , the operators Q e 1 and Q e 2 are Lipschitz functions with Lipschitz constants k and k , respectively. In particular Q e 1 and Q e 2 are contractive if k < 1 and k < 1 , respectively.
Proof. 
Let e , e E , by the definition of convolution,
d ( Q e 1 ( e ) , Q e 1 ( e ) ) = d ( e e , e e ) k d ( e , e ) .
Similarly, d ( Q e 2 ( e ) , Q e 2 ( e ) ) = d ( e e , e e ) k d ( e , e ) .
Consequently, the convolution and the partial convolutions are uniformly continuous maps.

3. Convolution of Sets

Now we define convolution on sets as in the following way and discuss its properties. Take any R , S E and define
R e : = { r e : r R } ,
e S : = { e s : s S } ,
R S : = { r s : r R , s S } .
The following are basic properties of the convolution sets:
  • Since e e = e , if e R , then e R e ;
  • If e S , then e e S ;
  • (3)
    Consequently, for any subsets R , S E ,
    ( R S ) ( R S ) ( S R ) .
    Proposition 4.
    If R , S are subsets of a metric space ( E , d ) , then for any e , e :
    d ( R e , R e ) k d ( e , e ) ,
    d ( e S , e S ) k d ( e , e ) .
    Proof. 
    First, we prove the first inequality:
    d ( R e , R e ) = inf r , r R d ( r e , r e ) inf r R d ( r e , r e ) k d ( e , e ) .
    The second inequality can be proved similarly. □
    Proposition 5.
    Let R , S be subsets of E. Then, for any e E :
    d ( R , R e ) k d ( R , e ) ,
    d ( S , e S ) k d ( S , e ) .
    Proof. 
    For the first result, consider
    d ( R , R e ) = inf r , r R d ( r , r e ) inf r R d ( r r , r e ) inf r R k d ( r , e ) = k d ( R , e ) .
    Similarly, the second inequality can be proved. □
    By Propositions 2 and 3, for any e E , Q , Q e 1 , and Q e 2 are continuous. From that, suppose R , S are compact subsets of E, then Q ( R × S ) = R S , Q e 1 ( S ) = e S and Q e 2 ( R ) = R e are also compact sets.
    Proposition 6.
    Suppose R , R , S , S H ( E ) , then for any e , e E , the Hausdorff metric satisfies the following properties with respect to the convolution:
    1. 
    h ( R , R e ) k h ( R , e ) ,
    2. 
    h ( S , e S ) k h ( S , e ) ,
    3. 
    h ( R , R S ) k h ( R , S ) ,
    4. 
    h ( S , R S ) k h ( R , S ) ,
    5. 
    h ( R S , R S ) k h ( S , S ) ,
    6. 
    h ( R S , R S ) k h ( R , R ) ,
    7. 
    h ( R S , R S ) k h ( R , R ) + k h ( S , S ) .
    Proof. 
    Consider the last inequality, let r R , s S , then
    d ( r s , R S ) = inf r R , s S d ( r s , r s ) inf r R , s S ( d ( r s , r s ) + d ( r s , r s ) ) k d ( r , R ) + k d ( s , S ) k h ( R , R ) + k h ( S , S ) ,
    and let r R , s S , we have
    d ( r s , R S ) = inf r R , s S d ( r s , r s ) k d ( r , R ) + k d ( s , S ) k h ( R , R ) + k h ( S , S ) .
    Hence, the last inequality is proved. The other items are particular cases of the last inequality. □
    Theorem 1.
    If ∧ is a convolution on a metric space ( E , d ) , then ∧ is also a convolution on the Hausdorff metric space ( H ( E ) , h ) with the same constants k , k .
    Example 1.
    Let us consider a finite (compact) system of polynomials in L p ( I ) , R = ( p n ) n = 0 N , and a family of modified “polynomials" R ˜ = { p n t m : n = 0 , N ; m = 0 , M } , where S = ( t m ) n = 0 M is a compact set of trigonometric functions. The fractal convolution with t m will provide additional frequencies to the elements of R, in a process similar to the convolution depicted in Figure 1. The Hausdorff distance between original and modified systems R and R ˜ will be bounded by the distance between R and S multiplied by k = C / ( 1 C ) (see item 3 of Section 2.1), according to the third item of the previous proposition.
    The convolution operator ∧ can be substituted by the union in Properties 1 7 of Proposition 6 according to Section 2.1, Item 4 by taking k = k = 1 . In this case, R and S would be sets composed of compact sets.

    4. Convolution in Normed Spaces

    Now, let us consider that ( E , . ) is a normed linear space and assume that the convolution operator
    Q : E × E E ,
    ( e , e ) e e ,
    is linear. Define partial convolutions with null element 0,
    Q 0 1 : E E as Q 0 1 ( e ) : = Q ( 0 , e ) = 0 e ,
    and
    Q 0 2 : E E as Q 0 2 ( e ) : = Q ( e , 0 ) = e 0 .
    The linearity of the convolution operator Q implies that Q 0 1 and Q 0 2 are also linear operators. Now, we check the boundedness of Q , Q 0 1 and Q 0 2 (though we know they are continuous).
    First, consider the convolution operator Q, by (3),
    Q ( e , e ) = e e 0 0 k e 0 + k e 0 ( k + k ) ( e , e ) ( 0 , 0 ) p = ( k + k ) ( e , e ) p ,
    where
    ( e , s ) ( e , s ) p : = ( e e p + s s p ) 1 / p , if 1 p < ,
    ( e , s ) ( e , s ) p : = max { e e , s s } , if p = .
    This implies Q is bounded with respect to . p and the norm is bounded by k + k , that is
    Q k + k .
    Similarly, for the boundedness of partial convolutions Q 0 1 and Q 0 2 , we have
    Q 0 1 ( e ) = 0 e 0 0 k e ,
    and
    Q 0 2 ( e ) = e 0 0 0 k e .
    This implies that the norms of Q 0 1 and Q 0 2 are bounded by k , k , respectively, that is
    Q 0 1 k and Q 0 2 k .
    As said before, Q 0 1 and Q 0 2 are contractive if k < 1 and k < 1 , respectively, and Q is contractive if k + k < 1 .
    Since Q is linear, for all e E
    Q 0 1 ( e ) + Q 0 2 ( e ) = Q ( 0 , e ) + Q ( e , 0 ) = Q ( e , e ) = e .
    Therefore,
    Q 0 1 + Q 0 2 = I .
    Proposition 7.
    If k < 1 , then Q 0 1 is a topological isomorphism. If k < 1 , then Q 0 2 is also.
    Proof. 
    It is a straightforward consequence of the previous results. □

    4.1. Other Properties of Q 0 1 and Q 0 2

    In this subsection, we consider a convolution satisfying an additional condition: There exists c R such that for any e E ,
    c e 0 = 0 e .
    This condition is inspired by the properties of the fractal convolution of functions. The inequality (5) implies that
    Q 0 1 = c Q 0 2 .
    All bounds (upper and lower) of Q 0 1 are applicable to Q 0 2 multiplied by c. As said before, we assume Q is linear in this section, that is to say,
    ( e + f ) ( e + f ) = ( e e ) + ( f f ) .
    In particular,
    e 0 e = e e 0 e = e 0 ,
    e e 0 = e e e 0 = 0 e .
    By (5)–(7), we have
    c 0 e e = 0 e ,
    e 0 e = c e 0 .
    By (8), we obtain
    Q 0 1 ( e ) c Q 0 1 ( e ) + c e ,
    this implies
    Q 0 1 ( e ) c 1 c e ,
    and
    Q 0 1 c 1 c
    if c < 1 . Since I = Q 0 1 + Q 0 2 ,
    1 ( 1 + 1 / c ) Q 0 1 c 1 + c Q 0 1 .
    Similarly, by (9), we have
    Q 0 2 ( e ) 1 1 c e ,
    and, thus,
    Q 0 2 1 1 c
    if c < 1 and
    1 1 + c Q 0 2 .
    We know also that Q 0 1 k and Q 0 2 k , therefore, if c < 1 , we have
    c 1 + c Q 0 1 min { k , c 1 c } .
    1 1 + c Q 0 2 min { k , 1 1 c } .
    According to (10) if c < 1 / 2 , Q 0 2 is a topological isomorphism.
    Proposition 8.
    If c 0 , then Q 0 1 is injective.
    Proof. 
    Suppose Q 0 1 ( e ) = 0 , this implies by (8) that c 0 e e = 0 e = 0 . Since c 0 , 0 e = e , and Q 0 1 ( e ) = 0 e = 0 , then e = 0 . □
    Proposition 9.
    If E is Banach, then Q 0 1 has a closed range.
    Proof. 
    Suppose c = 0 , then Q 0 1 is the null-operator. Assume that c 0 , by (8)
    c ( e 0 e ) 0 e ,
    and, therefore,
    e 1 + c c Q 0 1 ( e ) .
    Let ( Q 0 1 ( e m ) ) converges to e . By linearity of Q 0 1 ,
    e m e n 1 + c c Q 0 1 ( e m ) Q 0 1 ( e n ) .
    This gives ( e m ) is a Cauchy sequence and hence it converges to some point e in E. Using the continuity of Q 0 1 , we conclude e = Q 0 1 ( e ) .
    Proposition 10.
    If E is Banach, then Q 0 2 is injective and has a closed range.
    Proof. 
    Assume e 0 = 0 , this implies by (9) that e 0 e = c e 0 = 0 and therefore e = 0 . Hence, the operator Q 0 2 is injective. Additionally,
    e e 0 c e 0 ,
    and
    e ( 1 + c ) Q 0 2 ( e ) .
    From the above inequality and the proof of Proposition 9, we conclude Q 0 2 has a closed range. □
    Proposition 11
    ([23]). Let T be a linear operator on a Banach space E. Suppose there exist c 1 , c 2 [ 0 , 1 ) , such that
    T e e c 1 e + c 2 T e , e E .
    Then, T is topological isomorphism, and for all e E ,
    1 c 1 1 + c 2 e T e 1 + c 1 1 c 2 e ,
    1 c 2 1 + c 1 e T 1 e 1 + c 2 1 c 1 e .
    Theorem 2.
    Let E be a Banach space. If c > 1 , then Q 0 1 is a topological isomorphism, and it satisfies the following inequality for all e E :
    c c + 1 e Q 0 1 ( e ) c c 1 e ,
    c 1 c e ( Q 0 1 ) 1 ( e ) c + 1 c e .
    If c < 1 , then Q 0 2 is a topological isomorphism, and it satisfies the following inequality for all e E :
    1 1 + c e Q 0 2 ( e ) 1 1 c e ,
    ( 1 c ) e ( Q 0 2 ) 1 ( e ) ( 1 + c ) e .
    Proof. 
    From (8) and (9), we have c 1 = 0 , c 2 = 1 / c and c 1 = 0 , c 2 = c in Proposition 11 for the linear operator Q 0 1 and Q 0 2 , respectively. □
    Consequence: If c > 1 , Q 0 1 c c 1 .
    Example 2.
    According to Lemma 6.3 of the reference [24], if | α n ( t ) | = C , for all n and t, the fractal convolution satisfies the equality (5) for c = C since 0 f = C 0 f f = C f 0 , for any f L 2 ( [ 1 , 1 ] ) . Since C < 1 (see item 3 of Section 2.1) the right convolution with the null function in L 2 ( [ 1 , 1 ] ) is a topological isomorphism. If ( p m ) is the Legendre basis of polynomials, then ( p m f 0 ) is also a basis for the space L 2 ( [ 1 , 1 ] ) , where f 0 represents the null function.

    4.2. Schauder Bases of Convolution

    Definition 3.
    A sequence ( e m ) m = 1 in a normed space E is called a Schauder basis for E if for each e in E, there is a unique sequence ( c m ) of scalars, such that e = m = 1 c m e m .
    Definition 4.
    A subset S of a vector space E over a field F is called a spanning family of E if
    E = m = 1 n c m e m : n N , c m F , e m S .
    In such case, we say E is a span of S.
    Definition 5.
    A sequence ( e m ) in a normed space E is called a Schauder sequence if it is a Schauder basis for the closed span of ( e m ) .
    Proposition 12.
    If c 0 , and ( e m ) is a Schauder basis of E, then ( 0 e m ) is a Schauder sequence of E.
    Proof. 
    By Propositions 8 and 9, we conclude that Q 0 1 is a topological isomorphism on its range. Hence, ( Q 0 1 ( e m ) ) is a Schauder basis for the range of Q 0 1 . □
    Proposition 13.
    If c < 1 or k < 1 and ( e m ) is a (bounded) Schauder basis of E Banach, then
    ( e m 0 ) = ( e m 0 e m ) is also a (bounded) Schauder basis of E.
    Proof. 
    By (4), Q 0 2 ( e m ) = ( e m Q 0 1 ( e m ) ) . If c < 1 , Q 0 2 is a topological isomorphism due to Theorem 2. This implies that ( e m 0 e m ) is a Schauder basis of E.
    Assume ( e m ) is bounded, then there exist M l and M u , such that
    M l e m M u .
    From the definition of convolution, we obtain
    e m 0 e m k e m k M u .
    Consider,
    e m 0 e m e m 0 e m = e m c 0 e m e m ,
    and
    ( 1 + c ) e m 0 e m e m M l .
    If k < 1 , Q 0 2 is also an isomorphism by Proposition 7, and we obtain the same result. □
    In general, in all the cases where Q 0 1 or Q 0 2 are isomorphisms, the bases are preserved by the respective side convolution with zero.

    5. Convolution in Hilbert Spaces

    Consider now the case where E is a separable Hilbert space and we will discuss the properties of the operators Q 0 1 and Q 0 2 . In this section, we discuss the existence of convolved bases, Bessel sequences, frames, etc. For these definitions we refer to ([25,26]). As in Section 4, we consider that the operator Q is linear and satisfying the condition (5), with subsequent identities (8) and (9).
    Definition 6.
    A sequence ( e m ) is called a Bessel sequence in a Hilbert space E if there exists a constant B > 0 such that for all e E ,
    m = 1 | < e , e m > | 2 B e 2 .
    Definition 7.
    A sequence ( e m ) is called a Riesz basis in a Hilbert space E if it is equivalent to an orthonormal basis ( r m ) of E, that is to say, there exists an operator T linear, bijective and bicontinuous (topological isomorphism), such that T ( e m ) = r m .
    Definition 8.
    A sequence ( e m ) in a Hilbert space E, is called a Riesz sequence if there exist k 1 , k 2 > 0 , such that for any ( c m ) l 2 ,
    k 1 m = 1 | c m | 2 m = 1 c m e m 2 k 2 m = 1 | c m | 2 .
    Proposition 14.
    If ( e m ) is an orthonormal basis of E, then ( 0 e m ) is a Riesz sequence in E.
    Proof. 
    Let e = m = 1 c m e m in E for any ( c m ) l 2 . Since the operator
    Q 1 0 ( e ) = m = 1 c m ( 0 e m )
    is bounded and ( e m ) is an orthonormal basis,
    m = 1 c m ( 0 e m ) 2 Q 0 1 2 e 2 = Q 0 1 2 m = 1 | c m | 2 .
    From (8), we have
    c ( e 0 e ) 0 e ,
    this implies
    c 1 + c e 0 e .
    Hence,
    k 1 m = 1 | c m | 2 m = 1 c m ( 0 e m ) 2 k 2 m = 1 | c m | 2 ,
    where k 1 = ( c 1 + c ) 2 and k 2 = Q 0 1 2 k 2 .
    Example 3.
    Haar system is an orthonormal basis of L 2 ( [ 0 , 1 ] ) composed of discontinuous functions ([27]). Then the set of convolved elements ( f 0 H m ) , where f 0 is the null function, is a Riesz sequence of the same space.
    Proposition 15.
    If ( e m ) is an orthonormal basis of E, then ( e m 0 ) is a Bessel sequence in E.
    Proof. 
    Let e E . Since ( e m ) is an orthonormal basis, we have
    m = 1 | < e , Q 0 2 ( e m ) > | 2 = m = 1 | < ( Q 0 2 ) ( e ) , e m > | 2 ( Q 0 2 ) ( e ) 2 ( Q 0 2 ) 2 e 2 .
    The Bessel constant is ( Q 0 2 ) 2 = ( Q 0 2 ) 2 , where ( Q 0 2 ) is the adjoint operator of Q 0 2 .
    Example 4.
    According to this proposition, the sequence of convolutions ( H m f 0 ) , where f 0 is the null function, is a Bessel sequence of L 2 ( [ 0 , 1 ] ) .
    Theorem 3.
    If ( e m ) is a Riesz sequence in E, then ( e m 0 ) is also a Riesz sequence.
    Proof. 
    We know that Q 0 2 is injective, and it has a closed range (cf. Proposition 10). Therefore, it is a topological isomorphism from [ e m ] onto [ Q 0 2 ( e m ) ] and hence it preserves bases. □
    Two sequences ( e m ) and ( r m ) are said to be biorthogonal in a Hilbert space E if
    < e m , r k > = δ m , k : = 1 if m = k , 0 if m k .
    Theorem 4
    ([25]). Assume that ( e m ) is a basis for E. Then, there exists a unique family ( r m ) in E, such that
    e = m = 1 < e , r m > e m , e E .
    ( r m ) is a basis for E, and ( e m ) and ( r m ) are biorthogonal.
    Proposition 16.
    If c < 1 or k < 1 and ( e m ) is a basis of E, then there exists a unique family ( r m ) in E, such that
    e = m = 1 < e , ( ( Q 0 2 ) 1 ) ( r m ) > ( e m 0 ) , e E .
    ( ( ( Q 0 2 ) 1 ) ( r m ) ) is a basis for E and ( e m 0 ) and ( ( ( Q 0 2 ) 1 ) ( r m ) ) are biorthogonal.
    Proof. 
    Let e E . Since Q 0 2 is a topological isomorphism (see Theorem 2 and Proposition 7), take s = ( Q 0 2 ) 1 ( e ) . By Theorem 4, there exists a unique family ( r m ) in E, being a basis, such that
    r = m = 1 < r , r m > e m r E .
    Therefore,
    e = Q 0 2 ( s ) = m = 1 < s , r m > ( e m 0 ) = m = 1 < ( Q 0 2 ) 1 ( e ) , r m > ( e m 0 ) = m = 1 < e , ( ( Q 0 2 ) 1 ) ( r m ) > ( e m 0 ) .
    Since ( r m ) is a basis for E, ( ( ( Q 0 2 ) 1 ) ( r m ) ) is a basis for E. Applying Theorem 4, to the basis ( e m 0 ) and from (15), we obtain ( ( ( Q 0 2 ) 1 ) ( r m ) ) is unique, and ( e m 0 ) , ( ( ( Q 0 2 ) 1 ) ( r m ) ) are biorthogonal. □
    Frames and convolution: Here we study some relations between frames and convolution.
    Definition 9.
    A sequence ( e m ) in a separable Hilbert space E is called a frame if there exists frame bounds A , B R + such that for any e E ,
    A e 2 m = 1 | < e , e m > | 2 B e 2 .
    Proposition 17.
    If c > 1 or k < 1 and ( e m ) is a frame for E with frame bounds A , B , then ( 0 e m ) is a frame for E with frame bounds A ( Q 0 1 ) 1 2 , B Q 0 1 2 .
    Proof. 
    Let e E . Now
    m = 1 | < e , Q 0 1 ( e m ) > | 2 = m = 1 | < ( Q 0 1 ) ( e ) , e m > | 2 B ( Q 0 1 ) ( e ) 2 B Q 0 1 2 e 2 .
    where ( Q 0 1 ) is the adjoint operator of Q 0 1 . Hence, ( 0 e m ) is a Bessel sequence. By Theorem 2 and Proposition 7, Q 0 1 is a topological isomorphism. Consider
    e 2 = Q 0 1 ( Q 0 1 ) 1 e 2 = ( ( Q 0 1 ) 1 ) ( Q 0 1 ) e 2 ( ( Q 0 1 ) 1 ) 2 ( Q 0 1 ) e 2 ( Q 0 1 ) 1 2 A m = 1 | < ( Q 0 1 ) ( e ) , e m > | 2 ( Q 0 1 ) 1 2 A m = 1 | < e , Q 0 1 ( e m ) > | 2 .
    Consequently
    A ( Q 0 1 ) 1 2 e 2 m = 1 | < e , Q 0 1 ( e m ) > | 2 .
    Example 5.
    Let us consider any two-dimensional Hilbert space V. If ( e 1 , e 2 ) is an orthonormal basis, it is an easy exercise to prove that ( e 1 , e 2 , e 1 + e 2 ) is a frame. Consequently, the set ( 0 e 1 , 0 e 2 , 0 ( e 1 + e 2 ) ) is also a frame of V, if the conditions on the constants are satisfied.
    Corollary 1.
    If ( e m ) is a Bessel sequence in E with bound B, then ( 0 e m ) is also a Bessel sequence with the bound B Q 0 1 2 .
    Proof. 
    The approach given in the first half of the proof of Proposition 17 provides the result. □
    Remark 1.
    Similarly for Q 0 2 , if c < 1 or k < 1 and ( e m ) is a frame for E with frame bounds A , B , then ( e m 0 ) is a frame for E with frame bounds A ( Q 0 2 ) 1 2 , B Q 0 2 2 .
    A frame ( e m ) is said to be an exact frame if for any j N , ( e m ) m j is not a frame.
    Theorem 5
    ([25]). Let ( e m ) be a frame for E. Then the following are equivalent:
    • ( e m ) is a Riesz basis for E;
    • ( e m ) is an exact frame;
    • ( e m ) has a biorthogonal sequence.
    Proposition 18.
    If c > 1 or k < 1 and ( e m ) is an exact frame for E, then
    • ( 0 e m ) is an exact frame;
    • ( 0 e m ) is a Riesz basis for E;
    • ( 0 e m ) has a biorthogonal sequence.
    Proof. 
    Suppose Q 0 1 ( e m ) is not an exact frame, then there exists j N , such that { Q 0 1 ( e m ) } m j is a frame. This gives { ( Q 0 1 ) 1 ( Q 0 1 ( e m ) ) } m j = ( e m ) m j is also a frame, which is a contradiction to ( e m ) is an exact frame. Therefore, ( 0 e m ) is an exact frame.
    By Theorem 5, ( 0 e m ) is a Riesz basis for E, and it has a biorthogonal sequence. □
    Theorem 6.
    ([28]). If ( e m ) is a frame with frame bounds A , B and ( e m ) satisfies
    R : = m e m e m 2 < A ,
    then ( e m ) is also a frame with frame bounds A 1 R A 2 and B 1 + R B 2 .
    In the next set of results, we neglect the condition c e 0 = 0 e and substitute it with a different hypothesis.
    Theorem 7.
    Let ( e m ) be a frame with frame bounds A , B > 0 in E. If there exists a sequence of real numbers ( c m ) , such that
    c m < 1 , 0 e m = c m e m 0 and R = m c m 1 c m 2 e m 2 < A ,
    then ( e m 0 ) is a frame with frame bounds A 1 R A 2 and B 1 + R B 2 in E.
    Proof. 
    From the given hypothesis and (9), we have
    e m 0 e m = c m e m 0 .
    This implies
    e m 0 e m c m e m 0 e m + c m e m ,
    and therefore
    e m 0 e m c m 1 c m e m .
    Using Theorem 6, we conclude the proof. □
    Example 6.
    Let us consider the trigonometric frame ( τ m ) = { 1 } ( cos ( m t ) , sin ( m t ) ) in L 2 ( 2 π ) . Taking the scale factors of the fractal convolution defined as c m : = 1 / m , the conditions of the previous theorem are satisfied, and thus the system ( τ m f 0 ) is also a frame, where f 0 denotes the null function.
    Remark 2.
    We can prove similar result for Q 0 1 , that is, if ( e m ) is a frame and there exists ( c m ) , such that
    c m < 1 , 0 e m = c m e m 0 and R = m 1 1 c m 2 e m 2 < A ,
    then ( 0 e m ) is also a frame in E.
    Remark 3.
    Similarly if ( e m ) is a frame with frame bounds A , B > 0 , in E and R 1 = m k 2 e m 2 < A (or) R 2 = m ( k ) 2 e m 2 < A , then ( e m 0 ) (or) ( 0 e m ) is a frame with frame bounds A 1 R 1 A 2 , B 1 + R 1 B 2 (or) A 1 R 2 A 2 , B 1 + R 2 B 2 , respectively, in E. Because due to the properties of the convolution
    e m 0 e m = e m 0 e m e m k e m
    and
    0 e m e m = 0 e m e m e m k e m .

    6. Conclusions and Potential Applications

    In this present work, we consider binary operations in metric spaces satisfying two inequalities related to the metric. Remarkable particular cases are the logical conjunction and disjunction, the union of compact sets and the fractal convolution of functions that we proposed in previous papers. This correspondence propitiates two partial or side operators on the space. Some properties of these maps are derived, along with additional results concerning the operation on subsets. For instance, a convolution naturally induces a similar operation on the set of compact sets of the space. In the case of a normed linear space, inspired by the fractal convolution, we work with the assumption that the associated operator is linear. Consequently, the side or partial convolutions with zero are also linear. This fact enables the definition of convolved Schauder bases of the space. At the end, the side convolution operators are studied in the framework of Hilbert spaces, and the existence of convolved Riesz and Bessel sequences and frames is proven.
    The proposed theory, that generalizes the fractal case, may be useful in communication theory, signal analysis, operator theory, functional and harmonic analysis, and general study of metric spaces. A large number of problems of applied science must be approached by means of Approximation Theory. In particular, the approximation and interpolation of sets of data play a crucial role in all the social and scientific fields. In many cases, the approximative function is constructed as a linear combination of elements chosen from a suitable system. As described in Section 4 and Section 5, the convolution provides additional bases and frames in the considered spaces. This fact enables the selection of an appropriate spanning family for a specific case. For instance, one can define bases of functions whose graphs own non-integer fractal dimensions beginning from very smooth maps as polynomial, trigonometric, etc. For irregular signals, these fractal functions may be more suitable than the classical. A standard function cannot approximate properly a chaotic signal possessing a self-similar graph. In this way, the convolution enlarges the field of Approximation and Functional Theory. For general metric spaces, convolution provides elements to a given distance of the components. If this quantity is small, the convolved elements can be considered a perturbed version of the originals. In this case, the new elements are close but at the same time may possess different properties, thus providing a wider spectrum of possibilities for the optimization of a given phenomenon.

    Author Contributions

    Conceptualization, M.A.N. and P.R.; methodology, M.A.N. and P.R.; validation, M.A.N. and A.K.B.C.; formal analysis, P.R.; writing—original draft preparation, M.A.N.; writing—review and editing, P.R. and A.K.B.C.; supervision, M.A.N. and A.K.B.C. All authors have read and agreed to the published version of the manuscript.

    Funding

    This research received no external funding.

    Institutional Review Board Statement

    Not applicable.

    Informed Consent Statement

    Not applicable.

    Data Availability Statement

    Not applicable.

    Acknowledgments

    The authors are grateful to the anonymous referees for wide-ranging comments and constructive suggestions that improved the presentation of the paper.

    Conflicts of Interest

    The authors declare no conflict of interest.

    References

    1. Fréchet, M.R. Sur Quelque Points du Calcul Fonctionnel. Rendic. Circ. Mat. Palermo 1906, 22, 1–74. [Google Scholar] [CrossRef] [Green Version]
    2. Byrant, V. Metric Spaces: Iteration and Application; Cambridge University Press: New York, NY, USA, 1985. [Google Scholar]
    3. Heinonen, J. Lectures on Analysis on Metric Spaces; Springer: New York, NY, USA, 2001. [Google Scholar]
    4. Lahti, P. Discrete convolutions of BV functions in quasiopen sets in metric spaces. Calc. Var. Partial. Differ. Equ. 2020, 59, 27. [Google Scholar] [CrossRef]
    5. Pap, E.; Štajner, I. Generalized pseudo-convolution in the theory of probabilistic metric spaces, information, fuzzy numbers, optimization, system theory. Fuzzy Sets Syst. 1999, 102, 393–415. [Google Scholar] [CrossRef]
    6. Navascués, M.A. Fractal functions of discontinuous approximation. J. Basic Appl. Sci. 2014, 10, 173–176. [Google Scholar] [CrossRef] [Green Version]
    7. Navascués, M.A.; Massopust, P. Fractal convolution: A new operation between functions. Fract. Calc. Appl. Anal. 2019, 22, 619–643. [Google Scholar] [CrossRef] [Green Version]
    8. Veisi, A.; Delbaznasab, A. Metric spaces related to Abelian groups. Appl. Gen. Top. 2021, 22, 169–181. [Google Scholar] [CrossRef]
    9. Karami, A.; Shakery, R.; Sedghi, S.; Altun, I. Coupled fixed point results on metric spaces defined by binary operations. Carpathian Math. Publ. 2018, 10, 313–323. [Google Scholar] [CrossRef]
    10. Schweizer, B.; Sklar, A. Statistical metric spaces. Pac. J. Math. 1960, 10, 314–334. [Google Scholar] [CrossRef] [Green Version]
    11. Ziaie, S.A.; Ray, S.; Mashinchi, M.; Kamram, R. Boolean structure of triangular norms. Mathw. Soft Comput. 1999, 6, 63–78. [Google Scholar]
    12. Conant, G. Distance structures for generalized metric spaces. Ann. Pure Appl. Log. 2017, 168, 622–650. [Google Scholar] [CrossRef] [Green Version]
    13. Halmos, P.; Givant, S. Introduction to Boolean Algebras; Springer: New York, NY, USA, 2009. [Google Scholar]
    14. Barnsley, M.F. Fractals Everywhere; Dover Publications: Mineola, NY, USA, 2012. [Google Scholar]
    15. Chand, A.K.B.; Vijender, N.; Navascués, M.A. Shape preservation of scientific data through rational fractal splines. Calcolo 2014, 51, 329–362. [Google Scholar] [CrossRef]
    16. Mandelbrot, B.B. The Fractal Geometry of Nature; Freeman: New York, NY, USA, 1982. [Google Scholar]
    17. Manousopoulos, P.; Drakopoulos, V.; Theoharis, T. Curve fitting by fractal interpolation. In Transactions on Computational Science; Lecture Notes in Computer Science Book Series; Springer: Berlin, Germany, 2008; Volume 4750, pp. 85–103. [Google Scholar]
    18. Manousopoulos, P.; Drakopoulos, V.; Theoharis, T. Parameter identification of 1D recurrent fractal interpolation functions with applications to imaging and signal processing. J. Math. Imaging Vis. 2011, 40, 162–170. [Google Scholar] [CrossRef]
    19. Navascués, M.A.; Chand, A.K.B. Fundamental sets of fractal functions. Acta Appl. Math. 2008, 100, 247–261. [Google Scholar] [CrossRef]
    20. 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]
    21. Górniewicz, L. Topological Fixed Point Theory of Multivalued Mappings; Kluwer: Dordrecht, The Netherlands, 1999. [Google Scholar]
    22. Secelean, N.A. Approximation of the attractor of a countable iterated function system. Gen. Math. 2009, 17, 221–231. [Google Scholar]
    23. Casazza, P.G.; Christensen, O. Perturbation of operators and applications to frame theory. J. Fourier Anal. Appl. 1997, 3, 543–557. [Google Scholar] [CrossRef]
    24. Navascués, M.A.; Viswanathan, P.; Mohapatra, R.N. Convolved fractal bases and frames. Adv. Oper. Theory 2021, 6, 1–23. [Google Scholar] [CrossRef]
    25. Christensen, O. Frames and Bases: An Introductory Course; Birkhauser: Boston, MA, USA, 2008. [Google Scholar]
    26. Singer, I. Bases in Banach Spaces I; Springer: New York, NY, USA, 1970. [Google Scholar]
    27. Haar, A. Zur Theorie der orthogonalen Funktionensysteme. Math. Ann. 1910, 69, 331–371. [Google Scholar] [CrossRef]
    28. Christensen, O. Frame perturbations. Proc. Am. Math. Soc. 1995, 123, 1217–1220. [Google Scholar] [CrossRef]
    Figure 1. Fractal convolution f b of the maps f ( t ) = e 5 t cos ( 3 π t 2 ) and b ( t ) = cos ( π t 2 ) in the interval I = [ 0 , 3 ] .
    Figure 1. Fractal convolution f b of the maps f ( t ) = e 5 t cos ( 3 π t 2 ) and b ( t ) = cos ( π t 2 ) in the interval I = [ 0 , 3 ] .
    Mathematics 10 00011 g001
    Figure 2. Fractal convolution f b of the maps f ( t ) = 4 t 2 and b ( t ) = t 2 t 2 , in the interval I = [ 0 , 3 ] .
    Figure 2. Fractal convolution f b of the maps f ( t ) = 4 t 2 and b ( t ) = t 2 t 2 , in the interval I = [ 0 , 3 ] .
    Mathematics 10 00011 g002
    Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

    Share and Cite

    MDPI and ACS Style

    Navascués, M.A.; Rajan, P.; Chand, A.K.B. Binary Operations in Metric Spaces Satisfying Side Inequalities. Mathematics 2022, 10, 11. https://doi.org/10.3390/math10010011

    AMA Style

    Navascués MA, Rajan P, Chand AKB. Binary Operations in Metric Spaces Satisfying Side Inequalities. Mathematics. 2022; 10(1):11. https://doi.org/10.3390/math10010011

    Chicago/Turabian Style

    Navascués, María A., Pasupathi Rajan, and Arya Kumar Bedabrata Chand. 2022. "Binary Operations in Metric Spaces Satisfying Side Inequalities" Mathematics 10, no. 1: 11. https://doi.org/10.3390/math10010011

    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