Lecture 26
Properties of Ideals
Last time: Maximal ideals
Definition
An ideal M in the ring S is a maximal ideal if M S and the only
ideals containing M are M and S.
Last time: Maximal ideals
Definition
An ideal M in the ring S is a maximal ideal if M S and the only
ideals containing M are M and S.
Proposition
In a ring with identity every proper ideal is contained in a maximal
ideal.
Theorem (Zorn’s Lemma)
If A is a non-empty partially ordered set in which every chain has
an upper bound, then A has a maximal element.
Last time: Maximal ideals
Definition
An ideal M in the ring S is a maximal ideal if M S and the only
ideals containing M are M and S.
Proposition
In a ring with identity every proper ideal is contained in a maximal
ideal.
Theorem (Zorn’s Lemma)
If A is a non-empty partially ordered set in which every chain has
an upper bound, then A has a maximal element.
Proposition
Let R be a commutative ring. The ideal M is maximal if and only
if R{M is a field.
Generalizing the integers: Prime ideals
Ring theory in Number theory. For example, read about the
reduction homomorphism (p. 245), and its role in finding integer
solutions to equations like
x2 y2 3z2 or xn yn zn
Generalizing the integers: Prime ideals
Ring theory in Number theory. For example, read about the
reduction homomorphism (p. 245), and its role in finding integer
solutions to equations like
x2 y2 3z2 or xn yn zn
Definition
Let R be a commutative ring. An ideal P is a prime ideal if P R
and whenever ab P P , either a P P or b P P .
Generalizing the integers: Prime ideals
Ring theory in Number theory. For example, read about the
reduction homomorphism (p. 245), and its role in finding integer
solutions to equations like
x2 y2 3z2 or xn yn zn
Definition
Let R be a commutative ring. An ideal P is a prime ideal if P R
and whenever ab P P , either a P P or b P P .
Proposition
Let R be a commutative ring. The ideal P is a prime ideal if and
only if R{P is an integral domain.
Generalizing the integers: Prime ideals
Ring theory in Number theory. For example, read about the
reduction homomorphism (p. 245), and its role in finding integer
solutions to equations like
x2 y2 3z2 or xn yn zn
Definition
Let R be a commutative ring. An ideal P is a prime ideal if P R
and whenever ab P P , either a P P or b P P .
Proposition
Let R be a commutative ring. The ideal P is a prime ideal if and
only if R{P is an integral domain.
Corollary
Let R be a commutative ring. Every maximal ideal of R is a prime
ideal.
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings:
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings:
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields:
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs):
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs): no zero divisors
(cancellation works).
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs): no zero divisors
(cancellation works).
New: the many kinds of (integral) domains.
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs): no zero divisors
(cancellation works).
New: the many kinds of (integral) domains.
Principal ideal domains (PIDs): every ideal is principal.
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs): no zero divisors
(cancellation works).
New: the many kinds of (integral) domains.
Principal ideal domains (PIDs): every ideal is principal.
Unique factorization domains (UFDs): elements factor uniquely
into primes.
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs): no zero divisors
(cancellation works).
New: the many kinds of (integral) domains.
Principal ideal domains (PIDs): every ideal is principal.
Unique factorization domains (UFDs): elements factor uniquely
into primes.
Euclidean domains (EDs): there’s a division (i.e. Euclidean)
algorithm.
The many kinds of rings
Assume all rings R have 1 for a moment.
We already know.
Commutative rings: multiplication is commutative.
Division rings: pR t0u, q is a group.
Fields: pR t0u, q is an abelian group.
Integral domains (or domains, or IDs): no zero divisors
(cancellation works).
New: the many kinds of (integral) domains.
Principal ideal domains (PIDs): every ideal is principal.
Unique factorization domains (UFDs): elements factor uniquely
into primes.
Euclidean domains (EDs): there’s a division (i.e. Euclidean)
algorithm.
You can show that
tID’s u tUFDs u tPIDsu tEDsu tFieldsu
Euclidean Domains
?
Recall the quadratic field Qp Dq and its ring of integers Zrω s
? ?
(where D is a square-free integer and ω p
D or 1 q{
D 2).
Euclidean Domains
?
Recall the quadratic field Qp Dq and its ring of integers Zrω s
? ?
(where D is a square-free integer and ω p
D or 1 q{
D 2).
To calculate the units of Zrω s, we defined a “norm”
? ?
N : Qp Dq Ñ Q defined by N pa b Dq a2 b2 D.
Euclidean Domains
?
Recall the quadratic field Qp Dq and its ring of integers Zrω s
? ?
(where D is a square-free integer and ω p
D or 1 q{
D 2).
To calculate the units of Zrω s, we defined a “norm”
? ?
N : Qp Dq Ñ Q defined by N pa b Dq a2 b2 D.
?
When restricted to Zrω s Qp Dq, we had
N pn mω q P Z and N pxq 0 iff x 0.
Euclidean Domains
?
Recall the quadratic field Qp Dq and its ring of integers Zrω s
? ?
(where D is a square-free integer and ω p
D or 1 q{
D 2).
To calculate the units of Zrω s, we defined a “norm”
? ?
N : Qp Dq Ñ Q defined by N pa b Dq a2 b2 D.
?
When restricted to Zrω s Qp Dq, we had
N pn mω q P Z and N pxq 0 iff x 0.
Definition. Let R be an ID. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Euclidean Domains
?
Recall the quadratic field Qp Dq and its ring of integers Zrω s
? ?
(where D is a square-free integer and ω p
D or 1 q{
D 2).
To calculate the units of Zrω s, we defined a “norm”
? ?
N : Qp Dq Ñ Q defined by N pa b Dq a2 b2 D.
?
When restricted to Zrω s Qp Dq, we had
N pn mω q P Z and N pxq 0 iff x 0.
Definition. Let R be an ID. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Uh oh!
Euclidean Domains
?
Recall the quadratic field Qp Dq and its ring of integers Zrω s
? ?
(where D is a square-free integer and ω p
D or 1 q{
D 2).
To calculate the units of Zrω s, we defined a “norm”
? ?
N : Qp Dq Ñ Q defined by N pa b Dq a2 b2 D.
?
When restricted to Zrω s Qp Dq, we had
N pn mω q P Z and N pxq 0 iff x 0.
Definition. Let R be an ID. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Uh oh! Fix the field norm by taking the absolute value.
Euclidean Domains
Definition. Let R be an integral domain. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Euclidean Domains
Definition. Let R be an integral domain. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Definition. An integral domain R is a Euclidean Domain if there
is a norm N on R satisfying
for all a, b P R, b 0, there exists q, r PR
with
a qb r, where r 0 or N prq N pbq.
We call q the quotient and r the remainder of the division.
Euclidean Domains
Definition. Let R be an integral domain. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Definition. An integral domain R is a Euclidean Domain if there
is a norm N on R satisfying
for all a, b P R, b 0, there exists q, r PR
with
a qb r, where r 0 or N prq N pbq.
We call q the quotient and r the remainder of the division.
Ex: (i) Zrω s with N pn mω q |n2 m2 ω | only sometimes!!
Euclidean Domains
Definition. Let R be an integral domain. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Definition. An integral domain R is a Euclidean Domain if there
is a norm N on R satisfying
for all a, b P R, b 0, there exists q, r PR
with
a qb r, where r 0 or N prq N pbq.
We call q the quotient and r the remainder of the division.
Ex: (i) Zrω s with N pn mω q |n2 m2 ω | only sometimes!!
(ii) Fields F with N paq 0 for all a P F .
Euclidean Domains
Definition. Let R be an integral domain. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Definition. An integral domain R is a Euclidean Domain if there
is a norm N on R satisfying
for all a, b P R, b 0, there exists q, r PR
with
a qb r, where r 0 or N prq N pbq.
We call q the quotient and r the remainder of the division.
Ex: (i) Zrω s with N pn mω q |n2 m2 ω | only sometimes!!
(ii) Fields F with N paq 0 for all a P F .
(iii) Integers with N pnq |n| (read ex 1 on p271).
Euclidean Domains
Definition. Let R be an integral domain. A norm is a function
N : R Ñ Z¥0 with N p0q 0.
If N paq ¡ 0 for all a 0, say N is a positive norm.
Definition. An integral domain R is a Euclidean Domain if there
is a norm N on R satisfying
for all a, b P R, b 0, there exists q, r PR
with
a qb r, where r 0 or N prq N pbq.
We call q the quotient and r the remainder of the division.
Ex: (i) Zrω s with N pn mω q |n2 m2 ω | only sometimes!!
(ii) Fields F with N paq 0 for all a P F .
(iii) Integers with N pnq |n| (read ex 1 on p271).
(iv) Zrxs with N pppxqq degpppxqq.
