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.

✓ 3 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Posterior contraction in Gaussian sequence inversion — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Polynomial singular-value decay and a power Gaussian prior

Example

Assume AC and Countable Choice. Fix α,β,p,L>0. For each 0<ϵ≤1, use the centered Gaussian Borel prior on ℓ2 with independent coordinates θj∼N(0,j−1−2α), independent of the observation noise. Under the fixed-truth law, observe Yj=j−pθj†+ϵξj with independent N(0,1) noise and a fixed truth θ† in the power ellipsoid {θ∈ℓ2:∑j≥1j2β(θj)2≤L2}. Then the posterior contracts in the ℓ2 norm at rate rϵ=ϵ2min⁡(α,β)/(1+2α+2p), meaning that for every Mϵ→∞ the expected posterior mass outside radius Mϵrϵ tends to zero as ϵ↓0.

Facts & Assumptions

Given: AC and Countable Choice; α,β,p,L>0; 0<ϵ≤1; the power ellipsoid and Gaussian prior in the Example; and the exact posterior moment formula for the coordinate model.

[A1]

AC is the declared assumption for the Gaussian product posterior construction. The Axiom of Choice

[A2]

Countable Choice is inherited from the compact-SVD sequence model. The Axiom of Countable Choice (ACω)

[F1]

The posterior coordinate mean and variance are λjYj/sj and vj, and the expected posterior squared error is the displayed nonnegative sum; posterior tail mass is bounded by that sum divided by the squared radius. Exact posterior second moment and contraction bound for a Gaussian sequence inverse problem

[F2]

A rate is established when expected posterior mass outside every diverging multiple tends to zero under the fixed-truth law. Posterior contraction rate in a Gaussian sequence inverse experiment

[F3]

The Gaussian sequence inverse model has θ†∈ℓ2, positive singular values, product-Borel observations, and independent standard-normal noise coordinates. Gaussian sequence inverse model

[F5]

For every q>0, the geometric series ∑k≥02−2qk converges and equals (1−2−2q)−1. For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges

[F6]

The canonical real square-summable sequence space H=ℓ2 is complete, hence a real Hilbert space. Positive-index coordinates are identified with the N0-indexed sequence space by the isometry (xj)j≥1↦(xn+1)n≥0. The real square-summable sequence space is complete The set of finite-support sequences with rational coordinates is countable and dense: truncate any square-summable sequence so the tail norm is arbitrarily small, then approximate the finitely many retained coordinates by rationals. Hence H is separable. For the diagonal covariance, positivity and self-adjointness follow from ⟨Γx,x⟩=∑jτj2xj2≥0 and ⟨Γx,y⟩=⟨x,Γy⟩. Finite-rank truncations converge in operator norm, so Γ is compact; its diagonal rank-one expansion has nuclear sum ∑jτj2<∞, so it is trace class. A Hilbert space with a given orthonormal basis is ℓ2 of the index set, Separability: the existence of an at most countable dense subset, Bounded finite rank operators are compact, Norm limit of compact operators is compact, Nuclear series characterizes trace norm

[F7]

A positive self-adjoint trace-class covariance on a separable real Hilbert space defines a Borel centered Hilbert-valued Gaussian random element with that covariance. Positive trace-class covariance defines a Hilbert Gaussian

[F8]

A finite vector is multivariate normal when all its linear projections are normal. Multivariate normal law, including singular covariance

[F9]

Finite jointly Gaussian blocks with zero cross-covariance are independent, including for singular covariance matrices. Uncorrelated jointly Gaussian blocks are independent

[F10]

The notation N(m,σ2) denotes the law of a normal variable with mean m and variance σ2. Standard normal and normal laws

[F11]

