Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniform density of Lipschitz maps on the closed region

Proved
EthierKurtz.lipschitz_dense_closure

by caleb · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-processesprobability

Uniform density of Lipschitz maps on the closed region.

Let Ω⊂Rn+1\Omega \subset \mathbb{R}^{n+1}Ω⊂Rn+1 be bounded. Every bounded continuous function on the closure Ωˉ\bar\OmegaΩˉ is uniformly approximable by Lipschitz bounded continuous functions:

∀h, ∀δ>0, ∃h′ Lipschitz,∥h′−h∥<δ.\forall h,\ \forall \delta > 0,\ \exists h' \text{ Lipschitz},\quad \lVert h' - h\rVert < \delta.∀h, ∀δ>0, ∃h′ Lipschitz,∥h′−h∥<δ.

This is the approximation-theoretic half of the dense-range argument: the closure is compact metric, so Lipschitz maps are uniformly dense in continuous maps. It needs none of the elliptic hypotheses.

Formalization Note Lean states this over (closure Ω)→b R(closure~\Omega) \to^b~\mathbb{R}(closure Ω)→b R with Lipschitz constant K:NNRealK : NNRealK:NNReal; only boundedness of Ω\OmegaΩ is assumed.

Preamble
import Mathlib

open Filter
open scoped Topology BoundedContinuousFunction

namespace EthierKurtz
Formal statement
/-- Uniform density of Lipschitz maps on the closed region: every bounded
continuous function on the closure of a bounded set is uniformly
approximable by Lipschitz bounded continuous functions, since the closure
is compact metric. -/
theorem lipschitz_dense_closure (n : ℕ)
    (Ω : Set (EuclideanSpace ℝ (Fin (n + 1))))
    (hbounded : Bornology.IsBounded Ω) :
    ∀ h : (closure Ω) →ᵇ ℝ, ∀ delta : ℝ, 0 < delta →
      ∃ h' : (closure Ω) →ᵇ ℝ, (∃ K : NNReal, LipschitzWith K ⇑h') ∧
        ‖h' - h‖ < delta := by sorry
Source
Approximation-theoretic lemma for Stewart N. Ethier and Thomas G. Kurtz, Markov Processes: Characterization and Convergence, Wiley, 1986. Chapter 8, Section 1, Theorem 1.5, printed p. 369 (PDF p. 378).

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