Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Solvability with an L2L^2L2 bound from an estimate for the formal adjoint

Proved
CauchyRiemannIndex.exists_solution_of_adjoint_estimate

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

cauchy-riemannfredholm-indexsobolev-spacessymplectic-geometry

Let S±S^\pmS± be continuous loops of symmetric 2n×2n2n\times2n2n×2n 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→±∞. Let B:R×R→R2n×2nB:\mathbb R\times\mathbb R\to\mathbb R^{2n\times2n}B:R×R→R2n×2n be continuous with ∣B(x)v∣≤M∣v∣|B(x)v|\le M|v|∣B(x)v∣≤M∣v∣ for all x,vx,vx,v. Write D=∂s+J0∂t+S+BD=\partial_s+J_0\partial_t+S+BD=∂s​+J0​∂t​+S+B and

D∗φ=−∂sφ+J0∂tφ+(S+B)TφD^*\varphi=-\partial_s\varphi+J_0\partial_t\varphi+(S+B)^{T}\varphiD∗φ=−∂s​φ+J0​∂t​φ+(S+B)Tφ

for its formal adjoint. Suppose that for some C≥0C\ge0C≥0

∥φ∥L22≤C ∥D∗φ∥L22for every test section φ.\|\varphi\|_{L^2}^2\le C\,\|D^*\varphi\|_{L^2}^2\qquad\text{for every test section }\varphi .∥φ∥L22​≤C∥D∗φ∥L22​for every test section φ.

Then for every f∈L2(R×S1,R2n)f\in L^2(\mathbb R\times S^1,\mathbb R^{2n})f∈L2(R×S1,R2n) there is w∈W1,2w\in W^{1,2}w∈W1,2 with Dw=fDw=fDw=f and ∥w∥L2≤C ∥f∥L2\|w\|_{L^2}\le\sqrt C\,\|f\|_{L^2}∥w∥L2​≤C​∥f∥L2​.

This turns an a priori estimate for the adjoint into surjectivity of D:W1,2→L2D:W^{1,2}\to L^2D:W1,2→L2 with a bounded solution operator into L2L^2L2; BBB need not be asymptotic to anything.

Formalization Note. S1=R/ZS^1=\mathbb R/\mathbb ZS1=R/Z; maps on the cylinder are maps of (s,t)∈R×R(s,t)\in\mathbb R\times\mathbb R(s,t)∈R×R that are 111-periodic in ttt, and integrals over R×S1\mathbb R\times S^1R×S1 are over the strip R×[0,1)\mathbb R\times[0,1)R×[0,1) (cylMeasure). Test sections are IsTestSection (smooth, 111-periodic in ttt, zero for large ∣s∣|s|∣s∣); ∂s,∂t\partial_s,\partial_t∂s​,∂t​ are partialS, partialT, and matrices act through Matrix.toEuclideanLin. W1,2W^{1,2}W1,2 is W1p 2 n (triples (u,∂su,∂tu)(u,\partial_su,\partial_tu)(u,∂s​u,∂t​u)), DwDwDw is crApply (fun x => S x + B x) w, and the conclusion bounds the L2L^2L2 norm of the first component w.1. The bound on BBB is stated for the operator Matrix.toEuclideanLin (B x).

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

open MeasureTheory Matrix Filter Topology
open scoped ENNReal NNReal ContDiff RealInnerProductSpace

/-- Let `D_S` be asymptotic to loops `S±` of symmetric matrices and let `B` be a continuous
bounded matrix-valued function on the cylinder. If the formal adjoint
`φ ↦ -∂ₛφ + J₀ ∂ₜφ + (S + B)ᵀ φ` of `D_{S+B}` satisfies `‖φ‖₂² ≤ C ‖D_{S+B}^* φ‖₂²` for every
test section `φ`, then for every `f ∈ L²` there is `w ∈ W^{1,2}` with `D_{S+B} w = f` and
`‖w‖₂ ≤ √C ‖f‖₂`. -/
theorem exists_solution_of_adjoint_estimate (n : ℕ) (Splus Sminus : ℝ → Mat n)
    (hSplus : IsSymLoop Splus) (hSminus : IsSymLoop Sminus)
    (S : ℝ × ℝ → Mat n) (hS : IsAsymptoticTo S Splus Sminus)
    (B : ℝ × ℝ → Mat n) (hBc : Continuous B)
    (hBb : ∃ M : ℝ, 0 ≤ M ∧ ∀ x (v : Vec n), ‖Matrix.toEuclideanLin (B x) v‖ ≤ M * ‖v‖)
    (C : ℝ) (hC : 0 ≤ C)
    (hest : ∀ φ : ℝ × ℝ → Vec n, IsTestSection φ →
      ∫ x, ‖φ x‖ ^ 2 ∂cylMeasure ≤
        C * ∫ x, ‖-partialS φ x + Matrix.toEuclideanLin (J₀ n) (partialT φ x) +
          Matrix.toEuclideanLin (S x + B x)ᵀ (φ x)‖ ^ 2 ∂cylMeasure)
    (f : LpCyl n 2) :
    ∃ w ∈ W1p 2 n, crApply (fun x => S x + B x) w =ᵐ[cylMeasure] (f : ℝ × ℝ → Vec n) ∧
      ‖w.1‖ ≤ Real.sqrt C * ‖f‖ := by
  sorry

end CauchyRiemannIndex
Source
C. Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, Lecture 5, proof of Proposition 5.24, p. 100 (p = 2)

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