Finite Lattice Representation Problem

Importance: Outstanding ✭✭✭✭
Subject: Algebra
Recomm. for undergrads: no
Posted by: williamdemeo
on: December 10th, 2010

\begin{conjecture} % Enter your conjecture in LaTeX % You may change "conjecture" to "question" or "problem" if you prefer. There exists a finite lattice which is not the congruence lattice of a finite algebra. \end{conjecture}

% You may use many features of TeX, such as % arbitrary math (between $...$ and $$...$$) % \begin{theorem}...\end{theorem} environment, also works for question, problem, conjecture, ... % % Our special features: % Links to wikipedia: \Def {mathematics} or \Def[coloring]{Graph_coloring} % General web links: \href [The On-Line Encyclopedia of Integer Sequences]{} A well-known result of \Def[universal algebra]{Universal_algebra} states: every \Def[algebraic lattice]{Algebraic_lattice} is isomorphic to the congruence lattice of an algebra. Thus there is essentially no restriction on the shape of a congruence lattice of a general algebra. It is natural to ask whether the same is true for finite lattices and finite algebras. That is, does every finite lattice occur as the congruence lattice of a finite algebra? This fundamental question, asked over 40 years ago, is among the most elusive problems of universal algebra.

This question is important because, until it is answered, we lack something very basic in our understanding of algebras -- namely, if we assume an algebra is finite, does this place any restriction on the shape of its congruence lattice? If so, then finite algebras are fundamentally different from infinite algebras in this sense.


% Example: %*[B] Claude Berge, Farbung von Graphen, deren samtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10 (1961), 114. % %[CRS] Maria Chudnovsky, Neil Robertson, Paul Seymour, Robin Thomas: \arxiv[The strong perfect graph theorem]{math.CO/0212070}, % Ann. of Math. (2) 164 (2006), no. 1, 51--229. \MRhref{MR2233847} % % (Put an empty line between individual entries)

[GS] Gratzer and Schmidt, Characterizations of congruence lattices of abstract algebras, Acta Sci. Math. (Szeged) 24 (1963), 34-59.

[P5] Palfy and Pudlak. Congruence lattices of finite algebras and intervals in subgroup lattices of finite groups. Algebra Universalis, 11 (1980), 22–27.

[PT] Pudlak and Tuma, Every finite lattice can be embedded in the lattice of all equivalences over a finite set. Algebra Universalis, 10 (1980), 74–95.

* indicates original appearance(s) of problem.