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]


A semiring is a set equipped with two binary operations and called addition and multiplication, such that:[3][4][5]

The symbol is usually omitted from the notation; that is, is just written Similarly, an order of operations is conventional, in which is applied before ; that is, is

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]


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, for all elements ) is called an idempotent semiring.[7] Idempotent semirings are specific to semiring theory since any idempotent semiring that is also a ring is in fact trivial.[note 2] One can define a partial order on an idempotent semiring by setting whenever (or, equivalently, if there exists an such that ). The least element with respect to this order is meaning that for all Addition and multiplication respect the ordering in the sense that implies and and


The and 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 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 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]


By definition, any ring is also a semiring. A motivating example of a semiring is the set of natural numbers (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

Semiring of sets

See also: Ring of sets § semiring

A semiring (of sets)[14] is a (non-empty) collection of subsets of such that

    • If (3) holds, then if and only if
  1. If then
  2. If then there exists a finite number of mutually disjoint sets such that

Conditions (2) and (3) together with imply that Such semirings are used in measure theory. An example of a semiring of sets is the collection of half-open, half-closed real intervals

A semialgebra[15] or elementary family [16] is a collection of subsets of satisfying the semiring properties except with (3) replaced with:

This condition is stronger than (3), which can be seen as follows. If is a semialgebra and , then we can write for disjoint . Then:

and every since it is closed under intersection, and disjoint since they are contained in the disjoint 's. Moreover the condition is strictly stronger: any that is both a ring and a semialgebra is an algebra, hence any ring that is not an algebra is also not a semialgebra (e.g. the collection of finite sets on an infinite set ).

Specific examples



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 for any index set and that the following (infinitary) distributive laws must hold:[20][18][22]

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

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 with usual addition, multiplication and order extended is a continuous semiring.[24]

Any continuous semiring is complete:[20] this may be taken as part of the definition.[23]

Star semirings

A star semiring (sometimes spelled starsemiring) is a semiring with an additional unary operator ,[7][18][25][26] satisfying

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

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:[18]


Note that star semirings are not related to *-algebra, where the star operation should instead be thought of as complex conjugation.

Conway semiring

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

Every complete star semiring is also a Conway semiring,[28] but the converse does not hold. An example of Conway semiring that is not complete is the set of extended non-negative rational numbers 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).[18]

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


