Lemma 2.1: an endpoint of the winding interval is an integer iff has eigenvalue
ProvedHryniewiczCriterion.winding_interval_frontier_integer_iffLet be a smooth path of real matrices with and , and let be its winding interval (total rotations of the vectors , in turns). Then
that is, an endpoint or of the winding interval is an integer exactly when is an eigenvalue of , i.e. .
This identifies degenerate paths with paths whose winding interval has an integer endpoint. It is the basis of the formula for the Conley–Zehnder index by winding intervals and of its lower semicontinuous extension to degenerate paths.
Formalization Note Smoothness is asked for the entries on .
import Definitions.Def_HryniewiczCriterion_ConleyZehnder open scoped ContDiff
namespace HryniewiczCriterion
/-- Hryniewicz, Lemma 2.1: for a smooth path `φ : [0, 1] → Sp(1)` with `φ(0) = I`,
an endpoint of the winding interval `I(φ)` is an integer iff `φ(1)` has eigenvalue `1`. -/
theorem winding_interval_frontier_integer_iff (φ : ℝ → Matrix (Fin 2) (Fin 2) ℝ)
(hφ : ContDiffOn ℝ ∞ (fun t i j => φ t i j) (Set.Icc 0 1))
(hsymp : ∀ t ∈ Set.Icc (0 : ℝ) 1, (φ t).det = 1)
(h0 : φ 0 = 1) :
(∃ k : ℤ, sInf (windingInterval φ) = k ∨ sSup (windingInterval φ) = k) ↔
(φ 1 - 1).det = 0 := by sorry
end HryniewiczCriterion
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back. Let be any function assigning a real matrix to every real number . The hypotheses are:
- (smoothness) the map , viewed as a map into the four matrix entries, is on the closed interval (in the sense of smoothness on a set, i.e. "ContDiffOn"); nothing is assumed about for ;
- (determinant one) for every ;
- (starts at identity) , the identity matrix.
The winding set. Write . Define as the set of all real numbers for which there exist a starting angle (both endpoints allowed) and a function such that
- is continuous on ,
- ,
- for every there is a real with (the image of the fixed unit vector under is a positive multiple of the unit vector at angle ),
and
So collects the normalized total rotation angles, over , of the vectors , measured by a continuous angle lift starting at , for all starting angles . Values of outside play no role. Under the hypotheses, is invertible for , so there.
Conclusion (an equivalence).
That is: the infimum of or the supremum of is an integer if and only if is an eigenvalue of the endpoint matrix (equivalently, ). Both directions are asserted.
Edge cases and conventions. and are the real-number infimum/supremum with the convention that the infimum (resp. supremum) of an empty set, or of a set unbounded below (resp. above), is ; with that convention is an integer, so if were empty or unbounded the left-hand side would hold automatically. The hypotheses constrain only on , and the conclusion involves only on (through ) and . The integer is a single integer equal to whichever of or is chosen; it is not required that both be integers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.