Lattice Homomorphisms, Isomorphisms and Sublattices
Order-preserving is not the same as operation-preserving. The gap between the two is where most errors in elementary lattice theory live.
Engineering · Mathematics10 min readKV-MATH-0204
Learning objectives
Distinguish monotone maps from lattice homomorphisms with a concrete example.
Verify that a subset is a sublattice rather than merely a sub-poset.
Characterise lattice isomorphisms as order isomorphisms.
Recognise when a bijective homomorphism fails to be an isomorphism.
Use embeddings to state forbidden-sublattice criteria.
01Homomorphisms preserve operations, not merely order
A lattice homomorphism is a map α with α(x ∨ y) = α(x) ∨ α(y) and α(x ∧ y) = α(x) ∧ α(y). Every such map is monotone: if x ≤ y then x ∨ y = y, so α(x) ∨ α(y) = α(y), giving α(x) ≤ α(y).
CautionMonotone does not imply homomorphic
Take the four-element lattice with bottom 0, top 1 and two incomparable middle elements a, b. Map it to the three-element chain by sending 0 to 0, both a and b to the middle, and 1 to 1. This is monotone. But a ∨ b = 1 maps to 1, while the image of a joined with the image of b is the middle element. The map preserves order and destroys joins.
The failure is instructive: monotone maps preserve the order relation but need not preserve leastness of upper bounds. Preservation of the operations is a strictly stronger requirement, and it is the requirement that makes lattices algebras in the universal-algebraic sense.
02Isomorphism: where order and algebra coincide
For isomorphisms the gap closes. A bijection between lattices is a lattice isomorphism if and only if both it and its inverse are monotone — that is, if and only if it is an order isomorphism.
ProcedureTesting whether a bijection is a lattice isomorphism
in: bijection α → out: isomorphism decision
input: bijection α : L → M between lattices
check α is monotone: x ≤ y ⟹ α(x) ≤ α(y)
check α⁻¹ is monotone: α(x) ≤ α(y) ⟹ x ≤ y
if both hold: α preserves ∨ and ∧, hence is an isomorphism
if only the first holds: α is monotone but may destroy joins or meets
Correctness: a bijection reflecting and preserving order carries suprema to suprema. Caveat: monotone bijection alone is insufficient — the identity map from an antichain-with-bounds to a chain on the same set is a monotone bijection and not an isomorphism.
This is a genuine peculiarity of lattices. In groups a bijective homomorphism is automatically an isomorphism; in lattices a bijective monotone map is not, though a bijective homomorphism still is. The distinction is worth keeping straight because order-theoretic intuition suggests otherwise.
03Sublattices and the closure requirement
A sublattice is a subset closed under the parent lattice's join and meet. The standard trap is a subset that forms a lattice under the inherited order while computing different sups and infs than the parent does.
Take the subset and the inherited order
Check whether every pair within the subset has a sup and inf within the subset. If not, it is not even a sub-poset lattice.
Compare against the parent's operations
For each pair, compute x ∨ y and x ∧ y in the parent. If either falls outside the subset, the subset is not a sublattice however well behaved it looks internally.
Conclude
Closure under the parent operations is the definition. Nothing weaker suffices, because homomorphic image and product arguments all use the parent operations.
Because sublattices are exactly the subuniverses of the algebra ⟨L, ∨, ∧⟩, they form an algebraic lattice under inclusion — a fact that generalises to every algebra and is developed in the Core stream.
04Embeddings and forbidden configurations
An embedding is an injective homomorphism, so its image is a sublattice isomorphic to the source. Embeddings matter because the central classification results in elementary lattice theory are stated as forbidden sublattices.
Criterion
Modularity
A lattice is modular if and only if N5, the five-element non-modular pentagon, does not embed in it.
Criterion
Distributivity
A lattice is distributive if and only if neither N5 nor M5, the five-element diamond, embeds in it.
Why embeddings
Local to global
Both conditions are equational, hence inherited by sublattices. A single bad sublattice is therefore a genuine obstruction, and the theorems say that these two are the only obstructions.
05Congruences on lattices, briefly
Lattice congruences behave less conveniently than group congruences, and it is worth seeing why early. Lattices are congruence-distributive, which is a strong and useful property, but they are not congruence-permutable.
Congruence-distributive
Yes
Con L is a distributive lattice for every lattice L. This makes Jónsson's lemma available and underlies much of the structure theory.
Congruence-permutable
No
There is no Mal'cev term for lattices, so joins of congruences require the infinite alternating composite rather than a single composition.
The consequence for practice is that computing a join of two lattice congruences is genuinely harder than computing a meet, and arguments that implicitly assume θ ∨ φ = θ ∘ φ are simply invalid here.
Frequently asked
Is the image of a sublattice under a homomorphism a sublattice?
Yes. Homomorphisms preserve both operations, so the image of a set closed under them is closed under them. This is the S and H compatibility that makes the class of lattices a variety, and it holds for any algebra of any type.
Can a lattice homomorphism fail to preserve bounds?
Yes, if the bounds are not in the type. A homomorphism of lattices need not send the least element to the least element, because 0 and 1 are not operations in type (2, 2) — they are merely elements that happen to exist. In the bounded lattice type (2, 2, 0, 0) they are nullary operations and preservation is forced. This is a worked example of why the type must be stated.
Why is N5 called non-modular rather than non-distributive?
Because it fails modularity, which is the weaker condition, and therefore fails distributivity too. M5 is modular but not distributive, so it separates the two notions: excluding N5 alone gives modularity, and excluding both gives distributivity. The pair of criteria is what makes the hierarchy visible.
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 Lattice Homomorphisms, Isomorphisms and Sublattices. 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 Lattice Homomorphisms, Isomorphisms and Sublattices as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—lattice, homomorphisms, sublattices, algebra, isomorphisms—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 Lattice Homomorphisms, Isomorphisms and Sublattices?
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 lattice 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.
