Isometry Theorem for Continuous Quiver of Type
Abstract.
The Isometry Theorem for continuous quiver of type plays an important role in persistent homology. In this paper, we shall generalize Isometry Theorem to continuous quiver of type .
Key words and phrases:
Continuous quiver, Isometry Theorem2010 Mathematics Subject Classification:
Primary 16G20; Secondary 55N31.1. Introduction
Representation theory of quivers is important in persistent homology and widely used in topological data analysis.
Gabriel gave the classification of indecomposable representations of quivers of finite type in [11]. In [10], Crawley-Boevey gave a classification of indecomposable representations of . In [6], Botnan gave a classification of indecomposable representations of infinite zigzag. Igusa, Rock and Todorov introduced general continuous quivers of type and classified indecomposable representations in [14]. In [1, 2, 18, 19], Appel, Sala and Schiffmann introduced continuum quivers independently. By using these results, persistence diagrams corresponding to representations are defined.
The Isometry Theorem shows that the interleaving distance between two representations of a given quiver is equal to the bottleneck distance between corresponding persistence diagrams. The stability part of Isometry Theorem for continuous quiver was given by Cohen-Steiner-Edelsbrunner-Harer in [9], Chazal-De Silva-Glisse-Oudot in [8] and Bauer-Lesnick in [3]. The converse stability part was given by Bubenik-Scott in [7] and Lesnick in [16]. In addition, Botnan studied the stability of zigzag persistence modules in [5]. For the history of Isometry Theorem, see [17].
In [13], Hanson and Rock introduced continuous quivers of type and gave a classification of indecomposable representations. In[15, 18, 19], Igusa-Todorov and Sala-Schiffmann also study continuous quivers of type and its persistence representations.
In this paper, we shall give an Isometry Theorem for continuous quivers of type . The proof of this theorem is based on the equivalence between the category of representations of continuous quivers of type and that of continuous quivers of type with automorphism.
In Section 2, we shall recall Isometry Theorem for continuous quivers of type . The Isometry Theorem for continuous quivers of type will be given in Section 3 and its proof will be given in Section 4.
2. Continuous quivers of type
2.1. Continuous quivers of type
Let be the set of real numbers and be the normal order on . Following notations in [14], is called a continuous quiver of type .
Let be a fixed field. A representation of over is given by , where is a -vector space for any and is a -linear map for any satisfying that for any . Let and be two representations of . A family of -linear maps is called a morphism from to , if = , for any .
Denoted by the category of representations of and by the subcategory of pointwise finite-dimensional representations.
For each , we use the notation for one of and . In this paper, we allow or , that is the notation may mean , or , too.
Denote as the following representation of , where
and
The representation is called an interval representation.
2.2. Isometry Theorem
In this section, we follow the notation in [17].
Let and be two representations of . For , a family of linear map is called a morphism of degree from to if the diagram
is commutative for any . Denoted by the set of morphisms of degree from to .
An -interleaving between and is two families of morphisms and such that the diagrams
are commutative for any .
The interleaving distance of representations of is defined as
For a pointwise finite-dimensional representation of . The set of intervals for all is called the persistence barcodes of . The multiset of points with coordinate is called the persistence diagram of .
Let and be two multisets of points in the extended plane . A partial matching between and is a subset of such that
-
(1)
there is at most one point such that for any ;
-
(2)
there is at most one point such that for any .
The bottleneck cost of the partial matching is defined as
where is the set of unmatched points in . The bottleneck distance between and is defined as
Theorem 2.1 ([17]).
Let and be two pointwise finite-dimensional representations of continuous quiver of type . Then,
3. Continuous quivers of type
3.1. Continuous quivers of type
We define an equivalence ”” on , where if and only if for any . Let be the equivalent class of for any and define if and only if and . Let , which is called a continuous quiver of type .
A representation of over is given by , where is a -vector space, and is a -linear map for any satisfying that for any . Let and be representations of . A family of -linear maps is called a morphism from V to W, if it satisfies = , for any .
Let be a representation of over . The representation V are called nilpotent, provided that the linear map is nilpotent for any .
Denoted by the category of nilpotent representations of and by the subcategory of pointwise finite-dimensional representations.
For each , consider a representation of , defined by
Since the representation is indecomposable, is an indecomposable representation of . The representation are called interval representations.
Hanson and Rock proved the following theorem in [13].
Theorem 3.1 ([13]).
Let be a pointwise finite-dimensional nilpotent representation of . Then, it can be decomposed into the direct sum of indecomposable interval representations
3.2. Isometry Theorem
Let , be two representations of . For , a family of linear maps is called a morphism of degree from to if the diagram
is commutative for any such that . Denoted by the set of morphisms of degree from to .
An -interleaving between and is two morphisms and such that the diagrams
are commutative for any .
The interleaving distance of representations between and is defined as
Consider an equivalence ”” on , where if and only if for any . Let be a pointwise finite-dimensional nilpotent representation of . The multiset in consisting of equivalent classes of points with coordinate is called the persistence diagram of .
Let and be two multisets in . A partial matching between and is a subset of such that
-
(1)
there is at most one such that for any ;
-
(2)
there is at most one such that for any .
The bottleneck cost of the partial matching is defined as
where and is the set of unmatched elements in . The bottleneck distance is defined as
The following theorem is the main result in this paper.
Theorem 3.2.
Let and be two pointwise finite-dimensional nilpotent representations of . Then,
The proof of this theorem will be given in the next section.
4. The proof of the main result
4.1. Continuous quivers of type with automorphism
In this section, we follow the notation in [12].
Consider a morphism sending to . In this paper, is called a continuous quiver of type with automorphism . A representation of Q over is given by a representation of such that for any and for any .
For a representation of , consider a representation , where and . Note that is representation of . Let
Since the representation is indecomposable, so is . The representation is called an interval representation of Q.
Denoted by the category of representations of Q. Denote the subcategory of consisting of pointwise finite-dimensional representations.
Note that there exists an equivalence
such that for any and for any such that . By definitions, we have
Let be a pointwise finite-dimensional representation of Q. Theorem 3.1 implies that can be decomposed into the direct sum of indecomposable interval representations
For two representations , of and , let be the set consisting of morphisms of degree such that .
An -interleaving of representations between and is two families of morphisms and such that the following diagrams are commutative for any .
The interleaving distance of and is defined as
4.2. The proof of the main result
Let be a map sending to .
Lemma 4.1.
Let and be two -invariant multisets of points in and denote and . Assume that and are finite multisets. Then we have
Proof.
At first, we shall prove
(4.1) |
Assume that . Let be a partial matching between and . If , then we have . If is finite, we shall prove , too.
Denoted by the subset of consisting of such that all points in are matched points in . Let be the subset of satisfying that
-
(1)
for any , there exist some and some such that ;
-
(2)
for any and , it holds that .
Since is finite, we have . Then we can get a bijection between and a subset of satisfying that there are some and some with for any .
Similarly, denoted by the subset of consisting of such that all points in are matched points in . Let be a subset of satisfying that
-
(1)
for any , there exist some and some such that ;
-
(2)
for any and , it holds that .
Since is finite, we have . Then we can get a bijection between and a subset of satisfying that there are some and some with for any .
Let . For convenience, assume that if and if . Let
and
For any , we have a sequence
where with or . In the first case, let
In the second case, let
Let
Let
Note that is a partial matching between and . Hence, we have by definition.
Since for any , we have
(4.2) |
Meanwhile, the point is unmatched in implies that is unmatched in for any . Let and be the sets of unmatched elements in and respectively. Hence, we have
(4.3) |
Then, we shall prove
(4.4) |
Assume that . Let be a partial matching between and . For any and any , there exists such that . Let be the set of all considered above. Since the sets and are -invariant, is a subset of , is a subset of and is a partial matching between and . Hence, we have by definition.
Since for any , we have
(4.5) |
by constructions. Meanwhile, the point is unmatched in if and only if is unmatched in for any . Let and be the sets of unmatched elements in and respectively. Hence, we have
(4.6) |
∎
Proposition 4.2.
For two pointwise finite-dimensional nilpotent representations and of , we have
Proof.
Since is an equivalence between and , we have
(4.7) |
Note is a subset of . Hence,
By using Theorem 2.1, we have
Since and are -invariant multisets such that and are finite, Lemma 4.1 implies that
(4.8) |
Hence, we get the desired result.
∎
Lemma 4.3 ([17]).
Let , be two intervals. Then,
where , are the corresponding points in .
Lemma 4.4.
Let , be two intervals. Then,
where , are the corresponding points in and , are the equivalent classes in .
Proof.
By definition of , we can choose and such that
(4.9) |
By Lemma 4.3, there is a -interleaving of and such that
(4.10) |
Since
and
the pair of maps is a -interleaving of and . Hence,
(4.11) |
∎
Similarly to the proof of the converse stability part of Theorem 2.1 in [17], we have the following lemma.
Lemma 4.5.
For two representations and of , we have
Proof.
Let and be two representations of Q and . By definitions, the representations and can be wrote as direct sums of indecomposable interval representations as follows
and there is a partial matching between the direct summands of and those of such that
-
(1)
is matched with for any ,
-
(2)
is unmatched for any ,
-
(3)
is unmatched for any .
By Lemma 4.4, we have .
If and , then
Hence, we have .
∎
Proposition 4.6.
For two representations and of . we have
References
- [1] A. Appel and F. Sala. Quantization of continuum Kac–Moody algebras. Pure and Applied Mathematics Quarterly, 16(3):439–493, 2020.
- [2] A. Appel, F. Sala, and O. Schiffmann. Continuum Kac–Moody algebras. Moscow Mathematical Journal, 22(2):177–224, 2022.
- [3] U. Bauer and M. Lesnick. Induced matchings of barcodes and the algebraic stability of persistence. In Proceedings of the Thirtieth Annual Symposium on Computational Geometry, SOCG’14, page 355–364, New York, NY, USA, 2014. Association for Computing Machinery.
- [4] M. Botnan and W. Crawley-Boevey. Decomposition of persistence modules. Proceedings of the American Mathematical Society, 148(11):4581–4596, 2020.
- [5] M. Botnan and M. Lesnick. Algebraic stability of zigzag persistence modules. Algebraic Geometric Topology, 18(6):3133–3204, 2018.
- [6] M. B. Botnan. Interval decomposition of infinite zigzag persistence modules. Proceedings of the American Mathematical Society, 145(8):3571–3577, 2017.
- [7] P. Bubenik and J. A. Scott. Categorification of persistent homology. Discrete Computational Geometry, 51:600–627, 2014.
- [8] F. Chazal, V. De Silva, M. Glisse, and S. Oudot. The structure and stability of persistence modules. Springer, 2016.
- [9] D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete Computational Geometry, 37:103–120, 2007.
- [10] W. Crawley-Boevey. Decomposition of pointwise finite-dimensional persistence modules. Journal of Algebra and its Applications, 14(05):1550066, 2015.
- [11] P. Gabriel. Unzerlegbare darstellungen I. Manuscripta mathematica, 6:71–103, 1972.
- [12] X. Gao and M. Zhao. Maximal rigid representations of continuous quivers of type A with automorphism. arXiv:2410.07210, 2024.
- [13] E. J. Hanson and J. D. Rock. Decomposition of pointwise finite-dimensional persistence modules. Journal of Algebra and Its Applications, 23(03):2450054, 2024.
- [14] K. Igusa, J. D. Rock, and G. Todorov. Continuous quivers of type (I) foundations. Rendiconti del Circolo Matematico di Palermo Series 2, 72(2):833–868, 2023.
- [15] K. Igusa and G. Todorov. Continuous Frobenius Categories, pages 115–143. Springer, Berlin, Heidelberg, 2013.
- [16] M. Lesnick. The theory of the interleaving distance on multidimensional persistence modules. Foundations of Computational Mathematics, 15(3):613–650, 2015.
- [17] S. Y. Oudot. Persistence theory: from quiver representations to data analysis, volume 209. American Mathematical Society, 2017.
- [18] F. Sala and O. Schiffmann. The circle quantum group and the infinite root stack of a curve. Selecta Mathematica, 25(77):1–86, 2019.
- [19] F. Sala and O. Schiffmann. Fock space representation of the circle quantum group. International Mathematics Research Notices, 2021(22):17025–17070, 2021.