This is a secondary supplemental note on the Gaussian integers, written for my Spring 2016 Elementary Number Theory Class at Brown University. This note is also available as a pdf document.

In this note, we cover the following topics.

- Assumed prerequisites from other lectures.
- Which regular integer primes are sums of squares?
- How can we classify all Gaussian primes?

**1. Assumed Prerequisites **

Although this note comes shortly after the previous note on the Gaussian integers, we covered some material from the book in the middle. In particular, we will assume use the results from chapters 20 and 21 from the textbook.

Most importantly, for $latex {p}$ a prime and $latex {a}$ an integer not divisible by $latex {p}$, recall the Legendre symbol $latex {\left(\frac{a}{p}\right)}$, which is defined to be $latex {1}$ if $latex {a}$ is a square mod $latex {p}$ and $latex {-1}$ if $latex {a}$ is not a square mod $latex {p}$. Then we have shown Euler’s Criterion, which states that

$$ a^{\frac{p-1}{2}} \equiv \left(\frac{a}{p}\right) \pmod p, \tag{1}$$

and which gives a very efficient way of determining whether a given number $latex {a}$ is a square mod $latex {p}$.

We used Euler’s Criterion to find out exactly when $latex {-1}$ is a square mod $latex {p}$. In particular, we concluded that for each odd prime $latex {p}$, we have

$$ \left(\frac{-1}{p}\right) = \begin{cases} 1 & \text{ if } p \equiv 1 \pmod 4 \ -1 & \text{ if } p \equiv 3 \pmod 4 \end{cases}. \tag{2}$$

Finally, we assume familiarity with the notation and ideas from the previous note on the Gaussian integers.

**2. Understanding When $latex {p = a^2 + b^2}$. **

Throughout this section, $latex {p}$ will be a normal odd prime. The case $latex {p = 2}$ is a bit different, and we will need to handle it separately. When used, the letters $latex {a}$ and $latex {b}$ will denote normal integers, and $latex {q_1,q_2}$ will denote Gaussian integers.

We will be looking at the following four statements.

- $latex {p \equiv 1 \pmod 4}$
- $latex {\left(\frac{-1}{p}\right) = 1}$
- $latex {p}$ is
*not*a Gaussian prime - $latex {p = a^2 + b^2}$

Our goal will be to show that each of these statements are equivalent. In order to show this, we will show that

$$ (1) \implies (2) \implies (3) \implies (4) \implies (1). \tag{3}$$

Do you see why this means that they are all equivalent?

This naturally breaks down into four lemmas.

We have actually already shown one.

Lemma 1$latex {(1) \implies (2)}$.

*Proof:* We have already proved this claim! This is exactly what we get from Euler’s Criterion applied to $latex {-1}$, as mentioned in the first section. $latex \Box$

There is one more that is somewhat straightfoward, and which does not rely on going up to the Gaussian integers.

Lemma 2$latex {(4) \implies (1)}$.

*Proof:* We have an odd prime $latex {p}$ which is a sum of squares $latex {p = a^2 + b^2}$. If we look mod $latex {4}$, we are led to consider $$ p = a^2 + b^2 \pmod 4. \tag{4}$$

What are the possible values of $latex {a^2 \pmod 4}$? A quick check shows that the only possibilites are $latex {a^2 \equiv 0, 1 \pmod 4}$.

So what are the possible values of $latex {a^2 + b^2 \pmod 4}$? We must have one of $latex {p \equiv 0, 1, 2 \pmod 4}$. Clearly, we cannot have $latex {p \equiv 0 \pmod 4}$, as then $latex {4 \mid p}$. Similarly, we cannot have $latex {p \equiv 2 \pmod 4}$, as then $latex {2 \mid p}$. So we necessarily have $latex {p \equiv 1 \pmod 4}$, which is what we were trying to prove. $latex \Box$

For the remaining two pieces, we will dive into the Gaussian integers.

Lemma 3$latex {(2) \implies (3)}$.

