Semiring

Algebraic structure → Ring theory Ring theory
show Basic concepts Rings • Subrings • Ideal • Quotient ring • Fractional ideal • Total quotient ring • Product ring • Free product of associative algebras • Tensor product of rings Ring homomorphisms • Kernel • Inner automorphism • Frobenius endomorphism Algebraic structures • Module • Associative algebra • Graded ring • Involutive ring • Category of rings • Initial ring ${\displaystyle \mathbb {Z} }$ • Terminal ring ${\displaystyle 0=\mathbb {Z} _{1}}$ Related structures • Field • Finite field • Non-associative ring • Lie ring • Jordan ring • Semiring • Semifield
show Commutative algebra Commutative rings • Integral domain • Integrally closed domain • GCD domain • Unique factorization domain • Principal ideal domain • Euclidean domain • Field • Finite field • Composition ring • Polynomial ring • Formal power series ring Algebraic number theory • Algebraic number field • Ring of integers • Algebraic independence • Transcendental number theory • Transcendence degree p-adic number theory and decimals • Direct limit/Inverse limit • Zero ring ${\displaystyle \mathbb {Z} _{1}}$ • Integers modulo pn ${\displaystyle \mathbb {Z} /p^{n}\mathbb {Z} }$ • Prüfer p-ring ${\displaystyle \mathbb {Z} (p^{\infty })}$ • Base-p circle ring ${\displaystyle \mathbb {T} }$ • Base-p integers ${\displaystyle \mathbb {Z} }$ • p-adic rationals ${\displaystyle \mathbb {Z} [1/p]}$ • Base-p real numbers ${\displaystyle \mathbb {R} }$ • p-adic integers ${\displaystyle \mathbb {Z} _{p}}$ • p-adic numbers ${\displaystyle \mathbb {Q} _{p}}$ • p-adic solenoid ${\displaystyle \mathbb {T} _{p}}$ Algebraic geometry • Affine variety
show Noncommutative algebra Noncommutative rings • Division ring • Semiprimitive ring • Simple ring • Commutator Noncommutative algebraic geometry Free algebra Clifford algebra • Geometric algebra Operator algebra
v t

In abstract algebra, a semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse.

The term rig is also used occasionally^[1]—this originated as a joke, suggesting that rigs are rings without negative elements, similar to using rng to mean a ring without a multiplicative identity.

Tropical semirings are an active area of research, linking algebraic varieties with piecewise linear structures.^[2]

Algebraic structures
show Group-like Group Semigroup / Monoid Rack and quandle Quasigroup and loop Abelian group Magma Lie group Group theory
show Ring-like Ring Rng Semiring Near-ring Commutative ring Integral domain Field Division ring Ring theory
show Lattice-like Lattice Semilattice Complemented lattice Total order Heyting algebra Boolean algebra Map of lattices Lattice theory
show Module-like Module Group with operators Vector space Linear algebra
show Algebra-like Algebra Associative Non-associative Composition algebra Lie algebra Graded Bialgebra
v t

Definition[]

A semiring is a set ${\displaystyle R}$ equipped with two binary operations ${\displaystyle \,+\,}$ and ${\displaystyle \,\cdot ,\,}$ called addition and multiplication, such that:^[3][4][5]

• ${\displaystyle (R,+)}$ is a commutative monoid with identity element ${\displaystyle 0}$:
  • ${\displaystyle (a+b)+c=a+(b+c)}$
  • ${\displaystyle 0+a=a=a+0}$
  • ${\displaystyle a+b=b+a}$
• ${\displaystyle (R,\,\cdot \,)}$ is a monoid with identity element ${\displaystyle 1}$:
  • ${\displaystyle (a\cdot b)\cdot c=a\cdot (b\cdot c)}$
  • ${\displaystyle 1\cdot a=a=a\cdot 1}$
• Multiplication left and right distributes over addition:
  • ${\displaystyle a\cdot (b+c)=(a\cdot b)+(a\cdot c)}$
  • ${\displaystyle (a+b)\cdot c=(a\cdot c)+(b\cdot c)}$
• Multiplication by ${\displaystyle 0}$ annihilates ${\displaystyle R}$:
  • ${\displaystyle 0\cdot a=0=a\cdot 0}$

