Definition 7 and equations (16)–(17) — normalized chain pairings
ProvedQAlgorithms.Papers.Independent.Intake100.P39.normalized_chain_pairing_identitiesLet , with grouped symplectic form , and let be a real linear map preserving . This is a coordinate formulation in an arbitrary ambient symplectic basis. Write and for their complex-linear and complex-bilinear extensions, , and . Let , with repetitions removed, and let be the real subspace whose complexification is . A symplectic basis uses the matrix . All transposes below are ordinary transposes.
For , define
For an eigenvalue of unit norm and ,
These identities normalize conjugate chain pairings; the recurrence is not asserted at .
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P39
noncomputable section
open scoped BigOperators Matrix
namespace QAlgorithms.Papers.Independent.Intake100.P39
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse only the pinned accepted substrate, with definitionally identical coordinate models.
-- The imported symplectic predicate preserves -Omega0, equivalent to preserving Omega0.
open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)
open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)
open QAlgorithms.Papers.Independent.Gap50repair.P01
(Coord GroupedRealMatrix omegaMatrix omegaR omegaC shifted generalizedSpace
IsEigenvalue HasNilpotentHeight restrictedKernel GeneralizedQuotient)
/-- PDF p.10, Definition 7 and (16)–(17): recurrence only at j>0;
the conjugate-swap identity includes the printed MINUS sign. -/
theorem normalized_chain_pairing_identities {n : ℕ} (A : GroupedRealMatrix n)
(hA : IsSymplectic A) (z : ℂ) (hz : ‖z‖ = 1) (he : IsEigenvalue A z)
(v : CVec n) (hv : v ∈ generalizedSpace A z) :
(∀ i j : ℕ, 0 < j → chainT A z v i j =
-chainT A z v (i + 1) j - chainT A z v (i + 1) (j - 1)) ∧
(∀ i j : ℕ, chainT A z v i j = -star (chainT A z v j i)) := by sorry
end QAlgorithms.Papers.Independent.Intake100.P39
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every nonnegative integer , real matrix satisfying , where , complex eigenvalue of with , and vector , define , , and
where complexification and conjugation are entrywise. Then
The vector may be zero, in which case every is zero. Zeroth powers are included, and the recursion uses only when . The eigenvalue hypothesis means that some nonzero vector is a -eigenvector and therefore cannot hold when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.