Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hofer–Wysocki–Zehnder: strictly convex energy surfaces are dynamically convex

Proved
HryniewiczCriterion.strictly_convex_isDynamicallyConvex

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

contact-geometrydynamical-systemssymplectic-geometry

Let H:R4→RH:\mathbb{R}^4\to\mathbb{R}H:R4→R be smooth and assume that S=H−1(1)S=H^{-1}(1)S=H−1(1) is strictly star-shaped with respect to the origin. Assume also that SSS is strictly convex: the Hessian of HHH is positive definite on TxST_xSTx​S for every x∈Sx\in Sx∈S. Then the flow of XHX_HXH​ on SSS is dynamically convex:

μCZ(P)≥3for every periodic orbit P⊂S.\mu_{CZ}(P)\ge3\quad\text{for every periodic orbit }P\subset S.μCZ​(P)≥3for every periodic orbit P⊂S.

This is the theorem of Hofer, Wysocki and Zehnder that Hryniewicz quotes on p. 2. It makes every strictly convex energy level in R4\mathbb{R}^4R4 an instance of Theorems 1.7 and 1.8, and it shows that dynamical convexity is not vacuous.

Preamble
import Definitions.Def_HryniewiczCriterion_ConleyZehnder
Formal statement
namespace HryniewiczCriterion

