Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An injective or surjective Fredholm operator of index zero is an isomorphism

Proved
FredholmBanach.exists_equiv_of_index_eq_zero

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. Let u:E→Fu:E\to Fu:E→F be a Fredholm operator with ind⁡u=0\operatorname{ind}u=0indu=0, where ind⁡u=dim⁡Ker⁡u−dim⁡(F/Im⁡u)\operatorname{ind}u=\dim\operatorname{Ker}u-\dim(F/\operatorname{Im}u)indu=dimKeru−dim(F/Imu). If uuu is injective or surjective, then uuu is an isomorphism of Banach spaces: there is a continuous linear equivalence e:E→Fe:E\to Fe:E→F (bijective, with continuous inverse) whose underlying map is uuu.

Preamble
import Definitions.Def_FredholmBanach_Setting
Formal statement
namespace FredholmBanach

open Topology

/-- Bourbaki, *Théories spectrales*, III, § 3, n° 3 (TS III.44): a Fredholm operator of index
`0` that is injective or surjective is an isomorphism of topological vector spaces. -/
theorem exists_equiv_of_index_eq_zero {𝕜 E F : Type*} [RCLike 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E] [CompleteSpace E]
    [NormedAddCommGroup F] [NormedSpace 𝕜 F] [CompleteSpace F]
    {u : E →L[𝕜] F} (hu : u.IsFredholm) (h0 : index u = 0)
    (h : Function.Injective u ∨ Function.Surjective u) :
    ∃ e : E ≃L[𝕜] F, (e : E →L[𝕜] F) = u := 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, § 3, n° 3, p. TS III.44
Read-back

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

Read-back: FredholmBanach.exists_equiv_of_index_eq_zero

Setting. K∈{R,C}\mathbb{K} \in \{\mathbb{R}, \mathbb{C}\}K∈{R,C} (RCLike 𝕜). E,FE, FE,F Banach spaces over K\mathbb{K}K (normed, complete). u:E→Fu : E \to Fu:E→F continuous linear (implicit).

Definitions used.

  • IsFredholm (Mathlib): uuu strict (corestriction onto range is a topological quotient map), closed range, dim⁡ker⁡u<∞\dim\ker u < \inftydimkeru<∞, algebraic cokernel F/u(E)F/u(E)F/u(E) finite-dimensional, ker⁡u\ker ukeru topologically complemented.
  • index u =finrank⁡(ker⁡u)−finrank⁡(F/u(E))= \operatorname{finrank}(\ker u) - \operatorname{finrank}(F/u(E))=finrank(keru)−finrank(F/u(E)) in Z\mathbb{Z}Z (finrank =0=0=0 on infinite-dimensional spaces; here both are finite by Fredholmness).
  • E ≃L[𝕜] F: a continuous linear equivalence, i.e. a linear bijection that is continuous with continuous inverse (an isomorphism of topological vector spaces).

Hypotheses.

  • hu: uuu is Fredholm.
  • h0: index⁡(u)=0\operatorname{index}(u) = 0index(u)=0, i.e. dim⁡ker⁡u=dim⁡F/u(E)\dim\ker u = \dim F/u(E)dimkeru=dimF/u(E).
  • h: uuu is injective or uuu is surjective (as a function).

Conclusion. There exists a continuous linear equivalence e:E≅Fe : E \cong Fe:E≅F whose underlying continuous linear map equals uuu. Equivalently: uuu itself is bijective and its inverse is continuous.

Degenerate cases.

  • E=F=0E = F = 0E=F=0: trivially true.
  • E,FE, FE,F finite-dimensional of equal dimension: index is 000 for every map; injective or surjective then gives an isomorphism (correct).
  • Finite-dimensional spaces of different dimensions: index ≠0\ne 0=0, so h0 fails and the statement is vacuous there (fine).

Remarks. The Fredholm hypothesis hu is genuinely needed: without it, an injective non-surjective map with infinite-dimensional cokernel would have junk index 000 and the conclusion would fail. It is present. The sign convention is irrelevant here since the index is 000. The conclusion pins eee to uuu (not merely "some isomorphism exists"), which is the intended strength. No mis-formalization observed.

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