For positive bases, a>1 makes x↦ax increasing, 0<a<1 makes it decreasing, and for t>0 the map a↦at is increasing while a↦a−t is decreasing, since a−t=1/at. In particular, for q>0, 0<2−2q<1, because log⁡2>log⁡1=0 and exp⁡ is positive and increasing. For 0<ϵ<1, log⁡ϵ<0, so u≥v implies ϵu≤ϵv. Finally, for η>0 and any M>0, if 0<ϵ<exp⁡(−M/η) then ηlog⁡ϵ<−M, so ϵη<exp⁡(−M); the latter tends to zero as M→∞. These facts use ax=exp⁡(xlog⁡a), strict increase of log⁡ and exp⁡, log⁡1=0, positivity of exp⁡, and its limit at −∞. Real powers for positive bases, with the zero-base positive-exponent convention, The natural logarithm as the inverse of the exponential function, The real exponential function and the number e by a power series, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential function is strictly increasing, The exponential tends to +∞ at +∞ and to 0 at −∞, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x)

Given: The hypotheses of the Example and facts [A1], [F1]–[F11].

Verification

Given: The hypotheses of the Example and facts [A1], [A2], [F1]–[F11].

1.1A1A2F4F5F6F7F8F9F10F11givenconstructalgebra

Let H=ℓ2 with standard basis (ej) and set τj2=j−1−2α. Each dyadic block 2k≤j<2k+1 has at most 2k terms, each at most 2−k(1+2α), so [F5] gives ∑jτj2≤∑k≥02−2αk<∞; here the geometric ratio satisfies 0<2−2α<1 by [F11]. Define Γej=τj2ej. It is positive and self-adjoint; its truncations ΓN have finite rank, and ∥Γ−ΓN∥≤sup⁡j>Nτj2≤∑j>Nτj2→0, so [F6] makes Γ compact. The expansion Γx=∑j⟨x,τj2ej⟩ej has nuclear sum ∑jτj2<∞, so [F6] also makes it trace class. By [F7] there is a Borel centered Gaussian random element G in H with covariance Γ. For each finite coordinate vector, every linear projection is centered normal by [F7], hence it is jointly Gaussian by [F8]; its covariance matrix is diagonal with entries τj2. Repeatedly applying [F9] to the first coordinate and the remaining block proves that the coordinates are independent, and [F10] identifies their laws as N(0,τj2). Thus the law of G is the stated prior on ℓ2.

1.2F3F4F5F11givenconstructalgebra

Put d=1+2α+2p and J=⌈ϵ−2/d⌉. Since ϵ−2/d≥1, one has ϵ−2/d≤J≤2ϵ−2/d. The posterior variance satisfies vj≤min⁡{j−1−2α,ϵ2j2p}. Therefore ∑j≥1vj≤ϵ2∑j≤Jj2p+∑j>Jj−1−2α≤ϵ2J2p+1+2J−2α∑k≥02−2αk≤Cα,pϵ4α/d. The finite sum has at most J terms each at most J2p; for the tail, the block 2kJ<j≤2k+1J has at most 2k+1J terms, each at most (2kJ)−1−2α. The conversions between powers of J and ϵ use the positive-base power order in [F11].

2.1F3F4F11givenstep 1.2algebra

Write bj=1−λj=ϵ2/(ϵ2+j−d)≤min⁡{1,ϵ2jd}. The ellipsoid condition gives ∑jbj2(θj†)2≤L2sup⁡jbj2j−2β. For j≤J, this supremum is bounded by ϵ4J2d−2β when β≤d, and by ϵ4 when β>d. For j>J, it is at most J−2β. The bounds on J in step 1.2 give ∑jbj2(θj†)2≤Cα,β,p,Lϵmin⁡{4β/d,4}. This treats the equality case β=d in the first branch. The power-order comparisons use 0<ϵ≤1 and the positive-base facts in [F11].

3.1A1A2F1F2F4F11givenstep 1.2step 2.1algebra∎

Since vjsj2/ϵ2=λj≤1, one has vj2sj2/ϵ2=vjλj≤vj. The exact sum [F1] and steps 1.2–2.1 therefore give Sϵ(θ†)≤Cα,β,p,Lϵ4min⁡{α,β}/d; here 4α/d<4. Put η=2min⁡{α,β}/d>0. By [F11], rϵ=ϵη→0, as required in the rate definition. Since 0<ϵ≤1, [F11] also permits the posterior-moment bound to be written as Sϵ(θ†)≤Crϵ2. The expected posterior tail outside Mϵrϵ is therefore at most C/Mϵ2→0 for every Mϵ→∞. By [F2], this is the stated contraction rate.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Exponential singular-value decay and an exponentially weighted truth class

