Bonferroni correction
DefinitionBonferroni rejection set#✓fully proved
The hypotheses rejected by the Bonferroni procedure at level α: those whose p-value is
at most α / m.
noncomputable def bonferroniRejections (α : ℝ) (p : Fin m → ℝ) : Finset (Fin m) :=
Finset.univ.filter fun i => p i ≤ α / m
Used by 1
TheoremUnion bound for valid p-values#✓fully proved
If every true-null p-value is valid and
c ∈ [0, 1], the probability that some true null has p-value at most c is at most
|H0| c. No independence is assumed.
theorem measure_exists_mem_le_le (μ : Measure Ω) (p : Fin m → Ω → ℝ) (H0 : Finset (Fin m))
(hnull : ∀ i ∈ H0, IsValidPValue μ (p i)) {c : ℝ} (hc : c ∈ Set.Icc (0 : ℝ) 1) :
μ {ω | ∃ i ∈ H0, p i ω ≤ c} ≤ ENNReal.ofReal (H0.card * c)
def IsValidPValue (μ : Measure Ω) (X : Ω → ℝ) : Prop :=
∀ t ∈ Set.Icc (0 : ℝ) 1, μ {ω | X ω ≤ t} ≤ ENNReal.ofReal t
MathlibExt/Probability/Statistics/MultipleTesting/Basic.lean:57
Uses 1 · Used by 3
TheoremBonferroni inequality#✓fully proved
If every true-null p-value is valid, the probability that some
true null has p-value at most α / m is at most α |H0| / m, for α ∈ [0, 1]. No
independence is assumed. (For m = 0 there is no hypothesis and both sides are 0.)
theorem measure_exists_le_div_le (μ : Measure Ω) (p : Fin m → Ω → ℝ) (H0 : Finset (Fin m))
(hnull : ∀ i ∈ H0, IsValidPValue μ (p i)) {α : ℝ} (hα₀ : 0 ≤ α) (hα₁ : α ≤ 1) :
μ {ω | ∃ i ∈ H0, p i ω ≤ α / m} ≤ ENNReal.ofReal (α * H0.card / m)
def IsValidPValue (μ : Measure Ω) (X : Ω → ℝ) : Prop :=
∀ t ∈ Set.Icc (0 : ℝ) 1, μ {ω | X ω ≤ t} ≤ ENNReal.ofReal t
MathlibExt/Probability/Statistics/MultipleTesting/Basic.lean:57
Sources
- Bonferroni (1936); Dunn (1961).
Uses 2 · Used by 1
TheoremThe Bonferroni procedure controls the FWER#✓fully proved
If every true-null p-value is valid, the
probability that the Bonferroni procedure at level α ∈ [0, 1] rejects at least one true null
is at most α.
theorem measure_bonferroni_familywiseError_le (μ : Measure Ω) (p : Fin m → Ω → ℝ)
(H0 : Finset (Fin m)) (hnull : ∀ i ∈ H0, IsValidPValue μ (p i)) {α : ℝ} (hα₀ : 0 ≤ α)
(hα₁ : α ≤ 1) :
μ {ω | (bonferroniRejections α (fun i => p i ω) ∩ H0).Nonempty} ≤ ENNReal.ofReal α
def IsValidPValue (μ : Measure Ω) (X : Ω → ℝ) : Prop :=
∀ t ∈ Set.Icc (0 : ℝ) 1, μ {ω | X ω ≤ t} ≤ ENNReal.ofReal t
MathlibExt/Probability/Statistics/MultipleTesting/Basic.lean:57
noncomputable def bonferroniRejections (α : ℝ) (p : Fin m → ℝ) : Finset (Fin m) :=
Finset.univ.filter fun i => p i ≤ α / m
MathlibExt/Probability/Statistics/MultipleTesting/Bonferroni.lean:46
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.