ITM GOI

CS-302
MATHEMATICS

ACTIVITY ON
TOPIC "RING"
Hello, Everyone!
Hope you All are
Doing Well!!
Meet the Group

Deepak_55 Deepu_57 Jaikishan_86 Aiman_101

Group Leader Group Member Group Member Group Member
Introduction
History

In 19th century German, the word "Ring" could mean "association",

similar to the way "group" entered mathematics by being a non-
technical word for "collection of related thing”.
The study of rings originated from the theory of polynomial
rings and the theory of algebraic integers. In 1871, Richard
Dedekind defined the concept of the ring of integers of a
number field.
 Definition
A ring is a set R equipped with two binary operations[a] + (addition)
and ⋅ (multiplication) satisfying the following three sets of axioms, called
the ring axioms.

In other Words , a ring is an abelian group whose operation is

called addition, with a second binary operation called multiplication
that is associative, is distributive over the addition operation, and
has a multiplicative identity element .
 CONDITIONS TO BE
A RING.
R is an abelian group under
addition : R is a Semigroup under
• (a + b) + c = a + (b + c) for
all a, b, c in R (that is, + is
associative).
• a + b = b + a for all a, b in R
(that is, + is
commutative).
• There is an element 0 in R
such that a + 0 = a for all a
in R (that is, 0 is the
additive identity).
• For each a in R there
exists −a in R such that a +
(−a) = 0 (that is, −a is the
multiplication:
• (a ⋅ b) ⋅ c = a ⋅ (b ⋅ c) for all
a, b, c in R (that is, ⋅ is
associative).
• There is an element 1 in R
such that a ⋅ 1 = a and 1 ⋅ a
= a for all a in R (that is, 1
is the multiplicative
identity).
Multiplication is
distributive with respect to
addition:
• a ⋅ (b + c) = (a ⋅ b) + (a
⋅ c) for all a, b, c in R
(left distributivity).
• (b + c) ⋅ a = (b ⋅ a) + (c
⋅ a) for all a, b, c in R
(right distributivity).
 Types of Ring
There are various types of rings, which is described as follows:
Null ring
A ring will be called a zero ring or null ring if singleton (0) is using
with the binary operator (+ or *). The null ring can be described as
follows:
0 + 0 = 0 and 0.0 = 0
Commutative ring
The ring R will be called a commutative ring if multiplication in a ring
is also a commutative, which means x is the right divisor of zero as
well as the left divisor of zero. The commutative ring can be
described as follows:
x.y = y.x for all x, y ∈ R
The ring will be called non-commutative ring if multiplication in a
ring is not commutative.
Ring with unity
The ring will be called the ring of unity if a ring has an element e like this:
e.x = x.e = x for all R
Where
e can be defined as the identity of R, unity, or units elements.

Ring with zero divisor

If a ring contains two non-zero elements x, y ∈ R, then the ring will be known as
the divisor of zero. The ring with zero divisors can be described as follows:
y.x = 0 or x.y = 0
Where
x and y can be said as the proper divisor of zero because in the first case, x is
the right divisor of zero, and in the second case, x is the left divisor of zero.
0 is described as additive identity in R
Ring without zero divisor
If products of no two non-zero elements is zero in a ring, the ring will be called a
ring without zero divisors. The ring without zero elements can be described as
follows:
xy = 0 => x = 0 or y = 0
Properties
The additive identity is unique.
• The additive inverse of each element is unique.
• The multiplicative identity is unique.
• For any element x in a ring R, one has x0 = 0 = 0x (zero is an
absorbing element with respect to multiplication) and (–1)x = –x.
• If 0 = 1 in a ring R (or more generally, 0 is a unit element), then R has
only one element, and is called the zero ring.
• If a ring R contains the zero ring as a subring, then R itself is the
zero ring.
• The binomial formula holds for any x and y satisfying xy = yx.
 Examples
The most familiar example of a ring is the set of all integers Z,consisting of
the numbers
... , −5, −4, −3, −2, −1, 0, 1, 2, 3, 4, 5, ...

Example: Integers modulo 4

Equip the set Z/4Z= {0,1,2,3} With following operations :

---The sum x` +y` in Z/4Z is the remainder when the integer x + y

is divided by 4 (as x + y is always smaller than 8, this remainder is
either x + y or x + y − 4). For example, 2`+3` = 1` & 3`+3` = 2`.

---The product x`.y` in Z/4Z is the remainder when the integer xy is

divided by 4. For example, 2`.3` =2 & 3`.3` =1.
 Applications
Ring Theory have Vast Application in Many Fields Like:

Constant Problems in Computer science can be solved efficiently.

 research in mathematics

mathematical/theoretical physics

to the study of geometric objects

Topology

Cryptography   : You might even want to make millions as a cryptographer --- current methods in

cryptography are hard to crack, but become very easy when hacking with a quantum computer. There are good

reasons to hope that rings and groups hold the key to codes that cannot be broken easily by quantum

computers, just in case someone invents one and fancies stealing identities. We've just not come up with the

perfect code yet.

 References:
 Wikipedia

Javatpoint.com
Discrete mathematics by DK Jain.
THANK YOU!
Do you have any questions for us?