Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Atkinson's theorem: Fredholm operators are the operators invertible modulo compact operators

Proved
FredholmBanach.isFredholm_iff_exists_compact_quasiInverse

by Mazecto · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

banach-spacescompact-operatorsfredholm-operatorsfunctional-analysisoperator-theory

Let K\mathbb{K}K be R\mathbb{R}R or C\mathbb{C}C and let EEE, FFF be Banach spaces over K\mathbb{K}K. A bounded linear map u:E→Fu:E\to Fu:E→F is a Fredholm operator if and only if there is a bounded linear map v:F→Ev:F\to Ev:F→E such that both

1E−v∘uand1F−u∘v1_E-v\circ u\quad\text{and}\quad 1_F-u\circ v1E​−v∘uand1F​−u∘v

are compact operators (each maps some neighbourhood of 000 into a compact set).

This identifies the Fredholm operators with the operators that are invertible modulo the compact operators.

Preamble
import Definitions.Def_FredholmBanach_Setting
Formal statement
namespace FredholmBanach

open Topology

/-- Bourbaki, *Théories spectrales*, III, § 5, n° 3, Corollaire 1 (TS III.74), for Banach spaces
(Atkinson's theorem): `u` is Fredholm if and only if there is `v : F →L[𝕜] E` such that
`1_E - v ∘ u` and `1_F - u ∘ v` are compact operators. -/
theorem isFredholm_iff_exists_compact_quasiInverse {𝕜 E F : Type*} [RCLike 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [CompleteSpace E]
    [NormedAddCommGroup F] [NormedSpace 𝕜 F] [CompleteSpace F]
    (u : E →L[𝕜] F) :
    u.IsFredholm ↔ ∃ v : F →L[𝕜] E,
      IsCompactOperator (ContinuousLinearMap.id 𝕜 E - v.comp u) ∧
        IsCompactOperator (ContinuousLinearMap.id 𝕜 F - u.comp v) := by sorry

end FredholmBanach
Source
N. Bourbaki, Théories spectrales, Chapitres III à V, Springer (2023), https://doi.org/10.1007/978-3-031-19505-1, Chapitre III, § 5, n° 3, Corollaire 1, p. TS III.74 (stated there for separated locally convex spaces)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Read-back: FredholmBanach.isFredholm_iff_exists_compact_quasiInverse

Setting. K\mathbb{K}K is R\mathbb{R}R or C\mathbb{C}C (RCLike). EEE, FFF are Banach spaces over K\mathbb{K}K. u:E→Fu : E \to Fu:E→F is a bounded linear map.

Definitions used.

  • u.IsFredholm (Mathlib): (i) strict map, i.e. E→u(E)E \to u(E)E→u(E) is a topological quotient map; (ii) u(E)u(E)u(E) closed; (iii) dim⁡ker⁡u<∞\dim\ker u<\inftydimkeru<∞; (iv) the algebraic quotient F/u(E)F/u(E)F/u(E) is finite-dimensional; (v) there is a continuous linear projection of EEE onto ker⁡u\ker ukeru.
  • v : F →L[𝕜] E: a bounded linear map in the reverse direction. v.comp u =v∘u:E→E= v\circ u : E\to E=v∘u:E→E, u.comp v =u∘v:F→F= u\circ v : F \to F=u∘v:F→F. ContinuousLinearMap.id 𝕜 E is 1E1_E1E​.
  • IsCompactOperator T: TTT maps some neighbourhood of 000 into a compact set (standard compact operator).

Assertion. uuu is Fredholm if and only if there exists a bounded linear v:F→Ev : F \to Ev:F→E such that both

1E−v∘uand1F−u∘v1_E - v\circ u \quad\text{and}\quad 1_F - u\circ v1E​−v∘uand1F​−u∘v

are compact operators.

(Atkinson-type characterization: uuu is invertible modulo compact operators on both sides by the same vvv.)

Degenerate cases / remarks.

  • If EEE and FFF are finite-dimensional, every operator is compact and every uuu is Fredholm; both sides are true (take v=0v=0v=0).
  • If EEE is finite-dimensional and FFF infinite-dimensional: uuu is never Fredholm (cokernel infinite-dimensional), and the right side fails since 1F−u∘v1_F - u\circ v1F​−u∘v is 1F1_F1F​ minus a finite-rank map, not compact. Consistent.
  • A single vvv is required for both one-sided conditions; this is the standard form and not stronger than the two-sided-separately form (a left and a right quasi-inverse modulo compacts can be taken equal).
  • index is not used.

No mis-formalization detected.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mazecto · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me