Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.17 — a B\mathcal BB-invariant monomial subspace WAW_{\mathcal A}WA​ with ρˉ(WA)≤ρˉ(W)\bar\rho(W_{\mathcal A})\le\bar\rho(W)ρˉ​(WA​)≤ρˉ​(W)

Proved
F3SubsetSum.lemma_4_17

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

binary-error-lwecommutative-algebraf3-subset-sump2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-systemsquantum-algorithms

Let q≥3q\ge3q≥3 be prime, D≥2D\ge2D≥2, and W⊆R‾D∗W\subseteq\overline R{}_D^*W⊆RD∗​ a nonzero subspace. There is a family A\mathcal AA of reduced degree-DDD monomials such that WA=⟨eα:xα∈A⟩W_{\mathcal A}=\langle e_\alpha : x^\alpha\in\mathcal A\rangleWA​=⟨eα​:xα∈A⟩ is B\mathcal BB-invariant and

dim⁡WA=dim⁡W,rank⁡(C‾x1∣WA)=ρˉ(WA)≤ρˉ(W),\dim W_{\mathcal A}=\dim W,\qquad \operatorname{rank}\bigl(\overline C_{x_1}|_{W_{\mathcal A}}\bigr)=\bar\rho(W_{\mathcal A})\le\bar\rho(W),dimWA​=dimW,rank(Cx1​​∣WA​​)=ρˉ​(WA​)≤ρˉ​(W),

where C‾x1\overline C_{x_1}Cx1​​ is the contraction by the linear form L=x1L=x_1L=x1​ (the generic contraction with the coefficients of LLL substituted). The proof is a shifting argument through Borel's fixed-point theorem.

Differences from the source:

  • encoding: the standing integer D ≥ 2 of §4.1 (eq. (29), p.18), left implicit in the statement → hypothesis D ≥ 2; reason: R_{D−2} is undefined for D < 2 (natural-number subtraction would make it R_0)
  • encoding: x₁ for arbitrary n → hypothesis 0 < n, x₁ the variable of index 0; reason: names x₁; a nonzero W ⊆ R̄*_D with D ≥ 2 already forces n ≥ 1
  • encoding: W_𝒜 is ℬ-invariant: gW_𝒜 = W_𝒜 for g ∈ ℬ, (gλ)(f) = λ(g⁻¹f) → λ ∘ g ∈ W_𝒜 for all λ ∈ W_𝒜 and g ∈ ℬ; reason: equivalent because ℬ is a group acting on each R̄_d (closed under inverses)
Preamble
import Mathlib
import Definitions.Def_F3SubsetSum_TruncatedRing
import Definitions.Def_F3SubsetSum_SymbolicRank
import Definitions.Def_F3SubsetSum_MonomialShadow
import Definitions.Def_F3SubsetSum_BorelAction
Formal statement
namespace F3SubsetSum

/-- **Lemma 4.17** (Kothari, Metger, O'Donnell, Shutty, Wu, arXiv:2609.40321v1, Lemma 4.17, p.26;
proof pp.26–27): "For every nonzero subspace W ⊆ R̄*_D, there is a family 𝒜 of reduced
degree-D monomials such that W_𝒜 = ⟨e_α : x^α ∈ 𝒜⟩ is ℬ-invariant and
dim(W_𝒜) = dim(W), rank(C̄_{x_1}|_{W_𝒜}) = ρ̄(W_𝒜) ≤ ρ̄(W).
Here we use C̄_L for the contraction map obtained by substituting coefficients of L into C̄_{L_z}."

Over the algebraic closure `F̄_q`, `q ≥ 3` prime, `D ≥ 2`. `ℬ` is the triangular group of p.26,
`W_𝒜` the span of the coefficient functionals `e_α`, and `C̄_{x_1}` the contraction by the linear
form `L = x_1`, whose rank on `W_𝒜` is taken over `F̄_q`.

**Formalization Note** `x_1` is the variable with index `0`; the hypothesis `0 < n` only names it
(a nonzero `W ⊆ R̄*_D` with `D ≥ 2` forces `n ≥ 1`). `ℬ`-invariance is stated in the
inverse-free form of `IsBorelInvariant`. -/
theorem lemma_4_17 (q : ℕ) [Fact q.Prime] (hq : 3 ≤ q) (n D : ℕ) (hn : 0 < n) (hD : 2 ≤ D)
    (W : Submodule (AlgebraicClosure (ZMod q))
      (Module.Dual (AlgebraicClosure (ZMod q)) (Rd (AlgebraicClosure (ZMod q)) n q D)))
    (hW : W ≠ ⊥) :
    ∃ 𝒜 : Finset (Fin n →₀ ℕ),
      (∀ α ∈ 𝒜, (∀ j, α j < q) ∧ monoDeg α = D) ∧
      IsBorelInvariant q D (monomialSpan (K := AlgebraicClosure (ZMod q)) q D 𝒜) ∧
      Module.finrank (AlgebraicClosure (ZMod q))
          (monomialSpan (K := AlgebraicClosure (ZMod q)) q D 𝒜) =
        Module.finrank (AlgebraicClosure (ZMod q)) W ∧
      Module.finrank (AlgebraicClosure (ZMod q))
          (LinearMap.range ((contraction (AlgebraicClosure (ZMod q)) n q D
            (Pi.single (⟨0, hn⟩ : Fin n) 1)).domRestrict
              (monomialSpan (K := AlgebraicClosure (ZMod q)) q D 𝒜))) =
        symbolicRank (AlgebraicClosure (ZMod q)) n q D
          (monomialSpan (K := AlgebraicClosure (ZMod q)) q D 𝒜) ∧
      symbolicRank (AlgebraicClosure (ZMod q)) n q D
          (monomialSpan (K := AlgebraicClosure (ZMod q)) q D 𝒜) ≤
        symbolicRank (AlgebraicClosure (ZMod q)) n q D W := by sorry

end F3SubsetSum
Source
Kothari, Metger, O'Donnell, Shutty, Wu, Exponential quantum speedup for F_3^n-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE, arXiv:2609.40321v1, Lemma 4.17, p.26 (proof pp.26–27)
Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 6, 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