N equal four step-boundary package with thresholds
Disprovedmme_numerical_package_step_boundary_fourcombinatoricsehrhartenumerative-combinatoricsmagic-squares
There is a level-four step-boundary package with room for a copy and product at least : some level, predicate, integer step, boundary over its output, and copy count with , and .
Level four is the least feasible level: levels are even ( with even ), so no level-three package exists, while four copies of a dimension- profile give . This is the constructive core of the numerical surplus package, with the transcendental arithmetic factored out into the proved threshold lemma.
Formalization Note The threshold and dimension expressions match the numerical package statement verbatim so rewrites apply directly.
Preamble
import Definitions.Def_mme_entropy_regional_CW_recipe import Definitions.Def_mme_integer_regional_CW_recipe import Definitions.Def_mme_regional_entropy_copy_bound import Definitions.Def_mme_recursive_profiled_CW_data open MME MME.ProfiledCW MME.RegionRealization set_option autoImplicit false
Formal statement
theorem mme_numerical_package_step_boundary_four : exists (lower : Nat) (P : Predicate 4) (S : IntegerStep lower 4 P) (B : BoundaryEnd lower 4 S.output) (copies : Nat), 0 < copies ∧ (((copies * 8 ^ S.repairExponent : Nat)) : Real) ≤ S.entropyLower ∧ 390625 ≤ B.a * B.b * B.c := by sorry
Source
N equal four step-boundary package for the numerical surplus (least feasible level): R. P. Stanley, Duke Math. J. 40 (1973); M. Beck et al., Amer. Math. Monthly 110 (2003) (arXiv:math/0201013). Companion to the proved N equal four surplus arithmetic.