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

Conditional modulus on a power source ball

Statement

Assume Countable Choice. Let K:X→Y be compact between real or complex Hilbert spaces over the same scalar field and ν,ρ>0. For every δ≥0, εK(Xν,ρ(K),δ)≤δν/(ν+1)ρ1/(ν+1). For every positive singular value sj with right singular vector vj, equality holds at δj=ρsjν+1, witnessed by xj=ρsjνvj. If K has infinite rank, these δj form a null sequence; if K has finite positive rank, equality is asserted only at its finitely many positive singular values; if K=0, the source ball and modulus are {0} and 0.

Facts & Assumptions

Given: Countable Choice, compact K:X→Y between real or complex Hilbert spaces over the same scalar field, ν,ρ>0, the power source ball, its centered modulus, and δ≥0.

[A1]

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

[F1]

Power source ball: Xν,ρ(K)={∣K∣νw:∥w∥X≤ρ}.

[F2]

Centered conditional modulus of continuity: εK(M,δ) is the supremum of ∥x∥X over x∈M with ∥Kx∥Y≤δ.

[F3]

Index source elements are minimum-norm solutions: Every element of the power source ball lies in N(K)⊥.

[F4]

Spectral interpolation for power source balls: If x=∣K∣νw, then ∥x∥X≤∥Kx∥Yν/(ν+1)∥w∥X1/(ν+1).

[F5]

Singular value decomposition for compact operators and Absolute value and singular values of a compact operator: Each positive singular value sj has a unit right singular vector vj with ∣K∣vj=sjvj and ∥Kvj∥Y=sj; an infinite positive singular sequence tends to zero.

Proof

1.1givenF2F3algebra

If δ=0 and x belongs to the centered-modulus set, then Kx=0. By [F3], x∈N(K)⊥ as well, so x=0 and εK(Xν,ρ(K),0)=0. If K=0, [F3] likewise forces every member of the power source ball to be zero, so the asserted bound holds with no positive singular direction.

1.2givenA1F1F2F4choose

Suppose δ>0 and let x be any element of the centered-modulus set. By [F1], choose w∈X with x=∣K∣νw and ∥w∥X≤ρ. Applying [F4] and using ∥Kx∥Y≤δ gives ∥x∥X≤δν/(ν+1)ρ1/(ν+1); taking the supremum over the centered-modulus set proves the bound.

2.1givenA1step 1.1step 1.2F1F2F5constructalgebra∎

Fix a positive singular value sj and its unit right singular vector vj from [F5]. Set wj=ρvj and xj=∣K∣νwj=ρsjνvj. Then ∥Kxj∥Y=ρsjν+1=δj and ∥xj∥X=ρsjν=δjν/(ν+1)ρ1/(ν+1). Thus xj is feasible in the centered-modulus supremum at δj and attains the upper bound from step 1.2. If there are infinitely many positive singular values, compactness gives sj→0 and hence δj→0; finite positive rank gives only the stated finite list, while K=0 was handled in step 1.1.

Depends on

Used by

Dependency tree · two levels

51 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