An ordered semiring is a RR equipped with a ≤\leq such that

a≤b⟹a+c≤b+candac≤bca\leq b\Longrightarrow a+c\leq b+c \quad\text{and}\quad ac\leq bc

for all a,b,c∈Ra,b,c\in R. In this knowl, semirings are commutative and unital, so the second condition also covers multiplication on the other side.

Scope

The order is part of the structure; it need not be the , and 00 need not be the least element. Morphisms of ordered semirings preserve 0,1,+,⋅0,1,+,\cdot and the order.

An order generated by specified inequalities is closed under reflexivity, transitivity, addition, and multiplication. This presentation viewpoint is the additive-relation layer used by .

Examples
  • Every semiring has the discrete order, a≤ba\leq b exactly when a=ba=b.
  • R≥0\mathbb{R}_{\geq 0} with its usual operations and order is an ordered semiring.
  • An has the canonical order a≤b  ⟺  a+b=ba\leq b\iff a+b=b, but reversing that order is also common in tropical conventions.
References

The convention follows Baker–Lorscheid, The moduli space of matroids, §2.6.