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.

✓ 10 results · all verified · 10 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 10 also cleared it.

Weak nonparametric Bernstein–von Mises limits

1 · Prerequisites

2 · Summary

This page proves the product-prior weak Bernstein–von Mises limit in the Gaussian white-noise model. Countable choice supplies the L2 completeness used for the prior and suffices for the scalar density-normal interface; the posterior kernel is a supplied model object, and the projection/tail proof uses no further choice axiom. White noise is the Borel Gaussian limit on the logarithmically weighted negative Sobolev space H(δ), δ>1/2; it is not an L2-valued law. The theorem assumes a regular wavelet basis, σl=2−l(α+1/2) with α>0, bounded normalized truth coefficients strictly inside the prior density's positive region, a bounded density with finite second moment, and continuity at each normalized true coefficient. Its local proof supplies the posterior second-moment estimate and finite-coordinate Gaussian limit, then controls the infinite-dimensional tail. The theorem concludes convergence in bounded-Lipschitz metric, not total variation. Under full AC, Prokhorov's theorem identifies that metric with the weak topology and the continuous-mapping corollary applies; these stronger choice-dependent consequences are separate from the core estimate.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Logarithmic negative Sobolev spaces for white noise

Definition

Let (ψlk) be a countable complete orthonormal basis of the real Hilbert space L2([0,1]) (Orthonormal families, complete orthonormal systems and Hilbert bases, Hilbert space, The space Lp(μ) as the quotient by null functions). For a wavelet basis, index levels by l≥0, let Kl have 2l indices, and put al=2l for l≥1 and a0=2 for the finite coarsest level. This finite-level convention only prevents a zero logarithmic weight and does not change any convergence criterion below. For a trigonometric basis, use its integer frequency index l, bounded multiplicities, and al=max⁡(2,∣l∣).

Here an S-regular wavelet basis means a wavelet orthonormal basis whose members are S times differentiable, with each derivative through order S in L2([0,1]), following the source convention. The weak BvM theorem below only uses the basis's completeness, orthonormality, and level counts.

For δ>0, define H(δ)=H2−1/2,δ to be the space of coefficient sequences c=(clk) with norm

∥c∥H(δ)2:=∑l,kal−1(log⁡al)−2δ∣clk∣2<∞.

Its inner product is the corresponding weighted coefficient inner product. Multiplying each coordinate by al−1/2(log⁡al)−δ identifies it isometrically with ℓ2(I), where I={(l,k):k∈Kl} (or the corresponding trigonometric index set). This sequence space is complete: if x(m) is Cauchy, each coordinate converges to a scalar xi; for every finite F⊂I, the Cauchy bound passes to the limit in ∑i∈F∣xi(m)−xi(n)∣2, so the supremum over finite F shows x(m)→x in ℓ2(I). It is separable because finite-support sequences with rational coordinates form a countable dense set. Thus H(δ) is a separable Hilbert space without an additional choice assumption.

A function f∈L2([0,1]) is identified with its coefficient sequence clk=⟨f,ψlk⟩. For each finite set F of indices, orthonormality makes ∑(l,k)∈Fclkψlk orthogonal to its residual in L2, so the Pythagorean identity gives ∑F∣clk∣2≤∥f∥22. Taking the supremum over finite F and using the boundedness of the weights proves continuity of the coefficient map. If all coefficients of f vanish, then f is orthogonal to the linear span of the basis. Completeness makes this span dense, and continuity of g↦⟨f,g⟩ gives ⟨f,f⟩=0, hence f=0 in L2. Applying this to the difference of two functions proves injectivity. Thus the coefficient map is a continuous linear embedding L2([0,1])↪H(δ).

The weight trace ∑l,kal−1(log⁡al)−2δ is finite exactly when δ>1/2: for wavelets its tail is a constant multiple of ∑l≥1l−2δ, while for a trigonometric basis it is comparable to ∑l≥2[l(log⁡l)2δ]−1. The product-prior theorem below uses the wavelet case.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The wavelet product prior is L2-valued

Statement

Let H be a real Hilbert space with a countable orthonormal basis (ψlk), where Kl is the level-l index set and ∣Kl∣=2l for each l≥0 (Hilbert space, Orthonormal families, complete orthonormal systems and Hilbert bases). Such an H is separable because finite rational linear combinations of the countable basis are dense. Let ξlk be IID real random variables with common density φ and finite second moment m2=∫x2φ(x) dx<∞ (Identical distribution and IID families). For α>0, set σl=2−l(α+1/2) and form the partial wavelet sums

fN=∑0≤l≤N∑k∈Klσlξlkψlk.

Assume countable choice, denoted ACω, when specializing to H=L2([0,1]). Then fN converges almost surely in H to a Borel H-valued random element f, and

E∥f∥H2=m2∑l≥02lσl2=m2∑l≥02−2αl<∞.

The abstract Hilbert-space assertion is choice-free; for H=L2([0,1]), completeness follows from the Riesz–Fischer theorem under countable choice (The Axiom of Countable Choice (ACω), The space Lp(μ) as the quotient by null functions, Riesz-Fischer completeness of Lp for 1≤p≤∞). More generally, finitely many additional coarsest orthogonal coordinates with fixed scales and finite coefficient second moments may be added; they contribute only a finite expectation to the displayed sum.

Facts & Assumptions

Given: The orthonormal wavelet basis, α>0, and an IID coefficient family with density φ and finite second moment m2; countable choice is additionally assumed only for the L2 specialization.

[F1]

Hilbert space: A real Hilbert space is complete in the norm induced by its inner product.

[F2]

Orthonormal families, complete orthonormal systems and Hilbert bases: Vectors in an orthonormal family are pairwise orthogonal and have norm one.

[F3]

Identical distribution and IID families: IID means mutual independence together with equality of all coordinate laws; it imposes no moment hypothesis.

[F4]

Monotone convergence for the integral: For nonnegative measurable functions increasing pointwise to S, their integrals increase to ∫S.

[F5]

Riesz-Fischer completeness of Lp for 1≤p≤∞: Under countable choice, L2([0,1]) with its usual norm is complete.

[A1]

The Axiom of Countable Choice (ACω): Countable choice is assumed only to apply [F5] in the L2 instance; the abstract complete-Hilbert-space argument makes no choice-axiom appeal.

Proof

1.1F2F3F4givenalgebra

For each finite N, orthonormality [F2] gives ∥fN∥H2=∑0≤l≤N∑k∈Klσl2ξlk2. The nonnegative partial sums increase to the full coefficient-square sum, so [F4] gives its expectation as the limit of the finite expectations, ∑l≥0∑k∈Klσl2Eξlk2=m2∑l≥02l2−2l(α+1/2)=m2∑l≥02−2αl<∞, since the final series is geometric with ratio 2−2α<1. If the coefficient-square sum were infinite on an event of probability p>0, its expectation would be at least Rp for every R>0, contradicting finiteness. Thus that sum is finite almost surely.

