N equal three step-boundary package with thresholds
Disprovedmme_numerical_package_step_boundaryThere is a level-three 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 .
This is the constructive core of the numerical surplus package, with the transcendental arithmetic factored out into the proved threshold lemma: three dimension- profiles give , and any step with entropy room for a copy combines with such a boundary through that lemma. It is stated without any analytic comparison, so its future proof is pure construction (profiles, grades, entropy counts).
Formalization Note The threshold and dimension expressions are copied verbatim from the numerical package statement so rewrites apply directly; Predicate, IntegerStep and BoundaryEnd resolve through the opened namespaces.
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
theorem mme_numerical_package_step_boundary : exists (lower : Nat) (P : Predicate 3) (S : IntegerStep lower 3 P) (B : BoundaryEnd lower 3 S.output) (copies : Nat), 0 < copies ∧ (((copies * 8 ^ S.repairExponent : Nat)) : Real) ≤ S.entropyLower ∧ 15625 ≤ B.a * B.b * B.c := by sorry