pith. machine review for the scientific record. sign in

arxiv: 2605.11615 · v1 · submitted 2026-05-12 · 🧮 math.AT · math.CT

Recognition: 2 theorem links

· Lean Theorem

Quillen-McCord theorem for persistence finite posets

Kohei Tanaka, Vitalii Guzeev

Pith reviewed 2026-05-13 01:38 UTC · model grok-4.3

classification 🧮 math.AT math.CT
keywords Quillen-McCord theorempersistence finite posetshomotopy fibersinterleaving distancehomotopy commutativepersistent homologyposet maps
0
0 comments X

The pith

A map between persistence finite posets with weakly ε-contractible homotopy fibers induces an upper bound on their homotopy commutative interleaving distance.

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

The paper establishes a persistence version of the Quillen-McCord theorem for persistence finite posets. It shows that if a map f from P to Q has weakly ε-contractible homotopy fibers, then there is an upper bound on the homotopy commutative interleaving distance between P and Q. This would matter to a reader because it gives a way to control the similarity of two persistence structures through the homotopy properties of a map connecting them, which is useful in topological data analysis where such distances quantify persistence features. The result adapts classical homotopy theory to the filtered poset setting.

Core claim

The authors prove that for a map f : P → Q between persistence finite posets with weakly ε-contractible homotopy fibers, the homotopy commutative interleaving distance between P and Q admits an upper bound.

What carries the argument

Weakly ε-contractible homotopy fibers of the map f, which control the size of the homotopy commutative interleaving distance in the persistence setting.

If this is right

  • The interleaving distance between P and Q can be bounded from the fiber properties of f.
  • Persistence finite posets connected by such a map differ by at most the scale of the fiber contractibility.
  • The result supplies a criterion for closeness of filtered posets without computing full persistent homology.
  • Similar maps preserve the homotopy type of persistence structures up to the given ε.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The bound might be used to compare persistence modules by checking fiber contractibility on simple test posets.
  • This adaptation suggests how other classical poset theorems could transfer to persistence.
  • One could check the result by taking chain posets with explicitly contractible fibers and computing their interleaving distances directly.

Load-bearing premise

The homotopy fibers of the map f between the persistence finite posets are weakly ε-contractible.

What would settle it

A concrete map f between two persistence finite posets whose homotopy fibers fail to be weakly ε-contractible and for which the interleaving distance exceeds the stated upper bound.

read the original abstract

In this paper, we establish a persistence version of the Quillen-McCord theorem for persistence finite posets. Given a map $f \colon P \rightarrow Q$ between persistence finite posets $P$ and $Q$ with weakly $\varepsilon$-contractible homotopy fibers, we provide an upper bound for the homotopy commutative interleaving distance between $P$ and $Q$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper establishes a persistence version of the Quillen-McCord theorem for persistence finite posets. Given a map f : P → Q between persistence finite posets P and Q whose homotopy fibers are weakly ε-contractible, it proves an upper bound on the homotopy commutative interleaving distance between P and Q.

Significance. If the result holds, it provides a useful extension of a classical algebraic topology theorem to the persistence setting, enabling bounds on interleaving distances via a natural weakening of the contractible-fiber hypothesis. This strengthens stability and comparison tools for poset-based persistent homology and could support applications in topological data analysis where filtrations are modeled by posets.

minor comments (2)
  1. Abstract: the precise form of the claimed upper bound (e.g., whether it is ε, 2ε, or a function of ε) is not stated explicitly; adding this would clarify the statement for readers.
  2. The definitions of 'weakly ε-contractible' and 'homotopy commutative interleaving distance' should be recalled or referenced in the introduction to make the main theorem self-contained.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive evaluation of our manuscript and for recommending minor revision. The referee's summary accurately describes the main result: a persistence analogue of the Quillen-McCord theorem that bounds the homotopy commutative interleaving distance between persistence finite posets when the homotopy fibers of the map are weakly ε-contractible. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity detected in derivation chain

full rationale

