idempotent semiring
A semiring is called an idempotent semiring, or i-semiring for short, if, addition is an idempotent
binary operation
:
Some properties of an i-semiring .
- 1.
If we define a binary relation
on by
then becomes a partial order
on . Indeed, for implies ; if and , then ; and finally, if and , then so .
- 2.
for any , because .
- 3.
Define as the supremum
of and (with respect to ). Then exists and
To see this, we have , so . Similarly . If and , then . So .
- 4.
Collecting all the information above, we see that is an upper semilattice
with as the join operation
on and the bottom element.
- 5.
Additon and multiplication respect partial ordering: suppose , then for any , , hence ; also, implies .
Remark. in general is not a lattice, and is not the top element of .
The main example of an i-semiring is a Kleene algebra used in the theory of computations.