probe title
OpenPersistClust.Count.decompose_longnl2Retired: this was a formatting probe used while accepting the decomposition of PersistClust.Count.alg_numclust_eq_barcode; its statement is superseded by PersistClust.Count.alg_numclust_eq_barcode_forward / _reverse.
Preamble
import Mathlib import Definitions.Def_PersistClust_Count_Algorithm import Definitions.Def_PersistClust_Count_AlgBarcode
Formal statement
namespace PersistClust.Count
theorem decompose_longnl2
(n : ℕ) (g : Fin n → ℝ) (Dm : Fin n → Fin n → ℝ)
(hDm : ∀ i j, Dm i j = Dm j i) (hDm0 : ∀ i j, 0 ≤ Dm i j)
(δ τ : ℝ) (hδ : 0 ≤ δ) (hτ : 0 < τ)
(σ : Fin n ≃ Fin n) (hσ : IsSortOrder g σ) :
(numClusters g Dm δ τ σ : ℕ∞)
≤ {q : (EReal × EReal) × ℕ | (q.2 : ℕ∞) < ripsBarcode g Dm δ σ q.1 ∧
q.1.2 ≤ q.1.1 - (τ : EReal) ∧ (τ : EReal) ≤ q.1.1}.encard := by sorry
end PersistClust.Count