Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Approximation property gives finite-dimensional factorization on compacta

Statement

Let X,Y be real Banach spaces with the approximation property, T:X→Y continuous, K⊂X compact, and ε>0. There are integers J,s≥1, bounded linear maps E:X→RJ and B:Rs→Y, and continuous h:RJ→Rs such that sup⁡x∈K∥T(x)−Bh(E(x))∥Y<ε. In particular E(x)=(ℓj(x))j=1J for bounded linear functionals ℓj, and Bv=∑i=1sviβi for finitely many βi∈Y.

Statement references

Facts & Assumptions

Given: The Banach spaces with AP, the continuous map T, compact K, and error ε>0.

[F1]

AP approximates the identity uniformly on any compact set by bounded finite-rank linear maps (Approximation property and bounded approximation property).

[F2]

A chosen finite basis has bounded linear coordinate maps in both directions (A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space).

Proof

1.1givenchooseconstructalgebra

If K is empty use zero maps. Otherwise consider all pairs (x,ρ) with x∈K and ρ>0 such that ∥T(z)−T(x)∥Y<ε/4 whenever ∥z−x∥X<3ρ. Continuity ensures that the balls B(x,ρ) from this family cover K; take a finite subcover B(xi,ρi). Put δ=min⁡iρi>0. For x∈K and z∈X with ∥z−x∥X<δ, select i with ∥x−xi∥X<ρi; then both x,z lie within 3ρi of xi, so ∥T(z)−T(x)∥Y<ε/2. No compact neighborhood of K is asserted or needed.

2.1step 1.1F1choosealgebra

Apply AP in X to choose bounded finite-rank P with sup⁡K∥Px−x∥X<δ. By step 1.1, sup⁡K∥T(Px)−T(x)∥Y<ε/2. The set T(P(K)) is compact; apply AP in Y to obtain bounded finite-rank Q with sup⁡x∈K∥QT(Px)−T(Px)∥Y<ε/2. Thus QTP approximates T on K within ε. This makes only two AP selections and does not require a sequence, an infinite union of compact sets, or a choice principle for sequences.

3.1step 2.1F2constructalgebra∎

Choose a finite basis α1,…,αJ of P(X). Its coordinate functionals are bounded by [F2]; hence Px=∑jℓj(x)αj with ℓj bounded on X, by composing those functionals with P. Write Rz=∑jzjαj, E(x)=(ℓj(x))j. Choose a finite basis β1,…,βs of Q(Y), with bounded coordinate functionals ci, and put hi(z)=ci(QT(Rz)) and Bv=∑iviβi. Each hi is continuous on all RJ, and BhE=QTP. For a zero-dimensional range use one zero basis vector and the zero coefficient map instead of an actual basis. These formulas prove the stated factorization and complete the proof.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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