Let R be a set on which two binary operations are
defined, called addition and multiplication, and denoted by + and
..
Then R is called a
commutative ring
with respect to these operations if the following properties hold:
(i)
Closure:
If a,b
R,
then the sum a+b and the product
a.b
are uniquely defined and belong to R.
(ii)
Associative laws:
For all a,b,c
R,
a+(b+c) = (a+b)+c and
a.(b.c)
= (a.b).c.
(iii)
Commutative laws:
For all a,b
R,
a+b = b+a and
a.b
= b.a.
(iv)
Distributive laws:
For all a,b,c
R,
a.(b+c)
= a.b
+ a.c and
(a+b).c
= a.c
+ b.c.
(v)
Additive identity:
The set R contains an
additive identity element,
denoted by 0, such that for all
a
R,
a+0 = a and 0+a = a.
(vi)
Additive inverses:
For each
a
R, the equations
a+x = 0 and x+a = 0
have a solution x
R, called the
additive inverse
of a, and denoted by -a.
The commutative ring R is called a
commutative ring with identity
if it contains an element 1,
assumed to be different from 0, such that for all
a
R,
a.1 = a and
1.a = a.
In this case, 1 is called a
multiplicative identity element
or, more generally, simply an
identity element.
As with groups, we will use juxtaposition to indicate multiplication,
so that we will write ab instead of
a.b.
Field
A field is a ring, such that
for any a that is not equal to 0, there is an element b that
is inverse to a with respect to multiplication: ab=1.