1. Introduction
In the theory of non-associative algebras, several classes, such as baric, evolution, Bernstein, train, stochastic, etc. algebras, are located in the intersection of abstract algebra and biology [
1,
2,
3]. The study of these algebras has addressed several problems in population genetics theory [
3]. We emphasize that the origin of population genetics problems first appeared in the work of Bernstein [
4], where evolution operators describing genetic algebras were explored (see [
3,
5,
6]). On the other hand, Tian [
7,
8,
9] introduced different types of evolution algebras that have a dynamic nature. These kinds of algebras are non-associative (see [
10]). Later on, evolution algebras appeared in several genetic law models [
10,
11,
12,
13,
14,
15]. Moreover, relations between evolution algebras and other branches of mathematics have studied in many papers (see, for example, [
16,
17,
18,
19,
20,
21]).
From the definition of evolution algebra, one can canonically associate weighted digraphs, which identify the algebra. Hence, algebraic tools are used to investigate certain features of digraphs [
8,
22,
23]. In most investigations, evolution algebras were taken as nilpotent [
22,
24,
25,
26,
27,
28,
29,
30]. A few papers have been devoted to non-nilpotent evolution algebras [
31,
32,
33]. Therefore, in [
34], the exploration of Volterra evolution algebras was initiated; these are related to genetic Volterra algebras [
35]. Furthermore, in [
36], we studied
S-evolution algebras which are more general than Volterra ones. In the mentioned paper, solvability, simplicity, semisimlicity, and the structure of enveloping algebras using the attached graph were carried out. In [
37], we introduced an entropy of Markov evolution algebras, allowing us to treat their isomorphism with entropy. The reader is referred to [
38] for a review on the recent development of evolution algebras.
Remarkably, a subalgebra and an ideal of a population’s genetic algebra can be understood as a subpopulation and a dominating subpopulation concerning mating. On the other hand, to understand the structure of subalgebras, it is essential to explore idempotent elements of evolution algebras. In general, the existence of idempotent elements for a given evolution algebra is an open problem [
39]. Therefore, in the present paper, we first studied some evolution algebras that have idempotent elements. Furthermore, the extendibility of subalgebras generated by idempotent elements of some
S-evolution algebras was investigated. Consequently, the question of the extendibility of isomorphism was also established. One of the main aims of present paper was to construct algebras with idempotent elements and study when these kinds of algebras become evolution algebras; this construction allows the production of evolution algebras that have an idempotent element while, in general, this kind of evolution algebra may not exist (see [
39]). Our research provides an advantage in studying evolution algebras by addressing the challenging task of their classification. Rather than approaching the classification problem directly, we focused on the isomorphism of subalgebras generated by idempotents. This approach simplifies the classification process by leveraging the isomorphism of subalgebras as a means to understand the isomorphism of the entire algebra. By examining the isomorphism of subalgebras, we gained insights into the overall structure and properties of the algebra, making the classification task more manageable and efficient.
The current paper is organized as follows.
Section 2 provides some basic properties of
S-evolution algebras.
Section 3 deals with idempotent elements of some
S-evolution algebras. Furthermore, the extendibility of subalgebras generated by those idempotent elements was examined. In
Section 4, we construct low dimensional algebras whose basis is idempotent elements and investigate their evolution algebraic structure. Here, we stress that the obtained algebras do not belong to the
S-evolution algebra class. Furthermore, it is not solvable and not nilpotent. Finally,
Section 5 is devoted to the specific properties of the tensor product of
S-evolution algebras.
2. -Evolution Algebras
Assume that is a vector space over a field equipped with binary operation · and a basis . A triple is called an evolution algebra if The collection B is referred to as a natural basis. Moreover, the corresponding matrix is called a structural matrix of , with respect to B.
From the definition of evolution algebra, one infers that it is commutative. Moreover, one has . In what follows, unless otherwise stated, the field is assumed to be algebraically closed with zero characteristic.
We recall that [
36] a matrix
is said to be
S-matrix if
- (i)
for every ;
- (ii)
if and only if ().
An evolution algebra
is called an
S-evolution algebra if its structural matrix is an
S-matrix. If a structural matrix is skew-symmetric, then the corresponding evolution algebra is called
Lotka–Volterra (or Volterra) evolution algebra [
34,
40]. One can see that any Lotka–Volterra algebras form a class of
S-evolution algebras. This was one of the motivation behind introducing
S-evolution algebras [
36].
By
and
(here
n is even), we will denote the set of all
S-evolution algebras whose structural matrices have the following form, respectively:
where
,
for all
.
Theorem 1. Let and belong to Then, if and only ifhere, such that if then andwhere . Proof. Assume that the mapping
is an isomorphism, then
For any
one has
Due to
for all
and
are linearly independent, we infer that
Let
. Then,
Hence,
Let us consider
and
. Then,
On the other hand,
Comparing the equations of systems (
7) and (
8), one finds
Solving the system (
9) for
one gets
The solutions of (
10) are
and
where
,
and
C are given by (
3)–(
5).
Conversely, the isomorphism between
and
can be performed by the following change of basis
This completes the proof. □
3. Idempotents of -Evolution Algebras
In this section, we describe the set of all idempotent elements of algebras belonging to Recall that an element is called idempotent if .
Theorem 2. Let belong to Then, the idempotent elements of have the following form:where Proof. To find the idempotent, we have to solve
let
; then, one can rewrite
p as follows:
Consider
Comparing the last two equations, we have the following system:
Solving this system, we have the following cubic equation,
Then, one can easily find
, where
where, as before,
Hence,
where
□
Remark 1. We emphasize that, for each and any choice of in the expressionone can get the idempotent element. The following corollary describes the idempotent elements of an
S-evolution algebra whose structural matrix is given as a one block matrix in (
1).
Corollary 1. Let be an S-evolution algebra whose structural matrix is one of the block matrix in (1) say Then the idempotent elements of are as follows:where, as before, , The proof of the corollary can be readily deduced from Theorem (2) and Remark (1).
Remark 2. Here, we stress the following points:
- (i)
The idempotents and ) are orthogonal, i.e., for any ;
- (ii)
For each any pair of is linearly independent;
- (iii)
For each , the set is linearly dependent;
- (iv)
Each set , , itself consists of linearly independent elements.
Let us consider a subalgebra generated by those orthogonal idempotent elements of evolution algebra
To define it, let us pick a collection
. Now, define
Here,
is an idempotent element corresponding to the block matrix
i in (
1). We note that from each block we take only one idempotent element. Furthermore, the number of subalgebras that can be constructed as in (
11) equal
However, the following proposition shows that any different choice of such subalgebras is isomorphic.
Proposition 1. Let , be two different collections. Assume that and are the corresponding subalgebras defined by (11). Then, The proof is straightforward. Hence, it is omitted.
Due to Proposition 1, in what follows, we will consider the following subalgebra:
where
Theorem 3. Let such that and Assume that and are two subalgebras of and defined by (
12)
, respectively. Then, any isomorphism from into can be extended to an isomorphism between and Proof. We first notice that idempotent elements have the following forms (see Corollary 1):
Since
and
are isomorphic, there exists a bijective mapping, say
from
onto
, which can be defined by
Now, for any
we have
which implies that
The linear independence of the set
yields that
for any
Hence,
for some permutation
On the other hand, the equality
implies that
Consequently,
Let us consider
Define a permutation
of
by
Hence,
By Theorem 1, the isomorphism, say
between
and
, can be chosen as follows:
where, as before,
Moreover, we have
which yields
for all
; this completes the proof. □
In fact, for a linear subspace
of an evolution algebra
, the notion of a subalgebra of
is different than that of the usual one, since the definition of the evolution algebra depends on a natural basis [
39].
Let
be an evolution algebra and
be a subspace of
If
has a natural basis
, which can be extended to a natural basis
of
then
is called an
evolution subalgebra, where
and
are index sets and
is a subset of
(see [
9], for details).
Define
In what follows, for the sake of simplicity, we always assume that
It is important to note that, if this condition is not satisfied, i.e., if the dimension of
is not equal to the dimension of
, then several cases may arise and it becomes difficult to cover all of these cases comprehensively. The analysis and classification of evolution subalgebras, as well as the extendibility of isomorphisms, become more complex in such scenarios.
Proposition 2. Let be an evolution algebra with . Let p and q be two orthogonal idempotents. Then,
Proof. Due to
the set
is linearly independent. Suppose that there is
Then, from
together with
one finds
, which implies
Hence, we get a contradiction with our assumption. □
Example 1. Let be a four dimensional S-evolution algebra that has the structural matrixThe idempotents of this algebra are (see Theorem 1):Let us consider subalgebra , generated by orthogonal idempotents. We may choose asNow, we are going to show that this algebra has a natural basis. Let be a natural basis of then,From we have Hence, we may assume thatNext, suppose that is a natural basis of ; then,with whereHowever, yields that and implies So, Hence, is not a natural basis of , which means that is not an extendible basis. Thus, is not an extendible evolution subalgebra. In what follows, by we denote the subalgebra of generated by all orthogonal idempotents of . It is important to note that is an evolution algebra, which may or may not be an S-evolution algebra.
Theorem 4. Let be an evolution algebra and be the subalgebra generated by all orthogonal idempotents of , then the following statements hold true:
- (i)
If then is a trivially extendible evolution subalgebra;
- (ii)
If , and for each idempotent one has , then is an extendible evolution subalgebra;
- (iii)
If and for some idempotent , then is not an extendible evolution subalgebra.
Proof. Assume that
(i) Since then one can find that with is an extendible natural basis;
(ii) Assume that
. We need to show that
has a natural basis. Assume that
is a natural basis for
, then
By
one finds
for any
Hence, we may assume without loss of generality that
is a natural basis of
Next, we show that
is a natural basis of
, where
Consider
where
. Then,
,
Then,
Now, for any
with
,
one has
which yields
for any
Therefore, for any
, we get
Hence,
is a natural basis of
(iii) By (ii)
is a natural basis of
Consider
then
So,
Then
exist such that
this means that
for some
Hence,
is not an extendible basis. □
Theorem 5. Let and be two evolution algebras. Assume that are two extendible evolution subalgebras generated by all orthogonal idempotent elements of and , respectively. Then, the isomorphism between and can be extendible to an isomorphism between and
Proof. Assume that , then In this case, there is nothing to prove.
Suppose that
and let
be an isomorphism between
and
given by:
Using the orthogonality property for any
, one finds
This implies
for any
Thus,
Due to
one gets
which yields
for some permutation
of
.
Since
are extendible evolution subalgebras, then
and
are the natural basis of
and
, respectively.
Let us construct an isomorphism between
and
as follows:
where
is a permutation of
. Hence,
for all
This completes the proof. □
Remark 3. From the above given construction, we infer that an isomorphism could be constructed in many ways.
Proposition 3. Let be an n-dimensional S-evolution algebra and let p be any nonzero idempotent, then
Proof. Suppose that is a nonzero idempotent, then Using the definition of the structural matrix of an S-evolution algebra, one finds then, Thus, Therefore, , which is a contradiction. Hence, □
Corollary 2. Let be an n-dimensional S-evolution algebra and let be defined as above. If , then is not an evolution subalgebra.
Proof. The proof immediately follows from Proposition 3 and (iii) of Theorem 4. □
4. Construct Evolution Algebra from Given Idempotent Elements
In this section, we construct a low dimensional algebra generated by idempotent elements. Namely,
Assume that the table of multiplication of this algebra is defined as follows:
where each of
are linearly independent and
Now, we are going to study when M becomes an evolution algebra. To answer to this question, we need the next auxiliary fact.
Proposition 4. Let be given, where Then, the following statements hold true:
- (i)
If is surjective such that then the set is linearly dependent;
- (ii)
If is surjective such that then the set is linearly independent;
- (iii)
If is not surjective, then the set is linearly independent.
Proof. (i). If
is surjective with
and we assume that
then by multiplying both sides of (
16) by
, one gets
Hence, we obtain the following system:
The solution of the above system is
Plugging these values into (
16) and assuming
we get
Hence, the set
is linearly dependent;
(ii). If
is surjective with
then without loss of generality, we may assume that
Now, let us assume that
Now, multiplying both sides of (
17) by
, we find
Hence, one gets
It is not difficult to find that the solution of the last system is
Hence, the set
is linearly independent.
(iii). Assume that is not surjective, here we consider two cases as follows:
- Case 1.
If
Without loss of generality, we can assume that
Let
Consider now,
Since each of
are linearly independent, then
On the other hand,
Again using the linear independence of
, then
Hence, the set
is linearly independent.
- Case 2.
If
, then, without loss of generality, we may assume that
such that
The other choices in the same manner will give the same result. Suppose that
Now, let us consider
The linear independence of
implies
On the other hand,
which again by the linear independence of
, one gets
Hence, the set
is linearly independent.
This completes the proof. □
Theorem 6. Let M be an algebra defined by (
14)
and let be surjective. Then the following statements hold true: - (i)
M is an evolution algebra if where
- (ii)
M is not an evolution algebra if where
Proof. (i). Assume that
where
By (i) of Proposition 4, we infer that the algebra
M is two-dimensional. Let us suppose that
is a natural basis for
M. Then, we have the following change of basis:
with
Then,
M is an evolution algebra if and only if
, which implies
The solution of the last system is
So, we have the following two-dimensional evolution algebra:
Thus,
M is an evolution algebra;
(ii). Assume that
Then, by (ii) of Proposition 4,
M is thee-dimensional. Let us suppose that
is a natural basis for
M. Then, we have the following change of basis:
with
Then,
M is an evolution algebra if and only if
, which implies that
Assume that
then the above system becomes as follows:
One can easily find that the solutions of the last system always have the property
. A similar result is
Hence, in this case,
M is not an evolution algebra. □
Theorem 7. Let M be an algebra defined by (
14)
and let not be surjective, then M is a three-dimensional evolution algebra. Proof. Here, we shall consider two cases:
- Case 1.
If
Assume that
Let
be a natural basis for
M. Then, we have the following change of basis:
with
if
M is an evolution algebra if and only if
for any
Now, consider
then, we have the following system:
Rewriting the above system, one has
If
then the solution of the last system is the following one:
and the remaining values are zero. Hence,
If
then the solution of the above system is as follows:
and the remaining values are zero. Hence,
If
then the solution of the above system is as follows
and the remaining values are zero. Hence,
Hence, in this case, M is an evolution algebra.
- Case 2.
If
In this case, we have several possibilities of
We consider one possible case, and other cases can be proceeded in the same manner. Assume that
Let
be a natural basis for
M. Then, one can write
with
Then,
M is an evolution algebra if and only if
for any
Simple calculations yield that
and the remaining values are zero. Hence,
This completes the proof. □
Now, we are going to study the structure of the algebra M.
Theorem 8. Let M be an algebra defined by (
14),
then the following statements are true: - (i)
If is surjective with , then M is isomorphic to with the following table of multiplication: - (ii)
If is not surjective, then M is isomorphic to with the following table of multiplication:
Proof. (i). Let us first find
A simple change of basis yields that this algebra is isomorphic to
(ii). If
is not surjective, then
A simple change of basis yields that this algebra is isomorphic to
This completes the proof. □
Remark 4. We stress the following points:
The algebras and are not isomorphic;
Both algebras and are not solvable, hence are not nilpotent.
5. Tensor Product of -Evolution Algebras
In this section, we investigate the relation between the set of idempotent elements of given two-dimensional S-evolution algebras and the set of idempotent elements of their tensor product. Let us first define the structure matrix of the tensor product of finite dimensional evolution algebras.
Definition 1 ([
41])
. Suppose that and are two finite dimensional evolution algebras (over the field ) with a natural basis and , respectively. Assume that and are the structure matrices associated to and , respectively. Then, the structure matrix of the evolution algebra relative to the basis is the Kronecker product of and , i.e., . Remark 5. We notice that the multiplication of in the basis is defined as follows: Definition 2. An evolution algebra is tensor decomposable if it is isomorphic to , where and are evolution algebras with . Otherwise, is said to be tensor indecomposable.
Proposition 5. Let be an S-evolution algebra and be tensor decomposable. Then, with at least one of is an S-evolution algebra.
Proof. Since
is tensor decomposable, then
with
. Suppose that
, and
are evolution algebras. Assume that
are the structural matrices of
respectively. Consider
However, if the structural matrix of
is an
S-matrix, then from the above equation one finds
this implies either
or
We may assume that
Next, let
for some
; then, due to the isomorphism between
and
one finds
Hence,
is an
S-evolution algebra. □
Theorem 9. Any four-dimensional S-evolution algebra is tensor decomposable if it is isomorphic to the following S-evolution algebras: Proof. Let
be tensor decomposable, then
such that with
. Using Proposition 5, we have either
or
is an
S-evolution algebra. Let us assume that
is an
S-evolution algebra with the following table of multiplication:
After simple scaling, we can write the table of multiplication of the above algebra as
Now, assume that
is an
S-evolution algebra, then the table of multiplication of
is as follows:
Then,
is decomposable in this case if
but
has the following table of multiplication.
Clearly, this algebra isomorphic to
Now, assume that
is not an
S-evolution algebra, then its table of multiplication is as follows:
After simple scaling, we can rewrite the table of multiplication of
as
Then,
is decomposable in this case if
However,
has the following table of multiplication:
This algebra is isomorphic to
□
Theorem 10. Consider the and evolution algebras given in Theorem 8. Then, the following statements hold true:
- (i)
, where E is a four-dimensional evolution algebra with the following table of multiplication: - (ii)
, where E is a six-dimensional evolution algebra with the following table of multiplication: - (iii)
, where E is a nine-dimensional evolution algebra with the following table of multiplication:
Proof. (i) Now, let us consider
; then, the table of multiplication is as follows:
This algebras is isomorphic to
E with table of multiplication
Clearly, Hence, The statements of (ii) and (iii) can be proceeded by the similar argument. This completes the proof. □