Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 52

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.robbin_salamon_classical_agreement

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

prove2quantum

Let n≥1n\ge1n≥1 and let ψ:[0,1]→Sp⁡(2n,R)\psi:[0,1]\to\operatorname{Sp}(2n,\mathbb R)ψ:[0,1]→Sp(2n,R) be continuous with ψ(0)=I\psi(0)=Iψ(0)=I and det⁡(ψ(1)−I)≠0\det(\psi(1)-I)\ne0det(ψ(1)−I)=0. Then μRS(ψ)=μCZ(ψ)\mu_{\rm RS}(\psi)=\mu_{\rm CZ}(\psi)μRS​(ψ)=μCZ​(ψ). If in addition ψ\psiψ is smooth and all its crossings are regular, put S0=−J0ψ˙0S_0=-J_0\dot\psi_0S0​=−J0​ψ˙​0​. Then

μCZ(ψ)=12Sign⁡S0+∑0<t<1t crossingSign⁡Γ(ψ,t).\mu_{\rm CZ}(\psi)=\tfrac12\operatorname{Sign}S_0+\sum_{0<t<1\atop t\ \rm crossing}\operatorname{Sign}\Gamma(\psi,t).μCZ​(ψ)=21​SignS0​+t crossing0<t<1​∑​SignΓ(ψ,t).

The initial kernel is the full space and the final kernel is zero. This includes both the equality of the two definitions and its crossing-form consequence.

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 52, PDF pp.50–51: agreement and the in-particular formula. -/
theorem robbin_salamon_classical_agreement {n : ℕ} (hn : 1 ≤ n)
    (p : ℝ → GroupedRealMatrix n) (hp : IsAdmissible p 1) :
    robbinSalamon p = (conleyZehnder p 1 : ℚ) ∧
    (IsRegular false p → (conleyZehnder p 1 : ℚ) =
      (matrixSignature (-jMatrix n*pathDerivative p 0) : ℚ)/2 +
        (interiorCrossingSum false p : ℚ)) := 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. 50, Proposition 52
Read-back

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

