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.
Confidence Sets and Inversion
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- 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 confidence-set procedures through measurable membership events and repeated-sampling coverage. It then treats two general constructions: inverting point-null acceptance regions and inverting a parameter-free pivot over a calibrated measurable set. The coverage arguments are event identities, so they do not require a topology or sigma-algebra on the parameter set.
Exact interval coverage requires exact probability calibration of the actual acceptance interval. For discrete pivots, quantile endpoints can place atoms inside the acceptance set and give conservative coverage. A randomized test must include its auxiliary randomization in the observation before its acceptance event can be inverted. The exact normal t interval applies the Gaussian pivot and t-quantile suppliers from the preceding Gaussian-decomposition page. Its carrier records their hypotheses and restricts the experiment to the common full-measure set where the sample standard deviation is positive.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Confidence sets and coverage
Definition
Let be a statistical experiment as in Statistical experiments, and assume . A confidence-set procedure is a map , where , such that, for every , its membership section belongs to . Its coverage at is , and its confidence level is , the greatest lower bound of those coverage values. For , it has coverage at least if for every .
Only membership sections need to be measurable; no sigma-algebra on the parameter set is assumed. The parameter is fixed in the repeated-sampling coverage probability.
Pivotal quantities
Definition
Let be a statistical experiment with , and let be a measurable space. A family of measurable maps , one for each , is a pivot if the pushforward law is the same probability measure for every . Each section is a random element on , so its pushforward is a probability measure by The law of a random element is a probability measure. No measurability in is asserted or needed.
For , a pivot is a parameter-indexed family of measurable real-valued quantities with a common sampling law. The maps may depend on the unknown parameter. A pivot need not be invertible in the parameter, and its inversion need not be an interval.
Coverage from pivot inversion and exact calibration
Statement
Let be an experiment with nonempty . Let be a pivot with common law , and let . Define If , then is a confidence set with coverage at least . If , its coverage is exactly for every parameter value. For an interval in , exactness requires calibration of the actual probability ; quantile labels alone do not remove endpoint atoms.
Facts & Assumptions
Given: A nonempty parameter set , a statistical experiment, , a pivot with common law , and a measurable acceptance set with .
Pivotal quantities: each section is measurable and has pushforward law , independent of .
Confidence sets and coverage: a set-valued procedure is measurable when every parameter-membership section is measurable, and coverage is the probability of that section under the corresponding .
Proof
For each , the membership section of is . It is in because is measurable and . Thus is a confidence-set procedure by [F2].
For every , . Equality holds for every when ; measurability was established in step 1.1.
Coverage from test inversion
Statement
Let be an experiment with nonempty , and let . For each , let be the acceptance event of a test of the point null , on the full observation space, including any auxiliary randomization. Suppose for every . Then is a confidence set with coverage at least .
The probability bound is the point-null level condition written in terms of acceptance events. For a randomized test, a rejection-probability function on the original data space is not itself an acceptance event; the auxiliary randomization must be part of the observation before applying this statement.
Facts & Assumptions
Given: An experiment on , a nonempty parameter set , , and measurable events such that for every .
Confidence sets and coverage: a confidence-set procedure has measurable membership sections and coverage is the probability of the true parameter's section.
For each , is measurable and .
Proof
For each , the membership section of is , which belongs to by [A1]. Therefore is a confidence-set procedure by [F1].
For any , . Taking the infimum over the nonempty proves the asserted coverage level.
Remarks
For a deterministic test of a simple null with a nonempty alternative, the acceptance event is the complement of its rejection event, so its test function is . By Test size and power, its size is ; level therefore gives . For a randomized test, its rejection-probability function is not itself an event. Applying this theorem then requires the realized auxiliary randomizer to be part of the observation and the stated eventwise probability bound to hold on that full observation space.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Anna Mikusheva, MIT 14.381, Lecture 11: Confidence Sets, §1, PDF p. 1
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slides 2–3, PDF pp. 2–4
- Anna Mikusheva, MIT 14.381, Lecture 11: Confidence Sets, §2, PDF pp. 2–3
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slide 6, PDF p. 6
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slides 6 and 9, PDF pp. 6 and 14
- Anna Mikusheva, MIT 14.381, Lecture 11: Confidence Sets, §2, PDF p. 1
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slide 12, PDF p. 20