Suppose that $p$ is a prime of the form $4k + 1$. I'm trying to prove that there exist nonzero integers $a$ and $b$ such that $p^2 = a^2 + b^2$.
I begin by noting that $p$ itself can be written as the sum of two squares, since it does not have any prime factors of the form $4k+3$ (this is a theorem from my discrete math textbook: a positive integer $n$ can be represented as the sum of two squares if and only if every prime divisor of $n$ of the form $4k+3$ appears in the canonical representation of $n$ with an even exponent).
We thus have $p=u^2+v^2$, and $p^2 = u^4+2u^2v^2+v^4$. I now need to prove that the right-hand side is the sum of two squares, but I'm lost. Obviously, it can be written as the sum of four squares, but that's not what I'm trying to show. Any hint or nudge in the right direction would be appreciated.