Section 13.6 A One-Sentence Proof
There is a completely different approach to this problem which has gained some notoriety. Often one wants multiple approaches in order to understand a problem more deeply; here, we have picked a geometric approach.
It happens that D. Zagier provided the culmination of a series of proofs using only sets and functions, and that proof takes only one sentence to write down! This is reproduced from the famous article [E.7.2] with the following title:
Proposition 13.6.1. A One-Sentence Proof that Every Prime \(p\equiv 1\) (mod \(4\)) is a Sum of Two Squares.
Proof.
The involution on the finite set
defined by
has exactly one fixed point, so \(|S|\) is odd and the involution defined by \((x,y,z)\to (x,z,y)\) also has a fixed point.
In Exercise Group 13.7.19–23, you will be asked to verify the various statements that this proof depends on. Although perhaps it is not the easiest single sentence after all, it is still fun – fun enough that you can watch a couple videos about it from Numberphile!