pith. sign in

arxiv: 2606.08821 · v1 · pith:7D4TASJXnew · submitted 2026-06-07 · 🧮 math.AT · math.MG

Square Metric Spaces

Charles Fanning , Mehmet Aktas This is my paper

Pith reviewed 2026-06-27 17:22 UTC · model grok-4.3

classification 🧮 math.AT math.MG
keywords metric spacesproduct decompositionsequivalence relationsquotient metricspower presentationsbinary treespersistent homologyℓ^∞ product
0
0 comments X

The pith

Equivalence relations recover the missing coordinate factors of product decompositions in metric spaces and characterize when a space admits finite product or power presentations.

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

The paper develops a framework to recover coordinate structure in metric spaces built from products, where the coordinates are not part of the space itself. It uses equivalence relations on the space whose classes act as candidate fibers for coordinates, with quotient metrics giving back the factors. This allows characterizing precisely which metric spaces can be presented as finite products or powers. It also shows that for spaces isomorphic to their infinite product with themselves, binary tree structures provide the exact characterization. A sympathetic reader would care because this gives a way to understand and classify metric spaces based on decompositions without explicit coordinates, with an application to recovering parameters in persistent homology.

Core claim

The central claim is that equivalence-relation data on a metric space, with classes as candidate coordinate fibers and induced quotient metrics, reconstruct the coordinate factors of product decompositions. An equivalence of categories is proved showing these data preserve exactly the ordered coordinate information of power presentations. For suitable ℓ^∞-prime factorizations, prime multiplicities determine roots. Binary tree structures exactly characterize metric spaces satisfying X ≅ X ×_∞ X. As an application to persistent homology, filtration parameters can be recovered when products or powers form a given space of intervals.

What carries the argument

Equivalence relations whose classes are candidate coordinate fibers, together with the induced quotient metrics; this mechanism reconstructs the coordinate factors and enables the characterizations of product and power presentations.

If this is right

  • Metric spaces with suitable ℓ^∞-prime factorizations have roots classified by prime multiplicities.
  • Binary tree structures exactly characterize metric spaces satisfying X ≅ X ×_∞ X.
  • An equivalence of categories preserves exactly the ordered coordinate information of power presentations.
  • Filtration parameters can be recovered in persistent homology when products or powers form a given space of intervals.

Where Pith is reading between the lines

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

  • The binary tree characterization may extend to questions about self-similar structures in metric spaces constructed via repeated splittings.
  • The category equivalence could support comparisons between different product presentations of the same space via their fiber data.
  • The persistent homology application suggests the framework could address inverse problems of recovering parameters from observed product filtrations.

Load-bearing premise

The assumption that equivalence relations whose classes serve as candidate coordinate fibers, together with the induced quotient metrics, can reconstruct the coordinate factors of the original product decomposition.

What would settle it

A metric space that admits a finite product presentation but for which the equivalence relation classes and quotient metrics fail to recover the original coordinate factors would falsify the characterization.

read the original abstract

Product decompositions of metric spaces are built from coordinate maps, but these maps are not part of the resulting metric space. We recover this missing coordinate structure through equivalence relations whose classes are candidate coordinate fibers, and the resulting quotient metrics reconstruct the coordinate factors. This framework characterizes exactly when a metric space admits a finite product or power presentation. We prove an equivalence of categories showing that these equivalence-relation data preserve exactly the ordered coordinate information of power presentations. For spaces with suitable $\ell^\infty$-prime factorizations, we use prime multiplicities to determine the existence and classification of roots. We also study metric spaces satisfying $X\cong X\times_\infty X$, where repeated coordinate splitting gives a family of metric quotients indexed by infinite binary sequences. We prove that these binary tree structures exactly characterize metric spaces satisfying $X\cong X\times_\infty X$. As an application to persistent homology, we show how to recover filtration parameters whose products or powers form a given space of intervals.

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

2 major / 1 minor

Summary. The paper develops a framework for recovering coordinate structures in metric space product decompositions using equivalence relations whose classes serve as coordinate fibers and induced quotient metrics. It claims this characterizes exactly when a metric space admits finite product or power presentations, proves a category equivalence preserving ordered coordinate information, uses prime multiplicities for roots in ℓ^∞-factorizations, characterizes spaces with X ≅ X ×_∞ X via binary tree structures from repeated splitting, and applies to recovering filtration parameters in persistent homology.

