Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Threshold form of the concatenated error: Eh=(fp)2h/fE_h = (fp)^{2^h}/fEh​=(fp)2h/f

Proved
KLZ97.levelError_eq_threshold_pow

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

quantum-computationquantum-error-correction

The level-hhh failure parameter rewritten so that the threshold is visible: for f≠0f \ne 0f=0,

Eh=(fp)2hf.E_h = \frac{(f p)^{2^{h}}}{f}.Eh​=f(fp)2h​.

The combination fpf pfp is the quantity that must be less than 111 for concatenation to help, which is the threshold condition p<1/fp < 1/fp<1/f of the paper's analysis.

Preamble
import Mathlib
import Definitions.Def_KLZ97_model
Formal statement
namespace KLZ97

theorem levelError_eq_threshold_pow (f p : ℝ) (hf : f ≠ 0) (h : ℕ) :
    levelError f p h = (f * p) ^ (2 ^ h) / f := 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 (Concatenation) and II.C (Thresholds for the normalizer group), 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.

For every pair of real numbers fff and ppp with f≠0f \ne 0f=0, and every natural number hhh, the quantity defined by the recursion E0=pE_0 = pE0​=p, Eh+1=fEh2E_{h+1} = f E_h^{2}Eh+1​=fEh2​ satisfies

Eh  =  (fp)2hf.E_h \;=\; \frac{(f p)^{2^{h}}}{f} .Eh​=f(fp)2h​.

The exponent 2h2^{h}2h is a natural number and the division is ordinary real division, legitimate because f≠0f \ne 0f=0 is assumed. At h=0h = 0h=0 the right-hand side is (fp)1/f=p(fp)^{1}/f = p(fp)1/f=p.

The only hypothesis is f≠0f \ne 0f=0. In particular fff may be negative, ppp is arbitrary, and no inequality between fff and ppp — no threshold condition — is assumed; the claim is an exact identity valid on the whole of its domain.

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