Associative rings and algebras Definition
Semiring
Builds on Monoid
Definition
Let be a set with two binary operations and , and two elements and of . The tuple is a semiring if the following hold.
- is a commutative monoid.
- is a monoid.
- Multiplication distributes over addition on both sides: and for all .
- Zero is absorbing: for all .
The semiring is commutative if its multiplication is commutative.
Remarks
The natural numbers with the usual addition and multiplication form a commutative semiring. The four clauses are the familiar rules of arithmetic on . The tropical semiring is with as addition, ordinary as multiplication, as zero and as one. For instance, gives distributivity, and gives the absorbing clause. The positive integers with the usual operations are not a semiring: there is no additive identity, so clause 1 fails. A ring is exactly a semiring in which is a group; clause 4 then follows from the others. Some authors omit or from the definition, and some do not require clause 4.
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
Further reading
About this page
| Tag | Q07RA7AMDE |
|---|---|
| URI | m2://Q07RA7AMDE |
| Kind | definition |
| Writing | W0 stub |
| MSC | 16Y60 |
| Defines | Semiring |
| Uses | Monoid |
| 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.