{"id":"0da57664-dc76-409a-b337-65c7f0c70ff3","arxiv_id":"2412.18888","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For subsets of the real line and of infinite metric trees satisfying a boundary condition, the Gromov-Hausdorff distance to the ambient space equals the Hausdorff distance, and the canonical Hausdorff geodesic is a shortest path in the GH-cloud.","lead":"This paper proves that for subsets of the real line, the Gromov-Hausdorff and Hausdorff distances to the line coincide, and extends a finite metric tree result to infinite trees. It also constructs explicit shortest geodesics in the Gromov-Hausdorff space for these cases.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Central equality Theorems 8.2/9.2 survive scrutiny; the advertised extension to all finite-degree metric trees fails because finite degree does not imply properness (Corollary 9.4).","rationale":"The paper's central results, Theorems 8.2 and 9.2, are mathematically sound as far as the proof outline shows. The proof of Theorem 8.2 correctly reduces the lower bound to the ultrametrization inequality; although Theorem 4.1 is cited to an unpublished source, the inequality is valid in full generality because the quotient map to U is 1-Lipschitz with respect to Hausdorff distance, so dGH(U(X),U(Y)) ≤ dGH(X,Y) for all metric spaces. Thus the reader's weakest-assumption concern does not land as a mathematical error; it is a citation-completeness issue rather than a substantive gap. The real defect is Corollary 9.4, where the implication 'finite vertex degree implies proper' is false. A concrete counterexample is the ray [0,1) with vertices at 1-2^{-i}; it has degree at most 2 but is not proper because the closed ball of radius 1 is the whole non-compact space. This invalidates the proof that the canonical Hausdorff geodesic is shortest in [T] for arbitrary finite-degree trees, though it does not affect Theorems 8.2/9.2 or the real-line Corollary 9.3. The appropriate disposition is conditional acceptance, with the corollary's hypothesis corrected by adding properness or local compactness. Since this matches the reader's overall CONDITIONAL verdict, the verdict should remain unchanged.","tokens_in":9012,"tokens_out":24667,"duration_ms":226941,"concrete_test":"Construct the metric tree T=[0,1) with vertices v_i=1-2^{-i} and edges e_i=[v_{i-1},v_i] of length 2^{-i} for i≥1. Check whether T is proper: the closed ball of radius 1 about v_0 is the entire space, and the sequence v_i has no convergent subsequence in T because its limit 1 is absent from T. Hence the closed unit ball is not compact, so finite vertex degree does not imply properness, refuting the proof of Corollary 9.4.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The core equality Theorems 8.2 and 9.2 are supported by a correct argument, and the reader's concern about Theorem 4.1 is not fatal: the ultrametrization map is 1-Lipschitz with respect to Hausdorff distance, so dGH(U(X),U(Y)) ≤ dGH(X,Y) holds for arbitrary metric spaces. The genuine load-bearing gap is in Corollary 9.4, whose proof asserts: \"Since the degree of each vertex T is finite, then T is proper.\" This is false. A metric tree homeomorphic to [0,1), with vertices at 1-2^{-i} and edge lengths 2^{-i}, has all vertex degrees ≤ 2 but is not proper: the closed ball of radius 1 about 0 is the whole space, which is not compact because the vertex sequence is Cauchy without a limit in T. Therefore Theorem 9.1, which requires a proper geodesic domain, cannot be invoked for arbitrary finite-degree trees, and the advertised canonical Hausdorff geodesic statement in [T] is unproven in that generality. The fix is to assume T is proper or locally compact, not merely finite-degree. This does not invalidate Theorems 8.2/9.2 or the real-line Corollary 9.3, but it limits the paper's claimed scope for infinite metric trees.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the Gromov–Hausdorff (GH) distance between a subset X of a metric tree T and T itself. It introduces the ultrametrization U(X) and uses the lower bound dGH(X,T) ≥ dGH(U(X),U(T)) to show that, under a condition on the 'end points' of X in T (either no end points, or the Hausdorff distance from X to T exceeds the oriented Hausdorff distance from the end set to X), one has dGH(X,T)=dH(X,T). This is applied to subsets of the real line, giving dGH(X,R)=dH(X,R). The equality is then used to show that the canonical Hausdorff geodesic between X and the ambient tree is a shortest geodesic in the GH cloud, under a properness assumption. The paper also proves analogous results for R^n with the ℓ∞ norm and its integer lattice.","tokens_in":9221,"tokens_out":13123,"duration_ms":114753,"significance":"The equality theorems provide one of the rare cases where the Gromov–Hausdorff distance can be computed exactly, and the ultrametrization method is elegant and potentially useful. The proof of Theorem 8.2 is coherent and the condition in its statement is used correctly. The real-line result (Theorem 9.2) is a clean corollary. The geodesic construction in the GH class is a valuable contribution. However, the advertised extension to all finite-degree metric trees in Corollary 9.4 relies on a false properness implication and must be corrected. The paper also depends on an unpublished self-cited theorem for a load-bearing inequality, which should be proved in the paper or replaced by a published reference.","major_comments":[{"comment":"The proof asserts 'Since the degree of each vertex T is finite, then T is proper.' This implication is false. For example, let T be the metric tree homeomorphic to [0,1) with vertices at 1-2^{-i} (i=0,1,...) and edge lengths 2^{-(i+1)}; every vertex has degree at most 2, but the closed ball of radius 1 about 0 is the whole space, which is not compact because the vertex sequence is Cauchy with no limit in T. Hence T is not proper, and Theorem 9.1 cannot be invoked. To obtain the advertised geodesic statement, the hypothesis must be strengthened to properness (or local compactness plus completeness) of T; the current Corollary 9.4 is unproved as stated.","section":"Corollary 9.4"},{"comment":"The lower bound dGH(X,Y) ≥ dGH(U(X),U(Y)) is stated for arbitrary metric spaces and attributed to the unpublished manuscript [7]; earlier references [4] and [6] cover only finite and bounded spaces. This theorem is used essentially in Theorems 8.1, 8.2, and 9.5. Since [7] is not publicly available, the paper should either include a proof of the arbitrary case or cite a published source.","section":"Theorem 4.1"}],"minor_comments":[{"comment":"The abstract heading is given in Russian ('Аннотация'); the paper should be uniformly in English.","section":"Abstract/Introduction"},{"comment":"The proof would benefit from a short justification that dH(X,R)<∞ implies every point of R\\X is internal w.r.t. X; as written the claim is plausible but not immediate.","section":"Theorem 9.2 proof"},{"comment":"In the displayed equality, the summation index runs over 'n−1' terms but the subdivision has n intervals; the indexing should be adjusted for consistency.","section":"Theorem 9.1 proof"},{"comment":"References [7] and [8] are self-citations listed as 'to appear' and 'in print'; since they support load-bearing results, the authors should update them with full publication details or include the necessary proofs in this paper.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The core equality results (Theorems 8.2 and 9.2) appear sound, assuming Theorem 4.1. The main problem is the overclaimed Corollary 9.4, which uses a false implication from finite vertex degrees to properness. This is fixable by strengthening the hypothesis and adjusting the abstract. I also recommend requiring a proof or published reference for Theorem 4.1 in its full generality."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The main content is good and new. The paper proves that for a subset X of an arbitrary metric tree T satisfying either no boundary points or a strict separation condition, dGH(X,T) = dH(X,T). It also settles the real-line case, dGH(X,R) = dH(X,R), for all subsets. That is a clean, useful result, and the canonical Hausdorff geodesic becoming a geodesic in the GH-cloud is a nice application. The proofs are mostly readable and the ultrametrization technique is used appropriately.\n\nThe soft spot that matters is Corollary 9.4. The claim that finite vertex degree implies properness is false. A tree made of segments with lengths 2^{-i} glued into [0,1) has all degrees at most 2, but the closed ball of radius 1 is the whole space, which is not compact. So the advertised canonical geodesic statement does not follow for arbitrary finite-degree infinite trees. The fix is straightforward: assume T is proper or locally compact, then Theorem 9.1 applies. This does not touch Theorems 8.2 or 9.2, so the main contribution stands.\n\nA second issue, more of a referee inconvenience: Theorem 4.1, the ultrametrization lower bound for arbitrary metric spaces, is cited to the authors' unpublished paper [7]. The stress-test note suggests the bound may be derivable by an elementary argument, but the paper itself does not give one. A referee who cannot verify [7] will have to trust an unproved load-bearing lemma. I would ask the authors to include a proof of Theorem 4.1 in full generality or replace the citation with a published version.\n\nThe citation pattern is otherwise fine: the paper clearly credits the finite-tree predecessor [1] and the earlier ultrametrization work. I do not see any circularity. The main theorems are new statements and the external lower bound is a background lemma, not the target claim.\n\nFor whom: metric geometers working on GH distances, especially tree clouds. The paper deserves a serious referee; it likely needs minor to moderate revision, mainly fixing Corollary 9.4 and shoring up the reliance on [7].","headline":"A genuinely new equality result for Gromov–Hausdorff distances on tree clouds, with one advertised corollary that needs repair and one load-bearing unpublished citation.","tokens_in":9818,"tokens_out":2987,"would_cite":true,"duration_ms":28408,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["53C23","54E35","05C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"For subsets of an arbitrary metric tree, the Gromov-Hausdorff distance to the whole tree equals the Hausdorff distance under a condition on outer boundary points; every subset of the real line satisfies it.","keywords":["Gromov-Hausdorff distance","Hausdorff distance","metric trees","ultrametrization","subsets of the real line","canonical Hausdorff geodesic","Gromov-Hausdorff clouds","infinite metric trees"],"falsifier":"The most direct check is to search for any two metric spaces $X,Y$ with $d_{GH}(X,Y)<d_{GH}(U(X),U(Y))$; such a pair contradicts Theorem 4.1, the lower-bound lemma the whole proof leans on. For the theorem itself, one can look for a metric tree $T$ and a subset $X$ satisfying the boundary condition ($\\partial_X T=\\emptyset$, or $d_H(X,T)>\\overrightarrow{d}_H(\\partial_X T,X)$) for which $d_{GH}(X,T)<d_H(X,T)$; even one such pair would refute Theorem 8.2.","tokens_in":8745,"feed_emoji":"🌳","tokens_out":13537,"duration_ms":137454,"temperature":0.7,"pith_summary":"This paper asks when the Gromov–Hausdorff distance between a metric tree and one of its subsets equals the much easier Hausdorff distance. Its main theorem, Theorem 8.2, says this happens for an arbitrary, possibly infinite metric tree $T$ and a non-empty subset $X$ whenever the points of $T\\setminus X$ are all 'internal' (each lies on some path with both endpoints in $X$), or, failing that, when the Hausdorff distance $d_H(X,T)$ is strictly larger than the oriented distance from the non-internal points to $X$. Since every subset of the real line with finite Hausdorff distance to $\\mathbb{R}$ has only internal points, a corollary is the exact equality $d_{GH}(X,\\mathbb{R})=d_H(X,\\mathbb{R})$ for all such subsets. The authors use the equality to build explicit shortest geodesics in the Gromov–Hausdorff class connecting such subsets to their ambient tree.","feed_headline":"Two distances coincide for metric-tree subsets","feed_subtitle":"The hard-to-compute Gromov-Hausdorff distance matches the easy Hausdorff distance; every real-line subset qualifies.","key_machinery":"The mechanism is ultrametrization $U(X)$: the quotient of a metric space $X$ by the pseudometric $|xy|_u=\\inf\\{\\max_i |x_{i-1}x_i|\\}$ taken over dotted lines $x=x_0,\\dots,x_n=y$. This quotient collapses every path-connected space to a single point, and the paper's lower bound comes from the inequality $d_{GH}(X,Y)\\ge d_{GH}(U(X),U(Y))$; for a tree $T$, $U(T)=\\Delta_1$, so $d_{GH}(X,T)\\ge \\frac12\\operatorname{diam} U(X)$. The tree hypothesis is then used to prove the reverse half, $d_H(X,T)=\\frac12\\operatorname{diam} U(X)$, by showing that roughly half the length of any sufficiently short dotted line between two points of $X$ lands inside the tree's interior region. The second piece of machinery is the canonical Hausdorff geodesic $C_t=B_t(A)\\cap B_{d-t}(B)$, which is already a shortest geodesic in the space of closed subsets; once $d_{GH}=d_H$, Theorem 9.1 turns this curve into a shortest geodesic in the Gromov–Hausdorff cloud.","core_discovery":"The central discovery is a rigorous equality theorem: for an arbitrary metric tree $T$ and a non-empty subset $X\\subset T$, if either $\\partial_X T=\\emptyset$ or $d_H(X,T)>\\overrightarrow{d}_H(\\partial_X T,X)$, then $d_{GH}(X,T)=d_H(X,T)$. Here $\\partial_X T$ is the set of points of $T\\setminus X$ that lie on no path between two points of $X$; these are the exposed ends of the tree relative to $X$. The proof passes through the ultrametrization $U(X)$, the quotient of $X$ by the pseudometric of dotted-line ultrametric length: because $U(T)$ is a single point, the lower bound $d_{GH}(X,T)\\ge d_{GH}(U(X),U(T))=\\frac12\\operatorname{diam} U(X)$ applies, and the tree structure is used to prove $d_H(X,T)=\\frac12\\operatorname{diam} U(X)$ under the theorem's hypotheses. Applying the theorem to the line $\\mathbb{R}$, regarded as an infinite metric tree, yields $d_{GH}(X,\\mathbb{R})=d_H(X,\\mathbb{R})$ for every subset $X$; with the canonical Hausdorff geodesic construction, this gives shortest curves in the Gromov–Hausdorff class and, for the integer lattice in $\\ell_\\infty^n$, the exact value $\\frac12$.","pith_inferences":["The authors do not pursue it, but the same ultrametrization lower bound should give equality $d_{GH}(X,T)=d_H(X,T)$ for other geodesic targets $T$ that collapse to a point under $U$ and have a unique-path structure generalized from trees; testing this on $\\mathbb{R}^n$ with more general subsets would separate the role of trees from the role of path-connectedness.","Because the real-line equality makes the Hausdorff distance a two-sided estimate for the Gromov–Hausdorff distance, software that already computes Hausdorff distances between one-dimensional sets can be used directly for Gromov–Hausdorff queries in one dimension.","The lattice example suggests a testable pattern: other self-similar lattices, such as hexagonal or root lattices, may sit at exactly computable positive Gromov–Hausdorff distances from their ambient spaces, with the ultrametrization of the lattice controlling the value."],"forward_implications":["For every subset $X\\subset\\mathbb{R}$ with finite Hausdorff distance to $\\mathbb{R}$, the exact Gromov–Hausdorff distance is known and equals $d_H(X,\\mathbb{R})$; no search over correspondences is needed.","Any such subset $X$ is connected to $\\mathbb{R}$ by an explicit shortest geodesic in the Gromov–Hausdorff class, namely the canonical Hausdorff curve $t\\mapsto B_t(X)\\cap B_{d-t}(\\mathbb{R})$.","The same geodesic conclusion holds for closed subsets of arbitrary metric trees with finite vertex degrees satisfying the boundary condition, and for integer lattices $\\mathbb{Z}^n$ in $\\mathbb{R}^n$ with the $\\ell_\\infty$ norm, where the common distance is $1/2$.","The finite-tree theorem from the literature becomes a special case; infinite trees are covered, so the result applies to unbounded clouds such as the cloud of the real line.","For any metric space $X$, the lower bound $d_{GH}(X,Y)\\ge \\frac12\\operatorname{diam}U(X)$ holds for every path-connected $Y$, so the ultrametrization diameter is a universal obstruction to being close to a connected space."],"supporting_citations":[{"why":"Supplies the ultrametrization lower bound used for arbitrary metric spaces and the construction of path-connected approximations.","marker":"[7]"},{"why":"Introduces ultrametrization and proves the lower bound for finite metric spaces; the method the paper extends.","marker":"[4]"},{"why":"Extends the ultrametrization lower bound to bounded spaces, one of the stepping stones to the arbitrary-space version.","marker":"[6]"},{"why":"Proves the finite-tree predecessor that the paper generalizes to infinite trees.","marker":"[1]"},{"why":"Characterizes finite Gromov–Hausdorff distance from Euclidean space by finite Hausdorff distance, used in the real-line corollary.","marker":"[9]"}],"fun_headline_variants":["Hausdorff and Gromov-Hausdorff coincide for tree subsets","When do two distances meet? For metric trees","Tree subsets: distance equality theorem","Exact distance match for tree subsets","Metric trees: condition for GH = H"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that collapsing any two metric spaces to their ultrametrization quotients cannot increase their Gromov–Hausdorff distance; the paper cites this for arbitrary spaces from an unpublished companion, and if that bound fails for unbounded spaces the lower-bound half of the equality has no support.","fun_headline_variants_meta":{"raw":{"variants":["Hausdorff and Gromov-Hausdorff coincide for tree subsets","When do two distances meet? For metric trees","Tree subsets: distance equality theorem","Exact distance match for tree subsets","Metric trees: condition for GH = H"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000359,"raw_usage":{"total_tokens":1928,"prompt_tokens":916,"completion_tokens":1012,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":532,"completion_tokens_details":{"reasoning_tokens":940}},"tokens_in":532,"tokens_out":1012,"duration_ms":8970,"temperature":1.0,"reasoning_tokens":940,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T04:23:43.591956+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"The most direct check is to search for any two metric spaces $X,Y$ with $d_{GH}(X,Y)<d_{GH}(U(X),U(Y))$; such a pair contradicts Theorem 4.1, the lower-bound lemma the whole proof leans on. For the theorem itself, one can look for a metric tree $T$ and a subset $X$ satisfying the boundary condition ($\\partial_X T=\\emptyset$, or $d_H(X,T)>\\overrightarrow{d}_H(\\partial_X T,X)$) for which $d_{GH}(X,T)<d_H(X,T)$; even one such pair would refute Theorem 8.2.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the ultrametrization lower bound used for arbitrary metric spaces and the construction of path-connected approximations."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces ultrametrization and proves the lower bound for finite metric spaces; the method the paper extends."},{"cited_title":"Adams, S","cited_arxiv_id":null,"evidence_quote":"Proves the finite-tree predecessor that the paper generalizes to infinite trees."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Characterizes finite Gromov–Hausdorff distance from Euclidean space by finite Hausdorff distance, used in the real-line corollary."}],"review_version":1}