Namespaces
Variants
Actions

Difference between revisions of "Semi-ring"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(LaTeX)
Line 1: Line 1:
−
A non-empty set with two associative binary operations <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843201.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843202.png" />, satisfying the distributive laws
+
{{TEX|done}}
−
 
 
−
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843203.png" /></td> </tr></table>
 
  
 +
A non-empty set $S$ with two associative binary operations $+$ and $\cdot$, satisfying the [[distributive law]]s
 +
$$
 +
(a+b) \cdot c = a\cdot c + b \cdot c
 +
$$
 
and
 
and
−
 
+
$$
−
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843204.png" /></td> </tr></table>
+
a \cdot (b+c) = a\cdot b + a\cdot c \ .
−
 
+
$$
−
In most cases one also assumes that the addition is commutative and that there exists a zero <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843205.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843206.png" /> for every <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843207.png" />. The most important examples of semi-rings are rings and distributive lattices (cf. [[Ring|Ring]]; [[Distributive lattice|Distributive lattice]]). If there is a multiplicative identity 1, the two classes are combined by the condition
+
In most cases one also assumes that the addition is commutative and that there exists a zero element $0$ such that $a + 0 = a$ for every $a \in S$. The most important classes of semi-rings are [[ring]]s and [[distributive lattice]]s. If there is a multiplicative identity 1, the two classes are combined by the condition
−
 
+
$$
−
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s084/s084320/s0843208.png" /></td> </tr></table>
+
\forall x \, \exists y \  x+y=1 \ .
−
 
+
$$
 
The non-negative integers with the usual operations provide an example of a semi-ring that does not satisfy this condition.
 
The non-negative integers with the usual operations provide an example of a semi-ring that does not satisfy this condition.

Revision as of 18:16, 13 December 2014


A non-empty set $S$ with two associative binary operations $+$ and $\cdot$, satisfying the distributive laws $$ (a+b) \cdot c = a\cdot c + b \cdot c $$ and $$ a \cdot (b+c) = a\cdot b + a\cdot c \ . $$ In most cases one also assumes that the addition is commutative and that there exists a zero element $0$ such that $a + 0 = a$ for every $a \in S$. The most important classes of semi-rings are rings and distributive lattices. If there is a multiplicative identity 1, the two classes are combined by the condition $$ \forall x \, \exists y \ x+y=1 \ . $$ The non-negative integers with the usual operations provide an example of a semi-ring that does not satisfy this condition.

How to Cite This Entry:
Semi-ring. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Semi-ring&oldid=35628
This article was adapted from an original article by L.A. Skornyakov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article
Retrieved from "https://encyclopediaofmath.org/index.php?title=Semi-ring&oldid=35628"