The symbol ${\displaystyle \,\cdot \,}$ is usually omitted from the notation; that is, ${\displaystyle a\cdot b}$ is just written ${\displaystyle ab.}$ Similarly, an Order of operations is accepted, according to which ${\displaystyle \,\cdot \,}$ is applied before ${\displaystyle \,+\,}$; that is, ${\displaystyle a+bc}$ is ${\displaystyle a+(bc).}$

Compared to a ring, a semiring omits the requirement for inverses under addition; that is, it requires only a commutative monoid, not a commutative group. In a ring, the additive inverse requirement implies the existence of a multiplicative zero, so here it must be specified explicitly. If a semiring's multiplication is commutative, then it is called a commutative semiring.^[6]

There are some authors who prefer to leave out the requirement that a semiring have a 0 or 1. This makes the analogy between ring and semiring on the one hand and group and semigroup on the other hand work more smoothly. These authors often use rig for the concept defined here.^{[note 1]}

Theory[]

One can generalize the theory of (associative) algebras over commutative rings directly to a theory of algebras over commutative semirings.^{[citation needed]}

A semiring in which every element is an additive idempotent (that is, ${\displaystyle a+a=a}$ for all elements ${\displaystyle a}$) is called an idempotent semiring.^[7] Idempotent semirings are special to semiring theory as any ring which is idempotent under addition is trivial.^{[note 2]} One can define a partial order ${\displaystyle \,\leq \,}$ on an idempotent semiring by setting ${\displaystyle a\leq b}$ whenever ${\displaystyle a+b=b}$ (or, equivalently, if there exists an ${\displaystyle x}$ such that ${\displaystyle a+x=b}$). The least element with respect to this order is ${\displaystyle 0,}$ meaning that ${\displaystyle 0\leq a}$ for all ${\displaystyle a.}$ Addition and multiplication respect the ordering in the sense that ${\displaystyle a\leq b}$ implies ${\displaystyle ac\leq bc}$ and ${\displaystyle ca\leq cb}$ and ${\displaystyle (a+c)\leq (b+c).}$

Applications[]

The ${\displaystyle (\max ,+)}$ and ${\displaystyle (\min ,+)}$ tropical semirings on the reals, are often used in performance evaluation on discrete event systems. The real numbers then are the "costs" or "arrival time"; the "max" operation corresponds to having to wait for all prerequisites of an events (thus taking the maximal time) while the "min" operation corresponds to being able to choose the best, less costly choice; and + corresponds to accumulation along the same path.

The Floyd–Warshall algorithm for shortest paths can thus be reformulated as a computation over a ${\displaystyle (\min ,+)}$ algebra. Similarly, the Viterbi algorithm for finding the most probable state sequence corresponding to an observation sequence in a Hidden Markov model can also be formulated as a computation over a ${\displaystyle (\max ,\times )}$ algebra on probabilities. These dynamic programming algorithms rely on the distributive property of their associated semirings to compute quantities over a large (possibly exponential) number of terms more efficiently than enumerating each of them.^[8][9]

Examples[]

By definition, any ring is also a semiring. A motivating example of a semiring is the set of natural numbers ${\displaystyle \mathbb {N} }$ (including the number zero) under ordinary addition and multiplication. Likewise, the non-negative rational numbers and the non-negative real numbers form semirings. All these semirings are commutative.^[10][11][12]

In general[]

• The set of all ideals of a given ring form an idempotent semiring under addition and multiplication of ideals.
• Any unital quantale is an idempotent semiring under join and multiplication.
• Any bounded, distributive lattice is a commutative, idempotent semiring under join and meet.
• In particular, a Boolean algebra is such a semiring. A Boolean ring is also a semiring (indeed, a ring) but it is not idempotent under addition. A Boolean semiring is a semiring isomorphic to a subsemiring of a Boolean algebra.^[10]
• A normal skew lattice in a ring ${\displaystyle R}$ is an idempotent semiring for the operations multiplication and nabla, where the latter operation is defined by ${\displaystyle a\nabla b=a+b+ba-aba-bab.}$
• Any c-semiring is also a semiring, where addition is idempotent and defined over arbitrary sets.
• Isomorphism classes of objects in any distributive category, under coproduct and product operations, form a semiring known as a Burnside rig.^[13] A Burnside rig is a ring if and only if the category is trivial.

Semiring of sets[]

A semiring (of sets)^[14] is a non-empty collection ${\displaystyle S}$ of sets such that

