Thm 4.8 counting, step 2: transports to the -window
ProvedPersistClust.Count.proof_thm_4_8_partition_count_transportLet be persistence diagrams off the diagonal and let be a multi-bijection of their copies satisfying assertions (i)–(iv) of Theorem 4.5 with threshold and radius : points of have both coordinates -close to their images and preimages, and points of have their birth coordinate -close to their images and preimages. Assume is -separated with and let lie in the window . Then the total multiplicity of in equals the total multiplicity of in . The reason is that 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 whose point lies in is sent to a copy of whose point lies in ; in the other direction, a copy of in is sent back to a copy of whose point, by separation, cannot lie in (its prominence exceeds by the -closeness), hence lies in . Both sets are off the diagonal since and .
import Mathlib import Definitions.Def_PersistClust_Count_Diagram
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