Tarski asked whether a finite algebra always has a finite equational basis. The answer is no, but three substantial theorems identify hypotheses under which it is yes.
Engineering · Mathematics10 min readKV-MATH-0255
Learning objectives
State the finite basis problem precisely.
State Baker's finite basis theorem and its hypotheses.
Outline the proof strategy via bounded subdirectly irreducibles.
Identify the other finite basis results the source presents.
Recognise inherently non-finitely-based algebras.
Understand what the source records as open on this question.
01The problem
A variety is finitely based when some finite set of identities axiomatises it. Tarski asked whether the variety generated by a finite algebra of finite type is always finitely based.
Key resultThe finite basis problem
Given a finite algebra A of finite type, is V(A) finitely based? And is there an algorithm to decide, given A, whether V(A) is finitely based? The source records the second question as Problem 10, attributed to Tarski, and open as of 1981.
The first question was already known to have a negative answer in 1981: Lyndon constructed a finite algebra generating a non-finitely-based variety. So the programme became identifying hypotheses under which finite basis holds.
02Baker's theorem
Key resultBaker's finite basis theorem
If A is a finite algebra of finite type and V(A) is congruence-distributive, then V(A) is finitely based.
ProcedureThe proof strategy
in: finite A generating a CD variety → out: a finite equational basis
input: finite A of finite type, V(A) congruence-distributive
step 1: Jónsson's lemma gives SI members of V(A) inside HS({A})
since A is finite and the set is finite, ultraproducts collapse
step 2: so the subdirectly irreducibles are finite and bounded by |A|
step 3: congruence distributivity gives definable principal congruences,
via bounded chain length from the Jónsson terms
step 4: subdirect irreducibility becomes a first-order condition
step 5: write identities excluding every algebra that is not in V(A)
the bound on SIs means finitely many identities suffice
output: a finite equational basis for V(A)
Steps 1 and 3 are where congruence distributivity is used, twice and essentially. Caveat: the basis produced is enormous — the theorem is an existence result, not a practical axiomatisation method.
Baker's theorem covers a great deal: every finite lattice, every finite Boolean algebra with operators, every finite Heyting algebra and every finite quasiprimal algebra generates a finitely based variety.
03The other results
The source presents three finite basis theorems in Chapter V §4, of which Baker's is the most celebrated.
The three theorems and their hypotheses
Hypothesis
Conclusion
Mechanism
Congruence-distributive, finitely generated
finitely based
Jónsson's lemma plus definable principal congruences
Bounded subdirectly irreducibles plus definability
finitely based
the general mechanism Baker's theorem instantiates
Certain congruence conditions on the variety
finitely based
term-condition arguments
All three share the same architecture: bound the subdirectly irreducibles, make subdirect irreducibility first-order, and convert the resulting sentence into finitely many identities. The hypotheses differ in how they secure the bound.
04Inherently non-finitely-based algebras
Some finite algebras fail to be finitely based in a strong sense: no finitely based variety contains them and consists only of locally finite algebras.
Non-finitely based
V(A) has no finite basis
The variety generated by A requires infinitely many identities. Lyndon's example is the classical instance.
Inherently non-finitely based
Stronger
A lies in no finitely based locally finite variety at all. Not merely V(A) but everything reasonable containing A fails.
CautionFiniteness of the algebra gives no guarantee
The intuition that a finite object should have a finite description is misleading here. A finite algebra can generate a variety requiring infinitely many identities, and identifying which finite algebras do was a major programme. Congruence distributivity is what rules it out in Baker's setting.
05What the source records as open
The closing survey lists the decidability of the finite basis property as Problem 10, attributed to Tarski.
Pre-1981
Lyndon's counterexample
A finite algebra generating a non-finitely-based variety. Settles the existence question negatively.
1970s
Baker's theorem
Congruence distributivity plus finite generation gives a finite basis. The main positive result of the period.
1981
The source's Problem 10
Is there an algorithm deciding whether V(A) has a finitely based equational theory, for A a finite algebra of finite type? Recorded as open.
Post-source
Resolved
The decidability question was settled after the source was written. The Research Frontier stream reports the outcome and marks it as beyond the 1981 text.
NoteWhy this is flagged rather than stated here
The source presents Problem 10 as open, and it is not. Stating the resolution here without marking it would misrepresent what the text says; omitting it entirely would leave a reader believing a settled question is open. The collection's convention is to report the source faithfully and route the update to a page explicitly marked as post-source.
06Practical bearing
Existence, not construction
Bases are astronomically large
Baker's theorem guarantees a finite basis without producing a usable one. Explicit bases for specific finite algebras are found by other means, usually computational.
Elementary class
The payoff
A finitely based variety is an elementary class, so compactness and the whole model-theoretic apparatus apply to it. This is often the real reason a finite basis matters.
Computational tools
Where to look
Finding explicit equational bases for small finite algebras is a job for UACalc and automated theorem provers rather than for hand computation. The sourcing policy page routes to current tools.
Frequently asked
Does every finite lattice generate a finitely based variety?
Yes, by Baker's theorem — lattices are congruence-distributive, and a finite lattice is a finite algebra of finite type. The same applies to any finite algebra whose generated variety is congruence-distributive.
Is congruence distributivity necessary for a finite basis?
No, it is sufficient only. Many finite algebras outside congruence-distributive varieties generate finitely based varieties — finite groups, for instance, by Oates and Powell. The hypothesis in Baker's theorem is not a characterisation.
How large is the basis Baker's theorem produces?
The construction gives no useful bound and the resulting basis is enormous even for small algebras. The theorem should be read as an existence statement. Where an explicit basis is wanted, it is found by search rather than by following the proof.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Three Finite Basis Theorems. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Three Finite Basis Theorems as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—basis, finite, problem, theorem, baker's—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Three Finite Basis Theorems?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about basis would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Linear Algebra — Massachusetts Institute of Technology. Used for systems, vector spaces, determinants, eigenvalues and matrices. Accessed 2026-08-13.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
