Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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: 1/2<α≤1, f0∈Cα([0,1]), 0<ρ0≤f0≤D0<∞, either original cutoff Ln=jn or Ln=ℓn, and c12−Lna≤ak,Ln≤c2 for fixed positive a,c1,c2. Write mn=2Ln. In the Haar convention, the scaling function is 1, the detail functions are ψlk=2l/2(1Il+1,2k−1Il+1,2k+1),l≥0,0≤k<2l, and a histogram at resolution Ln has only the scaling coordinate and levels l<Ln. Let X1,…,Xn be IID from f0, let Nnk=∑i1ILn,k(Xi), and define the empirical histogram hn(x)=mnNnk/non ILn,k. Let Πn(⋅∣Xn) be the density posterior for the stated histogram prior. For every nondecreasing wl≥1 with wl/l+1→∞, its conditional law Qn of n(f−hn) satisfies βBL,M0(w)(Qn,L(GP0))⟶0 in P0n-probability, where the Borel centered Gaussian bridge GP0 is supplied by A bounded-density Gaussian bridge has a Borel multiscale law and has covariance P0[(ψ−P0ψ)(ψ′−P0ψ′)]. 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.

[F1]

Finite Dirichlet gamma representation and weighted Bernstein bound: a Dirichlet vector of shapes βk is Zk/S for independent Gamma(βk,1) variables; S has mean and variance B=∑kβk. For T(q)=∑kqk(Zk−βk), ∣qk∣≤b, and V=∑kβkqk2>0, Pr⁡(∣T(q)∣>x)≤2e−x2/[2(V+bx)]. Disjoint Gamma shapes add, and EeuZk=(1−u)−βk for u<1.

[F2]

Dirichlet-Multinomial conjugate update and Bayes formula for dominated kernels identify the positive finite normalized Dirichlet likelihood update.

[F3]

A bounded-density Gaussian bridge has a Borel multiscale law supplies the Borel Gaussian bridge law for the bounded density in the Statement.

[F4]

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.

[F5]

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.

[F6]

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.

[F8]

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.

1.1F1F2givenalgebra

Abbreviate m=mn, ak=ak,Ln, A=∑kak, βk=Nnk+ak, and B=n+A. The original cutoff conditions and α>1/2 give m/n→0 and mlog⁡n/n→0, and A≤c2m. On the positive simplex, the full-data histogram likelihood is mn∏kωkNnk. Multiplication by the prior density yields a constant times ∏kωkβk−1, with every shape positive; its normalization is finite positive by [F2]. Therefore the full-data posterior is Dirichlet(βk)k, regardless of whether the actual sampling truth is itself a histogram. By [F1] realize it by ωk=Zk/S. Write Rn for the posterior mean histogram measure, identified with its density in coefficient differences, with cell masses βk/B. For a cell-constant function q, set T(q)=∑kqk(Zk−βk). Direct subtraction gives n(ωq−Rnq)=(n/S)T(q−Rnq).

2.1F7step 1.1algebra

Fix constants t>0 and C large enough that c:=tC−D0(et−1)>0. Since Nnk is Binomial(n,pk) with pk=P0ILn,k≤D0/m, independence of the observations gives EetNnk=(1+pk(et−1))n≤enD0(et−1)/m. Hence En={max⁡kNnk≤Cn/m} satisfies P0n(Enc)≤me−cn/m→0, by exponential Markov and the union bound. On En, for all sufficiently large n, βk≤C′n/m, B≤2n, and both the empirical histogram density and the mean histogram density are bounded by a fixed constant C′ independent of n.

2.2F1F7step 1.1givenalgebra

Fix finitely many Haar coordinates. Choose a fixed coarse dyadic partition of r cells on which all their functions are constant. For large n its cells are unions of level-Ln cells. By [F1], the corresponding grouped Gamma variables Znj are independent Gamma(bnj,1) with bnj=Nn(Jj)+∑ILn,k⊂Jjak. Their summed shape is still B. Write pj=P0(Jj)>0. Each coarse count satisfies E[Nn(Jj)/n]=pj and variance at most 1/(4n), by observation independence. Markov applied to squared deviations, together with A/n→0, proves bnj/n→pj in P0n-probability simultaneously for the fixed finite partition.

3.1F1F7step 1.1step 2.1algebracases

On En, take any Haar detail ψ=ψlk with l<Ln and put q=ψ−Rnψ. Then ∣q∣≤2 2l/2 and V=∑kβkqk2=BVar⁡Rn(ψ)≤BRnψ2≤C′n, using ∫ψ2=1 and the density bound. By [F1] and [F7], Pr⁡(S<B/2∣Xn)≤4/B, because Var⁡(S)=B. On the complement, step 1.1 yields ∣n(ωψ−Rnψ)∣≤2∣T(q)∣/n. Thus, apart from the single event {S<B/2}, the conditional probability that this absolute coefficient exceeds x is at most 2exp⁡{−c0x2/(1+2l/2x/n)} for a fixed c0>0. The zero-variance case has no such failure event, by [F1].