*Proof:* As $latex {\left(\frac{-1}{p}\right) = 1}$, we know there is some $latex {a}$ so that $latex {a^2 \equiv -1 \pmod p}$. Rearranging, this becomes $latex {a^2 + 1 \equiv 0 \pmod p}$.

Over the normal integers, we are at an impasse, as all this tells us is that $latex {p \mid (a^2 + 1)}$. But if we suddenly view this within the Gaussian integers, then $latex {a^2 + 1}$ factors as $latex {a^2 + 1 = (a + i)(a – i)}$.

So we have that $latex {p \mid (a+i)(a-i)}$. If $latex {p}$ were a Gaussian prime, then we would necessarily have $latex {p \mid (a+i)}$ or $latex {p \mid (a-i)}$. (Do you see why?)

But is it true that $latex {p}$ divides $latex {a + i}$ or $latex {a – i}$? For instance, does $latex {p}$ divide $latex {a + i}$? No! If so, then $latex {\frac{a}{p} + \frac{i}{p}}$ would be a Gaussian integer, which is clearly not true.

So $latex {p}$ does not divide $latex {a + i}$ or $latex {a-i}$, and we must therefore conclude that $latex {p}$ is not a Gaussian prime. $latex \Box$

Lemma 4$latex {(3) \implies (4)}$.

*Proof:* We now know that $latex {p}$ is not a Gaussian prime. In particular, this means that $latex {p}$ is not irreducible, and so it has a nontrivial factorization in the Gaussian integers. (For example, $latex {5}$ is a regular prime, but it is not a Gaussian prime. It factors as $latex {5 = (1 + 2i)(1 – 2i)}$ in the Gaussian integers.)

Let’s denote this nontrivial factorization as $latex {p = q_1 q_2}$. By nontrivial, we mean that neither $latex {q_1}$ nor $latex {q_2}$ are units, i.e. $latex {N(q_1), N(q_2) > 1}$. Taking norms, we see that $latex {N(p) = N(q_1) N(q_2)}$.

We can evaluate $latex {N(p) = p^2}$, so we have that $latex {p^2 = N(q_1) N(q_2)}$. Both $latex {N(q_1)}$ and $latex {N(q_2)}$ are integers, and their product is $latex {p^2}$. Yet $latex {p^2}$ has exactly two different factorizations: $latex {p^2 = 1 \cdot p^2 = p \cdot p}$. Since $latex {N(q_1), N(q_2) > 1}$, we must have the latter.

So we see that $latex {N(q_1) = N(q_2) = p}$. As $latex {q_1, q_2}$ are Gaussian integers, we can write $latex {q_1 = a + bi}$ for some $latex {a, b}$. Then since $latex {N(q_1) = p}$, we see that $latex {N(q_1) = a^2 + b^2}$. And so $latex {p}$ is a sum of squares, ending the proof. $latex \Box$

Notice that $latex {2 = 1 + 1}$ is also a sum of squares. Then all together, we can say the following theorem.

Theorem 5A regular prime $latex {p}$ can be written as a sum of two squares, $$ p = a^2 + b^2, \tag{5}$$

exactly when $latex {p = 2}$ or $latex {p \equiv 1 \pmod 4}$.

A remarkable aspect of this theorem is that it is entirely a statement about the behaviour of the regular integers. Yet in our proof, we used the Gaussian integers in a very fundamental way. Isn’t that strange?

You might notice that in the textbook, Dr. Silverman presents a proof that does not rely on the Gaussian integers. While interesting and clever, I find that the proof using the Gaussian integers better illustrates the deep connections between and around the structures we have been studying in this course so far. Everything connects!

Example 1The prime $latex {5}$ is $latex {1 \pmod 4}$, and so $latex {5}$ is a sum of squares. In particular, $latex {5 = 1^2 + 2^2}$.

