Absorption (mathematics): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (new entry, just a stub) |
Pat Palmer (talk | contribs) (correction link to conjunction) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | |||
In [[algebra]], '''absorption''' is a property of [[binary operation]]s which reflects an underlying [[order (relation)|order relation]]. | In [[algebra]], '''absorption''' is a property of [[binary operation]]s which reflects an underlying [[order (relation)|order relation]]. | ||
| Line 7: | Line 9: | ||
Examples include | Examples include | ||
* In [[set theory]], [[intersection]] and [[union]]; | * In [[set theory]], [[intersection]] and [[union]]; | ||
* In [[propositional logic]], [[conjunction | * In [[propositional logic]], [[Conjunction (logical and)|conjunction (logical and)]] and [[disjunction]] (logical or); | ||
* In a [[distributive lattice]], [[join]] and [[meet]]; | * In a [[distributive lattice]], [[join]] and [[meet]]; | ||
* In a [[linear order|linearly ordered]] set, [[minimum]] and [[maximum]]; | * In a [[linear order|linearly ordered]] set, [[minimum]] and [[maximum]]; | ||
Latest revision as of 13:24, 18 November 2022
In algebra, absorption is a property of binary operations which reflects an underlying order relation.
Sometimes called the "absorption law", it is one of the defining properties of a lattice:
Examples include
- In set theory, intersection and union;
- In propositional logic, conjunction (logical and) and disjunction (logical or);
- In a distributive lattice, join and meet;
- In a linearly ordered set, minimum and maximum;
- In the integers, highest common factor and least common multiple;
References
- A.G. Howson (1972). A handbook of terms used in algebra and analysis. Cambridge University Press, 76. ISBN 0-521-09695-2.