Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Network failure bound in the quasi-independent monotonic model: ≤Cnp\le C n p≤Cnp

Proved
KLZ97.network_failure_le_const_mul_card_mul

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

measure-theoryprobabilityquantum-error-correction

The same failure bound for the quasi-independent monotonic model. If the strength of the summands failing at a given set of kkk error locations is bounded by CpkC p^{k}Cpk, then a network with nnn error locations fails with total strength at most CnpC n pCnp.

Preamble
import Mathlib
import Definitions.Def_KLZ97_model
Formal statement
namespace KLZ97

theorem network_failure_le_const_mul_card_mul {Ω ι : Type*} [MeasurableSpace Ω]
    (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ]
    (locs : Finset ι) (fail : ι → Set Ω) (C p : ENNReal)
    (hmodel : QuasiIndepMonotone μ locs fail C p) :
    μ (⋃ i ∈ locs, fail i) ≤ C * 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 CCC, ppp elements of [0,∞][0,\infty][0,∞].

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

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

The conclusion is

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

the product being taken in [0,∞][0,\infty][0,∞] and associated as (C⋅∣locs∣)⋅p(C \cdot |\mathrm{locs}|) \cdot p(C⋅∣locs∣)⋅p.

As in the previous statement, the sets are arbitrary (not assumed measurable), the union ranges over locs\mathrm{locs}locs only, and the hypothesis at S=∅S = \emptysetS=∅ reads μ(Ω)≤C\mu(\Omega) \le Cμ(Ω)≤C, which for a probability measure forces C≥1C \ge 1C≥1; consequently the hypothesis cannot hold with C<1C < 1C<1, and the family of admissible constants is restricted accordingly. The hypothesis at singletons gives μ(Fi)≤Cp\mu(F_i) \le C pμ(Fi​)≤Cp. Nothing is asserted in the other direction, and the conclusion is trivially true when Cp=∞C p = \inftyCp=∞ or locs\mathrm{locs}locs is empty.

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