Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Common-state Step-1-filtered DWZ source tensor restriction

Proved
mme_dwz_common_state_shared_tensor

by marwahaha · Aug 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

asymmetric-hashinglaser-methodmatrix-multiplicationtensor-restriction

For any exact-profile owner enumeration contained in one canonical affine bucket, if supported mixed triples identify the X and Y owner, then the direct sum of the corresponding common-state broken address tensors is a restriction of the appropriate square Coppersmith--Winograd power. The affine state and all owner data are shared literally with the quantitative counting child.

Preamble
import Definitions.Def_mme_dwz_square_data
import Definitions.Def_mme_dwz_table2_integer_counts
import Definitions.Def_mme_dwz_source_aligned_broken_obj
import Definitions.Def_mme_dwz_global_common_state_broken_copy
import Definitions.Def_mme_CW_tensor

open MME

universe u

set_option autoImplicit false

/-!
# Universal common-state source tensor restriction

This is the tensor-only child of the raw Table-2 source theorem.  Its
statement deliberately exposes every hypothesis rather than hiding the
interface behind a newly published `Prop` definition.
-/

/-- The exact tensor restriction supplied by the paper-faithful Step-1 X/Y
filters and the correlated common-state Step-2 copies. -/
Formal statement
theorem mme_dwz_common_state_shared_tensor
    {K : Type u} [Field K] :
    ∀ {m n p N L : ℕ} [Fact p.Prime],
      Odd p →
      (S : Finset ℕ) →
      S ⊆ Finset.range (p / 2) →
      ThreeAPFree (S : Set ℕ) →
      (A : Finset (Fin (N + 1) → Fin 15)) →
      (q : (Fin (N + 2) → ZMod p) × ZMod p) →
      (reindex : Fin (N + 1) ≃ Fin L) →
      (edge : Fin n → Fin (N + 1) → Fin 15) →
      Function.Injective edge →
      (∀ r, edge r ∈ MME.dwzTable2AffineHashBucket S A q) →
      (∀ r s, Fintype.card
          {t : Fin L //
            MME.DWZGlobalCorrelated.sourceWord reindex edge r t = s} =
          MME.DWZTable2Counts.component s * m) →
      (∀ js : Fin 3 → Fin n,
        (∀ t : Fin (N + 1),
          (MME.DWZSquare.shapeX (edge (js 0) t)).val +
            (MME.DWZSquare.shapeY (edge (js 1) t)).val +
            (MME.DWZSquare.shapeZ (edge (js 2) t)).val = 4) →
        js 0 = js 1) →
      TensorObj.Restrict
        (TensorObj.bigAdd (fun r ↦
          MME.DWZSourceAligned.brokenAddressObj K m
            (MME.DWZGlobalCorrelated.sourceWord reindex edge r)
            (MME.DWZGlobalCorrelated.commonStateBrokenCopy
              m reindex q edge r)))
        ((TensorObj.kron (CWObj K 6) (CWObj K 6)).kronPow L) := by
  sorry
Source
Ran Duan, Hongxun Wu, and Renfei Zhou, Faster Matrix Multiplication via Asymmetric Hashing, arXiv:2210.10173v5, Section 6, especially Claim 6.2, Claim 6.8, and Additional Zeroing-Out Steps 1 and 2; https://arxiv.org/abs/2210.10173

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me