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.
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.
Depends on
Used by
- The canonical white-noise law is tight under the Axiom of Choice Corollary
- Little-o multiscale coefficient space M0(w) Definition
- Smooth linear functionals on the white-noise topology Definition
- Type-S log-density and type-H histogram prior families Definition
- A Gaussian wavelet product prior covered by the weak BvM theorem Example
- White noise has a negative-Sobolev law but no L2-valued law Example
- A negative-Sobolev posterior second-moment bound Lemma
- Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication Lemma
- Continuous and strictly increasing norm distributions for density bridges Lemma
- Prior-predictive and fixed-truth data laws are equivalent Lemma
- Smooth functionals extend continuously to the white-noise topology Lemma
- The multiscale primitive map is continuous into C[0,1] Lemma
- White noise is a Borel Gaussian law on the negative Sobolev space Lemma
- CDF and multiscale credible-band calibration from weak BvM limits Theorem
- Weak nonparametric Bernstein–von Mises theorem for product priors Theorem
Dependency tree · two levels
13 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, Definition 2 and equations (7)–(8), printed pp. 2004–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)