A distributive lattice is a lattice in which meet and join distribute over each other: for all x, y, z, x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z) (equivalently dual law with ∨ distributing over ∧). Both forms are equivalent in the presence of lattice axioms.

Principle

Enforce compatibility of meet and join so that combining and intersecting subsets (or analogous operations) commute in a distributive fashion, permitting algebraic manipulations akin to distributivity in rings or Boolean algebra.

Demonstration

The power set lattice P(S) is distributive because intersection distributes over union and vice versa: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C). Boolean algebras are distributive lattices with complementation.

Misapplication

Assuming distributivity when working in non-distributive lattices (e.g., lattices of subspaces of a vector space larger than dimension 1) leads to incorrect simplifications; using distributive identities on modular but nondistributive lattices yields false equalities.

Consequence

Distributivity enables canonical representations (e.g., via prime elements or join/meet irreducibles), simpler duality theorems, and the use of algebraic techniques analogous to factorization; it underlies Boolean logic and many combinatorial simplifications.

Reversal

Dropping distributivity yields broader lattice classes such as modular or general lattices; at the other extreme, adding complements and distributivity yields Boolean algebras, a highly structured subclass.

Boundary

Distributive lattices require the distributive laws for all triples of elements; finite distributive lattices are isomorphic to lattices of down-sets of posets (Birkhoff representation), but infinite cases require care and additional completeness conditions for similar representations.

Semantic Tension

Distributivity competes with modularity: modular lattices impose a weaker identity that holds in many algebraic lattices (e.g., subspaces) where full distributivity fails; distinctions matter when applying decomposition theorems or duality results.

Synthesis

A distributive lattice is a lattice where meet and join interoperate by distributive laws, giving a predictable algebraic environment similar to set operations and forming the structural backbone of Boolean logic and many combinatorial representations.