Birkhoff's Representation Theorem For Finite Distributive Lattices (Q7361645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Birkhoff_Finite_Distributive_Lattices
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Birkhoff's Representation Theorem For Finite Distributive Lattices |
AFP entry Birkhoff_Finite_Distributive_Lattices |
Statements
6 December 2022
0 references
Matthew Doty
0 references
Birkhoff's Representation Theorem For Finite Distributive Lattices (English)
0 references
This theory proves a theorem of Birkhoff that asserts that any finite distributive lattice is isomorphic to the set of down-sets of that lattice's join-irreducible elements. The isomorphism preserves order, meets and joins as well as complementation in the case the lattice is a Boolean algebra. A consequence of this representation theorem is that every finite Boolean algebra is isomorphic to a powerset algebra.
0 references
