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.
Valid p-values, Bonferroni, simultaneous coverage
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- Confidence Sets and Inversion
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Tests, Neyman–Pearson and Valid P-values
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
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
Null-valid p-values and familywise and false-discovery error rates
Definition
Let be a statistical experiment (Statistical experiments), and fix an integer before observing the data. Write . A finite family of null hypotheses is a fixed list with each . For each , let be a p-value statistic (Valid p-values). It is valid for when
If , this universal condition is vacuous and 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 A fixed deterministic multiple-testing rule is a family of measurable rejection events , one for each . Its total number of rejections and number of false rejections at parameter are Its familywise error rate (FWER) at is , and its false discovery rate (FDR) at is where . The random variable 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 .
These quantities are well-defined: the finite sums of indicators are measurable, , and , so the ratio is integrable under each probability law (Expectation of a nonnegative or integrable random variable).
Bonferroni simultaneous coverage
Statement
Let be a statistical experiment (Statistical experiments) with nonempty parameter set . Fix coordinate targets and procedures , , where denotes the set of all subsets of . For every , suppose each membership event belongs to and has marginal coverage where and . Then, for every , Thus the family of marginal confidence sets has simultaneous coverage at least . 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 for every and , and marginal coverage bounds with .
Statistical experiments: for each , is a probability measure on the sample sigma-algebra.
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 .
Basic identities for a probability measure: complements satisfy , and a finite union of measurable events has probability at most the sum of their probabilities.
For every and , and .
Proof
Given: The experiment with nonempty parameter set, targets, confidence procedures, and marginal coverage assumptions in the statement.
For each , define the induced full-parameter confidence set . Each membership section of is , measurable by [A1], so [F2] applies and its coverage at is . The miss event is measurable and, by [F3], satisfies .
Failure of simultaneous coverage is . By finite subadditivity [F3] and step 1.1, its probability is at most . Taking the complement gives the stated simultaneous coverage bound. This argument allows the membership events to be dependent.
Strong familywise error control by Bonferroni
Statement
Let be a fixed finite family with in a statistical experiment, and let be a valid p-value for as in Null-valid p-values and familywise and false-discovery error rates. For , reject exactly when . Then, for every in the parameter space, 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 null hypotheses, p-values valid under their respective nulls, and .
Null-valid p-values and familywise and false-discovery error rates: , and FWER is , where counts rejected true nulls.
Valid p-values yield level tests for nonempty disjoint alternatives: for a nonempty null and a p-value valid for it, every threshold satisfies for each parameter in that null.
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
Given: A fixed family of valid p-values, , and .
Set . For each , , so is nonempty; the event is measurable because is a statistic. By validity and [F2], .
The event of at least one false rejection is exactly . By [F3] and step 1.1, . If , the union and sum are empty and the FWER is . 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
- Jelle J. Goeman and Aldo Solari, The Sequential Rejection Principle of Familywise Error Control, Section 3, Eq. (11)
- William Fithian, STAT 210A Lecture 26: Multiple Testing, PDF pp. 1–2 and 12–13
- William Fithian, STAT 210A Lecture 26: Multiple Testing, PDF pp. 9–11
- Jelle J. Goeman and Aldo Solari, The Sequential Rejection Principle of Familywise Error Control, Section 3, Eq. (13)
- Jelle J. Goeman and Aldo Solari, The Sequential Rejection Principle of Familywise Error Control, Section 3, Eqs. (11)–(13)
- William Fithian, STAT 210A Lecture 26: Multiple Testing, PDF pp. 2–4