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 be real Banach spaces with the approximation property, continuous, compact, and . There are integers , bounded linear maps and , and continuous such that . In particular for bounded linear functionals , and for finitely many .
Statement references
Facts & Assumptions
Given: The Banach spaces with AP, the continuous map , compact , and error .
AP approximates the identity uniformly on any compact set by bounded finite-rank linear maps (Approximation property and bounded approximation property).
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
If is empty use zero maps. Otherwise consider all pairs with and such that whenever . Continuity ensures that the balls from this family cover ; take a finite subcover . Put . For and with , select with ; then both lie within of , so . No compact neighborhood of is asserted or needed.
Apply AP in to choose bounded finite-rank with . By step 1.1, . The set is compact; apply AP in to obtain bounded finite-rank with . Thus approximates on 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.
Choose a finite basis of . Its coordinate functionals are bounded by [F2]; hence with bounded on , by composing those functionals with . Write , . Choose a finite basis of , with bounded coordinate functionals , and put and . Each is continuous on all , and . 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
- Kovachki et al., Neural Operator, Lemma 22 (standard reference, not scraped)