Eq(A) is the ambient lattice inside which every congruence lattice sits. Its joins are awkward, its meets are trivial, and that asymmetry propagates through the whole subject.
Engineering · Mathematics10 min readKV-MATH-0207
Learning objectives
Describe Eq(A) as a complete algebraic lattice and identify its bounds.
Compute meets and joins of equivalence relations correctly.
Explain why the join is an infinite alternating union in general.
Define permutability and show it collapses the join to a single composite.
Locate Con A as a complete sublattice of Eq(A).
01Eq(A) and the partition correspondence
Equivalence relations on a set A correspond exactly to partitions of A, and the correspondence is an order isomorphism when partitions are ordered by refinement. The relation Δ corresponds to the partition into singletons; ∇ corresponds to the one-block partition.
Two views of the same lattice
Relational view
Partition view
Note
θ ⊆ φ
the θ-partition refines the φ-partition
Refinement is the order.
Δ
all blocks singletons
Least element.
∇
a single block
Greatest element.
θ ∩ φ
blocks are pairwise intersections
Meet is easy.
θ ∨ φ
blocks generated by chaining
Join is not the union.
Eq(A) is a complete lattice: arbitrary intersections of equivalence relations are equivalence relations, so arbitrary meets exist, and by the one-sided criterion arbitrary joins follow. It is algebraic, with the compact elements being the equivalence relations generated by finitely many pairs.
02Meets are intersections; joins are not unions
The intersection of two equivalence relations is an equivalence relation, so the meet in Eq(A) is simply ∩. The union is almost never an equivalence relation, because transitivity fails: a related to b in θ and b related to c in φ gives no relation between a and c in θ ∪ φ.
The join is the union of all finite alternating composites. Two elements are related exactly when a finite chain connects them, alternating between θ-steps and φ-steps.
This is the transitive closure of the union, and the chain length is unbounded in general. That unboundedness is precisely what makes join computations in congruence lattices expensive and what makes the permutable case so much more tractable.
03Permutability
θ and φ permute when θ ∘ φ = φ ∘ θ. When they do, the alternating union collapses immediately: every longer composite equals θ ∘ φ.
ProcedureDeciding permutability and computing the join
in: θ, φ → out: θ ∨ φ, and whether the pair permutes
input: equivalence relations θ, φ on A
compute θ ∘ φ and φ ∘ θ
if θ ∘ φ = φ ∘ θ:
θ ∨ φ = θ ∘ φ (one composite suffices)
and θ ∘ φ is automatically an equivalence relation
otherwise:
θ ∨ φ = transitive closure of θ ∪ φ
computed as the union of alternating composites of unbounded length
Correctness: permutability makes θ ∘ φ symmetric and transitive, hence an equivalence relation containing both, hence the join. Caveat: permutability is a property of the pair, not of the lattice; an algebra is congruence-permutable when every pair of congruences permutes.
Key resultPermutability is a Mal'cev condition
A variety is congruence-permutable exactly when it has a ternary term p satisfying p(x, y, y) ≈ x and p(x, x, y) ≈ y. For groups, p(x, y, z) = x · y⁻¹ · z. For lattices no such term exists, which is why lattice congruence joins remain genuinely infinitary.
04Con A inside Eq(A)
The congruences of an algebra A form a subset of Eq(A) — those equivalence relations compatible with the operations. Con A is a complete sublattice of Eq(A): arbitrary intersections of congruences are congruences, and the join computed in Eq(A) of a family of congruences is again a congruence.
Meets agree
The meet of congruences in Con A is their intersection, exactly as computed in Eq(A). No discrepancy arises.
Joins agree too
The Eq(A) join of congruences is compatible with the operations, so it lies in Con A and is the join there. Con A is therefore a complete sublattice, not merely a complete lattice in its own right.
But the shape can differ wildly
Eq(A) is always geometric and, for |A| ≥ 4, non-modular. Con A may be distributive, modular or arbitrary depending on A, and constraining it is the central classification programme.
05The shape of Eq(A) itself
Eq(A) is a complemented, relatively complemented, algebraic lattice. For sets of size at least four it is non-modular, and the pentagon can be exhibited explicitly.
Eq(A) for |A| ≤ 3
Modular
Small enough that no pentagon fits. Eq of a three-element set is the five-element modular lattice M5.
Eq(A) for |A| ≥ 4
Non-modular
A pentagon appears, so Eq(A) is neither modular nor distributive. Any variety whose members have congruence lattices equal to full Eq(A) is therefore badly behaved.
That Eq of a three-element set is M5 is a pleasing coincidence: the diamond that witnesses non-distributivity in the previous page is itself a partition lattice.
Frequently asked
Is the union of two equivalence relations ever an equivalence relation?
Only when one contains the other. If neither contains the other, pick a pair in θ but not φ and a pair in φ but not θ sharing an element; transitivity then fails in the union. So the union coincides with the join precisely in the comparable case.
Does congruence-permutability imply congruence-modularity?
Yes. Permutable congruences give a modular congruence lattice — this is a classical result and explains why groups, rings and modules all have modular congruence lattices. The converse fails: there are congruence-modular varieties that are not permutable.
Why is Eq(A) non-modular for four-element sets?
Take A = {1, 2, 3, 4} and construct partitions pairing the elements in two different ways, with a third partition comparable to one of them. Chasing the definitions produces a pentagon among the resulting equivalence relations. The consequence is that congruence-modularity is a real restriction on an algebra rather than something inherited free from the ambient partition lattice.
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 Equivalence Relations and the Partition 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 Equivalence Relations and the Partition Lattice as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—partition, lattice, equivalence, joins, permutability—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 Equivalence Relations and the Partition 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 partition 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.
