The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index; 1 of the 21 sources its claims cite were checked for support.
Stability of Persistence Diagrams
Open accessOverview
CoChat Summary
TL;DR
The paper proves that persistence diagrams of real-valued functions on topological spaces are stable: small changes in the function imply small changes in the diagram under the bottleneck distance. It applies this stability to homology estimation from point samples and to comparing/classifying geometric shapes.
Key findings
- The Main Theorem states that for a triangulable space \(X\) with continuous tame functions \(f,g:X\to\mathbb R\), the persistence diagrams satisfy \(d_B(D(f),D(g)) \le \|f-g\|_\infty\).
- The proof first establishes stability for the Hausdorff distance using the Box Lemma, then strengthens it to the bottleneck distance using the Easy Bijection Lemma and an Interpolation Lemma for piecewise linear functions.
- The Homology Inference Theorem states that for all real \(\varepsilon\) with \(d_H(X,P) < \varepsilon < \mathrm{hfs}_X/4\) and all sufficiently small \(\delta>0\), the dimensions of the homology group of \(X+\delta\) and \(P^\varepsilon_{3\varepsilon}\) are either both infinite or both finite and equal.
- The Barcode Theorem states that if a diffeomorphism \(\Phi:\mathbb R^d\to\mathbb R^d\) has derivatives up to second order close to those of a rigid motion, then the bottleneck distance between the barcodes of a hypersurface \(S\subseteq\mathbb R^d\) and its perturbation \(\Phi(S)\) is small.
Methods
- Theoretical study of real-valued functions on topological spaces, using homology with \(\mathbb Z_2\) coefficients, homological critical values, tame functions, persistent homology groups, and persistence diagrams.
- Stability is proved by algebraic-topological diagram chasing: the Quadrant Lemma and Box Lemma bound multiplicities in nested quadrants/boxes, and the bottleneck case is handled by composing bijections for very close functions and interpolating between piecewise linear functions.
- Applications are derived as corollaries; the paper reports no empirical data, experiments, or numerical evaluations.
Limitations
- The paper explicitly leaves open whether the Main Theorem extends to non-tame functions, whether other metrics on functions and persistence diagrams admit similar inequalities, and how to exploit the result algorithmically.
- Evident from the text: the main theorem assumes a triangulable space and continuous tame functions, and the proof uses compactness, finite simplicial complexes, and finite-dimensional homology groups.
- Evident from the text: the applications are theoretical corollaries, and the Barcode Theorem states only that the bottleneck distance is “small” under \(C^2\)-closeness to a rigid motion, without a quantitative bound.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures


![Fig. 3 (a) Homology group of the sub-level set f -1 ( -∞ , x ]. (b) Image of Fx in Fy . (c) Kernel of surjection F y x → F z x . (d) Quotient of F y , z x and F y , z w .](/paper-figures/e3fbb536dd354c4daa1aeec1692fa302/stability-of-persistence-diagrams-figure-3.png)






