Infinitude of Mersenne primes infinitude of even perfect numbers
ProvedMersenneLPW.infinitude_equivalenceThe set of exponents for which is prime is infinite if and only if the set of even perfect numbers is infinite. This is the precise form of the classical observation that the questions 'are there infinitely many Mersenne primes?' and 'are there infinitely many even perfect numbers?' are equivalent, via the one-to-one correspondence of the Euclid–Euler theorem. Both sides are open; the equivalence itself is a provable statement and records that the two formulations stand or fall together.
Formalization Note. The left-hand set is exactly the goal theorem's set (FCP.Mersenne.infinitely_many_mersenne_primes); mersenne p = 2 ^ p - 1; Nat.Perfect includes positivity; Even n is Mathlib's evenness predicate. The statement is an ↔ of two Set.Infinite claims, not a one-sided implication.
import Mathlib
namespace MersenneLPW
theorem infinitude_equivalence :
{p : ℕ | (mersenne p).Prime}.Infinite ↔ {n : ℕ | Even n ∧ Nat.Perfect n}.Infinite := by sorry
end MersenneLPWConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.