Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Network failure bound in the quasi-independent stochastic model: ≤np\le n p≤np

Proved
KLZ97.network_failure_le_card_mul

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

measure-theoryprobabilityquantum-error-correction

The paper's bound on the probability that a network's computation fails. A network with nnn error locations obeying the quasi-independent stochastic error model with error probability ppp fails — meaning that at least one error location carries a non-identity operator — with probability at most npn pnp. This is the estimate behind the remark that high probability of success is assured as soon as p≪1/np \ll 1/np≪1/n.

Preamble
import Mathlib
import Definitions.Def_KLZ97_model
Formal statement
namespace KLZ97

theorem network_failure_le_card_mul {Ω ι : Type*} [MeasurableSpace Ω]
    (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ]
    (locs : Finset ι) (fail : ι → Set Ω) (p : ENNReal)
    (hmodel : QuasiIndepStochastic μ locs fail p) :
    μ (⋃ i ∈ locs, fail i) ≤ locs.card * p := 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 I.B (Assumptions and error models), p. 4
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 Ω\OmegaΩ be a measurable space, μ\muμ a probability measure on it, ι\iotaι an arbitrary index type, locs\mathrm{locs}locs a finite set of indices, (Fi)i∈ι(F_i)_{i \in \iota}(Fi​)i∈ι​ a family of subsets of Ω\OmegaΩ, and ppp an element of [0,∞][0,\infty][0,∞].

Assume the hypothesis that for every finite S⊆locsS \subseteq \mathrm{locs}S⊆locs,

μ(⋂i∈SFi)≤p ∣S∣.\mu\Big(\bigcap_{i \in S} F_i\Big) \le p^{\,|S|} .μ(i∈S⋂​Fi​)≤p∣S∣.

The conclusion is

μ(⋃i∈locsFi)  ≤  ∣locs∣⋅p,\mu\Big(\bigcup_{i \in \mathrm{locs}} F_i\Big) \;\le\; |\mathrm{locs}| \cdot p ,μ(i∈locs⋃​Fi​)≤∣locs∣⋅p,

with ∣locs∣|\mathrm{locs}|∣locs∣ the number of elements of locs\mathrm{locs}locs, regarded as an element of [0,∞][0,\infty][0,∞], and the arithmetic performed there.

Points to note. The sets FiF_iFi​ are arbitrary subsets and are not assumed measurable; the measure of a non-measurable set is its outer measure. The union is taken only over i∈locsi \in \mathrm{locs}i∈locs, while the family is indexed by all of ι\iotaι. The hypothesis is used only through its instances; its case S=∅S = \emptysetS=∅ says μ(Ω)≤1\mu(\Omega) \le 1μ(Ω)≤1, which is automatic for a probability measure, and its singleton cases say μ(Fi)≤p\mu(F_i) \le pμ(Fi​)≤p. If locs\mathrm{locs}locs is empty the conclusion reads μ(∅)≤0\mu(\emptyset) \le 0μ(∅)≤0, and if p=∞p = \inftyp=∞ or locs≠∅\mathrm{locs} \neq \emptysetlocs=∅ with p≥1p \ge 1p≥1 the bound is trivially satisfied. No independence of the events is assumed beyond the stated family of inequalities, and no lower bound is asserted.

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