Verification
Claims the paper makes
1 Valid · 7 Not valid · 19 Not checked · 31 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Indeed, the dimensions of the persistent homology groups that appear in the theorem are efficiently computable using the persistence algorithm on the filtration of alpha complexes [11], [12].”
What the sources say
- Not matchedcites [11] 11. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Comput . Geom . 28 (2002), 511-533.
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Partly supportedcites [12] 12. H. Edelsbrunner and E. P. M¨ ucke. Three-dimensional alpha shapes. ACM Trans . Comput . Graphics 13 (1994), 43-72. sourceExperimental — accuracy not yet measured
Section 3.3, “Alpha Complexes” (page unavailable), defines alpha complexes and states that each is a subcomplex of those at larger alpha values, supporting the filtration part. “Features and Signatures” (page unavailable) describes an efficient way to track connected components, but calls higher-order homology signatures more challenging; it does not describe a persistence algorithm or establish efficient computation of the claimed persistent-homology dimensions. (LLM, conf=0.86)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Easy Bijection Lemma. Let f , g : X → R be tame functions and let g be very close to f . Then the persistence diagrams satisfy d B ( D ( f ), D ( g )) ≤ ‖ f -g ‖∞ .”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Critical Value Lemma. If some closed interval [ x , y ] contains no homological critical value of f , then f y x is an isomorphism for every integer k .”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Writing ε = ‖ f -g ‖∞ , we have f -1 ( -∞ , x ] ⊆ g -1 ( -∞ , x + ε ] for all x ∈ R .”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Interpolation Lemma.”
- Also stated in: § Interpolation Lemma. · p. 13 · boosted
“However, since the h λ i sample the linear interpolation from ˆ f to ˆ g , the latter sum equals ‖ ˆ f - ˆ g ‖∞ , which concludes the proof.”
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Interpolation Lemma. · p. 13 · boosted
21 more claims
Create a free account to see all 58 claims and every source verdict.
- Probably not a substantial claim. 28
- It may state two separate claims as one. 13
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Let X be any space which is homeomorphic to a simplicial complex, and suppose f, g : X → R are continuous tame functions. Then the persistence vector spaces { H k ( f -1 (( -∞ , r ]) } r and { H k ( g -1 (( -∞ , r ]) } r are finitely presented, and therefore admit barcode descriptions for each k ∈ N”
From Topological pattern recognition for point cloud data (2014) · cites this paper as Cohen-Steiner et al. (2007)
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Also, results about barcodes under the general heading have now begun to appear (see [15] and [16]).”
From Topology and data (2009) · cites this paper as [15]
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Spanier, E. H. (1990) · Cited by 3,014
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Self-citationElements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,102
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Introduction to linear algebra
(2016) · Cybersecurity and Applied Mathematics · doi:10.1016/b978-0-12-804452-0.09998-x · Cited by 1,646
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Morphometric Tools for Landmark Data.
Bookstein, F. (1998) · Biometrics · doi:10.2307/2534038 · Cited by 1,378
ELEMENTS OF ALGEBRAIC TOPOLOGY
KURATOWSKI, K. (1972) · Introduction to Set Theory and Topology · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,277
Research works printed but not linked: 2
- [16]16. J. Milnor. Morse Theory . Princeton University Press, New Jersey, 1963.
- [19]19. V. Robins. Toward computing homology from finite approximations. Topology Proceedings 24 (1999), 503-532.
Cited by
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302
Barcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
A tutorial on kernel density estimation and recent advances
Chen, Y.-C. (2017) · Biostatistics & Epidemiology · doi:10.1080/24709360.2017.1396742 · Cited by 830
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
Homological scaffolds of brain functional networks
Petri, G., Expert, P., Turkheimer, F., Carhart-Harris, R., Nutt, D., Hellyer, P. J., & Vaccarino, F. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0873 · Cited by 675
Metadata
- Authors
- Cohen-Steiner, D., Edelsbrunner, H., & Harer, J.
- Affiliations
- Duke University (US)
- Corresponding author
- Edelsbrunner, Herbert
- Harer, John
- Venue
- Discrete & Computational Geometry
- Published
- 2006-12-12
- Volume
- 37
- Issue
- 1
- Pages
- 103-120
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W2037613900
- Cited by
- 1,280
- References
- 30
- Citations by year
- 2026: 102 · 2025: 89 · 2024: 69 · 2023: 97 · 2022: 78 · 2021: 132 · 2020: 109 · 2019: 89 · 2018: 92 · 2017: 50 · 2016: 60 · 2015: 54 · 2014: 58 · 2013: 48 · 2012: 29
- FWCI
- 18.03
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Discrete & Computational Geometry (publishedVersion)
- Funders
- National Science Foundation (0086013)
- Defense Advanced Research Projects Agency (HR0011, HR0011-05-1-0007)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Physical Sciences › Mathematics › Applied Mathematics › Geometric Analysis and Curvature Flows
- Keywords
- persistence diagrams, stability, topological data analysis, metric spaces, shape comparison, real functions, simplicial complexes
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stability of Persistence Diagrams. https://app.cochat.ai/papers/10.1007/s00454-006-1276-5
- The paper
- Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007). Stability of Persistence Diagrams. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-006-1276-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.