2.1A1F1F2F5givenalgebrastep 1.1

On the probability-one event where that sum is finite, for M>N orthonormality gives ∥fM−fN∥H2=∑N<l≤M∑k∈Klσl2ξlk2. The right side tends to zero uniformly over M>N as N→∞, since it is a tail of a convergent nonnegative series. Thus (fN) is Cauchy in H and has a limit f by completeness [F1]. When H=L2([0,1]), completeness is supplied by [F5] under [A1]. The Cauchy event is measurable because it is a countable combination of conditions on the measurable distances ∥fM−fN∥H. On that event the pointwise limit is measurable as a limit into the separable metric space H; setting the limit equal to zero on the measurable complement gives a Borel H-valued random element.

3.1F3F4step 2.1∎

The same monotone-convergence calculation in [F4] gives E∥f∥H2=E∑l≥0∑k∈Klσl2ξlk2=m2∑l≥02−2αl<∞. This proves both the stated second-moment formula and the claimed well-definedness.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The bounded-Lipschitz metric characterizes weak convergence on Polish spaces

Statement

Assume the Axiom of Choice. Let (S,d) be a Polish space, and let μn,μ be Borel probability measures on S. Define

βBL(ν,ρ):=sup⁡{∣∫g dν−∫g dρ∣:g:S→R, ∥g∥∞≤1, Lip⁡d(g)≤1},

where Lip⁡d(g):=sup⁡x≠y∣g(x)−g(y)∣/d(x,y), with value 0 when S has at most one point. Then

μn⇒μ⟺βBL(μn,μ)⟶0,

where ⇒ is weak convergence of Borel probabilities (Weak convergence of borel probability measures). The implication from bounded-Lipschitz convergence to weak convergence is choice-free; the reverse implication below uses AC through Prokhorov's theorem.

Facts & Assumptions

[F1]

Weak convergence of borel probability measures: μn⇒μ means convergence of integrals for every bounded continuous real test function.

[F2]

Portmanteau theorem: Weak convergence of Borel probabilities on a metric space is equivalent to the closed-set bound lim sup⁡nμn(F)≤μ(F) for every closed F.

[F3]

Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space is tight if and only if it is relatively sequentially compact for weak convergence.

[F4]

Dominated convergence: If measurable functions converge pointwise almost everywhere and are dominated by one integrable function, their integrals converge.

[F5]

Polish spaces are separable completely metrizable spaces: A Polish space is separable and completely metrizable.

[F6]

Finite measures agreeing on a generating pi-system and on the whole space are equal: finite measures agreeing on a generating pi-system and on the whole space agree on its generated sigma-algebra.

[A1]

The Axiom of Choice: AC is used only for the Prokhorov implication from relative sequential compactness to tightness in step 2.2; step 1.2 proves the reverse metric implication without AC.

Given: The objects in the statement and AC for step 2.2.

Proof

1.1givenF4F6algebra

Nonnegativity, symmetry and the triangle inequality for βBL follow by applying these properties to the difference of the two test integrals and then taking the supremum. If βBL(ν,ρ)=0, fix a nonempty closed F and put gm=(1−md(⋅,F))+. The function gm/m is an admissible test, so ∫gm dν=∫gm dρ. By [F4], these integrals decrease to ν(F) and ρ(F), respectively. The two probabilities therefore agree on every closed set, including the empty set. Closed sets form a pi-system generating the Borel sigma-algebra, and both total masses are one, so [F6] gives ν=ρ. Thus βBL is a metric; this argument uses no choice.

1.2givenF1

Assume βBL(μn,μ)→0, and fix a nonempty closed set F⊆S. For every integer m≥1, the function gm(x)=(1−md(x,F))+ satisfies 0≤gm≤1 and Lip⁡d(gm)≤m. Hence gm/m is admissible in the definition of βBL, so ∫gm dμn→∫gm dμ. Since 1F≤gm, it follows that lim sup⁡nμn(F)≤∫gm dμ for every m.

1.3givenF1choose

Now assume μn⇒μ, and put A={μ}∪{μn:n≥1}. Any sequence chosen from A either has a member repeated infinitely often, yielding a constant convergent subsequence, or has a subsequence of the form (μnj) with nj→∞, which converges weakly to μ. Therefore A is relatively sequentially compact for weak convergence.

2.1F1F2F4step 1.2

The functions gm decrease pointwise to 1F and are bounded by the integrable constant function 1 under the probability μ. By [F4], ∫gm dμ→μ(F), so the closed-set bound holds; it is trivial for F=∅. The Portmanteau theorem [F2] gives weak convergence in the sense of [F1].

2.2A1F3F5step 1.3

By [F5], S is Polish; therefore [F3] applies under [A1] and A is tight. Thus for every ε>0 there is a compact K⊆S such that sup⁡ν∈Aν(Kc)<ε.

3.1givenconstructchoosestep 2.2

Fix η>0. Compactness gives a finite η/8-net x1,…,xq of K. Quantize each value g(xi)∈[−1,1] into finitely many bins of width at most η/2. There are finitely many resulting value patterns for the bounded 1-Lipschitz test class; choose one representative hr from each nonempty pattern. If g and hr share a pattern, then for x∈K a net point xi gives ∣g(x)−hr(x)∣≤2d(x,xi)+∣g(xi)−hr(xi)∣<η.

4.1F1step 2.2step 3.1∎

For any admissible g, choose the representative hr from its pattern. The integral difference is bounded by ∣∫g dμn−∫g dμ∣≤max⁡r∣∫hr dμn−∫hr dμ∣+2η+2μn(Kc)+2μ(Kc). The maximum tends to zero by [F1], because there are finitely many bounded continuous representatives, and the last two terms are at most 4ε by step 2.2. Taking the supremum over g, then the limit superior in n, gives lim sup⁡nβBL(μn,μ)≤2η+4ε. Letting η,ε↓0 proves the reverse implication.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The product-prior posterior factors by coordinates

Statement

Assume countable choice for the L2-valued prior construction. Let the wavelet product prior have independent coefficients θlk=σlξlk, where the ξlk are IID with density φ. Observe the independent Gaussian sequence

Xlk=θ0,lk+n−1/2Zlk,

where the Zlk have the standard normal density and are independent of the prior. Assume a data-indexed posterior kernel for the L2-valued prior is supplied as part of this model. In the product white-noise model, for every finite set J of coefficient indices its conditional law of (θj)j∈J given the full data sequence (Xj) is the product of the one-coordinate densities

