Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Concrete N equal three surplus threshold

Proved
mme_surplus_arith_three

by Tamas Fulop · Sep 22, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

combinatoricsehrhartenumerative-combinatoricsmagic-squares

At level three, any witness with at least one copy and product at least 156251562515625 satisfies the surplus inequality with room to spare: with tau0=3952233/5000000\\tau_0=3952233/5000000tau0​=3952233/5000000,

343<mathitcopiescdotmathitabctau0.343 < \\mathit{copies}\\cdot \\mathit{abc}^{\\tau_0}.343<mathitcopiescdotmathitabctau0​.

Since 73=3437^3=34373=343, this is 73<mathitcopiescdotmathitabctau07^3<\\mathit{copies}\\cdot\\mathit{abc}^{\\tau_0}73<mathitcopiescdotmathitabctau0​: the N=3N=3N=3 case of the numerical surplus condition. The point 15625=5615625=5^615625=56 is chosen so the comparison has roughly sixfold margin (15625tau0approx206515625^{\\tau_0}\\approx 206515625tau0​approx2065), and therefore follows from crude monotonicity of xmapstoxtau0x\\mapsto x^{\\tau_0}xmapstoxtau0​ and 54.74>54=6255^{4.74}>5^4=62554.74>54=625, with no sharp logarithm bounds. It isolates the only transcendental comparison in the N=3N=3N=3 witness search: whoever supplies a step with room for a copy and a boundary with product at least 156251562515625 closes the surplus arithmetic through this lemma.

Formalization Note The proof factors (56)tau0=56tau0(5^6)^{\\tau_0}=5^{6\\tau_0}(56)tau0​=56tau0​ and compares the exponent against 444; numeral casts are normalized by norm_num.

Preamble
import Mathlib
set_option autoImplicit false
Formal statement
theorem mme_surplus_arith_three (copies abc : Nat) (hcopies : 1 <= copies) (habc : 15625 <= abc) : (((7 ^ 3 : Nat)) : Real) < (copies : Real) * ((((abc : Nat)) : Real) ^ (((3952233 : Real)) / 5000000)) := by sorry
Source
Threshold curve for the More Asymmetry N equal three witness search: R. P. Stanley, Duke Math. J. 40 (1973); M. Beck et al., Amer. Math. Monthly 110 (2003) (arXiv:math/0201013). The comparison method (rational-power monotonicity) is standard.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me