The Lenstra–Pomerance–Wagstaff asymptotic implies infinitude of Mersenne primes
ProvedMersenneLPW.lpw_implies_infinitudeIf the Mersenne exponent counting function satisfies the Lenstra–Pomerance–Wagstaff asymptotic
where is the Euler–Mascheroni constant, then there are infinitely many Mersenne primes. This lemma records that the LPW conjecture is a genuine strengthening of the mission's goal: the conjectured rate grows without bound, so it forces the exponent set to be infinite. The implication is provable; its hypothesis is the open LPW conjecture.
Formalization Note. Asymptotics.IsEquivalent Filter.atTop f g means along atTop (notated f ~[atTop] g); here and both functions are real-valued, with Real.logb 2 y and cast to . The counting function is the mission's definition MersenneLPW.mersenneExponentCount.
import Mathlib import Definitions.Def_MersenneLPW_mersenneExponentCount
namespace MersenneLPW
theorem lpw_implies_infinitude :
Asymptotics.IsEquivalent Filter.atTop
(fun y => (mersenneExponentCount y : ℝ))
(fun y => Real.exp Real.eulerMascheroniConstant * Real.logb 2 y) →
{p : ℕ | (mersenne p).Prime}.Infinite := by sorry
end MersenneLPWConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.