Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 11

Proved
QAlgorithms.Papers.Independent.Gap50repair.P01.krein_sign_rescaling

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

prove2quantum

Let A∈Sp⁡(2,R)A\in\operatorname{Sp}(2,\mathbb R)A∈Sp(2,R), and let z=v−iw≠0z=v-iw\ne0z=v−iw=0 be an eigenvector for a nonreal eigenvalue λ∈S1\lambda\in S^1λ∈S1, with v,w∈R2v,w\in\mathbb R^2v,w∈R2. Then Ω0(v,w)≠0\Omega_0(v,w)\ne0Ω0​(v,w)=0 and every nonzero eigenvector of the same eigenvalue gives the same sign. For a,b∈Ra,b\in\mathbb Ra,b∈R with a2+b2>0a^2+b^2>0a2+b2>0,

Ω0(av+bw,−bv+aw)=(a2+b2)Ω0(v,w),Ω0,C(z,z‾)=2iΩ0(v,w).\Omega_0(av+bw,-bv+aw)=(a^2+b^2)\Omega_0(v,w),\qquad \Omega_{0,\mathbb C}(z,\overline z)=2i\Omega_0(v,w).Ω0​(av+bw,−bv+aw)=(a2+b2)Ω0​(v,w),Ω0,C​(z,z)=2iΩ0​(v,w).

Complex conjugation produces an eigenvector for λ‾\overline\lambdaλ and reverses this sign. This makes the Krein-positive eigenvalue independent of the eigenvector chosen; the complex extension of Ω0\Omega_0Ω0​ itself is bilinear.

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 11, PDF p.10: all eigenvectors have the same Krein sign;
nonzero rescaling preserves it and conjugation reverses it. -/
theorem krein_sign_rescaling (A : GroupedRealMatrix 1) (hA : IsSymplectic A)
    (z : ℂ) (hz : ‖z‖ = 1) (hzr : z.im ≠ 0) (v w : Coord 1 → ℝ)
    (he : (fun i => (v i : ℂ)-Complex.I*(w i : ℂ)) ≠ 0)
    (hev : (complexify A).mulVec (fun i => (v i : ℂ)-Complex.I*(w i : ℂ)) =
      z • (fun i => (v i : ℂ)-Complex.I*(w i : ℂ))) :
    omegaR v w ≠ 0 ∧
    (∀ a b : ℝ, 0 < a^2+b^2 →
      omegaR (a • v+b • w) ((-b) • v+a • w) = (a^2+b^2)*omegaR v w ∧
      Real.sign (omegaR (a • v+b • w) ((-b) • v+a • w)) = Real.sign (omegaR v w)) ∧
    (∀ v2 w2 : Coord 1 → ℝ,
      (fun i => (v2 i : ℂ)-Complex.I*(w2 i : ℂ)) ≠ 0 →
      (complexify A).mulVec (fun i => (v2 i : ℂ)-Complex.I*(w2 i : ℂ)) =
        z • (fun i => (v2 i : ℂ)-Complex.I*(w2 i : ℂ)) →
      Real.sign (omegaR v2 w2) = Real.sign (omegaR v w)) ∧
    (complexify A).mulVec (fun i => (v i : ℂ)+Complex.I*(w i : ℂ)) =
      (star z) • (fun i => (v i : ℂ)+Complex.I*(w i : ℂ)) ∧
    omegaR v (-w) = -omegaR v w ∧
    omegaC (fun i => (v i : ℂ)-Complex.I*(w i : ℂ))
      (fun i => (v i : ℂ)+Complex.I*(w i : ℂ)) = 2*Complex.I*(omegaR v w : ℂ) := 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. 10, Remark 11
Read-back

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

Let AAA be a real 2×22\times22×2 matrix satisfying ATJA=JA^{\mathsf T}JA=JATJA=J, where J=(0−110)J=\begin{pmatrix}0&-1\\1&0\end{pmatrix}J=(01​−10​); let z∈Cz\in\mathbb Cz∈C satisfy ∣z∣=1|z|=1∣z∣=1 and Im⁡z≠0\operatorname{Im}z\ne0Imz=0; and let v,w∈R2v,w\in\mathbb R^2v,w∈R2 satisfy v−iw≠0v-iw\ne0v−iw=0 and AC(v−iw)=z(v−iw)A_{\mathbb C}(v-iw)=z(v-iw)AC​(v−iw)=z(v−iw), where ACA_{\mathbb C}AC​ is obtained by embedding the entries of AAA into C\mathbb CC. Define ωR(v,w)=v1w2−v2w1\omega_{\mathbb R}(v,w)=v_1w_2-v_2w_1ωR​(v,w)=v1​w2​−v2​w1​, and define ωC\omega_{\mathbb C}ωC​ by the same formula on complex vectors, without conjugating either argument. Then ωR(v,w)≠0\omega_{\mathbb R}(v,w)\ne0ωR​(v,w)=0; for every a,b∈Ra,b\in\mathbb Ra,b∈R with a2+b2>0a^2+b^2>0a2+b2>0, both ωR(av+bw,−bv+aw)=(a2+b2)ωR(v,w)\omega_{\mathbb R}(av+bw,-bv+aw)=(a^2+b^2)\omega_{\mathbb R}(v,w)ωR​(av+bw,−bv+aw)=(a2+b2)ωR​(v,w) and sign⁡(ωR(av+bw,−bv+aw))=sign⁡(ωR(v,w))\operatorname{sign}(\omega_{\mathbb R}(av+bw,-bv+aw))=\operatorname{sign}(\omega_{\mathbb R}(v,w))sign(ωR​(av+bw,−bv+aw))=sign(ωR​(v,w)) hold; and, for every v2,w2∈R2v_2,w_2\in\mathbb R^2v2​,w2​∈R2 satisfying v2−iw2≠0v_2-iw_2\ne0v2​−iw2​=0 and AC(v2−iw2)=z(v2−iw2)A_{\mathbb C}(v_2-iw_2)=z(v_2-iw_2)AC​(v2​−iw2​)=z(v2​−iw2​), one has sign⁡(ωR(v2,w2))=sign⁡(ωR(v,w))\operatorname{sign}(\omega_{\mathbb R}(v_2,w_2))=\operatorname{sign}(\omega_{\mathbb R}(v,w))sign(ωR​(v2​,w2​))=sign(ωR​(v,w)). In addition, AC(v+iw)=z‾(v+iw)A_{\mathbb C}(v+iw)=\overline z(v+iw)AC​(v+iw)=z(v+iw), ωR(v,−w)=−ωR(v,w)\omega_{\mathbb R}(v,-w)=-\omega_{\mathbb R}(v,w)ωR​(v,−w)=−ωR​(v,w), and ωC(v−iw,v+iw)=2i ωR(v,w)\omega_{\mathbb C}(v-iw,v+iw)=2i\,\omega_{\mathbb R}(v,w)ωC​(v−iw,v+iw)=2iωR​(v,w).

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