Theorem 4.5, demand routing: prominent and high far south-east copies route injectively under the interleaving
OpenPersistClust.Count.theorem_4_5_demand_routingThis is the demand-routing step in the proof of Theorem 4.5 of RR-6968: under a strong -interleaving above between two tame -dimensional persistence modules, the off-diagonal copies of the -diagram that cannot be absorbed by the diagonal — prominent copies (points of admitting no diagonal point -close in both coordinates) and high far south-east copies (birth above , more than above the death) — can be routed injectively into the copies of the -diagram, with prominent copies landing -close in both coordinates and high far south-east copies landing -close in the birth coordinate on points that again lie in .
Formally: for two finite-type modules strongly -interleaved above , there is an injection from the demanding copies of to the copies of such that maps prominent copies to -close copies (both coordinates) and high far south-east copies to south-east copies -close in the birth coordinate.
Together with the assembly child theorem_4_5_matching_assembly — which turns two such routings (one per direction) into the multi-bijection with guarantees (i)–(iv) via a Schröder–Bernstein argument — this yields the gate theorem_4_5_gate_matching. The routing is where the interleaving does its work: prominent -bars must have -partners born and dying within (window inequalities, census counting, image-birth transport), and high far south-east bars must have birth-close south-east partners.
Formalization Note The demand predicates are those of PersistClust_Count_MatchingGate; the modules enter through FiltrationLaw, IsTameModule, and StrongInterleavingAbove as defined in PersistClust_Count_MatchingCensus.
import Mathlib import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_FiltrationLaw import Definitions.Def_PersistClust_Count_MatchingCensus import Definitions.Def_PersistClust_Count_MatchingGate
import Mathlib
import Definitions.Def_PersistClust_Count_Diagram
import Definitions.Def_PersistClust_Count_FiltrationLaw
import Definitions.Def_PersistClust_Count_MatchingCensus
import Definitions.Def_PersistClust_Count_MatchingGate
namespace PersistClust.Count
theorem theorem_4_5_demand_routing
{ιX ιY : Type*}
{stageX : ℝ → Set ιX} {JX : ℝ → ιX → ιX → Prop} {stageY : ℝ → Set ιY} {JY : ℝ → ιY → ιY → Prop}
(hLawX : FiltrationLaw stageX JX) (hLawY : FiltrationLaw stageY JY)
(hTameX : IsTameModule stageX JX) (hTameY : IsTameModule stageY JY)
{α ε : ℝ} (hε : 0 ≤ ε)
(hIL : StrongInterleavingAbove stageX JX stageY JY hLawX hLawY α ε hε) :
∃ F : {a : offD (mult (rankFn stageX JX)) // DemandsOff α ε a}
→ offD (mult (rankFn stageY JY)),
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 α) := by sorry
end PersistClust.Count