Hobby and McKenzie's 1988 monograph classifies the local behaviour of every finite algebra into exactly five types. It is the single largest addition to the subject since the source was written.
Engineering · Mathematics11 min readKV-MATH-0259
NoteBeyond the source text
This page covers developments that postdate the 1981 source. It is included because it is the direct continuation of themes the source raises, and is marked so its provenance stays legible.
Learning objectives
Explain what localisation means for a finite algebra.
List the five types and their characteristic behaviour.
Define the type set of a finite algebra and of a variety.
State how omitting types corresponds to Mal'cev conditions.
Relate the classification to congruence-modularity and distributivity.
Situate the theory relative to the source's 1981 picture.
01The idea
Tame congruence theory analyses a finite algebra by restricting attention to small definable subsets and asking what structure survives there.
Take a covering pair in Con A
A pair of congruences α ≺ β with nothing strictly between them. Every finite algebra has many.
Localise to a minimal set
Restrict to a minimal subset U of A on which the pair is still visible — obtained by applying idempotent unary polynomials.
Read off the induced algebra
The polynomial operations of A restricted to U induce an algebra on the trace, and it is very constrained.
Classify
The induced algebra is of exactly one of five kinds. That kind is the type of the covering pair.
Key resultLocalisation is the new instrument
The 1981 picture classifies varieties by global conditions on congruence lattices. Tame congruence theory classifies finite algebras by local behaviour at each covering pair. It is a strictly finer instrument, and it applies where the global conditions say nothing.
02The five types
The type classification
Type
Induced algebra
Character
1
a finite set with permutations
unary — a G-set, no operations of arity > 1
2
a vector space over a finite field
affine — module-like, Abelian
3
the two-element Boolean algebra
Boolean
4
the two-element lattice
lattice
5
the two-element semilattice
semilattice
Types 3, 4 and 5 all have two-element traces and differ in which operations survive. Type 2 is the affine case connecting to the centre and the commutator from Chapter II §13. Type 1 is the degenerate case where only unary structure remains.
Types 1 and 2
Abelian behaviour
The trace is unary or affine. These are the types where the commutator is trivial and module-like structure appears.
Types 3, 4, 5
Non-Abelian behaviour
Boolean, lattice or semilattice. These carry genuine order or logical structure.
03Type sets
The type set of a finite algebra is the set of types occurring at its covering pairs. The type set of a locally finite variety is the union over its finite members.
typ(A) ⊆ {1, 2, 3, 4, 5} typ(V) = ⋃ { typ(A) : A ∈ V finite }
Which types a variety omits turns out to correspond exactly to Mal'cev conditions, which is the central discovery.
Key resultOmitting types is a Mal'cev condition
For a locally finite variety, omitting a given set of types is equivalent to satisfying a corresponding Mal'cev condition. The classification is therefore not a parallel taxonomy but a refinement of the one the source presents — the 1981 conditions are the coarse shadow of the type analysis.
04Recovering the 1981 conditions
Congruence conditions as type conditions
Condition on a locally finite variety
Type-set characterisation
Congruence-distributive
omits types 1, 2 and 5
Congruence-modular
omits types 1 and 5
Congruence-permutable
omits types 1, 4 and 5
Congruence meet-semidistributive
omits types 1 and 2
Congruence-join-semidistributive
omits types 1, 2 and 5
Locally finite and Abelian-like
types 1 and 2 only
Reading the table shows why the source's hierarchy has the shape it does. Type 1 is omitted by every useful condition — it is the wholly degenerate case. Type 2 is the affine type, so omitting it is what distinguishes the meet-semidistributive conditions from the modular ones, and its presence is exactly the presence of module-like structure.
NoteThis is why the 1981 diagram is still correct
Figure 36 in the source shows a genuine hierarchy, and tame congruence theory explains rather than overturns it. What the newer theory adds is a mechanism: each inclusion in the diagram corresponds to omitting one more type.
05What it enabled
Finite basis theorems
New positive results
Willard's finite basis theorem for congruence meet-semidistributive varieties, and further results, were obtained using type-set hypotheses unavailable in 1981.
Decidability classification
Sharper answers
The classification of decidable locally finite varieties advanced substantially using type sets, extending the Burris–McKenzie picture the source reports.
Constraint satisfaction
The enabling technology
The algebraic CSP programme depends on the type analysis. The dichotomy theorem is stated in terms of Mal'cev conditions the type machinery makes tractable.
Complexity of algebraic decision problems
A new area
Deciding which type conditions a finite algebra satisfies became a studied computational problem in its own right.
06Where this sits relative to the source
The source, 1981
Global conditions on Con A
Congruence-permutable, distributive, modular, arithmetical. Characterised by Mal'cev conditions. A coarse but powerful hierarchy.
Hobby–McKenzie, 1988
Local types at covering pairs
Five types, type sets, omitting conditions. Strictly finer, and it explains why the 1981 conditions behave as they do.
CautionThis page postdates the source
The 1988 monograph appeared seven years after the text and is not mentioned in it. Nothing on this page should be attributed to Burris and Sankappanavar. It is included because the source's Chapter II Mal'cev conditions and its classification survey point directly at it, and a reader who stopped at 1981 would have a materially incomplete picture of how varieties are classified.
Frequently asked
Does tame congruence theory apply to infinite algebras?
The theory as developed is for finite algebras and locally finite varieties, and the localisation machinery uses finiteness essentially. Extensions to broader settings exist but the clean five-type classification is a finite-algebra result.
Is the type of a covering pair computable?
For a finite algebra, yes — the minimal sets and induced algebras are finite objects and can be computed, and UACalc implements this. The cost grows quickly with algebra size, so it is practical for small algebras.
Why exactly five types?
Because the induced algebra on a minimal set is severely constrained — it must be a simple algebra with no proper subalgebras in a strong local sense, and the classification of such algebras yields exactly these five possibilities. The proof is the technical core of the monograph and is not short.
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 Tame Congruence Theory. 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 Tame Congruence Theory as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—tame, congruence, theory, sets, type—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 Tame Congruence Theory?
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 tame 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 — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
