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.
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.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Identical distribution and IID families
- Logarithmic negative Sobolev spaces for white noise
- Density normal laws and square-summable Gaussian series under countable choice
- Continuity from above when one set has finite measure
- Monotone convergence for the integral
Used by
- The canonical white-noise law is tight under the Axiom of Choice Corollary
- White noise has a negative-Sobolev law but no L2-valued law Example
- Prior-predictive and fixed-truth data laws are equivalent Lemma
- Linear-functional BvM limit and credible-interval calibration Theorem
- Nonlinear-functional BvM limit under fast L2 contraction Theorem
- Weak nonparametric Bernstein–von Mises theorem for product priors Theorem
Dependency tree · two levels
43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, §1.2, equations (7)–(8), printed pp. 2005–2006 (standard reference, not scraped)
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §7.3.4, printed pp. 594–595 (standard reference, not scraped)
- Ray, Adaptive Bernstein–von Mises theorems in Gaussian white noise, §2.1, printed pp. 5–6 (standard reference, not scraped)