Isometry Theorem for Continuous Quiver of Type $\tilde{A}$

Minghui Zhao; Xiaowen Gao

REVIEW 3 major objections 4 minor 2 cited by

Isometry Theorem for Continuous Quiver of Type $\tilde{A}$

T0 review · 3 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The Isometry Theorem for persistence extends from the real line to the circle.

desk verdict The paper's main theorem is plausible and the topic is timely, but the proof has a load-bearing finiteness gap in Proposition 4.3, and Lemma 4.2 contains a false cardinality claim. read the letter →

arxiv 2412.12462 v2 pith:HS3QGK6M submitted 2024-12-17 math.RT

Xiaowen Gao , Minghui Zhao This is my paper · ORCID

classification math.RT MSC 16G2055N31

keywords continuousquiverisometrytheorempersistencediagrambottleneckdistanceinterleavingnilpotentrepresentationcircle-valued

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper's goal is to prove an Isometry Theorem for the continuous quiver $\tilde A_R$, whose vertices are points of $\mathbb{R}$ modulo integer shifts, i.e. a circle. The main theorem says that for pointwise finite-dimensional nilpotent representations $V$ and $W$ of this quiver, the bottleneck distance between their persistence diagrams in $\mathbb{R}^2/\sim$ equals the interleaving distance between the representations. If correct, this carries the central stability result of persistent homology from the real line to circle-valued persistence modules, so periodic and angular data are covered by the same distance identity. The proof works by transporting representations through a category equivalence to a continuous quiver of type $A$ with an automorphism, where the classical Isometry Theorem and a comparison lemma for quotient bottleneck distances complete the argument.

What carries the argument

The load-bearing device is the category equivalence $\Psi$ between representations of $\tilde A_R$ and representations of a continuous quiver of type $A$ with automorphism $Q=(A_{\mathbb{R}},\sigma)$, where $\sigma(x)=x+1$. Interval representations of $\tilde A_R$ become direct sums over $\mathbb{Z}$ of translates of ordinary interval representations, and $\Psi$ preserves interleaving distances. The proof then combines the classical Isometry Theorem for $A_{\mathbb{R}}$ with Lemma 4.2, which compares the bottleneck distance of a $\sigma$-invariant multiset in $\mathbb{R}^2$ with the bottleneck distance of its quotient in $\mathbb{R}^2/\sim$, assuming the quotient multiset is finite. Lemmas 4.4 through 4.6 transfer the standard interleaving estimates for single intervals to the quotient setting, yielding both inequalities.

What would settle it

Take $V=\bigoplus_{n\in\mathbb{N}} T_{|n,\ n+1/(n+2)|}$ and $W=0$: $V$ is pointwise finite-dimensional and nilpotent, but its barcode has infinitely many distinct classes in $\mathbb{R}^2/\sim$, so Proposition 4.3's finiteness assertion is false and Lemma 4.2 does not apply. Computing $d_{b,\mathbb{R}^2/\sim}(\operatorname{dgm}(V),\operatorname{dgm}(W))$ and $d_{i,\tilde A_R}(V,W)$ for this pair (or a pair of two such sums) settles whether the stated theorem still holds for infinite quotient diagrams or whether the proof needs an additional hypothesis.

Watch

Extended reading notes

Core claim

The central claim (Theorem 3.2) is exact equality $$d_{b,\mathbb{R}^2/\sim}(\operatorname{dgm}(V),\operatorname{dgm}(W)) = d_{i,\tilde A_R}(V,W)$$ for every pair of pointwise finite-dimensional nilpotent representations $V,W$ of $\tilde A_R$. The persistence diagram $\operatorname{dgm}(V)$ is the multiset in $\mathbb{R}^2/\sim$ formed by the equivalence classes of the endpoint pairs $(a_i,b_i)$ in the interval decomposition $V=\bigoplus_i T_{|a_i,b_i|}$. The intended reading is that two circular persistence modules are $\varepsilon$-interleaved exactly when their barcodes admit a partial matching whose bottleneck cost is at most $\varepsilon$. This is the direct analogue, for the circle, of the classical Isometry Theorem for the continuous quiver of type $A$.

Load-bearing premise

The proof assumes, without proof, that every pointwise finite-dimensional nilpotent representation has a persistence diagram with only finitely many classes after identifying barcode endpoints that differ by an integer shift; this finiteness is needed to apply the quotient bottleneck comparison lemma, and the argument gives no reason to think it always holds.

Editorial extensions

If this is right

