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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

136 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