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.
Range of identity minus compact is closed
Statement
Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). Let be a Banach space over or , let be a compact operator (Compact linear operator) and put . Then is a closed subspace of , and there is a real with
the distance being the quotient seminorm of The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M)).
Facts & Assumptions
is closed if and only if there is a real with for every , under DC for the bounded linear map between Banach spaces (Closed range is equivalent to a quotient estimate); here is the quotient seminorm (The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M))).
is bounded and bounded linear operators are continuous (A bounded linear operator between normed spaces, For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent); DC implies Countable Choice (Dependent choice implies countable choice), and under DC a compact operator maps bounded sequences to sequences with convergent subsequences (Sequential characterization of compact operators, Sequences of reals: bounded, eventually, frequently, tails, subsequences, A strictly increasing index map satisfies ).
In a metric space, limits of sequences are unique (A sequence in a metric space has at most one limit, Convergence of a sequence in a metric space: iff in ); the distance to a fixed set is 1-Lipschitz, (The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M))).
Proof
Given: , a Banach space over or , a compact operator , and , .
is a closed linear subspace: is bounded hence continuous by [A2], so with gives , whence by [A3].
If the estimate of [A1] fails for every , then for each fixed the set is nonempty: taking gives with , so the distance is positive; choose with by the definition of the infimum, and set . Scaling the distance gives , the norm bound holds, and because .
Assume the estimate fails. By Countable Choice in [A2], select for every as in [step 1.2], and put . The sequence lies in the bounded set , and is compact, so by [A2] there is a strictly increasing with for some .
Along that subsequence, , because by [step 1.2] and by [step 2.1].
The limit lies in : by [step 3.1] and the continuity of , .
But this contradicts : by [A3] the numbers converge to , so , whereas forces .
Hence the estimate of [A1] holds for some real , and then [A1] gives that is closed.
Depends on
- Compact linear operator
- A bounded linear operator between normed spaces
- For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent
- Banach space
- Closed range is equivalent to a quotient estimate
- The quotient seminorm \(\|x+M\|_{X/M}=\inf_{m\in M}\|x+m\|=\operatorname{dist}(x,M)\)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Dependent choice implies countable choice
- Sequential characterization of compact operators
- Convergence of a sequence in a metric space: $x_k \to x$ iff $d(x_k, x) \to 0$ in $\mathbb{R}$
- A sequence in a metric space has at most one limit
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- A strictly increasing index map satisfies $n_k \ge k$
Used by
Dependency tree · two levels
71 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.3, Lemma 4.39 (closed range of I minus compact) (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, version November 17, 2017 — §6.5, Riesz–Schauder theory (standard reference, not scraped)