Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantitative cofinal matrix extractions from every physical released 112 child

Proved
mme_released_interior_112_cofinal_physical_six_extraction

by Robertboy18 · Sep 23, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

matrix-multiplicationregional-extraction

Every released 112 child, including every coordinate placement and zero parameter, admits cofinal matrix extractions from the six-fold symmetrization of its physical tensor. Both directional family estimates, a positive copy count, the squared explicit copy lower bound and the six-fold matrix-volume identity are retained. Alignment with common released cell scales and entropy rate assembly remain separate. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_interior_112_cofinal_canonical_matrix_extraction
import Theorems.Thm_mme_released_interior_112_six_canonical_physical_iso
import Theorems.Thm_mme_cyclic_uniform_extraction_six_count
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
open MME MME.RecursiveYZ MME.ReleasedInterior MME.MoreAsymmetryExactSeed MME.CompleteSplit Filter
universe u
Formal statement
theorem mme_released_interior_112_cofinal_physical_six_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)))
            (sixSymmetrization
              (CWCells.unbroken K 5 2 (2 * N) (Equiv.refl _)
                (fun _ => Unit.unit) (fun _ i => (c.val i).val)
                (fun i _ w => 2 * m * childMarginal owner s r c i w))) ∧
          ((A : ℝ) ^ 3 * ((H : ℝ) ^ 2 *
            Real.exp (-100 * Real.sqrt (Real.log ((H + 1 : ℕ) : ℝ))))) ^ 2 ≤ (k : ℝ) ∧
          ∀ j, a j * b j * d j = 5 ^ (6 * (4 * G + 2 * L)) := by sorry
Source
Kernel-checked regional count identities and exact extraction with empty regions.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me