Remark 28
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.nonfixed_dimension_two_componentsprove2quantum
In dimension two let . Its connected components are exactly
Both sets are nonempty and connected, they are disjoint, their union is , and every connected subset of that union lies in one of them. This expresses both the component count and the component identification without relying on arbitrary component labels.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap50repair_P01
Formal statement
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)
/-- Remark 28, PDF p.32: two nonempty connected disjoint exhaustive maximal connected sets. -/
theorem nonfixed_dimension_two_components :
let P : Set (GroupedRealMatrix 1) := {A | IsSymplectic A ∧ 0 < (A-1).det}
let M : Set (GroupedRealMatrix 1) := {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 1), IsConnected S → S ⊆ P ∪ M → S ⊆ P ∨ S ⊆ M) := by sorry
end QAlgorithms.Papers.Independent.Gap50repair.P01
end
Source
The Conley-Zehnder index for a path of symplectic matrices, arXiv:1201.3728v2, PDF p. 32, Remark 28
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , and define sets of real matrices by
Both and are nonempty connected sets, they are disjoint, and
Furthermore, for every set of real matrices, if is nonempty and connected and , then or .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.