Nilpotent polynomial (source code)

= Nilpotent polynomial
{wiki}

A <polynomial> $f\in R[X]$ over a <commutative ring> is a <nilpotent element> if $f^N=0$ for some positive <integer> $N$. This happens exactly when all its coefficients are <nilpotent elements> of $R$. For example, $2+2X$ is a <nilpotent polynomial> in $(\mathbb Z/4\mathbb Z)[X]$, since its square is zero.

If the finitely many coefficients satisfy $a_i^{e_i}=0$, every product of more than $\sum_i(e_i-1)$ coefficients contains a vanishing factor, proving one direction. Conversely, reduce $f$ modulo any <prime ideal>: the resulting <polynomial ring> is an <integral domain>, so a nilpotent image must be zero. Each coefficient therefore belongs to every <prime ideal>, hence to the <nilradical>. In particular a <polynomial ring> over a <reduced ring> is reduced.