/-- Hofer–Wysocki–Zehnder (cited in Hryniewicz, p. 2): the flow on a strictly convex,
strictly star-shaped energy surface in `ℝ⁴` is dynamically convex. -/
theorem strictly_convex_isDynamicallyConvex (H : R4 → ℝ)
    (hS : IsStrictlyStarShapedLevel H) (hC : IsStrictlyConvexLevel H) :
    IsDynamicallyConvex H := 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, p. 2 (citing Hofer-Wysocki-Zehnder, Ann. of Math. 148 (1998), https://doi.org/10.2307/120994)
Read-back

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

Read-back. Let H:R4→RH : \mathbb{R}^4 \to \mathbb{R}H:R4→R be any function. Coordinates on R4\mathbb{R}^4R4 are written x=(x0,x1,x2,x3)x = (x_0, x_1, x_2, x_3)x=(x0​,x1​,x2​,x3​). DH(x)DH(x)DH(x) is the Fréchet derivative of HHH at xxx (taken to be 000 where HHH is not differentiable) and D2H(x)D^2H(x)D2H(x) the derivative of x↦DH(x)x \mapsto DH(x)x↦DH(x). The level set is Σ={x:H(x)=1}\Sigma = \{x : H(x) = 1\}Σ={x:H(x)=1}.

Hypothesis hShShS (strictly star-shaped level). All three of:

  1. HHH is C∞C^\inftyC∞ on all of R4\mathbb{R}^4R4;
  2. for every u∈R4u \in \mathbb{R}^4u∈R4 with u≠0u \neq 0u=0 there is exactly one real r>0r > 0r>0 with H(ru)=1H(r u) = 1H(ru)=1;
  3. for every xxx with H(x)=1H(x) = 1H(x)=1: DH(x) x>0DH(x)\,x > 0DH(x)x>0 (the derivative of HHH at xxx applied to the position vector xxx itself is positive).

Hypothesis hChChC (strictly convex level). For every xxx with H(x)=1H(x) = 1H(x)=1 and every v≠0v \neq 0v=0 with DH(x) v=0DH(x)\,v = 0DH(x)v=0:

D2H(x)(v,v)>0.D^2H(x)(v, v) > 0 .D2H(x)(v,v)>0.

Conclusion (dynamical convexity). For every periodic orbit PPP of HHH and every YYY as below, the integer μ(MP,Y)≥3\mu(M_{P,Y}) \ge 3μ(MP,Y​)≥3, with all objects unfolded as follows.

Hamiltonian vector field. With ∂iH(x)=DH(x) ei\partial_i H(x) = DH(x)\,e_i∂i​H(x)=DH(x)ei​ (standard basis vector eie_iei​),

XH(x)=(−∂1H(x), ∂0H(x), −∂3H(x), ∂2H(x)).X_H(x) = \bigl(-\partial_1 H(x),\ \partial_0 H(x),\ -\partial_3 H(x),\ \partial_2 H(x)\bigr).XH​(x)=(−∂1​H(x), ∂0​H(x), −∂3​H(x), ∂2​H(x)).

Periodic orbit. PPP consists of a curve x:R→R4x : \mathbb{R} \to \mathbb{R}^4x:R→R4 and a real T>0T > 0T>0 with: xxx differentiable at every ttt with x′(t)=XH(x(t))x'(t) = X_H(x(t))x′(t)=XH​(x(t)); H(x(t))=1H(x(t)) = 1H(x(t))=1 for all ttt; and x(t+T)=x(t)x(t+T) = x(t)x(t+T)=x(t) for all ttt. TTT need not be the minimal period: iterated (multiply covered) orbits are included. (Hypothesis hShShS(3) gives DH≠0DH \neq 0DH=0 on Σ\SigmaΣ, hence XH≠0X_H \neq 0XH​=0 on Σ\SigmaΣ.)

Linearized flow. Y:R→L(R4,R4)Y : \mathbb{R} \to \mathrm{L}(\mathbb{R}^4, \mathbb{R}^4)Y:R→L(R4,R4) is any map with Y(0)=idY(0) = \mathrm{id}Y(0)=id and, for every real ttt, YYY differentiable at ttt with

Y′(t)=DXH(x(t))∘Y(t).Y'(t) = DX_H(x(t)) \circ Y(t) .Y′(t)=DXH​(x(t))∘Y(t).

The statement quantifies over all such YYY.

Auxiliary forms and frame. For u,v,x∈R4u, v, x \in \mathbb{R}^4u,v,x∈R4:

ω0(u,v)=u0v1−u1v0+u2v3−u3v2,λx(v)=12(x0v1−x1v0+x2v3−x3v2),\omega_0(u,v) = u_0v_1 - u_1v_0 + u_2v_3 - u_3v_2, \qquad \lambda_x(v) = \tfrac12\bigl(x_0v_1 - x_1v_0 + x_2v_3 - x_3v_2\bigr),ω0​(u,v)=u0​v1​−u1​v0​+u2​v3​−u3​v2​,λx​(v)=21​(x0​v1​−x1​v0​+x2​v3​−x3​v2​),

∣x∣=x02+x12+x22+x32|x| = \sqrt{x_0^2+x_1^2+x_2^2+x_3^2}∣x∣=x02​+x12​+x22​+x32​​ (Euclidean norm), and

Q1x=(−x2, x3, x0, −x1),Q2x=(x3, x2, −x1, −x0),Q_1 x = (-x_2,\ x_3,\ x_0,\ -x_1), \qquad Q_2 x = (x_3,\ x_2,\ -x_1,\ -x_0),Q1​x=(−x2​, x3​, x0​, −x1​),Q2​x=(x3​, x2​, −x1​, −x0​), ξ1(x)=∣x∣−1(Q2x−DH(x) Q2xDH(x) x x),ξ2(x)=∣x∣−1(Q1x−DH(x) Q1xDH(x) x x).\xi_1(x) = |x|^{-1}\Bigl(Q_2x - \frac{DH(x)\,Q_2x}{DH(x)\,x}\,x\Bigr), \qquad \xi_2(x) = |x|^{-1}\Bigl(Q_1x - \frac{DH(x)\,Q_1x}{DH(x)\,x}\,x\Bigr).ξ1​(x)=∣x∣−1(Q2​x−DH(x)xDH(x)Q2​x​x),ξ2​(x)=∣x∣−1(Q1​x−DH(x)xDH(x)Q1​x​x).

Projection along XHX_HXH​ and coordinates:

πx(v)=v−λx(v)λx(XH(x)) XH(x),cx(v)=(ω0(v,ξ2(x)), ω0(ξ1(x),v))∈R2.\pi_x(v) = v - \frac{\lambda_x(v)}{\lambda_x(X_H(x))}\,X_H(x), \qquad c_x(v) = \bigl(\omega_0(v, \xi_2(x)),\ \omega_0(\xi_1(x), v)\bigr) \in \mathbb{R}^2 .πx​(v)=v−λx​(XH​(x))λx​(v)​XH​(x),cx​(v)=(ω0​(v,ξ2​(x)), ω0​(ξ1​(x),v))∈R2.

(Division by zero and 0−10^{-1}0−1 evaluate to 000; on Σ\SigmaΣ, hShShS(3) makes DH(x) x>0DH(x)\,x > 0DH(x)x>0 and forces x≠0x \neq 0x=0.)

Matrix path. For τ∈R\tau \in \mathbb{R}τ∈R, MP,Y(τ)M_{P,Y}(\tau)MP,Y​(τ) is the 2×22\times 22×2 matrix whose (i,j)(i,j)(i,j) entry (i,j∈{1,2}i,j \in \{1,2\}i,j∈{1,2}) is

MP,Y(τ)ij=[cx(Tτ)(πx(Tτ)(Y(Tτ) ξj(x(0))))]i.M_{P,Y}(\tau)_{ij} = \Bigl[c_{x(T\tau)}\bigl(\pi_{x(T\tau)}\bigl(Y(T\tau)\,\xi_j(x(0))\bigr)\bigr)\Bigr]_i .MP,Y​(τ)ij​=[cx(Tτ)​(πx(Tτ)​(Y(Tτ)ξj​(x(0))))]i​.

So column jjj is: take the frame vector ξj\xi_jξj​ at the initial point x(0)x(0)x(0), push it by Y(Tτ)Y(T\tau)Y(Tτ), project along XHX_HXH​ at x(Tτ)x(T\tau)x(Tτ), and read off the two coordinates ccc at x(Tτ)x(T\tau)x(Tτ).

Index. For a matrix path φ\varphiφ, let W(φ)W(\varphi)W(φ) be the set of d∈Rd \in \mathbb{R}d∈R such that there are s∈[0,2π]s \in [0,2\pi]s∈[0,2π] and θ:R→R\theta : \mathbb{R} \to \mathbb{R}θ:R→R, continuous on [0,1][0,1][0,1], with θ(0)=s\theta(0) = sθ(0)=s, such that for each t∈[0,1]t \in [0,1]t∈[0,1] some r>0r > 0r>0 satisfies φ(t)(cos⁡s,sin⁡s)=r(cos⁡θ(t),sin⁡θ(t))\varphi(t)(\cos s, \sin s) = r(\cos\theta(t), \sin\theta(t))φ(t)(coss,sins)=r(cosθ(t),sinθ(t)), and d=(θ(1)−s)/(2π)d = (\theta(1) - s)/(2\pi)d=(θ(1)−s)/(2π). Put a=inf⁡W(φ)a = \inf W(\varphi)a=infW(φ), b=sup⁡W(φ)b = \sup W(\varphi)b=supW(φ) (with inf⁡\infinf/sup⁡\supsup of an empty or unbounded set equal to 000) and ⌈b⌉\lceil b\rceil⌈b⌉ the integer ceiling. Then

μ(φ)={2(⌈b⌉−1)if a≤⌈b⌉−1,2⌈b⌉−1otherwise.\mu(\varphi) = \begin{cases} 2(\lceil b\rceil - 1) & \text{if } a \le \lceil b\rceil - 1,\\ 2\lceil b\rceil - 1 & \text{otherwise.}\end{cases}μ(φ)={2(⌈b⌉−1)2⌈b⌉−1​if a≤⌈b⌉−1,otherwise.​

The conclusion is: for all such PPP and YYY, μ(MP,Y)≥3\mu(M_{P,Y}) \ge 3μ(MP,Y​)≥3.

Edge cases. The lift condition at t=0t = 0t=0 requires MP,Y(0)(cos⁡s,sin⁡s)M_{P,Y}(0)(\cos s,\sin s)MP,Y​(0)(coss,sins) to be a positive multiple of (cos⁡s,sin⁡s)(\cos s, \sin s)(coss,sins); only angles sss admitting such a continuous lift on all of [0,1][0,1][0,1] contribute to WWW. If WWW is empty or unbounded, a=b=0a = b = 0a=b=0 and μ=−1\mu = -1μ=−1. Only the values of MP,YM_{P,Y}MP,Y​ on τ∈[0,1]\tau \in [0,1]τ∈[0,1], i.e. of xxx and YYY on [0,T][0,T][0,T], enter μ\muμ. No hypothesis says that Σ\SigmaΣ is nonempty, compact, or that any periodic orbit exists; if HHH has no periodic orbit the conclusion holds vacuously.

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