Alphabeta Math
TheoremStatement: 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.

SOLIT oracle risk bound and spectral rates

Statement

Assume Countable Choice. Let T:X→Y be an injective compact Hilbert–Schmidt operator of infinite rank between separable real Hilbert spaces. Write A:=T∗T, and list its positive eigenvalues with multiplicity as λ1≥λ2≥⋯>0, where λ1=∥A∥ and ∑jλj<∞. Observe the weak Gaussian experiment Yx(g)=⟨Tx,g⟩Y+σZ(g),g∈Y, where σ>0 is known and Z:Y→L2(Ω) is centered and linear with covariance E[Z(g)Z(h)]=⟨g,h⟩Y, and has independent standard-normal values on every finite orthonormal tuple.

Let φ:[0,∞)→[0,∞) be continuous and strictly increasing with φ(0)=0. Assume u↦uφ−1(u) is convex for 0≤u≤φ(λ1)2, where φ−1 is the inverse on the range of φ. For ρ>0, define the source ball Wφ(ρ):={φ(A)w:w∈X, ∥w∥X≤ρ}. Assume x∈Wφ(ρ). Let qα:[0,λ1]→[0,∞) be an ordered filter indexed by α∈A⊂(0,∞), with 0 an accumulation point of A, such that for finite Cq′,Cφ>0 and every t∈[0,λ1] and α∈A, 0≤αqα(t)≤Cq′,0≤tqα(t)≤1, qα(t)≤qα~(t) whenever α~<α, and sup⁡0≤t≤λ1φ(t)(1−tqα(t))≤Cφφ(α).

Define Σ(t):=#{j:λj≥t}. Assume there is a continuous S:(0,λ1]→[0,∞) with lim inf⁡α↓0S(α)/Σ(α)>0, αS(α)→0, and α−1∫0αΣ(t) dt≤CSS(α) for some CS>0 for every candidate α∈A∩(0,λ1].

