Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Rejected singleton properties for Step-1 broken-owner filtering

Definition
mme_dwz_step1_rejected_singleton_properties

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

asymmetric-hashingbasis-projectormatrix-multiplicationstep-1-zeroing

This interface names the three tensor-vanishing properties used in Additional Zeroing-Out Step 1 for one broken owner: vanishing of a selected X/Y/Z word whenever one fine coordinate is unsupported, vanishing of each X singleton rejected by the X histogram filter, and vanishing of each Y singleton rejected after the X filter has been inserted. The definitions expose no additional hypothesis; they package the exact propositions consumed by the two filter-preservation branches.

Definition code
import Definitions.Def_mme_dwz_step1_projector_basis_api
import Definitions.Def_mme_dwz_cw_square_fine_split_grading

open MME Module PiTensorProduct
open MME.DWZStep1Support

universe u

set_option autoImplicit false

namespace MME.DWZSourceAligned

def BrokenOwnerCoordinateZeroProperty
    (K : Type u) [Field K]
    (m : ℕ) {N : ℕ} (outer : Fin N → Fin 15)
    (copy : DWZSquare.BrokenBlockCopy
      (DWZTable2StandardForm.UsefulBlock m outer)) : Prop :=
  ∀ (x : AddressModeWord outer 0)
    (y : AddressModeWord outer 1)
    (z : AddressZWord outer),
    (∃ r : Fin N,
      (cwSquareFineSplitGrading K 6).blockTensor
        (fun i ↦ ![
          fineSplitGrade
            (addressModeLeftGrade x r) (addressModeRightGrade x r),
          fineSplitGrade
            (addressModeLeftGrade y r) (addressModeRightGrade y r),
          fineSplitGrade (z r).leftGrade (z r).rightGrade] i) = 0) →
    let G := brokenAddressGrading K m outer copy
    let sx := DWZComponentRestriction.basisLabelProjection
      (coarseAddressModeBasis K outer 0) id {x}
    let sy := DWZComponentRestriction.basisLabelProjection
      (coarseAddressModeBasis K outer 1) id {y}
    let sz := DWZComponentRestriction.basisLabelProjection
      (coarseAddressZBasis K outer) id {z}
    let selected : ∀ i : Fin 3,
        (coarseAddressObj K outer).V i →ₗ[K]
          (coarseAddressObj K outer).V i :=
      Function.update
        (Function.update
          (Function.update (fun _ ↦ LinearMap.id) 0 sx) 1 sy) 2 sz
    PiTensorProduct.map
      (fun i ↦ (G.blockProj i 0).comp (selected i))
      (coarseAddressObj K outer).t = 0

def Step1XRejectedSingletonZeroProperty
    (K : Type u) [Field K]
    (m : ℕ) {N : ℕ} (outer : Fin N → Fin 15)
    (copy : DWZSquare.BrokenBlockCopy
      (DWZTable2StandardForm.UsefulBlock m outer)) : Prop :=
  ∀ (x : AddressModeWord outer 0),
    ¬ addressXWordPassesStep1 m outer x →
    let G := brokenAddressGrading K m outer copy
    let base : ∀ i : Fin 3,
        (coarseAddressObj K outer).V i →ₗ[K] G.classOf i 0 :=
      fun i ↦ G.blockProj i 0
    let singleton := DWZComponentRestriction.basisLabelProjection
      (coarseAddressModeBasis K outer 0) id {x}
    PiTensorProduct.map
      (Function.update base 0 ((base 0).comp singleton))
      (coarseAddressObj K outer).t = 0

def Step1YRejectedSingletonZeroProperty
    (K : Type u) [Field K]
    (m : ℕ) {N : ℕ} (outer : Fin N → Fin 15)
    (copy : DWZSquare.BrokenBlockCopy
      (DWZTable2StandardForm.UsefulBlock m outer)) : Prop :=
  ∀ (y : AddressModeWord outer 1),
    ¬ addressYWordPassesStep1 m outer y →
    let G := brokenAddressGrading K m outer copy
    let base : ∀ i : Fin 3,
        (coarseAddressObj K outer).V i →ₗ[K] G.classOf i 0 :=
      fun i ↦ G.blockProj i 0
    let xMaps := Function.update base 0
      ((base 0).comp (addressXStep1Projector K m outer))
    let singleton := DWZComponentRestriction.basisLabelProjection
      (coarseAddressModeBasis K outer 1) id {y}
    PiTensorProduct.map
      (Function.update xMaps 1 ((xMaps 1).comp singleton))
      (coarseAddressObj K outer).t = 0

end MME.DWZSourceAligned
Source
Duan--Wu--Zhou, Faster Matrix Multiplication via Asymmetric Hashing, arXiv:2210.10173v5, Section 6, Additional Zeroing-Out Step 1; 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