Absorption law

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations. Two binary operations, ¤ and ⁂, are said to be connected by the absorption law if: :a ¤ (a ⁂ b) = a ⁂ (a ¤ b) = a.

In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations. Two binary operations, ¤ and ⁂, are said to be connected by the absorption law if: a ¤ (a ⁂ b) = a ⁂ (a ¤ b) = a. A set equipped with two commutative and associative binary operations \scriptstyle \lor ("join") and \scriptstyle \land ("meet") that are connected by the absorption law is called a lattice; in this case, both operations are necessarily idempotent (i.e. a \scriptstyle \lor a = a and a \scriptstyle \land a = a). Examples of lattices include Heyting algebras and Boolean algebras, in particular sets of sets with union (∪) and intersection (∩) operators, ordered sets with min and max operations and integers with least common multiple and greatest common divisor.

See also

Absorption (logic) Lattice (order)

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1373730955 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.