Math 2.0

Order, lattices, ordered algebraic structures Complete lattices and completions Theorem

Birkhoff–Frink theorem

Builds on Complete latticeCompact elementAlgebraic latticeClosure operator

Statement

Let LL be a complete lattice. The following are equivalent.

  1. LL is an algebraic lattice.
  2. LL is isomorphic to the lattice of subalgebras of some algebra AA, a set with a family of finitary operations, ordered by inclusion.
  3. LL is isomorphic to the lattice of closed sets of an algebraic closure operator cc on some set XX. Algebraic means that c(S)=⋃{c(F):F⊆S finite}c(S) = \bigcup \set{c(F) : F \subseteq S \text{ finite}} for every S⊆XS \subseteq X.

Remarks

From 2 to 3: the subalgebra generated by a set is an algebraic closure operator, since each operation has finitely many arguments. From 3 to 1: in the lattice of closed sets, the compact elements are the closures of finite sets, and every closed set is the union of these. From 1 to 2: one equips the set KK of compact elements of LL with operations whose subalgebras are exactly the ideals of the join-semilattice KK. The map a↦{k∈K:k≤a}a \mapsto \set{k \in K : k \le a} identifies LL with these ideals. For example, the lattice of subgroups of a group and the lattice of ideals of a ring are algebraic. The lattice of closed subsets of [0,1][0, 1] is complete but not algebraic, so it is not a subalgebra lattice.

Going deeper

For a student

The theorem explains why compactness is the right abstraction of "finitely generated": the compact elements of a subalgebra lattice are the finitely generated subalgebras. It is the first of two representation results: the Grätzer–Schmidt theorem shows that the same lattices are also exactly the congruence lattices of algebras. Together with the description of algebraic lattices as ideal lattices of join-semilattices with 00, it gives several equivalent pictures of the same class.

Reading path

To understand this page from the ground up, read these 5 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. Closure operator concept
  3. Compact element concept
  4. Complete lattice concept
  5. Birkhoff–Frink theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Compact_element
About this page
TagDZGNHKE3X1
URIm2://DZGNHKE3X1
Kindstatement, theorem
WritingW0 stub
MSC06B23, 08A30, 06A15
StatusThis copy of the site has no build data. Run m2 status DZGNHKE3X1.
AboutAlgebraic lattice
UsesComplete lattice, Compact element, Algebraic lattice, Closure operator
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.