Forward bound: copies of of prominence inject into the -window of
ProvedPersistClust.Count.proof_thm_4_8_partition_count_transport_forwardLet and be persistence diagrams in the extended plane , i.e. multiplicity functions that are diagram-like: every point of positive multiplicity lies strictly off the diagonal, . Write for the multiset of copies of : for each point it contains copies , , together with countably many copies of every diagonal point.
Let be a multi-bijection (a bijection of copies) satisfying assertions (i)–(iv) of Theorem 4.5 of the source paper at threshold and radius : whenever the point of a copy lies in the quadrant (both coordinates ), both coordinates of the point of the matched copy — in either direction of — are within in the sense that and in the extended reals ( being close only to itself); whenever the point of a copy lies in the quadrant (first coordinate , second coordinate ), only the first coordinate of the matched point is guaranteed within , again in either direction.
Fix real numbers , , and with , i.e. , and a window point with . Assume is -separated: every point of of positive multiplicity lies in the open half-plane above the line , or in , where is the closed half-plane of prominence at least , is its open complement, and is the open half-plane of births above .
This lemma is the forward half of the equality that counts the copies of of prominence at least against the copies of lying in the -window:
where both counts range over copies (a point together with an index below its multiplicity) and are computed as extended cardinalities of the corresponding copy sets.
The inequality is realized by the map sending a copy of with to its image : assertions (i) and (iii) at threshold , together with the window inequality , place the image point in ; for a source point with second coordinate the second coordinate of the image is first bounded by using assertion (i) along after bootstrapping the image point into the quadrant ; and being a bijection makes the map injective, while diagonal copies are never hit because the image point satisfies with .
Formalization Note. All notions live in Definitions.Def_PersistClust_Count_Diagram (namespace PersistClust.Count): Copies, pt, IsDiagramLike, SatisfiesIIV (assertions (i)–(iv) via closeE, at threshold and radius c * δ), IsSeparated, and the regions DeltaS d = {p | p.2 ≤ p.1 - ↑d} (closed) and LamE d = {p | ↑d < p.1} (open). The count is Set.encard of the set of copies with the natural-number index coerced into and compared strictly against the multiplicity at .
import Mathlib import Definitions.Def_PersistClust_Count_Diagram
namespace PersistClust.Count
theorem proof_thm_4_8_partition_count_transport_forward
(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