Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 35

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.classical_index_eight_properties

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For all positive dimensions, let μCZ\mu_{\rm CZ}μCZ​ be the integer index constructed by the degree of the squared rotation map on an admissible extension. A path γ:[0,1]→Sp⁡(2n,R)\gamma:[0,1]\to\operatorname{Sp}(2n,\mathbb R)γ:[0,1]→Sp(2n,R) is admissible when it is continuous, starts at III, and ends with det⁡(γ(1)−I)≠0\det(\gamma(1)-I)\ne0det(γ(1)−I)=0. All eight properties hold:

  1. For every continuous symplectic path ϕ\phiϕ with arbitrary endpoints, μCZ(ϕγϕ−1)=μCZ(γ)\mu_{\rm CZ}(\phi\gamma\phi^{-1})=\mu_{\rm CZ}(\gamma)μCZ​(ϕγϕ−1)=μCZ​(γ).
  2. The index is constant under continuous homotopies through admissible paths; the final endpoint may move within Sp⁡∗\operatorname{Sp}^*Sp∗.
  3. If γ(t)\gamma(t)γ(t) has no unit-circle eigenvalue for every 0<t≤10<t\le10<t≤1, then μCZ(γ)=0\mu_{\rm CZ}(\gamma)=0μCZ​(γ)=0.
  4. For admissible paths γ\gammaγ and η\etaη in dimensions 2n2n2n and 2m2m2m, with n,m≥1n,m\ge1n,m≥1, μCZ(γ⊕η)=μCZ(γ)+μCZ(η)\mu_{\rm CZ}(\gamma\oplus\eta)=\mu_{\rm CZ}(\gamma)+\mu_{\rm CZ}(\eta)μCZ​(γ⊕η)=μCZ​(γ)+μCZ​(η), using the grouped symplectic direct sum.
  5. If ϕ(0)=ϕ(1)=I\phi(0)=\phi(1)=Iϕ(0)=ϕ(1)=I, then μCZ(ϕγ)=μCZ(γ)+2deg⁡(ρ∘ϕ)\mu_{\rm CZ}(\phi\gamma)=\mu_{\rm CZ}(\gamma)+2\deg(\rho\circ\phi)μCZ​(ϕγ)=μCZ​(γ)+2deg(ρ∘ϕ).
  6. For a real symmetric nonsingular 2n2n2n by 2n2n2n matrix SSS whose eigenvalues have absolute value less than 2π2\pi2π, 2μCZ(t↦etJ0S)=Sign⁡S2\mu_{\rm CZ}(t\mapsto e^{tJ_0S})=\operatorname{Sign}S2μCZ​(t↦etJ0​S)=SignS.
  7. The endpoint parity is
(−1)n−μCZ(γ)=sign⁡det⁡(I−γ(1)).(-1)^{n-\mu_{\rm CZ}(\gamma)}=\operatorname{sign}\det(I-\gamma(1)).(−1)n−μCZ​(γ)=signdet(I−γ(1)).
  1. For pointwise matrix inversion and transpose, μCZ(γ−1)=μCZ(γT)=−μCZ(γ)\mu_{\rm CZ}(\gamma^{-1})=\mu_{\rm CZ}(\gamma^T)=-\mu_{\rm CZ}(\gamma)μCZ​(γ−1)=μCZ​(γT)=−μCZ​(γ).

Here J0=(0−II0)J_0=\left(\begin{smallmatrix}0&-I\\I&0\end{smallmatrix}\right)J0​=(0I​−I0​), ρ\rhoρ is the spectral rotation map, and Sign⁡\operatorname{Sign}Sign is positive minus negative inertia. These rules are conclusions about the constructed index, not assumptions defining a competing assignment.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap50repair_P01
Formal statement
noncomputable section

open scoped BigOperators Matrix Matrix.Norms.Frobenius

namespace QAlgorithms.Papers.Independent.Gap50repair.P01

attribute [local instance] Classical.propDecidable

