Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 2 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 2 also cleared it.

Valid p-values, Bonferroni, simultaneous coverage

1 · Prerequisites

2 · Summary

This page defines a fixed finite family of null hypotheses, null-valid p-values, the true-null set, FWER, and FDR. It proves strong FWER control for the equal-weight Bonferroni rule and joint coverage for finitely many marginal confidence sets when their error allocations sum to at most the target level. Both arguments use event subadditivity, so they allow arbitrary dependence. Individual test and confidence-set validity must still be established under their stated sampling laws; no data-dependent family-selection guarantee is asserted.

The testing interfaces come from finite-sample-tests-neyman-pearson-and-valid-p-values, the coverage convention from confidence-sets-pivots-and-test-inversion, and the probability-space identities from probability-spaces-random-variables-and-expectation.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Null-valid p-values and familywise and false-discovery error rates

Definition

Let E=((X,A),Θ,(Pθ)θ∈Θ) be a statistical experiment (Statistical experiments), and fix an integer m≥1 before observing the data. Write [m]={1,…,m}. A finite family of null hypotheses is a fixed list H01,…,H0m with each H0i⊆Θ. For each i∈[m], let pi:X→[0,1] be a p-value statistic (Valid p-values). It is valid for H0i when

Pθ{x:pi(x)≤u}≤u(θ∈H0i, 0≤u≤1).

If H0i=∅, this universal condition is vacuous and i never belongs to a true-null index set. For a nonempty null it agrees with the published valid-p-value definition. The family may have any joint dependence among its p-values. Validity is required only under the corresponding null laws; a p-value statistic alone does not imply validity.

For θ∈Θ, the true-null index set is I0(θ):={i∈[m]:θ∈H0i}. A fixed deterministic multiple-testing rule is a family of measurable rejection events Di∈A, one for each i∈[m]. Its total number of rejections and number of false rejections at parameter θ are R:=∑i=1m1Di,Vθ:=∑i∈I0(θ)1Di. Its familywise error rate (FWER) at θ is Pθ(Vθ≥1), and its false discovery rate (FDR) at θ is Eθ ⁣[VθR∨1], where R∨1=max⁡{R,1}. The random variable Vθ/(R∨1) is the false discovery proportion (FDP). Strong FWER control at level α means that this FWER is at most α for every θ∈Θ, including parameters for which only some of the null hypotheses are true. The denominator convention makes the FDP zero when no hypothesis is rejected.

If the testing rule uses auxiliary randomization, include that randomizer in the observation and its sigma-algebra before defining the rejection events Di.

These quantities are well-defined: the finite sums of indicators are measurable, 0≤Vθ≤R, and 0≤Vθ/(R∨1)≤1, so the ratio is integrable under each probability law (Expectation of a nonnegative or integrable random variable).

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Bonferroni simultaneous coverage

Statement

Let E=((X,A),Θ,(Pθ)θ∈Θ) be a statistical experiment (Statistical experiments) with nonempty parameter set Θ. Fix m≥1 coordinate targets ψi:Θ→Ψi and procedures Ci:X→P(Ψi), i∈[m], where P(Ψi) denotes the set of all subsets of Ψi. For every θ∈Θ, suppose each membership event Ai(θ):={x∈X:ψi(θ)∈Ci(x)} belongs to A and has marginal coverage Pθ(Ai(θ))≥1−αi, where 0≤αi≤1 and ∑i=1mαi≤α≤1. Then, for every θ∈Θ, Pθ{ψi(θ)∈Ci(X) for every i∈[m]}≥1−α. Thus the family of marginal confidence sets has simultaneous coverage at least 1−α. No independence assumption is needed.

Facts & Assumptions

Given: A statistical experiment with nonempty parameter set, a fixed finite family of targets and procedures, measurable membership events Ai(θ) for every i and θ, and marginal coverage bounds Pθ(Ai(θ))≥1−αi with ∑iαi≤α≤1.

[F1]

Statistical experiments: for each θ, Pθ is a probability measure on the sample sigma-algebra.

[F2]

Confidence sets and coverage: a confidence-set procedure has a measurable membership section for every candidate parameter, and its coverage at θ is the probability that the reported set contains θ.

[F3]

Basic identities for a probability measure: complements satisfy P(Ac)=1−P(A), and a finite union of measurable events has probability at most the sum of their probabilities.

[A1]

For every θ∈Θ and i∈[m], Ai(θ)∈A and Pθ(Ai(θ))≥1−αi.

Proof

technique · direct

Given: The experiment with nonempty parameter set, targets, confidence procedures, and marginal coverage assumptions in the statement.

1.1givenA1F2F3construct

For each i, define the induced full-parameter confidence set Di(x):={η∈Θ:ψi(η)∈Ci(x)}. Each membership section of Di is Ai(η), measurable by [A1], so [F2] applies and its coverage at θ is Pθ(Ai(θ))≥1−αi. The miss event Bi(θ):=Ai(θ)c is measurable and, by [F3], satisfies Pθ(Bi(θ))=1−Pθ(Ai(θ))≤αi.

2.1givenF1F3step 1.1algebra∎

Failure of simultaneous coverage is ⋃i=1mBi(θ). By finite subadditivity [F3] and step 1.1, its probability is at most ∑i=1mαi≤α. Taking the complement gives the stated simultaneous coverage bound. This argument allows the membership events to be dependent.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Strong familywise error control by Bonferroni

Statement

Let H01,…,H0m be a fixed finite family with m≥1 in a statistical experiment, and let pi be a valid p-value for H0i as in Null-valid p-values and familywise and false-discovery error rates. For α∈[0,1], reject H0i exactly when pi(X)≤α/m. Then, for every θ in the parameter space, Pθ{at least one true null is rejected}=Pθ(Vθ≥1)≤α. The bound holds for every true-null configuration, including the global null and configurations with false nulls, and for arbitrary dependence among the p-values. This is strong FWER control; it is not an FDR guarantee.

Facts & Assumptions

Given: A fixed family of m≥1 null hypotheses, p-values valid under their respective nulls, and α∈[0,1].

[F1]

Null-valid p-values and familywise and false-discovery error rates: I0(θ)={i:θ∈H0i}, and FWER is Pθ(Vθ≥1), where Vθ counts rejected true nulls.

[F2]

Valid p-values yield level tests for nonempty disjoint alternatives: for a nonempty null and a p-value valid for it, every threshold u∈[0,1] satisfies Pθ(pi(X)≤u)≤u for each parameter in that null.

[F3]

Basic identities for a probability measure: for a finite family of measurable events, the probability of their union is at most the sum of their probabilities, including the empty family.

Proof

technique · direct

Given: A fixed family of valid p-values, m≥1, and 0≤α≤1.

1.1givenF1F2

Set u=α/m∈[0,1]. For each i∈I0(θ), θ∈H0i, so H0i is nonempty; the event Ai:={x:pi(x)≤u} is measurable because pi is a statistic. By validity and [F2], Pθ(Ai)≤u=α/m.

2.1givenF1F3step 1.1algebra∎

The event of at least one false rejection is exactly {Vθ≥1}=⋃i∈I0(θ)Ai. By [F3] and step 1.1, Pθ(Vθ≥1)≤∑i∈I0(θ)Pθ(Ai)≤∣I0(θ)∣ α/m≤α. If I0(θ)=∅, the union and sum are empty and the FWER is 0. Since this argument holds for every θ and nowhere uses a joint dependence condition, it proves the strong, arbitrary-dependence claim.

5 · Examples, counterexamples and false statements

None yet.

Sources