The DOI matches its Crossref record; 18 of the 19 references it cites were found in a registry or an index; 7 of the 12 sources its claims cite were checked for support.
Computing Persistent Homology
Open accessOverview
CoChat Summary
TL;DR
The paper shows that persistent homology of a filtered simplicial complex is the standard homology of a graded module over a polynomial ring, yielding a simple interval classification over arbitrary fields. It derives a general persistence algorithm for arbitrary dimensions and fields, and gives a separate algorithm for individual persistent groups over arbitrary PIDs.
Key findings
- Persistent homology of a filtered \(d\)-dimensional simplicial complex is equivalent to the standard homology of a finitely generated graded module over \(R[t]\), via an equivalence of categories between finite-type persistence modules and finitely generated non-negatively graded \(R[t]\)-modules.
- Over any field \(F\), persistence modules of finite type are classified bijectively by finite sets of \(P\)-intervals, generalizing the prior interval description from subcomplexes of \(S^3\) over \(\mathbb{Z}_2\) to arbitrary fields and arbitrary dimensions.
- Over non-fields, no similarly simple classification exists; the paper instead gives an algorithm for computing individual persistent homology groups over an arbitrary PID, with complexity in the order of computing homology groups.
- Experiments on a Klein bottle show \(\mathbb{Z}_2\)-homology gives \((\beta_0,\beta_1,\beta_2)=(1,2,1)\), while \(\mathbb{Z}_3,\mathbb{Z}_5,\mathbb{Z}_{3203},\) and \(\mathbb{Q}\) give \((1,1,0)\); for dataset J, there are 730,692 \(P\)-intervals in dimension 2, of which 502 are non-empty.
Methods
- Theoretical development: defines persistence complexes/modules, proves the correspondence to graded modules over \(R[t]\), applies the structure theorem for PIDs, and interprets \(P\)-intervals as lifetimes of homology classes.
- Algorithm for fields: derives a column-echelon reduction algorithm that computes \(P\)-intervals directly over \(F\), using pivot columns and deleting corresponding rows in the next dimension; worst-case \(O(m^3)\) for \(m\) simplices.
- Experiments: implements the field algorithm in C with GNU MP for \(\mathbb{Z}_p\) and \(\mathbb{Q}\), and tests on a triangulated Klein bottle \(K\) (12,000 simplices), electrostatic potential dataset \(E\) (529,225 simplices), and supersonic jet flow dataset \(J\) (3,029,383 simplices), using Morse-function excursion filtrations.
Limitations
- The paper states that over non-fields such as \(\mathbb{Z}\), no simple classification of persistence modules is available or likely ever to be available; only individual persistent groups can be computed over arbitrary PIDs.
- The field algorithm has \(O(m^3)\) worst-case running time, and the reduction algorithm requires exact integer arithmetic, which is problematic in practice because intermediate matrix entries may become extremely large.
- For large datasets, the paper states that computing persistence over alternate fields required in excess of 2 GB of memory; for finite fields \(\mathbb{Z}_p\), restricting \(p<2^{16}-1\) is suggested to fit coefficients in 32-bit integers.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
7 Valid · 1 Not valid · 1 Not checked · 58 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“Lemma 3.1. Let T be the set of triangles defined by P -intervals for the k-dimensional persistence module . The rank β l , p k of H l , p k is the number of triangles in T containing the point ( l , p ) .”
What the sources say
- Supportedcites [11] 11. Edelsbrunner, H., Letscher, D., and Zomorodian, A. Topological persistence and simplification. Discrete Comput . Geom . 28 (2002), 511-533. source
The Algebraic Formulation defines β_{ℓ,p}^k as the rank of H_{ℓ,p}^k. The k-Triangle Lemma in the Abstract Algorithm section states that this number equals the number of k-triangles containing (ℓ,p) in the index-persistence plane. (LLM, conf=0.95)
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.
- Supported
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“Then im η i , p k ≃ H i , p k [11], [18].”
What the sources say
- Supportedcites [11] 11. Edelsbrunner, H., Letscher, D., and Zomorodian, A. Topological persistence and simplification. Discrete Comput . Geom . 28 (2002), 511-533. source
The Algebraic Formulation section explicitly defines the homomorphism η from kth homology at one filtration index to kth homology p steps later and states that its image is isomorphic to the p-persistent kth homology group. (LLM, conf=0.95)
- Not checked yetcites [18] 18. Zomorodian, A. Computing and Comprehending Topology: Persistence and Hierarchical Morse Complexes. Ph.D. thesis, University of Illinois at Urbana-Champaign, 2001. Received March 21, 2003, and in revised form June 23, 2004. Online publication November 19, 2004.
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The authors also provide an algorithm that worked only for spaces that were subcomplexes of S 3 over Z 2 coefficients.”
What the sources say
- Partly supportedcites [11] 11. Edelsbrunner, H., Letscher, D., and Zomorodian, A. Topological persistence and simplification. Discrete Comput . Geom . 28 (2002), 511-533. sourceExperimental — accuracy not yet measured
The Approach and Results section says the authors provide a persistence algorithm and restrict their attention to finite simplicial complexes in R³, not subcomplexes of S³. The Background and Chains, Cycles, Boundaries sections use Z₂ coefficients. Thus the coefficient restriction is supported, but the stated space is not. (LLM, conf=0.88)
- Not checked yetcites [18] 18. Zomorodian, A. Computing and Comprehending Topology: Persistence and Hierarchical Morse Complexes. Ph.D. thesis, University of Illinois at Urbana-Champaign, 2001. Received March 21, 2003, and in revised form June 23, 2004. Online publication November 19, 2004.
plain- 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.
- Partly supported
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
“Over Z 2, we get β 1 = 2 as homology is unable to recognize the torsional boundary 2 c with coefficients 0 and 1.”
plain- 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 reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For the large data sets, we do not compute persistence over alternate fields as the computation requires in excess of 2 gigabytes of memory.”
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.
29 more claims
Create a free account to see all 67 claims and to verify the 2 references still open.
- Probably not a substantial claim. 21
- It may state two separate claims as one. 16
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
“Persistent homology22–25—a new branch of algebraic topology—is able to bridge geometry and topology, leading to a new efficient approach for the simplification of biological structural complexity26–31; however, it neglects critical chemical/biological information when it is directly applied to complex biomolecular structures.”
From A topology-based network tree for the prediction of protein–protein binding affinity changes following mutation (2020) · cites this paper as [24]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“if we restrict the domain of the scale parameter r in ordinary persistence to the integer lattice Z + ⊆ R + , then the classification of such restricted persistence vector spaces is identical to the classification of graded k [ t ]-modules.”
From Topological pattern recognition for point cloud data (2014) · cites this paper as Zomorodian and Carlsson (2005)
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“H * (C; F ) ∼ = i x t i • F [x] ⊕ ⎛ ⎝ j x r j • (F [x]/(x s j • F [x])) ⎞ ⎠ .”
From Barcodes: the persistent topology of data (2007) · cites this paper as [22]
The cited source says what the claim attributes to it.
In the citing paper
“As a result, persistent homology can capture topological structures continuously over a range of spatial scales.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [18]
The cited source says what the claim attributes to it.
In the citing paper
“Unlike commonly used computational homology which results in truly metric free representations, persistent homology embeds geometric information in topological invariants, e.g., Betti numbers, so that 'birth' and 'death' of isolated components, rings, and cavities can be monitored at all geometric scales by topological measurements.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [18]
1 more claim about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3.2. Decomposition · p. 12
“Definition 3.4 ( P -Interval). A P -interval is an ordered pair ( i , j ) with 0 ≤ i < j ∈ Z ∞ = Z ∪ {+∞} .”
§ 4.2. Algorithm · p. 19
“L 0 = { ( 0 , ∞ ), ( 0 , 1 ), ( 1 , 1 ), ( 1 , 2 ) }”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 4.2. Algorithm · p. 18
“k = dim σ j ; Store j and d in T [ i ]; Lk = Lk ∪ { ( deg σ i , deg σ j ) }”
§ 4.2. Algorithm · p. 19
“For our example filtration in Fig. 8, the marked 0-simplices { a , b , c , d } and 1-simplices { ad , ac } generate P -intervals L 0 = { ( 0 , ∞ ), ( 0 , 1 ), ( 1 , 1 ), ( 1 , 2 ) } and L 1 = { ( 2 , 4 ), ( 3 , 5 ) } , respectively.”
Citations
Cites
Elements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,102
Gromov, M. (1987) · Mathematical Sciences Research Institute Publications · doi:10.1007/978-1-4613-9586-7_3 · Cited by 1,817
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Eisenbud, D. (1995) · Graduate texts in mathematics · doi:10.1007/978-1-4612-5350-1 · Cited by 1,739
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
Topological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337
Self-citationPERSISTENCE BARCODES FOR SHAPES
CARLSSON, G., ZOMORODIAN, A., COLLINS, A., & GUIBAS, L. J. (2005) · International Journal of Shape Modeling · doi:10.1142/s0218654305000761 · Cited by 287
Self-citationPersistence barcodes for shapes
Carlsson, G., Zomorodian, A., Collins, A., & Guibas, L. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057449 · Cited by 133
Self-citationA barcode shape descriptor for curve point cloud data
Collins, A., Zomorodian, A., Carlsson, G., & Guibas, L. J. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.015 · Cited by 132
Self-citationOn Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets
Basu, S. (1999) · Discrete & Computational Geometry · doi:10.1007/pl00009443 · Cited by 110
Research works printed but not linked: 2
- [6]6. Cox, D., Little, J., and O'Shea, D. Ideals , Varieties , and Algorithms , second edn. Springer-Verlag, New York, 1991.
- [10]10. Dummit, D., and Foote, R. Abstract Algebra . Wiley, New York, 1999.
Cited by
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302
Self-citationNetworks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
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
Stability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J., & Petri, G. (2020) · UCL Discovery (University College London) · Cited by 1,179
Metadata
- Authors
- Zomorodian, A., & Carlsson, G.
- Affiliations
- Stanford University (US)
- Corresponding author
- Zomorodian, Afra
- Carlsson, Gunnar
- ORCID
- Carlsson, Gunnar
- Venue
- Discrete & Computational Geometry
- Published
- 2004-11-19
- Volume
- 33
- Issue
- 2
- Pages
- 249-274
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W2144044408
- Cited by
- 1,591
- References
- 19
- Citations by year
- 2026: 89 · 2025: 114 · 2024: 106 · 2023: 116 · 2022: 122 · 2021: 173 · 2020: 134 · 2019: 141 · 2018: 103 · 2017: 62 · 2016: 76 · 2015: 51 · 2014: 55 · 2013: 42 · 2012: 45
- FWCI
- 10.87
- 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 (0138456, 0086013, 0101364)
- University of Chicago
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- persistent homology, simplicial complexes, filtered simplicial complexes, graded modules, polynomial rings, homology computation, principal ideal domains, computational topology
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: Computing Persistent Homology. https://app.cochat.ai/papers/10.1007/s00454-004-1146-y
- The paper
- Zomorodian, A., & Carlsson, G. (2005). Computing Persistent Homology. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-004-1146-y
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.