Lemma 6 — pairing recursion and terminal-chain identities
ProvedQAlgorithms.Papers.Independent.Intake100.P39.pairing_recursion_and_terminal_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 , , and ,
If has height , meaning and , then for with ,
In particular,
The restriction corrects the undefined negative exponents in printed (12); it does not truncate them to zero.
These are all four terminal-chain identities, with the source formula stated on its defined domain.
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.9, Lemma 6, (11)–(14). Printed: (12) permits arbitrary j.
Changed: j<=p+k in (12), so its exponent is nonnegative. Why: negative powers
of the singular shifted map are undefined; Nat subtraction must not hide this.
The proof's p versus p+1 nilpotence typo is resolved using VectorHeight. -/
theorem pairing_recursion_and_terminal_identities {n : ℕ} (A : GroupedRealMatrix n)
(hA : IsSymplectic A) (z : ℂ) (hz : z ≠ 0) :
(∀ (v w : CVec n) (i j : ℕ), 0 < j →
omegaC ((shifted A z ^ i) v) ((shifted A z⁻¹ ^ j) w) =
-z⁻¹ * omegaC ((shifted A z ^ (i + 1)) v) ((shifted A z⁻¹ ^ j) w) -
(z ^ 2)⁻¹ * omegaC ((shifted A z ^ (i + 1)) v) ((shifted A z⁻¹ ^ (j - 1)) w)) ∧
(∀ (v w : CVec n) (p : ℕ), v ∈ generalizedSpace A z → VectorHeight A z v p →
(∀ 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.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 , with , and nonzero , let , , and , where is the entrywise complexification of . For all and nonnegative integers with ,
Moreover, for every and nonnegative integer , if , , and , then all three following assertions hold:
There is no eigenvalue hypothesis on , and has no generalized-eigenspace restriction. All zeroth powers are identity maps, so and other zero indices are included; the bounds on ensure that the displayed subtractions of natural numbers do not truncate. When , the first identity concerns only zero vectors, and the nonvanishing hypothesis in the second assertion is impossible.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.