Cofinal matrix extractions from every canonical released 112 child tensor
Provedmme_released_interior_112_cofinal_canonical_matrix_extractionmatrix-multiplicationregional-extraction
Every released 112 child, including zero parameters and every high-coordinate placement, has cofinal matrix extractions from the cyclic symmetrization of its exact canonical-order tensor. The theorem retains positive copies, both directional family estimates, the explicit copy lower bound and the cubed matrix-volume identity. Transport to the original physical cell order remains separate. The full matrix exponent bound remains a separate obligation.
Preamble
import Theorems.Thm_mme_released_interior_112_intact_family_certificate import Theorems.Thm_mme_released_interior_112_cofinal_induced_families import Theorems.Thm_mme_Ctensor_one_H_one_outer_family_direct_finite_extraction import Mathlib.Tactic.FinCases open MME MME.RecursiveYZ MME.ReleasedInterior MME.MoreAsymmetryExactSeed MME.CompleteSplit Filter universe u
Formal statement
theorem mme_released_interior_112_cofinal_canonical_matrix_extraction
(owner : Fin 6) (s : Fin 45) (r : Fin 6) (c : Split s) (z : Fin 3)
(hshape : ∀ i : Fin 3, (c.val i).val = if i = z then 2 else 1) :
∃ C : ℝ, 0 ≤ C ∧ ∀ᶠ m : ℕ in atTop,
let N := denominator * m
let L := (2 * ((((seed owner s).children.find?
(fun a => a.1 == r.val && a.2.1 == sourceShape owner c)).getD (0, [], 0)).2.2)) * m
let G := (denominator - 2 * ((((seed owner s).children.find?
(fun a => a.1 == r.val && a.2.1 == sourceShape owner c)).getD (0, [], 0)).2.2)) * m
∃ A H : ℕ, ∃ _family : CWQ6PrimaryHashFamily N L G A H,
0 < A ∧ H ≤ 4 ^ N ∧
((Nat.choose (2 * N) L * Nat.choose (2 * N - L) L : ℕ) : ℝ) *
Real.exp (-C * Real.sqrt ((N + 1 : ℕ) : ℝ)) ≤ (A : ℝ) ∧
(Nat.choose (2 * N) N : ℝ) *
Real.exp (-2 * C * Real.sqrt ((N + 1 : ℕ) : ℝ)) ≤ 4 * (A : ℝ) * (H : ℝ) ∧
∀ (K : Type u) [Field K], ∃ (k : ℕ) (a b d : Fin k → ℕ),
0 < k ∧
TensorObj.Restrict (TensorObj.bigAdd (fun j => MMObj K (a j) (b j) (d j)))
(cyclicSymmetrization
(CWCells.unbroken K 5 2 (2 * N) (Equiv.refl _)
(fun _ => Unit.unit) (fun _ => ![1, 1, 2])
(fun i _ w => 2 * m * childMarginal owner s r c (Equiv.swap z 2 i) w))) ∧
(A : ℝ) ^ 3 * ((H : ℝ) ^ 2 *
Real.exp (-100 * Real.sqrt (Real.log ((H + 1 : ℕ) : ℝ)))) ≤ (k : ℝ) ∧
∀ j, a j * b j * d j = (5 ^ (4 * G + 2 * L)) ^ 3 := by sorrySource
Kernel-checked regional count identities and exact extraction with empty regions.