Next Article in Journal
On the Significance of Parameters in the Choice and Collection Schemata in the 2nd Order Peano Arithmetic
Next Article in Special Issue
Asymptotic ω-Primality of Finitely Generated Cancelative Commutative Monoids
Previous Article in Journal
Attention Knowledge Network Combining Explicit and Implicit Information
Previous Article in Special Issue
On Focal Borel Probability Measures
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Decomposition of Linear Operators on Pre-Euclidean Spaces by Means of Graphs

by
Hani Abdelwahab
1,
Elisabete Barreiro
2,
Antonio J. Calderón
3 and
José M. Sánchez
3,*
1
Department of Mathematics, Faculty of Science, Mansoura University, Mansoura 35516, Egypt
2
University of Coimbra, CMUC, Department of Mathematics, FCTUC, Largo D. Dinis, 3000-143 Coimbra, Portugal
3
Department of Mathematics, University of Cádiz, 11510 Puerto Real, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(3), 725; https://doi.org/10.3390/math11030725
Submission received: 24 December 2022 / Revised: 19 January 2023 / Accepted: 23 January 2023 / Published: 1 February 2023
(This article belongs to the Special Issue Functional Analysis, Topology and Quantum Mechanics II)

Abstract

:
In this work, we study a linear operator f on a pre-Euclidean space V by using properties of a corresponding graph. Given a basis B of V , we present a decomposition of V as an orthogonal direct sum of certain linear subspaces { U i } i I , each one admitting a basis inherited from B , in such way that f = i I f i . Each f i is a linear operator satisfying certain conditions with respect to U i . Considering this new hypothesis, we assure the existence of an isomorphism between the graphs of f relative to two different bases. We also study the minimality of V by using the graph of f relative to B .
MSC:
47A65; 47B37; 05C90

1. Introduction

This paper is motivated by the following problem: If we consider a family { f i : V i V i } i I of linear operators, where any V i is a pre-Euclidean space, then we can construct a new linear operator in a natural way
f : i I V i i I V i
as f = i I f i , where V : = i I V i is the pre-Euclidean space defined by componentwise operations. However, what about the converse? That is, if
f : V V
is a linear operator in a pre-Euclidean space, could we find a family { V i } i I of pre-Euclidean spaces and a family of linear operators { f i : V i V i } i I in such a way that the following equations are true?
V = i I V i and f = i I f i
The aim of the present work is to study this problem by giving a positive answer. A pre-Euclidean space is simply a linear space provided with a bilinear form, hence our work covers a wide range of structures. As a tool for our study, we use the techniques of graphs. This allows us to determine the decomposition (1) in an easy way, by looking at a graph of f (and a fixed basis). This result gives us the opportunity to recover a (possible) large linear operator f : V V from a family of easier linear operators f i : V i V i in a visual and computable way, which we hope will be useful in dealing with linear operators in a vector space endowed with a bilinear map. In recent years, the use of graphs has increased in order to apply them to other areas [1,2,3,4,5]. The application of graphs has been used for the study of linear operators and algebras [6,7,8,9,10,11,12]. As some recently published articles show, this topic is currently very active [13,14,15,16,17,18,19,20,21,22].
For a linear operator f : V V in a pre-Euclidean space V with a fixed basis B , we obtain its decomposition as the orthogonal direct sum of certain linear subspaces { U i } i I , with each one admitting a basis inherited from B . This way, f is decomposed as f = i I f i , with each f i being a linear operator satisfying certain conditions relative to U i . In addition, for the linear operator f, we present conditions in order to guarantee the existence of an isomorphism between the graphs of f relative to two different bases of V . Finally, we analyze the minimality property for V by using the graph of f relative to B .
The paper is organized as follows. Section 2 contains basic notions needed for the following sections. In Section 3, we associate a graph Γ ( f , B ) to any linear operator f, defined in a pre-Euclidean space ( V , · , · ) with a fixed basis B . In addition, we introduce the notion of f-indecomposable, in order to characterize it using the connectivity of Γ ( f , B ) . In Section 4, we give a definition of f-equivalence, under which the graphs Γ ( f , B ) and Γ ( f , B ) are isomorphic for two different bases, B and B of V . Moreover, we relate these properties with a definition of equivalent decomposition for f. In Section 5, we analyze the minimality property for V by using Γ ( f , B ) , the graph of f relative to B . Finally, we present our conclusions, where we critically highlight our contributions, and identify strengths and weaknesses to propose paths for future research.

2. Basic Definitions

