Locally finite varieties of nonassociative algebras

This paper investigates the fundamental structural properties and numerical prevalence of finite algebras within locally finite varieties of nonassociative linear algebras over finite fields, without assuming associativity or the Lie property.

The Gist

Imagine a vast, infinite library. But instead of books, the shelves are filled with mathematical structures called "algebras."

In this paper, two mathematicians, Yuri Bahturin and Alexander Olshanskii, are exploring a specific section of this library: finite algebras over finite fields.

To understand what they are doing, let's break down the jargon into a simple story.

1. The Building Blocks: What is an Algebra?

Think of an algebra not as a scary equation, but as a game with rules.

• You have a set of "pieces" (numbers or vectors).
• You have a rule for combining two pieces to make a new one (multiplication).
• The Twist: In this paper, the authors don't care if the game follows the standard rules of math (like $a \times b = b \times a$ or $(a \times b) \times c = a \times (b \times c)$). They are looking at non-associative games where the order and grouping matter, and the rules can be anything.

They are studying these games when the number of pieces is finite (like a deck of cards) and the "numbers" come from a finite field (a tiny, self-contained universe of numbers, like a clock that only has 7 hours).

2. The "Varieties": Families of Games

The authors group these games into Varieties.

• Analogy: Imagine a "Variety" is like a genre of music (e.g., Jazz).
• All Jazz songs share certain rules (improvisation, specific scales).
• In math, a Variety is a collection of algebras that all obey the same set of "laws" (identities).
• They are specifically interested in Locally Finite Varieties. This means that if you take a small handful of pieces and try to build a game using the rules, you will eventually run out of new pieces to make. The game stays finite.

3. The Big Questions They Asked

The authors wanted to know: What do these games look like?

A. The "Generic" Game (The Average Case)

Usually, when mathematicians study a system, they look for the weird, special exceptions. But here, they asked: "What does a randomly chosen game look like?"

• The Finding: If you pick a game at random from this library, it is almost certainly Simple.
  • Metaphor: Imagine a building. A "simple" building has no internal walls; you can't break it into smaller, independent rooms. It's one solid, indivisible block.
  • Surprise: Most games are "Simple." They have no hidden sub-games inside them.
• The Finding: A random game has no symmetry.
  • Metaphor: If you have a snowflake, you can rotate it and it looks the same. That's symmetry. The authors found that a random algebra is like a snowflake made of mud. If you try to rotate or shuffle its pieces, it looks completely different. It has no "non-trivial automorphisms" (no way to rearrange it that keeps it looking the same).
• The Finding: A random game is Cyclic.
  • Metaphor: You can build the entire game starting from just one single piece. If you keep applying the rules to that one piece, you eventually generate the whole universe of that game.

B. The "Families" and "Generations"

They looked at how these games are related.

• The "Free" Game: Imagine a game where you have a set of "free" pieces that don't follow any extra rules other than the basic ones. This is the "Free Algebra."
• The Discovery: They calculated how big these free games get as you add more pieces. They found that for "Simple" families, the size grows exponentially (like a virus spreading). For "Nilpotent" families (games that eventually collapse to zero), the growth is much slower, like a polynomial.

C. The "Sub-Game" Problem

They asked: "If I have a big game, can I always find a smaller game hidden inside it that acts like a 'sub-ideal'?"

• The Answer: In "Nilpotent" families (the collapsing games), yes. Every sub-game is neatly tucked inside a larger one.
• The Answer: In "Solvable" families (games that can be broken down step-by-step), not always. Sometimes the sub-games are messy and don't fit the neat hierarchy.

4. The "Numerical Estimates" (Counting the Games)

The authors did some heavy math to count how many of these games exist.

• The Result: There are way more "Simple" games than "Nilpotent" ones.
• Analogy: If you were to count all the possible ways to arrange a deck of cards, the number of "Simple" arrangements is so huge it dwarfs the number of "Nilpotent" arrangements. In fact, the number of simple games is roughly the cube of the number of nilpotent ones.
• The Takeaway: If you walk into a room full of these algebras, you are almost guaranteed to find a "Simple" one, not a "Nilpotent" one.

