Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.15 — E[Xt∣Wt−1]≥ρ(Wt−1)/3\mathbb E[X_t\mid W_{t-1}]\ge\rho(W_{t-1})/3E[Xt​∣Wt−1​]≥ρ(Wt−1​)/3

Proved
F3SubsetSum.lemma_4_15

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 and D≥2D\ge2D≥2. For every history a1,…,at−1∈Fqna_1,\dots,a_{t-1}\in\mathbb F_q^na1​,…,at−1​∈Fqn​, with Wt−1=Vt−1⊥⊆RD∗W_{t-1}=V_{t-1}^\perp\subseteq R_D^*Wt−1​=Vt−1⊥​⊆RD∗​ and a uniformly random new linear form LtL_tLt​,

E[Xt∣Wt−1]≥ρ(Wt−1)3,\mathbb E\bigl[X_t\mid W_{t-1}\bigr]\ge\frac{\rho(W_{t-1})}{3},E[Xt​∣Wt−1​]≥3ρ(Wt−1​)​,

where ρ\rhoρ is the symbolic rank (43). The symbolic rank is an upper bound for every specialised rank; this lemma says that a random specialisation keeps a third of it on average.

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: E[X_t | W_{t−1}] → the average over the uniform new sample a_t for a fixed history; reason: X_t depends on the history only through W_{t−1} (Claim 4.14), so both conditionings give the same average
Preamble
import Mathlib
import Definitions.Def_F3SubsetSum_TruncatedRing
import Definitions.Def_F3SubsetSum_SampleImage
import Definitions.Def_F3SubsetSum_SymbolicRank
Formal statement
namespace F3SubsetSum

/-- **Lemma 4.15** (Kothari, Metger, O'Donnell, Shutty, Wu, arXiv:2609.40321v1, Lemma 4.15, p.25):
"For uniformly random L_t, we have E[X_t | W_{t−1}] ≥ ρ(W_{t−1})/3."

Over `F_q`, `q ≥ 3` prime, `D ≥ 2`: for every history `a_1, …, a_{t−1}`, the average over a
uniform new sample `a_t ∈ F_qⁿ` of the increment `X_t` (40) is at least one third of the symbolic
rank `ρ(W_{t−1})` (43), where `W_{t−1} = V_{t−1}^⊥ ⊆ R*_D`.

**Formalization Note** `X_t` depends on the history only through `W_{t−1}` (Claim 4.14), so
conditioning on `W_{t−1}` and conditioning on the history give the same average. -/
theorem lemma_4_15 (q : ℕ) [Fact q.Prime] (hq : 3 ≤ q) (n D : ℕ) (hD : 2 ≤ D) {t : ℕ}
    (a : Fin t → Fin n → ZMod q) :
    (symbolicRank (ZMod q) n q D (sampleImage q a D).dualAnnihilator : ℝ) / 3 ≤
      (∑ a' : Fin n → ZMod q, (increment q a a' D : ℝ)) / (q : ℝ) ^ n := 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.15, p.25
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