Prime Number iff Generates Principal Maximal Ideal
Theorem
Let $\Z_{>0}$ be the set of strictly positive integers.
Let $p \in \Z_{>0}$.
Let $\ideal p$ be the principal ideal of $\Z$ generated by $p$.
Then $p$ is prime if and only if $\ideal p$ is a maximal ideal of $\Z$.
Proof
First, note that $\Z$ is a principal ideal domain, so all ideals are principal.
Sufficient Condition
Suppose $p$ is prime.
From Integer Divisor is Equivalent to Subset of Ideal, $m \divides n \iff \ideal n \subseteq \ideal m$.
But as $p$ is prime, the only divisors of $p$ are $1$ and $p$ itself.
By Natural Numbers Set Equivalent to Ideals of Integers, it follows that if $p$ is prime, then $\ideal p$ must be a maximal ideal.
$\Box$
Necessary Condition
Let $p \in \Z_{>0}$ such that $\ideal p$ is maximal.
Let $q \in \Z_{>0}$ be a divisor of $p$.
Then:
\(\ds q\) | \(\divides\) | \(\ds p\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds \ideal p\) | \(\subseteq\) | \(\ds \ideal q\) | Integer Divisor is Equivalent to Subset of Ideal | ||||||||||
\(\ds \leadsto \ \ \) | \(\ds \ideal q\) | \(=\) | \(\ds \ideal 1\) | Definition of Maximal Ideal of Ring | ||||||||||
\(\, \ds \lor \, \) | \(\ds \ideal q\) | \(=\) | \(\ds \ideal p\) | |||||||||||
\(\ds \leadsto \ \ \) | \(\ds q\) | \(=\) | \(\ds 1\) | |||||||||||
\(\, \ds \lor \, \) | \(\ds q\) | \(=\) | \(\ds p\) |
Thus $p$ is prime.
$\blacksquare$
Sources
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text {IV}$: Rings and Fields: $24$. The Division Algorithm: Theorem $24.5$
- 1969: C.R.J. Clapham: Introduction to Abstract Algebra ... (previous) ... (next): Chapter $5$: Rings: $\S 23$. Maximal Ideals: Example $41$
- 2007: Svetlana Katok: p-adic Analysis Compared with Real ... (previous) ... (next): $\S 1.8$ Algebraic properties of $p$-adic integers