Absorbing element

In mathematics, an absorbing element (or annihilating element) is a special type of element of a set with respect to a binary operation on that set. The result of combining an absorbing element with any element of the set is the absorbing element itself. In semigroup theory, the absorbing element is called a zero element[1][2] because there is no risk of confusion with other notions of zero, with the notable exception: under additive notation zero may, quite naturally, denote the neutral element of a monoid. In this article "zero element" and "absorbing element" are synonymous.

Definition

Formally, let (S, •) be a set S with a closed binary operation • on it (known as a magma). A zero element is an element z such that for all s in S, z • s = s • z = z. A refinement[2] are the notions of left zero, where one requires only that z • s = z, and right zero, where s • z = z.

Absorbing elements are particularly interesting for semigroups, especially the multiplicative semigroup of a semiring. In the case of a semiring with 0, the definition of an absorbing element is sometimes relaxed so that it is not required to absorb 0; otherwise, 0 would be the only absorbing element.[3]

Properties
  • If a magma has both a left zero z and a right zero z′, then it has a zero, since z = z • z′ = z′.
  • A magma can have at most one zero element.

Examples
  • The most well known example of an absorbing element comes from elementary algebra, where any number multiplied by zero equals zero. Zero is thus an absorbing element.
  • The zero of any ring is also an absorbing element. For an element r of a ring R, r=r(1+0)=r+r0, so r0=0, as zero is the unique element a for which r+a=r for any r in the ring R.
  • Floating point arithmetics as defined in IEEE-754 standard contains a special value called Not-a-Number ("NaN"). It is an absorbing element for every operation; i.e., x + NaN = NaN + x = NaN, x − NaN = NaN − x = NaN, etc.
  • The set of binary relations over a set X, together with the composition of relations forms a monoid with zero, where the zero element is the empty relation (empty set).
  • The closed interval H = [0, 1] with x • y = min(x, y) is also a monoid with zero, and the zero element is 0.
  • More examples:
Domain Operation Absorber
Real numbers ⋅Multiplication 0
Integers Greatest common divisor 1
n-by-n square matrices Matrix multiplication Matrix of all zeroes
Extended real numbers Minimum/infimum −∞
Maximum/supremum +∞
Sets ∩Intersection ∅Empty set
Subsets of a set M ∪Union M
Boolean logic ∧Logical and ⊥Falsity
∨Logical or ⊤Truth

See also

Notes
  1. J.M. Howie, pp. 2–3
  2. M. Kilp, U. Knauer, A.V. Mikhalev pp. 14–15
  3. J.S. Golan p. 67

References
  • Howie, John M. (1995). Fundamentals of Semigroup Theory. Clarendon Press. ISBN 0-19-851194-9.
  • M. Kilp, U. Knauer, A.V. Mikhalev, Monoids, Acts and Categories with Applications to Wreath Products and Graphs, De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter, 2000, ISBN 3-11-015248-7.
  • Golan, Jonathan S. (1999). Semirings and Their Applications. Springer. ISBN 0-7923-5786-8.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.