Throughout this paper, F denotes an arbitrary field and all vector spaces are assumed to be arbitrary dimensional and over base field F .
Definition 1. 
A pre-Euclidean space is a pair ( V , · , · ) , where V is an F -vector space and · , · : V × V F is a bilinear form.
Example 1. 
R endowed with the bilinear form · , · : R × R R given as x , y : = λ x y , for x , y R and fixed λ R is a pre-Euclidean space.
A pre-Euclidean space over the field R endowed with an scalar product is a pre-Hilbert space. Therefore, the results in this paper apply to pre-Hilbert spaces. A pre-Euclidean subspace of ( V , · , · ) is a linear subspace U of V endowed with the bilinear form · , · | U × U . Additionally, given two pre-Euclidean spaces ( V , · , · V ) and ( W , · , · W ) , a morphism from V to W is a linear map ϕ : V W , satisfying x , y V = ϕ ( x ) , ϕ ( y ) W for x , y V . An isomorphism is a bijective morphism from V to W . Moreover, an automorphism is an isomorphism from V to itself.
Definition 2. 
Let ( V , · , · ) be a pre-Euclidean space.
i.
We say that two elements, x , y V , are orthogonal if x , y = 0 .
ii.
The vector subspaces U and W of V are orthogonal if u , w = 0 for u U , w W . In this case, we denote it as U , W = { 0 } .
iii.
V is an orthogonal direct sum of linear subspaces U i of V , with i I , denoted as
V = i I U i ,
if V decomposes as a direct sum V = i I U i of linear subspaces U i , such that U i , U j = { 0 } whenever i j .

3. Linear Operator in a Pre-Euclidean Space and Graphs: Decomposition Theorem

