Released 116 profiles form a concrete graded integer recipe step
Provedmme_released_116_graded_integer_step_with_repair_scaleregional-extractiontensor-complexity
At any admissible positive replication scale and repair scale, the released integer profiles form an IntegerStepG over the actual graded histogram source. The exact certified logarithmic copy formula and graded/useful output profile are retained.
Preamble
import Theorems.Thm_mme_released_116_scaled_reference_exists import Theorems.Thm_mme_released_116_scaled_integer_divisibility import Theorems.Thm_mme_released_116_integer_profile_mass import Theorems.Thm_mme_released_116_integer_profile_support import Theorems.Thm_mme_released_116_integer_profile_boundary import Definitions.Def_mme_graded_integer_regional_step_data import Definitions.Def_mme_recursive_profiled_CW_data import Mathlib.Logic.Equiv.Prod import Mathlib.Tactic.FinCases import Theorems.Thm_mme_released_116_regional_total import Theorems.Thm_mme_released_116_regional_split_mass import Theorems.Thm_mme_released_116_weighted_parent_center import Definitions.Def_mme_released_116_integer_profiles import Definitions.Def_mme_complete_split_concatenation import Mathlib.Data.Fintype.EquivFin import Definitions.Def_mme_recursive_region_parent_profiles import Mathlib.Algebra.Order.Field.Basic import Mathlib.Data.Fintype.Sigma import Mathlib.Logic.Equiv.Fin.Basic open BigOperators MME MME.RecursiveYZ MME.RegionRealization open scoped Classical open MME.Released116 MME.MoreAsymmetryExactSeed MME.CompleteSplit open MME.RegionRate MME.ProfiledCW MME.RecursiveYZ.CWCells set_option autoImplicit false universe u
Formal statement
theorem mme_released_116_graded_integer_step_with_repair_scale
(d : ℕ) (hd : 1 < d) (k : ℕ) (hk : 0 < k) (eps : ℝ) (heps : 0 < eps)
(hscale : (8 * d : ℝ) * (25 * 6 * (Fintype.card (CompleteWord 2) : ℝ) ^ 2) ≤
(k * denominator ^ 2 : ℕ) * eps ^ 2) :
let n := fun r : Fin 6 => k * regionalSize r
let m := fun r c => k * splitCount r c
let mu := fun i c w => k * integerProfile i c w
let source : Predicate ((k * denominator ^ 4) * 4) := fun i x =>
(∀ p : Fin (k * denominator ^ 4),
(∑ q, (ProfiledCW.split (ell := 3) (Equiv.refl _) rfl x p q).val) = parent 0 i) ∧
∀ w : CompleteWord 3,
|(Fintype.card {p : Fin (k * denominator ^ 4) //
ProfiledCW.split (ell := 3) (Equiv.refl _) rfl x p = w} : ℝ) /
(k * denominator ^ 4 : ℕ) -
((((ReleasedGlobal.jointRows 0 10).map
(fun p => if ReleasedGlobal.atom p.1 i = w then p.2 else 0)).sum : ℕ) : ℝ) /
(denominator : ℝ) ^ 4| ≤ eps
∃ (positions : Fin ((k * denominator ^ 4) * 2) ≃ Position n)
(reference : Address 4 6 parent n), reference ∈ RecursiveXHash.target m ∧
∃ D : IntegerStepG 2 ((k * denominator ^ 4) * 4) source,
D.step.certifiedLogCopies =
regionalRate parent_total n m mu - ((∑ r, n r : ℕ) : ℝ) *
entropyModulus (Fin 2 → CompleteWord 2) eps -
4 * Real.sqrt (Real.log (scaleFactor (half := 4) (parent := parent) n d 2) +
scaleExponent parent_total n m mu eps) -
Real.log (64 * polynomialFactor n (Fintype.card (Cell 4 6 parent)) *
scaleFactor (half := 4) (parent := parent) n d 2) -
((Nat.log d (∏ i : Fin 3, Nat.card (Block 2 (fullCell parent_total reference)
(fun c i => (c.2.val i).val) mu i)) + 1 : ℕ) : ℝ) * Real.log 8 ∧
D.step.output = fun i x => Graded parent_total i reference
(ProfiledCW.split (ell := 2) positions (by omega) x) ∧
Useful (fullCell parent_total reference) (mu i)
(ProfiledCW.split (ell := 2) positions (by omega) x) := by sorrySource
Released 116 recursive recipe interface: parent-grade source inclusion, concrete integer-step data, certified entropy budgets, and cofinal asymptotic growth.