Network failure bound in the quasi-independent stochastic model:
ProvedKLZ97.network_failure_le_card_mulThe paper's bound on the probability that a network's computation fails. A network with error locations obeying the quasi-independent stochastic error model with error probability fails — meaning that at least one error location carries a non-identity operator — with probability at most . This is the estimate behind the remark that high probability of success is assured as soon as .
import Mathlib import Definitions.Def_KLZ97_model
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 KLZ97Read-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 be a measurable space, a probability measure on it, an arbitrary index type, a finite set of indices, a family of subsets of , and an element of .
Assume the hypothesis that for every finite ,
The conclusion is
with the number of elements of , regarded as an element of , and the arithmetic performed there.
Points to note. The sets 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 , while the family is indexed by all of . The hypothesis is used only through its instances; its case says , which is automatic for a probability measure, and its singleton cases say . If is empty the conclusion reads , and if or with the bound is trivially satisfied. No independence of the events is assumed beyond the stated family of inequalities, and no lower bound is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.