We recall that a (directed) graph is a pair ( V , E ) , where V is a set of vertices and E V × V is a set of (directed) edges connecting the vertices.
Definition 3. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) with a fixed basis B = { e i } i I . The directed graph of f relative to B is Γ ( f , B ) : = ( V , E ) , where V : = B and
E : = ( e i , e j ) V × V : { e i , e j , e j , e i } { 0 }   o r   f ( e i ) = j λ j e j   f o r   s o m e   0 λ j F .
We say that Γ ( f , B ) is the (directed) graph associated to f relative to basis B .
Example 2. 
Let ( V , · , · ) be the pre-Euclidean space over R with a fixed basis B = { e 1 , e 2 , , e 5 } , such that e 2 , e 5 = 7 and the rest zero. Let f : V V be the linear operator, defined as
f ( e 1 ) = f ( e 3 ) = f ( e 5 ) : = e 1 + 2 e 3 + e 5 , f ( e 2 ) = f ( e 4 ) : = e 4 .
Then, the associated graph Γ ( f , B ) is: Mathematics 11 00725 i001
Example 3. 
Let ( V , · , · ) be the pre-Euclidean space over R with basis B : = { v 1 , v 2 , v 3 , v 4 , v 5 } and the bilinear form defined as
v 4 , v 3 = v 1 , v 5 : = 1 , v 4 , v 2 = v 3 , v 5 : = 3 .
Let f : V V be the linear operator, given as
f ( v 1 ) = f ( v 3 ) = f ( v 2 ) : = 2 v 1 + 2 v 2 + v 3 , f ( v 4 ) = v 4 .
Thus, the graph Γ ( f , B ) is:
Mathematics 11 00725 i002
Given two vertices v i , v j V , an undirected path from v i to v j is a sequence of vertices ( v i 1 , , v i n ) with v i 1 = v i , v i n = v j , such that either ( v i r , v i r + 1 ) E or ( v i r + 1 , v i r ) E , for 1 r n 1 . We may introduce an equivalence relation in V: we say that v i is related to v j in V, and denote v i v j if either v i = v j or there exists an undirected path from v i to v j . In this case, we assert that v i and v j are connected and the equivalence class of v i , denoted by [ v i ] V / , corresponds to a connected component C [ v i ] of the graph Γ ( f , B ) . Therefore,
Γ ( f , B ) = [ v i ] V / ˙ C [ v i ] .
To any C [ v i ] , we can associate the linear subspace
V C [ v i ] : = v j [ v i ] F v j .
Definition 4. 
Let ( V , · , · ) be a pre-Euclidean space with basis B . A linear subspace U of V admits a basis B inherited from B , if B is a basis of U satisfying B B .
Definition 5. 
Let f : V V be a linear operator on a pre-Euclidean space ( V , · , · ) with basis B = { e i } i I . The space V is f-decomposable with respect to B if V = U 1 U 2 , being U 1 , U 2 non-zero linear subspaces admitting a basis inherited from B and f ( U 1 ) U 1 , f ( U 2 ) U 2 . Otherwise, V is said to be f-indecomposable with respect to B .
Example 4. 
The pre-Euclidean space over R of Example 2 is f-indecomposable with respect to B .
Example 5. 
Let V be the pre-Euclidean space defined by the 5-dimensional C -vector space with basis B : = { e 1 , e 2 , e 3 , e 4 , e 5 } , and the bilinear form defined as
e 1 , e 3 : = 4 i , e 4 , e 5 : = 2 11 i ,
and the rest zero. We consider the linear operator f : V V given as
f ( e 1 ) : = 2 e 1 e 2 , f ( e 2 ) : = e 3 ,
and zero on the rest. Then, by denoting U 1 , U 2 as the C -linear subspaces of V with bases { e 1 , e 2 , e 3 } , { e 4 , e 5 } , respectively, we easily see that
V = U 1 U 2
and V is f-decomposable with respect to B . The associated graph Γ ( f , B ) is: Mathematics 11 00725 i003
A graph ( V , E ) is connected if any two vertices are connected. Equivalently, a graph is connected if and only if for every partition of its vertices into two non-empty sets, there is an edge with an endpoint in each set.
Theorem 1. 
Let f : V V be a linear operator on a pre-Euclidean space ( V , · , · ) with basis B = { e i } i I . Then, the following statements are equivalent.
i.
The graph Γ ( f , B ) is connected.
ii.
V is f-indecomposable with respect to B .
Proof. 
First, we suppose that the graph Γ ( f , B ) is connected. Let us assume that V is f-decomposable with respect to B . Thus, V is the orthogonal direct sum
V = U 1 U 2
of two linear subspaces U 1 and U 2 , admitting each one a basis B 1 : = { e j : j J } and B 2 : = { e k : k K } , respectively, inherited from B such that f ( U 1 ) U 1 and f ( U 2 ) U 2 . Hence, B = B 1 ˙ B 2 . Fix some e j B 1 and e k B 2 . As the graph Γ ( f , B ) is connected, it follows that e j is connected to e k . Thus, there exists an undirected path
( e j , v i 2 , , v i n 1 , e k )
from e j to e k . From here, there are e = v i s B 1 and e = v i s + 1 B 2 , such that either ( e , e ) E or ( e , e ) E . As e , e = e , e = 0 , we have either P F e f ( e ) 0 or P F e f ( e ) 0 , where P U : V U is the projection of V onto the linear subspace U. Hence, we have either f ( U 1 ) U 1 or f ( U 2 ) U 2 , where in both cases, it is a contradiction. Therefore, V is f-indecomposable with respect to B .
Conversely, let us suppose that V is f-indecomposable with respect to B and Γ ( f , B ) is not connected. Then, there exists a partition B = B 1 ˙ B 2 , such that both ( x , y ) and ( y , x ) are not in E, for any x B 1 or y B 2 . Set U 1 : = x B 1 F x and U 2 : = y B 2 F y . Then, we have x , y = y , x = 0 for any x B 1 and y B 2 . Moreover, f ( U 1 ) U 1 and f ( U 2 ) U 2 . Thus, V is the orthogonal direct sum
V = U 1 U 2 ,
of two linear subspaces U 1 and U 2 , admitting each one a basis B 1 and B 2 , respectively, inherited from B . Thus, V is f-decomposable with respect to B , which is a contradiction. □
Corollary 1. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) with the basis B = { e i } i I . Then, for each [ v i ] V / , the linear subspace V C [ v i ] : = v j [ v i ] F v j of V is f-indecomposable with respect to [ v i ] .
We illustrate our results with a simple example.
Example 6. 
Let ( V , · , · ) be the pre-Euclidean space over R with a fixed basis B = { e 1 , e 2 , e 3 , e 4 } , such that e 1 , e 3 = 5 , e 2 , e 4 = 1 , and zero on the rest. Let f : V V be the linear operator, defined as
f ( e 1 ) = f ( e 3 ) : = 2 e 3 , f ( e 2 ) = f ( e 4 ) : = 5 e 2 + e 4 .
Then, the associated graph Γ ( f , B ) is:
Mathematics 11 00725 i004
We have V = U 1 U 2 , where U 1 , U 2 are the subspaces with bases { e 1 , e 3 } and { e 2 , e 4 } , respectively. As the graph Γ ( f , B ) is not connected, we conclude that V is f-decomposable with respect to B . However, U 1 and U 2 are f-indecomposable with respect to { e 1 , e 3 } and { e 2 , e 4 } , respectively.
Theorem 2. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) . Then, for a fixed basis B : = { e j } j J of V , it holds that
V = i I U i ,
with each U i being a linear subspace of V admitting B [ i ] : = { e j : e j [ e i ] } as a basis inherited from B . In addition, we have
f = i I f i ,
with each f i being a linear operator in the pre-Euclidean space ( V , · , · ) , for i I , such that
f i | U i = f | U i , f i ( U i ) U i , f i ( i j U j ) = 0 .
Further, for each i I , U i is f i -indecomposable with respect to B [ i ] .
Proof. 
Let V / = { [ e i ] } i I . Then, from Equations (2) and (3), we can assert that V : = i I U i is the direct sum of the family of linear subspaces U i : = V C [ e i ] , and B [ i ] = { e j : e j [ e i ] } is the basis for U i , with i I . Thus, if U i U j then [ e i ] [ e j ] , and hence, { x , y , y , x } = { 0 } for any x [ e i ] , y [ e j ] . From here, it follows that U i , U j = U j , U i = 0 for any i j . That is, V = i I U i .
Assuming now that P U j f ( U i ) { 0 } for i j , where P U j : V U j is the projection of V onto U j . Then, there exist e [ e i ] and e [ v j ] , such that P U j ( f ( e ) ) = λ e + u with λ F { 0 } and u e e [ e j ] F e U j . As λ 0 , we have ( e , e ) E , and therefore, e e , i.e. [ e ] = [ e ] . As [ e i ] = [ e ] and [ e j ] = [ e ] , we have [ e i ] = [ e j ] , and so, U i = U j , which is a contradiction. Thus, P i j U j f ( U i ) = 0 , and we conclude that f ( U i ) U i . Consequently, each linear subspace U i of V admits a basis B [ i ] inherited from B .
As V = i I U i , for each i I we define the linear operator f i : V V as f i ( U i ) : = f ( U i ) and f i ( i j U j ) : = { 0 } , so f = i I f i .
Now, let us show that each U i is f i -indecomposable with respect to B [ i ] . We assume that
U i = U 1 U 2 ,
where U 1 and U 2 are non-zero linear subspaces of U i admitting the f i -basis B 1 : = { e j : j J } and B 2 : = { e k : k K } , inherited from B [ i ] , respectively. That is,
B [ i ] = B 1 ˙ B 2 .
Fix some e j B 1 and e k B 2 . As e j is connected to e k , there exists an undirected path
( e j , v i 2 , , v i n 1 , e k )
from e j to e k . From here, there are e = v i s B 1 and e = v i s + 1 B 2 , such that either ( e , e ) E or ( e , e ) E . As e , e = e , e = 0 , we have either P F e ( f i ( e ) ) 0 or P F e ( f i ( e ) ) 0 . Therefore, we have either f i ( U 1 ) U 1 or f i ( U 2 ) U 2 . In both cases, it is a contradiction and the proof is completed. □
Example 7. 
Let V , the 6-dimensional F -vector space with basis B : = { e 1 , e 2 , , e 6 } , and bilinear form be defined as
e 1 , e 2 : = α , e 5 , e 6 : = β ,
and the rest zero, with α , β F { 0 } . We consider the linear operator f : V V , given as
f ( e 1 ) : = α e 1 , f ( e 3 ) : = β e 2 , f ( e 4 ) : = β e 4 , f ( e 5 ) : = α e 5 + α e 6 ,
and zero on the rest, with α , β being the same previous scalars. By denoting U 1 , U 2 , and U 3 as the linear subspaces of V with bases B [ 1 ] : = { e 1 , e 2 , e 3 } , B [ 2 ] : = { e 4 } , B [ 3 ] : = { e 5 , e 6 } , respectively, we have V being f-decomposable with respect to B , as
V = U 1 U 2 U 3 .
The associated graph Γ ( f , B ) is:
Mathematics 11 00725 i005
Moreover, for i { 1 , 2 , 3 } , we define f i : V V as f 1 ( e 1 ) : = α e 1 , f 1 ( e 3 ) : = β e 2 , f 2 ( e 4 ) : = β e 4 , f 3 ( e 5 ) : = α e 5 + α e 6 , and zero on the rest ( α , β being the same previous non-zero scalars). We show that
f = f 1 + f 2 + f 3
satisfies the condition of Theorem 2, and then U i is f i -indecomposable with respect to B [ i ] , for i { 1 , 2 , 3 } . Clearly, V is f-decomposable with respect to B .
To identify the components of the decomposition given in Theorem 2, we only need to focus on the connected components of the associated graph.

