How Many Directions Determine a Shape and other Sufficiency Results for Two Topological Transforms

By Justin Curry, Sayan Mukherjee, and Katharine Turner

Abstract

In this paper we consider two topological transforms that are popular in applied topology: the Persistent Homology Transform and the Euler Characteristic Transform. Both of these transforms are of interest for their mathematical properties as well as their applications to science and engineering, because they provide a way of summarizing shapes in a topological, yet quantitative, way. Both transforms take a shape, viewed as a tame subset of , and associates to each direction a shape summary obtained by scanning in the direction . These shape summaries are either persistence diagrams or piecewise constant integer-valued functions called Euler curves. By using an inversion theorem of Schapira, we show that both transforms are injective on the space of shapes, i.e. each shape has a unique transform. Moreover, we prove that these transforms determine continuous maps from the sphere to the space of persistence diagrams, equipped with any Wasserstein -distance, or the space of Euler curves, equipped with certain norms. By making use of a stratified space structure on the sphere, induced by hyperplane divisions, we prove additional uniqueness results in terms of distributions on the space of Euler curves. Finally, our main result proves that any shape in a certain uncountable space of PL embedded shapes with plausible geometric bounds can be uniquely determined using only finitely many directions.

1. Introduction

In this paper we consider two topological transforms that are of theoretical and practical interest: the Euler Characteristic Transform (ECT) and the Persistent Homology Transform (PHT). At a high level both of these transforms take a shape, viewed as a subset of , and associates to each direction a shape summary obtained by scanning in the direction . This process of scanning has a Morse-theoretic and persistent-topological flavor—we study the topology of the sublevel sets of the height function as the height varies. These evolving sublevel sets are summarized using either the Euler Curve, which records the Euler characteristic of each sublevel set, or the persistence diagram, which pairs critical values of in a computational way. In short, the ECT and the PHT are transforms that associate to any sufficiently tame subset a map from the sphere to the space of Euler curves and persistence diagrams, respectively.

Before introducing the mathematical properties of these transforms, as well as the results proved in this paper, we point out some of the applications of interest. In both data science and computational geometry, quantifying differences in shape is a difficult problem. Part of the problem is structural: most statistical analyses operate on scalar-valued quantities, and it is very hard to summarize shape with a single number. To address this, Euler curves and persistence diagrams are slightly more complicated summary objects endowed with metrics amenable to detecting qualitative and quantitative differences in shape. To wit, in Reference 20 the PHT was introduced and applied to the study of heel bones from primates. By quantifying the shapes of these heel bones and clustering these using certain metrics on persistence diagrams, the authors of that paper were able to automatically differentiate species of primates using quantified differences in phylogenetic expression of heel bone shape. A variant on the Euler Characteristic Transform was also used in Reference 8 to predict clinical outcomes of brain tumors based on their shape. Here the applicability of topological methods is particularly compelling: aggressive tumors tend to grow “roots” that invade nearby tissues and these protrusions are often well-detected by changes in the Euler curves.

Of course, in each of these applications, one may wonder: To what extent are these shape summaries lossy? Topological invariants such as Euler characteristic and homology are obviously not faithful; there are non-homeomorphic spaces that appear to be identical when using these particular lenses for viewing shape. The surprising fact developed in Reference 18Reference 20 and carried further in this paper and independently in Reference 12 is that by considering the Euler curve for every possible direction one can completely recover a shape. Said differently, the Euler Characteristic Transform is a statistic that is sufficient to summarize compact, definable subsets of , see Theorem 3.5. Moreover, since homology determines Euler characteristic via an alternating sum of Betti numbers, we obtain injectivity results for the PHT as well, see Theorem 4.16.

The choice of our class of shapes is an important variable throughout the paper. We use “constructible sets” at first, these are compact subsets of that can be constructed with finitely many geometric and logical operations. The theory for carving out this collection of sets comes from logic and the study of o-minimal/definable structures, as they provide a way of banishing shapes that are considered “too wild.” One key property of working in this setting is that every constructible set can be triangulated. This is the natural setting for Schapira’s inversion result Reference 18, which is the engine that drives many of the results in our paper, specifically Theorems 3.5 and 4.16, and independently Theorem 5 and Corollary 6 in Reference 12.

An additional reason to consider o-minimal sets is that they are naturally stratified into manifold pieces. This is important because it implies that the constructions that underly the ECT and PHT are also stratified, and that both of these two transforms can be described in terms of constructible sheaves. The upshot of this observation, which is developed in Section 5, is that the ECT of a particular shape should be determined, in some sense, by finitely many directions, certainly if is known in advance. Indeed, any o-minimal set induces a stratification of the sphere of directions, and whenever we restrict to a particular stratum the variation of the transform can be described by homeomorphisms of the real line. To make precise how to relate the transform for two different directions in a fixed stratum, we specialize to the case where is a piecewise linearly (PL) embedded simplicial complex. This allows us to provide an explicit formula for the ECT and construct explicit linear relations for both transforms whenever two directions lie in the same stratum. This is the content of Lemma 5.19 and Proposition 5.21.

By considering a “generic” class of PL embedded simplicial complexes, we leverage the explicit formula for the Euler Characteristic Transform to produce a new measure-theoretic perspective on shapes. In Theorem 6.7 we prove that by considering the pushforward of the Lebesgue measure on into the space of Euler curves (or persistence diagrams) one can uniquely determine a generic embedded simplicial complex up to rotation and reflection, i.e. an element of . The importance of this result for applications is that one can faithfully compare two un-aligned shapes simply by studying their associated distribution of Euler curves or persistence diagrams.

Finally, we extend the themes of stratification theory and injectivity results to answer our titular question, which is perhaps more accurately worded as “How many directions are needed to infer a shape?” Here the idea is that there is a shape hidden from view, perhaps cloaked by our sphere of directions, and we would like to learn as much about the shape as possible. Our mode of interrogation is that we can specify a direction and an oracle will tell us the Euler curve of the shape when viewed in that direction. Of course, by our earlier injectivity result, Theorem 3.5, we know that if we query all possible directions, then we can uniquely determine any constructible shape. However, a natural question of theoretical and practical importance is whether finitely many queries suffice. The main result of our paper, Theorem 7.14, shows that if we impose some a priori assumptions on our (uncountable) set of possible shapes, then finitely many queries indeed do suffice. However, unlike the popular parlor game Twenty Questions, the number of questions/directions we might need to infer our hidden shape is only bounded by

The parameters above reflect a priori geometric assumptions that we make about our hidden shape. Specifically, we assume our shape is well modeled as a geometric simplicial complex embedded in , with a lower bound on the “curvature” at every vertex, and a uniform upper bound on the number of critical values when viewed in any given -ball of directions. We call this class of shapes . Moreover, the two terms in the above sum are best understood as a two step interrogation procedure. The first term counts the number of directions that we’d sample the ECT at for any shape. The second term in the above sum counts the maximum number of questions we might ask, adapted to the answers given in the first round of questions.

2. Background on Euler calculus

Often in geometry and topology we require that our sets and maps have certain tameness properties. These tameness properties are exhibited by the following categories: piecewise linear, semialgebraic, and subanalytic sets and mappings. Logicians have generalized and abstracted these categories into the notion of an o-minimal structure Reference 22, which we now define.

Definition 2.1.

An o-minimal structure specifies for each , a collection of subsets of closed under intersection and complement. These collections are related to each other by the following rules:

(1)

If , then and are both in ; and

(2)

If , then where is axis-aligned projection.

