Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 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.

Spectral interpolation for power source balls

Statement

Assume Countable Choice. Let K:X→Y be compact between real or complex Hilbert spaces over the same scalar field, let ν>0 and w∈X, and put x=∣K∣νw. Then ∥x∥X≤∥Kx∥Yν/(ν+1)∥w∥X1/(ν+1).

Facts & Assumptions

Given: Countable Choice, compact K:X→Y between real or complex Hilbert spaces, ν>0, w∈X, and x=∣K∣νw.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed by the compact singular-value decomposition supplier.

[F1]

Singular value decomposition for compact operators: The positive singular system has orthonormal right and left singular vectors vj,uj with ∣K∣vj=sjvj and Kvj=sjuj, and the closed span of the vj is N(K)⊥.

[F2]

Power source ball: The power source multiplier is ∣K∣ν=(K∗K)ν/2.

[F3]

Compact spectral filters, source conditions, and qualification: The compact spectral multiplier acts on an eigenvector by its scalar function, and the power multiplier has value zero at the zero eigenvalue.

Proof

1.1givenA1F1F2F3construct

Let J index the positive singular values in [F1]. Write w=w0+∑j∈Jwjvj in norm, with w0∈N(K). By [F2]–[F3], x=∑j∈Jsjνwjvj and Kx=∑j∈Jsjν+1wjuj, with norm-convergent expansions. For each finite F⊆J, orthonormality gives the squared norms of the partial sums as the sums of squared coefficients; taking limits by continuity of the norm gives ∥x∥X2=∑j∈Jcj and ∥Kx∥Y2=∑j∈Jaj. The same finite-sum identity and w0⊥vj give ∥w∥X2=∥w0∥X2+∑j∈Jbj≥∑j∈Jbj, where cj=sj2ν∣wj∣2, aj=sj2ν+2∣wj∣2, and bj=∣wj∣2.

1.2givenF4algebra

Put θ=ν/(ν+1)∈(0,1). For a finite F⊆J, set AF=∑j∈Faj, BF=∑j∈Fbj, and CF=∑j∈Fcj. If AF=0 or BF=0, then every wj with j∈F is zero because sj>0, so CF=0. Otherwise, for j∈F put pj=aj/AF and qj=bj/BF. The scalar inequality tθ≤θt+1−θ holds for t≥0: for t>0 set g(t)=θt+1−θ−tθ. By [F4], g′(t)=θ(1−tθ−1). If 0<t<1, strict increase of u↦u1−θ gives t1−θ<11−θ=1; by [F4] and inverse order this implies tθ−1>1 and g′(t)<0. If t>1, the inequalities reverse and g′(t)>0. The mean value theorem then gives g(t)≥g(1)=0 for every t>0, while g(0)=1−θ>0. If qj>0, apply the scalar inequality to t=pj/qj to obtain pjθqj1−θ≤θpj+(1−θ)qj; if qj=0, the same inequality is immediate. Since cj=ajθbj1−θ, summing and using ∑pj=∑qj=1 gives CF≤AFθBF1−θ.

2.1givenstep 1.1step 1.2algebra∎

Exhaust J by its first n indices when J is infinite, and take F=J when it is finite; if J is empty, all three sums in step 1.1 are zero. Passing to the limit in step 1.2 gives ∥x∥X2≤∥Kx∥Y2θ∥w∥X2(1−θ). Taking nonnegative square roots and substituting θ=ν/(ν+1) proves the claimed inequality.

Depends on

Used by

Dependency tree · two levels

75 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