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.
Weak nonparametric Bernstein–von Mises limits
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- 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
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- 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 Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- 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
2 · Summary
This page proves the product-prior weak Bernstein–von Mises limit in the Gaussian white-noise model. Countable choice supplies the completeness used for the prior and suffices for the scalar density-normal interface; the posterior kernel is a supplied model object, and the projection/tail proof uses no further choice axiom. White noise is the Borel Gaussian limit on the logarithmically weighted negative Sobolev space , ; it is not an -valued law. The theorem assumes a regular wavelet basis, with , bounded normalized truth coefficients strictly inside the prior density's positive region, a bounded density with finite second moment, and continuity at each normalized true coefficient. Its local proof supplies the posterior second-moment estimate and finite-coordinate Gaussian limit, then controls the infinite-dimensional tail. The theorem concludes convergence in bounded-Lipschitz metric, not total variation. Under full AC, Prokhorov's theorem identifies that metric with the weak topology and the continuous-mapping corollary applies; these stronger choice-dependent consequences are separate from the core estimate.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Logarithmic negative Sobolev spaces for white noise
Definition
Let be a countable complete orthonormal basis of the real Hilbert space (Orthonormal families, complete orthonormal systems and Hilbert bases, Hilbert space, The space as the quotient by null functions). For a wavelet basis, index levels by , let have indices, and put for and for the finite coarsest level. This finite-level convention only prevents a zero logarithmic weight and does not change any convergence criterion below. For a trigonometric basis, use its integer frequency index , bounded multiplicities, and .
Here an -regular wavelet basis means a wavelet orthonormal basis whose members are times differentiable, with each derivative through order in , following the source convention. The weak BvM theorem below only uses the basis's completeness, orthonormality, and level counts.
For , define to be the space of coefficient sequences with norm
Its inner product is the corresponding weighted coefficient inner product. Multiplying each coordinate by identifies it isometrically with , where (or the corresponding trigonometric index set). This sequence space is complete: if is Cauchy, each coordinate converges to a scalar ; for every finite , the Cauchy bound passes to the limit in , so the supremum over finite shows in . It is separable because finite-support sequences with rational coordinates form a countable dense set. Thus is a separable Hilbert space without an additional choice assumption.
A function is identified with its coefficient sequence . For each finite set of indices, orthonormality makes orthogonal to its residual in , so the Pythagorean identity gives . Taking the supremum over finite and using the boundedness of the weights proves continuity of the coefficient map. If all coefficients of vanish, then is orthogonal to the linear span of the basis. Completeness makes this span dense, and continuity of gives , hence in . Applying this to the difference of two functions proves injectivity. Thus the coefficient map is a continuous linear embedding .
The weight trace is finite exactly when : for wavelets its tail is a constant multiple of , while for a trigonometric basis it is comparable to . The product-prior theorem below uses the wavelet case.
The wavelet product prior is L2-valued
Statement
Let be a real Hilbert space with a countable orthonormal basis , where is the level- index set and for each (Hilbert space, Orthonormal families, complete orthonormal systems and Hilbert bases). Such an is separable because finite rational linear combinations of the countable basis are dense. Let be IID real random variables with common density and finite second moment (Identical distribution and IID families). For , set and form the partial wavelet sums
Assume countable choice, denoted , when specializing to . Then converges almost surely in to a Borel -valued random element , and
The abstract Hilbert-space assertion is choice-free; for , completeness follows from the Riesz–Fischer theorem under countable choice (The Axiom of Countable Choice (), The space as the quotient by null functions, Riesz-Fischer completeness of for ). More generally, finitely many additional coarsest orthogonal coordinates with fixed scales and finite coefficient second moments may be added; they contribute only a finite expectation to the displayed sum.
Facts & Assumptions
Given: The orthonormal wavelet basis, , and an IID coefficient family with density and finite second moment ; countable choice is additionally assumed only for the specialization.
Hilbert space: A real Hilbert space is complete in the norm induced by its inner product.
Orthonormal families, complete orthonormal systems and Hilbert bases: Vectors in an orthonormal family are pairwise orthogonal and have norm one.
Identical distribution and IID families: IID means mutual independence together with equality of all coordinate laws; it imposes no moment hypothesis.
Monotone convergence for the integral: For nonnegative measurable functions increasing pointwise to , their integrals increase to .
Riesz-Fischer completeness of for : Under countable choice, with its usual norm is complete.
The Axiom of Countable Choice (): Countable choice is assumed only to apply [F5] in the instance; the abstract complete-Hilbert-space argument makes no choice-axiom appeal.
Proof
For each finite , orthonormality [F2] gives The nonnegative partial sums increase to the full coefficient-square sum, so [F4] gives its expectation as the limit of the finite expectations, since the final series is geometric with ratio . If the coefficient-square sum were infinite on an event of probability , its expectation would be at least for every , contradicting finiteness. Thus that sum is finite almost surely.
On the probability-one event where that sum is finite, for orthonormality gives The right side tends to zero uniformly over as , since it is a tail of a convergent nonnegative series. Thus is Cauchy in and has a limit by completeness [F1]. When , completeness is supplied by [F5] under [A1]. The Cauchy event is measurable because it is a countable combination of conditions on the measurable distances . On that event the pointwise limit is measurable as a limit into the separable metric space ; setting the limit equal to zero on the measurable complement gives a Borel -valued random element.
The same monotone-convergence calculation in [F4] gives This proves both the stated second-moment formula and the claimed well-definedness.
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces
Statement
Assume the Axiom of Choice. Let be a Polish space, and let be Borel probability measures on . Define
where , with value when has at most one point. Then
where is weak convergence of Borel probabilities (Weak convergence of borel probability measures). The implication from bounded-Lipschitz convergence to weak convergence is choice-free; the reverse implication below uses AC through Prokhorov's theorem.
Facts & Assumptions
Weak convergence of borel probability measures: means convergence of integrals for every bounded continuous real test function.
Portmanteau theorem: Weak convergence of Borel probabilities on a metric space is equivalent to the closed-set bound for every closed .
Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space is tight if and only if it is relatively sequentially compact for weak convergence.
Dominated convergence: If measurable functions converge pointwise almost everywhere and are dominated by one integrable function, their integrals converge.
Polish spaces are separable completely metrizable spaces: A Polish space is separable and completely metrizable.
Finite measures agreeing on a generating pi-system and on the whole space are equal: finite measures agreeing on a generating pi-system and on the whole space agree on its generated sigma-algebra.
The Axiom of Choice: AC is used only for the Prokhorov implication from relative sequential compactness to tightness in step 2.2; step 1.2 proves the reverse metric implication without AC.
Given: The objects in the statement and AC for step 2.2.
Proof
Nonnegativity, symmetry and the triangle inequality for follow by applying these properties to the difference of the two test integrals and then taking the supremum. If , fix a nonempty closed and put . The function is an admissible test, so . By [F4], these integrals decrease to and , respectively. The two probabilities therefore agree on every closed set, including the empty set. Closed sets form a pi-system generating the Borel sigma-algebra, and both total masses are one, so [F6] gives . Thus is a metric; this argument uses no choice.
Assume , and fix a nonempty closed set . For every integer , the function satisfies and . Hence is admissible in the definition of , so . Since , it follows that for every .
Now assume , and put . Any sequence chosen from either has a member repeated infinitely often, yielding a constant convergent subsequence, or has a subsequence of the form with , which converges weakly to . Therefore is relatively sequentially compact for weak convergence.
The functions decrease pointwise to and are bounded by the integrable constant function under the probability . By [F4], , so the closed-set bound holds; it is trivial for . The Portmanteau theorem [F2] gives weak convergence in the sense of [F1].
By [F5], is Polish; therefore [F3] applies under [A1] and is tight. Thus for every there is a compact such that .
Fix . Compactness gives a finite -net of . Quantize each value into finitely many bins of width at most . There are finitely many resulting value patterns for the bounded 1-Lipschitz test class; choose one representative from each nonempty pattern. If and share a pattern, then for a net point gives .
For any admissible , choose the representative from its pattern. The integral difference is bounded by The maximum tends to zero by [F1], because there are finitely many bounded continuous representatives, and the last two terms are at most by step 2.2. Taking the supremum over , then the limit superior in , gives . Letting proves the reverse implication.
The product-prior posterior factors by coordinates
Statement
Assume countable choice for the -valued prior construction. Let the wavelet product prior have independent coefficients , where the are IID with density . Observe the independent Gaussian sequence
where the have the standard normal density and are independent of the prior. Assume a data-indexed posterior kernel for the -valued prior is supplied as part of this model. In the product white-noise model, for every finite set of coefficient indices its conditional law of given the full data sequence is the product of the one-coordinate densities
Here abbreviates a pair and . For , the formula denotes the unit law on the zero-dimensional one-point space. Each denominator is strictly positive and finite: the Gaussian factor is everywhere positive and at most , while the prior density integrates to .
Facts & Assumptions
Identical distribution and IID families: The prior coefficients are mutually independent and have a common law; scaling by the fixed positive preserves coordinate independence.
Independent random elements are characterized by finite rectangle probabilities: Independence of random elements is equivalent to factorization of probabilities on all finite measurable rectangles.
Dynkin's pi-lambda theorem: If a lambda-system contains a generating pi-system, it contains the generated sigma-algebra.
The wavelet product prior is L2-valued: The wavelet prior coefficients define an -valued random element under the stated scale and finite-second-moment conditions.
The Axiom of Countable Choice (): Countable choice is used only for the -valued prior construction supplied by [L1]; the finite-coordinate factorization argument itself uses no choice axiom.
The full data-indexed posterior kernel on is supplied as part of the model. We use the version whose finite-coordinate marginals are the displayed densities; the proof verifies their conditional-law identities under the prior-predictive model. This item does not claim a general full-kernel existence theorem.
Given: Countable choice, the product prior, the independent Gaussian coordinate experiment, and the supplied posterior kernel [A2]. The coordinate marginal formula is verified below.
Proof
For each coordinate , the pair is a measurable function of the independent pair . Thus the coordinate pairs are independent: finite rectangle probabilities factor by [F1] and [F2]. Fix finite . For any cylinder event depending on finitely many observations outside , the random vector is independent of by that same factorization. The events in for which this independence identity holds form a lambda-system containing the outside-coordinate cylinder pi-system; [F3] extends it to all outside-data events. Hence conditioning on adds no information about once is known.
For finite , the joint prior density of is the product of , and the likelihood of is proportional to . Each one-dimensional normalizer is at most and is positive: the Gaussian factor is bounded by , is strictly positive everywhere, and the prior density integrates to . Thus the normalized product density is . Integrating it over rectangles in and verifies the conditional-law identity for these coordinates. The prior is a Borel probability on by [L1] under [A1], and [A2] supplies the full posterior kernel; step 1.1 extends the finite-coordinate identity to the full observation sequence.
The product of the one-coordinate conditional densities in step 2.1 is exactly the stated finite-dimensional posterior marginal, so the posterior factors by coordinates for every finite index set .
A negative-Sobolev posterior second-moment bound
Statement
Use the wavelet product-prior white-noise model of The wavelet product prior is L2-valued and The product-prior posterior factors by coordinates, with , , and coefficients at level . Let be the coefficients of a fixed . Assume countable choice for the prior construction, with the full posterior kernel supplied by The product-prior posterior factors by coordinates, and suppose
where the common prior density satisfies for all , for , and . For every there is a constant , independent of , such that
No continuity assumption on is needed for this moment estimate.
Facts & Assumptions
Logarithmic negative Sobolev spaces for white noise: , where and for .
The product-prior posterior factors by coordinates: Given the data coordinate , the posterior density of is proportional to ; finite coordinate marginals factor.
Monotone convergence for the integral: Expectations of nonnegative partial sums increasing pointwise to a limit increase to the expectation of that limit.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: For the nonnegative Gaussian-integral integrand, expectation and Lebesgue integration may be interchanged on the sigma-finite product of the normal probability space and .
The true normalized coordinates satisfy , and has the boundedness, local positivity, and second-moment properties in the statement.
The Axiom of Countable Choice (): Countable choice is used for the prior construction. The full posterior kernel is supplied as model input in [F2]; the coordinate moment estimates below require no further choice.
Given: Countable choice, the white-noise observations with independent standard normal coordinates, the prior, and its coordinate posterior law. The expected posterior loss bound in the Statement is to be proved.
Proof
Fix and abbreviate , , , and . Under the true law write , where has density . If , change variables in [F2] to obtain All integrands are nonnegative and the denominator is positive. The posterior kernel is the model supplied by [F2] under [A2].
Set . If for a fixed , then whenever . Substituting and pairing with gives because and on . Completing the square in the standard normal density gives ; hence, by the substitution , Here [F4] justifies the exchange of expectation and the nonnegative -integral. Therefore in this range.
If , let . For one has , so where and . Thus . For , integrate over the half-interval nearest ; for , integrate over the half-interval adjacent to the nearer endpoint. These choices give the common lower bound Consequently is finite: after multiplying by the standard normal density, its integrand is bounded on and is at most a constant times on . Hence also when , with independent of .
The two ranges in steps 2.1 and 2.2 cover every ; since in the first range, there is a single constant for which .
By [F1], the posterior squared loss is the nonnegative series . Apply monotone convergence [F3] to its finite partial sums and use step 3.1 to obtain The trace on the right is finite for by [F1], proving the bound.
Finite-coordinate posterior total-variation limit
Statement
Assume countable choice for the prior construction, with the full posterior kernel supplied as in The product-prior posterior factors by coordinates. Fix a finite set of wavelet coordinates in the product white-noise model of The product-prior posterior factors by coordinates. Suppose is bounded and continuous at each normalized truth coefficient , with . Let be the conditional posterior law of given the full data. If , both laws are the unique probability on the zero-dimensional one-point space. For nonempty , the posterior and Gaussian densities and on satisfy
in probability under the true white-noise law. Consequently , where and is the product of standard normal laws.
Facts & Assumptions
The product-prior posterior factors by coordinates: The posterior marginal on every finite coordinate set is the product of the coordinate Bayes densities.
Dominated convergence: Pointwise convergence under an integrable dominating function gives convergence of the integrals.
Finite and countable subadditivity of measures: The probability of a countable union of events is at most the sum of their probabilities.
The Axiom of Countable Choice (): Countable choice is used for the prior construction; the full posterior kernel is supplied as model input in [F1], and the finite-dimensional density limit is choice-free.
Given: Countable choice, a fixed finite coordinate set , the coordinate prior densities and white-noise observations, boundedness of , and its continuity and strict positivity at each .
Proof
Fix one coordinate and write . Under the true law, in probability, and . By [F1], under [A1], the posterior density of is For any deterministic sequence , boundedness of and [F2] give .
Along such a deterministic sequence, pointwise and is eventually bounded by a constant multiple of . A second application of [F2] gives convergence in , hence convergence in total variation. Since in probability, if the total-variation convergence in probability failed, some subsequence would have error probability bounded below. Select a further subsequence for which at its th term; [F3] bounds each union of tail events by the corresponding geometric tail, which tends to zero, so the further subsequence converges almost surely to , contradicting the deterministic conclusion.
For finite nonempty , [F1] makes the scaled posterior and its Gaussian target product measures. Telescope the difference of their product densities one coordinate at a time. Integrating the absolute value of each term gives the distance of that coordinate pair, since every other coordinate density integrates to . Thus the joint distance is at most the sum of the finitely many coordinate distances, which tends to zero in probability by step 2.1. For each measurable event , the absolute difference of its probabilities is at most this distance, so the total-variation conclusion follows.
Density normal laws and square-summable Gaussian series under countable choice
Statement
Assume countable choice. Put . Then is a Borel probability on . In this item and its applications, write for its pushforward under , where ; thus . This density convention requires no full axiom of choice. For the law has density and its CDF is continuous and strictly increasing. Its mean and variance are and .
If are mutually independent with density and , and the finite sums converge in probability to a supplied real random variable , then has law . In particular, this applies whenever the sums converge almost surely or in .
Facts & Assumptions
Given: Countable choice, the displayed density, and, for the series assertion, the independent coordinates, real coefficients and supplied probability limit .
The Gaussian integral computes the improper Riemann integral of as . Substitution: if is differentiable on with integrable and is continuous on an interval containing , then gives substitutions for continuous compact-interval integrands, and A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral identifies these integrals with their Lebesgue integrals under The Axiom of Countable Choice ().
The indefinite integral of a nonnegative measurable function is a measure constructs a measure from a nonnegative measurable density; Integrating against a density agrees with integrating the product integrates nonnegative tests against it. Monotone convergence for the integral passes to increasing truncations.
The exponential function is smooth and and The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with give ; The real exponential function and the number by a power series supplies the positive exponential series. The second fundamental theorem: if is differentiable on with and is integrable, then and If are differentiable on with integrable, then apply on compact intervals, and Dominated convergence passes integrable limits through the integral.
Independent random elements have product joint law identifies independent pairs with the product of their laws. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product computes nonnegative integrals by iterated integration.
Dynkin's pi-lambda theorem implies that Borel probabilities agreeing on all half-lines agree: those half-lines, together with , form a generating pi-system.
Proof
The positive continuous function is Borel measurable, since inverse images of open sets are open. For an integer , substitute in the continuous compact-interval integral. The bridge in [F1] and then increasing truncation in [F2] give . Thus [F2] makes a probability. For , compact substitutions in the same way show that its affine pushforward has the asserted half-line integrals of ; limits of compact intervals give the half-lines, and [F5] gives equality of the measures. For the affine map is constant, giving the Dirac law directly.
The CDF of for is continuous, since is bounded and the integral over an interval of length is at most . It is strictly increasing because the positive continuous density has a positive minimum on every nondegenerate compact interval. For with density , , and integration by parts gives and . The exponential series shows and . Increasing truncation gives and ; symmetry gives . Expanding gives the claimed mean and variance, also for .
Let be independent centered density normal variables with variances . Their sum has density . Indeed, [F4] expresses as the nonnegative double integral of ; for each fixed , a translation in the continuous half-line integral followed by Tonelli gives . These half-line probabilities determine the law by [F5]. Completing the square gives The compact substitutions and increasing limits in step 1.1 therefore give . If either variance is zero the corresponding variable is zero almost surely and the same conclusion is immediate. Scaling a coordinate by a negative coefficient gives the same density as scaling by its absolute value, by the symmetry of . Finite induction, using mutual independence to separate the last coordinate from the preceding tuple, proves with .
If , every coefficient is zero, so convergence in probability implies almost surely. Suppose . Then and eventually . Write for the continuous CDF of . For any and , convergence in probability and step 3.1 give First let , then . Continuity from step 2.1 gives for every . By [F5], has law . Almost sure convergence implies convergence in probability by dominated convergence on the indicators of , and convergence implies it by .
White noise is a Borel Gaussian law on the negative Sobolev space
Statement
Assume countable choice. Let be the wavelet or trigonometric basis from Logarithmic negative Sobolev spaces for white noise. Let be mutually independent real random variables with density . Define the formal white-noise coefficient sequence . For every , this sequence is almost surely an element of and is a Borel Gaussian random element there. Its law is a Borel probability on . For an infinite-dimensional basis, white noise is not an -valued random element. Here Gaussian means that each continuous real linear functional has a centered law in the density convention of Density normal laws and square-summable Gaussian series under countable choice; in particular, for its variance is whenever this pairing is continuous on .
Facts & Assumptions
Logarithmic negative Sobolev spaces for white noise: has squared norm , and its finite-level coordinate projections converge in that norm.
Identical distribution and IID families: Independent identically distributed coordinates are mutually independent; here their common density is given explicitly in the statement.
Monotone convergence for the integral: The expectation of an increasing sequence of nonnegative random variables increases to the expectation of its pointwise limit.
Continuity from above when one set has finite measure: For decreasing events in a probability space, the probability of their intersection is the limit of their probabilities.
Density normal laws and square-summable Gaussian series under countable choice: Under countable choice the density normal laws have mean and variance equal to their parameters, and a probability limit of finite independent centered normal sums has the normal law with limiting variance. Its proof uses density convolution and a CDF sandwich, without characteristic-function uniqueness or full choice.
Given: Countable choice, the countable basis and independent coordinates with the displayed standard normal density.
Proof
Write . In the wavelet case, the trace sum is a finite coarsest term plus . On each block , the sum of is between and ; hence these blocks form a convergent geometric series when , while for their contributions are bounded below by a fixed positive constant and the series diverges. For trigonometric coefficients with bounded multiplicities, the block contributes between constant multiples of to . The same comparison therefore gives finiteness exactly when . Thus the trace is finite in either case.
Let be the sum of over the first coordinates in the fixed countable enumeration. These nonnegative partial sums increase to , and [F3] gives . The mean and second moment of each coordinate are and by [F5]. If on a set of probability , then for every , impossible; hence almost surely.
On that probability-one event, the finite-coordinate sums of are Cauchy in because the squared norm of every tail is the corresponding tail of the convergent series . Completeness gives a limit in . The Cauchy event is measurable, and the partial sums are measurable; their pointwise limit on that event is measurable as an -valued map because the space is separable. Setting it to zero on the measurable complement gives a Borel random element.
Let be the unit vector of the weighted sequence Hilbert space supported on coordinate and let for a continuous real linear functional . For each finite set , boundedness applied to gives , so . Since the weights are bounded, . The finite-coordinate projections of converge almost surely in by step 3.1, so continuity gives almost surely. By [F5] this limit has exactly the density normal law . Thus is centered Gaussian. For a continuous coefficient pairing , one has , giving .
Enumerate the infinite basis as , write its white-noise coordinates as , and let . The displayed normal density is positive on , so ; independence gives . By [F4], for each , so the event that only finitely many occur, a countable union of these intersections, has probability zero: disjointify that union by replacing its th event with , and use countable additivity and monotonicity to sum zero probabilities. Therefore is unbounded almost surely. If the same element were represented by an function, the coefficient embedding in [F1] would identify its coefficients with . The finite Pythagorean identity, applied to the projection onto , would then give for every , a contradiction.
The canonical white-noise law is tight under the Axiom of Choice
Statement
Assume AC. For , the canonical white-noise law on the Polish space from White noise is a Borel Gaussian law on the negative Sobolev space is tight.
Facts & Assumptions
White noise is a Borel Gaussian law on the negative Sobolev space: The white-noise coefficient series defines a Borel probability law on for .
Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space is tight if and only if it is relatively sequentially compact for weak convergence.
Polish spaces are separable completely metrizable spaces: A Polish space is separable and completely metrizable.
Logarithmic negative Sobolev spaces for white noise: is separable and complete with its weighted coefficient norm.
The Axiom of Choice: AC is used exactly in applying Prokhorov's theorem in step 2.1.
Given: AC, , and the Borel probability on .
Proof
By [F4], is separable and complete; the definition of Polish space [F3] therefore makes it Polish.
Every sequence in the singleton family is constant and therefore converges weakly to ; thus is relatively sequentially compact. Applying [F2] under [A1] proves that , and hence the law , is tight.
Weak nonparametric Bernstein–von Mises theorem for product priors
Statement
Let be the S-regular wavelet basis in Logarithmic negative Sobolev spaces for white noise, with coefficients at each level . For , put and let the prior on have IID coefficients with density . Assume countable choice for the prior construction supplied by The wavelet product prior is L2-valued, and take the full posterior kernel as the supplied model input of The product-prior posterior factors by coordinates. Let , write and , and suppose
where is a probability density satisfying for every , for , , and is continuous at each . The observation model is
with standard white noise ; in the stated basis this is the sequence experiment with independent standard normal coordinates. Let be the product-coordinate posterior of The product-prior posterior factors by coordinates. Let be the law of the canonical white noise in and define
For every ,
in probability under the true white-noise law . This is a bounded-Lipschitz weak BvM conclusion; it asserts neither total-variation convergence on all Borel subsets nor an -valued Gaussian limit.
Facts & Assumptions
Logarithmic negative Sobolev spaces for white noise: has norm , where , and its trace sum is finite for .
The wavelet product prior is L2-valued: The product prior series defines an -valued random element for and finite coefficient second moment.
White noise is a Borel Gaussian law on the negative Sobolev space: The canonical white-noise coefficient sequence has Borel Gaussian law on for , is not -valued, and satisfies for every .
A negative-Sobolev posterior second-moment bound: For any , is bounded uniformly in .
Finite-coordinate posterior total-variation limit: For every fixed finite coordinate projection, the posterior and standard Gaussian densities of converge in in probability.
The product-prior posterior factors by coordinates: A supplied posterior kernel has product-coordinate marginals with densities proportional to .
Cauchy-Schwarz for random variables: On any probability space, for square-integrable real random variables.
Markov's inequality for random variables: For nonnegative and , .
The Axiom of Countable Choice (): Countable choice supplies the prior construction and the density normal-law interface used by [F3]. The full posterior kernel is supplied as model input by [F6]; the posterior moment estimate, finite-coordinate convergence, and projection/tail inequalities introduce no further choice axiom.
Given: Countable choice, the basis, prior, truth, density conditions, white-noise experiment, and the supplied posterior kernel of [F6]. The stated bounded-Lipschitz convergence is proved below without using full AC.
Proof
Fix and choose with . Let retain all wavelet coordinates with level . Since and , for one has For any probability law on , coupling with and using the defining Lipschitz bound gives .
For a fixed , the middle term in tends to zero in probability: [F5] gives convergence of the projected posterior and Gaussian coordinate densities. Every bounded-Lipschitz test function restricted to the projected subspace is bounded by , so its integral difference is at most that distance.
The last term is bounded by , which is at most by [F3] and [F7]. This tends to zero as by [F1].
Under the joint true-data/posterior law, using the supplied posterior model [F6] and the prior construction [F2], , where has law . By [F4], [F3] and , with independent of . Applying [F7] under the posterior probability and then under the true-data probability, together with step 1.1, gives Thus the first projection error can be made uniformly small by taking large.
Fix and choose so the expected first and deterministic third terms are each less than . By [F8], the probability that the first term exceeds is at most ; the deterministic third term is less than . For this fixed , step 1.2 makes the probability that the middle term exceeds tend to zero. The triangle bound then gives a limiting upper bound for the probability that the full distance exceeds . Since is arbitrary, in -probability.
The scaled posterior converges weakly on the negative Sobolev space
Statement
Assume AC and the hypotheses of Weak nonparametric Bernstein–von Mises theorem for product priors. Then the random Borel probability measures converge weakly in probability to on , where weak convergence is the bounded-continuous-test definition in Weak convergence of borel probability measures.
Facts & Assumptions
Weak nonparametric Bernstein–von Mises theorem for product priors: in -probability.
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: Under AC, convergence in is equivalent to weak convergence on a Polish space.
Weak convergence of borel probability measures: Weak convergence means convergence of integrals for every bounded continuous real test function.
The Axiom of Choice: AC is required only for the weak-topology metrization in [F2]; the bounded-Lipschitz conclusion [F1] itself requires only its stated countable-choice premise.
Given: AC and the main theorem's random posterior measures and limit law.
Proof
By [F2], the bounded-Lipschitz metric is a metric for the weak topology on the Polish space under [A1].
The convergence in probability of this metric to zero in [F1] is exactly convergence in probability in the weak topology established in step 1.1; by [F3], its deterministic convergence relation is bounded-continuous-test convergence. This is the asserted weak posterior limit.
Continuous images of the scaled posterior converge weakly
Statement
Assume AC and the hypotheses of Weak nonparametric Bernstein–von Mises theorem for product priors. Let be a metric space and let be Borel measurable with , where . For every bounded continuous ,
in -probability. In particular this holds for continuous maps, including continuous linear functionals into .
Facts & Assumptions
The scaled posterior converges weakly on the negative Sobolev space: converges weakly in probability to on .
Continuous mapping theorem: If on a metric space and is measurable with , then .
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: Under AC, the bounded-Lipschitz metric metrizes weak convergence on Polish .
The Axiom of Choice: AC is needed only for the weak-topology interpretation imported through [F1] and [F3]; the continuous-mapping step is the choice-free theorem [F2].
Given: AC, a metric target , the map , and the posterior and limit measures in the statement.
Proof
Fix a bounded continuous and define . If , [F3] gives under [A1]; [F2] and imply , hence . Since is a metric, this sequential criterion proves continuity of at .
Given , continuity from step 1.1 supplies such that implies . Therefore by [F1] and [F3], which give bounded-Lipschitz convergence in probability on . This is the stated convergence in probability for .
Prior-predictive and fixed-truth data laws are equivalent
Statement
Assume countable choice. Use the wavelet product prior and white-noise model from The wavelet product prior is L2-valued and White noise is a Borel Gaussian law on the negative Sobolev space, with , , and a common coefficient density having finite second moment . Let . For each and , let be the prior-predictive law on of , with prior draw independent of canonical white noise , and let be the law of . Then and are mutually absolutely continuous as Borel probabilities on .
Facts & Assumptions
Given: The product-prior and white-noise laws, independence between the prior draw and observation noise, , finite coefficient second moment , and .
Logarithmic negative Sobolev spaces for white noise: is the weighted coefficient Hilbert space, its finite-coordinate projections converge in norm, and embeds continuously into it.
The wavelet product prior is L2-valued: The prior coefficients are independent with common density , and the prior law is supported on under its stated scale and moment conditions.
White noise is a Borel Gaussian law on the negative Sobolev space: The noise law is a Borel probability on with independent standard normal coordinates.
The Bessel inequality for an arbitrary orthonormal family: The squared coefficient sum of is at most .
Independent random elements have product joint law: A finite independent family of random elements has the product of its marginal laws as its joint law.
Finite measures agreeing on a generating pi-system and on the whole space are equal: Finite measures agreeing on a generating pi-system and on the whole space agree on the generated sigma-algebra.
The indefinite integral of a nonnegative measurable function is a measure: For a nonnegative measurable density , the set function is a measure.
Riesz-Fischer completeness of for : Under countable choice, is complete for the probability measure .
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: Nonnegative integrands may be integrated in either order under the product of the prior coordinate law and Lebesgue measure.
The Gaussian integral : The Gaussian integral normalizes the displayed one-dimensional normal densities.
Given: All probabilities in the statement are defined on the specified Borel space; only their equivalence is proved below.
Proof
Enumerate the wavelet coefficients as and let retain the first coordinates. The sigma-algebra generated by all coordinate maps is the Borel sigma-algebra of . Indeed, the coordinate maps are continuous, so their sigma-algebra is contained in the Borel sigma-algebra. Conversely, for any closed set , is measurable with respect to the coordinate sigma-algebra and converges to by [F1]. Thus belongs to that sigma-algebra.
Write and let , where for . The true and prior-predictive coordinate densities are and ; both are positive probability densities by [F9, F10]. Put and . Concavity of square root and [F9] give . Completing the square and using [F10] evaluates the inner integral as . Thus . By [F2], [F3], and [F5] the prior-predictive and true coordinates are each independent across . By [F4] and the geometric-series formula, and . Hence and .
Let be the sigma-algebra of the first coordinates on and set . Under , is the density of the first true coordinates relative to the first prior-predictive coordinates, and . By [F5], finite coordinate laws are products; hence for , independence gives so uniformly in . By [F8] and countable choice, has an limit ; since each term is nonnegative, , so almost surely. The norms give . Put . Then , and with .
For every event and , the finite-coordinate density identity and independence of the remaining coordinates give . Passing to the limit gives . By [F7], the nonnegative density L with total integral one defines a probability measure. Such finite-coordinate cylinder events form a generating pi-system by step 1.1; [F6] therefore gives for every Borel . Thus . Interchanging and gives the same argument and proves .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Definition 2 and equations (7)–(8), printed pp. 2004–2006
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §7.3.4, printed pp. 594–595
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Condition 1 and proof of Theorem 5, printed pp. 2013–2016
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Condition 7.3.11 and proof of Theorem 7.3.12, printed pp. 583–585
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §3.7 and §7.3.4, printed pp. 246–247 and 594–595
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Definition 1, printed pp. 2003–2004
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §3.1, printed pp. 2013–2014
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §7.3.3, printed pp. 583–585
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Theorem 5 and proof, printed pp. 2013–2016
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Theorem 7.3.12 and proof, printed pp. 584–586
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Theorem 7 and discussion, printed p. 2017
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Theorem 7.3.18 and proof, printed pp. 593–594
- Ray, Adaptive Bernstein–von Mises theorems in Gaussian white noise, §7.1, printed pp. 23–24
- Durrett, Probability: Theory and Examples, fifth edition, Gaussian density and independent sums
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §1.2, equations (7)–(8), printed pp. 2005–2006
- Ray, Adaptive Bernstein–von Mises theorems in Gaussian white noise, §2.1, printed pp. 5–6
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §1.2, printed pp. 2005–2006
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Theorems 5, 7–9 and proofs, printed pp. 2013–2021
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Theorems 7.3.12, 7.3.18–7.3.19 and proofs, printed pp. 584–596
- Ray, Adaptive Bernstein–von Mises theorems in Gaussian white noise, §§2.1–2.2 and §7.1, printed pp. 5–8 and 23–24
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Definition 1 and Theorem 9, printed pp. 2003–2004 and 2019–2020
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Theorem 7.3.19, printed pp. 595–596
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, continuous-mapping discussion, §4.1, printed pp. 2021–2022
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, continuous-mapping consequence, §7.3.4, printed pp. 600–601
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Condition 1 and Theorem 5, printed pp. 2013–2016
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Condition 7.3.11 and Theorem 7.3.12, printed pp. 583–586