We further require that be closed with respect to all the operations of that make it an ordered field, i.e. comparison , addition and multiplication , and that contain no more and no less than all finite unions of points and open intervals in . Elements of are called tame or definable sets. Our assumptions guarantee that every semialgebraic set is definable Reference 22, Ch. 2, 2.11. A definable map is one whose graph is definable. We define a constructible set as a compact definable subset of and denote the set of all constructible subsets of by .

Remark 2.2.

Our assumptions include more than is strictly required by van den Dries’s notion of an o-minimal structure, which is defined in Reference 22, Ch. 1, 2.1, in order to contain the sets we are most interested in, i.e. semialgebraic sets and their generalizations. What we have specified in Definition 2.1 is more accurately called the o-minimal structure generated by the ordered field with parameters/constants in , cf. Reference 22, Ch. 1, §5. As van den Dries describes in Reference 22, Ch. 1, 5.1 and proves in Reference 22, Ch. 2, 2.11 our notion of an o-minimal structure contains the collection of semialgebraic sets.

The advantage of o-minimal structures is that one can consider expansions of the collection of semialgebraic sets to include a restricted class of analytic functions, such as the square root function, without sacrificing desired tameness properties. Further expansions include a notion of exponentiation and the Pfaffian, which by Wilkie’s theorem provides a model-complete theory Reference 28.

Tame/definable sets play the role of measurable sets for an integration theory based on Euler characteristic called The Euler Calculus, see Reference 10 for an expository review. The guarantee that definable sets can be measured by Euler characteristic is by virtue of Theorem 2.3.

Theorem 2.3 (Triangulation Theorem Reference 22).

Any tame set admits a definable bijection with a subcollection of open simplices in the geometric realization of a finite Euclidean simplicial complex. Moreover, this bijection can be made to respect a partition of a tame set into tame subsets.

In view of the Triangulation Theorem, one can define the Euler characteristic of a tame set in terms of an alternating count of the number of simplices used in a definable triangulation.

Definition 2.4.

If is tame and is a definable bijection with a collection of open simplices, then the definable Euler characteristic of is

where denotes the dimension of the open simplex . We understand that since this corresponds to the empty sum.

As one might expect, the definable Euler characteristic does not depend on a particular choice of triangulation Reference 22, pp.70-71, as it is a definable homeomorphism invariant. However, as the next example shows, the definable Euler characteristic is not a homotopy invariant.

Example 2.5.

The definable Euler characteristic of the open unit interval is . Note that is contractible to a point, which has definable Euler characteristic . The reader might notice that these computations coincide with the compactly-supported Euler characteristic, which can be defined in terms of the ranks of compactly-supported cohomology or Borel-Moore homology groups. However, this equivalence only makes sense for locally compact sets and not all o-minimal sets are locally compact.

Remark 2.6.

We will often drop the prefix “definable” and simply refer to “the Euler characteristic” of a definable set.

The definable Euler characteristic satisfies the inclusion-exclusion rule:

Proposition 2.7 (Reference 22 p.71).

For tame subsets we have

Consequently, the definable Euler characteristic specifies a valuation on any o-minimal structure, i.e. it serves the role of a measure without the requirement that sets be assigned a non-negative value. This allows us to develop an integration theory called Euler calculus that is well-defined for so-called constructible functions, which we now define.

Definition 2.8.

A constructible function is an integer-valued function on a tame set with the property that every level set is tame and only finitely many level sets are non-empty. The set of constructible functions with domain , denoted , is closed under pointwise addition and multiplication, thereby making into a ring.

Definition 2.9.

The Euler integral of a constructible function is the sum of the Euler characteristics of each of its level sets, i.e.

Note that constructibility of implies that only finitely many of the are non-empty so this sum is well-defined.

Like any good calculus, there is an accompanying suite of canonical operations in this theory—pullback, pushforward, convolution, etc.

Definition 2.10.

Let be a tame mapping between between definable sets. Let be a constructible function on . The pullback of along is defined pointwise by

The pullback operation defines a ring homomorphism .

The dual operation of pushing forward a constructible function along a tame map is given by integrating along the fibers.

Definition 2.11.

The pushforward of a constructible function along a tame map is given by

This defines a group homomorphism .

Putting these two operations together allows one to define our first topological transform: the Radon transform.

Definition 2.12.

Suppose is a locally closed definable subset of the product of two definable sets. Let and denote the projections from the product onto the indicated factors. The Radon transform with respect to is the group homomorphism that takes a constructible function on , , pulls it back to the product space , multiplies by the indicator function of before pushing forward to . In equational form, the Radon transform is

The following inversion theorem of Schapira Reference 18 gives a topological criterion for the invertibility of the transform in terms of the subset .

Theorem 2.13 (Reference 18 Theorem 3.1).

If and have fibers and in satisfying

(1)

for all , and

(2)

for all ,

then for all ,

In the next section we show how to use Schapira’s result to deduce the injectivity properties of the Euler Characteristic and Persistent Homology Transforms.

3. Injectivity of the Euler characteristic transform

In the previous section we introduced background on definable sets, constructible functions and the Radon transform. We now specialize this material to the study of persistent-type topological transforms on definable subsets of . What makes these transforms “persistent” is that they study the evolution of topological invariants with respect to a real parameter. In this section we begin with the simpler of these two invariants, the Euler characteristic.

Definition 3.1.

The Euler Characteristic Transform takes a constructible function on and returns a constructible function on whose value at a direction and real parameter is the Euler integral of the restriction of to the half space . In equational form, we have

For our applications of interest, it suffices to restrict this transform to compact definable subsets of (which we call constructible sets), where we identify a definable subset with its associated constructible indicator function . When we fix and let vary, we refer to as the Euler curve for direction . This allows us to equivalently view the Euler Characteristic Transform for a fixed as a map from the sphere to the space of Euler curves (constructible functions on ).

The proof that the Euler curves are constructible is detailed in Lemma 3.4. We write as shorthand for the limit of as goes to positive infinity. This limit exists by compactness and definability of . Note that for every direction this limit is the total Euler characteristic of , i.e. .

Remark 3.2.

The restriction to constructible sets permits us to ignore the difference between ordinary and compactly-supported Euler characteristic. This is because the intersection of a compact definable set and the closed half-space is compact and definable, and these two versions of Euler characteristic agree on compact sets. This restriction is not strictly necessary, but would require a reworking of certain aspects of persistent homology (reviewed in Section 4), which is beyond the scope of this paper.

The reader may wish to pause to consider why the ECT associates to a definable set , viewed as the constructible function , a constructible function on . This, along with other finiteness concerns, is addressed by the following lemma, which in turn depends on two versions of the Trivialization Theorem of o-minimal geometry.

Theorem 3.3 (The Trivialization Theorems of Reference 22).

If and are definable subsets and is a continuous definable map, then the Trivialization Theorem Reference 22, Ch. 9, 1.2 states that there is a finite partition of into finitely many definable subsets , …, such that over each there is a definable subset , for some , a definable map , such that the product map , where , is a homeomorphism making the following diagram commute:

Moreover, the Trivialization Theorem with Distinguished Subsets Reference 22, Ch. 9, 1.7 states that if has definable subsets , …, , then we can refine the partition of to guarantee that for each there exists definable subsets , …, of with . In other words, we can refine the fiber to respect the distinguished subsets of .

Lemma 3.4 (Finitely Many Topological Changes).

For any definable set and any direction the topological, i.e. homeomorphism, type of the sublevel sets can only change finitely many times as a function of . Moreover there is a uniform bound , depending on , on the number of changes in the topological type when viewed in any direction. As a consequence, for any direction the Euler curve is a constructible function over .

Proof.

One can associate to a definable another definable set

To see that is definable we note that is the set of points satisfying

