[Math] Must an irreducible element in $\mathbb{Z}[\sqrt{D}]$ have a prime norm

algebraic-number-theorynotationnumber theory

Let $D\in \mathbb{Z}$ where $D$ is not a perfect square. Prove that if $\alpha\in \mathbb{Z}[\sqrt{D}]$, and $\alpha= a+b\sqrt{D}$ with: $|a^2-Db^2| = p$, a rational prime, then $\alpha$ is irreducible in $\mathbb{Z}[\sqrt{D}]$. Is the converse true?

So, for the if statement I figure I should assume $\alpha$ isn't irreducible, say $\alpha=\beta\gamma$ where they are not units, then $N(\beta)N(\gamma)=p$, but then I feel it is incorrect to assume a norm exists, because this would make it a Euclidean domain? is that the purpose of the absolute value?

Best Answer

If $\alpha$ is irreducible in $\mathbb{Z}[\sqrt{D}]$, is then $|\mathsf{N}(\alpha)| = p$ certain to be a prime number in $\mathbb{Z}$? (I'm stating the converse to make sure we're on the same page; if I've misunderstood what the converse is here then we'll never hear the end of it).

No. Consider $D = -10$. It turns out that $\sqrt{-10}$ is irreducible, yet it has a norm of 10. The formula for norm in this domain works out to be $$\mathsf{N}(a + b\sqrt{-10}) = a^2 - (-10)b^2 = a^2 + 10b^2.$$ That's all a norm is: a function that enables you to compare numbers from other domains within the familiar framework of $\mathbb{Z}^+ \bigcup \{0\}$. The Euclidean algorithm is another familiar thing from $\mathbb{Z}$, but, unlike the norm, it can't always be carried over.

The norm can never be a negative number here, so there's no need to specify absolute value (quite a different story if $D$ is positive). If $\sqrt{-10}$ is reducible, then we can solve $\mathsf{N}(\beta) = 2$ and $\mathsf{N}(\gamma) = 5$. Except we can't. The possible norms in this domain are 0, 1, 4, 9, 10, 11, 14, 16, 19, 25, ... (see Sloane's http://oeis.org/A020673). Either $\beta$ or $\gamma$ is a unit.

Two prior answerers already mentioned the norms of rational primes. I mention it again for the sake of completeness.