No label defined (Q4458808)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2057305
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2057305

      Statements

      0 references
      0 references
      0 references
      15 March 2004
      0 references
      uniform lattice
      0 references
      congruence lattice
      0 references
      chopped lattice
      0 references
      It is well known [\textit{N. Funayama} and \textit{T. Nakayama}, Proc. Imp. Acad. Tokyo, 18, 553--554 (1942; Zbl 0063.01483)] that the congruence lattice \(\operatorname{Con}L\) of a lattice \(L\) is distributive. Conversely, R. P. Dilworth proved that every \textit{finite} distributive lattice is isomorphic to \(\operatorname{Con}L\), for some \textit{finite} lattice \(L\). Reaching the same conclusion strenghtened by additional restrictions on the lattice \(L\) is a large research program, sketched, in particular, by \textit{G. Grätzer} and \textit{E. T. Schmidt} in ``Congruence lattices'' [Appendix C of \textit{G. Grätzer}, General lattice theory. Second edition. Basel: Birkhäuser (1998; Zbl 0909.06002)]. On the positive side, R. P. Dilworth proved that one can take \(L\) to be sectionally complemented, that is, for all \(a\leq b\) in \(L\) there exists \(x\in L\) such that \(a\vee x=b\) and \(a\wedge x=0\) [see \textit{G. Grätzer} and \textit{E. T. Schmidt}, Acta Math. Acad. Sci. Hung. 13, 179--185 (1962; Zbl 0101.02103)]. A stronger requirement on \(L\) is that \(L\) be relatively complemented, that is, for all \(a\leq b\leq c\) in \(L\), there exists \(x\in L\) such that \(b\vee x=c\) and \(b\wedge x=a\). However, the congruence lattice of a finite relatively complemented lattice is finite Boolean [see \textit{R. P. Dilworth}, Ann. Math. (2) 51, 348--359 (1950; Zbl 0036.01802)]. Hence, in particular, the three-element chain is not isomorphic to the congruence lattice of any finite relatively complemented lattice. A possible weakening of relative complementation is to be \textit{uniform}. A lattice \(L\) is uniform if any two congruence classes of \(L\) have the same cardinality. Every relatively complemented lattice is uniform, but not every sectionally complemented lattice is uniform. Also, not every uniform lattice is sectionally complemented. Here the authors prove the following main result: Theorem: Every finite distributive lattice is isomorphic to the congruence lattice of some finite uniform lattice. The proof uses the so-called ``chopped lattices'', often used in this field of research, together with the following tool: for bounded lattices \(A\) and \(B\), form the lattice \(\{0,1\}\times B\); insert a copy of \(A\) in the prime interval \([(0,b),(1,b)]\), for all \(b\in B\); let \(N(A,B)\) be the resulting lattice.
      0 references

      Identifiers