Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thm 4.8 counting, step 2: γ\gammaγ transports Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​ to the τ\tauτ-window

Proved
PersistClust.Count.proof_thm_4_8_partition_count_transport

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

clusteringpersistencetopological-data-analysis

Let D,D′D, D'D,D′ be persistence diagrams off the diagonal and let γ:Copies(D)≃Copies(D′)\gamma : \mathrm{Copies}(D) \simeq \mathrm{Copies}(D')γ:Copies(D)≃Copies(D′) be a multi-bijection of their copies satisfying assertions (i)–(iv) of Theorem 4.5 with threshold α=cδ\alpha = c\deltaα=cδ and radius cδc\deltacδ: points of QcδNEQ^{NE}_{c\delta}QcδNE​ have both coordinates cδc\deltacδ-close to their images and preimages, and points of QcδSEQ^{SE}_{c\delta}QcδSE​ have their birth coordinate cδc\deltacδ-close to their images and preimages. Assume DDD is (d1,d2)(d_1, d_2)(d1​,d2​)-separated with δ<(d2−d1)/(5c)\delta < (d_2 - d_1)/(5c)δ<(d2​−d1​)/(5c) and let τ\tauτ lie in the window d1+2cδ<τ<d2−3cδd_1 + 2c\delta < \tau < d_2 - 3c\deltad1​+2cδ<τ<d2​−3cδ. Then the total multiplicity of DDD in Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​ equals the total multiplicity of D′D'D′ in ΔτS∩ΛτE\Delta^S_{\tau} \cap \Lambda^E_{\tau}ΔτS​∩ΛτE​. The reason is that γ\gammaγ restricts to a bijection between these two sets of copies: in one direction, the five-region analysis of the proof of Theorem 4.8 (regions III–V) shows that a copy of DDD whose point lies in Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​ is sent to a copy of D′D'D′ whose point lies in ΔτS∩ΛτE\Delta^S_{\tau} \cap \Lambda^E_{\tau}ΔτS​∩ΛτE​; in the other direction, a copy of D′D'D′ in ΔτS∩ΛτE\Delta^S_{\tau} \cap \Lambda^E_{\tau}ΔτS​∩ΛτE​ is sent back to a copy of DDD whose point, by separation, cannot lie in Δd1N\Delta^N_{d_1}Δd1​N​ (its prominence exceeds τ−2cδ>d1\tau - 2c\delta > d_1τ−2cδ>d1​ by the cδc\deltacδ-closeness), hence lies in Δd2S∩Λd2E\Delta^S_{d_2} \cap \Lambda^E_{d_2}Δd2​S​∩Λd2​E​. Both sets are off the diagonal since 0<d20 < d_20<d2​ and 0<τ0 < \tau0<τ.

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

theorem proof_thm_4_8_partition_count_transport
    (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 d₂ ∩ LamE d₂}.encard
      = {q : (EReal × EReal) × ℕ | (q.2 : ℕ∞) < D' q.1 ∧ q.1 ∈ DeltaS τ ∩ LamE τ}.encard := by sorry

end PersistClust.Count
Source
Chazal, Guibas, Oudot, Skraba: Persistence-Based Clustering in Riemannian Manifolds, INRIA Research Report RR-6968, 2009, p. 22, proof of Theorem 4.8 (counting part); https://hal.inria.fr/inria-00389390

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