Sync-low: co-merging X-cells have co-merging interleaving images (equal-argument descent)
ProvedPersistClust.Count.diagram_sync_low_transferLet two 0-dimensional persistence modules X and Y be given by filtration laws (stage-set families stageX, stageY with same-component relations JX, JY), and let the two be interleaved above a level alpha by structure-respecting maps phi_beta : X-components at level beta -> Y-components at level beta - eps (for beta at least alpha) satisfying the square (i'): for beta <= beta' both at least alpha, phi_beta applied to the coarsening of a beta'-cell C down to level beta equals the coarsening (from level beta' - eps to level beta - eps) of phi_beta' C. If a cell C at level u >= alpha coarsens at level delta (alpha <= delta <= u) onto the cell E, then the images co-merge through the same descent: the image phi_u C coarsens at level delta - eps onto phi_delta E. Reading delta as the level at which two X-threads merge, this is the lower sync bound: the two image threads are already one class by delta - eps, so any level at which they merge is at least delta - eps. Together with the companion sync-high separation (distinct 2eps-descents force distinct images) it localizes the image merge level into [delta - eps, delta + eps].
import Mathlib import Definitions.Def_PersistClust_Count_Setting import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_FiltrationLaw import Definitions.Def_PersistClust_Count_MatchingCensus open PersistClust.Count open scoped ENNReal
namespace PersistClust.Count
theorem diagram_sync_low_transfer {ι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)
{α ε : ℝ}
(φ : ∀ β : ℝ, α ≤ β → comps stageX JX β → comps stageY JY (β - ε))
(hSq1 : ∀ (β β' : ℝ) (hβ : α ≤ β) (hβ' : α ≤ β') (hle : β ≤ β')
(x : comps stageX JX β'),
φ β hβ (structMap hLawX hle x) =
structMap hLawY (show β - ε ≤ β' - ε by linarith) (φ β' hβ' x))
{δ u : ℝ} (hδ : α ≤ δ) (hu : α ≤ u) (hle : δ ≤ u)
(C : comps stageX JX u) (E : comps stageX JX δ)
(hmerge : structMap hLawX hle C = E) :
structMap hLawY (show δ - ε ≤ u - ε by linarith) (φ u hu C) = φ δ hδ E
:= by sorry