A partially ordered set in which every pair of elements has a least upper bound (join) and a greatest lower bound (meet).

Principle

Binary closure under join and meet equips a poset with two algebraic operations that capture suprema and infima for pairs, enabling algebraic manipulation of order-theoretic relations.

Demonstration

The power set of a set ordered by inclusion is a lattice where join is union and meet is intersection; the set of subspaces of a vector space ordered by inclusion forms a lattice with sum and intersection as join and meet in many contexts.

Misapplication

Assuming that every partially ordered set is a lattice or that distributivity holds universally; many posets lack pairwise joins/meets and many lattices are not distributive.

Consequence

Lattice structure permits algebraic calculus of order (identities, homomorphisms, congruences) and supports further specializations (distributive lattices, modular lattices, Boolean lattices) with stronger properties.

Reversal

A semilattice has only one of the two binary operations (only meet or only join); dropping one operation weakens the structure and available identities.

Boundary

Definition requires existence of join and meet for every pair; complete lattices require arbitrary joins/meets and are a strictly stronger notion; order-theoretic concepts without pairwise extrema lie outside the lattice scope.

Semantic Tension

Tension exists between lattice as an order-theoretic object and lattice viewed algebraically via binary operations: some results favor the poset viewpoint, others the equational algebra viewpoint; distributivity creates another competing refinement.

Synthesis

A lattice coheres order and algebra: for any two elements the supremum and infimum exist, providing binary join and meet operations that let one reason algebraically about ordering and develop richer subclasses by adding identities like distributivity or complementation.