Proof of Theorem 4.8, p. 22, Regions I–II — γ(D₁) ⊆ Δ^N_{d₁+2cδ} ∪ Λ^W_{d₁+2cδ}
ProvedPersistClust.Count.proof_thm_4_8_noise_imageextended-planemulti-bijectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1persistence-diagram
Let and be two diagrams (multisets of off-diagonal points of with birth death, plus the diagonal with infinite multiplicity), and let be a multi-bijection between them satisfying assertions (i)–(iv) of Theorem 4.5 with threshold and radius , where . Let and satisfy , and assume is -separated. Write for the points of in . Then
This is the analysis of Regions I and II in the proof of the main theorem: the noise points of are sent to points of low prominence or low birth.
Formalization Note The statement is abstract: in the main theorem, , and comes from Theorem 4.5 with . Every copy of a point of is covered, and the image may be a diagonal copy.
Preamble
import Mathlib import Definitions.Def_PersistClust_Count_Diagram
Formal statement
namespace PersistClust.Count
theorem proof_thm_4_8_noise_image
(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₂) :
∀ (q : (EReal × EReal) × ℕ) (hq : (q.2 : ℕ∞) < D q.1), q.1 ∈ DeltaN d₁ →
pt (γ (Sum.inl ⟨q, hq⟩)) ∈ DeltaN (d₁ + 2 * c * δ) ∪ LamW (d₁ + 2 * 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. 22, proof of Theorem 4.8, Regions I and II
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.