Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Arzela–Ascoli in C0 for a family with common compact support

Proved
ZeroAtInftyContinuousMap.isCompact_closure_of_common_support

by Mazecto · Oct 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

arzela-ascolicompactnesscontinuous-functions

Let XXX be a topological space and A⊆C0(X,R)\mathcal A\subseteq C_0(X,\mathbb R)A⊆C0​(X,R). Suppose that there is a compact subset K⊆XK\subseteq XK⊆X such that every u∈Au\in\mathcal Au∈A vanishes outside KKK, that ∣u(x)∣≤M|u(x)|\le M∣u(x)∣≤M for all u∈Au\in\mathcal Au∈A and x∈Xx\in Xx∈X, and that A\mathcal AA is equicontinuous. Then

A‾ is compact in C0(X,R)\overline{\mathcal A}\text{ is compact in }C_0(X,\mathbb R)A is compact in C0​(X,R)

for the supremum norm.

This common-support form of Arzela–Ascoli allows compactness on a compact domain to be used for functions on a noncompact ambient space. Empty families and empty supports are included; no separation or local compactness assumption on XXX is needed.

Preamble
import Mathlib.Topology.ContinuousMap.ZeroAtInfty
import Mathlib.Topology.ContinuousMap.Bounded.ArzelaAscoli

open Set
open scoped ZeroAtInfty BoundedContinuousFunction Topology
Formal statement
theorem ZeroAtInftyContinuousMap.isCompact_closure_of_common_support {X : Type*} [TopologicalSpace X]
    (A : Set C₀(X, ℝ)) (K : Set X) (hK : IsCompact K)
    (hsupp : ∀ u ∈ A, ∀ x ∉ K, u x = 0)
    (M : ℝ) (hM : ∀ u ∈ A, ∀ x, |u x| ≤ M)
    (heq : Equicontinuous (fun u : A => (u.1 : X → ℝ))) :
    IsCompact (closure A) := by sorry
Source
Common-support corollary of Arzela–Ascoli: Mathlib.Topology.ContinuousMap.Bounded.ArzelaAscoli, theorem BoundedContinuousFunction.arzela_ascoli, Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Topology/ContinuousMap/Bounded/ArzelaAscoli.lean; application in Hunter, Notes on PDEs (2014), p.75, proof of Theorem 3.48

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