{"id":"3d498b17-a3d3-48e7-998d-a85842df5a7a","arxiv_id":"1908.02491","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For the Laakso/Lang-Plaut doubling space X, the difference set Phi(X)-Phi(X) inside L-infinity(X) is not doubling.","lead":"This paper presents a concrete form of a known doubling metric space that cannot be embedded into Hilbert space, and proves that its difference set, viewed inside the Kuratowski embedding, is not doubling. It matters because it blocks a natural route to almost-bi-Lipschitz embeddings and highlights the role of difference sets in metric embedding theory.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 2.2's covering argument relies on an unproved separation assertion about edge cycles; without it, the contradiction M ≥ 6^(i-1) does not follow.","rationale":"The paper's central claim is that Φ(X)-Φ(X) is not doubling. The proof is a contradiction that reduces to a geometric separation fact about edge cycles. That fact is used twice: to assert ϱ(t_j,x), ϱ(s_j,x)>r and to count one center per cycle. I could not find a formal statement of either in the text; the construction is described by a figure and the k>i case by another figure. The theorem may well be true—the Laakso construction is standard and the explicit definition of X is a useful contribution—but the proof as written does not give a verifiable argument for the strict separation. The reader's conditional verdict is therefore appropriate: the result is plausible but not established. I do not see a reason to move to acceptance or rejection; the correct next step is to fill the geometric lemma or find a counterexample to it. This stress-test agrees with the reader that the covering/counting step is the weak point, though I would sharpen it to the unproved strict distance inequalities rather than only the bounded-witness counting.","tokens_in":4463,"tokens_out":22179,"duration_ms":263081,"concrete_test":"Implement the graphs X_1 and X_2 explicitly from the rule in Figure 1, and test the key assertion: fix r=4^(-i), choose one edge cycle C, place a center pair (t,s) with t in a neighboring cycle but at distance ε from a shared vertex, with ε=r/100, and s anywhere outside C; compute sup_{z∈X_i} |d(x,z)-d(y,z)-d(t,z)+d(s,z)| for the x,y prescribed in Figure 2. Repeat for ε=r/4 and for all neighboring edges. If any configuration gives sup ≤ r, Theorem 2.2's Figure 2 inequality is false; if all give sup > r, the separation step is corroborated at least at this scale.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Theorem 2.2, after choosing k so that all centers have t_j,s_j in [X_k], the proof claims that if an edge cycle of X_i contains no t_j/s_j then the points x,y chosen in Figure 2 satisfy ϱ(t_j,x)>r and ϱ(s_j,x)>r for every j, with r=4^(-i). This is the load-bearing geometric input. The paper does not prove it, and it is not a formal consequence of the stated recursive construction (six scaled copies of X_{i-1} glued as in a figure). In the Laakso gadget, an edge cycle is a 4-cycle whose vertices are shared with the gadgets attached to adjacent edges; a center positioned just inside an adjacent gadget, close to the shared vertex, is not 'in' the cycle but can be at distance <r from any point x in the cycle that is near that vertex. The inequalities >r are therefore not guaranteed. The later step 'since there are 6^(i-1) edge cycles contained in X_i, we deduce M ≥ 6^(i-1)' also ignores that one center at a shared vertex belongs to several cycles; this could be repaired by a constant factor, but no such bound is stated. The k>i case is dispatched by referring to Figure 3 and 'rescaling' rather than by a proof that the same separation survives. If the separation lemma fails, the contradiction collapses and the theorem is not established.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper recalls the Laakso / Lang--Plaut construction of a doubling metric space X that is not bi-Lipschitz embeddable into any Hilbert space, gives a more explicit description of X as a Gromov--Hausdorff limit of a sequence of graphs X_i (each obtained from X_{i-1} by gluing six rescaled copies), and then states Theorem 2.2: if Phi: X -> L^infinity(X) is the Kuratowski embedding, the difference set Phi(X)-Phi(X) is not doubling. The proof assumes doubling of Phi(X)-Phi(X), covers a ball of radius 2r at 0 by M balls of radius r, and tries to force M >= 6^{i-1} by showing that every 'edge cycle' of X_i must contain one of the points t_j,s_j representing the centers. The paper concludes that Theorem 1.1 cannot be applied to this X and poses two open problems about almost bi-Lipschitz embeddings.","tokens_in":4741,"tokens_out":7034,"duration_ms":84519,"significance":"The motivating question is genuine and the proposed theorem, if established, would be a useful negative result: it shows that even for a doubling metric space with a very rigid self-similar structure, the set of differences under the Kuratowski embedding can fail to be doubling, so the hypotheses of Robinson's embedding theorem (Theorem 1.1) are not automatically satisfied. The paper's main contribution is a clean formulation of this obstruction and a concrete description of the Laakso-type space. However, the significance is conditional on the proof of Theorem 2.2 being completed; as written, the proof relies on several unproved geometric assertions. The paper does not include machine-checked proofs or reproducible code, but the strategy of deriving a covering lower bound from edge cycles is natural and, if carried out rigorously, would be convincing.","major_comments":[{"comment":"The proof claims that if an edge cycle of X_i contains no images of any t_j or s_j, then one can choose x,y in that cycle such that rho(t_j,x) > r and rho(s_j,x) > r for every j, with r = 4^{-i}. This separation statement is not proved and is not a formal consequence of the recursive gluing construction. A point t_j lying in an adjacent square that shares a vertex with the chosen cycle can be at distance less than r from points x near that vertex, so the strict inequalities require a quantitative choice of x,y and a proof that avoids all centers simultaneously. Since the subsequent contradiction uses these inequalities to conclude ||f - g_j||_infty > r, this missing separation lemma is load-bearing; without it the covering argument collapses.","section":"§2, Theorem 2.2 (k <= i case)"},{"comment":"Even if every edge cycle of X_i is forced to contain at least one of the points t_j,s_j, the deduction 'since there are 6^{i-1} edge cycles contained in X_i, we deduce that M >= 6^{i-1}' does not follow as stated, because one point can belong to several edge cycles that meet at shared vertices. The proof needs a uniform bound on the multiplicity of cycles through any point (for example, bounded by the graph degree), after which the conclusion becomes M >= c^{-1} 6^{i-1}. The missing constant may be harmless for the contradiction, but the argument as written is not valid.","section":"§2, Theorem 2.2 (counting edge cycles)"},{"comment":"The treatment of the case k > i is deferred to Figure 3 and the word 'rescaling'. The proof must show that after embedding X_i into X_k, the chosen points x,y from X_i and the centers t_j,s_j in X_k satisfy the same distance inequalities with respect to the fixed radius r = 4^{-i}. This is not automatic, because r is not rescaled when passing to X_k, and the relation between balls in X and in the embedded copies under the quotient construction is not described. The case k > i therefore is not a formal consequence of the previous case as written.","section":"§2, Theorem 2.2 (k > i case)"},{"comment":"The isometric embeddings h_{i->j} used to define the limit space X are never specified, only indicated by a figure, and the quotient construction is asserted rather than verified. In particular, the equivalence relation x ~ y iff rho*(x,y) = 0 requires a proof that rho* is a pseudometric and that the quotient distance rho([x],[y]) = rho*(x,y) is independent of representatives. Since Theorem 2.2 is stated for this X, the theorem's hypotheses are not fully defined until these steps are supplied.","section":"§2, construction of X"}],"minor_comments":[{"comment":"The abstract cites Lang and Plaut as [3], but in the introduction Lang and Plaut are correctly cited as [4]; the abstract citation should be corrected.","section":"Abstract and Introduction"},{"comment":"In the definition of (M,s)-homogeneous, the expression (R/r)^s is written but R is not defined; the intended quantity is presumably (r/rho)^s. Please correct this typo.","section":"§1, definition of homogeneous space"},{"comment":"The proof that X is doubling is deferred to 'For a proof see [5]', where [5] is an unpublished PhD thesis. Since this fact is used as motivation, it would be preferable either to include a proof or to cite a published source.","section":"§2, doubling of X"},{"comment":"The term 'edge cycle' is used informally; a formal definition of the cycles and of the endpoints v_i^j, u_i^j would make the counting and covering arguments easier to verify.","section":"§2, edge cycles"}],"recommendation":"major_revision","confidential_remarks":"The central claim is plausible and the paper addresses an interesting question, but the proof of Theorem 2.2 currently has several unproved geometric steps that are essential to the contradiction. I would be willing to reconsider after a major revision that supplies the separation lemma, a multiplicity bound for the cycle counting, and a rigorous treatment of the k > i and quotient-construction issues."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe paper is a short research note on Laakso graphs. The new thing is Theorem 2.2: for the Laakso/Lang–Plaut space X, the difference set Phi(X)-Phi(X) under the Kuratowski embedding into L^infinity(X) is not doubling. That is a natural question in the context of Olson–Robinson embeddings, and a negative answer here blocks one route to almost bi-Lipschitz embeddings. The construction is also a welcome concrete presentation of Laakso's example.\n\nThe proof, however, has a real gap. In the covering argument, after fixing centers g_j from points t_j,s_j, the authors claim that if an edge cycle contains none of the t_j,s_j, then for suitable x,y in the cycle we have rho(t_j,x)>r and rho(s_j,x)>r for all j, where r=4^{-i}. That does not follow. Points in adjacent edges that meet the cycle at a shared vertex are not \"in\" the cycle, and they can be arbitrarily close to that vertex. So for a point x on the cycle near that vertex, the distance to such a t_j can be well below r. There is no separation argument in the text that prevents this. The same issue affects the counting step: even if the separation held, the conclusion M>=6^{i-1} ignores that a single center at a shared vertex can lie on many cycles; that overlap would only cost a constant factor, but it is not stated.\n\nThe case k>i is even more compressed: it refers to a figure and says \"rescale\" instead of proving that the separation survives. Since the contradiction rests on the unsupported >r inequalities, the theorem is not established as written.\n\nI want to be clear about what is good. The question is worth asking, the construction is clearly described, and the authors are honest about the motivation. The citation error in the abstract (Lang and Plaut should be [4], not [3]) is minor; the reliance on an unpublished thesis for one proof is also minor given the published Lang–Plaut result.\n\nWho is this for? Researchers working on metric embeddings and homogeneous sets. I would not cite it in its current form, but it deserves a serious referee. The natural outcome is major revision: the authors need to prove a genuine separation lemma, either by choosing a cycle at sufficient distance from all centers or by a different covering argument.\n\nRecommendation: send to peer review, but do not accept as is.","headline":"Plausible new result about difference sets of Laakso spaces, but the main proof has an unaddressed separation gap that undermines the covering argument.","tokens_in":5229,"tokens_out":6767,"would_cite":false,"duration_ms":73775,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["54E35"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that the set of differences of the Kuratowski embedding of a particular doubling metric space is not itself doubling.","keywords":["iterated graph spaces","doubling metric spaces","Kuratowski embedding","sets of differences","Gromov-Hausdorff convergence","bi-Lipschitz embedding","homogeneous metric spaces","almost bi-Lipschitz embedding"],"falsifier":"Compute, on the finite graphs $X_i$, the minimum number $N_i$ of radius-$4^{-i}$ balls in $L^\\infty(X_i)$ needed to cover $\\{d(x,\\cdot)-d(y,\\cdot):d(x,y)<2\\cdot4^{-i}\\}$; if $N_i$ stays bounded as $i$ grows, the lower bound $N_i\\ge6^{i-1}$ asserted in the proof is wrong and the non-doubling claim fails.","tokens_in":4279,"feed_emoji":"📐","tokens_out":16565,"duration_ms":154760,"temperature":0.7,"pith_summary":"This paper establishes that a particular doubling metric space $X$---built by gluing six scaled copies of a unit interval at each stage of a graph construction---has a Kuratowski embedding whose set of differences is not doubling. The set of differences is $\\Phi(X)-\\Phi(X)=\\{d(x,\\cdot)-d(y,\\cdot):x,y\\in X\\}$ inside $L^\\infty(X)$. This matters because the available almost bi-Lipschitz embedding theorem requires such a difference set to be homogeneous, and homogeneity is equivalent to doubling; the counterexample closes off that route for $X$. The proof is quantitative: at scale $r=(1/4)^i$, any cover of the difference ball by radius-$r$ balls needs at least $6^{i-1}$ balls.","feed_headline":"A doubling space whose difference set is not doubling","feed_subtitle":"The Kuratowski image of a six-branch graph has a difference set that no finite number of half-size balls can cover.","key_machinery":"The mechanism is the cycle-counting argument on the iterated graphs. An edge cycle is a square loop produced in $X_i$ by the six-to-one gluing, and there are $6^{i-1}$ of them at level $i$. The proof makes each covering centre $g_j=d(t_j,\\cdot)-d(s_j,\\cdot)$ own at least one cycle by showing that an unwitnessed cycle supports a difference function that cannot be within distance $r$ of any $g_j$. The Kuratowski embedding is the translating device: it turns metric distances $\\varrho(x,y)$ into $L^\\infty$ norms of difference functions, so metric separation in the graph becomes separation in the function space.","core_discovery":"On the paper's own terms, the central result is Theorem 2.2. The space $X$ is the Gromov-Hausdorff limit of finite graphs $X_i$, where $X_0$ is a single edge of length $1$ and $X_{i+1}$ is six copies of $X_i$ scaled by $1/4$ and identified at endpoints; each $X_i$ contains $6^{i-1}$ edge cycles. The Kuratowski embedding $\\Phi(x)=d(x,\\cdot)$ sends $X$ isometrically into $L^\\infty(X)$. The theorem asserts that the difference set $\\Phi(X)-\\Phi(X)$ is not doubling. Assuming it were doubling, the proof takes $r=(1/4)^i$, a cover of $B(0,2r)$ by $M$ balls of radius $r$, and a stage $k$ containing all the centres' defining points. Each edge cycle of $X_i$ must contain one of these defining points; otherwise a difference function $f=d(x,\\cdot)-d(y,\\cdot)$ localised in that cycle is farther than $r$ from every centre. With $6^{i-1}$ cycles and only $M$ centres, letting $i$ grow gives the contradiction; the case where $k>i$ is handled by rescaling the cycle from $X_i$ to $X_k$.","pith_inferences":["A natural test is to compute the exact covering numbers $N_i$ on the finite graphs $X_i$; if $N_i=6^{i-1}$ holds numerically, it would confirm the geometric separation assumption that the proof leaves to a figure.","The cycle-counting mechanism should generalise to any iterated graph in which each stage replaces an edge by a fixed number $b$ of scaled copies: the exponential growth of cycles at a fixed radius ratio is what breaks doubling, so the phenomenon does not depend on the precise choices $6$ and $1/4$.","If every doubling metric space is eventually shown to admit an almost bi-Lipschitz Euclidean embedding, this example would indicate that hypotheses on the difference set are not the right sufficient condition, since the set of differences fails here for a purely combinatorial reason."],"forward_implications":["Since a metric space is homogeneous exactly when it is doubling, $\\Phi(X)-\\Phi(X)$ is not homogeneous, so the almost bi-Lipschitz embedding theorem quoted in the introduction cannot be applied to this difference set.","At $r=(1/4)^i$, every cover of the difference ball $B(0,2r)$ by radius-$r$ balls needs at least $6^{i-1}$ balls, an explicit covering-number obstruction at a fixed radius ratio.","The space $X$ itself remains doubling with constant $6$, so the example separates the doubling property of a space from the doubling property of its Kuratowski difference set.","The explicit description of $X$ as a union of identified stages shows that the limiting space used in earlier constructions can be built concretely rather than only as a Gromov-Hausdorff limit.","The question of whether $X$ itself admits an almost bi-Lipschitz Euclidean embedding is left open, but the difference-set route to such an embedding is ruled out."],"supporting_citations":[{"why":"Supplies the original construction of a doubling metric space that cannot be embedded bi-Lipschitzly into Euclidean space.","marker":"[3]"},{"why":"Provides the earlier construction of a homogeneous space with no bi-Lipschitz Hilbert embedding that this paper makes more concrete.","marker":"[4]"},{"why":"Gives the Kuratowski embedding and the Gromov-Hausdorff background used to define $X$ and $\\Phi$.","marker":"[2]"},{"why":"Establishes the almost bi-Lipschitz embedding theorem for homogeneous spaces that motivates studying the difference set.","marker":"[6]"},{"why":"States the embedding theorem whose hypothesis of homogeneous difference set is ruled out for this $X$.","marker":"[7]"},{"why":"Contains the proof that $X$ is doubling with constant $6$, the doubling background for the example.","marker":"[5]"}],"fun_headline_variants":["Non-doubling difference set from a doubling space","Doubling space, but differences aren't doubling","Laakso's graph: non-doubling differences","Non-doubling differences from a doubling space"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof assumes, without proving it and with only a figure as evidence, that the isometric copies of earlier stages sit inside later stages in a way that keeps the edge cycles sufficiently separate for each covering centre to witness at most one cycle.","fun_headline_variants_meta":{"raw":{"variants":["Non-doubling difference set from a doubling space","Doubling space, but differences aren't doubling","Laakso's graph: non-doubling differences","Non-doubling differences from a doubling space"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001079,"raw_usage":{"total_tokens":4498,"prompt_tokens":910,"completion_tokens":3588,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":526,"completion_tokens_details":{"reasoning_tokens":3526}},"tokens_in":526,"tokens_out":3588,"duration_ms":25383,"temperature":1.0,"reasoning_tokens":3526,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:42:28.736459+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, on the finite graphs $X_i$, the minimum number $N_i$ of radius-$4^{-i}$ balls in $L^\\infty(X_i)$ needed to cover $\\{d(x,\\cdot)-d(y,\\cdot):d(x,y)<2\\cdot4^{-i}\\}$; if $N_i$ stays bounded as $i$ grows, the lower bound $N_i\\ge6^{i-1}$ asserted in the proof is wrong and the non-doubling claim fails.","supporting_citations":[{"cited_title":"Plane with A∞-weighted metric not Bi-Lipschitz embeddable to Rn","cited_arxiv_id":null,"evidence_quote":"Supplies the original construction of a doubling metric space that cannot be embedded bi-Lipschitzly into Euclidean space."},{"cited_title":"and Plaut, C., 2001","cited_arxiv_id":null,"evidence_quote":"Provides the earlier construction of a homogeneous space with no bi-Lipschitz Hilbert embedding that this paper makes more concrete."},{"cited_title":"‘Geometric Embeddings of Metric Spaces.’ Lectures in the Finnish Graduate School of Mathematics, University of Jyvaskyla (2003)","cited_arxiv_id":null,"evidence_quote":"Gives the Kuratowski embedding and the Gromov-Hausdorff background used to define $X$ and $\\Phi$."},{"cited_title":"and Robinson, J","cited_arxiv_id":null,"evidence_quote":"Establishes the almost bi-Lipschitz embedding theorem for homogeneous spaces that motivates studying the difference set."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"States the embedding theorem whose hypothesis of homogeneous difference set is ruled out for this $X$."},{"cited_title":"Phd Thesis, University of Warwick, Department of Math- ematics, 2019","cited_arxiv_id":null,"evidence_quote":"Contains the proof that $X$ is doubling with constant $6$, the doubling background for the example."}],"review_version":1}