Significance. If the reconstruction via equivalence relations and quotient metrics is faithful and the characterizations hold, the work provides a novel way to detect and classify product structures in metric spaces, with implications for understanding self-similar spaces and applications in topological data analysis.

major comments (2)
  1. [Reconstruction framework (abstract and main development)] The central reconstruction step (equivalence relations with classes as candidate fibers plus induced quotient metrics) is invoked to recover coordinate factors exactly for both finite-product and ℓ^∞-power cases, enabling the if-and-only-if characterizations and category equivalence. Explicit verification is required that the quotient metric is isometric to the original factor and that distinct decompositions produce distinct data under the max metric; without this, the 'exactly characterizes' claim does not follow.
  2. [Binary tree structures section] For the binary-tree characterization of spaces satisfying X ≅ X ×_∞ X, the argument that repeated coordinate splitting yields structures that exactly characterize such spaces must confirm both directions: every such space arises from a binary tree of quotients, and no extraneous structures satisfy the isomorphism.
minor comments (1)
  1. Clarify the definition of 'ℓ^∞-prime factorizations' and 'prime multiplicities' at first use, as these are central to the root-classification claim but not defined in the abstract.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address the two major comments point by point below, indicating where we agree that additional explicitness will strengthen the presentation and where the existing arguments already cover the required directions.

read point-by-point responses

  1. Referee: [Reconstruction framework (abstract and main development)] The central reconstruction step (equivalence relations with classes as candidate fibers plus induced quotient metrics) is invoked to recover coordinate factors exactly for both finite-product and ℓ^∞-power cases, enabling the if-and-only-if characterizations and category equivalence. Explicit verification is required that the quotient metric is isometric to the original factor and that distinct decompositions produce distinct data under the max metric; without this, the 'exactly characterizes' claim does not follow.

    Authors: We agree that making the isometry and distinctness properties fully explicit will improve clarity. The manuscript already contains the relevant arguments establishing that the induced quotient metric is isometric to the original coordinate factor (via the definition of the quotient metric and the universal property of the product) and that distinct decompositions yield distinct equivalence-relation data under the max metric (used in the uniqueness part of the category equivalence). In the revised version we will insert a short, self-contained proposition immediately after the definition of the reconstruction map that isolates and proves these two facts, thereby making the support for the if-and-only-if characterizations and the category equivalence more transparent. revision: yes

  2. Referee: [Binary tree structures section] For the binary-tree characterization of spaces satisfying X ≅ X ×_∞ X, the argument that repeated coordinate splitting yields structures that exactly characterize such spaces must confirm both directions: every such space arises from a binary tree of quotients, and no extraneous structures satisfy the isomorphism.

    Authors: The binary-tree section is written to establish a two-way characterization. One direction shows that any X satisfying X ≅ X ×_∞ X admits a binary tree of quotients obtained by iterated coordinate splitting; the converse direction shows that any space arising from such a tree satisfies the isomorphism and that the tree is uniquely determined by the isomorphism class. To respond to the referee we will revise the statement of the main theorem in that section to label the two directions explicitly and add a brief remark confirming that no extraneous structures arise, by noting that any isomorphism X ≅ X ×_∞ X canonically determines the splitting tree. This is a clarification rather than a change of substance. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper defines a recovery framework via equivalence relations on candidate fibers and induced quotient metrics, then states that it proves categorical equivalences and if-and-only-if characterizations of spaces admitting finite product or power presentations (including the binary-tree characterization of X ≅ X ×_∞ X). These are presented as proven results rather than definitions, fits, or self-referential constructions that reduce the claimed equivalences to the inputs by construction. No load-bearing self-citations, uniqueness theorems imported from prior author work, or ansatzes smuggled via citation are indicated in the abstract or context. The derivation chain is therefore treated as self-contained with independent mathematical content.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Review performed on abstract only; no explicit free parameters, axioms, or invented entities can be identified from the provided text.

pith-pipeline@v0.9.1-grok · 5686 in / 1117 out tokens · 29270 ms · 2026-06-27T17:22:27.567336+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

