Rung-B helper: ancestor-level sets only grow under descent
ProvedPersistClust.Count.anc_set_descent_subsetancsetcountfiltrationlawpersistclustpersistencestructmapsupport-tool
For a filtration law, the ancestor-level set AncSet of a component class only grows when the class descends: every ancestor of E at level t remains an ancestor of the descended class structMap (t' <= t) E at the lower level t' <= t. The proof composes the two structure maps with structMap_comp and re-witnesses the ancestor relation.
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 anc_set_descent_subset {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
(hLaw : FiltrationLaw stage J) {t t' : ℝ} (hle : t' ≤ t) (E : comps stage J t) :
AncSet hLaw t E ⊆ AncSet hLaw t' (structMap hLaw hle E)
:= by sorrySource
Rung-B support tool of the persistence-clustering deliverable (RR-6968, Theorem 4.5 cluster): the ancestor-monotonicity fact underlying birth-sup descent bookkeeping. Transcribed GREEN (exit 0, sorry-free) from the ORCH-verified matching-gate lane working copy.