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.
Approximable operator
Definition
Let and be normed spaces over the same scalar field and let be the space of bounded linear operators with the operator norm (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). Write
for the set of bounded finite-rank operators (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). An operator is approximable when lies in the closure of in the operator-norm metric (Convergence of a sequence in a metric space: iff in , The closure of a nonempty is , equals together with its limit points, and is the smallest closed superset).
The closure is an epsilon statement. The zero operator lies in , since its range admits the empty ordered basis, so is nonempty and the metric-space description of the closure applies: is approximable if and only if for every real there is a bounded finite-rank operator with . No choice principle is used for this equivalence.
Approximable operators are compact, under countable choice. Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()), let be a Banach space (Banach space) and let be approximable. Choosing for every a bounded finite-rank with is a countable selection from nonempty sets, so such operators exist; each is compact (Bounded finite rank operators are compact) and , so is compact by the norm-limit theorem (Norm limit of compact operators is compact, Compact linear operator).
No converse is asserted here. The statement that every compact operator into is approximable is the approximation-property question for the target ; it is not a consequence of the definition and is not claimed. The companion page records the implication that holds when has the approximation property, and the distinction between compact and approximable operators for a general Banach target is left open.
Depends on
- A bounded linear operator between normed spaces
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- The spaces \(\mathcal B(X,Y)\) and \(\mathcal B(X)\) of bounded linear operators
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Bounded finite rank operators are compact
- Norm limit of compact operators is compact
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Banach space
- Compact linear operator
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- The closure of a nonempty $A$ is $\{x : d(x,A) = 0\}$, equals $A$ together with its limit points, and is the smallest closed superset
Used by
Dependency tree · two levels
61 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
- Theo Bühler and Dietmar Salamon, Functional Analysis — §4.2 p.188, Exercise 4.29 and the surrounding approximation discussion (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, version November 17, 2017 — §3.1, approximation by finite rank operators (standard reference, not scraped)