Alphabeta Math
Pipeline-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.

Functional BvM limits and credible-set calibration — Examples

1 · Prerequisites

2 · Summary

Objective

These examples verify a smooth white-noise functional, show a nonlinear remainder that survives at the root-n scale, and instantiate the declared type-S and type-H prior conditions at a uniform truth. The final counterexample separates posterior credibility from frequentist coverage when no BvM condition is available.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A boundary truth can give an equal-tailed credible interval zero coverage

Statement refuted

Every equal-tailed posterior credible interval has frequentist coverage at least its nominal level, even when the truth is on the boundary of the parameter space.

Setup

For 0<α<1, observe X1,…,Xn IID Bernoulli(θ) with parameter space Θ=[0,1] and prior density π(θ)=1 on [0,1]. For every data vector, let Cn be the equal-tailed posterior interval between the α/2 and 1−α/2 posterior quantiles. The truth θ0=0 lies on the boundary. Under this truth all observations are zero with probability one. The posterior density is then (n+1)(1−θ)n, with CDF Fn(t)=1−(1−t)n+1 on [0,1]. Its lower endpoint is qα/2=1−(1−α/2)1/(n+1)>0, so the interval excludes θ0 for every n.

Facts & Assumptions

Given: The Bernoulli model, uniform prior, and equal-tailed posterior interval in the Counterexample.

[F1]

Posterior credible set: a graph-measurable set rule is level-1−α credible when its posterior probability is at least 1−α for each data value.

[F2]

Bayes formula for dominated kernels: a dominated prior and sampling model give posterior density proportional to prior density times likelihood when the marginal likelihood is positive and finite.

[L1]

At a fixed parameter θ, the frequentist coverage of a set rule C is Pθ{θ∈C(Y)}.

[A1]

In the usual topology on [0,1], θ0=0 is a boundary point and is not an interior point.

Refutation

1.1F1F2givenalgebra

For data with k successes, the likelihood is θk(1−θ)n−k. It is bounded by 1 and positive for 0<θ<1, so its integral against the uniform prior is finite and strictly positive. [F2] therefore gives the posterior density proportional to that likelihood. The sample space is finite for fixed n, so the interval rule's membership graph is a finite union of measurable slices. The posterior density is positive on (0,1), making its CDF continuous and strictly increasing there; the posterior probability between its two quantiles is (1−α/2)−α/2=1−α. Thus the rule is credible by [F1].

1.2givenalgebra

At θ0=0, the data are all zero with probability one, so the likelihood is (1−θ)n. Its normalizing integral is ∫01(1−θ)ndθ=1/(n+1), giving posterior density (n+1)(1−θ)n and CDF Fn(t)=1−(1−t)n+1. Solving Fn(qu)=u yields qu=1−(1−u)1/(n+1). In particular qα/2>0, so 0∉Cn for every n.

2.1A1L1step 1.2algebra∎

Because the truth is zero and all data are zero almost surely, [L1] gives frequentist coverage P0{0∈Cn(X1,…,Xn)}=0. This contradicts the asserted lower bound 1−α>0 and exhibits failure at the boundary identified in [A1].

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

Uniform truth under type-S and type-H density priors

Example

The uniform truth f0=1 meets the truth-side smoothness and positive-bound conditions for both a type-S log-density prior and a type-H dyadic histogram prior. The weight sequence wl=max⁡(1,llog⁡(l+1)) is admissible and also satisfies the extra summability needed for the CDF map. Thus the source-specific posterior BvM and credible-band conclusions of Type-S and Type-H density credible bands have asymptotically exact coverage apply to these choices.

Facts & Assumptions

Given: The type-S/type-H definitions of Type-S log-density and type-H histogram prior families and the admissible multiscale space of Little-o multiscale coefficient space M0(w).

[F1]

Type-S log-density and type-H histogram prior families: both families require a density bounded above and bounded away from zero; type S1 requires log⁡f0∈Cψα with α>1, type S2 uses α>1/2 and 0<r<α−1/4, while type H requires f0∈Cψα for 1/2<α≤1 and the displayed Dirichlet-parameter bounds.

[F2]

Little-o multiscale coefficient space M0(w): admissibility means wl/l→∞.

[F3]

Type-S and Type-H density credible bands have asymptotically exact coverage: the specified prior regimes, truth bounds and admissible summable weights imply posterior weak BvM and asymptotically exact multiscale and CDF credible-band coverage.

Verification

Given: The prior families and f0(x)=1 on [0,1].

1.1F1givenalgebra

Since log⁡f0=0 and f0=1, its wavelet coefficient smoothness norm is finite at every order and it is bounded above and away from zero. For type S1 choose α=2 and the Laplace density φH(x)=12e−∣x∣, whose logarithm is Lipschitz; its scales are 2−l(2+1/2). For type S2 choose α=2 and r=1, which satisfies 0<1<2−1/4.

1.2F1givenalgebra

