Euclid–Euler theorem (characterization of even perfect numbers)
ProvedMersenneLPW.euclid_eulerLet be a natural number. Then is even and perfect — , , and the sum of the proper divisors of equals — if and only if there is a natural number such that is prime and
Writing , this is the classical statement that the even perfect numbers are exactly the numbers with a Mersenne prime. The forward implication (Euclid's construction) is Elements IX.36; the converse is Euler's theorem, read to the Berlin Academy in 1747 and published posthumously in 1849.
This characterization is the bridge between Mersenne primes and perfect numbers: it is the basis for the equivalence of their infinitude assertions in this mission.
Formalization Note. mersenne p = 2 ^ p - 1 is Mathlib's Mersenne number; Nat.Perfect n bundles the positivity requirement . The exponent is written rather than with , avoiding truncated natural-number subtraction; the statement mirrors Mathlib's Archive theorem Theorems100.Nat.even_and_perfect_iff.
import Mathlib
namespace MersenneLPW
theorem euclid_euler (n : ℕ) :
Even n ∧ Nat.Perfect n ↔
∃ k : ℕ, Nat.Prime (mersenne (k + 1)) ∧ n = 2 ^ k * mersenne (k + 1) := by sorry
end MersenneLPWConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.