{"id":"4ffbab4a-8d3a-4b73-b831-1f46cb27dfed","arxiv_id":"1908.06323","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Under explicit density and scale-gap assumptions, including a data set into a larger one induces homotopy equivalences of Vietoris-Rips and Lesnick complexes, and a controlled homotopy equivalence of branch point posets.","lead":"This math paper shows when a smaller sample of points inside a larger point cloud has the same topological shape as the whole cloud, at a fixed detection scale, for two common constructions used in data analysis. It also introduces a compressed 'branch point' structure for cluster hierarchies and proves that moving between the sample and the full set changes this structure only by a controlled amount.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Branch-point 'controlled homotopy equivalence' is not defined or stated as a theorem; Section 2 gives inequalities but no formal conclusion, leaving the abstract's main claim uncheckable.","rationale":"The reader's weakest_assumption focuses on the configuration-space density condition, which is an explicit and understandable hypothesis rather than a flaw. However, the reader's rationale also flags the branch-point 'controlled homotopy equivalence' as sketched rather than fully proved. My stress-test identifies this as the single most load-bearing concern because it is the paper's advertised novelty and it is not stated as a precise theorem. The underlying inequalities in Section 2 are plausible and likely correct, and the interleaving results for Rips and Lesnick complexes appear well-supported. The concern is about completeness and precision, not about an internal inconsistency; the unresolved sentence about preservation of least upper bounds is a symptom of the same informality. A formal theorem statement and verification would settle whether the abstract's claim is justified. Since the reader already assigned CONDITIONAL for essentially this reason, my recommendation is UNCHANGED.","tokens_in":8968,"tokens_out":40088,"duration_ms":372452,"concrete_test":"Add a formal theorem to Section 2: under the hypotheses of Corollary 4 (X^{k+1}_dis r-dense in Y^{k+1}_dis and 2r < s_{i+1}-s_i), the induced map i_*: Br_k(X)→Br_k(Y) is a homotopy equivalence of posets with homotopy inverse θ_*, where the homotopies are the natural inequalities θ_* i_* ≤ s_*, i_* θ_* ≤ s_*, and id ≤ s_*. Verify that these inequalities constitute natural transformations and that the zigzags yield homotopies in the usual poset model structure; then test the statement on a small finite example (e.g., two nested 4-point sets in R). If the theorem cannot be stated or the example fails, the abstract's claim should be weakened.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's headline claim—that the branch-point map Br_k(X)→Br_k(Y) is a controlled homotopy equivalence—is never made precise. Section 2 derives inequalities θ_* i_* ≤ s_* and i_* θ_* ≤ s_*, plus id ≤ s_*, where s_* shifts parameters by 2r. These are naturally interpreted as a homotopy in the category of posets via the zigzag θ_* i_* → s_* ← id, but the paper does not state this or define what 'controlled' means. The metric on branch points is only sketched in a remark, and the hypotheses under which the inequalities make i_* an equivalence (e.g., whether the scale-gap 2r < s_{i+1}-s_i is needed) are not assembled into a theorem. Since the abstract advertises the branch-point result as a main consequence, the central claim is currently not a checkable mathematical statement. Additional evidence of informality: the text first says 'The map i∗ preserves least upper bounds by Lemma 7' and then says it 'only preserves least upper bounds up to homotopy'—an unresolved contradiction. The core interleaving theorems (Corollaries 2 and 4) appear sound; the density assumption on distinct tuples is explicit and not a flaw. The load-bearing gap is the branch-point claim's lack of formalization.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies inclusions X⊂Y⊂R^n of finite data sets and gives explicit density conditions under which the induced maps of Vietoris-Rips complexes V_s(X)→V_s(Y) and Lesnick complexes L_{s,k}(X)→L_{s,k}(Y) are weak homotopy equivalences at scale parameters separated from the next phase change. The proofs use elementary interleaving maps based on choosing r-close points. The second half defines hierarchy posets Γ_k(X) and their branch point subposets Br_k(X), develops a least-upper-bound calculus, and claims that the induced branch point map is a controlled homotopy equivalence with shift 2r.","tokens_in":9187,"tokens_out":4418,"duration_ms":39680,"significance":"The interleaving results in Section 1 are clean, self-contained, and checkable; the density assumption on distinct tuples for Lesnick complexes is explicit, and no fitted parameters appear. If the branch-point stability claim can be formalized, it would give a concrete stability statement for hierarchical clusterings relevant to HDBSCAN and DBSCAN. However, as it stands, the branch-point part of the paper is a sketch rather than a theorem, so the main advertised consequence is not yet established.","major_comments":[{"comment":"The claim in the abstract and introduction that the branch point map is a 'controlled homotopy equivalence' is never stated as a precise theorem. The inequalities θ_* i_* ≤ s_* and i_* θ_* ≤ s_* are described informally, but the paper does not define 'controlled homotopy equivalence' for posets, does not state the hypotheses under which these inequalities imply an equivalence (e.g., whether the scale gap 2r < s_{i+1}-s_i is required), and does not prove that s_*(s,[x]) = (s,[x]) under that condition. Since this is advertised as a main consequence, the central claim is currently not checkable.","section":"Section 2, after Lemma 12"},{"comment":"There is an unresolved contradiction: the text first says 'The map i∗ preserves least upper bounds by Lemma 7' and later says 'the map i∗ only preserves least upper bounds up to homotopy.' Lemma 7 concerns the inclusion Br_k(X)⊂Γ_k(X), not i_*; the second statement is the correct one, and the first must be deleted or replaced. As written, a reader cannot tell which statement is intended.","section":"Section 2, paragraph beginning 'This map takes a branch point...'"},{"comment":"'If the bound 2r is sufficiently small, then (s,[x]) is the largest branch point below (s+2r,[x]) and s∗(s,[x])=(s,[x]) in that case.' This condition is used implicitly to convert the interleaving inequalities into an equivalence, but it is only asserted in prose and not stated as a lemma with proof. If the scale-gap condition 2r < s_{i+1}-s_i is the intended hypothesis, it should be stated and proved in the same way as Corollaries 2 and 4.","section":"Section 2, final paragraph"}],"minor_comments":[{"comment":"The proof begins 'Suppose that y∈ L_{s,k}(X)_0−L_{s,k}(X)_0', which is an empty set; the intended statement is likely about vertices of L_{s,k}(Y).","section":"Theorem 3 proof, first sentence"},{"comment":"The homotopy commutative diagrams are established via natural transformations on posets of non-degenerate simplices, i.e., on subdivisions; the paper should say explicitly that this gives homotopy commutativity after subdivision and hence for the original complexes, since the reader may otherwise be confused about the category in which the diagrams commute.","section":"Theorems 1 and 3"},{"comment":"The notation s∗ is used for a poset morphism on Br_k(X) but its domain is often left implicit; specify whether s∗ is defined on X or on Y in each displayed inequality.","section":"Section 2, shift map notation"}],"recommendation":"major_revision","confidential_remarks":"The paper is explicitly marked as not in final form. The Section 1 results are solid and suitable for publication after revision. The branch-point section needs to be rewritten as a precise statement; otherwise the abstract overclaims. The author may also want to clarify the status of reference [3], since the claimed correspondence with stable components is motivational and not load-bearing."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The useful core of this paper is the pair of explicit interleaving theorems: Theorem 1 for Vietoris-Rips complexes and Theorem 3 for Lesnick complexes, under the configuration-space density assumption on distinct tuples. The proofs are clear and checkable, and the corollaries (2 and 4) turn the interleavings into genuine homotopy equivalences under the scale-gap condition 2r < s_{i+1} - s_i. That part is worth having. The density assumption on X^{k+1}_{dis} is explicit, not hidden, and it is the right hypothesis to make the theta map work; I don't treat it as a flaw. The least-upper-bound calculus for hierarchy posets and the ultrametric on path components of Lesnick complexes go beyond what I have seen in the cited Carlsson-Memoli and Blumberg-Lesnick work, and the lemmas there are mostly rigorous.\n\nThe soft spot is exactly what the stress-test note flags: the headline claim that Br_k(X) -> Br_k(Y) is a controlled homotopy equivalence is never stated as a theorem with hypotheses and a conclusion. Section 2 gives inequalities such as theta_* i_* <= s_* and i_* theta_* <= s_*, and the author calls these bounded homotopies, but 'controlled' is never defined, and the conditions under which s_* is close enough to the identity to make i_* an equivalence are only assembled informally in the closing paragraphs. There is also a genuine internal tension: the text first says the map i_* preserves least upper bounds by Lemma 7, then later says it only preserves them up to homotopy. The second statement is the correct one, and the first is misleading. The remark proposing a distance on branch points is too terse to make the 'closeness' claims quantitative.\n\nNone of this undermines Theorems 1 and 3, which are the papers real contribution. But the abstract promises a branch-point stability result, and that part is currently not a checkable mathematical statement. The paper itself says it is not in final form, which is consistent.\n\nA serious referee should take this on. The core interleaving theorems deserve publication, and the branch-point section can be repaired with a precise definition of controlled homotopy equivalence and a stated theorem with the scale-gap assumption. I would bring it to a reading group and cite the Lesnick interleaving result, but I would not rely on the branch-point claim as it stands.","headline":"The Vietoris-Rips and Lesnick interleaving theorems are solid and checkable; the advertised controlled homotopy equivalence of branch point posets is only sketched and needs formalization.","tokens_in":9788,"tokens_out":1007,"would_cite":true,"duration_ms":11506,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["55N31","55P99","55U10"],"pacs":[],"model":"deepseek-v4-flash","headline":"Under explicit density and scale-gap assumptions, an inclusion of data sets induces homotopy equivalences of Vietoris-Rips and Lesnick complexes, and a controlled homotopy equivalence of branch-point hierarchies.","keywords":["Vietoris-Rips complexes","Lesnick complexes","r-density","interleaving homotopy equivalences","branch points","hierarchical clustering","ultrametric","topological data analysis"],"falsifier":"Place a=(0,0), b=(0.1,0) in X and add c=(0.1,1), d=(0,1) to get Y, with r=0.2 and k=1. The configuration $X^{2}$_dis is not r-dense in $Y^{2}$_dis: the pair (c,a) is farther than r from both (a,b) and (b,a). At scale s=1 the phase gap is 0.9 > 2r, yet L_{1,1}(X) is an edge while L_{1,1}(Y) is a 4-cycle, so the inclusion is not a homotopy equivalence; this shows the configuration-density assumption is doing real work.","tokens_in":8687,"feed_emoji":"🕸️","tokens_out":11044,"duration_ms":97919,"temperature":0.7,"pith_summary":"This paper asks when a smaller data set inside a larger one captures the full homotopy type of the larger one. It proves that if the smaller set is r-dense in the larger, and 2r is smaller than the gap between consecutive scale values at which the larger set changes, then the inclusion of Vietoris-Rips complexes is a homotopy equivalence. It extends the same conclusion to Lesnick (degree-Rips) complexes under a stronger density condition on (k+1)-tuples of distinct points, and shows that the induced map on branch-point hierarchies is a controlled homotopy equivalence, off by a scale shift of at most 2r. The upshot is a stability statement: cluster trees and branch points of a dataset are insensitive to subsampling that is dense enough at the configuration level.","feed_headline":"Dense subsets preserve Rips and Lesnick homotopy types","feed_subtitle":"Every k+1-point configuration lies within r, and 2r is below the next scale gap: inclusion is a homotopy equivalence.","key_machinery":"The argument runs on two mechanisms. The first is an interleaving homotopy diagram built from a choice function θ that sends each point of Y to an r-close point of X, making V_s(Y) deform into V_{s+2r}(X) through a homotopy that factors through face inclusions; the same construction works on Lesnick complexes once the density assumption is upgraded to configurations of k+1 distinct points. The second is the poset of branch points Br_k(X) inside the hierarchy tree Γ_k(X): least upper bounds of branch points are again branch points, and the inclusion Br_k(X) ⊂ Γ_k(X) has a homotopy inverse given by sending each vertex to its unique maximal branch point below it. This calculus of least upper bounds is what turns the pointwise interleavings into controlled homotopy equivalences of branch-point posets, with the shift map s_* recording the bounded scale distortion.","core_discovery":"The central claim is that the pair of assumptions - r-density plus the scale gap 2r < s_{i+1} - s_i - turns an inclusion X ⊂ Y into homotopy equivalences of simplicial complexes. Corollary 2 states that if X is r-dense in Y and 2r < s_{i+1} - s_i, then i: V_{s_i}(X) → V_{s_i}(Y) is a weak homotopy equivalence; Corollary 4 states the same for L_{s_i,k}(X) → L_{s_i,k}(Y) when $X^{{k+1}}$_{dis} is r-dense in $Y^{{k+1}}$_{dis}. Theorems 1 and 3 establish the underlying interleaving homotopy commutative diagrams using a choice function θ that sends each point (or each (k+1)-tuple) of Y to an r-close point (or tuple) of X. On the hierarchy side, the paper defines branch points of the tree Γ_k(X) = Γ(π_0 L_{*,k}(X)), proves that Br_k(X) ⊂ Γ_k(X) is a homotopy equivalence via the maximal-branch-point map, and shows that the induced map i_*: Br_k(X) → Br_k(Y) satisfies θ_* i_* ≤ s_* and i_* θ_* ≤ s_*, where s_* shifts scale by 2r; hence it is a controlled homotopy equivalence, becoming an actual equivalence when 2r is below the next phase-change gap.","pith_inferences":["One could read the configuration-space density condition as a requirement that the subsample realizes the local k-th order correlation structure of the larger set; pointwise density alone is insufficient exactly when coarse k-tuples are sampled too sparsely.","The controlled homotopy equivalence suggests a practical stability estimate for hierarchical density clustering: subsampling moves branch points by at most 2r in the scale coordinate, so the dendrogram timetable is stable up to a known shift.","Because Br_k(X) is a tree that is homotopy equivalent to the full hierarchy Γ_k(X), it may serve as a sparse replacement for the full cluster hierarchy in persistence computations, potentially reducing the number of vertices needed to represent the same connectivity information.","A numerical experiment could measure the least upper bounds of branch points before and after subsampling and check whether the inequality (s,x) ≤ (t+2r, θ(y)) ≤ (s+2r,x) holds with t within 2r; this would test the controlled equivalence directly."],"forward_implications":["For point clouds with a dense subsample and no phase-change gap below 2r, persistent homology of the Vietoris-Rips filtration is unchanged by the subsample at the sampled scale parameters.","The same holds for Lesnick complexes, so density-filtered clustering outputs are unchanged at those scales.","The branch-point posets Br_k(X) and Br_k(Y) have homotopies θ_* i_* ≤ s_* and i_* θ_* ≤ s_*, with s_* a shift by 2r; when 2r is smaller than the next phase gap these homotopies collapse to an actual homotopy equivalence.","The least upper bound in Γ_k(X) induces an ultrametric on π_0 L_{s,k}(X), giving a quantitative merge-time distance for density clusters.","If the configuration-space density condition holds for all k up to a fixed bound, the entire hierarchy of branch-point posets is stable under the inclusion up to the same 2r scale shift."],"supporting_citations":[{"why":"Supplies the interleaving homotopy type method that Theorems 1 and 3 mirror.","marker":"[1]"},{"why":"Defines the ultrametric on data from single-linkage clustering that the least upper bound calculus extends to Lesnick complexes.","marker":"[2]"},{"why":"Defines stable components that branch points are said to correspond to one-to-one, providing the motivation for the branch point poset.","marker":"[3]"},{"why":"Source for the Lesnick complexes and the degree-Rips filtration that form the main objects of Theorem 3 and Corollary 4.","marker":"[4]"},{"why":"Identifies the tree Γ_k(X) as the object underlying a density-based hierarchical clustering algorithm, explaining the applied relevance of the hierarchy statements.","marker":"[5]"}],"fun_headline_variants":["Dense subsets plus scale gaps fix homotopy types","Rips-Lesnick complexes: density and gap ensure equivalence","Controlled homotopy for branch points from dense inclusion","Interleaving homotopy equivalences from data density","Scale-gapped density: inclusion is homotopy equivalence"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The result depends on the larger data set being well approximated not just point by point but at the level of configurations: every collection of k+1 distinct points of the larger set must have a corresponding collection of k+1 distinct points of the smaller set within distance r; without that, the Lesnick and branch-point statements do not follow.","fun_headline_variants_meta":{"raw":{"variants":["Dense subsets plus scale gaps fix homotopy types","Rips-Lesnick complexes: density and gap ensure equivalence","Controlled homotopy for branch points from dense inclusion","Interleaving homotopy equivalences from data density","Scale-gapped density: inclusion is homotopy equivalence"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000998,"raw_usage":{"total_tokens":4230,"prompt_tokens":954,"completion_tokens":3276,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":570,"completion_tokens_details":{"reasoning_tokens":3194}},"tokens_in":570,"tokens_out":3276,"duration_ms":24024,"temperature":1.0,"reasoning_tokens":3194,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:50:03.592864+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Place a=(0,0), b=(0.1,0) in X and add c=(0.1,1), d=(0,1) to get Y, with r=0.2 and k=1. The configuration $X^{2}$_dis is not r-dense in $Y^{2}$_dis: the pair (c,a) is farther than r from both (a,b) and (b,a). At scale s=1 the phase gap is 0.9 > 2r, yet L_{1,1}(X) is an edge while L_{1,1}(Y) is a 4-cycle, so the inclusion is not a homotopy equivalence; this shows the configuration-density assumption is doing real work.","supporting_citations":[{"cited_title":"Characterization, stabilit y and con- vergence of hierarchical clustering methods","cited_arxiv_id":null,"evidence_quote":"Defines the ultrametric on data from single-linkage clustering that the least upper bound calculus extends to Lesnick complexes."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines stable components that branch points are said to correspond to one-to-one, providing the motivation for the branch point poset."},{"cited_title":"Lesnick and M","cited_arxiv_id":null,"evidence_quote":"Source for the Lesnick complexes and the degree-Rips filtration that form the main objects of Theorem 3 and Corollary 4."},{"cited_title":"Accelerated hierarchical densit y based clustering","cited_arxiv_id":null,"evidence_quote":"Identifies the tree Γ_k(X) as the object underlying a density-based hierarchical clustering algorithm, explaining the applied relevance of the hierarchy statements."}],"review_version":1}