Proposition 35
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.classical_index_eight_propertiesFor all positive dimensions, let be the integer index constructed by the degree of the squared rotation map on an admissible extension. A path is admissible when it is continuous, starts at , and ends with . All eight properties hold:
- For every continuous symplectic path with arbitrary endpoints, .
- The index is constant under continuous homotopies through admissible paths; the final endpoint may move within .
- If has no unit-circle eigenvalue for every , then .
- For admissible paths and in dimensions and , with , , using the grouped symplectic direct sum.
- If , then .
- For a real symmetric nonsingular by matrix whose eigenvalues have absolute value less than , .
- The endpoint parity is
- For pointwise matrix inversion and transpose, .
Here , is the spectral rotation map, and is positive minus negative inertia. These rules are conclusions about the constructed index, not assumptions defining a competing assignment.
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 35 ([11]), PDF pp.36–40: all eight properties of the
constructed integer index. Inverse and transpose are pointwise, conjugating
paths have arbitrary endpoints, and product compares positive dimensions. -/
theorem classical_index_eight_properties :
(∀ n, 1 ≤ n → ∀ p phi : ℝ → GroupedRealMatrix n,
IsAdmissible p 1 → IsPath phi 1 →
conleyZehnder (fun t => phi t*p t*(phi t)⁻¹) 1 = conleyZehnder p 1) ∧
(∀ n, 1 ≤ n → ∀ p q : ℝ → GroupedRealMatrix n,
IsAdmissible p 1 → IsAdmissible q 1 → AdmissiblyHomotopic p q →
conleyZehnder p 1 = conleyZehnder q 1) ∧
(∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 →
(∀ t ∈ Set.Ioc (0 : ℝ) 1, ∀ z ∈ eigenvalues (p t), ‖z‖ ≠ 1) →
conleyZehnder p 1 = 0) ∧
(∀ n m, 1 ≤ n → 1 ≤ m → ∀ p : ℝ → GroupedRealMatrix n,
∀ q : ℝ → GroupedRealMatrix m, IsAdmissible p 1 → IsAdmissible q 1 →
conleyZehnder (fun t => symplecticSum (p t) (q t)) 1 =
conleyZehnder p 1 + conleyZehnder q 1) ∧
(∀ n, 1 ≤ n → ∀ p phi : ℝ → GroupedRealMatrix n,
IsAdmissible p 1 → IsPath phi 1 → phi 0 = 1 → phi 1 = 1 →
conleyZehnder (fun t => phi t*p t) 1 = conleyZehnder p 1 +
2*winding (fun t => spectralRotation (phi t)) 1) ∧
(∀ n, 1 ≤ n → ∀ S : GroupedRealMatrix n, IsSmallSymmetric S → S.det ≠ 0 →
2*conleyZehnder (exponentialPath S) 1 = matrixSignature S) ∧
(∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 →
(-1 : ℝ)^((n : ℤ)-conleyZehnder p 1) = Real.sign ((1-p 1).det)) ∧
(∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsAdmissible p 1 →
conleyZehnder (fun t => (p t)⁻¹) 1 = conleyZehnder (fun t => (p t).transpose) 1 ∧
conleyZehnder (fun t => (p t).transpose) 1 = -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
Use real matrices with coordinates , put , and call symplectic when . A path here is a function continuous and symplectic on ; it is admissible when also and . Define the integer as follows. For each real matrix , let be the distinct roots of the characteristic polynomial of its entrywise complexification , let be their algebraic multiplicities, put , and put . Let be the largest realized as the real dimension of a real linear subspace on which for every nonzero . Define
Empty sums and products have values zero and one, respectively. For , let be a classically chosen integer admitting a real function , continuous on , with , , and throughout that interval; set when no such integer exists. Choose an extension if one exists, meaning that it is continuous and symplectic on , equals on , has on , and ends at either or the diagonal matrix with entries at , at , and elsewhere; if no extension exists, set . Then . For a real square matrix , write for the largest dimension of a real linear subspace on which is strictly positive for every nonzero , minus the largest dimension of a subspace on which it is strictly negative for every nonzero ; the zero subspace is allowed. The declaration asserts the conjunction of these eight statements: (i) for every , every admissible , and every path , , with no endpoint condition on ; (ii) for every and admissible , if there is , continuous on , such that is admissible for every , and , for every , then ; (iii) for every and admissible , if every eigenvalue of has modulus different from one for every , then , with time zero excluded from this spectral hypothesis; (iv) for every and admissible paths of sizes , respectively, , where acts separately on the two coordinate spaces and orders the combined coordinates as ; (v) for every , admissible , and path with ,
(vi) for every and real symmetric such that every complex eigenvalue of satisfies and ,
(vii) for every and admissible ,
where the exponent is an integer and the power is taken in ; and (viii) for every and admissible ,
All dimension quantifiers in these eight statements exclude .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.