4. Relating the Graphs Given by Different Choices of Bases

In general, for a linear operator f : V V in a pre-Euclidean space ( V , · , · ) , two different bases of V determine associated graphs to be not isomorphic, which can give rise to a different decomposition of f, as in Theorem 2. We recall that two graphs, ( V , E ) and ( V , E ) , are isomorphic if there exists a bijection ϕ : V V , such that ( v i , v j ) E if and only if ( ϕ ( v i ) , ϕ ( v j ) ) E . This is shown in the next example.
Example 8. 
For the linear operator and pre-Euclidean space of Example 3, if we consider w 1 : = v 1 + v 2 , w 2 : = v 1 v 2 , w 3 : = v 4 + v 5 , w 4 : = v 4 v 5 , and w 5 : = v 3 for the basis B : = { w 1 , w 2 , w 3 , w 4 , w 5 } , we get
w 1 , w 3 = w 1 , w 4 = w 2 , w 3 = w 2 , w 4 = w 3 , w 5 = w 4 , w 5 = 1 ,
w 3 , w 1 = w 3 , w 2 = w 4 , w 1 = w 4 , w 2 = w 5 , w 3 = w 5 , w 4 = 3 ,
and also,
f ( w 1 ) = 4 w 1 + 2 w 5 , f ( w 3 ) = f ( w 4 ) = 1 2 w 3 + 1 2 w 4 , f ( w 5 ) = 2 w 1 + w 5 .
Thus, we obtain the associated graph Γ ( f , B ) : Mathematics 11 00725 i006
Clearly, Γ ( f , B ) is not isomorphic to the associated graph Γ ( f , B ) , as stated in Example 3.
Next, we give a condition under which the graphs associated to a linear operator f : V V in a pre-Euclidean space ( V , · , · ) , performed by two different bases, are isomorphic. As a consequence, we establish a sufficient condition under which two decompositions of f, induced by two different bases, are equivalent.
Definition 6. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) . Two bases, B = { v i } i I and B = { w i } i I of V , are f-equivalent if there exists an automorphism ϕ : V V satisfying ϕ ( B ) = B and ϕ f = f ϕ .
Lemma 1. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) with the basis B = { e i } i I . Consider the two bases B and B of V . If B and B are f-equivalent bases, then the associated graphs Γ ( f , B ) and Γ ( f , B ) are isomorphic.
Proof. 
Let us suppose that B = { v i } i I and B = { w i } i I are two f-equivalent bases of V . Then, there exists an automorphism ϕ : V V satisfying f ϕ = ϕ f and
x , y = ϕ ( x ) , ϕ ( y )
for x , y V , in such a way that for every v i B , there exists a unique w j i B verifying ϕ ( v i ) = w j i .
Let us denote by ( V , E ) and ( V , E ) the set of vertices and edges of Γ ( f , B ) and Γ ( f , B ) , respectively. Taking into account that V = B and V = B , and the fact ϕ ( B ) = B , we have that ϕ defines a bijection from V to V . Given v i , v k V , we want to show that ( v i , v k ) E if and only if ( ϕ ( v i ) , ϕ ( v k ) ) = ( w j i , w j k ) E . Supposing that ( v i , v k ) E , either { v i , v k , v k , v i } { 0 } or f ( v i ) = k λ k v k   for   some   0 λ k F . If { v i , v k , v k , v i } { 0 } , then by Equation (4), we have { w j i , w j k , w j k , w j i } { 0 } . If f ( v i ) = k λ k v k   for   some   0 λ k F , applying ϕ to this relation, we would find that f ( w j i ) = f ( ϕ ( v i ) ) = ϕ ( f ( v i ) ) = ϕ ( k λ k v k ) = k λ k ϕ ( v k ) = k λ k w j k   for   some   0 λ k F . Thus, ( w j i , w j k ) E . The same argument using ϕ 1 shows that if ( w j i , w j k ) E , then ( v i , v k ) E , because ϕ 1 f = f ϕ 1 . This fact concludes the proof that Γ ( f , B ) and Γ ( f , B ) are isomorphic via ϕ . □
The following concept is borrowed from the theory of graded algebras (see [23] for examples).
Definition 7. 
Let ( V , · , · ) be a pre-Euclidean space and let
Υ : = V = i I V i and Υ : = V = j J V j
be two decompositions of V as the orthogonal direct sums of linear subspaces. It is said that Υ and Υ  are equivalent if there exists an automorphism ϕ : V V , and a bijection σ : I J , such that ϕ ( V i ) = V σ ( i ) for all i I .
Theorem 3. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) . Then, for the two bases B : = { v i } i I and B : = { v j } j J of V , consider the following assertions:
i.
The bases B and B are f-equivalent.
ii.
The graphs Γ ( f , B ) and Γ ( f , B ) are isomorphic.
iii.
The decomposition of the linear operator f : V V with respect to B is
Υ : = V = [ v i ] V / V C [ v i ] ,
given by
f = i I f i ,
with f i | V C [ v i ] = f | V C [ v i ] , f i ( V C [ v i ] ) V C [ v i ] , f i ( i k V C [ v k ] ) = 0 , and the decomposition of f with respect to B being
Υ : = V = [ v j ] V / V C [ v j ] ,
performed by
f = j J f j
with f j | V C [ v j ] = f | V C [ v j ] , f j ( V C [ v j ] ) V C [ v j ] , f j ( i k V C [ v k ] ) = 0 , are equivalent.
Then, i. implies ii. and iii.
Proof. 
The implication from i. to ii. was shown in Lemma 1. Let us prove the implication from i. to iii. Suppose that ϕ : V V is an automorphism satisfying ϕ ( B ) = B and ϕ f = f ϕ . By the implication from i. to ii., we know that Γ ( f , B ) and Γ ( f , B ) are isomorphic via ϕ , and thus ϕ ( [ v ] ) = [ ϕ ( v ) ] for all v V = B . It follows that ϕ ( V C [ v ] ) = V C [ ϕ ( v ) ] for all [ v ] V / , which proves that the decomposition of V corresponding to B and B are equivalent. □
Remark 1. 
In general, the implication of ii. to i. of Theorem 3 (as well the converse of Lemma 1) is not valid. That is, the fact that the graphs associated with the two bases are isomorphic does not imply that these two bases are f-equivalent. Let V be a pre-Euclidean space with the basis B : = { v 1 , v 2 , v 3 } , endowed with a bilinear form defined as
v 1 , v 1 = v 2 , v 2 = v 3 , v 3 = v 1 , v 2 : = 1
and zero on the rest. By denoting w 1 : = v 1 + v 2 , w 2 : = v 1 v 2 , and w 3 : = v 3 , we consider the basis B : = { w 1 , w 2 , w 3 } ; thus, we obtain
w 1 , w 1 = 3 , w 2 , w 2 = w 3 , w 3 = w 2 , w 1 = 1 , w 1 , w 2 = 1 .
Therefore, for a zero linear operator f, the associated graphs Γ ( f , B ) and Γ ( f , B ) are isomorphic:
Mathematics 11 00725 i007
However, B and B are not f-equivalent. Indeed, if there exists an isomorphism ϕ : V V , such that ϕ ( B ) = B , we get, for instance,
ϕ ( v 1 ) : = w 1 , ϕ ( v 2 ) : = w 3 , ϕ ( v 3 ) : = w 2 ,
but 0 = v 1 , v 3 ϕ ( v 1 ) , ϕ ( v 3 ) = w 1 , w 2 = 1 .

