🔢 mathematics

Finite basis problem for varieties of algebraic systems

This survey examines the finite basis problem for varieties of algebraic systems by presenting examples of non-finitely based varieties and highlighting important varieties, particularly in semigroups, groups, and various algebras, that are finitely based alongside all their subvarieties.

Original authors: Vesselin Drensky

Published 2026-02-24

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Vesselin Drensky

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a librarian trying to organize a massive, chaotic library of mathematical objects. These objects are algebras—think of them as rulebooks for how numbers or symbols interact (like addition, multiplication, or more exotic operations).

The library is so huge that you can't list every single book. Instead, you decide to group them into Varieties. A "Variety" is like a genre in a bookstore (e.g., "Science Fiction" or "Mystery"). In math, a variety is a collection of algebras that all follow the same set of rules, called identities.

For example, the "Commutative Variety" contains all algebras where $A \times B = B \times A$ . The "Associative Variety" contains those where $(A \times B) \times C = A \times (B \times C)$ .

The Big Question: The "Finite Basis" Problem

The central mystery of this paper is the Finite Basis Problem (also known as the Specht Problem).

Here is the question in plain English:

"Can every single one of these mathematical genres be described by a short, finite list of rules?"

Finitely Based: Imagine a genre like "Mystery." You can describe it perfectly with a short list: "Must have a crime, a detective, and a twist." You don't need a million rules; a few cover everything.
Infinitely Based: Imagine a genre that is so weird that to describe it, you need an infinite list of rules. Rule #1 covers small things, Rule #2 covers medium things, Rule #3 covers large things, and so on forever. No matter how many rules you write down, there's always a new, weird object that slips through the cracks and needs a new rule.

The paper asks: Do all mathematical genres have a short, finite rulebook? Or are there some "monsters" that require an infinite rulebook?

The Two Main Approaches

The author, Vesselin Drensky, explains that mathematicians have tried to solve this in two ways:

The Anatomy Approach (Structure Theory): This is like being a doctor. You take a specific organism (a specific algebra), cut it open, and study its organs (ideals, radicals, simple parts). If the organism is small and simple (like a finite group), you can usually write down a finite rulebook for it.
The Classification Approach (Combinatorics): This is like being a taxonomist (like Linnaeus classifying animals). You don't look at the inside of the animal; you just look at the rules it follows. You group them into families based on their "identities." The paper focuses heavily on this method.

The Shocking Discoveries (The "No" Answers)

For a long time, mathematicians hoped the answer was "Yes, everything has a finite rulebook." But this paper is a survey of the counterexamples—the monsters that proved them wrong.

1. The "Tiny" Monsters

You might think, "If an algebra is small (like one with only 2 or 3 elements), it must be simple, right?"

The Twist: No! In 1954, a mathematician named Lyndon found a system with 7 elements that needed an infinite rulebook. Later, Murskii found one with only 3 elements.
Analogy: Imagine a tiny toy car with only 3 buttons. You'd think you could describe how it works in one sentence. But it turns out, to describe exactly how it behaves in every possible scenario, you need an infinite instruction manual.

2. The "Infinite" Families

The paper lists many types of algebras that are not finitely based:

Semigroups: These are systems where you just multiply things together (no addition, no subtraction). The author shows that even simple-looking semigroups can be infinitely complex.
Groups: While "nice" finite groups have finite rulebooks, there are infinite families of groups that do not.
Lie Algebras: These are used in physics (like quantum mechanics). The paper reveals that in certain "weird" number systems (specifically fields with characteristic 2, which is like doing math where $1+1=0$ ), these algebras break the rules and need infinite descriptions.
Associative Algebras: Even standard matrix multiplication (like $2 \times 2$ matrices) can be infinitely complex if you are working in a specific type of number system (characteristic 2).

3. The "Limit" Varieties

The paper introduces a concept called a Limit Variety.

Analogy: Imagine a mountain peak. The peak itself is the "Limit Variety." It is so complex it has no finite rulebook. But here is the kicker: Every single path you take down the mountain (every sub-variety) leads to a simple, finite rulebook.
It's like a monster that is infinitely complex, but if you remove just one tiny feature, it becomes simple. These are the "edge cases" of mathematics.

The "Yes" Answers (The Good News)

