Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 18

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.rotation_first_kind_product

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

prove2quantum

Let n≥1n\ge1n≥1 and A∈Sp⁡(2n,R)A\in\operatorname{Sp}(2n,\mathbb R)A∈Sp(2n,R), and let EλE_\lambdaEλ​ denote its complex generalized eigenspace. The multiplicity r(λ)r(\lambda)r(λ) of an eigenvalue of the first kind is its algebraic multiplicity if ∣λ∣<1|\lambda|<1∣λ∣<1; it is 12dim⁡CEλ\frac12\dim_{\mathbb C}E_\lambda21​dimC​Eλ​ at λ=±1\lambda=\pm1λ=±1; and it is half the real positive inertia of Im⁡Ω0(v,w‾)\operatorname{Im}\Omega_0(v,\overline w)ImΩ0​(v,w) on EλE_\lambdaEλ​ for other ∣λ∣=1|\lambda|=1∣λ∣=1. It is zero when ∣λ∣>1|\lambda|>1∣λ∣>1. Then every eigenvalue is nonzero and

∑λ∈σ(A)r(λ)=n,ρ(A)=∏λ∈σ(A)(λ∣λ∣)r(λ).\sum_{\lambda\in\sigma(A)}r(\lambda)=n,\qquad \rho(A)=\prod_{\lambda\in\sigma(A)}\left(\frac{\lambda}{|\lambda|}\right)^{r(\lambda)}.λ∈σ(A)∑​r(λ)=n,ρ(A)=λ∈σ(A)∏​(∣λ∣λ​)r(λ).

Thus repeated eigenvalues retain their prescribed multiplicity, including the half-multiplicity convention of Definition 17. This gives the first-kind expression for the same rotation map.

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 18 ([12]), PDF p.15, with Definition 17: spectral product (19)
with multiplicities and nonzero denominators. There are n first-kind entries. -/
theorem rotation_first_kind_product {n : ℕ} (hn : 1 ≤ n)
    (A : GroupedRealMatrix n) (hA : IsSymplectic A) :
    (∀ z ∈ eigenvalues A, z ≠ 0) ∧
    (∑ z ∈ eigenvalues A, firstKindMultiplicity A z) = n ∧
    spectralRotation A = ∏ z ∈ eigenvalues A,
      (z/(‖z‖ : ℂ))^(firstKindMultiplicity A z) := 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. 15, Remark 18
Read-back

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

For every natural number n≥1n\geq1n≥1 and every real 2n×2n2n\times2n2n×2n matrix AAA satisfying ATJnA=JnA^{\mathsf T}J_nA=J_nATJn​A=Jn​, where Jn=(0−InIn0)J_n=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}Jn​=(0In​​−In​0​), let E(A)E(A)E(A) be the finite set of distinct complex characteristic roots, let aA(z)a_A(z)aA​(z) be their root multiplicities, and set VA(z)=ker⁡(AC−zI)2nV_A(z)=\ker(A_{\mathbb C}-zI)^{2n}VA​(z)=ker(AC​−zI)2n. Define κA(z)\kappa_A(z)κA​(z) as the maximum k∈{0,…,4n}k\in\{0,\ldots,4n\}k∈{0,…,4n} for which a real subspace W⊆VA(z)W\subseteq V_A(z)W⊆VA​(z) of real dimension kkk satisfies Im⁡∑i=1n(vx,ivy,i‾−vy,ivx,i‾)>0\operatorname{Im}\sum_{i=1}^n(v_{x,i}\overline{v_{y,i}}-v_{y,i}\overline{v_{x,i}})>0Im∑i=1n​(vx,i​vy,i​​−vy,i​vx,i​​)>0 for every nonzero v∈Wv\in Wv∈W. Define mA(z)m_A(z)mA​(z) to be aA(z)a_A(z)aA​(z) when ∣z∣<1|z|<1∣z∣<1, ⌊dim⁡CVA(z)/2⌋\lfloor\dim_{\mathbb C}V_A(z)/2\rfloor⌊dimC​VA​(z)/2⌋ when z=1z=1z=1 or z=−1z=-1z=−1, ⌊κA(z)/2⌋\lfloor\kappa_A(z)/2\rfloor⌊κA​(z)/2⌋ when ∣z∣=1|z|=1∣z∣=1 and z∉{1,−1}z\notin\{1,-1\}z∈/{1,−1}, and zero when ∣z∣>1|z|>1∣z∣>1. Finally define

ρ(A)=(−1)⌊∑z∈E(A), Im⁡z=0, Re⁡z<0aA(z)2⌋∏z∈E(A)∣z∣=1, z≠1, z≠−1z⌊κA(z)/2⌋.\rho(A)= (-1)^{\left\lfloor\frac{\sum_{z\in E(A),\ \operatorname{Im}z=0,\ \operatorname{Re}z<0}a_A(z)}2\right\rfloor} \prod_{\substack{z\in E(A)\\|z|=1,\ z\neq1,\ z\neq-1}} z^{\lfloor\kappa_A(z)/2\rfloor}.ρ(A)=(−1)⌊2∑z∈E(A), Imz=0, Rez<0​aA​(z)​⌋z∈E(A)∣z∣=1, z=1, z=−1​∏​z⌊κA​(z)/2⌋.

The theorem asserts all three conclusions

∀z∈E(A), z≠0,∑z∈E(A)mA(z)=n,ρ(A)=∏z∈E(A)(z∣z∣)mA(z),\forall z\in E(A),\ z\neq0, \qquad \sum_{z\in E(A)}m_A(z)=n, \qquad \rho(A)=\prod_{z\in E(A)} \left(\frac{z}{|z|}\right)^{m_A(z)},∀z∈E(A), z=0,z∈E(A)∑​mA​(z)=n,ρ(A)=z∈E(A)∏​(∣z∣z​)mA​(z),

where ∣z∣|z|∣z∣ in the denominator is viewed as a complex number. The sums and products count each distinct root once, with its contribution determined by the displayed multiplicities; all divisions defining exponents are natural-number division rounded down. The first conclusion ensures that the denominators in the final product are nonzero.

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