Definition 16 — Hermitian kernel forms
ProvedQAlgorithms.Papers.Independent.Intake100.P39.unit_kernel_form_hermitianLet , 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 , define on the form
It is linear in its first argument and conjugate-linear in its second. Positive and negative indices are complex dimensions of maximal definite complex subspaces; rank is their sum and signature their difference. For every positive integer and ,
For this is . No Hermitian assertion is made on the unrestricted ambient space.
This supplies the substantive Hermitian claim attached to Definition 16.
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.26, Definition 16: the kernel form is Hermitian (linear first,
conjugate-linear second); the m=1 case has k=0 and coefficient i. -/
theorem unit_kernel_form_hermitian {n : ℕ} (A : GroupedRealMatrix n) (hA : IsSymplectic A)
(z : ℂ) (hz : ‖z‖ = 1) (hplus : z ≠ 1) (hminus : z ≠ -1)
(m : ℕ) (hm : 0 < m) (v w : CVec n)
(hv : (shifted A z ^ m) v = 0) (hw : (shifted A z ^ m) w = 0) :
unitQ A z m v w = star (unitQ A z m w v) := by sorry
end QAlgorithms.Papers.Independent.Intake100.P39
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let be a real matrix on satisfying , where , and let satisfy , , and . Let be a natural number and let satisfy , where . With the complex bilinear form
define, for positive ,
Then . There is no assumption that is an eigenvalue or that either vector is nonzero; zero vectors, a zero kernel, and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.