Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Smooth germs on a compact set give a uniform neighborhood and Lipschitz bound

Proved
BianchiIX.exists_compact_smooth_neighborhood

by trppppp · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

bianchi-ix-era-statisticsdynamical-systems

Let EEE be a finite-dimensional real normed space, FFF a real normed space, S⊂ES\subset ES⊂E compact, PPP a predicate on EEE, and f:E→Ff:E\to Ff:E→F. Suppose each x∈Sx\in Sx∈S has a neighborhood where P(y)P(y)P(y) holds and fff is C2C^2C2 at yyy. Then there are δ>0\delta>0δ>0 and C≥1C\geq1C≥1 such that, whenever x∈Sx\in Sx∈S and ∥y−x∥≤δ\|y-x\|\leq\delta∥y−x∥≤δ,

P(y),f is C2 at y,∥f(y)∥≤C,∥f(y)−f(x)∥≤C∥y−x∥.P(y),\qquad f\text{ is }C^2\text{ at }y,\qquad \|f(y)\|\leq C,\qquad \|f(y)-f(x)\|\leq C\|y-x\|.P(y),f is C2 at y,∥f(y)∥≤C,∥f(y)−f(x)∥≤C∥y−x∥.
Preamble
import Mathlib.Analysis.Calculus.ContDiff.Operations
import Mathlib.Analysis.Calculus.MeanValue
import Mathlib.Analysis.Calculus.Deriv.Prod
import Mathlib.Analysis.Normed.Module.FiniteDimension
import Mathlib.Topology.Order.Compact
import Mathlib.Tactic.NormNum
import Mathlib.Topology.MetricSpace.Thickening

namespace BianchiIX
end BianchiIX

noncomputable section
open BianchiIX
open Set Filter Metric
open scoped Topology

Formal statement
theorem BianchiIX.exists_compact_smooth_neighborhood
    {E F : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    [NormedAddCommGroup F] [NormedSpace ℝ F]
    {S : Set E} (hS : IsCompact S) {P : E → Prop} {f : E → F}
    (hreg : ∀ x ∈ S, ∀ᶠ y in 𝓝 x, P y ∧ ContDiffAt ℝ 2 f y) :
    ∃ δ > (0 : ℝ), ∃ C ≥ (1 : ℝ), ∀ x ∈ S, ∀ y : E, ‖y - x‖ ≤ δ →
      P y ∧ ContDiffAt ℝ 2 f y ∧ ‖f y‖ ≤ C ∧ ‖f y - f x‖ ≤ C * ‖y - x‖ := by sorry
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Analysis/CompactSmoothNeighborhood.lean#L10-L42

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me