The interleaving distance between two pointwise finite-dimensional nilpotent representations of $\tilde A_R$ is completely determined by their persistence diagrams.
Stability holds in both directions: a bottleneck distance at most $\varepsilon$ between diagrams is equivalent to an $\varepsilon$-interleaving, so small changes in barcodes cannot hide large structural changes in the modules.
Circle-valued persistence modules, which arise in data with angular or periodic coordinates, now satisfy the same distance identity that was previously known only for modules indexed by the real line.
Bottleneck distance on $\mathbb{R}^2/\sim$ provides an intrinsic metric on isomorphism classes of these representations, since it coincides with the interleaving distance defined directly from morphisms.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The proof does not establish finiteness of the quotient persistence diagram; because pointwise finite-dimensionality alone need not force finitely many $\mathbb{Z}$-orbits of barcode endpoints, the theorem as stated likely requires an additional approximation argument for infinite quotient diagrams.
The same quotient construction should work for other discrete translation groups acting on $\mathbb{R}$, giving isometry theorems for persistence modules on other periodic quotient spaces, provided a finite-barcode condition holds.
A direct computation of both distances for a pair with accumulating barcode endpoints would show whether the finiteness assumption is merely a proof artifact or a genuine restriction on the validity of the theorem.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Quick take: this is a reasonable short paper that wants to extend the Isometry Theorem to circle-valued persistence (type tilde A). The main theorem is new in the literature and, if true, would be useful for TDA on circle-parameterized data. The proof route -- go through Rock-Zhu equivalence to type A with automorphism, then reduce to the classical Isometry Theorem -- is sensible and mostly clearly explained.

What's good: the paper states the theorem cleanly, cites the right prior work (Oudot, Hanson-Rock, Rock-Zhu), and the lemmas for indecomposable intervals (4.5, 4.6) look fine. The reduction in Proposition 4.3 is structurally sound.

The problem is in the middle of the proof. Proposition 4.3 asserts without proof that dgm(Ψ(V)) and dgm(Ψ(W)) are finite. That is not a consequence of the hypotheses. A pointwise finite nilpotent representation of tilde A can absolutely have infinitely many interval summands with distinct orbit classes -- e.g. take intervals of length 1/(n+1)^2 for each n in a disjoint family near 0. This gives an infinite barcode, and there is no reason to think Ψ sends it to a finite multiset. Lemma 4.2 explicitly requires finite quotients, so Proposition 4.3 cannot invoke it.

There is also a separate issue inside Lemma 4.2's proof: the line "Since c(P) is finite, we have |B''| >= |A'|" does not follow. Finite cost controls the distance of matched pairs and the spread of unmatched points; it doesn't bound the number of orbit classes. A sigma-invariant matching can match points from two different A-orbits into the same B-orbit, so the cardinality inequality can fail.

These aren't cosmetic. They are the load-bearing steps that connect the tilde-A distance to the quotient bottleneck. The theorem itself might be true, and a repair may be straightforward -- for example, add a finiteness or tameness hypothesis on the barcodes, or prove a limiting version of Lemma 4.2 for infinite multisets. But the proof as written does not establish Theorem 3.2.

Who is this for: researchers in persistent homology who care about circle-valued data. A serious referee should see it. I'd suggest sending to review with the expectation of major revision rather than desk rejecting, because the statement is natural and the gap is identifiable rather than hopeless.

Referee Report

3 major / 4 minor

Summary. The paper aims to generalize the Isometry Theorem from continuous quivers of type A to continuous quivers of type \tilde{A} (the circle). Using the Rock–Zhu equivalence between representations of \tilde{A}_R and representations of a continuous quiver of type A with an automorphism (denoted Q), the authors claim that for pointwise finite-dimensional nilpotent representations V and W of \tilde{A}_R, the bottleneck distance between their persistence diagrams in R^2/\sim equals the interleaving distance on \tilde{A}_R. The proof splits into two inequalities: Proposition 4.3 (stability, using the type-A theorem and a lemma comparing bottleneck distances on R^2 and R^2/\sim) and Proposition 4.7 (converse, using a lemma on interleavings of interval representations).

Significance. If correct, the result would extend the isometry theorem to circle-valued persistence modules, a natural and potentially useful setting for topological data analysis and representation theory. The paper's strategy—importing the well-established type-A theorem and the Rock–Zhu equivalence—is attractive and would make the proof short. However, the proof as written contains significant gaps concerning infinite barcodes and a false assertion in Lemma 4.2. These issues are load-bearing: they affect both directions of the claimed isometry. The underlying idea is plausible, but the current manuscript does not establish Theorem 3.2 in its stated generality.

