Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every nondegenerate symplectic arc is uniformly approximated by fundamental solutions

Proved
CauchyRiemannIndex.exists_loop_fundamentalSolution_close

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

cauchy-riemannconley-zehnder-indexsymplectic-geometry

Let ψ:[0,1]→Sp(2n,R)\psi:[0,1]\to\mathrm{Sp}(2n,\mathbb R)ψ:[0,1]→Sp(2n,R) be continuous with ψ(0)=Id\psi(0)=\mathrm{Id}ψ(0)=Id, such that 111 is not an eigenvalue of ψ(1)\psi(1)ψ(1), and let ε>0\varepsilon>0ε>0. Then there is a continuous 111-periodic loop S:R→R2n×2nS:\mathbb R\to\mathbb R^{2n\times2n}S:R→R2n×2n of symmetric matrices with S(0)=0S(0)=0S(0)=0, whose asymptotic operator −J0∂t−S-J_0\partial_t-S−J0​∂t​−S is nondegenerate, such that its fundamental solution Ψ\PsiΨ (Ψ(0)=Id\Psi(0)=\mathrm{Id}Ψ(0)=Id, Ψ′=J0SΨ\Psi'=J_0S\PsiΨ′=J0​SΨ on R\mathbb RR) satisfies

sup⁡t∈[0,1]∥Ψ(t)−ψ(t)∥<ε\sup_{t\in[0,1]}\|\Psi(t)-\psi(t)\|<\varepsilont∈[0,1]sup​∥Ψ(t)−ψ(t)∥<ε

in the entrywise maximum norm.

Thus the time-[0,1][0,1][0,1] fundamental solutions of nondegenerate asymptotic operators on the trivial bundle are uniformly dense in the space SP(n)SP(n)SP(n) of continuous nondegenerate symplectic arcs starting at the identity (Wendl, Lecture 3, §3.4), even under the normalization S(0)=0S(0)=0S(0)=0.

Formalization Note. R2n×2n\mathbb R^{2n\times2n}R2n×2n is Mat n (real matrices indexed by Fin n ⊕ Fin n) and J0=(0−IdId0)J_0=\begin{pmatrix}0&-\mathrm{Id}\\ \mathrm{Id}&0\end{pmatrix}J0​=(0Id​−Id0​) is Matrix.J. The arc is ψ : C(unitInterval, Mat n) with ∀ t, IsSymplectic (ψ t), ψ 0 = 1 and (1 - ψ 1).det ≠ 0. Loops satisfy IsSymLoop (continuous, 111-periodic, symmetric values) and IsNondegenerate; IsFundamentalSolution S Ψ means Ψ(0)=Id\Psi(0)=\mathrm{Id}Ψ(0)=Id and HasDerivAt Ψ (J₀ n * S t * Ψ t) t for all t∈Rt\in\mathbb Rt∈R. The uniform closeness on [0,1][0,1][0,1] is written entrywise: ∀ t : unitInterval, ∀ i j, |Ψ t i j - ψ t i j| < ε.

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

/-- Every path `ψ` in `SP(n)` is uniformly approximated on `[0, 1]` by the fundamental solution
of a nondegenerate loop of symmetric matrices vanishing at `0`. -/
theorem exists_loop_fundamentalSolution_close (n : ℕ) (ψ : C(unitInterval, Mat n))
    (hψ : ∀ t, IsSymplectic (ψ t)) (hψ0 : ψ 0 = 1) (hψ1 : (1 - ψ 1).det ≠ 0) (ε : ℝ)
    (hε : 0 < ε) :
    ∃ S Ψ : ℝ → Mat n, IsSymLoop S ∧ IsNondegenerate S ∧ S 0 = 0 ∧
      IsFundamentalSolution S Ψ ∧ ∀ t : unitInterval, ∀ i j, |Ψ t i j - ψ t i j| < ε := by
  sorry

end CauchyRiemannIndex
Source
C. Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, Lecture 3, §3.4, pp. 61-62 (Definition 3.30, Theorem 3.34), trivial bundle

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