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.
Functional BvM limits and credible-set calibration
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- 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 Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- Connectedness
- Consistency and Limiting Distributions
- 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
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- 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
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Finite-history linear prediction
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian-process priors and finite posterior laws
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- IID posterior contraction by entropy and prior mass
- 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
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- 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
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Posterior Prediction, Credible Sets, and Bayes Actions
- Posterior propriety and dominated Bayes formula
- 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
- 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
- State-space model laws
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Sufficiency, Completeness and Exponential Families
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- 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 Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- 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 Real Gamma and Beta Functions
- 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
- Weak Laws and Series of Independent Random Variables
- Weak nonparametric Bernstein–von Mises limits
2 · Summary
Objective
This page develops scalar functional BvM limits and credible-interval calibration in Gaussian white noise, including the nonlinear delta-method condition. It defines the multiscale coefficient space and the type-S and type-H density prior interfaces, then proves the source-specific density weak BvM theorems and their CDF and multiscale credible-band consequences, with the required sampling-process and Gaussian norm-quantile limits. It records the exact smoothness, positivity, topology, centering, and rate assumptions used in each result.
For type S, local quotient-likelihood contraction, wavelet composition and projection estimates, and posterior Laplace bounds prove the weak BvM under both approved coefficient-prior regimes. For type H, the Dirichlet posterior and normalized-Gamma concentration give a direct conjugate proof. The resulting empirical-center credible bands have asymptotically exact coverage; the stated additional coefficient smoothness and undersmoothing assumptions give the diameter bound.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Little-o multiscale coefficient space M0(w)
Definition
Use the wavelet coefficient levels and multiplicities from Logarithmic negative Sobolev spaces for white noise. The same coefficient-space definition applies to the Haar system used for type-H histograms: detail levels have coefficients, and the single scaling coefficient is an additional finite coarsest coordinate, included in the norm with weight . Finite projections always retain that scaling coordinate; this finite convention does not alter any tail assertion. Let be nondecreasing with . Define and its closed little-o subspace with the same norm. Call admissible when . The finite coarsest level is included in the norm and does not affect this limit. Elements are coefficient sequences; in particular, they need not be functions. The multiscale coefficient space is separable and has vanishing projection tails ↗ proves that is a separable Banach space, that coefficient sequences embed in it, and that finite-level projections converge in its norm.
Smooth linear functionals on the white-noise topology
Definition
Fix the real orthonormal wavelet basis and level weights of Logarithmic negative Sobolev spaces for white noise. For , define the basis Sobolev space For , , and , define . For , the intended extension is the coefficient pairing ; Smooth functionals extend continuously to the white-noise topology ↗ proves that this series is absolutely convergent and defines a continuous linear functional on for every .
In the white-noise experiment , fix so that the observation is -valued; means this continuous pairing with the -valued observation. It does not assert that is an function. The representer is nonzero when ; the corresponding white-noise variance is .
Type-S log-density and type-H histogram prior families
Definition
For type S use a fixed sufficiently regular compactly supported orthonormal multiresolution wavelet basis on as in Logarithmic negative Sobolev spaces for white noise, with boundary correction, regularity greater than the truth smoothness , and . The spaces spanned by the retained levels contain constants and have orthonormal scaling bases with uniformly bounded overlap, support diameters at most , and suprema at most ; a fixed shift of the scaling-resolution index is absorbed in . The wavelets likewise have uniformly bounded overlap, support diameters at most , and suprema at most . For an integer , the detail wavelets have vanishing moments through degree , and derivatives through order satisfy , with uniformly bounded overlap of their supports; the fixed low scaling functions are . These are the sufficiently regular compact multiresolution basis conditions in the source density theorem. For the density-model source results, every truth is a probability density satisfying for constants . For and smoothness index , let and be the largest integers satisfying Choose one cutoff sequence for all ; set any finite for , which does not change asymptotic claims.
For a finite wavelet series , define and the normalized log-density .
The type-S1 family takes IID coefficients with a continuous density for which is Lipschitz, and uses . Its source theorem assumes has coefficient Hölder regularity and is bounded above and bounded away from zero.
The type-S2 family takes IID standard-normal coefficients and uses , where and . Here the truth regime is with positive finite density bounds. Equation (24) in the source specifies this prior-parameter range, but its Theorem 3 assumes for both type-S families. The broader Gaussian truth range is established separately by the local type-S posterior BvM theorem.
For the type-H family, use the Haar basis instead of the regular type-S wavelets: its scaling function is and for and . The histogram space at resolution consists of the scaling coordinate and detail levels ; all detail coefficients at vanish. Partition into dyadic cells of length , draw , and set on cell . The source assumptions are for fixed positive , and for , together with the common positive finite density bounds above. The posterior asymptotic conclusions for these families are separate results.
Here denotes the coefficient class with norm . For sufficiently regular standard wavelets this is the usual Hölder scale (with the usual Zygmund interpretation at integer smoothness).
The multiscale coefficient space is separable and has vanishing projection tails
Statement
For every weight sequence in Little-o multiscale coefficient space M0(w), is a separable Banach space. If retains exactly the coefficients at levels , then and for each . Every square-summable coefficient sequence belongs to .
Facts & Assumptions
Given: The finite level sets , weights , and the vanishing-tail definition of .
Little-o multiscale coefficient space M0(w): the detail norm is . Without an extra scaling coordinate the norm is ; in the Haar convention, writing for that coordinate, it is . Membership in means the normalized detail maximum tends to zero. As in that definition, every retains the finite coarsest coordinates, including when present.
Proof
Let be Cauchy in . Each coordinate is Cauchy because . In the Haar case also . Let and, when present, be the scalar limits. The uniform Cauchy bound passes to every finite collection of coordinates and then to the supremum, so in the weighted supremum norm. To see , fix , choose with , then choose so the normalized tail of is below ; for the normalized tail of is at most . Thus is complete.
Finite-support sequences with rational coordinates are countable and dense: first choose to make the tail of any small, then approximate its finitely many coordinates through level , including the scaling coordinate when present, by rationals. Hence is separable. The formula for the norm shows is a contraction, and the defining tail limit gives .
If , then implies . The right side tends to zero because its squares are level blocks of a convergent nonnegative series. Its supremum and the absolute scaling coordinate, when present, are at most , so .
The multiscale primitive map is continuous into C[0,1]
Statement
Let be a compactly supported wavelet basis of Logarithmic negative Sobolev spaces for white noise. The Haar basis with its finite scaling coordinate, as specified in Little-o multiscale coefficient space M0(w), is also allowed. Assume each level- wavelet for has zero integral, uniformly bounded overlap, support length at most , and . Let be as in Little-o multiscale coefficient space M0(w), and suppose For define Then this series converges absolutely and uniformly in , , and after adding the finite coarsest-level constant to . If is the coefficient sequence of , then .
Facts & Assumptions
Given: The wavelet geometry, summability condition, and multiscale space in the Statement.
Logarithmic negative Sobolev spaces for white noise: is a complete orthonormal basis of ; finite orthogonal projections converge in .
Proof
For fixed and level , a wavelet whose support lies wholly on one side of contributes zero: it is either disjoint from or its entire support is integrated and its mean is zero. Only supports meeting can contribute. Uniformly bounded overlap bounds their number by a constant, and each coefficient has magnitude at most . Thus . The finitely many coarsest levels have a finite uniform sum as well.
By [F1] and step 1.1, the absolute sum of all terms at levels is at most , uniformly over . Its tails tend uniformly to zero because . Each finite-level sum is continuous in , since is continuous for an function. The uniform limit is continuous. Applying the same estimate to proves the stated operator-norm bound.
If for , the finite orthogonal projections converge to in by [F2]. The map is a continuous functional because . Applying it to the finite projections shows that their coefficient sums converge to , while step 2.1 identifies the same limit with .
Posterior quantiles stabilize under scalar weak convergence
Statement
Let be data-indexed probability kernels on , let be a fixed law with continuous CDF , and suppose in probability. Fix and let , using the canonical rational embedding. Assume is strictly increasing on some open interval containing . Define by the same convention. Then in probability. The local strict-increase hypothesis permits CDFs, such as norms of nonnegative random elements, that are constant on part of .
Facts & Assumptions
Given: The data-indexed kernels, fixed , and in the Statement; .
Posterior quantiles are measurable and bracket their probability level: the lower quantile is the real infimum of and its CDF satisfies .
Continuity from above when one set has finite measure: probabilities of decreasing measurable sets with finite first measure converge to the probability of their intersection.
The limiting CDF is continuous on and strictly increasing on an open interval containing .
Proof
Fix and . Choose . The piecewise-linear ramps that fall from to on and on bound below and above. Multiplying each ramp by makes its sup norm and Lipschitz constant at most . Comparing the lower and upper ramps under with their integrals under gives . By [A1], ; [F2] then gives as . First choose small and then let ; this proves in probability.
Write as in [F1]. Since [A1] makes continuous, the CDF bracket in [F1] gives . For every sufficiently small , strict increase near then gives . Step 1.1 at these two points implies, with probability tending to one, . By monotonicity, no rational at or below is in the defining set for , while every rational above belongs to it. Its infimum therefore lies in . Since arbitrarily small such are available, the quantiles converge in probability.
Smooth functionals extend continuously to the white-noise topology
Statement
Let be the coefficient Hilbert space of Logarithmic negative Sobolev spaces for white noise, with weights . If for some , then the pairing , where , converges absolutely for every and is continuous, with On this extension agrees with the usual inner product .
Facts & Assumptions
Given: The wavelet coefficient weights and the Sobolev coefficient norm in the Statement.
Smooth linear functionals on the white-noise topology: means , and its pairing with an function is the inner product.
Logarithmic negative Sobolev spaces for white noise: , where and the coarsest level has finite multiplicity.
Proof
Since , the level factor is bounded: it tends to zero as , because a positive power of dominates every fixed power of , and the finitely many coarsest levels have finite weights. Thus after increasing a finite constant.
Weighted Cauchy–Schwarz gives . The same bound applied to proves continuity and absolute convergence of the series.
If is the coefficient sequence of , its finite orthonormal projections converge to in because is a complete orthonormal basis. Their inner products with are the finite partial sums of the displayed pairing, and converge to by continuity of the inner product. Step 2.1 identifies the same limit with .
Finite type-S and type-H prior draws are L2 probability densities
Statement
Every finite type-S draw and every type-H draw in Type-S log-density and type-H histogram prior families is a well-defined nonnegative probability density.
Facts & Assumptions
Given: A finite type-S coefficient array or a type-H Dirichlet vector, and the bounded finite-level wavelet basis and normalized prior constructions of Type-S log-density and type-H histogram prior families.
Type-S log-density and type-H histogram prior families: type S sets for a finite bounded wavelet sum , with ; type H sets on dyadic cells of length , where and .
Proof
For a type-S draw, boundedness of the finite wavelet sum gives , hence on . Therefore , so is finite and is positive and integrates to one. The same bounds make bounded, so .
For type H, each dyadic cell has length , so . Also , since all weights are nonnegative. Thus every type-H draw is a nonnegative probability density.
Finite-projection convergence and posterior tail control imply weak BvM
Statement
Let be data-indexed probability measures on and let be a fixed probability measure on this space. For the projections of The multiscale coefficient space is separable and has vanishing projection tails, suppose that for every fixed , in probability, and that for every , Then in probability.
Facts & Assumptions
Given: The norm and projections, the bounded-Lipschitz metric, and the finite-projection and posterior-tail assumptions in the Statement.
Little-o multiscale coefficient space M0(w): has the weighted supremum norm and consists of coefficient sequences whose normalized level maxima vanish.
Continuity from above when one set has finite measure: if measurable sets decrease and the first has finite measure, their measures decrease to the measure of their intersection.
Proof
For any probability measure on and any bounded -Lipschitz function , . Splitting at and taking the supremum over such gives . Applying this to and , then using the triangle inequality, bounds by the two projection errors and the fixed- distance between projected laws.
For each , [F2] gives . Thus the events decrease to the empty set, and [F3] makes their -probabilities tend to zero. Given any target error, first choose small, then choose large so this -tail and the limiting posterior-tail probability are small; for that fixed , the projected-law distance tends to zero in probability by assumption. Step 1.1 then implies in probability.
Linear-functional BvM limit and credible-interval calibration
Statement
Use the product-prior white-noise model and supplied posterior kernel of Weak nonparametric Bernstein–von Mises theorem for product priors, including its wavelet-basis, coefficient-density, truth, and countable-choice hypotheses. Let for some , with , and put . Let be the posterior law of and let Then in -probability. The interval is posterior credible at level , and its frequentist coverage satisfies
Facts & Assumptions
Given: The white-noise experiment, product prior, posterior kernel, basis, density and truth assumptions of Weak nonparametric Bernstein–von Mises theorem for product priors, together with , , , and .
Weak nonparametric Bernstein–von Mises theorem for product priors: for every , the posterior law of converges in bounded-Lipschitz distance in to the canonical white-noise law in -probability. Its product-prior construction requires countable choice; the same axiom suffices for the scalar density-normal interface.
Smooth functionals extend continuously to the white-noise topology: is a continuous linear functional on and agrees with on .
White noise is a Borel Gaussian law on the negative Sobolev space: the canonical law is centered Gaussian on ; for the coefficient pairing , its variance is .
Posterior quantiles stabilize under scalar weak convergence: bounded-Lipschitz convergence in probability to a law with continuous CDF locally strictly increasing at an interior quantile implies convergence in probability of that posterior quantile.
Equal-tailed posterior quantile intervals are credible: the equal-tailed interval between posterior quantiles and is graph-measurable and has posterior mass at least .
Density normal laws and square-summable Gaussian series under countable choice: Under countable choice, in its density convention, is defined by its continuous positive density, and for is its image under ; change of variables gives a continuous strictly positive density and hence a continuous strictly increasing CDF.
The Axiom of Countable Choice (): countable choice is inherited through [F1] for the product-prior construction and also suffices for the density normal-law interface [F6]; no full choice is used below.
Proof
Fix . For every bounded -Lipschitz function , the composition is bounded by and has Lipschitz constant at most . Rescaling by makes it an admissible bounded-Lipschitz test on . Hence the scalar pushforward distance is at most times the distance in [F1]. The pushforward of is by [F3], proving the asserted scalar BvM limit.
Translate the posterior law of by and scale by . By [F4] and the continuous strictly increasing normal CDF from [F6], the two quantiles of this scaled law converge in probability to and , where is the -quantile of . Since the affine map is increasing, these are exactly the scaled endpoints of . The interval is credible by [F5].
Under the true white-noise law, has exactly the centered normal law by [F3]. On the event that both random scaled endpoints in step 2.1 lie within of their limits, the event is bounded between the corresponding deterministic normal-interval events with endpoints enlarged or contracted by . This sandwich uses no independence between the endpoints and the observation. The endpoint event has probability tending to one, and [F6] makes the normal mass of shrinking neighborhoods of the two endpoints tend to zero.
Letting and then in the sandwich of step 3.1 gives limiting coverage by the definition of the normal quantiles and CDF in [F6].
Nonlinear-functional BvM limit under fast L2 contraction
Statement
Use the white-noise experiment, product prior, and supplied posterior kernel of Weak nonparametric Bernstein–von Mises theorem for product priors, with all its stated basis, coefficient-density, truth, and countable-choice hypotheses. Let be Borel measurable. Suppose , and for some , , , , and , Assume the posterior contracts in at a deterministic radius , meaning . Define the efficient center where the last pairing is the continuous extension from Smooth functionals extend continuously to the white-noise topology. Then the posterior law of converges in bounded-Lipschitz distance to in -probability. The equal-tailed posterior interval for at level is credible and has frequentist coverage tending to .
The stipulated radius implies the source's squared-radius condition: with , one has and posterior mass inside tends to one. However, for this radius is incompatible with the imported weak BvM limit. Thus the implication under the retained radius is vacuous; the source's squared-radius condition does not have this incompatibility.
Facts & Assumptions
Given: The product-prior weak BvM model of [F1], the Borel functional , the stated local quadratic expansion with nonzero Riesz representer , the posterior radius , and .
Weak nonparametric Bernstein–von Mises theorem for product priors: the posterior law of converges in bounded-Lipschitz distance on to the canonical white-noise law for every .
Smooth functionals extend continuously to the white-noise topology: extends continuously from to .
White noise is a Borel Gaussian law on the negative Sobolev space: is exactly under the true white-noise law.
Posterior quantiles stabilize under scalar weak convergence: scalar bounded-Lipschitz convergence to a CDF continuous on and locally strictly increasing at the target quantile implies quantile convergence.
Equal-tailed posterior quantile intervals are credible: equal-tailed posterior quantiles define a measurable credible interval of posterior mass at least .
Density normal laws and square-summable Gaussian series under countable choice: Under countable choice, in its density convention, is defined by its continuous positive density, and for is its image under ; change of variables gives a continuous strictly positive density and hence a continuous strictly increasing CDF.
The Axiom of Countable Choice (): countable choice supplies the prior construction in [F1] and the density normal-law interface [F6]; no full choice is used below.
Proof
On the posterior event , write . The expansion gives . Outside the event, posterior mass is by assumption. Hence for every , in -probability.
For posterior draws, . For , composing a bounded -Lipschitz scalar test with and dividing by gives an admissible bounded-Lipschitz test on . Thus the first term has bounded-Lipschitz distance to the pushforward limit at most times the distance in [F1]; by [F3] that limit is . For any bounded -Lipschitz test function, replacing the first term by its sum with the remainder changes its posterior integral by at most . Step 1.1 and then prove the asserted scalar BvM limit.
Apply [F4] to the centered and scaled posterior law in step 2.1. By [F6], its and quantiles converge in probability to and . Translating and rescaling these quantiles gives the equal-tailed posterior interval for ; its credibility follows from [F5].
Under the true experiment, has exactly the law by [F3]. The random centered interval endpoints in step 3.1 converge in probability to the corresponding normal quantiles. For any fixed , on the event that both endpoints are within of their limits, coverage is bounded by deterministic normal-interval probabilities with endpoints enlarged or contracted by . This argument requires no independence between the endpoints and . By [F6], the mass of shrinking endpoint neighborhoods vanishes; letting and then gives coverage .
To verify the caveat, put , whose density is bounded by by [F6]. Choose with and set . For each realized data set, is a bounded -Lipschitz test. On , its value at is at least , so its posterior integral tends to in probability. But for every center . The bounded-Lipschitz distance is a supremum over all such tests for each data set, so it cannot tend to zero. This contradicts the linear pushforward of [F1] established in step 2.1 and proves the incompatibility.
Projected empirical bridge CLT in the little-o multiscale space
Statement
Assume AC. Let have a density on with . Let be an orthonormal, compactly supported wavelet basis with coefficients at level , uniformly bounded overlap, and . Suppose for some , Let be nondecreasing and admissible in Little-o multiscale coefficient space M0(w), and choose either cutoff regime For IID , define the finite wavelet projection by coefficients for and zero for , with the coarsest scaling coordinates projected as well. Let be a Borel centered Gaussian law on whose coefficient covariance is Then
Facts & Assumptions
Given: AC, the density and wavelet bounds, the coefficient smoothness and cutoff conditions, IID observations, and the stated Borel Gaussian bridge law.
Little-o multiscale coefficient space M0(w): uses the norm , with normalized level maxima tending to zero.
The multiscale coefficient space is separable and has vanishing projection tails: square-summable coefficient sequences lie in , and finite-level projections converge in its norm.
Finite-projection convergence and posterior tail control imply weak BvM: convergence of every fixed finite projection together with vanishing tails under the approximating and limit laws implies bounded-Lipschitz convergence on .
Multivariate iid central limit theorem: under AC, finite-second-moment IID vectors have the multivariate normal limit with their covariance, including singular covariance.
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: on finite-dimensional Euclidean space, weak convergence of Borel probabilities implies convergence in bounded-Lipschitz distance.
Finite and countable subadditivity of measures: a probability of a finite union is bounded by the sum of the component probabilities.
Markov's inequality for random variables: for nonnegative and , .
Continuity from above when one set has finite measure: probabilities of decreasing measurable sets with finite first measure converge to the probability of their intersection.
Identical distribution and IID families: IID means the observations are mutually independent and have a common law.
The Axiom of Choice: AC is the stated axiom used by [F4] for finite-dimensional CLTs; no common null set over all directions is required because each projection level is fixed.
The basis satisfies the uniform support, overlap, coefficient-count and sup-norm bounds in the Statement.
The truth coefficients satisfy the displayed bound.
Proof
Given: The probability law, basis, coefficient smoothness, admissible weights, cutoff, Gaussian limit law, and AC hypothesis in the Statement.
has finitely many nonzero coefficients, so it is in . The coefficient sequence of is square-summable by Parseval, so [F2] places it in . Thus is a well-defined -valued random element.
Fix . For all sufficiently large , , so the coordinates of are for the finitely many indices through level . The vector summand is bounded by [A2], has finite second moment, and is IID by [F9]; its covariance is the displayed covariance of . By [F4] these finite-dimensional vectors converge weakly to the corresponding Gaussian projection. The projection space is finite-dimensional Euclidean with an equivalent weighted maximum norm, so [F5] gives convergence in bounded-Lipschitz distance for every fixed .
Let . Then , , and by [A2]. For , . Since , expansion of the exponential gives, for , . Applying [F7] to this exponential and optimizing at yields . Applying the same argument to supplies the lower-tail bound.
Above the cutoff, has only the deterministic bias coefficients . By [A3] and monotonicity of , . For the first cutoff regime the numerator is bounded, while . For the second, the numerator is and ; admissibility again makes the ratio vanish.
Fix . By [F6] and step 1.3, . For levels with , the denominator is bounded by a constant depending only on . Their sum is bounded by , which tends to zero as : admissibility gives , so the summand is eventually bounded by .
For the remaining levels , the exponent in step 2.1 is at least . Their total contribution is at most , which tends to zero. Indeed and either cutoff gives for all large after decreasing if needed; this polynomial growth dominates .
The two threshold classes partition all levels . The low-threshold sum tends to zero as by step 2.1, and the high-threshold sum tends to zero as by step 3.1. Therefore the centered empirical-fluctuation tails vanish in the iterated limit , then .
For the fixed Gaussian law , [F2] gives pointwise. Hence the events decrease to the empty set; [F8] makes their probabilities tend to zero. Steps 4.1 and 1.4 give the matching posterior-tail condition for the laws of .
For each fixed , step 1.2 gives convergence of the projected laws in bounded-Lipschitz distance; steps 4.1 and 1.4 give vanishing tails for , and step 5.1 gives vanishing tails for . Applying [F3] to these laws proves , which is the asserted weak convergence on .
A bounded-density Gaussian bridge has a Borel multiscale law
Statement
Assume AC. Let have density on , and let be an orthonormal wavelet system with at most coordinates per level, including finitely many coarsest scaling coordinates. The Haar system is allowed. For every admissible , there exists a Borel centered Gaussian random element of with coefficient covariance Its Borel law is uniquely determined by these finite-coordinate Gaussian laws.
Facts & Assumptions
Given: AC, the bounded density, orthonormal system, finite level multiplicities, and admissible weights in the Statement.
A mean and positive-semidefinite kernel define a Gaussian process constructs a Gaussian coordinate process for any symmetric positive-semidefinite kernel under AC.
The multiscale coefficient space is separable and has vanishing projection tails: is a separable Banach space; its coordinate projections are contractions and converge pointwise in norm to the identity.
Characteristic function of a normal law and Uniqueness of a law from its characteristic function: centered scalar normals have characteristic function and are determined by it under AC.
Markov's inequality for random variables and Finite and countable subadditivity of measures give exponential tail and union bounds.
Dominated convergence passes bounded almost-sure limits through expectation.
Proof
Given: The hypotheses in the Statement, including full AC.
The displayed kernel is symmetric and positive semidefinite because for any finite coefficients , . Thus [F1] constructs a centered jointly Gaussian coordinate sequence with this covariance. Each coordinate variance is at most .
For a centered normal of variance , completing the square in its normal density gives ; at the variable is zero almost surely. Exponential Markov with therefore gives when , as it is for a probability density. Consequently . Choose with . The sum over is finite, and the union bound over tends to zero. The probability that infinitely many of these events occur is therefore zero, since that event is contained in every such tail union.
Almost surely the normalized maxima tend to zero, by step 2.1 and admissibility ; each of the finitely many remaining coordinates is finite. The event is coordinate-measurable, since the little-o condition is expressed by countable unions and intersections of the inequalities . It has probability one. Define on and otherwise. Its finite projections are measurable finite-dimensional random elements and converge everywhere in the separable Banach space [F2]. Hence is Borel measurable: for every closed set , the measurable functions converge to ; inverse images of closed sets are thus measurable, and closed sets generate the Borel sigma-algebra.
Let be any continuous real linear functional on . Then almost surely, and each approximant is centered normal with some variance . These variances are bounded. Indeed, almost-sure convergence makes the laws tight: choose so that , using that the supremum is finite almost surely. If on a subsequence, the normal density bound would give , a contradiction. Any convergent subsequence of with limit gives, by [F3] and [F5], . Taking shows that all subsequential variance limits coincide. Thus , and [F3] identifies as . Therefore is a centered Borel Gaussian random element.
Its coordinate covariance and finite Gaussian laws are unchanged by the null-set modification in step 3.1. Finally the Borel sigma-algebra of equals the sigma-algebra generated by its countably many coordinates: the norm is their countable weighted supremum, so all open balls about a countable dense set are coordinate-measurable, and these balls generate the topology. Thus two Borel laws with the same finite-coordinate laws agree, by uniqueness of the cylinder law in [F1] restricted to this measurable space. This proves existence and uniqueness of the stated bridge law.
Continuous and strictly increasing norm distributions for density bridges
Statement
Assume AC. Let have density on , and put . Use a complete real orthonormal wavelet basis, allowing the Haar basis with its finite scaling coordinate, and admissible weights as in Little-o multiscale coefficient space M0(w). Assume the wavelet geometry and summability conditions of The multiscale primitive map is continuous into C[0,1], and write for its primitive map. Let be the Borel centered Gaussian bridge random element of A bounded-density Gaussian bridge has a Borel multiscale law, with coefficient covariance Then the distribution functions of and are continuous on and strictly increasing on . Both assign probability zero to , and take values strictly between and at every positive argument. Consequently, for every , each has a unique positive finite lower -quantile , with CDF value , and is strictly increasing on an open neighborhood of .
Facts & Assumptions
Given: AC, the bounded positive density, complete wavelet basis, admissible weights, primitive map and Gaussian bridge in the Statement.
The multiscale coefficient space is separable and has vanishing projection tails and The multiscale primitive map is continuous into C[0,1]: is separable, finite-level projections converge in its norm, and is continuous linear into .
Logarithmic negative Sobolev spaces for white noise: the basis is complete and orthonormal in , so its finite orthogonal projections converge in .
A bounded-density Gaussian bridge has a Borel multiscale law supplies the Borel centered Gaussian law and its finite coefficient covariances. A finite stack of independent Gaussian vectors is jointly Gaussian and Mean and covariance determine Gaussian finite-dimensional laws identify finite Gaussian laws, including singular laws, by means and covariances under AC.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique supplies two independent copies of each Borel probability. Finite measures agreeing on a generating pi-system and on the whole space are equal identifies Borel laws from their finite-coordinate laws whenever those coordinates generate the Borel sigma-algebra.
Finite and countable subadditivity of measures and Continuity from above when one set has finite measure give the countable null-union rule and continuity of probabilities along decreasing measurable events.
Cauchy-Schwarz for random variables controls the difference of second moments when both factors converge in .
Under AC, standard Brownian motion exists by Existence of continuous Brownian motion, and put . The A-page definitions Brownian motion and Gaussian process, finite expectation linearity in Linearity, monotonicity, and the modulus bound for expectation, and Covariance is symmetric and bilinear in finite linear combinations give the direct bridge verification in step 4.2. Use the everywhere-continuous zero-start representative of Brownian reflection principle.
Uncorrelated jointly Gaussian blocks are independent: finite jointly Gaussian blocks with zero cross-covariance are independent, including singular blocks.
Brownian reflection principle: for and , .
The Axiom of Choice: full AC is assumed for [F3], [F4], [F7]–[F9].
Proof
In either or , the Borel sigma-algebra is generated by countably many continuous linear coordinates: the wavelet coordinates in the first case, and evaluations at rational times in the second. Indeed, the norm distance to a fixed point is their countable supremum, with the weights included in the first case; in the second case continuity makes the rational supremum equal the full supremum. Separability then gives a countable base of coordinate-measurable balls. Separability of is [F1]; rational polygonal functions give a countable dense family in by uniform continuity and finite rational approximation. Thus finite-coordinate laws determine Borel laws by [F4]. If is any centered Borel Gaussian random element in either space and an independent copy, [F3] gives and : every finite coordinate vector on either side is centered Gaussian with the same covariance.
For the law of such an , let be its support, the set of points whose every open neighborhood has positive probability. Its complement is the union of all zero-mass balls in a countable base, hence has measure zero by [F5]; is closed and nonempty. Symmetry from step 1.1 gives . The support of is : independent positive-mass balls around give positive mass to every neighborhood of , proving one inclusion; the other follows because almost surely, so their sum lies almost surely in the closed set . Scaling by is a homeomorphism, so step 1.1 gives . Taking any and shows , hence . Now gives , while gives and hence . Therefore and . The set is additive and symmetric, and division by follows by applying division by twice. It is closed under dyadic rational scalars, and closure gives all real scalars. Thus is a closed linear subspace.
Put and . Every finite vector of bridge values is jointly Gaussian with and has zero cross-covariance, because . By [F8] these finite vectors are independent of . The coordinate generation in step 1.1 and finite-measure uniqueness [F4], applied to rectangles and then the generated sigma-algebra, show that the entire bridge path, and hence , is independent of . Write for the standard-normal density. For , [F9] implies that the measure on has density : subtract the reflected-event measure from the terminal normal measure; the reflected-event CDF in [F9] differentiates to for . Thus For fixed , take . Since on , the inclusions with thresholds and , together with independence, give . Continuity and positivity of show that both bounds tend to . Hence for every . By [F5], for , and together with the same formula as gives . Therefore is atomless.
If has any nondegenerate scalar coordinate, then and . For every , gives . A nonzero can be scaled to have norm greater than , so some neighborhood of that scaled point lies in and has positive probability. Likewise, for , scale to have norm ; a sufficiently small ball about it is contained in and has positive probability. Consequently its norm CDF is strictly between zero and one at every positive argument and strictly increasing there. This applies to : any nonconstant wavelet has positive -variance, because makes the and Lebesgue null sets identical and a nonconstant wavelet cannot equal a constant almost everywhere.
For each nonzero , its norm is attained by some coordinate: if , the normalized level maxima are below after finitely many levels, and the maximum over the remaining finite set equals . Enumerate all coordinates by , and write for their norm weights: on detail level , and for any additional Haar scaling coordinate. Hence, for , is contained in the countable union of events . Each has probability zero: a positive-variance normal has a density, and a zero-variance centered normal is zero whereas . By [F5] the union is null. At , the nondegenerate coordinate from step 3.1 again gives probability zero; negative values are impossible. Absence of atoms and continuity of probability in [F5] show that this norm CDF is continuous on .
First verify the bridge used in [F7] directly. Every finite linear combination of is a finite linear combination of Brownian values with time appended, so it is normal by [F7], including repeated times and singular combinations. Finite expectation linearity makes its mean zero. Covariance bilinearity gives for . On the single continuous zero-start Brownian path event supplied in [F7], subtraction of the continuous function makes continuous, with . Thus it is the needed centered continuous Gaussian bridge, without an example as a logical supplier. Write . For every continuous real linear functional on , is continuous linear on , so is centered normal by [F3]; thus is centered Gaussian. For , let be the orthogonal wavelet projection through level . Its Lebesgue limit is by [F2], and gives the same convergence in . Put . The coefficient covariance in [F3] gives . In particular is Cauchy in , and it converges almost surely to by [F1]. Its limit therefore equals almost surely, since convergence in implies convergence in probability and two probability limits agree. The means are zero; applying [F6] to the product differences passes the covariances to the limit. Thus is a centered continuous Gaussian process with covariance . The function is a continuous strictly increasing bijection of onto itself. By [F3], and from [F7] have the same finite Gaussian laws; step 1.1 then gives equality of their Borel laws on . In particular , and has a nondegenerate evaluation coordinate, for example at any with . Step 3.1 therefore applies to its norm as well.
By symmetry of the centered Gaussian bridge, has the same atomless distribution as . For , continuity on a compact interval gives . Both events on the right are null by step 2.2 and symmetry; [F5] gives no atom at . Negative norm values are impossible. By step 4.2, the CDF of is therefore continuous on .
Both norm CDFs are continuous by steps 4.1 and 5.1, vanish at zero, and are strictly increasing on with values strictly between zero and one by steps 3.1 and 4.2. They tend to one at infinity because both random norms are finite almost surely. For each , continuity therefore gives a positive finite point with CDF value , strict increase gives its uniqueness, and monotonicity makes it the lower -quantile. Any sufficiently small open interval around is contained in , where strict increase holds. These are all the asserted quantile conditions.
Finite Dirichlet gamma representation and weighted Bernstein bound
Statement
Assume AC. Let , , and let be independent variables. Put . Then is , and is , with mean and variance . Each has mean , variance , and moment-generating function for every real . For real satisfying , put and . If , then for , If , almost surely. Sums of disjoint groups of the are independent Gamma variables with their respective summed shapes.
Facts & Assumptions
Given: Full AC, the positive finite shape vector, and the weights in the Statement.
Shape-rate Gamma distribution and The shape-rate Gamma density is normalized supply the normalized density , , for .
Dirichlet distribution, including the one-category case specifies the normalized density on the simplex, and the point mass at one for .
Finite product laws and nonnegative changes of variables are supplied by For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique and A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions.
Markov's inequality for random variables: for a nonnegative random variable and , . Applied to with and , it gives .
Uniqueness of a multivariate exponential transform identifies laws having the same finite moment-generating transform near zero under AC.
Proof
Given: The hypotheses in the Statement.
The product Gamma law exists by [F3]. In its density make the substitution , . Its Jacobian is : factor from the proportion columns of the derivative matrix and add its first rows to the last; the remaining last row has first entry one and all other entries zero. The resulting density factors as times the simplex density in [F2]. Integrating either normalized factor proves both distributional assertions. For , directly.
Substituting in the Euler Gamma density gives for . Its first two derivatives at zero yield mean and variance ; differentiation is justified by an exponential majorant with any fixed parameter in . Independence makes the joint transform of disjoint group sums the product , which is the transform of the corresponding product Gamma law. By [F5], these are the same laws. In particular has the asserted mean and variance, also following from step 1.1.
For , independence and step 2.1 give . Indeed the convergent logarithm series gives for . If , set ; exponential Markov then bounds the upper tail by . Apply the same calculation to and sum the bounds. If , positivity of all forces every , so .
Type-H histogram posterior weak Bernstein–von Mises theorem
Statement
Assume AC. Use the type-H prior of Type-S log-density and type-H histogram prior families, retaining its original conditions: , , , either original cutoff or , and for fixed positive . Write . In the Haar convention, the scaling function is , the detail functions are and a histogram at resolution has only the scaling coordinate and levels . Let be IID from , let , and define the empirical histogram Let be the density posterior for the stated histogram prior. For every nondecreasing with , its conditional law of satisfies in -probability, where the Borel centered Gaussian bridge is supplied by A bounded-density Gaussian bridge has a Borel multiscale law and has covariance . Its scaling coordinate is zero. This proves the type-H source-specific posterior BvM with the empirical projection center; no additional contraction, bias, or Dirichlet-parameter condition is imposed.
Facts & Assumptions
Given: AC, the original type-H truth, cutoff, parameter, Haar, observation, and admissible-weight conditions in the Statement.
Finite Dirichlet gamma representation and weighted Bernstein bound: a Dirichlet vector of shapes is for independent Gamma variables; has mean and variance . For , , and , . Disjoint Gamma shapes add, and for .
Dirichlet-Multinomial conjugate update and Bayes formula for dominated kernels identify the positive finite normalized Dirichlet likelihood update.
A bounded-density Gaussian bridge has a Borel multiscale law supplies the Borel Gaussian bridge law for the bounded density in the Statement.
Finite-projection convergence and posterior tail control imply weak BvM concludes BL convergence from every fixed finite-coordinate BL limit and vanishing posterior tails in the iterated limit.
Prokhorov tightness theorem on polish spaces gives subsequential weak compactness of tight finite-dimensional Borel laws under AC; Uniqueness of a multivariate exponential transform identifies finite laws with a common moment-generating transform near zero.
Vector Slutsky theorem passes a finite-dimensional weak limit through algebraic operations with quantities converging in probability to constants. The bounded-Lipschitz metric characterizes weak convergence on Polish spaces converts finite-dimensional weak convergence to BL convergence.
Markov's inequality for random variables and Finite and countable subadditivity of measures give moment, exponential, and union bounds.
Finite type-S and type-H prior draws are L2 probability densities supplies the finite histogram density construction. Little-o multiscale coefficient space M0(w) supplies the coefficient norm and admissibility convention, with the finite scaling coordinate included.
Proof
Given: All hypotheses in the Statement, with full AC throughout.
Abbreviate , , , , and . The original cutoff conditions and give and , and . On the positive simplex, the full-data histogram likelihood is . Multiplication by the prior density yields a constant times , with every shape positive; its normalization is finite positive by [F2]. Therefore the full-data posterior is Dirichlet, regardless of whether the actual sampling truth is itself a histogram. By [F1] realize it by . Write for the posterior mean histogram measure, identified with its density in coefficient differences, with cell masses . For a cell-constant function , set . Direct subtraction gives .
Fix constants and large enough that . Since is Binomial with , independence of the observations gives . Hence satisfies , by exponential Markov and the union bound. On , for all sufficiently large , , , and both the empirical histogram density and the mean histogram density are bounded by a fixed constant independent of .
Fix finitely many Haar coordinates. Choose a fixed coarse dyadic partition of cells on which all their functions are constant. For large its cells are unions of level- cells. By [F1], the corresponding grouped Gamma variables are independent Gamma with . Their summed shape is still . Write . Each coarse count satisfies and variance at most , by observation independence. Markov applied to squared deviations, together with , proves in -probability simultaneously for the fixed finite partition.
On , take any Haar detail with and put . Then and , using and the density bound. By [F1] and [F7], , because . On the complement, step 1.1 yields . Thus, apart from the single event , the conditional probability that this absolute coefficient exceeds is at most for a fixed . The zero-variance case has no such failure event, by [F1].
Consider any deterministic data sequence along which for every . Under its conditional Gamma product laws put . For every fixed , [F1] and the logarithm series give . The remainder is . The means of are zero and their total second moments are , so their laws are tight by the squared-norm Markov bound and compactness of finite-dimensional closed balls. By [F5], any subsequence has a further weak limit. For any fixed , the same expansion at uniformly bounds ; hence is uniformly integrable. Truncation of this continuous exponential therefore passes its expectation through each weakly convergent subsequence. The limit law has transform and an exponential moment on a neighborhood of zero: and the corresponding transforms are finite. The independent centered normal vector with variances has this same transform, by completing the square in each normal density. Transform uniqueness [F5] identifies every subsequential limit, proving .
Choose a fixed sufficiently large. Uniformly over , . Summing the exponential bounds of step 3.1 over levels and their coefficients therefore gives, for all large , on , with fixed . The probability is counted only once, since the same normalizes every coordinate. Choose with ; the displayed series tail then tends to zero with . For any , admissibility gives for all sufficiently large . Both and are histograms, so all their detail coordinates at vanish. Consequently their conditional tails vanish in the iterated limit of [F4], first , then , since .
For a Haar detail , exact subtraction gives . Haar cell values satisfy . Hence , while on , . This bounds every such mean shift by . The scaling-coordinate shift is exactly zero, and all coordinates at vanish for both centers. Since , uniformly on . In particular step 4.1 also supplies the required posterior tails about .
Here , in conditional probability by its variance and mean . Exact algebra gives . By [F6] and step 3.2, this vector converges to , with independent . Its covariance is . Applying the fixed linear map from coarse-cell masses to the chosen Haar coordinates yields covariance exactly . Step 5.1 removes the mean shift from to on . Thus along every deterministic data sequence with the ratios in step 2.2 converging and eventually occurring, the finite-coordinate posterior converges weakly, hence in BL by [F6], to the corresponding projection of [F3].
The preceding deterministic-sequence conclusion implies the finite-coordinate BL convergence in -probability. To see this without a simultaneous conditional null-set assertion, if that convergence failed, there would be and infinitely many with probability at least that the distance exceeds . Along a subsequence, step 2.2 and make the probability of a ratio error above or smaller than at its th chosen index. Thus at each such index there exists data with distance above , ratio error below , and true. AC selects a deterministic sequence of those data, contradicting step 6.1. This proves the asserted convergence in probability for each fixed finite projection.
The posterior histogram construction [F8] and its finite-dimensional simplex kernel make a data-indexed Borel probability on : each draw and has only finitely many Haar coefficients, and its map from simplex coordinates is continuous. The target is the Borel bridge law [F3]. Step 7.1 supplies every fixed finite-projection BL limit, and steps 4.1, 5.1 supply its posterior-tail condition. Apply [F4] to obtain the stated BL convergence. Every original type-H assumption has been retained; in particular the lower parameter bound is compatible with, but is not needed beyond, positivity in this conjugate proof.
Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication
Statement
Let be the span of wavelets through level in a compactly supported orthonormal multiresolution basis on , either boundary corrected or periodized. Assume constants belong to , its dimension , and its orthonormal scaling functions have supremum norm at most , support diameter at most , and uniformly bounded overlap. Periodized supports and distances are interpreted on the circle. Assume also and . Let denote the orthogonal projection onto .
Then has a kernel satisfying and when . If is -Hölder for , then For the composition assertion, assume additionally an integer such that for , bounded overlap also for their derivatives, and vanishing moments through degree for the detail wavelets, including boundary wavelets; the finite low scaling functions are . These are the usual sufficiently regular compact wavelet hypotheses. If a bounded function has coefficients bounded by , with , and its wavelet expansion represents in , then , up to equality of the continuous representatives. Under these additional derivative and cancellation hypotheses, also has coefficients bounded by , including integer , and are -Hölder for every . Moreover for .
Facts & Assumptions
Given: The explicitly stated compact multiresolution, scaling-function, wavelet, and Hölder assumptions.
Logarithmic negative Sobolev spaces for white noise supplies the orthonormal coefficient convention; all additional localization hypotheses are stated above.
Proof
The finite orthogonal projection has kernel . At each only a uniformly bounded number of terms are nonzero, and each has . Thus . A nonzero term requires to lie in one scaling support, giving the support bound. Also ; Cauchy–Schwarz on the scaling coefficients gives the claimed to bound.
The levelwise tail satisfies . Summing its geometric series over proves uniform convergence and the claimed approximation rate. Its uniform limit agrees with its limit, hence with almost everywhere, and everywhere for continuous representatives.
For , . Therefore . Hölder continuity, the support bound, and the kernel integral bound give the asserted commutator estimate.
For composition put and , with the first finite low block treated as . Levelwise derivative bounds and overlap give for , and for by summing levels; also . The identity and repeated product and chain rules therefore give, writing , and . Indeed a derivative of order of the exponential factor is a finite sum of products of derivatives of its exponent of total order , bounded by ; pairing with the derivative of order of gives .
The telescoping series converges uniformly. For a wavelet at level , the terms with have coefficients bounded by . For , subtract the degree Taylor polynomial of about a point of the wavelet support; all its integrals vanish by the stated moments. The Taylor remainder gives . Sum the geometric series over to get the same bound. The fixed smooth has the stronger order . This proves composition in the coefficient class directly, for every positive including integers, without presuming a Hölder–wavelet equivalence.
For the levelwise derivative and supremum bounds for are respectively at most and . Given distance , choose with . The difference of the levels through is at most by the derivative bound; the remaining difference is at most . Thus is -Hölder. The exponential has bounded derivative on the bounded range of , so has the same Hölder bound.
Type-S posterior contracts in quotient log-density coordinates without a tail restriction on a log-Lipschitz prior
Statement
Assume AC for the imported measure and Gaussian interfaces. Use Type-S priors and either cutoff of Type-S log-density and type-H histogram prior families with the compact multiresolution basis of Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication, regular enough for the truth's Hölder approximation. Suppose , , and . In S1 take and any probability density whose logarithm is Lipschitz on all of . In S2 take Gaussian coefficients with and .
Write , , , , and . Under IID data of density , the posterior distributions of are tight in probability. Equivalently, for every deterministic , in -probability. The normalizer defining the posterior is positive and finite -almost surely. The quotient prior has a positive continuous Lebesgue density on . In S1 it obeys and a shift in a single high wavelet coordinate obeys the sharper bound . The low scaling block has a fixed finite collection of analogous weighted bounds. In S2 the quotient prior is centered Gaussian, with precision diagonal on high wavelets with entries and a fixed positive definite low scaling block. Its log-density increment is .
Facts & Assumptions
Given: AC and the density, basis, cutoff, coefficient, and regularity hypotheses of the Statement.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product permits integration of nonnegative likelihoods in either order.
Markov's inequality for random variables bounds a nonnegative variable's upper tail by its expectation divided by the threshold.
Proof
Quotient out constants before using likelihood curvature. Constants belong to the fixed low scaling space. An orthogonal change within that finite space separates ; integrate out of the prior and write for the resulting Lebesgue density on . The likelihood depends only on . In S1 its product density before integration obeys , where . Integrating preserves both inequalities for ; it is positive, finite almost everywhere, and the log-Lipschitz inequality supplies its positive continuous finite version everywhere. In S2 the marginal is a nondegenerate Gaussian on , with precision equal to on high wavelets and a fixed positive definite low block; hence .
Let . [F1] gives . For , the centered score at has expected squared Euclidean norm at most : sum the coordinate variances, each bounded by by orthonormality. The score's deterministic mean is the coefficient vector of , with norm at most . Consequently [F3] gives . On every ball with fixed , [F1] and make bounded uniformly above and away from zero. For , lies between and , using . Thus is between and on these balls. Convexity of holds globally.
In S1, by either cutoff. In S2 the Hölder coefficient bound gives , so , and because . The Gaussian log-density increment is exactly . In particular its radial upper slope is at most , and on the ball it is bounded below by .
Fix a score event . Put , with a large fixed constant. Taylor's formula on the ball bounds above by and its radial derivative above by . Global convexity of extends this derivative bound to every . Add the prior bound in S1, or with its nonpositive quadratic term in S2. For large enough the log unnormalized posterior ratio relative to is at most for all . On , the lower Taylor bound and the prior lower bounds instead give .
Polar integration in dimension bounds the tail/normalizer ratio by . Here . Choose so large that for and . The integral is then at most after decreasing , and tends to zero. The denominator used here is the integral on the ball, at least its volume times times the positive unnormalized value at . First increase to make its score event arbitrarily probable, then increase . This proves tightness. For any , eventual containment of every fixed ball in the ball yields the stated equivalent formulation.
Every modeled density is everywhere positive. Its prior predictive product density is positive and integrates to one by [F2], so it is finite Lebesgue-almost everywhere on the sample cube. The law has a bounded Lebesgue density, hence the same exceptional set is -null. This proves finite positive evidence on the asserted fibers independently of the score event.
Type-S density posteriors satisfy the weak multiscale Bernstein–von Mises theorem
Statement
Assume AC. Let be IID on with density , and suppose . Use a sufficiently regular compactly supported boundary corrected orthonormal multiresolution wavelet basis satisfying Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication, with regularity greater than , and let contain exactly its wavelet levels through , including the fixed low scaling space and constants. Its regularity and vanishing moments satisfy the composition hypotheses in that lemma for some integer . Let be either of the two cutoff sequences in Type-S log-density and type-H histogram prior families, fixed consistently for all .
In Type-S1 take , , and any coefficient probability density with globally Lipschitz logarithm. In Type-S2 take , Gaussian coefficients, and with . Normalize as in that definition. For every admissible weight sequence , the posterior satisfies in -probability, where has empirical wavelet coefficients through and zero coefficients above , and is the Borel Gaussian bridge with covariance .
Facts & Assumptions
Given: The model, truth, multiresolution basis, prior scales, cutoff, admissible weights, and full AC in the Statement. Put , , and to include the fixed low levels.
Type-S posterior contracts in quotient log-density coordinates without a tail restriction on a log-Lipschitz prior gives quotient-coordinate contraction at radius around ; its Statement supplies the positive quotient marginal prior density and its shift bounds.
Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication gives the uniform projection kernel bound, approximation, to supremum bound, and the multiplication commutator estimate. Its composition conclusion proves that has the required coefficient decay, including integer , and that is -Hölder for every .
A bounded-density Gaussian bridge has a Borel multiscale law constructs the Gaussian bridge law on under AC.
Finite-projection convergence and posterior tail control imply weak BvM reduces the asserted bounded-Lipschitz convergence to fixed finite projections and vanishing posterior tails.
Bernstein tail bound for independent bounded sums gives Bernstein's inequality for independent centered bounded variables.
Prokhorov tightness theorem on polish spaces, Uniqueness of a law from its characteristic function, and Cramer wold device give subsequential weak compactness from tightness, uniqueness from characteristic functions, and joint convergence from scalar projections under AC.
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces metrizes finite-dimensional weak convergence; Dominated convergence permits integrable domination; Markov's inequality for random variables gives Markov's bound.
Proof
Choose a deterministic sufficiently slowly that and in the Gaussian case. Such a choice exists: the first unmultiplied expression tends to zero because , and the second is bounded by a logarithmic factor times . Set in the quotient by constants used in [F1]. Then in probability. On , ; hence uniformly, and the densities are bounded above and away from zero. Write for the posterior conditioned on .
For , , define . For , Taylor expansion of the log moment generating function gives , where . To justify the uniform remainder, differentiate three times; its third derivative is the third centered moment under the tilted density, bounded by when . On , by orthonormality and the density bound, while . Thus and . Here is the sum log likelihood.
The map is the quotient-coordinate translation . On high wavelets it shifts one coordinate; low scaling directions involve only a fixed finite-dimensional block. In S1 the absolute log prior density ratio is at most , since . In S2 it is at most , with a bounded fixed low-block version. Uniformly in high , its coefficients are bounded: , , and . Changing variables in the numerator likelihood integral and discarding its transformed indicator therefore bounds that integral by times the full posterior normalizer. Step 2.1 yields . No translation invariance of is used.
Put for and . Exponential Markov with gives . Union over the at most locations shows . Union also over levels and integrate in above a sufficiently large constant to obtain : the relevant integral is bounded by , plus a finite low-level term. Also the wavelet level bound and a geometric sum give .
Fix a finite linear combination of wavelets and a fixed real . Repeat step 2.1 with this bounded . Its remainder is now , and uniformly on . The prior translation involves finitely many fixed coordinates, and its density ratio tends to one uniformly on : use the global S1 log-Lipschitz bound or the fixed Gaussian precision block and bounded quotient coordinates in S2. Let be the translated image of . For large , contains because the translation has norm . Both and tend to one by [F1]. Bounding the translated integral above by the full normalizer and below by its integral on therefore gives in probability.
Each empirical wavelet coordinate has variance at most and summands bounded by . Bernstein [F5] gives . Choose , union over , and integrate over to get . Summing against yields , since . Moreover for both cutoffs. Consequently the posterior projected density error is tight at rate .
Here is the needed finite-dimensional Laplace continuity argument. Along any subsequence, extract a further subsequence on which the preceding transform convergences hold almost surely for every rational and every rational vector of finite-coordinate coefficients, using countability and convergence in probability. The transforms at the positive and negative coordinate unit vectors give tightness of these deterministic finite-dimensional laws by exponential Markov and a finite union bound. [F6] gives a weakly convergent further subsequence. For a fixed rational direction and rational , its exponential is uniformly integrable: its second moment is bounded by the transform at , and Cauchy–Schwarz and Markov bound the expectation above any large cutoff. Truncation thus passes its transform to the weak limit. In each coordinate direction and then any rational linear direction, the limit has finite exponential moments of every rational order, and hence of every real order by bounding by for rational . Its moment generating function is analytic: on every bounded complex disk its power series can be integrated term by term under . Equality with the Gaussian transform on the rationals therefore gives equality of all moments by the real power series at zero. Integrating the characteristic-function power series under the same exponential bound gives the Gaussian characteristic function. [F6] identifies every rational linear projection with the corresponding centered normal. Continuity of characteristic functions in their vector argument extends the identification to real vectors; [F6] then identifies the finite-dimensional law with the Gaussian projection of [F3]. Every weakly convergent further subsequence has that limit, so tightness implies weak convergence of the full deterministic subsequence, and [F7] gives bounded-Lipschitz convergence. The initial subsequence argument proves convergence in probability of the original random projected laws.
For the coefficients through , step 4.1 and Markov give posterior tightness of . Therefore for , the norm of the part with is at most this variable times , which tends to zero as by admissibility. This proves the required uniform projected posterior tail bound.
This projected rate controls the full supremum error. Put , , and . Since , . Normalized exponential expansion gives with on . Also . For any fixed , is -Hölder, so [F2] gives . The lower bound and uniform boundedness of imply . Step 1.1 makes the two terms proportional to absorbable. It follows that uniformly on . Thus the full posterior supremum error is tight at rate .
Choose so slowly that . Step 6.1 makes the posterior probability of tend to zero. On its complement, the wavelet bound and monotonicity of give . The truth coefficients satisfy for either cutoff. Hence the entire density tail above is negligible in posterior probability.
Each density is a finite exponential of bounded continuous functions, hence belongs to ; its coefficients, and those of , belong to . Removing changes posterior integrals of functions bounded by one by at most . Step 5.2 supplies fixed finite-projection convergence to [F3], and steps 5.3, 7.1 supply the posterior-tail condition. Apply [F4] to conclude the asserted bounded-Lipschitz convergence in .
CDF and multiscale credible-band calibration from weak BvM limits
Statement
Let have a density on bounded above and bounded away from zero, and put . Use the wavelet basis and of Little-o multiscale coefficient space M0(w), and assume the wavelet conditions and summability condition of The multiscale primitive map is continuous into C[0,1]. Let be a measurable -valued center, let be a posterior kernel supported on densities, and define to be the conditional law on of under .
Assume under that (i) converges in bounded-Lipschitz distance in probability to the centered Gaussian bridge coefficient law in , whose finite coefficient covariances are , and (ii) in . For , let and be the lower -quantiles of and . Assume both CDFs are continuous on and strictly increasing on open neighborhoods of their respective quantiles, and that . These local quantile conditions allow the CDFs to be constant on the negative half-line. In the projected empirical-center case , Projected empirical bridge CLT in the little-o multiscale space supplies premise (ii) under its stated smoothness and cutoff conditions. For the source-specific type-S and type-H priors, the posterior BvM premise (i) is established in Type-S density posteriors satisfy the weak multiscale Bernstein–von Mises theorem and Type-H histogram posterior weak Bernstein–von Mises theorem, respectively.
For a posterior draw , write and , where is the primitive map of The multiscale primitive map is continuous into C[0,1]. Then the posterior law of converges in bounded-Lipschitz distance on to the -Brownian bridge , with covariance .
For , let and be the posterior lower quantiles of and , respectively. The corresponding posterior balls are measurable credible sets of posterior mass at least . Their frequentist coverage tends to , and the scaled radii converge to the respective quantiles of and .
Facts & Assumptions
Given: The density law, posterior kernel, wavelet basis, space , primitive map, two weak-convergence assumptions, continuous strictly increasing limit norm CDFs, and in the Statement.
Little-o multiscale coefficient space M0(w): has the weighted supremum norm on wavelet coefficients whose normalized level maxima vanish.
The multiscale coefficient space is separable and has vanishing projection tails: every square-summable wavelet coefficient sequence belongs to .
The multiscale primitive map is continuous into C[0,1]: is continuous and agrees with for functions.
Continuous mapping theorem: a continuous map carries weak convergence of probability laws to weak convergence of their pushforwards.
Posterior quantiles are measurable and bracket their probability level: for a posterior probability kernel on , its lower -quantile is measurable and its CDF brackets .
Posterior quantiles stabilize under scalar weak convergence: if the limiting scalar CDF is continuous on and strictly increasing on a neighborhood of the target quantile, bounded-Lipschitz convergence in probability implies convergence of that posterior quantile.
Posterior credible set: a graph-measurable rule whose posterior mass is at least is a posterior credible set at level .
The posterior laws converge in bounded-Lipschitz distance in probability to the centered Gaussian bridge coefficient law in .
The sampling centers satisfy in .
The CDFs of and are continuous on and strictly increasing on open neighborhoods of their positive quantiles. Continuity at each lower quantile implies its CDF value is .
Portmanteau theorem: weak convergence of probability measures gives convergence of probabilities of sets whose boundary has zero limit measure.
Projected empirical bridge CLT in the little-o multiscale space: for the projected empirical center and the theorem's coefficient regularity and cutoff assumptions, in .
Logarithmic negative Sobolev spaces for white noise: the wavelets form a complete orthonormal basis of , so finite orthogonal projections converge in .
Cauchy-Schwarz for random variables: square-integrable random variables satisfy .
Proof
The posterior draw and center are -valued, so [F2] embeds in ; [F1] supplies its norm. For an -Lipschitz map between metric spaces and any admissible bounded 1-Lipschitz test on its target, is an admissible test on its domain. Therefore By [F3], is linear and Lipschitz with a finite constant . The bound applied pointwise to the data-indexed laws in [A1] gives in probability. Moreover, if is continuous and linear, then is continuous and linear on . The centered Gaussian premise on says exactly that this scalar pushforward is centered normal, allowing zero variance. Thus is a centered Gaussian Borel law. In particular, for any finite and real , the functional is continuous and linear, so the evaluation vector is jointly centered Gaussian. This uses only the scalar Gaussian pushforward meaning of the premise, without characteristic-function uniqueness or a Gaussian existence theorem. To identify its covariance, let be the finite wavelet projection of the indicator. The finite Gaussian coefficient covariance gives By [F11], in Lebesgue ; since , this is also convergence in . The variance of a difference of two finite projected Gaussian evaluations is the -variance of the corresponding difference of projected indicators, so it tends to zero; hence those evaluations are Cauchy in . They also converge almost surely to because in and is continuous. The almost-sure and in-probability limits coincide: for any , the probability that they differ by more than is bounded by the two probabilities that each sequence differs from its limit by more than , both tending to zero. If are the projected evaluations and their limits, [F12] gives the norms are bounded because in , and the means converge to zero as well. Thus the finite covariance passes to the limit. The resulting covariance is , the defining covariance of the -Brownian bridge.
The posterior pushforward under either norm is a probability kernel on . By [F5], the two lower quantiles are measurable and their posterior CDFs at those radii are at least . Since the centers and norms are measurable, the membership graphs of and are measurable. Thus both sets are credible by [F7].
The norm maps and are 1-Lipschitz by the reverse triangle inequality. Applying the pushforward bound of step 1.1 first to the norm and then to the supremum norm after gives bounded-Lipschitz convergence in probability of both posterior norm laws to their corresponding limit norm laws. Their CDFs satisfy [A3], so [F6] gives and in probability. For the projected empirical center , [F9] verifies [A2] under the smoothness and cutoff assumptions in [F9].
By [A2] and [F4], and its primitive converges weakly to . The frequentist error uses the negative center difference, but and because is linear. Thus each scaled frequentist error norm converges to the corresponding limit norm in [A3]. On the event that the random radius is within of its deterministic limit from step 2.1, coverage is bounded above and below by probabilities for the frequentist norm with fixed thresholds expanded or contracted by . [F8] gives convergence of those fixed-threshold probabilities because [A3] makes their boundary probabilities zero. Sending and using the CDF value at its quantile from [A3] yields for both coverage probabilities. This comparison does not require independence between the data-dependent posterior radii and the frequentist center.
Diameter of undersmoothed multiscale credible bands
Statement
Assume all hypotheses of CDF and multiscale credible-band calibration from weak BvM limits at a fixed credibility level , , and use its credible ball and scaled radius . Let , assume the compactly supported wavelets have uniformly bounded overlap and , and define Suppose . Choose integers with and let . Intersect the credible ball with the coefficient smoothness ball: Then , and its diameter satisfies
Facts & Assumptions
Given: All hypotheses, the credible ball and radius of CDF and multiscale credible-band calibration from weak BvM limits, the coefficient smoothness norm and wavelet assumptions in the Statement, , and .
Little-o multiscale coefficient space M0(w): the multiscale ball bounds each level- coefficient by times its radius.
CDF and multiscale credible-band calibration from weak BvM limits: has frequentist coverage tending to , and its scaled radius converges in probability to a finite quantile, hence is .
The Statement defines by the displayed coefficient norm .
Proof
Since and , [L1] implies the truth belongs to the coefficient smoothness ball for all sufficiently large . For those , , so the asserted coverage follows from [F2].
Let . For , [F1] gives . For , [L1] and membership in the coefficient smoothness ball give . At each point, only a uniformly bounded number of level- wavelets are nonzero, each bounded by . Therefore the low-frequency contribution to is at most , and the high-frequency contribution is at most . These series also give uniformly convergent representatives because .
Since is nondecreasing, by summing a geometric series. Also . The first bound in step 1.2 is thus at most .
The relation implies both and . Combining the low- and high-frequency bounds in steps 1.2 and 2.1 and using from [F2] yields the stated diameter bound.
Type-S and Type-H density credible bands have asymptotically exact coverage
Statement
Assume AC. Use either Type-S1, Type-S2 or Type-H with all the truth, basis, prior-scale, Dirichlet-parameter and cutoff conditions of Type-S log-density and type-H histogram prior families. Let be nondecreasing, , and . In Type S take , the empirical wavelet projection through level . In Type H take the empirical histogram at mesh , equivalently the Haar projection with scaling coordinate and details .
For each , the posterior multiscale and CDF balls of CDF and multiscale credible-band calibration from weak BvM limits, at posterior level and centered at these , have posterior mass at least and frequentist coverage tending to . Their scaled radii converge in probability to the positive finite quantiles of the corresponding Gaussian bridge norms. In particular, writing , the posterior law of converges in bounded-Lipschitz distance on to the -Brownian bridge law, in -probability.
If additionally the coefficient smoothness and undersmoothing hypotheses of Diameter of undersmoothed multiscale credible bands hold, its intersection with the stated coefficient smoothness ball has the same limiting coverage and the diameter bound asserted there. No unverified entropy, prior-mass, posterior contraction or quantile-regularity premise is required in this corollary.
Facts & Assumptions
Given: AC, one of the three source-specific prior regimes, the specified empirical center, admissible summable weights, and .
The Axiom of Choice is inherited from the following suppliers.
Type-S density posteriors satisfy the weak multiscale Bernstein–von Mises theorem and Type-H histogram posterior weak Bernstein–von Mises theorem prove posterior bounded-Lipschitz convergence about the respective empirical projections, to the Borel Gaussian bridge with covariance .
Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication preserves coefficient regularity of at every positive order, including integers. Projected empirical bridge CLT in the little-o multiscale space proves the sampling CLT for bounded truths with coefficient smoothness and either cutoff regime.
Continuous and strictly increasing norm distributions for density bridges proves that both bridge norm CDFs are continuous and strictly increasing on positive arguments and have unique positive finite interior quantiles, under the given positive bounded truth and primitive-map summability conditions.
CDF and multiscale credible-band calibration from weak BvM limits gives measurable credible balls, CDF pushforward convergence, radius limits and exact asymptotic coverage from posterior BvM, the sampling-center CLT and the stated norm-quantile conditions.
Diameter of undersmoothed multiscale credible bands gives the additional smoothness-ball coverage and diameter conclusion under its explicit coefficient smoothness and undersmoothing assumptions.
Proof
In Type S, [F1] proves posterior BvM about with the locally proved S1 range and Gaussian S2 range , . The truth has coefficient regularity, so [F2] gives that regularity for as well. The retained basis has the support, overlap and supremum bounds required by the empirical-process theorem in [F2]. Taking and the given cutoff therefore proves its sampling-center CLT with the same Gaussian bridge.
In Type H, [F1] proves posterior BvM about the empirical histogram . Haar wavelets have the same support, overlap and supremum bounds. The ordinary -Hölder truth, , has Haar coefficients bounded by : subtract its value at one point of the support in the coefficient integral, use the zero mean, support diameter and norm . The histogram projection retains details through . Both given cutoff regimes remain true with this , since multiplying by changes only their comparison constants. Thus [F2] with gives the sampling CLT about this exact histogram center. The finite scaling coordinate is included and its centered fluctuation is zero.
In all three cases, positivity and boundedness of , admissibility, and the displayed summability verify [F3]. Hence every norm-quantile assumption of [F4] holds at . Steps 1.1, 1.2 verify its posterior and sampling premises, with the same coefficient covariance law. Applying [F4] proves all asserted CDF limits, measurable credibility, radius limits and frequentist coverage, for the exact empirical centers and every .
When the additional hypotheses in the last paragraph of the Statement hold, the multiscale credible ball just obtained is precisely the input to [F5]. Applying that theorem yields its smoothness-intersection coverage and stated diameter rate. These are additional hypotheses only for this diameter conclusion; the coverage and CDF conclusions in step 2.1 required no such extra conditions.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §2.1, equations (11)–(12)
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §5.2.2 and §7.3.4
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §2.3.1
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §7.3.4
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §§2–3.2, equations (19)–(25)
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §7.4 Notes
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §2.1
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §5.2.2
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §4.1
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, proof of Theorem 7.3.20
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §7.3.4, especially Theorem 7.3.23
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §2.3
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §1.2 and §2.3.1
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §3.2
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §5.4
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Theorem 3 and §2.3.1
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §§7.3.4–7.3.5
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Theorem 4 and §2.3.2
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorem 1, equations (15)–(17), and §5.1
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §§3.7 and 7.4
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §2.1 and Theorem 1
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorems 4–5 and Section 4
- Rick Durrett, Probability: Theory and Examples, fifth edition, Sections 7.4 and 8.4
- Castillo, On Bayesian supremum norm contraction rates, §4.4
- Ferguson, A Bayesian Analysis of Some Nonparametric Problems, Section 2
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorem 3 and §5.4, printed pp.24–28
- Castillo, On Bayesian supremum norm contraction rates, §4.4, printed pp.25–28
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, §2 and §5.4
- Castillo, On Bayesian supremum norm contraction rates, §3.2.1 and §4.3; preliminary contraction here obtained by a finite-dimensional likelihood argument
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorem 3 and §5.4; direct contraction and commutator proof here retains the approved richer prior scope
- Castillo, On Bayesian supremum norm contraction rates, §4.3
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorems 4–5, Corollary 2, and §5.4
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Theorem 7.3.23 and proof
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorem 5, Proposition 5, and proof of §5.4
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Corollary 7.3.24 and proof
- Castillo and Nickl, On the Bernstein–von Mises phenomenon for nonparametric Bayes procedures, Theorems 3–5