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.
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 .
Depends on
- Markov's inequality for random variables
- The Axiom of Choice
- Little-o multiscale coefficient space M0(w)
- Type-S log-density and type-H histogram prior families
- The bounded-Lipschitz metric characterizes weak convergence on Polish spaces
- Compact wavelet projections approximate smooth functions and commute asymptotically with multiplication
- A bounded-density Gaussian bridge has a Borel multiscale law
- Bernstein tail bound for independent bounded sums
- Finite-projection convergence and posterior tail control imply weak BvM
- Type-S posterior contracts in quotient log-density coordinates without a tail restriction on a log-Lipschitz prior
- Cramer wold device
- Dominated convergence
- Prokhorov tightness theorem on polish spaces
- Uniqueness of a law from its characteristic function
Used by
Dependency tree · two levels
66 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, 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 (standard reference, not scraped)
- Castillo, On Bayesian supremum norm contraction rates, §4.3 (standard reference, not scraped)