Hubbry Logo
Open search
logo
Open search
Semiring
Community hub

Semiring

logo
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something to knowledge base
Semiring

In abstract algebra, a semiring is an algebraic structure. Semirings are a generalization of rings, dropping the requirement that each element must have an additive inverse. At the same time, semirings are a generalization of bounded distributive lattices.

The smallest semiring that is not a ring is the two-element Boolean algebra, for instance with logical disjunction as addition. A motivating example that is neither a ring nor a lattice is the set of natural numbers (including zero) under ordinary addition and multiplication. Semirings are abundant because a suitable multiplication operation arises as the function composition of endomorphisms over any commutative monoid.

Some authors define semirings without the requirement for there to be a or . 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. This originated as a joke, suggesting that rigs are rings without negative elements. (Akin to using rng to mean a ring without a multiplicative identity.)

The term dioid (for "double monoid") has been used to mean semirings or other structures. It was used by Kuntzmann in 1972 to denote a semiring. (It is alternatively sometimes used for naturally ordered semirings but the term was also used for idempotent subgroups by Baccelli et al. in 1992.)

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

Further, the following axioms tie to both operations:

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, denotes .

See all
User Avatar
No comments yet.