Example 2The prime $latex {101}$ is $latex {1 \pmod 4}$, and so is a sum of squares. Our proof is not constructive, so a priori we do not know what squares sum to $latex {101}$. But in this case, we see that $latex {101 = 1^2 + 10^2}$.

Example 3The prime $latex {97}$ is $latex {1 \pmod 4}$, and so it also a sum of squares. It’s less obvious what the squares are in this case. It turns out that $latex {97 = 4^2 + 9^2}$.

Example 4The prime $latex {43}$ is $latex {3 \pmod 4}$, and so is not a sum of squares.

**3. Classification of Gaussian Primes **

In the previous section, we showed that each integer prime $latex {p \equiv 1 \pmod 4}$ actually splits into a product of two Gaussian numbers $latex {q_1}$ and $latex {q_2}$. In fact, since $latex {N(q_1) = p}$ is a regular prime, $latex {q_1}$ is a Gaussian irreducible and therefore a Gaussian prime (can you prove this? This is a nice midterm question.)

So in fact, $latex {p \equiv 1 \pmod 4}$ splits in to the product of two Gaussian primes $latex {q_1}$ and $latex {q_2}$.

In this way, we’ve found infinitely many Gaussian primes. Take a regular prime congruent to $latex {1 \pmod 4}$. Then we know that it splits into two Gaussian primes. Further, if we know how to write $latex {p = a^2 + b^2}$, then we know that $latex {q_1 = a + bi}$ and $latex {q_2 = a – bi}$ are those two Gaussian primes.

In general, we will find all Gaussian primes by determining their interaction with regular primes.

Suppose $latex {q}$ is a Gaussian prime. Then on the one hand, $latex {N(q) = q \overline{q}}$. On the other hand, $latex {N(q) = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}}$ is some regular integer. Since $latex {q}$ is a Gaussian prime (and so $latex {q \mid w_1 w_2}$ means that $latex {q \mid w_1}$ or $latex {q \mid w_2}$), we know that $latex {q \mid p_j}$ for some regular integer prime $latex {p_j}$.

So one way to classify Gaussian primes is to look at every regular integer prime and see which Gaussian primes divide it. We have figured this out for all primes $latex {p \equiv 1 \pmod 4}$. We can handle $latex {2}$ by noticing that $latex {2 = (1 + i) (1-i)}$. Both $latex {(1+i)}$ and $latex {(1-i)}$ are Gaussian primes.

The only primes left are those regular primes with $latex {p \equiv 3 \pmod 4}$. We actually already covered the key idea in the previous section.

Lemma 6If $latex {p \equiv 3 \pmod 4}$ is a regular prime, then $latex {p}$ is also a Gaussian prime.

*Proof:* In the previous section, we showed that if $latex {p}$ is not a Gaussian prime, then $latex {p = a^2 + b^2}$ for some integers $latex {a,b}$, and then $latex { p \equiv 1 \pmod 4}$. Since $latex {p \not \equiv 1 \pmod 4}$, we see that $latex {p}$ is a Gaussian prime. $latex \Box$

In total, we have classified all Gaussian primes.

Theorem 7The Gaussian primes are given by

- $latex {(1+i), (1-i)}$
- Regular primes $latex {p \equiv 3 \pmod 4}$
- The factors $latex {q_1 q_2}$ of a regular prime $latex {p \equiv 1 \pmod 4}$. Further, these primes are given by $latex {a \pm bi}$, where $latex {p = a^2 + b^2}$.

**4. Concluding Remarks **

I hope that it’s clear that the regular integers and the Gaussian integers are deeply connected and intertwined. Number theoretic questions in one constantly lead us to investigate the other. As one dives deeper into number theory, more and different integer-like rings appear, all deeply connected.

Each time I teach the Gaussian integers, I cannot help but feel the sense that this is a hint at a deep structural understanding of what is really going on. The interplay between the Gaussian integers and the regular integers is one of my favorite aspects of elementary number theory, which is one reason why I deviated so strongly from the textbook to include it. I hope you enjoyed it too.