In this lecture (17 January in the handwritten notes)
- The setting: functions on , isomorphisms, , simplicial perception pairs
- Three pseudo-metrics: , ,
- The natural pseudo-distance and its properties
- Choosing the level of analysis: a first look at a persistence diagram
- Sublevel complexes and filtrations
- Persistence modules, persistent homology groups, persistent Betti numbers
What we need for the natural pseudo-distance
Four ingredients.
① Functions on a complex. A geometric simplicial complex and functions , extended to by
(see Lecture 4). E.g. a triangle with , gets . The set of these functions is our set of measurements: .
② The isomorphisms of . is the set of bijections with
③ The isomorphisms that preserve the measurements. is the set of such that and for every . It is a group.
Example – the hexagon
is a hexagon triangulated from its centre , with boundary vertices and triangles . consists of the 12 symmetries of the hexagon: the rotations of and the reflections across its symmetry axes. They all fix the centre (), the only vertex belonging to 6 edges.
Whether a symmetry belongs to depends on :
- if contains only the function with and , every symmetry leaves it unchanged, so ;
- if contains only a function with different values on , every non-trivial symmetry changes it into a function that is not in , so .
If (all possible functions on the vertices), every isomorphism preserves and . The smaller (more structured) is, the fewer isomorphisms survive. describes the observer.
④ The group we work with.
Definition – Simplicial perception pair
A pair where is a set of functions on (built as in ①) and is a subgroup is a (simplicial) perception pair. For every and we have and .
contains the transformations we want to consider irrelevant (rotations, renamings, …), and we can choose it smaller than .
Three pseudo-metrics
Let . Everything is measured through the instruments , not with the Euclidean metric of the space where is drawn.
Definition – , ,
- On the vertices (distance between points):
Two vertices are far apart iff some measurement distinguishes them well.
2. On the group (distance between transformations):
- On the space of signals :
- They are pseudo-metrics: if no instrument can tell and apart, even when .
- In 3, taking the max over the vertices or over all simplices gives the same value: , and vertices are simplices.
- The action of any preserves all three: (composing with a bijection of the vertices only reorders the values), (proved in Lecture 7), and . The key fact is that is a bijection of onto itself.
The natural pseudo-distance
We do not want to compare and as they are, but up to the transformations in : try every alignment of and keep the best.
Definition – Natural pseudo-distance
For a perception pair and :
(Here is finite, so the minimum exists; in general it is an infimum.)
Two copies of the letter A, one of them rotated: their sup-distance is large, but after applying the right rotation they match, so is small (zero if they are identical up to rotation).
Proposition – is a pseudo-metric
For all : , and .
Proof
We use two facts: for any bijection (composing with a bijection only reorders the values), and is a bijection of .
- .
- Symmetry:
- Triangle inequality: for every ,
Minimise over (as varies, covers all of ) and then over .
Example – distance zero between different functions
is a segment , with swapping and . Let , and , . Then , so and , although . So is a pseudo-metric, not a metric.
It is very useful for time series: two signals with the same pattern, one shifted in time, are far in the sup-norm but close for , where is a group of time translations.
Properties of
- Enlarging the group does not increase the distance: if then
where the last term is . A bigger group gives more ways to align the data. Going from to , the distance can only decrease.
2. Strong invariance: for all ,Proof: , and ranges over all of as does.
is the “ground truth” for comparing data up to , but it is hard to compute: we must optimise over the whole group. Persistent homology gives computable lower bounds for it (Lecture 6).
Choosing the level of analysis
What counts as “the same” depends on the observer and on the level of detail we care about: two sponges look alike at a coarse level and very different in the details. A noisy function (blue) and its coarse, smooth version (orange) differ only in the details.
The persistence diagram on the right is a preview of Lecture 6:
- the diagonal is treated as a single abstract point with infinite multiplicity (it lets us match a point with “nothing”);
- a point at (a half-line going to infinity) means a connected component that never dies;
- the circled point, far from the diagonal, describes the main behaviour of the function (the big bump);
- the points close to the diagonal are the small details or noise. The closer a point is to the diagonal, the smaller the detail it describes.
Sublevel complexes and filtrations
Let be the max-extension of some . For every :
Definition – Sublevel complex
It is a subcomplex of : faces have smaller or equal values. If , then , so the family is a filtration of .
As grows, simplices enter: first the vertices with small values, then the edges and triangles whose vertices are all present. The sequence of complexes gives a sequence of homology groups , and we want to follow how they change.
Persistence modules and persistent homology groups
Definition – Persistence module
A family of vector spaces with linear maps for such that
- functoriality: for ;
- identity: .
Our persistence module is . For the inclusion () induces a linear map
i.e. we take a -cycle and look at it as a cycle of the bigger complex . It is well defined: a cycle is still a cycle in , and a boundary is still a boundary. Functoriality holds: .
is in general not injective
A cycle that is a hole in can become a boundary in if the triangles filling it enter between and . Then but .
Definition – Persistent homology group
For :
is the persistent homology group of computed at . It contains the -holes that already exist at level and are still alive at level .
What does it mean? Follow a cycle through the filtration:
- : no cycle yet.
- : the homology group changes, a cycle closes and a class is born: it is in but not in the image of .
- : some triangles enter, but the hole is still there (represented by a different, smaller cycle). is an isomorphism on this class.
- : the hole is completely filled, becomes a boundary and the class dies: .
Definition – Persistent Betti number function (rank invariant)
the number of independent -holes born at or before and still alive at . It is the persistent Betti number function of in degree .
Its properties, and the persistence diagram that summarises it, are the subject of Lecture 6.
Recap
- Simplicial perception pair : measurements on (max-extensions) and a group of isomorphisms preserving .
- , , : pseudo-metrics defined through the measurements, preserved by .
- : a pseudo-metric, non-increasing in , strongly -invariant, hard to compute.
- is a filtration. Inclusions induce on homology, and contains the holes born by and still alive at . .
References
- P. Frosini, U. Fugacci, N. Quercioli, F. Tombari, Persistent Homology and Equivariance in Data Analysis: A Topological Introduction, arXiv:2606.21084 (2026): Ch. 3 (persistent homology groups, persistent Betti numbers) and Ch. 5 (perception pairs, natural pseudo-distance), stated there for continuous functions on topological spaces.
Handwritten source: tdafull.pdf, page 5