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 and be normed spaces over the same scalar field , 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 Real and complex scalar conventions for normed spaces. A linear map (Linear map between vector spaces over the same field) is a compact operator when the image of every bounded subset of (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) has compact closure in (Open cover, subcover, compact metric space, and compact subset of a metric space); explicitly, for every bounded the closure in is a compact subset of . The set of compact operators is written .
The closed unit ball suffices. Put (Open ball, closed ball and sphere in a metric space). Then is compact if and only if is a compact subset of .
Indeed, if is compact then is bounded, because while is bounded and a subset of a bounded set is bounded, so has compact closure. Conversely assume compact and let be bounded. If then , whose closure is empty and hence compact. Otherwise for some and real , so every satisfies ; if then and if then , so in either case . Scalar multiplication by is continuous (Vector addition and scalar multiplication are continuous in a normed space), so is a compact subset of (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 is a closed subset of a compact set, hence compact, and is compact.
A compact operator is bounded. If is compact then the compact set is bounded (A compact subset of a metric space is closed and bounded), so there is a real with for every and hence for every ; thus 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
- A bounded linear operator between normed spaces
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Open ball, closed ball and sphere in a metric space
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- Real and complex scalar conventions for normed spaces
- Linear map between vector spaces over the same field
- 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
- A compact subset of a metric space is closed and bounded
- Vector addition and scalar multiplication are continuous in a normed space
Used by
- Atkinson in Calkin algebra language Corollary
- Compact operator iff approximation numbers tend to zero Corollary
- Finite rank operators are norm dense in compact Hilbert space operators Corollary
- Lambda identity minus compact has index zero Corollary
- Orthonormal eigenbasis for a compact self adjoint operator Corollary
- Spectrum of a compact operator is countable with only zero as possible accumulation Corollary
- A compact operator can have nondense range Counterexample
- Compact does not imply Hilbert Schmidt Counterexample
- Compactness is not preserved by strong operator limits Counterexample
- Identity is compact iff the space is finite dimensional Counterexample
- Absolute value and singular values of a compact operator Definition
- Approximable operator Definition
- Calkin algebra Definition
- Relative compactness with respect to an operator Definition
- Trace class operator Definition
- A Hilbert–Schmidt kernel operator is compact on L two Example
- Continuous kernel integral operator is compact on c of an interval Example
- Diagonal operator on ell p is compact iff diagonal tends to zero Example
- Diagonal Schatten class criteria on ell two Example
- Integral operator trace under a valid diagonal hypothesis Example
- Volterra operator is Hilbert Schmidt and quasinilpotent Example
- A compact remainder estimate forces closed range Lemma
- Bounded finite rank operators are compact Lemma
- Compositions with a compact operator are compact Lemma
- Kernel of identity minus compact is finite dimensional Lemma
- Linear combinations of compact operators are compact Lemma
- Norm point of a compact self adjoint operator is an eigenvalue up to sign Lemma
- Nuclear series characterizes trace norm Lemma
- Positive square root of a compact positive operator Lemma
- Range of identity minus compact is closed Lemma
- Riesz Schauder ascent and descent stabilize Lemma
- Singular values equal approximation numbers Lemma
- Approximation property controls finite rank density in compact operators Remark
- Schatten p classes Remark
- Atkinson Theorem
- Compact operator sends weakly convergent sequences to norm convergent sequences Theorem
- Fredholm alternative for identity minus compact Theorem
- Fredholm index is locally constant Theorem
- Fredholm index is stable under compact perturbations Theorem
- Hilbert–Schmidt operators are compact Theorem
…and 8 more results.
Dependency tree · two levels
60 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.183, Definition 4.20 (standard reference, not scraped)