Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform power-form bounds for finitely many derivatives on an end

Proved
FiniteEnergyPlane.exists_pow_bound_iteratedFDeriv

by Mazecto · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysispseudoholomorphic-curves

Let FFF be a real normed space and X:R×R→FX:\mathbb{R}\times\mathbb{R}\to FX:R×R→F. Suppose that for every m≥1m\ge 1m≥1 there are CmC_mCm​ and sms_msm​ with ∥DmX(s,t)∥≤Cm\|D^mX(s,t)\|\le C_m∥DmX(s,t)∥≤Cm​ for all s≥sms\ge s_ms≥sm​ and all ttt. Then for every nnn there are D≥1D\ge 1D≥1 and s1s_1s1​ such that

∥DiX(s,t)∥≤D ifor all 1≤i≤n, s≥s1, t∈R.\|D^iX(s,t)\|\le D^{\,i}\qquad\text{for all } 1\le i\le n,\ s\ge s_1,\ t\in\mathbb{R}.∥DiX(s,t)∥≤Difor all 1≤i≤n, s≥s1​, t∈R.

This puts derivative bounds on a cylindrical end into the form ∥DiX∥≤Di\|D^iX\|\le D^i∥DiX∥≤Di that Faà di Bruno type estimates for compositions require.

Formalization Note Derivatives are iteratedFDeriv ℝ; "for large sss" means ∀ s ≥ s₁, uniformly in t : ℝ. The hypothesis covers orders m ≥ 1 only.

Preamble
import Mathlib
Formal statement
namespace FiniteEnergyPlane

open scoped ContDiff

/-- Power-form derivative bounds on an end. If every derivative of order `m ≥ 1` of
`X : ℝ × ℝ → F` is bounded for large `s`, uniformly in `t`, then for each `n` there are `D ≥ 1`
and `s₁` with `‖D^i X (s, t)‖ ≤ D ^ i` for all `1 ≤ i ≤ n`, `s ≥ s₁` and `t`. -/
theorem exists_pow_bound_iteratedFDeriv {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F]
    {X : ℝ × ℝ → F}
    (h : ∀ m : ℕ, 1 ≤ m → ∃ C s₁ : ℝ, ∀ s ≥ s₁, ∀ t : ℝ, ‖iteratedFDeriv ℝ m X (s, t)‖ ≤ C)
    (n : ℕ) : ∃ D s₁ : ℝ, 1 ≤ D ∧ ∀ i, 1 ≤ i → i ≤ n → ∀ s ≥ s₁, ∀ t : ℝ,
      ‖iteratedFDeriv ℝ i X (s, t)‖ ≤ D ^ i := by
  sorry

end FiniteEnergyPlane
Source
H. Hofer, K. Wysocki, E. Zehnder, Properties of pseudoholomorphic curves in symplectisations I: Asymptotics, Ann. Inst. H. Poincaré Anal. Non Linéaire 13 (1996), 337–379; setting of C. Hryniewicz, Fast finite-energy planes in symplectizations and applications, Trans. AMS 364 (2012)

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