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 — Examples
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 ℝ
- Valid p-values, Bonferroni, simultaneous coverage
2 · Summary
One finite model uses discrete superuniform p-values and a mixed configuration to compare FWER with FDR; another constructs confidence intervals with identical membership events to show that Bonferroni simultaneous coverage remains valid under dependence.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Simultaneous coverage for dependent interval sets
Example
Take the location experiment with and sample space : under parameter , equals with probability for each . For both coordinates set and report the interval , . Each interval has marginal coverage . The two coverage events are identical, so their simultaneous coverage is also . With and , Bonferroni guarantees at least ; the bound is conservative here because of perfect dependence.
Facts & Assumptions
Given: The location experiment and two confidence-set procedures in the Example, together with the confidence-set definition and simultaneous-coverage theorem below.
Statistical experiments: an experiment is a measurable sample space, parameter set, and family of probability measures on that sample space.
Confidence sets and coverage: a confidence-set procedure has a measurable membership section for each candidate parameter, and its coverage is the probability that it contains the true parameter.
Bonferroni simultaneous coverage: if marginal confidence sets have coverage at least and , their joint coverage is at least without an independence assumption.
The sample space is . For each , places mass at each of the ten distinct points , ; and .
Verification
Given: The family of ten-point laws, targets, and interval procedures in the Example.
For each candidate , the membership section of either interval procedure is , a Borel set, so [F2] applies. Under , the true value is included exactly for ; hence each marginal coverage is .
The two interval procedures are equal for every observation, so their membership events coincide and joint coverage is . Since , [F3] gives the general lower bound , which this example satisfies. The equality of the two events shows that independence is not assumed.
A discrete p-value family under global and mixed nulls
Example
Let , , and use the finite sample space with its full power-set sigma-algebra. The parameter set is . Under , give each point , , probability . Under , give each point , , probability . Define , , with null hypotheses and . For , Bonferroni rejects when . Under the global null , both p-values are the same discrete uniform variable: FWER and FDR are both . Under the mixed configuration , is always rejected but is not a true null; is a valid discrete p-value. There FWER is and FDR is . The true-null p-values are perfectly dependent under .
Facts & Assumptions
Given: The two-parameter finite experiment, p-value statistics and null hypotheses in the example, the Bonferroni rule at , and the definitions and theorem below.
Statistical experiments: an experiment is a measurable sample space, parameter set, and family of probability measures on that sample space.
Null-valid p-values and familywise and false-discovery error rates: is valid for when for all and ; FWER is and FDR is .
Strong familywise error control by Bonferroni: for any fixed family of valid p-values, rejecting each at controls FWER by for every true-null configuration and arbitrary dependence.
, , with , , , , , and are the four-point uniform laws specified in the Example.
Verification
Given: The finite laws and p-value family in the Example.
Each assigns mass to four distinct points, so its masses sum to . Under either parameter where is true, namely , and under both parameters where is true, the corresponding null p-value has the law of uniform on . For every , ; hence both p-values are valid for their stated nulls by [F2].
At , and . A true null is rejected exactly when , which has probability . On that event and ; otherwise both counts are zero. Thus FWERFDR.
At , , always, and . A true null is rejected exactly when , so FWER. On that event and otherwise , giving FDR. The theorem [F3] also gives the strong FWER bound at both parameter values, without an independence hypothesis.