Preprint
Article

First Exploration of a Novel Generalization of Lie and Malcev Algebras Leading to the Emergence of Complex Structures

Altmetrics

Downloads

70

Views

37

Comments

0

This version is not peer-reviewed

Submitted:

15 June 2024

Posted:

17 June 2024

You are already at the latest version

Alerts
Abstract
We introduce a novel algebraic structure, termed algebra B, which generalizes Lie algebras through the definition of a non-associative and unital algebra. We demonstrate that algebra B retains essential properties such as bilinearity and antisymmetry, and satisfies both the Jacobi and Malcev identities; this occurs when the product operations of Lie and Malcev algebras are derived from the product operation defined in our algebra. By examining the connections between algebra B, Malcev algebras, and Lie algebras, we establish that algebra B effectively generalizes these structures. Furthermore, we show that algebra B can generate complex entities with a novel structure distinct from those currently known. Our findings lay the groundwork for future investigations into the practical applications and further theoretical development of this new algebraic framework.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory

1. Introduction

Lie algebras are fundamental in both mathematics and theoretical physics due to their capacity to describe and analyze symmetries and continuous transformations. They find key applications in group theory, differential geometry, and representation theory, providing essential tools for studying algebraic and geometric structures. In theoretical physics, Lie algebras are crucial in quantum mechanics, quantum field theory, and general relativity, where they help understand the fundamental symmetries of physical laws and the behavior of particles and fields. This versatility and explanatory power make Lie algebras a central topic in advanced research [1,2].
The pursuit of generalizing mathematical definitions and exploring increasingly fundamental entities is a cornerstone of mathematical research. Lie algebras serve as a bridge between quantum mechanics and general relativity [2,3], motivating the search for a “unifying algebra” capable of integrating these two pivotal theories.
In this study, we present a comprehensive analysis of a novel algebraic structure, denoted as algebra B, designed to generalize Lie algebras through the definition of a non-associative and unital algebra. We demonstrate that the algebra B preserves essential algebraic properties such as bilinearity and antisymmetry, and satisfies both the Jacobi and Malcev identities when the products defining these algebras are derived from the product of the algebra B. By examining the interrelations between algebra B, Malcev algebras, and Lie algebras, we establish that algebra B functions as a valid and broad generalization of these structures. Moreover, we reveal that algebra B possesses the remarkable ability to generate imaginary units and complex entities with unique structures, distinct from those currently known. These findings open new avenues for theoretical investigation and practical application, providing a framework for future research in algebraic symmetries and transformations.

1.1. Lie Algebra

A Lie algebra is an algebraic structure consisting of a vector space g over a field K, together with a binary operation called the Lie bracket, denoted by [ , ] : g × g g , which satisfies the following properties [3,4,5]:
  • Bilinearity: λ , γ K ; a , b , c g : [ λ a + γ b , c ] = λ [ a , c ] + γ [ b , c ] and [ c , λ a + γ b ] = λ [ c , a ] + γ [ c , b ] .
  • Antisymmetry: a , b g : [ a , b ] = [ b , a ] . This property implies that a g : [ a , a ] = 0 .
  • Jacobi Identity: [ a , [ b , c ] ] + [ b , [ c , a ] ] + [ c , [ a , b ] ] = 0 , a , b , c g .
This structure is not necessarily associative, as the antisymmetry property and the Jacobi identity do not imply the associativity of the Lie bracket operation [3,4].

1.2. Malcev Algebras

Malcev algebras, which are a direct generalization of Lie algebras, form an important algebraic structure. While every Lie algebra is inherently a Malcev algebra, the converse is not true; not all Malcev algebras are Lie algebras. The defining feature of Malcev algebras is their satisfaction of a specific identity analogous to the Jacobi identity, known as the Malcev identity [6,7].
A Malcev algebra is defined as an algebraic structure comprising a vector space M over a field K, equipped with a binary operation [ , ] : M × M M . This operation adheres to the following properties [6,7]:
  • Antisymmetry: a , b M : [ a , b ] = [ b , a ] .
  • Malcev Identity: a , b , c M : [ [ a , b ] , [ a , c ] ] = [ [ [ a , b ] , c ] , a ] + [ [ [ b , c ] , a ] , a ] + [ [ [ c , a ] , a ] , b ] .
The Malcev identity serves as a generalization of the Jacobi identity found in Lie algebras. Specifically, within the context of a Lie algebra, the Malcev identity simplifies to the Jacobi identity, highlighting the foundational relationship between these two algebraic structures [6,8].
Therefore, an algebra that aims to generalize both Lie and Malcev algebras must, by definition, satisfy the bilinearity of the product, antisymmetry, the Jacobi identity, and the Malcev identity.

2. Construction of Algebra ( V , )

2.1. Algebraic Structure of the Vector Space V

Let the set V be a mathematical entity that satisfies the Zermelo-Fraenkel axioms and the Axiom of Choice [9,10].
Let the algebraic structure of the vector space be defined as V ( V 3 , + , · ) over the field F, where + is the addition operation in V 3 and the operation · denotes scalar multiplication of the elements of V 3 with the elements of the field F. The elements of V, which we will call vectors, are defined as ordered 3-tuples of the form ( v 1 , v 2 , v 3 ) such that v i F . Thus, we have defined a vector space over a field F whose vectors contain entries in F [11,12]. The addition operation + is defined as:
+ : V × V V , ( ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) , ( a 1 , a 2 , a 3 ) + ( b 1 , b 2 , b 3 ) ( a 1 + b 1 , a 2 + b 2 , a 3 + b 3 ) .
This operation, defined through elements of F, is associative and commutative. The identity element of the addition is ( 0 , 0 , 0 ) id + , and the inverse elements correspond to the additive inverses in F[11]: ( a 1 , a 2 , a 3 ) + ( a 1 , a 2 , a 3 ) = id + . Thus, the substructure ( V 3 , + ) is an abelian group [11,13].
The scalar multiplication operation · is defined as:
· : F × V V , ( λ , ( a 1 , a 2 , a 3 ) ) λ · ( a 1 , a 2 , a 3 ) , λ · ( a 1 , a 2 , a 3 ) ( λ · a 1 , λ · a 2 , λ · a 3 ) , λ F .
This operation is associative, commutative, distributive with respect to vector addition, and distributive with respect to addition in F[11]. The identity element corresponds to the identity in F: id · · ( a 1 , a 2 , a 3 ) = ( a 1 , a 2 , a 3 ) . Thus, the substructure ( V 3 , · ) is a commutative monoid [11,13].
Therefore, the complete structure V ( V 3 , + , · ) is a commutative ring [11,13].

2.2. Definition of the Algebra ( V , )

We equip the structure V with a bilinear product operation ⊙, thus generating an F-algebra B that we denote as B ( V , ) .
Let the arbitrary 3-tuples ( a 1 , a 2 , a 3 ) and ( b 1 , b 2 , b 3 ) , we define the product operation: The operation ⊙ is defined as:
: V × V V , ( ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) , ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ( a 1 · b 1 a 2 · b 2 a 3 · b 3 , a 1 · b 2 + a 2 · b 1 + a 3 · b 2 , a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) .
In algebra B, the equality between elements is defined as follows:
a , b F : ( a 1 , a 2 , a 3 ) = ( b 1 , b 2 , b 3 ) a 1 = b 1 a 2 = b 2 a 3 = b 3 .

2.2.1. Bilinearity of the Product

