Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Quantitative 112 extractions at released physical replication scales

Proved
mme_released_interior_112_scaled_physical_six_extraction

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

matrix-multiplicationregional-extraction

Every positively weighted released 112 child has positive matrix extractions at all sufficiently large physical replication scales. The actual position count and every integer marginal agree with the released recipe. Both directional estimates, the squared copy bound and the matrix volume identity hold over every field. Zero child parameters are allowed; empty cells are separate. The full matrix exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_released_interior_112_cofinal_physical_six_extraction
import Theorems.Thm_mme_released_interior_child_scale_identities
import Mathlib.Tactic.Positivity
open MME MME.RecursiveYZ MME.ReleasedInterior MME.MoreAsymmetryExactSeed MME.CompleteSplit Filter
universe u
Formal statement
theorem mme_released_interior_112_scaled_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)
    (hweight : 0 < (seed owner s).region.getD r.val 0 *
      (splitWeight owner s r c +
        splitWeight owner s r (complement (parent_total s r) c))) :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ᶠ k : ℕ in atTop,
      let m := k * ((seed owner s).region.getD r.val 0 *
        (splitWeight owner s r c +
          splitWeight owner s r (complement (parent_total s r) c)) * denominator)
      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], ∃ (copies : ℕ) (a b d : Fin copies → ℕ),
          0 < copies ∧
          TensorObj.Restrict (TensorObj.bigAdd (fun j => MMObj K (a j) (b j) (d j)))
            (sixSymmetrization
              (CWCells.unbroken K 5 2
                ((2 * k) * (splitCount owner s r c +
                  splitCount owner s r (complement (parent_total s r) c))) (Equiv.refl _)
                (fun _ => Unit.unit) (fun _ i => (c.val i).val)
                (fun i _ w => (2 * k) * integerProfile owner s i ⟨r, c⟩ w))) ∧
          ((A : ℝ) ^ 3 * ((H : ℝ) ^ 2 *
            Real.exp (-100 * Real.sqrt (Real.log ((H + 1 : ℕ) : ℝ))))) ^ 2 ≤ (copies : ℝ) ∧
          ∀ 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