making it an algebraic set, which by Reference 22, Ch. 2, 2.11 is definable. By taking products we can conclude that is definable as well. The collection of half-spaces is also semialgebraic and hence definable. Consequently, the intersection of and , which is , must be definable as well. Finally, by our Definition 2.1 we know the projection map onto the second and third factors is definable and hence, by Reference 22, Ch. 1, 2.3(ii), the restriction of this projection map to , i.e.

is a continuous definable map as well.

By applying the Trivialization Theorem Reference 22, Ch. 9, 1.2 to we know that there is a finite partition of into definable sets , …, over which the map is definably trivial, i.e. the map restricts to a trivial fiber bundle over each . The trivialization over the sets guarantees that the topological type of the sublevel sets changes only finitely many times when viewed as a function of and , but the statement of the lemma asks for finiteness when viewing the shape in a fixed direction . To obtain the statement we want, we view the as distinguished subsets of and then apply the Trivialization Theorem with Distinguished Subsets Reference 22, Ch. 9, 1.7 to the projection map . This provides us with a partition of the sphere into definable subsets , …, so that over each there are definable subsets , …, of so that the trivialization carries each to . We note that each need not be connected, but each will be a finite union of singleton sets and connected intervals, i.e. definable and -cells. The number of changes in the topology of for any is then bounded by the sum of the number of and -cells in the partition , …, of . Taking the maximum of this number over , …, provides the uniform bounded on the number of topological changes when viewed in any direction.

This proof of Lemma 3.4 provides an important alternative characterization of the Euler Characteristic Transform: The ECT is simply the pushforward of the indicator function of along the definable map , which defines a constructible function on .

We now use Schapira’s inversion theorem, recalled as Theorem 2.13, to prove our first injectivity result.

Theorem 3.5.

Let be the set of constructible sets, i.e. compact definable sets. The map is injective. Equivalently, if and are two constructible sets that determined the same association of directions to Euler curves, then they are, in fact, the same set. Said symbolically:

Proof.

Let . Let be the hyperplane defined by . By the inclusion-exclusion property of the definable Euler characteristic

This means that from we can deduce the for all hyperplanes .

Let be the subset of where when is in the hyperplane . For simplicity, we denote the projection to by and the projection to by . For this choice of the Radon transform of the indicator function for at is

This implies that from we can derive .

Similarly let be the subset of where when is in the hyperplane . For all , is the set of hyperplanes that go through and hence is and . For all , is the set of hyperplanes that go through and and hence is and . Applying Theorem 2.13 yields

Note that if then , since determines the Euler characteristic of every slice. Moreover, if , then , which by inspecting the inversion formula above further implies that and hence .

4. Injectivity of the persistent homology transform

The primary transform of interest for this paper is the Persistent Homology Transform, which was first introduced in Reference 20 and was initially defined for a PL embedded simplicial complex in . The reader is encouraged to consult Reference 20 (and Reference 1 for a related precursor) for a more complete treatment of the PHT in that setting. Here, we illustrate how this transform can be defined for any constructible set .

As already noted, given a direction and a value , the sublevel set is the intersection of the constructible set with a closed half-space. This intersection has various topological summaries, one of them being the (definable) Euler Characteristic . One can also consider the (cellular) homology with field coefficients , which is defined in each degree . These are vector spaces that summarize topological content of any suitably nice topological space , which in this paper will always be spaces of the form . In low degrees the interpretations of these homology vector spaces for a space are as follows: is a vector space with basis given by connected components, is a vector space spanned by “holes” or closed loops that are not the boundaries of embedded disks, is a vector space spanned by “voids” or closed two-dimensional (possibly self-intersecting) surfaces that are not the boundaries of an embedded three dimensional space. The higher homologies are understood by analogy: these are vector spaces spanned by closed (i.e. without boundary) -dimensional subspaces of that are themselves not the boundaries of -dimensional spaces. The dimension of is called the Betti number , which for always satisfy for .

The proof that ordinary Euler characteristic is a topological invariant is best understood via homology. Indeed, the Betti numbers determine the Euler characteristic via an alternating sum:

However, one feature that homology enjoys that the Euler characteristic does not is functoriality, which is the property that any continuous transformation of spaces induces a linear transformation of homology vector spaces for each degree . This is the key feature that defines sublevel set persistent homology.

Definition 4.1.

Let be a compact definable set. For any vector define the height function in direction , as the restriction of the inner product to points . The sublevel set persistent homology group in degree between and is

The remarkable feature of persistent homology is that one can encode the persistent homology groups for every pair of values using a finite number of points in the extended plane. This is done via the persistence diagram.

Definition 4.2.

Let be the part of the extended plane that is above the diagonal, i.e. . The persistence diagram in degree associated to when filtered by sublevel sets of is the unique finite multiset of points with the property that for every pair of values the following equality holds

Since the the persistence diagram completely encodes the ranks of the sublevel set persistent homology groups , we will pass between these two notations freely, depending on what needs to be emphasized. We further note that the persistence diagram is also called the barcode, which relies on the interpretation of each point as an interval where and .

Remark 4.3 (Persistence and o-Minimality).

The existence of the persistence diagram is a non-trivial result and depends on certain tameness properties of the maps . Finite dimensionality of all of the homology vector spaces suffices, but in the o-minimal setting things are even better behaved because the dimension of the persistent homology groups can only change finitely times. Recall that the Triangulation Theorem, Theorem 2.3, guarantees that for each and has a finite decomposition into cells and so, the cellular homology is finite. The fact that the topology of can only change finitely many times as a function of was proved in Lemma 3.4.

To consider persistence diagrams associated to different directions we consider the set of all persistence diagrams, which can be topologized in several ways, as explained after Definition 4.4.

Definition 4.4.

Persistence Diagram Space, written Dgm, is the set of all possible countable multisets of where the number of points of the form and are finite and . Points of the form or are called essential classes and points of the form where neither coordinate is are called inessential classes. For persistence diagrams that encode the sublevel set persistent homology of a constructible set there are no points of the form .

We have used the term “space” with the implication that there is a topology on the set of all persistence diagrams. Indeed this topology comes from various choices of metrics on the set of persistence diagrams, which are phrased in terms of matchings of points between two persistence diagrams. Since a persistence diagram is technically a multiset, we append an additional coordinate to serve as a labelling index so that each can be regarded as a genuine set.

Definition 4.5.

Suppose and are two persistence diagrams, viewed as sets rather than multisets; i.e. is to be interpreted as the copy of the interval . A matching is a partial bijection , i.e. a choice of subset , called the domain , and an injection . We write the complement of the domain of as and the complement of the image of as ; collectively these are called the unmatched points of .

For this paper we will always promote a partial bijection to an actual bijection via the introduction of diagonal images. For a point where neither coordinate is , we define the diagonal image of as . Associated to any partial bijection is an actual bijection where

and

The map now matches points that were previously unmatched by with their corresponding diagonal images. For ease of notation, we drop the superscript tilde on and simply write for the extended map .

The -cost of a matching , where denotes the coordinates of , is

As a reminder, the distance between two matched points and is

with the understanding that if , then we must have and this distance collapses to . The distance is .

The Wasserstein -distance between two diagrams and is then the infimum of this matching cost over all matchings, i.e.

As noted in Reference 19, for fixed , the Wasserstein -distances are all bi-Lipschitz equivalent. The convention set by Reference 7 was to refer to the Wasserstein -distance as the Wasserstein -distance , but there are good reasons to adopt or as conventions as well. Unless explicitly stated to the contrary, our default assumption is that .

We note that the Wasserstein -distance is also called the bottleneck distance, for which we reserve the special notation

