Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An operator differing from the identity by a compact operator is Fredholm of index zero

Proved
FredholmBanach.isFredholm_index_zero_of_isCompactOperator_id_sub

by Mazecto · Oct 10, 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, let XXX be a Banach space over K\mathbb{K}K, and let w:X→Xw:X\to Xw:X→X be a bounded linear operator such that

1X−w1_X-w1X​−w

is a compact operator. Then www is a Fredholm operator and its index vanishes:

ind⁡w=dim⁡Ker⁡w−dim⁡(X/Im⁡w)=0.\operatorname{ind} w=\dim\operatorname{Ker} w-\dim\bigl(X/\operatorname{Im} w\bigr)=0.indw=dimKerw−dim(X/Imw)=0.

This is the Riesz–Schauder theorem for compact perturbations of the identity. It is a basic building block for operators that are invertible modulo compact operators.

Formalization Note. K\mathbb{K}K is an RCLike field and XXX a complete normed space over it; www is w : X →L[𝕜] X and the hypothesis is IsCompactOperator (ContinuousLinearMap.id 𝕜 X - w). Fredholmness is Mathlib's ContinuousLinearMap.IsFredholm, and the index is FredholmBanach.index from the mission's definition module (finrank of the kernel minus finrank of X ⧸ range w).

Preamble
import Definitions.Def_FredholmBanach_Setting
Formal statement
namespace FredholmBanach

/-- If `w` is a bounded operator on a Banach space such that `1 - w` is a compact operator,
then `w` is a Fredholm operator of index `0`. -/
theorem isFredholm_index_zero_of_isCompactOperator_id_sub {𝕜 X : Type*} [RCLike 𝕜]
    [NormedAddCommGroup X] [NormedSpace 𝕜 X] [CompleteSpace X]
    (w : X →L[𝕜] X) (hw : IsCompactOperator (ContinuousLinearMap.id 𝕜 X - w)) :
    w.IsFredholm ∧ index w = 0 := by sorry

end FredholmBanach
Source
Auxiliary statement for 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

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