Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

N=2 boundary ends live below level 3

Proved
mme_entropy_regional_boundary_N2_level_bound

by Tamas Fulop · Sep 15, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

matrix-multiplicationmore-asymmetryregional-entropy

At N=2N=2N=2, every boundary end lives below level 333. The length field L⋅2lower−1=2L \cdot 2^{lower-1} = 2L⋅2lower−1=2 is unsatisfiable for lower≥3lower \ge 3lower≥3, so only levels 000, 111 and 222 (with L=2L = 2L=2, 222 and 111) can occur. This is the boundary-data counterpart of the step level bound. Formalization Note Lean states the bound over arbitrary boundary data and predicate.

Preamble
import Definitions.Def_mme_recursive_profiled_CW_data

set_option autoImplicit false
Formal statement
theorem mme_entropy_regional_boundary_N2_level_bound :
    forall (lower : Nat) (P : MME.ProfiledCW.Predicate 2)
      (B : MME.ProfiledCW.BoundaryEnd lower 2 P),
      lower < 3 := by sorry
Source
Alman et al., More Asymmetry Yields Faster Matrix Multiplication, https://arxiv.org/html/2404.16349v2#S6, level-two regional setting; formalization observation on the IntegerStep/BoundaryEnd length fields forcing lower < 3 at N = 2

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me