Our definition of the product satisfies (see Appendix A) the following three properties of bilinearity:
  • Left distributivity with respect to addition +: ( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) + ( c 1 , c 2 , c 3 ) ) = ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) + ( a 1 , a 2 , a 3 ) ( c 1 , c 2 , c 3 ) .
  • Right distributivity with respect to addition +: ( ( a 1 , a 2 , a 3 ) + ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) = ( a 1 , a 2 , a 3 ) ( c 1 , c 2 , c 3 ) + ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) .
  • Multiplication · of field elements with respect to ⊙: λ F : ( λ · ( a 1 , a 2 , a 3 ) ) ( b 1 , b 2 , b 3 ) = ( a 1 , a 2 , a 3 ) ( λ · ( b 1 , b 2 , b 3 ) ) = λ · ( ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ) .
This last property arises directly from the commutativity of the entries of the vectors, which are elements of F, with respect to the elements of the field F of the algebra.

2.2.2. Basic Properties of Algebra B

2.2.2.1. Non-Associativity and Non-Alternativity

Our algebra exhibits non-associativity (see Appendix B), hence:
( ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) ( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) ) .
We define the Associator operator as ASSOC : = ( X Y ) Z X ( Y Z ) , such that X , Y , Z V . According to this definition:
ASSOC = ( ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) ( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) ) = ( d , f , g ) ,
where: d = ( a 3 · b 2 · c 2 ) ( a 3 · b 2 · c 3 ) + ( a 2 · b 3 · c 2 ) + ( a 3 · b 3 · c 2 ) , f = ( a 3 · b 3 · c 2 ) + ( a 3 · b 2 · c 2 ) + ( a 2 · b 3 · c 3 ) ( a 3 · b 3 · c 2 ) , and g = ( a 2 · b 2 · c 3 ) + ( a 3 · b 2 · c 2 ) ( a 3 · b 3 · c 2 ) + ( a 3 · b 2 · c 2 ) . This demonstrates that our algebra is a non-associative F-algebra.
A non-associative algebra can be an alternative algebra if it satisfies X ( X Y ) = ( X X ) Y and ( Y X ) X = Y ( X X ) for all X , Y in the algebra [14,15]. We examine this property because an alternative algebra may be made into a Malcev algebra by defining the Malcev product as [ X , Y ] X Y Y X [6,8,14,15].
We explored both properties: X ( X Y ) = ( X X ) Y and ( Y X ) X = Y ( X X ) .
We verified that the property X ( X Y ) = ( X X ) Y does not hold in our algebra (see Appendix C), and for this property, we defined an Alternativator operator, ALTER 1 , such that:
ALTER 1 X ( X Y ) ( X X ) Y .
Our Alternativator ALTER 1 resulted in the following:
ALTER 1 = ( a 3 · a 3 · b 2 + a 3 · a 2 · b 3 , a 2 · a 3 · b 3 + a 3 · a 3 · b 2 + a 3 · a 3 · b 2 a 3 · a 2 · b 2 , a 3 · a 3 · b 2 a 3 · a 2 · b 2 + a 2 · a 2 · b 3 a 3 · a 2 · b 2 ) .
The property ( Y X ) X = Y ( X X ) also did not hold in our algebra (see Appendix C). For this case, we defined the Alternativator operator, ALTER 2 , as follows:
ALTER 2 ( Y X ) Y Y ( X X ) =
( b 2 · a 3 · a 2 + b 3 · a 2 · a 2 , b 2 · a 3 · a 3 + b 3 · a 3 · a 2 + b 3 · a 3 · a 2 b 3 · a 2 · a 2 , b 3 · a 3 · a 2 b 3 · a 2 · a 2 + b 2 · a 2 · a 3 b 3 · a 2 · a 2 ) .
Therefore, the algebra B is non-associative and non-alternative.

2.2.2.2. Non-Commutativity and Antisymmetry

