General algebraic systems Definition
Absorbing element
Builds on Binary operation
Definition
Let be a binary operation on a set and let .
- The element is left absorbing if for all .
- The element is right absorbing if for all .
- The element is absorbing, or a zero element, if it is both left and right absorbing.
Remarks
Example: in the integer is absorbing, because for all .
Non-example: in the integer is not absorbing, because ; it is an identity element instead.
If is left absorbing and is right absorbing, then . So an operation has at most one absorbing element. On a set with at least two elements, the operation 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
- no evidence level
- Binary operation concept
- Absorbing element definition
Further reading
About this page
| Tag | 6068BQ4XZF |
|---|---|
| URI | m2://6068BQ4XZF |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A02, 20M99 |
| Defines | Absorbing element |
| Uses | Binary operation |
| Changed | 2 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.