Remark 11
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.krein_sign_rescalingLet , and let be an eigenvector for a nonreal eigenvalue , with . Then and every nonzero eigenvector of the same eigenvalue gives the same sign. For with ,
Complex conjugation produces an eigenvector for and reverses this sign. This makes the Krein-positive eigenvalue independent of the eigenvector chosen; the complex extension of itself is bilinear.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap50repair_P01
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a real matrix satisfying , where ; let satisfy and ; and let satisfy and , where is obtained by embedding the entries of into . Define , and define by the same formula on complex vectors, without conjugating either argument. Then ; for every with , both and hold; and, for every satisfying and , one has . In addition, , , and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.