Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Loop property of the Conley–Zehnder index

Proved
ConleyZehnder.czIndex_loop

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

conley-zehnder-indexmaslov-indexsymplectic-geometrysymplectic-group

For every continuous loop φ:[0,1]→Sp(2n)\varphi:[0,1]\to\mathrm{Sp}(2n)φ:[0,1]→Sp(2n) with φ(0)=φ(1)=Id\varphi(0)=\varphi(1)=\mathrm{Id}φ(0)=φ(1)=Id and every ψ∈SP(n)\psi\in\mathrm{SP}(n)ψ∈SP(n),

μCZ(φψ)=μCZ(ψ)+2 μ(φ),\mu_{CZ}(\varphi\psi)=\mu_{CZ}(\psi)+2\,\mu(\varphi),μCZ​(φψ)=μCZ​(ψ)+2μ(φ),

where φψ\varphi\psiφψ is the pointwise product t↦φ(t)ψ(t)t\mapsto\varphi(t)\psi(t)t↦φ(t)ψ(t) and μ(φ)=deg⁡(ρ^∘φ)\mu(\varphi)=\deg(\hat\rho\circ\varphi)μ(φ)=deg(ρ^​∘φ) is the Maslov index of the loop.

Preamble
import Definitions.Def_ConleyZehnder_Setting
Formal statement
namespace ConleyZehnder

/-- Gutt, Proposition 8 (5), Loop: `μ_CZ(φψ) = μ_CZ(ψ) + 2 μ(φ)` for every loop `φ`
of symplectic matrices at `Id`. -/
theorem czIndex_loop (n : ℕ) : LoopAxiom (czIndex (n := n)) := 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), Proposition 8 (5), p. 7; 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.

SP(n)\mathrm{SP}(n)SP(n) is the set of paths ψ\psiψ such that ψ(t)\psi(t)ψ(t) is symplectic for every t∈[0,1]t\in[0,1]t∈[0,1], ψ(0)=Id\psi(0)=\mathrm{Id}ψ(0)=Id, and det⁡(Id−ψ(1))≠0\det(\mathrm{Id}-\psi(1))\neq 0det(Id−ψ(1))=0.

Sp∗(n)\mathrm{Sp}^*(n)Sp∗(n) is the set of symplectic A∈MatnA\in\mathrm{Mat}_nA∈Matn​ with det⁡(Id−A)≠0\det(\mathrm{Id}-A)\neq 0det(Id−A)=0.

W+=−IdW^+=-\mathrm{Id}W+=−Id, and W−W^-W− is the diagonal matrix whose qqq-block diagonal is (2,−1,…,−1)(2,-1,\dots,-1)(2,−1,…,−1) and whose ppp-block diagonal is (12,−1,…,−1)(\tfrac12,-1,\dots,-1)(21​,−1,…,−1) (the entry 222 resp. 12\tfrac1221​ sits at index 000; all other diagonal entries are −1-1−1). For n=0n=0n=0, W+=W−W^+=W^-W+=W− is the empty matrix.

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 the upper-left (qqq-row, qqq-column) n×nn\times nn×n block of CAC_ACA​ and YYY its lower-left (ppp-row, qqq-column) block, and set

d(A)=det⁡C (X+iY)∈C,d(A)=\det{}_{\mathbb C}\,(X+iY)\in\mathbb C,d(A)=detC​(X+iY)∈C,

the determinant of the complex n×nn\times nn×n matrix X+iYX+iYX+iY (equal to 111 when n=0n=0n=0). Then

ρ^(A)=d(A)∣d(A)∣∈C,\hat\rho(A)=\frac{d(A)}{|d(A)|}\in\mathbb C,ρ^​(A)=∣d(A)∣d(A)​∈C,

with the convention that division by zero gives 000, so ρ^(A)=0\hat\rho(A)=0ρ^​(A)=0 whenever d(A)=0d(A)=0d(A)=0.

