Corollary 40
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.normalized_complex_determinant_degreeFor put . This real matrix is invertible, and its complex determinant is nonzero. Define . For , any admissible path and any admissible extension satisfy
The denominator is an absolute value, as printed in (45); invertibility is established from symplecticity and is not an extra input hypothesis. This is the normalized complex-linear-part formula.
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)
/-- Corollary 40, PDF p.42; absolute-value denominator visually verified.
Invertibility is a conclusion from symplecticity. -/
theorem normalized_complex_determinant_degree {n : ℕ} (hn : 1 ≤ n)
(p e : ℝ → GroupedRealMatrix n) (hp : IsAdmissible p 1) (he : IsExtension p e) :
(∀ A : GroupedRealMatrix n, IsSymplectic A →
(complexLinearPart A).det ≠ 0 ∧ complexActionDet (complexLinearPart A) ≠ 0) ∧
conleyZehnder p 1 = winding (fun t => normalizedDet (e t)^2) 2 := 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 integer , put and , and call a real matrix symplectic when . Let satisfy these assumptions: is continuous and symplectic on , , and ; is continuous and symplectic on , agrees with on , satisfies throughout , and ends at either or the diagonal matrix with first position entry , first momentum entry , and all remaining diagonal entries . For any real matrix , put , define , and set , with the real denominator regarded as complex and with division by zero assigned the value . For a function , its winding on is a chosen integer admitting a continuous real on that interval with , , and , or if no such integer exists. For a real matrix , let be its distinct complex eigenvalues, their algebraic multiplicities, and the largest for which there is a real -dimensional subspace of on which every nonzero satisfies , where is entrywise complexification. Put
using for an empty sum and for an empty product, and define to be the winding on of , where is a chosen extension satisfying the conditions imposed on if one exists, and is otherwise. The assertion is the conjunction
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.