Joint successor counts retain the pooled entropy rate
Provedmme_released_joint_interior_eventual_entropy_copy_ratematrix-multiplicationtensor-extraction
The exact joint hashing steps approach the regional entropy rate formed by pooling all 270 labels before the three-direction minimum. Window, coordinate repair, and asymptotic losses remain explicit; the successor count also covers nonpositive rates. The root exponent bound remains a separate obligation.
Preamble
import Theorems.Thm_mme_released_joint_interior_eventual_coordinate_repair import Theorems.Thm_mme_regional_entropy_expression_log_rate import Theorems.Thm_mme_regional_physical_entropy_selected_bound open scoped BigOperators open MME MME.ReleasedJointInterior MME.RecursiveYZ MME.RegionRealization open MME.ProfiledCW MME.CompleteSplit MME.MoreAsymmetryExactSeed open MME.RecursiveYZ.Certificate MME.RecursiveYZ.CWCells MME.RegionRate Filter Topology
Formal statement
theorem mme_released_joint_interior_eventual_entropy_copy_rate
(eta : ℝ) (heta : 0 < eta) (loss : ℝ) (hloss : 0 < loss)
(eps : ℝ) (heps : 0 < eps) :
∃ d : ℕ, 1 < d ∧ ∀ᶠ k : ℕ in atTop, ∀ r : Fin 6,
let keep := fun (i : Fin 2)
(_ : RecursiveXHash.Address 4 270 (parent r) (size r k)) =>
parentTypical (parent_total r) (size r k) (splitCount r k)
(integerProfile r k (yzMode i)) eps
let Q := commonScale 4
(loadNum (parent_total r) (splitCount r k) d
(fun i => integerProfile r k (yzMode i)) keep) (loadDen (splitCount r k))
∃ reference : RecursiveXHash.Address 4 270 (parent r) (size r k),
reference ∈ RecursiveXHash.target (n := size r k) (splitCount r k) ∧
∃ E : ExactStep 2 (blocks r k * 4) (gradedSource r k eps),
((RecursiveXHash.target (n := size r k) (splitCount r k)).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 r) reference)
(fun c i => (c.2.val i).val) (integerProfile r k) i)) + 1 ∧
(E.output = fun i x =>
Graded (parent_total r) i reference
(ProfiledCW.split (positions r k) (positions_length r k) x) ∧
Useful (fullCell (parent_total r) reference) (integerProfile r k i)
(ProfiledCW.split (positions r k) (positions_length r k) x)) ∧
Real.log ((8 : ℝ) ^ E.stage.repairExponent) ≤
Real.log 8 + eta * (blocks r k * 4 : ℕ) ∧
(regionalRate (parent_total r) (size r 1) (splitCount r 1)
(integerProfile r 1) - (blocks r 1 : ℝ) *
entropyModulus (Fin 2 → CompleteWord 2) eps -
4 * eta * (blocks r 1 : ℝ) - loss) * (k : ℝ) <
Real.log (E.copies + 1 : ℕ) := by sorrySource
Checked tensor restrictions and released global histogram extraction.