# Birkhoff's representation theorem

*This is about lattice theory. For other similarly named results, see Birkhoff's theorem (disambiguation).*

In mathematics, **Birkhoff's representation theorem** for distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations correspond to unions and intersections of sets. The theorem can be interpreted as providing a one-to-one correspondence between distributive lattices and partial orders, between quasi-ordinal knowledge spaces and preorders, or between finite topological spaces and preorders. It is named after Garrett Birkhoff, who published a proof of it in 1937.^{[1]}

The name “Birkhoff's representation theorem” has also been applied to two other results of Birkhoff, one from 1935 on the representation of Boolean algebras as families of sets closed under union, intersection, and complement (so-called *fields of sets*, closely related to the *rings of sets* used by Birkhoff to represent distributive lattices), and Birkhoff's HSP theorem representing algebras as products of irreducible algebras. Birkhoff's representation theorem has also been called the **fundamental theorem for finite distributive lattices**.^{[2]}

## Understanding the theorem

Many lattices can be defined in such a way that the elements of the lattice are represented by sets, the join operation of the lattice is represented by set union, and the meet operation of the lattice is represented by set intersection. For instance, the Boolean lattice defined from the family of all subsets of a finite set has this property. More generally any finite topological space has a lattice of sets as its family of open sets. Because set unions and intersections obey the distributive law, any lattice defined in this way is a distributive lattice. Birkhoff's theorem states that in fact *all* finite distributive lattices can be obtained this way, and later generalizations of Birkhoff's theorem state a similar thing for infinite distributive lattices.

## Examples

Consider the divisors of some composite number, such as (in the figure) 120, partially ordered by divisibility. Any two divisors of 120, such as 12 and 20, have a unique greatest common factor 12 ∧ 20 = 4, the largest number that divides both of them, and a unique least common multiple 12 ∨ 20 = 60; both of these numbers are also divisors of 120. These two operations ∨ and ∧ satisfy the distributive law, in either of two equivalent forms: (*x* ∧ *y*) ∨ *z* = (*x* ∨ *z*) ∧ (*y* ∨ *z*) and (*x* ∨ *y*) ∧ *z* = (*x* ∧ *z*) ∨ (*y* ∧ *z*), for all *x*, *y*, and *z*. Therefore, the divisors form a finite distributive lattice.

One may associate each divisor with the set of prime powers that divide it: thus, 12 is associated with the set {2,3,4}, while 20 is associated with the set {2,4,5}. Then 12 ∧ 20 = 4 is associated with the set {2,3,4} ∩ {2,4,5} = {2,4}, while 12 ∨ 20 = 60 is associated with the set {2,3,4} ∪ {2,4,5} = {2,3,4,5}, so the join and meet operations of the lattice correspond to union and intersection of sets.

The prime powers 2, 3, 4, 5, and 8 appearing as elements in these sets may themselves be partially ordered by divisibility; in this smaller partial order, 2 ≤ 4 ≤ 8 and there are no order relations between other pairs. The 16 sets that are associated with divisors of 120 are the lower sets of this smaller partial order, subsets of elements such that if *x* ≤ *y* and *y* belongs to the subset, then *x* must also belong to the subset. From any lower set *L*, one can recover the associated divisor by computing the least common multiple of the prime powers in *L*. Thus, the partial order on the five prime powers 2, 3, 4, 5, and 8 carries enough information to recover the entire original 16-element divisibility lattice.

Birkhoff's theorem states that this relation between the operations ∧ and ∨ of the lattice of divisors and the operations ∩ and ∪ of the associated sets of prime powers is not coincidental, and not dependent on the specific properties of prime numbers and divisibility: the elements of any finite distributive lattice may be associated with lower sets of a partial order in the same way.

As another example, the application of Birkhoff's theorem to the family of subsets of an *n*-element set, partially ordered by inclusion, produces the free distributive lattice with *n* generators. The number of elements in this lattice is given by the Dedekind numbers.

## The partial order of join-irreducibles

In a lattice, an element *x* is *join-irreducible* if *x* is not the join of a finite set of other elements. Equivalently, *x* is join-irreducible if it is neither the bottom element of the lattice (the join of zero elements) nor the join of any two smaller elements. For instance, in the lattice of divisors of 120, there is no pair of elements whose join is 4, so 4 is join-irreducible. An element *x* is *join-prime* if, whenever *x* ≤ *y* ∨ *z*, either *x* ≤ *y* or *x* ≤ *z*. In the same lattice, 4 is join-prime: whenever lcm(*y*,*z*) is divisible by 4, at least one of *y* and *z* must itself be divisible by 4.