pj,n(t∣Xj)=e−n(t−Xj)2/2 σj−1φ(t/σj)∫Re−n(s−Xj)2/2 σj−1φ(s/σj) ds,j∈J.

Here j abbreviates a pair (l,k) and σj=σl. For J=∅, the formula denotes the unit law on the zero-dimensional one-point space. Each denominator is strictly positive and finite: the Gaussian factor is everywhere positive and at most 1, while the prior density integrates to 1.

Facts & Assumptions

[F1]

Identical distribution and IID families: The prior coefficients are mutually independent and have a common law; scaling by the fixed positive σl preserves coordinate independence.

[F2]

Independent random elements are characterized by finite rectangle probabilities: Independence of random elements is equivalent to factorization of probabilities on all finite measurable rectangles.

[F3]

Dynkin's pi-lambda theorem: If a lambda-system contains a generating pi-system, it contains the generated sigma-algebra.

[L1]

The wavelet product prior is L2-valued: The wavelet prior coefficients define an L2-valued random element under the stated scale and finite-second-moment conditions.

[A1]

The Axiom of Countable Choice (ACω): Countable choice is used only for the L2-valued prior construction supplied by [L1]; the finite-coordinate factorization argument itself uses no choice axiom.

[A2]

The full data-indexed posterior kernel on L2 is supplied as part of the model. We use the version whose finite-coordinate marginals are the displayed densities; the proof verifies their conditional-law identities under the prior-predictive model. This item does not claim a general full-kernel existence theorem.

Given: Countable choice, the product prior, the independent Gaussian coordinate experiment, and the supplied posterior kernel [A2]. The coordinate marginal formula is verified below.

Proof

1.1F1F2F3

For each coordinate j, the pair (θj,Xj) is a measurable function of the independent pair (ξj,Zj). Thus the coordinate pairs are independent: finite rectangle probabilities factor by [F1] and [F2]. Fix finite J. For any cylinder event B depending on finitely many observations outside J, the random vector (θJ,XJ) is independent of B by that same factorization. The events in σ(XJc) for which this independence identity holds form a lambda-system containing the outside-coordinate cylinder pi-system; [F3] extends it to all outside-data events. Hence conditioning on XJc adds no information about θJ once XJ is known.

2.1A1A2F1F2step 1.1L1algebra

For finite J, the joint prior density of θJ is the product of σj−1φ(tj/σj), and the likelihood of XJ=xJ is proportional to ∏j∈Je−n(xj−tj)2/2. Each one-dimensional normalizer is at most 1 and is positive: the Gaussian factor is bounded by 1, is strictly positive everywhere, and the prior density integrates to 1. Thus the normalized product density is ∏j∈Jpj,n(tj∣xj). Integrating it over rectangles in θJ and XJ verifies the conditional-law identity for these coordinates. The prior is a Borel probability on L2 by [L1] under [A1], and [A2] supplies the full posterior kernel; step 1.1 extends the finite-coordinate identity to the full observation sequence.

3.1step 2.1∎

The product of the one-coordinate conditional densities in step 2.1 is exactly the stated finite-dimensional posterior marginal, so the posterior factors by coordinates for every finite index set J.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A negative-Sobolev posterior second-moment bound

Statement

Use the wavelet product-prior white-noise model of The wavelet product prior is L2-valued and The product-prior posterior factors by coordinates, with σl=2−l(α+1/2), α>0, and 2l coefficients at level l≥0. Let θ0,lk be the coefficients of a fixed f0∈L2([0,1]). Assume countable choice for the L2 prior construction, with the full posterior kernel supplied by The product-prior posterior factors by coordinates, and suppose

sup⁡l,k∣θ0,lkσl∣≤M<τ,

where the common prior density φ satisfies φ(u)≤Cφ for all u, φ(u)≥cφ>0 for ∣u∣<τ, and m2:=∫u2φ(u) du<∞. For every δ>1/2 there is a constant Cδ<∞, independent of n, such that

Ef0(n)∫∥f−f0∥H(δ)2 Πn(df∣X(n))≤Cδn.

No continuity assumption on φ is needed for this moment estimate.

Facts & Assumptions

[F1]

Logarithmic negative Sobolev spaces for white noise: ∥u∥H(δ)2=∑l,kwlδ∣ulk∣2, where wlδ=al−1(log⁡al)−2δ and ∑l,kwlδ<∞ for δ>1/2.

[F2]

The product-prior posterior factors by coordinates: Given the data coordinate Xlk, the posterior density of θlk is proportional to e−n(θ−Xlk)2/2σl−1φ(θ/σl); finite coordinate marginals factor.

[F3]

Monotone convergence for the integral: Expectations of nonnegative partial sums increasing pointwise to a limit increase to the expectation of that limit.

[F4]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: For the nonnegative Gaussian-integral integrand, expectation and Lebesgue integration may be interchanged on the sigma-finite product of the normal probability space and R.

[A1]

The true normalized coordinates rlk=θ0,lk/σl satisfy ∣rlk∣≤M<τ, and φ has the boundedness, local positivity, and second-moment properties in the statement.

[A2]

The Axiom of Countable Choice (ACω): Countable choice is used for the L2 prior construction. The full posterior kernel is supplied as model input in [F2]; the coordinate moment estimates below require no further choice.

Given: Countable choice, the white-noise observations Xlk=θ0,lk+n−1/2Zlk with independent standard normal coordinates, the prior, and its coordinate posterior law. The expected posterior loss bound in the Statement is to be proved.

Proof

1.1A1A2F2givenalgebra

Fix (l,k) and abbreviate σ=σl, θ0=θ0,lk, r=θ0/σ, and λ=n σ. Under the true law write X=θ0+n−1/2Z, where Z has density (2π)−1/2e−z2/2. If Blk(X)=∫(θ−θ0)2 Πn(dθlk∣X), change variables v=n(θ−θ0) in [F2] to obtain nBlk(X)=Nλ(Z)Dλ(Z),Dλ(z)=1λ∫Re−v2/2+zvφ(r+v/λ) dv,Nλ(z)=1λ∫Rv2e−v2/2+zvφ(r+v/λ) dv. All integrands are nonnegative and the denominator is positive. The posterior kernel is the L2 model supplied by [F2] under [A2].

2.1A1givenstep 1.1F4algebra

