Semiring

From Wikipedia, the free encyclopedia

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—this originated as a joke, suggesting that rigs are rings without negative elements.

Contents

[edit] Definition

A semiring is a set R equipped with two binary operations + and ·, called addition and multiplication, such that:

  1. (R, +) is a commutative monoid with identity element 0:
    1. (a + b) + c = a + (b + c)
    2. 0 + a = a + 0 = a
    3. a + b = b + a
  2. (R, ·) is a monoid with identity element 1:
    1. (a·b)·c = a·(b·c)
    2. 1·a = a·1 = a
  3. Multiplication distributes over addition:
    1. a·(b + c) = (a·b) + (a·c)
    2. (a + b)·c = (a·c) + (b·c)
  4. 0 annihilates R:
    1. 0·a = a·0 = 0

This last axiom is omitted from the definition of a ring: it follows automatically from the other ring axioms. Here it does not, and it is necessary to state it in the definition.

The difference between rings and semirings, then, is that addition yields only a commutative monoid, not necessarily an abelian group.

As usual, the symbol · is usually omitted from the notation; that is, a·b is just written ab. Similarly, an order of operations is accepted, according to which · is applied before +; that is, a + bc is a + (bc).

A commutative semiring is one whose multiplication is commutative. An idempotent semiring (also known as a dioid) is one whose addition is idempotent: a + a = a, that is, (R, +) is a band.

N.B. 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 : semiring and group : semigroup work more smoothly. These authors often use rig for the concept defined here.

[edit] Examples

[edit] In general

  • Any ring is also a semiring.
  • The ideals of a ring form a semiring under addition and multiplication of ideals.
  • Any unital, quantale is an idempotent semiring, or dioid, 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 normal skew lattice in a ring R is an idempotent semiring for the operations multiplication and nabla, where the latter operation is defined by a\nabla b=a+b+ba-aba-bab.
  • A Kleene algebra is an idempotent semiring R with an additional unary operator * : R → R called the Kleene star. Kleene algebras are important in the theory of formal languages and regular expressions.

[edit] Specific examples

  • The motivating example of a semiring is the set of natural numbers N (including 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.
  • Of course, rings such as the integers or the real numbers are also examples of semirings.
  • The simplest example of a semiring which is not a ring is the commutative semiring B formed by the two-element Boolean algebra.
  • N[x], polynomials with natural number coefficients form a commutative semiring. In fact, this is the free commutative semiring on a single generator {x}.
  • Square n-by-n matrices with non-negative entries form a (non-commutative) semiring under ordinary addition and multiplication of matrices. More generally, this likewise applies to the square matrices whose entries are elements of any other given semiring.
  • The tropical semiring, R ∪ {−∞}, is a commutative, idempotent semiring with max(a,b) serving as semiring addition (identity −∞) and ordinary addition (identity 0) serving as semiring multiplication. In an alternative formulation, the tropical semiring is R ∪ {∞}, and min replaces max as the addition operation.
  • The set of cardinal numbers smaller than any given infinite cardinal form a semiring under cardinal addition and multiplication. (We can't form a semiring of all cardinal numbers because they do not form a set.)

[edit] Semiring theory

Much of the theory of rings continues to make sense when applied to arbitrary semirings. In particular, one can generalise the theory of algebras over commutative rings directly to a theory of algebras over commutative semirings. Then a ring is simply an algebra over the commutative semiring Z of integers. Some mathematicians go so far as to say that semirings are really the more fundamental concept, and specialising to rings should be seen in the same light as specialising to, say, algebras over the complex numbers.

Idempotent semirings are special to semiring theory as any ring which is idempotent under addition is trivial. One can define a partial order ≤ on an idempotent semiring by setting a ≤ b whenever a + b = b (or, equivalently, if there exists an x such that a + x = b). It is easy to see that 0 is the least element with respect to this order: 0 ≤ a for all a. Addition and multiplication respect the ordering in the sense that a ≤ b implies ac ≤ bc and ca ≤ cb and (a+c) ≤ (b+c).

[edit] Further generalizations

A near-rig does not require addition to be commutative, nor does it require right-distributivity. Just as cardinal numbers form a rig, so do ordinal numbers form a near-rig.

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.

[edit] Applications

Dioids, especially the (max, +) and (min, +) dioids 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 (min, +) algebra.

[edit] See also

[edit] Bibliography