Completeness is not equational, so complete lattices are not a variety. Yet every congruence lattice is complete, and algebraic besides. That tension organises the chapter.
Engineering · Mathematics10 min readKV-MATH-0206
Learning objectives
Define completeness and show that arbitrary meets imply arbitrary joins.
Define compact elements and algebraic lattices.
Explain why algebraicity is the residue of finitary operations.
State the correspondence with finitary closure operators.
Recognise Sub(A) and Con A as algebraic lattices.
01Completeness and the one-sided criterion
A lattice is complete when every subset — including the empty set and infinite subsets — has both a supremum and an infimum. The empty-set clause forces the existence of a greatest and a least element, since sup ∅ is the least element and inf ∅ is the greatest.
Key resultArbitrary meets suffice
If every subset of a poset has an infimum, then every subset has a supremum as well: the supremum of X is the infimum of the set of upper bounds of X. So completeness need only be checked on one side. This is used constantly, because closure-system arguments naturally produce arbitrary intersections and hence arbitrary meets.
The proof is short and worth carrying. Let U be the set of upper bounds of X, and let p = inf U, which exists by hypothesis. Every element of X is below every element of U, so every element of X is a lower bound of U, hence below inf U = p. So p is an upper bound of X, so p ∈ U, so p is the least element of U — that is, sup X.
02Compact elements
An element c of a complete lattice is compact when c ≤ sup X implies c ≤ sup Y for some finite Y ⊆ X. The name is borrowed from topology and the analogy is exact: compactness is the property that a cover can be reduced to a finite subcover.
c compact ⟺ ∀X ( c ≤ ⋁X ⟹ ∃ finite Y ⊆ X with c ≤ ⋁Y )
The set of compact elements is closed under finite joins but generally not under meets, and need not be a sublattice.
In the lattice of subuniverses of an algebra, the compact elements are exactly the finitely generated subuniverses. That identification is the substance behind the abstract definition, and it is why compactness is the right notion to isolate.
03Algebraic lattices
A complete lattice is algebraic when every element is the supremum of the compact elements below it. Equivalently, the compact elements are join-dense.
Definition
Join-density of compacts
Every element is a join of compact elements. Nothing is 'invisible' to the finite part of the lattice.
Source
Finitary operations
Because the operations of an algebra are finitary, membership in a generated subuniverse always depends on finitely many generators. Algebraicity is the lattice-level shadow of that fact.
Examples
Sub(A) and Con A
Both are algebraic for every algebra A. So is the lattice of subgroups, of ideals, of submodules, and of closed sets under any finitary closure operator.
CautionComplete does not imply algebraic
The unit interval [0, 1] under the usual order is a complete lattice. Its only compact element is 0, because any positive number is the supremum of the numbers strictly below it with no finite subset sufficing. So [0, 1] is complete and very far from algebraic, and it is not the congruence lattice of any algebra.
04The representation theorem
ProcedureRecognising an algebraic lattice
in: complete lattice L → out: algebraic decision, plus a representation
input: complete lattice L
compute K = { c ∈ L : c is compact }
for each a ∈ L:
check a = ⋁ { c ∈ K : c ≤ a }
if the identity holds for every a: L is algebraic
then L ≅ the lattice of closed sets of a finitary closure operator
and L ≅ Sub(A) for some algebra A
The converse direction is Birkhoff–Frink: every algebraic lattice arises as Sub(A) for some algebra A. Caveat: the representing algebra is not unique and is typically enormous relative to L.
The correspondence with closure operators runs in both directions and is developed on its own page in this stream. Its practical value is that it converts questions about generated substructures into lattice-theoretic questions and back.
05The congruence lattice representation problem
Every congruence lattice is algebraic. The converse question — is every algebraic lattice a congruence lattice? — was answered affirmatively by Grätzer and Schmidt: every algebraic lattice is isomorphic to Con A for some algebra A.
Sub(A) representation
Birkhoff–Frink
Every algebraic lattice is the subuniverse lattice of some algebra. The construction is direct.
Con A representation
Grätzer–Schmidt
Every algebraic lattice is the congruence lattice of some algebra. Substantially harder, and the algebra produced is large.
NoteThe finite case remained open far longer
Whether every finite lattice is the congruence lattice of a finite algebra is a different and much harder question, and the general representation theorem does not settle it. This is one of the places where the 1981 source and the present state of the field diverge, and the Research Frontier stream addresses it.
Frequently asked
Why isn't the class of complete lattices a variety?
Because completeness cannot be expressed by identities. Terms are finite, so an equation constrains only finitely many elements at a time, whereas completeness asserts the existence of suprema for arbitrary subsets. Concretely, the class of complete lattices is not closed under subalgebras: a sublattice of a complete lattice need not be complete.
Are the compact elements of Con A the finitely generated congruences?
Yes — the compact elements of Con A are precisely the congruences generated by finitely many pairs, and in particular the principal congruences Θ(a, b) are compact. This is the congruence-lattice analogue of finitely generated subuniverses being the compact elements of Sub(A).
Does algebraicity constrain the lattice much?
It rules out a great deal — [0, 1] and other continuous structures — but by Birkhoff–Frink and Grätzer–Schmidt it is the only constraint for arbitrary algebras. So in the infinite setting, algebraicity is exactly the right characterisation and nothing further can be said. The interest shifts entirely to restricted settings, such as finite algebras or algebras in a fixed variety.
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 Complete Lattices and Algebraic Lattices. 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 Complete Lattices and Algebraic Lattices as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—lattices, algebraic, lattice, complete, compact—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 Complete Lattices and Algebraic Lattices?
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 lattices 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.
