Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

CDF and multiscale credible-band calibration from weak BvM limits

Statement

Let P0 have a density f0 on [0,1] bounded above and bounded away from zero, and put F0(t)=∫0tf0(x)dx. Use the wavelet basis and M0(w) of Little-o multiscale coefficient space M0(w), and assume the wavelet conditions and summability condition ∑lwl2−l/2<∞ of The multiscale primitive map is continuous into C[0,1]. Let Tn be a measurable L2-valued center, let Πn be a posterior kernel supported on L2 densities, and define Qn to be the conditional law on M0(w) of n(f−Tn) under f∼Πn(⋅∣Xn).

Assume under P0n that (i) Qn converges in bounded-Lipschitz distance in probability to the centered Gaussian bridge coefficient law GP0 in M0(w), whose finite coefficient covariances are P0[(h−P0h)(g−P0g)], and (ii) n(Tn−f0)⇒GP0 in M0(w). For u=1−α, let qM and qC be the lower u-quantiles of ∥GP0∥M(w) and ∥JGP0∥∞. Assume both CDFs are continuous on R and strictly increasing on open neighborhoods of their respective quantiles, and that qM,qC>0. These local quantile conditions allow the CDFs to be constant on the negative half-line. In the projected empirical-center case Tn=Pn(Ln), Projected empirical bridge CLT in the little-o multiscale space supplies premise (ii) under its stated smoothness and cutoff conditions. For the source-specific type-S and type-H priors, the posterior BvM premise (i) is established in Type-S density posteriors satisfy the weak multiscale Bernstein–von Mises theorem and Type-H histogram posterior weak Bernstein–von Mises theorem, respectively.

For a posterior draw f, write Ff=Jf and FTn=JTn, where J is the primitive map of The multiscale primitive map is continuous into C[0,1]. Then the posterior law of n(Ff−FTn) converges in bounded-Lipschitz distance on C([0,1]) to the P0-Brownian bridge BP0(t), with covariance F0(s∧t)−F0(s)F0(t).

For 0<α<1, let RnM and RnC be the posterior lower 1−α quantiles of ∥n(f−Tn)∥M(w) and ∥n(Ff−FTn)∥∞, respectively. The corresponding posterior balls CnM={f:∥f−Tn∥M(w)≤RnM/n},CnC={F:∥F−FTn∥∞≤RnC/n} are measurable credible sets of posterior mass at least 1−α. Their frequentist coverage tends to 1−α, and the scaled radii converge to the respective 1−α quantiles of ∥GP0∥M(w) and ∥BP0∥∞.

Facts & Assumptions

Given: The density law, posterior kernel, wavelet basis, space M0(w), primitive map, two weak-convergence assumptions, continuous strictly increasing limit norm CDFs, and 0<α<1 in the Statement.

[F1]

Little-o multiscale coefficient space M0(w): M0(w) has the weighted supremum norm on wavelet coefficients whose normalized level maxima vanish.

[F2]

The multiscale coefficient space is separable and has vanishing projection tails: every square-summable wavelet coefficient sequence belongs to M0(w).

[F3]

The multiscale primitive map is continuous into C[0,1]: J:M0(w)→C([0,1]) is continuous and agrees with f↦(t↦∫0tf) for L2 functions.

[F4]

Continuous mapping theorem: a continuous map carries weak convergence of probability laws to weak convergence of their pushforwards.

[F5]

Posterior quantiles are measurable and bracket their probability level: for a posterior probability kernel on R, its lower u-quantile is measurable and its CDF brackets u.

[F6]

Posterior quantiles stabilize under scalar weak convergence: if the limiting scalar CDF is continuous on R and strictly increasing on a neighborhood of the target quantile, bounded-Lipschitz convergence in probability implies convergence of that posterior quantile.

[F7]

Posterior credible set: a graph-measurable rule whose posterior mass is at least 1−α is a posterior credible set at level 1−α.

[A1]

The posterior laws Qn converge in bounded-Lipschitz distance in probability to the centered Gaussian bridge coefficient law GP0 in M0(w).

[A2]

The sampling centers satisfy n(Tn−f0)⇒GP0 in M0(w).

[A3]

The CDFs of ∥GP0∥M(w) and ∥JGP0∥∞ are continuous on R and strictly increasing on open neighborhoods of their positive 1−α quantiles. Continuity at each lower quantile q implies its CDF value is 1−α.

[F8]

Portmanteau theorem: weak convergence of probability measures gives convergence of probabilities of sets whose boundary has zero limit measure.

[F9]

Projected empirical bridge CLT in the little-o multiscale space: for the projected empirical center and the theorem's coefficient regularity and cutoff assumptions, n(Pn(Ln)−f0)⇒GP0 in M0(w).

[F11]

Logarithmic negative Sobolev spaces for white noise: the wavelets form a complete orthonormal basis of L2([0,1]), so finite orthogonal projections converge in L2.

