Theorem 4.5, assembly step: demand routings in both directions yield the multi-bijection (i)–(iv)
ProvedPersistClust.Count.theorem_4_5_matching_assemblyThis is the assembly step of the proof of Theorem 4.5 of RR-6968: it converts injective demand routings between two persistence diagrams into the multi-bijection with the matching guarantees (i)–(iv).
Let and be two persistence diagrams off the diagonal (every point of positive multiplicity has death strictly smaller than birth) with finite off-diagonal support. Fix a level and a radius . An off-diagonal copy of is demanding if it is prominent — its point lies strictly above in both coordinates and cannot be -absorbed by the diagonal — or if it is a high far south-east copy: birth above and more than above the death coordinate.
Suppose that in each direction the demanding copies admit an injective routing: an injection from the demanding copies of into the copies of that maps prominent copies to copies -close in both coordinates, and high far south-east copies to south-east copies -close in the birth coordinate whose points again lie in ; and symmetrically an injection from the demanding copies of into the copies of . Then there exists a bijection between all copies of and all copies of — off-diagonal copies together with the countably many diagonal slots — such that:
- every copy of a point of is mapped to a copy -close in both coordinates, in both directions (assertions (i) and (ii));
- every copy of a point of is mapped to a copy -close in the birth coordinate, in both directions (assertions (iii) and (iv)).
The construction routes each demanding copy to its partner and absorbs every other off-diagonal copy into the diagonal: a killed copy lands on a diagonal slot -close in the relevant coordinates, diagonal copies land on even slots and killed copies on odd slots of a per-diagram copy code, so the two total maps are injections preserving the clause relation, and the Schröder–Bernstein theorem yields the bijection ; the clause relation of the images is exactly what assertions (i)–(iv) state.
Formalization Note The diagrams are functions from the extended plane to ; copies are the elements of the Copies type (off-diagonal copies plus diagonal slots); closeness is the extended-real closeE with close only to itself. The hypotheses are exactly diagram-likeness, finite support, and the two routings; no filtration or module data enters, so the lemma applies to any pair of diagrams for which the routings can be produced.
import Mathlib import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_MatchingGate
import Mathlib
import Definitions.Def_PersistClust_Count_Diagram
import Definitions.Def_PersistClust_Count_MatchingGate
namespace PersistClust.Count
theorem theorem_4_5_matching_assembly
{DX DY : EReal × EReal → ℕ∞} (α ε : ℝ) (hε : 0 ≤ ε)
(hDX : IsDiagramLike DX) (hDY : IsDiagramLike DY)
(hFinX : {p : EReal × EReal | DX p ≠ 0}.Finite)
(hFinY : {p : EReal × EReal | DY p ≠ 0}.Finite)
(hGX : ∃ F : {a : offD DX // DemandsOff α ε a} → offD DY,
Function.Injective F ∧
(∀ a, PromQNE α ε a.1 → CloseCopy2 ε a.1 (F a)) ∧
(∀ a, offPt a.1 ∈ QSE α → CloseCopy1 ε a.1 (F a) ∧ offPt (F a) ∈ QSE α))
(hGY : ∃ F : {a : offD DY // DemandsOff α ε a} → offD DX,
Function.Injective F ∧
(∀ a, PromQNE α ε a.1 → CloseCopy2 ε a.1 (F a)) ∧
(∀ a, offPt a.1 ∈ QSE α → CloseCopy1 ε a.1 (F a) ∧ offPt (F a) ∈ QSE α)) :
∃ γ : Copies DX ≃ Copies DY, SatisfiesIIV γ α ε := by sorry
end PersistClust.Count