Example

Assume AC and Countable Choice. Fix α,β,p,L>0. For each 0<ϵ<1/eα+p, use the centered Gaussian Borel prior on ℓ2 with independent coordinates θj∼N(0,e−2αj), independent of the observation noise. Under the fixed-truth law, observe Yj=e−pjθj†+ϵξj with independent N(0,1) noise and a fixed truth θ† in the exponential ellipsoid {θ∈ℓ2:∑j≥1e2βj(θj)2≤L2}. Then the posterior contracts in the ℓ2 norm at rate rϵ=ϵmin⁡(α,β)/(α+p), meaning that for every Mϵ→∞ the expected posterior mass outside radius Mϵrϵ tends to zero as ϵ↓0.

Facts & Assumptions

Given: AC and Countable Choice; α,β,p,L>0; 0<ϵ<1/eα+p; the exponential ellipsoid and independent Gaussian prior in the Example; and the exact posterior moment formula for the coordinate model.

[A1]

AC is the declared assumption for the Gaussian product posterior construction. The Axiom of Choice

[A2]

Countable Choice is inherited from the compact-SVD sequence model. The Axiom of Countable Choice (ACω)

[F1]

The posterior coordinate mean and variance are λjYj/sj and vj, and the expected posterior squared error is the displayed nonnegative sum; posterior tail mass is bounded by that sum divided by the squared radius. Exact posterior second moment and contraction bound for a Gaussian sequence inverse problem

[F2]

A rate is established when expected posterior mass outside every diverging multiple tends to zero under the fixed-truth law. Posterior contraction rate in a Gaussian sequence inverse experiment

[F3]

The Gaussian sequence inverse model has θ†∈ℓ2, positive singular values, product-Borel observations, and independent standard-normal noise coordinates. Gaussian sequence inverse model

[F6]

If 0<r<1, the geometric series ∑k≥0rk converges to (1−r)−1. For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges

[F7]

The canonical real square-summable sequence space H=ℓ2 is complete, hence a real Hilbert space. Positive-index coordinates are identified with the N0-indexed sequence space by the isometry (xj)j≥1↦(xn+1)n≥0. The real square-summable sequence space is complete The set of finite-support sequences with rational coordinates is countable and dense: truncate any square-summable sequence so the tail norm is arbitrarily small, then approximate the finitely many retained coordinates by rationals. Hence H is separable. For the diagonal covariance, positivity and self-adjointness follow from ⟨Γx,x⟩=∑jτj2xj2≥0 and ⟨Γx,y⟩=⟨x,Γy⟩. Finite-rank truncations converge in operator norm, so Γ is compact; its diagonal rank-one expansion has nuclear sum ∑jτj2<∞, so it is trace class. A Hilbert space with a given orthonormal basis is ℓ2 of the index set, Separability: the existence of an at most countable dense subset, Bounded finite rank operators are compact, Norm limit of compact operators is compact, Nuclear series characterizes trace norm

[F8]

A positive self-adjoint trace-class covariance on a separable real Hilbert space defines a Borel centered Hilbert-valued Gaussian random element with that covariance. Positive trace-class covariance defines a Hilbert Gaussian

[F9]

A finite vector is multivariate normal when all its linear projections are normal. Multivariate normal law, including singular covariance

[F10]

Finite jointly Gaussian blocks with zero cross-covariance are independent, including for singular covariance matrices. Uncorrelated jointly Gaussian blocks are independent

[F11]

The notation N(m,σ2) denotes the law of a normal variable with mean m and variance σ2. Standard normal and normal laws

[F12]

