Math 2.0

General algebraic systems Definition

Absorbing element

Builds on Binary operation

Definition

Let ∗\ast be a binary operation on a set SS and let z∈Sz \in S.

  1. The element zz is left absorbing if z∗a=zz \ast a = z for all a∈Sa \in S.
  2. The element zz is right absorbing if a∗z=za \ast z = z for all a∈Sa \in S.
  3. The element zz is absorbing, or a zero element, if it is both left and right absorbing.

Remarks

Example: in (ℤ,⋅)(\Z, \cdot) the integer 00 is absorbing, because 0⋅a=a⋅0=00 \cdot a = a \cdot 0 = 0 for all a∈ℤa \in \Z.

Non-example: in (ℤ,+)(\Z, +) the integer 00 is not absorbing, because 0+1=1≠00 + 1 = 1 \ne 0; it is an identity element instead.

If zz is left absorbing and z′z' is right absorbing, then z=z∗z′=z′z = z \ast z' = z'. So an operation has at most one absorbing element. On a set with at least two elements, the operation a∗b=aa \ast b = a makes every element left absorbing and no element right absorbing.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary operation concept
  2. Absorbing element definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Absorbing_element
About this page
Tag6068BQ4XZF
URIm2://6068BQ4XZF
Kinddefinition
WritingW0 stub
MSC08A02, 20M99
DefinesAbsorbing element
UsesBinary operation
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.