In any lattice, a join-prime element must be join-irreducible. Equivalently, an element that is not join-irreducible is not join-prime. For, if an element *x* is not join-irreducible, there exist smaller *y* and *z* such that *x* = *y* ∨ *z*. But then *x* ≤ *y* ∨ *z*, and *x* is not less than or equal to either *y* or *z*, showing that it is not join-prime.

There exist lattices in which the join-prime elements form a proper subset of the join-irreducible elements, but in a distributive lattice the two types of elements coincide. For, suppose that *x* is join-irreducible, and that *x* ≤ *y* ∨ *z*. This inequality is equivalent to the statement that *x* = *x* ∧ (*y* ∨ *z*), and by the distributive law *x* = (*x* ∧ *y*) ∨ (*x* ∧ *z*). But since *x* is join-irreducible, at least one of the two terms in this join must be *x* itself, showing that either *x* = *x* ∧ *y* (equivalently *x* ≤ *y*) or *x* = *x* ∧ *z* (equivalently *x* ≤ *z*).

The lattice ordering on the subset of join-irreducible elements forms a partial order; Birkhoff's theorem states that the lattice itself can be recovered from the lower sets of this partial order.

## Birkhoff's theorem

In any partial order, the lower sets form a lattice in which the lattice's partial ordering is given by set inclusion, the join operation corresponds to set union, and the meet operation corresponds to set intersection, because unions and intersections preserve the property of being a lower set. Because set unions and intersections obey the distributive law, this is a distributive lattice. Birkhoff's theorem states that any finite distributive lattice can be constructed in this way.

**Theorem**. Any finite distributive lattice*L*is isomorphic to the lattice of lower sets of the partial order of the join-irreducible elements of*L*.

That is, there is a one-to-one order-preserving correspondence between elements of *L* and lower sets of the partial order. The lower set corresponding to an element *x* of *L* is simply the set of join-irreducible elements of *L* that are less than or equal to *x*, and the element of *L* corresponding to a lower set *S* of join-irreducible elements is the join of *S*.

If one starts with a lower set *S* of join-irreducible elements, lets *x* be the join of *S*, and constructs lower set *T* of the join-irreducible elements less than or equal to *x*, then *S* = *T*. For, every element of *S* clearly belongs to *T*, and any join-irreducible element less than or equal to *x* must (by join-primality) be less than or equal to one of the members of *S*, and therefore must (by the assumption that *S* is a lower set) belong to *S* itself. Conversely, if one starts with an element *x* of *L*, lets *S* be the join-irreducible elements less than or equal to *x*, and constructs *y* as the join of *S*, then *x* = *y*. For, as a join of elements less than or equal to *x*, *y* can be no greater than *x* itself, but if *x* is join-irreducible then *x* belongs to *S* while if *x* is the join of two or more join-irreducible items then they must again belong to *S*, so *y* ≥ *x*. Therefore, the correspondence is one-to-one and the theorem is proved.

## Rings of sets and preorders

Template:Harvtxt defined a *ring of sets* to be a family of sets that is closed under the operations of set unions and set intersections; later, motivated by applications in mathematical psychology, Template:Harvtxt called the same structure a *quasi-ordinal knowledge space*. If the sets in a ring of sets are ordered by inclusion, they form a distributive lattice. The elements of the sets may be given a preorder in which *x* ≤ *y* whenever some set in the ring contains *x* but not *y*. The ring of sets itself is then the family of lower sets of this preorder, and any preorder gives rise to a ring of sets in this way.

## Functoriality

Birkhoff's theorem, as stated above, is a correspondence between individual partial orders and distributive lattices. However, it can also be extended to a correspondence between order-preserving functions of partial orders and bounded homomorphisms of the corresponding distributive lattices. The direction of these maps is reversed in this correspondence.

Let **2** denote the partial order on the two-element set {0, 1}, with the order relation 0 < 1, and (following Stanley) let *J(P)* denote the distributive lattice of lower sets of a finite partial order *P*. Then the elements of *J(P)* correspond one-for-one to the order-preserving functions from *P* to **2**.^{[2]} For, if ƒ is such a function, ƒ^{−1}(0) forms a lower set, and conversely if *L* is a lower set one may define an order-preserving function ƒ_{L} that maps *L* to 0 and that maps the remaining elements of *P* to 1. If *g* is any order-preserving function from *Q* to *P*, one may define a function *g** from *J(P)* to *J(Q)* that uses the composition of functions to map any element *L* of *J(P)* to ƒ_{L} ∘ *g*. This composite function maps *Q* to **2** and therefore corresponds to an element *g**(*L*) = (ƒ_{L} ∘ *g*)^{−1}(0) of *J(Q)*. Further, for any *x* and *y* in *J(P)*, *g**(*x* ∧ *y*) = *g**(*x*) ∧ *g**(*y*) (an element of *Q* is mapped by *g* to the lower set *x* ∩ *y* if and only if belongs both to the set of elements mapped to *x* and the set of elements mapped to *y*) and symmetrically *g**(*x* ∨ *y*) = *g**(*x*) ∨ *g**(*y*). Additionally, the bottom element of *J(P)* (the function that maps all elements of *P* to 0) is mapped by *g** to the bottom element of *J(Q)*, and the top element of *J(P)* is mapped by *g** to the top element of *J(Q)*. That is, *g** is a homomorphism of bounded lattices.

