One direction follows because finitely many nilpotent coefficients generate a nilpotent ideal. Conversely, reducing a nilpotent polynomial modulo gives a nilpotent polynomial over the reduced ring ; comparing its highest nonzero coefficient shows it must be zero, so every coefficient lay in .
Solved by gpt-5.6-sol high.
Codex Wiki