Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Winding numbers versus the polar rotation angle of a path in SL(2,R)SL(2,\mathbb{R})SL(2,R)

Proved
HryniewiczCriterion.windingInterval_polar_angle_bounds

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

dynamical-systemssymplectic-geometry

Let φ:[0,1]→M2(R)\varphi:[0,1]\to M_2(\mathbb{R})φ:[0,1]→M2​(R) have a continuous polar angle α\alphaα: α(0)=0\alpha(0)=0α(0)=0 and φ(t)=R(α(t))P(t)\varphi(t)=R(\alpha(t))P(t)φ(t)=R(α(t))P(t) with P(t)P(t)P(t) symmetric positive definite. Suppose φ(1)=R(α(1))P\varphi(1)=R(\alpha(1))Pφ(1)=R(α(1))P with det⁡P=1\det P=1detP=1. Then every element ddd of the winding interval I(φ)I(\varphi)I(φ) (total rotation, in turns, of a vector eise^{is}eis under φ\varphiφ) satisfies

∣2πd−α(1)∣<π2,2πd  ≥  α(1)−arccos⁡2tr⁡P.\bigl|2\pi d-\alpha(1)\bigr|<\frac{\pi}{2},\qquad 2\pi d\;\ge\;\alpha(1)-\arccos\frac{2}{\operatorname{tr}P}.​2πd−α(1)​<2π​,2πd≥α(1)−arccostrP2​.

The first bound holds because the angle between P(t)vP(t)vP(t)v and vvv stays in (−π/2,π/2)(-\pi/2,\pi/2)(−π/2,π/2). The second comes from the sharp bound on that angle when det⁡P=1\det P=1detP=1.

Preamble
import Definitions.Def_HryniewiczCriterion_GraphAngle

open HryniewiczCriterion
open scoped ContDiff
Formal statement
theorem HryniewiczCriterion.windingInterval_polar_angle_bounds {φ : ℝ → Matrix (Fin 2) (Fin 2) ℝ} {α : ℝ → ℝ}
    (hα : IsPolarAngleLift φ α) {P : Matrix (Fin 2) (Fin 2) ℝ} (hP : P.PosDef)
    (hdet : P.det = 1) (hφ1 : φ 1 = rotationMatrix (α 1) * P) :
    ∀ d ∈ windingInterval φ,
      α 1 - Real.arccos (2 / (P 0 0 + P 1 1)) ≤ 2 * Real.pi * d ∧
        |2 * Real.pi * d - α 1| < Real.pi / 2 := by sorry
Source
Hryniewicz, https://arxiv.org/html/1105.2077v5, Section 2.1.1, winding interval (4); polar decomposition estimate used in Hofer–Wysocki–Zehnder, The dynamics on three-dimensional strictly convex energy surfaces, Ann. of Math. 148 (1998), https://doi.org/10.2307/120994, (3.45)–(3.46), p. 222. Elementary comparison lemma; not a verbatim numbered assertion.

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