Core Structure Theory
The Congruence Lattice Con(A) and its Algebraicity
Con(A) as a complete algebraic lattice, its relationship to the ambient lattice of equivalence relations, and the sense in which it is the fundamental invariant of an algebra.
Learning objectives
- Establish that Con(A) is a complete algebraic lattice
- Compute joins and meets of congruences
- Explain what Con(A) does and does not determine about A
The lattice
The congruences on A, ordered by inclusion, form a complete lattice Con A with least element Δ and greatest element ∇.
Meets are intersections: an intersection of congruences is an equivalence relation and inherits the substitution property, so it is a congruence. Completeness then follows from the one-sided criterion, since ∇ is the greatest element.
The join of two congruences is the smallest congruence containing both. This contains the transitive closure of their union — their join in Eq(A) — and can in principle be larger. For most familiar algebras the two coincide, but the distinction is real.
Algebraicity
The congruence-generation operator Θ is an algebraic closure operator on A × A, for the same reason Sg is algebraic on A: relating a pair requires only finitely much information, because operations are finitary.
Every congruence is the directed join of the finitely generated congruences below it. So proving a statement about all congruences frequently reduces to proving it for finitely generated ones, and Zorn's lemma arguments over congruences always have the directed unions they need.
The Grätzer–Schmidt theorem
A lattice is isomorphic to Con A for some algebra A if and only if it is algebraic.
Both directions carry weight. Algebraicity is a genuine restriction — not every complete lattice is algebraic. But it is the only restriction: no further condition constrains which lattices arise as congruence lattices.
Whether every finite lattice is the congruence lattice of a finite algebra is the finite lattice representation problem, unresolved. The Grätzer–Schmidt construction produces an infinite algebra even from a finite lattice.
What Con(A) controls
The shape of Con(A) across a variety determines which structural tools are available. This is the organising idea of Chapter II §12 and of much of Chapter IV.
| Condition on Con | Name | Consequence |
|---|---|---|
| Distributive for all members | Congruence-distributive | Jónsson's lemma; strong structure theory; Baker's finite basis theorem |
| Modular for all members | Congruence-modular | A commutator theory generalising the group commutator |
| All congruences permute | Congruence-permutable | Mal'cev term; congruences determined by one class |
| Con is a chain | Congruence-linear | Very restrictive; rare |
| Only Δ and ∇ | Simple | The algebra is a building block for subdirect representations |
Lattices and Boolean algebras are congruence-distributive; groups, rings and modules are congruence-modular and congruence-permutable but not congruence-distributive; semigroups are none of these.
What Con(A) does not determine
Con(A) does not determine A. Every simple algebra has the two-element congruence lattice, and simple algebras occur in vast diversity — simple groups, simple rings, the two-element Boolean algebra. The invariant is informative about available machinery, not about the identity of the algebra.
Frequently asked questions
Is Con(A) a sublattice of Eq(A)?
It is a complete meet-sublattice — meets agree, both being intersection. Joins need not agree, so it is not in general a sublattice.
How is the congruence lattice computed in practice?
Usually by finding the principal congruences Θ(a,b) and computing their joins. For a finite algebra this is a finite calculation, and it is how congruence lattices of small algebras are determined.
Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section II.5, book pages 40-42.
This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.