Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A family of continuous functions unbounded on a compact set blows up at a point

Proved
FiniteEnergyPlane.exists_subseq_tendsto_atTop_of_unbounded_on_compact

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

contact-geometrypseudoholomorphic-curvessymplectic-geometry

Let gk:C→Rg_k : \mathbb{C} \to \mathbb{R}gk​:C→R be continuous and let K⊂CK \subset \mathbb{C}K⊂C be compact. Suppose that for every M∈RM \in \mathbb{R}M∈R there are kkk and z∈Kz \in Kz∈K with gk(z)>Mg_k(z) > Mgk​(z)>M. Then there are a strictly increasing sequence θ(k)\theta(k)θ(k), points ζk∈C\zeta_k \in \mathbb{C}ζk​∈C and a point z∈Kz \in Kz∈K with ζk→z\zeta_k \to zζk​→z and gθ(k)(ζk)→+∞g_{\theta(k)}(\zeta_k) \to +\inftygθ(k)​(ζk​)→+∞.

This locates a blow-up point for gradient norms of sequences of curves that are not locally uniformly bounded.

Formalization Note: the indices θ(k)\theta(k)θ(k) are required to be strictly increasing, not just unbounded; a single gkg_kgk​ is bounded above on KKK.

Preamble
import Definitions.Def_FiniteEnergyPlane_Setting
Formal statement
namespace FiniteEnergyPlane

open MeasureTheory Metric Filter Topology
open scoped ContDiff ENNReal Real

/-- Let `g k : ℂ → ℝ` be continuous and unbounded above on the compact set `Kc`, as a family: for every
`M` some `g k` exceeds `M` at a point of `Kc`. Then along a subsequence there are points `ζ k` converging
to a point of `Kc` with `g (θ k) (ζ k) → ∞`. -/
theorem exists_subseq_tendsto_atTop_of_unbounded_on_compact (g : ℕ → ℂ → ℝ)
    (hg : ∀ k, Continuous (g k)) (Kc : Set ℂ) (hKc : IsCompact Kc)
    (hun : ∀ M : ℝ, ∃ k, ∃ z ∈ Kc, M < g k z) :
    ∃ θ : ℕ → ℕ, StrictMono θ ∧ ∃ ζ : ℕ → ℂ, ∃ z ∈ Kc, Tendsto ζ atTop (𝓝 z) ∧
      Tendsto (fun k => g (θ k) (ζ k)) atTop atTop := by
  sorry

end FiniteEnergyPlane
Source
Standard; used as in U. Hryniewicz, Fast finite-energy planes in symplectizations and applications, Trans. Amer. Math. Soc. 364 (2012), 1859-1931, Corollary 4.10

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