However, the elements of *P* themselves correspond one-for-one with bounded lattice homomorphisms from *J(P)* to **2**. For, if *x* is any element of *P*, one may define a bounded lattice homomorphism *j _{x}* that maps all lower sets containing

*x*to 1 and all other lower sets to 0. And, for any lattice homomorphism from

*J(P)*to

**2**, the elements of

*J(P)*that are mapped to 1 must have a unique minimal element

*x*(the meet of all elements mapped to 1), which must be join-irreducible (it cannot be the join of any set of elements mapped to 0), so every lattice homomorphism has the form

*j*for some

_{x}*x*. Again, from any bounded lattice homomorphism

*h*from

*J(P)*to

*J(Q)*one may use composition of functions to define an order-preserving map

*h** from

*Q*to

*P*. It may be verified that

*g*** =

*g*for any order-preserving map

*g*from

*Q*to

*P*and that and

*h*** =

*h*for any bounded lattice homomorphism

*h*from

*J(P)*to

*J(Q)*.

In category theoretic terminology, *J* is a contravariant hom-functor *J* = Hom(—,**2**) that defines a duality of categories between, on the one hand, the category of finite partial orders and order-preserving maps, and on the other hand the category of finite distributive lattices and bounded lattice homomorphisms.

## Generalizations

In an infinite distributive lattice, it may not be the case that the lower sets of the join-irreducible elements are in one-to-one correspondence with lattice elements. Indeed, there may be no join-irreducibles at all. This happens, for instance, in the lattice of all natural numbers, ordered with the reverse of the usual divisibility ordering (so *x* ≤ *y* when *y* divides *x*): any number *x* can be expressed as the join of numbers *xp* and *xq* where *p* and *q* are distinct prime numbers. However, elements in infinite distributive lattices may still be represented as sets via Stone's representation theorem for distributive lattices, a form of Stone duality in which each lattice element corresponds to a compact open set in a certain topological space. This generalized representation theorem can be expressed as a category-theoretic duality between distributive lattices and coherent spaces (sometimes called spectral spaces), topological spaces in which the compact open sets are closed under intersection and form a base for the topology.^{[3]} Hilary Priestley showed that Stone's representation theorem could be interpreted as an extension of the idea of representing lattice elements by lower sets of a partial order, using Nachbin's idea of ordered topological spaces. Stone spaces with an additional partial order linked with the topology via Priestley separation axiom can also be used to represent bounded distributive lattices. Such spaces are known as Priestley spaces. Further, certain bitopological spaces, namely pairwise Stone spaces, generalize Stone's original approach by utilizing *two* topologies on a set to represent an abstract distributve lattice. Thus, Birkhoff's representation theorem extends to the case of infinite (bounded) distributive lattices in at least three different ways, summed up in duality theory for distributive lattices.

Birkhoff's representation theorem may also be generalized to finite structures other than distributive lattices. In a distributive lattice, the self-dual median operation^{[4]}

gives rise to a median algebra, and the covering relation of the lattice forms a median graph. Finite median algebras and median graphs have a dual structure
as the set of solutions of a 2-satisfiability instance; Template:Harvtxt formulate this structure equivalently as the family of initial stable sets in a mixed graph.^{[5]} For a distributive lattice, the corresponding mixed graph has no undirected edges, and the initial stable sets are just the lower sets of the transitive closure of the graph. Equivalently, for a distributive lattice, the implication graph of the 2-satisfiability instance can be partitioned into two connected components, one on the positive variables of the instance and the other on the negative variables; the transitive closure of the positive component is the underlying partial order of the distributive lattice.

Another result analogous to Birkhoff's representation theorem, but applying to a broader class of lattices, is the theorem of Template:Harvtxt that any finite join-distributive lattice may be represented as an antimatroid, a family of sets closed under unions but in which closure under intersections has been replaced by the property that each nonempty set has a removable element.

## Notes

- ↑ Template:Harvtxt.
- ↑
^{2.0}^{2.1}Template:Harv. - ↑ Template:Harvtxt.
- ↑ Template:Harvtxt.
- ↑ A minor difference between the 2-SAT and initial stable set formulations is that the latter presupposes the choice of a fixed base point from the median graph that corresponds to the empty initial stable set.

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}.