It's not all bad news! The paper also highlights where the answer is Yes.

Finite Objects: If you have a finite group or a finite-dimensional algebra over a "nice" field (like the real numbers), it almost always has a finite rulebook.
Kemer's Breakthrough: In characteristic 0 (the standard number systems we use every day), a mathematician named Kemer proved that all associative algebras have a finite rulebook. This was a massive victory, solving the problem for a huge chunk of mathematics.

Why Does This Matter?

You might ask, "Who cares if a math object needs 10 rules or 1,000,000 rules?"

Computability: If a system has a finite rulebook, a computer can eventually check if a new object belongs to that group. If it needs an infinite rulebook, the computer might run forever trying to find the right rule.
Understanding Complexity: It tells us where the boundary lies between "simple" and "chaotic." It shows us that even in the rigid world of math, there are pockets of infinite complexity hiding inside tiny, simple-looking structures.
The "Undecidable" Nature: The paper mentions that for some systems, there is no algorithm that can tell you if a rulebook is finite or not. It's like a puzzle where you can't even know if the solution exists.

Summary Metaphor

Imagine the universe of algebraic systems as a garden.

Most of the garden is filled with flowers (finite groups, standard algebras) that can be described by a simple seed packet (finite basis).
However, there are weeds (the counterexamples) that grow in a way that defies simple description. No matter how many times you pull them or describe them, they keep growing new, unexpected shapes.
This paper is the botanist's guide to those weeds. It catalogs the specific types of weeds, shows us where they grow (in groups, semigroups, Lie algebras), and explains why they are so stubborn.

The main takeaway? Mathematics is full of surprises. Just because something looks small or simple doesn't mean it has a simple explanation. Sometimes, the simplest things hide the most infinite complexity.

Technical Summary: Finite Basis Problem for Varieties of Algebraic Systems

1. Introduction and Problem Statement

The paper provides a comprehensive survey of the Finite Basis Problem (also known as the Specht Problem) within the theory of varieties of algebraic systems. The central question, originally posed by Wilhelm Specht (1950) for associative algebras and earlier by Bernhard Neumann (1937) for groups, asks:

Problem: Is every variety of algebraic systems (groups, semigroups, rings, algebras) defined by a finite system of identities?

If a variety can be defined by a finite set of identities, it is called finitely based (or Spechtian). If it requires an infinite set of independent identities, it is infinitely based. The paper explores the dichotomy between varieties that are finitely based and those that are not, covering groups, semigroups, associative algebras, Lie algebras, and other non-associative structures.

2. Methodological Framework

The author categorizes the approaches to solving the Specht problem into two main directions:

A. Structural Approaches

This method relies on the internal structure of the algebras generating the variety.

Finite Objects: A major positive result is that varieties generated by finite groups, associative rings, Lie rings, or finite-dimensional algebras over finite fields are finitely based. This relies on the structure theory of these objects (e.g., Jacobson radical, semisimplicity).
Critical Groups/Algebras: The concept of "critical" objects (those not in the variety generated by their proper sub-objects) is used to classify Cross varieties, which are finitely based.

B. Combinatorial and Logical Approaches

Higman-Cohen Method: Utilizes Higman's lemma on the well-quasi-ordering of sequences of non-negative integers. This method was instrumental in proving the Specht property for metabelian groups and various nilpotent-by-abelian varieties in the 1970s and 80s.
Commutative Algebra: Techniques involving the Hilbert Basis Theorem and representation theory of symmetric and general linear groups are used to reduce infinite identity systems to finite ones, particularly for characteristic 0.
Weak Polynomial Identities: Introduced by Razmyslov, these are identities satisfied by a specific subspace of an algebra. They are crucial for analyzing matrix algebras and Lie algebras.
Kemer's Theory (Characteristic 0): A landmark theoretical framework developed by A. Kemer. It combines the structure theory of T-ideals with superalgebras to prove that every variety of associative algebras over a field of characteristic 0 is finitely based. This solved the Specht problem for associative algebras in char 0.

C. Logical Undecidability

The paper notes that the problem can be restated in mathematical logic. McKenzie (1984) proved that there is no algorithm to determine if an arbitrary finite algebra of finite type has a finite basis, linking the problem to the undecidability of the Halting Problem.