Set h=(τ−M)/2>0. If λ≤S0 for a fixed S0>0, then ∣r+v/λ∣<τ whenever ∣v∣≤hλ. Substituting v=λt and pairing t with −t gives Dλ(z)≥cφ∫−hhe−λ2t2/2+zλt dt=2cφ∫0he−λ2t2/2cosh⁡(zλt) dt≥2hcφe−h2λ2/2≥d0:=2hcφe−h2S02/2>0, because cosh⁡(x)≥1 and e−λ2t2/2≥e−h2λ2/2 on [0,h]. Completing the square in the standard normal density gives EeZv=ev2/2; hence, by the substitution u=r+v/λ, ENλ(Z)=1λ∫v2φ(r+v/λ) dv=λ2∫(u−r)2φ(u) du≤2λ2(m2+M2). Here [F4] justifies the exchange of expectation and the nonnegative v-integral. Therefore EBlk(X)≤Cλ2/n=Cσl2≤CS02/n in this range.

2.2A1givenstep 1.1algebra

If λ≥S0, let R=hS0. For ∣v∣≤R one has ∣r+v/λ∣<τ, so Dλ(z)≥cφez2/2λIR(z),Nλ(z)≤Cφez2/2λJ(z), where IR(z)=∫−RRe−(v−z)2/2 dv and J(z)=∫Rv2e−(v−z)2/2 dv=2π(1+z2). Thus nBlk(X)≤(Cφ/cφ)J(Z)/IR(Z). For ∣z∣≤R, integrate IR over the half-interval nearest z; for ∣z∣>R, integrate over the half-interval adjacent to the nearer endpoint. These choices give the common lower bound IR(z)≥R2exp⁡(−R22−(∣z∣−R/2)+22). Consequently E[J(Z)/IR(Z)] is finite: after multiplying by the standard normal density, its integrand is bounded on ∣z∣≤R/2 and is at most a constant times (1+z2)e−R∣z∣/2 on ∣z∣>R/2. Hence EBlk(X)≤C/n also when λ≥S0, with C independent of (l,k,n).

3.1step 2.1step 2.2

The two ranges in steps 2.1 and 2.2 cover every λ>0; since σl2≤S02/n in the first range, there is a single constant C for which sup⁡l,kEf0(n)Blk(X)≤C/n.

4.1A1F1F3step 3.1∎

By [F1], the posterior squared loss is the nonnegative series ∑l,kwlδBlk(X). Apply monotone convergence [F3] to its finite partial sums and use step 3.1 to obtain Ef0(n)∫∥f−f0∥H(δ)2 Πn(df∣X)=∑l,kwlδEf0(n)Blk(X)≤Cn∑l,kwlδ. The trace on the right is finite for δ>1/2 by [F1], proving the bound.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite-coordinate posterior total-variation limit

Statement

Assume countable choice for the L2 prior construction, with the full posterior kernel supplied as in The product-prior posterior factors by coordinates. Fix a finite set J of wavelet coordinates in the product white-noise model of The product-prior posterior factors by coordinates. Suppose φ is bounded and continuous at each normalized truth coefficient rj=θ0,j/σj, with φ(rj)>0. Let Π~n,J be the conditional posterior law of n(θJ−XJ) given the full data. If J=∅, both laws are the unique probability on the zero-dimensional one-point space. For nonempty J, the posterior and Gaussian densities pn,J and ϕJ on R∣J∣ satisfy

∫R∣J∣∣pn,J(u∣X)−ϕJ(u)∣ du⟶0

in probability under the true white-noise law. Consequently dTV(Π~n,J,N∣J∣(0,I))→0, where dTV(μ,ν):=sup⁡A∣μ(A)−ν(A)∣ and N∣J∣(0,I) is the product of ∣J∣ standard normal laws.

Facts & Assumptions

[F1]

The product-prior posterior factors by coordinates: The posterior marginal on every finite coordinate set is the product of the coordinate Bayes densities.

[F2]

Dominated convergence: Pointwise convergence under an integrable dominating function gives convergence of the integrals.

[F3]

Finite and countable subadditivity of measures: The probability of a countable union of events is at most the sum of their probabilities.

[A1]

The Axiom of Countable Choice (ACω): Countable choice is used for the L2 prior construction; the full posterior kernel is supplied as model input in [F1], and the finite-dimensional density limit is choice-free.

Given: Countable choice, a fixed finite coordinate set J, the coordinate prior densities and white-noise observations, boundedness of φ, and its continuity and strict positivity at each rj.

Proof

1.1A1F1F2givenalgebra

Fix one coordinate j=(l,k) and write r=θ0,j/σj. Under the true law, Xj/σj=r+Zj/(nσj)→r in probability, and bn=(nσj)−1→0. By [F1], under [A1], the posterior density of Un=n(θj−Xj) is pn(u∣Xj)=e−u2/2φ(Xj/σj+bnu)cn(Xj),cn(Xj)=∫Re−v2/2φ(Xj/σj+bnv) dv. For any deterministic sequence xn/σj→r, boundedness of φ and [F2] give cn(xn)→φ(r)2π>0.

2.1F2F3step 1.1choosealgebra

Along such a deterministic sequence, pn(u∣xn)→(2π)−1/2e−u2/2 pointwise and is eventually bounded by a constant multiple of e−u2/2. A second application of [F2] gives convergence in L1(du), hence convergence in total variation. Since Xj/σj→r in probability, if the total-variation convergence in probability failed, some subsequence would have error probability bounded below. Select a further subsequence for which P(∣Xj/σj−r∣>2−q)≤2−q at its qth term; [F3] bounds each union of tail events by the corresponding geometric tail, which tends to zero, so the further subsequence converges almost surely to r, contradicting the deterministic conclusion.

3.1F1step 2.1algebra∎

For finite nonempty J, [F1] makes the scaled posterior and its Gaussian target product measures. Telescope the difference of their product densities one coordinate at a time. Integrating the absolute value of each term gives the L1 distance of that coordinate pair, since every other coordinate density integrates to 1. Thus the joint L1 distance is at most the sum of the finitely many coordinate L1 distances, which tends to zero in probability by step 2.1. For each measurable event A, the absolute difference of its probabilities is at most this L1 distance, so the total-variation conclusion follows.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Density normal laws and square-summable Gaussian series under countable choice

Statement

Assume countable choice. Put g(x)=(2π)−1/2e−x2/2. Then γ(E)=∫Eg(x) dx is a Borel probability on R. In this item and its applications, write N(m,v) for its pushforward under x↦m+v x, where v≥0; thus N(m,0)=δm. This density convention requires no full axiom of choice. For v>0 the law has density gm,v(x)=(2πv)−1/2exp⁡{−(x−m)2/(2v)}, and its CDF is continuous and strictly increasing. Its mean and variance are m and v.

If Zj are mutually independent with density g and ∑j≥1cj2=v<∞, and the finite sums Sm=∑j≤mcjZj converge in probability to a supplied real random variable S, then S has law N(0,v). In particular, this applies whenever the sums converge almost surely or in L2.