Although the bottleneck distance is the preferred distance for many theoretical purposes, in Reference 20 the -Wasserstein distance was used. For more details about the geometry of the space of persistence diagrams under -Wasserstein metrics see Reference 21.

Definition 4.6.

The Persistent Homology Transform of a constructible set is the map that sends a direction to the persistent diagrams gotten by filtering in the direction of , recording one diagram for each homological degree , i.e.

Letting the set vary gives us the map

where is the set of continuous functions from to , the latter being equipped with some Wasserstein -distance.

Before moving on with the remainder of the paper, we offer a sheaf-theoretic interpretation of the Persistent Homology Transform, which is not necessary for the remainder of the paper. The reader that is uninterested in sheaves can safely ignore the following remark.

Remark 4.7 (Sheaf-Theoretic Definition of the PHT).

Extending Lemma 3.4, we know that associated to any constructible set is a space

and a map whose fiber over is the sublevel set . The derived Persistent Homology Transform is the right derived pushforward of the constant sheaf on along the map , written . The associated cohomology sheaves of this derived pushforward, called the Leray sheaves in Reference 9, have stalk value at the cohomology of the sublevel set . If we restrict the sheaf to the subspace , then one obtains a constructible sheaf that is equivalent to the persistent (co)homology of the filtration of viewed in the direction of . The persistence diagram in degree is simply the expression of this restricted sheaf in terms of a direct sum of indecomposable sheaves.

4.1. Continuity of the PHT

It should be noted that when is an embedded simplicial complex, continuity of the resulting map was proved as Lemma 2.1 of Reference 20. To ensure that the above definition generalizes to constructible sets, we must prove a generalization of that lemma.

Lemma 4.8 (cf. Lemma 2.1 Reference 20).

For a constructible set , the map is continuous, where is given the Euclidean distance and uses any Wasserstein -distance with .

Proof.

First we note that since is compact, there is a bound on the distance from any point in to the origin. This implies that for any two directions and , the height functions and have a pointwise bound given by

Consequently, we have that .

The bottleneck stability theorem of Reference 6 guarantees that for each homological degree the bottleneck distance between the persistence diagrams is bounded by the distance between the functions. It suffices to prove continuity of in each coordinate, so without loss of generality, we refer to the persistence diagram for as and the persistence diagram for as . The bottleneck stability theorem guarantees that

This implies continuity of when using the bottleneck distance on persistence diagrams, which is the Wasserstein -distance, because in order to make the left hand side less than , we need only bound the Euclidean distance by .

For general we use Lemma 3.4, which showed that for a constructible set there is a bound on the number of critical values when viewed in any direction .

As a consequence of this lemma, the number of points in the persistence diagrams and are both bounded above by , since each point in the diagram corresponds to a topological change when filtering in the direction . Let be a matching that realizes the bottleneck distance , so that in particular for all . We note that it’s possible that matches every point in to the diagonal, which would lead to an augmented diagram of cardinality at most . Since the Wasserstein -distance infimizes the -cost over all matchings, we can now say that

Since we can control in terms of , this proves continuity of the PHT for the Wasserstein -distance for .

4.2. Continuity of Betti curves and Euler curves

The goal of this section will be the statement and proof of a persistent analog of the classical result that homology determines the Euler characteristic via Betti numbers. This persistent analog will also feature the extension of the continuity result of Lemma 4.8 to the Betti Curve Transform (Definition 4.11), which will in turn imply continuity of the Euler Characteristic Transform. Each of these results will require the specification of a metric on constructible functions over the real line, i.e. , which we now do.

Definition 4.9.

For every we define the extended pseudo-metric (distance) on constructible functions as follows: For we set

when this integral exists and when it does not. Similarly, we define the distance to be when the right hand side exists and when it does not.

We use this distance to prove the following preparatory lemma, which details the passage from persistence diagrams to constructible functions.

Lemma 4.10 (Continuity of the Diagram to Function Map).

Recall that every persistence diagram can be viewed as a multiset of intervals in . Let be the constructible function associated to that sums the indicator functions supported on each interval appearing in , i.e. . Let denote the subset of persistence diagram space with fewer than off-diagonal points.

For every , the map is continuous when is equipped with the Wasserstein -distance and is equipped with the distance of Definition 4.9. Additionally, this distance can be bound in terms of the bottleneck distance as follows

Proof.

Since for all to show that that is continuous when is equipped with the Wasserstein -distance it is sufficient to show it is continuous with respect to the bottleneck distance.

We note that we must exclude from the statement of the lemma, because a persistence diagram is distance zero from the same diagram where a point is added on the diagonal, e.g. . In this case, the constructible functions and are distance one away in the distance, thus proving that continuity of this map for is not possible.

For , we remark that the map is intuitively continuous because a small variation in points in the diagram results in a small variation in the endpoints of the simple functions making up . By construction we know that

To quantify this small variation precisely, let be a matching that realizes the -Wasserstein distance , where we work with the distance between points in the persistence diagram. We note that since we assume the number of points in and are both less than , then this infimum must be realized. Without loss of generality, we can assume that two off-diagonal points will be matched to each other whenever matching to their diagonal images has the same, or greater, cost.

Consider the function . To bound we will use bounds on and . Let denote the symmetric difference between intervals and . As already observed in Reference 5, Prop. 1.2, we can bound the integral of by

We also claim that for all . To see this, first observe that there are at most points in each of and . If then there must be intervals and such that and both and are matched to the diagonal under . However, the cost of matching both and to the diagonal is , where denotes the length of each interval, whereas the cost of matching to is as and intersect. This contradicts our assumption that was an optimal matching for .

Using the bound , we know that for all . Thus the integral is bounded by and hence

To finish the proof we only need to observe that if then both (for ) and .

Recall that for fixed and the Betti number in degree of the sublevel set is

For each , the right hand side of the above equation is determined by the cardinality of the intersection of the persistence diagram with the half-open quadrant . However, by allowing to vary, one obtains the Betti curve for the direction in degree as the sum of indicator functions supported on the intervals appearing in the persistence diagram for , i.e. where was defined in Lemma 4.10. These observations provide a third topological transform that stands between the PHT and the ECT.

Definition 4.11 (Betti Curve Transform).

Let be a constructible set and let be the associated persistent homology transform. Applying the map in each coordinate yields the Betti Curve Transform (BCT)

We now prove that the Betti Curve Transform is continuous as a function of the viewing direction . Although this is an immediate corollary of Lemma 4.10, we will provide a more concrete “for all , there exists a proof using the Bottleneck distance bound proved earlier.

Corollary 4.12 (Continuity of Betti Curves).

Fix a constructible set . For each , the Betti Curve Transform is continuous, where each coordinate is viewed as a map from the sphere to , the latter using the distance on constructible functions.

Proof.

It suffices to prove continuity in each coordinate, which puts us in the setting of Lemma 4.10. As was proved in Lemma 3.4, we can bound the number of off-diagonal points in any persistence diagram by . This serves as the value required by Lemma 4.10. Since Lemma 4.8 proved that the diagrams are continuous as a function of sphere direction, Lemma 4.10 proves that the resulting constructible functions also vary continuously. This completes the proof.

To see a more detailed special case of this argument, we note that bottleneck stability proves that for any pair of directions and the bottleneck distance between the associated diagrams is bounded as . Lemma 4.10 proves that the distance between the associated Betti curves is bounded as . Consequently to make it suffices to make where .

Proposition 4.13.

The Persistent Homology Transform () determines the Euler Characteristic Transform (), i.e. we have the following commutative diagram of maps

where is the map that takes the to the Betti Curve Transform . The map takes the alternating sum of constructible functions pointwise. Finally, we recall that the set refers to the set of continuous maps from , equipped with the restriction of the Euclidean norm, to , equipped with any norm so long as ; again the case is intentionally excluded, since continuity there is impossible.

