Corollary 39
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.polar_projection_degreeLet , let be admissible, and let be any admissible extension. For a symplectic matrix , let be the unique symmetric positive definite square root of and put . Then
Thus the polar projection is a computed function of , rather than an arbitrary map supplied with a compatibility assumption. The formula connects the classical index with the polar definition used elsewhere.
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 39, PDF p.42: U(A)=A P(A)^-1 is computed, not an assumed projection. -/
theorem polar_projection_degree {n : ℕ} (hn : 1 ≤ n)
(p e : ℝ → GroupedRealMatrix n) (hp : IsAdmissible p 1) (he : IsExtension p e) :
conleyZehnder p 1 = winding (fun t => complexActionDet (polarU (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 symplectic when . Let satisfy the following conditions: is continuous and symplectic on , , and ; is continuous and symplectic on , equals on , has for every , and ends at either or the diagonal matrix with first position entry , first momentum entry , and all other diagonal entries . For a real matrix , define to be a chosen symmetric positive definite matrix satisfying if such a matrix exists, and define otherwise; set , using the total matrix inverse. For a real matrix , define . For any complex-valued function , define to be a chosen integer admitting a continuous real function on with , , and there, or if no such integer exists. Define from the distinct complex eigenvalues of the entrywise complexification by
where is algebraic multiplicity and is the largest for which a real -dimensional subspace of has on every nonzero vector ; empty sums and products have values and . Define as the winding on of , where is a chosen extension satisfying the conditions imposed on if one exists, and is otherwise. Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.