Alphabeta Math
LemmaStatement: 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.

Posterior and marginal-likelihood formulas for the Gaussian sequence prior

Statement

Assume AC. Fix n≥1, p≥0, C≥1, a sequence C−2i−2p≤κi2≤C2i−2p, a truth θ0∈ℓ2(N+,R), where N+={1,2,…}, and 0<α<∞. Consider the prior Πα=⨂i≥1N(0,i−1−2α) and observations Xi=κiθ0,i+n−1/2Zi, where the Zi are independent N(0,1). Denote their sampling law by Pθ0(n) and write ℓ2=ℓ2(N+,R) throughout this lemma. For n≥3 and 0<α≤An, these are the model and prior in Empirical-Bayes credible-ball procedure in the inverse Gaussian sequence model; the present fixed-α calculation requires no maximization domain or selector. Put r=1+2α. Then the product prior is supported on ℓ2, and its posterior kernel under the prior-predictive law Qn,α is the product of the coordinate laws N ⁣(nκixiir+nκi2,1ir+nκi2),i≥1, For Pθ0(n)-almost every observation x, this same kernel is supported on ℓ2, and its posterior mean belongs to ℓ2.

Let Qn,α be the prior-predictive law of X under this prior and let Qn,0=⨂i≥1N(0,n−1). Then Qn,α≪Qn,0 and log⁡dQn,αdQn,0(x)=−12∑i=1∞[log⁡ ⁣(1+nκi2ir)−n2κi2xi2ir+nκi2]=ℓn(α;x). The density identity and absolute convergence hold Qn,0-almost surely. The same displayed score series also converges absolutely Pθ0(n)-almost surely; this latter assertion does not identify a version of the Radon–Nikodym derivative under Pθ0(n).

Facts & Assumptions

Given: AC, the countable product Gaussian prior and sampling model in the Statement, 0<α<∞, and θ0∈ℓ2.

[A1]

AC is assumed. The Axiom of Choice

[F1]

AC supplies countable choice and dependent choice, the two choice principles required by the countable-product probability construction. AC supplies countable selections and prescribed serial paths

[F2]

Under countable choice and dependent choice, a countable product of probability spaces exists and has the prescribed finite-coordinate marginals. Assuming countable and dependent choice, countable products of arbitrary probability spaces

[F3]

The product sigma-algebra on a countable product is generated by finite-coordinate cylinders. Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra

[F4]

N(m,σ2) is the pushforward of the standard normal law under x↦m+σx. Standard normal and normal laws

[F5]

Nonnegative coordinate sums can be integrated by Tonelli's theorem. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F6]

Probability measures that agree on a generating π-system agree on its generated sigma-algebra. Dynkin's pi-lambda theorem

[F7]

The sequence space ℓ2 consists of the families with finite sum of squared coordinates. Square-summable families on an arbitrary index set and the space ℓ2(I)

[F8]

In the procedure's range n≥3, 0<α≤An, its model, prior and coordinate update notation agree with those in the Statement. Empirical-Bayes credible-ball procedure in the inverse Gaussian sequence model

[F9]

Under Countable Choice, the C1 diffeomorphism change-of-variables formula applies to nonnegative measurable integrands. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions

[F10]

A normal random variable with law N(m,σ2) has expectation m and variance σ2. Location-scale normal laws have their stated mean and variance

[F11]

The standard normal density ϕ(x)=e−x2/2/2π is positive, Borel measurable and integrates to one. The standard normal density has total mass one

Proof

1.1A1F1F2F4F8F9F11givenalgebra

By [F1]–[F2], the independent prior coordinates and independent normal errors can be realized on countable product probability spaces. Fix one coordinate and put si=i−r. By [F4], [F9] and [F11], the prior and sampling densities with respect to Lebesgue measure are gi(t)=(2πsi)−1/2e−t2/(2si),qi(x∣t)=n2πe−n(x−κit)2/2. Their product has exponent −12[(si−1+nκi2)t2−2nκixt+nx2]. Completing the square in t gives conditional variance vi=(si−1+nκi2)−1 and conditional mean mi(x)=vinκix. Integrating the same product over t gives the prior-predictive density exp⁡{−x2/[2(n−1+κi2si)]}2π(n−1+κi2si). This is the density of N(0,n−1+κi2si) by [F4], [F9] and [F11]. In the procedure's parameter range, [F8] identifies the same coordinate update.

