RINGS

AND
THEOREMS
• A ring is a set of elements
involving two operations. This
contains different examples of
rings.
7.1 Rings
• A ring is a set of elements on R
with two defined binary
operations, written as ꚛ and ⊙
, satisfying the following
conditions:
a) R is closed with respect to
addition ꚛ .
b) Addition ꚛ is associative in R.
c) R contains a zero element
under ꚛ .
• d) For each element a in R, there
exists a negative denoted by -a ∈
R.
• e) Addition ꚛ is commutative in
R.
• f) R is closed with respect to
multiplication ⊙ .
• g) Multiplication ⊙ is associative
in R.
• h) Multiplication ⊙ is left- and
right-distributive over addition
 The definition of a ring may be
summarized as follows. of
permutations as follows.
• A ring is a set R which is closed under
two binary operations addition and
multiplication satisfying the following
properties.
a. R is an abelian group with respect
to the operation of addition.
b. Multiplication is associative in R.
c. The right and left-distributive laws
of multiplication over addition
hold in R. A ring is a commutative
ring if and only if the operation of
multiplication is commutative.
A ring is a commutative ring if and
only if the operation of
multiplication is commutative.
• Example 7.1.1
• The set of integers Z is a ring with respect
to addition and multiplication. Also it is a
commutative ring with unity.
• Example 7.1.2
• The set of positive integers is not a ring,
since it does not contain the additive
identity zero.
• Example 7.1.3
• In contrast to Z, the ring Ze of all even
integers is a commutative ring, but Ze
does not have a unity.
THANK YOU FOR LISTENING!