Proposition 41
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.dimension_two_exponential_indexLet be a real symmetric nonsingular matrix, let , and assume . Write , and let be its eigenvalues, so . For on ,
The square root is used only in the definite branch. The floor argument follows the period calculation on p.44: duration multiplies the square root, rather than lying under it in a reading of the printed (46). This computes both orientations of rotation and the indefinite case.
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 41, PDF pp.43–44. Printed (46) has sqrt(a1*a2*T); change only
its floor argument to sqrt(a1*a2)*T, as required by the p.44 period
2*pi/sqrt(a1*a2) and concluding formula. Use det S=a1*a2; both definite
signs and the indefinite case are retained. S=I, T=3*pi gives index 3. -/
theorem dimension_two_exponential_index (S : GroupedRealMatrix 1) (hs : S.transpose = S)
(hnd : S.det ≠ 0) (T : ℝ) (hT : 0 < T) (hend : exponentialPath S T ≠ 1) :
conleyZehnder (exponentialPath S) T = if matrixSignature S = 0 then 0 else
(2*Int.floor (Real.sqrt S.det*T/(2*Real.pi))+1)*(matrixSignature S/2) := by sorry
end QAlgorithms.Papers.Independent.Gap50repair.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any real matrix satisfying and , let , and put , , and for every real . Assume the matrix inequality . For a real matrix , let be the largest dimension of a real 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 in both maxima. Define the integer as follows. First put , and choose a function that is continuous and satisfies on , agrees with on , has for , and ends at either or ; if no such function exists, put . For any real matrix , let be the set of distinct roots of the characteristic polynomial of its entrywise complexification, let be their algebraic multiplicities, and let be the largest for which a real -dimensional subspace of has on every nonzero . Set
with empty sum and empty product . Then is a chosen integer admitting a continuous with , , and on , or if no such integer exists. The assertion is
where is integer division, hence rounding down when dividing by the positive integer , and the real square root is the total real square root, equal to for negative arguments.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.