Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

131 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