5. Characterization of the Minimality and Weak Symmetry

Let ( V , E ) be a graph. Given v i , v j V , we say that a directed path from v i to v j is a sequence of vertices ( v i 1 , , v i n ) satisfying v i 1 = v i and v i n = v j , such that ( v i r , v i r + 1 ) E , for 1 r n 1 . We also say that ( V , E ) is symmetric if ( v i , v j ) E for all ( v j , v i ) E . Thus, we present the next (weaker) concept in the following section.
Definition 8. 
A graph ( V , E )  is weakly symmetric if, for any  ( e j , e i ) E , there exists a directed path from e i to e j .
Of course, every symmetric graph is weakly symmetric.
Example 9. 
The following graphs are weakly symmetric: Mathematics 11 00725 i008
Definition 9. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) with a basis B . We say that V is minimal if the unique pre-Euclidean subspaces U admit an inherited basis from B , such that f ( U ) U are { 0 } , V .
Theorem 4. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) with the basis B = { e i } i I . If V is minimal, then the associated graph Γ ( f , B ) of f relative to B is weakly symmetric.
Proof. 
If V is minimal, we know that V is the unique non-zero pre-Euclidean subspace that satisfies f ( V ) V . Let Γ ( f , B ) : = ( V , E ) be the associated graph and take some ( e i , e j ) E . Therefore, either e i , e j 0 or e j , e i 0 or f ( e i ) = j λ j e j for some 0 λ j F . The first two cases imply ( e j , e i ) E . In the last case, we have f 0 . Let us now define
B j : = { e k B : e k = e j   or   there   exists   a   directed   path   from   e j   to   e k } .
As e j B j , we have B j . Thus, let U be the space spanned by B j . Let e t B j and f ( e t ) = m λ m e m . If λ m 0 , we get ( e t , e m ) E , and hence, there exists a directed path from e j to e m :
Mathematics 11 00725 i009
Thus, it implies e m B j , and therefore, f ( U ) U . As B j and V is minimal, we have U = V , so we conclude B j = B and e i B j . Thus, there exists a directed path from e j to e i , as required. □
Corollary 2. 
Let f : V V be a linear operator in a pre-Euclidean space ( V , · , · ) with the basis B = { e i } i I . If V is minimal, then the associated graph Γ ( f , B ) of f relative to B is connected.
Proof. 
This is an immediate consequence of Corollary 1 and Theorems 1 and 2. □
Remark 2. 
In general, the converse of the previous results are not valid. As a counterexample, let ( V , · , · ) be the pre-Euclidean space over R , with the basis B : = { e 1 , e 2 , e 3 , e 4 } and a bilinear form, given as
e 1 , e 2 = e 2 , e 3 = e 3 , e 4 = e 4 , e 1 : = 1 .
Let f : V V be the linear operator, defined as f ( e i ) : = e i for i { 1 , 2 , 3 , 4 } . Then, V is not minimal, as, for instance, the pre-Euclidean subspace U with inherited basis { e 1 } from B satisfies f ( U ) U . However, the associated graph Γ ( f , B ) is clearly connected and weakly symmetric: Mathematics 11 00725 i010