Let α0>α1>⋯ be candidates in A∩(0,λ1], with the initial candidate α0 fixed independently of σ, and set vm:=σ2∑j≥1λjqαm(λj)2, and assume v0>0 and 1<θ1≤vm/vm−1≤θ2<∞ for m≥1. Set mmax⁡:=min⁡{m∈N0:vm≥1}. Fix a positive singular system (sj,vj,uj) with Tvj=sjuj and λj=sj2, set θj=⟨x,vj⟩X and ξj=Z(uj), and define x^m as the L2(Ω;X) limit with coordinates ⟨x^m,vj⟩X=λjqαm(λj)θj+σsjqαm(λj)ξj. For m1<m2, define the pairwise variance vm1,m2:=σ2∑j≥1λj(qαm2(λj)−qαm1(λj))2. Let Gm1,m2:=(x^m2−Ex^m2)−(x^m1−Ex^m1) be the centered estimator difference, and for a>0 set zm1,m2(a):=inf⁡{z≥0:P(∥Gm1,m2∥X/σ>z)≤e−a}. For fixed β,γ>0, define ηm1,m2:=σzm1,m2(2(1+γ)log⁡(vm1+1/v0))+βvm1,m2 for m1<m2. Let m^ be the smallest m1∈{0,…,mmax⁡} such that ∥x^m1−x^m2∥X≤ηm1,m2 for every m2 with m1<m2≤mmax⁡, and set α^=αm^. Define m∗ as the smallest m for which every pair m≤m1<m2≤mmax⁡ satisfies ∥Ex^m1−Ex^m2∥X2≤β2vm1,m2, and put Rm∗:=E∥x^m∗−x∥X2. Write M:=mmax⁡, k:=m∗, bm:=∥Ex^m−x∥X, and Rm:=bm2+vm, so Rk=Rm∗. Put D0:=0, and for k≥1 put Dk:=(1+β)vk+4(1+γ)uklog⁡(vk/v0),um:=σ2sup⁡jλjqαm(λj)2. If k<M, define pm:=min⁡{1,(M−m+1)(v0/vm)2(1+γ)}(k<m≤M),Pk:=min⁡{1,(M−k)(v0/vk+1)2(1+γ)}, Ak:=3∑m=k+1Mvmpm,Bk:=23Rk(v0/vk)1+γ∑m=k+1MM−m+1(vk/vm)γ. If k=M, set Pk=Ak=Bk=0. Then the unchanged pairwise-quantile selector satisfies the finite oracle inequality E∥x^m^−x∥X2≤(Rk+Dk)2+min⁡{(bkPk+Ak)2,Bk}. In particular, put δ:=12(1+γ),K:=θ1θ1−1+11−θ1−γ,WM:={v0Mδ,M≥1,0,M=0. Then Ak≤3KWM and Bk≤23Mθ1γ−1(v0/vk)1+γRk, and a rate-oriented consequence is E∥x^m^−x∥X2≤(Rk+Dk)2+2bk2+23KWM. When M=0 the selected index is identically zero and its risk is exactly R0. When k=0, the first term in both displayed oracle bounds is R0 because D0=0; when k=M, the late-selection term vanishes. The bounds retain the pairwise quantiles in the stated rule.

For the rate conclusions as σ2↓0, assume additionally that λ1≤e−1. In both rate regimes let φ(t)=tν(−log⁡t)−τ for t∈(0,λ1], extend it by φ(0)=0, take the natural logarithm, and assume the displayed φ satisfies the index-function, convexity, and filter-qualification hypotheses above; here either ν>0,τ∈R or ν=0,τ>0.

If λj≍j−a with a>1, S(α)≍α−1/a, and vm≥cvσ2S(αm)/αm for some cv>0, then for some constant C>0, sup⁡x∈Wφ(ρ)E∥x^m^−x∥X2≤C(σ2)2ν2ν+1/a+1(−log⁡σ2)−2τ(1+1/a)2ν+1+1/a. If instead λj≍j−ae−bjϑ with a∈R, b>0, and 0<ϑ≤12, assume also S(α)≍(−log⁡α)1/ϑ and vm≥cvσ2S(αm)/((−log⁡αm)αm) for some cv>0; then for some C>0, sup⁡x∈Wφ(ρ)E∥x^m^−x∥X2≤C(σ2)2ν2ν+1(−log⁡σ2)2ν/ϑ−2τ2ν+1. The severe-rate assertion requires exactly 0<ϑ≤12; the source does not establish adaptive-minimax optimality of the polynomial-smoothness severe rate. For spectral cut-off filters, the uniform geometric-variance candidate condition may fail when ϑ>1. When ν=0, both displayed rates simplify to (−log⁡σ2)−2τ.

Facts & Assumptions

Given: Countable Choice, the weak experiment, all ordered-filter, source, surrogate, grid and selector hypotheses in the Statement, and the additional stated hypotheses when a rate is asserted.

[A1]

The Axiom of Countable Choice (ACω) supplies the fixed countable spectral coordinates; the finite minima and the explicit integer choices below require no further choice.

[F1]

Risk decomposition and monotone bias for ordered spectral filters gives Rm=bm2+vm, nonincreasing bm, the pairwise bias bound ba,b≤ba, and va,b≤vb for a<b.

[F2]

SOLIT parameter choice on a geometric-variance grid supplies the unchanged pairwise-quantile acceptance rule and the smallest accepted index. The last candidate is always accepted.

[F3]

Gaussian series norm tails and fourth moments gives E∥G∥4≤3(E∥G∥2)2, the norm-quantile bound Q(t)≤v+2ut, and the upper-tail inequality at that quantile for the given countable Gaussian coordinates.

[F4]

Ordered spectral filters, source indices, and variance grids gives the nonnegative coordinate ordering, the geometric variance ratios, and source qualification. Spectral-index source balls for compact operators and Compact spectral filters, source conditions, and qualification identify the source multipliers.

[F5]

Monotone convergence for the integral permits summation and integration of the nonnegative coordinate terms.

[F6]

Holder's inequality for integrals, including the endpoint cases gives scalar Cauchy–Schwarz on the probability space, including E[UV]≤(EU2)1/2(EV2)1/2 for square-integrable nonnegative U,V.

[F7]

Minkowski's inequality for integrals, including p=∞ gives the L2 triangle inequality for scalar random variables; applied to Hilbert-valued errors through their norm functions, it is the mean-square triangle inequality.

Proof

1.1givenA1F1F2algebra

Work in the supplied singular coordinates, and write fm=Ex^m, εm=x^m−fm, and ba,b=∥fb−fa∥X. By [F1] all these variables have finite second moments and Rm=bm2+vm. Each finite observed-data sum in [F2] is a measurable X-valued random element. For each fixed candidate, its Cauchy set Cm=⋂r≥1⋃N≥1⋂p,q≥N{∥x^m,pobs−x^m,qobs∥X≤1/r} is a measurable event, since it is a countable combination of measurable pairwise-distance events; completeness of X makes it the convergence event. Its limit on Cm, extended by 0X outside Cm, is measurable as a pointwise limit into separable X. Under the observation law, yj=sjθj+σξj, so the pointwise construction in [F1] identifies this pointwise limit with the L2 estimator almost surely; the finitely many candidates share a full-probability agreement event. Thus the finite comparison conditions are measurable, and [F2] ensures an accepted index exists. Hence m^ is a measurable finite-valued index. Fix k=m∗; its defining condition gives ba,b≤βva,b whenever k≤a<b≤M.

1.2givenF4F5algebra

For later use, qualification gives bm2≤ρ2Cφ2φ(αm)2. The filter bounds give λqα(λ)2≤Cq′/α and λqα(λ)2≤(Cq′)2λ/α2. With C=max⁡{Cq′,(Cq′)2}, splitting eigenvalues at α and summing nonnegative terms therefore gives VT,q(α):=∑jλjqα(λj)2≤Cα2(αΣ(α)+∑λj<αλj)=Cα2∫0αΣ(t) dt≤CCSS(α)/α. The equality follows by integrating each indicator 1{t≤λj}; [F5] justifies the interchange. Further um≤Cq′σ2/αm, since λjqαm(λj)≤1.

2.1F1F3F4step 1.1algebra

The centered difference Ga,b has coordinate variances σ2λj(qαb(λj)−qαa(λj))2. By nonnegative coordinate ordering their sum and supremum satisfy va,b≤vb and ua,b≤ub. Applying [F3] to their squared weights gives σza,b(t)≤va,b+2ua,bt,E∥εm∥4≤3vm2. Also the probability of exceeding the actual pairwise quantile is at most e−t, including a degenerate difference. These are statements about the supplied normal sequence; no new infinite product law or general Gaussian concentration theorem is needed.

2.2givenF4step 1.2algebra

For the rates let s=σ2↓0 and L=log⁡(1/s). The initial variance is v0=sVT,q(α0) with a fixed positive factor, and the geometric lower ratio implies M≤1+log⁡(1/v0)/log⁡θ1=O(L). In the mild case put D=2ν+1+1/a, t=s1/DL2τ/D and r=s2ν/DL−2τ(1+1/a)/D. In the severe case put p=1/ϑ≥2, D=2ν+1, t=s1/DL(2τ+p)/D and r=s2ν/DL(2νp−2τ)/D. In either case log⁡(1/t)≍L, r→0, r/s→∞, and direct substitution gives φ(t)2≍sS(t)/t≍r. All implicit constants in the rest of the argument are independent of the truth in the fixed source ball and of sufficiently small s.

3.1F2F7step 1.1step 2.1algebra

On {m^≤k}, acceptance gives ∥x^m^−x^k∥≤ηm^,k when m^<k, and the difference is zero when equality holds. For m<k, xm=2(1+γ)log⁡(vm+1/v0)≤2(1+γ)log⁡(vk/v0), so step 2.1 bounds every ηm,k by Dk. Minkowski's inequality in L2(Ω) [F7], applied to the norm functions of the two Hilbert-valued errors, consequently bounds the early-selection contribution by (Rk+Dk)2. For k=0, this uses the identically zero difference and hence D0=0.

3.2F2step 1.1step 2.1algebra

For m>k, the event {m^=m} implies rejection of m−1. Its oracle bias bound from step 1.1 shows that a rejecting comparison with ℓ≥m must satisfy ∥Gm−1,ℓ∥>σzm−1,ℓ(xm−1). The union bound over M−m+1 such comparisons and the quantile-tail property from step 2.1 therefore give P(m^=m)≤pm. Similarly {m^>k} implies rejection of k, so P(m^>k)≤Pk. Here e−xm−1=(v0/vm)2(1+γ) exactly.

3.3givenstep 1.2step 2.2algebrachoose

Let j be the first candidate with vj≥r. For small s, v0<r<1, so this index exists and r≤vj≤θ2r. Step 1.2 implies r≤CsS(αj)/αj. First αj→0: otherwise a subsequence bounded away from zero has bounded S(αj)/αj, contradicting r/s→∞. In the mild case the function S(α)/α is comparable to α−1−1/a, so the last inequality and r≍st−1−1/a give αj≤C′t. In the severe case it is comparable to h(α)=α−1(log⁡(1/α))p. For any fixed A>1, h(At)/h(t)→1/A as t↓0; since h is decreasing for small positive arguments, choosing A larger than the fixed comparison constant gives the same conclusion αj≤C′t. Qualification and φ(C′t)2≍φ(t)2 now give bj2≤C′′r.

4.1F1F6F7step 3.1step 3.2step 2.1algebra

Scalar Cauchy–Schwarz [F6] and step 2.1 give E[∥εm∥21{m^=m}]≤3vmpm. Summing gives a late selected-noise second moment at most Ak. By [F1], the corresponding selected bias has mean-square norm at most bkPk. Minkowski's inequality [F7] thus bounds the late risk by (bkPk+Ak)2. Alternatively, ∥εm+fm−x∥2≤2∥εm∥2+2bk2 and pm≤pm give a late risk bound 23∑m>k(vm+bk2)pm. Since vm+bk2≤(vm/vk)Rk, dropping the minimum in pm yields exactly Bk. Together with step 3.1 these prove the first finite oracle inequality. If k=M, both late sums are empty.

4.2F1F4F7step 1.1step 2.2step 3.3algebrachoose

Put cβ=β2(θ1−1)2>0 and choose a fixed nonnegative integer J with θ1J≥C′′/cβ. For small s, θ2J+1r<1, so the infinite candidate sequence has ℓ=j+J<M, vℓ≤θ2J+1r, and bℓ2≤C′′r≤cβvℓ. For every ℓ≤a<b, monotone bias gives ba,b2≤ba2≤cβva. The reverse triangle inequality for the square-summable noise coefficient vectors follows from [F7] with counting measure and gives va,b≥(vb−va)2≥(θ1−1)2va. Thus ba,b2≤β2va,b and k≤ℓ. If k<ℓ, the oracle property implies E∥x^k−x^ℓ∥2≤(1+β2)vk,ℓ≤(1+β2)vℓ. Hence Rk≤2(1+β2)vℓ+2Rℓ≤Cr; the case k=ℓ is immediate. In particular vk≤Cr and log⁡(vk/v0)≤CL.

5.1F4step 4.1algebra

Suppose M≥1 and put w=v0Mδ. For f(v)=vmin⁡{1,M(v0/v)1+γ} one has f(v)=v for v≤w and f(v)=w1+γv−γ for v>w. The geometric variance lower ratio gives ∑vm≤wvm≤θ1w/(θ1−1) and ∑vm>wvm−γ≤w−γ/(1−θ1−γ), by summing the backward and forward geometric series from the respective last and first indices. Thus Ak≤3Kw. Also vm/vk≥θ1m−k and M−m+1≤M in the definition of Bk prove its stated simpler bound. The inequality (a+b)2≤2a2+2b2 applied to the first late alternative in step 4.1 gives the rate-oriented oracle bound. If M=0, the only index is zero, its risk equals R0, and all late sums vanish as stipulated.

5.2givenstep 1.2step 2.2step 4.2algebra

In the mild case the stated lower variance bound gives vk≥csαk−1−1/a. Combined with step 4.2 and r≍st−1−1/a, this yields αk≥c′t. Therefore step 1.2 gives uklog⁡(vk/v0)≤CsL/t=o(r), because Lt1/a→0. It follows that Dk2≤C(vk+uklog⁡(vk/v0))≤Cr for k≥1, while D0=0 handles k=0.

5.3givenstep 1.2step 2.2step 4.2algebra

In the severe case put H=log⁡(1/t)≍L. If αk≥t, then αk≥t/H for small s. If αk<t, the lower variance bound and S(α)≍(log⁡(1/α))p give csαk−1Hp−1≤vk≤Cr≤Cst−1Hp, so again αk≥c′t/H. Hence uklog⁡(vk/v0)≤CsHL/t≤CsH2/t≤CsHp/t≍Cr, using exactly p≥2. Consequently Dk2≤Cr in this case also, with D0=0 as before.

6.1step 5.1step 2.2step 4.2step 5.2step 5.3algebra∎

By step 2.2, WM=O(sLδ)=o(r): when ν>0, r/s has a strictly positive power of 1/s multiplied by a fixed logarithmic power; when ν=0 and τ>0, r=L−2τ. The rate-oriented oracle bound from step 5.1, together with Rk≤Cr, bk2≤Rk and the two rate estimates just proved, therefore gives the asserted uniform risk upper bound Cr in each regime. Substituting the explicit expressions for r from step 2.2 gives exactly the two displayed rates and their ν=0 specializations. The severe proof uses ϑ≤1/2 at step 5.3 and asserts only the stated upper rate, preserving the given qualification and grid hypotheses. This completes both the finite oracle and rate conclusions.

Remarks

The finite oracle bound accounts explicitly for the number of pairwise comparisons. Its proof and the rate argument above use the specified pairwise selector throughout. The source's sharper displayed oracle constants are not used as a premise.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by SOLIT parameter choice on a geometric-variance grid.

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