Alphabeta Math
RemarkRemark: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 controls finite rank density in compact operators

Remark

Let X be a normed space and let Y be a Banach space with the approximation property (Approximation property and bounded approximation property). Then every compact operator T:XY (Compact linear operator) is approximable (Approximable operator), that is, T lies in the operator-norm closure of the bounded finite-rank operators XY.

The argument is short and worth recording. The set C:=T(BX)Y is compact, because T is compact. For a real ε>0 the approximation property of Y supplies a bounded finite-rank operator R:YY with supcCRcc<ε. Then RT is a bounded operator whose range lies in the finite-dimensional range of R, hence RT is finite rank, and for every xX with x1 the point Tx lies in C, so RTxTx<ε; taking the supremum over the closed unit ball gives RTTε (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, A bounded linear operator between normed spaces). Since ε>0 was arbitrary, T is in the norm closure of the bounded finite-rank operators, which is exactly approximability.

This is not a universal finite-rank approximation theorem for arbitrary Banach targets. The argument uses the approximation property as a hypothesis; without it, nothing here produces finite-rank operators close to T on the compact set C. In particular no counterexample for a target Y failing the approximation property is asserted, and the converse implication — that approximability of every compact operator into Y forces the approximation property of Y — is a separate statement that is neither proved nor used here.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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