Next Article in Journal
Multi-Class Hypersphere Anomaly Detection Based on Edge Outlier Exposure Set and Margin
Previous Article in Journal
Some Properties and Graphical Applications of a New Subclass of Harmonic Functions Defined by a Differential Inequality
Previous Article in Special Issue
Barrelled Weakly Köthe–Orlicz Summable Sequence Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Injectivity of Euler Integral Transforms with Hyperplanes and Quadric Hypersurfaces

by
Mattie Ji
Department of Mathematics, Brown University, Box 1917, 151 Thayer Street, Providence, RI 02912, USA
Mathematics 2024, 12(15), 2339; https://doi.org/10.3390/math12152339 (registering DOI)
Submission received: 1 July 2024 / Revised: 23 July 2024 / Accepted: 24 July 2024 / Published: 26 July 2024
(This article belongs to the Special Issue Topological Space and Its Applications)

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.

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 R n , “scans” S through each direction v S n 1 , 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 ECT ( S ) : S n 1 × R Z defined by
( ν , t ) ECT ( S ) ( ν , t ) = χ ( { x S | x · ν t } ) ,
where χ ( · ) denotes the combinatorial Euler characteristic (see Definition 4). Note that x · ν = t defines the equation of a hyperplane in R n .
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 x T A x + ν · x = t , where A is a symmetric n × n real matrix and ν is a vector in R n . Based on this notion, we can define the quadric Euler characteristic transform (QECT) of the shape S as a function given by ( A , ν , t ) QECT ( S ) ( A , ν , t ) χ ( { x S | x T A x + x · ν t } ) . 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 S { ( A , t ) QECT ( S ) ( A , 0 , t ) } is injective up to sign in Theorem 4.
  • Suppose the classes of “reasonable” shapes (see Definition 1) we are considering are all contained in B R ( 0 ) { x R n | | x | R } for some R 0 . Let | | · | | o p denote the operator norm of a symmetric matrix. For a fixed A such that | | A | | o p < 1 1 + 2 R 2 , we show in Theorem 5 that the transform S { ( v , t ) QECT ( S ) ( A , v , t ) } 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 O n be a collection of subsets of R n and O = { O n } n 1 . We say that O is an o-minimal structure if it satisfies the following seven axioms:
1. 
The collection O n is a Boolean algebra, meaning it is closed under finite unions and finite intersections.
2. 
If A O n , then A × R O n + 1 and R × A O n + 1 .
3. 
The subset { ( x 1 , , x n ) R n | x i = x j } belongs to O n for 1 i < j n .
4. 
The collection O is closed under all projections of the form
π n i : R n R n 1 , π n i ( x 1 , , x n ) : = ( x 1 , , x i ^ , , x n ) .
5. 
The singleton set { r } belongs to O 1 for all r R . The halfspace { ( x , y ) R 2 | x < y } belongs to O 2 .
6. 
The collection O 1 is exactly the finite unions of points and open intervals.
7. 
The collection O contains all real algebraic sets.
An element of O n is called a definable set.
In this paper, we will fix an arbitrary o-minimal structure O n . 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 f : X Y 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 f : X Z is called a constructible function. Let CF ( X ) 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 O 1 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 n × n matrices. There are many choices of norms for matrices that are popular in machine learning, such as the Schatten norm, cut norms, and L p , q norms, or the operator norm (see [13]), so we need to consider norms that are compatible with our o-minimal structure.
Definition 3.
Let ( V , | | · | | ) be a finite-dimensional normed real vector space. | | · | | is called a definable norm if the norm function | | · | | : V R 0 is definable. We denote S V { x V | | | x | | = 1 } as the unit sphere with respect to | | · | | . Note that S V is a compact definable set when | | · | | is a definable norm.
In particular, we will use | · | to denote the usual 2 norm on R n , and S n 1 to denote the usual unit sphere in R n with respect to the 2 norm.
Example 1.
Here are two examples of definable norms that will be relevant to our discussions in Section 4.
Let | · | be the 2 norm on R n . The graph of | · | : R n R 0 is the set
{ ( x 1 , , x n , y ) R n × R | x 1 2 + + x n 2 = y 2 and y 0 } ,
which is semi-algebraic and hence definable.
Let V be the vector space of n × n symmetric real matrices and | | · | | op be the operator norm on V. The graph of | | · | | o p : V R 0 may be realized as an axis-aligned projection of the following definable set
{ ( A , λ 1 , , λ n ) V × R n | det ( A λ i I ) = 0 , e i ( λ 1 , , λ n ) = a i ( A ) a n ( A )
for all i = 1 , , n and λ 1 2 λ n 2 } ,
where e i denotes the i-th elementary symmetric polynomial, and a i ( A ) denotes the i-th coefficient of the characteristic polynomial det ( A x I ) . Note that a i 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 S R m + n be a definable set. For any a R m , define S a : = { x R n | ( a , x ) S } . Then, χ ( S a ) takes only finitely many values as a runs through R m , and for each integer e the set { a R m : χ ( S a ) = e } is definable.