13 extracted references · 6 canonical work pages

  1. [1]

    Interscience Tracts in Pure and Applied Mathematics, vol

    Ulam, S.M.: A Collection of Mathematical Problems. Interscience Tracts in Pure and Applied Mathematics, vol. 8. Interscience Publishers, New York and London (1960) 59

    1960

  2. [2]

    Fournier, G.: On a problem of s. ulam. Proceedings of the American Mathematical Society 29, 622 (1971) https://doi.org/10.1090/S0002-9939-1971-0278262-5

    work page doi:10.1090/s0002-9939-1971-0278262-5 1971

  3. [3]

    Glasnik Matematički 27(47), 145–158 (1992)

    Moszyńska, M.: On the uniqueness problem for metric products. Glasnik Matematički 27(47), 145–158 (1992)

    1992

  4. [4]

    Discrete Mathematics 109(1–3), 283–288 (1992) https://doi.org/10.1016/0012-365X(92) 90298-T

    Tardif, C.: Prefibers and the cartesian product of metric spaces. Discrete Mathematics 109(1–3), 283–288 (1992) https://doi.org/10.1016/0012-365X(92) 90298-T

    work page doi:10.1016/0012-365x(92 1992

  5. [5]

    Colloquium Mathematicum 62(1), 121–133 (1991) https://doi.org/10.4064/cm-62-1-121-133

    Herburt, I., Moszyńska, M.: On metric products. Colloquium Mathematicum 62(1), 121–133 (1991) https://doi.org/10.4064/cm-62-1-121-133

    work page doi:10.4064/cm-62-1-121-133 1991

  6. [6]

    In: Böröczky, K., Fejes Tóth, G

    Herburt, I.: There is no cancellation law for metric products. In: Böröczky, K., Fejes Tóth, G. (eds.) Intuitive Geometry. Colloquia Mathematica Societatis János Bolyai, vol. 63, pp. 165–174. North-Holland, Amsterdam (1994)

    1994

  7. [7]

    European Journal of Combinatorics 21(7), 847–851 (2000) https://doi

    A vgustinovich, S.V., Fon-Der-Flaass, D.: Cartesian products of graphs and metric spaces. European Journal of Combinatorics 21(7), 847–851 (2000) https://doi. org/10.1006/eujc.2000.0401

    work page doi:10.1006/eujc.2000.0401 2000

  8. [8]

    Fundamenta Mathematicae 70(1), 59–101 (1971) https://doi.org/10.4064/ fm-70-1-59-101

    McKenzie, R.: Cardinal multiplication of structures with a reflexive rela- tion. Fundamenta Mathematicae 70(1), 59–101 (1971) https://doi.org/10.4064/ fm-70-1-59-101

    1971

  9. [9]

    Geometric and Functional Analysis 18(1), 120–143 (2008) https://doi.org/10

    Foertsch, T., Lytchak, A.: The de Rham decomposition theorem for metric spaces. Geometric and Functional Analysis 18(1), 120–143 (2008) https://doi.org/10. 1007/s00039-008-0652-0

    2008

  10. [10]

    In: Goodman, J.E., Pach, J., Pollack, R

    Edelsbrunner, H., Harer, J.: Persistent homology – a survey. In: Goodman, J.E., Pach, J., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, pp. 257–282. Amer- ican Mathematical Society, Providence, RI (2008). https://doi.org/10.1090/ conm/453/08802 . https://doi.org/10.1090/conm/453/08802

    work page doi:10.1090/conm/453/08802 2008

  11. [11]

    In: Buan, A.B., Krause, H., Solberg, Ø

    Botnan, M.B., Lesnick, M.: An introduction to multiparameter persistence. In: Buan, A.B., Krause, H., Solberg, Ø. (eds.) Representations of Algebras and Related Structures, pp. 77–150. EMS Press, Berlin (2023). https://doi.org/10. 4171/ECR/19/4

    2023

  12. [12]

    Journal of Applied and Computational Topology 6(4), 429–474 (2022) https://doi.org/10.1007/s41468-022-00091-9

    Bubenik, P., Elchesen, A.: Virtual persistence diagrams, signed measures, wasser- stein distances, and banach spaces. Journal of Applied and Computational Topology 6(4), 429–474 (2022) https://doi.org/10.1007/s41468-022-00091-9

    work page doi:10.1007/s41468-022-00091-9 2022

  13. [13]

    AMS Chelsea Publishing, vol

    König, D.: Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. AMS Chelsea Publishing, vol. 72. American Mathematical Society, Providence, RI (2001) 60

    2001