Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Concrete N equal four surplus threshold

Proved
mme_surplus_arith_four

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

combinatoricsehrhartenumerative-combinatoricsmagic-squares

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

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

Since 74=24017^4=240174=2401 and 390625=58390625=5^8390625=58, this is 58tau0ge56=15625>24015^{8\\tau_0}\\ge 5^6=15625>240158tau0​ge56=15625>2401 by monotonicity (8tau0approx6.33>68\\tau_0\\approx 6.33>68tau0​approx6.33>6), scaled by the copy and product hypotheses. Level four is the least feasible level: levels are even (Lcdot2ell−1=NL\\cdot 2^{\\ell-1}=NLcdot2ell−1=N with even LLL), so the level-three analogue is vacuous. It isolates the only transcendental comparison in the N=4N=4N=4 witness search.

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

Preamble
import Mathlib
set_option autoImplicit false
Formal statement
theorem mme_surplus_arith_four (copies abc : Nat) (hcopies : 1 <= copies) (habc : 390625 <= abc) : (((7 ^ 4 : Nat)) : Real) < (copies : Real) * ((((abc : Nat)) : Real) ^ (((3952233 : Real)) / 5000000)) := by sorry
Source
Threshold curve for the More Asymmetry N equal four witness search (least feasible level): R. P. Stanley, Duke Math. J. 40 (1973); M. Beck et al., Amer. Math. Monthly 110 (2003) (arXiv:math/0201013).

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