Lemma 22
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.generalized_pairing_identitiesLet be symplectic and . Put and on the complexified space. For arbitrary , and ,
If is an eigenvalue and is its maximal nonzero nilpotent height, then for and with , . In particular , and if . The guard on subtraction is supplied by the source's induction, and the printed condition on both vectors is retained. These are all four technical identities.
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 22, PDF p.18. Printed (26) leaves the range of j unstated; use
j<=p+k, exactly the range in its proof, to keep p+k-j a nonnegative exponent.
All four formulas and both printed E_lambda premises are retained. -/
theorem generalized_pairing_identities {n : ℕ} (A : GroupedRealMatrix n)
(hA : IsSymplectic A) (z : ℂ) (hz0 : z ≠ 0) :
(∀ v w : Coord n → ℂ, ∀ i j : ℕ, 0 < j →
omegaC ((shifted A z^i) v) ((shifted A z⁻¹^j) w) =
-(1/z)*omegaC ((shifted A z^(i+1)) v) ((shifted A z⁻¹^j) w) -
(1/z^2)*omegaC ((shifted A z^(i+1)) v) ((shifted A z⁻¹^(j-1)) w)) ∧
(IsEigenvalue A z → ∀ p, HasNilpotentHeight A z p →
∀ v ∈ generalizedSpace A z, ∀ w ∈ generalizedSpace A z,
(∀ 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.Gap50repair.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every real matrix satisfying , where , and every , put , , and , with the entrywise complexification of . For all and all natural numbers with ,
In addition, if has a nonzero eigenvector of , then for every natural number satisfying both and , and for every , all of the following hold:
Both and in this additional assertion belong to . Zero values of , and of in the additional assertion, are allowed; all zeroth powers are identity operators. The subtraction is natural-number subtraction, with its displayed bound ensuring no truncation. The first assertion includes ; the eigenvector hypothesis of the additional assertion is then impossible.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.