Concrete N equal three surplus threshold
Provedmme_surplus_arith_threecombinatoricsehrhartenumerative-combinatoricsmagic-squares
At level three, any witness with at least one copy and product at least satisfies the surplus inequality with room to spare: with ,
Since , this is : the case of the numerical surplus condition. The point is chosen so the comparison has roughly sixfold margin (), and therefore follows from crude monotonicity of and , with no sharp logarithm bounds. It isolates the only transcendental comparison in the witness search: whoever supplies a step with room for a copy and a boundary with product at least closes the surplus arithmetic through this lemma.
Formalization Note The proof factors and compares the exponent against ; 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.