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.
Atkinson
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let and be Banach spaces over the same scalar field and let be a bounded linear operator (A bounded linear operator between normed spaces). Then is Fredholm (Fredholm operator cokernel and index) if and only if there is a bounded linear such that both and are compact (Compact linear operator).
Facts & Assumptions
If is Fredholm, the splitting lemma provides a bounded for which has finite-dimensional range of dimension at most and has finite-dimensional range of dimension at most (Fredholm splitting and parametrix); a bounded finite-rank operator is compact (Bounded finite rank operators are compact, Fredholm operator cokernel and index).
Under DC, if for a compact and some real , then is finite dimensional and is closed (A compact remainder estimate forces closed range, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, Banach space); supplies DC (AC supplies the countable and dependent choices used in Banach integration).
Transposition is additive with and (Transposition reverses composition, The transpose of a bounded operator); a compact operator between Banach spaces has compact transpose (Schauder compact adjoint theorem); the kernel of with compact is finite dimensional (Kernel of identity minus compact is finite dimensional).
For a bounded , and (Elementary kernel and range annihilator identities); for closed the map , , is a linear isometric bijection (The dual of a quotient is its annihilator, The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M)).
For nonzero in a normed space there is with and (Every nonzero vector has a norming functional), so the dual separates points (The dual space separates points of a normed space); a subspace of a finite-dimensional space is finite dimensional (If and is a linear subspace of , then is finite-dimensional, , and if and only if , Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis), and a linear bijection carries an ordered basis to an ordered basis (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
Proof
Given: , Banach spaces over one scalar field, and a bounded linear .
If is Fredholm, then the operator of [A1] satisfies: and have finite-dimensional ranges, hence are compact.
Conversely assume there is a bounded with and compact. By boundedness choose a real such that for every , and put .
For every one has , hence .
By [A3] the transpose of is , so ; for with one has by linearity of , hence and .
Under the hypothesis of [step 1.2], is finite dimensional and is closed, by [A2] applied to the estimate of [step 2.1] with the compact operator .
Under the hypothesis of [step 1.2] the operator is compact, so its transpose is compact by [A3]; the negative is compact as well, because the image of a bounded set under is the negative of its image under and negating a set preserves the compactness of its closure. So [A3] applies to the compact operator and makes finite dimensional; by [step 2.2] the subspace is finite dimensional.
Under the hypothesis of [step 1.2], the dual of the cokernel is finite dimensional: since is closed by [step 3.1], [A4] gives , which is finite dimensional by [step 3.2].
Under the hypothesis of [step 1.2], the cokernel is finite dimensional: if is a normed space whose dual has ordered basis , then is linear and injective, because a nonzero has by [A5] a norm-one functional , and forces ; the inverse bijection carries an ordered basis of the finite-dimensional image to an ordered basis of by [A5].
Under the hypothesis of [step 1.2] the operator is Fredholm, since its kernel is finite dimensional by [step 3.1], its range is closed by [step 3.1] and its cokernel is finite dimensional by [step 5.1]; with [step 1.1] this is the asserted equivalence.
Depends on
- Fredholm operator cokernel and index
- Compact linear operator
- A bounded linear operator between normed spaces
- Banach space
- Fredholm splitting and parametrix
- Bounded finite rank operators are compact
- A compact remainder estimate forces closed range
- Schauder compact adjoint theorem
- Kernel of identity minus compact is finite dimensional
- Elementary kernel and range annihilator identities
- The dual of a quotient is its annihilator
- Transposition reverses composition
- The transpose of a bounded operator
- Every nonzero vector has a norming functional
- The dual space separates points of a normed space
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- The quotient vector space \(X/M\), its cosets, and the quotient map \(q:X\to X/M\)
- The Axiom of Choice
- AC supplies the countable and dependent choices used in Banach integration
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
Dependency tree · two levels
107 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
- Gerald Teschl, Topics in Real and Functional Analysis, version November 17, 2017 — §6.5 p.188, Theorem 6.28 (standard reference, not scraped)
- Theo Bühler and Dietmar Salamon, Functional Analysis — §4.3 pp.192–195, Theorem 4.38 (standard reference, not scraped)