Math 2.0

Associative rings and algebras Concept

Idempotent semiring

Summary

An idempotent semiring, also called a dioid, is a semiring in which a+a=aa + a = a for every element aa. In such a semiring the addition defines a natural partial order, with a≤ba \le b when a+b=ba + b = b, and addition becomes the join of this order. The Boolean semiring, the tropical semirings and the semiring of formal languages are examples. Idempotent semirings are the algebra of shortest paths, of tropical geometry and of Kleene algebras.

Further reading

  1. Web https://en.wikipedia.org/wiki/Semiring
About this page
TagJCSAC9Y1CV
URIm2://JCSAC9Y1CV
Kindconcept
WritingW0 stub
MSC16Y60, 06F05
SpecializesSemiring
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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

Special cases

Definitions