Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Approximable operator

Definition

Let X and Y be normed spaces over the same scalar field and let B(X,Y) be the space of bounded linear operators with the operator norm (The spaces B(X,Y) and 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

F(X,Y):={R∈B(X,Y):R(X) admits an ordered basis of finite length}

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 T∈B(X,Y) is approximable when T lies in the closure of F(X,Y) in the operator-norm metric (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in 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).

The closure is an epsilon statement. The zero operator lies in F(X,Y), since its range {0} admits the empty ordered basis, so F(X,Y) is nonempty and the metric-space description of the closure applies: T is approximable if and only if for every real ε>0 there is a bounded finite-rank operator R with ∥T−R∥<ε. 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 (ACω)), let Y be a Banach space (Banach space) and let T be approximable. Choosing for every n∈N a bounded finite-rank Rn with ∥T−Rn∥<1/(n+1) is a countable selection from nonempty sets, so such operators exist; each Rn is compact (Bounded finite rank operators are compact) and ∥Rn−T∥→0, so T 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 Y is approximable is the approximation-property question for the target Y; it is not a consequence of the definition and is not claimed. The companion page records the implication that holds when Y has the approximation property, and the distinction between compact and approximable operators for a general Banach target is left open.

Depends on

Used by

Dependency tree · two levels

62 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