A lattice is either an ordered set in which every pair has a supremum and an infimum, or an algebra with two idempotent commutative associative operations linked by absorption. Proving these are the same object is the first real theorem of the subject.
Engineering · Mathematics11 min readKV-MATH-0203
Learning objectives
Define a lattice as a poset and as an algebra of type (2, 2).
State the four pairs of identities that axiomatise a lattice algebraically.
Recover the order relation from the operations and vice versa.
Explain why the algebraic definition is the one universal algebra requires.
Identify bounded, complemented and lattice-ordered variants correctly.
01The order-theoretic definition
Start with a partially ordered set: a set with a reflexive, antisymmetric, transitive relation ≤. For a subset X, an upper bound is an element above everything in X, and the least upper bound — the supremum or join — is the smallest such element when one exists. Greatest lower bound, infimum and meet are dual.
Key resultA lattice is a poset with binary sups and infs
A poset is a lattice when every two-element subset has both a least upper bound and a greatest lower bound. By induction this gives sups and infs for all finite non-empty subsets, but not for infinite ones — that stronger condition defines a complete lattice and is a genuinely different notion.
Suprema and infima are unique when they exist, which is what licenses writing them as operations. Uniqueness follows from antisymmetry: two least upper bounds are each below the other, hence equal. Without antisymmetry — in a preordered set — the construction fails and no algebra results.
02The algebraic definition
The alternative definition discards the order entirely and posits two binary operations satisfying eight identities in four dual pairs.
The lattice identities
Pair
Join form
Meet form
Idempotency
x ∨ x ≈ x
x ∧ x ≈ x
Commutativity
x ∨ y ≈ y ∨ x
x ∧ y ≈ y ∧ x
Associativity
x ∨ (y ∨ z) ≈ (x ∨ y) ∨ z
x ∧ (y ∧ z) ≈ (x ∧ y) ∧ z
Absorption
x ∨ (x ∧ y) ≈ x
x ∧ (x ∨ y) ≈ x
Absorption is the pair that does the real work. Without it one has two independent semilattices with no relationship; absorption is precisely the condition that forces them to induce the same order. Note also that idempotency is derivable from absorption together with the rest, so the axiom set is not independent — it is presented redundantly because the dual symmetry is more useful than minimality.
03Proving the two definitions agree
ProcedureTranslating between the order and algebraic definitions
in: either presentation → out: the other, canonically
given a lattice poset ⟨L, ≤⟩:
define x ∨ y := sup{x, y} and x ∧ y := inf{x, y}
verify the eight identities directly from the sup/inf characterisation
given a lattice algebra ⟨L, ∨, ∧⟩:
define x ≤ y iff x ∨ y = y
(equivalently, by absorption, x ≤ y iff x ∧ y = x)
verify ≤ is reflexive (idempotency), antisymmetric (commutativity),
and transitive (associativity)
verify x ∨ y = sup{x, y} and x ∧ y = inf{x, y} under ≤
the two translations are mutually inverse
Correctness rests on absorption: it is what makes the two candidate definitions of ≤ agree. Caveat: the equivalence is for lattices, not for complete lattices — completeness is not equationally expressible.
The step worth dwelling on is the equivalence of the two definitions of the order. If x ∨ y = y then x ∧ y = x ∧ (x ∨ y) = x by absorption; the converse is symmetric. Every subsequent argument that slides between the two forms is using this.
04Why universal algebra insists on the algebraic form
Both definitions describe the same objects, so the choice might look like taste. It is not. The HSP theorem says that a class is a variety exactly when it is equationally definable, and only the algebraic definition is equational.
Order-theoretic
Not a variety
A sub-poset of a lattice need not be a lattice, and the class is not closed under homomorphic images in any useful sense. The order relation is a relation, not an operation, so the structures are not algebras at all.
Algebraic
A variety
Closed under H, S and P automatically, because it is defined by identities. Sublattices, quotient lattices and products of lattices are lattices.
CautionSublattice is stronger than sub-poset
A subset of a lattice that happens to be a lattice under the inherited order need not be a sublattice, because its sups and infs may differ from those computed in the parent. A sublattice must be closed under the parent's ∨ and ∧. This distinction is a recurring source of error, and it is exactly the distinction the algebraic definition makes unmissable.
05Bounded, complemented and related variants
Several standard enrichments add operations to the type, and each changes the variety and its subalgebra lattice.
Common lattice types
Type
Operations
Consequence
Lattice
(2, 2)
The base case. May have no greatest or least element.
Bounded lattice
(2, 2, 0, 0)
Constants 0 and 1 in the type, so every subalgebra contains them.
Complemented lattice
(2, 2, 0, 0) + axiom
Complements need not be unique unless the lattice is distributive.
Boolean algebra
(2, 2, 1, 0, 0)
Complementation is an operation, hence preserved by homomorphisms.
Lattice-ordered group
(2, 2, 2, 1, 0)
Group and lattice structure interacting; a variety in the combined type.
The Boolean case illustrates the general point. Making complementation a unary operation rather than an existence axiom means homomorphisms must preserve it, which is why Boolean algebra homomorphisms are much more rigid than lattice homomorphisms between the same objects.
Frequently asked
Is every partially ordered set a lattice?
No. The poset consisting of two incomparable elements has no upper bound for the pair at all, so no least upper bound. Even a poset with all upper bounds present may fail: if two elements have several minimal upper bounds and none is below the others, there is no supremum. Failure of sup or inf on a single pair is enough to disqualify the poset.
Are the eight lattice identities independent?
No. Idempotency follows from absorption and the remaining axioms: x ∨ x = x ∨ (x ∧ (x ∨ x)) = x by two applications of absorption. The redundant presentation is retained because the dual symmetry between the join and meet columns makes every subsequent proof come in pairs, and halving the axioms would destroy that.
Why can't completeness be added as an identity?
Because identities are equations between terms, and terms are finite. An identity can only ever constrain finitely many elements at once. Completeness asserts the existence of suprema for arbitrary subsets, including infinite ones, which no finite term can express. This is why complete lattices do not form a variety and why the class is not closed under the usual constructions.
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 Posets and the Two Definitions of a Lattice. 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 Posets and the Two Definitions of a Lattice as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—algebraic, algebra, definitions, lattice, universal—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 Posets and the Two Definitions of a Lattice?
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 algebraic 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.
