Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1: an endpoint of the winding interval is an integer iff φ(1)\varphi(1)φ(1) has eigenvalue 111

Proved
HryniewiczCriterion.winding_interval_frontier_integer_iff

by Mazecto · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

contact-geometrydynamical-systemssymplectic-geometry

Let φ:[0,1]→Sp(1)\varphi:[0,1]\to Sp(1)φ:[0,1]→Sp(1) be a smooth path of 2×22\times22×2 real matrices with det⁡φ(t)=1\det\varphi(t)=1detφ(t)=1 and φ(0)=I\varphi(0)=Iφ(0)=I, and let I(φ)=[a,b]I(\varphi)=[a,b]I(φ)=[a,b] be its winding interval (total rotations of the vectors eise^{is}eis, in turns). Then

∂I(φ)∩Z≠∅  ⟺  det⁡(φ(1)−I)=0,\partial I(\varphi)\cap\mathbb{Z}\neq\emptyset\iff\det\big(\varphi(1)-I\big)=0,∂I(φ)∩Z=∅⟺det(φ(1)−I)=0,

that is, an endpoint aaa or bbb of the winding interval is an integer exactly when 111 is an eigenvalue of φ(1)\varphi(1)φ(1), i.e. φ∉Σ∗(1)\varphi\notin\Sigma^*(1)φ∈/Σ∗(1).

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 t↦φ(t)ijt\mapsto\varphi(t)_{ij}t↦φ(t)ij​ on [0,1][0,1][0,1].

Preamble
import Definitions.Def_HryniewiczCriterion_ConleyZehnder

open scoped ContDiff
Formal statement
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
Source
Hryniewicz, Systems of global surfaces of section for dynamically convex Reeb flows on the 3-sphere, J. Symplectic Geom. 12 (2014) 791-862, https://arxiv.org/abs/1105.2077, Section 2.1.1, Lemma 2.1, p. 6
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Read-back. Let φ:R→R2×2\varphi : \mathbb{R} \to \mathbb{R}^{2\times 2}φ:R→R2×2 be any function assigning a real 2×22\times 22×2 matrix to every real number ttt. The hypotheses are:

  • (smoothness) the map t↦φ(t)t \mapsto \varphi(t)t↦φ(t), viewed as a map into the four matrix entries, is C∞C^\inftyC∞ on the closed interval [0,1][0,1][0,1] (in the sense of smoothness on a set, i.e. "ContDiffOn"); nothing is assumed about φ(t)\varphi(t)φ(t) for t∉[0,1]t \notin [0,1]t∈/[0,1];
  • (determinant one) det⁡φ(t)=1\det \varphi(t) = 1detφ(t)=1 for every t∈[0,1]t \in [0,1]t∈[0,1];
  • (starts at identity) φ(0)=I\varphi(0) = Iφ(0)=I, the 2×22\times 22×2 identity matrix.

The winding set. Write v(s)=(cos⁡s,sin⁡s)v(s) = (\cos s, \sin s)v(s)=(coss,sins). Define W(φ)⊆RW(\varphi) \subseteq \mathbb{R}W(φ)⊆R as the set of all real numbers ddd for which there exist a starting angle s∈[0,2π]s \in [0, 2\pi]s∈[0,2π] (both endpoints allowed) and a function θ:R→R\theta : \mathbb{R} \to \mathbb{R}θ:R→R such that

  • θ\thetaθ is continuous on [0,1][0,1][0,1],
  • θ(0)=s\theta(0) = sθ(0)=s,
  • for every t∈[0,1]t \in [0,1]t∈[0,1] there is a real r>0r > 0r>0 with φ(t) v(s)=r v(θ(t))\varphi(t)\, v(s) = r\, v(\theta(t))φ(t)v(s)=rv(θ(t)) (the image of the fixed unit vector v(s)v(s)v(s) under φ(t)\varphi(t)φ(t) is a positive multiple of the unit vector at angle θ(t)\theta(t)θ(t)),

and

d=θ(1)−s2π.d = \frac{\theta(1) - s}{2\pi}.d=2πθ(1)−s​.

So W(φ)W(\varphi)W(φ) collects the normalized total rotation angles, over t∈[0,1]t \in [0,1]t∈[0,1], of the vectors φ(t)v(s)\varphi(t)v(s)φ(t)v(s), measured by a continuous angle lift starting at sss, for all starting angles s∈[0,2π]s \in [0,2\pi]s∈[0,2π]. Values of θ\thetaθ outside [0,1][0,1][0,1] play no role. Under the hypotheses, φ(t)\varphi(t)φ(t) is invertible for t∈[0,1]t \in [0,1]t∈[0,1], so φ(t)v(s)≠0\varphi(t)v(s) \neq 0φ(t)v(s)=0 there.

Conclusion (an equivalence).

(∃k∈Z: inf⁡W(φ)=k  or  sup⁡W(φ)=k)  ⟺  det⁡(φ(1)−I)=0.\Bigl(\exists k \in \mathbb{Z} :\ \inf W(\varphi) = k \ \text{ or } \ \sup W(\varphi) = k\Bigr) \iff \det\bigl(\varphi(1) - I\bigr) = 0 .(∃k∈Z: infW(φ)=k  or  supW(φ)=k)⟺det(φ(1)−I)=0.

That is: the infimum of W(φ)W(\varphi)W(φ) or the supremum of W(φ)W(\varphi)W(φ) is an integer if and only if 111 is an eigenvalue of the endpoint matrix φ(1)\varphi(1)φ(1) (equivalently, det⁡(φ(1)−I)=0\det(\varphi(1)-I)=0det(φ(1)−I)=0). Both directions are asserted.

Edge cases and conventions. inf⁡\infinf and sup⁡\supsup 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 000; with that convention 000 is an integer, so if W(φ)W(\varphi)W(φ) were empty or unbounded the left-hand side would hold automatically. The hypotheses constrain φ\varphiφ only on [0,1][0,1][0,1], and the conclusion involves only φ\varphiφ on [0,1][0,1][0,1] (through WWW) and φ(1)\varphi(1)φ(1). The integer kkk is a single integer equal to whichever of inf⁡W\inf WinfW or sup⁡W\sup WsupW is chosen; it is not required that both be integers.

Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mazecto · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me