1. Introduction and Previous Definitions
We recall that an algebra
A over a base field
is just a linear space
A endowed with a bilinear map
called the product of
A.
A subalgebra of A is a linear subspace B of A such that for any .
A morphism of algebras is a linear map
such that
for any
.
The category of based algebras with bilinear forms, denoted by
has as objects the triplets
where
A is an arbitrary
-algebra,
a fixed basis of
A, and
a bilinear form.
Two objects
and
are fixed in
. The morphisms from
to
are the set of algebra morphisms
such that
and
for any
.
A subalgebra of a based algebra with a bilinear form is an object of such that B is a subalgebra of A, , and An ideal of is a subalgebra such that We will write only I when there is no possible confusion.
Given a based algebra with a bilinear form
, it is said that
are orthogonal if
Two non-empty subsets
are also called orthogonal if
that is, if
for any
and
.
The aim of this paper is to show that any based algebra with a bilinear form
decomposes as
where any
is an ideal of
A;
and
are orthogonal for any
with
; any ideal in the above decomposition is irreducible, in the sense that any
cannot be expressed as the direct sum
with
P and
Q as orthogonal nonzero ideals of
.
We are inspired by some ideas in [
1,
2,
3]. Indeed, the results in these references are consequences of those in the present paper, since the classes of algebras considered in [
1,
2,
3] are subclasses of the one considered in this work.
The above ideas follow connection techniques on the set
. We note that these techniques were introduced in [
4] for the study of the structure of split Lie algebras and have been developed and applied in many contexts (see for instance [
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15]).
Given a based algebra with a bilinear form
, we are going to associate it with a directed graph. We will show how it is possible to recover the decomposition given in Equation (
1) by looking at this graph. Hence, the strong connection between the theory of based algebra with bilinear forms and the graph theory is shown.
An important class of based algebras is those formed by the algebras with multiplicative bases (see for instance [
1,
16,
17]). These are algebras
A admitting a linear basis
such that either
or
with
and
There are many examples of algebras with a multiplicative basis. For instance, full matrix algebras, group-algebras, quiver algebras when
is algebraically closed, finite-dimensional associative algebras of the finite representation type, semisimple finite-dimensional Lie algebras over algebraically closed fields of characteristic 0, semisimple locally finite split Lie algebras, and Heisenberg algebras.
If we center on the real algebras
,
,
(quaternions) and
(octonions), these are algebras with multiplicative bases
that also admit a canonical non-degenerate bilinear product
, for
Hence,
are examples of based algebras with bilinear forms. Here we note that these examples are fundamental in the theory of absolute valued algebras. Indeed any finite dimensional (real) absolute valued algebra can be constructed from one of these four based algebras with bilinear forms (see for instance [
18,
19,
20]).
2. Main Results
In this section
denotes a based algebra with a bilinear form. We will call it
A for short if there is not any possible confusion.
For any
, we can consider the projection map
given by
for any
, where
is the (unique) expression of
x with respect to the basis
.
We also consider a copy of
, denoted by
where its elements are denoted by
for any
. That is,
We will also denote
, by
, the power set of
, and by
, the group of permutation of two elements
.
Now we define the maps
and
as follows:
as
for any
; and
for any
and
as
for any
; and
for any
and
Now we introduce the map
as
for any
and
Definition 1. Let and be a couple of elements in . We say that is connected to if either , or there is a sequence, with any , such that - 1.
- 2.
- 3.
The sequence is called a connection from to .
We have introduced a relation in that will be denoted by R. That is, if and only if is connected to .
Lemma 1. The relation R in is symmetric.
Proof. We begin by observing that
for any
and
.
To show this fact, we have to distinguish two cases:
If
, since
implies
or
we obtain in both cases that
Where
, we have
gives us either
or
In both possibilities we obtain
, as desired.
We also have the fact
for any
and
.
To verify it, we have (as above) to distinguish two cases:
In the first one, , while in the second one,
In the case
, since
, we obtain
and
or
. In both cases,
In the case
, as
, we deduce
and
From here,
From Equations (
2) and (
3), we can assert that
for any
and
. Indeed,
gives us either
or
. In the first case, Equation (
2) shows
, while Equation (
3) allows us to assert in the second case that
Hence,
in any case. The same argument proves the converse.
Suppose now that
is a connection from
to
, with
,
and
for
.
We are going to prove that the sequence
is a connection from
to
:
By applying Equation (
4) to Equations (
8)–(
5), in this order, we obtain
From here we have that the sequence
is a connection from
to
, as desired. Consequently, the relation
R is symmetric. □
Proposition 1. The relation R in is an equivalence relation.
Proof. By Definition 1, the relation R is reflexive, and by Lemma 1, R is symmetric.
From here, we just have to verify the transitivity character of
R. To do that, take
such that
and
. In the case
or
, it is clear that
. Therefore, suppose
and
. Hence, there are
a connection from
to
, and
a connection from
to
. It is easy to verify that the sequence
is a connection from
to
Hence,
R is transitive. □
By the above Proposition, we can introduce the quotient set
where
is the set of elements in
, which are connected to
.
Now, we can associate with any
the linear subspace
Observe that
admits as a linear basis to
and that we can take the bilinear form
We will consider the triplet
which will be denoted, for short, as
Lemma 2. Any , , is an ideal of
Proof. First, observe that when . Indeed, in the case , there would be and such that . From here, there is an such that . Hence, is a connection from to . Then is a contradiction.
Second, we have that for any . Indeed, in the case for some , if we write with any and any we have that for any . From here, is a connection from to any for each . We obtain that any , so , as desired.
From the above, any is an ideal of A. □
Theorem 1. Any based algebra with a bilinear form decomposes as the orthogonal direct sum of the family of irreducible ideals , . That iswithwhen Proof. The fact that
A is the direct sum of the family of ideals
is a consequence of Equations (
9) and (
10) and Lemma 2.
The orthogonality of two different ideals above can be seen as follows:
Suppose there is an
and
such that
. Then,
so
is a connection from
to
. From here,
a contradiction.
Let us now show that any
is irreducible. Suppose there is a decomposition
where
and
are orthogonal nonzero ideals of
. Observe that necessarily
is the disjoint union
If we choose and , taking into account the orthogonality of I and J, we can take a connection from to with any in such a way that we have one of the following:
(1)
. Then
and
or
and
. Equation (
12) means that, in the first case, any
,
and that
,
in the second case.
(2)
. Then Equation (
12) shows again that
Observe that, in any case, We also have as a consequence of the fact that, in the case , or and that when .
By iterating this argument with the above connection
we conclude that
, a contradiction. Hence,
is irreducible. □
One of the most interesting facts concerning Theorem 1 is that no identity is required for the product of the algebra. That is, Theorem 1 not only holds for commutative, associative, Lie, Jordan, Leibniz, etc. algebras, but also for algebras which do not belong to any class of algebra (defined by identities, or by another property as evolution algebras).
We are going to present two examples. The first one shows an application of Theorem 1 to a totally arbitrary based algebra with a bilinear form (in the sense of the previous paragraph), while the second one is focused on the role that the bilinear form plays in the construction developed in Theorem 1:
Example 1. Let the 13-dimensional real algebra A with linear basisand non-zero products among the elements of given bywhere the remaining products among elements of are zero. The algebra A is neither commutative, nor associative, nor Lie, nor Jordan.
In A, we consider the bilinear formdefined bythe remaining products, (through β), among elements of the bases being zero. Then is a based algebra with a bilinear form.
If we introduce the equivalence relation R on , (see Definition 1), we obtain the quotient set:whereand Theorem 1 allows us to assert that the based algebra with a bilinear form A decomposes aswhere any , , is an ideal of A with basis and wherewhen Example 2. Let the 7-dimensional real algebra A with basisand non-zero products among the elements of given bywhere the remaining products among elements of are zero. In A, we consider the bilinear formdefined bythe remaining products, (through β), among elements of the bases being zero. Then is a based algebra with a bilinear form.
If we introduce the equivalence relation R on , (see Definition 1), we obtain the quotient set:whereandBy Theorem 1, we obtain that the based algebra with a bilinear form A decomposes aswith each , , an ideal of A with basis and wherewhen 3. Interaction with Graph Theory
In this section, we are going to associate a directed graph with any based algebra with a bilinear form , in such a way that the decomposition obtained in Theorem 1 can be easily recovered from this graph.
First, we recall that a (directed) graph is a pair where V is a (non-empty) set of vertices and a set of (directed) edges connecting the vertices. In the case , we say that is an edge from to .
Definition 2. Let be a based algebra with a bilinear form. The (directed) graph associated with iswhere and Example 3. For the based algebra with a bilinear form of Example 1, its associated graph is represented in
Figure 1.
Example 4. For the based algebra with a bilinear form of Example 2, its associated graph is represented in
Figure 2.
We are going to provide an interpretation of the decomposition of a based algebra with a bilinear form given in Theorem 1, taking into account the above graph associated with .
First we recall (see for instance [
1]) that, given two vertices
of a directed graph
, an
undirected path from
to
is an ordered family of vertices
with
,
, and such that either
or
, for
.
A subset of vertices is said to be connected if either C is just formed by one vertex or there is an undirected path from to for any .
A subgraph which is maximal with respect to the property of having all of its vertices connected is called a connected component of the graph.
Theorem 2. Let be a based algebra with a bilinear form and considerits decomposition as an orthogonal direct sum of ideals given in Theorem 1. Let the associated (directed) graph corresponding to . The following assertions hold: - 1.
For each there is only one connected component in such that the set of vertices in is
- 2.
For any connected component , there is only one ideal in the decomposition given by Equation (13) such that
Proof. (1). Fix some
. For any
with
, we have that
(see Definition 1), so there is a connection
, from
to
.
In the case either or . Suppose with , and . Then there is an edge from to in , for any . In the case we can argue in a similar way.
In the case there is an such that either with or with . In any case, there is an edge from to in That is, either there is an edge or an edge
Observe that, by iterating this process along the connection given by Equation (
14), we obtain that
belongs to the same connected component of
as
.
Suppose now there is an
that belongs to this connected component
C. Since
and
are in
C, there is an undirected path
with
,
, such that either
or
, for
. Let us show that
is connected to
by constructing a connection form
to
.
In the case
, we begin our connection with the pair
, while in the case
, we will consider the pair
. By looking now at
in Equation (
15), we can consider as above the triplet
or
or
or
. By iterating this process with Equation (
15), we can construct a connection form
to
. Hence, the connected component of
containing
has as set of vertices
.
Finally, since the set of connected components of a graph is a partition on it. This is unique.
(2). Given any connected component of , by taking any we can apply Item (1) to obtain that satisfies that , being also unique. □
Theorem 2 allows us to assert that we only have to look at the graph associated with a based algebra with a bilinear form to find its decomposition as a direct sum of orthogonal ideals. This decomposition will be the one given by the connected component of the graph. We illustrate this fact in the next examples:
Example 5. If we look at the based algebra with a bilinear form in Example 1, on the one hand, we have the decomposition as a direct sum of orthogonal ideals (see Example 1):
where
and
On the other hand, the graph associated with this based algebra with a bilinear form has five connected components (see Example 3), each one corresponding with only one of the five ideals in the decomposition given by Equation (
16).
Example 6. Consider the based algebra with a bilinear form in Example 2. First, we have the decomposition as a direct sum of orthogonal ideals (see Example 2):
with
and
Second, the graph associated with this based algebra with a bilinear form has three connected components (see Example 4). Observe that each one is associated with only one of the three ideals in the decomposition given by Equation (
17).