We define the Commutator (or Bracket) operator [ X , Y ] X Y Y X , where X , Y V . According to this definition:
[ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] =
( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ( b 1 , b 2 , b 3 ) ( a 1 , a 2 , a 3 ) = ( 0 , a 3 · b 2 b 3 · a 2 , a 3 · b 2 b 3 · a 2 ) = β · ( 0 , 1 , 1 ) ,
where β a 3 · b 2 b 3 · a 2 , 1 represents the identity element for multiplication · in the field F, and 0 denotes the identity element for addition in F. This demonstrates that our algebra is non-commutative.
Note that the commutator results in the cancellation of the first component. Furthermore, it reveals the field element β = a 3 · b 2 b 3 · a 2 . In this way, our commutator has the structure of a determinant:
det ( u , a , b ) = 1 0 0 a 1 a 2 a 3 b 1 b 2 b 3 = a 2 a 3 b 2 b 3 = a 3 · b 2 a 2 · b 3 ,
where u ( 1 , 0 , 0 ) , a ( a 1 , a 2 , a 3 ) and b ( b 1 , b 2 , b 3 ) .
Therefore, we can define our commutator generically as:
[ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] = det ( u , a , b ) · ( 0 , 1 , 1 ) ,
If we evaluate the commutator of the same element, we have:
[ ( a 1 , a 2 , a 3 ) , ( a 1 , a 2 , a 3 ) ] = ( a 1 , a 2 , a 3 ) ( a 1 , a 2 , a 3 ) ( a 1 , a 2 , a 3 ) ( a 1 , a 2 , a 3 ) = ( 0 , 0 , 0 ) .
On the other hand, let’s analyze the following commutators:
[ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] = ( 0 , a 3 · b 2 b 3 · a 2 , a 3 · b 2 b 3 · a 2 ) ,
[ ( b 1 , b 2 , b 3 ) , ( a 1 , a 2 , a 3 ) ] = ( 0 , a 3 · b 2 a 2 · b 3 , a 3 · b 2 b 3 · a 2 ) = [ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] .
Thus:
[ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] = [ ( b 1 , b 2 , b 3 ) , ( a 1 , a 2 , a 3 ) ] ,
where this property manifests as the antisymmetry of the operation [ X , Y ] when defined via the product ⊙ in algebra B.
Note that algebra B itself is not antisymmetric, due to:
( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ( b 1 , b 2 , b 3 ) ( a 1 , a 2 , a 3 ) .

2.2.2.3. Identity Element

The identity element of the product ⊙ in B is ( 1 , 0 , 0 ) . According to this, we have:
( a 1 , a 2 , a 3 ) ( 1 , 0 , 0 ) = ( 1 , 0 , 0 ) ( a 1 , a 2 , a 3 ) = ( a 1 , a 2 , a 3 ) .
Knowing that u ( 1 , 0 , 0 ) , we can redefine the commutator as:
[ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] = det ( id , a , b ) · ( 0 , 1 , 1 ) ,
where we have redefined u as id ( 1 , 0 , 0 ) .
The existence of an identity element makes our algebra a unital algebra.

2.3. Relation of Algebra B with Malcev and Lie Algebras

Our algebra is non-commutative and non-associative. Due to their structural properties, Malcev and Lie algebras could be related to our algebra. To verify the similarities between algebra B and both Malcev and Lie algebras, we need to demonstrate that algebra B satisfies the defining properties of Malcev and Lie algebras.

2.3.1. Relation of Algebra B with Lie Algebra

To demonstrate that a Lie algebra derives from our algebra B, it is necessary to show that the Lie bracket defined from our product ⊙ satisfies the properties of bilinearity and the Jacobi identity, as antisymmetry has been previously demonstrated in section “2.2.2. Non-Commutativity and Antisymmetry”.

2.3.1.1. Bilinearity of the Commutator

We have established that the bilinearity of the Lie bracket, defined from the product ⊙, holds true (see Appendix D). This confirms that the following property is satisfied in our algebra:
λ , γ F : [ λ ( a 1 , a 2 , a 3 ) + γ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] = λ [ ( a 1 , a 2 , a 3 ) , ( c 1 , c 2 , c 3 ) ] + γ [ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] .

2.3.1.2. Jacobi Identity

The Jacobi identity [3,4] holds in algebra B when we define the Lie bracket through our product ⊙. Therefore, the Jacobi identity is a property that represents a particular case in algebra B (see Appendix E).

2.3.2. Construction of Malcev Algebra through Algebra B

The Malcev identity is satisfied if a , b , c M : [ [ a , b ] , [ a , c ] ] = [ [ [ a , b ] , c ] , a ] + [ [ [ b , c ] , a ] , a ] + [ [ [ c , a ] , a ] , b ] [6,7].
We verify that the algebra B satisfies the Malcev identity by defining the brackets in terms of the product ⊙ (see Appendix F). In fact, it satisfies the identity in a particular way; in our algebra, this identity has the following structure:
a , b , c V : [ [ a , b ] , [ a , c ] ] = [ [ [ a , b ] , c ] , a ] + [ [ [ b , c ] , a ] , a ] + [ [ [ c , a ] , a ] , b ] = ( 0 , 0 , 0 ) .
Thus, for algebra B, the following identities hold:
[ [ [ a , b ] , c ] , a ] = [ [ [ b , c ] , a ] , a ] [ [ [ c , a ] , a ] , b ] ,
[ [ [ b , c ] , a ] , a ] = [ [ [ a , b ] , c ] , a ] [ [ [ c , a ] , a ] , b ] ,
[ [ [ c , a ] , a ] , b ] = [ [ [ a , b ] , c ] , a ] [ [ [ b , c ] , a ] , a ] .

3. Generation of Complex Entities from B

We extracted other basic properties of the algebra B by evaluating the product of several vectors with particular structures. From this analysis, imaginary units emerged for our algebra. Thus, the algebra B is capable of generating complex entities.

3.1. Imaginary Unit i in B

Let the product ( 0 , a 2 , 0 ) ( 0 , b 2 , 0 ) = ( a 2 · b 2 , 0 , 0 ) . In this way, for the case a 2 = b 2 = 1 , we have:
( 0 , 1 , 0 ) ( 0 , 1 , 0 ) = ( 1 , 0 , 0 ) = id .
Which, if we define i ( 0 , 1 , 0 ) and i 2 i i results in:
i 2 = id .
Note also that ( 1 , 0 , 0 ) ( 1 , 0 , 0 ) = ( 1 , 0 , 0 ) = id .

3.2. Imaginary Unit j in B

Let the product ( 0 , 0 , a 3 ) ( 0 , 0 , b 3 ) = ( a 3 · b 3 , 0 , 0 ) . In this way, if a 3 = b 3 = 1 , we have:
( 0 , 0 , 1 ) ( 0 , 0 , 1 ) = id .
Defining j ( 0 , 0 , 1 ) results in:
j 2 = id .
We then define the complex number b = ( b 1 , b 2 , b 3 ) such that:
b 1 = Re ( b ) ,
b 2 = Im 1 ( b ) ,
b 3 = Im 2 ( b ) ,
where Re ( b ) is read as “real part of b”, Im 1 ( b ) is read as “first imaginary part of b”, and Im 2 ( b ) is read as “second imaginary part of b”.
Consistent with this, we may consider the elements ( b 1 , b 2 , b 3 ) of the algebra B as complex entities, such that the following expression can be defined:
b = ( b 1 , b 2 , b 3 ) = b 1 · ( 1 , 0 , 0 ) + b 2 · ( 0 , 1 , 0 ) + b 3 · ( 0 , 0 , 1 ) = b 1 + b 2 · i + b 3 · j , i 2 = j 2 = id .

4. Other Properties

4.1. Nullification of the Product a · i b · j

In our algebra, the product of the form ( 0 , a 2 , 0 ) ( 0 , 0 , b 3 ) results in a null vector, 0 ( 0 , 0 , 0 ) . Therefore,
a · i b · j = 0 .
We will call this property “orthomulearity”, simply because it resembles the orthogonality of vector spaces under the inner product. In our algebra, when two elements of the type a · i and b · j are multiplied with ⊙, the result nullifies regardless of the factors involved.

4.2. Product a 3 · j b 2 · i

Let ( 0 , 0 , a 3 ) ( 0 , b 2 , 0 ) , we have:
( 0 , 0 , a 3 ) ( 0 , b 2 , 0 ) = ( 0 , a 3 · b 2 , a 3 · b 2 ) = a 3 · b 2 · ( 0 , 1 , 1 ) ,
and, for a 3 = b 2 = 1 :
( 0 , 0 , 1 ) ( 0 , 1 , 0 ) = ( 0 , 1 , 1 ) .
Writing ( 0 , 0 , a 3 ) ( 0 , b 2 , 0 ) in the form a 3 · j b 2 · i , we have:
a 3 · j b 2 · i = ( a 3 · b 2 ) · j i = ( a 3 · b 2 ) · ( 0 , 1 , 1 ) = ( a 3 · b 2 ) · ( ( 0 , 0 , 1 ) ( 0 , 1 , 0 ) ) .

5. Conclusions

We have introduced a novel algebraic structure termed algebra B, which generalizes Lie algebras through the definition of a non-associative and unital algebra. Our results demonstrate that algebra B retains essential properties such as bilinearity and antisymmetry, and satisfies both the Jacobi and Malcev identities when we define the product of their corresponding algebras through the product of our algebra.
We have shown that algebra B can be considered a valid generalization of Malcev and Lie algebras, highlighting its potential to integrate fundamental algebraic structures. Additionally, the ability of algebra B to generate imaginary units and complex entities opens new avenues for research in algebraic symmetries and transformations.
Future research should focus on exploring its practical applications and extending the theoretical framework established here.
Our study significantly contributes to the field of algebra theory, offering a new perspective and potential tools for the investigation of algebraic structures and their applications across various scientific disciplines. This research sets the stage for future explorations in the quest for a unifying algebra that can integrate key concepts in mathematics and theoretical physics.

Appendix A. Proof of the Bilinearity of the Product ⊙

Left distributivity with respect to addition +
( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) + ( c 1 , c 2 , c 3 ) ) = ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) + ( a 1 , a 2 , a 3 ) ( c 1 , c 2 , c 3 ) .
Left-hand side: Expanding +:
( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) + ( c 1 , c 2 , c 3 ) ) = ( a 1 , a 2 , a 3 ) ( b 1 + c 1 , b 2 + c 2 , b 3 + c 3 ) = ( a 1 · ( b 1 + c 1 ) a 2 · ( b 2 + c 2 ) a 3 · ( b 3 + c 3 ) , a 1 · ( b 2 + c 2 ) + a 2 · ( b 1 + c 1 ) + a 3 · ( b 2 + c 2 ) , a 1 · ( b 3 + c 3 ) + a 3 · ( b 2 + c 2 ) + a 3 · ( b 1 + c 1 ) ) = ( a 1 · b 1 + a 1 · c 1 a 2 · b 2 a 2 · c 2 a 3 · b 3 a 3 · c 3 , a 1 · b 2 + a 1 · c 2 + a 2 · b 1 + a 2 · c 1 + a 3 · b 2 + a 3 · c 2 , a 1 · b 3 + a 1 · c 3 + a 3 · b 2 + a 3 · c 2 + a 3 · b 1 + a 3 · c 1 ) .
Right-hand side:
( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) + ( a 1 , a 2 , a 3 ) ( c 1 , c 2 , c 3 ) = ( a 1 · b 1 a 2 · b 2 a 3 · b 3 + a 1 · c 1 a 2 · c 2 a 3 · c 3 , a 1 · b 2 + a 2 · b 1 + a 3 · b 2 + a 1 · c 2 + a 2 · c 1 + a 3 · c 2 , a 1 · b 3 + a 3 · b 2 + a 3 · b 1 + a 1 · c 3 + a 3 · c 2 + a 3 · c 1 ) .
Left-hand side = Right-hand side.
Right distributivity with respect to addition +
( ( a 1 , a 2 , a 3 ) + ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) = ( a 1 , a 2 , a 3 ) ( c 1 , c 2 , c 3 ) + ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) .
Left-hand side:
( ( a 1 , a 2 , a 3 ) + ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) = ( a 1 + b 1 , a 2 + b 2 , a 3 + b 3 ) ( c 1 , c 2 , c 3 ) = ( ( a 1 + b 1 ) · c 1 ( a 2 + b 2 ) · c 2 ( a 3 + b 3 ) · c 3 , ( a 1 + b 1 ) · c 2 + ( a 2 + b 2 ) · c 1 + ( a 3 + b 3 ) · c 2 , ( a 1 + b 1 ) · c 3 + ( a 3 + b 3 ) · c 2 + ( a 3 + b 3 ) · c 1 ) = ( a 1 · c 1 + b 1 · c 1 a 2 · c 2 b 2 · c 2 a 3 · c 3 b 3 · c 3 , a 1 · c 2 + b 1 · c 2 + a 2 · c 1 + b 2 · c 1 + a 3 · c 2 + b 3 · c 2 , a 1 · c 3 + b 1 · c 3 + a 3 · c 2 + b 3 · c 2 + a 3 · c 1 + b 3 · c 1 ) .
Right-hand side:
( a 1 , a 2 , a 3 ) ( c 1 , c 2 , c 3 ) + ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) = ( a 1 · c 1 a 2 · c 2 a 3 · c 3 , a 1 · c 2 + a 2 · c 1 + a 3 · c 2 , a 1 · c 3 + a 3 · c 2 + a 3 · c 1 ) + ( b 1 · c 1 b 2 · c 2 b 3 · c 3 , b 1 · c 2 + b 2 · c 1 + b 3 · c 2 , b 1 · c 3 + b 3 · c 2 + b 3 · c 1 ) = ( a 1 · c 1 a 2 · c 2 a 3 · c 3 + b 1 · c 1 b 2 · c 2 b 3 · c 3 , a 1 · c 2 + a 2 · c 1 + a 3 · c 2 + b 1 · c 2 + b 2 · c 1 + b 3 · c 2 , a 1 · c 3 + a 3 · c 2 + a 3 · c 1 + b 1 · c 3 + b 3 · c 2 + b 3 · c 1 ) .
Left-hand side = Right-hand side.
Multiplication · of field elements with respect to ⊙
( λ · ( a 1 , a 2 , a 3 ) ) ( b 1 , b 2 , b 3 ) = ( a 1 , a 2 , a 3 ) ( λ · ( b 1 , b 2 , b 3 ) ) = λ · ( ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ) , λ F .
This last property arises directly from the commutativity that exists in the entries of the vectors, which are elements of F, with respect to the elements of the field F of the algebra.

