The complex-linear part of a symplectic matrix is invertible
ProvedConleyZehnder.complexLinearDet_ne_zeroFor every , the complex-linear part
is invertible as a complex matrix: .
In particular is a well-defined point of for every symplectic .
import Definitions.Def_ConleyZehnder_Setting
namespace ConleyZehnder
/-- Gutt, proof of Corollary 12: for every symplectic `A`, the `ℂ`-linear part
`½(A - J₀AJ₀)` is invertible, i.e. `det_ℂ C_A ≠ 0`. -/
theorem complexLinearDet_ne_zero {n : ℕ} (A : Mat n) (hA : IsSymplectic A) :
complexLinearDet A ≠ 0 := 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 .
For , let , let be its upper-left (-row, -column) block and its lower-left (-row, -column) block, and let be the determinant of the complex matrix .
Claim. For every and every symplectic (i.e. ),
For the claim is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.