Rational primes that stay prime in ℤ[i]
ProvedFamousTheorems.gaussian_int_prime_iff_mod_fourRational primes that stay prime in . Let be a prime number. Then remains prime in the Gaussian integers if and only if .
The primes split as , and ramifies. This is equivalent to Fermat's two-squares theorem. It is the first example of the decomposition of primes in a number field, and it determines all Gaussian primes up to units.
Formalization note. Mathlib's GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime. GaussianInt is , implemented as ℤ√-1, and Prime is primality in a commutative monoid.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem gaussian_int_prime_iff_mod_four (p : ℕ) [Fact p.Prime] : Prime (p : GaussianInt) ↔ p % 4 = 3 := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `GaussianInt.prime_iff_mod_four_eq_three_of_nat_prime`. Proof here reduces to that Mathlib result.