-- Pinned entrywise complexification and symplecticity. The latter uses -Omega0;
-- preserving -Omega0 is equivalent to preserving Omega0, with identical coordinates.

open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)

open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)

/-- Proposition 35 ([11]), PDF pp.36–40: all eight properties of the
constructed integer index. Inverse and transpose are pointwise, conjugating
paths have arbitrary endpoints, and product compares positive dimensions. -/
theorem classical_index_eight_properties :
    (∀ n, 1 ≤ n → ∀ p phi : ℝ → GroupedRealMatrix n,
      IsAdmissible p 1 → IsPath phi 1 →
      conleyZehnder (fun t => phi t*p t*(phi t)⁻¹) 1 = conleyZehnder p 1) ∧
    (∀ n, 1 ≤ n → ∀ p q : ℝ → GroupedRealMatrix n,
      IsAdmissible p 1 → IsAdmissible q 1 → AdmissiblyHomotopic p q →
      conleyZehnder p 1 = conleyZehnder q 1) ∧
    (∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 →
      (∀ t ∈ Set.Ioc (0 : ℝ) 1, ∀ z ∈ eigenvalues (p t), ‖z‖ ≠ 1) →
      conleyZehnder p 1 = 0) ∧
    (∀ n m, 1 ≤ n → 1 ≤ m → ∀ p : ℝ → GroupedRealMatrix n,
      ∀ q : ℝ → GroupedRealMatrix m, IsAdmissible p 1 → IsAdmissible q 1 →
      conleyZehnder (fun t => symplecticSum (p t) (q t)) 1 =
        conleyZehnder p 1 + conleyZehnder q 1) ∧
    (∀ n, 1 ≤ n → ∀ p phi : ℝ → GroupedRealMatrix n,
      IsAdmissible p 1 → IsPath phi 1 → phi 0 = 1 → phi 1 = 1 →
      conleyZehnder (fun t => phi t*p t) 1 = conleyZehnder p 1 +
        2*winding (fun t => spectralRotation (phi t)) 1) ∧
    (∀ n, 1 ≤ n → ∀ S : GroupedRealMatrix n, IsSmallSymmetric S → S.det ≠ 0 →
      2*conleyZehnder (exponentialPath S) 1 = matrixSignature S) ∧
    (∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 →
      (-1 : ℝ)^((n : ℤ)-conleyZehnder p 1) = Real.sign ((1-p 1).det)) ∧
    (∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 →
      conleyZehnder (fun t => (p t)⁻¹) 1 = conleyZehnder (fun t => (p t).transpose) 1 ∧
      conleyZehnder (fun t => (p t).transpose) 1 = -conleyZehnder p 1) := by sorry

end QAlgorithms.Papers.Independent.Gap50repair.P01

end
Source
The Conley-Zehnder index for a path of symplectic matrices, arXiv:1201.3728v2, PDF p. 36, Proposition 35
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Use real 2n×2n2n\times2n2n×2n matrices with coordinates (x0,…,xn−1,y0,…,yn−1)(x_0,\ldots,x_{n-1},y_0,\ldots,y_{n-1})(x0​,…,xn−1​,y0​,…,yn−1​), put Jn=(0−InIn0)J_n=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}Jn​=(0In​​−In​0​), and call AAA symplectic when ATJnA=JnA^{\mathsf T}J_nA=J_nATJn​A=Jn​. A path here is a function p:R→R2n×2np:\mathbb R\to\mathbb R^{2n\times2n}p:R→R2n×2n continuous and symplectic on [0,1][0,1][0,1]; it is admissible when also p(0)=I2np(0)=I_{2n}p(0)=I2n​ and det⁡(p(1)−I2n)≠0\det(p(1)-I_{2n})\ne0det(p(1)−I2n​)=0. Define the integer μ(p)\mu(p)μ(p) as follows. For each real matrix AAA, let E(A)E(A)E(A) be the distinct roots of the characteristic polynomial of its entrywise complexification ACA_{\mathbb C}AC​, let mA(z)m_A(z)mA​(z) be their algebraic multiplicities, put VA(z)=ker⁡(AC−zI)2nV_A(z)=\ker(A_{\mathbb C}-zI)^{2n}VA​(z)=ker(AC​−zI)2n, and put ωC(v,w)=∑j(vxjwyj−vyjwxj)\omega_{\mathbb C}(v,w)=\sum_j(v_{x_j}w_{y_j}-v_{y_j}w_{x_j})ωC​(v,w)=∑j​(vxj​​wyj​​−vyj​​wxj​​). Let κA(z)\kappa_A(z)κA​(z) be the largest k∈{0,…,4n}k\in\{0,\ldots,4n\}k∈{0,…,4n} realized as the real dimension of a real linear subspace W⊆VA(z)W\subseteq V_A(z)W⊆VA​(z) on which Im⁡ωC(v,v‾)>0\operatorname{Im}\omega_{\mathbb C}(v,\overline v)>0ImωC​(v,v)>0 for every nonzero vvv. Define

