Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sufficient number of concatenation levels: n(fp)2h<qn (fp)^{2^h} < qn(fp)2h<q

Proved
KLZ97.levels_suffice

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

analysisquantum-error-correction

The paper's criterion for how many levels of concatenation are needed. For a computation of nnn gates and a desired failure probability qqq, the number hhh of levels is sufficient provided

2h>log⁡1/(fp)(n/q),2^{h} > \log_{1/(fp)}(n/q),2h>log1/(fp)​(n/q),

and then the computation's failure probability bound n(fp)2hn (f p)^{2^{h}}n(fp)2h is smaller than qqq. This is the inequality n(fp)2h<qn (fp)^{2^h} < qn(fp)2h<q of Section II.F, together with the condition h>log⁡2log⁡1/(fp)(n/q)h > \log_2 \log_{1/(fp)}(n/q)h>log2​log1/(fp)​(n/q) derived from it.

Preamble
import Mathlib
import Definitions.Def_KLZ97_model
Formal statement
namespace KLZ97

theorem levels_suffice (f p q : ℝ) (n : ℕ) (h : ℕ) (hp : 0 < f * p) (hfp : f * p < 1)
    (hq : 0 < q) (hqn : q < n)
    (hlevels : Real.log ((n : ℝ) / q) / Real.log (1 / (f * p)) < (2 : ℝ) ^ h) :
    (n : ℝ) * (f * p) ^ (2 ^ h) < q := 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, Section II.F (Overheads), p. 9
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, ppp, qqq be real numbers, and nnn, hhh natural numbers. Write t=fpt = f pt=fp for the product. Assume:

  • t>0t > 0t>0 and t<1t < 1t<1;
  • q>0q > 0q>0 and q<nq < nq<n (so in particular n≥1n \ge 1n≥1);
log⁡(n/q)log⁡(1/t)  <  2h,\frac{\log(n/q)}{\log(1/t)} \;<\; 2^{h},log(1/t)log(n/q)​<2h,

where log⁡\loglog is the natural logarithm, n/qn/qn/q is a real quotient, and 2h2^{h}2h on the right is a real power of 222.

The conclusion is the strict inequality

n⋅t 2h  <  q,n \cdot t^{\,2^{h}} \;<\; q ,n⋅t2h<q,

where the exponent 2h2^{h}2h is a natural number.

Note that the hypotheses constrain only the product t=fpt = fpt=fp, not fff and ppp individually: they are compatible with fff and ppp both negative. Under them log⁡(1/t)>0\log(1/t) > 0log(1/t)>0 and log⁡(n/q)>0\log(n/q) > 0log(n/q)>0, so the displayed quotient is a positive real and the hypothesis on hhh is a genuine lower bound on 2h2^h2h; at h=0h = 0h=0 it requires that quotient to be less than 111. The conclusion is strict, and the statement asserts nothing when the hypothesis on hhh fails, nor for t≥1t \ge 1t≥1, q≥nq \ge nq≥n or t≤0t \le 0t≤0.

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