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.

Gaussian sequence inversion and exact risk

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Gaussian sequence inverse model

Definition

Assume the Axiom of Countable Choice. Let X and Y be real Hilbert spaces and let K:X→Y be a compact linear operator of infinite rank, viewed as an inverse model with exact datum Kx. Here compact means that the image of every bounded subset has compact closure. Write N(K)={x∈X:Kx=0} and H0=ran⁡K‾. Fix a positive singular system (sj,vj,uj)j∈N>0 for K, where N>0={1,2,3,…}, s1≥s2≥⋯>0, sj→0, Kvj=sjuj, (vj) is a complete orthonormal basis of N(K)⊥, and (uj) is a complete orthonormal basis of H0. A complete orthonormal basis is an orthonormal family whose closed linear span is the whole indicated subspace. These are the compact SVD conventions; in particular, this model concerns minimum-norm representatives in N(K)⊥ and does not estimate a kernel component.

For a truth x∈N(K)⊥, let θj=⟨x,vj⟩X. The complete-basis coefficient map identifies N(K)⊥ bijectively and isometrically with ℓ2(N>0,R), so every θ∈ℓ2(N>0,R) is a model parameter. For ϵ>0, take the functional white-noise experiment on the separable Hilbert space H0 with observations Yx(g)=⟨Kx,g⟩Y+ϵW(g), where W is centered, has covariance E[W(g)W(h)]=⟨g,h⟩Y, and has independent standard-normal values on every finite orthonormal tuple. The countable complete basis makes H0 separable. Define ξj=W(uj) and Zj=Yx(uj)/sj. The sequence sample space is RN>0 with the product Borel sigma-algebra, meaning the sigma-algebra generated by its coordinate projections. The coordinate law is the pushforward of the functional experiment under y↦(y(uj)/sj)j∈N>0; this map is measurable because each coordinate is a cylinder evaluation followed by scalar multiplication. The compact SVD expansion gives ⟨Kx,uj⟩Y=sjθj, and the positive-noise white-noise coordinate theorem gives the independent standard-normal coordinates ξj. Hence the normalized coordinates satisfy Zj=θj+ϵsj−1ξj,j∈N>0.

For the zero-noise boundary ϵ=0, define the sequence experiment separately by the point mass at θ, so Zj=θj. This boundary is not an instance of the positive-noise functional experiment.

Coordinate diagram

The deterministic square commutes: ΦX(x)=(⟨x,vj⟩)j and ΦH0(y)=(⟨y,uj⟩)j are the coefficient isometries, and Ds(θ)=(sjθj)j is well defined because sj≤s1. The compact SVD expansion gives ΦH0(Kx)=Ds(ΦX(x)). The noisy coordinates add ϵξj before division by sj; the diagram is not a claim that white noise is an H0-valued sample and is not used as a proof.

N(K)?`2(N>0;R)H0`2(N>0;R)©XKDs©H0
DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Weighted ellipsoid class for sequence inversion

Definition

Let Q∈[0,∞) and let a=(aj)j∈N>0 be a nondecreasing sequence of positive real numbers, so 0<a1≤a2≤⋯. The statistical ellipsoid of radius Q and weights a in the Gaussian sequence inverse model is Θa(Q)={θ∈ℓ2(N>0,R):∑j=1∞aj2θj2≤Q2}. No assumption that aj→∞ is included. In particular, this definition does not assert that the ellipsoid is compact in ℓ2.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Singular-value cutoff estimator

Definition