Appendix B. Proof of the Non-Associativity of the Product ⊙

We initially evaluate:
( ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) = ( ( a 1 · b 1 a 2 · b 2 a 3 · b 3 , a 1 · b 2 + a 2 · b 1 + a 3 · b 2 , a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) ( c 1 , c 2 , c 3 ) ) = ( ( a 1 · b 1 a 2 · b 2 a 3 · b 3 ) · c 1 ( a 1 · b 2 + a 2 · b 1 + a 3 · b 2 ) · c 2 ( a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) · c 3 , ( a 1 · b 1 a 2 · b 2 a 3 · b 3 ) · c 2 + ( a 1 · b 2 + a 2 · b 1 + a 3 · b 2 ) · c 1 + ( a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) · c 2 , ( a 1 · b 1 a 2 · b 2 a 3 · b 3 ) · c 3 + ( a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) · c 2 + ( a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) · c 1 ) .
Now we evaluate:
( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) ) = ( a 1 , a 2 , a 3 ) ( b 1 · c 1 b 2 · c 2 b 3 · c 3 , b 1 · c 2 + b 2 · c 1 + b 3 · c 2 , b 1 · c 3 + b 3 · c 2 + b 3 · c 1 ) = ( a 1 · ( b 1 · c 1 b 2 · c 2 b 3 · c 3 ) a 2 · ( b 1 · c 2 + b 2 · c 1 + b 3 · c 2 ) a 3 · ( b 1 · c 3 + b 3 · c 2 + b 3 · c 1 ) , a 1 · ( b 1 · c 2 + b 2 · c 1 + b 3 · c 2 ) + a 2 · ( b 1 · c 1 b 2 · c 2 b 3 · c 3 ) + a 3 · ( b 1 · c 2 + b 2 · c 1 + b 3 · c 2 ) , a 1 · ( b 1 · c 3 + b 3 · c 2 + b 3 · c 1 ) + a 3 · ( b 1 · c 2 + b 2 · c 1 + b 3 · c 2 ) + a 3 · ( b 1 · c 1 b 2 · c 2 b 3 · c 3 ) ) .
Comparing component by component:
First component:
( a 1 · b 1 · c 1 a 2 · b 2 · c 1 a 3 · b 3 · c 1 ) ( a 1 · b 2 · c 2 + a 2 · b 1 · c 2 + a 3 · b 2 · c 2 ) ( a 1 · b 3 · c 3 + a 3 · b 2 · c 3 + a 3 · b 1 · c 3 ) ( a 1 · b 1 · c 1 a 1 · b 2 · c 2 a 1 · b 3 · c 3 ) ( a 2 · b 1 · c 2 + a 2 · b 2 · c 1 + a 2 · b 3 · c 2 ) ( a 3 · b 1 · c 3 + a 3 · b 3 · c 2 + a 3 · b 3 · c 1 ) .
( a 3 · b 2 · c 2 ) ( a 3 · b 2 · c 3 ) ( a 2 · b 3 · c 2 ) ( a 3 · b 3 · c 2 ) .
Second component:
( a 1 · b 1 · c 2 a 2 · b 2 · c 2 a 3 · b 3 · c 2 ) + ( a 1 · b 2 · c 1 + a 2 · b 1 · c 1 + a 3 · b 2 · c 1 ) + ( a 1 · b 3 · c 2 + a 3 · b 2 · c 2 + a 3 · b 1 · c 2 ) ( a 1 · b 1 · c 2 + a 1 · b 2 · c 1 + a 1 · b 3 · c 2 ) + ( a 2 · b 1 · c 1 a 2 · b 2 · c 2 a 2 · b 3 · c 3 ) + ( a 3 · b 1 · c 2 + a 3 · b 2 · c 1 + a 3 · b 3 · c 2 ) .
( a 3 · b 3 · c 2 ) + ( a 3 · b 2 · c 2 ) ( a 2 · b 3 · c 3 ) + ( a 3 · b 3 · c 2 ) .
Third component:
( a 1 · b 1 · c 3 a 2 · b 2 · c 3 a 3 · b 3 · c 3 ) + ( a 1 · b 3 · c 2 + a 3 · b 2 · c 2 + a 3 · b 1 · c 2 ) + ( a 1 · b 3 · c 1 + a 3 · b 2 · c 1 + a 3 · b 1 · c 1 ) ( a 1 · b 1 · c 3 + a 1 · b 3 · c 2 + a 1 · b 3 · c 1 ) + ( a 3 · b 1 · c 2 + a 3 · b 2 · c 1 + a 3 · b 3 · c 2 ) + ( a 3 · b 1 · c 1 a 3 · b 2 · c 2 a 3 · b 3 · c 3 ) .
( a 2 · b 2 · c 3 ) + ( a 3 · b 2 · c 2 ) ( a 3 · b 3 · c 2 ) + ( a 3 · b 2 · c 2 ) .
In this way:
( ( a 1 , a 2 , a 3 ) ( b 1 , b 2 , b 3 ) ) ( c 1 , c 2 , c 3 ) ( a 1 , a 2 , a 3 ) ( ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) ) = ( ( a 3 · b 2 · c 2 ) ( a 3 · b 2 · c 3 ) + ( a 2 · b 3 · c 2 ) + ( a 3 · b 3 · c 2 ) , ( a 3 · b 3 · c 2 ) + ( a 3 · b 2 · c 2 ) + ( a 2 · b 3 · c 3 ) ( a 3 · b 3 · c 2 ) , ( a 2 · b 2 · c 3 ) + ( a 3 · b 2 · c 2 ) ( a 3 · b 3 · c 2 ) + ( a 3 · b 2 · c 2 ) ) .

