Network failure bound in the quasi-independent monotonic model:
ProvedKLZ97.network_failure_le_const_mul_card_mulThe same failure bound for the quasi-independent monotonic model. If the strength of the summands failing at a given set of error locations is bounded by , then a network with error locations fails with total strength at most .
import Mathlib import Definitions.Def_KLZ97_model
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 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 , elements of .
Assume that for every finite ,
The conclusion is
the product being taken in and associated as .
As in the previous statement, the sets are arbitrary (not assumed measurable), the union ranges over only, and the hypothesis at reads , which for a probability measure forces ; consequently the hypothesis cannot hold with , and the family of admissible constants is restricted accordingly. The hypothesis at singletons gives . Nothing is asserted in the other direction, and the conclusion is trivially true when or is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.