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-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.
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
- A bounded-density Gaussian bridge has a Borel multiscale law
- Finite Dirichlet gamma representation and weighted Bernstein bound
- Finite-projection convergence and posterior tail control imply weak BvM
- Finite type-S and type-H prior draws are L2 probability densities
- Uniqueness of a multivariate exponential transform
- Bayes formula for dominated kernels
- Dirichlet-Multinomial conjugate update
- Finite and countable subadditivity of measures
- Prokhorov tightness theorem on polish spaces
- Vector Slutsky theorem
Used by
Dependency tree · two levels
75 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, printed pp.24–28 (standard reference, not scraped)
- Castillo, On Bayesian supremum norm contraction rates, §4.4, printed pp.25–28 (standard reference, not scraped)