A proof of Whitman's representation theorem for finite lattices
Abstract: The theorem to be proved states that every finite lattice is isomorphic to a sublattice of the lattice of all equivalence relations on a countable set . Our proof combines concreteness with freedom from long routine computations.
-  Bjarni Jónsson, On the representation of lattices, Math. Scand 1 (1953), 193–206. MR 0058567, https://doi.org/10.7146/math.scand.a-10377
-  Philip M. Whitman, Lattices, equivalence relations, and subgroups, Bull. Amer. Math. Soc. 52 (1946), 507–522. MR 0016750, https://doi.org/10.1090/S0002-9904-1946-08602-4
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 06.30
Retrieve articles in all journals with MSC: 06.30
Keywords: Representations of lattices, lattices of equivalence relations
Article copyright: © Copyright 1970 American Mathematical Society