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.
Calkin algebra
Definition
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let be an infinite-dimensional complex Banach space and let be the Banach algebra of bounded operators (If (Y) is Banach then (\mathcal B(X,Y)) is Banach, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). Let be the set of compact operators (Compact linear operator). Then:
- is a linear subspace of (Linear combinations of compact operators are compact);
- it is a two-sided ideal: if is compact and are bounded then and are compact (Compositions with a compact operator are compact);
- it is closed in the operator norm: a norm limit of compact operators is compact (Norm limit of compact operators is compact, which is stated under Countable Choice and requires the target to be Banach, as here). More explicitly, if lies in the norm closure, Countable Choice selects with for ; the theorem makes compact;
- and it is proper: the identity is not compact precisely because is infinite-dimensional (On an infinite-dimensional normed space, the identity operator is not compact).
The Calkin algebra of is the quotient algebra
with the quotient vector-space structure, the quotient norm , and the multiplication . Multiplication is well-defined because is a two-sided ideal, and it is submultiplicative: for and representatives , with the bracket in , so taking infima gives . The quotient is complete for the quotient norm by A quotient of a Banach space by a closed subspace is Banach. Its unit is .
Remarks
-
The unit has norm one and is nonzero. The quotient norm satisfies . The quotient norm is definite because is closed, and , so . The unit is idempotent and the quotient norm is submultiplicative, giving . Division by yields , hence .
-
Finite-dimensional is excluded, not normalized away. If then every bounded operator has finite-dimensional range and is compact (Bounded finite rank operators are compact), and the quotient is the zero algebra, which carries no unit in the sense of Unital Banach algebra. The definition therefore restricts to infinite-dimensional ; the finite-dimensional case is the zero quotient and is not called a Calkin algebra here.
-
Where Countable Choice is spent. It is used in the norm-limit compactness theorem, in selecting the approximating sequence above to turn sequential closure into norm closure, and in quotient completeness. The ideal formulas, identity noncompactness and the unit-norm argument introduce no further choice beyond those supplied closed-quotient facts.
-
The Calkin algebra forgets compact perturbations. Two operators have the same coset exactly when they differ by a compact operator, so records the "Fredholm part" of ; this is what makes the Atkinson theorem a statement about invertibility in (Atkinson in Calkin algebra language).
Depends on
- Unital Banach algebra
- A quotient of a Banach space by a closed subspace is Banach
- Norm limit of compact operators is compact
- Compositions with a compact operator are compact
- Linear combinations of compact operators are compact
- If \(Y\) is Banach then \(\mathcal B(X,Y)\) is Banach
- On an infinite-dimensional normed space, the identity operator is not compact
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Compact linear operator
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Bounded finite rank operators are compact
Used by
- Atkinson in Calkin algebra language Corollary
Dependency tree · two levels
47 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.