Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Functions decaying in C-infinity on a half-cylinder are eventually small and Lipschitz-small

Proved
FiniteEnergyPlane.exists_norm_le_and_norm_sub_le_of_tendstoZeroCInfty

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

calculusreal-analysis

Let FFF be a real normed space and f:R×R→Ff:\mathbb{R}\times\mathbb{R}\to Ff:R×R→F with f→0f\to0f→0 in C∞C^\inftyC∞ on the end (TendstoZeroCInfty f: fff is smooth on some (s0,∞)×R(s_0,\infty)\times\mathbb{R}(s0​,∞)×R and every derivative Dmf(s,t)D^mf(s,t)Dmf(s,t) tends to 000 uniformly in ttt as s→+∞s\to+\inftys→+∞). Then for every η>0\eta>0η>0 there is SSS such that for all p,q∈R2p,q\in\mathbb{R}^2p,q∈R2 with p1,q1≥Sp_1,q_1\ge Sp1​,q1​≥S,

∥f(p)∥≤ηand∥f(p)−f(q)∥≤η ∥p−q∥.\|f(p)\|\le\eta\quad\text{and}\quad\|f(p)-f(q)\|\le\eta\,\|p-q\|.∥f(p)∥≤ηand∥f(p)−f(q)∥≤η∥p−q∥.

Role: uniform C0C^0C0 and Lipschitz smallness of C∞C^\inftyC∞-decaying remainders on a half-cylinder, as used in asymptotic formulas at punctures.

Formalization Note ∥p−q∥\|p-q\|∥p−q∥ is the max norm on R×R\mathbb{R}\times\mathbb{R}R×R.

Preamble
import Definitions.Def_FiniteEnergyPlane_Asymptotics
Formal statement
namespace FiniteEnergyPlane

open MeasureTheory Metric Filter Topology
open scoped ContDiff ENNReal Real

/-- A function on the half-cylinder that tends to `0` in `C^∞` is eventually small and has small
Lipschitz constant: for every `η > 0` there is `S` such that `‖f p‖ ≤ η` and
`‖f p - f q‖ ≤ η ‖p - q‖` for all `p, q` with `p.1, q.1 ≥ S`. -/
theorem exists_norm_le_and_norm_sub_le_of_tendstoZeroCInfty {F : Type*} [NormedAddCommGroup F] [NormedSpace ℝ F] {f : ℝ × ℝ → F}
    (hf : TendstoZeroCInfty f) (η : ℝ) (hη : 0 < η) :
    ∃ S : ℝ, ∀ p q : ℝ × ℝ, S ≤ p.1 → S ≤ q.1 → ‖f p‖ ≤ η ∧ ‖f p - f q‖ ≤ η * ‖p - q‖ := by
  sorry

end FiniteEnergyPlane
Source
Toward U. Hryniewicz, Fast finite-energy planes in symplectizations and applications, Trans. Amer. Math. Soc. 364 (2012), 1859–1931, arXiv:0812.4076, Lemma 6.22 / (100)

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