Census absorption: an absorbed thread alive above v with a census witness forces a bar at (b, v)
ProvedPersistClust.Count.census_absorption_mult_nonzeroLet a 0-dimensional persistence module be given by a filtration law (stage sets with a same-component relation) of finite type (IsTameModule), carrying the critical-set census bookkeeping: critSet is the finite set of critical levels, and birthSup measures the level at which a component class is born (the supremum of the levels of its ancestors). Let b < v be real levels, and let a positive delta0 at most (b - v)/2 keep a gap around b and v free of all other critical levels. Suppose a thread with birth-sup b is alive just above v: for every probe eta in (0, delta0) there is a component class at level v + eta with birth-sup b, whose own descent to level v - eta carries a birth-sup DIFFERENT from b (the absorption shape: the thread merged at v into a strictly older thread). Then the diagram multiplicity of the point (b, v) is positive: mult (rankFn stage J) (b, v) is nonzero. The reason: every below-census class (birth-sup b at level v - eta) lifts to an above-census class descending back onto it (alive-up via the finite-max over descents), the chosen lift is injective (composing the descent inverts it) and misses the thread's own above-cell (its descent has birth-sup different from b), so the below-census injects into the above-census minus one cell; the resulting strict surplus of the b-census above v makes the box-combination t3_comb (whose infimum over probes gives the multiplicity, by the stability of the combination on the critical-free window) positive.
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 census_absorption_mult_nonzero {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
(hLaw : FiltrationLaw stage J) (hTame : IsTameModule stage J)
{b v δ₀ : ℝ} (hbd : v < b)
(hδ₀0 : 0 < δ₀) (hδ₀le : δ₀ ≤ (b - v) / 2)
(hgap : (∀ τ ∈ critSet hTame, τ ≠ b → δ₀ < |τ - b|) ∧
(∀ τ ∈ critSet hTame, τ ≠ v → δ₀ < |τ - v|))
(hthr : ∀ η : ℝ, η ∈ Set.Ioo (0 : ℝ) δ₀ →
∃ C : comps stage J (v + η), birthSup hLaw (v + η) C = b ∧
∀ hle : v - η ≤ v + η, birthSup hLaw (v - η) (structMap hLaw hle C) ≠ b) :
mult (rankFn stage J) ((b : EReal), (v : EReal)) ≠ 0
:= by sorry