Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The real symplectic group Sp(2n) is path-connected

Proved
ConleyZehnder.symplectic_joined_one

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

conley-zehnder-indexsymplectic-geometrysymplectic-group

Let J0=(0−IdId0)J_0=\begin{pmatrix}0&-\mathrm{Id}\\ \mathrm{Id}&0\end{pmatrix}J0​=(0Id​−Id0​) and let Sp(2n)={A∈R2n×2n:AJ0AT=J0}\mathrm{Sp}(2n)=\{A\in\mathbb R^{2n\times 2n}: AJ_0A^{T}=J_0\}Sp(2n)={A∈R2n×2n:AJ0​AT=J0​} be the real symplectic group. For every A∈Sp(2n)A\in\mathrm{Sp}(2n)A∈Sp(2n) there is a continuous path γ:[0,1]→Sp(2n)\gamma:[0,1]\to\mathrm{Sp}(2n)γ:[0,1]→Sp(2n) with γ(0)=Id\gamma(0)=\mathrm{Id}γ(0)=Id and γ(1)=A\gamma(1)=Aγ(1)=A. In other words, Sp(2n)\mathrm{Sp}(2n)Sp(2n) is path-connected.

This classical fact is used to move a constant conjugating matrix to the identity, as in the naturality property of the Conley–Zehnder index, and more generally whenever an index defined on symplectic paths is compared along deformations.

Formalization note: IsSymplectic A (definition module ConleyZehnder_Setting) is membership in Mathlib's Matrix.symplecticGroup (Fin n) ℝ, i.e. AJ0AT=J0AJ_0A^T=J_0AJ0​AT=J0​ with J0J_0J0​ = Matrix.J; paths are continuous maps C(unitInterval, Mat n).

Preamble
import Definitions.Def_ConleyZehnder_Setting
Formal statement
namespace ConleyZehnder

/-- The symplectic group `Sp(ℝ²ⁿ, Ω₀)` is path-connected: every symplectic matrix `A` is
joined to `Id` by a continuous path of symplectic matrices. -/
theorem symplectic_joined_one {n : ℕ} (A : Mat n) (hA : IsSymplectic A) :
    ∃ γ : C(unitInterval, Mat n), γ 0 = 1 ∧ γ 1 = A ∧ ∀ t, IsSymplectic (γ t) := by sorry

end ConleyZehnder
Source
Classical; see McDuff-Salamon, Introduction to Symplectic Topology, 3rd ed., Section 2.2; used in Gutt, Generalized Conley-Zehnder index, Ann. Fac. Sci. Toulouse Math. 23 (2014) 907-932, https://doi.org/10.5802/afst.1430 (arXiv:1307.7239), Proposition 8 (1)

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