The paper states a direct theorem adapting the classical Quillen-McCord result to persistence finite posets: given a map f: P → Q with weakly ε-contractible homotopy fibers, an upper bound holds for the homotopy commutative interleaving distance. No equations, definitions, or steps in the abstract or described structure reduce the bound to a self-referential construction, a fitted parameter renamed as a prediction, or a load-bearing self-citation chain. The hypothesis is stated explicitly as necessary, and the claim is presented as a logical extension of an external classical theorem rather than a tautology of the paper's own inputs. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review performed from abstract alone; no explicit free parameters, axioms, or invented entities are stated. Standard background assumptions from category theory and persistence theory are presumed but unverified.

axioms (1)
  • domain assumption Persistence finite posets are well-defined objects in the category of posets with persistence structure
    Invoked by the statement of the theorem for P and Q

pith-pipeline@v0.9.0 · 5343 in / 1241 out tokens · 30098 ms · 2026-05-13T01:38:29.412219+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Topology of nerves and formal concepts

    Ayzenberg, A. Topology of nerves and formal concepts. preprint. arXiv:1911.05491v1

  2. [2]

    Barmak, J. A. On Quillen's Theorem A for posets. J. Combin. Theory Ser. A 118 (2011), no. 8, 2445--2453

  3. [3]

    Barmak, J. A. Algebraic topology of finite topological spaces and applications. Lecture Notes in Mathematics, 2032. Springer, Heidelberg, 2011. xviii+170 pp

  4. [4]

    J.; Lesnick, M

    Blumberg, A. J.; Lesnick, M. Universality of the homotopy interleaving distance. Trans. Amer. Math. Soc. 376 (2023), no. 12, 8269--8307

  5. [5]

    Coverage in sensor networks via persistent homology

    de Silva, V.; Ghrist, R. Coverage in sensor networks via persistent homology. Algebr. Geom. Topol. 7 (2007), 339--358

  6. [6]

    Persistent homological Quillen-McCord theorem

    Guzeev, V. Persistent homological Quillen-McCord theorem. preprint. arXiv:2307.00177v1

  7. [7]

    2-dimensional categories

    Johnson, N.; Yau, D. 2-dimensional categories. Oxford University Press, Oxford, 2021. xix+615 pp

  8. [8]

    Artificial Text Detection via Examining the Topology of Attention Maps

    Kushnareva L.; Cherniavskii, D.; Mikhailov, V.; Artemova, E.; Barannikov, S.; Bernstein, A.; Piontkovskaya, I.; Piontkovski, D.; Burnaev, E. Artificial Text Detection via Examining the Topology of Attention Maps. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pages 635--649

  9. [9]

    Rectification of interleavings and a persistent Whitehead theorem

    Lanari, E.; Scoccola, L. Rectification of interleavings and a persistent Whitehead theorem. Algebr. Geom. Topol. 23 (2023), no. 2, 803--832

  10. [10]

    McCord, M. C. Singular homology groups and homotopy groups of finite topological spaces. Duke Math. J. 33 (1966), 465--474

  11. [11]

    Higher algebraic K -theory

    Quillen, D. Higher algebraic K -theory. I. Algebraic K -theory, I: Higher K -theories (Proc. Conf., Battelle Memorial Inst., Seattle, Wash., 1972), pp. 85--147, Lecture Notes in Math., Vol. 341, Springer, Berlin-New York, 1973

  12. [12]

    Spanier, E. H. Algebraic topology. Corrected reprint of the 1966 original. Springer-Verlag, New York. xvi +528 pp

  13. [13]

    Saggar, M., Sporns, O., Gonzalez-Castillo, J. et al. Towards a new approach to reveal dynamical organization of the brain using topological data analysis. Nat Commun 9, 1399 (2018)

  14. [14]

    Stong, R. E. Finite topological spaces. Trans. Amer. Math. Soc. 123 (1966), 325--340

  15. [15]

    Two constructions on lax functors

    Street, R. Two constructions on lax functors. Cahiers Topologie G\'eom. Diff\'erentielle 13 (1972), 217--264