Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform finite-dimensional patch for GapSVP solvers

Proved
InfoLossLAR.WorstCase.RegevSketch.finite_gap_patch

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

lar-regev-bridgelatticeslearning-with-errorsquantum-computing

Let AAA be a uniform quantum polynomial-time decision algorithm, let n0n_0n0​ be a fixed natural-number cutoff, and let γ:N→R\gamma:\mathbb N\to\mathbb Rγ:N→R satisfy γ(n)≥1\gamma(n)\ge1γ(n)≥1 at positive dimensions. There is a uniform quantum polynomial-time algorithm A~\widetilde AA such that, for every positive nnn,

(n≥n0 ⟹ A solves GapSVPγ(n)) ⟹ A~ solves GapSVPγ(n).\bigl(n\ge n_0\ \Longrightarrow\ A\text{ solves }\mathrm{GapSVP}_{\gamma(n)}\bigr) \ \Longrightarrow\ \widetilde A\text{ solves }\mathrm{GapSVP}_{\gamma(n)}.(n≥n0​ ⟹ A solves GapSVPγ(n)​) ⟹ A solves GapSVPγ(n)​.

Every solver guarantee quantifies over all nonsingular integer bases and positive rational promise thresholds. Thus the finitely many dimensions below n0n_0n0​ still contain infinitely many binary-coded inputs.

This formalization obligation combines exact fixed-rank lattice algorithms with a uniform family that inherits the given solver’s guarantee above the cutoff. It extends an eventual guarantee to all positive dimensions and makes no computability assumption on γ\gammaγ. It is not a finite lookup table of lattice instances.

Preamble
import Definitions.Def_InfoLossLAR_RegevSketch_DGS

set_option autoImplicit false
set_option maxHeartbeats 200000
open QAlgorithms.Complexity
open scoped BigOperators Classical
Formal statement
namespace InfoLossLAR.WorstCase.RegevSketch

theorem finite_gap_patch (A : Family) (hA : IsQPT A) (cutoff : ℕ) (gamma : ℕ → ℝ)
    (hgamma : ∀ n,1 ≤ n → 1 ≤ gamma n) :
    ∃ patched : Family,IsQPT patched ∧ ∀ n,1 ≤ n →
      (cutoff ≤ n → SolvesGapSVP A (famN n) (gamma n)) →
        SolvesGapSVP patched (famN n) (gamma n) := by sorry

end InfoLossLAR.WorstCase.RegevSketch
Source
Oded Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, full version dated May 2, 2009, https://cims.nyu.edu/~regev/papers/qcrypto.pdf. Finite-dimensional completion required by the original fixed-family Gaussian worst-case target (Appendix I.1); uses exact fixed-rank lattice algorithms and a uniform finite dispatcher. This patch is an explicit formalization obligation, not a separately numbered lemma in Regev.

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