Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 29 — minimal-span reduction

Proved
SpaceReset.Hardness.lemma_29

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theoryp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1trellis

Let G∈F2k×nG\in\mathbb F_2^{k\times n}G∈F2k×n​ have full row rank.

  1. A minimal-span basis of its row space can be computed from GGG in polynomial time by binary row operations, i.e. as EGEGEG for an invertible E∈F2k×kE\in\mathbb F_2^{k\times k}E∈F2k×k​.
  2. For every minimal-span basis BBB with row spans [si,ti][s_i,t_i][si​,ti​] and every cut 0≤u≤n0\le u\le n0≤u≤n, the span of the first uuu columns of BBB is the coordinate subspace of F2k\mathbb F_2^kF2k​ supported on the rows with si≤us_i\le usi​≤u, and the span of the last n−un-un−u columns is the coordinate subspace supported on the rows with ti>ut_i>uti​>u.
  3. Consequently, for 0≤u≤v≤n0\le u\le v\le n0≤u≤v≤n the numerator of (12) for GGG equals
P(u,v)=#{i:si≤v, ti>u}+#{i:si≤u, ti>v}.P(u,v)=\#\{i:s_i\le v,\ t_i>u\}+\#\{i:s_i\le u,\ t_i>v\}.P(u,v)=#{i:si​≤v, ti​>u}+#{i:si​≤u, ti​>v}.

This turns the rank invariants ccc and Π\PiΠ into counts of row spans, the starting point of the allocation lemma and of the graph-layout correspondence.

Differences from the source:

  • reading: computable by binary row operations in polynomial time → a polynomial-time map from the code of G to the code of E·G with E invertible over F2 and E·G a minimal-span basis; reason: row operations are exactly left multiplication by an invertible matrix; the output is the basis itself
  • encoding: polynomial-time computation on explicitly represented matrices, graphs, budgets and circuits → PvsNP.PolyTimeComputable on binary strings, objects written with the fixed self-delimiting codes encNats (matrix entries row by row, binary numbers, explicit gate lists); reason: a standard polynomial-size binary presentation; any two reasonable codings are polynomially inter-convertible
Preamble
import Mathlib
import Definitions.Def_PvsNP
import Definitions.Def_SpaceReset_Hardness_Trellis
import Definitions.Def_SpaceReset_Hardness_Coding

set_option autoImplicit false
Formal statement
namespace SpaceReset.Hardness

/-- Lemma 29 (Minimal-span reduction), App. D.1, p. 41. -/
theorem lemma_29 :
    (∃ f : PvsNP.Str → PvsNP.Str, PvsNP.PolyTimeComputable f ∧
      ∀ (k n : ℕ) (G : Matrix (Fin k) (Fin n) F2), FullRowRank G →
        ∃ E : Matrix (Fin k) (Fin k) F2, IsUnit E ∧ IsMinimalSpanBasis G (E * G) ∧
          f (encNats (specNats G)) = encNats (specNats (E * G))) ∧
    ∀ (k n : ℕ) (G B : Matrix (Fin k) (Fin n) F2), FullRowRank G → IsMinimalSpanBasis G B →
      (∀ u : ℕ, u ≤ n →
        ((prefixSpan B u : Set (Fin k → F2)) = {y | ∀ i, u < rowStart (B i) → y i = 0}) ∧
        ((suffixSpan B u : Set (Fin k → F2)) = {y | ∀ i, rowEnd (B i) ≤ u → y i = 0})) ∧
      ∀ u v : ℕ, u ≤ v → v ≤ n → windowDim G u v = spanWindowCount B u v := by sorry

end SpaceReset.Hardness
Source
Rinka Miura, STOC 2027 submission #1715 (October 2026), Lemma 29, App. D.1, p. 41 (eq. (27))
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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