Examples of star semirings include:


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


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[33] or pre-semirings.[34] A further generalization are left-pre-semirings,[35] 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-semiring, 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


  1. ^ For an example see the definition of rig on
  2. ^ i.e. is a ring consisting of just one element, because rings have additive inverses, unlike semirings.
  1. ^ a b This is a complete star semiring and thus also a Conway semiring.[18]


  1. ^ Głazek (2002) p.7
  2. ^ a b Speyer, David; Sturmfels, Bernd (2009). "Tropical Mathematics". Mathematics Magazine. 82 (3): 163–173. doi:10.1080/0025570X.2009.11953615. ISSN 0025-570X. S2CID 15278805.
  3. ^ Berstel & Perrin (1985), p. 26
  4. ^ a b c d e Lothaire (2005) p.211
  5. ^ Sakarovitch (2009) pp.27–28
  6. ^ Lothaire (2005) p.212
  7. ^ a b c d e Ésik, Zoltán (2008). "Iteration semirings". In Ito, Masami (ed.). Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16–19, 2008. Proceedings. Lecture Notes in Computer Science. Vol. 5257. Berlin: Springer-Verlag. pp. 1–20. doi:10.1007/978-3-540-85780-8_1. ISBN 978-3-540-85779-2. Zbl 1161.68598.
  8. ^ Pair, Claude (1967), "Sur des algorithmes pour des problèmes de cheminement dans les graphes finis (On algorithms for path problems in finite graphs)", in Rosentiehl (ed.), Théorie des graphes (journées internationales d'études) -- Theory of Graphs (international symposium), Rome (Italy), July 1966: Dunod (Paris) et Gordon and Breach (New York), p. 271((citation)): CS1 maint: location (link)
  9. ^ Derniame, Jean Claude; Pair, Claude (1971), Problèmes de cheminement dans les graphes (Path Problems in Graphs), Dunod (Paris)
  10. ^ a b c Guterman, Alexander E. (2008). "Rank and determinant functions for matrices over semirings". In Young, Nicholas; Choi, Yemon (eds.). Surveys in Contemporary Mathematics. London Mathematical Society Lecture Note Series. Vol. 347. Cambridge University Press. pp. 1–33. ISBN 978-0-521-70564-6. ISSN 0076-0552. Zbl 1181.16042.
  11. ^ a b c Sakarovitch (2009) p.28
  12. ^ a b c Berstel & Reutenauer (2011) p. 4
  13. ^ Schanuel S.H. (1991) Negative sets have Euler characteristic and dimension. In: Carboni A., Pedicchio M.C., Rosolini G. (eds) Category Theory. Lecture Notes in Mathematics, vol 1488. Springer, Berlin, Heidelberg
  14. ^ Noel Vaillant, Caratheodory's Extension, on
  15. ^ Durrett 2019, pp. 3–4.
  16. ^ Folland 1999, p. 23.
  17. ^ John C. Baez (6 Nov 2001). "quantum mechanics over a commutative rig". Newsgroupsci.physics.research. Usenet: 9s87n0$ Retrieved November 25, 2018.
  18. ^ a b c d e f g h i j k l m n o Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28. doi:10.1007/978-3-642-01492-5_1, pp. 7-10
  19. ^ Speyer, David; Sturmfels, Bernd (2009) [2004]. "Tropical Mathematics". Math. Mag. 82 (3): 163–173. arXiv:math/0408099. doi:10.4169/193009809x468760. S2CID 119142649. Zbl 1227.14051.
  20. ^ a b c Kuich, Werner (2011). "Algebraic systems and pushdown automata". In Kuich, Werner (ed.). Algebraic foundations in computer science. Essays dedicated to Symeon Bozapalidis on the occasion of his retirement. Lecture Notes in Computer Science. Vol. 7020. Berlin: Springer-Verlag. pp. 228–256. ISBN 978-3-642-24896-2. Zbl 1251.68135.
  21. ^ Bard, Gregory V. (2009), Algebraic Cryptanalysis, Springer, Section 4.2.1, "Combinatorial Classes", ff., pp. 30–34, ISBN 9780387887579.
  22. ^ Kuich, Werner (1990). "ω-continuous semirings, algebraic systems and pushdown automata". In Paterson, Michael S. (ed.). Automata, Languages and Programming: 17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings. Lecture Notes in Computer Science. Vol. 443. Springer-Verlag. pp. 103–110. ISBN 3-540-52826-1.
  23. ^ a b Sakaraovich (2009) p.471
  24. ^ Ésik, Zoltán; Leiß, Hans (2002). "Greibach normal form in algebraically complete semirings". In Bradfield, Julian (ed.). Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, September 22-25, 2002. Proceedings. Lecture Notes in Computer Science. Vol. 2471. Berlin: Springer-Verlag. pp. 135–150. Zbl 1020.68056.
  25. ^ Lehmann, Daniel J. "Algebraic structures for transitive closure." Theoretical Computer Science 4, no. 1 (1977): 59-76.
  26. ^ Berstel & Reutenauer (2011) p.27
  27. ^ Ésik, Zoltán; Kuich, Werner (2004). "Equational axioms for a theory of automata". In Martín-Vide, Carlos (ed.). Formal languages and applications. Studies in Fuzziness and Soft Computing. Vol. 148. Berlin: Springer-Verlag. pp. 183–196. ISBN 3-540-20907-7. Zbl 1088.68117.
  28. ^ Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28. doi:10.1007/978-3-642-01492-5_1, Theorem 3.4 p. 15
  29. ^ Conway, J.H. (1971). Regular algebra and finite machines. London: Chapman and Hall. ISBN 0-412-10620-5. Zbl 0231.94041.
  30. ^ Kuntzmann, J. (1972). Théorie des réseaux (graphes) (in French). Paris: Dunod. Zbl 0239.05101.
  31. ^ Baccelli, François Louis; Olsder, Geert Jan; Quadrat, Jean-Pierre; Cohen, Guy (1992). Synchronization and linearity. An algebra for discrete event systems. Wiley Series on Probability and Mathematical Statistics. Chichester: Wiley. Zbl 0824.93003.
  32. ^ Semirings for breakfast, slide 17
  33. ^ Jonathan S. Golan, Semirings and their applications, Chapter 1, p1
  34. ^ Michel Gondran, Michel Minoux, Graphs, Dioids, and Semirings: New Models and Algorithms, Chapter 1, Section 4.2, p22
  35. ^ Michel Gondran, Michel Minoux, Graphs, Dioids, and Semirings: New Models and Algorithms, Chapter 1, Section 4.1, p20


Further reading