2.1F2F3F4F6F9F11step 1.1

The scalar posterior densities in step 1.1 are probability densities by [F4], [F9] and [F11]. For each fixed data sequence, [F2] defines the product posterior measure K(x,⋅). On a finite-coordinate parameter cylinder A, K(x,A) is a finite product of normal probabilities, hence is Borel in x. The scalar Bayes identity and independence of the coordinate pairs give the conditional-law identity for such A and every finite-coordinate data cylinder. For fixed A, both sides, as functions of the data event, are finite measures; the scalar Bayes identity with the full data event shows that both have total mass equal to the prior probability of A. If that mass is positive, normalize both measures and apply [F6]; if it is zero, both measures are identically zero. The data cylinders generate the data sigma-algebra by [F3], so the identity holds for every data event. The class of parameter sets A for which K(⋅,A) is Borel and the identity holds for every data event contains the parameter-cylinder π-system. It is a Dynkin system because complements use 1−K(x,A) and differences of finite measures, while countable disjoint unions use pointwise limits of measurable partial sums and countable additivity of the joint measures. A second use of [F3] and [F6] proves the identity for every product-measurable A. Therefore K is a posterior probability kernel.

2.2F2F4F5F6F10F11step 1.1algebra

Write ai=nκi2si. The density of the marginal N(0,n−1(1+ai)) coordinate relative to N(0,n−1) is Li(xi)=(1+ai)−1/2exp⁡{naixi2/[2(1+ai)]}. Since ∑iai≤nC2∑ii−1−2α−2p<∞, [F5] and [F10] give ∑iaiZi2<∞ almost surely under Qn,0, where Zi=nXi. Hence ∑i∣log⁡Li(Xi)∣<∞ there. Choose J so ai<1 for i>J. Direct Gaussian integration gives EQn,0Li2=(1−ai2)−1/2 for i>J, and ∏i>J(1−ai2)−1/2<∞ because ∑iai2<∞. The finite tail products are mean-one martingales and are Cauchy in L2: for m>k>J, independence gives E∣∏i=J+1mLi−∏i=J+1kLi∣2=E(∏i=J+1kLi2){∏i=k+1m(1−ai2)−1/2−1}, which tends uniformly to zero as k→∞. The finite initial product is independent of the tail and has mean one, so multiplication preserves L1 convergence. By absolute convergence of the log series, the nonnegative limit is ∏iLi=exp⁡(∑ilog⁡Li) and has expectation one. It agrees with the marginal product law on every finite cylinder, so [F6] identifies it as dQn,α/dQn,0. Taking logarithms and substituting si=i−r gives the displayed ℓn(α;x).

3.1F5F10givenstep 2.2algebra

Under Pθ0(n), [F10] and the independence in the model give EXi2=κi2θ0,i2+n−1. The sum ∑iaiE(nXi2) is finite: its noise part is ∑iai, and its signal part is n2∑iκi4i−rθ0,i2≤n2C4∑iθ0,i2<∞. Thus the same absolute-convergence bound for ∑i∣log⁡Li(Xi)∣ holds under the true sampling law.

4.1F5F7F10givenstep 1.1algebra∎

By [F5] and [F10], the prior has expected squared norm ∑ii−r<∞, hence belongs to ℓ2 almost surely. The posterior variances satisfy ∑ivi≤∑ii−r<∞. For its mean, write mi(Xi)=wiθ0,i+nκi(ir+nκi2)−1Zi, where wi=nκi2/(ir+nκi2)≤1. The cross term has mean zero because EZi=0 by [F10], so Eθ0(n)∑imi(Xi)2≤∑iθ0,i2+nC2∑ii−2r−2p<∞. Therefore the posterior mean is in ℓ2 almost surely; for almost every such observation its posterior expected squared norm is ∑i(mi(Xi)2+vi)<∞, so the posterior gives ℓ2 mass one.

Depends on

Used by

Dependency tree · two levels

73 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