Proposition 37
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.classical_index_characterizationFix . On continuous admissible paths , the classical index satisfies and is uniquely determined by three properties: invariance under homotopies through admissible paths; the loop rule for a based symplectic loop ; and the signature normalization for symmetric nondegenerate whose eigenvalues have absolute value below :
Every integer-valued assignment with these properties equals the constructed index on every admissible path. Endpoints may move within during an admissible homotopy. This is a uniqueness theorem as well as a list of properties.
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)
/-- Proposition 37, PDF pp.40–41: properties and uniqueness on the entire admissible domain. -/
theorem classical_index_characterization {n : ℕ} (hn : 1 ≤ n) :
CzThreeAxioms (n := n) (fun p : ℝ → GroupedRealMatrix n => conleyZehnder p 1) ∧
(∀ f : (ℝ → GroupedRealMatrix n) → ℤ, CzThreeAxioms f →
∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 → f p = conleyZehnder p 1) := 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 natural number , use grouped coordinates , set , and call symplectic when . A path is a function continuous and symplectic on ; it is admissible when additionally and . Define , using the same formula complex bilinearly. For a real matrix , let be its distinct complex characteristic roots, their algebraic multiplicities, and the largest for which there exists a real subspace of real dimension with for every nonzero . Put
with empty sums and products interpreted as and . For any function and real , define by choosing an integer , if one exists, for which there is a real function continuous on , with , , and for every ; if no such integer exists, set . To define , choose a function , if one exists, that is continuous and symplectic on , agrees with on , satisfies on , and ends at either or the diagonal matrix whose first entries in the two coordinate groups are respectively and , with every remaining diagonal entry ; if no such function exists, take . Set , with the choices made by the defining classical-choice operations. For a real symmetric matrix , define its signature to be the largest dimension of a real subspace on which is strictly positive for every nonzero , minus the largest dimension of a real subspace on which is strictly positive for every nonzero ; these maxima range over dimensions . Call small when every complex characteristic root of satisfies . The integer-valued function , defined on all functions , satisfies the following three conditions: whenever admissible are joined by a function continuous on , whose slice is admissible for every , with and for , one has ; for every admissible and every path with ,
and for every small symmetric with ,
Moreover, every function satisfying those same three conditions agrees with on every admissible path.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.