Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The kernel and the index of a Cauchy–Riemann operator do not depend on p

Proved
CauchyRiemannIndex.index_independent_of_p

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

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

Let 1<p<∞1<p<\infty1<p<∞, let S±S^\pmS± be continuous loops of symmetric matrices and let S:R×S1→R2n×2nS:\mathbb{R}\times S^1\to\mathbb{R}^{2n\times2n}S:R×S1→R2n×2n be continuous with S(s,⋅)→S±S(s,\cdot)\to S^\pmS(s,⋅)→S± uniformly as s→±∞s\to\pm\inftys→±∞; DS=∂s+J0∂t+S(s,t)D_S=\partial_s+J_0\partial_t+S(s,t)DS​=∂s​+J0​∂t​+S(s,t). Assume that the asymptotic operators A±=−J0∂t−S±(t)A^\pm=-J_0\partial_t-S^\pm(t)A±=−J0​∂t​−S±(t) are nondegenerate. Then for every p2∈(1,∞)p_2\in(1,\infty)p2​∈(1,∞) the kernels of DSD_SDS​ on W1,pW^{1,p}W1,p and on W1,p2W^{1,p_2}W1,p2​ have the same dimension, and the Fredholm indices of DS:W1,p→LpD_S:W^{1,p}\to L^pDS​:W1,p→Lp and DS:W1,p2→Lp2D_S:W^{1,p_2}\to L^{p_2}DS​:W1,p2​→Lp2​ are equal.

Formalization Note ppp is in ℝ≥0∞ with Fact (1 ≤ p), 1<p1<p1<p and p≠∞p\ne\inftyp=∞. The hypotheses on SSS are IsSymLoop S± and IsAsymptoticTo S Splus Sminus. Nondegeneracy is IsNondegenerate S±: det⁡(Id−Ψ(1))≠0\det(\mathrm{Id}-\Psi(1))\ne0det(Id−Ψ(1))=0 for the fundamental solution Ψ\PsiΨ. The index is crIndex, an integer.

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

open MeasureTheory Matrix Filter Topology
open scoped ENNReal NNReal ContDiff RealInnerProductSpace

/-- Wendl, Theorem 4.3 (p. 69), second part, case `k = 1`, on the cylinder: if `D_S` is asymptotic
to nondegenerate loops `S±` of symmetric matrices, the kernel dimension and the Fredholm index of
`D_S : W^{1,p} → L^p` do not depend on `p ∈ (1, ∞)`. -/
theorem index_independent_of_p (n : ℕ) (p : ℝ≥0∞) [Fact (1 ≤ p)] (hp : 1 < p) (hp' : p ≠ ⊤)
    (Splus Sminus : ℝ → Mat n) (hSplus : IsSymLoop Splus) (hSminus : IsSymLoop Sminus)
    (S : ℝ × ℝ → Mat n) (hS : IsAsymptoticTo S Splus Sminus) (hplus : IsNondegenerate Splus) (hminus : IsNondegenerate Sminus)
    (p₂ : ℝ≥0∞) [Fact (1 ≤ p₂)] (hp₂ : 1 < p₂) (hp₂' : p₂ ≠ ⊤) :
    Module.finrank ℝ (crKernel p S) = Module.finrank ℝ (crKernel p₂ S) ∧
      crIndex p S = crIndex p₂ S := by
  sorry

end CauchyRiemannIndex
Source
C. Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, Lecture 4, Theorem 4.3, p. 69 (second statement, case k = 1)
Read-back

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

Read-back: CauchyRiemannIndex.index_independent_of_p

Setting. As in isFredholm: nnn, loops S±S^\pmS±, coefficient SSS, and two exponents p,p2∈[1,∞]p,p_2\in[1,\infty]p,p2​∈[1,∞] (each with a Fact (1 ≤ ·) instance).

Hypotheses. 1<p<∞1<p<\infty1<p<∞, 1<p2<∞1<p_2<\infty1<p2​<∞; S±S^\pmS± continuous 1-periodic symmetric loops; SSS continuous, ttt-periodic, uniformly asymptotic to S±S^\pmS± as s→±∞s\to\pm\inftys→±∞; S±S^\pmS± nondegenerate (det⁡(I−Ψ±(1))≠0\det(I-\Psi^\pm(1))\ne0det(I−Ψ±(1))=0 for the fundamental solution Ψ′=J0S±Ψ\Psi'=J_0S^\pm\PsiΨ′=J0​S±Ψ, Ψ(0)=I\Psi(0)=IΨ(0)=I).

Definitions used. crKernel p S = ker⁡(DS:W1,p→Lp)⊆Lp×Lp×Lp\ker(D_S:W^{1,p}\to L^p)\subseteq L^p\times L^p\times L^pker(DS​:W1,p→Lp)⊆Lp×Lp×Lp (triples (u,∂su,∂tu)(u,\partial_su,\partial_tu)(u,∂s​u,∂t​u) on the strip R×[0,1)\mathbb R\times[0,1)R×[0,1)). crIndex p S =finrank⁡Rker⁡−finrank⁡R(Lp/range⁡)∈Z=\operatorname{finrank}_{\mathbb R}\ker-\operatorname{finrank}_{\mathbb R}(L^p/\operatorname{range})\in\mathbb Z=finrankR​ker−finrankR​(Lp/range)∈Z. DS=∂s+J0∂t+SD_S=\partial_s+J_0\partial_t+SDS​=∂s​+J0​∂t​+S. (See isFredholm.md for the unfolding of W1,pW^{1,p}W1,p.)

Conclusion.

dim⁡Rker⁡DS(p)=dim⁡Rker⁡DS(p2)andind⁡DS(p)=ind⁡DS(p2),\dim_{\mathbb R}\ker D_S^{(p)}=\dim_{\mathbb R}\ker D_S^{(p_2)}\quad\text{and}\quad \operatorname{ind}D_S^{(p)}=\operatorname{ind}D_S^{(p_2)} ,dimR​kerDS(p)​=dimR​kerDS(p2​)​andindDS(p)​=indDS(p2​)​,

where DS(q):W1,q→LqD_S^{(q)}:W^{1,q}\to L^qDS(q)​:W1,q→Lq.

Degenerate cases. p=p2p=p_2p=p2​: trivial. n=0n=0n=0: both sides 000.

Remarks. Module.finrank is 000 on infinite-dimensional spaces, so the statement is only meaningful because the operators are Fredholm under these hypotheses (isFredholm); with Fredholmness, finrank equals the true dimension and crIndex is the true index. The kernels live in different ambient spaces; only their dimensions are compared, which is the intended content (Wendl Thm 4.3, second part).

Soundness checks.

  1. Junk values: finrank-0 junk only arises off the Fredholm regime, which the hypotheses exclude; ℤ-casts in crIndex are applied before subtraction (no ℕ truncation). Quantifiers: all data universally quantified; p2p_2p2​ arbitrary in (1,∞)(1,\infty)(1,∞).
  2. Not vacuous (hypotheses satisfiable, see isFredholm.md). In the test case n=1n=1n=1, S=c(s)IS=c(s)IS=c(s)I, c→±εc\to\pm\varepsilonc→±ε: kernel ={e−∫0scv}=\{e^{-\int_0^s c}v\}={e−∫0s​cv} is in W1,qW^{1,q}W1,q for every qqq, dimension 2 for all qqq; cokernel 000 for all qqq. Consistent. True by elliptic regularity (kernel elements are smooth and exponentially decaying) plus the same for the formal adjoint.

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