Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 14

Proved
QAlgorithms.Papers.Independent.Gap50repair.P01.generalized_kernel_orthogonal_range

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

prove2quantum

Let AAA be a real symplectic matrix and let λ\lambdaλ be a complex eigenvalue. Extend AAA and Ω0\Omega_0Ω0​ complex linearly. For every integer j≥0j\ge0j≥0,

ker⁡(A−λI)j=(im⁡(A−λ−1I)j)⊥Ω0.\ker(A-\lambda I)^j=\bigl(\operatorname{im}(A-\lambda^{-1}I)^j\bigr)^{\perp_{\Omega_0}}.ker(A−λI)j=(im(A−λ−1I)j)⊥Ω0​​.

The orthogonal complement is for the complex bilinear symplectic form, with no conjugation. Symplecticity implies λ≠0\lambda\ne0λ=0. At j=0j=0j=0, the kernel is zero and the image is the whole complexified space. This is the annihilator identity behind the quotient pairings.

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)

/-- Lemma 14, PDF pp.13–14; complex bilinear orthogonal, no conjugation. -/
theorem generalized_kernel_orthogonal_range {n : ℕ} (A : GroupedRealMatrix n)
    (hA : IsSymplectic A) (z : ℂ) (hz : IsEigenvalue A z) (j : ℕ) :
    ∀ v : Coord n → ℂ, (shifted A z^j) v = 0 ↔
      ∀ w ∈ LinearMap.range (shifted A z⁻¹^j), omegaC v w = 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. 13, Lemma 14
Read-back

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

For every natural number nnn, let VC=Cn⊕CnV_{\mathbb C}=\mathbb C^n\oplus\mathbb C^nVC​=Cn⊕Cn, let J=(0−InIn0)J=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}J=(0In​​−In​0​), and define the complex bilinear form ω((x,y),(x′,y′))=∑a=0n−1(xaya′−yaxa′)\omega((x,y),(x',y'))=\sum_{a=0}^{n-1}(x_a y'_a-y_a x'_a)ω((x,y),(x′,y′))=∑a=0n−1​(xa​ya′​−ya​xa′​). For every real 2n×2n2n\times2n2n×2n matrix AAA satisfying ATJA=JA^TJA=JATJA=J, every z∈Cz\in\mathbb Cz∈C for which there exists a nonzero ξ∈VC\xi\in V_{\mathbb C}ξ∈VC​ with (A−zI)ξ=0(A-zI)\xi=0(A−zI)ξ=0, every natural number jjj, and every v∈VCv\in V_{\mathbb C}v∈VC​,

(A−zI)jv=0⟺ω(v,w)=0 for every w∈range⁡C(A−z−1I)j.(A-zI)^jv=0 \quad\Longleftrightarrow\quad \omega(v,w)=0\ \text{for every }w\in\operatorname{range}_{\mathbb C}(A-z^{-1}I)^j.(A−zI)jv=0⟺ω(v,w)=0 for every w∈rangeC​(A−z−1I)j.

Here AAA acts through its entrywise complexification, and z−1z^{-1}z−1 uses the total complex inverse, with 0−1=00^{-1}=00−1=0. The case j=0j=0j=0 is included, so both powers are identity operators. The dimension n=0n=0n=0 is also quantified over, although its required nonzero eigenvector cannot exist.

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