1. ${\displaystyle \varnothing \in S.}$
2. If ${\displaystyle E\in S}$ and ${\displaystyle F\in S}$ then ${\displaystyle E\cap F\in S.}$
3. If ${\displaystyle E\in S}$ and ${\displaystyle F\in S}$ then there exists a finite number of mutually disjoint sets ${\displaystyle C_{i}\in S}$ for ${\displaystyle i=1,\ldots ,n}$ such that ${\displaystyle E\setminus F=\bigcup _{i=1}^{n}C_{i}.}$

Such semirings are used in measure theory. An example of a semiring of sets is the collection of half-open, half-closed real intervals ${\displaystyle [a,b)\subset \mathbb {R} .}$

Specific examples[]

Variations[]

Complete and continuous semirings[]

A complete semiring is a semiring for which the additive monoid is a complete monoid, meaning that it has an infinitary sum operation ${\displaystyle \Sigma _{I}}$ for any index set ${\displaystyle I}$ and that the following (infinitary) distributive laws must hold:^[18][16][20]

Examples of a complete semiring are the power set of a monoid under union and the matrix semiring over a complete semiring.^[21]

A continuous semiring is similarly defined as one for which the addition monoid is a continuous monoid. That is, partially ordered with the least upper bound property, and for which addition and multiplication respect order and suprema. The semiring ${\displaystyle \mathbb {N} \cup \{\infty \}}$ with usual addition, multiplication and order extended is a continuous semiring.^[22]

Any continuous semiring is complete:^[18] this may be taken as part of the definition.^[21]

Star semirings[]

A star semiring (sometimes spelled starsemiring) is a semiring with an additional unary operator ^∗,^{[7][16][23][24]} satisfying

A Kleene algebra is a star semiring with idempotent addition. They are important in the theory of formal languages and regular expressions.^[16]

Complete star semirings[]

In a complete star semiring, the star operator behaves more like the usual Kleene star: for a complete semiring we use the infinitary sum operator to give the usual definition of the Kleene star:^[16]

where ${\displaystyle a^{j}={\begin{cases}1,&j=0,\\a\cdot a^{j-1}=a^{j-1}\cdot a,&j>0.\end{cases}}}$

Conway semiring[]

A Conway semiring is a star semiring satisfying the sum-star and product-star equations:^[7][25]

Every complete star semiring is also a Conway semiring,^[26] but the converse does not hold. An example of Conway semiring that is not complete is the set of extended non-negative rational numbers ${\displaystyle \mathbb {Q} _{\geq 0}\cup \{\infty \}}$ with the usual addition and multiplication (this is a modification of the example with extended non-negative reals given in this section by eliminating irrational numbers).^[16]

An iteration semiring is a Conway semiring satisfying the Conway group axioms,^[7] associated by John Conway to groups in star-semirings.^[27]

Examples[]

Examples of star semirings include:

• the (aforementioned) semiring of binary relations over some base set ${\displaystyle U}$ in which ${\displaystyle R^{*}=\bigcup _{n\geq 0}R^{n}}$ for all ${\displaystyle R\subseteq U\times U.}$ This star operation is actually the reflexive and transitive closure of ${\displaystyle R}$ (that is, the smallest reflexive and transitive binary relation over ${\displaystyle U}$ containing ${\displaystyle R.}$).^[16]
• the semiring of formal languages is also a complete star semiring, with the star operation coinciding with the Kleene star (for sets/languages).^[16]
• The set of non-negative extended reals ${\displaystyle [0,\infty ]}$ together with the usual addition and multiplication of reals is a complete star semiring with the star operation given by ${\displaystyle a^{*}={\frac {1}{1-a}}}$ for ${\displaystyle 0\leq a<1}$ (that is, the geometric series) and ${\displaystyle a^{*}=\infty }$ for ${\displaystyle a\geq 1.}$^[16]
• The Boolean semiring with ${\displaystyle 0^{*}=1^{*}=1.}$^[a][16]
• The semiring on ${\displaystyle \mathbb {N} \cup \{\infty \},}$ with extended addition and multiplication, and ${\displaystyle 0^{*}=1,a^{*}=\infty }$ for ${\displaystyle a\geq 1.}$^[a][16]

Dioid[]

The term dioid (for "double monoid") has been used to mean various types of semirings:

• It was used by Kuntzman in 1972 to denote what is now termed semiring.^[28]
• The use to mean idempotent subgroup was introduced by Baccelli et al. in 1992.^[29]
• The name "dioid" is also sometimes used to denote naturally ordered semirings.^[30]

Generalizations[]

