Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Below ηc′\eta_c'ηc′​ the general-noise threshold condition holds

Proved
ABOThreshold.threshold_general_lt_imp_condition

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

fault-toleranceprobabilityquantum-computing

In the general noise model the noise operator at each location is only assumed to be within η\etaη of the identity, and the analysis costs a factor of 222 in the error rate and a factor of eee overall. The threshold condition for general noise (Definition 21) is

e(Ak+1)(2η)k+1  <  2η,e\binom{A}{k+1}(2\eta)^{k+1} \;<\; 2\eta,e(k+1A​)(2η)k+1<2η,

and the corresponding threshold (Definition 22) is ηc′=12(e(Ak+1))−1/k\eta_c' = \tfrac12\bigl(e\binom{A}{k+1}\bigr)^{-1/k}ηc′​=21​(e(k+1A​))−1/k, which is smaller than the threshold ηc\eta_cηc​ for probabilistic noise.

The assertion is that, for k≥1k\ge1k≥1, every error rate 0<η<ηc′0<\eta<\eta_c'0<η<ηc′​ satisfies the general-noise threshold condition.

Formalization Note As for the probabilistic threshold, the exponent is taken to be −1/k-1/k−1/k rather than the −k-k−k printed in equation 8.6.

Preamble
import Definitions.Def_ABOThreshold_model
Formal statement
namespace ABOThreshold

theorem threshold_general_lt_imp_condition (A k : ℕ) (hk : 1 ≤ k) (η : ℝ) (hη : 0 < η)
    (hlt : η < thresholdGeneral A k) : ThresholdConditionGeneral A k η := by sorry

end ABOThreshold
Source
Dorit Aharonov and Michael Ben-Or, Fault-Tolerant Quantum Computation With Constant Error Rate, arXiv:quant-ph/9906129v1, https://arxiv.org/abs/quant-ph/9906129, pp. 53-54, Definitions 21 and 22 (eqs. 8.5, 8.6)
Read-back

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

Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statements of this proposal, at the explicit request of the proposal owner. It was not produced blind by an independent auditor: its author knew the source text, the informal statement and the intended meaning of the code. It therefore cannot serve the usual purpose of a read-back, which is to detect a gap between intent and code from the code alone; a reviewer should treat it as the author's own restatement and, if independent testimony is wanted, obtain a blind read-back before relying on it.

Let AAA and kkk be natural numbers with k≥1k\ge1k≥1, and let η\etaη be a real number with η>0\eta>0η>0. Write e=exp⁡(1)e=\exp(1)e=exp(1) and let (Ak+1)\binom{A}{k+1}(k+1A​) denote the natural-number binomial coefficient cast to the reals (equal to 000 when A<k+1A<k+1A<k+1). Assume

η  <  12(e(Ak+1))−1/k,\eta \;<\; \tfrac12\Bigl(e\binom{A}{k+1}\Bigr)^{-1/k},η<21​(e(k+1A​))−1/k,

where the parenthesised base is raised to the real exponent −1/k-1/k−1/k as a nonnegative real power; when A<k+1A<k+1A<k+1 this base is 000 and the bound is 000, so the hypothesis is then unsatisfiable.

The conclusion is

e(Ak+1) (2η) k+1  <  2η,e\binom{A}{k+1}\,(2\eta)^{\,k+1} \;<\; 2\eta,e(k+1A​)(2η)k+1<2η,

with k+1k+1k+1 a natural-number exponent. No upper bound on η\etaη beyond the displayed hypothesis is assumed.

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