Appendix C. Proof of the Non-Alternativity of the Product ⊙

A non-associative algebra is alternative if: X ( X Y ) = ( X X ) Y and ( Y X ) X = Y ( X X ) for all X , Y in the algebra. Defining X ( a 1 , a 2 , a 3 ) and Y ( b 1 , b 2 , b 3 ) , we have:
X ( X Y ) :
( a 1 , a 2 , a 3 ) ( a 1 · b 1 a 2 · b 2 a 3 · b 3 , a 1 · b 2 + a 2 · b 1 + a 3 · b 2 , a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) =
( a 1 · ( a 1 · b 1 a 2 · b 2 a 3 · b 3 ) a 2 · ( a 1 · b 2 + a 2 · b 1 + a 3 · b 2 ) a 3 · ( a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) , a 1 · ( a 1 · b 2 + a 2 · b 1 + a 3 · b 2 ) + a 2 · ( a 1 · b 1 a 2 · b 2 a 3 · b 3 ) + a 3 · ( a 1 · b 2 + a 2 · b 1 + a 3 · b 2 ) , a 1 · ( a 1 · b 3 + a 3 · b 2 + a 3 · b 1 ) + a 3 · ( a 1 · b 2 + a 2 · b 1 + a 3 · b 2 ) + a 3 · ( a 1 · b 1 a 2 · b 2 a 3 · b 3 ) ) .
( X X ) Y :
( a 1 · a 1 a 2 · a 2 a 3 · a 3 , a 1 · a 2 + a 2 · a 1 + a 3 · a 2 , a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) ( b 1 , b 2 , b 3 ) =
( ( a 1 · a 1 a 2 · a 2 a 3 · a 3 ) · b 1 ( a 1 · a 2 + a 2 · a 1 + a 3 · a 2 ) · b 2 ( a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) · b 3 , ( a 1 · a 1 a 2 · a 2 a 3 · a 3 ) · b 2 + ( a 1 · a 2 + a 2 · a 1 + a 3 · a 2 ) · b 1 + ( a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) · b 2 , ( a 1 · a 1 a 2 · a 2 a 3 · a 3 ) · b 3 + ( a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) · b 2 + ( a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) · b 1 ) .
X ( X Y ) ( X X ) Y :
X ( X Y ) ( X X ) Y =
( a 3 · a 3 · b 2 + a 3 · a 2 · b 3 , a 2 · a 3 · b 3 + a 3 · a 3 · b 2 + a 3 · a 3 · b 2 a 3 · a 2 · b 2 , a 3 · a 3 · b 2 a 3 · a 2 · b 2 + a 2 · a 2 · b 3 a 3 · a 2 · b 2 ) .
Y ( X X ) :
( b 1 , b 2 , b 3 ) ( a 1 · a 1 a 2 · a 2 a 3 · a 3 , a 1 · a 2 + a 2 · a 1 + a 3 · a 2 , a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) =
( b 1 · ( a 1 · a 1 a 2 · a 2 a 3 · a 3 ) b 2 · ( a 1 · a 2 + a 2 · a 1 + a 3 · a 2 ) b 3 · ( a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) , b 1 · ( a 1 · a 2 + a 2 · a 1 + a 3 · a 2 ) + b 2 · ( a 1 · a 1 a 2 · a 2 a 3 · a 3 ) + b 3 · ( a 1 · a 2 + a 2 · a 1 + a 3 · a 2 ) , b 1 · ( a 1 · a 3 + a 3 · a 2 + a 3 · a 1 ) + b 2 · ( a 1 · a 2 + a 2 · a 1 + a 3 · a 2 ) + b 3 · ( a 1 · a 1 a 2 · a 2 a 3 · a 3 ) ) .
( Y X ) X :
( b 1 · a 1 b 2 · a 2 b 3 · a 3 , b 1 · a 2 + b 2 · a 1 + b 3 · a 2 , b 1 · a 3 + b 3 · a 2 + b 3 · a 1 ) ( a 1 , a 2 , a 3 ) =
( ( b 1 · a 1 b 2 · a 2 b 3 · a 3 ) · a 1 ( b 1 · a 2 + b 2 · a 1 + b 3 · a 2 ) · a 2 ( b 1 · a 3 + b 3 · a 2 + b 3 · a 1 ) · a 3 , ( b 1 · a 1 b 2 · a 2 b 3 · a 3 ) · a 2 + ( b 1 · a 2 + b 2 · a 1 + b 3 · a 2 ) · a 1 + ( b 1 · a 3 + b 3 · a 2 + b 3 · a 1 ) · a 2 , ( b 1 · a 1 b 2 · a 2 b 3 · a 3 ) · a 3 + ( b 1 · a 3 + b 3 · a 2 + b 3 · a 1 ) · a 2 + ( b 1 · a 3 + b 3 · a 2 + b 3 · a 1 ) · a 1 ) .
( Y X ) X Y ( X X ) :
( Y X ) X Y ( X X ) =
( b 2 · a 3 · a 2 + b 3 · a 2 · a 2 , b 2 · a 3 · a 3 + b 3 · a 3 · a 2 + b 3 · a 3 · a 2 b 3 · a 2 · a 2 , b 3 · a 3 · a 2 b 3 · a 2 · a 2 + b 2 · a 2 · a 3 b 3 · a 2 · a 2 ) .

Appendix D. Proof of the bilinearity of the Lie bracket defined from ⊙