For positive bases, a>1 makes x↦ax increasing, 0<a<1 makes it decreasing, and for t>0 the map a↦at is increasing while a↦a−t is decreasing, since a−t=1/at. For 0<ϵ<1, log⁡ϵ<0, so u≥v implies ϵu≤ϵv. Finally, for η>0 and any M>0, if 0<ϵ<exp⁡(−M/η) then ηlog⁡ϵ<−M, so ϵη<exp⁡(−M); the latter tends to zero as M→∞. These follow from [F4] and [F5]: ax=exp⁡(xlog⁡a), log⁡ and exp⁡ are strictly increasing, log⁡1=0, and exp⁡(x)→0 as x→−∞. Real powers for positive bases, with the zero-base positive-exponent convention, The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential function is strictly increasing, The exponential tends to +∞ at +∞ and to 0 at −∞, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x)

Given: The hypotheses of the Example and facts [A1], [F1]–[F12].

Verification

Given: The hypotheses of the Example and facts [A1], [A2], [F1]–[F12].

1.1A1A2F4F5F6F7F8F9F10F11givenconstructalgebra

Let H=ℓ2 with standard basis (ej) and set τj2=e−2αj. Since e=exp⁡(1), real-power definition and logarithm inversion give e−2α=exp⁡(−2α); strict increase, positivity and exp⁡(0)=1 imply 0<e−2α<1. By the exponent laws, τj2=(e−2α)j, so [F6] gives ∑jτj2<∞. Define Γej=τj2ej. It is positive and self-adjoint; its truncations ΓN have finite rank, and ∥Γ−ΓN∥≤sup⁡j>Nτj2≤∑j>Nτj2→0, so [F7] makes Γ compact. The expansion Γx=∑j⟨x,τj2ej⟩ej has nuclear sum ∑jτj2<∞, so [F7] also makes it trace class. By [F8] there is a Borel centered Gaussian random element G in H with covariance Γ. For each finite coordinate vector, every linear projection is centered normal by [F8], hence it is jointly Gaussian by [F9]; its covariance matrix is diagonal with entries τj2. Repeatedly applying [F10] to the first coordinate and the remaining block proves that the coordinates are independent, and [F11] identifies their laws as N(0,τj2). Thus the law of G is the stated prior on ℓ2.

1.2F4F5F6F12givenconstructalgebra

Put q=α+p. For sufficiently small ϵ, let J be the largest positive integer with eqJ≤1/ϵ. Since q>0, the exponential is increasing and unbounded, so J exists and J→∞ as ϵ↓0. Maximality gives eqJ≤1/ϵ<eqeqJ, hence e−q/ϵ<eqJ≤1/ϵ. The posterior variance satisfies vj≤min⁡{e−2αj,ϵ2e2pj}. Reversing the finite geometric sum for j≤J and summing the tail gives ∑j≥1vj≤Cα,p(ϵ2e2pJ+e−2αJ)≤Cα,p′ϵ2α/q. For the first term, e2pJ=(eqJ)2p/q≤ϵ−2p/q by positive-power order; for the second, eqJ>e−q/ϵ gives e−2αJ<e2αϵ2α/q by exponent order.

2.1F3F4F5F12givenstep 1.2algebra

Write bj=1−λj=ϵ2/(ϵ2+e−2qj)≤min⁡{1,ϵ2e2qj}. The truth ellipsoid implies ∑jbj2(θj†)2≤L2sup⁡jbj2e−2βj. For j≤J, this is bounded coordinatewise by ϵ4e(4q−2β)j; its maximum is at J if β≤2q, and then is at most ϵ4(eqJ)4−2β/q≤ϵ2β/q. If β>2q, the exponent is negative and the maximum is at j=1, bounded by a constant times ϵ4. For j>J, the source weight gives bj2e−2βj≤e−2βJ=(eqJ)−2β/q≤e2βϵ2β/q. Thus the squared-bias term is at most Cα,β,p,Lϵmin⁡{2β/q,4}. The exponent-order comparisons use e>1, [F12], and 0<ϵ<1.

3.1A1A2F1F2F4F12givenstep 1.2step 2.1algebra∎