A generalization of semirings does not require the existence of a multiplicative identity, so that multiplication is a semigroup rather than a monoid. Such structures are called hemirings^[31] or pre-semirings.^[32] A further generalization are left-pre-semirings,^[33] which additionally do not require right-distributivity (or right-pre-semirings, which do not require left-distributivity).

Yet a further generalization are near-semirings: in addition to not requiring a neutral element for product, or right-distributivity (or left-distributivity), they do not require addition to be commutative. Just as cardinal numbers form a (class) semiring, so do ordinal numbers form a near-ring, when the standard ordinal addition and multiplication are taken into account. However, the class of ordinals can be turned into a semiring by considering the so-called natural (or Hessenberg) operations instead.

In category theory, a 2-rig is a category with functorial operations analogous to those of a rig. That the cardinal numbers form a rig can be categorified to say that the category of sets (or more generally, any topos) is a 2-rig.

See also[]

• Ring of sets – Family closed under unions and relative complements
• Valuation algebra

Notes[]

Citations[]

Bibliography[]

• Derniame, Jean Claude; Pair, Claude (1971), Problèmes de cheminement dans les graphes (Path Problems in Graphs), Dunod (Paris)
• François Baccelli, Guy Cohen, Geert Jan Olsder, Jean-Pierre Quadrat, Synchronization and Linearity (online version), Wiley, 1992, ISBN 0-471-93609-X
• Golan, Jonathan S., Semirings and their applications. Updated and expanded version of The theory of semirings, with applications to mathematics and theoretical computer science (Longman Sci. Tech., Harlow, 1992, MR1163371. Kluwer Academic Publishers, Dordrecht, 1999. xii+381 pp. ISBN 0-7923-5786-8 MR1746739
• Berstel, Jean; Perrin, Dominique (1985). Theory of codes. Pure and applied mathematics. 117. Academic Press. ISBN 978-0-12-093420-1. Zbl 0587.68066.
• Lothaire, M. (2005). Applied combinatorics on words. Encyclopedia of Mathematics and Its Applications. 105. A collective work by Jean Berstel, Dominique Perrin, Maxime Crochemore, Eric Laporte, Mehryar Mohri, Nadia Pisanti, Marie-France Sagot, Gesine Reinert, Sophie Schbath, Michael Waterman, Philippe Jacquet, Wojciech Szpankowski, Dominique Poulalhon, Gilles Schaeffer, Roman Kolpakov, Gregory Koucherov, Jean-Paul Allouche and Valérie Berthé. Cambridge: Cambridge University Press. ISBN 0-521-84802-4. Zbl 1133.68067.
• Głazek, Kazimierz (2002). A guide to the literature on semirings and their applications in mathematics and information sciences. With complete bibliography. Dordrecht: Kluwer Academic. ISBN 1-4020-0717-5. Zbl 1072.16040.
• Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge University Press. ISBN 978-0-521-84425-3. Zbl 1188.68177.
• Berstel, Jean; Reutenauer, Christophe (2011). Noncommutative rational series with applications. Encyclopedia of Mathematics and Its Applications. 137. Cambridge: Cambridge University Press. ISBN 978-0-521-19022-0. Zbl 1250.68007.

Further reading[]

• Golan, Jonathan S. (2003). Semirings and Affine Equations over Them. Springer Science & Business Media. ISBN 978-1-4020-1358-4. Zbl 1042.16038.
• Gondran, Michel; Minoux, Michel (2008). Graphs, Dioids and Semirings: New Models and Algorithms. Operations Research/Computer Science Interfaces Series. 41. Dordrecht: Springer Science & Business Media. ISBN 978-0-387-75450-5. Zbl 1201.16038.
• Grillet, Mireille P. (1970). "Green's relations in a semiring". Port. Math. 29: 181–195. Zbl 0227.16029.
• Gunawardena, Jeremy (1998). "An introduction to idempotency". In Gunawardena, Jeremy (ed.). Idempotency. Based on a workshop, Bristol, UK, October 3–7, 1994 (PDF). Cambridge: Cambridge University Press. pp. 1–49. Zbl 0898.16032.
• Jipsen, P. (2004). "From semirings to residuated Kleene lattices". Studia Logica. 76 (2): 291–303. doi:10.1023/B:STUD.0000032089.54776.63. S2CID 9946523. Zbl 1045.03049.
• Steven Dolan (2013) Fun with Semirings, doi:10.1145/2500365.2500613