Theorem 29
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.symplectic_components_and_ambient_loop_contractionLet . The real symplectic group is connected. Its subset has exactly two connected components:
Both components are nonempty, connected, disjoint and exhaustive, and every connected subset of lies in one of them. Every continuous loop in either component is homotopic, with its basepoint fixed, to its constant loop in the ambient symplectic group. The homotopy may pass through matrices with eigenvalue . This is the topological input for admissible extensions and their index independence.
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)
/-- Theorem 29 ([12]), PDF pp.32–35: connectedness, exactly two nonempty
sign components of Sp*, and based contraction of their loops in ambient Sp.
No requirement keeps the contracting homotopy inside Sp*. -/
theorem symplectic_components_and_ambient_loop_contraction {n : ℕ} (hn : 1 ≤ n) :
IsConnected {A : GroupedRealMatrix n | IsSymplectic A} ∧
(let P : Set (GroupedRealMatrix n) := {A | IsSymplectic A ∧ 0 < (A-1).det}
let M : Set (GroupedRealMatrix n) := {A | IsSymplectic A ∧ (A-1).det < 0}
IsConnected P ∧ IsConnected M ∧ Disjoint P M ∧
{A | IsSymplectic A ∧ (A-1).det ≠ 0} = P ∪ M ∧
(∀ S : Set (GroupedRealMatrix n), IsConnected S → S ⊆ P ∪ M →
S ⊆ P ∨ S ⊆ M) ∧
(∀ p : ℝ → GroupedRealMatrix n, IsPath p 1 → p 0 = p 1 →
((∀ t ∈ Set.Icc (0 : ℝ) 1, p t ∈ P) ∨
(∀ t ∈ Set.Icc (0 : ℝ) 1, p t ∈ M)) →
FixedHomotopic p (fun _ => p 0) 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 , consider real matrices, with coordinates ordered as two copies of , and put . Call a matrix symplectic when , and define
The set of all symplectic matrices is connected and nonempty in the usual topology on real matrices. Both and are connected and nonempty, they are disjoint, and
For every connected, nonempty set of real matrices contained in , either or . Furthermore, for every function that is continuous on , is symplectic at every time in that interval, and satisfies , if either for all or for all such , then there exists a function , continuous on , such that every in this square is symplectic and
for all . The homotopy is required to stay in the symplectic matrices; no determinant-sign condition is imposed on its intermediate matrices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.