Bilinearity holds if, for all λ , γ F :
[ λ · ( a 1 , a 2 , a 3 ) + γ · ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] = λ · [ ( a 1 , a 2 , a 3 ) , ( c 1 , c 2 , c 3 ) ] + γ · [ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] .
Left-hand side:
[ λ · ( a 1 , a 2 , a 3 ) + γ · ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] = λ · ( a 1 , a 2 , a 3 ) + γ · ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) ( c 1 , c 2 , c 3 ) λ · ( a 1 , a 2 , a 3 ) + γ · ( b 1 , b 2 , b 3 ) .
First term:
λ · ( a 1 , a 2 , a 3 ) + γ · ( b 1 , b 2 , b 3 ) ( c 1 , c 2 , c 3 ) = ( λ · a 1 + γ · b 1 , λ · a 2 + γ · b 2 , λ · a 3 + γ · b 3 ) ( c 1 , c 2 , c 3 ) = ( ( λ · a 1 + γ · b 1 ) · c 1 ( λ · a 2 + γ · b 2 ) · c 2 ( λ · a 3 + γ · b 3 ) · c 3 , ( λ · a 1 + γ · b 1 ) · c 2 + ( λ · a 2 + γ · b 2 ) · c 1 + ( λ · a 3 + γ · b 3 ) · c 2 , ( λ · a 1 + γ · b 1 ) · c 3 + ( λ · a 3 + γ · b 3 ) · c 2 + ( λ · a 3 + γ · b 3 ) · c 1 ) = ( λ · a 1 · c 1 + γ · b 1 · c 1 λ · a 2 · c 2 γ · b 2 · c 2 λ · a 3 · c 3 γ · b 3 · c 3 , λ · a 1 · c 2 + γ · b 1 · c 2 + λ · a 2 · c 1 + γ · b 2 · c 1 + λ · a 3 · c 2 + γ · b 3 · c 2 , λ · a 1 · c 3 + γ · b 1 · c 3 + λ · a 3 · c 2 + γ · b 3 · c 2 + λ · a 3 · c 1 + γ · b 3 · c 1 ) .
Second term:
( c 1 , c 2 , c 3 ) λ · ( a 1 , a 2 , a 3 ) + γ · ( b 1 , b 2 , b 3 ) = ( c 1 , c 2 , c 3 ) ( λ · a 1 + γ · b 1 , λ · a 2 , γ · b 2 , λ · a 3 , γ · b 3 ) = ( c 1 · ( λ · a 1 + γ · b 1 ) c 2 · ( λ · a 2 + γ · b 2 ) c 3 · ( λ · a 3 + γ · b 3 ) , c 1 · ( λ · a 2 + γ · b 2 ) + c 2 · ( λ · a 1 + γ · b 1 ) + c 3 · ( λ · a 2 + γ · b 2 ) , c 1 · ( λ · a 3 + γ · b 3 ) + c 3 · ( λ · a 2 + γ · b 2 ) + c 3 · ( λ · a 1 + γ · b 1 ) ) = ( c 1 · λ · a 1 + c 1 · γ · b 1 c 2 · λ · a 2 c 2 · γ · b 2 c 3 · λ · a 3 c 3 · γ · b 3 , c 1 · λ · a 2 + c 1 · γ · b 2 + c 2 · λ · a 1 + c 2 · γ · b 1 + c 3 · λ · a 2 + c 3 · γ · b 2 , c 1 · λ · a 3 + c 1 · γ · b 3 + c 3 · λ · a 2 + c 3 · γ · b 2 + c 3 · λ · a 1 + c 3 · γ · b 1 ) .
First term - second term:
( λ · a 1 · c 1 + γ · b 1 · c 1 λ · a 2 · c 2 γ · b 2 · c 2 λ · a 3 · c 3 γ · b 3 · c 3 , λ · a 1 · c 2 + γ · b 1 · c 2 + λ · a 2 · c 1 + γ · b 2 · c 1 + λ · a 3 · c 2 + γ · b 3 · c 2 , λ · a 1 · c 3 + γ · b 1 · c 3 + λ · a 3 · c 2 + γ · b 3 · c 2 + λ · a 3 · c 1 + γ · b 3 · c 1 ) ( c 1 · λ · a 1 + c 1 · γ · b 1 c 2 · λ · a 2 c 2 · γ · b 2 c 3 · λ · a 3 c 3 · γ · b 3 , c 1 · λ · a 2 + c 1 · γ · b 2 + c 2 · λ · a 1 + c 2 · γ · b 1 + c 3 · λ · a 2 + c 3 · γ · b 2 , c 1 · λ · a 3 + c 1 · γ · b 3 + c 3 · λ · a 2 + c 3 · γ · b 2 + c 3 · λ · a 1 + c 3 · γ · b 1 ) = ( 0 , λ · a 3 · c 2 + γ · b 3 · c 2 c 3 · λ · a 2 c 3 · γ · b 2 , λ · a 3 · c 2 + γ · b 3 · c 2 c 3 · λ · a 2 c 3 · γ · b 2 ) .
Right-hand side:
λ · [ ( a 1 , a 2 , a 3 ) , ( c 1 , c 2 , c 3 ) ] + γ · [ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] .
First term:
λ · [ ( a 1 , a 2 , a 3 ) , ( c 1 , c 2 , c 3 ) ] = λ · ( a 1 · c 1 a 2 · c 2 a 3 · c 3 , a 1 · c 2 + a 2 · c 1 + a 3 · c 2 , a 1 · c 3 + a 3 · c 2 + a 3 · c 1 ) λ · ( c 1 · a 1 c 2 · a 2 c 3 · a 3 , c 1 · a 2 + c 2 · a 1 + c 3 · a 2 , c 1 · a 3 + c 3 · a 2 + c 3 · a 1 ) = ( 0 , λ · a 3 · c 2 λ · c 3 · a 2 , λ · a 3 · c 2 λ · c 3 · a 2 ) = λ · ( a 3 · c 2 c 3 · a 2 ) · ( 0 , 1 , 1 ) .
Second term:
γ · [ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] = γ · ( b 3 · c 2 c 3 · b 2 ) · ( 0 , 1 , 1 ) .
First term + second term:
λ · ( a 3 · c 2 c 3 · a 2 ) · ( 0 , 1 , 1 ) + γ · ( b 3 · c 2 c 3 · b 2 ) · ( 0 , 1 , 1 ) = ( 0 , λ · ( a 3 · c 2 c 3 · a 2 ) , λ · ( a 3 · c 2 c 3 · a 2 ) ) + ( 0 , γ · ( b 3 · c 2 c 3 · b 2 ) , γ · ( b 3 · c 2 c 3 · b 2 ) ) = ( 0 , λ · ( a 3 · c 2 c 3 · a 2 ) + γ · ( b 3 · c 2 c 3 · b 2 ) , λ · ( a 3 · c 2 c 3 · a 2 ) + γ · ( b 3 · c 2 c 3 · b 2 ) ) = ( λ · ( a 3 · c 2 c 3 · a 2 ) + γ · ( b 3 · c 2 c 3 · b 2 ) ) · ( 0 , 1 , 1 ) .
Therefore:
( 0 , λ · a 3 · c 2 + γ · b 3 · c 2 c 3 · λ · a 2 c 3 · γ · b 2 , λ · a 3 · c 2 + γ · b 3 · c 2 c 3 · λ · a 2 c 3 · γ · b 2 ) = ( 0 , λ · a 3 · c 2 λ · c 3 · a 2 + γ · b 3 · c 2 γ · c 3 · b 2 , λ · a 3 · c 2 λ · c 3 · a 2 + γ · b 3 · c 2 γ · c 3 · b 2 ) .

