Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 31

Proved
QAlgorithms.Papers.Independent.Gap50repair.P01.positive_eigenvalue_component

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

prove2quantum

Let A∈Sp⁡(2n,R)A\in\operatorname{Sp}(2n,\mathbb R)A∈Sp(2n,R) with det⁡(A−I)≠0\det(A-I)\ne0det(A−I)=0. Let m+(A)m_+(A)m+​(A) be the total algebraic multiplicity of its real positive eigenvalues; repeated roots are counted repeatedly. Then

det⁡(A−I)>0⟺4∣m+(A).\det(A-I)>0\quad\Longleftrightarrow\quad 4\mid m_+(A).det(A−I)>0⟺4∣m+​(A).

This identifies the positive component using the spectrum. Counting distinct spectral values instead of algebraic multiplicities would give a different statement.

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 31, PDF p.34: real positive eigenvalues counted with multiplicity. -/
theorem positive_eigenvalue_component {n : ℕ} (A : GroupedRealMatrix n)
    (hA : IsSymplectic A) (hend : (A-1).det ≠ 0) :
    0 < (A-1).det ↔ 4 ∣ ∑ z ∈ (eigenvalues A).filter (fun z => z.im = 0 ∧ 0 < z.re),
      algebraicMultiplicity 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. 34, Remark 31
Read-back

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

For every natural number nnn and every real 2n×2n2n\times2n2n×2n matrix AAA satisfying ATJA=JA^TJA=JATJA=J, where J=(0−InIn0)J=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}J=(0In​​−In​0​), assume det⁡(A−I)≠0\det(A-I)\ne0det(A−I)=0. Let E(A)E(A)E(A) be the set of distinct complex roots of the characteristic polynomial of the entrywise complexification ACA_{\mathbb C}AC​, and let mA(z)m_A(z)mA​(z) denote the algebraic multiplicity of zzz. Then

0<det⁡(A−I)⟺4 divides ⁣∑z∈E(A)Im⁡z=0, Re⁡z>0mA(z).0<\det(A-I) \quad\Longleftrightarrow\quad 4\ \text{divides}\! \sum_{\substack{z\in E(A)\\ \operatorname{Im}z=0,\ \operatorname{Re}z>0}} m_A(z).0<det(A−I)⟺4 dividesz∈E(A)Imz=0, Rez>0​∑​mA​(z).

The sum counts all positive real characteristic roots with their algebraic multiplicities, and an empty sum is 000, which is divisible by 444. The case n=0n=0n=0 is included; its determinant is 111 and its sum is 000.

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