A quotient by an irreducible polynomial is a field. What changes if the modulus is a power of that polynomial? The result still remembers a field after a further reduction, and when the exponent is greater than one it also has nonzero nilpotents and a particularly simple chain of ideals. We derive these properties using polynomial division, Bézout and the ideal correspondence.
Throughout, is a field, is monic and irreducible of positive degree , and . Put
Polynomial division gives unique representatives of degree below . When , is a field; when , the class is nonzero because , but .
Definition 2.3.1
(Nilpotent element)
An element of a commutative ring is nilpotent if for some integer . A nonzero nilpotent is a zero divisor: if is minimal with , then with .
Units and nilpotents
Theorem 2.3.2
(Units, nilpotents and reduction modulo )
In , the class is a unit if and only if , and is nilpotent if and only if . In particular every class is a unit or nilpotent, never both. Reduction modulo ,
is a well-defined surjective homomorphism onto a field, with kernel , the ideal of nilpotents.
Proof
(Bézout for units, primality for nilpotents)
Units: if , irreducibility makes . Bézout gives , so is an inverse. Conversely, if , an inverse would give for some polynomials , forcing , impossible. This works for any representative: adding a multiple of does not change whether divides it.
Nilpotents: if , then , so . Conversely, if for some , then . In particular , and irreducibility implies that is prime in ; hence .
Reduction: is well defined because divisibility by implies divisibility by , and it is clearly onto. Its kernel consists of the classes with , that is the ideal . When , this kernel is zero.
Proof X-ray
Where irreducibility enters
Irreducibility is used twice, at two different strengths. For units it gives whenever , which is what makes Bézout available; the converse direction needs nothing beyond and . For nilpotents it is used as primality: forces , so one factor of in a power already shows divisibility of itself. The exponent plays no role in either characterization: the dichotomy depends only on whether divides , and only decides how many powers of are needed to reach zero. Without irreducibility, the dichotomy "unit or nilpotent" fails, as the example below shows.
Counterexample mode
A reducible modulus gives zero divisors that are not nilpotent
Claim: for any monic , the class in is a unit when . Take and with . The class is not divisible by , yet with , so is a zero divisor and not a unit. It is not nilpotent either: is never divisible by , hence never by . So this ring has classes that are neither units nor nilpotents. The proof fails at "irreducibility makes ": here .
Common mistake
(A polynomial and its class are different objects)
In the class is nonzero but . Writing "" about the polynomial is wrong: is nonzero in and becomes zero only after passing to the quotient. When deciding whether a class is a unit or nilpotent, test the divisibility on any representative, not the vanishing of the polynomial.
Quick check
(In , is a unit or nilpotent? Compute its cube to confirm.)
Check whether divides the representative.
Solution · Answer
Here and , so the class is nilpotent. Indeed is a multiple of , so .
Quick check
(How many units and how many nilpotents does have?)
Write each class as and test divisibility by .
Solution · Answer
There are classes . The nilpotents are those with , namely of them; the other (those with ) are units.
Every ideal is on one chain
Theorem 2.3.3
(The ideals of )
Every ideal of equals for exactly one , and these ideals form the strictly decreasing chain . If , the ideal has elements.
Proof
(Ideal correspondence, strictness and counting)
Let be the quotient map, and let be an ideal of . Its preimage is an ideal of containing , so it is for some polynomial dividing . Unique factorization makes a nonzero scalar times for one . Therefore .
Each inclusion is strict: for , the class cannot lie in , because that would make and hence , impossible by degree.
Counting: the map is onto the ideal and is well defined. It is injective: if , cancellation in the integral domain gives . The source has elements by the division algorithm: it has unique representatives of degree below . For the source is the zero quotient and the ideal contains one element.
Worked examples
Worked example 2.3.4
(A truncated polynomial ring over )
In , every class is uniquely , so . The ideals are
The nilpotents are exactly the nine classes with ; the remaining 18 are units. For example because their product is . The class is nonzero and has cube zero.
Worked example 2.3.5
(A repeated factor of degree 2 over )
Let , irreducible over because it has no root in (), so . Take : (characteristic 2) and . The nilpotents are the classes with , namely , so there are , and the remaining classes are units. For instance , since . The ideals have sizes , that is for .
Worked example 2.3.6
(The degenerate case )
For the chain of ideals is , so has only the two trivial ideals; this agrees with being a field. Every nonzero class is a unit, the kernel of is zero and is an isomorphism. For example, with over and , has elements, all nonzero ones being units.
Quick check
(Why is every element of either a unit or nilpotent, and why is this impossible for over ?)
Compare the two alternatives " divides " and " does not divide ".
Solution · Answer
For a power of an irreducible , either (nilpotent) or (then and the class is a unit). For a polynomial can fail to be divisible by the modulus without being coprime to it, as shows, so the class is neither.