Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma D.7 — short simultaneous cancellation

Proved
UniqueSVPHardness.ConstFactor.Supplement.lemma_D_7

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

coding-theorycomputational-complexitylatticesp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be prime, T≥0T\ge0T≥0, and b=⌈(T+1)log⁡2P⌉b=\lceil (T+1)\log_2P\rceilb=⌈(T+1)log2​P⌉. If P≥2(b+1)P\ge2(b+1)P≥2(b+1), there is a nonzero vector c∈{−1,0,1}FPc\in\{-1,0,1\}^{\mathbb F_P}c∈{−1,0,1}FP​ with

∑wcw=0 over Z,∑wcwwj=0 over FP (0≤j≤T),∥c∥22≤2(b+1),\sum_w c_w=0\ \text{over }\mathbb Z,\qquad \sum_w c_w w^j=0\ \text{over }\mathbb F_P\ (0\le j\le T),\qquad \|c\|_2^2\le2(b+1),w∑​cw​=0 over Z,w∑​cw​wj=0 over FP​ (0≤j≤T),∥c∥22​≤2(b+1),

where w0=1w^0=1w0=1 also for w=0w=0w=0.

Placed in a single fiber, this vector gives the short lattice vector of Theorem D.8.

Differences from the source:

  • encoding: ‖c‖₂² → ∑_w c_w² in ℤ; reason: same quantity
  • encoding: b = ⌈(T + 1) log₂ P⌉ → the natural-number ceiling of the real (T + 1) log₂ P; reason: same value
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace UniqueSVPHardness.ConstFactor.Supplement

/-- Lemma D.7 (short simultaneous cancellation). Let `P` be prime, `T ≥ 0`, and
`b = ⌈(T + 1) log₂ P⌉`. If `P ≥ 2(b + 1)`, there is a nonzero `c ∈ {−1, 0, 1}^{F_P}` with
`∑_w c_w = 0` over `ℤ`, `∑_w c_w w^j = 0` over `F_P` for `0 ≤ j ≤ T` (with `w^0 = 1`), and
`‖c‖₂² ≤ 2(b + 1)`. -/
theorem lemma_D_7 (P : ℕ) [Fact P.Prime] (T : ℕ)
    (hP : 2 * (⌈((T : ℝ) + 1) * Real.logb 2 P⌉₊ + 1) ≤ P) :
    ∃ c : ZMod P → ℤ, c ≠ 0 ∧ (∀ w, c w = -1 ∨ c w = 0 ∨ c w = 1) ∧
      ∑ w, c w = 0 ∧
      (∀ j ≤ T, ∑ w : ZMod P, (c w : ZMod P) * w ^ j = 0) ∧
      ∑ w, c w ^ 2 ≤ 2 * ((⌈((T : ℝ) + 1) * Real.logb 2 P⌉₊ : ℤ) + 1) := by sorry

end UniqueSVPHardness.ConstFactor.Supplement
Source
Sergei Kudria, Jason Luo, STOC 2027 submission #1647 (October 2026), p. 45, Lemma D.7

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