Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — pairing recursion and terminal-chain identities

Proved
QAlgorithms.Papers.Independent.Intake100.P39.pairing_recursion_and_terminal_identities

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let V=R2nV=\mathbb R^{2n}V=R2n, with grouped symplectic form Ω(x,y)=∑i=1n(xiyn+i−xn+iyi)\Omega(x,y)=\sum_{i=1}^n(x_i y_{n+i}-x_{n+i}y_i)Ω(x,y)=∑i=1n​(xi​yn+i​−xn+i​yi​), and let AAA be a real linear map preserving Ω\OmegaΩ. This is a coordinate formulation in an arbitrary ambient symplectic basis. Write ACA_{\mathbb C}AC​ and ΩC\Omega_{\mathbb C}ΩC​ for their complex-linear and complex-bilinear extensions, Nλ=AC−λIN_\lambda=A_{\mathbb C}-\lambda INλ​=AC​−λI, and Eλ=⋃r≥1ker⁡NλrE_\lambda=\bigcup_{r\ge1}\ker N_\lambda^rEλ​=⋃r≥1​kerNλr​. Let [λ]={λ,λ−1,λˉ,λˉ−1}[\lambda]=\{\lambda,\lambda^{-1},\bar\lambda,\bar\lambda^{-1}\}[λ]={λ,λ−1,λˉ,λˉ−1}, with repetitions removed, and let V[λ]V_{[\lambda]}V[λ]​ be the real subspace whose complexification is ∑μ∈[λ]Eμ\sum_{\mu\in[\lambda]}E_\mu∑μ∈[λ]​Eμ​. A symplectic basis uses the matrix (0I−I0)\left(\begin{smallmatrix}0&I\\-I&0\end{smallmatrix}\right)(0−I​I0​). All transposes below are ordinary transposes.

For λ≠0\lambda\ne0λ=0, v,w∈VCv,w\in V_{\mathbb C}v,w∈VC​, i≥0i\ge0i≥0 and j>0j>0j>0,

ΩC(Nλiv,Nλ−1jw)=−λ−1ΩC(Nλi+1v,Nλ−1jw)−λ−2ΩC(Nλi+1v,Nλ−1j−1w).\Omega_{\mathbb C}(N_\lambda^iv,N_{\lambda^{-1}}^jw)=-\lambda^{-1}\Omega_{\mathbb C}(N_\lambda^{i+1}v,N_{\lambda^{-1}}^jw)-\lambda^{-2}\Omega_{\mathbb C}(N_\lambda^{i+1}v,N_{\lambda^{-1}}^{j-1}w).ΩC​(Nλi​v,Nλ−1j​w)=−λ−1ΩC​(Nλi+1​v,Nλ−1j​w)−λ−2ΩC​(Nλi+1​v,Nλ−1j−1​w).

If v∈Eλv\in E_\lambdav∈Eλ​ has height ppp, meaning Nλpv≠0N_\lambda^pv\ne0Nλp​v=0 and Nλp+1v=0N_\lambda^{p+1}v=0Nλp+1​v=0, then for k,j≥0k,j\ge0k,j≥0 with j≤p+kj\le p+kj≤p+k,

ΩC(Nλp+kv,w)=(−λ2)jΩC(Nλp+k−jv,Nλ−1jw).\Omega_{\mathbb C}(N_\lambda^{p+k}v,w)=(-\lambda^2)^j\Omega_{\mathbb C}(N_\lambda^{p+k-j}v,N_{\lambda^{-1}}^jw).ΩC​(Nλp+k​v,w)=(−λ2)jΩC​(Nλp+k−j​v,Nλ−1j​w).

In particular,

ΩC(Nλpv,w)=(−λ2)pΩC(v,Nλ−1pw),ΩC(Nλkv,Nλ−1jw)=0 if k+j>p.\Omega_{\mathbb C}(N_\lambda^pv,w)=(-\lambda^2)^p\Omega_{\mathbb C}(v,N_{\lambda^{-1}}^pw),\qquad \Omega_{\mathbb C}(N_\lambda^kv,N_{\lambda^{-1}}^jw)=0\text{ if }k+j>p.ΩC​(Nλp​v,w)=(−λ2)pΩC​(v,Nλ−1p​w),ΩC​(Nλk​v,Nλ−1j​w)=0 if k+j>p.

The restriction j≤p+kj\le p+kj≤p+k corrects the undefined negative exponents in printed (12); it does not truncate them to zero.

These are all four terminal-chain identities, with the source formula stated on its defined domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P39
Formal statement
noncomputable section

open scoped BigOperators Matrix

namespace QAlgorithms.Papers.Independent.Intake100.P39

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse only the pinned accepted substrate, with definitionally identical coordinate models.
-- The imported symplectic predicate preserves -Omega0, equivalent to preserving Omega0.

open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)

open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)

open QAlgorithms.Papers.Independent.Gap50repair.P01
  (Coord GroupedRealMatrix omegaMatrix omegaR omegaC shifted generalizedSpace
    IsEigenvalue HasNilpotentHeight restrictedKernel GeneralizedQuotient)