ρ(A)=(−1)⌊12∑z∈E(A)Im⁡z=0, Re⁡z<0mA(z)⌋∏z∈E(A)∣z∣=1, z≠1, z≠−1z⌊κA(z)/2⌋.\rho(A)= (-1)^{\left\lfloor\frac12 \sum_{\substack{z\in E(A)\\ \operatorname{Im}z=0,\ \operatorname{Re}z<0}}m_A(z)\right\rfloor} \prod_{\substack{z\in E(A)\\ |z|=1,\ z\ne1,\ z\ne-1}} z^{\lfloor\kappa_A(z)/2\rfloor}.ρ(A)=(−1)⌊21​∑z∈E(A)Imz=0, Rez<0​​mA​(z)⌋z∈E(A)∣z∣=1, z=1, z=−1​∏​z⌊κA​(z)/2⌋.

Empty sums and products have values zero and one, respectively. For T∈{1,2}T\in\{1,2\}T∈{1,2}, let WT(f)W_T(f)WT​(f) be a classically chosen integer kkk admitting a real function θ\thetaθ, continuous on [0,T][0,T][0,T], with θ(0)=0\theta(0)=0θ(0)=0, θ(T)=k\theta(T)=kθ(T)=k, and f(t)=e2πiθ(t)f(t)=e^{2\pi i\theta(t)}f(t)=e2πiθ(t) throughout that interval; set WT(f)=0W_T(f)=0WT​(f)=0 when no such integer exists. Choose an extension ep:R→R2n×2ne_p:\mathbb R\to\mathbb R^{2n\times2n}ep​:R→R2n×2n if one exists, meaning that it is continuous and symplectic on [0,2][0,2][0,2], equals ppp on [0,1][0,1][0,1], has det⁡(ep(t)−I)≠0\det(e_p(t)-I)\ne0det(ep​(t)−I)=0 on [1,2][1,2][1,2], and ends at either −I-I−I or the diagonal matrix with entries 222 at x0x_0x0​, 1/21/21/2 at y0y_0y0​, and −1-1−1 elsewhere; if no extension exists, set ep=pe_p=pep​=p. Then μ(p)=W2(t↦ρ(ep(t))2)\mu(p)=W_2(t\mapsto\rho(e_p(t))^2)μ(p)=W2​(t↦ρ(ep​(t))2). For a real square matrix SSS, write σ(S)\sigma(S)σ(S) for the largest dimension of a real linear subspace on which vTSvv^{\mathsf T}SvvTSv is strictly positive for every nonzero vvv, minus the largest dimension of a subspace on which it is strictly negative for every nonzero vvv; the zero subspace is allowed. The declaration asserts the conjunction of these eight statements: (i) for every n≥1n\ge1n≥1, every admissible ppp, and every path ϕ\phiϕ, μ(t↦ϕ(t)p(t)ϕ(t)−1)=μ(p)\mu(t\mapsto\phi(t)p(t)\phi(t)^{-1})=\mu(p)μ(t↦ϕ(t)p(t)ϕ(t)−1)=μ(p), with no endpoint condition on ϕ\phiϕ; (ii) for every n≥1n\ge1n≥1 and admissible p,qp,qp,q, if there is H:R2→R2n×2nH:\mathbb R^2\to\mathbb R^{2n\times2n}H:R2→R2n×2n, continuous on [0,1]2[0,1]^2[0,1]2, such that t↦H(s,t)t\mapsto H(s,t)t↦H(s,t) is admissible for every s∈[0,1]s\in[0,1]s∈[0,1], and H(0,t)=p(t)H(0,t)=p(t)H(0,t)=p(t), H(1,t)=q(t)H(1,t)=q(t)H(1,t)=q(t) for every t∈[0,1]t\in[0,1]t∈[0,1], then μ(p)=μ(q)\mu(p)=\mu(q)μ(p)=μ(q); (iii) for every n≥1n\ge1n≥1 and admissible ppp, if every eigenvalue of p(t)Cp(t)_{\mathbb C}p(t)C​ has modulus different from one for every t∈(0,1]t\in(0,1]t∈(0,1], then μ(p)=0\mu(p)=0μ(p)=0, with time zero excluded from this spectral hypothesis; (iv) for every n,m≥1n,m\ge1n,m≥1 and admissible paths p,qp,qp,q of sizes 2n,2m2n,2m2n,2m, respectively, μ(t↦p(t)⊕sq(t))=μ(p)+μ(q)\mu(t\mapsto p(t)\oplus_s q(t))=\mu(p)+\mu(q)μ(t↦p(t)⊕s​q(t))=μ(p)+μ(q), where ⊕s\oplus_s⊕s​ acts separately on the two coordinate spaces and orders the combined coordinates as (xp,xq,yp,yq)(x_p,x_q,y_p,y_q)(xp​,xq​,yp​,yq​); (v) for every n≥1n\ge1n≥1, admissible ppp, and path ϕ\phiϕ with ϕ(0)=ϕ(1)=I\phi(0)=\phi(1)=Iϕ(0)=ϕ(1)=I,

