Determinant property of the Conley–Zehnder index
ProvedConleyZehnder.czIndex_determinantFor every ,
import Definitions.Def_ConleyZehnder_Setting
namespace ConleyZehnder
/-- Gutt, Proposition 8 (7), Determinant:
`(-1)^{n - μ_CZ(ψ)} = sign det(Id - ψ(1))`. -/
theorem czIndex_determinant {n : ℕ} (ψ : C(unitInterval, Mat n)) (hψ : ψ ∈ SP n) :
(-1 : ℝ) ^ ((n : ℤ) - czIndex ψ) = Real.sign (1 - ψ 1).det := by sorry
end ConleyZehnder
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Throughout, for a natural number (including ), denotes the real matrices whose rows and columns are indexed by two copies of : a first ("") block and a second ("") block. is the identity matrix. is the block matrix
A matrix is called symplectic if . A path is a continuous map (with the usual Euclidean topology on matrix entries); the set of paths carries the compact-open topology (equivalently the topology of uniform convergence). Products, inverses and transposes of paths below are always taken pointwise in . For all matrices are the empty matrix, whose determinant is .
is the set of paths such that is symplectic for every , , and .
is the set of symplectic with .
, and is the diagonal matrix whose -block diagonal is and whose -block diagonal is (the entry resp. sits at index ; all other diagonal entries are ). For , is the empty matrix.
For , let . Let be the upper-left (-row, -column) block of and its lower-left (-row, -column) block, and set
the determinant of the complex matrix (equal to when ). Then
with the convention that division by zero gives , so whenever .
For a function , a function is called an argument lift of if is continuous and for every . (No lift exists if for some , e.g. if takes the junk value ; continuity of is not separately assumed.)
For a path and an integer , " is a CZ value of " means: there exist a path with , for all , and or ; and argument lifts of and of with
(The lifts are of itself, not of ; the factor appears only in this equation. No condition is part of this notion.)
The index of a path is defined as: if some integer is a CZ value of , then is one such chosen by the axiom of choice (an unspecified one if several exist); if no CZ value exists, . It is defined for every path, not only those in .
For a real number , is if , if , and if .
Claim. For every and every , the real number raised to the integer power (computed in , so possibly negative) equals the sign of :
Since gives , the right side is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.