COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND

DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD

I.S.RAKHIMOV
arXiv:2307.09927v1 [math.RA] 19 Jul 2023

Universiti Teknologi MARA (UiTM), Shah Alam, Malaysia

Abstract. A complete classifications, up to isomorphism, of two-dimensional associative and diasso-

ciative algebras over any basic field are given.

1. Introduction
In 1993, Loday introduced the notion of Leibniz algebra [18], which is a generalization of Lie algebra,
where the skew-symmetric of the bracket is dropped and the Jacobi identity is changed by the Leibniz
identity. Loday noted that the link between Lie algebras and associative algebras can be extended
to an “analogous” link between Leibniz algebra and so-called dialgebra which is a generalization of
associative algebra possessing two products. Namely, it was shown that if one has a dialgebra (D, ⊣, ⊢)
over a finite-dimensional vector space V , with two bilinear binary operations with certain compatibility
axioms then introducing a binary operation [x, y] := x ⊣ y − y ⊢ x we get an algebra structure on V
called Leibniz algebra. It also been shown that the universal enveloping algebra of a Leibniz algebra
has the structure of a dialgebra.
In fact, the main motivation of J.-L.Loday to introduce several classes of algebras was the search
of an “obstruction” to the periodicity in algebraic K-theory.
Since then the study of different properties, relations and classification of Loday’s algebras became
an active research area. Dozens of papers have been published (see References). But most of the results
concerned Loday’s algebras over the field of complex numbers. Recently, a result on classification of
all algebra structures on two-dimensional vector space over any basic field was published [11]. In
this paper we use the result of [11] to classify all associative and diassociative algebra structures on
two-dimensional vector space over any basic field. This technique was implemented earlier in series
of papers [3, 4, 5, 12] and others. However, there still was a condition on the basic field that was
managed to be released in [11].

1.1. Algebras.

Definition 1. A vector space V over a field F equipped with a function · : V ⊗ V → V ((x, y) 7→ x · y)

such that
(αx + βy) · z = α(x · z) + β(y · z), z · (αx + βy) = α(z · x) + β(z · y)
whenever x, y, z ∈ V and α, β ∈ F, is said to be an algebra A = (V, ·).

Definition 2. Two algebras A and B are called isomorphic if there is an invertible linear map f :
A → B such that
f (x ·A y) = f (x) ·B f (y)
whenever x, y ∈ A.
1
2 I.S.RAKHIMOV

Definition 3. An invertible linear map f : A → A is said to be an automorphism if

f (x · y) = f (x) · f (y)
whenever x, y ∈ A.

The set of all automorphisms of an algebra A forms a group with respect to the composition
operation and it is denoted by Aut(A).
Let A be n-dimensional algebra over F and e = (e1 , e2 , ..., en ) be its basis. Then the bilinear map ·
is represented by a n × n2 matrix (called the matrix of structure constant, shortly MSC)
 
a111 a112 ... a11n a121 a122 ... a12n ... a1n1 a1n2 ... a1nn
 2
 a11 a212 ... a21n a221 a222 ... a22n ... a2n1 a2n2 ... a2nn 

A=
 ... ... ... ... ... ... ... ... ... ... ... ... ... 

an11 an12 ... an1n an21 an22 ... an2n ... ann1 ann2 ... annn
as follows
n
X
ei · ej = akij ek , where i, j = 1, 2, ..., n.
k=1
Therefore, the product on A with respect to the basis e is written as follows
(1.1) x · y = eA(x ⊗ y)
for any x = ex, y = ey, where x = (x1 , x2 , ..., xn )T , and y = (y1 , y2 , ..., yn )T are column coordinate
vectors of x and y, respectively, x ⊗ y is the tensor(Kronecker) product of the vectors x and y. Now
and onward for the product “x · y” on A we use the juxtaposition “xy”.
Further we assume that the basis e is fixed and we do not make a difference between the algebra A
and its MSC A.
An automorphism g : A → A as an invertible linear map is represented on the basis e by an
invertible matrix g ∈ GL(n; F) and g(x) = g(ex) = egx. Due to
g(x · y) = g(eA(x ⊗ y)) = eg(A(x ⊗ y)) = e(gA)(x ⊗ y),
and
g(x) · g(y) = (egx) · (egy) = eA(gx ⊗ gy) = eAg⊗2 (x ⊗ y)
the condition g(x · y) = g(x) · g(y) is written in terms of A and g as follows
(1.2) gA = Ag ⊗2 .
Note that in this term Definition 2 can also be rewritten as
(1.3) gA = Bg⊗2 ⇐⇒ A = g−1 Bg⊗2 .

1.2. Associative algebras.

Definition 4. An algebra (A, ·) is said to be associative if ∀ x, y, z ∈ A the following axiom holds true
(1.4) (x · y) · z = x · (y · z),

Write
x · y = eA(x ⊗ y) and y · z = eA(y ⊗ z),
(x · y) · z = eA(A(x ⊗ y) ⊗ z)) and x · (y · z) = eA(x ⊗ A(y ⊗ z)).
Then,
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
3

eA(A(x ⊗ y) ⊗ z)) = eA(x ⊗ A(y ⊗ z)),

i.e., an algebra A with MSC A is associative if and only if
(1.5) A(A ⊗ I) = A(I ⊗ A) ,
where I is n × n identity matrix.

1.3. Associative dialgebras.

Definition 5. A dialgebra D = (V, ⊣, ⊢) is said to be associative dialgebra if ∀x, y, z ∈ D the following

axioms hold true
(x ⊣ y) ⊣ z = x ⊣ (y ⊣ z),
x ⊣ (y ⊣ z) = x ⊣ (y ⊢ z),
(1.6) (x ⊢ y) ⊣ z = x ⊢ (y ⊣ z),
(x ⊣ y) ⊢ z = (x ⊢ y) ⊢ z,
(x ⊢ y) ⊢ z = x ⊢ (y ⊢ z).
Definition 6. Let D1 = (V, ⊣, ⊢) and D2 = (V, ⊣′ , ⊢′ ) be diassociative algebras. A linear function
f : D1 −→ D2 is said to be homomorphism if
f (x ⊣ y) = f (x) ⊣′ f (y) and f (x ⊢ y) = f (x) ⊢′ f (y) for all x, y ∈ D1 .

Definition 7. Dialgebras D1 and D2 are called isomorphic if there is an invertible homomorphism

f : D1 −→ D2 .

