Corollary 15
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.generalized_eigenspaces_orthogonalLet be a real symplectic matrix, complexified to , and let be eigenvalues with . Write for the full generalized eigenspace. Then
The complex symplectic form is bilinear. The result concerns generalized eigenvectors of arbitrary height, not only ordinary eigenvectors, and supplies the source's orthogonal spectral decomposition.
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)
/-- Corollary 15, PDF p.14: full generalized eigenspaces. -/
theorem generalized_eigenspaces_orthogonal {n : ℕ} (A : GroupedRealMatrix n)
(hA : IsSymplectic A) (z u : ℂ) (hz : IsEigenvalue A z)
(hu : IsEigenvalue A u) (hzu : z*u ≠ 1) :
∀ v ∈ generalizedSpace A z, ∀ w ∈ generalizedSpace A u, omegaC v w = 0 := by sorry
end QAlgorithms.Papers.Independent.Gap50repair.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let , , and , a complex bilinear form without complex conjugation. For every real matrix satisfying , and every such that each has a nonzero complex eigenvector of and , one has
All actions use the entrywise complexification of . There is no requirement that and be distinct. The case is included in the quantification, but its eigenvector hypotheses cannot be satisfied.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.