Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 59

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.two_zero_stratifications

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

prove2quantum

Let ψ:[0,1]→Sp⁡(2n,R)\psi:[0,1]\to\operatorname{Sp}(2n,\mathbb R)ψ:[0,1]→Sp(2n,R) be continuous, and let V={0}×RnV=\{0\}\times\mathbb R^nV={0}×Rn. The two indices have different vanishing strata:

dim⁡(ψ(t)V∩V)≡k (0≤k≤n) ⟹ μRS2(ψ)=0,\dim(\psi(t)V\cap V)\equiv k\ (0\le k\le n)\ \Longrightarrow\ \mu_{\rm RS2}(\psi)=0,dim(ψ(t)V∩V)≡k (0≤k≤n) ⟹ μRS2​(ψ)=0, dim⁡ker⁡(ψ(t)−I)≡k (0≤k≤2n) ⟹ μRS(ψ)=0.\dim\ker(\psi(t)-I)\equiv k\ (0\le k\le2n)\ \Longrightarrow\ \mu_{\rm RS}(\psi)=0.dimker(ψ(t)−I)≡k (0≤k≤2n) ⟹ μRS​(ψ)=0.

The vertical intersection is represented by its isomorphic pullback V∩ψ(t)−1VV\cap\psi(t)^{-1}VV∩ψ(t)−1V. These are sufficient conditions for zero index, not descriptions of the complete zero sets. Neither assertion restricts the endpoints.

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)

/-- Remark 59, PDF p.59: two distinct constant-intersection stratifications. -/
theorem two_zero_stratifications {n : ℕ} :
    (∀ p : ℝ → GroupedRealMatrix n, IsPath p 1 → ∀ k : ℕ, k ≤ n →
      (∀ t ∈ Set.Icc (0 : ℝ) 1, Module.finrank ℝ (crossingSpace true (p t)) = k) →
        robbinSalamonVertical p = 0) ∧
    (∀ p : ℝ → GroupedRealMatrix n, IsPath p 1 → ∀ k : ℕ, k ≤ 2*n →
      (∀ t ∈ Set.Icc (0 : ℝ) 1, Module.finrank ℝ (crossingSpace false (p t)) = k) →
        robbinSalamon p = 0) := 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. 59, Remark 59
Read-back

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

For every natural number nnn, including n=0n=0n=0, both of the following statements hold. Use coordinates (x,y)∈Rn×Rn(x,y)\in\mathbb R^n\times\mathbb R^n(x,y)∈Rn×Rn, put Jn=(0−InIn0)J_n=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}Jn​=(0In​​−In​0​), and set ω(v,w)=∑i=1n(vx,iwy,i−vy,iwx,i)\omega(v,w)=\sum_{i=1}^n(v_{x,i}w_{y,i}-v_{y,i}w_{x,i})ω(v,w)=∑i=1n​(vx,i​wy,i​−vy,i​wx,i​). For every p:R→R2n×2np:\mathbb R\to\mathbb R^{2n\times2n}p:R→R2n×2n continuous on [0,1][0,1][0,1] with p(t)TJnp(t)=Jnp(t)^{\mathsf T}J_np(t)=J_np(t)TJn​p(t)=Jn​ for all t∈[0,1]t\in[0,1]t∈[0,1]: first, for every natural number k≤nk\leq nk≤n, if Ev(p,t)={v:(p(t)v)x=0, vx=0}E_{\mathrm v}(p,t)=\{v:(p(t)v)_x=0,\ v_x=0\}Ev​(p,t)={v:(p(t)v)x​=0, vx​=0} has real dimension kkk for every t∈[0,1]t\in[0,1]t∈[0,1], then its vertical index is zero; second, for every natural number k≤2nk\leq2nk≤2n, if Eg(p,t)=ker⁡(p(t)−I2n)E_{\mathrm g}(p,t)=\ker(p(t)-I_{2n})Eg​(p,t)=ker(p(t)−I2n​) has real dimension kkk for every t∈[0,1]t\in[0,1]t∈[0,1], then its graph index is zero. Here each index, for a=va=\mathrm va=v or a=ga=\mathrm ga=g, is defined as follows: choose a continuous symplectic path qqq, infinitely differentiable on [0,1][0,1][0,1], homotopic to ppp through continuous symplectic paths with both endpoints fixed, and such that the form bq,t(v,w)=ω(q(t)v,q′(t)w)b_{q,t}(v,w)=\omega(q(t)v,q'(t)w)bq,t​(v,w)=ω(q(t)v,q′(t)w) has zero left kernel on Ea(q,t)E_a(q,t)Ea​(q,t) at every t∈[0,1]t\in[0,1]t∈[0,1], if any such qqq exists; otherwise use q=pq=pq=p. The derivative is taken within [0,1][0,1][0,1], with value zero when that derivative does not exist. The fixed-endpoint homotopy is a continuous H:[0,1]2→R2n×2nH:[0,1]^2\to\mathbb R^{2n\times2n}H:[0,1]2→R2n×2n with symplectic values, 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), H(s,0)=p(0)H(s,0)=p(0)H(s,0)=p(0), and H(s,1)=p(1)H(s,1)=p(1)H(s,1)=p(1). Define σa(q,t)\sigma_a(q,t)σa​(q,t) as the largest dimension of a subspace of Ea(q,t)E_a(q,t)Ea​(q,t) where bq,t(v,v)b_{q,t}(v,v)bq,t​(v,v) is strictly positive for every nonzero vvv, minus the corresponding largest dimension where it is strictly negative. The index is

σa(q,0)+2ca(q)+σa(q,1)2,\frac{\sigma_a(q,0)+2c_a(q)+\sigma_a(q,1)}2,2σa​(q,0)+2ca​(q)+σa​(q,1)​,

where ca(q)c_a(q)ca​(q) is the sum of σa(q,t)\sigma_a(q,t)σa​(q,t) over all t∈(0,1)t\in(0,1)t∈(0,1) with Ea(q,t)≠{0}E_a(q,t)\neq\{0\}Ea​(q,t)={0} if that set is finite, and is zero otherwise. The constant-dimension hypotheses include k=0k=0k=0 and include the endpoints; when n=0n=0n=0, only k=0k=0k=0 is allowed.

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