Crit-free-window descent is injective on component classes
ProvedPersistClust.Count.crit_free_descent_injectivecountcritsetinjectivityistamemodulepersistclustpersistencestructmapsupport-tool
For a tame module (IsTameModule) with critical set critSet, the coarsening descent structMap from level w' down to w is INJECTIVE whenever the window [w, w'] avoids the critical set: two stage-w' classes whose w-descents coincide are equal. The proof pushes the coincidence of the descended neighborhoods through the critical-free componentwise bijection of critSet_spec: the two representatives become J-related at w', so their full classes coincide by J-transitivity, and Subtype.ext closes.
Preamble
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
Formal statement
namespace PersistClust.Count
theorem crit_free_descent_injective {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
(hLaw : FiltrationLaw stage J) (hTame : IsTameModule stage J)
{w w' : ℝ} (hww : w ≤ w')
(hfree : ∀ τ ∈ critSet hTame, τ < w ∨ w' < τ) {C₁ C₂ : comps stage J w'}
(h : structMap hLaw hww C₁ = structMap hLaw hww C₂) : C₁ = C₂
:= by sorrySource
T3a support tool of the persistence-clustering deliverable (RR-6968, Theorem 4.5 cluster): the descent-injectivity half of the critical-window rigidity consumed by the thread bookkeeping (birth-sup threading, combination stability). Transcribed GREEN from the ORCH-verified matching-gate lane working copy.