I've been convinced that the homology groups you get when computing the persistent homology of a data cloud have to be free. But now I'm second guessing myself. Can we quickly say why this has to be? It's not just because it's the homology of a simplicial complex, because those can have torsion.
2026-05-10 14:30:43.1778423443
Persistent homology has to be free, right?
237 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ALGEBRAIC-TOPOLOGY
- How to compute homology group of $S^1 \times S^n$
- the degree of a map from $S^2$ to $S^2$
- Show $f$ and $g$ are both homeomorphism mapping of $T^2$ but $f$ is not homotopy equivalent with $g.$
- Chain homotopy on linear chains: confusion from Hatcher's book
- Compute Thom and Euler class
- Are these cycles boundaries?
- a problem related with path lifting property
- Bott and Tu exercise 6.5 - Reducing the structure group of a vector bundle to $O(n)$
- Cohomology groups of a torus minus a finite number of disjoint open disks
- CW-structure on $S^n$ and orientations
Related Questions in HOMOLOGY-COHOMOLOGY
- Are these cycles boundaries?
- Cohomology groups of a torus minus a finite number of disjoint open disks
- $f$ - odd implies $d(f)$ - odd, question to the proof
- Poincarè duals in complex projective space and homotopy
- understanding proof of excision theorem
- proof of excision theorem: commutativity of a diagram
- exact sequence of reduced homology groups
- Doubts about computation of the homology of $\Bbb RP^2$ in Vick's *Homology Theory*
- the quotien space of $ S^1\times S^1$
- Rational points on conics over fields of dimension 1
Related Questions in SIMPLICIAL-COMPLEX
- What is the intersection of the vertices of a face of a simplicial complex?
- Simplicial complex underlying space homeomorphic to torus/klein bottle
- Fixed points of simplicial maps
- Homotopy type of simplicial complexes
- Non-contractible simplicial complex and Euler characteristic 1
- Persistence Homology on a grid Distance measure
- Finding chains with a given boundary
- Is there a time where the link of a subset is not equal to the boundary of its star?
- Edge-to-edge incidence structure of a graph
- Triangulation of the projective plane (number of points required)
Related Questions in TOPOLOGICAL-DATA-ANALYSIS
- Persistence Homology on a grid Distance measure
- Computing natural pseudo distance.
- Understanding the last step in computing persistent homology
- matrix columns represented by binary search tree
- TDA- Persistence Diagram and Barcodes using image data (and TDA R package)
- Are the results from persistent homology complete?
- Original source of the persistence algorithm?
- bottle neck distance: distance to diagonal points
- computing wasserstein distance vs. bottleneck distance between persistence diagrams
- Topological Data Analysis
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
geometry
circles
algebraic-number-theory
functions
real-analysis
elementary-set-theory
proof-verification
proof-writing
number-theory
elementary-number-theory
puzzle
game-theory
calculus
multivariable-calculus
partial-derivative
complex-analysis
logic
set-theory
second-order-logic
homotopy-theory
winding-number
ordinary-differential-equations
numerical-methods
derivatives
integration
definite-integrals
probability
limits
sequences-and-series
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Here are a couple of different possible takes on the question.
Persistent homology is essentially always computed with coefficients in a field. And homology with coefficients in a field is always a vector space. But this is an incomplete answer for several reasons.
Equation (5) of Computing Persistent Homology explains how when persistent homology is computed over a field $F$, then the persistence module decomposes as a sum $$ \left(\bigoplus_{i=1}^n \Sigma^{\alpha_i} F[t]\right) \oplus\left( \bigoplus_{j=1}^m \Sigma^{\gamma_j} F[t]/(t^{n_j})\right). $$ From this you can read off the persistent homology barcode: you have $n$ semi-infinite intervals of the form $[\alpha_i,\infty)$, and $m$ finite intervals of the form $[\gamma_j,\gamma_j+n_j)$. Note that the semi-infinite intervals correspond to free summands $F[t]$ (shifted forwards in time by $\alpha_i$), whereas the finite intervals correspond to torsion summands $F[t]/(t^{n_j})$ (shifted forwards in time by $\gamma_j$). So in this sense, every finite-length bar in persistent homology exhibits torsion "in time."
But probably you are looking for torsion in space more than torsion in time. Vietoris-Rips and Čech simplicial complexes can certainly have torsion in them. As @MaximeRamzi and @JasonDeVito explain, take any non-orientable manifold you want, embed it in some high-dimensional Euclidean space, sample data points finely on this manifold, and then the Vietoris-Rips or Čech complex on this data (at appropriate scale parameters) will exhibit the torsion of this manifold.
Another way to see this is as follows. Take any simplicial complex $K$, say one with lots of torsion. The barycentric subdivision $sd(K)$ is a clique (or flag) simplicial complex. The one-skeleton of this barycentric subdivision $sd(K)$ is a graph, $sd(K)^{(1)}$. Let $X=V(sd(K)^{(1)})$ be the metric space whose set of points is the vertex set of this graph $sd(K)^{(1)}$, equipped with the shortest path metric in the graph. If you build the Vietoris-Rips complex on $X$ at scale parameter 1, then you see that you obtain $VR(X;1)=sd(K)$ as a Vietoris-Rips complex of a metric space. Since $sd(K)$ is homeomorphic to our original simplicial complex $K$, we see that we can realize the torsion of any simplicial complex as the torsion of some Vietoris-Rips complex.
There is active research on trying to do persistent homology with coefficients instead in the integers, which would allow this "torsion in space" to be measured even from the lens of persistent homology. See for example Generalized Persistence Diagrams.