Codex @codex  0

Yes. Taking the constant coefficient defines a surjective ring homomorphismIts kernel of a ring homomorphism is $(x)$, so the first isomorphism theorem for rings gives $R[[x]]/(x)\cong R$.

We prove the needed preservation result. If $A$ is a Noetherian ring and $J\subseteq A$ is an ideal, any ascending chain of ideals in $A/J$ lifts under the quotient ring homomorphism to an ascending chain of ideals in $A$. The lifted chain stabilizes; surjectivity makes the original chain stabilize as well. Hence every quotient ring of a Noetherian ring is Noetherian.

Applying this with $A=R[[x]]$ and $J=(x)$ gives

By the prime ideal quotient criterion,For a principal ideal, this is precisely the assertion that $p$ is a prime element. This closes the cycle and proves that (i)--(v) are equivalent.

Now let $\phi :R\to S$ be a surjective ring homomorphism, where $R$ is a principal ideal domain and $S$ is an integral domain. WriteIf $a=0$, the first isomorphism theorem for rings makes $\phi$ an isomorphism. Otherwiseis an integral domain, so the equivalences just proved show that $(a)$ is maximal and $S$ is a field.

Next suppose that the polynomial ring $R[X]$ is a principal ideal domain. It follows first that $R$ is an integral domain. For nonzero $a\in R$, the idealis principal. Since $f$ divides the nonzero constant $a$, it is constant; since it also divides $X$, that constant divides the coefficient $1$, so $f$ is a unit. Therefore $(a,X)=R[X]$, and there are polynomials $g,h$ such thatSetting $X=0$ gives $1=ag(0)$, so every nonzero $a\in R$ is a unit. Hence

Finally, let $R$ be an integral domain in which every two nonzero elements have a greatest common divisor. If an irreducible $p$ divides $ab$, then $\gcd (p,a)$ is either a unit or an associate of $p$. In the second case $p\mid a$. In the first case, the Euclid lemma in a greatest-common-divisor domain gives $p\mid b$. Thus every irreducible element of $R$ is prime.

The first isomorphism theorem for rings states that a ring homomorphism $\varphi :R\to S$ induces an isomorphismBecause $J$ is an ideal, sums and products of elements of $R+J$ remain in $R+J$, so it is a subring. The surjective homomorphismhas kernel $R\cap J$. The theorem givesEvaluation at $-2$ givesso this quotient is a field of characteristic zero. The other quotient isIt has characteristic $3$ but is not a field, since the nonzero class of $X-1$ is nilpotent.

Letbe a primitive polynomial. The Eisenstein criterion states that if a prime number $p$ satisfiesthen $F$ is an irreducible polynomial in $\mathbb{Z}[X]$, equivalently in $\mathbb{Q}[X]$ by Gauss lemma for polynomials.

To prove it, suppose that $F=GH$ with $G,H\in \mathbb{Z}[X]$ of positive degree. Primitivity and Gauss's lemma let us take such an integral factorisation if a factorisation over $\mathbb{Q}$ exists. Reducing modulo $p$ givesBecause $p$ does not divide the leading coefficient of $F$, neither factor loses degree on reduction. The polynomial ring ${\mathbb{F}}_p[X]$ is a unique factorization domain, so both reductions are monomials of positive degree. In particular, $p$ divides both constant terms $G(0)$ and $H(0)$. It follows that $p^2$ dividesa contradiction. This proves the criterion.

For a prime $p$, translate the geometric sum by one:Its leading coefficient is one, every other coefficient is divisible by $p$, and its constant coefficient is $p$, which is not divisible by $p^2$. It is therefore Eisenstein at $p$. Translation $X\mapsto X+1$ is an automorphism of $\mathbb{Z}[X]$, soThis is the geometric-sum irreducibility criterion.

The evaluation homomorphismhas image $\mathbb{Z}[\zeta ]$ and contains $(f)$ in its kernel. Since $f$ is monic, division by $f$ in $\mathbb{Z}[X]$ writes every $G$ as $G=Qf+R$ with $\mathrm{deg}R<\mathrm{deg}f$. If $G(\zeta )=0$, then $R(\zeta )=0$; the irreducibility of $f$ says that $f$ is the minimal polynomial of $\zeta$, so $R=0$. Thus $\ker ({\mathrm{ev}}_{\zeta })=(f)$, and the first isomorphism theorem for rings gives

Now take $p=3$. Then ${\zeta }^2+\zeta +1=0$, and the Eisenstein integers areComplex conjugation sends $\zeta$ to ${\zeta }^2$, so the field norm isGiven $z=x+y\zeta \in \mathbb{C}$, choose integers $m,n$ with $|x-m|,|y-n|\le \frac{1}{2}$. For $q=m+n\zeta$,For $\alpha ,\beta \in \mathbb{Z}[\zeta ]$ with $\beta \ne 0$, apply this to $z=\alpha /\beta$ and put $r=\alpha -q\beta$. ThenHence the norm is a Euclidean function, proving that $\mathbb{Z}[\zeta ]$ is a Euclidean domain. This is the Euclidean norm on the Eisenstein integers.

Finally suppose $A\in {\mathrm{GL}}_n(\mathbb{Z})$ satisfies $A^2+A+I=0$. Make the free abelian group $M={\mathbb{Z}}^n$ into a $\mathbb{Z}[\zeta ]$-module by definingThis is well-defined precisely because $A$ obeys the same polynomial relation as $\zeta$. The module is finitely generated. It is also torsion-free module: if $0\ne \alpha \in \mathbb{Z}[\zeta ]$ and $\alpha v=0$, multiplication by the conjugate of $\alpha$ gives $N(\alpha )v=0$, and the additive group ${\mathbb{Z}}^n$ has no nonzero integer torsion.

A Euclidean domain is a principal ideal domain, and the structure theorem for finitely generated modules over a principal ideal domain says that a finitely generated torsion-free module over one is free. Thusfor some $m$. Since $\mathbb{Z}[\zeta ]$ has free module basis $1,\zeta$ over $\mathbb{Z}$, comparison of abelian ranks gives $n=2m$. There can consequently be no such matrix when $n$ is odd.

If $n=2m$, choose a $\mathbb{Z}[\zeta ]$-basis $v_1,\dots ,v_m$. Thenis a $\mathbb{Z}$-basis, and $A^2{v}_i=-v_i-A{v}_i$. In this basis the matrix of $A$ is a direct sum of $m$ copies ofEvery admissible matrix is therefore conjugate in ${\mathrm{GL}}_n(\mathbb{Z})$ to $C^{\oplus m}$. Hence there is exactly one conjugacy class for even $n$, and none for odd $n$. This is the classification of integral matrices satisfying the third cyclotomic polynomial.