Facts & Assumptions

Given: Countable choice, the displayed density, and, for the series assertion, the independent coordinates, real coefficients and supplied probability limit S.

[F2]

The indefinite integral of a nonnegative measurable function is a measure constructs a measure from a nonnegative measurable density; Integrating against a density agrees with integrating the product integrates nonnegative tests against it. Monotone convergence for the integral passes to increasing truncations.

[F4]

Independent random elements have product joint law identifies independent pairs with the product of their laws. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product computes nonnegative integrals by iterated integration.

[F5]

Dynkin's pi-lambda theorem implies that Borel probabilities agreeing on all half-lines (−∞,x] agree: those half-lines, together with R, form a generating pi-system.

Proof

1.1F1F2F5givenalgebra

The positive continuous function g is Borel measurable, since inverse images of open sets are open. For an integer R≥1, substitute x=2 t in the continuous compact-interval integral. The bridge in [F1] and then increasing truncation in [F2] give ∫Re−x2/2 dx=2lim⁡R→∞∫−R/2R/2e−t2 dt=2π. Thus [F2] makes γ a probability. For v>0, compact substitutions in the same way show that its affine pushforward has the asserted half-line integrals of gm,v; limits of compact intervals give the half-lines, and [F5] gives equality of the measures. For v=0 the affine map is constant, giving the Dirac law directly.

2.1F1F2F3step 1.1algebra

The CDF of N(m,v) for v>0 is continuous, since gm,v is bounded and the integral over an interval of length h is at most ∣h∣/2πv. It is strictly increasing because the positive continuous density has a positive minimum on every nondegenerate compact interval. For Z with density g, g′(x)=−xg(x), and integration by parts gives ∫−RR∣x∣g(x)dx=2(g(0)−g(R)) and ∫−RRx2g(x)dx=∫−RRg(x)dx−2Rg(R). The exponential series shows g(R)→0 and Rg(R)→0. Increasing truncation gives E∣Z∣<∞ and EZ2=1; symmetry gives EZ=0. Expanding m+vZ gives the claimed mean and variance, also for v=0.

3.1F1F4F5step 1.1step 2.1algebra

Let U,V be independent centered density normal variables with variances a,b>0. Their sum has density h(x)=∫Rg0,a(u)g0,b(x−u)du. Indeed, [F4] expresses P(U+V≤x) as the nonnegative double integral of 1u+t≤xg0,a(u)g0,b(t); for each fixed u, a translation in the continuous half-line integral followed by Tonelli gives ∫−∞xh(y)dy. These half-line probabilities determine the law by [F5]. Completing the square gives u2a+(x−u)2b=a+bab(u−axa+b)2+x2a+b. The compact substitutions and increasing limits in step 1.1 therefore give h(x)=g0,a+b(x). If either variance is zero the corresponding variable is zero almost surely and the same conclusion is immediate. Scaling a coordinate by a negative coefficient gives the same density as scaling by its absolute value, by the symmetry of g. Finite induction, using mutual independence to separate the last coordinate from the preceding tuple, proves Sm∼N(0,vm) with vm=∑j≤mcj2.

4.1F3F5step 2.1step 3.1givenalgebra∎

If v=0, every coefficient is zero, so convergence in probability implies S=0 almost surely. Suppose v>0. Then vm→v and eventually vm>0. Write Φ for the continuous CDF of γ. For any x∈R and ε>0, convergence in probability and step 3.1 give Φ((x−ε)/vm)−P(∣Sm−S∣>ε)≤P(S≤x)≤Φ((x+ε)/vm)+P(∣Sm−S∣>ε). First let m→∞, then ε↓0. Continuity from step 2.1 gives P(S≤x)=Φ(x/v) for every x. By [F5], S has law N(0,v). Almost sure convergence implies convergence in probability by dominated convergence on the indicators of {∣Sm−S∣>ε}, and L2 convergence implies it by ε2P(∣Sm−S∣>ε)≤E∣Sm−S∣2.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

White noise is a Borel Gaussian law on the negative Sobolev space

Statement

Assume countable choice. Let (ψlk) be the wavelet or trigonometric basis from Logarithmic negative Sobolev spaces for white noise. Let Zlk be mutually independent real random variables with density g(x)=(2π)−1/2e−x2/2. Define the formal white-noise coefficient sequence W=(Zlk). For every δ>1/2, this sequence is almost surely an element of H(δ) and is a Borel Gaussian random element there. Its law N is a Borel probability on H(δ). For an infinite-dimensional basis, white noise is not an L2([0,1])-valued random element. Here Gaussian means that each continuous real linear functional has a centered law N(0,v) in the density convention of Density normal laws and square-summable Gaussian series under countable choice; in particular, for L(c)=∑jdjcj its variance is ∑jdj2 whenever this pairing is continuous on H(δ).

Facts & Assumptions

[F1]

Logarithmic negative Sobolev spaces for white noise: H(δ) has squared norm ∑l,kal−1(log⁡al)−2δ∣clk∣2, and its finite-level coordinate projections converge in that norm.

[F2]

Identical distribution and IID families: Independent identically distributed coordinates are mutually independent; here their common density is given explicitly in the statement.

[F3]

Monotone convergence for the integral: The expectation of an increasing sequence of nonnegative random variables increases to the expectation of its pointwise limit.

[F4]

Continuity from above when one set has finite measure: For decreasing events in a probability space, the probability of their intersection is the limit of their probabilities.

[F5]

Density normal laws and square-summable Gaussian series under countable choice: Under countable choice the density normal laws have mean and variance equal to their parameters, and a probability limit of finite independent centered normal sums has the normal law with limiting variance. Its proof uses density convolution and a CDF sandwich, without characteristic-function uniqueness or full choice.

Given: Countable choice, the countable basis and independent coordinates Zlk with the displayed standard normal density.

Proof

1.1F1algebra

Write wl=al−1(log⁡al)−2δ. In the wavelet case, the trace sum is a finite coarsest term plus ∑l≥12lwl=(log⁡2)−2δ∑l≥1l−2δ. On each block 2m≤l<2m+1, the sum of l−r is between 2m2−r(m+1) and 2m2−rm; hence these blocks form a convergent geometric series when r>1, while for r≤1 their contributions are bounded below by a fixed positive constant and the series diverges. For trigonometric coefficients with bounded multiplicities, the block 2m≤∣l∣<2m+1 contributes between constant multiples of m−2δ to ∑l≥2[l(log⁡l)2δ]−1. The same comparison therefore gives finiteness exactly when δ>1/2. Thus the trace Tδ:=∑l,kwl is finite in either case.

