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

Compact linear operator

Definition

Let X and Y be normed spaces over the same scalar field K, read in the real case from A norm on a real vector space, the induced metric, and the dictionary with the metric axioms and in the complex case from Complex norm and complex normed space. A linear map T:X→Y (Linear map between vector spaces over the same field) is a compact operator when the image of every bounded subset of X (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) has compact closure in Y (Open cover, subcover, compact metric space, and compact subset of a metric space); explicitly, for every bounded A⊆X the closure T(A)‾ in Y is a compact subset of Y. The set of compact operators X→Y is written K(X,Y). The metric used here is d(x,y)=∥x−y∥, supplied over R by A norm on a real vector space, the induced metric, and the dictionary with the metric axioms and over C by Realification preserves a complex norm and its metric.

The closed unit ball suffices. Put B‾X:={x∈X:∥x∥≤1} (Open ball, closed ball and sphere in a metric space). Then T is compact if and only if T(B‾X)‾ is a compact subset of Y.

Indeed, if T is compact then B‾X is bounded, because B‾X⊆B(0,2) while B(0,2) is bounded and a subset of a bounded set is bounded, so T(B‾X) has compact closure. Conversely assume T(B‾X)‾ compact and let A⊆X be bounded. If A=∅ then T(A)=∅, whose closure is empty and hence compact. Otherwise A⊆B(x0,r) for some x0∈X and real r>0, so every x∈A satisfies ∥x∥≤∥x0∥+r=:R; if R>0 then A⊆R B‾X and if R=0 then A⊆{0}, so in either case T(A)⊆R T(B‾X)‾. Scalar multiplication by R is continuous (Vector addition and scalar multiplication are continuous in a normed space), so R T(B‾X)‾ is a compact subset of Y (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism), hence closed (A compact subset of a metric space is closed and bounded); therefore T(A)‾⊆R T(B‾X)‾ is a closed subset of a compact set, hence compact, and T is compact.

A compact operator is bounded. If T is compact then the compact set T(B‾X)‾ is bounded (A compact subset of a metric space is closed and bounded), so there is a real C≥0 with ∥Tx∥≤C for every x∈B‾X and hence ∥Tx∥≤C∥x∥ for every x∈X; thus T is a bounded linear operator (A bounded linear operator between normed spaces). This is a consequence of compactness, not a hypothesis of the definition.

Depends on

Dependency tree · 2 levels

Sources