2.2. Euler Calculus and the Euler Characteristic Transform

Let S R n 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 C 1 , , C N such that each C i is definably homeomorphic to R a i for some a i .
Definition 4.
Choose S as above; the Euler characteristic of S is χ ( S ) i = 1 N ( 1 ) a i . 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, χ ( S ) 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,
χ ( A B ) = χ ( A ) + χ ( B ) χ ( A B ) ,
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 f : X Z be a constructible function. The Euler integral of f is
X f ( x ) d χ ( x ) n = n χ ( { x X | f ( x ) = n } ) .
Note that this quantity is well-defined by the discussions in Definition 2(3). The Euler characteristic transform of f is defined as
ECT ( f ) : S n 1 × R Z , ( ν , t ) ECT ( f ) ( ν , t ) = X f ( x ) 1 X t v ( x ) d χ ( x ) ,
where X t v denotes the set { x X | v · x t } . For a definable subset S X , we use ECT ( S ) 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 B 1 ( 0 ) = { x R n | | x | 1 } to be the closed unit ball with respect to the 2 norm. For any ν S n 1 , we have that ECT ( B 1 ( 0 ) ( ν , t ) ) = 1 if 1 t and ECT ( B 1 ( 0 ) ( ν , t ) ) = 0 if t < 1 .
Euler calculus also enjoys its version of Fubini’s Theorem.
Theorem 1
(Fubini’s Theorem for Euler integrals). Let f : X Y be a definable function between definable sets and h : X Z be a constructible function. The following equality is true
X h ( x ) d χ ( x ) = Y f 1 ( y ) h ( x ) d χ ( x ) d χ ( y ) .
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 ( X , Y ) be a pair of definable sets and K CF ( X × Y ) (known as a kernel function). The Radon transform is a function R K : CF ( X ) CF ( Y ) defined by
( R K h ) ( y ) = X h ( x ) K ( x , y ) d χ ( x ) , h ( x ) CF ( X ) , for all y Y .
In particular, when Y = S n 1 × R and K is the indicator function on { ( x , ν , t ) X × Y | v · x t } , then R K 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 X = R n , Y = S n 1 × R , K CF ( X × Y ) be the indicator function on { ( x , ν , t ) X × Y | v · x t } and K CF ( Y × X ) be the indicator function on { ( ν , t , x ) Y × X | v · x t } . For any h CF ( X ) , the following formula holds
( R K R K ) h = ( μ λ ) h + λ ( X h d χ ) 1 X ,
where μ = χ ( S n 1 ) and λ = 1 . Moreover, when restricted to the class of compactly supported functions on X, R K = ECT 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 CF ( R n ) . We illustrate this with the following counter-example.
Example 3.
Let X = R n , S 1 = R n , and S 2 = , then ECT ( S 1 ) ( ν , t ) = ECT ( S 2 ) ( ν , t ) for all ( ν , t ) S n × R . Indeed, the set { x R n | x · ν = t } is definably homeomorphic to R n 1 , and the set { x R n | x · ν > t } is definably homeomorphic to R n . Hence, the additivity of Euler characteristic implies that
ECT ( S 1 ) ( ν , t ) = χ ( { x R n | x · ν t } ) = χ ( R n 1 ) + χ ( R n ) = 0 .
Hence ECT ( S 1 ) is the zero function. On the other hand, the Euler characteristic of the empty set is always zero, so ECT ( S 2 ) 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 f , g : R n Z be constructible functions. ECT ( f ) = ECT ( g ) if and only if there exists some c Z such that
f ( x ) = n = + n 1 { f 1 ( n ) } ( x ) and g ( x ) = n = + ( n + c ) 1 { f 1 ( n ) } ( x ) .
In particular, suppose f ( x ) = 1 S 1 ( x ) and g ( x ) = 1 S 2 ( x ) for distinct definable sets S 1 , S 2 R n and ECT ( f ) = ECT ( g ) , then S 1 = R n and S 2 = up to renaming of variables.
Proof. 
Suppose ECT ( f ) = ECT ( g ) , then Equation (1) implies that there exists integers μ λ such that
( μ λ ) f ( x ) + λ R n f ( x ) d χ = ( μ λ ) g ( x ) + λ R n g ( x ) d χ ,
for all x R n . Hence, the difference f ( x ) g ( x ) is a constant integer, say c, and may be expressed as
g ( x ) f ( x ) = c λ μ λ ( R n f ( x ) d χ R n g ( x ) d χ ) .
Since the images of constructible functions are finite, we can write f ( x ) = i = 1 n a i 1 A i ( x ) such that A i = f 1 ( a i ) and a i ranges through the image of f ( x ) . Similarly, we can write g ( x ) = j = 1 m b j 1 B j ( x ) such that B j = g 1 ( b j ) and b j ranges through the image of g ( x ) .
Let x A i . Equation (2) implies that f ( x ) g ( x ) = c . On the other hand f ( x ) = a i , so g ( x ) = b j = a i + c for some b j in the image of g ( x ) . Thus, the set function { a 1 , , a n } { b 1 , , b m } by a i a i + c is a well-defined injective set function. Similarly, the set function { b 1 , , b m } { a 1 , , a n } is also a well-defined inverse of the previous set function. Thus, we conclude that n = m and b i = a i + c for i = 1 , , n up to reordering.
Now for any x A i , g ( x ) = c + f ( x ) = c + a i = b i , so x B i . Similarly for any x B i , f ( x ) = g ( x ) c = a i , thus x A i . Hence A i = B i . Thus, we conclude that
f ( x ) = i = 1 n a i 1 A i ( x ) and g ( x ) = i = 1 n ( a i + c ) 1 A i ( x ) .
This concludes the proof of the “only if” direction.
Conversely, suppose f ( x ) = n = + n 1 { f 1 ( n ) } ( x ) and g ( x ) = n = + ( n + c ) 1 { f 1 ( n ) } ( x ) , then for any ( ν , t ) S n 1 × R , we will compute the difference of their respective Euler characteristic transforms.
ECT ( g ) ( ν , t ) ECT ( f ) ( ν , t ) = n = + R n ( n + c ) 1 { f 1 ( n ) } { x · ν t } ( x ) d χ R n n 1 { f 1 ( n ) } { x · ν t } ( x ) d χ = n = + R n ( n + c n ) 1 { f 1 ( n ) } { x · ν t } ( x ) d χ = c n = + R n 1 { f 1 ( n ) } { x · ν t } ( x ) d χ = c R n 1 { x · ν t } ( x ) d χ = c ECT ( R n ) ( ν , t ) = 0 ,
where the fourth line follows from the fact that the sets { f 1 ( n ) } n Z form a finite (disregarding empty sets) partition of R n , and the sixth line follows from Example 3.
Finally, we will focus on the specific case that f ( x ) = 1 S 1 ( x ) and g ( x ) = 1 S 2 ( x ) . Without loss of generality, we will assume that S 1 is non-empty. Since ECT ( f ) = ECT ( g ) , there exists some c Z such that g ( x ) = 1 + c for all x S 1 and g ( x ) = 0 + c for all x S 1 .
Since S 1 is not empty, then let y be any point in S 1 . The equality f ( y ) = 1 implies that g ( y ) = 1 + c . If g ( y ) = 1 , then c = 0 and g ( x ) becomes the indicator function on S 1 , which is a contradiction to the assumption that f ( x ) g ( x ) . If g ( y ) = 1 + c = 0 , then it follows that c = 1 and g ( x ) = 1 for all x S 1 . Since g ( x ) takes values only between 0 and 1, this can occur only when S 1 = R n .
Thus, S 1 = R n and f ( x ) is the constant function with value 1. Since c = 1 , g ( x ) is the constant function with value 0, which implies that S 2 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 X R n be a definable set, P R k be a compact definable set (called the “parameter space”), and f : X × P R a definable function.
1. 
We define K f ( x , ( ξ , t ) ) CF ( X × P × R ) as the indicator function on { ( x , ( ξ , t ) ) X × P × R | f ( x , ξ ) t } (the kernel function).
2. 
We define K f ( ( ξ , t ) , x ) CF ( P × R × X ) as the indicator function on { ( ξ , t ) , x ) P × R × X | f ( x , ξ ) t } (the dual kernel function).
3. 
We also define the fiber K x , f = { ( ξ , t ) P × R | f ( x , ξ ) t } and the dual fiber K x , f = { ( ξ , t ) P × R | f ( x , ξ ) t } .
Given a constructible function h : X Z , we are interested in what the function ( R K f R K f ) h is, to prove injectivity results similar to that of Theorem 2. We first prove a technical lemma.
Lemma 2.
Let x , x X .
1. 
We have the equality χ ( K x , f K x , f ) = χ ( { ξ P | f ( x , ξ ) f ( x , ξ ) 0 } ) .
2. 
If x = x , then χ ( K x , f K x , f ) = χ ( P ) .
3. 
As ( x , x ) ranges through X × X , the function ( x , x ) χ ( K x , f K x , f ) can only take on finitely many values c 1 , , c n . Furthermore, the preimage S i of each c i is a definable subset of X × X .
Proof. 
For Lemma 2(1), we first rewrite the set K x , f K x , f as follows.
K x , f K x , f = { ( ξ , t ) P × R | t f ( x , ξ ) and f ( x , ξ ) t } = { ( ξ , t ) P × R | f ( x , ξ ) t f ( x , ξ ) } = { ( ξ , t ) P × R | t [ f ( x , ξ ) , f ( x , ξ ) ] } .
By considering the definable homeomorphism ϕ : P × R P × R by ϕ ( ξ , t ) = ( ξ , t f ( x , ξ ) ) , we have that
χ ( K x , f K x , f ) = χ ( ϕ ( K x , f K x , f ) ) = χ ( { ( ξ , t ) P × R | t [ 0 , f ( x , ξ ) f ( x , ξ ) ] } ) .
Since P is compact and definable, the set A { ( ξ , t ) P × R | t [ 0 , f ( x , ξ ) f ( x , ξ ) ] } is compact and definable. Define the straight-line homotopy H : A × [ 0 , 1 ] A as H ( ( ξ , t ) , s ) = ( ξ , ( 1 s ) t ) for all ( ( ξ , t ) , s ) A × [ 0 , 1 ] ; this produces a deformation retract of A onto the set { ξ P | f ( x , ξ ) f ( x , ξ ) 0 } , 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), x = x implies that f ( x , p ) f ( x , p ) = 0 for any p P . It then follows from Lemma 2(1) that χ ( K x , f K x , f ) = χ { p P | 0 = 0 } = χ ( P ) .
For Lemma 2(3), we implement Lemma 1 as follows. We define S as the definable set
S { ( x , x , ξ ) X × X × P R 2 n + k | f ( x , ξ ) f ( x , ξ ) 0 } .
In this case, S ( x , x ) = { ξ R k | f ( x , ξ ) f ( x , ξ ) 0 } . Thus, Lemma 2(3) follows directly from Lemma 1. □
It is not generally true that for x x P , the value of χ ( K x , f K x , f ) remains constant, as will be shown in the proof of Theorem 4. However, we can still compute the function ( R K f R K f ) h .
Lemma 3.
Following the context of Definition 7 and Lemma 2(3) and fix c 1 = χ ( P ) , then for any x X ,
( R K f R K f ) h ( x ) = χ ( P ) X h ( x ) 1 S 1 ( x , x ) d χ ( x ) + i = 2 n c i X h ( x ) 1 S i ( x , x ) d χ ( x ) .
In particular, if S 1 = Δ is the diagonal of X × X , then
( R K R K ) h ( x ) = χ ( P ) h ( x ) + i = 2 n c i X h ( x ) 1 S i ( x , x ) d χ ( x ) .
Proof. 
By Lemma 2(3), we may write χ ( K x , f K x , f ) = i = 1 n c i 1 S i ( x , x ) as a function of x and x . By Lemma 2, the diagonal Δ X × X is contained in exactly one of the S i , say S 1 . Then,
( R K f R K f ) h ( x ) = P × R K ( y , x ) X h ( x ) K ( x , y ) d χ ( x ) d χ ( y ) = X h ( x ) P × R K f ( y , x ) K f ( x , y ) d χ ( y ) d χ ( x ) = X h ( x ) χ ( K x , f K x , f ) = X h ( x ) i = 1 n c i 1 S i ( x , x ) d χ ( x ) = c 1 X h ( x ) 1 S 1 ( x , x ) d χ ( x ) + i = 2 n c i X h ( x ) 1 S i ( x , x ) d χ ( x ) = χ ( P ) X h ( x ) 1 S 1 ( x , x ) d χ ( x ) + i = 2 n c i X h ( x ) 1 S i ( x , x ) d χ ( x ) ,
where the second line follows from Theorem 1. □

