Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Level-2 terms match the positive level-3 cells

Proved
mme_released_level2_level3_positive_cell_correspondence

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

matrix-multiplication

This is the finite data correspondence between the positive level-3 cells of the six released regions and the 110411041104 pooled level-2 terms (RecStage tables). It is the data half of the refchild-window layout.

Setting. Let D=1012D=10^{12}D=1012. A level-3 cell is a pair (ρ,c)(\rho,c)(ρ,c): ρ∈Fin 6\rho\in\mathrm{Fin}\,6ρ∈Fin6 is a region, and c=(r,s)c=(r,s)c=(r,s) has parent r<88r<88r<88 and a half-grade triple sss with s0+s1+s2=4s_0+s_1+s_2=4s0​+s1​+s2​=4 and s≤parent3(ρ,r)s\le\texttt{parent3}(\rho,r)s≤parent3(ρ,r). Write sˉ\bar ssˉ for the complementary split and

M(ρ,c)=m3(ρ,r,s)+m3(ρ,r,sˉ)M(\rho,c)=m_3(\rho,r,s)+m_3(\rho,r,\bar s)M(ρ,c)=m3​(ρ,r,s)+m3​(ρ,r,sˉ)

for its unit mass. The cell is positive if s0,s1,s2≠0s_0,s_1,s_2\neq0s0​,s1​,s2​=0. Let σρ\sigma_\rhoσρ​ be roleEquiv ρ\rhoρ.

Claim. There is a map φ:Fin 1104→{level-3 cells}\varphi:\mathrm{Fin}\,1104\to\{\text{level-3 cells}\}φ:Fin1104→{level-3 cells} such that:

  1. φ\varphiφ is injective, and every φ(r)\varphi(r)φ(r) is positive;
  2. every positive cell with M>0M>0M>0 is in the image of φ\varphiφ;
  3. n2(r)=M(φ(r))n_2(r)=M(\varphi(r))n2​(r)=M(φ(r));
  4. parent2(r)(i)=sφ(r)(σρ−1i)\texttt{parent2}(r)(i)=s_{\varphi(r)}(\sigma_{\rho}^{-1}i)parent2(r)(i)=sφ(r)​(σρ−1​i), where ρ\rhoρ is the region of φ(r)\varphi(r)φ(r) (the physical orientation);
  5. for every mode iii and every two-letter word w=(w0,w1)w=(w_0,w_1)w=(w0​,w1​), the level-2 parent mixture equals the level-3 cell frequency:
parentMixture(n2,m2,μ2(i))(r,(w0),(w1))=μρ(3)(σρ−1i)(φ(r),w)∑vμρ(3)(σρ−1i)(φ(r),v).\mathrm{parentMixture}(n_2,m_2,\mu_2(i))\big(r,(w_0),(w_1)\big)=\frac{\mu^{(3)}_{\rho}(\sigma_\rho^{-1}i)(\varphi(r),w)}{\sum_v\mu^{(3)}_{\rho}(\sigma_\rho^{-1}i)(\varphi(r),v)} .parentMixture(n2​,m2​,μ2​(i))(r,(w0​),(w1​))=∑v​μρ(3)​(σρ−1​i)(φ(r),v)μρ(3)​(σρ−1​i)(φ(r),w)​.

Why it holds. Take φ(r)\varphi(r)φ(r) to be the unique positive level-3 cell (ρ,r3,s)(\rho,r_3,s)(ρ,r3​,s) whose key

(s∘σρ−1, w3(ρ,r3) (wts+wtsˉ), s0(ρ,r3,s))\big(s\circ\sigma_\rho^{-1},\ w_3(\rho,r_3)\,(\mathrm{wt}_s+\mathrm{wt}_{\bar s}),\ s_0(\rho,r_3,s)\big)(s∘σρ−1​, w3​(ρ,r3​)(wts​+wtsˉ​), s0​(ρ,r3​,s))

equals the table entry l2At r. All keys are distinct, and the two multisets of keys coincide. For item 5, both sides equal ∑e jw(a,s0,e)/D\sum_{e}\,jw(a,s_0,e)/D∑e​jw(a,s0​,e)/D over the level-1 splits eee with ei′=w0e_{i'}=w_0ei′​=w0​ and (a−e)i′=w1(a-e)_{i'}=w_1(a−e)i′​=w1​, because jw is symmetric under permuting coordinates and ∑wchildW=D\sum_w \texttt{childW}=D∑w​childW=D on cells with positive mass. All five items were checked in Python with exact rational arithmetic, following the Lean definitions (cellRec via find?, integer division in mu3).

Preamble
import Definitions.Def_mme_released_recursive_stage_data
import Definitions.Def_mme_released_joint_interior_profiles
import Definitions.Def_mme_recursive_region_parent_profiles
open BigOperators MME MME.RecursiveYZ MME.RegionRealization
set_option autoImplicit false
Formal statement
theorem mme_released_level2_level3_positive_cell_correspondence :
    ∃ φ : Fin 1104 → (ρ : Fin 6) × Cell (2 * 2 ^ (2 - 1)) 88 (RecStage.parent3 ρ),
      Function.Injective φ ∧
      (∀ r j, ((φ r).2.2.val j).val ≠ 0) ∧
      (∀ (ρ : Fin 6) (c : Cell (2 * 2 ^ (2 - 1)) 88 (RecStage.parent3 ρ)),
        (∀ j, (c.2.val j).val ≠ 0) →
        0 < RecStage.m3 ρ c.1 c.2 + RecStage.m3 ρ c.1 (complement (RecStage.htotal3 ρ c.1) c.2) →
        ∃ r, φ r = ⟨ρ, c⟩) ∧
      (∀ r, RecStage.n2 r = RecStage.m3 (φ r).1 (φ r).2.1 (φ r).2.2 +
        RecStage.m3 (φ r).1 (φ r).2.1 (complement (RecStage.htotal3 (φ r).1 (φ r).2.1) (φ r).2.2)) ∧
      (∀ r i, RecStage.parent2 r i =
        ((φ r).2.2.val ((ReleasedJointInterior.roleEquiv (φ r).1).symm i)).val) ∧
      (∀ r i (w : CompleteSplit.CompleteWord 2),
        parentMixture RecStage.htotal2 RecStage.n2 RecStage.m2 (RecStage.mu2 i) r
            (fun h _ ↦ w h) =
          cellFrequency (RecStage.mu3 (φ r).1 ((ReleasedJointInterior.roleEquiv (φ r).1).symm i))
            (φ r).2 w) := by
  sorry
Source
Prove2Me mission 7e65274f (More Asymmetry Bound: omega < 2.37134); released data of Alman-Duan-Vassilevska Williams-Xu-Xu-Zhou, More Asymmetry Yields Faster Matrix Multiplication, arXiv 2404.16349 (Algorithm 1, level-2 terms). Data half of mme_released_global_graded_hashed_level2_child_window_layout (997ca8c6).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me