Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.8, p. 23 — for τ ∈ (d₁+2cδ, d₂−3cδ), D′ has as many points in Δ^S_τ ∩ Λ^E_τ as D has in Δ^S_{d₂}

Proved
PersistClust.Count.proof_thm_4_8_partition_count

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

extended-planemulti-bijectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1persistence-diagram

Let DDD, D′D'D′, γ\gammaγ, c,δ>0c,\delta>0c,δ>0, d1≥0d_1\ge0d1​≥0 and d2d_2d2​ be as in the noise-image claim: γ\gammaγ satisfies assertions (i)–(iv) of Theorem 4.5 with threshold and radius cδc\deltacδ, δ<d2−d15c\delta<\frac{d_2-d_1}{5c}δ<5cd2​−d1​​, and DDD is (d1,d2)(d_1,d_2)(d1​,d2​)-separated. Then for every threshold τ\tauτ with d1+2cδ<τ<d2−3cδd_1+2c\delta<\tau<d_2-3c\deltad1​+2cδ<τ<d2​−3cδ, the total multiplicity of D′D'D′ in the region ΔτS∩ΛτE\Delta^S_\tau\cap\Lambda^E_\tauΔτS​∩ΛτE​ equals the total multiplicity of DDD in Δd2S\Delta^S_{d_2}Δd2​S​:

#(D′∩ΔτS∩ΛτE)=#(D∩Δd2S),\#\big(D'\cap\Delta^S_\tau\cap\Lambda^E_\tau\big)=\#\big(D\cap\Delta^S_{d_2}\big),#(D′∩ΔτS​∩ΛτE​)=#(D∩Δd2​S​),

multiplicities counted, in N∪{+∞}\mathbb N\cup\{+\infty\}N∪{+∞}; the right-hand side is the number of peaks of prominence at least d2d_2d2​.

This is the counting step of the main theorem: the threshold τ\tauτ separates the images of the signal points from everything else in D′D'D′.

Formalization Note The left-hand side counts all off-diagonal points of D′D'D′ in the region, not only images of off-diagonal points of DDD: points of D′D'D′ matched with diagonal copies of DDD must also be shown to lie outside the region (the paper's "is partitioned into" passes over them). The equality holds in N∪{+∞}\mathbb N\cup\{+\infty\}N∪{+∞} with no finiteness assumption; in the source, D0fD_0fD0​f is tame, so both counts are finite (the page's "same (finite) total multiplicity").

Preamble
import Mathlib
import Definitions.Def_PersistClust_Count_Diagram
Formal statement
namespace PersistClust.Count

theorem proof_thm_4_8_partition_count
    (D D' : EReal × EReal → ℕ∞) (hD : IsDiagramLike D) (hD' : IsDiagramLike D')
    (c δ : ℝ) (hc : 0 < c) (hδ : 0 < δ)
    (γ : Copies D ≃ Copies D') (hγ : SatisfiesIIV γ (c * δ) (c * δ))
    (d₁ d₂ : ℝ) (hd₁ : 0 ≤ d₁) (hδc : δ < (d₂ - d₁) / (5 * c))
    (hsep : IsSeparated D d₁ d₂)
    (τ : ℝ) (hτ₁ : d₁ + 2 * c * δ < τ) (hτ₂ : τ < d₂ - 3 * c * δ) :
    {q : (EReal × EReal) × ℕ | (q.2 : ℕ∞) < D' q.1 ∧ q.1 ∈ DeltaS τ ∩ LamE τ}.encard
      = prominentCount D d₂ := by sorry

end PersistClust.Count
Source
Chazal, Guibas, Oudot, Skraba, Persistence-Based Clustering in Riemannian Manifolds, INRIA RR-6968 (HAL inria-00389390v1, 2009), p. 23, proof of Theorem 4.8, the partition of D₀𝓡^f_δ(L) and the equality of total multiplicities
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me