Recursive cell counts reduce to their two-half block
Provedmme_recursive_yz_count_full_cellmatrix-multiplicationtensor-extraction
Counting a full recursive cell is equivalent to counting its left and complemented right halves in the single parent region. The root exponent bound remains a separate obligation.
Preamble
import Definitions.Def_mme_recursive_yz_physical_words import Theorems.Thm_mme_recursive_yz_count_sigma_fiber open MME.RecursiveYZ
Formal statement
theorem mme_recursive_yz_count_full_cell
{half R : ℕ} {parent : Fin R → Fin 3 → ℕ} {n : Fin R → ℕ}
{W : Type*} (htotal : ∀ r, parent r 0 + parent r 1 + parent r 2 = 2 * half)
(a : Address half R parent n) (f : Position n → W)
(r : Fin R) (c : MME.RecursiveThinSplit.Split half (parent r)) (w : W) :
count (fullCell htotal a) f ⟨r,c⟩ w =
count (fun t : Fin (n r) × Fin 2 =>
if t.2 = 0 then a r t.1 else complement (htotal r) (a r t.1))
(fun t => f ⟨r,t⟩) c w := by sorrySource
Checked tensor restrictions and released global histogram extraction.