major comments (3)

[§4.2, Proposition 4.3] The assertion that dgm(Ψ(V)) and dgm(Ψ(W)) are finite is unjustified and in fact false in general under the theorem's hypotheses. Pointwise finite-dimensional nilpotent representations of \tilde{A}_R can have infinite barcodes. For example, take V = ⊕_{n≥1} T_{[1/(n+1), 1/(n+1)+1/(n+1)^2]}. This is pointwise finite-dimensional because for any circle coordinate, only finitely many intervals cover it, and it is nilpotent because every interval has length less than 1. Its persistence diagram has one orbit class per n, so the quotient multiset in R^2/\sim is infinite. Thus Lemma 4.2, which requires finite quotient multisets, cannot be applied. Without a limiting argument that replaces Lemma 4.2 or an additional finiteness hypothesis in Theorem 3.2, the inequality in Proposition 4.3—and hence Theorem 3.2—is not proved in the stated generality.
[§4.2, Lemma 4.2] The proof of Lemma 4.2 contains a false step: 'Since c(P) is finite, we have |\bar{B}''| ≥ |\bar{A}'|.' Because A and B are σ-invariant, each orbit is infinite, so a single orbit of B can absorb matches from many different orbits of A. Concretely, let A have two orbits \bar{a}_1, \bar{a}_2 and B have one orbit \bar{b}. Match the n-th point of \bar{a}_1 to a point in \bar{b} with offset ε, and the n-th point of \bar{a}_2 to another point in \bar{b} with offset 1/2+ε, choosing distinct points in \bar{b}. Then all points in both \bar{a}_1 and \bar{a}_2 are matched with bounded cost, so |\bar{A}'|=2 while |\bar{B}''|=1, contradicting the claim. Consequently inequality (4.1) is not established. The lemma requires a correct proof, or the paper must find another way to relate bottleneck distances on R^2 and R^2/\sim for σ-invariant multisets.
[§4, Lemma 4.6] The proof of Lemma 4.6 is sketched as 'Similarly to the proof of the converse stability part of Theorem 2.1 in [17]' and then uses a direct-sum decomposition with a partial matching of summands. For infinite barcodes this is not justified: one needs to show that an interleaving of infinite direct sums can be assembled from interleavings of matched summands, that the maximum (or supremum) of distances over an infinite matching is attained or handled by limits, and that unmatched intervals at the boundary are controlled. This is the same infinity issue raised in Proposition 4.3; as written, the converse inequality di_{\tilde{A}_R}(V,W) ≤ db_{R^2/\sim}(dgm(V),dgm(W)) is also not fully proved for the stated class of representations.

minor comments (4)

[§3.2, Theorem 3.2] In the statement of Theorem 3.2, 'db,, R2/ ∼' contains a double comma; it should read 'db_{R^2/\sim}'.
[§4.2, Proposition 4.3, Eq. (4.8)] In Equation (4.8), the expression 'db_{R^2}(dgm(Ψ(V)), Ψ(dgm(W)))' appears to have a typo; it should be 'db_{R^2}(dgm(Ψ(V)), dgm(Ψ(W)))'.
[§3.2, bottleneck distance definition] The definition of the bottleneck cost on R^2/\sim uses the term sup_{\bar{s}=(s_x,s_y)∈S} (s_x−s_y)/2, which is not well-defined because the value depends on the chosen representative of the equivalence class \bar{s}. The authors should specify that the infimum over representatives (or an invariant representative, e.g., with first coordinate in [0,1)) is taken.
[§4.1] The interval representation T_{|a,b|} of Q introduced as ⊕_{k∈Z}(σ^*)^k(T_{|a,b|}) uses the same notation as the interval representation of \tilde{A}_R from §3.1. This notational collision is confusing, especially because Ψ(T_{|a,b|}) = T_{|a,b|} is claimed; consider using distinct notations for the two types of interval representations.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper transports an independent type-A isometry theorem via the Rock-Zhu equivalence, with no fitted parameters or self-referential definitions; the unproven finiteness assertion in Proposition 4.3 is a gap, not circularity.

full rationale

