Theorem 4.5 support - separated diagrams: no essential bar is born below the separation band
ProvedPersistClust.Count.theorem_4_5_essential_birth_gt_boundLet f be a real-valued function on a metric space X and let diagram0 f be its sublevel-set persistence diagram. If diagram0 f is (d1, d2)-separated and Delta < d2, then there is no essential bar (a nonzero diagram point whose death coordinate is bottom) whose birth coordinate is at most Delta. Equivalently: every essential bar of a (d1, d2)-separated diagram is born strictly above d2. The proof first shows the underlying bound - an essential bar cannot lie in the DeltaN d1 region (that would force a death coordinate strictly below bottom), so it lies in the LamE d2 region, giving d2 < birth - and then combines it with the assumed birth bound to get d2 < Delta < d2, a contradiction. This is the terminal step of the elder chase: an essential bar born at or below tau + cdelta contradicts separation whenever tau + cdelta < d2.
import Mathlib import Definitions.Def_PersistClust_Count_Setting import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_Rips open PersistClust.Count
namespace PersistClust.Count
theorem theorem_4_5_essential_birth_gt_bound {X : Type*} [MetricSpace X] {f : X → ℝ} {d₁ d₂ : ℝ} (hsep : IsSeparated (diagram0 f) d₁ d₂) {Δ : ℝ} (hΔd : Δ < d₂)
{b : EReal} (hb : diagram0 f (b, ⊥) ≠ 0) (hble : b ≤ (((Δ : ℝ) : ℝ) : EReal)) :
False
:= by sorry