A pair of identities in lattice-like structures expressing that one operation 'absorbs' the effect of the other. Standard forms in a lattice are a ∨ (a ∧ b) = a and a ∧ (a ∨ b) = a.

Principle

Absorption captures the idea that combining an element with a combination that already contains it yields the element itself; it enforces a compatibility between the two dual operations (join and meet).

Demonstration

In set theory with union ∪ and intersection ∩: A ∪ (A ∩ B) = A and A ∩ (A ∪ B) = A. In Boolean algebra the same identities hold, simplifying logical formulas: p ∨ (p ∧ q) ≡ p.

Misapplication

Applying absorption in contexts without a lattice structure (for instance arbitrary group operations or non-idempotent operations) is invalid; treating absorption as a general consequence of distributivity or idempotence leads to mistakes.

Consequence

Absorption yields strong simplification rules for expressions in lattices and Boolean algebras, supports uniqueness of normal forms, and underlies the duality between join and meet operations in ordered structures.

Reversal

In nonlattice or more general algebras the absorption identities can fail, producing richer interaction patterns between operations that prevent the collapse of combined expressions to a single operand.

Boundary

Absorption is a property of ordered, idempotent, associative, commutative binary operations forming a lattice or semilattice; it is not meaningful for arbitrary pairs of operations lacking these structural features.

Semantic Tension

Absorption can be mistaken for distributivity (both relate two operations) but absorption is a collapse identity tying a join and meet to one operand, whereas distributivity prescribes expansion across combinations.

Synthesis

Absorption Law states that in lattice-like structures one of the dual operations neutralizes the combination with the other when one operand already appears, yielding concise simplification identities that reflect join/meet compatibility and order-theoretic structure.