Appendix E. Proof of the Jacobi Identity

The Jacobi identity is satisfied when:
[ ( a 1 , a 2 , a 3 ) , [ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] ] + [ ( b 1 , b 2 , b 3 ) , [ ( c 1 , c 2 , c 3 ) , ( a 1 , a 2 , a 3 ) ] ] + [ ( c 1 , c 2 , c 3 ) , [ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] ] = ( 0 , 0 , 0 ) .
Proof:
[ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] = ( b 3 · c 2 c 3 · b 2 ) · ( 0 , 1 , 1 ) = ( 0 , b 3 · c 2 c 3 · b 2 , b 3 · c 2 c 3 · b 2 ) .

Appendix E.0.0.1. [(a 1 ,a 2 ,a 3 ),[(b 1 ,b 2 ,b 3 ),(c 1 ,c 2 ,c 3 )]]=(a 3 ·(b 3 ·c 2 -c 3 ·b 2 )-(b 3 ·c 2 -c 3 ·b 2 )·a 2 )·(0,1,1).

[ ( a 1 , a 2 , a 3 ) , [ ( b 1 , b 2 , b 3 ) , ( c 1 , c 2 , c 3 ) ] ] = ( a 1 , a 2 , a 3 ) ( 0 , b 3 · c 2 c 3 · b 2 , b 3 · c 2 c 3 · b 2 ) ( 0 , b 3 · c 2 c 3 · b 2 , b 3 · c 2 c 3 · b 2 ) ( a 1 , a 2 , a 3 ) .

Appendix E.0.0.2. (a 1 ,a 2 ,a 3 )⊙(0,b 3 ·c 2 -c 3 ·b 2 ,b 3 ·c 2 -c 3 ·b 2 ):

( a 1 , a 2 , a 3 ) ( 0 , b 3 · c 2 c 3 · b 2 , b 3 · c 2 c 3 · b 2 ) = ( a 2 · ( b 3 · c 2 c 3 · b 2 ) a 3 · ( b 3 · c 2 c 3 · b 2 ) , a 1 · ( b 3 · c 2 c 3 · b 2 ) + a 3 · ( b 3 · c 2 c 3 · b 2 ) , a 1 · ( b 3 · c 2 c 3 · b 2 ) + a 3 · ( b 3 · c 2 c 3 · b 2 ) ) .

Appendix E.0.0.3. (0,b 3 ·c 2 -c 3 ·b 2 ,b 3 ·c 2 -c 3 ·b 2 )⊙(a 1 ,a 2 ,a 3 ):

( 0 , b 3 · c 2 c 3 · b 2 , b 3 · c 2 c 3 · b 2 ) ( a 1 , a 2 , a 3 ) = ( ( b 3 · c 2 c 3 · b 2 ) · a 2 ( b 3 · c 2 c 3 · b 2 ) · a 3 , ( b 3 · c 2 c 3 · b 2 ) · a 1 + ( b 3 · c 2 c 3 · b 2 ) · a 2 , ( b 3 · c 2 c 3 · b 2 ) · a 2 + ( b 3 · c 2 c 3 · b 2 ) · a 1 ) .
( a 2 · b 3 · c 2 + a 2 · c 3 · b 2 a 3 · b 3 · c 2 + a 3 · c 3 · b 2 , a 1 · b 3 · c 2 a 1 · c 3 · b 2 + a 3 · b 3 · c 2 a 3 · c 3 · b 2 , a 1 · b 3 · c 2 a 1 · c 3 · b 2 + a 3 · b 3 · c 2 a 3 · c 3 · b 2 ) ( b 3 · c 2 · a 2 + c 3 · b 2 · a 2 b 3 · c 2 · a 3 + c 3 · b 2 · a 3 , b 3 · c 2 · a 1 c 3 · b 2 · a 1 + b 3 · c 2 · a 2 c 3 · b 2 · a 2 , b 3 · c 2 · a 2 c 3 · b 2 · a 2 + b 3 · c 2 · a 1 c 3 · b 2 · a 1 ) = ( 0 , a 3 · ( b 3 · c 2 c 3 · b 2 ) ( b 3 · c 2 c 3 · b 2 ) · a 2 , a 3 · ( b 3 · c 2 c 3 · b 2 ) ( b 3 · c 2 c 3 · b 2 ) · a 2 ) = ( a 3 · ( b 3 · c 2 c 3 · b 2 ) ( b 3 · c 2 c 3 · b 2 ) · a 2 ) · ( 0 , 1 , 1 ) .
Continuation of the proof:
[ ( b 1 , b 2 , b 3 ) , [ ( c 1 , c 2 , c 3 ) , ( a 1 , a 2 , a 3 ) ] ] = ( b 3 · ( c 3 · a 2 a 3 · c 2 ) ( c 3 · a 2 a 3 · c 2 ) · b 2 ) · ( 0 , 1 , 1 ) ,
[ ( c 1 , c 2 , c 3 ) , [ ( a 1 , a 2 , a 3 ) , ( b 1 , b 2 , b 3 ) ] ] = ( c 3 · ( a 3 · b 2 b 3 · a 2 ) ( a 3 · b 2 b 3 · a 2 ) · c 2 ) · ( 0 , 1 , 1 ) .
( a 3 · ( b 3 · c 2 c 3 · b 2 ) ( b 3 · c 2 c 3 · b 2 ) · a 2 ) · ( 0 , 1 , 1 ) + ( b 3 · ( c 3 · a 2 a 3 · c 2 ) ( c 3 · a 2 a 3 · c 2 ) · b 2 ) · ( 0 , 1 , 1 ) + ( c 3 · ( a 3 · b 2 b 3 · a 2 ) ( a 3 · b 2 b 3 · a 2 ) · c 2 ) · ( 0 , 1 , 1 ) = ( a 3 · ( b 3 · c 2 c 3 · b 2 ) ( b 3 · c 2 c 3 · b 2 ) · a 2 ) · ( 0 , 1 , 1 ) + ( b 3 · ( c 3 · a 2 a 3 · c 2 ) ( c 3 · a 2 a 3 · c 2 ) · b 2 ) · ( 0 , 1 , 1 ) + ( c 3 · ( a 3 · b 2 b 3 · a 2 ) ( a 3 · b 2 b 3 · a 2 ) · c 2 ) · ( 0 , 1 , 1 ) = ( ( a 3 · b 3 · c 2 a 3 · c 3 · b 2 ) ( b 3 · c 2 · a 2 c 3 · b 2 · a 2 ) ) · ( 0 , 1 , 1 ) + ( ( b 3 · c 3 · a 2 b 3 · a 3 · c 2 ) ( c 3 · a 2 · b 2 a 3 · c 2 · b 2 ) ) · ( 0 , 1 , 1 ) + ( ( c 3 · a 3 · b 2 c 3 · b 3 · a 2 ) ( a 3 · b 2 · c 2 b 3 · a 2 · c 2 ) ) · ( 0 , 1 , 1 ) = ( a 3 · b 3 · c 2 a 3 · c 3 · b 2 b 3 · c 2 · a 2 + c 3 · b 2 · a 2 + b 3 · c 3 · a 2 b 3 · a 3 · c 2 c 3 · a 2 · b 2 + a 3 · c 2 · b 2 + c 3 · a 3 · b 2 c 3 · b 3 · a 2 a 3 · b 2 · c 2 + b 3 · a 2 · c 2 ) · ( 0 , 1 , 1 ) = ( 0 , 0 , 0 ) .

