Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 40

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.normalized_complex_determinant_degree

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

prove2quantum

For A∈Sp⁡(2n,R)A\in\operatorname{Sp}(2n,\mathbb R)A∈Sp(2n,R) put CA=12(A−J0AJ0)C_A=\tfrac12(A-J_0AJ_0)CA​=21​(A−J0​AJ0​). This real matrix is invertible, and its complex determinant is nonzero. Define ρ^(A)=det⁡CCA/∣det⁡CCA∣\widehat\rho(A)=\det_\mathbb C C_A/|\det_\mathbb C C_A|ρ​(A)=detC​CA​/∣detC​CA​∣. For n≥1n\ge1n≥1, any admissible path γ\gammaγ and any admissible extension eee satisfy

μCZ(γ)=deg⁡(ρ^ 2∘e).\mu_{\rm CZ}(\gamma)=\deg(\widehat\rho^{\,2}\circ e).μCZ​(γ)=deg(ρ​2∘e).

The denominator is an absolute value, as printed in (45); invertibility is established from symplecticity and is not an extra input hypothesis. This is the normalized complex-linear-part formula.

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)

/-- Corollary 40, PDF p.42; absolute-value denominator visually verified.
Invertibility is a conclusion from symplecticity. -/
theorem normalized_complex_determinant_degree {n : ℕ} (hn : 1 ≤ n)
    (p e : ℝ → GroupedRealMatrix n) (hp : IsAdmissible p 1) (he : IsExtension p e) :
    (∀ A : GroupedRealMatrix n, IsSymplectic A →
      (complexLinearPart A).det ≠ 0 ∧ complexActionDet (complexLinearPart A) ≠ 0) ∧
    conleyZehnder p 1 = winding (fun t => normalizedDet (e t)^2) 2 := 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. 42, Corollary 40
Read-back

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

For every integer n≥1n\ge1n≥1, put Ω=(0In−In0)\Omega=\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix}Ω=(0−In​​In​0​) and J=−ΩJ=-\OmegaJ=−Ω, and call a real 2n×2n2n\times2n2n×2n matrix AAA symplectic when ATJA=JA^{\mathsf T}JA=JATJA=J. Let p,e:R→Mat⁡2n(R)p,e:\mathbb R\to\operatorname{Mat}_{2n}(\mathbb R)p,e:R→Mat2n​(R) satisfy these assumptions: ppp is continuous and symplectic on [0,1][0,1][0,1], 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; eee is continuous and symplectic on [0,2][0,2][0,2], agrees with ppp on [0,1][0,1][0,1], satisfies det⁡(e(t)−I2n)≠0\det(e(t)-I_{2n})\ne0det(e(t)−I2n​)=0 throughout [1,2][1,2][1,2], and ends at either −I2n-I_{2n}−I2n​ or the diagonal matrix with first position entry 222, first momentum entry 1/21/21/2, and all remaining diagonal entries −1-1−1. For any real matrix AAA, put A+=12(A−JAJ)A_+=\frac12(A-JAJ)A+​=21​(A−JAJ), define C(A)ij=Axixj+iAyixjC(A)_{ij}=A_{x_i x_j}+iA_{y_i x_j}C(A)ij​=Axi​xj​​+iAyi​xj​​, and set N(A)=det⁡CC(A+)/∣det⁡CC(A+)∣N(A)=\det_{\mathbb C}C(A_+)/|\det_{\mathbb C}C(A_+)|N(A)=detC​C(A+​)/∣detC​C(A+​)∣, with the real denominator regarded as complex and with division by zero assigned the value 000. For a function f:R→Cf:\mathbb R\to\mathbb Cf:R→C, its winding on [0,L][0,L][0,L] is a chosen integer kkk admitting a continuous real θ\thetaθ on that interval with θ(0)=0\theta(0)=0θ(0)=0, θ(L)=k\theta(L)=kθ(L)=k, and f(t)=e2πiθ(t)f(t)=e^{2\pi i\theta(t)}f(t)=e2πiθ(t), or 000 if no such integer exists. For a real matrix AAA, let Λ(A)\Lambda(A)Λ(A) be its distinct complex eigenvalues, mA(z)m_A(z)mA​(z) their algebraic multiplicities, and κA(z)\kappa_A(z)κA​(z) the largest k∈{0,…,4n}k\in\{0,\ldots,4n\}k∈{0,…,4n} for which there is a real kkk-dimensional subspace of ker⁡(AC−zI)2n\ker(A_{\mathbb C}-zI)^{2n}ker(AC​−zI)2n on which every nonzero (x,y)(x,y)(x,y) satisfies Im⁡∑j(xjyj‾−yjxj‾)>0\operatorname{Im}\sum_j(x_j\overline{y_j}-y_j\overline{x_j})>0Im∑j​(xj​yj​​−yj​xj​​)>0, where ACA_{\mathbb C}AC​ is entrywise complexification. Put

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

using 000 for an empty sum and 111 for an empty product, and define CZ⁡(p,1)\operatorname{CZ}(p,1)CZ(p,1) to be the winding on [0,2][0,2][0,2] of ρ(p^(t))2\rho(\widehat p(t))^2ρ(p​(t))2, where p^\widehat pp​ is a chosen extension satisfying the conditions imposed on eee if one exists, and is ppp otherwise. The assertion is the conjunction

[∀A∈Mat⁡2n(R), ATJA=J ⟹ det⁡RA+≠0 and det⁡CC(A+)≠0]andCZ⁡(p,1)=wind⁡[0,2](t↦N(e(t))2).\left[ \forall A\in\operatorname{Mat}_{2n}(\mathbb R),\ A^{\mathsf T}JA=J \ \Longrightarrow\ \det_{\mathbb R}A_+\ne0 \ \text{and}\ \det_{\mathbb C}C(A_+)\ne0 \right] \quad\text{and}\quad \operatorname{CZ}(p,1) = \operatorname{wind}_{[0,2]}\bigl(t\mapsto N(e(t))^2\bigr).[∀A∈Mat2n​(R), ATJA=J ⟹ Rdet​A+​=0 and Cdet​C(A+​)=0]andCZ(p,1)=wind[0,2]​(t↦N(e(t))2).
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).

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