Lattices and Boolean Algebras
A lattice is an ordered set in which every pair of elements has a least upper bound and a greatest lower bound, and a Boolean algebra is a complemented distributive lattice modeling the algebra of logic and sets.
Definition
A lattice is a partially ordered set in which any two elements have a join and a meet; a Boolean algebra is a distributive lattice with least and greatest elements in which every element has a complement.
Scope
This topic treats lattices as dual order-theoretic and algebraic structures, the join and meet operations, distributive and modular lattices, complements, and Boolean algebras with their representation theory. It includes Birkhoff's representation of finite distributive lattices and Stone's representation of Boolean algebras, linking order, algebra, and topology.
Core questions
- When do suprema and infima of pairs exist, and what laws do they satisfy?
- Which lattices are distributive or modular, and how are they characterized?
- How are finite distributive lattices represented by sets of order ideals?
- How do Boolean algebras formalize the logic of propositions and the algebra of sets?
Key concepts
- Join and meet
- Bounded, complete, and complemented lattices
- Distributive and modular lattices
- Boolean algebra
- Birkhoff representation
- Stone representation
Key theories
- Birkhoff's representation theorem
- Every finite distributive lattice is isomorphic to the lattice of down-sets of its poset of join-irreducible elements, giving a complete and concrete description of finite distributive lattices.
- Stone's representation theorem
- Every Boolean algebra is isomorphic to a field of sets, and every finite Boolean algebra is isomorphic to the power set of a finite set, grounding the abstract algebra of logic in concrete set operations.
Clinical relevance
Boolean algebras model digital logic circuits, propositional logic, and set operations, while lattices structure type hierarchies, security levels in access control, and the closed sets of formal concept analysis.
History
Boole's 1854 algebra of logic, Birkhoff's 1930s lattice theory, and Stone's 1936 representation theorem together established the modern algebraic theory of order and logic.
Key figures
- George Boole
- Garrett Birkhoff
- Marshall Stone
Related topics
Seminal works
- davey2002
Frequently asked questions
- Is every lattice distributive?
- No; the smallest non-distributive lattices are the diamond and the pentagon, and a lattice is distributive exactly when it contains neither as a sublattice.
- How is a Boolean algebra related to set theory?
- The power set of any set, ordered by inclusion with union, intersection, and complement, is a Boolean algebra, and every finite Boolean algebra is of this form.