Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cited image-index characterization

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.image_index_characterization

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

prove2quantum

For every n≥1n\ge1n≥1, fix the vertical Lagrangian Vn={0}×RnV_n=\{0\}\times\mathbb R^nVn​={0}×Rn and let νn(γ)=μRS(γVn,Vn)\nu_n(\gamma)=\mu_{\rm RS}(\gamma V_n,V_n)νn​(γ)=μRS​(γVn​,Vn​) for continuous symplectic matrix paths on [0,1][0,1][0,1] with arbitrary endpoints. This half-integer dimension family satisfies the following properties and is the unique half-integer family satisfying all of them:

  1. For paths with the same matrix endpoints, fixed-endpoint homotopy holds if and only if their νn\nu_nνn​ values agree; in particular the index is homotopy invariant.
  2. Catenation of paths with matching endpoints is additive.
  3. Grouped symplectic direct sums are additive across positive dimensions.
  4. If dim⁡(γ(t)Vn∩Vn)=k\dim(\gamma(t)V_n\cap V_n)=kdim(γ(t)Vn​∩Vn​)=k is constant for t∈[0,1]t\in[0,1]t∈[0,1], where 0≤k≤n0\le k\le n0≤k≤n, then νn(γ)=0\nu_n(\gamma)=0νn​(γ)=0.
  5. For every continuous path B(t)B(t)B(t) of real symmetric nnn by nnn matrices,
νn ⁣(t↦(IB(t)0I))=12Sign⁡B(0)−12Sign⁡B(1).\nu_n\!\left(t\mapsto\begin{pmatrix}I&B(t)\\0&I\end{pmatrix}\right) =\tfrac12\operatorname{Sign}B(0)-\tfrac12\operatorname{Sign}B(1).νn​(t↦(I0​B(t)I​))=21​SignB(0)−21​SignB(1).

Here Sign⁡\operatorname{Sign}Sign counts positive minus negative inertia, including zero eigenvalues. Uniqueness compares assignments on every valid path in every positive dimension. These properties characterize the image index separately from the graph index.

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)

/-- Cited image-index characterization [9], PDF p.58: satisfaction of all
five properties and uniqueness of the half-integer dimension family.
Printed: the product bullet names mu_RS2 but writes mu_RS in its equation.
Changed: every term in that bullet is mu_RS2, as forced by its subject and
Theorem 45(3). This correction requires fresh independent moderation. -/
theorem image_index_characterization :
    ImageIndexAxioms (fun _ p => robbinSalamonVertical p) ∧
    (∀ f, ImageIndexAxioms f → ∀ n, 1 ≤ n →
      ∀ p : ℝ → GroupedRealMatrix n, IsPath p 1 → f n p = robbinSalamonVertical 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. 58, Cited image-index characterization
Read-back

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

Use coordinates (x,y)∈Rn⊕Rn(x,y)\in\mathbb R^n\oplus\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 call AAA symplectic when ATJnA=JnA^{\mathsf T}J_nA=J_nATJn​A=Jn​. A path is a function p:R→R2n×2np:\mathbb R\to\mathbb R^{2n\times2n}p:R→R2n×2n continuous and symplectic on [0,1][0,1][0,1]. A homotopy with fixed endpoints from ppp to qqq is a function H:R2→R2n×2nH:\mathbb R^2\to\mathbb R^{2n\times2n}H:R2→R2n×2n, continuous and symplectic on [0,1]2[0,1]^2[0,1]2, with 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) for every s,t∈[0,1]s,t\in[0,1]s,t∈[0,1]. Define the rational-valued family RnvR_n^{\mathrm v}Rnv​ as follows. For any function ppp, set

Kpv(t)={(x,y):x=0, (p(t)(x,y))x=0},ω(v,w)=∑j(vxjwyj−vyjwxj),K_p^{\mathrm v}(t)= \{(x,y):x=0,\ (p(t)(x,y))_x=0\}, \qquad \omega(v,w)=\sum_j(v_{x_j}w_{y_j}-v_{y_j}w_{x_j}),Kpv​(t)={(x,y):x=0, (p(t)(x,y))x​=0},ω(v,w)=j∑​(vxj​​wyj​​−vyj​​wxj​​),