Proof.

Corollary 4.12 proves that each Betti curve is continuous as a function of . This proof used, Lemma 4.10, which proved that the map from that takes a persistence diagram to the sum of indicator functions supported on each interval is continuous when the domain is equipped with a Wasserstein -norm and uses the norm.

The alternating sum of constructible functions, i.e. , is continuous and so

which is , is continuous as a function of for any norm so long as .

When our constructible set is a PL embedded geometric complex , then we can say more about the continuity and image of the Euler Characteristic Transform, as the next remark indicates.

Remark 4.14.

When is a PL embedded simplicial complex , we will show in Proposition 5.18 that, for any direction , the Euler curve is right continuous. More precisely, the function space that maps to consists of finite sums of indicator functions on half open intervals of the form where is allowed. If we endow the space of indicator functions with an norm for finite , then we get that if two Euler curves and differ at a filtration parameter , then there is some so that , which in turn implies that . This implies that in this setting, the Euler Characteristic Transform lands in a Hausdorff subspace of constructible functions equipped with some norm.

Finally, we remind the reader of the sheaf-theoretic and -theoretic perspective on the Euler Characteristc Transform.

Remark 4.15 (Grothendieck Group Interpretation).

Continuing Remark 4.7, the reader familiar with the Grothendieck group of constructible sheaves (see Reference 17 for a clear and concise treatment) will note that Proposition 4.13 coheres with the statement that the image of the (derived) Persistent Homology Transform in is the Euler Characteristic Transform.

4.3. Injectivity of the PHT and BCT

We can combine Proposition 4.13 with Theorem 3.5 to obtain a generalization of an injectivity result proved in Reference 20 for simplicial complexes in and .

Theorem 4.16.

Let be the set of constructible sets, i.e. compact definable subsets of . The Persistent Homology Transform and Betti Curve Transform are both injective.

Proof.

If two constructible sets and have or , then they have , which by Theorem 3.5 implies that .

Remark 4.17 (Co-Discovery).

In the final stages of preparing the first version of this article, a pre-print Reference 12 by Rob Ghrist, Rachel Levanger, and Huy Mai appeared independently proving Theorem 4.16. The authors of that paper and this paper want to make clear that these results were independently discovered.

5. Stratified space structure of the ECT and PHT

Recall that the content of Lemma 3.4 was two-fold: (1) that for a constructible set we could partition the space of directions and filtration values into finitely many regions over which the topological type of the sublevel sets do not change, and (2) that we could use this partition to obtain a partition of the sphere of directions so that when two directions and are in the same connected component of this partition, the persistent homology induced by and are equivalent in a certain sense. In this section we introduce the language of stratification theory to give a slightly tighter description of these decompositions in order to make issues of dimensionality and differentiability more transparent.

In particular, by using stratification theory we can refine the partitions of Lemma 3.4 into connected manifolds of varying dimension called strata. This will allow us to make certain arguments in terms of top-dimensional strata on the sphere . When we eventually specialize our discussion to those that are PL embedded geometric complexes in , we prove that the relationship between the persistent topology for and , when and are in the same stratum, is essentially linear. These observations will be critical in concluding that only finitely many directions are needed to infer a shape.

We now define what we mean by a stratified space structure. We note that there are many notions of a stratification, perhaps the most famous being the one due to Whitney Reference 27. Our notion of a stratification and of a stratified map will be a combination of Whitney’s condition with definability requirements. We follow the presentation in Reference 16 in order to use the results proved there.

Definition 5.1.

Suppose and are a pair of submanifolds of with . We let refer to the tangent space to at . The pair and satisfy Whitney’s condition at if

for every sequence in converging to and sequence in also converging to where the tangent spaces converge to and the secant lines converge to then .

This condition can be made to cohere with sets that are definable in some o-minimal structure.

Definition 5.2.

A definable stratification of is a partition of into finitely many subsets, called strata, such that:

(1)

Each stratum is a connected and definable submanifold of .

(2)

The Axiom of the Frontier holds, i.e. if , then .

We note that Reference 15, Proposition 2.2.20 proves that the Axiom of the Frontier implies that the set of strata forms a partially ordered set (where if and only if ) and that the frontier of any stratum, i.e. , is a union of strata of strictly lower dimension.

A definable Whitney stratification is a definable stratification such that for all in the pair satisfies Whitney’s condition at all points .

We will be making use of two theorems, which say that stratifications and stratified maps can be made to respect pre-existing definable subsets. To be precise, we require Definition 5.3.

Definition 5.3.

We say that is compatible with a class of subsets of if each is a finite union of some strata in .

Theorem 5.4 (cf. Thm. 1.3 of Reference 16).

If , …, are definable sets in , then there exists a definable Whitney stratification of compatible with .

Definition 5.5.

Let be a definable map. A stratification of is a pair , where and are definable Whitney stratifications of and respectively. Moreover we require that for each there be a , such that and is a submersion.

Theorem 5.6 (cf. Thm. 2.2 of Reference 16).

Let be a continuous definable map. If and are finite collections of definable subsets of and , respectively, then there exists a stratification of such that is compatible with and is compatible with .

As observed in the proof of Lemma 3.4 and Remark 4.3, both the ECT and PHT can be viewed as auxiliary definable constructions associated to an o-minimal set . Specifically, the ECT is gotten by the pushforward of the indicator function along the map

and the PHT is associated to the Leray sheaves (the cohomology sheaves of the derived pushforward of the constant sheaf) of this map.

Since Theorem 5.6 assures us that this map is stratifiable, we get induced stratifications of the codomain of as well as the sphere . This is the content of the next lemma.

Lemma 5.7.

For a general o-minimal set , the PHT or the ECT will induce a stratification of as well as a stratification of . Moreover, in the induced stratification of the sphere , a necessary condition for two directions and to be in the same stratum is that there is a stratum-preserving homeomorphism of the real line that induces an order preserving bijection between

These two sets being the union of all the birth times and death times all the points and in each of the corresponding persistence diagrams in all degrees , associated to filtering by and .

Proof.

As already proved in Lemma 3.4

is an element of , and thus admits a definable Whitney stratification compatible with and . The projection map onto the last two factors is a continuous definable map. By Theorem 5.6 the map admits a stratification that is compatible with and the trivializing partition of specified in the proof of Lemma 3.4.

As was done in Lemma 3.4, one can also project further from onto and this map will be a continuous definable map, which in turn will admit a definable stratification that is compatible with the trivializing partition of and of .

Lemma 3.4 provides definable homeomorphisms , which can be pieced together to find a definable homeomorphism where is stratified in a way that is compatible with the the partition , …, of . If and are in the same stratum of , then restricting this homeomorphism to the pre-images of both will induce a zig-zag

that specializes to an order and stratum-preserving homeomorphism from to . As a reminder, every topological change in the filtration induced by is witnessed by a -cell in . Since each finite birth or death time in the persistence diagram corresponds to a homological change, and thus a topological change, the homeomorphism will match -cells of , which include births/deaths of inessential features, with -cells in . This completes the proof.

Lemma 5.7 simply guarantees the existence of a stratification of the sphere and gives criteria for determining when two directions are in the same stratum. To provide more explicit relationships between Euler curves or persistence diagrams associated to vectors in the same stratum, we specialize to sets that are (PL embedded) geometric simplicial complexes. We now recall some of the basic definitions.

Definition 5.8.

A geometric -simplex is the convex hull of affinely independent points , , and is denoted . We call a face of if .

Example 5.9.

