Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 54

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.shear_endpoint_signatures

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

prove2quantum

Let B:[0,1]→Mat⁡(n,R)B:[0,1]\to\operatorname{Mat}(n,\mathbb R)B:[0,1]→Mat(n,R) be continuous with each B(t)B(t)B(t) symmetric. For the upper symplectic shear ψ(t)=(IB(t)0I)\psi(t)=\left(\begin{smallmatrix}I&B(t)\\0&I\end{smallmatrix}\right)ψ(t)=(I0​B(t)I​),

μRS(ψ)=12Sign⁡B(0)−12Sign⁡B(1).\mu_{\rm RS}(\psi)=\tfrac12\operatorname{Sign}B(0)-\tfrac12\operatorname{Sign}B(1).μRS​(ψ)=21​SignB(0)−21​SignB(1).

Signatures count positive minus negative inertia, including zero eigenvalues. No regular-crossing or nonsingularity hypothesis is imposed. This fixes the shear sign convention for arbitrary continuous symmetric paths.

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 54, PDF pp.51–52: only continuity and symmetry, no regularity assumption. -/
theorem shear_endpoint_signatures {n : ℕ} (B : ℝ → Matrix (Fin n) (Fin n) ℝ)
    (hc : ContinuousOn B (Set.Icc (0 : ℝ) 1))
    (hs : ∀ t ∈ Set.Icc (0 : ℝ) 1, (B t).transpose = B t) :
    robbinSalamon (fun t => shear (B t)) =
      (matrixSignature (B 0) : ℚ)/2 - (matrixSignature (B 1) : ℚ)/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. 51, Proposition 54
Read-back

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

Let nnn be any natural number, including 000, and let B:R→Mat⁡n(R)B:\mathbb R\to\operatorname{Mat}_n(\mathbb R)B:R→Matn​(R) be continuous on [0,1][0,1][0,1] and satisfy B(t)T=B(t)B(t)^{\mathsf T}=B(t)B(t)T=B(t) for every ttt in that interval. Put hB(t)=(InB(t)0In)h_B(t)=\begin{pmatrix}I_n&B(t)\\0&I_n\end{pmatrix}hB​(t)=(In​0​B(t)In​​). For any real square matrix HHH of size ddd, define σ(H)\sigma(H)σ(H) to be the largest dimension of a subspace of Rd\mathbb R^dRd on which vTHvv^{\mathsf T}HvvTHv is strictly positive for all nonzero vectors, minus the corresponding largest dimension for strict negativity, with the zero subspace allowed. To define the rational-valued function RS⁡\operatorname{RS}RS on functions into real 2n×2n2n\times2n2n×2n matrices, put Ω=(0In−In0)\Omega=\begin{pmatrix}0&I_n\\-I_n&0\end{pmatrix}Ω=(0−In​​In​0​), J=−ΩJ=-\OmegaJ=−Ω, and ω((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′​). For any such 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 put 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). A function is regular if it is continuous and infinitely differentiable on [0,1][0,1][0,1], satisfies h(t)TJh(t)=Jh(t)^{\mathsf T}Jh(t)=Jh(t)TJh(t)=J there, and for every ttt and v∈Fh(t)v\in F_h(t)v∈Fh​(t), vanishing of bh,t(v,w)b_{h,t}(v,w)bh,t​(v,w) for all w∈Fh(t)w\in F_h(t)w∈Fh​(t) implies v=0v=0v=0. Choose a regular h^\widehat hh joined to hhh by a continuous homotopy HHH on [0,1]2[0,1]^2[0,1]2 through matrices satisfying H(s,t)TJH(s,t)=JH(s,t)^{\mathsf T}JH(s,t)=JH(s,t)TJH(s,t)=J, with H(0,t)=h(t)H(0,t)=h(t)H(0,t)=h(t), H(1,t)=h^(t)H(1,t)=\widehat h(t)H(1,t)=h(t) and endpoint values H(s,0)=h(0)H(s,0)=h(0)H(s,0)=h(0), H(s,1)=h(1)H(s,1)=h(1)H(s,1)=h(1), if one exists, and otherwise use h^=h\widehat h=hh=h. Let sh^(t)s_{\widehat h}(t)sh​(t) be the difference between the largest dimensions of subspaces of Fh^(t)F_{\widehat h}(t)Fh​(t) on which bh^,t(v,v)b_{\widehat h,t}(v,v)bh,t​(v,v) is respectively strictly positive and strictly negative on all nonzero vectors. Let I(h^)I(\widehat h)I(h) be the sum of these signatures over the interior times with Fh^(t)≠{0}F_{\widehat h}(t)\ne\{0\}Fh​(t)={0} when that set is finite, and 000 otherwise. Define RS⁡(h)=(sh^(0)+2I(h^)+sh^(1))/2\operatorname{RS}(h)=(s_{\widehat h}(0)+2I(\widehat h)+s_{\widehat h}(1))/2RS(h)=(sh​(0)+2I(h)+sh​(1))/2, with the within-interval derivative assigned zero when differentiability fails. Then

RS⁡(hB)=σ(B(0))2−σ(B(1))2in Q.\operatorname{RS}(h_B)=\frac{\sigma(B(0))}{2}-\frac{\sigma(B(1))}{2}\quad\text{in }\mathbb Q.RS(hB​)=2σ(B(0))​−2σ(B(1))​in Q.

No differentiability of BBB is assumed, and n=0n=0n=0 is included with empty matrices and zero-dimensional subspaces.

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