5. Why Does This Matter?

This might sound abstract, but it's like studying the DNA of mathematical structures.

• By understanding what a "generic" (average) algebra looks like, mathematicians know what to expect when they encounter new systems in physics, computer science, or cryptography.
• They proved that the "weird" exceptions we usually study are actually the rare ones. The "boring," simple, asymmetrical, one-generator games are the norm.

Summary in One Sentence

This paper proves that in the universe of finite, non-associative algebras, the "average" game is a simple, asymmetrical, one-piece wonder that grows explosively fast, while the complex, structured, or symmetric games are actually the rare outliers.

Technical Summary

Technical Summary: Locally Finite Varieties of Nonassociative Algebras

Authors: Yuri Bahturin (Memorial University of Newfoundland) and Alexander Olshanskii (Vanderbilt University)
Subject: Universal Algebra, Nonassociative Algebras, Finite Fields, Variety Theory

1. Problem Statement and Context

The paper investigates locally finite varieties (primitive classes) of linear algebras over finite fields. Unlike classical studies focusing on associative rings, Lie algebras, or groups, this work addresses nonassociative algebras without assuming classical identities (such as associativity or the Lie identity).

The central problem is to understand the structural properties of finite algebras within these varieties and to quantify the prevalence of specific properties (simplicity, nilpotence, solvability, automorphism groups) among all possible algebras of a fixed dimension $n$. The authors aim to bridge the gap between the theory of universal algebras and linear algebra over finite fields, specifically addressing:

• The structural decomposition of finite algebras in finitely generated varieties.
• The behavior of free algebras and their dimension functions.
• The "generic" properties of finite algebras (i.e., properties held by "almost all" algebras as dimension $m \to \infty$).
• Numerical estimates of the growth rates of algebras with specific properties compared to the total number of algebras.

2. Methodology

The authors employ a combination of structural algebra, combinatorial counting, and asymptotic analysis:

• Variety Theory & Birkhoff's Theorem: They utilize the fundamental correspondence between varieties and fully invariant ideals. They apply Birkhoff's construction to represent free algebras as subalgebras of direct powers of finite algebras.
• Structural Decomposition: The paper analyzes the structure of algebras via:
  • Subideals and Annihilators: Defining nilpotency and solvability through central and annihilator series.
  • Semidirect Products: Using semidirect sums ($B \ltimes A$) to study extensions and critical algebras.
  • Minimal Representations: Analyzing subdirect products of monolithic algebras to determine the structure of free algebras.
• Dimension Functions: They define $d(n)$ as the dimension of the free algebra of rank $n$ in a variety $V$. They derive explicit formulas and bounds for $d(n)$, particularly for nilpotent and simple algebras.
• Asymptotic Counting (Generic Properties): To determine "generic" properties, the authors count the number of structural constants (tensor components) defining algebras with specific properties. They compare the cardinality of the set of algebras satisfying property $P$ ($\phi_P(m)$) against the total number of non-isomorphic algebras ($\phi(m)$) as the dimension $m \to \infty$. If $\lim_{m \to \infty} \phi_P(m)/\phi(m) = 1$, the property is generic.

3. Key Contributions and Results

A. Structural Theory of Locally Finite Varieties

• Nilpotency Criteria: The authors establish equivalent definitions for nilpotency in nonassociative algebras, linking central series, annihilator series, and the nilpotency of associative enveloping algebras. They prove that a variety is nilpotent if and only if every subalgebra is a subideal.
• Structure of Free Algebras:
  • Simple Algebras: If a variety is generated by a finite simple algebra $A$, any free algebra $F_n$ decomposes as $P \oplus Q$, where $P$ is a direct power of $A$ and $Q$ belongs to a proper subvariety.
  • Minimal Algebras: A variety is minimal (has no proper nontrivial subvarieties) if and only if it is generated by a finite minimal algebra. For such varieties, free algebras are direct sums of copies of the minimal algebra.
  • Free Products: The paper computes the free product of direct powers of a simple algebra $A$ (without nontrivial automorphisms), showing that the free product of $k$ and $\ell$ copies results in $(k+1)(\ell+1)-1$ copies.