The derivation of Theorem 3.2 is an external-theorem reduction rather than a self-referential one. The paper imports (i) the type-A Isometry Theorem (Theorem 2.1, from Oudot [17]), (ii) the Hanson-Rock decomposition of pointwise finite-dimensional nilpotent tilde-A representations (Theorem 3.1, [13]), and (iii) the Rock-Zhu equivalence Psi between tilde-A and A-with-automorphism representations (Section 4.1, [18]). Each imported result is cited to independent prior work; none is derived from the target isometry. The only self-citation, [12], supplies notation in Section 4.1 ('In this section, we follow the notation in [12]') and no combinatorial or metric input to the inequalities. There are no fitted parameters, no quantity is defined in terms of the quantity it is used to predict, and the final equality is not assumed in any hypothesis. The one serious issue in the proof is Proposition 4.3's unsupported assertion that the sigma-invariant multisets dgm(Psi(V)) and dgm(Psi(W)) are finite, which is needed to apply Lemma 4.2 and is not proved from the pointwise finite-dimensional nilpotent hypothesis; the stated hypotheses do not obviously imply finiteness. That is a correctness/completeness gap, not a circularity: even if Proposition 4.3 collapses, the argument does not reduce Theorem 3.2 to its own statement.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper's contribution reduces to a known type-A theorem via an equivalence, plus a new lemma on bottleneck distances on quotients. No free parameters or new entities are introduced. The main unproven input is the finiteness of the barcode used in Proposition 4.3.

assumptions (4)

standard math Isometry Theorem for continuous quiver of type A (Theorem 2.1, from [17])
Used as black box in Propositions 4.3 and 4.7 to relate interleaving and bottleneck distances on A_R.
standard math Decomposition of pointwise finite-dimensional nilpotent tilde A_R representations into interval representations (Theorem 3.1, from [13])
Provides the barcode and persistence diagram for V and W and is used to write representations as direct sums.
standard math Equivalence Psi between Rep(tilde A_R) and Rep(Q) (from [18])
Used to transfer interleaving distances between tilde A_R and Q in Proposition 4.3.
ad hoc to paper The persistence diagrams dgm(Psi(V)) and dgm(Psi(W)) are finite
Asserted in Proposition 4.3 to apply Lemma 4.2, but not derived from the hypotheses of Theorem 3.2 and not stated as an assumption there.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Isometry Theorem for Continuous Quiver of Type $\tilde{A}$." pith.science (2026). https://pith.science/paper/HS3QGK6M

@misc{pith2026241212462,
  author       = {Pith},
  title        = {Pith review of: Isometry Theorem for Continuous Quiver of Type $\tildeA$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HS3QGK6M}},
  note         = {Machine review of arXiv:2412.12462}
}

abstract

The Isometry Theorem for continuous quiver of type $A$ plays an important role in persistent homology. In this paper, we shall generalize Isometry Theorem to continuous quiver of type $\tilde{A}$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

An isometry theorem for persistent homology of circle-valued functions
math.AT 2025-06 conditional novelty 7.0 of 10

For persistence modules of circle-valued functions, the interleaving distance equals the bottleneck distance between arc barcodes on a geometric model.
Bipath Persistence as Zigzag Persistence
math.AT 2024-12 conditional novelty 7.0 of 10

Every bipath persistence module is determined by the barcode of a covering infinite zigzag module, yielding decomposition algorithms and algebraic stability for bipath persistence.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages · cited by 2 Pith papers

[17]

S. Y. Oudot. Persistence theory: from quiver representations to data an alysis, volume 209. American Mathematical Society, 2017

work page 2017
[1]

Appel and F

A. Appel and F. Sala. Quantization of continuum Kac–Moody algeb ras. Pure and Applied Mathematics Quarterly , 16(3):439–493, 2020

work page 2020
[2]

Appel, F

A. Appel, F. Sala, and O. Schiﬀmann. Continuum Kac–Moody algebr as. Moscow Mathematical Journal, 22(2):177–224, 2022

work page 2022
[3]

Bauer and M

U. Bauer and M. Lesnick. Induced matchings of barcodes and th e algebraic stability of per- sistence. In Proceedings of the Thirtieth Annual Symposium on Computati onal Geometry , SOCG’14, page 355–364, New York, NY, USA, 2014. Association for Computing Machinery

work page 2014
[4]

Botnan and W

M. Botnan and W. Crawley-Boevey. Decomposition of persistenc e modules. Proceedings of the American Mathematical Society , 148(11):4581–4596, 2020

work page 2020
[5]

Botnan and M

M. Botnan and M. Lesnick. Algebraic stability of zigzag persistenc e modules. Algebraic & Geometric Topology, 18(6):3133–3204, 2018

work page 2018
[6]