and set bp,t(v,w)=ω(p(t)v,p˙(t)w)b_{p,t}(v,w)=\omega(p(t)v,\dot p(t)w)bp,t​(v,w)=ω(p(t)v,p˙​(t)w), where p˙(t)\dot p(t)p˙​(t) is the derivative within [0,1][0,1][0,1], with the total derivative operation returning zero when no derivative exists. Call ppp vertically regular if it is a path, is infinitely differentiable on [0,1][0,1][0,1], and, for every t∈[0,1]t\in[0,1]t∈[0,1], the only v∈Kpv(t)v\in K_p^{\mathrm v}(t)v∈Kpv​(t) with bp,t(v,w)=0b_{p,t}(v,w)=0bp,t​(v,w)=0 for all w∈Kpv(t)w\in K_p^{\mathrm v}(t)w∈Kpv​(t) is zero. For a real subspace WWW and quadratic function QQQ, define its signature on WWW as the largest dimension of a subspace of WWW on which QQQ is strictly positive on nonzero vectors, minus the largest dimension of a subspace on which it is strictly negative on nonzero vectors; the zero subspace is allowed. Let spv(t)s_p^{\mathrm v}(t)spv​(t) be this signature for Q(v)=bp,t(v,v)Q(v)=b_{p,t}(v,v)Q(v)=bp,t​(v,v) on Kpv(t)K_p^{\mathrm v}(t)Kpv​(t). Let Cpv={t∈(0,1):Kpv(t)≠{0}}C_p^{\mathrm v}=\{t\in(0,1):K_p^{\mathrm v}(t)\ne\{0\}\}Cpv​={t∈(0,1):Kpv​(t)={0}}, and let cpvc_p^{\mathrm v}cpv​ be the sum of spv(t)s_p^{\mathrm v}(t)spv​(t) over this set when it is finite, or zero when it is infinite. Classically choose a vertically regular qqq homotopic to ppp with fixed endpoints if such a qqq exists, and otherwise take q=pq=pq=p; define

Rnv(p)=sqv(0)+2cqv+sqv(1)2.R_n^{\mathrm v}(p)= \frac{s_q^{\mathrm v}(0)+2c_q^{\mathrm v}+s_q^{\mathrm v}(1)}2.Rnv​(p)=2sqv​(0)+2cqv​+sqv​(1)​.

For any family gn(p)∈Qg_n(p)\in\mathbb Qgn​(p)∈Q defined for every natural number nnn and every real-matrix-valued function ppp, consider these six conditions: (i) for every n≥1n\ge1n≥1 and path ppp, gn(p)=k/2g_n(p)=k/2gn​(p)=k/2 for some k∈Zk\in\mathbb Zk∈Z; (ii) for every n≥1n\ge1n≥1 and paths p,qp,qp,q sharing their initial and terminal matrices, a homotopy with fixed endpoints exists if and only if gn(p)=gn(q)g_n(p)=g_n(q)gn​(p)=gn​(q); (iii) for every n≥1n\ge1n≥1 and paths p,qp,qp,q with p(1)=q(0)p(1)=q(0)p(1)=q(0), gn(p∗q)=gn(p)+gn(q)g_n(p*q)=g_n(p)+g_n(q)gn​(p∗q)=gn​(p)+gn​(q), where (p∗q)(t)=p(2t)(p*q)(t)=p(2t)(p∗q)(t)=p(2t) for t≤1/2t\le1/2t≤1/2 and q(2t−1)q(2t-1)q(2t−1) for t>1/2t>1/2t>1/2; (iv) for every n,m≥1n,m\ge1n,m≥1 and paths p,qp,qp,q of sizes 2n,2m2n,2m2n,2m, gn+m(t↦p(t)⊕sq(t))=gn(p)+gm(q)g_{n+m}(t\mapsto p(t)\oplus_s q(t))=g_n(p)+g_m(q)gn+m​(t↦p(t)⊕s​q(t))=gn​(p)+gm​(q), where the sum acts separately on the two coordinate spaces ordered as (xp,xq,yp,yq)(x_p,x_q,y_p,y_q)(xp​,xq​,yp​,yq​); (v) for every n≥1n\ge1n≥1, path ppp, and natural number k≤nk\le nk≤n, including zero, if dim⁡RKpv(t)=k\dim_{\mathbb R}K_p^{\mathrm v}(t)=kdimR​Kpv​(t)=k for all t∈[0,1]t\in[0,1]t∈[0,1], then gn(p)=0g_n(p)=0gn​(p)=0; and (vi) for every n≥1n\ge1n≥1 and every B:R→Rn×nB:\mathbb R\to\mathbb R^{n\times n}B:R→Rn×n continuous and symmetric on [0,1][0,1][0,1],

gn ⁣(t↦(InB(t)0In))=σ(B(0))−σ(B(1))2,g_n\!\left(t\mapsto \begin{pmatrix}I_n&B(t)\\0&I_n\end{pmatrix}\right) =\frac{\sigma(B(0))-\sigma(B(1))}{2},gn​(t↦(In​0​B(t)In​​))=2σ(B(0))−σ(B(1))​,

where σ(C)\sigma(C)σ(C) is the signature just defined on the full real coordinate space for Q(v)=vTCvQ(v)=v^{\mathsf T}CvQ(v)=vTCv. The declaration asserts that the family RvR^{\mathrm v}Rv satisfies all six conditions and that, for every family fff satisfying all six, every n≥1n\ge1n≥1, and every path ppp of size 2n2n2n, fn(p)=Rnv(p)f_n(p)=R_n^{\mathrm v}(p)fn​(p)=Rnv​(p). The asserted agreement concerns positive dimensions and paths only; it imposes no equality in dimension zero or on functions that are not paths.

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