Lemma 14
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.generalized_kernel_orthogonal_rangeLet be a real symplectic matrix and let be a complex eigenvalue. Extend and complex linearly. For every integer ,
The orthogonal complement is for the complex bilinear symplectic form, with no conjugation. Symplecticity implies . At , the kernel is zero and the image is the whole complexified space. This is the annihilator identity behind the quotient pairings.
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)
/-- 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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let , let , and define the complex bilinear form . For every real matrix satisfying , every for which there exists a nonzero with , every natural number , and every ,
Here acts through its entrywise complexification, and uses the total complex inverse, with . The case is included, so both powers are identity operators. The dimension is also quantified over, although its required nonzero eigenvector cannot exist.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.