[F12]

Cauchy-Schwarz for random variables: square-integrable random variables satisfy ∣E[UV]∣≤(EU2EV2)1/2.

Proof

1.1A1F3F11F12givenalgebra

The posterior draw f and center Tn are L2-valued, so [F2] embeds n(f−Tn) in M0(w); [F1] supplies its norm. For an L-Lipschitz map T between metric spaces and any admissible bounded 1-Lipschitz test h on its target, h∘T/max⁡(1,L) is an admissible test on its domain. Therefore βBL(T#ν,T#ρ)≤max⁡(1,L)βBL(ν,ρ). By [F3], J is linear and Lipschitz with a finite constant LJ. The bound applied pointwise to the data-indexed laws in [A1] gives βBL(J#Qn,J#GP0)→0 in probability. Moreover, if ℓ:C([0,1])→R is continuous and linear, then ℓ∘J is continuous and linear on M0(w). The centered Gaussian premise on GP0 says exactly that this scalar pushforward is centered normal, allowing zero variance. Thus J#GP0 is a centered Gaussian Borel law. In particular, for any finite t1,…,tm and real a1,…,am, the functional x↦∑iaiJx(ti) is continuous and linear, so the evaluation vector (JGP0(ti))i=1m is jointly centered Gaussian. This uses only the scalar Gaussian pushforward meaning of the premise, without characteristic-function uniqueness or a Gaussian existence theorem. To identify its covariance, let pJ1[0,s] be the finite wavelet projection of the indicator. The finite Gaussian coefficient covariance gives Cov⁡(J(PJGP0)(s),J(PJGP0)(t))=P0[(pJ1[0,s]−P0pJ1[0,s])(pJ1[0,t]−P0pJ1[0,t])]. By [F11], pJ1[0,s]→1[0,s] in Lebesgue L2; since f0≤B, this is also convergence in L2(P0). The variance of a difference of two finite projected Gaussian evaluations is the P0-variance of the corresponding difference of projected indicators, so it tends to zero; hence those evaluations are Cauchy in L2. They also converge almost surely to JGP0(s) because PJGP0→GP0 in M0(w) and J is continuous. The almost-sure and in-probability limits coincide: for any ε>0, the probability that they differ by more than ε is bounded by the two probabilities that each sequence differs from its limit by more than ε/2, both tending to zero. If UJ,VJ are the projected evaluations and U,V their L2 limits, [F12] gives ∣E[UJVJ]−E[UV]∣≤∥UJ−U∥2∥VJ∥2+∥U∥2∥VJ−V∥2⟶0; the norms ∥VJ∥2 are bounded because VJ→V in L2, and the means converge to zero as well. Thus the finite covariance passes to the limit. The resulting covariance is P0[(1[0,s]−F0(s))(1[0,t]−F0(t))]=F0(s∧t)−F0(s)F0(t), the defining covariance of the P0-Brownian bridge.

1.2F5F7givenalgebra

The posterior pushforward under either norm is a probability kernel on [0,∞). By [F5], the two lower quantiles are measurable and their posterior CDFs at those radii are at least 1−α. Since the centers and norms are measurable, the membership graphs of CnM and CnC are measurable. Thus both sets are credible by [F7].

2.1A1A2A3F1F6F9step 1.1

The norm maps x↦∥x∥M(w) and F↦∥F∥∞ are 1-Lipschitz by the reverse triangle inequality. Applying the pushforward bound of step 1.1 first to the M(w) norm and then to the supremum norm after J gives bounded-Lipschitz convergence in probability of both posterior norm laws to their corresponding limit norm laws. Their CDFs satisfy [A3], so [F6] gives RnM→qM and RnC→qC in probability. For the projected empirical center Tn=Pn(Ln), [F9] verifies [A2] under the smoothness and cutoff assumptions in [F9].

3.1A2A3F3F4F8step 2.1algebra∎

By [A2] and [F4], n(Tn−f0)⇒GP0 and its primitive converges weakly to BP0. The frequentist error uses the negative center difference, but ∥f0−Tn∥M(w)=∥Tn−f0∥M(w) and ∥J(f0−Tn)∥∞=∥J(Tn−f0)∥∞ because J is linear. Thus each scaled frequentist error norm converges to the corresponding limit norm in [A3]. On the event that the random radius is within ε of its deterministic limit from step 2.1, coverage is bounded above and below by probabilities for the frequentist norm with fixed thresholds expanded or contracted by ε. [F8] gives convergence of those fixed-threshold probabilities because [A3] makes their boundary probabilities zero. Sending ε↓0 and using the CDF value 1−α at its quantile from [A3] yields 1−α for both coverage probabilities. This comparison does not require independence between the data-dependent posterior radii and the frequentist center.

Depends on

Used by

Dependency tree · two levels

61 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