Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 11, p. 10 — discretized Gaussian Fourier sum is ε-close to 1/x

Proved
QuantumLinSys.Fourier.lemma_11

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

fourier-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-linear-systemsuniform-approximation

There are positive absolute constants c,Cc,Cc,C such that, for each condition number κ≥1\kappa\ge1κ≥1 and accuracy 0<ε<1/20<\varepsilon<1/20<ε<1/2, one can choose J,K∈NJ,K\in\mathbb NJ,K∈N and real mesh widths Δy,Δz\Delta_y,\Delta_zΔy​,Δz​ satisfying two-sided bounds with those constants:

J=Θ ⁣(κεlog⁡κε),K=Θ ⁣(κlog⁡κε),Δy=Θ ⁣(εlog⁡(κ/ε)),Δz=Θ ⁣(1κlog⁡(κ/ε)).J=\Theta\!\left(\frac\kappa\varepsilon\log\frac\kappa\varepsilon\right),\quad K=\Theta\!\left(\kappa\log\frac\kappa\varepsilon\right),\quad \Delta_y=\Theta\!\left(\frac\varepsilon{\sqrt{\log(\kappa/\varepsilon)}}\right),\quad \Delta_z=\Theta\!\left(\frac1{\kappa\sqrt{\log(\kappa/\varepsilon)}}\right).J=Θ(εκ​logεκ​),K=Θ(κlogεκ​),Δy​=Θ(log(κ/ε)​ε​),Δz​=Θ(κlog(κ/ε)​1​).

For the finite complex Fourier double sum hhh of (18),

∣h(x)−1x∣≤ε(x∈Dκ).\left|h(x)-\frac1x\right|\le\varepsilon\qquad(x\in D_\kappa).​h(x)−x1​​≤ε(x∈Dκ​).

This finite expansion is the scalar approximation used in the paper's Fourier approach to quantum linear systems.

Formalization Note One pair c,Cc,Cc,C works uniformly for all κ,ε\kappa,\varepsilonκ,ε and all four scales. The condition-number convention κ≥1\kappa\ge1κ≥1 and Corollary 10's 0<ε<1/20<\varepsilon<1/20<ε<1/2 exclude an empty spectral domain and nonpositive logarithmic scales. The conclusion has exactly ε\varepsilonε, rather than an unspecified multiple of it.

Preamble
import Mathlib
import Definitions.Def_QuantumLinSys_Fourier_Setting
Formal statement
namespace QuantumLinSys.Fourier

/-- Lemma 11, p. 10: the finite Fourier double sum (18) approximates 1/x. -/
theorem lemma_11 :
    ∃ c C : ℝ, 0 < c ∧ 0 < C ∧ ∀ κ ε : ℝ,
      1 ≤ κ → 0 < ε → ε < 1 / 2 →
        ∃ (J K : ℕ) (Δy Δz : ℝ),
          c * (κ / ε * Real.log (κ / ε)) ≤ (J : ℝ) ∧
          (J : ℝ) ≤ C * (κ / ε * Real.log (κ / ε)) ∧
          c * (κ * Real.log (κ / ε)) ≤ (K : ℝ) ∧
          (K : ℝ) ≤ C * (κ * Real.log (κ / ε)) ∧
          c * (ε / Real.sqrt (Real.log (κ / ε))) ≤ Δy ∧
          Δy ≤ C * (ε / Real.sqrt (Real.log (κ / ε))) ∧
          c * (κ * Real.sqrt (Real.log (κ / ε)))⁻¹ ≤ Δz ∧
          Δz ≤ C * (κ * Real.sqrt (Real.log (κ / ε)))⁻¹ ∧
          ∀ x ∈ QuantumLinSys.Chebyshev.Dκ κ, ‖hDisc J K Δy Δz x - ((1 / x : ℝ) : ℂ)‖ ≤ ε := by sorry

end QuantumLinSys.Fourier
Source
Childs, Kothari and Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, arXiv:1511.02306v2, p. 10, Lemma 11 and display (18); proof pp. 13–14
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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