Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 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.

Risk decomposition and monotone bias for ordered spectral filters

Statement

Assume Countable Choice and the positive-noise Gaussian sequence model with σ>0, a fixed complete positive singular system (sj,vj,uj) for an injective compact Hilbert–Schmidt operator T:X→Y, and a truth with coordinates θj=⟨x,vj⟩X in ℓ2. Write λj=sj2 and let ξj be the independent standard-normal noise coordinates. Let qα be nonnegative and satisfy 0≤λjqαm(λj)≤1, qαm(λj)≤Cq′/αm, and qαm1(λj)≤qαm2(λj) whenever m1<m2. For each candidate m, form the finite sums

Xm,N:=∑j=1N(λjqαm(λj)θj+σsjqαm(λj)ξj)vj.

The conclusion below includes the existence of their limit x^m in L2(Ω;X). Put fm:=Ex^m, Bm:=∥fm−x∥X, and vm:=E∥x^m−fm∥X2. Then x^m is a measurable X-valued random element with finite second moment and

E∥x^m−x∥X2=Bm2+vm,vm=σ2∑j≥1λjqαm(λj)2.

If m1<m2, then Bm2≤Bm1, ∥fm2−fm1∥X≤Bm1, and

vm1,m2:=E∥(x^m2−fm2)−(x^m1−fm1)∥X2=σ2∑j≥1λj(qαm2(λj)−qαm1(λj))2≤vm2.

Facts & Assumptions

Given: Countable Choice, the experiment and hypotheses in the Statement, a fixed complete positive singular system (sj,vj,uj) with λj=sj2, and a fixed candidate m or pair m1<m2.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed by the SVD coordinate model; after its fixed countable basis is supplied, the proof below makes no further selections.

[F1]

Gaussian sequence inverse model: In the positive-noise sequence experiment, Zj=θj+σsj−1ξj with independent ξj∼N(0,1), and θ=(θj)∈ℓ2.

[F2]

Singular value decomposition for compact operators: The fixed positive singular vectors form complete orthonormal bases on the minimum-norm parameter space and the closure of the range, with Tvj=sjuj and T∗Tvj=λjvj.

[F3]

Ordered spectral filters, source indices, and variance grids: For each candidate 0≤λjqαm(λj)≤1; if m1<m2, then qαm1(λj)≤qαm2(λj); and qαm(λj)≤Cq′/αm.

[F4]

Isonormal Gaussian white-noise inverse experiment: The Gaussian coordinates are centered with variance one and independent on every finite orthonormal tuple.

[F5]

Monotone convergence for the integral permits passing increasing limits of nonnegative coordinate-square sums through the expectation.

[F6]

Chebyshev-Markov inequality for the integral bounds the probability that a nonnegative random variable is at least a positive level by its expectation divided by that level.

Proof

1.1givenA1F1F2F3F4F5F6algebra

Put cj:=λjqαm(λj)θj and dj:=σsjqαm(λj). By [F3], ∣cj∣≤∣θj∣, so (cj)j∈ℓ2. Also qαm(λj)≤Cq′/αm and ∑jλj<∞ by [F2], so ∑jdj2=σ2∑jλjqαm(λj)2<∞. The partial sums of Q:=∑jdj2ξj2 increase, and [F5] gives EQ=∑jdj2<∞. For each integer r≥1, [F6] gives P(Q≥r)≤EQ/r; since {Q=+∞}⊆{Q≥r} for every r, Q<∞ almost surely. Thus on a measurable event of probability one the coordinate series ∑j(cj+djξj)vj converges in X; define its pointwise limit there and set it to zero on the null complement. The finite partial sums are measurable, and their pointwise limit on this event, extended by zero, is measurable because X is separable. By Parseval and [F5], for each N, E∥x^m−Xm,N∥X2=∑j>NE(cj+djξj)2=∑j>Ncj2+∑j>Ndj2, where [F4] gives Eξj=0 and Eξj2=1. Both deterministic and noise tails tend to zero, so this constructed measurable pointwise limit is the L2(Ω;X) limit. In particular it has finite second moment.

2.1F1F2F3step 1.1algebra

For m1<m2, [F3] gives 0≤1−λjqαm2(λj)≤1−λjqαm1(λj). Squaring these nonnegative terms and summing against θj2 gives Bm22≤Bm12. Moreover, fm2−fm1 has coordinate λj(qαm2−qαm1)θj, whose multiplier equals (1−λjqαm1)−(1−λjqαm2) and lies between zero and 1−λjqαm1; coordinatewise comparison therefore yields ∥fm2−fm1∥X≤Bm1.

2.2F1F2F4step 1.1algebra

Subtracting x in each singular coordinate gives deterministic bias coefficient −(1−λjqαm(λj))θj and centered noise coefficient σsjqαm(λj)ξj. Since Eξj=0 and Eξj2=1 by [F1] and [F4], summing the coordinate second moments and using monotone convergence gives E∥x^m−x∥X2=∑j(1−λjqαm(λj))2θj2+σ2∑jλjqαm(λj)2=Bm2+vm.

3.1F2F3F4step 1.1algebra∎

The centered pairwise noise difference has coordinate variance σ2λj(qαm2(λj)−qαm1(λj))2. By [F3], each difference lies between zero and qαm2(λj); summing its squared value against σ2λj proves vm1,m2≤vm2.

Remarks

The L2-limit definition is needed because white noise is not an Y-valued observation in infinite dimension. The estimator itself is X-valued because its filtered noise covariance has finite trace.

Depends on

Used by

Dependency tree · two levels

66 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