On three-dimensional associative algebras

This paper classifies three-dimensional associative algebras over arbitrary base fields of characteristic different from two and three by providing canonical representatives for their isomorphism classes and comparing these results with existing classifications over complex numbers and for the nilpotent case.

The Gist

Imagine you are an architect trying to catalog every possible type of 3D building block that can be stacked together. But there's a special rule for stacking: the order in which you stack them doesn't matter for the final stability. If you stack Block A on top of Block B, and then put Block C on top, it must be just as stable as stacking A and B together first, then adding C. In math, this is called an associative algebra.

For over a century, mathematicians have been trying to write a complete "catalog" of these 3D building blocks. While they knew how to describe 2D blocks (flat tiles) and 4D+ blocks (complex structures), the 3D case was a bit of a mess. Different teams had different lists, some missed pieces, and some included duplicates.

This paper by U. Bekbaev and I. Rakhimov is like a master renovation project. They went into the attic, dusted off the blueprints, and created a single, perfect, non-redundant list of every possible 3D associative algebra.

Here is how they did it, explained through simple analogies:

1. The Problem: A Messy Garage

Imagine a garage full of 3D blocks. Some are identical but painted different colors (mathematicians call this "isomorphism"—they are the same shape, just viewed from a different angle). Some are broken, some are weirdly shaped, and some people have claimed to have found all of them, but their lists didn't match.

• The Goal: Sort the garage so that every unique shape is listed exactly once, with no duplicates and no missing items.

2. The Method: Building Up from the Floor

The authors didn't try to guess the shape of the whole 3D block from scratch. Instead, they used a technique called the "Extension Method."

• The Analogy: Imagine you want to build a 3-story house. You already have a perfect list of all possible 2-story foundations (2D algebras).
• The Process: They took every known 2-story foundation and asked, "What happens if we add a 3rd floor?"
  • They wrote down the rules for how the new floor connects to the old two.
  • They checked if the whole building still followed the "stability rule" (associativity).
  • This created a huge pile of potential 3D buildings.

3. The Cleanup: Removing the Duplicates

The pile of potential buildings was huge and messy. Many of them were actually the same building, just rotated or viewed from a different angle.

• The Analogy: Imagine you have 100 photos of a house. Some are taken from the front, some from the back, some are zoomed in. They look different, but they are the same house.
• The Solution: The authors used a "rotation tool" (mathematically, automorphism groups) to rotate every building until it was in its standard "front-facing" position. If two buildings looked identical after rotation, they threw one away.
• The Tool: Because there were thousands of calculations, they used a computer program (Maple) to do the heavy lifting, like a robot sorting through the photos.

4. The Result: The Master Catalog

