Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Below ηc\eta_cηc​ the threshold condition holds

Proved
ABOThreshold.threshold_lt_imp_condition

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

fault-toleranceprobabilityquantum-computing

Let AAA be the maximal number of locations in a rectangle and let k≥1k\ge 1k≥1 be the number of faulty sub-rectangles a rectangle tolerates. The threshold for probabilistic noise is ηc=(Ak+1)−1/k\eta_c = \binom{A}{k+1}^{-1/k}ηc​=(k+1A​)−1/k.

The assertion is that every error rate in the range 0<η<ηc0<\eta<\eta_c0<η<ηc​ satisfies the threshold condition

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

This is the sentence "it is easy to see that any η<ηc\eta<\eta_cη<ηc​ satisfies the threshold condition" that follows Definition 20, and it is what licenses using the threshold condition throughout the recursive analysis whenever the error rate is below the threshold.

Formalization Note The paper prints ηc\eta_cηc​ with exponent −k-k−k; the exponent −1/k-1/k−1/k is used here, since it is the one for which this statement is true and it is what solving the threshold condition gives.

Preamble
import Definitions.Def_ABOThreshold_model
Formal statement
namespace ABOThreshold

theorem threshold_lt_imp_condition (A k : ℕ) (hk : 1 ≤ k) (η : ℝ) (hη : 0 < η)
    (hlt : η < thresholdProb A k) : ThresholdCondition 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, p. 51, Definitions 19 and 20 (eqs. 7.3, 7.4)
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\ge 1k≥1, and let η\etaη be a real number with η>0\eta>0η>0. Write (Ak+1)\binom{A}{k+1}(k+1A​) for the natural-number binomial coefficient cast to the reals; it equals 000 when A<k+1A<k+1A<k+1. Suppose

η  <  (Ak+1)−1/k,\eta \;<\; \binom{A}{k+1}^{-1/k},η<(k+1A​)−1/k,

where the right-hand side is the real power of the nonnegative real base (Ak+1)\binom{A}{k+1}(k+1A​) with real exponent −1/k-1/k−1/k (so the right-hand side is 000 when A<k+1A<k+1A<k+1, making the hypothesis unsatisfiable in that case, given η>0\eta>0η>0).

The conclusion is

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

with a natural-number power k+1k+1k+1. No upper bound on η\etaη other than the displayed one 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