Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 X and Y be Banach spaces over the same scalar field and let T:X→Y be a bounded linear operator (A bounded linear operator between normed spaces). Then T is Fredholm (Fredholm operator cokernel and index) if and only if there is a bounded linear S:Y→X such that both ST−IX and TS−IY are compact (Compact linear operator).

Facts & Assumptions

[A1]

If T is Fredholm, the splitting lemma provides a bounded S:Y→X for which ST−IX has finite-dimensional range of dimension at most dim⁡ker⁡T and TS−IY has finite-dimensional range of dimension at most dim⁡coker⁡T (Fredholm splitting and parametrix); a bounded finite-rank operator is compact (Bounded finite rank operators are compact, Fredholm operator cokernel and index).

[A2]

Under DC, if ∥x∥≤C∥Tx∥+∥Kx∥ for a compact K and some real C>0, then ker⁡T is finite dimensional and ran⁡T 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 N-indexed chain, Banach space); AC supplies DC (AC supplies the countable and dependent choices used in Banach integration).

[A3]

Transposition is additive with (BA)∗=A∗B∗ and I∗=I (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 I−C with C compact is finite dimensional (Kernel of identity minus compact is finite dimensional).

[A4]

For a bounded T, (ran⁡T)⊥=ker⁡T∗ and ran⁡T‾=⊥(ker⁡T∗) (Elementary kernel and range annihilator identities); for closed M≤Y the map (Y/M)∗→M⊥, h↦h∘q, 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)).

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, and a bounded linear T:X→Y.

1.1A1

If T is Fredholm, then the operator S of [A1] satisfies: ST−IX and TS−IY have finite-dimensional ranges, hence are compact.

1.2assume-hyp

Conversely assume there is a bounded S:Y→X with F:=ST−IX and G:=TS−IY compact. By boundedness choose a real b≥0 such that ∥Sy∥≤b∥y∥ for every y∈Y, and put C:=max⁡(b,1)>0.

2.1step 1.2algebra

For every x∈X one has x=STx−Fx, hence ∥x∥≤∥STx∥+∥Fx∥≤b∥Tx∥+∥Fx∥≤C∥Tx∥+∥Fx∥.

2.2step 1.2A3

By [A3] the transpose of G=TS−IY is G∗=S∗T∗−IY∗, so S∗T∗=IY∗+G∗=IY∗−(−G∗); for g∈Y∗ with T∗g=0 one has S∗T∗g=S∗(T∗g)=0 by linearity of S∗, hence (IY∗−(−G∗))g=S∗T∗g=0 and ker⁡T∗⊆ker⁡(IY∗−(−G∗)).

3.1step 2.1A2

Under the hypothesis of [step 1.2], ker⁡T is finite dimensional and ran⁡T is closed, by [A2] applied to the estimate of [step 2.1] with the compact operator F.

3.2step 1.2step 2.2A3

Under the hypothesis of [step 1.2] the operator G:=TS−IY is compact, so its transpose G∗ is compact by [A3]; the negative −G∗ is compact as well, because the image of a bounded set under −G∗ is the negative of its image under G∗ and negating a set preserves the compactness of its closure. So [A3] applies to the compact operator −G∗ and makes ker⁡(IY∗−(−G∗)) finite dimensional; by [step 2.2] the subspace ker⁡T∗ is finite dimensional.

4.1step 3.1step 3.2A4

Under the hypothesis of [step 1.2], the dual of the cokernel is finite dimensional: since ran⁡T is closed by [step 3.1], [A4] gives (coker⁡T)∗=(Y/ran⁡T)∗≅(ran⁡T)⊥=ker⁡T∗, which is finite dimensional by [step 3.2].

5.1step 4.1A5

Under the hypothesis of [step 1.2], the cokernel is finite dimensional: if Z is a normed space whose dual has ordered basis h1,…,hn, then Ψ(z):=(h1(z),…,hn(z)) is linear and injective, because a nonzero z has by [A5] a norm-one functional h, and h=∑icihi forces Ψ(z)≠0; the inverse bijection carries an ordered basis of the finite-dimensional image Ψ(Z) to an ordered basis of Z by [A5].

6.1step 1.1step 3.1step 5.1∎

Under the hypothesis of [step 1.2] the operator T 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

Dependency tree · 2 levels

Sources