For a function f:[0,1]→Cf:[0,1]\to\mathbb Cf:[0,1]→C, a function θ:[0,1]→R\theta:[0,1]\to\mathbb Rθ:[0,1]→R is called an argument lift of fff if θ\thetaθ is continuous and f(t)=eiθ(t)f(t)=e^{i\theta(t)}f(t)=eiθ(t) for every t∈[0,1]t\in[0,1]t∈[0,1]. (No lift exists if ∣f(t)∣≠1|f(t)|\neq 1∣f(t)∣=1 for some ttt, e.g. if ρ^\hat\rhoρ^​ takes the junk value 000; continuity of fff is not separately assumed.)

For a path ψ\psiψ and an integer kkk, "kkk is a CZ value of ψ\psiψ" means: there exist a path χ\chiχ with χ(0)=ψ(1)\chi(0)=\psi(1)χ(0)=ψ(1), χ(t)∈Sp∗(n)\chi(t)\in\mathrm{Sp}^*(n)χ(t)∈Sp∗(n) for all t∈[0,1]t\in[0,1]t∈[0,1], and χ(1)=W+\chi(1)=W^+χ(1)=W+ or χ(1)=W−\chi(1)=W^-χ(1)=W−; and argument lifts θ1\theta_1θ1​ of t↦ρ^(ψ(t))t\mapsto\hat\rho(\psi(t))t↦ρ^​(ψ(t)) and θ2\theta_2θ2​ of t↦ρ^(χ(t))t\mapsto\hat\rho(\chi(t))t↦ρ^​(χ(t)) with

2[(θ1(1)−θ1(0))+(θ2(1)−θ2(0))]=2πk.2\big[(\theta_1(1)-\theta_1(0))+(\theta_2(1)-\theta_2(0))\big]=2\pi k.2[(θ1​(1)−θ1​(0))+(θ2​(1)−θ2​(0))]=2πk.

(The lifts are of ρ^\hat\rhoρ^​ itself, not of ρ^2\hat\rho^2ρ^​2; the factor 222 appears only in this equation. No condition ψ∈SP(n)\psi\in\mathrm{SP}(n)ψ∈SP(n) is part of this notion.)

The index μCZ(ψ)∈Z\mu_{CZ}(\psi)\in\mathbb ZμCZ​(ψ)∈Z of a path ψ\psiψ is defined as: if some integer kkk is a CZ value of ψ\psiψ, then μCZ(ψ)\mu_{CZ}(\psi)μCZ​(ψ) is one such kkk chosen by the axiom of choice (an unspecified one if several exist); if no CZ value exists, μCZ(ψ)=0\mu_{CZ}(\psi)=0μCZ​(ψ)=0. It is defined for every path, not only those in SP(n)\mathrm{SP}(n)SP(n).

A symplectic loop is a path φ\varphiφ with φ(t)\varphi(t)φ(t) symplectic for every ttt and φ(0)=φ(1)=Id\varphi(0)=\varphi(1)=\mathrm{Id}φ(0)=φ(1)=Id.

For a path φ\varphiφ and an integer kkk, "kkk is a Maslov value of φ\varphiφ" means: there is an argument lift θ\thetaθ of t↦ρ^(φ(t))t\mapsto\hat\rho(\varphi(t))t↦ρ^​(φ(t)) with θ(1)−θ(0)=2πk\theta(1)-\theta(0)=2\pi kθ(1)−θ(0)=2πk. The Maslov index μ(φ)\mu(\varphi)μ(φ) is a choice-selected such kkk if one exists (an unspecified one if several exist), and 000 otherwise; it is defined for every path, not only loops.

Claim. For every n∈Nn\in\mathbb Nn∈N, every symplectic loop φ\varphiφ and every ψ∈SP(n)\psi\in\mathrm{SP}(n)ψ∈SP(n),

μCZ(φψ)=μCZ(ψ)+2 μ(φ),\mu_{CZ}(\varphi\psi)=\mu_{CZ}(\psi)+2\,\mu(\varphi),μCZ​(φψ)=μCZ​(ψ)+2μ(φ),

where (φψ)(t)=φ(t)ψ(t)(\varphi\psi)(t)=\varphi(t)\psi(t)(φψ)(t)=φ(t)ψ(t) and μ(φ)\mu(\varphi)μ(φ) is the Maslov index just defined.

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