Math 2.0

General algebraic systems Definition

Congruence lattice

Builds on Algebraic structureCongruence relationCongruence generated by a relationComplete latticeAlgebraic latticeCompact elementTransitive closure

Definition

Let 𝐀\mathbf{A} be an algebra with universe AA. Let Con⁡𝐀\operatorname{Con} \mathbf{A} be the set of all congruences on 𝐀\mathbf{A}. The congruence lattice of 𝐀\mathbf{A} is the partially ordered set (Con⁡𝐀,⊆)(\operatorname{Con} \mathbf{A}, \subseteq). Its meet and join are θ∧ψ=θ∩ψ,θ∨ψ=Cg⁡(θ∪ψ),\theta \wedge \psi = \theta \cap \psi, \qquad \theta \vee \psi = \operatorname{Cg}(\theta \cup \psi), where Cg⁡\operatorname{Cg} is the congruence generated by a relation.

Remarks

The join θ∨ψ\theta \vee \psi is also the transitive closure of θ∪ψ\theta \cup \psi, that is, the union of the relations θ∘ψ\theta \circ \psi, θ∘ψ∘θ\theta \circ \psi \circ \theta, and so on. Con⁡𝐀\operatorname{Con} \mathbf{A} is a complete lattice with least element ΔA\Delta_A and greatest element ∇A=A×A\nabla_A = A \times A. It is an algebraic lattice, and its compact elements are the finitely generated congruences Cg⁡(R)\operatorname{Cg}(R) with RR finite.

Example: for the group ℤ/6ℤ\Z/6\Z, the congruences correspond to the subgroups {0}\set{0}, {0,3}\set{0, 3}, {0,2,4}\set{0, 2, 4} and ℤ/6ℤ\Z/6\Z. So Con⁡(ℤ/6ℤ)\operatorname{Con}(\Z/6\Z) has four elements, with two incomparable elements in the middle.

Non-example: the union of two congruences need not be their join. On the group ℤ\Z, the union of congruence modulo 22 and modulo 33 contains (0,2)(0, 2) and (2,5)(2, 5) but not (0,5)(0, 5), so it is not transitive.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algebraic lattice concept
  2. Algebraic structure concept
  3. Compact element concept
  4. Complete lattice concept
  5. Congruence generated by a relation concept
  6. Congruence relation concept
  7. Transitive closure concept
  8. Congruence lattice definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Congruence_lattice_problem
About this page
TagZ937W8RW4N
URIm2://Z937W8RW4N
Kinddefinition
WritingW0 stub
MSC08A30, 06B15
DefinesCongruence lattice
UsesAlgebraic structure, Congruence relation, Congruence generated by a relation, Complete lattice, Algebraic lattice, Compact element, Transitive closure
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.