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 — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Confidence Sets and Inversion
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian Orthogonal Decomposition and Quadratic Forms
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Reeb Stability and Global Foliation Constructions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tests, Neyman–Pearson and Valid P-values
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
These examples calculate exact normal and uniform-maximum pivot intervals, invert a binomial lower-tail test to obtain a conservative upper confidence limit, and show directly how atoms can make a nominal discrete pivot interval overcover. The unknown-variance normal interval uses the actual MSF-35 exact t-pivot and quantile suppliers; its proof records the common full-measure sample space, nuisance variance, and calibrated inversion.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A discrete pivot can give conservative coverage
Example
Let , let the measurable observation space be , and for each assign probability to each of . Let have this law, put , choose nominal level , and use the central pivot set . The inverted set is Its coverage is , so it is conservative for the nominal level. The atom masses prevent the equal-tail quantiles from calibrating the central acceptance set to probability .
Facts & Assumptions
Given: The finite model and the procedure specified in the Example.
Probability measures and probability spaces: a probability measure has total mass one.
Pivotal quantities: a pivot has a parameter-free sampling law.
Confidence sets and coverage: coverage is the probability that the true parameter belongs to the procedure's output.
Coverage from pivot inversion and exact calibration: pivot inversion has at-least coverage when the acceptance set has probability at least the target level.
Sigma-algebras: a sigma-algebra is an algebra of subsets closed under countable unions.
Statistical experiments: an experiment fixes a measurable observation space and a probability law for each parameter.
Verification
The full power set is an algebra of subsets closed under countable unions, so it is a sigma-algebra by [F5]. Explicitly set for every . These values are nonnegative and have total mass . For a pairwise disjoint sequence , . Thus it is countably additive, hence a probability measure, and specifies the experiment family in [F6]. Under , assigns mass to each of , independently of ; hence is a pivot with .
Define and the generalized quantile . By the definition of , the event is , which occurs for all three possible observations. Thus its probability and coverage equal ; this exceeds , while [F4] also applies since . The pivot cdf is below , on , on , and from onward. Thus the generalized and quantiles are and , and their closed interval contains all atoms.
Known-variance normal mean interval
Example
Assume AC as in the library's construction of the normal laws. Observe one real-valued , where , the known standard deviation , and . Define , and let be its -quantile. Then has exact confidence level .
Facts & Assumptions
Given: AC; an experiment indexed by with , fixed known , and .
The Axiom of Choice: assume the axiom of choice, as required by the normal-law definition used here.
Standard normal and normal laws: is the law of an affine image of a standard normal variable, whose density is positive on .
Pivotal quantities: a parameter-indexed family of measurable maps is a pivot when its pushforward law is the same at every parameter.
Confidence sets and coverage: the confidence set is measured by the probability that it contains the true parameter.
Coverage from pivot inversion and exact calibration: an acceptance set of pivot probability yields exact coverage .
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and : a continuous real function on a closed interval takes every value between its endpoint values.
Continuity from below for measures: for increasing measurable sets, the measure of their union is the supremum of their measures.
Verification
Let have the standard normal law. Its density is , positive everywhere and bounded above by , with total mass one by [F1]. Thus satisfies for every , proving strict increase and continuity. The events and increase to the whole space as integer ; [F6] gives and , hence . Choose finite endpoints bracketing ; [F5] gives a quantile between them, and strict increase gives uniqueness.
The standard normal density is symmetric and has no atoms. Therefore , and the probability of is .
For every candidate mean , is measurable and has standard normal law under , so it is a pivot. The event is exactly ; applying [F4] and [F3] gives exact coverage for every .
Exact unknown-variance normal t interval
Example
Assume AC and let . For each fixed variance , let be the full product law on , with mean parameter and independent coordinates. Use the common sample space , where and is the nonnegative square root, with the trace Borel sigma-algebra; write for the restriction of to this sample space. Let , and write for the unique -quantile of the law. For , the interval has exact coverage , for every and every fixed . The same formula works for all unknown variances.
Facts & Assumptions
Given: AC, , , and for each the iid normal experiment indexed by .
The Axiom of Choice: AC is the axiom assumed by the normal-law construction and the two Gaussian suppliers used here.
Normal sample mean and residual are independent, giving the exact t pivot: for an iid sample with , almost surely and has the law.
Student t and Fisher F CDFs are continuous and strictly increasing on their supports: for , the CDF is continuous, strictly increasing, symmetric about zero, and has limits zero and one, so each has a unique quantile.
Confidence sets and coverage: a confidence-set procedure has measurable membership sections, and its coverage at a parameter is the probability of the corresponding section.
Pivotal quantities: a family of measurable maps, one for each parameter, is a pivot when every map has the same pushforward probability law.
Coverage from pivot inversion and exact calibration: inversion of a pivot acceptance set of probability gives exact coverage at every parameter.
The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by the open sets; on we use the trace of the Borel sigma-algebra of .
Statistical experiments: an experiment consists of a measurable sample space, a parameter set, and one probability law on that space for each parameter.
Verification
For all , . The residual map is linear and orthogonal to , so Pythagoras gives ; the reverse triangle inequality then gives . Hence is continuous, is open, and its trace Borel sets form a sigma-algebra by [F6]. By [F1], every full law gives probability one, so its restriction remains a probability measure; [F7] therefore gives the stated experiment for each fixed .
Put , which exists uniquely by [F2]. Symmetry and continuity give ; strict increase and imply . Since , symmetry gives ; continuity means neither endpoint is an atom, so .
For each candidate mean , define on . Its denominator is positive there, so it is continuous and hence measurable on the subspace by the open-set definition of its trace Borel sigma-algebra [F6]. For every Borel , the restricted probability satisfies , and [F1] gives this value as the common probability because the full law assigns probability one to . Thus is a pivot by [F4].
Inverting gives by solving the two inequalities, and each membership section is measurable because is measurable. Step 1.2 gives the pivot mass ; the pivot-inversion theorem [F5] and confidence-set definition [F3] therefore give exact coverage for every mean and every fixed variance.
Uniform maximum pivot interval
Example
Let , , and take the experiment with sample space and its Borel sigma-algebra, where under each the coordinate random variables are independent, each with for , for , and for . Write and let . The pivot has distribution function on . Setting gives the exact confidence set with coverage .
Facts & Assumptions
Given: The experiment specified in the Example, , and .
Independent random elements: independence means independence of the sigma-algebras generated by the coordinate random elements.
Independent random elements have product joint law: the joint law of finitely many independent random elements is the product of their marginal laws.
Pivotal quantities: a pivot has parameter-free pushforward law.
Confidence sets and coverage: coverage is the probability that the true parameter is in the set.
Coverage from pivot inversion and exact calibration: pivot inversion of a measurable acceptance set with mass has exact coverage .
Statistical experiments: an experiment assigns a probability law to each parameter on one measurable observation space.
The Borel sigma-algebra of a topological space: the Borel sigma-algebra is generated by the open sets of the underlying topological space.
Verification
The sample sigma-algebra is the Borel sigma-algebra of by [F7]. The maximum map satisfies , so it is continuous. The preimages of open sets are therefore open; since the Borel sigma-algebra is generated by open sets, preimages of every Borel set are Borel and is measurable. Also is continuous because . The coordinate variables are independent by [F1], and [F2] gives their product joint law.
If , then . For the probability is , and for it is . This law does not depend on , so is a pivot by [F3].
The distribution function established in step 1.2 is continuous. Therefore . By [F5], pivot inversion gives exact coverage.
Since , the inequality is equivalent to . Thus the inverted set is , and [F4] identifies its coverage with the probability computed in step 2.1.
Binomial upper confidence limit by lower-tail test inversion
Example
Let the observation space be with its full power set, , , , and let have mass , , with . Define . For , let be the unique solution of , and set . Then is the confidence set obtained by inverting the lower-tail tests that reject when . Its coverage is at least ; discreteness can make it conservative.
Facts & Assumptions
Given: The finite binomial model, , , and .
The binomial theorem over an arbitrary commutative ring: the binomial expansion holds for real and .
Confidence sets and coverage: coverage is the probability that the true parameter belongs to the confidence set.
Coverage from test inversion: inverting measurable point-null acceptance events of probability at least gives coverage at least .
The set of -element subsets and the binomial coefficient : counts the -element subsets of an -element set.
Sigma-algebras: a sigma-algebra is an algebra of subsets closed under countable unions.
Probability measures and probability spaces: a probability measure is a measure of total mass one on a measurable space.
Statistical experiments: an experiment fixes a measurable observation space and a probability law for each parameter.
Test size and power: a test has level when its size, the supremum of its rejection probabilities over the null, is at most .
On an interval , for continuous on and differentiable at every interior point: throughout gives nondecreasing, gives increasing, and give the two decreasing forms; conversely a nondecreasing has and a nonincreasing has wherever it is differentiable, and no strict converse is claimed: a continuous function on an interval with strictly negative derivative at every interior point is strictly decreasing on that interval.
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and : a continuous real function on a closed interval takes every value between its endpoint values.
Verification
The full power set of is an algebra closed under countable unions, hence a sigma-algebra by [F5]. The binomial theorem [F1] gives ; all terms are nonnegative for , so [F6] makes the displayed masses a probability measure, including . These laws form an experiment as in [F7].
For , count pairs consisting of a -element subset of an -element set and a distinguished element inside it. Counting in the two orders gives for . Counting instead a distinguished element outside the subset gives for , by [F4]. The first identity is not used at : in differentiating , that boundary term is zero, so the first derivative sum starts at , while the second identity includes . Since is a polynomial, it is continuous on , and for termwise differentiation and the two identities give When , the first sum is empty and the term of the second sum gives the same formula. By [F9], is strictly decreasing on . Also and because . Applying [F10] to this continuous polynomial on gives a point with ; strict decrease makes it unique.
For each fixed candidate , is nondecreasing in integer . Let be the least with , which exists because . The deterministic test function is ; it is measurable on this finite space. Its rejection event is , whose probability is if , and otherwise is . The null is , and the alternative is nonempty; by [F8] the test size equals this rejection probability and is at most .
For an observed , strict decrease of in makes ; for , the set is . Thus is precisely the inversion of those acceptance events. The level calculation in step 2.1 and [F3] imply its coverage is at least , in the sense of [F2].
Remarks
The finite binomial size calculation uses the current Test size and power interface, and Coverage from test inversion supplies the stated coverage implication.
Sources
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slide 9, PDF p. 14
- Anna Mikusheva, MIT 14.381, Lecture 11: Confidence Sets, §2, PDF pp. 1–3
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slide 8, PDF p. 10
- Anna Mikusheva, MIT 14.381, Lecture 11: Confidence Sets, §2, PDF p. 3
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slides 8 and 12, PDF pp. 10 and 20
- Karl B. Gregory, USC STAT 713, Lecture 14: Confidence Intervals and Sets, slide 9, Uniform maximum pivot exercise, PDF p. 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