Professional Documents
Culture Documents
Shruti Sharma
1 Ring
Subring
Zero Ring and Unit of Ring
2 Polynomial Rings
Monomial and Homogenous Polynomial
4 Ideals
Principal Ideal
Factor Construction
Definition
Ring (R, +, 0, ., 1) is a set which is Abelian group under addition with
identity element 0 i.e. (+, 0) and under multiplication (., 1) operation
satisfies associativity and distributive law:
β = an αn + · · · + a1 α + a0 ∈ Z[α], ai ∈ Z.
Definition
A complex no. α is ALGEBRAIC if it is a root of a non-zero polynomial
with coefficients in Ring Z[α].
If there is no polynomial with α as a root, α is TRANSCENDENTAL.
Example
A polynomial in x with coefficient in a ring R is an expression of the
form
an xn + · · · + a1 x + a0 , ai ∈ R.
The set of polynomials forms a ring.
The set R of continuous real valued function of a real variable x
forms a ring:
Proposition
A ring R in which the elements 1 and 0 are equal is Zero Ring.
Proof:
For all a ∈ R,
0a = (0 + 0)a ⇒ 0a + 0a = 0a = 0.
Let 1 = 0,
a = 1a = 0a = 0 ⇒ a = 0.
Thus, the only element of R is 0.
Definition
Unit of a ring is an element that has a multiplicative inverse.
Units in the ring of integers: ±.
Units in the ring of Gauss integers Z[i]: ±, ±i.
Units in the ring of polynomials R[x]: non-zero constant polynomials.
Field are rings in which 0 6= 1 and every non-zero element is a unit.
Definition
A polynomial with coefficients in a ring R is a finite linear combination of
powers of the variable:
Polynomial
f (x) = a0 + a1 x + a2 x2 + . . . , ai ∈ R
(f + g)(x) = (a + b) = (a0 + b0 , a1 + b1 , a2 + b2 , . . . )
Product:
X
f (x)g(x) = p0 + p1 x + p2 x2 + . . . , pk = ai bj
i+j=k
Proposition
There is a unique commutative ring structure on the sets of polynomials
R[x] having properties:
Addition of polynomials.
Product of polynomials.
Ring R becomes a subring of R[x] when elements of R are identified
with constant polynomials.
Proposition
Let R be a ring, let f be a monic polynomial and let g be any polynomial,
both with coefficient in R. They are uniquely determined polynomials q
and r in R[x] s.t.
g(x) = f (x)q(x) + r(x)
and s.t. remainder r, if it is not 0, has degree less than of f . Moreover, f
divides g in R[x] iff the remainder r is 0.
Corollary
Division with remainder can be done whenever the leading coefficient of f
is a unit. In particular, it can be done whenever the coefficient ring is a
field and f 6= 0.
Corollary
Let g(x) be a polynomial in R[x], and let α ∈ R. The remainder of
division of g(x) by x − α is g(α). Thus (x − α) divides g ∈ R[x] if and
only if g(α) = 0.
Definition
A monomial is a product of some variables x1 , . . . , xn of the form
where i = i1 + · · · + in .
A polynomial in the variables x1 , . . . , xn with coefficients in a ring R, is
a linear combination of finitely many monomials with coefficients in R
X
f (x) = ai xi , ai ∈ R.
i
Ring Homomorphism
A ring homomorphism ϕ : R → R0 is a map from one ring to another ring
which is compatible with laws of composition s.t. for a, b ∈ R,
Example
The map ϕ : Z → Fp sends an integer to its congruence class modulo
p is a ring homomorphism.
Isomorphism of rings is a bijective homomorphism and if there is an
isomorphism from R to R0 , the two rings are said to be isomorphic.
Consider zero map 0 : R → R0 , 0(1) = 0 6= 1 unless 1 = 0 in R0 . So,
0 map is not a ring homomorphism unless R0 is zero ring.
Evaluation of real polynomials at a real no a defines a ring
homomorphism
R[x] → R p(x) 7→ p(a).
Substitution Principle
Let ϕ : R → R0 be a ring homomorphism and let R[x] be the ring of
polynomials with coefficients in R.
(a) Let α ∈ R0 . There is a unique homomorphism
Φ : R[x] → R0
Proof:
Let a ∈ R s.t. a0 = ϕ(a) ∈ R0 . Using the fact that Φ is a
homomorphism that restricts to ϕ onPR and sends x to α, we see
that it acts on a polynomial f (x) = ai xi by sending
X X X X
Φ( ai xi ) = Φ(ai xi ) = Φ(ai )Φ(x)i = a0i αi
i i i i
Example
ϕ : Z → Fp that sends an integer a to its residue ā mod p. This map
extends to a homomorphism Φ : Z[x] → Fp [x], s.t.
Proposition
Let R be a ring. There is exactly one homomorphism ϕ : Z → R from ring
of integers to R. It is the map defined by
Definition
The kernel of ϕ : R → R0 is a set of elements of R that map to 0 i.e.
kerϕ = {s ∈ R|ϕ(s) = 0}
Important
Kernel of a Ring homomorphism is ’closed’ under the ’addition’ and
has a property that is stronger than closure under multiplication.
If s ∈ kerϕ and r ∈ R then rs ∈ kerϕ:
Definition
An ideal I is a subset of ring R i.e. I ⊂ R s.t.:
I is closed under addition.
If s ∈ I and r ∈ R then sr ∈ I.
Equivalent Formulation
If I 6= ∅ and for ri ∈ R and si ∈ I then
r1 s1 + · · · + rk sk ∈ I.
Definition
In any ring R, the multiples of a particular element a form an ideal called
PRINCIPAL IDEAL generated by a i.e. b ∈ R is in principal ideal iff b is a
multiple of a or iff a divides b in R.
(a) = aR = Ra = {ra|r ∈ R}
ϕ:R→S
ϕ(r1 + r2 ) = ϕ(r1 ) + ϕ(r2 )
ϕ(r1 r2 ) = ϕ(r1 )ϕ(r2 )
kerϕ , {r ∈ R|ϕ(r) = 0}
ϕ(r1 + r2 ) = ϕ(r1 ) + ϕ(r2 ) = 0 ∀r1 , r2 ∈ kerϕ
ϕ(ar) = ϕ(a)ϕ(r) = 0 ∀r ∈ kerϕ , a ∈ R