Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 41

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.dimension_two_exponential_index

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

prove2quantum

Let SSS be a real symmetric nonsingular 2×22\times22×2 matrix, let T>0T>0T>0, and assume eTJ0S≠Ie^{TJ_0S}\ne IeTJ0​S=I. Write σ=Sign⁡S\sigma=\operatorname{Sign}Sσ=SignS, and let a1,a2a_1,a_2a1​,a2​ be its eigenvalues, so a1a2=det⁡Sa_1a_2=\det Sa1​a2​=detS. For γ(t)=etJ0S\gamma(t)=e^{tJ_0S}γ(t)=etJ0​S on [0,T][0,T][0,T],

μCZ(γ)={(12+⌊a1a2 T/(2π)⌋)σ,σ≠0,0,σ=0.\mu_{\rm CZ}(\gamma)=\begin{cases}\bigl(\tfrac12+\lfloor\sqrt{a_1a_2}\,T/(2\pi)\rfloor\bigr)\sigma,&\sigma\ne0,\\0,&\sigma=0.\end{cases}μCZ​(γ)={(21​+⌊a1​a2​​T/(2π)⌋)σ,0,​σ=0,σ=0.​

The square root is used only in the definite branch. The floor argument follows the period calculation on p.44: duration multiplies the square root, rather than lying under it in a reading of the printed (46). This computes both orientations of rotation and the indefinite case.

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 41, PDF pp.43–44. Printed (46) has sqrt(a1*a2*T); change only
its floor argument to sqrt(a1*a2)*T, as required by the p.44 period
2*pi/sqrt(a1*a2) and concluding formula. Use det S=a1*a2; both definite
signs and the indefinite case are retained. S=I, T=3*pi gives index 3. -/
theorem dimension_two_exponential_index (S : GroupedRealMatrix 1) (hs : S.transpose = S)
    (hnd : S.det ≠ 0) (T : ℝ) (hT : 0 < T) (hend : exponentialPath S T ≠ 1) :
    conleyZehnder (exponentialPath S) T = if matrixSignature S = 0 then 0 else
      (2*Int.floor (Real.sqrt S.det*T/(2*Real.pi))+1)*(matrixSignature S/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. 43, Proposition 41
Read-back

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

Let SSS be any real 2×22\times22×2 matrix satisfying ST=SS^{\mathsf T}=SST=S and det⁡S≠0\det S\ne0detS=0, let T>0T>0T>0, and put Ω=(01−10)\Omega=\begin{pmatrix}0&1\\-1&0\end{pmatrix}Ω=(0−1​10​), J=−ΩJ=-\OmegaJ=−Ω, and pS(t)=exp⁡(tJS)p_S(t)=\exp(tJS)pS​(t)=exp(tJS) for every real ttt. Assume the matrix inequality pS(T)≠I2p_S(T)\ne I_2pS​(T)=I2​. For a real matrix HHH, let σ(H)\sigma(H)σ(H) be the largest dimension of a real subspace on which vTHvv^{\mathsf T}HvvTHv 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 in both maxima. Define the integer CZ⁡(pS,T)\operatorname{CZ}(p_S,T)CZ(pS​,T) as follows. First put u(t)=pS(Tt)u(t)=p_S(Tt)u(t)=pS​(Tt), and choose a function u^:R→Mat⁡2(R)\widehat u:\mathbb R\to\operatorname{Mat}_2(\mathbb R)u:R→Mat2​(R) that is continuous and satisfies u^(t)TJu^(t)=J\widehat u(t)^{\mathsf T}J\widehat u(t)=Ju(t)TJu(t)=J on [0,2][0,2][0,2], agrees with uuu on [0,1][0,1][0,1], has det⁡(u^(t)−I2)≠0\det(\widehat u(t)-I_2)\ne0det(u(t)−I2​)=0 for t∈[1,2]t\in[1,2]t∈[1,2], and ends at either −I2-I_2−I2​ or diag⁡(2,1/2)\operatorname{diag}(2,1/2)diag(2,1/2); if no such function exists, put u^=u\widehat u=uu=u. For any real 2×22\times22×2 matrix AAA, let Λ(A)\Lambda(A)Λ(A) be the set of distinct roots of the characteristic polynomial of its entrywise complexification, let mA(z)m_A(z)mA​(z) be their algebraic multiplicities, and let κA(z)\kappa_A(z)κA​(z) be the largest k∈{0,…,4}k\in\{0,\ldots,4\}k∈{0,…,4} for which a real kkk-dimensional subspace of ker⁡(AC−zI)2\ker(A_{\mathbb C}-zI)^2ker(AC​−zI)2 has Im⁡(xy‾−yx‾)>0\operatorname{Im}(x\overline y-y\overline x)>0Im(xy​−yx)>0 on every nonzero (x,y)(x,y)(x,y). Set

ρ(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⌋,

with empty sum 000 and empty product 111. Then CZ⁡(pS,T)\operatorname{CZ}(p_S,T)CZ(pS​,T) is a chosen integer kkk admitting a continuous θ:[0,2]→R\theta:[0,2]\to\mathbb Rθ:[0,2]→R with θ(0)=0\theta(0)=0θ(0)=0, θ(2)=k\theta(2)=kθ(2)=k, and ρ(u^(t))2=e2πiθ(t)\rho(\widehat u(t))^2=e^{2\pi i\theta(t)}ρ(u(t))2=e2πiθ(t) on [0,2][0,2][0,2], or 000 if no such integer exists. The assertion is

CZ⁡(pS,T)={0,σ(S)=0,(2⌊det⁡S T2π⌋+1)(σ(S)div2),σ(S)≠0,\operatorname{CZ}(p_S,T)= \begin{cases} 0,&\sigma(S)=0,\\[2mm] \displaystyle \left(2\left\lfloor\frac{\sqrt{\det S}\,T}{2\pi}\right\rfloor+1\right) \left(\sigma(S)\mathbin{\mathrm{div}}2\right),&\sigma(S)\ne0, \end{cases}CZ(pS​,T)=⎩⎨⎧​0,(2⌊2πdetS​T​⌋+1)(σ(S)div2),​σ(S)=0,σ(S)=0,​

where div\mathrm{div}div is integer division, hence rounding down when dividing by the positive integer 222, and the real square root is the total real square root, equal to 000 for negative arguments.

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