3.2F1F5F7step 2.2algebra

Consider any deterministic data sequence along which bnj/n→pj for every j. Under its conditional Gamma product laws put Ynj=(Znj−bnj)/n. For every fixed t∈Rr, [F1] and the logarithm series give log⁡Eet⋅Yn=∑jbnj[−log⁡(1−tj/n)−tj/n]→12∑jpjtj2. The remainder is O(n−3/2∑jbnj∣tj∣3)=O(n−1/2). The means of Yn are zero and their total second moments are B/n=O(1), 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 t, the same expansion at 2t uniformly bounds Ee2t⋅Yn; hence et⋅Yn is uniformly integrable. Truncation of this continuous exponential therefore passes its expectation through each weakly convergent subsequence. The limit law has transform exp⁡(12∑jpjtj2) and an exponential moment on a neighborhood of zero: eδ∑j∣yj∣≤∑ϵ∈{−1,1}reδϵ⋅y and the corresponding transforms are finite. The independent centered normal vector with variances pj has this same transform, by completing the square in each normal density. Transform uniqueness [F5] identifies every subsequential limit, proving Yn⇒Nr(0,diag⁡(p)).

4.1F4F7F8step 2.1step 3.1algebra

Choose a fixed K>0 sufficiently large. Uniformly over l<Ln, 2l/2Kl+1/n≤Km(Ln+1)/n→0. Summing the exponential bounds of step 3.1 over levels J<l<Ln and their 2l coefficients therefore gives, for all large n, Πn{max⁡J<l<Ln,k∣n(f−Rn)lk∣/l+1>K∣Xn}≤4/B+∑l>J2l+1e−c1K2(l+1) on En, with fixed c1>0. The probability 4/B is counted only once, since the same S normalizes every coordinate. Choose K with c1K2>2log⁡2; the displayed series tail then tends to zero with J. For any ε>0, admissibility gives Kl+1≤εwl for all sufficiently large l. Both f and Rn are histograms, so all their detail coordinates at l≥Ln vanish. Consequently their conditional M(w) tails vanish in the iterated limit of [F4], first n→∞, then J→∞, since P0n(Enc)→0.

5.1F8step 1.1step 2.1step 4.1algebra

For a Haar detail ψ=ψlk, exact subtraction gives n(Rnψ−Pnψ)=n[∑kakψk−APnψ]/B. Haar cell values satisfy m−1∑k∣ψk∣=∫∣ψ∣=2−l/2≤1. Hence ∣∑kakψk∣≤c2m, while on En, ∣Pnψ∣≤C∫∣ψ∣≤C. This bounds every such mean shift by C′′m/n→0. The scaling-coordinate shift is exactly zero, and all coordinates at l≥Ln vanish for both centers. Since wl≥1, ∥n(Rn−hn)∥M(w)→0 uniformly on En. In particular step 4.1 also supplies the required posterior tails about hn.

6.1F3F6step 5.1step 3.2algebra

Here (S−B)/n=∑jYnj, S/n→1 in conditional probability by its variance B/n2→0 and mean B/n→1. Exact algebra gives n(Znj/S−bnj/B)=(n/S)[Ynj−(bnj/B)∑hYnh]. By [F6] and step 3.2, this vector converges to (Uj−pj∑hUh)j, with Uj independent N(0,pj). Its covariance is diag⁡(p)−ppT. Applying the fixed linear map from coarse-cell masses to the chosen Haar coordinates yields covariance exactly P0[(ψ−P0ψ)(ψ′−P0ψ′)]. Step 5.1 removes the mean shift from Rn to hn on En. Thus along every deterministic data sequence with the ratios in step 2.2 converging and En eventually occurring, the finite-coordinate posterior converges weakly, hence in BL by [F6], to the corresponding projection of [F3].

7.1F6step 2.1step 2.2step 6.1givenchoosecontradiction

The preceding deterministic-sequence conclusion implies the finite-coordinate BL convergence in P0n-probability. To see this without a simultaneous conditional null-set assertion, if that convergence failed, there would be ε,η>0 and infinitely many n with probability at least η that the distance exceeds ε. Along a subsequence, step 2.2 and P0n(Enc)→0 make the probability of a ratio error above 1/q or Enc smaller than η/2 at its qth chosen index. Thus at each such index there exists data with distance above ε, ratio error below 1/q, and En 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.

8.1F3F4F8step 4.1step 5.1step 7.1algebra∎

The posterior histogram construction [F8] and its finite-dimensional simplex kernel make Qn a data-indexed Borel probability on M0(w): each draw and hn 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 M0(w) 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

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