Monomial congruence¶
A join-semilattice congruence in which every equivalence class has a greatest element.
Core Idea¶
A monomial congruence is an equivalence relation on a join-semilattice that respects join and whose every class has a greatest member.[1] “Respects join” means x~y implies x∨z~y∨z for any z. The greatest member of a class lies above all its other members in the order given by join. A chosen representative is insufficient unless it really has that property.
The two tests are separate. Join compatibility makes it possible to join equivalence classes without caring which representatives were chosen. The class-top requirement distinguishes the monomial case from a general semilattice congruence.
Scope of Application¶
This type belongs to semilattice and lattice congruence arguments. Schmidt defined it in his 1968 study of congruence-lattice representation.[1] It can occur on finite or infinite carriers. On a finite join-semilattice, every congruence is monomial: each class is closed under join, so joining its finitely many members gives a greatest member. That shortcut fails for an infinite class without a top.
For an infinite positive example, use nonnegative integers with join=max and group each adjacent pair {2n,2n+1} into a class. Joining equivalent integers with any third integer keeps results in the same pair or makes both results equal. Each class has greatest member 2n+1. This example is a direct deduction from the definition, not an example attributed to Schmidt.
Clarity¶
State the carrier and join first, then verify the relation is an equivalence and respects join. Finally check every class for a greatest member. The universal relation on the same unbounded max-chain is a near miss: it respects join, but its sole class is all of ℕ, which has no greatest member. One failed class is enough to rule out monomiality.
Manages Complexity¶
The definition turns a question about an entire quotient into an explicit test on its classes. In the adjacent-pair example, the formula 2n+1 certifies a top for infinitely many classes at once. In the universal-relation example, unboundedness immediately disproves the class-top condition. These shortcuts work only after join compatibility is established.
Abstract Reasoning¶
To prove a proposed congruence is monomial, establish join compatibility and construct a top for every class. To disprove it while keeping the congruence, identify a class without a top. Schmidt's 1981 wording uses “maximal” rather than “greatest.”[2] For a join-congruence class the two coincide: joining a maximal member with any classmate stays in the class and cannot rise above that maximal member, so it already dominates every classmate.
Knowledge Transfer¶
The same test applies literally to different join-semilattices, such as Boolean joins and max-chains. Equivalence Relation is the strict Prime parent because every congruence is an equivalence relation; the extra semilattice and class-top requirements give this entry its narrower identity. A quotient algebra is an output made from compatible classes, not a broader kind of monomial congruence. Weakly Distributive Homomorphism instead tests a map between two semilattices. The original source entry's separate distributive-congruence branch remains unresolved in this curation.
Relationships to Other Abstractions¶
Current abstraction Monomial congruence Domain-specific
Parents (1) — outgoing typed relations
-
Monomial congruence is a kind of Equivalence Relation Prime
Every monomial congruence is an equivalence relation; join compatibility and classwise greatest elements make it narrower.
Hierarchy path (1) — routes to 1 parentless root
- Monomial congruence → is a kind of Equivalence Relation
Neighborhood in Abstraction Space¶
Monomial congruence sits in a sparse region of the domain-specific corpus (62nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (2769 abstractions)
Nearest neighbors
- Distributive congruence — 0.92
- Complete Heyting algebra — 0.85
- Weakly distributive homomorphism — 0.85
- Distributivity (order theory) — 0.85
- Completely distributive lattice — 0.83
Computed from structural-signature embeddings · 2026-10-25
References¶
[1] E. Tamás Schmidt, “Zur Charakterisierung der Kongruenzverbände der Verbände,” Matematický časopis 18(1) (1968), 3–20, §4, Definition 4.7 (printed p. 8). Full paper: https://dml.cz/bitstream/handle/10338.dmlcz/126757/MathSlov_18-1968-1_1.pdf registry ↩a ↩b
[2] E. T. Schmidt, “The ideal lattice of a distributive lattice with 0 is the congruence lattice of a lattice,” Acta Scientiarum Mathematicarum 43 (1981), 153–168, Definition 2 (printed p. 156). Full issue: https://acta.bibl.u-szeged.hu/38622/1/math_043_fasc_001_002.pdf registry ↩