2.1F2F3F5step 1.1algebra

Let Sm be the sum of wlZlk2 over the first m coordinates in the fixed countable enumeration. These nonnegative partial sums increase to S=∑l,kwlZlk2, and [F3] gives ES=lim⁡mESm=∑l,kwl=Tδ. The mean and second moment of each coordinate are 0 and 1 by [F5]. If S=∞ on a set of probability p>0, then ES≥Rp for every R>0, impossible; hence S<∞ almost surely.

3.1F1step 2.1

On that probability-one event, the finite-coordinate sums of W are Cauchy in H(δ) because the squared norm of every tail is the corresponding tail of the convergent series S. Completeness gives a limit in H(δ). The Cauchy event is measurable, and the partial sums are measurable; their pointwise limit on that event is measurable as an H(δ)-valued map because the space is separable. Setting it to zero on the measurable complement gives a Borel random element.

4.1F1F2F5step 3.1algebra

Let ej be the unit vector of the weighted sequence Hilbert space supported on coordinate j and let bj=L(ej) for a continuous real linear functional L. For each finite set F, boundedness applied to ∑j∈Fbjej gives ∑j∈Fbj2≤∥L∥2, so ∑jbj2<∞. Since the weights wj are bounded, v:=∑jwjbj2<∞. The finite-coordinate projections of W converge almost surely in H(δ) by step 3.1, so continuity gives L(W)=lim⁡m∑j≤mwjbjZj almost surely. By [F5] this limit has exactly the density normal law N(0,v). Thus W is centered Gaussian. For a continuous coefficient pairing L(c)=∑jdjcj, one has bj=dj/wj, giving v=∑jdj2.

5.1F1F2F4givenalgebra∎

Enumerate the infinite basis as (ψj)j≥1, write its white-noise coordinates as Zj, and let Aj={∣Zj∣≥1}. The displayed normal density is positive on [1,2], so p:=P(Aj)>0; independence gives P(⋂j=mm+qAjc)=(1−p)q+1. By [F4], P(⋂j≥mAjc)=0 for each m, so the event that only finitely many Aj occur, a countable union of these intersections, has probability zero: disjointify that union by replacing its mth event Em with Em∖⋃i<mEi, and use countable additivity and monotonicity to sum zero probabilities. Therefore ∑j≤nZj2 is unbounded almost surely. If the same H(δ) element were represented by an L2 function, the coefficient embedding in [F1] would identify its L2 coefficients with Zj. The finite Pythagorean identity, applied to the projection onto ψ1,…,ψn, would then give ∑j≤nZj2≤∥W∥22 for every n, a contradiction.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The canonical white-noise law is tight under the Axiom of Choice

Statement

Assume AC. For δ>1/2, the canonical white-noise law N on the Polish space H(δ) from White noise is a Borel Gaussian law on the negative Sobolev space is tight.

Facts & Assumptions

[F1]

White noise is a Borel Gaussian law on the negative Sobolev space: The white-noise coefficient series defines a Borel probability law N on H(δ) for δ>1/2.

[F2]

Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space is tight if and only if it is relatively sequentially compact for weak convergence.

[F3]

Polish spaces are separable completely metrizable spaces: A Polish space is separable and completely metrizable.

[F4]

Logarithmic negative Sobolev spaces for white noise: H(δ) is separable and complete with its weighted coefficient norm.

[A1]

The Axiom of Choice: AC is used exactly in applying Prokhorov's theorem in step 2.1.

Given: AC, δ>1/2, and the Borel probability N on H(δ).

Proof

1.1F1F3F4given

By [F4], H(δ) is separable and complete; the definition of Polish space [F3] therefore makes it Polish.

2.1A1F2givenstep 1.1∎

Every sequence in the singleton family {N} is constant and therefore converges weakly to N; thus {N} is relatively sequentially compact. Applying [F2] under [A1] proves that {N}, and hence the law N, is tight.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Weak nonparametric Bernstein–von Mises theorem for product priors

Statement

Let (ψlk) be the S-regular wavelet basis in Logarithmic negative Sobolev spaces for white noise, with 2l coefficients at each level l≥0. For α>0, put σl=2−l(α+1/2) and let the prior on f=∑l,kσlξlkψlk have IID coefficients ξlk with density φ. Assume countable choice for the L2 prior construction supplied by The wavelet product prior is L2-valued, and take the full posterior kernel as the supplied model input of The product-prior posterior factors by coordinates. Let f0∈L2([0,1]), write θ0,lk=⟨f0,ψlk⟩ and rlk=θ0,lk/σl, and suppose

sup⁡l,k∣rlk∣≤M<τ,

where φ is a probability density satisfying φ(u)≤Cφ for every u, φ(u)≥cφ>0 for ∣u∣<τ, ∫u2φ(u) du<∞, and φ is continuous at each rlk. The observation model is

dX(n)(t)=f0(t) dt+n−1/2dW(t),0≤t≤1,

with standard white noise W; in the stated basis this is the sequence experiment Xlk=θ0,lk+n−1/2Zlk with independent standard normal coordinates. Let Πn(⋅∣X) be the product-coordinate posterior of The product-prior posterior factors by coordinates. Let N be the law of the canonical white noise in H(δ) and define

Π~n:=Πn(⋅∣X)∘[f↦n(f−X)]−1,βBL,H(δ)(μ,ν):=sup⁡∥g∥∞≤1Lip⁡H(δ)(g)≤1∣∫g dμ−∫g dν∣.

For every δ>1/2,

βBL,H(δ)(Π~n,N)⟶0

in probability under the true white-noise law Pf0(n). This is a bounded-Lipschitz weak BvM conclusion; it asserts neither total-variation convergence on all Borel subsets nor an L2-valued Gaussian limit.

Facts & Assumptions

[F1]

Logarithmic negative Sobolev spaces for white noise: H(δ) has norm ∥u∥H(δ)2=∑l,kwlδ∣ulk∣2, where wlδ=al−1(log⁡al)−2δ, and its trace sum is finite for δ>1/2.

[F2]

The wavelet product prior is L2-valued: The product prior series defines an L2-valued random element for α>0 and finite coefficient second moment.

[F3]

White noise is a Borel Gaussian law on the negative Sobolev space: The canonical white-noise coefficient sequence has Borel Gaussian law N on H(δ) for δ>1/2, is not L2-valued, and satisfies E∥W∥H(δ′)2=∑l,kwlδ′<∞ for every δ′>1/2.

[F4]

A negative-Sobolev posterior second-moment bound: For any δ′>1/2, n Ef0(n)∫∥f−f0∥H(δ′)2 Πn(df∣X) is bounded uniformly in n.

