Geometric interleaving (corrected): superlevel and Rips filtrations are cδ-interleaved above α in box-expansion rank form
ProvedPersistClust.Count.theorem_4_5_interleaving_correctedThis is the corrected form of the geometric ingredient in the proof of Theorem 4.5 (p. 21), which adapts the proof of Theorem 4.4 of [6, §3.1].
Let be a Riemannian manifold of positive convexity radius, tame (IsTame0) and -Lipschitz, and a finite geodesic -sample of the superlevel set , with below the convexity radius. Then the superlevel-set filtration of and the upper-star Rips filtration of the sample are both genuine 0-dimensional persistence filtrations (their stage families decrease and their join relations are the component equivalences — the FiltrationLaw conjuncts), their 0-th persistence diagrams are diagram-like with finite off-diagonal support, and the two filtrations are strongly -interleaved above . In rank form this yields the box-expansion inequalities: for all with ,
where is the number of path components of meeting and is the number of connected components of the Rips graph meeting .
This is the reusable geometric lemma for Theorem 4.5; its conclusion is exactly the hypothesis set of the corrected algebraic child, with , and .
Formalization Note. The inequalities are asserted only in the box , , the region where the interleaving maps factor and hence genuinely constrain the ranks. The naive shift , quantified over all with , is falsified at by elementary examples on (it probes ranks below the sampled level ); the box-expansion form avoids this.
import Mathlib import Definitions.Def_PersistClust_Count_Setting import Definitions.Def_PersistClust_Count_Diagram import Definitions.Def_PersistClust_Count_Rips import Definitions.Def_PersistClust_Count_FiltrationLaw open Bundle open scoped ContDiff Manifold
namespace PersistClust.Count
theorem theorem_4_5_interleaving_corrected
{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)) :
FiltrationLaw (superlevel f) (fun t => JoinedIn (superlevel f t)) ∧
FiltrationLaw (fun t => {i | t ≤ (fun x : L => f x) i})
(ripsJoined (fun x y : L => dist (x : X) (y : X)) (fun x : L => f x) δ) ∧
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 : ℝ, t + 2 * (c * δ) ≤ s → α ≤ t →
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