A proof of Whitman’s representation theorem for finite lattices

S. K. Thomason · Proceedings of the American Mathematical Society · 1970

The theorem to be proved states that every finite lattice is isomorphic to a sublattice of the lattice $\mathcal {E}(S)$ of all equivalence relations on a countable set $S$. Our proof combines concreteness with freedom from long routine computations.

Read the paper · More papers on PaperTik