Paperlane

no. 16 · Tuesday 17 November 2026

Congruence density under sublattice inclusion

George Grätzer

math.RA · v2

Abstract

Following Gábor Czédli, the \emph{congruence density} of a finite lattice $A$ is $\cd(A)=|\Con A|/2^{|A|-1}$, where $\Con A$ is its congruence lattice and $|A|$ is its number of elements. Czédli proved that density cannot increase under several kinds of sublattice extension and asked whether this holds for every sublattice inclusion. For a sublattice $S$ of $L$, we prove the stronger inequality $\cd(L)\leq2^{-d}\cd(S)$, where $d$ is the larger of the increases in the numbers of join-reducible and meet-reducible elements. The proof follows congruence labels along the chains into which prime intervals of $S$ split in $L$. We also prove that $\cd(L)=\cd(S)$ if and only if every element of $L-S$ is comparable with every element of $L$. The theorem of G. Czédli and L.~Szabó relating compatible quasiorders to pairs of congruences gives the corresponding quasiorder-density results.

fields
Rings and Algebras
pdf ↗ page arXiv:2611.16165 ↗