Cofinal released tensor restrictions with uniformly small repair rate
Provedmme_released_116_cofinal_tensor_restriction_uniform_repair_lossregional-extractiontensor-complexity
For every positive eta and histogram tolerance, one repair scale greater than one gives actual tensor restrictions at arbitrarily large positive replication sizes. The logarithmic repair budget is at most log 8 plus eta times the physical fine-coordinate count. The source grading and released histogram window, target reference, selected-count bound, explicit repair exponent, concrete child-profile output, tensor restriction over any field, and integer copy bound are retained. The repair scale is fixed before choosing the replication lower bound. Positive surviving copies and a positive selected-count exponent are not asserted.
Preamble
import Theorems.Thm_mme_recursive_profiled_CW_exact_step import Definitions.Def_mme_recursive_profiled_CW_data import Mathlib.Algebra.Order.Field.Basic import Mathlib.Tactic.NormNum import Mathlib.Tactic.Linarith import Mathlib.Algebra.Order.Archimedean.Basic 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.Data.Fintype.Sigma import Mathlib.Logic.Equiv.Fin.Basic import Theorems.Thm_mme_recursive_region_computed_hash_selection import Theorems.Thm_mme_recursive_region_derived_parent_hole_budget import Mathlib.Data.Nat.Log 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_boundary import Theorems.Thm_mme_released_116_integer_profile_mass import Theorems.Thm_mme_released_116_integer_profile_support import Mathlib.Analysis.SpecialFunctions.Log.Base import Mathlib.Tactic.Ring import Definitions.Def_mme_recursive_yz_CW_cells import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Tactic.Positivity open BigOperators MME MME.RecursiveYZ MME.RegionRealization open scoped Classical open MME.Released116 MME.MoreAsymmetryExactSeed MME.CompleteSplit open BigOperators MME MME.RecursiveYZ MME.RegionRealization MME.ProfiledCW MME.RecursiveYZ.Certificate MME.RecursiveYZ.CWCells open MME.ProfiledCW MME.RecursiveYZ.CWCells open MME MME.ProfiledCW open BigOperators MME MME.RecursiveYZ MME.RecursiveYZ.CWCells MME.CompleteSplit open MME.Released116 MME.MoreAsymmetryExactSeed set_option autoImplicit false universe u
Formal statement
theorem mme_released_116_cofinal_tensor_restriction_uniform_repair_loss
{KField : Type u} [Field KField] (eta : ℝ) (heta : 0 < eta) (eps : ℝ) (heps : 0 < eps) :
∃ d : ℕ, 1 < d ∧ ∀ K : ℕ,
∃ k : ℕ, K ≤ k ∧ 0 < k ∧
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
let keep := fun (i : Fin 2) (_ : Address 4 6 parent n) =>
parentTypical parent_total n m (mu (yzMode i)) eps
let Q := commonScale 4 (loadNum parent_total m d (fun i => mu (yzMode i)) keep) (loadDen m)
∃ (positions : Fin ((k * denominator ^ 4) * 2) ≃ Position n)
(reference : Address 4 6 parent n), reference ∈ RecursiveXHash.target m ∧
∃ E : ExactStep 2 ((k * denominator ^ 4) * 4) source,
((RecursiveXHash.target (n := n) m).card : ℝ) *
Real.exp (-4 * Real.sqrt (Real.log Q)) / (32 * Q) ≤ E.count ∧
E.stage.repairExponent = 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 : ℝ) ^ E.stage.repairExponent) ≤
Real.log 8 + eta * (4 * (k * denominator ^ 4) : ℕ) ∧
(E.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) ) ∧
TensorObj.Restrict
(TensorObj.bigAdd (fun _ : Fin E.copies => tensor KField E.output))
(tensor KField source) ∧
(((RecursiveXHash.target (n := n) m).card : ℝ) *
Real.exp (-4 * Real.sqrt (Real.log Q)) / (32 * Q)) /
(8 : ℝ) ^ E.stage.repairExponent - 1 < E.copies := by sorrySource
Selected-count logarithms and uniformly controlled repair for the concrete released regional extraction.