Essential bars: a cell whose value-ray is constantly e forces the essential bar (e, bottom) to have positive multiplicity
ProvedPersistClust.Count.essential_bar_mult_nonzeroLet a 0-dimensional persistence module be given by a filtration law (stage sets with a same-component relation) of finite type (IsTameModule), with the birth-sup bookkeeping: birthSup of a component class is the supremum of the levels at which it has ancestors. Suppose a component class E at level T has birth-sup e, and the value-ray through E is CONSTANTLY e under every descent: for every level w at most T, the descent of E to level w also has birth-sup exactly e. Then the ESSENTIAL bar at (e, bottom) is present in the diagram: mult (rankFn stage J) (e, bottom) is nonzero. The reason: for every eta > 0 and every level t at most e - eta, the census at level t exhibits a class with birth-sup in (e - eta, e] - the descent of E itself when t is at most T, or otherwise the descent of an ancestor of E at some level u in (e - eta, e] - and this class meets the stage at level e - eta (its ancestor level lies above e - eta) but not the stage at level e + eta (a meeting point would push the class's birth-sup above e). Hence for every probe (eta, t) the rank difference rankFn (e - eta) t - rankFn (e + eta) t is at least 1, and the bottom-branch infimum formula for the multiplicity of (e, bottom) - an infimum over all eta > 0 and t at most e - eta of exactly these rank differences - is at least 1.
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 essential_bar_mult_nonzero {ι : Type*} {stage : ℝ → Set ι} {J : ℝ → ι → ι → Prop}
(hLaw : FiltrationLaw stage J) (hTame : IsTameModule stage J)
{T e : ℝ} (E : comps stage J T) (he : birthSup hLaw T E = e)
(hfull : ∀ (w : ℝ) (hw : w ≤ T), birthSup hLaw w (structMap hLaw hw E) = e) :
mult (rankFn stage J) ((e : EReal), (⊥ : EReal)) ≠ 0
:= by sorry