##  [Absorption Law](/absorption-law-0) 

 Definition

A pair of Boolean identities that simplify nested conjunctions and disjunctions by 'absorbing' one operand into a larger expression: A ∨ (A ∧ B) = A and A ∧ (A ∨ B) = A.

 

 

 

 

 

 





## Principle

Principle

When one operand already guarantees the truth (or falsity) of a compound expression, combining it with the compound via the appropriate connective returns the guaranteeing operand, allowing collapse of redundancy.

 

 

 

 

 





## Demonstration

Demonstration

If A is true, then A ∨ (A ∧ B) is true regardless of B, and if A is false, A ∧ (A ∨ B) is false regardless of B; in both cases the nested expression yields the simple A as the equivalent.

 

 

 

 

## Misapplication

Misapplication

Applying absorption where the repeated subexpression is not syntactically or semantically identical (e.g., A ∨ (C ∧ B) where C ≠ A) or in algebras where absorption does not hold will produce incorrect simplifications.

 

 

 

 

 





## Consequence

Consequence

Enables immediate removal of redundant terms, reduces formula size, simplifies logical proofs and circuit implementations by collapsing unnecessary structure.

 

 

 

 

## Reversal

Reversal

Non-absorptive contexts: algebraic systems without those identities or situations where absorption would remove essential multiplicity or contextual distinctions (for instance in probabilistic or multi-valued logics where A ∨ (A ∧ B) may not reduce to A).

 

 

 

 

 





## Boundary

Boundary

Holds in classical Boolean algebra and distributive idempotent lattices; does not apply to general operators, to expressions where the absorbing literal differs, or to contexts that track multiplicity, probability, or side effects.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension with distributivity and expansion: absorption contracts structure by removing redundancy, whereas distribution expands it; choosing which law to use affects complexity and normal form trade-offs.

 

 

 

 

 





## Synthesis

Synthesis

Absorption law captures a local simplification pattern: when a literal subsumes a compound in a particular way, the compound collapses to the literal, yielding compact, redundancy-free representations in Boolean and related lattices.