4.2. Quadric Euler Characteristic Transform

Let V be the space of real n × n symmetric matrices equipped with a definable norm | | · | | V (recall the notations in Definition 3). Recall that a general quadric surface is given by
x T A x + v · x = t
where A V , v R n , and t R . Then it would seem that a natural definition (that turns out to be not desirable) of QECT on a constructible function f : R n Z would be
QECT ( f ) : S V × S n 1 × R Z , QECT ( f ) ( A , v , t ) = X f ( x ) 1 X t A , ν ( x ) d χ ( x ) ,
where X t A , ν denotes the set { x T A x + v · x t } .
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 A S V such that | | A | | V = 0 , so we cannot recover the ECT from this definition of the QECT.
The domain of ECT ( f ) is S n 1 × R 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 V × R n . We define the norm | | · | | W on W as
| | ( A , v ) | | W = | | A | | V + | v | for all ( A , v ) W = V × R n .
Let X R n be a definable set and f : X Z be a constructible function; the quadric Euler characteristic transform of f is the function QECT ( f ) : S W × R Z defined by
QECT ( f ) ( A , v , t ) = X f ( x ) 1 X t A , ν ( x ) d χ ( x ) .
Example 4.
Let S 1 = R n , S 2 = , and I be the n × n identity matrix. We have that QECT ( S 1 ) ( I , 0 , t ) QECT ( S 2 ) ( I , 0 , t ) . Hence, the QECT can tell the difference between S 1 and S 2 compared to Example 3.
Now we will analyze a few properties of the QECT. First of all, when v = 0 is fixed to be the zero vector, we note that the function f { ( A , t ) QECT ( f ) ( A , 0 , t ) } , which we will refer to as QECT ( , 0 , ) : CF ( R n ) CF ( S V × R ) , is not injective.
Example 5.
Let p R n be the vector whose components are all unity, f ( x ) = 1 p ( x ) , and g ( x ) = 1 p ( x ) . We have that QECT ( f ) ( A , 0 , t ) = QECT ( g ) ( A , 0 , t ) for all ( A , t ) S V × R .
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 v = 0 be fixed. The transform QECT ( , 0 , ) : CF ( R n ) CF ( S V × R ) is “injective up to sign”. More precisely, let h : X R n . We obtain an inversion formula reminiscent of the Schapira inversion formula,
( R K f R K f h ) ( x ) = ( μ λ ) z { + x , x } h ( z ) + λ ( X h d χ ) 1 X ,
where μ and λ are distinct integers.
Proof. 
We will use Lemma 3 to prove this theorem. Since v = 0 , | | A | | V = 1 | v | = 1 . Thus, the function ( A , t ) QECT ( f ) ( A , 0 , t ) has domain S V × R . Following the setup of Definition 7, we choose X = R n , P = S V , and f : X × P R to be the function ( x , A ) x T A x . By Lemma 2 and the property that A is symmetric,
χ ( K x , f K x , f ) = χ ( { A P | ( x ) T A ( x ) ( x ) T A ( x ) 0 } ) = χ ( { A P | ( x + x ) T A ( x x ) 0 } ) .
If x = x or x = x , then ( x + x ) T A ( x x ) = 0 . Hence, χ ( K x , f K x , f ) = χ ( S V ) .
Otherwise, suppose x { ± x } , then consider the function ϕ : V R given by ϕ ( A ) = ( x + x ) T A ( x x ) . Since ( x + x ) and ( x x ) are both non-zero vectors, ϕ is a surjective linear transformation, and hence ker ( ϕ ) is a codimension 1 linear subspace of V. ker ( ϕ ) inherits a natural norm from V and hence S V ker ( ϕ ) = S ker ( ϕ ) .
Since all norms on a finite-dimensional real vector space are equivalent, the map ψ : S V S dim V 1 by ψ ( x ) = x | x | is a definable homeomorphism whose restriction to S ker ( ϕ ) gives a homeomorphism between S ker ( ϕ ) and the 2 unit sphere of ker ( ϕ ) .
By Alexander duality, H ˜ 0 ( S V S ker ( ϕ ) ) H ˜ dim V 1 1 ( S ker ( ϕ ) ) Z , so S V S ker ( ϕ ) has two connected components. Since ϕ is an odd function, we will denote the two connected components as S + V and S V corresponding to the locus where ϕ is positive and negative, respectively. Hence, the map ψ : S V S dim V 1 brings ker ( f ) S + V homeomorphically to a closed hemisphere of S dim V 1 . Thus, the set ker ( f ) S + V is compact and contractible, so we conclude that χ ( K x , f K x , f ) = 1 .
Let μ = χ ( P ) and λ = 1 . By Lemma 3, we can write
( R K f R K f ) h ( x ) = μ R n h ( x ) 1 ± Δ ( x , x ) d χ ( x ) + λ R n h ( x ) 1 { X × X ± Δ } ( x , x ) d χ ( x ) ,
where 1 ± Δ ( x , x ) = 1 if x { ± x } and is 0 otherwise. Finally, we can furthermore simplify the expression as
( R K f R K f ) h ( x ) = μ { ± x } h ( x ) d χ ( x ) + λ R n { ± x } h ( x ) d χ ( x ) = ( μ λ ) { ± x } h ( x ) d χ ( x ) + λ R n h ( x ) d χ ( x ) = ( μ λ ) z { ± x } h ( z ) + λ R n h ( x ) d χ ( x ) .
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 B R ( 0 ) denote the closed ball of radius R for some R 0 centered at the origin. Fix the norm on V to be the operator norm | | · | | o p , and let A V be fixed such that | | A | | o p < 1 1 + 2 R 2 . Define the transform QECT ( A , , ) : CF ( B R ( 0 ) ) CF ( P × R ) by f { ( v , t ) QECT ( f ) ( A , v , t ) } , where P is the sphere of radius 1 | | A | | o p in R n . Then, QECT ( A , , ) is injective.
Remark 1.
Theorem 5 interpolates between Theorems 2 and 4 in the following sense. When | | A | | o p = 1 , the inequality 1 < 1 1 + 2 R 2 does not hold for any value of R. This reflects the fact that ( A , t ) QECT ( A , 0 , t ) is only injective up to signs in Theorem 4 and Example 5. When | | A | | o p = 0 , 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 0 < 1 1 + 2 R 2 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 | | · | | V on V that satisfies the property | | x T A x | | V | | A | | V | x | 2 . Common examples include the Frobenius norm and the nuclear norm. Furthermore, by adjusting the constant 1 1 + 2 R 2 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 X = B R ( 0 ) , P = { v R n | | v | = 1 | | A | | o p } , and f : X × P R to be the function ( x , v ) x T A x + v · x . By Lemma 2 and the property that A is symmetric,
χ ( K x , f K x , f ) = χ ( { v P | ( x ) T A ( x ) + v · ( x ) ( x ) T A ( x ) v · x 0 } ) = χ ( { v P | ( x + x ) T A ( x x ) + v · ( x x ) 0 } ) .
If x = x , we have that χ ( K x , f K x , f ) = χ ( P ) . Otherwise, if x x , we can consider the function ϕ : R n R by ϕ ( v ) = ( x + x ) T A ( x x ) + v · ( x x ) . In this case, we have that χ ( K x , f K x , f ) = χ ( { v P | ϕ ( v ) 0 } ) .
It remains for us to determine χ ( { v P | ϕ ( v ) 0 } ) . Since x x is not the zero vector, ϕ is a surjective affine map and ker ( ϕ ) is a hyperplane in R n . Furthermore, the vector ( x x ) | x x | is a unit normal vector to ker ( ϕ ) , and ker ( ϕ ) may be written as the sum
ker ( ϕ ) = ker { v v · ( x x ) } ( x + x ) T A ( x x ) | x x | ( x x ) .
This is because for any v ( x + x ) T A ( x x ) | x x | ( x x ) in the right hand side above,
ϕ ( v ( x + x ) T A ( x x ) | x x | ( x x ) ) = ( x + x ) T A ( x x ) + v ( x + x ) T A ( x x ) | x x | ( x x ) · ( x x ) = ( x + x ) T A ( x x ) + 0 ( x + x ) T A ( x x ) | x x | | x x | = ( x + x ) T A ( x x ) ( x + x ) T A ( x x ) = 0 .
Now we observe that
| ( ( x + x ) T A ( x x ) | = | ( x ) T A ( x ) ( x ) T A ( x ) | | x T A x | + | ( x ) T A ( x ) | | | A | | o p | x | 2 + | | A | | o p | x | 2 | | A | | o p ( 2 R 2 ) < 2 R 2 1 + 2 R 2 = 1 1 1 + 2 R 2 < 1 | | A | | o p ,
where the fifth and last line both follow from the assumption | | A | | o p < 1 1 + 2 R 2 . The space { v P | ϕ ( v ) 0 } is one of the two sides of the sphere P divided by the hyperplane ker ( ϕ ) . Since the radius of P is 1 | | A | | o p and | ( x + x ) T A ( x x ) | < 1 | | A | | o p , the normal vector ( x + x ) T A ( x x ) supporting the hyperplane ker ( ϕ ) has length strictly less than the radius of P. This means that the space { v P | ϕ ( v ) 0 } is a compact, contractible, and definable subset of P. It then follows that
χ ( K x , f K x , f ) = χ ( { v P | ϕ ( v ) 0 } ) = 1 .
Thus, by Lemma 3, for all x R n ,
R K f R K f h = [ 1 + ( 1 ) n 1 ] h ( x ) + R n h ( x ) 1 { ( x , x ) Δ } d χ ( x ) = [ 1 + ( 1 ) n 1 ] h ( x ) + R n { x } h ( x ) d χ ( x ) = [ 1 + ( 1 ) n 1 ] h ( x ) + R n h ( x ) d χ ( x ) { x } h ( x ) d χ ( x ) = [ ( 1 ) n 1 ] h ( x ) + R n h ( x ) d χ ( x ) .
Since h ( x ) CF ( B R ( 0 ) ) has compact support, QECT would determine the value of R n h ( x ) d χ ( x ) . Thus, the transform QECT ( A , , ) : CF ( B R ( 0 ) ) CF ( P × R ) 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:
ECTEuler characteristic transform
QECTQuadric Euler characteristic transform
TDATopological data analysis
CFConstructible functions
| | · | | o p Operator norm
| · | 2 norm
VThe space of real n × n symmetric matrices
W V × R n

Appendix A. Inversion Formula of ECT without Compact Support

Here, we reprove the inversion formula of ECT in [10] without the assumption that h : R n Z is compactly supported. The proof will be similar to that of [10].
Proof of Equation
(1). Following the setup of Definition 7, we choose X = R n , P = S n 1 , and f : X × P R to be the function ( x , ν ) x · ν . By Lemma 2, we can compute that
χ ( K x , f K x , f ) = χ ( { ν S n 1 | f ( x , ν ) f ( x , ν ) 0 } ) = χ ( { ν S n 1 | ( x x ) · ν 0 } ) = χ ( S n 1 ) , x = x χ ( S + n 1 ) , x x = 1 + ( 1 ) n 1 , x = x 1 , x x ,
where S + n 1 denotes the closed upper hemisphere of S + n 1 . By Lemma 3, for all x R n ,
( R K R K ) h = [ 1 + ( 1 ) n 1 ] h ( x ) + R n h ( x ) 1 { ( x , x ) Δ } d χ ( x ) = [ 1 + ( 1 ) n 1 ] h ( x ) + R n h ( x ) d χ ( x ) { x } h ( x ) d χ ( x ) = [ ( 1 ) n 1 ] h ( x ) + R n h ( x ) d χ ( x ) .
The proof of Equation (1) is completed. □

References

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Hacquard, O.; Lebovici, V. Euler characteristic tools for topological data analysis. arXiv 2023, arXiv:2303.14040. [Google Scholar]
  7. 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]
  8. 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]
  9. 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]
  10. Ghrist, R.; Levanger, R.; Mai, H. Persistent homology and Euler integral transforms. J. Appl. Comput. Topol. 2018, 2, 55–60. [Google Scholar] [CrossRef]
  11. Ghrist, R. Elementary Applied Topology; Createspace: Seattle, DC, USA, 2014; Volume 1. [Google Scholar]
  12. van den Dries, L. Tame Topology and O-Minimal Structures; Cambridge University Press: Cambridge, UK, 1998; Volume 248. [Google Scholar]
  13. 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]
  14. Curry, J.; Ghrist, R.; Robinson, M. Euler calculus with applications to signals and sensing. Proc. Symp. Appl. Math. 2012, 70, 75–146. [Google Scholar]
  15. Gusein-Zade, S.M. Integration with respect to the Euler characteristic and its applications. Russ. Math. Surv. 2010, 65, 399. [Google Scholar] [CrossRef]
  16. Munch, E. An invitation to the Euler characteristic transform. arXiv 2023, arXiv:2310.10395. [Google Scholar]
  17. 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.

Share and Cite

MDPI and ACS Style

Ji, M. On the Injectivity of Euler Integral Transforms with Hyperplanes and Quadric Hypersurfaces. Mathematics 2024, 12, 2339. https://doi.org/10.3390/math12152339

AMA Style

Ji M. On the Injectivity of Euler Integral Transforms with Hyperplanes and Quadric Hypersurfaces. Mathematics. 2024; 12(15):2339. https://doi.org/10.3390/math12152339

Chicago/Turabian Style

Ji, Mattie. 2024. "On the Injectivity of Euler Integral Transforms with Hyperplanes and Quadric Hypersurfaces" Mathematics 12, no. 15: 2339. https://doi.org/10.3390/math12152339

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop