← Lecture 6 · Lecture 8 →

In this lecture (22 January): GENEOs, Group Equivariant Non-Expansive Operators

Motivation: data and observers

A neural network is a black box with many parameters: data go in, answers come out, and it is hard to explain why. GENEOs aim at explainable networks, built from operators with a precise mathematical meaning and with the symmetries of the problem built in.

Main point: the data are not so important by themselves; what matters is the pair (data, observer). An observer is described by

  • the set of measurements it can produce (its “instruments”);
  • the group of transformations it considers irrelevant (with respect to which it is equivariant).

This is the perception pair of Lecture 5. Examples: functions on a grid with translations, functions on a ring or disk with rotations, functions on manifolds with their symmetries. Here we stay in the simplicial setting: is a set of functions on a complex and .

Elements of the group are isometries

Recall (distance between vertices, as seen by the instruments).

Proposition 41

Every is an isometry with respect to :

Recall also

two transformations are different only if some measurement reveals a difference between them, and then that is good enough to separate them.

Proposition – If is a metric, then is a metric

Exchanging the two sups,

If , then for every vertex , so (since is a metric), and therefore : an isomorphism is determined by what it does on the vertices.

GEOs and GENEOs

Let and be two perception pairs. The functions in and can live on different complexes and the groups can be different.

Definition – GEO (Group Equivariant Operator)

A pair with

  1. ,
  2. a group homomorphism (),

is a GEO from to if

Transforming the input by and then applying is the same as applying and then transforming the output by the corresponding .

Typo in the handwritten notes

The notes write ; the correct right-hand side is . acts on functions, not on group elements.

Definition – GENEO

A GEO is a GENEO (Group Equivariant Non-Expansive Operator) if is non-expansive:

The images are at most as far apart as .

Example: from the hexagon to the triangle

  • : is the hexagon with vertices , (all functions on its vertices), = the rotations by multiples of , with (indices mod 6).
  • : is the triangle with vertices , , = the rotations by multiples of , with (indices mod 3).
  • , : rotating the hexagon by corresponds to rotating the triangle by . It is a homomorphism, since . It is not injective: the half-turn goes to .
  • with

the average of each pair of opposite vertices of the hexagon (the coloured ellipses).

With the values in the picture, , we get , , .

GENEOs in topological settings, invariance

Example: is a point cloud and takes its convex hull. Rotating the cloud and then taking the hull gives the same result as taking the hull and then rotating it: is equivariant with respect to rotations, with the identity. It is also non-expansive for the Hausdorff distance between sets.

Invariance is a special case of equivariance

If we want to model invariance instead of equivariance, it suffices to take the trivial homomorphism for all ( is the identity of the domain of the functions in ). Then

the output does not change at all when the input is transformed. Persistence () is an invariant, non-expansive operator of this kind: the persistence diagram is a trivial GENEO.

GENEOs and the natural pseudo-distance

Proposition

If is a GENEO (so ), then

GENEOs are non-expansive also with respect to the natural pseudo-distances.

The space of GENEOs: compactness and convexity

Fix and let be the set of all maps such that is a GENEO from to . We measure distances between operators by

Theorem – Compactness

If and are compact, then is compact with respect to .

When input and output are compact, the space of “agents” (observers) is compact too. In practice, for every finitely many GENEOs approximate all of them within , so the space can be explored and sampled. Compare with neural networks, whose parameter spaces are not compact. (The proof is a diagonal argument; see Frosini et al., Theorem 12.)

Theorem – Combinations of GENEOs

Let be GENEOs from to and with . If maps into , then is a GENEO.

Convexity. With , , , : if is convex, then maps into , so is convex.

Why we care: suppose an expert (e.g. a dermatologist classifying skin lesions) is the observer we want to imitate. Inside the compact and convex space of GENEOs we can look for the GENEO closest to , e.g. by optimising over convex combinations of a finite set of GENEOs. The problem is well posed: compactness gives existence and finite approximations, convexity gives a nice search space.

“GENEOs looking at GENEOs”: an observer is itself an object that other operators can observe and compare.

Comparing data through GENEOs and persistence

Let and let be a set of GENEOs (a set of observers).

Definition – Pseudo-metrics induced by a family of GENEOs

In the second one, each observer first transforms the data, then we compare the persistence diagrams (in degree ) of the results.

Stability

by the stability theorem of persistence and the non-expansivity of each . Moreover .

The invariance of is decided by the chosen operators . Persistent homology alone is invariant under every isomorphism (Lecture 6), which is often too much. Composing with -equivariant GENEOs we get a pseudo-metric that is strongly -invariant, for , but is no longer forced to ignore every other isomorphism: how much it sees depends on the choice of . And it is still cheap to compute (finitely many bottleneck distances).

Extra: GENEOs + persistence recover the natural pseudo-distance

From Frosini et al. (Ch. 5, Theorem 15 and Corollary 13): under mild assumptions on (non-negative functions, containing the needed constant functions, and of the domain non-zero), if is the set of all GENEOs from to itself (with ), then

and by compactness a finite set of GENEOs approximates within any . So the natural pseudo-distance, the “ground truth” that is hard to compute directly, can be approximated by persistence diagrams of data seen through finitely many GENEOs.

Recap

  • Perception pair = the observer: measurements plus equivalences. Every is a -isometry (Prop. 41); if is a metric, so is .
  • GEO: with a homomorphism. GENEO: in addition .
  • Trivial gives invariant operators (e.g. persistence diagrams).
  • GENEOs are non-expansive for natural pseudo-distances: .
  • compact the space of GENEOs is compact. Combinations with are GENEOs, and convex the space is convex.
  • and , with equality when contains all GENEOs.

References

  • M. G. Bergomi, P. Frosini, D. Giorgi, N. Quercioli, Towards a topological–geometrical theory of group equivariant non-expansive operators for data analysis and machine learning, Nature Machine Intelligence 1 (2019), 423–433, arXiv:1812.11832.
  • P. Frosini, U. Fugacci, N. Quercioli, F. Tombari, Persistent Homology and Equivariance in Data Analysis: A Topological Introduction, arXiv:2606.21084 (2026), Ch. 5: perception pairs, natural pseudo-distance, GENEOs, compactness and convexity, persistence-induced pseudo-metrics.

Handwritten source: tdafull.pdf, page 7