Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact hashing steps combine under whole-region permutations

Proved
mme_exact_step_permuted_product_restrict

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

matrix-multiplicationtensor-extraction

A finite family of exact hashing steps gives a tensor restriction after permuting the modes of each whole region. Each factor retains its exact post-repair integer copy count. The root exponent bound remains a separate obligation.

Preamble
import Theorems.Thm_mme_kronFin_mono_restrict
import Theorems.Thm_mme_recursive_profiled_CW_exact_step
import Theorems.Thm_mme_profiled_CW_all_mode_permutations_iso
import Theorems.Thm_mme_bigAdd_mono_restrict
open MME MME.TensorObj MME.ProfiledCW
universe u
Formal statement
theorem mme_exact_step_permuted_product_restrict {K : Type u} [Field K]
    {n ell : ℕ} (N : Fin n → ℕ) (P : ∀ r, Predicate (N r))
    (E : ∀ r, ExactStep ell (N r) (P r)) (sigma : Fin n → Equiv.Perm (Fin 3)) :
    Restrict
      (kronFin n (fun r => bigAdd (fun _ : Fin (E r).copies =>
        tensor K (fun i => (E r).output ((sigma r).symm i)))))
      (kronFin n (fun r => tensor K (fun i => P r ((sigma r).symm i)))) := by sorry
Source
Checked tensor restrictions and released global histogram extraction.

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