[F5]

Finite-coordinate posterior total-variation limit: For every fixed finite coordinate projection, the posterior and standard Gaussian densities of n(θJ−XJ) converge in L1 in probability.

[F6]

The product-prior posterior factors by coordinates: A supplied posterior kernel has product-coordinate marginals with densities proportional to e−n(θj−Xj)2/2σj−1φ(θj/σj).

[F7]

Cauchy-Schwarz for random variables: On any probability space, E∣UV∣≤(EU2)1/2(EV2)1/2 for square-integrable real random variables.

[F8]

Markov's inequality for random variables: For nonnegative Y and a>0, P(Y≥a)≤E[Y]/a.

[A1]

The Axiom of Countable Choice (ACω): Countable choice supplies the L2 prior construction and the density normal-law interface used by [F3]. The full posterior kernel is supplied as model input by [F6]; the posterior moment estimate, finite-coordinate convergence, and projection/tail inequalities introduce no further choice axiom.

Given: Countable choice, the basis, prior, truth, density conditions, white-noise experiment, and the supplied posterior kernel of [F6]. The stated bounded-Lipschitz convergence is proved below without using full AC.

Proof

1.1F1givenalgebra

Fix δ>1/2 and choose δ′ with 1/2<δ′<δ. Let PJ retain all wavelet coordinates with level l≤J. Since wlδ/wlδ′=(log⁡al)−2(δ−δ′) and al→∞, for qJ:=(log⁡aJ+1)−(δ−δ′) one has ∥(I−PJ)u∥H(δ)≤qJ∥u∥H(δ′)andqJ→0. For any probability law Q on H(δ), coupling U with PJU and using the defining Lipschitz bound gives βBL,H(δ)(Q,Q∘PJ−1)≤∫∥(I−PJ)u∥H(δ) Q(du).

1.2F5algebra

For a fixed J, the middle term in βBL,H(δ)(Π~n,N)≤βBL,H(δ)(Π~n,Π~n∘PJ−1)+βBL,H(δ)(Π~n∘PJ−1,N∘PJ−1)+βBL,H(δ)(N∘PJ−1,N) tends to zero in probability: [F5] gives L1 convergence of the projected posterior and Gaussian coordinate densities. Every bounded-Lipschitz test function restricted to the projected subspace is bounded by 1, so its integral difference is at most that L1 distance.

1.3F1F3F7algebra

The last term is bounded by E∥W−PJW∥H(δ), which is at most (E∥W−PJW∥H(δ)2)1/2=(∑l>J,kwlδ)1/2 by [F3] and [F7]. This tends to zero as J→∞ by [F1].

2.1A1F2F3F4F6F7step 1.1algebra

Under the joint true-data/posterior law, using the supplied posterior model [F6] and the L2 prior construction [F2], U=n(f−X)=n(f−f0)−W, where W=n(X−f0) has law N. By [F4], [F3] and (a−b)2≤2a2+2b2, Ef0(n)∫∥U∥H(δ′)2 Πn(df∣X)≤2nEf0(n)∫∥f−f0∥H(δ′)2 Πn(df∣X)+2E∥W∥H(δ′)2≤C, with C independent of n. Applying [F7] under the posterior probability and then under the true-data probability, together with step 1.1, gives Ef0(n)βBL,H(δ)(Π~n,Π~n∘PJ−1)≤qJC. Thus the first projection error can be made uniformly small by taking J large.

3.1F8step 2.1step 1.2step 1.3algebra∎

Fix 0<ε<1 and choose J so the expected first and deterministic third terms are each less than ε2. By [F8], the probability that the first term exceeds ε is at most ε; the deterministic third term is less than ε. For this fixed J, step 1.2 makes the probability that the middle term exceeds ε tend to zero. The triangle bound then gives a limiting upper bound ε for the probability that the full distance exceeds 3ε. Since ε is arbitrary, βBL,H(δ)(Π~n,N)→0 in Pf0(n)-probability.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The scaled posterior converges weakly on the negative Sobolev space

Statement

Assume AC and the hypotheses of Weak nonparametric Bernstein–von Mises theorem for product priors. Then the random Borel probability measures Π~n converge weakly in probability to N on H(δ), where weak convergence is the bounded-continuous-test definition in Weak convergence of borel probability measures.

Facts & Assumptions

[F1]

Weak nonparametric Bernstein–von Mises theorem for product priors: βBL,H(δ)(Π~n,N)→0 in Pf0(n)-probability.

[F2]

The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: Under AC, convergence in βBL is equivalent to weak convergence on a Polish space.

[F3]

Weak convergence of borel probability measures: Weak convergence means convergence of integrals for every bounded continuous real test function.

[A1]

The Axiom of Choice: AC is required only for the weak-topology metrization in [F2]; the bounded-Lipschitz conclusion [F1] itself requires only its stated countable-choice premise.

Given: AC and the main theorem's random posterior measures and limit law.

Proof

1.1A1F2

By [F2], the bounded-Lipschitz metric is a metric for the weak topology on the Polish space H(δ) under [A1].

2.1F1F2F3step 1.1∎

The convergence in probability of this metric to zero in [F1] is exactly convergence in probability in the weak topology established in step 1.1; by [F3], its deterministic convergence relation is bounded-continuous-test convergence. This is the asserted weak posterior limit.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Continuous images of the scaled posterior converge weakly

Statement

Assume AC and the hypotheses of Weak nonparametric Bernstein–von Mises theorem for product priors. Let T be a metric space and let G:H(δ)→T be Borel measurable with N(DG)=0, where DG:={x∈H(δ):G is not continuous at x}. For every bounded continuous h:T→R,

∫h d(Π~n∘G−1)⟶∫h d(N∘G−1)

in Pf0(n)-probability. In particular this holds for continuous maps, including continuous linear functionals into Rm.

Facts & Assumptions

[F1]

The scaled posterior converges weakly on the negative Sobolev space: Π~n converges weakly in probability to N on H(δ).

[F2]

Continuous mapping theorem: If μn⇒μ on a metric space and G is measurable with μ(DG)=0, then G∗μn⇒G∗μ.

[F3]

The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: Under AC, the bounded-Lipschitz metric metrizes weak convergence on Polish H(δ).

[A1]

The Axiom of Choice: AC is needed only for the weak-topology interpretation imported through [F1] and [F3]; the continuous-mapping step is the choice-free theorem [F2].

Given: AC, a metric target T, the map G, and the posterior and limit measures in the statement.

Proof

1.1A1F2F3given