μ(t↦ϕ(t)p(t))=μ(p)+2W1(t↦ρ(ϕ(t)));\mu(t\mapsto\phi(t)p(t)) =\mu(p)+2W_1(t\mapsto\rho(\phi(t)));μ(t↦ϕ(t)p(t))=μ(p)+2W1​(t↦ρ(ϕ(t)));

(vi) for every n≥1n\ge1n≥1 and real symmetric SSS such that every complex eigenvalue zzz of SSS satisfies ∣z∣<2π|z|<2\pi∣z∣<2π and det⁡S≠0\det S\ne0detS=0,

2μ(t↦exp⁡(tJnS))=σ(S);2\mu(t\mapsto\exp(tJ_nS))=\sigma(S);2μ(t↦exp(tJn​S))=σ(S);

(vii) for every n≥1n\ge1n≥1 and admissible ppp,

(−1) n−μ(p)=sign⁡det⁡(I−p(1)),(-1)^{\,n-\mu(p)}=\operatorname{sign}\det(I-p(1)),(−1)n−μ(p)=signdet(I−p(1)),

where the exponent is an integer and the power is taken in R\mathbb RR; and (viii) for every n≥1n\ge1n≥1 and admissible ppp,

μ(t↦p(t)−1)=μ(t↦p(t)T),μ(t↦p(t)T)=−μ(p).\mu(t\mapsto p(t)^{-1}) =\mu(t\mapsto p(t)^{\mathsf T}), \qquad \mu(t\mapsto p(t)^{\mathsf T})=-\mu(p).μ(t↦p(t)−1)=μ(t↦p(t)T),μ(t↦p(t)T)=−μ(p).

All dimension quantifiers in these eight statements exclude n=0n=0n=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by Gohan · Oct 31, 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