Teaching / Errata
Errata
Corrections to the textbook Introduction to Persistent Homology (2022). All of them are incorporated in the current version 1.09.
- p. 11When defining d_p metric in the last line of the page, the parentheses should be replaced by the absolute value.Thanks to DF for pointing it out.
- p. 12"The underlying space can be different that Rn" should be "The underlying space can be different than Rn".Thanks to RS for pointing it out.
- p. 14“(0,0,\ldots, n)” should be “(0,0,\ldots, 0)”.Thanks to AJ for pointing it out.
- p. 26At the beginning of the proof of Proposition 2.5.4(2), “abc” should be “xyz”.Thanks to AJ for pointing it out.
- p. 27 and 30The bottom right entry in the 3 x 3 matrix should be “z_2” instead of “y_2”.Thanks to JW and AJ for pointing it out.
- p. 48Definition 4.1.1 introducing manifolds should assume X is a subset of a Euclidean space. Even with this update, the definition is slightly more restrictive than the standard definition, although it is essentially equivalent for the case of surfaces. The technical details are discussed in versions 1.02 and higher.Thanks to DF for pointing it out.
- p. 54In the side note we obtain Euler characteristic 0 for the torus and the Klein bottle, instead of 2.Thanks to AJ for pointing it out.
- p. 73“\Delta_{U_2}” should be “\Delta_{U_k}” at the ends of two lists.Thanks to AJ for pointing it out.
- p. 76The “denominator” should be “p \mathbb{Z}” instead of “\mathbb{Z}_p”.Thanks to AJ for pointing it out.
- p. 80Conclusion 2. in Proposition 6.2.3 should be “dim(V/U) = dim (V) - dim(U)”, instead of “dim(U)- dim(V)”.Thanks to PT, MŠ and AJ for pointing it out.
- p. 80In the proof of Proposition 6.2.3, B_2 is a basis of “V/U” instead of “U/V”. Likewise, “V/U” should be “U/V” in footnote 24.Thanks to DZM and MZM for pointing it out.
- p. 82In Definition 6.3.2. we should have “f(a+b)=f(a)+f(b)” instead of “f(a+b)=a(a)+b(b)”.Thanks to DZM for pointing it out.
- p. 82In Sidenote 31, in the definition of (n\cdot a), the dots between the copies of (a) on the right-hand side should be plus signs: “n\cdot a=a+a+\dots+a”.Thanks to MZM for pointing it out.
- p. 87“from t” should be “front”, twice. [Thanks to AJ for pointing it out.] “simplez” should be “simplex” twice.Thanks to DZM for pointing it out.
- p. 87In the sidenote marked with a warning triangle, the composition at the end should be “(\partial_{p-1}\circ\partial_p)”, rather than “(\partial_p\circ\partial_{p-1})”.Thanks to MZM for pointing it out.
- p. 91-92Homology of a graph: Item 5 contains “(e_{n+1},e_{n+1},\dots,e_m)”, which should be “(e_{n+1},e_{n+2},\dots,e_m)”. Similarly, in item 6 and both occurrences in item 8, “({n+1,n+1,\dots,m})” should be “({n+1,n+2,\dots,m})”.Thanks to MZM for pointing it out.
- p. 95When discussing Dimension 1, “\partial_1” of case 2. should be “\partial_2”, and “\partial_0” of case 3. should be “\partial_1”.Thanks to JP for pointing it out.
- p. 96When discussing incremental expansion, items 2. and 3. should start with a condition on whether \partial \sigma is contained in the Image of \partial_n, instead of the kernel. In particular, item 2. should start with “If chain $\partial \sigma$ is already contained in $Im \partial_n$”, while item 2. should start with “If chain $\partial \sigma$ is not in $Im \partial_n$”.Thanks to EF for pointing it out.
- p. 99“meaning that α is a chain” should be “meaning that α is a cycle”.Thanks to AJ for pointing it out.
- p. 100“H_2” should be “H_1”.Thanks to AJ for pointing it out.
- p. 102“{1,2,...,n−1}” should be “{1,2,...,n−2}”, twice.Thanks to AJ for pointing it out.
- p. 103“satisfying \partial^2” should be “satisfying \partial^2 = 0”.Thanks to AJ for pointing it out.
- p. 112Figure 8.5 mysteriously disappeared during the processing of PDF. The page with the figure is provided here.
- p. 113Theorem 8.1.6 should state “The sphere S^n admits a non-vanishing tangent field iff n is odd”.Thanks to MŠ for pointing it out.
- p. 114In Definition 8.2.1, term “ker f_n” should be “ker \varphi_n”.Thanks to MŠ for pointing it out.
- p. 124Sidenote 9: “…contains more information THAT persistent Betti numbers…” should read “…contains more information THAN persistent Betti numbers…”.Thanks to MZM for pointing it out.
- p. 126y-coordinates “k” and “k+1” should be “m” and “m+1”.Thanks to AJ for pointing it out.
- p. 132, 333When discussing a computational trick there is a minor error. If \tau is a terminal q-simplex, then the corresponding row in M'_{q+1} is pivot-free (and not necessarily trivial, as is stated). This affects item 1. on p. 132, the sidenote on p. 133, and a sentence on p.133.Thanks to KT for pointing it out.
- p. 143Definition 10.2.6: In the final sentence, “…for which the filtrations are (\varepsilon)-interleaved” should read “…for which the persistence modules are (\varepsilon)-interleaved”.Thanks to MZM for pointing it out.
- p. 144“d_H(A,B)=max{r_A, r_B}” should be “d_H(A,B)=min{r_A, r_B}”.Thanks to AJ for pointing it out.
- p. 148, 151, 152Whean treating the stability via Cech complexes, the assumptions should pertain to the Hausdorff distance instead of the Gromov-Hausdorff distance (just to keep things simple as we haven't defined the intrinsic Cech complexes). This is now corrected in Proposition 10.2.9 on p. 148, Theorem 10.3.4 on p.151, and in the diagram on p. 152.
- p. 155 and 156The interleaving distance epsilon should be “max{|p-p'|, |q-q'|}, instead of ``max{|p-q|, |p'-q'|}” in all 5 instances.Thanks to XY for pointing it out.
- p. 158Caption of 11.2 should contain “along” instead of “alone”.Thanks to AF for pointing it out.
- p. 159In the statement of Proposition 11.2.2, “either” should be “we have”.Thanks to DZM for pointing it out.
- p. 162In Definition 11.3.2 it would be better to change the enumerated orientability conditions to “1. does not match \sigma_{j}, and 2. matches \sigma_{j+1}”. This change in matching does not change the homology, but makes the obtained p-paths more geometrically intuitive and consistent with the use in Example 11.3.8, where < e > → < e, a > ≥ < a > is an oriented 1-path. In the previous definition, an oriented path would be < e > → < a, e > ≥ < a >.Thanks to KT for pointing it out.
Also, a big thanks to AJ for pointing out many minor typos!