3. Key Contributions and Results by Algebraic System

3.1. Non-Associative Objects (Magmas and Rings)

Trivial Counterexamples: The paper establishes that varieties of binary magmas with zero, non-associative rings, and non-associative algebras are generally not finitely based. Simple identities like $u_n = (x_1x_2)\dots(x_{n-1}x_n) = 0$ generate infinitely based varieties.
Finite Systems: Even finite algebras can be infinitely based. Lyndon (1954) found a 7-element magma without a finite basis. Murskii (1965) reduced this to a 3-element magma, proving that the minimal size for a non-finitely based finite algebra is 3.

3.2. Semigroups

First Counterexamples: Birjukov (1965) and Austin (1966) provided the first examples of infinitely based semigroup varieties.
Finite Semigroups: Perkins (1969) constructed the first finite semigroup (6 elements) without a finite basis.
Classification: It is known that all semigroups with $\le 5$ elements are finitely based. There are exactly four non-finitely based semigroups of order 6.
Limit Varieties: The paper discusses "limit varieties" (infinitely based varieties where all proper subvarieties are finitely based). Volkov constructed the first limit variety of semigroups.

3.3. Groups

Positive Results: Oates and Powell (1964) proved that varieties generated by finite groups are finitely based.
Negative Results: Ol'shanskij (1970) proved the existence of infinitely many varieties of groups that are not finitely based.
Explicit Examples: Adyan and Vaughan-Lee (1970) provided explicit infinite systems of independent identities for groups of large odd exponent.
Open Problems: It remains unknown if the identity $((x_1, x_2, x_3), (x_4, x_5, x_6)) = 1$ satisfies the Specht property.

3.4. Lie Algebras

Characteristic 2: Vaughan-Lee (1970) provided the first counterexample: a variety of Lie algebras over a field of characteristic 2 defined by specific commutator identities is not finitely based.
Finite Dimensional Algebras: The Lie algebra $M_2(K)$ (2x2 matrices) over an infinite field of characteristic 2 has no finite basis.
Characteristic 0: The Specht problem for Lie algebras over fields of characteristic 0 remains open.
Graded Algebras: Counterexamples exist for graded Lie algebras in characteristic 2.

3.5. Associative Algebras

Characteristic 0: Solved positively by Kemer (1987). Every variety of associative algebras over a field of characteristic 0 is finitely based.
Positive Characteristic: The problem has a negative answer. Belov (1999), Grishin, and Shchigolev constructed infinitely based varieties of associative algebras over fields of characteristic $p > 0$ .
Finite Dimensional: Finite-dimensional algebras over finite fields are finitely based, but over infinite fields of positive characteristic, counterexamples exist (e.g., Lvov's construction).

4. Limit Varieties

A variety is a limit variety if it is not finitely based, but every proper subvariety is finitely based.

The existence of limit varieties is guaranteed by Zorn's Lemma for any infinitely based variety.
Explicit examples are known for:
- Groups: Limit varieties of $p$ -groups (Kozhevnikov).
- Semigroups: Limit varieties generated by finite semigroups (Volkov, Lee, Sapir).
- Lie Algebras: One known example in characteristic 2 (Volichenko).
- Non-associative Algebras: Examples in characteristic 0 (Drensky).

5. Significance and Open Problems

The paper highlights the profound impact of the Specht problem on algebraic theory:

Classification: A negative answer to the Specht problem implies that a complete classification of all varieties is impossible, as there are uncountably many non-finitely based varieties.
Interdisciplinary Links: The problem connects abstract algebra with mathematical logic (undecidability), combinatorics (Higman's lemma), and representation theory.
Remaining Frontiers:
- The Specht problem for Lie algebras in characteristic 0 is the most prominent open problem.
- The minimal number of elements for a finite non-finitely based algebra is known to be 3, but the structure of such algebras is complex.
- The behavior of varieties of involution semigroups and graded algebras continues to yield new counterexamples and positive results depending on the characteristic and grading group.

In conclusion, Drensky's survey demonstrates that while the Specht problem is resolved for associative algebras in characteristic 0 and for finite objects in many contexts, it remains a rich source of counterexamples and deep structural questions in positive characteristic and for non-associative systems.