One scale threshold supports all positive owner multipliers
Provedmme_released_interior_weighted_output_matrix_weight_ratematrix-multiplicationtensor-extraction
The complete permuted child matrix-weight bound holds at every positive integer multiple of every sufficiently large base scale. Its full boundary and interior rate formula is retained. The root exponent bound remains a separate obligation.
Preamble
import Theorems.Thm_mme_released_interior_permuted_output_matrix_weight_rate open MME MME.RecursiveYZ MME.ReleasedInterior MME.MoreAsymmetryExactSeed MME.CompleteSplit Filter open MME.RecursiveYZ.Boundary open scoped BigOperators universe u
Formal statement
theorem mme_released_interior_weighted_output_matrix_weight_rate
(delta : ℝ) (hdelta : 0 < delta) :
∀ᶠ k : ℕ in atTop, ∀ (multiplier : ℕ), 0 < multiplier → ∀ (owner : Fin 6) (s : Fin 45),
(seed owner s).boundary = [] →
∃ (nB nI : ℕ) (e : (Fin nB ⊕ Fin nI) ≃ Cell 4 6 (parent s))
(zB : Fin nB → Fin 3) (zI : Fin nI → Fin 3),
(∀ j, ((e (.inl j)).2.val (zB j)).val = 0) ∧
(∀ j i, ((e (.inr j)).2.val i).val = if i = zI j then 2 else 1) ∧
∃ B : ∀ r, Boundary.Profile 2
(splitCount owner s (e (.inl r)).1 (e (.inl r)).2 +
splitCount owner s (e (.inl r)).1 (complement (parent_total s (e (.inl r)).1) (e (.inl r)).2)),
(∀ r i w, integerProfile owner s i (e (.inl r)) w = (B r).mu (zB r) i w) ∧
∀ (n : Fin 6 → ℕ) (reference : Address 4 6 (parent s) n),
reference ∈ RecursiveXHash.target (fun r c => (2 * (k * multiplier)) * splitCount owner s r c) →
∀ (L N : ℕ) (positions : Fin L ≃ Position n)
(length : L * 2 ^ (2 - 1) = N) (sigma : Equiv.Perm (Fin 3)),
∀ (K : Type u) [Field K] (tau : ℝ), 0 ≤ tau →
∃ (copies : ℕ) (a b d : Fin copies → ℕ), 0 < copies ∧
TensorObj.Restrict
(TensorObj.bigAdd (fun j => MMObj K (a j) (b j) (d j)))
(sixSymmetrization (ProfiledCW.tensor K (fun i x =>
Graded (parent_total s) (sigma.symm i) reference (ProfiledCW.split positions length x) ∧
Useful (fullCell (parent_total s) reference)
(fun cell w => (2 * (k * multiplier)) * integerProfile owner s (sigma.symm i) cell w)
(ProfiledCW.split positions length x)))) ∧
Real.exp ((∑ r, 6 * tau * (((2 * (k * multiplier) : ℕ) : ℝ) *
(((splitCount owner s (e (.inl r)).1 (e (.inl r)).2 +
splitCount owner s (e (.inl r)).1 (complement (parent_total s (e (.inl r)).1) (e (.inl r)).2) : ℕ) : ℝ) *
Real.log 2 * mme_modern_entropyBits
(fun w ↦ ((B r).count w : ℝ) /
((splitCount owner s (e (.inl r)).1 (e (.inl r)).2 +
splitCount owner s (e (.inl r)).1 (complement (parent_total s (e (.inl r)).1) (e (.inl r)).2) : ℕ) : ℝ)) +
((∑ w, (B r).count w * ones w : ℕ) : ℝ) * Real.log 5 - delta))) + (∑ t,
let m := (k * multiplier) * ((seed owner s).region.getD (e (.inr t)).1.val 0 *
(splitWeight owner s (e (.inr t)).1 (e (.inr t)).2 +
splitWeight owner s (e (.inr t)).1 (complement (parent_total s (e (.inr t)).1) (e (.inr t)).2)) * denominator)
let N := denominator * m
let L := (2 * ((((seed owner s).children.find?
(fun a => a.1 == (e (.inr t)).1.val && a.2.1 == sourceShape owner (e (.inr t)).2)).getD (0, [], 0)).2.2)) * m
let G := (denominator - 2 * ((((seed owner s).children.find?
(fun a => a.1 == (e (.inr t)).1.val && a.2.1 == sourceShape owner (e (.inr t)).2)).getD (0, [], 0)).2.2)) * m
let p : ℝ :=
(((((seed owner s).children.find?
(fun a => a.1 == (e (.inr t)).1.val && a.2.1 == sourceShape owner (e (.inr t)).2)).getD
(0, [], 0)).2.2) : ℝ) / denominator
((4 * N : ℕ) : ℝ) *
(Real.log 2 * (mme_modern_entropyBits ![p, p, 1 - 2 * p] + 2) - delta) +
((6 * (4 * G + 2 * L) : ℕ) : ℝ) * tau * Real.log 5 )) ≤
∑ j, (((a j * b j * d j : ℕ) : ℝ) ^ tau) := by sorrySource
Checked tensor restrictions and released global histogram extraction.