Let
x ⊣ y = eA(x ⊗ y) and x ⊢ y = eB(x ⊗ y)
for any x = ex, y = ey.
Then,
(x ⊣ y) ⊣ z = eA(A(x ⊗ y) ⊗ z)),
x ⊣ (y ⊣ z) = eA(x ⊗ A(y ⊗ z)),
x ⊣ (y ⊢ z) = eA(x ⊗ B(y ⊗ z)),
(x ⊢ y) ⊣ z = eA(B(x ⊗ y) ⊗ z)),
x ⊢ (y ⊣ z) = eB(x ⊗ (A(y ⊗ z)),
(x ⊣ y) ⊢ z = eB(A(x ⊗ y) ⊗ z),
(x ⊢ y) ⊢ z = eB(B(x ⊗ y) ⊗ z)),
x ⊢ (y ⊢ z) = eB(x ⊗ (B(y ⊗ z)),
Therefore, the diassociative algebra axioms (1.6) in terms of the structure constants can be given
by the identities
A(A(x ⊗ y) ⊗ z) = A(x ⊗ A(y ⊗ z)),
A(x ⊗ A(y ⊗ z)) = A(x ⊗ B(y ⊗ z)),
(1.7) A(B(x ⊗ y) ⊗ z) = B(x ⊗ (A(y ⊗ z)),
B(A(x ⊗ y) ⊗ z) = B(B(x ⊗ y) ⊗ z)),
B(B(x ⊗ y) ⊗ z)) = B(x ⊗ (B(y ⊗ z)).
4 I.S.RAKHIMOV

The axioms can be rewritten as follows

A(A ⊗ I) − A(I ⊗ A) = 0
A(I ⊗ A) − A(I ⊗ B) = 0
(1.8) A(B ⊗ I) − B(I ⊗ A) = 0
B(A ⊗ I) − B(B ⊗ I) = 0
B(B ⊗ I) − B(B ⊗ I) = 0
i.e., a dialgebra D with MSC D := {A, B} is diassociative if and only if (1.8) holds true.
In the paper we make use the following result from [11] on complete classification of two-dimensional
algebras over any basic field.

Theorem 1. Any non-trivial 2-dimensional algebra over a field F (Char(F) 6= 2, 3) is isomorphic to

only one of the following listed, by their matrices of structure constants, such algebras:
 
α1 α2 1 + α2 α4
• A1 (c) = , where c = (α1 , α2 , α4 , β1 ) ∈ F4 ,
β1 −α1 1 − α1 −α2
 
α1 0 0 α4
• A2 (c) = , where c = (α1 , α4 , β2 ) ∈ F3 and α4 6= 0,
1 β2 1 − α1 0
a2 α4
   
α1 0 0 α4 α1 0 0
• A3 (c) = ≃ , where c = (α1 , α4 , β2 ) ∈ F3 ,
0 β2 1 − α1 0 0 β2 1 − α1 0
a ∈ F and  a 6= 0, 
0 1 1 0
• A4 (c) = , where c = (β1 , β2 ) ∈ F2 ,
β1 β2 1 −1
 
α1 0 0 0
• A5 (c) = ,
1 2α1 − 1 1 − α1 0
where c =  α1 ∈ F, 
α1 0 0 α4
• A6 (c) = , where c = (α1 , α4 ) ∈ F2 and α4 6= 0,
1 1 − α1 −α1 0
a2 α4
   
α1 0 0 α4 α1 0 0
• A7 (c) = ≃ , where c = (α1 , α4 ) ∈ F2 ,
0 1 − α1 −α1 0 0 1 − α1 −α1 0
a ∈ F and  a 6= 0, 
0 1 1 0
• A8 (c) = , where c = β1 ∈ F,
β1 1 0 −1
1 
0 0 0
• A9 = 3 2 ,
1 3 − 31 0
   
0 1 1 1 0 1 1 1
• A10 (c) = ≃ ′ ,
β1 0 0 −1 β1 (a) 0 0 −1
where c = β1 ∈ F, the polynomial (β1 t3 − 3t − 1)(β1 t2 + β1 t + 1)(β12 t3 + 6β1 t2 + 3β1 t + β1 − 2)
′ (β12 t3 +6β1 t2 +3β1 t+β1 −2)2
has no root in F, a ∈ F and β1 (t) = (β1 t2 +β1 t+1)3 ,
   
0 0 0 1 0 0 0 1
• A11 (c) = ≃ , where the polynomial β1 − t3 has no root in
β1 0 0 0 a β1±1
3 0 0 0
F, a, c = β1 ∈ F and a, β16= 0, 
0 1 1 0 0 1 1 0
• A12 (c) = ≃ , where a, c = β1 ∈ F and a 6= 0,
β1 0 0 −1 a2 β1 0 0 −1
 
0 0 0 0
• A13 = .
1 0 0 0
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
5

Theorem 2. Any non-trivial 2-dimensional algebra over a field F (Char(F) = 2) is isomorphic to

only one of the following listed by their matrices of structure constants, such algebras:
 
α1 α2 1 + α2 α4
• A1,2 (c) = , where c = (α1 , α2 , α4 , β1 ) ∈ F4
β1 α1 1 + α1 α2
 
α1 0 0 α4
• A2,2 (c) = , where c = (α1 , α4 , β2 ) ∈ F3 and α4 6= 0
1 β2 1 + α1 0
 
α1 0 0 0
• A2,2 (α1 , 0, 1) = , where α1 ∈ F
1 1 1 + α1 0
a2 α4
   
α1 0 0 α4 α1 0 0
• A3,2 (c) = ≃ , where c = (α1 , α4 , β2 ) ∈ F3 ,
0 β2 1 + α1 0 0 β2 1 + α1 0
a ∈ F and a 6= 0   
α1 1 1 0 α1 1 1 0
• A4,2 (c) = ≃ ,
β1 β2 1 + α1 1 β1 + (1 + β2 )a + a2 β2 1 + α1 1
where c = (α1 , β1 , β2 ) ∈ F3
 
α1 0 0 α4
• A5,2 (c) = , where c = (α1 , α4 ) ∈ F2 and α4 6= 0
1 1 + α1 α1 0
 
1 0 0 0
• A5,2 (1, 0) = ,
1 0 1 0
0 a2 α4
   
α1 0 0 α4 α1 0
• A6,2 (c) = ≃ , where c = (α1 , α4 ) ∈ F2 , a ∈ F
0 1 + α1 α1 0 0 1 + α1 α1 0
and a 6= 0    
α1 1 1 0 α1 1 1 0
• A7,2 (c) = ≃ , where c = (α1 , β1 ) ∈
β1 1 + α1 α1 1 β1 + aα1 + a + a2 1 + α1 α1 1
F2 and a ∈F   
0 1 1 1 0 1 1 1
• A8,2 (c) = ≃ ′ , where the polynomial
β1 0 0 1 β1 (a) 0 0 1
′ (β 2 t3 +β t+β )2
(β1 t3 + t + 1)(β1 t2 + β1 t + 1) has no root in F, a ∈ F and β1 (t) = (β11 t2 +β11 t+1)1 3
   
0 0 0 1 0 0 0 1
• A9,2 (c) = ≃ , where a, c = β1 ∈ F and a 6= 0,
β1 0 0 0 a3 β1±1 0 0 0
the polynomial
 β1 + t3has  no root in F 
1 1 1 0 1 1 1 0
• A10,2 (c) = ≃ , where a, c = β1 ∈ F
β1 1 1 1 β1 + a + a2 1 1 1
   
0 1 1 0 0 1 1 0
• A11,2 (c) = ≃ 2 , where a, b ∈ F and b 6= 0
β1 0 0 1 b (β1 + a2 ) 0 0 1
 
0 0 0 0
• A12,2 =
1 0 0 0

Theorem 3. Any non-trivial 2-dimensional algebra over a field F (Char(F) = 3) is isomorphic to

only one of the following, listed by their matrices of structure constants, such algebras:
 
α1 α2 α2 + 1 α4
• A1,3 (c) = , where c = (α1 , α2 , α4 , β1 ) ∈ F4
β1 −α1 1 − α1 −α2
 
α1 0 0 α4
• A2,3 (c) = , where c = (α1 , α4 , β2 ) ∈ F3 , and α4 6= 0
1 β2 1 − α1 0
6 I.S.RAKHIMOV

a2 α4
   
α1 0 0 α4 α1 0 0
• A3,3 (c) = ≃ , where c = (α1 , α4 , β2 ) ∈ F3 ,
0 β2 1 − α1 0 0 β2 1 − α1 0
a ∈ F and a 6= 0 
0 1 1 0
• A4,3 (c) = , where c = (β1 , β2 ) ∈ F2
β1 β2 1 −1
 
α1 0 0 0
• A5,3 (c) = , where c = α1 ∈ F
1 2α1 − 1 1 − α1 0
 
α1 0 0 α4
• A6,3 (c) = , where c = (α1 , α4 ) ∈ F2 and α4 6= 0
1 1 − α1 −α1 0
a2 α4
   
α1 0 0 α4 α1 0 0
• A7,3 (c) = ≃ , where c = (α1 , α4 ) ∈ F2 ,
0 1 − α1 −α1 0 0 1 − α1 −α1 0
a ∈ F and a 6= 0 
0 1 1 0
• A8,3 (c) = , where c = β1 ∈ F
β1 1 0 −1
   
0 1 1 1 0 1 1 1
• A9,3 (β1 ) = ≃ , where the polynomial
β1 0 0 −1 β1′ (a) 0 0 −1
′ (β 2 t3 +β −2)2
(β1 − t3 )(β1 t2 + β1 t + 1)(β12 t3 + β1 − 2) has no root in F, a ∈ F and β1 (t) = (β11t2 +β11t+1)3
   
0 0 0 1 0 0 0 1
• A10,3 (c) = ≃ ,
β1 0 0 0 a3 β1±1 0 0 0
where the polynomial
 β1 −t3 has  no root, a, c = β1 ∈ F and a, β1 6= 0
0 1 1 0 0 1 1 0
• A11,3 (c) = ≃ , where a, c = β1 ∈ F, a 6= 0
β1 0 0 −1 a2 β1 0 0 −1
 
1 0 0 0
• A12,3 = ,
1 −1 −1 0
 
0 0 0 0
• A13,3 = .
1 0 0 0

The next sections are devoted to the classification of all two-dimensional associative and associative
dialgebras over any basic field relying on the theorems above.

2. Classification of two-dimensional associative algebras

In this section we classify all two-dimensional associative algebras over any basic field. Let A be a
two-dimensional associative algebra and

 
α1 α2 α3 α4
A=
β1 β2 β3 β4

be its MSC on a basis e = (e1 , e2 ). Write the axiom (1.5) in terms of the elements of A as follows
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
7

β1 (α2 − α3 ) = 0
α2 β2 − α4 β1 = 0
(α1 − β3 )α2 − α3 (α1 − β2 ) = 0
(α1 − β2 )α4 − α2 (α2 − β4 ) = 0
α3 β3 − α4 β1 = 0
α4 (β2 − β3 ) = 0
(2.1)
(α1 − β3 )α4 − α3 (α3 − β4 ) = 0
α4 (α2 − α3 ) = 0
β1 (β2 − β3 ) = 0
(α2 − β4 )β1 − β2 (α1 − β2 ) = 0
(α3 − β4 )β1 − β3 (α1 − β3 ) = 0
(α3 − β4 )β2 − β3 (α2 − β4 ) = 0
Theorems 1, 2, 3 are applied as follows: substitute the structure constants of the list of representa-
tives in the theorems into the system of equations (2.1) taking the structure constants to be variables.
The solutions to the system give structure constants of associative algebras.

2.1. Characteristic is not 2 and 3.

It is easy to see that A13 is associative.
For algebras A12 − A4 the system of equations (2.1) is inconsistent.
Consider 
a2 α4
  
α1 0 0 α4 α1 0 0
A3 (c) = ≃ , where c = (α1 , α4 , β2 ) ∈ F3 , a ∈ F
0 β2 1 − α1 0 0 β2 1 − α1 0
and a 6= 0. 

 (α1 − β2 )α4 = 0
4 1 + β2 − 1) = 0
(α



 α

α4 (2α1 − 1) = 0

Then we get

 β2 (α1 − β2 ) = 0
2 − 3α + 1 = 0 ⇐⇒ α = 1 or α = 1




 2α 1 1 1 1 2
α4 (α1 + β2 − 1) = 0

Case 1 α1 = 1 :


 α4 (β2 − 1) = 0



 α4 β2 = 0
α4 = 0 we get β2 (β2 − 1) = 0.
(β − 1) = 0



 β2 2

α4 β2 = 0

Case 11 β2 = 0. Then
 
1 0 0 0
0 0 0 0
Case 12 β2 = 1. We get
 
1 0 0 0
0 1 0 0
1
Case 2 α1 = 2 :
8 I.S.RAKHIMOV

One has 
α4 (2β2 − 1) = 0
2β22 − β2 = 0
Case 21 α4 = 0 : =⇒ 2β22 − β2 = 0.
Case 211 β2 = 0 :
 1 
2 0 0 0
0 0 21 0
1
Case 212 β2 = 2 :
1
 
2 0 0 0
1 1
0 2 2 0
1
Case 22 a4 6= 0 : =⇒ β2 = 2

1
1
0 a2 α4
  
2 0 0 α4 2 0
1 1 ≃ 1 1 ,
0 2 2 0 0 2 2 0
where α4 ∈ F, a ∈ F and a 6= 0.
Note that if α4 6= 0 and F is perfect (particularly, algebraically closed) then α4 = 1.
For algebras A1 and A2 the system of equations (2.1) also is inconsistent.
Thus we have the following result.

Theorem 4. Any non-trivial 2-dimensional associative algebra over a field F, (Char(F) 6= 2, 3) is

isomorphic to only one of the following listed by their matrices of structure constants, such algebras:
 
1 0 0 0 0
(1) As13 :=
1 0 0 0
 
1 0 0 0
(2) As23 :=
0 0 0 0
 
3 1 0 0 0
(3) As3 :=
0 1 0 0
 1 
(4) As43 := 2 0 0 0
0 0 12 0
 1  1
0 0 a2 α4

5 2 0 0 α4 2
(5) As3 (α4 ) := ≃ , where α4 ∈ F, a ∈ F and a 6= 0.
0 12 21 0 0 21 21 0
2.2. Characteristic two. We apply Theorem 2 to verify the algebras given there to be associative.
All the equations of (2.1) for algebras
   
0 1 1 0 0 1 1 0
A11,2 (c) = ≃ 2 , where a, b ∈ F, b 6= 0
β1 0 0 1 b (β1 + a2 ) 0 0 1
and  
0 0 0 0
A12,2 =
1 0 0 0
in Theorem 2 become identities. Therefore, A11,2 and A12,2 are associative algebras.
The algebra
 
1 1 1 0
A4,2 := is associative.
β1 0 0 1
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
9

It is easy to see that the algebra

 
1 0 0 0
A6,2 := also is associative.
0 0 1 0

Therefore, the following result holds true.

Theorem 5. Any non-trivial 2-dimensional associative algebra over a field F, (Char(F) = 2) is

isomorphic to only one of the following listed by their matrices of structure constants, such algebras:
 
1 0 0 0 0
(1) As12,2 :=
1 0 0 0
   
2 0 1 1 0 ∼ 0 1 1 0
(2) As11,2 (β1 ) := = , where a, b ∈ F and b 6= 0.
β1 0 0 1 b2 (β1 + a2 ) 0 0 1
 
1 0 0 0
(3) As36,2 :=
0 0 1 0
   
4 1 1 1 0 ∼ 1 1 1 0
(4) As4,2 (β1 ) := = , where a, β1 ∈ F.
β1 0 0 1 β1 + a + a2 0 0 1
 
1 0 0 0
(5) As53,2 := ,
0 0 0 0
 
6 1 0 0 0
(6) As3,2 :=
0 1 0 0

2.3. Characteristic three. In this case the associative algebras come out from the following classes
of Theorem 3.
It is immediate to get that the algebra A13,3 is associative. In these case all the equations of the
system (2.1) turn into identities.
Let us consider
a2 α4
   
α1 0 0 α4 ∼ α1 0 0
A3,3 (c) = = ,
0 β2 1 − α1 0 0 β2 1 − α1 0

where c = (α1 , α4 , β2 ) ∈ F3 , a ∈ F and a 6= 0.

The system of equations (2.1) is equivalent to



 (α1 − β2 )α4 = 0
α4 (α1 + β2 − 1) = 0





 α (2α − 1)
4 1 = 0
(2.2)

 β2 (α 1 − β2 ) = 0
2




 2α1 − 3α1 + 1 = 0
α4 (α1 + β2 − 1) = 0


From (2.2) one has 2α21 − 3α1 + 1 = 0 ⇐⇒ α1 = 1 or α1 = 2.

Case 1: α1 = 1 Then (2.2) is equivalent to β22 − β2 = 0. Therefore, we have two subcases:
Case 11. Let β2 = 0. Then we get

 
1 0 0 0
A3,3 := is associative.
0 0 0 0
10 I.S.RAKHIMOV

Case 12: Let β2 = 1. Then one obtains that

 
1 0 0 0
A3,3 := is associative.
0 1 0 0
Case 2: If α1 = 2 then (2.2) is equivalent to β22 − β2 = 0. Considering two subcases for β2 = 0
(which implies α4 = 0) and β2 = 2 we obtain the following two associative algebras:
 
2 0 0 0
A3,3 :=
0 0 2 0
and
2 0 0 a2 α4
   
2 0 0 α4 ∼
A3,3 := = ,
0 2 2 0 0 2 2 0
where α4 ∈ F, a ∈ F and a 6= 0.
There are no associative algebras generated from the other classes of Theorem 3.
Thus, we have the following theorem.

Theorem 6. Any non-trivial 2-dimensional associative algebra over a field F, (Char(F) = 3) is

isomorphic to only one of the following listed by their matrices of structure constants, such algebras:
 
1 0 0 0 0
(1) As13,3 := .
1 0 0 0
 
1 0 0 0
(2) As23,3 :=
0 0 0 0
 
3 1 0 0 0
(3) As3,3 :=
0 1 0 0
 
4 2 0 0 0
(4) As3,3 :=
0 0 2 0
2 0 0 a2 α4
   
5 2 0 0 α4 ∼
(5) As3,3 (α4 ) := = , where α4 ∈ F, a ∈ F and a 6= 0.
0 2 2 0 0 2 2 0

3. Automorphism groups
In this section we describe the automorphism groups of algebras from Theorems 4, 5 and 6. The
author believes such automorphism groups can be obtained easily. But the lists of associative algebras
in the theorems are over arbitrary field and we do it here for the paper to be self-contained. We need
the automorphism groups in the next section to verify whether some of two-dimensional diassociative
x y
algebras found there isomorphic or not. Let g = with xt 6= yz. The equation (1.2) is
z t
equivalent to

α1 x2 + ((α2 + α3 )z + α1 )x + α4 z 2 − β1 y


 = 0
(α1 y + α2 (t − 1))x + (α3 z − β2 )y + α4 tz = 0




(α1 y + α3 (t − 1))x + (α2 z − β3 )y + α4 tz = 0




 α y 2 + ((α + α )t − β )y + α (t2 − x)

= 0
1 2 3 4 4
(3.1) 2 + ((β + β )x − α )z + β (x2 − t)

 β4 z 2 3 1 1 = 0




 (β4 z + β2 (x − 1))t + (β3 y − α2 )z + β1 xy = 0
(β z + β3 (x − 1))t + (β2 y − α3 )z + β1 xy = 0

 42



β4 t + ((β2 + β3 )y − β4 )t + β1 y 2 − α4 z = 0
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
11

3.1. Characteristic of F is not 2 and 3.


y = 0
For As113 the system (3.1) is equivalent to
x2 − t = 0
Therefore,     
0 0 0 0 x 0
Aut(As113 ) = Aut = x 6= 0 .
1 0 0 0 z x2
Consider As23 . Then as the system (3.1) we get


 x(x − 1) = 0

 xy = 0

 y = 0

 z = 0
Hence,
    
1 0 0 0 1 0
Aut(As23 ) = Aut = t 6= 0 .
0 0 0 0 0 t
Consider As33 . Then 

 x(x − 1) = 0

 y = 0

 z(x − 1) = 0

 t(x − 1) = 0
and
    
1 0 0 0 1 0
Aut(As33 ) = Aut = t 6= 0 .
0 1 0 0 z t
1 
0 0 0
Consider As43 := 2 . We get
0 0 21 0


 x − x2 = 0

y = 0


 z(x − 1) = 0

 t(x − 1) = 0
and
 1
   
0 0 0 1 0
Aut(As43 )
= Aut 2 = t 6= 0 .
0 0 21 0 z t
1 
5 2 0 0 α4
Let us now consider As3 := . Then
0 21 12 0
x − x2 − 2α4 z 2 = 0



(x − 1)y + 2α4 zt = 0




 2xα − y 2 − 2α t2 = 0

4 4

 z − 2xz = 0




 (x − 1)t + zy = 0
α4 z − ty = 0

12 I.S.RAKHIMOV

{x = 1, y = 0, z = 0, t is any non-zero} if α4 = 0
The solution to the system is
{x = 1, y = 0, z = 0, t = ±1} if α4 =
6 0
i.e.,
 1    
0 0 0 1 0
Aut(As53 (0)) = Aut 2
1 1 = t 6= 0 ,
0 2 2 0 0 t

 1    
0 0 0 1 0
Aut(As53 (α4 )) = Aut 2
1 1 = I= .
0 2 2 0 0 ±1

3.2. Characteristic of F is two.

 
0 0 0 0
Consider As112,2 = . From (3.1) we get y = 0 and t = x2 . Therefore,
1 0 0 0
  
x 0
Aut(As112,2 ) = where x 6= 0, z ∈ F .
z x2
   
0 1 1 0 0 1 1 0
Let us take As211,2 (β1 ) = ≃ , where a, b ∈ F and b 6= 0.
β1 0 0 1 b2 (β1 + a2 ) 0 0 1
Then we get


 t = 1
y = 0
z = β1 (x − 1)


and
  
x 0
Aut(As211,2 ) = where x 6= 0 ∈ F .
β1 (x − 1) 1
 
1 0 0 0
Consider As36,2
= .
0 0 1 0
Then (3.1) is equivalent to

x2 − x


 = 0
xy = 0




y(x − 1) = 0




y2 + y

 = 0

 z(x − z − 1) = 0




 z(t − y) = 0
t(x − z − 1) = 0





t(t − y − 1) = 0

and
  
1 0
Aut(As36,2 ) = I= .
0 1
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
13
   
1 1 1 0 1 1 1 0
Consider As44,2 (β1 ) := ≃ . Then from the system of equa-
β1 0 0 1 β1 + a + a2 0 0 1
tions (3.1) we obtain 

 β1 y = 0

 (t + y − 1)x − zy = 0


y(y − 1) = 0
(x − t)b1 = 0





tz + z = 0.

• if β1 = 0 we get
  
x 0
Aut(As44,2 (0)) = x 6= 0, z ∈ F .
z 1
• if β1 6= 0 then   
1 0
Aut(As44,2 (β1 )) = z∈F .
z 1


1 0 0 0
Consider As53,2
:= .
0 0 0 0
Then (3.1) becomes 

 x2 + x = 0

 xy = 0

 y = 0

 z = 0.
Hence,   
1 0
Aut(As53,2 ) = t 6= 0 ∈ F .
0 t
 
1 0 0 0
Consider As63,2 := . Then
0 1 0 0

 y = 0
xz + z = 0
tx + t = 0


Therefore,   
1 0
Aut(As63,2 ) = z ∈ F and t 6= 0 ∈ F .
z t
3.3. Characteristic of F is three.

1 1 0 0 0
Consider As13,3 := .
1 0 0 0

y = 0
x2 + t = 0
Therefore,
 
x 0
Aut(As113,3 ) = .
z 2x2
 
1 0 0 0
Consider As23,3 := .
0 0 0 0
14 I.S.RAKHIMOV

From (3.1) we obtain


 x(x − 1) = 0
y = 0
z = 0


Hence,
  
1 0
Aut(As23,3 ) = t 6= 0 .
z t
 
1 0 0 0
Consider As33,3 := . Then
0 1 0 0


 x(x − 1) = 0

y = 0

 (x + 1)z
 = 0

 t(x − 1) = 0
and   
1 0
Aut(As33,3 ) = t 6= 0 .
0 t
 
2 0 0 0
If A = As43,3 := then (3.1) implies
0 0 2 0


 x2 − x = 0

 y = 0
2
 (2x − 1)z − x + t = 0


 (x − 1)t = 0
Therefore,
  
1 0
Aut(As43,3 ) = t 6= 0 .
1 + 2t t
 
2 0 0 α4
The system of equations (3.1) for the group of automorphisms of As53,3 (α4 ) := is
0 2 2 0

α4 z 2 + 2x2 + x + y


 = 0
α4 tz + 2xy = 0




(2x + 1)y + α4 zt = 0




 (t2 − x)α + 2y 2

= 0
4
(3.2)

 (2x + 1)z + 2x2 + t = 0




 y(x + z) = 0
(2x + 1)t + 2xy = 0




α4 z + ty + y 2

= 0

{x = 1, y = 0, z = 0, t = 1} if α4 = 0
The solution to the system is
{x = 1, y = 0, z is any, t = 1} if α4 =
6 0
Thus,
    
2 0 0 0 1 0
Aut(As4,1
3,3 (0)) = Aut = I=
0 2 2 0 0 1
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
15

    
2 0 0 α4 1 0
Aut(As4,2
3,3 (α4 )) = Aut = , z∈F .
0 2 2 0 z 1

4. Classification of two-dimensional associative dialgebras

In this section we classify all two-dimensional associative dialgebras over any basic field. As was
mentioned earlier a di-algebra can be given by two 2 × 4 matrices
   
α1 α2 α3 α4 γ1 γ2 γ3 γ4
A= and B =
β1 β2 β3 β4 δ1 δ2 δ3 δ4
corresponding to the binary operations ⊣ and ⊢, respectively. The matrix equations (1.8) in terms of
entries of A and B can be written as follows
AXIOM 1:
A(A ⊗ I) − A(I ⊗ A) = 0

β1 (α2 − α3 ) = 0
α2 β2 − α4 β1 = 0
(α1 − β3 )α2 − α3 (α1 − β2 ) = 0
(α1 − β2 )α4 − α2 (α2 − β4 ) = 0
α3 β3 − α4 β1 = 0
α4 (β2 − β3 ) = 0
(4.1)
(α1 − β3 )α4 − α3 (α3 − β4 ) = 0
α4 (α2 − α3 ) = 0
β1 (β2 − β3 ) = 0
(α2 − β4 )β1 − β2 (α1 − β2 ) = 0
(α3 − β4 )β1 − β3 (α1 − β3 ) = 0
(α3 − β4 )β2 − β3 (α2 − β4 ) = 0
AXIOM 2:
A(I ⊗ A) − A(I ⊗ B) = 0

α21 − α1 γ1 + α2 β1 − α2 δ1 = 0
α1 α2 − α1 γ2 + α2 β2 − α2 δ2 = 0
α1 α3 − α1 γ3 + α2 β3 − α2 δ3 = 0
α1 α4 − α1 γ4 + α2 β4 − α2 δ4 = 0
α1 α3 − α3 γ1 + α4 β1 − α4 δ1 = 0
α2 α3 − α3 γ2 + α4 β2 − α4 δ2 = 0
α23 − α3 γ3 + α4 β3 − α4 δ3 = 0
α3 α4 − α3 γ4 + α4 β4 − α4 δ4 = 0
(4.2)
α1 β1 + β1 β2 − β1 γ1 − β2 δ1 = 0
α2 β1 − β1 γ2 + β22 − β2 δ2 = 0
α3 β1 − β1 γ3 + β2 β3 − β2 δ3 = 0
α4 β1 − β1 γ4 + β2 β4 − β2 δ4 = 0
α1 β3 + β1 β4 − β3 γ1 − β4 δ1 = 0
α2 β3 + β2 β4 − β3 γ2 − β4 δ2 = 0
α3 β3 + β3 β4 − β3 γ3 − β4 δ3 = 0
α4 β3 − β3 γ4 + β42 − β4 δ4 = 0
16 I.S.RAKHIMOV

AXIOM 3:

A(B ⊗ I) − B(I ⊗ A) = 0

α3 δ1 − β1 γ2 = 0
α4 δ1 − β2 γ2 = 0
(δ2 − γ1 )α3 + γ2 (α1 − β3 ) = 0
(δ2 − γ1 )α4 + γ2 (α2 − β4 ) = 0
α3 δ3 − β1 γ4 = 0
α4 δ3 − β2 γ4 = 0
(4.3)
(γ3 − δ4 )α3 − γ4 (α1 − β3 ) = 0
(γ3 − δ4 )α4 − γ4 (α2 − β4 ) = 0
(γ1 − δ2 )β1 − δ1 (α1 − β3 ) = 0
β2 (γ1 − δ2 ) − δ1 (α2 − β4 ) = 0
β1 (γ3 − δ4 ) − δ3 (α1 − β3 ) = 0
(γ3 − δ4 )β2 − δ3 (α2 − β4 ) = 0

AXIOM 4:

B(A ⊗ I) − B(B ⊗ I) = 0

α1 γ1 − γ12 + (−δ1 + β1 )γ3 = 0

(β1 − δ1 )γ4 + γ2 (α1 − γ1 ) = 0
γ1 (α2 − γ2 ) + γ3 (β2 − δ2 ) = 0
α2 γ2 − γ22 + γ4 (β2 − δ2 ) = 0
(β3 − γ1 − δ3 )γ3 + α3 γ1 = 0
γ2 (α3 − γ3 ) + γ4 (β3 − δ3 ) = 0
(α4 − γ4 )γ1 + γ3 (β4 − δ4 ) = 0
(β4 − γ2 − δ4 )γ4 + α4 γ2 = 0
(4.4)
(α1 − δ3 − γ1 )δ1 + β1 δ3 = 0
(α1 − γ1 )δ2 + δ4 (−δ1 + β1 ) = 0
(α2 − γ2 )δ1 + δ3 (β2 − δ2 ) = 0
(α2 − γ2 − δ4 )δ2 + β2 δ4 = 0
(α3 − γ3 )δ1 + δ3 (β3 − δ3 ) = 0
(α3 − γ3 )δ2 + δ4 (β3 − δ3 ) = 0
(α4 − γ4 )δ1 + δ3 (β4 − δ4 ) = 0
(α4 − γ4 )δ2 + δ4 (β4 − δ4 ) = 0

AXIOM 5:

B(B ⊗ I) − B(B ⊗ I) = 0
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
17

δ1 (γ2 − γ3 ) = 0
γ2 δ2 − γ4 δ1 = 0
γ1 (γ2 − γ3 ) − γ2 δ3 + γ3 δ2 = 0
γ22 − γ2 δ4 − γ4 (γ1 − δ2 ) = 0
γ3 δ3 − γ4 δ1 = 0
γ4 (δ2 − δ3 ) = 0
(4.5)
γ3 δ4 − γ32 + γ4 (γ1 − δ3 ) = 0
γ4 (γ2 − γ3 ) = 0
δ1 (δ2 − δ3 ) = 0
(γ2 − δ4 )δ1 − δ2 (γ1 − δ2 ) = 0
(γ3 − δ4 )δ1 − δ3 (γ1 − δ3 ) = 0
(γ3 − δ4 )δ2 − δ3 (γ2 − δ4 ) = 0

For A we take MSC of Theorems 4, 5, 6 for a basic field is not characteristic 2,3, characteristic 2
and characteristic 3 cases, respectively. The entries of B we consider as unknowns:
 
γ1 γ2 γ3 γ4
δ1 δ2 δ3 δ4

Substitute these A and B into the matrix equations (1.8) to get the system of equation MSC chosen A
with unknown entries of B. Solving the system of equations we get a diassociative algebra generated
by A. Acting by the automorphism group of A we verify whether the generated by A diassociative
algebras are isomorphic or not.

4.1. Characteristic of F is not two and three.

Consider As113 .
AXIOM 1 and AXIOM 2 =⇒ γ1 = γ2 = γ3 = γ4 = 0
AXIOM 3 =⇒ δ2 =  δ4 = 0
δ1 δ3 − δ3 = 0
AXIOM 4 gives
δ3 = 0
AXIOM 5 holds true.
Therefore,
    
1 0 0 0 0 0 0 0 0
D13 := A= , B=
1 0 0 0 δ1 0 0 0
is a diassociative algebra generated by As113 .
 
2 1 0 0 0
Consider As3 :=
 0 0 0 0
 α1 =
 1 β1 = 0 γ1 = 1 δ1

 α =
2 0 β2 = 0 γ2 = 0 δ2
AXIOM 2 =⇒

 α3 = 0 β3 = 0 γ3 = 0 δ3

 α = 0 β3 = 0 γ4 = 0 δ4
 4
 α1 =
 1 β1 = 0 γ1 = 1 δ1 = 0

 α =
2 0 β2 = 0 γ2 = 0 δ2
AXIOM 3 =⇒

 α3 = 0 β3 = 0 γ3 = 0 δ3 = 0

 α =
4 0 β3 = 0 γ4 = 0 δ4
18 I.S.RAKHIMOV


 α1 = 1 β1 = 0 γ1 = 1 δ1 = 0

α2 = 0 β2 = 0 γ2 = 0 δ2

AXIOM 4 =⇒

 α3 = 0 β3 = 0 γ3 = 0 δ3 = 0

 α
4 = 0 β3 = 0 γ4 = 0 δ4 = 0
Case δ2 = 0 : 

 α1 = 1 β1 = 0 γ1= 1 δ1 = 0

 α
2 = 0 β2 = 0 γ2= 0 δ2 = 0
AXIOM 5 =⇒

 α3 = 0 β3 = 0 γ3= 0 δ3 = 0

 α
4 = 0 β4 = 0 γ4= 0 δ4 = 0
    
2 1 0 0 0 1 0 0 0
D3 := A = , B= .
0 0 0 0 0 0 0 0
Case δ2 = 1 : 

 α1 = 1 β1 = 0 γ1= 1 δ1 = 0

α2 = 0 β2 = 0 γ2= 0 δ2 = 1

AXIOM 5 =⇒

 α3 = 0 β3 = 0 γ3= 0 δ3 = 0

 α
4 = 0 β3 = 0 γ4= 0 δ4 = 0
    
3 1 0 0 0 1 0 0 0
D3 := A = , B= .
0 0 0 0 0 1 0 0

Note that the diassociative algebras D32 and D33 are not isomorphic since acting by the automorphism
group
    
2 1 0 0 0 1 0
Aut(As3 ) = Aut = |t 6= 0
0 0 0 0 0 t

to the part B of D32

     
1 0 0 0 −1 1 0 0 0 ⊗2 1 0
=g g , where g =
0 0 0 0 0 1 0 0 0 t

we get the system of equations which

 is inconsistent.
1 0 0 0
Consider As33 :=
 0 1 0 0

 α1 = 1 β1 = 0 γ1= 1 δ1 = 0

α2 = 0 β2 = 1 γ2= 0 δ2 = 1

AXIOM 2 =⇒

 α3 = 0 β3 = 0 γ3= 0 δ3 = 0

 α = 0 β = 0 γ4= 0 δ4 = 0
4 3
α = 1 β1 = 0γ1 = 1 δ1 = 0
 1


α2 = 0 β2 = 1γ2 = 0 δ2 = 1

AXIOM 3,4,5 =⇒

 α3 = 0 β3 = 0γ3 = 0 δ3 = 0

 α = 0 β
4 3 = 0γ4 = 0 δ4 = 0
    
1 0 0 0 1 0 0 0
D34 := A = , B= .
0 1 0 0 0 1 0 0
 1 
4 2 0 0 0
Let A to be As3 :=
0 0 12 0
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
19


 α1 = 12 β1 = 0 γ1 = 1
2 δ1

α2 = 0 β2 = 0 γ2 = 0 δ2

AXIOM 2 =⇒

 α3 = 0 β3 = 21 γ3 = 0 δ3

 α = 0 β = 0 γ = 0 δ4
 4 3 4
1 1
α1 = β1 = 0 γ1 = δ1
 α = 02 β = 0 γ 2



2 2 2 = 0 δ2
AXIOM 3 =⇒ 1

 α3 = 0 β3 = 2 γ 3 = 0 δ3

 α = 0 β = 0 γ
4 3 4 = 0 δ4


 δ δ
1 3 = 0
δ1 δ4 = 0




δ2 δ3 = 0





 δ2 δ4 = 0
AXIOM 4 gives 2

 2δ3 − δ3 = 0




 2δ3 δ4 − δ4 = 0
δ3 δ4 = 0





δ4 = 0.
Case 1: δ3 = 0

 α1 = 21 β1 = 0 γ1 = 21 δ1

α2 = 0 β2 = 0 γ2 = 0 δ2

AXIOM 4 =⇒

 α3 = 0 β3 = 21 γ3 = 0 δ3 = 0

 α = 0 β = 0 γ
4 3 4 = 0 δ4 = 0
AXIOM 5 =⇒ δ1 δ2 = 0 and δ2 (2δ2 − 1) = 0.
Case 11: δ2 = 
0

 α1 = 21 β1 = 0 γ1 = 21 δ1

α2 = 0 β2 = 0 γ2 = 0 δ2 = 0

AXIOM 5 =⇒ 1
 α3 = 0 β3 = 2 γ3


= 0 δ3 = 0
 α = 0 β = 0 γ = 0 δ4 = 0
4 3 4
  1   1 
D35 := A = 2 0 0 0
, B= 2 0 0 0
.
0 0 21 0 δ1 0 0 0
1
Case 12: δ2 =
 2 , δ1 = 0
 α1 = 12 β1 =
 0 γ1 = 21 δ1 = 0
= 0 δ2 = 21

α2 = 0 β2 = 0 γ2

AXIOM 5 =⇒ 1

 α3 = 0 β3 = 2 γ3 = 0 δ3 = 0

 α = 0 β =
4 3 0 γ4 = 0 δ4 = 0
  1   1 
6 2 0 0 0 2 0 0 0
D3 := A = , B= .
0 0 12 0 0 21 0 0
The dialgebras D35 and D36 are not isomorphic that can be seen acting by
 1    
4 2 0 0 0 1 0
Aut(As3 ) = Aut = t 6= 0
0 0 21 0 z t
on the part B of D35
 1   1   
0 0 0 0 0 0 1 0
2 = g −1 2
1 g⊗2 , where g = .
δ1 0 0 0 0 2 0 0 z t
We get an inconsistent system of equations.
20 I.S.RAKHIMOV

Case 2: δ3 6= 0 =⇒ δ1 = 0 δ2 = 0 and δ3 = 12

 α1 = 12 β1 = 0 γ1 = 21 δ1 = 0

α2 = 0 β2 = 0 γ2 = 0 δ2 = 0

AXIOM 4,5 =⇒ 1 1

 α 3 = 0 β3 = 2 γ3 = 0 δ3 = 2

 α = 0 β = 0 γ = 0 δ =
4 3 4 4 0
  1   1 
7 2 0 0 0 2 0 0 0
D3 := A = , B= .
0 0 12 0 0 0 21 0
 1 
5 2 0 0 α4
Consider A3 (α4 ) := , α4 ∈ F.
 0 12 21 0

 α1 = 12 β1 = 0 γ1 = 12 δ1 = 0
 α = 0 β = 1 γ = 0 δ

= 1
2 2 2 2 2 2
AXIOM 2 =⇒ 1 1
 α3 = 0 β3 = 2 γ3 = 0 δ3 =
 2

 α β3 = 0 γ4 = α4 δ4 = 0
4

 α1 = 21 β1 = 0 γ1 = 12 δ1 = 0
α2 = 0 β2 = 12 γ2 = 0 δ2 = 21


AXIOM 3,4,5 =⇒
 α3 = 0 β3 = 12 γ3 = 0 δ3
 = 21

 α
4 β3 = 0 γ4 = α4 δ4 = 0
  1   1 
D38 := A = 2 0 0 α4 , B = 2 0 0 α4
.
0 21 21 0 0 1
2
1
2 0
Theorem 7. Any non-trivial 2-dimensional associative dialgebra over a field F, (Char(F) = 6 2, 3) is
isomorphic to only one of the following listed by their matrices of structure constants, such algebras:
(1) Diassociative algebras generated by A13 :
    
1 0 0 0 0 0 0 0 0
• D13 := A = , B=
1 0 0 0 δ1 0 0 0
(2) Diassociative algebras generated by A3 :
    
2 1 0 0 0 1 0 0 0
• D3 := A = , B=
0 0 0 0 0 0 0 0
    
3 1 0 0 0 1 0 0 0
• D3 := A = , B=
0 0 0 0 0 1 0 0
    
4 1 0 0 0 1 0 0 0
• D3 := A = , B=
0 1 0 0 0 1 0 0
  1   1  
5 2 0 0 0 2 0 0 0
• D3 (δ1 ) := A = , B= , δ1 ∈ F
0 0 12 0 δ1 0 0 0
  1   1 
• D36 := A = 2 0 0 0 , B= 2 0 0 0
1
0 0 2 0 0 1 0 0
  1   1 2 
7 2 0 0 0 2 0 0 0
• D3 := A = , B=
0 0 12 0 0 0 21 0
  1   1  
8 2 0 0 α4 2 0 0 α4
• D3 := A = , B= , α4 ∈ F
0 21 12 0 0 12 21 0
According to a result of [8] there are four classes of two-dimensional associative dialgebras over C
given as follows
    
1 1 0 0 0 1 0 0 0 ∼
Dias := A = , B= = D35 (0);
0 0 1 0 0 0 0 0
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
21
    
1 0 0 0 1 0 0 0 ∼
Dias2 := A = , B= = D33 ;
0 0 0 0 0 1 0 0
     
0 0 0 0 0 0 0 0
3
Dias := A = , B= , α∈C ∼ 1 ;
= D13
1 0 0 0 α 0 0 0
    
1 0 0 0 1 0 0 0 ∼
Dias4 := A = , B= = D36 .
0 0 1 0 0 1 0 0
Since Theorem 7 includes the case Char(C) = 0 the list in [8] must be accordingly corrected.

4.2. Characteristic of F is two.

In the case of the characteristic of the field F is two the associative dialgebras generated from the
list of Theorem 5 are as follows:

1 0 0 0 0
From As12,2 = we get
1 0 0 0
     
1 0 0 0 0 0 0 0 0
D12,2 := A = , B= , δ1 ∈ F .
1 0 0 0 δ1 0 0 0
   
0 1 1 0 0 1 1 0
The algebra As211,2 (β1 ) = ≃ 2 , where a, b, β1 ∈ F and b 6= 0
β1 0 0 1 b (β1 + a2 ) 0 0 1
produces
     
2 0 1 1 0 0 1 1 0
D11,2:= A = , B= , β1 ∈ F .
β1 0 0 1 β1 0 0 1
 
1 0 0 0
From As36,2 = we get
0 0 1 0
     
3 1 0 0 0 1 0 0 0
D6,2 := A = , B= , β1 ∈ F
0 0 1 0 β1 0 0 0
    
4 1 0 0 0 1 0 0 0
D6,2 := A = , B=
0 0 1 0 0 1 0 0
    
5 1 0 0 0 1 0 0 0
D6,2 := A = , B= .
0 0 1 0 0 0 1 0
3 , D 4 and D 5 are not isomorphic
The diassociative algebras D6,2 to each others since the group of
6,2 6,2
automorphisms of As36,2 is trivial.
 
4 1 1 1 0
Consider As4,2 (β1 ) = . This generates
β1 0 0 1
    
6 1 1 1 0 1 1 1 0
D4,2 := A = , B= .
0 0 0 1 0 0 0 1
 
5 1 0 0 0
From As3,2 = we get
0 0 0 0
    
7 1 0 0 0 1 0 0 0
D3,2 := A = , B=
0 0 0 0 0 0 0 0
    
8 1 0 0 0 1 0 0 0
D3,2 := A = , B=
0 0 0 0 0 1 0 0
22 I.S.RAKHIMOV

7 and D 8 are not isomorphic since there is no an element of the automorphism

The algebras D3,2 3,2
group
  
6 1 0
Aut(As3,2 ) = z, t ∈ F and t 6= 0 .
z t
7 to the part B of D 8 .
sending the part B of D3,2 3,2
 
1 0 0 0
Finally, from As63,2 = we get
0 1 0 0
    
9 1 0 0 0 1 0 0 0
D3,2 := A = , B= .
0 1 0 0 0 1 0 0

Theorem 8. Any non-trivial 2-dimensional associative dialgebra over a field F, (Char(F) = 2) is

isomorphic to only one of the following listed by their matrices of structure constants, such algebras:
     
1 0 0 0 0 0 0 0 0
(1) D12,2 := A = , B= , δ1 ∈ F
1 0 0 0 δ1 0 0 0
     
2 0 1 1 0 0 1 1 0
(2) D11,2 := A = , B= , β1 ∈ F
β1 0 0 1 β1 0 0 1
     
3 := A = 1 0 0 0 1 0 0 0
(3) D6,2 , B= , β1 ∈ F
0 0 1 0 β1 0 0 0
    
4 1 0 0 0 1 0 0 0
(4) D6,2 := A = , B=
0 0 1 0 0 1 0 0
    
5 := A = 1 0 0 0 1 0 0 0
(5) D6,2 , B=
0 0 1 0 0 0 1 0
    
6 1 1 1 0 1 1 1 0
(6) D4,2 := A = , B=
0 0 0 1 0 0 0 1
    
7 := A = 1 0 0 0 1 0 0 0
(7) D3,2 , B=
0 0 0 0 0 0 0 0
    
8 1 0 0 0 1 0 0 0
(8) D3,2 := A = , B=
0 0 0 0 0 1 0 0
    
9 := A = 1 0 0 0 1 0 0 0
(9) D3,2 , B= .
0 1 0 0 0 1 0 0

4.3. Characteristic of F is three. 

1 0 0 0 0
The associative algebra As13,3 = produces the diassociative algebra
1 0 0 0
     
1 0 0 0 0 0 0 0 0
D13,3 := A = , B= , δ1 ∈ F .
1 0 0 0 δ1 0 0 0
 
1 0 0 0
From As23,3 = we get the diassociative algebras
0 0 0 0
    
2 1 0 0 0 1 0 0 0
D3,3 := A = , B=
0 0 0 0 0 0 0 0
    
3 1 0 0 0 1 0 0 0
D3,3 := A = , B= .
0 0 0 0 0 1 0 0
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
23

2 and D 3 are not isomorphic because there is no an element of the automorphism

The algebras D3,3 3,3
group  
2 1 0
Aut(As3,3 ) =
z t
2 to B of D 3 .
sending B of D3,3 3,3
 
1 0 0 0
The associative algebra As33,3
= generates
0 1 0 0
    
4 1 0 0 0 1 0 0 0
D3,3 := A = , B= .
0 1 0 0 0 1 0 0
 
2 0 0 0
From As43,3 = we get
0 0 2 0
     
5 2 0 0 0 2 0 0 0
D3,3 := A = , B= , δ1 ∈ F
0 0 2 0 δ1 0 0 0
    
6 2 0 0 0 2 0 0 0
D3,3 := A = , B=
0 0 2 0 0 2 0 0
    
7 2 0 0 0 2 0 0 0
D3,3 := A = , B= .
0 0 2 0 0 0 2 0
In order to check the isomorphisms between D3,3 5 , D 6 and D 7 we act by the elements of automor-
3,3 3,3
phism group   
1 0
Aut(As43,3 ) = t 6= 0
1 + 2t t
to B parts of each algebras:
     
2 0 0 0 −1 2 0 0 0 ⊗2 1 0
=g g , where g =
δ1 0 0 0 0 2 0 0 1 + 2t t
     
2 0 0 0 −1 2 0 0 0 ⊗2 1 0
=g g , where g =
0 2 0 0 0 0 2 0 1 + 2t t
     
2 0 0 0 −1 2 0 0 0 ⊗2 1 0
=g g , where g = .
0 0 2 0 δ1 0 0 0 1 + 2t t
As a result we get inconsistent
 systems
 of equations.
2 0 0 α 4
Finally, As53,3 = generates the following diassociative algebra
0 2 2 0
    
8 2 0 0 α4 2 0 0 α4
D3,3 := A = , B=
0 2 2 0 0 2 2 0
Theorem 9. Any non-trivial 2-dimensional associative dialgebra over a field F, (Char(F) = 3) is
isomorphic to only one of the following listed by their matrices of structure constants, such algebras:
     
1 0 0 0 0 0 0 0 0
(1) D13,3 := A = , B= , δ1 ∈ F
1 0 0 0 δ1 0 0 0
    
2 := A = 1 0 0 0 1 0 0 0
(2) D3,3 , B=
0 0 0 0 0 0 0 0
    
3 1 0 0 0 1 0 0 0
(3) D3,3 := A = , B=
0 0 0 0 0 1 0 0
24 I.S.RAKHIMOV
    
4 1 0 0 0 1 0 0 0
(4) D3,3 := A = , B=
0 1 0 0 0 1 0 0
     
5 2 0 0 0 2 0 0 0
(5) D3,3 := A = , B= , δ1 ∈ F
0 0 2 0 δ1 0 0 0
    
6 2 0 0 0 2 0 0 0
(6) D3,3 := A = , B=
0 0 2 0 0 2 0 0
    
7 2 0 0 0 2 0 0 0
(7) D3,3 := A = , B=
0 0 2 0 0 0 2 0
    
8 2 0 0 α4 2 0 0 α4
(8) D3,3 := A = , B=
0 2 2 0 0 2 2 0

5. Acknowledgement
The author is gratefull to Professor U. Bekbaev for fruitifull disccussion on the research.

References
[1] J.Q. Adashev, A.Kh. Khudoyberdiev, B.A. Omirov, Classification of complex naturally graded quasi-filiform
Zinbiel algebras, Contemporary Math., AMS, 483, 2009.
[2] J.Q. Adashev, B.A. Omirov, A.Kh. Khudoyberdiev, Classification of some classes of Zinbiel algebras, J. Gen.
Lie Theor. and Appl., 4, 2010.
[3] H. Ahmed, U.D. Bekbaev, I.S. Rakhimov, Subalgebras, idempotents, ideals and quasi-units of two-dimensional
algebras, International Journal of Algebra and Computations, 2020, 30(5), 903–929.
[4] H. Ahmed, U.D. Bekbaev, I.S.Rakhimov, Canonical form algorithm and separating systems for two-dimensional
algebras, Malaysian Journal of Math. Sciences, 16(3): 413–435, 2022.
[5] H. Ahmed, U.D. Bekbaev, I.S.Rakhimov, Identities on Two-Dimensional Algebras, Lobachevskii Journal of Math-
ematics, 2020, 41(9), 1615–1629.
[6] S. Albeverio, Sh.A. Ayupov, B.A. Omirov, A. Khudoyberdiyev, n-dimensional filiform Leibniz algebras of
length (n-1) and their derivations, Journal of Algebra, 2008, 319, 2471–2488.
[7] S. Albeverio, B.A. Omirov, I.S. Rakhimov, Varieties of nilpotent complex Leibniz algebras of dimension less
than five, Communications in Algebra, 2005, 33, 1575–1585.
[8] W. Basri , I.M. Rikhsiboev, On low-dimensional diassociative algebras, ICREM 3, UPM, 2007, 164–170.
[9] W. Basri,, I.S. Rakhimov, I.M. Rikhsiboev, On four-dimensional nilpotent Diassociative algebras, Journal of
Generalized Lie Theory and Applications, 2015, 9(1).
[10] Barnes D.W., On Levi’s theorem for Leibniz algebras, Bull. Aust. Math. Soc., 86(2), 2012, 184–185.
[11] U. Bekbaev, Classification of two-dimensional algebras over any basic field, 2023, J. Phys.: Conf. Ser.
[12] U. Bekbaev, On classification of m-dimensional algebras, 2017, J. Phys.: Conf. Ser., 819 012012
[13] J.M. Casas, M. Ladra, B.A. Omirov, I.A. Karimjanov, Classification of solvable Leibniz algebras with naturally
graded filiform nilradical, Linear Algebra and its Applications, 2013, 438(7), 2973–3000.
[14] J.M. Casas, M.A. Insua, M. Ladra, S. Ladra, An algorithm for the classification of 3-dimensional complex
Leibniz algebras, Linear Algebra and its Applications, 2012, 436(9), 3747–3756.
[15] A.S. Dzhumadildaev, K.M. Tulenbaev, Nilpotency of Zinbiel Algebras, Journal of Dynamical and Control
Systems, 2005, 11(2), 195–213.
[16] Guo L., Ebrahimi-Fard K., Rota-Baxter algebras and Dendriform algebras, Journal of Pure and Appl. Algebra,
2008, 212, 320–339.
[17] A.Kh. Khudoyberdiyev, I.S. Rakhimov, Sh.K. Said Husain, On classification of 5-dimensional solvable Leibniz
algebras, Linear Algebra and its Applications, 2014, 457, 428–454.
[18] J.-L. Loday , Une version non commutative des algebras de Lie: les algebras de Leibniz, Enseign. Math, No. 39,
(1993), 269-293.
[19] J.-L. Loday, A. Frabetti, F. Chapoton, F. Goichot, Dialgebras and Related Operads, Lecture Notes in Math-
ematics, IV, 2001, 1763.
COMPLETE CLASSIFICATION OF TWO-DIMENSIONAL ASSOCIATIVE AND DIASSOCIATIVE ALGEBRAS OVER ANY BASIC FIELD
25

[20] B.A. Omirov, I.S. Rakhimov, On Lie-like filiform Leibniz algebras, Bulletin of the Australian athematical Society,
79: 391–404, (2009).
[21] I.S. Rakhimov, U.D. Bekbaev, On isomorphism classes and invariants of Finite Dimensional Complex Filiform
Leibniz Algebras, Communications in Algebra, 38(12), 4705–4738.
[22] I.S. Rakhimov, A.Kh.Khudoyberdiyev, B.A.Omirov, K.A.Mohd Atan, On isomorphism criterion for a sub-
class of complex filiform Leibniz algebras, International Journal of Algebra and Computations, 2017, 27(7), 953-972.
[23] I.S. Rakhimov, On classification problem of Loday algebras, Contemporary Mathematics, AMS, 672, 225–244, 2016.
[24] I.M. Rikhsiboev, I.S. Rakhimov, W. Basri, Classification of 3-dimensional complex diassociative algebras,
Malaysian Journal of Mathematical Sciences, 2010, 4(2), 241–254.
[25] I.M. Rikhsiboev, I.S. Rakhimov, W. Basri, Diassociative algebras and their derivations, Journal of Physics,
Conference Series, 2014, 553, 012006, 1–9.
[26] Rikhsiboev I.M., Rakhimov I.S., Basri W., The description of dendriform algebra structures on two-dimensional
complex space, Journal of Algebra, Number Theory: Advances and Appl., 2010, 4(1), 1–18.