Input a normalized sequence observation z=(zj)j∈N>0∈RN>0 from the Gaussian sequence inverse model and a cutoff D∈N0, where N0={0,1,2,…}. Output the finite-support estimate θ^D(z)∈ℓ2(N>0,R) defined by θ^D,j(z)={zj,1≤j≤D,0,j>D. For D=0 the output is the zero sequence.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Exact worst-case risk of the truncated estimator

Statement

Assume Countable Choice and let ϵ≥0. In the Gaussian sequence inverse model with positive singular numbers (sj)j∈N>0, let Q≥0 and let (aj)j∈N>0 be positive and nondecreasing. For each θ∈Θa(Q), define the squared sequence risk of the cutoff estimator at D∈N0 by Rθ(D):=Eθ ⁣[∥θ^D(Z)−θ∥ℓ22]. Then its exact worst-case squared sequence risk is sup⁡θ∈Θa(Q)Rθ(D)=Q2aD+12+ϵ2∑j=1Dsj−2, where the sum is 0 for D=0. The supremum is attained by the one-coordinate truth θ⋆=(Q/aD+1)eD+1, with θ⋆=0 when Q=0.

Facts & Assumptions

[F1]

Gaussian sequence inverse model: For ϵ>0, Zj=θj+ϵsj−1ξj with Eξj=0 and Eξj2=1; at ϵ=0, Zj=θj deterministically.

[F2]

Weighted ellipsoid class for sequence inversion: θ∈Θa(Q) means θ∈ℓ2 and ∑j≥1aj2θj2≤Q2, with 0<a1≤a2≤⋯.

[F3]

Singular-value cutoff estimator: θ^D,j(Z)=Zj for 1≤j≤D and 0 for j>D.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed only for the upstream compact SVD coordinate identification; it is not used in the finite-coordinate risk calculation.

Given: Countable Choice, ϵ≥0, positive singular numbers (sj), a cutoff D∈N0, and the ellipsoid Θa(Q) with positive nondecreasing weights.

Proof

1.1givenA1F1F2F3algebra

Under [A1], the model coordinates in [F1] are fixed by the countable-choice SVD branch. If ϵ>0, [F1] and [F3] give θ^D,j(Z)−θj=ϵsj−1ξj for j≤D and −θj for j>D, hence ∥θ^D(Z)−θ∥ℓ22=ϵ2∑j=1Dsj−2ξj2+∑j>Dθj2. If ϵ=0, the retained error is zero and the omitted error is −θj, so the squared error is ∑j>Dθj2. In both cases the error is in ℓ2 because the estimator has finite support and θ∈ℓ2.

2.1step 1.1F1algebra

For ϵ>0, taking expectation in the finite random sum of [step 1.1] and using Eξj2=1 from [F1] gives Rθ(D)=ϵ2∑j=1Dsj−2+∑j>Dθj2. For ϵ=0, the deterministic error in [step 1.1] gives the same formula with the first term zero. The deterministic tail is finite because θ∈ℓ2.

3.1givenF2step 2.1algebra

For every θ∈Θa(Q), monotonicity gives aj≥aD+1 for j>D, so ∑j>Dθj2=∑j>Daj2θj2aj−2≤aD+1−2∑j>Daj2θj2≤Q2/aD+12. Thus [step 2.1] is bounded above by the asserted right-hand side.

4.1F2step 2.1step 3.1constructalgebra

The sequence with θD+1⋆=Q/aD+1 and all other coordinates zero belongs to ℓ2 and satisfies ∑j≥1aj2(θj⋆)2=Q2, including Q=0. Its tail squared norm is exactly Q2/aD+12, so it attains the upper bound from [step 3.1]. The finite-coordinate variance term in [step 2.1] is independent of θ, hence the same sequence attains the full worst-case risk.

5.1step 2.1step 3.1step 4.1algebra∎

Taking the supremum in [step 2.1], using the universal upper bound [step 3.1] and the attaining sequence [step 4.1], yields the exact equality and the stated zero-cutoff convention.

Remarks

This is expected squared loss in the Gaussian sequence experiment, over a weighted ellipsoid of coefficient sequences. It is not a deterministic worst-case error bound for arbitrary norm-bounded data perturbations.

4 · Examples, counterexamples and false statements

None yet.

Sources