Abstract
The Euler characteristic transform (ECT) is an integral transform used widely in topological data analysis. Previous efforts by Curry et al. and Ghrist et al. have independently shown that the ECT is injective on all compact definable sets. In this work, we first study the injectivity of the ECT on definable sets that are not necessarily compact and prove a complete classification of constructible functions that the Euler characteristic transform is not injective on. We then introduce the quadric Euler characteristic transform (QECT) as a natural generalization of the ECT by detecting definable shapes with quadric hypersurfaces rather than hyperplanes. We also discuss some criteria for the injectivity of QECT.
Keywords:
Euler characteristic; Euler characteristic transform (ECT); topological data analysis (TDA); quadric hypersurfaces; Radon transform MSC:
46M20; 52A22
1. Introduction
The Euler characteristic transform (ECT) is an integral transform in topological data analysis (TDA) introduced in by Turner and more authors in [1]. Since then, the ECT itself and its variants have been widely used in the applied sciences [2,3,4,5,6,7,8]. On a high level, the ECT takes in a shape S in , “scans” S through each direction , and keeps track of the Euler characteristics of the sublevel sets of S. Concretely, the Euler characteristic transform of S may be formalized into a function defined by
where denotes the combinatorial Euler characteristic (see Definition 4). Note that defines the equation of a hyperplane in .
In the conclusion of [9] by Curry and more authors, they posed the question of how the Euler characteristic transform (ECT) would behave on shapes cut out by quadraticequations rather than linear equations. Inspired by this question, we consider a “converse” of this question in this work—what if we replace hyperplanes in the ECT with quadric hypersurfaces?
The equation of a quadric hypersurface may be written as , where A is a symmetric real matrix and is a vector in . Based on this notion, we can define the quadric Euler characteristic transform (QECT) of the shape S as a function given by . This definition will be made more precise in Section 4. By extending the class of hyperplanes to quadric hypersurfaces, the hope is that the QECT would add an extra variable that takes into account of curvatures.
In this work, a central question we are interested in is the injectivity of the ECT and the QECT. Curry et al. [9] and Ghrist et al. [10] have independently shown that the ECT is injective on a “reasonable” class of compact shapes. Furthermore, the work in [10] showed that this injectivity result extends to finite sums of indicator functions on a collection of shapes (known as constructible functions) that are compactly supported.
We will first investigate the injectivity of the ECT on constructible functions that are not compactly supported. As we will see in Example 3 and Theorem 3 in Section 3, there are many pairs of constructible functions that the ECT is not injective on. We then extend the ECT to the QECT and discuss its injectivity in Theorems 4 and 5. Specifically, we will prove the following main results in this paper:
- We completely classify all the pairs of constructible functions that the Euler characteristic transform is not injective on in Theorem 3.
- We show that the transform is injective up to sign in Theorem 4.
- Suppose the classes of “reasonable” shapes (see Definition 1) we are considering are all contained in for some . Let denote the operator norm of a symmetric matrix. For a fixed A such that , we show in Theorem 5 that the transform is injective. In particular, this serves as an interpolation between the injectivity of the ECT and Theorem 4 (see Remark 1). A similar statement holds for other definable norms with reasonable adjustments to the bounds.
These statements will be made more precise in their respective theorems.
Outline
This paper is organized as follows. In Section 2, we introduce the relevant backgrounds in o-minimal structures, Euler calculus, and the ECT. In Section 3, we discuss the injectivity of the ECT on all constructible functions, leading to a complete characterization of injectivity in Theorem 2. In Section 4, we extend the ECT to the QECT by considering quadric surfaces rather than hyperplanes in the sublevel sets of the integral transform and discuss several results on the injectivity of the QECT, leading to Theorems 4 and 5 in the end.
2. Background
2.1. O-Minimal Structures
O-minimal structures are widely used as the mathematical representation of a shape [9,11] in applied topology and topological data analysis. In the theoretical foundation of these applied areas, we often want to consider shapes that have some level of “tameness” to avoid pathological examples, and o-minimal structures offer one way to capture the idea of “tameness”. We refer the reader to [12] for a comprehensive introduction to o-minimal structures.
Definition 1.
Let be a collection of subsets of and . We say that is an o-minimal structure if it satisfies the following seven axioms:
- 1.
- The collection is a Boolean algebra, meaning it is closed under finite unions and finite intersections.
- 2.
- If , then and .
- 3.
- The subset belongs to for .
- 4.
- The collection is closed under all projections of the form
- 5.
- The singleton set belongs to for all . The halfspace belongs to .
- 6.
- The collection is exactly the finite unions of points and open intervals.
- 7.
- The collection contains all real algebraic sets.
An element of is called a definable set.
In this paper, we will fix an arbitrary o-minimal structure . Note that the collection of all real semi-algebraic sets is an example of an o-minimal structure. In fact, Definition 1 implies that any o-minimal structure has to contain all real semi-algebraic sets (see Remark 2.2 of [9]). We also want a notion of “definability” for functions between definable sets.
Definition 2.
Let be a function between definable sets.
- 1.
- The function f is called definable if its graph is a definable set.
- 2.
- If f is continuous and definable with a continuous and definable inverse, then f is called a definable homeomorphism, and X and Y are said to be definably homeomorphic.
- 3.
- If f is an integer valued function, then is called a constructible function. Let denote the space of constructible functions on X. Note that Definition 1(4) implies that the image of f is a discrete definable subset of and is thus finite.
When we later define the quadric Euler characteristic transform, we will want to consider a suitable norm on the space of symmetric matrices. There are many choices of norms for matrices that are popular in machine learning, such as the Schatten norm, cut norms, and norms, or the operator norm (see [13]), so we need to consider norms that are compatible with our o-minimal structure.
Definition 3.
Let be a finite-dimensional normed real vector space. is called a definable norm if the norm function is definable. We denote as the unit sphere with respect to . Note that is a compact definable set when is a definable norm.
In particular, we will use to denote the usual norm on , and to denote the usual unit sphere in with respect to the norm.
Example 1.
Here are two examples of definable norms that will be relevant to our discussions in Section 4.
Let be the norm on . The graph of is the set
which is semi-algebraic and hence definable.
Let V be the vector space of symmetric real matrices and be the operator norm on V. The graph of may be realized as an axis-aligned projection of the following definable set
where denotes the i-th elementary symmetric polynomial, and denotes the i-th coefficient of the characteristic polynomial . Note that is a polynomial function on the components of the matrix A. Thus, the operator norm is definable.
We also state the following technical lemma on o-minimal structures that will be used later in the paper.
Lemma 1
(Rephrased from Proposition 2.10 of Chapter 4 of [12]). Let be a definable set. For any , define . Then, takes only finitely many values as a runs through , and for each integer e the set is definable.
2.2. Euler Calculus and the Euler Characteristic Transform
Let be a definable set. The cell decomposition theorem ([12] Chapter 3, Theorem 2.11) asserts that there is a disjoint partition of S into open-cells such that each is definably homeomorphic to for some .
Definition 4.
Choose S as above; the Euler characteristic of S is . This quantity is independent of the cell partition and is preserved under definable homeomorphisms (see Chapter 4 of [12]). If S is a locally compact definale set, would be the alternating sum of the ranks of cohomology with compact support (see Lemma 8.5 of [14]).
Euler calculus is an integral calculus based on the observation that the Euler characteristic exhibits a finitely additive property similar to a signed measure,
on definable sets A and B. The field seeks to develop a theory of integration for constructible functions, similar to how regular calculus developed a theory of integration for measurable functions. We refer the reader to [14,15] for more details on Euler calculus.
Definition 5.
Let X be a definable function and be a constructible function. The Euler integral of f is
Note that this quantity is well-defined by the discussions in Definition 2(3). The Euler characteristic transform of f is defined as
where denotes the set . For a definable subset , we use to indicate the Euler characteristic transform of the indicator function on S.
We refer the reader to [16] for a general review of the Euler characteristic transform. Here is an example of computation with the Euler characteristic transform.
Example 2.
Take to be the closed unit ball with respect to the norm. For any , we have that if and if .
Euler calculus also enjoys its version of Fubini’s Theorem.
Theorem 1
(Fubini’s Theorem for Euler integrals). Let be a definable function between definable sets and be a constructible function. The following equality is true
A proof of Theorem 1 may be found in Theorem 4.5 of [14]. Note that while the authors assumed h to be compactly supported, the condition is not strictly required in the proof (see Page 5 of [14]). Theorem 1 of [15] presents an explicit proof of Theorem 1 for the case of semi-algebraic sets without the assuming h to be compactly supported, and the case for a general o-minimal structure follows similarly.
For convenience, we will also briefly explain what a Radon transform is and how it relates to the Euler characteristic transform.
Definition 6.
Let be a pair of definable sets and (known as a kernel function). The Radon transform is a function defined by
In particular, when and K is the indicator function on , then is the ECT.
3. Euler Characteristic Transform with Hyperplanes
In [10], the authors proved the following result on the injectivity of the Euler characteristic transform based on the Schapira inversion formula in [17].
Theorem 2
(Theorem 1 of [10], modified). Let , , be the indicator function on and be the indicator function on . For any , the following formula holds
where and . Moreover, when restricted to the class of compactly supported functions on X, is injective.
In the original proof by the authors of [10], this formula is only stated in the case where h is compactly supported. However, the formula still holds when h is not compactly supported. Please see Appendix A for a proof of Equation (1) without assuming that h is compactly supported. While the ECT is injective on compactly supported constructible functions, it is not injective on . We illustrate this with the following counter-example.
Example 3.
Let , , and , then for all . Indeed, the set is definably homeomorphic to , and the set is definably homeomorphic to . Hence, the additivity of Euler characteristic implies that
Hence is the zero function. On the other hand, the Euler characteristic of the empty set is always zero, so is also the zero function.
Fortunately, we can classify how non-injective is the ECT with the following theorem. From the theorem, we will also obtain a corollary that shows Example 3 is the only such counter-example for the case of definable sets.
Theorem 3.
Let be constructible functions. if and only if there exists some such that
In particular, suppose and for distinct definable sets and , then and up to renaming of variables.
Proof.
Suppose , then Equation (1) implies that there exists integers such that
for all . Hence, the difference is a constant integer, say c, and may be expressed as
Since the images of constructible functions are finite, we can write such that and ranges through the image of . Similarly, we can write such that and ranges through the image of .
Let . Equation (2) implies that . On the other hand , so for some in the image of . Thus, the set function by is a well-defined injective set function. Similarly, the set function is also a well-defined inverse of the previous set function. Thus, we conclude that and for up to reordering.
Now for any , , so . Similarly for any , , thus . Hence . Thus, we conclude that
This concludes the proof of the “only if” direction.
Conversely, suppose and , then for any , we will compute the difference of their respective Euler characteristic transforms.
where the fourth line follows from the fact that the sets form a finite (disregarding empty sets) partition of , and the sixth line follows from Example 3.
Finally, we will focus on the specific case that and . Without loss of generality, we will assume that is non-empty. Since , there exists some such that for all and for all .
Since is not empty, then let y be any point in . The equality implies that . If , then and becomes the indicator function on , which is a contradiction to the assumption that . If , then it follows that and for all . Since takes values only between 0 and 1, this can occur only when .
Thus, and is the constant function with value 1. Since , is the constant function with value 0, which implies that is the empty set. □
4. Euler Characteristic Transform with Quadric Hypersurfaces
Before going into the quadric Euler characteristic transform specifically, we will first discuss some results on Radon transforms in Section 4.1 that will be useful in Section 4.2 (and the Appendix A).
4.1. Generalized Kernel Spaces
Here is the general setup we will consider.
Definition 7.
Let be a definable set, be a compact definable set (called the “parameter space”), and a definable function.
- 1.
- We define as the indicator function on (the kernel function).
- 2.
- We define as the indicator function on (the dual kernel function).
- 3.
- We also define the fiber and the dual fiber .
Given a constructible function , we are interested in what the function is, to prove injectivity results similar to that of Theorem 2. We first prove a technical lemma.
Lemma 2.
Let .
- 1.
- We have the equality .
- 2.
- If , then .
- 3.
- As ranges through , the function can only take on finitely many values . Furthermore, the preimage of each is a definable subset of .
Proof.
For Lemma 2(1), we first rewrite the set as follows.
By considering the definable homeomorphism by , we have that
Since P is compact and definable, the set is compact and definable. Define the straight-line homotopy as for all ; this produces a deformation retract of A onto the set , which preserves the Euler characteristic because both sets are compact and definable. The proof of Lemma 2(1) is thus completed.
For Lemma 2(2), implies that for any . It then follows from Lemma 2(1) that .
For Lemma 2(3), we implement Lemma 1 as follows. We define S as the definable set
In this case, . Thus, Lemma 2(3) follows directly from Lemma 1. □
It is not generally true that for , the value of remains constant, as will be shown in the proof of Theorem 4. However, we can still compute the function .
Lemma 3.
Following the context of Definition 7 and Lemma 2(3) and fix , then for any ,
In particular, if is the diagonal of , then
Proof.
By Lemma 2(3), we may write as a function of x and . By Lemma 2, the diagonal is contained in exactly one of the , say . Then,
where the second line follows from Theorem 1. □
4.2. Quadric Euler Characteristic Transform
Let V be the space of real symmetric matrices equipped with a definable norm (recall the notations in Definition 3). Recall that a general quadric surface is given by
where , , and . Then it would seem that a natural definition (that turns out to be not desirable) of QECT on a constructible function would be
where denotes the set .
There is a question of whether our domain of choice is the best choice of domain. On one hand, this seems like a natural thematic generalization of the ECT. However, there are no choices of such that , so we cannot recover the ECT from this definition of the QECT.
The domain of is to avoid the degenerate case of the zero vector. Thus, what our more general QECT wants is to consider the case where A and v are both not identically zero. Thus, we adjust our definition to the following.
Definition 8.
Let W denote the space . We define the norm on W as
Let be a definable set and be a constructible function; the quadric Euler characteristic transform of f is the function defined by
Example 4.
Let , , and I be the identity matrix. We have that . Hence, the QECT can tell the difference between and compared to Example 3.
Now we will analyze a few properties of the QECT. First of all, when is fixed to be the zero vector, we note that the function , which we will refer to as , is not injective.
Example 5.
Let be the vector whose components are all unity, , and . We have that for all .
However, we can see that the failure to detect signs in Example 5 is the only such locus of non-injectivity with the following theorem.
Theorem 4.
Let be fixed. The transform is “injective up to sign”. More precisely, let . We obtain an inversion formula reminiscent of the Schapira inversion formula,
where μ and λ are distinct integers.
Proof.
We will use Lemma 3 to prove this theorem. Since , . Thus, the function has domain . Following the setup of Definition 7, we choose , , and to be the function . By Lemma 2 and the property that A is symmetric,
If or , then . Hence, .
Otherwise, suppose , then consider the function given by . Since and are both non-zero vectors, is a surjective linear transformation, and hence is a codimension 1 linear subspace of V. inherits a natural norm from V and hence .
Since all norms on a finite-dimensional real vector space are equivalent, the map by is a definable homeomorphism whose restriction to gives a homeomorphism between and the unit sphere of .
By Alexander duality, , so has two connected components. Since is an odd function, we will denote the two connected components as and corresponding to the locus where is positive and negative, respectively. Hence, the map brings homeomorphically to a closed hemisphere of . Thus, the set is compact and contractible, so we conclude that .
Let and . By Lemma 3, we can write
where if and is 0 otherwise. Finally, we can furthermore simplify the expression as
This concludes the proof of Theorem 4. □
Theorem 4 examined what happens to the QECT when its vector component is fixed. We are also interested in what happens to the QECT when its matrix component is fixed.
Theorem 5.
Let denote the closed ball of radius R for some centered at the origin. Fix the norm on V to be the operator norm , and let be fixed such that . Define the transform by , where P is the sphere of radius in . Then, is injective.
Remark 1.
Theorem 5 interpolates between Theorems 2 and 4 in the following sense. When , the inequality does not hold for any value of R. This reflects the fact that is only injective up to signs in Theorem 4 and Example 5. When , A is the zero matrix and the QECT becomes the usual ECT, which is injective by Theorem 2 no matter what R is. This reflects the fact that the inequality is satisfied for any value of R.
The requirement for the norm on V to be the operator norm is not strictly necessary. The same statement holds for definable norm on V that satisfies the property . Common examples include the Frobenius norm and the nuclear norm. Furthermore, by adjusting the constant appropriately, similar statements for any definable norm on V will hold.
Now we will prove Theorem 5.
Proof of Theorem 5.
We will use Lemma 3 to prove this theorem. Following the setup of Definition 7, we choose , , and to be the function . By Lemma 2 and the property that A is symmetric,
If , we have that . Otherwise, if , we can consider the function by . In this case, we have that .
It remains for us to determine . Since is not the zero vector, is a surjective affine map and is a hyperplane in . Furthermore, the vector is a unit normal vector to , and may be written as the sum
This is because for any in the right hand side above,
Now we observe that
where the fifth and last line both follow from the assumption . The space is one of the two sides of the sphere P divided by the hyperplane . Since the radius of P is and , the normal vector supporting the hyperplane has length strictly less than the radius of P. This means that the space is a compact, contractible, and definable subset of P. It then follows that
Thus, by Lemma 3, for all ,
Since has compact support, QECT would determine the value of . Thus, the transform is injective. □
5. Conclusions
In this paper, we completely classified the pairs of constructible functions that the Euler characteristic transform (ECT) is not injective on (Theorem 2). We then proposed the quadric Euler characteristic transform (QECT) as an algebraic generalization of the ECT. From here, we derived two injectivity results for special cases of the QECT in Theorems 4 and 5.
While we only considered quadratic polynomials in this paper, it would be interesting to investigate similar transforms using higher-degree polynomials. It also would be interesting to see a computational implementation of the quadric Euler characteristic transform and numerical experiments around this integral transform.
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in the study are included in the article; further inquiries can be directed to the corresponding author.
Acknowledgments
M.J. would like to thank Kun Meng and Richard Schwartz for their helpful comments and discussions. M.J. would also like to thank Cheng Chen for helpful conversations on functional analysis. M.J. would also like to thank her friends Nir Elber and Riley Guyett for proofreading the paper and providing feedback and suggestions. M.J. would also like to thank the academic editors and the journal referees for their helpful comments and suggestions.
Conflicts of Interest
The author declares no conflicts of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| ECT | Euler characteristic transform |
| QECT | Quadric Euler characteristic transform |
| TDA | Topological data analysis |
| CF | Constructible functions |
| Operator norm | |
| norm | |
| V | The space of real symmetric matrices |
| W |
Appendix A. Inversion Formula of ECT without Compact Support
Here, we reprove the inversion formula of ECT in [10] without the assumption that is compactly supported. The proof will be similar to that of [10].
References
- Turner, K.; Mileyko, Y.; Mukherjee, S.; Harer, J. Fréchet means for distributions of persistence diagrams. Discret. Comput. Geom. 2014, 52, 44–70. [Google Scholar] [CrossRef] [Scilit]
- Amézquita, E.J.; Quigley, M.Y.; Ophelders, T.; Landis, J.B.; Koenig, D.; Munch, E.; Chitwood, D.H. Measuring hidden phenotype: Quantifying the shape of barley seeds using the Euler characteristic transform. In Silico Plants 2021, 4, diab033. [Google Scholar] [CrossRef] [Scilit]
- Crawford, L.; Monod, A.; Chen, A.X.; Mukherjee, S.; Rabadán, R. Predicting clinical outcomes in glioblastoma: An application of topological and functional data analysis. J. Am. Stat. Assoc. 2020, 115, 1139–1150. [Google Scholar] [CrossRef] [Scilit]
- Wang, B.; Sudijono, T.; Kirveslahti, H.; Gao, T.; Boyer, D.M.; Mukherjee, S.; Crawford, L. A statistical pipeline for identifying physical features that differentiate classes of 3d shapes. Ann. Appl. Stat. 2021, 15, 638–661. [Google Scholar] [CrossRef] [Scilit]
- Nadimpalli, K.V.; Chattopadhyay, A.; Rieck, B. Euler characteristic transform based topological loss for reconstructing 3D images from single 2D slices. In Proceedings of the 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), Los Alamitos, CA, USA, 17–24 June 2023; pp. 571–579. [Google Scholar]
- Hacquard, O.; Lebovici, V. Euler characteristic tools for topological data analysis. arXiv 2023, arXiv:2303.14040. [Google Scholar]
- Röell, E.; Rieck, B. Differentiable Euler characteristic transforms for shape classification. In Proceedings of the International Conference on Learning Representations, Vienna, Austria, 7–11 May 2024. [Google Scholar]
- Meng, K.; Wang, J.; Crawford, L.; Eloyan, A. Randomness of shapes and statistical inference on shapes via the smooth Euler characteristic transform. J. Am. Stat. Assoc. 2024. [Google Scholar] [CrossRef] [Scilit]
- Curry, J.; Mukherjee, S.; Turner, K. How many directions determine a shape and other sufficiency results for two topological transforms. Trans. Am. Math. Soc. Ser. B 2022, 9, 1006–1043. [Google Scholar] [CrossRef] [Scilit]
- Ghrist, R.; Levanger, R.; Mai, H. Persistent homology and Euler integral transforms. J. Appl. Comput. Topol. 2018, 2, 55–60. [Google Scholar] [CrossRef] [Scilit]
- Ghrist, R. Elementary Applied Topology; Createspace: Seattle, DC, USA, 2014; Volume 1. [Google Scholar]
- van den Dries, L. Tame Topology and O-Minimal Structures; Cambridge University Press: Cambridge, UK, 1998; Volume 248. [Google Scholar]
- Fan, J.; Li, R.; Zhang, C.H.; Zou, H. Statistical Foundation of Data Science; Chapman & Hall/CRC Data Science Series; CRC Press: Boca Raton, FL, USA, 2020. [Google Scholar]
- Curry, J.; Ghrist, R.; Robinson, M. Euler calculus with applications to signals and sensing. Proc. Symp. Appl. Math. 2012, 70, 75–146. [Google Scholar]
- Gusein-Zade, S.M. Integration with respect to the Euler characteristic and its applications. Russ. Math. Surv. 2010, 65, 399. [Google Scholar] [CrossRef] [Scilit]
- Munch, E. An invitation to the Euler characteristic transform. arXiv 2023, arXiv:2310.10395. [Google Scholar]
- Schapira, P. Tomography of constructible functions. In Proceedings of the International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Paris, France, 17–22 July 1995; Springer: Berlin/Heidelberg, Germany, 1995; pp. 427–435. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).