Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.5, p. 19 — a multi-bijection D₀f → D₀𝓡^f_δ(L) moves points by ≤ cδ in Q^NE_α and abscissae by ≤ cδ in Q^SE_α

Proved
PersistClust.Count.theorem_4_5

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1persistence-diagramriemannian-manifoldrips-graphstability

Let X\mathbb XX be a Riemannian manifold, possibly non-compact and possibly with boundary, whose strong convexity radius ϱc(X)\varrho_c(\mathbb X)ϱc​(X) is positive. Let L⊆XL\subseteq\mathbb XL⊆X be a finite point cloud and f:X→Rf:\mathbb X\to\mathbb Rf:X→R a tame ccc-Lipschitz function (c≥0c\ge0c≥0). Let 0<δ<ϱc(X)0<\delta<\varrho_c(\mathbb X)0<δ<ϱc​(X) and α∈R\alpha\in\mathbb Rα∈R be such that LLL is a geodesic δ/4\delta/4δ/4-sample of Fα=f−1([α,∞))\mathbb F^\alpha=f^{-1}([\alpha,\infty))Fα=f−1([α,∞)). Then there is a multi-bijection γ\gammaγ between the 000-th persistence diagram D0fD_0fD0​f of the superlevel-set filtration of fff and the 000-th persistence diagram D0Rδf(L)D_0\mathcal R^f_\delta(L)D0​Rδf​(L) of the upper-star Rips filtration, such that

  1. ∀p∈D0f∩QαNE\forall p\in D_0f\cap Q^{NE}_\alpha∀p∈D0​f∩QαNE​, ∥p−γ(p)∥∞≤cδ\|p-\gamma(p)\|_\infty\le c\delta∥p−γ(p)∥∞​≤cδ;
  2. ∀q∈D0Rδf(L)∩QαNE\forall q\in D_0\mathcal R^f_\delta(L)\cap Q^{NE}_\alpha∀q∈D0​Rδf​(L)∩QαNE​, ∥γ−1(q)−q∥∞≤cδ\|\gamma^{-1}(q)-q\|_\infty\le c\delta∥γ−1(q)−q∥∞​≤cδ;
  3. ∀p∈D0f∩QαSE\forall p\in D_0f\cap Q^{SE}_\alpha∀p∈D0​f∩QαSE​, ∣px−γ(p)x∣≤cδ|p_x-\gamma(p)_x|\le c\delta∣px​−γ(p)x​∣≤cδ;
  4. ∀q∈D0Rδf(L)∩QαSE\forall q\in D_0\mathcal R^f_\delta(L)\cap Q^{SE}_\alpha∀q∈D0​Rδf​(L)∩QαSE​, ∣γ−1(q)x−qx∣≤cδ|\gamma^{-1}(q)_x-q_x|\le c\delta∣γ−1(q)x​−qx​∣≤cδ.

It is the stability step of the main theorem: above the level α\alphaα the diagram computed from the sample approximates the diagram of fff.

Formalization Note A multi-bijection is a bijection between the copies of the points of the two diagrams, the diagonal contributing countably many copies of each of its points (x,x)(x,x)(x,x), x∈[−∞,+∞]x\in[-\infty,+\infty]x∈[−∞,+∞]; the assertions quantify over all copies. On the Rips side the vertex set is LLL itself, with the ambient (geodesic) distance and g=f∣Lg=f|_Lg=f∣L​.

Preamble
import Mathlib
import Definitions.Def_PersistClust_Count_Setting
import Definitions.Def_PersistClust_Count_Diagram
import Definitions.Def_PersistClust_Count_Rips

open Bundle
open scoped ContDiff Manifold
Formal statement
namespace PersistClust.Count

theorem theorem_4_5
    {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    {H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
    {X : Type*} [MetricSpace X] [ChartedSpace H X] [IsManifold I ∞ X]
    [RiemannianBundle (fun x : X ↦ TangentSpace I x)]
    [IsContMDiffRiemannianBundle I ∞ E (fun x : X ↦ TangentSpace I x)]
    [IsRiemannianManifold I X]
    (hconv : 0 < convexityRadius X)
    (L : Finset X) (f : X → ℝ) (c : ℝ) (hc : 0 ≤ c) (hLip : ∀ x y, |f x - f y| ≤ c * dist x y)
    (htame : IsTame0 f)
    (δ : ℝ) (hδ : 0 < δ) (hδρ : ENNReal.ofReal δ < convexityRadius X)
    (α : ℝ) (hL : IsGeodesicSample (L : Set X) (superlevel f α) (δ / 4)) :
    ∃ γ : Copies (diagram0 f) ≃
        Copies (ripsDiagram (fun x y : L => dist (x : X) (y : X)) (fun x : L => f x) δ),
      SatisfiesIIV γ α (c * δ) := by sorry

end PersistClust.Count
Source
Chazal, Guibas, Oudot, Skraba, Persistence-Based Clustering in Riemannian Manifolds, INRIA RR-6968 (HAL inria-00389390v1, 2009), p. 19, Theorem 4.5
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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