Fix a bounded continuous h:T→R and define Φ(ν):=∫h d(ν∘G−1). If βBL,H(δ)(νm,N)→0, [F3] gives νm⇒N under [A1]; [F2] and N(DG)=0 imply νm∘G−1⇒N∘G−1, hence Φ(νm)→Φ(N). Since βBL is a metric, this sequential criterion proves continuity of Φ at N.

2.1F1F3step 1.1∎

Given ε>0, continuity from step 1.1 supplies η>0 such that βBL,H(δ)(ν,N)<η implies ∣Φ(ν)−Φ(N)∣<ε. Therefore Pf0(n){∣Φ(Π~n)−Φ(N)∣≥ε}≤Pf0(n){βBL,H(δ)(Π~n,N)≥η}⟶0 by [F1] and [F3], which give bounded-Lipschitz convergence in probability on H(δ). This is the stated convergence in probability for h.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Prior-predictive and fixed-truth data laws are equivalent

Statement

Assume countable choice. Use the wavelet product prior and white-noise model from The wavelet product prior is L2-valued and White noise is a Borel Gaussian law on the negative Sobolev space, with α>0, σl=2−l(α+1/2), and a common coefficient density φ having finite second moment m2. Let f0∈L2([0,1]). For each n≥1 and δ>1/2, let Qn be the prior-predictive law on H(δ) of X=f+n−1/2W, with prior draw f independent of canonical white noise W, and let Pf0(n) be the law of f0+n−1/2W. Then Qn and Pf0(n) are mutually absolutely continuous as Borel probabilities on H(δ).

Facts & Assumptions

Given: The product-prior and white-noise laws, independence between the prior draw and observation noise, α>0, finite coefficient second moment m2, and f0∈L2([0,1]).

[F1]

Logarithmic negative Sobolev spaces for white noise: H(δ) is the weighted coefficient Hilbert space, its finite-coordinate projections converge in norm, and L2([0,1]) embeds continuously into it.

[F2]

The wavelet product prior is L2-valued: The prior coefficients are independent with common density φ, and the prior law is supported on L2 under its stated scale and moment conditions.

[F3]

White noise is a Borel Gaussian law on the negative Sobolev space: The noise law is a Borel probability on H(δ) with independent standard normal coordinates.

[F4]

The Bessel inequality for an arbitrary orthonormal family: The squared coefficient sum of f0 is at most ∥f0∥22.

[F5]

Independent random elements have product joint law: A finite independent family of random elements has the product of its marginal laws as its joint law.

[F6]

Finite measures agreeing on a generating pi-system and on the whole space are equal: Finite measures agreeing on a generating pi-system and on the whole space agree on the generated sigma-algebra.

[F7]

The indefinite integral of a nonnegative measurable function is a measure: For a nonnegative measurable density L, the set function A↦∫AL dQn is a measure.

[F8]

Riesz-Fischer completeness of Lp for 1≤p≤∞: Under countable choice, L2(Qn) is complete for the probability measure Qn.

[F9]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: Nonnegative integrands may be integrated in either order under the product of the prior coordinate law and Lebesgue measure.

[F10]

The Gaussian integral ∫−∞∞e−x2 dx=π: The Gaussian integral normalizes the displayed one-dimensional normal densities.

Given: All probabilities in the statement are defined on the specified Borel space; only their equivalence is proved below.

Proof

1.1F1givenalgebra

Enumerate the wavelet coefficients as j=1,2,… and let Pm retain the first m coordinates. The sigma-algebra generated by all coordinate maps is the Borel sigma-algebra of H(δ). Indeed, the coordinate maps are continuous, so their sigma-algebra is contained in the Borel sigma-algebra. Conversely, for any closed set C⊆H(δ), x↦d(Pmx,C) is measurable with respect to the coordinate sigma-algebra and converges to d(x,C) by [F1]. Thus C={x:d(x,C)=0} belongs to that sigma-algebra.

1.2F2F3F4F5F9F10givenalgebra

Write pa,n(x)=(n/2π)1/2e−n(x−a)2/2 and let πj(dt)=σj−1φ(t/σj)dt, where σj=σl for j=(l,k). The true and prior-predictive coordinate densities are pj=pθ0,j,n and qj(x)=∫pt,n(x) πj(dt); both are positive probability densities by [F9, F10]. Put hj2=∫(pj−qj)2dx and ρj=∫pjqj dx=1−hj2/2. Concavity of square root and [F9] give ρj≥∫ ⁣[∫pθ0,j,n(x)pt,n(x) dx]πj(dt). Completing the square and using [F10] evaluates the inner integral as e−n(t−θ0,j)2/8. Thus hj2≤∫2(1−e−n(t−θ0,j)2/8) πj(dt)≤n4∫(t−θ0,j)2 πj(dt)≤n2(θ0,j2+σj2m2). By [F2], [F3], and [F5] the prior-predictive and true coordinates are each independent across j. By [F4] and the geometric-series formula, ∑jθ0,j2<∞ and ∑jσj2=∑l≥02−2αl<∞. Hence ∑jhj2<∞ and ∑j(1−ρj)<∞.

2.1F5F8step 1.2givenalgebra

Let Fm be the sigma-algebra of the first m coordinates on H(δ) and set Lm=∏j≤mpj(Xj)/qj(Xj). Under Qn, Lm is the density of the first m true coordinates relative to the first m prior-predictive coordinates, and EQnLm=1. By [F5], finite coordinate laws are products; hence for r>m, independence gives EQn ⁣[LrLm]=∏m<j≤rρj, so ∥Lr−Lm∥L2(Qn)2=2(1−∏m<j≤rρj)≤2∑m<j≤r(1−ρj)→0 uniformly in r>m. By [F8] and countable choice, Lm has an L2(Qn) limit G; since each term is nonnegative, ∥G−∥2≤∥G−Lm∥2→0, so G≥0 almost surely. The norms ∥Lm∥2=1 give ∥G∥2=1. Put L=G2. Then ∥Lm−L∥1≤∥Lm−G∥2 ∥Lm+G∥2≤2∥Lm−G∥2→0, and L≥0 with ∫L dQn=1.

3.1F5F6F7step 1.1step 2.1step 1.2∎

For every event A∈Fm and r≥m, the finite-coordinate density identity and independence of the remaining coordinates give ∫ALr dQn=Pf0(n)(A). Passing to the L1 limit gives ∫AL dQn=Pf0(n)(A). By [F7], the nonnegative density L with total integral one defines a probability measure. Such finite-coordinate cylinder events form a generating pi-system by step 1.1; [F6] therefore gives Pf0(n)(A)=∫AL dQn for every Borel A⊆H(δ). Thus Pf0(n)≪Qn. Interchanging pj and qj gives the same argument and proves Qn≪Pf0(n).

5 · Examples, counterexamples and false statements

None yet.

Sources