For example, consider three points that determine a unique plane containing them. The -simplex is the vertex . The -simplex is the edge between the vertices and . Note that and are faces of . The -simplex is the triangle bordered by the edges , and , which are also faces of .

Remark 5.10 (Orientations).

Traditionally, we view the order of vertices in a -simplex as indicating an equivalence class of orientations, where if is a permutation then . However, for the purposes of this paper we can ignore orientation.

Definition 5.11.

A finite geometric simplicial complex is a finite set of geometric simplices such that

(1)

Every face of a simplex in is also in ;

(2)

If two simplices are in then their intersection is either empty or a face of both and .

Remark 5.12 (Re-Triangulation).

Strictly speaking we only care about the embedded image of the finite simplicial complex. We consider different triangulations as equivalent; our uniqueness results will always be up to re-triangulation.

For a pair of distinct points let be the hyperplane that is orthogonal to the vector . This hyperplane divides the sphere into two halves depending on whether or . More generally, for a set of points we can define

as the union of the hyperplanes determined by each pair of distinct points.

Definition 5.13.

Let be a finite set of points in and let be the union of hyperplanes determined by each pair of points. The hyperplane union induces a stratification of , which we call the hyperplane division of by . Define as .

Remark 5.14 (Stratified space structure).

For a direction , consider the simplicial complex over the vertex set where if is perpendicular to the affine plane spanned by the . We can define a function by

If the points in lie in generic position then the function induces a stratified space structure on the sphere where the dimensional strata correspond to the connected components of . Notably the top dimensional strata (with dimension ) are the connected components on . Notice that even when the hyperplanes are not in general position we can find, by virtue of Theorem 5.4, a definable Whitney stratification of that is compatible with the hyperplanes and all of their intersections.

Lemma 5.15.

Let . If are in the same stratum of , then the order of is the same as the order of the .

Proof.

Observe that and lie in the same hemisphere of and so if and only if .

Definition 5.16.

For each vertex , the star of , denote is the set of simplices containing . Given a function we can define the lower star of with respect to , denoted , as the subset of simplices whose vertices have function values smaller than or equal to . Both stars and lower stars are generally not simplicial complexes as they are not closed under the face relation.

Remark 5.17 (Topological Interpretation of the Star).

Although a geometric simplex is defined here in terms of convex hulls, which are closed when viewed as topological spaces, they are better viewed as topological spaces via their interiors. For example, if is the simplicial complex consisting of the 1-simplex along with its two faces and , then according to the above definition . If we identify each geometric simplex with its interior, then the star is the “open star,” which in this case is the half-open interval . Below we will give a combinatorial formula for computing the Euler characteristic of the star, which in this case is . Note that if one is used to thinking in terms of Euler characteristic of the underlying space, then one must use compactly-supported Euler characteristic of the open star in order for these viewpoints to cohere.

For a finite geometric simplicial complex with vertex set , the height function is the piecewise linear extension of the restriction of to the set of vertices . When then all the function values of over are unique. This implies that each simplex belongs to a unique lower star, namely to the vertex with the highest function value. We will make essential use of the following result.

Proposition 5.18 (Lem. 2.3 of Reference 3 and §VI.3 of Reference 13).

For a piecewise linear function defined on a finite geometric simplicial complex with vertex set , we have that for every real number , the sublevel set is homotopic to .

Since both and are also compact we conclude that they have the same definable Euler characteristic or Euler characteristic with compact support. We will use the notation

to denote the lower star of in the filtration by the height function in direction .

Lemma 5.19.

Let be a finite simplicial complex with vertex set . Let be a connected subset of . Then for fixed , the lower stars are all the same for all . We will sometimes denote the lower star by to highlight this consistency. Moreover, for all we have the following formula for the Euler Characteristic Transform:

Proof.

We can see that the agree for all for all by the observation that the vertices of appear in the same order in each of the . This is the subset of cells that are added at the height value .

Note that the change in the Euler characteristic of the sublevel sets of as the height value passes is

Here we use the notation for the (compactly-supported) Euler characteristic of this set of simplices. Consequently, we can write the Euler characteristic curve for in direction as

Note that many of the elements in this sum are zero.

Example 5.20.

As a simple example, let be an embedded geometric 2-simplex along with all of its faces and suppose is a direction in which, filtering by projection to , the vertices appear in the order , then , then . Note that , which has Euler characteristic 1; , which has Euler characteristic ; and , which has Euler characteristic .

We now show that when two vectors and lie in the same connected component of , then the Euler curve or the persistence diagrams for can be used to determine the Euler curve or persistence diagrams for . We thank an anonymous referee for suggesting the following improved statement and proof.

Proposition 5.21.

Let be a finite simplicial complex with known vertex set . If lie in the same connected component of , then given the Euler curve for we can deduce the Euler curve for . Similarly, given the th persistence diagram associated to filtering by we can deduce the -th persistence diagram for filtering by .

Proof.

Consider the height function on our PL embedded simplicial complex . Recall that the vertex set of is . Associated to the function is another (typically discontinuous) function defined by setting where is the unique vertex whose lower star contains the simplex in whose interior belongs. Notice that this has the effect of increasing the value on the interior of a simplex to the maximum value obtained on any of its vertices. Consequently, for all we have that . This implies that for every we have the containment . Notice that the sublevel set . By virtue of Proposition 5.18, we have that this inclusion of sublevel sets is a homotopy equivalence for every , so and have identical persistence diagrams in all dimensions.

The virtue of defining the auxiliary function is that it easy to compare with when and belong to the same component of . This is because the level sets of are empty except at the values of the inner product and . At those values, the level sets are precisely the lower stars. As such, let be any order-preserving homeomorphism that maps the values to the values for all . Such a exists because the order of the and for are the same.

The mapping provides a bijection between these sets of values, with the property that the corresponding levelsets (i.e. lower stars) are equal, by virtue of Lemma 5.19. This implies that . It immediately follows that . Similarly, can be obtained from by transforming the persistence diagram plane using the function . This is because the birth time and death time of a feature in are transformed to a birth time and death time for a feature in .

6. Uniqueness of the distributions of Euler curves up to actions

In order to guarantee that two “close” shapes have close transforms—using either the ECT or PHT—one must first align or register the shapes’ orientations in space. For example, if one wanted to compare simplicial versions of a lion and a tiger, we would need to first embed them in such a way that they are facing the same direction. To rephrase this, for centered shapes we would like to make them as close as possible by using actions of the special orthogonal group . If we wished to optimize their alignment by also allowing reflections, we would like to make them as close as possible by using actions of the orthogonal group . In general, aligning or registering shapes is a challenging problem Reference 4.

In this section we show how studying distributions on the space on Euler curves—or persistence diagrams, since homology determines Euler characteristic—can bypass this process. We can construct distributions of topological summaries through the pushforward under the topological transform of the uniform measure over the sphere. If is the Lesbesgue measure over then the pushforward measure is a measure over the space of Euler curves defined by . These pushforward measures are naturally invariant of actions as the Lebesgue measure on the sphere is invariant; acting on a shape and acting on the space of directions using the same element of produces the same Euler curve. The key development of this section, Theorem 6.7, is the proof that for “generic” shapes the pushforward of the Lebesgue measure to the space of Euler curves uniquely determines that shape up to an action. Additionally, our proof of this theorem is constructive. If we know the actual transforms of two generic shapes and we recognize they produce the same distribution of Euler curves, then we construct an element of that relates them. However, the deeper implication is that knowing the distribution of Euler curves for a generic shape is a sufficient statistic for shape comparison. Continuing the aforementioned example, we can compare an arbitrarily embedded tiger and lion without ever aligning them. The theoretical ideas stated in this section were translated into an algorithm that “aligns” shapes without requiring correspondences in Reference 26.

