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.
Credible sets and frequentist coverage
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Adaptive empirical-Bayes credible-set calibration and failure
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Brownian Motion Construction and Continuity
- Central Limit Theorems
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- 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
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Detection and quantification limits
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Infinite Product Measures and Kolmogorov Extension
- 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
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- 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
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Posterior Prediction, Credible Sets, and Bayes Actions
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- 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 Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
Posterior credibility and frequentist coverage
Definition
Let be a measurable parameter space and, for each integer , let be a statistical experiment. Let be a proper prior on and let be a supplied posterior probability kernel under the associated prior-predictive law. For , a data-indexed set rule is a posterior credible set at level if its membership graph is in and for every in its declared data domain. At a fixed truth , its frequentist coverage is . For a truth class , the rule is asymptotically honest at level on if , and it is asymptotically exactly calibrated there if .
Definition references
Exact adaptive credible coverage by posterior-null deletion
Example
Assume AC and Countable Choice. Fix , , , , , an integer , , , and . Let a known positive singular-value sequence satisfy , and observe for , where the fixed truth and the are independent variables. For , use the product prior and its product Gaussian posterior with coordinate mean and variance . Select as a Borel global maximizer over of the marginal log-likelihood score assuming the score series is finite on a Borel data domain of probability one for the truths below and is upper semicontinuous in there. The branch uses the whole space and asserts no posterior probability on .
For , write . For , define , with .
For , let and let consist of those satisfying for every integer . Put and assume the fixed constants make each nonempty. There exists a single graph-measurable data-indexed set rule , depending only on the known model and class constants and not on or , such that on it has posterior mass , its uniform frequentist coverage satisfies and its -diameter has the no-log rate uniformly in the following sense: for every there is such that
Example references
Uniform conservative coverage of an inflated empirical-Bayes ball
The lower-selector bracket used in the diameter proof
Szabó, van der Vaart and van Zanten (2015), Theorem 3.6 and §5. The null-deletion construction is a local consequence for the unrestricted set-rule formulation; it is not attributed to that paper.
Facts & Assumptions
Given: Exactly the original question's model, constants, score domain and selector, posterior, nonempty classes , AC and Countable Choice. No change in the permitted set geometry is made.
AC and Countable Choice are assumed as stated. The Axiom of Choice, The Axiom of Countable Choice ()
The procedure and posterior formula give the coordinate means and variances. Empirical-Bayes credible-ball procedure in the inverse Gaussian sequence model, Posterior and marginal-likelihood formulas for the Gaussian sequence prior
For fixed cap , a constant inflation gives coverage tending uniformly to one over polished-tail truths with first coordinate zero, with the whole-space convention at selector zero. Conservative coverage of adaptive empirical-Bayes credible balls on polished tails
The lower-selector bracket holds uniformly over all square-summable truths, with the score normalization and threshold stated there. Marginal-likelihood maximizer bracket on polished tails Its score hypotheses and uniform probability bound are supplied by Uniform marginal-score bounds by derivative integration.
Credibility means graph-measurable membership and posterior mass at least on the declared domain; coverage is fixed-truth sampling probability. Posterior credibility and frequentist coverage
The polished-tail condition is the fixed tail-to-block energy inequality in the Example. Polished-tail class for a Gaussian sequence
Verification
Given: The complete model, class constants, supplied score domain and selector, and quantified conclusions in the Example and Facts & Assumptions. The sequence coordinates are exactly , as in the displayed model and norm; thus here means . No coordinate zero is added to that model.
Fix the inflation in [F2], depending only on the known constants. Let , including its whole-space zero-selector branch. With , [F2] gives . This is uniform because is a subset of the single polished-tail class in that theorem. This step claims conservative coverage only.
The random positive-selector posterior is supported on on a single Borel domain, not merely on a separate almost-sure domain for each fixed hyperparameter. Indeed intersect the supplied score domain with For every square-summable truth the expectation of this nonnegative sum is Thus is Borel and has probability one under every such truth. For every and every , the squared posterior mean is bounded by that same sum, since . For every the variance trace is finite. Hence all positive-parameter posterior laws at these data are supported on , including the selected law. Extend the selector by zero and use the whole space outside this common declared domain. This changes none of the sampling probabilities and asserts no posterior on the zero branch.
We verify the diameter rate uniformly in , rather than import a pointwise Sobolev assertion. Write , , and . In the score of [F3], put , so . For , the multiplier of is at most If , bound both powers and logarithms by their values at ; otherwise use . For , the multiplier is at most The last function of is decreasing for once is uniformly large, since its negative power has exponent at least . Both ranges therefore give These bounds hold simultaneously for , every in the fixed compact interval, and every .
Choose a fixed with . For all sufficiently large , put . For every , step 1.3 makes : here when . Consequently , including the empty-threshold convention . The uniform lower bracket [F3] yields In particular .
Put , and . Define For one may use . The positive-selector posterior's first-coordinate variance is , so it assigns mass zero for every data point of the declared domain, even though the hyperparameter is data-selected. Since , has posterior mass at least ; deleting preserves that mass. On the specified whole-space convention is retained.
Uniformly for , split the posterior variance trace at . Below that cutoff use ; above it use . Summation and an integral comparison give where depends only on the fixed constants (the tail factor is uniformly bounded). Markov's inequality applied to the centered posterior squared norm bounds its norm quantile by . The variances, hence the norm quantile, decrease with by coupling all centered coordinates with the same standard normals. On the event of step 2.1, the selected radius is therefore at most . The derivative of is , so this is at most with one for the full compact interval. Thus outside an event of uniformly vanishing probability, . This includes the uniformly negligible infinite-diameter zero-selector branch.
This is one rule independent of and . Its graph is Borel: the coordinate posterior means and selector are Borel, and the squared norm is the limit of its finite coordinate sums. For completeness, on a fixed countable standard-normal product space the map is nonnegative Borel. Integrating its threshold indicators gives a Borel distribution function in . Its quantile is Borel, by taking the infimum of positive rational radii whose distribution function is at least ; right continuity ensures this quantile has the required posterior mass. The centered norm has a positive finite quantile: it is finite by its finite second moment and has no atom at zero because its first coordinate is nondegenerate. Thus the radius is positive. Deleting the closed codimension-one hyperplane leaves a dense subset of any positive-radius ball: perturb a point toward the center if necessary and then a sufficiently small amount along the first coordinate. Hence has the same diameter as . Diameter is consequently an extended Borel random variable, equal to this expression off and infinity on .
Every allowed truth lies in and has exactly, since . Its coverage equals Subtracting leaves Its absolute value is at most uniformly over both suprema in the question. No independence among , the selector and is used. Also on every branch, so step 3.1 proves the requested diameter statement, in fact with limiting supremum zero for one sufficiently large fixed diameter constant. The nonzero lower norm bound is retained and needs no additional argument. This answers the unchanged unrestricted existence question affirmatively. It does not identify the constructed sets as balls or attribute this null-deletion construction to the cited literature.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Botond Szabó, A. W. van der Vaart, and J. H. van Zanten, Frequentist coverage of adaptive nonparametric Bayesian credible sets, Annals of Statistics 43(4) (2015)
- Evarist Giné and Richard Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Cambridge University Press (2016)
- Kolyan Ray, Adaptive Bernstein–von Mises theorems in Gaussian white noise
- Szabó, van der Vaart and van Zanten, Frequentist coverage of adaptive nonparametric Bayesian credible sets (2015)