Ideals, quotient rings, prime & maximal ideals, CRT
Why this is asked: Prime ⇔ integral domain quotient, maximal ⇔ field quotient. CRT converts counting questions mod n into products over prime powers.
Prime vs maximal
For a commutative ring R with 1:
- I prime ⇔ R/I is an integral domain.
- I maximal ⇔ R/I is a field.
- maximal ⇒ prime; the converse fails: is prime domain) but not maximal.
- In a PID, non-zero prime ⇔ maximal.
Standard quotients
| Quotient | Is |
|---|---|
| 𝔽_p, so (X, p) is maximal | |
| 𝔽_p[X]/(f), f irreducible of degree n | 𝔽 |
| field ⇔ n prime |
Chinese remainder theorem
mn as rings. Consequences used constantly:
- Number of solutions of in , two roots each . is multiplicative; the number of units is . is a product of local rings; idempotents correspond to factorisations.
Nilpotents, units, idempotents
- x nilpotent ⇒ 1 + x is a unit.
- The nilradical is the intersection of all prime ideals. has non-trivial nilpotents ⇔ n is not squarefree.
- Fermat/Euler: ≡ 1 (mod n) for gcd(a, n) = 1; Wilson: (p−1)! ≡ −1 (mod p).
- Power sums: kᵐ ≡ −1 (mod p) if (p − 1) | m, and ≡ 0 otherwise.
Key takeaways
- Identify the quotient ring; prime/maximal follows instantly.
- Maximal ⇒ prime always; converse only in PIDs (and for non-zero ideals).
- CRT is the workhorse for every counting question modulo a composite.
See it move
The trap here
“Every prime ideal is maximal” — false
(X) in , or (0) in any integral domain that is not a field
is a domain but not a field. In a PID the implication does hold for non-zero primes.
Check yourself
The number of solutions of the equation in the ring is
Check yourself
Which one of the following is equal to in ?
Next: Euclidean, PID, UFD hierarchy
Create a free account to keep your place and have this feed your study plan.
Open this in the full syllabus view · Unit 2