Let n≥1n\ge1n≥1, put V=Rn⊕RnV=\mathbb R^n\oplus\mathbb R^nV=Rn⊕Rn, Ω=(0In−In0)\Omega=\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix}Ω=(0−In​​In​0​) and J=−ΩJ=-\OmegaJ=−Ω, and let p:R→Mat⁡2n(R)p:\mathbb R\to\operatorname{Mat}_{2n}(\mathbb R)p:R→Mat2n​(R) be continuous on [0,1][0,1][0,1], satisfy p(t)TJp(t)=Jp(t)^{\mathsf T}Jp(t)=Jp(t)TJp(t)=J there, and have 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. For a real quadratic expression QQQ on a subspace WWW of a finite-dimensional real coordinate space, let sig⁡W(Q)\operatorname{sig}_W(Q)sigW​(Q) be the largest dimension of a subspace of WWW on which QQQ is strictly positive on all nonzero vectors, minus the analogous largest dimension for strict negativity; zero subspaces are allowed. Write σ(H)=sig⁡V(v↦vTHv)\sigma(H)=\operatorname{sig}_V(v\mapsto v^{\mathsf T}Hv)σ(H)=sigV​(v↦vTHv) for a real 2n×2n2n\times2n2n×2n matrix HHH. For any matrix-valued function hhh, let Fh(t)=ker⁡(h(t)−I2n)F_h(t)=\ker(h(t)-I_{2n})Fh​(t)=ker(h(t)−I2n​), let Dh(t)D_h(t)Dh​(t) be the total derivative within [0,1][0,1][0,1], and set bh,t(v,w)=ω(h(t)v,Dh(t)w)b_{h,t}(v,w)=\omega(h(t)v,D_h(t)w)bh,t​(v,w)=ω(h(t)v,Dh​(t)w) with ω((x,y),(x′,y′))=∑j(xjyj′−yjxj′)\omega((x,y),(x',y'))=\sum_j(x_jy'_j-y_jx'_j)ω((x,y),(x′,y′))=∑j​(xj​yj′​−yj​xj′​). Define sh(t)=sig⁡Fh(t)(v↦bh,t(v,v))s_h(t)=\operatorname{sig}_{F_h(t)}(v\mapsto b_{h,t}(v,v))sh​(t)=sigFh​(t)​(v↦bh,t​(v,v)), and let I(h)I(h)I(h) be the sum of sh(t)s_h(t)sh​(t) over t∈(0,1)t\in(0,1)t∈(0,1) with Fh(t)≠{0}F_h(t)\ne\{0\}Fh​(t)={0} if this set is finite, and 000 otherwise. Call hhh regular if it is continuous, symplectic and infinitely differentiable on [0,1][0,1][0,1] and bh,t(v,w)=0b_{h,t}(v,w)=0bh,t​(v,w)=0 for every w∈Fh(t)w\in F_h(t)w∈Fh​(t) implies v=0v=0v=0 for every v∈Fh(t)v\in F_h(t)v∈Fh​(t) and every t∈[0,1]t\in[0,1]t∈[0,1]. Choose a regular h^\widehat hh joined to hhh by a continuous symplectic homotopy on [0,1]2[0,1]^2[0,1]2 that equals hhh and h^\widehat hh on its two parameter edges and keeps the endpoint matrices h(0),h(1)h(0),h(1)h(0),h(1) fixed, if such a function exists; otherwise take h^=h\widehat h=hh=h. Define RS⁡(h)=(sh^(0)+2I(h^)+sh^(1))/2∈Q\operatorname{RS}(h)=(s_{\widehat h}(0)+2I(\widehat h)+s_{\widehat h}(1))/2\in\mathbb QRS(h)=(sh​(0)+2I(h)+sh​(1))/2∈Q, using the zero derivative when differentiability within the interval fails. To define CZ⁡(p,1)\operatorname{CZ}(p,1)CZ(p,1), choose an extension eee continuous and symplectic on [0,2][0,2][0,2], equal to ppp on [0,1][0,1][0,1], with det⁡(e(t)−I2n)≠0\det(e(t)-I_{2n})\ne0det(e(t)−I2n​)=0 throughout [1,2][1,2][1,2], and with e(2)e(2)e(2) either −I2n-I_{2n}−I2n​ or the diagonal matrix whose first position and momentum entries are 222 and 1/21/21/2 and whose other diagonal entries are −1-1−1; if none exists, take e=pe=pe=p. For each real matrix AAA, let Λ(A)\Lambda(A)Λ(A) be the distinct complex eigenvalues of its entrywise complexification, 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 a real kkk-dimensional subspace of ker⁡(AC−zI)2n\ker(A_{\mathbb C}-zI)^{2n}ker(AC​−zI)2n has 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 on every nonzero (x,y)(x,y)(x,y). 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⌋,

with empty sum 000 and empty product 111. Define CZ⁡(p,1)\operatorname{CZ}(p,1)CZ(p,1) as 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 ρ(e(t))2=e2πiθ(t)\rho(e(t))^2=e^{2\pi i\theta(t)}ρ(e(t))2=e2πiθ(t), or 000 if no such integer exists. The assertion is

RS⁡(p)=CZ⁡(p,1)in Q,p regular ⟹ CZ⁡(p,1)=σ(−JDp(0))2+I(p)in Q.\operatorname{RS}(p)=\operatorname{CZ}(p,1)\quad\text{in }\mathbb Q, \qquad p\text{ regular}\ \Longrightarrow\ \operatorname{CZ}(p,1)=\frac{\sigma(-J D_p(0))}{2}+I(p)\quad\text{in }\mathbb Q.RS(p)=CZ(p,1)in Q,p regular ⟹ CZ(p,1)=2σ(−JDp​(0))​+I(p)in Q.
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