Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 26

Open
QAlgorithms.Papers.Independent.Gap50repair.P01.simple_semisimple_dense

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). For every ε>0\varepsilon>0ε>0 there is a real symplectic matrix BBB such that

∥B−A∥F<ε,\|B-A\|_{\rm F}<\varepsilon,∥B−A∥F​<ε,

and BBB has distinct complex eigenvalues and is diagonalizable over C\mathbb CC. Explicitly, some invertible complex matrix PPP conjugates BBB to a diagonal matrix. Frobenius distance gives the ordinary finite-dimensional topology, so this is the stated density of semisimple symplectic matrices with distinct eigenvalues. No eigenvalue multiplicity condition has been dropped.

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 26, PDF pp.30–31; 'distinct eigenvalues' and diagonalization are retained. -/
theorem simple_semisimple_dense {n : ℕ} (A : GroupedRealMatrix n) (hA : IsSymplectic A) :
    ∀ eps : ℝ, 0 < eps → ∃ B : GroupedRealMatrix n,
      IsSymplectic B ∧ dist B A < eps ∧ (complexify B).charpoly.roots.Nodup ∧
      ∃ P : CMat n, ∃ d : Coord n → ℂ,
        P.det ≠ 0 ∧ P⁻¹*complexify B*P = Matrix.diagonal d := 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. 30, Proposition 26
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​), every positive real number ε\varepsilonε admits a real 2n×2n2n\times2n2n×2n matrix BBB such that BTJB=JB^TJB=JBTJB=J, dist⁡(B,A)<ε\operatorname{dist}(B,A)<\varepsilondist(B,A)<ε in the matrix metric, and the multiset of complex roots of the characteristic polynomial of BCB_{\mathbb C}BC​ has no repetitions. Moreover, there exist a complex 2n×2n2n\times2n2n×2n matrix PPP and a function d:Fin⁡(n)⊕Fin⁡(n)→Cd:\operatorname{Fin}(n)\oplus\operatorname{Fin}(n)\to\mathbb Cd:Fin(n)⊕Fin(n)→C such that

det⁡P≠0,P−1BCP=diag⁡(d),\det P\ne0,\qquad P^{-1}B_{\mathbb C}P=\operatorname{diag}(d),detP=0,P−1BC​P=diag(d),

where BCB_{\mathbb C}BC​ is obtained by casting each entry of BBB into C\mathbb CC. The case n=0n=0n=0 is included: the root multiset and diagonal are empty, and the empty determinant is 111.

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