Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Base case: a 000-rectangle is sparse with probability 1−η1-\eta1−η

Proved
ABOThreshold.sparseProb_zero

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

fault-toleranceprobabilityquantum-computing

A 000-rectangle is a single location, and by Definition 18 a (0,k)(0,k)(0,k)-sparse set of faults there is the empty set: the pattern is sparse exactly when no fault occurred at that location.

The assertion is the resulting identity for the sparseness probability at level 000,

P(0)  =  1−η,P(0) \;=\; 1-\eta,P(0)=1−η,

for every error rate η\etaη. It is the base case of the induction of Lemma 10, and it also pins down the convention that the weight of a clean location is 1−η1-\eta1−η.

Preamble
import Definitions.Def_ABOThreshold_model
Formal statement
namespace ABOThreshold

theorem sparseProb_zero (A k : ℕ) (η : ℝ) : sparseProb A k η 0 = 1 - η := 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. 52, proof of Lemma 10 (base case r=0r=0r=0); Definition 18, p. 50
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 and let η\etaη be an arbitrary real number; no positivity or upper bound is assumed.

Recall that at level 000 a fault pattern is a single boolean, that the predicate holds exactly for the value false, and that the weight is η\etaη on true and 1−η1-\eta1−η on false. The claim is the identity

sparseProb(A,k,η,0)  =  1−η,\mathrm{sparseProb}(A,k,\eta,0) \;=\; 1-\eta,sparseProb(A,k,η,0)=1−η,

that is: the sum of the weights of those level-000 patterns satisfying the sparseness predicate equals 1−η1-\eta1−η. The parameters AAA and kkk play no role in the statement beyond appearing in the notation.

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