We now specify what we mean by a “generic shape.”

Definition 6.1.

A geometric simplicial complex in with vertex set is generic if

(1)

the Euler curves for the height functions are distinct for all , and

(2)

the vertex set is in general position.

Our first task is to bound from below the number of “critical values” on a generic geometric complex when filtered in a generic direction. Since critical points and critical values are usually understood in a differentiable setting, and the shapes are dealing with are only piecewise differentiable, we make precise what we mean by this intuitive term.

Definition 6.2.

Let be a continuous function and the Euler curve of . We say that is an Euler regular value of if there is some open interval containing where is constant. An Euler critical value is a real number which is not an Euler regular value.

A real number is called a homological regular value if there is some open interval containing such that for all in the induced maps on homology by inclusion () are all isomorphisms. A homological critical value is any real number that is not a homological regular value. For the purposes of this paper we will just use the term critical value when there is no chance for confusion.

Remark 6.3.

There is some historical variation of the definition of a homological critical value and we refer the reader to Reference 14 for a comparison and contrast of two candidate definitions along with several interesting examples.

We now state a lower bound on the number of critical values of a generic complex when filtered in a direction in .

Lemma 6.4.

If is a generic finite geometric simplicial complex embedded in with vertex set then for all the height function has at least Euler critical values, i.e. values for which the Euler characteristic of the sublevel set changes.

Furthermore, for each connected component there exists linearly independent vertices which are Euler critical for for all .

Proof.

Let be a connected component of . The formula in Lemma 5.19 implies the number of Euler critical values for () is the number of vertices such that . Suppose that there are critical vertices , , , so that for all .

Define a function , with which is clearly continuous and is injective by our genericity assumptions. As is an open subset of a there is a open subset and a homeomorphism . Their composition, , is continuous and injective. By Brouwer’s Invariance of Domain Theorem we know that is homeomorphic to and thus . Since we conclude that .

By restricting to the first critical vertices if needed, we have found vertices which are Euler critical for for all . We know that these are linearly independent by our genericity assumptions.

Before proceeding to our main result, we need two technical lemmas.

Lemma 6.5.

Let be a linear map. If there is a non-empty open subset of such that for all , then is an orthogonal transformation.

Proof.

Without loss of generality we can assume that is an open ball in . We want to show that for that . Since , with an open ball in , we know that and hence

We thus can compute the inner product of and by

We can generate all of from linear combinations of points in . The inner product is bi-linear and so preserves the inner product over all of . As preserves the inner product over , must be an orthogonal transformation.

Lemma 6.6.

Let be a definable stratification of . Let be the set that indexes connected components of -dimensional strata within .

Let be the graph with vertex set that indexes top-dimensional strata, i.e. , and with edge set that indexes codimension-1 strata, i.e. . We say that and are connected by edge if and , i.e. and . With this construction, the graph is connected.

Proof.

Let be the union of strata of dimension and below in a definable stratification of . Let be the complement of this union, which carries a definable stratification by restriction of the stratification of . By Alexander Duality we have that , which implies that is connected. This proves that the union of top-dimensional strata and codimension-1 strata is a connected subspace of .

Now consider any partition of the vertex set into subsets and . Let and denote the union of the corresponding top-dimensional strata represented by vertices in and , respectively. Since the strata partition we have that is expressible as a union of two closed (in ) sets. Moreover, we know from the Axiom of the Frontier that is a union of -strata. If this intersection is empty, then there are no -strata and we have that is the union of a single top-dimensional stratum, thus proving that either or must be empty. If the intersection is non-empty, then there must be some -dimensional stratum in this intersection and thus some vertex in must be connected by an edge with some vertex in . This completes the proof.

The following is the main result of this section and is our formal statement about the uniqueness of a distribution over diagrams of curves up to an action by .

Theorem 6.7.

Let and be generic geometric simplicial complexes in . Let be Lesbesgue measure on . If (that is the pushforward of the measures are the same), then there is some such that , that is to say that is some combination of rotations and reflections of .

Proof.

Recall that and are continuous and injective maps to the space of Euler curves. The hypothesis implies that the support of the pushforward measures is the same. We now argue that equality of supports implies equality of images. Firstly, we note that the support of (respectively ) contains the image of (respectively ). To see this, consider an Euler curve in the image and consider an open ball around that curve. Continuity implies that the pre-image is open and thus the Lebesgue measure is positive. Secondly, we show that any Euler curve not in the image of is not in the support of . To see this, we note that Remark 4.14 implies that is a continuous map from a compact space to a Hausdorff space, so the image is relatively closed in the subspace of possible Euler curves. If an Euler curve is not in the image of , then there is an open set containing it that is disjoint from the image, which has measure zero according to the pushforward measure. Hence the support is a subset of the image. The above argument shows that implies the images of and are the same. Our genericity assumptions imply that is injective and thus we can define a bijection

The map is both definable and a homeomorphism.

To see is a homeomorphism we need to show that

is continuous which we will do via a contrapositive version of an argument. For define the function by is continuous. The set is compact and hence is a compact interval. This interval cannot contain because is injective. This implies that there is some with for all . Since was arbitrary, this means that for all and all there exists a such that implies that .

We will now show that is definable. Let

and

Both and are definable since the graph of definable functions is definable. Here we use that an are constructible (hence definable) functions on .

Let be the set of pairs of directions such that the Euler curve of in the direction of , written , is the same as the Euler curve of in the direction of , written . Since the pullback of definable sets is definable Reference 11, Lemma 11.1.15, we know that is definable. is then the graph of a definable map .

Let and denote the vertex sets of and respectively. Let and be the hyperplane partitions of and , respectively, as defined in the previous section. By construction is the union of hyperspheres, i.e. the intersections of the planes with . We also know that is homeomorphic to a union of hyperspheres. Furthermore is definable and thus is definable. There exists a stratification of into finitely many strata such that is contained in the lower dimensional strata. We will be looking at the restriction of to these top dimensional strata and showing that these restrictions are each the restriction of elements of , that is restrictions of an orthogonal map to their respective strata as the domain. We will then compare strata separated by a strata and show that their corresponding restrictions of agree as elements of .

Let be a connected open set with and , equivalently . This implies that is a connected subset of and is a connected subset of which means we can apply Lemma 5.19 for both and separately.

Let and respectively denote tffhe vertices of or such that or . From Lemma 5.19 we know that

and also that

Recall that the order of the values over is the same for all and that this determines a total ordering over . The same is true for the values over again determining a total ordering over . Since for all we know that and furthermore we can consistently index the elements of and such that

for all , …, and for all .

For clarity of exposition we shall first consider the case where . From our genericity assumptions, are linearly independent. This means that we can define the matrix

which has

and hence for all .

We will show that for all . For each we have

Since this inner product holds for basis we know that for all .

Now suppose that we do not have . We know that and each must contain at least linearly independent points from Lemma 6.4. To be able to use the arguments from the case where it will be sufficient to find vectors and such that is linearly independent of , is linearly independent of and such that for all . We can then apply the same reasoning merely substituting (respectively ) with (respectively ).

Let and denote the span of and let be perpendicular to . Note that for , , …, by construction. We claim that for all . To prove this suppose that with . Since is open there exists such that both and are in . However, for , , …, and this would contradict the injectivity from domain of the map . As is an open connected subset and does not vanish on we know either for all or for all . By taking the negative if needed, let denote the perpendicular to such that for all .

Similarly we can define as the unit vector orthogonal to (the span of ) such that for all .

Let be the unique linear transformation which fixes the origin and such that for all . Note that for each and for all .

Let and be the orthogonal projections of onto and respectively. Projecting onto and , we have

