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₂}
ProvedPersistClust.Count.proof_thm_4_8_partition_countLet , , , , and be as in the noise-image claim: satisfies assertions (i)–(iv) of Theorem 4.5 with threshold and radius , , and is -separated. Then for every threshold with , the total multiplicity of in the region equals the total multiplicity of in :
multiplicities counted, in ; the right-hand side is the number of peaks of prominence at least .
This is the counting step of the main theorem: the threshold separates the images of the signal points from everything else in .
Formalization Note The left-hand side counts all off-diagonal points of in the region, not only images of off-diagonal points of : points of matched with diagonal copies of must also be shown to lie outside the region (the paper's "is partitioned into" passes over them). The equality holds in with no finiteness assumption; in the source, is tame, so both counts are finite (the page's "same (finite) total multiplicity").
import Mathlib import Definitions.Def_PersistClust_Count_Diagram
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.