/-- PDF p.9, Lemma 6, (11)–(14). Printed: (12) permits arbitrary j.
Changed: j<=p+k in (12), so its exponent is nonnegative. Why: negative powers
of the singular shifted map are undefined; Nat subtraction must not hide this.
The proof's p versus p+1 nilpotence typo is resolved using VectorHeight. -/
theorem pairing_recursion_and_terminal_identities {n : ℕ} (A : GroupedRealMatrix n)
    (hA : IsSymplectic A) (z : ℂ) (hz : z ≠ 0) :
    (∀ (v w : CVec n) (i j : ℕ), 0 < j →
      omegaC ((shifted A z ^ i) v) ((shifted A z⁻¹ ^ j) w) =
        -z⁻¹ * omegaC ((shifted A z ^ (i + 1)) v) ((shifted A z⁻¹ ^ j) w) -
        (z ^ 2)⁻¹ * omegaC ((shifted A z ^ (i + 1)) v) ((shifted A z⁻¹ ^ (j - 1)) w)) ∧
    (∀ (v w : CVec n) (p : ℕ), v ∈ generalizedSpace A z → VectorHeight A z v p →
      (∀ k j : ℕ, j ≤ p + k → omegaC ((shifted A z ^ (p + k)) v) w =
        (-(z ^ 2)) ^ j * omegaC ((shifted A z ^ (p + k - j)) v) ((shifted A z⁻¹ ^ j) w)) ∧
      omegaC ((shifted A z ^ p) v) w =
        (-(z ^ 2)) ^ p * omegaC v ((shifted A z⁻¹ ^ p) w) ∧
      (∀ k j : ℕ, p < k + j →
        omegaC ((shifted A z ^ k) v) ((shifted A z⁻¹ ^ j) w) = 0)) := by sorry

end QAlgorithms.Papers.Independent.Intake100.P39

end
Source
Normal Forms for Symplectic Matrices, arXiv:1307.2403v2, PDF p. 9, Lemma 6 — pairing recursion and terminal-chain identities
Read-back

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

For every nonnegative integer nnn, real 2n×2n2n\times2n2n×2n matrix AAA satisfying ATJA=JA^{\mathsf T}JA=JATJA=J, with J=(0−InIn0)J=\begin{pmatrix}0&-I_n\\I_n&0\end{pmatrix}J=(0In​​−In​0​), and nonzero z∈Cz\in\mathbb Cz∈C, let Nt=AC−tIN_t=A_{\mathbb C}-tINt​=AC​−tI, Gz=ker⁡Nz2nG_z=\ker N_z^{2n}Gz​=kerNz2n​, and ωC(x,y)=∑ℓ=1n(xℓyn+ℓ−xn+ℓyℓ)\omega_{\mathbb C}(x,y)=\sum_{\ell=1}^n(x_\ell y_{n+\ell}-x_{n+\ell}y_\ell)ωC​(x,y)=∑ℓ=1n​(xℓ​yn+ℓ​−xn+ℓ​yℓ​), where ACA_{\mathbb C}AC​ is the entrywise complexification of AAA. For all v,w∈C2nv,w\in\mathbb C^{2n}v,w∈C2n and nonnegative integers i,ji,ji,j with j>0j>0j>0,

ωC(Nziv,Nz−1jw)=−z−1ωC(Nzi+1v,Nz−1jw)−(z2)−1ωC(Nzi+1v,Nz−1j−1w).\omega_{\mathbb C}(N_z^iv,N_{z^{-1}}^jw) =-z^{-1}\omega_{\mathbb C}(N_z^{i+1}v,N_{z^{-1}}^jw) -(z^2)^{-1}\omega_{\mathbb C}(N_z^{i+1}v,N_{z^{-1}}^{j-1}w).ωC​(Nzi​v,Nz−1j​w)=−z−1ωC​(Nzi+1​v,Nz−1j​w)−(z2)−1ωC​(Nzi+1​v,Nz−1j−1​w).

Moreover, for every v,w∈C2nv,w\in\mathbb C^{2n}v,w∈C2n and nonnegative integer ppp, if v∈Gzv\in G_zv∈Gz​, Nzpv≠0N_z^pv\ne0Nzp​v=0, and Nzp+1v=0N_z^{p+1}v=0Nzp+1​v=0, then all three following assertions hold:

ωC(Nzp+kv,w)=(−z2)jωC(Nzp+k−jv,Nz−1jw)for all k,j≥0 with j≤p+k,ωC(Nzpv,w)=(−z2)pωC(v,Nz−1pw),ωC(Nzkv,Nz−1jw)=0for all k,j≥0 with p<k+j.\begin{aligned} \omega_{\mathbb C}(N_z^{p+k}v,w) &=(-z^2)^j\omega_{\mathbb C}(N_z^{p+k-j}v,N_{z^{-1}}^jw) &&\text{for all }k,j\ge0\text{ with }j\le p+k,\\ \omega_{\mathbb C}(N_z^pv,w) &=(-z^2)^p\omega_{\mathbb C}(v,N_{z^{-1}}^pw),\\ \omega_{\mathbb C}(N_z^kv,N_{z^{-1}}^jw)&=0 &&\text{for all }k,j\ge0\text{ with }p<k+j. \end{aligned}ωC​(Nzp+k​v,w)ωC​(Nzp​v,w)ωC​(Nzk​v,Nz−1j​w)​=(−z2)jωC​(Nzp+k−j​v,Nz−1j​w)=(−z2)pωC​(v,Nz−1p​w),=0​​for all k,j≥0 with j≤p+k,for all k,j≥0 with p<k+j.​

There is no eigenvalue hypothesis on zzz, and www has no generalized-eigenspace restriction. All zeroth powers are identity maps, so p=0p=0p=0 and other zero indices are included; the bounds on jjj ensure that the displayed subtractions of natural numbers do not truncate. When n=0n=0n=0, the first identity concerns only zero vectors, and the nonvanishing hypothesis in the second assertion is impossible.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 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