M. B. Botnan. Interval decomposition of inﬁnite zigzag persiste nce modules. Proceedings of the American Mathematical Society , 145(8):3571–3577, 2017. ISOMETRY THEOREM FOR CONTINUOUS QUIVER OF TYPE ˜A 11

work page 2017
[7]

Bubenik and J

P. Bubenik and J. A. Scott. Categoriﬁcation of persistent homo logy. Discrete & Computational Geometry, 51:600–627, 2014

work page 2014

Show all 20 references

[8]

Chazal, V

F. Chazal, V. De Silva, M. Glisse, and S. Oudot. The structure and stability of persistence modules. Springer, 2016

2016
[9]

Cohen-Steiner, H

D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of p ersistence diagrams. Discrete & Computational Geometry , 37:103–120, 2007

2007
[10]

Crawley-Boevey

W. Crawley-Boevey. Decomposition of pointwise ﬁnite-dimension al persistence modules. Jour- nal of Algebra and its Applications , 14(05):1550066, 2015

2015
[11]

P. Gabriel. Unzerlegbare darstellungen I. Manuscripta mathematica , 6:71–103, 1972

1972
[12]

Gao and M

X. Gao and M. Zhao. Maximal rigid representations of continuou s quivers of type A with automorphism. arXiv:2410.07210, 2024

2024 arXiv
[13]

E. J. Hanson and J. D. Rock. Decomposition of pointwise ﬁnite-d imensional S1 persistence modules. Journal of Algebra and Its Applications , 23(03):2450054, 2024

2024
[14]

Igusa, J

K. Igusa, J. D. Rock, and G. Todorov. Continuous quivers of t ype A (I) foundations. Rendiconti del Circolo Matematico di Palermo Series 2 , 72(2):833–868, 2023

2023
[15]

Igusa and G

K. Igusa and G. Todorov. Continuous Frobenius Categories , pages 115–143. Springer, Berlin, Heidelberg, 2013

2013
[16]

M. Lesnick. The theory of the interleaving distance on multidimen sional persistence modules. Foundations of Computational Mathematics , 15(3):613–650, 2015

2015
[18]

J. D. Rock and S. Zhu. Continuous nakayama representations . Applied Categorical Structures , 31(5):44, 2023

2023
[19]

Sala and O

F. Sala and O. Schiﬀmann. The circle quantum group and the inﬁnit e root stack of a curve. Selecta Mathematica, 25(77):1–86, 2019

2019
[20]

Sala and O

F. Sala and O. Schiﬀmann. Fock space representation of the cir cle quantum group. International Mathematics Research Notices , 2021(22):17025–17070, 2021. 1 School of Science, Beijing Forestry University, Beijing 10 0083, P. R. China Email address : gaoxiaowen@bjfu.edu.cn (X.G...

2021

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.

[1] [17]

S. Y. Oudot. Persistence theory: from quiver representations to data an alysis, volume 209. American Mathematical Society, 2017

work page 2017

[2] [1]

Appel and F

A. Appel and F. Sala. Quantization of continuum Kac–Moody algeb ras. Pure and Applied Mathematics Quarterly , 16(3):439–493, 2020

work page 2020

[3] [2]

Appel, F

A. Appel, F. Sala, and O. Schiﬀmann. Continuum Kac–Moody algebr as. Moscow Mathematical Journal, 22(2):177–224, 2022

work page 2022

[4] [3]

Bauer and M

U. Bauer and M. Lesnick. Induced matchings of barcodes and th e algebraic stability of per- sistence. In Proceedings of the Thirtieth Annual Symposium on Computati onal Geometry , SOCG’14, page 355–364, New York, NY, USA, 2014. Association for Computing Machinery

work page 2014

[5] [4]

Botnan and W

M. Botnan and W. Crawley-Boevey. Decomposition of persistenc e modules. Proceedings of the American Mathematical Society , 148(11):4581–4596, 2020

work page 2020

[6] [5]

Botnan and M

M. Botnan and M. Lesnick. Algebraic stability of zigzag persistenc e modules. Algebraic & Geometric Topology, 18(6):3133–3204, 2018

work page 2018

[7] [6]

M. B. Botnan. Interval decomposition of inﬁnite zigzag persiste nce modules. Proceedings of the American Mathematical Society , 145(8):3571–3577, 2017. ISOMETRY THEOREM FOR CONTINUOUS QUIVER OF TYPE ˜A 11

work page 2017

[8] [7]

Bubenik and J

P. Bubenik and J. A. Scott. Categoriﬁcation of persistent homo logy. Discrete & Computational Geometry, 51:600–627, 2014

work page 2014