Theorem 4.5, geometric step: superlevel-set and upper-star Rips filtrations are strongly -interleaved above the sampled level
OpenPersistClust.Count.theorem_4_5_interleavingThis is the geometric half of the proof of Theorem 4.5: it constructs the strong -interleaving, above the sampled level , between the superlevel-set filtration of a tame function and the upper-star Rips filtration of a geodesic -sample of one of its superlevel sets.
Let be a Riemannian manifold, possibly non-compact, possibly with boundary, whose convexity radius is positive. Let be a tame (finite-type) -Lipschitz function with constant , let be a finite point cloud, and let be below the convexity radius. Suppose that for some the point cloud is a geodesic -sample of the superlevel set , that is, every point of lies within distance of some point of .
Consider the superlevel-set filtration of and the upper-star Rips filtration , where and is the Rips graph of the points of at scale . Write and for their -th rank functions (for , the number of connected components of the stage at level that meet the stage at level ). Then:
- both -th persistence diagrams and are off-diagonal (every point of positive multiplicity has death smaller than birth) and have finite off-diagonal support;
- the two filtrations are strongly -interleaved above the time ; expressed at the level of the rank functions, for all and all ,
The interleaving is obtained exactly as in the proof of Theorem 4.4 of the report (following [6, Sec. 3.1]): the -sample property guarantees that every connected component of with contains a point of ; nearest-sample maps and are then defined for , the Lipschitz bound moving function values by at most and the geodesic convexity (a Rips edge joins points at distance , so the shortest geodesic between them stays within the relevant superlevel set up to the Lipschitz slack) ensuring the maps land where claimed; the commutation of the interleaving diagrams then yields the rank inequalities above. The finiteness assertions follow from the tameness of and the finiteness of the point cloud .
This lemma is the companion of PersistClust.Count.theorem_4_5_lemma_4_6 (Lemma 4.6, the algebraic half): feeding this interleaving into Lemma 4.6 with produces the multi-bijection asserted by Theorem 4.5.
Formalization Note The statement is taken with the same hypotheses as Theorem 4.5 (tame -Lipschitz function, positive convexity radius, below it, geodesic -sample of ). The filtrations are the ones defined by superRank f and ripsRank.
RETIRED (2026-10-09). This statement is FALSE as literally written: the naive shift , quantified over all with , is refuted at by elementary examples on (it probes ranks below the sampled level ). It is replaced by the corrected child PersistClust.Count.theorem_4_5_interleaving_corrected, which asserts the box-expansion inequalities only in the region , where the interleaving maps factor, together with the FiltrationLaw structure of both filtrations.
import Mathlib import Definitions.Def_PersistClust_Count_Setting import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_Rips open Bundle open scoped ContDiff Manifold
namespace PersistClust.Count
theorem theorem_4_5_interleaving
{E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
{H : Type*} [TopologicalSpace H] {I : ModelWithCorners ℝ E H}
{X : Type*} [MetricSpace X] [ChartedSpace H X] [IsManifold I ∞ X]
[RiemannianBundle (fun x : X ↦ TangentSpace I x)]
[IsContMDiffRiemannianBundle I ∞ E (fun x : X ↦ TangentSpace I x)]
[IsRiemannianManifold I X]
(hconv : 0 < convexityRadius X)
(L : Finset X) (f : X → ℝ) (c : ℝ) (hc : 0 ≤ c) (hLip : ∀ x y, |f x - f y| ≤ c * dist x y)
(htame : IsTame0 f)
(δ : ℝ) (hδ : 0 < δ) (hδρ : ENNReal.ofReal δ < convexityRadius X)
(α : ℝ) (hL : IsGeodesicSample (L : Set X) (superlevel f α) (δ / 4)) :
IsDiagramLike (diagram0 f) ∧
IsDiagramLike (ripsDiagram (fun x y : L => dist (x : X) (y : X)) (fun x : L => f x) δ) ∧
{p : EReal × EReal | (diagram0 f) p ≠ 0}.Finite ∧
{p : EReal × EReal |
(ripsDiagram (fun x y : L => dist (x : X) (y : X)) (fun x : L => f x) δ) p ≠ 0}.Finite ∧
(∀ s t : ℝ, α ≤ s → t ≤ s →
superRank f s t ≤
ripsRank (fun x y : L => dist (x : X) (y : X)) (fun x : L => f x) δ
(s - c * δ) (t - c * δ) ∧
ripsRank (fun x y : L => dist (x : X) (y : X)) (fun x : L => f x) δ s t ≤
superRank f (s - c * δ) (t - c * δ)) := by sorry
end PersistClust.Count