Appendix F. Proof of the Malcev Identity

The Malcev identity holds if: a , b , c M : [ [ a , b ] , [ a , c ] ] = [ [ [ a , b ] , c ] , a ] + [ [ [ b , c ] , a ] , a ] + [ [ [ c , a ] , a ] , b ] . Defining these a , b , c as a = ( a 1 , a 2 , a 3 ) , b = ( b 1 , b 2 , b 3 ) , and c = ( c 1 , c 2 , c 3 ) , we have:
[ a , b ] = ( a 3 · b 2 b 3 · a 2 ) · ( 0 , 1 , 1 ) .
[ a , c ] = ( a 3 · c 2 c 3 · a 2 ) · ( 0 , 1 , 1 ) .
[ [ a , b ] , [ a , c ] ] = ( a 3 · b 2 b 3 · a 2 ) · ( 0 , 1 , 1 ) ( a 3 · c 2 c 3 · a 2 ) · ( 0 , 1 , 1 ) ( a 3 · c 2 c 3 · a 2 ) · ( 0 , 1 , 1 ) ( a 3 · b 2 b 3 · a 2 ) · ( 0 , 1 , 1 ) = ( a 3 · b 2 b 3 · a 2 ) · ( a 3 · c 2 c 3 · a 2 ) · ( 0 , 1 , 1 ) ( 0 , 1 , 1 ) ( a 3 · c 2 c 3 · a 2 ) · ( a 3 · b 2 b 3 · a 2 ) · ( 0 , 1 , 1 ) ( 0 , 1 , 1 ) = ( a 3 · b 2 b 3 · a 2 ) · ( a 3 · c 2 c 3 · a 2 ) · ( 1 1 , 1 , 1 ) ( a 3 · c 2 c 3 · a 2 ) · ( a 3 · b 2 b 3 · a 2 ) · ( 1 1 , 1 , 1 ) = ( ( a 3 · b 2 b 3 · a 2 ) · ( a 3 · c 2 c 3 · a 2 ) ( a 3 · c 2 c 3 · a 2 ) · ( a 3 · b 2 b 3 · a 2 ) ) · ( 1 1 , 1 , 1 ) = ( 0 , 0 , 0 ) .
[ [ a , b ] , c ] = [ ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · ( 0 , 1 , 1 ) ] .
[ [ [ a , b ] , c ] , a ] = [ ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · ( 0 , 1 , 1 ) ( a 1 , a 2 , a 3 ) ( a 1 , a 2 , a 3 ) ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · ( 0 , 1 , 1 ) ] = ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · [ ( ( a 2 a 3 , a 1 + a 2 , a 2 + a 1 ) ( a 2 a 3 , a 1 + a 3 , a 1 + a 3 ) ) ] = ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · ( 0 , a 2 a 3 , a 2 a 3 ) = ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) .
[ [ b , c ] , a ] = ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) .
[ [ [ b , c ] , a ] , a ] = ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) ( a 1 , a 2 , a 3 ) ( a 1 , a 2 , a 3 ) ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) = ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) × [ ( ( a 2 a 3 , a 1 + a 2 , a 2 + a 1 ) ( a 2 a 3 , a 1 + a 3 , a 1 + a 3 ) ) ] = ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) · ( 0 , a 2 a 3 , a 2 a 3 ) = ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) .
[ [ c , a ] , a ] = ( c 3 · a 2 a 3 · c 2 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) .
[ [ [ c , a ] , a ] , b ] = ( c 3 · a 2 a 3 · c 2 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) ( b 1 , b 2 , b 3 ) ( b 1 , b 2 , b 3 ) ( c 3 · a 2 a 3 · c 2 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) = ( c 3 · a 2 a 3 · c 2 ) · ( a 2 a 3 ) × [ ( ( b 2 b 3 , b 1 + b 2 , b 2 + b 1 ) ( b 2 b 3 , b 1 + b 3 , b 1 + b 3 ) ) ] = ( c 3 · a 2 a 3 · c 2 ) · ( a 2 a 3 ) · ( b 2 b 3 ) · ( 0 , 1 , 1 ) .
[ [ [ a , b ] , c ] , a ] + [ [ [ b , c ] , a ] , a ] + [ [ [ c , a ] , a ] , b ] = ( a 3 · b 2 b 3 · a 2 ) · ( c 2 c 3 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) + ( b 3 · c 2 c 3 · b 2 ) · ( a 2 a 3 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) + ( c 3 · a 2 a 3 · c 2 ) · ( a 2 a 3 ) · ( b 2 b 3 ) · ( 0 , 1 , 1 ) = ( a 3 · b 2 · c 2 a 3 · b 2 · c 3 b 3 · a 2 · c 2 + b 3 · a 2 · c 3 + b 3 · c 2 · a 2 b 3 · c 2 · a 3 c 3 · b 2 · a 2 + c 3 · b 2 · a 3 + c 3 · a 2 · b 2 c 3 · a 2 · b 3 a 3 · c 2 · b 2 + a 3 · c 2 · b 3 ) · ( a 2 a 3 ) · ( 0 , 1 , 1 ) = ( 0 , 0 , 0 ) .
[ [ a , b ] , [ a , c ] ] = [ [ [ a , b ] , c ] , a ] + [ [ [ b , c ] , a ] , a ] + [ [ [ c , a ] , a ] , b ] = ( 0 , 0 , 0 ) .

References

  1. Iachello, F. Lie algebras and applications; Vol. 708, Springer, 2006.
  2. de Azcárraga, J.A.; Izquierdo, J.M. Lie groups, Lie algebras, cohomology and some applications in physics; Cambridge University Press, 1998.
  3. Gilmore, R. Lie groups, Lie algebras, and some of their applications; Courier Corporation, 2012.
  4. Serre, J.P. Lie algebras and Lie groups: 1964 lectures given at Harvard University; Springer, 2009.
  5. Varadarajan, V.S. Lie groups, Lie algebras, and their representations; Vol. 102, Springer Science & Business Media, 2013.
  6. Sagle, A.A. Malcev algebras. Transactions of the American Mathematical Society 1961, 101, 426–458. [Google Scholar] [CrossRef]
  7. Nagy, P.T. Moufang loops and Malcev algebras. Sem. Sophus Lie 1993, 3, 65–68. [Google Scholar]
  8. Madariaga, S. Splitting of operations for alternative and Malcev structures. Communications in Algebra 2017, 45, 183–197. [Google Scholar] [CrossRef]
  9. Rathjen, M. Constructive Zermelo-Fraenkel set theory, power set, and the calculus of constructions. In Epistemology versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf; Springer, 2012; pp. 313–349.
  10. Jech, T.J. About the axiom of choice. In Studies in Logic and the Foundations of Mathematics; Elsevier, 1977; Vol. 90, pp. 345–370.
  11. Spindler, K. Abstract Algebra with Applications: Volume 1: Vector Spaces and Groups; CRC Press, 2018.
  12. Amitsur, A. Algebras over infinite fields. Proceedings of the American Mathematical Society 1956, 7, 35–48. [Google Scholar] [CrossRef]
  13. Passman, D.S. The algebraic structure of group rings; Courier Corporation, 2011.
  14. Schafer, R.D. Alternative algebras over an arbitrary field 1943.
  15. Elduque, A.; Myung, H.C.; Elduque, A.; Myung, H.C. Mutations of alternative algebras; Springer, 1994.
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated