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.

Nonlinear-functional BvM limit under fast L2 contraction

Statement

Use the white-noise experiment, product prior, and supplied posterior kernel of Weak nonparametric Bernstein–von Mises theorem for product priors, with all its stated basis, coefficient-density, truth, and countable-choice hypotheses. Let Ψ:L2([0,1])→R be Borel measurable. Suppose f0∈L2, and for some g∈H2s, s>1/2, g≠0, C<∞, and ρ>0, ∣Ψ(f0+h)−Ψ(f0)−⟨h,g⟩L2∣≤C∥h∥22whenever ∥h∥2≤ρ. Assume the posterior contracts in L2 at a deterministic radius rn=o(n−1/2), meaning Πn(∥f−f0∥2>rn∣X(n))=oPf0(n)(1). Define the efficient center θn∗:=Ψ(f0)+Lg(X(n)−f0), where the last pairing is the continuous H(δ) extension from Smooth functionals extend continuously to the white-noise topology. Then the posterior law of n{Ψ(f)−θn∗} converges in bounded-Lipschitz distance to N(0,∥g∥22) in Pf0(n)-probability. The equal-tailed posterior interval for Ψ(f) at level 1−α is credible and has frequentist coverage tending to 1−α.

The stipulated radius implies the source's squared-radius condition: with sn=rn2, one has sn=o(n−1/2) and posterior mass inside ∥f−f0∥22≤sn tends to one. However, for g≠0 this radius is incompatible with the imported weak BvM limit. Thus the implication under the retained radius is vacuous; the source's squared-radius condition does not have this incompatibility.

Facts & Assumptions

Given: The product-prior weak BvM model of [F1], the Borel functional Ψ, the stated local quadratic expansion with nonzero Riesz representer g, the posterior L2 radius rn=o(n−1/2), and 0<α<1.

[F1]

Weak nonparametric Bernstein–von Mises theorem for product priors: the posterior law of n(f−X(n)) converges in bounded-Lipschitz distance on H(δ) to the canonical white-noise law for every δ>1/2.

[F2]

Smooth functionals extend continuously to the white-noise topology: Lg extends continuously from L2 to H(δ).

[F3]

White noise is a Borel Gaussian law on the negative Sobolev space: Lg(W) is exactly N(0,∥g∥22) under the true white-noise law.

[F4]

Posterior quantiles stabilize under scalar weak convergence: scalar bounded-Lipschitz convergence to a CDF continuous on R and locally strictly increasing at the target quantile implies quantile convergence.

[F5]

Equal-tailed posterior quantile intervals are credible: equal-tailed posterior quantiles define a measurable credible interval of posterior mass at least 1−α.

[F6]

Density normal laws and square-summable Gaussian series under countable choice: Under countable choice, in its density convention, N(0,1) is defined by its continuous positive density, and N(0,σ2) for σ>0 is its image under x↦σx; change of variables gives a continuous strictly positive density and hence a continuous strictly increasing CDF.

[A1]

The Axiom of Countable Choice (ACω): countable choice supplies the L2 prior construction in [F1] and the density normal-law interface [F6]; no full choice is used below.

Proof

1.1givenalgebra

On the posterior event ∥f−f0∥2≤rn≤ρ, write R(f)=Ψ(f)−Ψ(f0)−Lg(f−f0). The expansion gives n∣R(f)∣≤Cnrn2→0. Outside the event, posterior mass is oPf0(n)(1) by assumption. Hence for every ε>0, Πn(n∣R(f)∣>ε∣X(n))→0 in Pf0(n)-probability.

2.1A1F1F2F3step 1.1algebra

For posterior draws, n{Ψ(f)−θn∗}=nLg(f−X(n))+nR(f). For cg=max⁡(1,∥Lg∥), composing a bounded 1-Lipschitz scalar test with Lg and dividing by cg gives an admissible bounded-Lipschitz test on H(δ). Thus the first term has bounded-Lipschitz distance to the pushforward limit at most cg times the distance in [F1]; by [F3] that limit is N(0,∥g∥22). For any bounded 1-Lipschitz test function, replacing the first term by its sum with the remainder changes its posterior integral by at most ε+2Πn(n∣R(f)∣>ε∣X(n)). Step 1.1 and then ε↓0 prove the asserted scalar BvM limit.

3.1F4F5F6step 2.1algebra

Apply [F4] to the centered and scaled posterior law in step 2.1. By [F6], its α/2 and 1−α/2 quantiles converge in probability to ∥g∥2zα/2 and ∥g∥2z1−α/2. Translating and rescaling these quantiles gives the equal-tailed posterior interval for Ψ(f); its credibility follows from [F5].

4.1F3F6step 3.1algebra

Under the true experiment, n{θn∗−Ψ(f0)}=Lg(W) has exactly the law N(0,∥g∥22) by [F3]. The random centered interval endpoints in step 3.1 converge in probability to the corresponding normal quantiles. For any fixed ε>0, on the event that both endpoints are within ε of their limits, coverage is bounded by deterministic normal-interval probabilities with endpoints enlarged or contracted by ε. This argument requires no independence between the endpoints and Lg(W). By [F6], the mass of shrinking endpoint neighborhoods vanishes; letting n→∞ and then ε↓0 gives coverage 1−α.

5.1F1F2F3F6step 2.1givenconstructalgebra∎

To verify the caveat, put Q=N(0,∥g∥22), whose density is bounded by M=(2π∥g∥22)−1/2 by [F6]. Choose 0<a≤1 with 2aM<1/2 and set cn=−nLg(X(n)−f0). For each realized data set, hn(x)=(a−∣x−cn∣)+ is a bounded 1-Lipschitz test. On ∥f−f0∥2≤rn, its value at nLg(f−X(n)) is at least a−n∥g∥2rn, so its posterior integral tends to a in probability. But ∫hn dQ≤2a2M<a/2 for every center cn. The bounded-Lipschitz distance is a supremum over all such tests for each data set, so it cannot tend to zero. This contradicts the linear pushforward of [F1] established in step 2.1 and proves the incompatibility.

Depends on

Used by

Dependency tree · two levels

42 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