Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Below threshold the concatenated error tends to 000

Proved
KLZ97.levelError_tendsto_zero

by LG · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

quantum-computationquantum-error-correction

Existence of a threshold, in its asymptotic form: if the physical failure parameter ppp is non-negative and lies below the threshold 1/f1/f1/f, that is fp<1f p < 1fp<1, then the concatenated failure parameter EhE_hEh​ tends to 000 as the number hhh of concatenation levels tends to infinity. This is the sense in which computation of arbitrary accuracy becomes possible below threshold.

Preamble
import Mathlib
import Definitions.Def_KLZ97_model
Formal statement
namespace KLZ97

theorem levelError_tendsto_zero (f p : ℝ) (hf : 0 < f) (hp : 0 ≤ p) (hfp : f * p < 1) :
    Filter.Tendsto (levelError f p) Filter.atTop (nhds 0) := by sorry

end KLZ97
Source
Knill, Laflamme, Zurek, Resilient Quantum Computation: Error Models and Thresholds, arXiv:quant-ph/9702058v1, https://arxiv.org/abs/quant-ph/9702058, Sections I.F and II.C, pp. 6, 8
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, authored by the drafting agent

Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statement it describes, at the explicit request of the proposal owner, and not by an independent auditor working blind from the code alone. It therefore cannot corroborate the faithfulness of the formalization, and a reviewer should not treat it as independent evidence: it carries exactly the blind spots of the author of the statement.

Let fff and ppp be real numbers with f>0f > 0f>0, p≥0p \ge 0p≥0 and fp<1f p < 1fp<1. Consider the sequence E0=pE_0 = pE0​=p, Eh+1=fEh2E_{h+1} = f E_h^{2}Eh+1​=fEh2​, indexed by natural numbers hhh. The claim is that this sequence converges to 000 as h→∞h \to \inftyh→∞, in the usual topology of R\mathbb{R}R: for every neighbourhood UUU of 000 there is an h0h_0h0​ with Eh∈UE_h \in UEh​∈U for all h≥h0h \ge h_0h≥h0​.

The hypotheses are exactly: strict positivity of fff, non-negativity of ppp, and the strict inequality fp<1f p < 1fp<1. They are simultaneously satisfiable — for instance f=2f = 2f=2, p=1/4p = 1/4p=1/4 — so the statement is not vacuous. The boundary case fp=1f p = 1fp=1 is excluded, and p=0p = 0p=0 is allowed, in which case the sequence is identically 000 from the start. Nothing is claimed about the rate of convergence, about monotonicity of the sequence, or about what happens when fp≥1f p \ge 1fp≥1.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 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