After all the sorting, they produced a definitive list of 3D associative algebras (for fields where the numbers don't behave strangely, i.e., characteristic not 2 or 3).

• They found 33 unique types of these 3D blocks.
• They organized them by their "fingerprint" (called trace vectors). Think of this like sorting the blocks by their weight and center of gravity. Some blocks have a unique weight distribution, while others share a pattern.

5. The Comparison: Settling the Score

The authors didn't just make a list; they compared it to the two most famous previous lists (one by De Graaf and one by another team).

• The Verdict: They found that the previous lists were missing some unique blocks and, in some cases, included blocks that were actually just duplicates of others.
• The Fix: They added the missing "rare species" to the catalog and removed the "fake duplicates." They even provided a translation guide (a table) showing exactly how to turn a block from the old lists into their new standard format.

6. The Bonus: The "Permutative" Special Edition

At the end, they tackled a special sub-category called permutative algebras.

• The Analogy: These are blocks where the order of stacking doesn't just have to be stable; the blocks themselves must be perfectly symmetrical. If you swap two blocks, the structure remains exactly the same.
• They took their master list of 3D blocks and filtered it to find only the perfectly symmetrical ones, creating a new, clean list for this specific type of structure.

Why Does This Matter?

You might ask, "Who cares about 3D math blocks?"

• The Big Picture: Just as knowing every type of brick helps engineers build better bridges, knowing every type of algebra helps physicists understand quantum mechanics, computer scientists design better encryption, and biologists model complex chemical reactions.
• The Legacy: This paper closes a chapter that has been open for decades. It provides the "Periodic Table" for 3D associative algebras. Now, any researcher can look up a structure, know exactly what it is, and know it's the only one of its kind.

In short: The authors took a chaotic pile of mathematical shapes, used a clever building strategy and a computer to sort them, and handed us a clean, perfect, and complete encyclopedia of 3D algebraic structures.

Technical Summary

Here is a detailed technical summary of the paper "On Three-Dimensional Associative Algebras" by U. Bekbaev and I. Rakhimov.

1. Problem Statement

The paper addresses the classification problem of finite-dimensional associative algebras over arbitrary base fields. Specifically, it focuses on three-dimensional associative algebras.

• Context: While the classification of low-dimensional algebras is a classical problem (dating back to B. Pierce and J. Wedderburn), a complete and universal classification in fixed dimensions (even over the complex numbers) remains elusive.
• Gap: Previous classifications (e.g., by Scorza, Gabriel, Fialowski et al., and Mazzola) were often limited to specific fields (like $\mathbb{C}$) or specific dimensions. Recent claims of complete classifications over $\mathbb{R}$ and $\mathbb{C}$ (specifically reference [11]) were found to be incomplete or contained redundancies.
• Goal: To provide a complete, non-redundant list of isomorphism classes for 3D associative algebras over a base field $F$ where $\text{Char}(F) \neq 2, 3$, and to compare these results with existing classifications over $\mathbb{C}$.

2. Methodology: The Extension Method

The authors employ a constructive approach known as the extension method, building upon their previous work on 2D algebras (Reference [13]). The procedure involves:

1. Subalgebra Fixation: Fix a 2-dimensional associative subalgebra $A_2$ within the target 3-dimensional algebra $A_3$. The structure constants of $A_2$ are taken from the known classification of 2D algebras.
2. Matrix Construction: Represent the 3D algebra via its Matrix of Structure Constants (MSC), denoted as $A \in M_{3 \times 9}(F)$. The matrix is partitioned such that the top-left $2 \times 4$ block corresponds to the fixed subalgebra.
3. Associativity Constraints: Impose the associativity condition $(xy)z = x(yz)$. In terms of the MSC $A$, this is expressed as the tensor equation:
   $$A(A \otimes I) = A(I \otimes A)$$
   This generates a system of polynomial equations for the unknown entries of the MSC.
4. Solving and Redundancy Elimination:
   • Solve the system for each fixed 2D subalgebra.
   • Apply the automorphism groups of the 2D subalgebras to eliminate isomorphic duplicates (redundancies).
   • Handle cases where the algebra has no 2D subalgebra but possesses 1D subalgebras or is trivial.
5. Computational Tools: Due to the high computational complexity of solving the resulting systems and checking isomorphisms, the authors utilized Maple software.

3. Key Contributions and Results

A. Classification over Arbitrary Fields ($\text{Char}(F) \neq 2, 3$)

The paper presents a complete list of 33 pairwise non-isomorphic 3D associative algebras (Theorem 2). These are categorized based on the relationship between two trace vectors, $\text{Tr}_1(A)$ and $\text{Tr}_2(A)$, derived from the MSC:

• Linearly Independent Traces: 6 families (e.g., $As_2^2(3)(0)$ to $As_8^2(3)$).
• Proportional Traces ($\lambda \text{Tr}_1 = \text{Tr}_2$):
  • Specific constants $\lambda \in \{3, 1/3, 2, 1/2, 3/2, 2/3\}$.
  • The case $\lambda = 1$ yields several families, some with continuous parameters ($t \in F$) and discrete parameters (e.g., $As_{1,1}^1(3)(t)$).
• Zero Traces ($\text{Tr}_1 = \text{Tr}_2 = 0$): 10 families, including nilpotent algebras and those with specific structural constants (e.g., $As_0^1(3)(\pm 1)$, $As_0^2(3)$).

B. Comparison with Complex Classifications

The authors rigorously compare their list with the classification of 3D complex associative algebras found in reference [11] (and [4]).

• Isomorphism Mapping: They provide explicit base change matrices ($g$) demonstrating how algebras in the [11] list correspond to their list.
• Identified Omissions: The authors prove that the list in [11] is incomplete. They identify 11 additional non-isomorphic algebras that were missing from the previous complex classification:
  • Unital: $As_6^{1,1}(3)(-1)$, $As_7^{1,1}(3)(-1)$, $As_9^{1,1}(3)(1)$, and two distinct cases of $As_8^{1,1}(3)$ (at $t=0$ and $t=-1/8$).
  • Waved: $As_4^2(3)$, $As_5^2(3)$, $As_0^2(3)$.
  • Straight: $As_8^2(3)$, $As_{14}^{1,1}(3)(t)$ for $t \in \{0, 1\}$, and $As_{15}^{1,1}(3)$.
• Distinguishing Invariants: To prove non-isomorphism, they utilize invariants such as the number of left/right ideals, decomposability (Direct Sum vs. Indecomposable), and the number of idempotents.

C. Nilpotent Algebras

The paper establishes a correspondence between their list and the classification of 3D nilpotent associative algebras by W.A. De Graaf (Reference [7]).

• They confirm that most nilpotent algebras in [7] are covered by their list.
• Correction: They note that algebras $As_0^2(3)$ and $As_0^3(3)$ were omitted in the comparison with [7], clarifying the complete set of nilpotent structures.

D. Permutative Algebras

The final section classifies 3D permutative algebras (algebras satisfying $(xy)z = x(yz) = x(zy)$ for left-perm, or $(xy)z = (yx)z = x(yz)$ for right-perm).

• By filtering the associative list for algebras satisfying the specific permutative identities, they provide a complete list of 26 non-isomorphic 3D permutative algebras.
• They compare these with the classification of left-permutative algebras over $\mathbb{C}$ in Reference [1], identifying omissions and correcting the correspondence.

4. Significance

• Completeness: This work provides the first complete, non-redundant classification of 3D associative algebras over arbitrary base fields (excluding characteristics 2 and 3), moving beyond the limitations of complex-only classifications.
• Correction of Literature: It corrects the record regarding the classification over $\mathbb{C}$, proving that previous lists were incomplete and providing the missing isomorphism classes.
• Methodological Rigor: The use of the extension method combined with computational algebra (Maple) and rigorous invariant analysis (traces, ideals, idempotents) sets a standard for classifying higher-dimensional algebras.
• Foundational Utility: The results serve as a foundational reference for researchers in algebraic geometry, operad theory, and deformation theory, particularly for understanding the structure of low-dimensional algebras and their extensions.

In summary, Bekbaev and Rakhimov have successfully resolved the classification of 3D associative algebras for a broad class of fields, identified gaps in existing complex classifications, and extended these results to the related class of permutative algebras.