Since vjsj2/ϵ2=λj≤1, one has vj2sj2/ϵ2=vjλj≤vj. Combining [F1] with steps 1.2–2.1 gives Sϵ(θ†)≤Cα,β,p,Lϵ2min⁡{α,β}/q. To see the exponent comparison, put δ=min⁡{2β/q,4}. If β≤α, then δ=2β/q≤2α/q. If β>α, then δ>2α/q, because 2β/q>2α/q and 4>2α/q (as α<q). Since 0<ϵ<e−q<1, [F12] shows that the sum of the bias bound O(ϵδ) and variance bound O(ϵ2α/q) is O(ϵ2min⁡{α,β}/q). Set η=min⁡{α,β}/q>0. Then [F12] gives rϵ=ϵη→0 as ϵ↓0. [F1] bounds the expected posterior tail outside Mϵrϵ by C/Mϵ2→0 for every Mϵ→∞. By [F2], this is the claimed posterior contraction rate.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A point-mass Gaussian prior excluding the truth prevents contraction

Statement refuted

Assume AC and Countable Choice. In every positive-noise Gaussian sequence inverse experiment, every proper centered Gaussian prior on ℓ2 yields posterior contraction at some rate rϵ→0 about every truth θ†∈ℓ2, including truths for which the prior gives zero mass to every ball of radius less than 1 centered at θ†.

Facts & Assumptions

Given: AC and Countable Choice; the positive-noise sequence inverse experiment; its standard basis vector e1=(1,0,0,…); and the posterior contraction definition.

[A1]

AC and Countable Choice are assumed by the Gaussian sequence model and its product-law theorem. The Axiom of Choice, The Axiom of Countable Choice (ACω)

[F1]

The data coordinates are Yj=sjθj+ϵξj with positive sj and independent standard-normal noise. Gaussian sequence inverse model

[F2]

The conjugate contraction theorem assumes τj>0 and ∑jτj2<∞; its conclusion is not stated for every Gaussian prior without those hypotheses. Exact posterior second moment and contraction bound for a Gaussian sequence inverse problem

[F3]

The law N(0,0) is the point mass δ0. Standard normal and normal laws

[F4]

A nondegenerate finite-dimensional Gaussian with covariance ϵ2I has density proportional to exp⁡(−∥y−m∥22/(2ϵ2)). A positive-definite multivariate normal law has its Gaussian density

[F5]

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

[F7]

The posterior contraction condition requires the expected posterior mass outside every diverging multiple of a rate to tend to zero under the fixed-truth data law. Posterior contraction rate in a Gaussian sequence inverse experiment

Counterexample

Given: Let the prior be Π0=δ0 on ℓ2, let the truth be θ†=e1, and let s1>0 and ϵ>0.

1.1A1F1F3givenconstruct

The prior δ0=N(0,0) is a proper centered Gaussian law. Under its prior-predictive joint law, θ=0 almost surely, so for every Borel A⊆ℓ2 and product-Borel B⊆RN>0, P(θ∈A,Y∈B)=1A(0)P0ϵ(Y∈B)=∫Bδ0(A) P0ϵ(dy). Thus the constant kernel y↦δ0 is a posterior version. The prior assigns zero mass to every ball centered at e1 of radius less than 1.

2.1A1F1F4F5F6givenstep 1.1algebra

Under the fixed truth e1, only the first data coordinate shifts. Relative to the prior-predictive data law, the one-coordinate normal density ratio is L(y)=exp⁡ ⁣(s1y1ϵ2−s122ϵ2), and it integrates to 1 under the prior-predictive first-coordinate law. It is positive and finite for every y by [F4]–[F6]. All remaining coordinates have identical independent laws. The two full product-Borel data laws therefore agree as finite measures on the generating cylinder π-system after weighting by L; [F5] extends the identity to all data events. Since L>0, the laws are equivalent, so the posterior version δ0 remains the same almost surely under the truth law.

3.1F2F7givenstep 1.1step 2.1algebra∎

For any candidate rate rϵ→0, take Mϵ=rϵ−1/2 for sufficiently small ϵ. Then Mϵ→∞ and Mϵrϵ=rϵ<1 eventually. The posterior is concentrated at 0, whose distance from e1 is 1, so its mass outside the radius-Mϵrϵ ball is exactly 1 under the truth law. This violates [F7] and refutes the Statement. The example lies outside the positive-coordinate-variance hypotheses in [F2].

Sources