Released parent copies grow exponentially at cofinally many even multiples of a prescribed stride
Provedmme_released_116_cofinal_multiple_tensor_restriction_positive_copy_rateregional-extractiontensor-complexity
At every sufficiently small positive tolerance, cofinally many even multiples of any prescribed positive stride in the released 116 replications admit actual tensor restrictions with positive surviving copies and logarithmic copy count greater than k times the total regional size divided by 20. Exact output, repair bounds, and quantitative count bounds are retained.
Preamble
import Theorems.Thm_mme_regional_entropy_uniform_modulus import Theorems.Thm_mme_regional_mass_entropy_algebra import Theorems.Thm_mme_released_116_regional_split_mass import Definitions.Def_mme_regional_split_entropy_data import Theorems.Thm_mme_released_116_integer_profile_support import Definitions.Def_mme_recursive_thin_split_data import Mathlib.Order.ConditionallyCompleteLattice.Basic import Mathlib.Tactic.NormNum import Mathlib.Tactic.Linarith import Definitions.Def_mme_regional_entropy_copy_bound import Mathlib.Tactic.Ring import Definitions.Def_mme_recursive_region_parent_profiles import Mathlib.Algebra.Order.Field.Basic import Mathlib.Tactic.GCongr import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Topology.Instances.Real.Lemmas import Theorems.Thm_mme_regional_physical_hash_load_entropy_bounds import Theorems.Thm_mme_common_hash_scale_real_upper_bound import Theorems.Thm_mme_regional_target_entropy_bounds import Theorems.Thm_mme_entropy_retention_lower_bound import Mathlib import Theorems.Thm_mme_recursive_profiled_CW_exact_step import Definitions.Def_mme_recursive_profiled_CW_data 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_weighted_parent_center import Definitions.Def_mme_released_116_integer_profiles import Definitions.Def_mme_complete_split_concatenation import Mathlib.Data.Fintype.EquivFin 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 Mathlib.Analysis.SpecialFunctions.Log.Base import Definitions.Def_mme_recursive_yz_CW_cells import Mathlib.Tactic.Positivity open BigOperators MME MME.RegionRate MME.RecursiveThinSplit open BigOperators MME.RegionRate open MME.RecursiveYZ open scoped Classical open MME open BigOperators MME MME.RecursiveThinSplit open BigOperators MME MME.RegionRate open BigOperators MME MME.RecursiveYZ MME.RegionRealization open MME.RegionRate open BigOperators MME MME.RegionRate MME.RecursiveYZ open Filter open BigOperators MME MME.RegionRate MME.RegionRealization MME.RecursiveYZ MME.CompleteSplit 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 open Filter Topology open BigOperators MME MME.RegionRate MME.RegionRealization MME.RecursiveYZ open MME.CompleteSplit MME.ProfiledCW MME.RecursiveYZ.CWCells set_option autoImplicit false universe u
Formal statement
theorem mme_released_116_cofinal_multiple_tensor_restriction_positive_copy_rate
(stride : ℕ) (hstride : 0 < stride)
{KField : Type u} [Field KField] :
∃ eps0 : ℝ, 0 < eps0 ∧ ∀ eps : ℝ, 0 < eps → eps ≤ eps0 →
∃ d : ℕ, 1 < d ∧ ∀ K : ℕ,
∃ k : ℕ, K ≤ k ∧ 0 < k ∧ Even k ∧ stride ∣ 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,
0 < E.copies ∧
((∑ r, regionalSize r : ℕ) : ℝ) / 20 * (k : ℝ) < Real.log E.copies ∧
((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 + (1 / 80 : ℝ) * (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
Quantitative released parent survival and exact child extraction composition.