The adjoint of (with respect to the Euclidean inner products) satisfies

for all and all which in turn implies

for all .

We will use , and to denote the Lebesgue measures over , and . Since is linear there is a unique such that scales volume by . For any we have

Let be an open subset of with diameter at most . We will be comparing the measures of , , and . If then

We similarly have

Since is measure preserving we know that and hence

Together Equation 6.1 and Equation 6.2 imply that

and hence . By taking the limit as goes to zero we know , with independent of . By setting and we can state that for all . This gives the th linearly independent direction for the arguments above to imply that there is a linear map such that and agree on .

Since maps preserves distances for all we can apply Lemma 6.5 to conclude that .

Since is definable we have a stratification of whose lower strata consist of . Set be the set of the strata, the strata, and be the map which realises each element of or as its corresponding subset in . Let be the graph with vertex set and edges where the endpoints of edge are the vertices such that . We know from Lemma 6.6 that is connected.

Consider adjacent dimensional strata and which are adjacent in . This means that there is a strata within . As a dimensional subset of we know that it must contains at least linearly independent points . Since is continuous we know that for all . Choose such that is perpendicular to all the (note that there are exactly two options). Since we can observe that is perpendicular to and is perpendicular to for all . As for all , this implies that .

Choose in the space of the , and such that and . If then we have

which contradicts the injectivity of . This implies that and thus .

Since is connected and for and adjacent vertices in , we conclude that must be the same for all , which we denote , and that . We have two continuous maps that agree on an open dense subset (the union of the top strata) and hence must be the same over the entire domain. This implies that (by which we mean is the restriction of some to the unit sphere).

Now recall that by construction , so

Since we can apply it to itself viewed as a subset of . Note that in this case we have the obvious formula

Since both and are injective we then have our desired implication.

7. The sufficiency of finitely many directions

In this section we reach the main result of our paper, which provides the first finite bound (to our knowledge) on the number of “inquiries” required to determine a shape belonging to a particular uncountable set of shapes, which we call . These “inquiries” do not yield yes or no responses, but rather an Euler curve or persistent diagram.

The set of shapes belonging to can be described at a high level as follows:

(1)

A “shape” is an embedded geometric simplicial complex . Two different embeddings of the same underlying combinatorial complex are regarded as different shapes.

(2)

Each embedded complex is not “too flat” near any vertex. This guarantees that there is some set of directions with positive measure in which a non-trivial change of Euler characteristic (or homology) at that vertex can be observed. This measure is bounded below by a parameter , see Definition 7.3.

(3)

No complex has too many critical values when viewed in any given -ball of directions. Of course, for a fixed finite complex the number of critical values gotten by varying the direction is certainly bounded above, but we assume a uniform upper bound for our entire class of shapes .

The proof of Theorem 7.14 proceeds in two steps. First, we show that the vertex locations of any member can be determined simply by measuring changes in Euler characteristic when viewed along a fixed set of finitely many directions . Once these vertices are located, the associated hyperplane division of the sphere described in Section 5 is then determined. Since we can provide a uniform bound on the number of vertices of any element of , we then have a bound on the total possible number of top-dimensional strata of the sphere determined by hyperplane division. The second step is to then sample a direction from each individual top-dimensional stratum. Since Proposition 5.21 guarantees that we can interpolate the Euler Characteristic Transform over all of the top-dimensional strata, continuity guarantees that we can determine the entire transform using only these sampled directions. Finally, since Theorem 3.5 implies that uniquely determines , we then obtain the fact that any shape in is determined by finitely many draws from the sphere.

The mathematical ideas underlying Theorem 3.5 were central in the development of an algorithm that takes as input two classes of shapes and highlights the physical features that best describe the variation between them without requiring correspondences Reference 26 and extended to characterize physical differences between classes of proteins in Reference 25. Again, we would like to make clear that the theory developed in this section is relevant to practical imaging applications.

As one might imagine, the above argument rests on many intermediary technical propositions and lemmas. The first lemma we introduce is an application of the generalized pigeonhole principle, which will be used to pin down the locations of a vertex set of a fixed embedded simplicial complex.

Lemma 7.1.

Let be a finite set of points and let be a set of directions in general position. We let denote the hyperplane with normal vector that passes through point . Suppose of the hyperplanes in intersect at . If , then .

Proof.

The hypothesis implies that the set of hyperplanes has at least elements, because we’ve assumed that of them intersect at some point . Among these hyperplanes consider the assignment of the plane to some with . This defines a map from an element set to the element set . Since , the generalized pigeonhole principle implies at least one element of is mapped to by different hyperplanes, i.e. at least one element is contained in of the hyperplanes containing . Denote the normal vectors of these hyperplanes by , …, . Note that since and are contained in these hyperplanes we have the following system of equations

Now we invoke the general position hypothesis, which says that the are linearly independent, and we deduce that .

We now consider the two types of information that our two topological transforms can observe when looking in a direction . As has been the pattern for this paper, we first consider changes for the Euler Characteristic Transform and then deduce results about the Persistent Homology Transform.

Definition 7.2.

Let be a finite simplicial complex and . A vertex is Euler observable in direction if changes value at . Given a subset of directions , then a vertex is Euler observable in if is observable for some . We will often say observable when the context is clear.

For the purposes of sampling the Euler Characteristic Transform, it is important to guarantee that each vertex is observable for some positive measure of directions. We make this precise by quantifying the above observability criterion via a real parameter .

Definition 7.3.

Let be a geometric simplicial complex and let be a vertex of . We say the vertex is at least -Euler observable if there exists a ball of directions such that the Euler characteristic of the sublevel sets of changes at for all .

The idea of a -observable ball of directions at a vertex is that the local geometry of the simplicial complex around should not be “too flat” or similar to a hyperplane. This is indicated in the next example.

Example 7.4.

Let be a triangle in with vertices . The vertex is observable in direction exactly when is smaller that both and . If the angle at is then is -observable for all .

This allows us to make precise our definition of .

Definition 7.5.

Let denote the set of all embedded simplicial complexes in with the following two properties:

(1)

Every vertex is at least -observable.

(2)

For all , the number of for which is an Euler critical value of for some is bounded by .

The second condition imposes a uniform upper bound on the number of critical points for all directions in neighborhood of direction over all directions on the sphere.

Before stating the true importance of the -observable condition, we remind the reader of a definition.

Definition 7.6.

A -net in a metric space is a subset of points such that the union of -balls about these points covers the entire space .

Lemma 7.7.

Let be a geometric simplicial complex. If a vertex is -observable for some direction , then for any -net of directions there must be a direction which can observe .

Proof.

Since is a -net there must be a whose -ball includes . Since is -observable for , it’s observable for as well.

In order to extend the pigeonhole principle argument of Lemma 7.1 to find vertices that are -observable, we need a covering argument. This rests on the following technical lemma.

Lemma 7.8.

Let and fix a . We write for the ball of directions about of radius . Recall that denotes the Lebesgue measure on and is the Lesbesgue measure for the unit -ball in . The following string of inequalities hold:

Proof.

The second inequality compares balls in the sphere to balls in Euclidean space. Since the sphere is positively curved the volume of a ball in the sphere is less than a ball of the same radius in Euclidean space of the same dimension.

The first inequality compares the volume of the dimensional ball in Euclidean space with radius around to the volume of the projection onto the tangent plane at . The projection has radius .

By knitting together the -observable condition with a uniform bound on the number of critical values in any ball of radius , we obtain an upper bound on the number of vertices.

Lemma 7.9.

The total number of vertices for any is bounded by

We know that .

Proof.

The proof follows from an upper bound in the number of -balls needed to cover .