Definitions for The Conley-Zehnder index for a path of symplectic matrices
DefinitionQAlgorithms_Papers_Independent_Gap50repair_P01The objects the formalized statements of The Conley-Zehnder index for a path of symplectic matrices (arXiv:1201.3728) are stated in. Each was checked against the paper by a blind read-back and a moderator.
Coord: Grouped coordinates, PDF pp.4–5.GroupedRealMatrixCMatomegaMatrix: Standard symplectic form and compatible complex structure, PDF p.4.jMatrixomegaR: Bilinear forms; no conjugation is hidden in omegaC, PDF pp.4,11.omegaCIsOrthogonal: Orthogonality and complex linearity, PDF p.5.CommutesWithComplexStructurecomplexActionMatrix: Complex matrix of a complex-linear real action, PDF p.5; entrywise complexification itself is imported from the pinned library.complexActionDet: Definition 6; used on complex-linear real matrices, PDF p.6.IsUnitaryReal: Independent unitary predicate from Definition 4, PDF p.5.SymplecticSpaceUnitarySpaceComplexUnitarySpecialUnitaryUnitCircleIsSymmetricLie: Symmetric part of the symplectic Lie algebra, PDF p.6 (4).SymmetricLieSpacepolarP: Positive symmetric square root of A^T A, by choice; fallback only off domain, pp.6–7.polarU: Computed polar projection, PDF p.42.shifted: Shift and stable generalized eigenspace; exponent 2n reaches the stable kernel, pp.13–14.generalizedSpaceIsEigenvalueeigenvalues: Distinct eigenvalues and algebraic multiplicities, PDF p.14.algebraicMultiplicitykreinPositive: Real positive inertia of Im Omega(z,conj z) on E_lambda. The finite search bound is the ambient real dimension 4n, PDF pp.12–15.spectralRotation: Rotation from the spectral formula (18), PDF p.15. Real inertia and the negative real multiplicity are even, so these natural divisions are exact halves.IsWindingLift: Oriented real lift: a positive full turn has theta(t)=t and degree +1, pp.35,56.winding: Degree of a based continuous circle loop, PDF p.35; zero fallback off domain.IsPath: Continuous symplectic path with arbitrary endpoints, PDF pp.35,47.IsAdmissible: Definition 32. Positive duration is supplied by binders, PDF p.35.wPlus: Fixed reference representatives, PDF p.32 (35)–(37).wMinusunitPath: Positive affine reparametrization, PDF pp.38,43–44.IsExtension: Admissible extension of Definition 33, PDF p.35.chosenExtension: Choice is over actual extensions, not over index axioms; existence is concluded, p.35.conleyZehnder: Genuine integer degree construction, Definition 33, PDF p.35.integerPower: All integer powers, including inverse powers, PDF p.15.HasNilpotentHeight: Maximal nilpotent height on the generalized space, PDF p.17.restrictedKernel: Kernel restricted to E_lambda, PDF p.17 (23).GeneralizedQuotientFixedHomotopic: Compact-rectangle homotopy with fixed endpoints, PDF pp.38,46.AdmissiblyHomotopic: Homotopy through SP(n); the final endpoint may move in Sp*, PDF p.37.catenate: Catenation normalized to [0,1], PDF pp.38,46.translatedCatenate: Lemma 36's translated catenation: the second argument is 2t-T, PDF p.38.mergeBlocks: Sum on a coordinate half, used to retain grouped order, PDF p.16.symplecticSum: Symplectic direct sum with the source's coordinate permutation, PDF p.16.positiveInertia: Maximum positive-subspace dimension in a finite real ambient space, pp.44–49.formSignature: Positive minus negative inertia, also on degenerate forms and zero spaces, pp.44–49.matrixSignatureexponentialPath: Exponential and small-symmetric normalization data, PDF pp.36,52.IsSmallSymmetricsMinus: The explicitly constructed S^-, not a variable supplied by a hypothesis, PDF p.41.referenceMinuscomplexLinearPart: Complex-linear part and determinant normalized by absolute value, PDF p.42 (45).normalizedDetshear: Upper shear of Definition 53, PDF p.51.crossingSpace: Graph-reference kernel or vertical-reference intersection pulled back by A, PDF pp.47,58. These are different subspaces.pathDerivative: One-sided endpoint derivatives via the interval, PDF pp.44–50.crossingBilinear: Pullback crossing form Omega(A v,A' w), PDF pp.49,58. On ker(A-I) this is v^T S w; for RS2 the pullback subspace is V intersect A^-1 V.crossingSignaturecrossings: Interior crossing set, Definitions 44,50, PDF pp.46,49.IsRegular: Smoothness and nondegeneracy at every crossing, including endpoints, p.49. Nondegeneracy on the zero space is valid. Finiteness is not assumed.interiorCrossingSum: Finite sum; off the finite domain the fallback is zero, PDF p.49.regularIndex: Half-integer crossing value, PDF pp.46,49.regularPathRepresentative: Smooth regular representative with fixed-endpoint homotopy, PDF p.46. Choice imposes no index value or invariance assumption.robbinSalamon: Graph Robbin–Salamon index reconstructed by Definitions 44,46 and (52), pp.46–49.robbinSalamonVertical: Separate vertical-reference index of section 7.5, PDF p.58.IsHalfIntegerFamily: Half-integer family, with arbitrary endpoint degeneracies, PDF pp.47,53.RsCore: Homotopy/catenation/zero core shared by the characterizations, PDF pp.52–56.RsFourAxioms: Four axioms: normalization includes singular and zero S, PDF p.52.RsProduct: Dimension-family product, PDF pp.53,56.RsSevenAxioms: Seven properties, including generalization, naturality and -tB shear, PDF p.53.RsSixAxioms: Six properties, with distinct nondegenerate-signature and shear normalizations, p.56.CzThreeAxioms: Homotopy, loop and signature characterization, PDF p.40.RotationAxiomsTwo: Theorem 10(1)–(3), dimension two, PDF pp.8,11.graphSpace: Graph as an actual linear subspace, PDF p.47.IsGraphLagrangian: Lagrangian in the doubled form -Omega direct_sum Omega, PDF p.47.RotationFamilyAxioms: Four rotation axioms for the positive-dimension family of Theorem 10, PDF p.8. Functions are compared only on symplectic matrices in dimensions n>=1.kreinPairing: Real Krein form before restricting to E_lambda; conjugate the second vector explicitly, PDF pp.12,15, formula (18).firstKindMultiplicity: Multiplicity of an eigenvalue of the first kind, Definition 17 and Remark 18, PDF p.15. At +1 and -1 use half the complex generalized dimension; elsewhere on S1 use half the real positive inertia.ImageIndexAxioms: Five image-index properties on all positive dimensions, PDF p.58. Homotopy is the full iff for paths with the same matrix endpoints.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P10
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P02
/-! Jean Gutt, arXiv:1201.3728v2. Grouped x,y coordinates. Complexification and symplecticity reuse pinned
definitions; remaining concepts are paper local.
Winding uses oriented real lifts. Compilation pending. -/
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)
/-- Grouped coordinates, PDF pp.4–5. -/
abbrev Coord (n : ℕ) := Fin n ⊕ Fin n
abbrev GroupedRealMatrix (n : ℕ) := Matrix (Coord n) (Coord n) ℝ
abbrev CMat (n : ℕ) := Matrix (Coord n) (Coord n) ℂ
/-- Standard symplectic form and compatible complex structure, PDF p.4. -/
def omegaMatrix (n : ℕ) : GroupedRealMatrix n := Matrix.fromBlocks 0 1 (-1) 0
def jMatrix (n : ℕ) : GroupedRealMatrix n := -omegaMatrix n
/-- Bilinear forms; no conjugation is hidden in omegaC, PDF pp.4,11. -/
def omegaR {n : ℕ} (v w : Coord n → ℝ) : ℝ :=
∑ i, (v (Sum.inl i)*w (Sum.inr i) - v (Sum.inr i)*w (Sum.inl i))
def omegaC {n : ℕ} (v w : Coord n → ℂ) : ℂ :=
∑ i, (v (Sum.inl i)*w (Sum.inr i) - v (Sum.inr i)*w (Sum.inl i))
/-- Orthogonality and complex linearity, PDF p.5. -/
def IsOrthogonal {n : ℕ} (A : GroupedRealMatrix n) : Prop := A.transpose*A = 1
def CommutesWithComplexStructure {n : ℕ} (A : GroupedRealMatrix n) : Prop := A*jMatrix n = jMatrix n*A
/-- Complex matrix of a complex-linear real action, PDF p.5; entrywise
complexification itself is imported from the pinned library. -/
def complexActionMatrix {n : ℕ} (A : GroupedRealMatrix n) : Matrix (Fin n) (Fin n) ℂ :=
fun i j => (A (Sum.inl i) (Sum.inl j) : ℂ) + Complex.I*(A (Sum.inr i) (Sum.inl j) : ℂ)
/-- Definition 6; used on complex-linear real matrices, PDF p.6. -/
def complexActionDet {n : ℕ} (A : GroupedRealMatrix n) : ℂ := (complexActionMatrix A).det
/-- Independent unitary predicate from Definition 4, PDF p.5. -/
def IsUnitaryReal {n : ℕ} (A : GroupedRealMatrix n) : Prop :=
CommutesWithComplexStructure A ∧ (complexActionMatrix A).conjTranspose * complexActionMatrix A = 1
abbrev SymplecticSpace (n : ℕ) := {A : GroupedRealMatrix n // IsSymplectic A}
abbrev UnitarySpace (n : ℕ) := {A : GroupedRealMatrix n // IsUnitaryReal A}
abbrev ComplexUnitary (n : ℕ) :=
{A : Matrix (Fin n) (Fin n) ℂ // A.conjTranspose*A = 1}
abbrev SpecialUnitary (n : ℕ) := {A : ComplexUnitary n // A.val.det = 1}
abbrev UnitCircle := {z : ℂ // ‖z‖ = 1}
/-- Symmetric part of the symplectic Lie algebra, PDF p.6 (4). -/
def IsSymmetricLie {n : ℕ} (S : GroupedRealMatrix n) : Prop :=
S.transpose = S ∧ S.transpose*omegaMatrix n + omegaMatrix n*S = 0
abbrev SymmetricLieSpace (n : ℕ) := {S : GroupedRealMatrix n // IsSymmetricLie S}
/-- Positive symmetric square root of A^T A, by choice; fallback only off domain, pp.6–7. -/
def polarP {n : ℕ} (A : GroupedRealMatrix n) : GroupedRealMatrix n :=
if h : ∃ P : GroupedRealMatrix n, P.transpose = P ∧ P.PosDef ∧ P*P = A.transpose*A
then Classical.choose h else 1
/-- Computed polar projection, PDF p.42. -/
def polarU {n : ℕ} (A : GroupedRealMatrix n) : GroupedRealMatrix n := A*(polarP A)⁻¹
/-- Shift and stable generalized eigenspace; exponent 2n reaches the stable kernel, pp.13–14. -/
def shifted {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) : Module.End ℂ (Coord n → ℂ) :=
Matrix.toLin' (complexify A) - z • 1
def generalizedSpace {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) : Submodule ℂ (Coord n → ℂ) :=
LinearMap.ker (shifted A z ^ (2*n))
def IsEigenvalue {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) : Prop :=
∃ v : Coord n → ℂ, v ≠ 0 ∧ shifted A z v = 0
/-- Distinct eigenvalues and algebraic multiplicities, PDF p.14. -/
def eigenvalues {n : ℕ} (A : GroupedRealMatrix n) : Finset ℂ := (complexify A).charpoly.roots.toFinset
def algebraicMultiplicity {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) : ℕ :=
Polynomial.rootMultiplicity z (complexify A).charpoly
/-- Real positive inertia of Im Omega(z,conj z) on E_lambda. The finite search
bound is the ambient real dimension 4n, PDF pp.12–15. -/
def kreinPositive {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) : ℕ :=
((Finset.range (4*n+1)).filter fun k => ∃ W : Submodule ℝ (Coord n → ℂ),
W ≤ (generalizedSpace A z).restrictScalars ℝ ∧ Module.finrank ℝ W = k ∧
∀ v ∈ W, v ≠ 0 → 0 < (omegaC v (fun i => star (v i))).im).sup id
/-- Rotation from the spectral formula (18), PDF p.15. Real inertia and the
negative real multiplicity are even, so these natural divisions are exact halves. -/
def spectralRotation {n : ℕ} (A : GroupedRealMatrix n) : ℂ :=
(-1 : ℂ)^((∑ z ∈ (eigenvalues A).filter (fun z => z.im = 0 ∧ z.re < 0),
algebraicMultiplicity A z)/2) *
∏ z ∈ (eigenvalues A).filter (fun z => ‖z‖ = 1 ∧ z ≠ 1 ∧ z ≠ -1),
z^(kreinPositive A z/2)
/-- Oriented real lift: a positive full turn has theta(t)=t and degree +1, pp.35,56. -/
def IsWindingLift (f : ℝ → ℂ) (T : ℝ) (k : ℤ) : Prop :=
∃ theta : ℝ → ℝ, ContinuousOn theta (Set.Icc 0 T) ∧ theta 0 = 0 ∧
theta T = (k : ℝ) ∧ ∀ t ∈ Set.Icc 0 T,
f t = Complex.exp (2*(Real.pi : ℂ)*Complex.I*(theta t : ℂ))
/-- Degree of a based continuous circle loop, PDF p.35; zero fallback off domain. -/
def winding (f : ℝ → ℂ) (T : ℝ) : ℤ :=
if h : ∃ k : ℤ, IsWindingLift f T k then Classical.choose h else 0
/-- Continuous symplectic path with arbitrary endpoints, PDF pp.35,47. -/
def IsPath {n : ℕ} (p : ℝ → GroupedRealMatrix n) (T : ℝ) : Prop :=
ContinuousOn p (Set.Icc 0 T) ∧ ∀ t ∈ Set.Icc 0 T, IsSymplectic (p t)
/-- Definition 32. Positive duration is supplied by binders, PDF p.35. -/
def IsAdmissible {n : ℕ} (p : ℝ → GroupedRealMatrix n) (T : ℝ) : Prop :=
IsPath p T ∧ p 0 = 1 ∧ (p T-1).det ≠ 0
/-- Fixed reference representatives, PDF p.32 (35)–(37). -/
def wPlus (n : ℕ) : GroupedRealMatrix n := -1
def wMinus (n : ℕ) : GroupedRealMatrix n := Matrix.diagonal fun i => match i with
| Sum.inl j => if j.val = 0 then 2 else -1
| Sum.inr j => if j.val = 0 then 1/2 else -1
/-- Positive affine reparametrization, PDF pp.38,43–44. -/
def unitPath {n : ℕ} (p : ℝ → GroupedRealMatrix n) (T : ℝ) : ℝ → GroupedRealMatrix n := fun t => p (T*t)
/-- Admissible extension of Definition 33, PDF p.35. -/
def IsExtension {n : ℕ} (p e : ℝ → GroupedRealMatrix n) : Prop :=
IsPath e 2 ∧ (∀ t ∈ Set.Icc (0 : ℝ) 1, e t = p t) ∧
(∀ t ∈ Set.Icc (1 : ℝ) 2, (e t-1).det ≠ 0) ∧
(e 2 = wPlus n ∨ e 2 = wMinus n)
/-- Choice is over actual extensions, not over index axioms; existence is concluded, p.35. -/
def chosenExtension {n : ℕ} (p : ℝ → GroupedRealMatrix n) : ℝ → GroupedRealMatrix n :=
if h : ∃ e, IsExtension p e then Classical.choose h else p
/-- Genuine integer degree construction, Definition 33, PDF p.35. -/
def conleyZehnder {n : ℕ} (p : ℝ → GroupedRealMatrix n) (T : ℝ) : ℤ :=
winding (fun t => spectralRotation (chosenExtension (unitPath p T) t)^2) 2
/-- All integer powers, including inverse powers, PDF p.15. -/
def integerPower {n : ℕ} (A : GroupedRealMatrix n) (k : ℤ) : GroupedRealMatrix n :=
if 0 ≤ k then A^k.toNat else (A⁻¹)^(-k).toNat
/-- Maximal nilpotent height on the generalized space, PDF p.17. -/
def HasNilpotentHeight {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) (p : ℕ) : Prop :=
(∃ v ∈ generalizedSpace A z, (shifted A z^p) v ≠ 0) ∧
∀ v ∈ generalizedSpace A z, (shifted A z^(p+1)) v = 0
/-- Kernel restricted to E_lambda, PDF p.17 (23). -/
def restrictedKernel {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) (j : ℕ) :
Submodule ℂ (generalizedSpace A z) :=
(LinearMap.ker (shifted A z^j)).comap (generalizedSpace A z).subtype
abbrev GeneralizedQuotient {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) (j : ℕ) :=
generalizedSpace A z ⧸ restrictedKernel A z j
/-- Compact-rectangle homotopy with fixed endpoints, PDF pp.38,46. -/
def FixedHomotopic {n : ℕ} (p q : ℝ → GroupedRealMatrix n) (T : ℝ) : Prop :=
∃ H : ℝ × ℝ → GroupedRealMatrix n,
ContinuousOn H (Set.Icc (0 : ℝ) 1 ×ˢ Set.Icc 0 T) ∧
(∀ s ∈ Set.Icc (0 : ℝ) 1, ∀ t ∈ Set.Icc 0 T, IsSymplectic (H (s,t))) ∧
(∀ t ∈ Set.Icc 0 T, H (0,t) = p t ∧ H (1,t) = q t) ∧
(∀ s ∈ Set.Icc (0 : ℝ) 1, H (s,0) = p 0 ∧ H (s,T) = p T)
/-- Homotopy through SP(n); the final endpoint may move in Sp*, PDF p.37. -/
def AdmissiblyHomotopic {n : ℕ} (p q : ℝ → GroupedRealMatrix n) : Prop :=
∃ H : ℝ × ℝ → GroupedRealMatrix n,
ContinuousOn H (Set.Icc (0 : ℝ) 1 ×ˢ Set.Icc (0 : ℝ) 1) ∧
(∀ s ∈ Set.Icc (0 : ℝ) 1, IsAdmissible (fun t => H (s,t)) 1) ∧
(∀ t ∈ Set.Icc (0 : ℝ) 1, H (0,t) = p t ∧ H (1,t) = q t)
/-- Catenation normalized to [0,1], PDF pp.38,46. -/
def catenate {n : ℕ} (p q : ℝ → GroupedRealMatrix n) : ℝ → GroupedRealMatrix n :=
fun t => if t ≤ 1/2 then p (2*t) else q (2*t-1)
/-- Lemma 36's translated catenation: the second argument is 2t-T, PDF p.38. -/
def translatedCatenate {n : ℕ} (phi psi : ℝ → GroupedRealMatrix n) (T : ℝ) : ℝ → GroupedRealMatrix n :=
fun t => if t ≤ T/2 then phi (2*t) else psi (2*t-T)*phi T
/-- Sum on a coordinate half, used to retain grouped order, PDF p.16. -/
def mergeBlocks {n m : ℕ} (F : Matrix (Fin n) (Fin n) ℝ)
(G : Matrix (Fin m) (Fin m) ℝ) : Matrix (Fin (n+m)) (Fin (n+m)) ℝ :=
Matrix.reindex finSumFinEquiv finSumFinEquiv (Matrix.fromBlocks F 0 0 G)
/-- Symplectic direct sum with the source's coordinate permutation, PDF p.16. -/
def symplecticSum {n m : ℕ} (A : GroupedRealMatrix n) (B : GroupedRealMatrix m) : GroupedRealMatrix (n+m) :=
Matrix.fromBlocks
(mergeBlocks (A.submatrix Sum.inl Sum.inl) (B.submatrix Sum.inl Sum.inl))
(mergeBlocks (A.submatrix Sum.inl Sum.inr) (B.submatrix Sum.inl Sum.inr))
(mergeBlocks (A.submatrix Sum.inr Sum.inl) (B.submatrix Sum.inr Sum.inl))
(mergeBlocks (A.submatrix Sum.inr Sum.inr) (B.submatrix Sum.inr Sum.inr))
/-- Maximum positive-subspace dimension in a finite real ambient space, pp.44–49. -/
def positiveInertia {d : Type*} [Fintype d] [DecidableEq d]
(W : Submodule ℝ (d → ℝ)) (q : (d → ℝ) → ℝ) : ℕ :=
((Finset.range (Fintype.card d+1)).filter fun k =>
∃ L : Submodule ℝ (d → ℝ), L ≤ W ∧ Module.finrank ℝ L = k ∧
∀ v ∈ L, v ≠ 0 → 0 < q v).sup id
/-- Positive minus negative inertia, also on degenerate forms and zero spaces, pp.44–49. -/
def formSignature {d : Type*} [Fintype d] [DecidableEq d]
(W : Submodule ℝ (d → ℝ)) (q : (d → ℝ) → ℝ) : ℤ :=
(positiveInertia W q : ℤ) - positiveInertia W (fun v => -q v)
def matrixSignature {d : Type*} [Fintype d] [DecidableEq d]
(S : Matrix d d ℝ) : ℤ :=
formSignature ⊤ (fun v => ∑ i, ∑ j, v i*S i j*v j)
/-- Exponential and small-symmetric normalization data, PDF pp.36,52. -/
def exponentialPath {n : ℕ} (S : GroupedRealMatrix n) : ℝ → GroupedRealMatrix n :=
fun t => NormedSpace.exp (t • (jMatrix n*S))
def IsSmallSymmetric {n : ℕ} (S : GroupedRealMatrix n) : Prop :=
S.transpose = S ∧ ∀ z ∈ eigenvalues S, ‖z‖ < 2*Real.pi
/-- The explicitly constructed S^-, not a variable supplied by a hypothesis, PDF p.41. -/
def sMinus (n : ℕ) : GroupedRealMatrix n := Matrix.fromBlocks
(Matrix.diagonal (fun i : Fin n => if i.val = 0 then 0 else 1))
(Matrix.diagonal (fun i : Fin n => if i.val = 0 then -Real.log 2/Real.pi else 0))
(Matrix.diagonal (fun i : Fin n => if i.val = 0 then -Real.log 2/Real.pi else 0))
(Matrix.diagonal (fun i : Fin n => if i.val = 0 then 0 else 1))
def referenceMinus (n : ℕ) : ℝ → GroupedRealMatrix n := exponentialPath (Real.pi • sMinus n)
/-- Complex-linear part and determinant normalized by absolute value, PDF p.42 (45). -/
def complexLinearPart {n : ℕ} (A : GroupedRealMatrix n) : GroupedRealMatrix n :=
(1/2 : ℝ) • (A-jMatrix n*A*jMatrix n)
def normalizedDet {n : ℕ} (A : GroupedRealMatrix n) : ℂ :=
complexActionDet (complexLinearPart A)/(‖complexActionDet (complexLinearPart A)‖ : ℂ)
/-- Upper shear of Definition 53, PDF p.51. -/
def shear {n : ℕ} (B : Matrix (Fin n) (Fin n) ℝ) : GroupedRealMatrix n := Matrix.fromBlocks 1 B 0 1
/-- Graph-reference kernel or vertical-reference intersection pulled back by A,
PDF pp.47,58. These are different subspaces. -/
def crossingSpace {n : ℕ} (vertical : Bool) (A : GroupedRealMatrix n) : Submodule ℝ (Coord n → ℝ) :=
if vertical then
LinearMap.ker (Matrix.toLin' (A.submatrix Sum.inl id)) ⊓
LinearMap.ker (Matrix.toLin' ((1 : GroupedRealMatrix n).submatrix Sum.inl id))
else LinearMap.ker (Matrix.toLin' (A-1))
/-- One-sided endpoint derivatives via the interval, PDF pp.44–50. -/
def pathDerivative {n : ℕ} (p : ℝ → GroupedRealMatrix n) (t : ℝ) : GroupedRealMatrix n :=
derivWithin p (Set.Icc (0 : ℝ) 1) t
/-- Pullback crossing form Omega(A v,A' w), PDF pp.49,58. On ker(A-I)
this is v^T S w; for RS2 the pullback subspace is V intersect A^-1 V. -/
def crossingBilinear {n : ℕ} (p : ℝ → GroupedRealMatrix n)
(t : ℝ) (v w : Coord n → ℝ) : ℝ :=
omegaR ((p t).mulVec v) ((pathDerivative p t).mulVec w)
def crossingSignature {n : ℕ} (vertical : Bool) (p : ℝ → GroupedRealMatrix n) (t : ℝ) : ℤ :=
formSignature (crossingSpace vertical (p t)) (fun v => crossingBilinear p t v v)
/-- Interior crossing set, Definitions 44,50, PDF pp.46,49. -/
def crossings {n : ℕ} (vertical : Bool) (p : ℝ → GroupedRealMatrix n) : Set ℝ :=
{t | t ∈ Set.Ioo (0 : ℝ) 1 ∧ crossingSpace vertical (p t) ≠ ⊥}
/-- Smoothness and nondegeneracy at every crossing, including endpoints, p.49.
Nondegeneracy on the zero space is valid. Finiteness is not assumed. -/
def IsRegular {n : ℕ} (vertical : Bool) (p : ℝ → GroupedRealMatrix n) : Prop :=
IsPath p 1 ∧ ContDiffOn ℝ ⊤ p (Set.Icc (0 : ℝ) 1) ∧
∀ t ∈ Set.Icc (0 : ℝ) 1, ∀ v ∈ crossingSpace vertical (p t),
(∀ w ∈ crossingSpace vertical (p t), crossingBilinear p t v w = 0) → v = 0
/-- Finite sum; off the finite domain the fallback is zero, PDF p.49. -/
def interiorCrossingSum {n : ℕ} (vertical : Bool) (p : ℝ → GroupedRealMatrix n) : ℤ :=
if h : (crossings vertical p).Finite then ∑ t ∈ h.toFinset, crossingSignature vertical p t else 0
/-- Half-integer crossing value, PDF pp.46,49. -/
def regularIndex {n : ℕ} (vertical : Bool) (p : ℝ → GroupedRealMatrix n) : ℚ :=
((crossingSignature vertical p 0 + 2*interiorCrossingSum vertical p +
crossingSignature vertical p 1 : ℤ) : ℚ)/2
/-- Smooth regular representative with fixed-endpoint homotopy, PDF p.46.
Choice imposes no index value or invariance assumption. -/
def regularPathRepresentative {n : ℕ} (vertical : Bool) (p : ℝ → GroupedRealMatrix n) : ℝ → GroupedRealMatrix n :=
if h : ∃ q, IsRegular vertical q ∧ FixedHomotopic p q 1 then Classical.choose h else p
/-- Graph Robbin–Salamon index reconstructed by Definitions 44,46 and (52), pp.46–49. -/
def robbinSalamon {n : ℕ} (p : ℝ → GroupedRealMatrix n) : ℚ := regularIndex false (regularPathRepresentative false p)
/-- Separate vertical-reference index of section 7.5, PDF p.58. -/
def robbinSalamonVertical {n : ℕ} (p : ℝ → GroupedRealMatrix n) : ℚ := regularIndex true (regularPathRepresentative true p)
/-- Half-integer family, with arbitrary endpoint degeneracies, PDF pp.47,53. -/
def IsHalfIntegerFamily (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
∀ n, 1 ≤ n → ∀ p, IsPath p 1 → ∃ k : ℤ, f n p = (k : ℚ)/2
/-- Homotopy/catenation/zero core shared by the characterizations, PDF pp.52–56. -/
def RsCore (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
IsHalfIntegerFamily f ∧
(∀ n, 1 ≤ n → ∀ p q, IsPath p 1 → IsPath q 1 → FixedHomotopic p q 1 → f n p = f n q) ∧
(∀ n, 1 ≤ n → ∀ p q, IsPath p 1 → IsPath q 1 → p 1 = q 0 →
f n (catenate p q) = f n p + f n q) ∧
(∀ n, 1 ≤ n → ∀ p, IsPath p 1 → ∀ k : ℕ,
(∀ t ∈ Set.Icc (0 : ℝ) 1, Module.finrank ℝ (crossingSpace false (p t)) = k) → f n p = 0)
/-- Four axioms: normalization includes singular and zero S, PDF p.52. -/
def RsFourAxioms (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
RsCore f ∧ (∀ n, 1 ≤ n → ∀ S : GroupedRealMatrix n, IsSmallSymmetric S →
f n (exponentialPath S) = (matrixSignature S : ℚ)/2)
/-- Dimension-family product, PDF pp.53,56. -/
def RsProduct (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
∀ n m, 1 ≤ n → 1 ≤ m → ∀ p q, IsPath p 1 → IsPath q 1 →
f (n+m) (fun t => symplecticSum (p t) (q t)) = f n p + f m q
/-- Seven properties, including generalization, naturality and -tB shear, PDF p.53. -/
def RsSevenAxioms (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
RsCore f ∧ RsProduct f ∧
(∀ n, 1 ≤ n → ∀ p, IsAdmissible p 1 → f n p = (conleyZehnder p 1 : ℚ)) ∧
(∀ n, 1 ≤ n → ∀ p q, IsPath p 1 → IsPath q 1 →
f n (fun t => q t*p t*(q t)⁻¹) = f n p) ∧
(∀ n, 1 ≤ n → ∀ B : Matrix (Fin n) (Fin n) ℝ, B.transpose = B →
f n (fun t => shear ((-t) • B)) = (matrixSignature B : ℚ)/2)
/-- Six properties, with distinct nondegenerate-signature and shear normalizations, p.56. -/
def RsSixAxioms (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
RsCore f ∧ RsProduct f ∧
(∀ n, 1 ≤ n → ∀ S : GroupedRealMatrix n, IsSmallSymmetric S → S.det ≠ 0 →
f n (exponentialPath S) = (matrixSignature S : ℚ)/2) ∧
(∀ n, 1 ≤ n → ∀ B : Matrix (Fin n) (Fin n) ℝ, B.transpose = B →
f n (fun t => shear ((-t) • B)) = (matrixSignature B : ℚ)/2)
/-- Homotopy, loop and signature characterization, PDF p.40. -/
def CzThreeAxioms {n : ℕ} (f : (ℝ → GroupedRealMatrix n) → ℤ) : Prop :=
(∀ p q, IsAdmissible p 1 → IsAdmissible q 1 → AdmissiblyHomotopic p q → f p = f q) ∧
(∀ p phi, IsAdmissible p 1 → IsPath phi 1 → phi 0 = 1 → phi 1 = 1 →
f (fun t => phi t*p t) = f p + 2*winding (fun t => spectralRotation (phi t)) 1) ∧
(∀ S : GroupedRealMatrix n, IsSmallSymmetric S → S.det ≠ 0 → 2*f (exponentialPath S) = matrixSignature S)
/-- Small-case sanity for the source's standard form, PDF p.4. -/
example : omegaMatrix 0 = 0 := by ext i; exact Fin.elim0 (i.elim id id)
/-- The imported symplectic predicate fixes the identity, PDF p.4. -/
example (n : ℕ) : IsSymplectic (1 : GroupedRealMatrix n) := by
simp [IsSymplectic]
/-- First symplectic plane of W^-, PDF p.32. -/
example : wMinus 1 (Sum.inl 0) (Sum.inl 0) = 2 := by simp [wMinus]
example : wMinus 1 (Sum.inr 0) (Sum.inr 0) = (1/2 : ℝ) := by simp [wMinus]
/-- Zero-space signature sanity, PDF pp.44–49. -/
example : matrixSignature (0 : Matrix (Fin 0) (Fin 0) ℝ) = 0 := by
simp [matrixSignature, formSignature, positiveInertia]
/-- Positive full-turn lift sanity, PDF pp.35,56. -/
example : IsWindingLift
(fun t => Complex.exp (2*(Real.pi : ℂ)*Complex.I*(t : ℂ))) 1 1 := by
refine ⟨id, continuous_id.continuousOn, rfl, ?_, ?_⟩
· norm_num
· intro t ht
rfl
/-- Zeroth integer power sanity, PDF p.15. -/
example (n : ℕ) : integerPower (1 : GroupedRealMatrix n) 0 = 1 := by simp [integerPower]
/-- Identity has the full graph-reference kernel, PDF p.47. -/
example (n : ℕ) : crossingSpace false (1 : GroupedRealMatrix n) = ⊤ := by simp [crossingSpace]
/-- The shear's upper-right block is B, PDF p.51. -/
example {n : ℕ} (B : Matrix (Fin n) (Fin n) ℝ) (i j : Fin n) :
shear B (Sum.inl i) (Sum.inr j) = B i j := rfl
/-- Theorem 10(1)–(3), dimension two, PDF pp.8,11. -/
def RotationAxiomsTwo (r : GroupedRealMatrix 1 → ℂ) : Prop :=
ContinuousOn r {A | IsSymplectic A} ∧ (∀ A, IsSymplectic A → ‖r A‖ = 1) ∧
(∀ A, IsSymplectic A → IsOrthogonal A → r A = complexActionDet A) ∧
(∀ A K, IsSymplectic A → IsSymplectic K → r (K*A*K⁻¹) = r A) ∧
(∀ A, IsSymplectic A → (∀ z ∈ eigenvalues A, ‖z‖ ≠ 1) → r A = 1 ∨ r A = -1)
/-- Graph as an actual linear subspace, PDF p.47. -/
def graphSpace {n : ℕ} (A : GroupedRealMatrix n) : Submodule ℝ ((Coord n → ℝ) × (Coord n → ℝ)) :=
LinearMap.range ((LinearMap.id : (Coord n → ℝ) →ₗ[ℝ] (Coord n → ℝ)).prod (Matrix.toLin' A))
/-- Lagrangian in the doubled form -Omega direct_sum Omega, PDF p.47. -/
def IsGraphLagrangian {n : ℕ} (W : Submodule ℝ ((Coord n → ℝ) × (Coord n → ℝ))) : Prop :=
Module.finrank ℝ W = 2*n ∧ ∀ v ∈ W, ∀ w ∈ W, -omegaR v.1 w.1 + omegaR v.2 w.2 = 0
/-- Four rotation axioms for the positive-dimension family of Theorem 10,
PDF p.8. Functions are compared only on symplectic matrices in dimensions n>=1. -/
def RotationFamilyAxioms (r : ∀ n : ℕ, GroupedRealMatrix n → ℂ) : Prop :=
(∀ n, 1 ≤ n → ContinuousOn (r n) {A | IsSymplectic A}) ∧
(∀ n, 1 ≤ n → ∀ A, IsSymplectic A → ‖r n A‖ = 1) ∧
(∀ n, 1 ≤ n → ∀ A, IsSymplectic A → IsOrthogonal A →
r n A = complexActionDet A) ∧
(∀ n, 1 ≤ n → ∀ A K, IsSymplectic A → IsSymplectic K →
r n (K*A*K⁻¹) = r n A) ∧
(∀ n, 1 ≤ n → ∀ A, IsSymplectic A →
(∀ z ∈ eigenvalues A, ‖z‖ ≠ 1) → r n A = 1 ∨ r n A = -1) ∧
(∀ n m, 1 ≤ n → 1 ≤ m → ∀ A : GroupedRealMatrix n, ∀ B : GroupedRealMatrix m,
IsSymplectic A → IsSymplectic B →
r (n+m) (symplecticSum A B) = r n A*r m B)
/-- Circle-range sanity in the first positive dimension. -/
example (r : ∀ n : ℕ, GroupedRealMatrix n → ℂ) (hr : RotationFamilyAxioms r)
(A : GroupedRealMatrix 1) (hA : IsSymplectic A) : ‖r 1 A‖ = 1 :=
hr.2.1 1 (by norm_num) A hA
/-- Real Krein form before restricting to E_lambda; conjugate the second
vector explicitly, PDF pp.12,15, formula (18). -/
def kreinPairing {n : ℕ} (v w : Coord n → ℂ) : ℝ :=
(omegaC v (fun i => star (w i))).im
/-- Zero-vector sanity for the real Krein form. -/
example {n : ℕ} (v : Coord n → ℂ) : kreinPairing v 0 = 0 := by
simp [kreinPairing, omegaC]
/-- Multiplicity of an eigenvalue of the first kind, Definition 17 and
Remark 18, PDF p.15. At +1 and -1 use half the complex generalized dimension;
elsewhere on S1 use half the real positive inertia. -/
def firstKindMultiplicity {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) : ℕ :=
if ‖z‖ < 1 then algebraicMultiplicity A z
else if ‖z‖ = 1 then
if z = 1 ∨ z = -1 then Module.finrank ℂ (generalizedSpace A z)/2
else kreinPositive A z/2
else 0
/-- Inside-circle multiplicity sanity, including repeated roots. -/
example {n : ℕ} (A : GroupedRealMatrix n) (z : ℂ) (hz : ‖z‖ < 1) :
firstKindMultiplicity A z = algebraicMultiplicity A z := by
simp [firstKindMultiplicity, hz]
/-- The -1 case uses the half-dimension convention of Definition 17. -/
example {n : ℕ} (A : GroupedRealMatrix n) :
firstKindMultiplicity A (-1) = Module.finrank ℂ (generalizedSpace A (-1))/2 := by
simp [firstKindMultiplicity]
/-- Five image-index properties on all positive dimensions, PDF p.58.
Homotopy is the full iff for paths with the same matrix endpoints. -/
def ImageIndexAxioms (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) : Prop :=
IsHalfIntegerFamily f ∧
(∀ n, 1 ≤ n → ∀ p q : ℝ → GroupedRealMatrix n,
IsPath p 1 → IsPath q 1 → p 0 = q 0 → p 1 = q 1 →
(FixedHomotopic p q 1 ↔ f n p = f n q)) ∧
(∀ n, 1 ≤ n → ∀ p q : ℝ → GroupedRealMatrix n,
IsPath p 1 → IsPath q 1 → p 1 = q 0 → f n (catenate p q) = f n p + f n q) ∧
RsProduct f ∧
(∀ n, 1 ≤ n → ∀ p : ℝ → GroupedRealMatrix n, IsPath p 1 → ∀ k : ℕ, k ≤ n →
(∀ t ∈ Set.Icc (0 : ℝ) 1, Module.finrank ℝ (crossingSpace true (p t)) = k) →
f n p = 0) ∧
(∀ n, 1 ≤ n → ∀ B : ℝ → Matrix (Fin n) (Fin n) ℝ,
ContinuousOn B (Set.Icc (0 : ℝ) 1) →
(∀ t ∈ Set.Icc (0 : ℝ) 1, (B t).transpose = B t) →
f n (fun t => shear (B t)) =
(matrixSignature (B 0) : ℚ)/2 - (matrixSignature (B 1) : ℚ)/2)
/-- Definitional sanity: the image characterization includes the actual
half-integer range condition, rather than an unrestricted rational range. -/
example (f : ∀ n : ℕ, (ℝ → GroupedRealMatrix n) → ℚ) (hf : ImageIndexAxioms f) :
IsHalfIntegerFamily f := hf.1
end QAlgorithms.Papers.Independent.Gap50repair.P01
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap50repair.P01.AdmissiblyHomotopic
For every natural number , including , and every two functions , this proposition means that there exists a function , continuous on , such that for every the function is continuous on , satisfies for all , starts at , and satisfies , where ; additionally, and for all . The final matrix may vary with , subject to the stated determinant condition. For , matrices are empty and their determinants are .
QAlgorithms.Papers.Independent.Gap50repair.P01.CMat
For every natural number , is the type of all complex matrices whose rows and columns are indexed by the disjoint union of two copies of . Thus these are matrices with coordinates grouped by the two copies. When , there is exactly one such empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.CommutesWithComplexStructure
For every natural number and every real matrix whose coordinates are grouped into two copies of , means exactly
where is the identity matrix. When , this condition holds for the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.ComplexUnitary
For each natural number , this defines the type of complex matrices satisfying , where is the conjugate transpose, with each matrix accompanied by evidence of this equality. For , the unique empty matrix satisfies the condition.
QAlgorithms.Papers.Independent.Gap50repair.P01.Coord
For every natural number , is the disjoint union of two copies of , with each element tagged as belonging to the first or second copy. It has elements and is empty when .
QAlgorithms.Papers.Independent.Gap50repair.P01.CzThreeAxioms
For any natural number , including , and any function assigning an integer to every function , this proposition consists of three requirements. Write ; a symplectic path is a function continuous on with there, and an admissible path additionally satisfies and . First, for all admissible , whenever there exists continuous on such that every function , for , is admissible, and and for every ; these homotopies need not keep the endpoint at fixed. Second, for every admissible and every symplectic path with , one has . Here is a chosen integer admitting a function continuous on with , , and there, or if no such integer exists. For a real matrix , let be the distinct roots of the characteristic polynomial of its entrywise complexification , let be their root multiplicities, and put . Let be the largest for which a real subspace has real dimension and satisfies for every nonzero , where . Define . Third, for every real symmetric matrix with and for every complex characteristic root , one has , where is the largest dimension of a real subspace on which is strictly positive on nonzero vectors, minus the analogous largest dimension for . At , matrices and vector spaces are empty dimensional, determinants and empty products are , and empty sums are .
QAlgorithms.Papers.Independent.Gap50repair.P01.FixedHomotopic
For every natural number , including , every two functions , and every real number , this proposition means that there exists a function , continuous on , such that, with , one has for all and , and for all , and and for all . Here ; when , this interval is empty, so the continuity, symplecticity, and conditions indexed by are vacuous, while the two conditions imposed for every remain. When , the interval consists of the single time .
QAlgorithms.Papers.Independent.Gap50repair.P01.GeneralizedQuotient
For every natural number , every real matrix , every complex number , and every natural number , let , where is the entrywise complexification of , and let . This abbreviates the complex vector space
Thus two vectors in represent the same class exactly when their difference is killed by . No assumption that is an eigenvalue is required. For the denominator is zero, while for the quotient is the zero vector space; when , it is also the zero vector space.
QAlgorithms.Papers.Independent.Gap50repair.P01.GroupedRealMatrix
For every natural number , is the type of all real matrices whose rows and columns are indexed by the disjoint union of two copies of . Thus these are matrices with coordinates grouped by the two copies. When , there is exactly one such empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.HasNilpotentHeight
For every natural number , every real matrix , every complex number , and every natural number , let , where is the entrywise complexification of , and let . The defined proposition holds exactly when there exists with , and every satisfies . There is no assumption that is an eigenvalue. If , in particular when , the existential condition fails. When , the condition requires and for every , since is the identity.
QAlgorithms.Papers.Independent.Gap50repair.P01.ImageIndexAxioms
For a family assigning a rational number to every natural number and every function , the defined proposition is the conjunction of the following conditions. Write ; a path means a function continuous on whose matrices satisfy throughout that interval. A homotopy with fixed endpoints from to means a function , continuous on , whose values there are symplectic and satisfy , , , and for all . First, for every and every path , there exists such that . Second, for every and paths with and , a homotopy with fixed endpoints exists if and only if . Third, for every and paths with ,
Fourth, for every and paths of sizes , respectively,
where acts separately on the two coordinate spaces and uses combined coordinate order . Fifth, for every , every path , and every natural number , including , if the real subspace
has dimension for every , then . Sixth, for every and every function continuous on and satisfying throughout that interval,
where is 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 ; zero-dimensional subspaces are permitted. Every condition is restricted to positive dimensions, so the proposition imposes no restriction on .
QAlgorithms.Papers.Independent.Gap50repair.P01.IsAdmissible
For every natural number , function , and real number , this predicate means that is continuous on , that for every , where , and that and . For , the interval conditions are vacuous but both endpoint conditions remain. For and , the endpoint conditions cannot both hold. For , the unique empty-matrix-valued function satisfies the predicate for every , since the empty determinant is .
QAlgorithms.Papers.Independent.Gap50repair.P01.IsEigenvalue
For every natural number , real matrix , and complex number , this predicate means that there exists a nonzero vector satisfying , where is obtained by viewing every real entry of as a complex number. For , the predicate is false because the vector space has no nonzero vector.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsExtension
For every natural number and functions , this predicate means that is continuous on , that for every , where , that for every , and that for every , including both endpoints. It further requires that equal either or the diagonal matrix having entry at index in the first coordinate copy, entry at index in the second copy, and entry at every other diagonal position. The value is unrestricted apart from the conditions inherited from , and the functions outside the specified intervals are unrestricted. For , the matrices are empty, their determinants are , and the predicate holds for the unique possible matrix-valued functions.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsGraphLagrangian
For every natural number , including zero, and every real linear subspace , the predicate means that and that, for every and every ,
where each vector in is written in its two -coordinate blocks . The predicate does not require to be the graph of a map. When , the dimension condition is zero and the displayed sums are empty.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsHalfIntegerFamily
For a family assigning a rational number to every natural number and every function , this property means that, for every and every continuous on and satisfying
there exists an integer such that as a rational number. No initial or terminal matrix is prescribed, and no condition is imposed outside . The property imposes no restriction on or on values at functions failing the stated path conditions.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsOrthogonal
For every natural number and every real matrix whose coordinates are grouped into two copies of , means exactly
When , this condition holds for the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsPath
For every natural number , function , and real number , this predicate means that is continuous on and that
The matrix coordinates consist of two copies of . For , the interval is empty and the predicate holds for every . For , it requires precisely the displayed matrix equation at , since continuity on a singleton is automatic. The case is included.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsRegular
For any natural number , including , Boolean flag , and function , this property means that is continuous and infinitely differentiable on , that
and that the following condition holds at every . Define
where is the derivative within . Every satisfying for all must equal zero. This condition includes the endpoints and is vacuous whenever . There is no prescribed value for or , and no requirement outside ; when , all these conditions hold for the unique matrix-valued function.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsSmallSymmetric
For every natural number , including , and every real matrix indexed by two disjoint copies of , this predicate means that and every complex root of the characteristic polynomial of the matrix obtained by viewing the entries of as complex numbers satisfies
The roots are considered as a finite set, without retaining multiplicities. For , the symmetry condition holds for the empty matrix and the root condition is vacuous.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsSymmetricLie
For every natural number and real matrix , indexed by two copies of , this predicate means
The case is included, and both equalities hold for the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsUnitaryReal
For every natural number and every real matrix whose coordinates are grouped into two copies of , write and for its upper-left and lower-left blocks, set with real entries embedded in , and set . The predicate means the conjunction
where is the conjugate transpose and . When , both equalities hold for the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.IsWindingLift
For an arbitrary function , real number , and integer , this predicate means that there exists a function , continuous on the closed interval , satisfying , , and
Here . For , this interval is empty, so continuity and the equation for impose no conditions, and the predicate holds for every integer by choosing the two specified values of . For , it holds exactly when and .
QAlgorithms.Papers.Independent.Gap50repair.P01.RotationAxiomsTwo
For a function , this proposition means the conjunction of the following conditions, with . The restriction of to is continuous; for every in this set, ; for every such also satisfying , one has , where the entries are embedded into ; for every pair of real matrices satisfying and , one has ; and, for every satisfying such that every complex root of the characteristic polynomial of its entrywise complexification satisfies , one has or . The characteristic roots in this last condition are considered as a set, without multiplicity.
QAlgorithms.Papers.Independent.Gap50repair.P01.RotationFamilyAxioms
For a family of functions , indexed by every natural number , means the conjunction of the following six requirements. Set ; a real matrix is symplectic here when . For every , is continuous on the set of symplectic matrices; for every such and every symplectic , ; for every such and every symplectic also satisfying , one has , where are the indicated blocks of ; for every such and every pair of symplectic matrices , one has ; for every such and every symplectic whose complex characteristic polynomial has no root of modulus , one has or ; and, for every and every symplectic , , one has
The functions are defined on all real matrices, but these requirements impose no conditions in dimension or on their values at nonsymplectic matrices.
QAlgorithms.Papers.Independent.Gap50repair.P01.RsCore
For a family assigning a rational number to every natural number and every function , this property is the conjunction of four requirements, all restricted to . Write , and call a function a path here when it is continuous on and satisfies throughout that interval. First, every such path has for some integer . Second, for any two such paths , one has whenever there exists a function , continuous on , satisfying
for all . Third, any such paths with satisfy , where the function on all real arguments is
Fourth, for every such path and every natural number , if for all , then ; this includes , and a value makes the hypothesis impossible. There is no prescribed initial matrix, no restriction on path values outside , and no condition on or on values at functions that are not paths.
QAlgorithms.Papers.Independent.Gap50repair.P01.RsFourAxioms
For a family assigning rational values to all natural numbers and all functions , this property requires the following for every , with . A path means a function continuous on satisfying there. Every path has for some integer . Any two paths have equal values whenever there is a function , continuous on , satisfying
for every . For any paths with , the function for and for satisfies . For every path and natural number , constancy throughout implies . In addition, every real symmetric matrix whose complex characteristic-polynomial roots all satisfy obeys
where is the matrix exponential and is the largest dimension of a real linear subspace of on which for every nonzero , minus the largest dimension of one on which for every nonzero ; both maxima range over . This last requirement includes singular matrices and . No initial matrix is prescribed for general paths, and these requirements impose no restriction on .
QAlgorithms.Papers.Independent.Gap50repair.P01.RsProduct
For a family assigning a rational number to every natural number and every function , this proposition means the following. For all natural numbers and all functions and that are continuous on and satisfy and there, where , one has . Here, if and are written in their two coordinate blocks, is the matrix whose block is ; thus the first coordinate groups of sizes are placed together, followed by the second coordinate groups. The functions are defined on all of , although the continuity and symplectic conditions concern only . This proposition places no condition on .
QAlgorithms.Papers.Independent.Gap50repair.P01.RsSevenAxioms
For a family assigning to every and every function , this proposition is the conjunction of the following requirements. Write and , and call a symplectic path on when it is continuous there and for every there. For every and every symplectic path on , for some integer . For all and symplectic paths on , whenever there is a function continuous on , symplectic at every point of that square, with , , , and for all ; if , then for the function when and otherwise; and, for every , if for every , then . For all and symplectic paths of the corresponding sizes, , where has block in the two coordinate blocks. For every and symplectic path on with and , one has , with the integer defined as follows: choose an extension that is a symplectic path on , agrees with on , satisfies on , and ends at either or the diagonal matrix having entries in the first coordinate of the first group, in the first coordinate of the second group, and in all other coordinates; if no such extension exists, use . Set , where is a chosen integer for which there is , continuous on , with , , and throughout , and is if no such integer exists. To define , let be the set of distinct roots of the characteristic polynomial of the entrywise complexification , let be the root multiplicity, and let . Let be the largest for which there is a real subspace of real dimension such that for every nonzero , where . Then , with empty sums and products equal to and , respectively. The remaining requirements are that, for every and symplectic paths on , , with no endpoint conditions on ; and, for every real symmetric matrix , . Here is the maximal dimension of a real subspace on which is strictly positive for every nonzero vector, minus the analogous maximal dimension for , regarded as an integer. All functions are defined on all real parameters, and none of these requirements constrains .
QAlgorithms.Papers.Independent.Gap50repair.P01.RsSixAxioms
For a family assigning to every natural number and every function , this proposition is the conjunction of the following requirements. Put , and call a symplectic path on when it is continuous there and throughout that interval. For every and such , there exists with . For every and such , one has whenever there exists continuous on , symplectic at every point there, and satisfying , , , and for all ; whenever , one has for if and otherwise; and, for every natural number , if for all , then . For every and symplectic paths of the corresponding sizes, one has , where, in two coordinate blocks, the block of is . For every and every real symmetric matrix such that and every complex root of its characteristic polynomial satisfies , one has , where is the matrix exponential. Finally, for every and every real symmetric matrix , one has . For a real square matrix , here means the maximal dimension of a real subspace on which is strictly positive for every nonzero , minus the analogous maximal dimension for , as an integer. All functions have domain , with the stated path conditions imposed only on , and no requirement is imposed on .
QAlgorithms.Papers.Independent.Gap50repair.P01.SpecialUnitary
For each natural number , this defines the type of complex matrices accompanied by evidence that and , where denotes conjugate transpose. For , the unique empty matrix satisfies both conditions, since its determinant is .
QAlgorithms.Papers.Independent.Gap50repair.P01.SymmetricLieSpace
For each natural number , this defines the type of real matrices , indexed by two copies of , satisfying and , where , with each matrix accompanied by evidence of these conditions. For , the unique empty matrix satisfies them.
QAlgorithms.Papers.Independent.Gap50repair.P01.SymplecticSpace
For each natural number , let and . This defines the type of real matrices satisfying , with each matrix accompanied by evidence of this equality. The case is included; its unique empty matrix satisfies the condition.
QAlgorithms.Papers.Independent.Gap50repair.P01.UnitCircle
This defines the type of complex numbers satisfying , with each number accompanied by evidence of this equality.
QAlgorithms.Papers.Independent.Gap50repair.P01.UnitarySpace
For each natural number , this defines the type of real matrices , indexed by two copies of , satisfying both , where , and , where is the complex matrix whose entries are , and denotes conjugate transpose. Each matrix is accompanied by evidence of these conditions. The case is included, and its unique empty matrix satisfies them.
QAlgorithms.Papers.Independent.Gap50repair.P01.algebraicMultiplicity
For every natural number , real matrix , and complex number , this defines the natural-number multiplicity of as a root of the characteristic polynomial of the matrix obtained by viewing the entries of as complex numbers. The value is when is not a root. In particular, for , it is for every .
QAlgorithms.Papers.Independent.Gap50repair.P01.catenate
For every natural number , including , and every two functions , this defines a function on all real by
Its value at is . There are no assumptions of continuity, symplecticity, or equality .
QAlgorithms.Papers.Independent.Gap50repair.P01.chosenExtension
For every natural number , including , and every function , this defines a function as follows. Put . If there exists a function that is continuous on , satisfies for every , agrees with on , satisfies for every , and has or , then the defined function is one such , selected by classical choice. Here is diagonal in the ordering of the first coordinates followed by the second coordinates: when , its first entry in the first group is , its first entry in the second group is , and every other diagonal entry is ; for , it is the empty matrix. If no such exists, the defined function is itself. No initial assumptions on are imposed.
QAlgorithms.Papers.Independent.Gap50repair.P01.complexActionDet
For every natural number and every real matrix whose coordinates are grouped into two copies of , let and denote its upper-left and lower-left blocks. The complex number is defined by
where the real block entries are regarded as complex numbers and . No additional condition on is required. When , this is the determinant of the empty matrix, namely .
QAlgorithms.Papers.Independent.Gap50repair.P01.complexActionMatrix
For every natural number and every real matrix whose coordinates are grouped into two copies of , write its blocks as . The matrix is the complex matrix defined entrywise by
with real entries regarded as complex numbers and . This definition applies to every , with no commutation or orthogonality assumption. When , is the empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.complexLinearPart
For every natural number , including , and every real matrix indexed by two disjoint copies of , this defines the real matrix
No assumption is imposed on . For , the result is the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.conleyZehnder
For every natural number , including , every function , and every real number , this defines an integer as follows. First set . Write , and choose a function continuous on such that there, on , on , and is either or the diagonal matrix with entries and on the first coordinates of the two respective groups and elsewhere. If such a function exists, one is selected by classical choice; otherwise set . For any real matrix , let be the set of distinct complex roots of the characteristic polynomial of its entrywise complexification , let be the root multiplicity of , and put . Define to be the largest for which there is a real linear subspace of real dimension such that every nonzero satisfies
The zero subspace makes eligible. Set
The defined integer is a classically chosen for which there exists a real function , continuous on , with , , and throughout ; if no such integer exists, it is . There are no hypotheses that be positive or that be continuous or symplectic. Empty sums and products have values and , respectively, and for the generalized spaces above are kernels of identity maps on the zero vector space.
QAlgorithms.Papers.Independent.Gap50repair.P01.crossingBilinear
For any natural number , including , any function , any , and any vectors , with coordinates grouped as , this defines the real number
where is the derivative of within at . This uses the total within-derivative operation, which returns zero when is not differentiable within that set at ; no continuity, differentiability, symplecticity, or restriction is assumed. For , the sum is empty and the value is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.crossingSignature
For any natural number , including , Boolean flag , function , and real , this defines an integer as follows. Use grouped coordinates , and set
Writing for the total derivative within , define
The integer is the largest dimension of a real linear subspace on which for every nonzero , minus the largest dimension of such a subspace on which for every nonzero . Each maximum ranges over dimensions , with the zero subspace always eligible. No regularity or symplecticity of , or restriction on , is required; the within-derivative is zero when within-differentiability fails. For , the integer is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.crossingSpace
For every natural number , every Boolean choice , and every real matrix indexed by two disjoint copies of , write vectors as and write . If is true, this defines the real linear subspace
If is false, it defines . No condition is imposed on ; for , either choice gives the zero subspace of the zero-dimensional vector space.
QAlgorithms.Papers.Independent.Gap50repair.P01.crossings
For any natural number , including , Boolean flag , and function , this defines the set
where denotes the first block of coordinates. Thus membership requires a nonzero vector in the indicated subspace and excludes both endpoints. No continuity or symplecticity of , and no finiteness of this set, is assumed. For , this set is empty.
QAlgorithms.Papers.Independent.Gap50repair.P01.eigenvalues
For every natural number and real matrix , indexed by two copies of , this defines the finite set of distinct complex roots of the characteristic polynomial of , where is obtained by viewing each entry of as a complex number. Root multiplicities are discarded when forming this set. The definition includes , when the characteristic polynomial is and the set is empty.
QAlgorithms.Papers.Independent.Gap50repair.P01.exponentialPath
For every natural number , including , and every real matrix indexed by two disjoint copies of , this defines the function on all real given by
where is the matrix exponential. No symmetry or other condition is imposed on , and the time parameter is not restricted to an interval. For , this is the constant function taking the unique empty matrix as its value.
QAlgorithms.Papers.Independent.Gap50repair.P01.firstKindMultiplicity
For every natural number , every real matrix , and every complex number , define as the multiplicity of as a root of the characteristic polynomial of the entrywise complexification , and let . Let be the largest for which there exists a real linear subspace , of real dimension , such that
Then the natural number is
No symplectic hypothesis on , no requirement that be a characteristic root, and no divisibility hypothesis is imposed; the divisions therefore round down. The zero subspace is permitted in defining . For , the characteristic polynomial is , the generalized spaces are zero-dimensional, and this multiplicity is zero for every .
QAlgorithms.Papers.Independent.Gap50repair.P01.formSignature
For any finite type with decidable equality, any real linear subspace , and any function , this defines an integer equal to the largest dimension of a real linear subspace on whose nonzero vectors is strictly positive, minus the largest dimension of a real linear subspace on whose nonzero vectors is strictly negative. Both maxima range over dimensions from to , and the zero subspace qualifies vacuously in both cases. No quadratic-form assumption is imposed on ; when is empty, the result is .
QAlgorithms.Papers.Independent.Gap50repair.P01.generalizedSpace
For every natural number , real matrix , and complex number , this defines the complex subspace
where is obtained by viewing the real entries of as complex numbers and the power denotes repeated composition of the corresponding linear endomorphism. There is no assumption that is an eigenvalue. When , the exponent is zero, so the defining endomorphism is the identity and its kernel is the zero subspace.
QAlgorithms.Papers.Independent.Gap50repair.P01.graphSpace
For every natural number , including zero, and every real matrix , with coordinates indexed by two disjoint copies of , is the real linear subspace
No symmetry, invertibility, or symplectic condition on is required; for , this is the zero subspace of the zero-dimensional product space.
QAlgorithms.Papers.Independent.Gap50repair.P01.integerPower
For every natural number , including , every real matrix , and every integer , this defines when , using the corresponding natural-number exponent, and when , again using a natural-number exponent. In particular, gives the identity matrix. No invertibility assumption is imposed: the matrix inverse is total and equals the zero matrix when is singular, so a negative exponent gives the zero matrix for singular .
QAlgorithms.Papers.Independent.Gap50repair.P01.interiorCrossingSum
For any natural number , including , Boolean flag , and function , define
For each , let be the largest dimension of a real subspace of on which
is strictly positive on nonzero vectors, minus the largest dimension of a subspace on which it is strictly negative on nonzero vectors. Here is the total derivative within , zero when within-differentiability fails, and each dimension maximum is taken among . This definition returns if is finite, and returns zero if is infinite. An empty sum is zero. No regularity or symplecticity is assumed; in particular, for the result is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.jMatrix
For every natural number , is the real matrix, with coordinates grouped into two copies of , given by
Here is the identity matrix; when , the result is the empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.kreinPairing
For every natural number , including zero, and every pair , with their coordinates divided into two -coordinate blocks , the real number is defined by
There are no restrictions on ; for , the sum is empty and the value is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.kreinPositive
For every natural number , real matrix , and complex number , write for its entrywise complexification and let . This defines the largest integer for which there exists a real linear subspace of , contained in viewed as a real vector space, with real dimension , such that every nonzero satisfies
The zero subspace always qualifies for , since its positivity condition is vacuous. For , the power defining is the zeroth power, hence the identity, so and the defined value is .
QAlgorithms.Papers.Independent.Gap50repair.P01.matrixSignature
For any finite type with decidable equality and any real matrix , this defines an integer using the function
The integer is the largest dimension of a real linear subspace of on which for every nonzero , minus the largest dimension of a real linear subspace on which for every nonzero . The dimensions considered range from to , and the zero subspace qualifies in both maxima. No symmetry assumption is imposed on ; for empty , the value is .
QAlgorithms.Papers.Independent.Gap50repair.P01.mergeBlocks
For every pair of natural numbers , every real matrix , and every real matrix , this defines the real block diagonal matrix
indexed by , with the indices of occupying the first positions and those of occupying the following positions. Either size may be , in which case the corresponding block is empty.
QAlgorithms.Papers.Independent.Gap50repair.P01.normalizedDet
For every natural number , including , and every real matrix indexed by two disjoint copies of , set
This defines the complex number , with the real denominator viewed as a complex number. No nonvanishing assumption is imposed: if , the value is under the totalized division convention. For , the empty determinant is , so the value is .
QAlgorithms.Papers.Independent.Gap50repair.P01.omegaC
For every natural number and every pair of complex-valued functions on the disjoint union of two copies of , write and for their values on the first and second copies. The complex number is defined by
The products use the given complex values without conjugation. When , both functions have empty domain and this empty sum is .
QAlgorithms.Papers.Independent.Gap50repair.P01.omegaMatrix
For every natural number , is the real matrix, indexed first by one copy of and then by a second copy, defined by
where is the identity matrix and each zero block is . For , this is the empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.omegaR
For every natural number and every pair of real-valued functions on the disjoint union of two copies of , write and for their values on the first and second copies. The real number is defined by
When , both functions have empty domain and this empty sum is .
QAlgorithms.Papers.Independent.Gap50repair.P01.pathDerivative
For every natural number , including , every function , with matrices indexed by two disjoint copies of , and every real , this defines the derivative of at taken within the closed interval . Thus the interval also governs the derivative at the endpoints; the definition accepts all real , including those outside the interval, and imposes no continuity or differentiability hypothesis on . It uses the totalized derivative-within operation, which remains defined when an ordinary derivative is unavailable.
QAlgorithms.Papers.Independent.Gap50repair.P01.polarP
For every natural number and real matrix , indexed by two copies of , this defines a real matrix as follows: if there exists a real matrix of the same size satisfying , positive definiteness, and , then is a witness selected by classical choice; otherwise . No invertibility hypothesis on is imposed. The definition includes , where the unique empty matrix satisfies the witness conditions.
QAlgorithms.Papers.Independent.Gap50repair.P01.polarU
For every natural number and real matrix , indexed by two copies of , this defines , where is a classically selected real symmetric positive definite matrix satisfying if such a matrix exists, and is otherwise. The inverse is the total matrix inverse, which is zero for a singular matrix; here either branch gives an invertible , and the fallback branch therefore gives . No invertibility hypothesis on is required, and is included.
QAlgorithms.Papers.Independent.Gap50repair.P01.positiveInertia
For any finite type with decidable equality, any real linear subspace , and any function , this defines the natural number
No quadratic-form or other regularity assumption is imposed on . The zero subspace always qualifies, since its positivity condition is vacuous, so the set has a maximum; in particular, the value is when is empty.
QAlgorithms.Papers.Independent.Gap50repair.P01.referenceMinus
For every natural number , this defines a function on all real by
where is diagonal with entry at index and entry at every other index, and is diagonal with entry at index and entry elsewhere. The matrices are indexed by two disjoint copies of , and is the matrix exponential. For , the function is constant at the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.regularIndex
For any natural number , including , Boolean flag , and function , this defines the rational number
Here
and is the largest dimension of a real subspace of on which
is strictly positive on nonzero vectors, minus the corresponding largest dimension for strict negativity; these dimension maxima range over . The symbol denotes the total derivative within , zero when within-differentiability fails. If is finite, then ; otherwise . No regularity, symplecticity, or finiteness hypothesis is imposed despite the definition’s name. For , the value is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.regularPathRepresentative
For any natural number , including , Boolean flag , and function , this defines a function by choosing, if one exists, a function with the following properties, and otherwise returning . First, is continuous and infinitely differentiable on , and there, where . For
the form
has the property that and for every imply , at every ; is the derivative within that interval. Second, there exists a function , continuous on , such that every on that square satisfies , and
The choice is not asserted to be unique, and existence is not assumed. No conditions outside the specified intervals are imposed.
QAlgorithms.Papers.Independent.Gap50repair.P01.restrictedKernel
For every natural number , every real matrix , every complex number , and every natural number , write , with the entrywise complexification of , and . This defines the complex linear subspace of consisting of precisely those vectors for which ; its underlying vectors therefore form . No eigenvalue assumption is imposed. For this is the zero subspace, and for it is all of . The case is included, with .
QAlgorithms.Papers.Independent.Gap50repair.P01.robbinSalamon
For any natural number , including , and any function , this defines a rational number using the following choice of a function . If possible, choose continuous and infinitely differentiable on , satisfying , where , such that on the form
satisfies for all only when , for every . The chosen must also admit a continuous homotopy on with , , , , and . If no such exists, set . In either case, is the total derivative within , zero when within-differentiability fails. Let be the largest dimension of a real subspace of on which is strictly positive on nonzero vectors, minus the corresponding largest dimension for strict negativity, with dimensions ranging over . Let if is finite, and otherwise. The defined value is
No hypotheses on the input or existence or uniqueness of the chosen are required; for , the value is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.robbinSalamonVertical
For any natural number , including , and any function , this defines a rational number using the following choice of a function . If possible, choose continuous and infinitely differentiable on , satisfying , where , such that on
the form
satisfies for all only when , for every . The chosen must also admit a continuous homotopy on with , , , , and . If no such exists, set . In either case, is the total derivative within , zero when within-differentiability fails. Let be the largest dimension of a real subspace of on which is strictly positive on nonzero vectors, minus the corresponding largest dimension for strict negativity, with dimensions ranging over . Let if is finite, and otherwise. The defined value is
No hypotheses on or existence or uniqueness of the chosen are required; for , the value is zero.
QAlgorithms.Papers.Independent.Gap50repair.P01.sMinus
For every natural number , this defines the real matrix, indexed by two disjoint copies of ,
where and are diagonal matrices with diagonal entries
All off-diagonal entries within these blocks are zero. When , there is no index , and the result is the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.shear
For every natural number , including , and every real matrix indexed by , this defines the real matrix indexed by two disjoint copies of that index set,
No symmetry or other condition is imposed on . For , the result is the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.shifted
For every natural number , real matrix , and complex number , this defines the complex linear endomorphism of by
where is obtained by viewing every real entry of as a complex number. Neither an eigenvalue condition on nor an invertibility condition on is required. For , this is the unique endomorphism of the zero vector space.
QAlgorithms.Papers.Independent.Gap50repair.P01.spectralRotation
For every natural number and real matrix , let be the finite set of distinct roots of the characteristic polynomial of its entrywise complexification , and let be the multiplicity of as a root of that polynomial. For each complex , let be the largest admitting a real -dimensional linear subspace on which
for every nonzero ; the zero subspace qualifies for . The definition assigns the complex number
Both divisions by are natural-number division, so they discard any remainder. Empty sums are and empty products are ; in particular, the value for is .
QAlgorithms.Papers.Independent.Gap50repair.P01.symplecticSum
For every pair of natural numbers , every real matrix , and every real matrix , write in its two groups of coordinates and in its two groups of coordinates. This defines the real matrix whose coordinate groups have sizes and whose block form is
Thus each of its four blocks relative to the two groups of coordinates is the block diagonal combination of the corresponding blocks of and , with the indices first. No symplecticity assumption on either input is imposed, and or is allowed.
QAlgorithms.Papers.Independent.Gap50repair.P01.translatedCatenate
For every natural number , including , every two functions , and every real number , this defines a function on all real by
The multiplication in the second branch has on the right, and the value at is . No continuity, symplecticity, endpoint matching, or positivity assumption on is imposed; the same formula applies when or .
QAlgorithms.Papers.Independent.Gap50repair.P01.unitPath
For every natural number , arbitrary function , and real number , this defines the function on all of . No continuity or matrix equation is required of , and may be positive, zero, or negative. When , the resulting function is constant with value ; is also included.
QAlgorithms.Papers.Independent.Gap50repair.P01.wMinus
For every natural number , this defines a diagonal real matrix whose coordinates are indexed by two copies of . In the first copy, the diagonal entry at index is and every other diagonal entry is ; in the second copy, the diagonal entry at index is and every other diagonal entry is . All off-diagonal entries are . For , neither copy has an index , and the result is the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.wPlus
For every natural number , this defines the real matrix , with rows and columns indexed by two copies of . Thus its diagonal entries are and its off-diagonal entries are . For , it is the unique empty matrix.
QAlgorithms.Papers.Independent.Gap50repair.P01.winding
For every function and real number , this defines an integer by choosing some integer for which there exists a function , continuous on , with , , and for every , if any such integer exists; if none exists, the value is . For , the interval is empty and every integer qualifies, so the value is an unspecified classically chosen integer. For , the value is , whether a lift exists or the fallback applies.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.