For type H choose truth smoothness α=1, hyperparameters a=c1=c2=1, and ak,L=1 for every cell. Then 2−L≤ak,L≤1, and the uniform truth belongs to Cψ1.

2.1F2F3step 1.1step 1.2givenalgebra∎

The sequence wl=max⁡(1,llog⁡(l+1)) is nondecreasing, since both entries in the maximum are nondecreasing for l≥1. It satisfies wl/l→∞. Also ∑lwl2−l/2<∞ because the ratio of successive terms llog⁡(l+1)2−l/2 tends to 2−1/2<1. Thus it is admissible and meets the CDF primitive summability condition. Steps 1.1–1.2 verify every regime and truth premise of [F3], so its posterior BvM and credible-band conclusions apply to these examples.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A quadratic remainder at L2 radius n^(-1/4)

Example

Let Ψ(f)=∥f∥22 at f0=1. The derivative is nonzero, but the quadratic remainder is not negligible at perturbations of size n−1/4: for any unit vector v∈L2 and integers n≥1, hn=n−1/4v has n-scaled remainder equal to 1. This sequence does not satisfy the stronger radius premise in Nonlinear-functional BvM limit under fast L2 contraction.

Facts & Assumptions

Given: Ψ(f)=⟨f,f⟩L2, f0=1, and ∥v∥2=1.

[F1]

Nonlinear-functional BvM limit under fast L2 contraction: its Taylor remainder must be uniformly quadratic near f0, and its posterior L2 radius must be o(n−1/2) for the stated BvM conclusion.

Verification

Given: The functional and unit vector in the Example.

1.1givenalgebra

Expanding the inner product gives Ψ(f0+h)=∥f0∥22+2⟨f0,h⟩L2+∥h∥22. Thus the derivative is DΨf0[h]=2⟨1,h⟩L2, which is nonzero, and the remainder equals ∥h∥22.

2.1F1givenstep 1.1algebra∎

For integers n≥1 and hn=n−1/4v, ∥hn∥2=n−1/4 and n∥hn∥22=1. Hence the scaled quadratic remainder does not tend to zero along this sequence, so the linear approximation needed in [F1] is not justified at this radius.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

The integral functional under a product-prior white-noise BvM

Example

Take a sufficiently regular Cohen–Daubechies–Vial wavelet basis as in Weak nonparametric Bernstein–von Mises theorem for product priors, with constants contained in a finite coarsest scaling space and all finer wavelets orthogonal to constants. Let f0=0, use independent standard-normal product coefficients, and choose any prior scale exponent η>0 with σl=2−l(η+1/2). The functional L1(f)=∫01f(x)dx has asymptotically standard-normal posterior fluctuations centered at L1(X(n)), and its equal-tailed posterior interval has asymptotic frequentist coverage 1−α.

Facts & Assumptions

Given: The white-noise model, f0=0, the selected regular CDV basis, independent standard-normal prior coefficients scaled by 2−l(η+1/2), and the supplied posterior kernel in Weak nonparametric Bernstein–von Mises theorem for product priors.

[F1]

Smooth linear functionals on the white-noise topology: L1(f)=⟨f,1⟩L2=∫01f.

[F2]

Linear-functional BvM limit and credible-interval calibration: any nonzero g∈H2s, s>1/2, yields a scalar N(0,∥g∥22) posterior BvM limit and asymptotic 1−α coverage for the equal-tailed interval under the product-prior theorem's hypotheses.

[F3]

Weak nonparametric Bernstein–von Mises theorem for product priors: the prior uses scales 2−l(α+1/2) and requires a bounded density positive near the normalized true coefficients, finite coefficient second moment, the coefficient bound, continuity at those coefficients, and countable choice for the L2 prior construction.

[F4]

The Axiom of Countable Choice (ACω): countable choice supplies a choice function for a countable family of nonempty sets; here it is the axiom explicitly assumed for the product-prior construction.

[A1]

For the selected CDV basis, constants lie in the finite coarse scaling space and every wavelet above its finite base level is orthogonal to constants.

Verification

Given: The hypotheses in the Example and Facts & Assumptions, with countable choice for the L2 prior construction.

1.1F3givenalgebra

The standard-normal coefficient density is bounded, continuous, strictly positive at every real value, and has finite second moment. Since f0=0, every normalized true coefficient is zero; choose any 0<M<τ with τ>0. The coefficient bound and continuity at each normalized true coefficient required by [F3] hold, and the scale sequence has the theorem's required form with α=η>0.

1.2A1F1givenalgebra

By [A1], all wavelet coefficients of g=1 above a fixed finite level vanish; the remaining levels have finitely many coefficients. Therefore ∑l,kal2s∣glk∣2<∞ for every finite s, in particular for some s>1/2. Also ∥g∥2=1 and its pairing is L1(f)=∫01f.

2.1F2F3F4givenalgebra∎

Under f0=0 and countable choice [F4], nL1(X(n))=L1(W) is exactly N(0,1). Applying [F2] with g=1 gives the scalar posterior BvM limit N(0,1) and limiting coverage 1−α.

Sources