Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An estimate modulo a compact operator gives finite-dimensional kernel and closed range

Proved
CauchyRiemannIndex.finiteDimensional_ker_isClosed_range_of_estimate

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

cauchy-riemannconley-zehnder-indexfredholm-indexsobolev-spacessymplectic-geometry

Let XXX, YYY, ZZZ be real Banach spaces, T:X→YT:X\to YT:X→Y a bounded linear operator, K:X→ZK:X\to ZK:X→Z a compact linear operator, and ccc a constant such that

∥x∥X≤c ∥Tx∥Y+c ∥Kx∥Zfor all x∈X.\|x\|_X\le c\,\|Tx\|_Y+c\,\|Kx\|_Z\qquad\text{for all }x\in X .∥x∥X​≤c∥Tx∥Y​+c∥Kx∥Z​for all x∈X.

Then ker⁡T\ker TkerT is finite-dimensional and the range of TTT is closed.

Formalization Note TTT and KKK are continuous linear maps X →L[ℝ] Y, X →L[ℝ] Z; compactness is IsCompactOperator K.

Preamble
import Definitions.Def_CauchyRiemannIndex_Setting
import Mathlib.Analysis.Calculus.ContDiff.Basic
import Mathlib.Analysis.Normed.Operator.Compact.Basic
Formal statement
namespace CauchyRiemannIndex

open MeasureTheory Matrix Filter Topology
open scoped ENNReal NNReal ContDiff RealInnerProductSpace

/-- Wendl, Lemma 4.12 (p. 73): let `X`, `Y`, `Z` be Banach spaces, `T : X → Y` bounded,
`K : X → Z` compact, and `‖x‖ ≤ c ‖T x‖ + c ‖K x‖` for all `x`. Then `ker T` is
finite-dimensional and `im T` is closed. -/
theorem finiteDimensional_ker_isClosed_range_of_estimate {X Y Z : Type*}
    [NormedAddCommGroup X] [NormedSpace ℝ X] [CompleteSpace X]
    [NormedAddCommGroup Y] [NormedSpace ℝ Y] [CompleteSpace Y]
    [NormedAddCommGroup Z] [NormedSpace ℝ Z] [CompleteSpace Z]
    (T : X →L[ℝ] Y) (K : X →L[ℝ] Z) (hK : IsCompactOperator K) (c : ℝ)
    (hc : ∀ x, ‖x‖ ≤ c * ‖T x‖ + c * ‖K x‖) :
    FiniteDimensional ℝ (LinearMap.ker (T : X →ₗ[ℝ] Y)) ∧ IsClosed (Set.range T) := by
  sorry

end CauchyRiemannIndex
Source
C. Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, Lecture 4, Lemma 4.12, p. 73
Read-back

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

Read-back: CauchyRiemannIndex.finiteDimensional_ker_isClosed_range_of_estimate

Setting. Real Banach spaces X,Y,ZX,Y,ZX,Y,Z; T∈L(X,Y)T\in\mathcal L(X,Y)T∈L(X,Y); K∈L(X,Z)K\in\mathcal L(X,Z)K∈L(X,Z); c∈Rc\in\mathbb Rc∈R.

Hypotheses. KKK is compact (IsCompactOperator K), and ∀x∈X: ∥x∥≤c∥Tx∥+c∥Kx∥\forall x\in X:\ \|x\|\le c\|Tx\|+c\|Kx\|∀x∈X: ∥x∥≤c∥Tx∥+c∥Kx∥.

Definitions used. Mathlib IsCompactOperator: KKK maps a neighbourhood of 000 into a relatively compact set. LinearMap.ker, Set.range.

Conclusion.

dim⁡Rker⁡T<∞andT(X) is closed in Y.\dim_{\mathbb R}\ker T<\infty\quad\text{and}\quad T(X)\text{ is closed in }Y.dimR​kerT<∞andT(X) is closed in Y.

Degenerate cases. If c<0c<0c<0, the hypothesis forces ∥x∥≤0\|x\|\le0∥x∥≤0, so X=0X=0X=0 and the conclusion holds trivially. The same happens for c=0c=0c=0. X=0X=0X=0 is trivial.

Remarks. Completeness of YYY and ZZZ is assumed but not needed. Completeness of XXX is needed for the closed-range part.

Soundness checks.

  1. Real-valued norms only, with no junk. ccc is a fixed constant quantified before xxx, so the estimate is uniform. IsClosed (Set.range T) uses the coercion of TTT to a function, which is the right set.
  2. Not vacuous: it applies e.g. to Fredholm operators with a compact perturbation estimate. It is true. This is the standard Peetre-type lemma: on ker⁡T\ker TkerT, ∥x∥≤c∥Kx∥\|x\|\le c\|Kx\|∥x∥≤c∥Kx∥, so the unit ball of ker⁡T\ker TkerT is compact. For closed range, one splits off the finite-dimensional kernel, using a closed complement, and argues by contradiction with compactness of KKK.

Verdict: no mis-formalization observed

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

    Confirmed by the moderator at approval.

  • Endorsed by Mazecto · Oct 14, 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