6. Conclusions

We were motivated by the following situation: If we consider a family of linear operators
{ f i : V i V i } i I ,
where any V i is a pre-Euclidean space, we can then naturally construct a new linear operator
f : i I V i i I V i
as f = i I f i , where V : = i I V i is the pre-Euclidean space defined by componentwise operations.
In this paper, our purpose was to study the converse problem, and we gave a positive answer by proving in Theorem 2 that, given a linear operator f : V V in a pre-Euclidean space, it is possible to find a family of pre-Euclidean spaces { V i } i I , and a family of linear operators { f i : V i V i } i I in such a way that V = i I V i and f = i I f i . In order to approach our question, we used the technique of graphs. This allowed us to obtain the above decomposition of the pre-Euclidean space V and linear operator f in a very practical way, by simply looking at the graph Γ ( F , B ) associated to f (and a fixed basis B ). In addition, the minimality of our structure was characterized in Theorem 4, which states that, for a linear operator f : V V in a minimal pre-Euclidean space ( V , · , · ) (with the basis B = { e i } i I ), then the associated graph Γ ( f , B ) to f relative to B is weakly symmetric.
Finally, we would like to note that future research on this topic should work to generalize this result for different classes of operators (not necessarily linear operators) and consider operators on structures different from pre-Euclidean spaces (for instance, Banach spaces).