• Injectivity and Projectivity: The authors characterize varieties where all finite algebras are injective or projective. They show that in a locally finite variety, all finite algebras are injective if and only if the variety is generated by a finite set of minimal algebras.
• Anti-Schreier Varieties: They prove that if every algebra in a variety can be embedded in a free algebra, the variety must be trivial (zero multiplication), contrasting with Schreier varieties where subalgebras of free algebras are free.

B. Dimension Functions and Growth

• Dimension Estimates:
  • For nilpotent varieties of class $c$, the dimension function $d(n)$ is a polynomial of degree $c$.
  • For non-nilpotent varieties, $d(n) \ge 2^n - 1$.
  • For varieties generated by a finite simple algebra $A$, $d(n)$ grows exponentially: $c|A|^n \dim A < d(n) < |A|^n \dim A$.
• Exponents: The "exponent" of a variety (limit of $\sqrt[n]{d(n)}$) is an integer for varieties generated by simple algebras.
• Associative Products: An explicit formula is derived for the dimension function of the product of two associative varieties $UV$: $d_{UV}(n) = (n-1)d_U(n)d_V(n) + n(d_U(n) + d_V(n) + 1)$.

C. Generic Properties of Finite Algebras

The paper provides rigorous proofs that for large dimensions $m$ over a finite field $\mathbb{F}_q$:

1. No Nontrivial Automorphisms: Almost all finite algebras have a trivial automorphism group. The number of algebras with nontrivial automorphisms is exponentially smaller than the total.
2. Simplicity: Almost all finite algebras are simple (having no proper non-zero ideals).
3. Cyclicity: Almost all finite algebras are cyclic (generated by a single element) and contain no proper subalgebras of dimension $>1$.
4. Quasi-identities: For a generic algebra $A$, the variety generated by $A$ coincides with the quasi-variety generated by $A$ ($\text{var } A = \text{qvar } A$). This implies that any algebra in the variety is a subalgebra of a direct power of $A$; no homomorphic images are needed to generate the variety.

D. Numerical Estimates of Growth Rates

The authors calculate the asymptotic growth of the number of algebras with specific properties:

• Total Algebras: $\phi(m) \approx q^{m^3 - m^2}$.
• Nilpotent Algebras: $\nu(m) \approx q^{m^3/3}$.
• Solvable Algebras: $\sigma(m) \approx q^{2m^3/3}$.
• Significance: The number of simple algebras grows roughly as the cube of the number of nilpotent algebras, and the number of solvable algebras grows as the square of the number of nilpotent algebras. This contradicts intuition from classical associative/Lie theory where nilpotent/solvable algebras are often considered "common" and simple ones "rare."

4. Significance

This paper is significant for several reasons:

1. Generalization: It extends the theory of locally finite varieties beyond the well-trodden paths of associative and Lie algebras to the general nonassociative case.
2. Counter-Intuitive Results: The findings on generic properties challenge classical intuitions. In the realm of arbitrary nonassociative algebras over finite fields, "generic" objects are simple, cyclic, and rigid (no automorphisms), rather than nilpotent or solvable.
3. Quantitative Precision: The paper provides precise asymptotic formulas for the counts of algebras, offering a statistical view of algebraic structures. The distinction between the growth rates of nilpotent, solvable, and simple algebras provides a new perspective on the "density" of these classes.
4. Structural Tools: The development of tools like "minimal representations" of subdirect products and the analysis of "extremal" and "critical" algebras provides a robust framework for future research in universal algebra and finite model theory.

In summary, Bahturin and Olshanskii establish that the landscape of finite nonassociative algebras over finite fields is dominated by simple, rigid structures, and they provide the mathematical machinery to quantify this dominance and describe the structural hierarchy of the varieties they generate.