Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The complex-linear part of a symplectic matrix is invertible

Proved
ConleyZehnder.complexLinearDet_ne_zero

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

conley-zehnder-indexmaslov-indexsymplectic-geometrysymplectic-group

For every A∈Sp(2n)A\in\mathrm{Sp}(2n)A∈Sp(2n), the complex-linear part

CA=12 (A−J0AJ0)=(X−YYX)C_A=\tfrac12\,(A-J_0AJ_0)=\begin{pmatrix}X&-Y\\Y&X\end{pmatrix}CA​=21​(A−J0​AJ0​)=(XY​−YX​)

is invertible as a complex matrix: det⁡(X+iY)≠0\det(X+iY)\neq0det(X+iY)=0.

In particular ρ^(A)=det⁡CCA/∣det⁡CCA∣\hat\rho(A)=\det_{\mathbb C}C_A/|\det_{\mathbb C}C_A|ρ^​(A)=detC​CA​/∣detC​CA​∣ is a well-defined point of S1S^1S1 for every symplectic AAA.

Preamble
import Definitions.Def_ConleyZehnder_Setting
Formal statement
namespace ConleyZehnder

/-- Gutt, proof of Corollary 12: for every symplectic `A`, the `ℂ`-linear part
`½(A - J₀AJ₀)` is invertible, i.e. `det_ℂ C_A ≠ 0`. -/
theorem complexLinearDet_ne_zero {n : ℕ} (A : Mat n) (hA : IsSymplectic A) :
    complexLinearDet A ≠ 0 := by sorry

end ConleyZehnder
Source
Gutt, Generalized Conley-Zehnder index, Ann. Fac. Sci. Toulouse Math. 23 (2014) 907-932, https://doi.org/10.5802/afst.1430 (arXiv:1307.7239), proof of Corollary 12, p. 9 (formula (9)); Salamon, Lectures on Floer homology, IAS/Park City Math. Ser. 7 (1999) 143-229, https://doi.org/10.1090/pcms/007/05
Read-back

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

Throughout, for a natural number nnn (including n=0n=0n=0), Matn\mathrm{Mat}_nMatn​ denotes the real 2n×2n2n\times 2n2n×2n matrices whose rows and columns are indexed by two copies of {0,…,n−1}\{0,\dots,n-1\}{0,…,n−1}: a first ("qqq") block and a second ("ppp") block. Id\mathrm{Id}Id is the identity matrix. J0∈MatnJ_0\in\mathrm{Mat}_nJ0​∈Matn​ is the block matrix

J0=(0−IdId0).J_0=\begin{pmatrix}0&-\mathrm{Id}\\ \mathrm{Id}&0\end{pmatrix}.J0​=(0Id​−Id0​).

A matrix AAA is called symplectic if A J0 AT=J0A\,J_0\,A^{\mathsf T}=J_0AJ0​AT=J0​. A path is a continuous map [0,1]→Matn[0,1]\to\mathrm{Mat}_n[0,1]→Matn​ (with the usual Euclidean topology on matrix entries); the set of paths carries the compact-open topology (equivalently the topology of uniform convergence). Products, inverses and transposes of paths below are always taken pointwise in ttt. For n=0n=0n=0 all matrices are the empty 0×00\times 00×0 matrix, whose determinant is 111.

For A∈MatnA\in\mathrm{Mat}_nA∈Matn​, let CA=12(A−J0AJ0)C_A=\tfrac12(A-J_0AJ_0)CA​=21​(A−J0​AJ0​), let XXX be its upper-left (qqq-row, qqq-column) n×nn\times nn×n block and YYY its lower-left (ppp-row, qqq-column) block, and let d(A)=det⁡C(X+iY)d(A)=\det_{\mathbb C}(X+iY)d(A)=detC​(X+iY) be the determinant of the complex n×nn\times nn×n matrix X+iYX+iYX+iY.

Claim. For every n∈Nn\in\mathbb Nn∈N and every symplectic A∈MatnA\in\mathrm{Mat}_nA∈Matn​ (i.e. AJ0AT=J0AJ_0A^{\mathsf T}=J_0AJ0​AT=J0​),

d(A)≠0.d(A)\neq 0.d(A)=0.

For n=0n=0n=0 the claim is 1≠01\neq 01=0.

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

    Confirmed by the moderator at approval.

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