Author Contributions

All authors have contributed in the: conceptualization; methodology; validation; formal analysis; investigation; writing—original draft preparation; writing—review and editing; supervision; project administration and funding acquisition. All authors have read and agreed to the published version of the manuscript.

Funding

The second author was supported by the Centre for Mathematics from the University of Coimbra—UIDB/00324/2020, funded by the Portuguese Government through FCT/MCTES. The third and fourth authors were supported by the PCI of the UCA ‘Teoría de Lie y Teoría de Espacios de Banach’ and by the PAI, with project number FQM298. The third author was also supported by the project FEDER-UCA18-107643, and by the Spanish project ‘Algebras no conmutativas y de caminos de Leavitt. Algebras de evolución. Estructuras de Lie y variedades de Einstein’.

Data Availability Statement

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

Acknowledgments

The authors would like to thank the reviewers for the comments and suggestions that helped to improve the work.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Barreiro, E.; Calderón, A.J.; Lopes, S.A.; Sánchez, J.M. Leibniz algebras and graphs. Linear Multilinear Algebra 2022. [Google Scholar] [CrossRef]
  2. Calderón, A.J.; Navarro, F.J. Bilinear maps and graphs. Discrete Appl. Math. 2019, 263, 69–78. [Google Scholar]
  3. Morales, J.V.S.; Palma, T.M. On quantum adjacency algebras of Doob graphs and their irreducible modules. J. Algebraic Combin. 2021, 54, 979–998. [Google Scholar] [CrossRef]
  4. Qaralleh, I.; Mukhamedov, F. Volterra evolution algebras and their graphs. Linear Multilinear Algebra 2021, 69, 2228–2244. [Google Scholar] [CrossRef]
  5. Zhilina, S. Orthogonality graphs of real Cayley-Dickson algebras. Part I: Doubly alternative zero divisors and their hexagons. Internat. J. Algebra Comput. 2021, 31, 663–689. [Google Scholar] [CrossRef]
  6. Ambrozie, C.; Bračič, J.; Kuzma, B.; Müller, V. The commuting graph of bounded linear operators on a Hilbert space. J. Funct. Anal. 2013, 264, 1068–1087. [Google Scholar] [CrossRef]
  7. Bailey, S.; Beasley, L.B. Linear operators on graphs which preserve the dot-product dimension. J. Combin. Math. Combin. Comput. 2016, 98, 31–42. [Google Scholar]
  8. Beasley, L.B. Linear operators on graphs: Genus preservers. Congr. Numer. 2018, 231, 5–13. [Google Scholar]
  9. Beasley, L.B.; Brown, D.E. Linear operators on graphs that preserve the clique cover number. Congr. Numer. 2015, 225, 83–94. [Google Scholar]
  10. Beasley, L.B.; Pullman, N.J. Linear operators preserving properties of graphs. Congr. Numer. 1990, 70, 105–112. [Google Scholar]
  11. Garber, A.I. Graphs of linear operators. Proc. Steklov Inst. Math. 2008, 263, 57–64. (In Russian) [Google Scholar] [CrossRef]
  12. Zeng, S.B.; Cao, J.L. Closed graph properties of set-valued linear operators. J. Tianjin Univ. 1994, 27, 799–803. (In Chinese) [Google Scholar]
  13. Yang, F.; Sun, Q.; Zhang, C. Semisymmetric Graphs Defined by Finite-Dimensional Generalized Kac–Moody Algebras. Bull. Malays. Math. Sci. Soc. 2022, 45, 3293–3305. [Google Scholar] [CrossRef]
  14. Belishev, M.I.; Kaplun, A.V. Canonical representation of the C*-algebra of eikonals related to the metric graph. Izv. Ross. Akad. Nauk Ser. Mat. 2022, 86, 3–50. (In Russian) [Google Scholar]
  15. Chhiti, M.; Kaiba, K. The total graph of amalgamated algebras. Indian J. Math. 2022, 64, 245–261. [Google Scholar]
  16. Christoffersen, N.J.; Dutkay, D.E. Representations of Cuntz algebras associated to random walks on graphs. J. Oper. Theory 2022, 88, 139–170. [Google Scholar] [CrossRef]
  17. Matsumoto, K. On simplicity of the C*-algebras associated with λ-graph systems. J. Math. Anal. Appl. 2022, 515, 126441. [Google Scholar] [CrossRef]
  18. Myers, T. Constructing Clifford algebras for windmill and dutch windmill graphs; a new proof of the friendship theorem. In Combinatorics, Graph Theory and Computing; Springer Proceedings in Mathematics & Statistics; Springer: Cham, Switzerland, 2022; Volume 388, pp. 47–81. [Google Scholar]
  19. Ramos, E. The graph minor theorem meets algebra. Notices Amer. Math. Soc. 2022, 69, 1297–1305. [Google Scholar] [CrossRef]
  20. Rastgar, Z.; Khashyarmanesh, K.; Afkhami, M. On the comaximal (ideal) graph associated with amalgamated algebra. Discrete Math. Lett. 2023, 11, 38–45. [Google Scholar]
  21. Reis, T.; Cadavid, P. Derivations of evolution algebras associated to graphs over a field of any characteristic. Linear Multilinear Algebra 2022, 70, 2884–2897. [Google Scholar] [CrossRef]
  22. Larson, D.M. Connectedness of graphs arising from the dual Steenrod algebra. J. Homotopy Relat. Struct. 2022, 17, 145–161. [Google Scholar] [CrossRef]
  23. Elduque, A.; Kochetov, M. Gradings on Simple Lie Algebras; Mathematical Surveys and Monographs, 189; American Mathematical Society: Providence, RI, USA; Atlantic Association for Research in the Mathematical Sciences (AARMS): Halifax, NS, USA, 2013. [Google Scholar]
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

Abdelwahab, H.; Barreiro, E.; Calderón, A.J.; Sánchez, J.M. Decomposition of Linear Operators on Pre-Euclidean Spaces by Means of Graphs. Mathematics 2023, 11, 725. https://doi.org/10.3390/math11030725

AMA Style

Abdelwahab H, Barreiro E, Calderón AJ, Sánchez JM. Decomposition of Linear Operators on Pre-Euclidean Spaces by Means of Graphs. Mathematics. 2023; 11(3):725. https://doi.org/10.3390/math11030725

Chicago/Turabian Style

Abdelwahab, Hani, Elisabete Barreiro, Antonio J. Calderón, and José M. Sánchez. 2023. "Decomposition of Linear Operators on Pre-Euclidean Spaces by Means of Graphs" Mathematics 11, no. 3: 725. https://doi.org/10.3390/math11030725

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