Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 17, p. 19 — (1 − (1 − x²)^b)/x is ε-close to 1/x on D_{κd} for every integer b ≥ (κd)² log(κd/ε)

Proved
QuantumLinSys.Chebyshev.lemma_17

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-approximationquantum-linear-systemsuniform-approximation

Let κ≥1\kappa \ge 1κ≥1, let d≥1d \ge 1d≥1 be an integer (the sparsity of the matrix), let ε>0\varepsilon > 0ε>0, and let b≥0b \ge 0b≥0 be an integer with

b≥(κd)2log⁡(κd/ε).b \ge (\kappa d)^2 \log(\kappa d/\varepsilon).b≥(κd)2log(κd/ε).

Then the function fb(x)=1−(1−x2)bxf_b(x) = \dfrac{1-(1-x^2)^b}{x}fb​(x)=x1−(1−x2)b​ of (74) is ε\varepsilonε-close to 1/x1/x1/x on Dκd=[−1,−1/(κd)]∪[1/(κd),1]D_{\kappa d} = [-1,-1/(\kappa d)] \cup [1/(\kappa d), 1]Dκd​=[−1,−1/(κd)]∪[1/(κd),1]:

∣1−(1−x2)bx−1x∣≤εfor all x∈Dκd.\left| \frac{1-(1-x^2)^b}{x} - \frac1x \right| \le \varepsilon \qquad \text{for all } x \in D_{\kappa d}.​x1−(1−x2)b​−x1​​≤εfor all x∈Dκd​.

Multiplying 1/x1/x1/x by 1−(1−x2)b1-(1-x^2)^b1−(1−x2)b removes the singularity at the origin while changing the function by at most ε\varepsilonε on the domain where the eigenvalues of the rescaled matrix lie; the result is a polynomial, which Lemma 18 expands in Chebyshev polynomials.

Formalization Note κ≥1\kappa \ge 1κ≥1 (a condition number) and d≥1d \ge 1d≥1 (a sparsity) are made explicit; they make DκdD_{\kappa d}Dκd​ nonempty and keep 000 out of it. The page's "integer bbb" is a natural number: fbf_bfb​ is "a polynomial of degree 2b−12b-12b−1" (p. 19), and a negative exponent would make (1−x2)b(1-x^2)^b(1−x2)b singular at x=±1x = \pm 1x=±1.

Preamble
import Mathlib
import Definitions.Def_QuantumLinSys_Chebyshev_Setting
Formal statement
namespace QuantumLinSys.Chebyshev

theorem lemma_17 (κ ε : ℝ) (d b : ℕ) (hκ : 1 ≤ κ) (hd : 1 ≤ d) (hε : 0 < ε)
    (hb : (κ * d) ^ 2 * Real.log (κ * d / ε) ≤ b) :
    ∀ x ∈ Dκ (κ * d), |fTamed b x - 1 / x| ≤ ε := by sorry

end QuantumLinSys.Chebyshev
Source
Childs, Kothari and Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, arXiv:1511.02306v2, p. 19, Lemma 17 (eq. (74))
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me