Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive gap bounded by ε₀ avoiding a finite set away from a point

Proved
PersistClust.Count.gap_excess

by fabianroll · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmeticcountfinsetgapisolationpersistclustsupport-toolwindow

For every finite set F of reals, every ε₀ > 0 and every point p, there exists a δ₀ with 0 < δ₀ and δ₀ ≤ ε₀ such that δ₀ < |τ - p| for every τ ∈ F with τ ≠ p: the distances from p to the elements of F other than p have a positive minimum, and halving the minimum of ε₀ with that distance keeps the gap positive, at most ε₀, and strictly below every nonzero distance to the set.

Preamble
import Mathlib
import Definitions.Def_PersistClust_Count_Setting
import Definitions.Def_PersistClust_Count_Diagram
import Definitions.Def_PersistClust_Count_FiltrationLaw
import Definitions.Def_PersistClust_Count_MatchingCensus

open PersistClust.Count
open scoped ENNReal
Formal statement
namespace PersistClust.Count

theorem gap_excess {ε₀ : ℝ} (F : Finset ℝ) (hε : 0 < ε₀) (p : ℝ) :
    ∃ δ₀ : ℝ, 0 < δ₀ ∧ δ₀ ≤ ε₀ ∧ ∀ τ ∈ F, τ ≠ p → δ₀ < |τ - p|
    := by sorry
Source
Support tool of the persistence-clustering deliverable (RR-6968, Theorem 4.5 cluster): the critSet gap-excess window lemma (T3-gap) of the comb family — the isolation margin used to keep the finitely many critical levels a positive distance away from the chosen parameters b, d when cutting crit-free windows in the rank-level kill (rankR1).

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