{"id":"4e787a57-39bf-403d-9db8-c14787a52b53","arxiv_id":"2505.18158","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves d_GH(Z^2,R^2)=sqrt(2)/2 and d_GH(A,R^2)=1/2 for a comb-shaped set A, using a new theorem that bounds GH distance below via r-disjoint covers and asymptotic dimension.","lead":"This short paper proves a theorem that uses asymptotic dimension to lower-bound Gromov-Hausdorff distances, then applies it to show that the distance between the integer lattice Z^2 and the plane R^2 equals their Hausdorff distance, sqrt(2)/2. The method is a new tool for exact computations in metric geometry, a field where very few exact distances are known.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The chessboard color classes in Example 1 are not √2-disjoint (same-color distance is exactly √2), so Theorem 3 cannot be applied at r=√2; the bound survives by taking r→√2, but the paper must add that limiting step.","rationale":"I read Theorem 3 as the central claim, with R^2 and Z^2 as the headline application. The proof by contradiction is essentially correct: a correspondence with disR<r pushes r-disjoint bounded families from A to ε-disjoint families in X with bounded diameters, and applying a nontrivial stabilizer λ>1 yields arbitrarily separated bounded covers of X, contradicting asdim X ≥ n. The main defect is not this scaling idea but the strict inequality in the example. The chessboard families have minimal same-color distance exactly √2, so they satisfy Definition 9 only for r<√2. Since Definition 9 is strict, Theorem 3 cannot be invoked at r=√2. The fix (r→√2) is elementary and does not threaten the theorem. The reader's other concern about the definition of λ^nV is a matter of notation: St_X means there is a bijective similarity S_λ, and λ^nV should be S_λ^n(V). This should be stated, but it is not a mathematical obstruction. Therefore the verdict remains conditional: the paper is essentially correct but needs a rigorous statement of the scaling action and the limiting argument in Example 1.","tokens_in":3171,"tokens_out":19380,"duration_ms":216701,"concrete_test":"Compute, for the chessboard partition of Z^2, the exact value of inf{|a−b| : a,b same color, a≠b}; it is √2. Then re-run Example 1 with r=√2−ε for a sequence ε→0+ and verify that Theorem 3 applies for every ε>0 (same-color distance > r) and yields d_GH(Z^2,R^2) ≥ r/2; taking ε→0 gives the claimed lower bound. If this limiting step is inserted, the application is valid; if not, Example 1's conclusion does not follow from Theorem 3.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The theorem itself is sound in outline: for any correspondence R with disR < r, the images of r-disjoint bounded families are ε-disjoint and bounded in X, and scaling by a stabilizer element λ>1 produces arbitrarily separated bounded covers of X, contradicting asdim X ≥ n. The serious gap is in the flagship application. In Z^2 with the chessboard coloring, two distinct points of the same color can be at distance √2, e.g., (0,0) and (1,1); hence d(Uα,Uβ)=√2, not >√2. Definition 9 requires strict inequality d(Uα,Uβ)>r, so these families are r-disjoint exactly for r<√2, not for r=√2. Example 1 invokes Theorem 3 with r=√2, so the proof of d_GH≥√2/2 is not valid as written. The fix is routine: for every r<√2 the families are r-disjoint, so Theorem 3 gives d_GH≥r/2 for all r<√2; taking the supremum as r→√2 yields d_GH≥√2/2. This limiting argument is absent. Since the missing step is elementary, the central claim survives, but the manuscript must be corrected.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a method for deriving lower bounds on Gromov–Hausdorff distances using asymptotic dimension. The main result, Theorem 3, asserts that if X has asymptotic dimension at least n and nontrivial stabilizer St_X, and if A admits a cover by k ≤ n r-disjoint families of uniformly bounded subsets, then d_GH(A,X) ≥ r/2. The proof proceeds by contradiction: a correspondence with distortion less than r would transfer the r-disjoint bounded families of A to ε-disjoint bounded families covering X, and iterating a similarity of X would produce arbitrarily separated bounded covers, contradicting asdim X ≥ n. The paper applies this to show d_GH(Z^2,R^2) = √2/2 using a chessboard coloring of Z^2, and to compute d_GH(A,R^2) = 1/2 for a comb-like subset A of R^2.","tokens_in":3399,"tokens_out":10346,"duration_ms":104412,"significance":"The idea of using asymptotic dimension as an obstruction to small Gromov–Hausdorff distance is original and potentially valuable for unbounded spaces with self-similarities. The equality d_GH(Z^2,R^2) = √2/2 is a clean, nontrivial example, and the method avoids constructing optimal correspondences explicitly. The paper is transparent about relying on standard results (asdim R^n = n, the correspondence formula for d_GH). However, the proof as written has several load-bearing gaps: the scaling operation on subsets of a general metric space is not formally defined, and the flagship application invokes r-disjointness at a value that violates the strict inequality in Definition 9. These issues are fixable, but they currently make the paper incomplete.","major_comments":[{"comment":"The notation λ^n V^i is not defined. St_X is defined as the set of λ for which λX is isometric to X, which implies the existence of a bijection f: X → X with d(f(x),f(y)) = λ^{-1} d(x,y) (or its inverse providing scale λ), but the proof never introduces such a similarity. The sentence 'Consider the families λ^n V^1, ..., λ^n V^k of subsets of X' is therefore meaningless for a general metric space. This is load-bearing because the contradiction relies on producing arbitrarily separated bounded covers of X. The proof must explicitly fix a similarity f of X with scale μ > 1 and define μ^n V = f^n(V), or otherwise specify how St_X acts on subsets.","section":"Section 3, proof of Theorem 3"},{"comment":"The chessboard color classes are not √2-disjoint under Definition 9, which requires d(U_α,U_β) > r. For distinct same-color points, the distance can be exactly √2, e.g., between (0,0) and (1,1). Therefore Theorem 3 cannot be applied with r = √2. The intended bound, d_GH(Z^2,R^2) ≥ √2/2, can be recovered by applying Theorem 3 for every r < √2 and taking the supremum as r → √2, but this limiting argument is absent from the text. This is a genuine error in the paper's main example and must be corrected.","section":"Example 1"},{"comment":"The assertion that A admits a cover by two families of uniformly bounded subsets that are 1-disjoint is stated without proof. With the strict inequality in Definition 9, the existence of such a cover is not immediate: any horizontal segment of A has distance 0 from the adjacent vertical lines, so the assignment of pieces to the two families must be described explicitly (or, if the figure is meant to illustrate a limiting r < 1 construction, that should be stated). Please provide the explicit families or a precise description of the cover used in Figure 2, and verify that the strict r-disjointness condition is satisfied.","section":"Example 2"}],"minor_comments":[{"comment":"There are several typographical errors and missing spaces, e.g., 'Inthispaper', 'theGromov–Hausdorff', and 'dGH (R2, Z2) = dH (R2, Z2)' in the abstract. The text should be cleaned up.","section":"Abstract and Introduction"},{"comment":"The stabilizer St_X is defined in terms of λX being isometric to X, but the proof of Theorem 3 treats St_X as though it acts on X by similarities. A sentence explaining the action of St_X on subsets would resolve the ambiguity.","section":"Definition 7"},{"comment":"The definition of r-disjoint families uses a strict inequality d(U_α,U_β) > r. This is compatible with the proof of Theorem 3, but the strictness is easy to overlook; the paper should perhaps remind the reader of this convention when applying the definition in examples.","section":"Definition 10"},{"comment":"Reference [3] contains a typo: 'Guolinag Yu' should be 'Guoliang Yu'.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The central idea is sound and the proof of Theorem 3 can likely be repaired with a small amount of added formalism (defining the similarity and its action). The main issue is the erroneous √2-disjointness claim in Example 1, which is a factual error in the flagship application; however, the limiting argument fixes it in a routine way. Example 2 also needs clarification. I recommend major revision rather than rejection because the errors are localized and repairable, but the current version is not publishable as written."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The main result is a genuine new trick: use asymptotic dimension to get lower bounds on Gromov–Hausdorff distance, then get equalities when the Hausdorff distance supplies the upper bound. I went in skeptical and came out thinking the core argument is right, though the written proof needs a few repairs.\n\nWhat is new: Theorem 3 connects coarse dimension to GH lower bounds. The idea is simple and sound: if a correspondence had distortion below r, it would transfer r-disjoint bounded families from A into uniformly bounded families in X, and then scaling by a stabilizer λ>1 would produce arbitrarily separated bounded covers of X, contradicting asdim X ≥ n. That is a legitimately new application of asymptotic dimension, not a repackaging. The examples are clean, and the upper bounds via Hausdorff distance are immediate.\n\nWhere it gets soft. The stress-test note is right about Example 1. The chessboard color classes are not √2-disjoint: two same-color lattice points can be exactly √2 apart, e.g. (0,0) and (1,1). Definition 9 requires strict inequality, so Theorem 3 applies only for r<√2. The fix is elementary—apply the theorem for every r<√2 and take the supremum—but the paper does not say this. Example 2 also relies on a cover by two 1-disjoint families for the comb; that may hold, but the construction is not shown and deserves a picture or an explicit description. The proof of Theorem 3 also glosses over what λ^n V^i means; since λ is in the stabilizer, one should name the bijective similarity and write S_λ^n(V^i). That is notational, not conceptual.\n\nThe reader's report flagged strict disjointness of the transferred families as unproved, but that part is actually fine: with disR < r−ε, the distance between images is >ε. The only genuinely missing step is the limiting argument in Example 1. I would not give the paper a soundness score as low as 5; the flaw is contained and the proof outline is structurally sound.\n\nWho this is for: people who compute exact GH distances between unbounded spaces, and anyone interested in interactions between coarse geometry and metric geometry. It is a small paper, not a paradigm shift, but it gives a reusable tool. I would send it to a serious referee; the repairs are mechanical and the main theorem is likely correct.\n\nRecommendation: engage with it. Ask for the limiting step and for formal scaling notation before acceptance.","headline":"A genuine new trick: asymptotic dimension gives GH lower bounds, and the main examples are correct after a small limiting step the paper omits.","tokens_in":3912,"tokens_out":13472,"would_cite":true,"duration_ms":136274,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["54F45","53C23"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims a general lower bound for Gromov–Hausdorff distance using asymptotic dimension and a scaling similarity, and proves that the distance between the integer lattice Z² and the Euclidean plane R² is exactly the Hausdorff…","keywords":["Gromov–Hausdorff distance","asymptotic dimension","r-disjoint families","uniformly bounded cover","Hausdorff distance","integer lattice","stabilizer of metric space","metric geometry"],"falsifier":"Construct a correspondence between Z² and R² with distortion strictly below √2; by Proposition 1 this would give d_GH(Z²,R²) < √2/2 and refute the paper's equality. A direct check of Example 1 at r = √2 is also decisive: the chessboard color classes have minimum same-color distance exactly √2, so under Definition 9 they are not strictly √2-disjoint, and the theorem must be applied along a sequence r → √2.","tokens_in":2960,"feed_emoji":"📐","tokens_out":11193,"duration_ms":120018,"temperature":0.7,"pith_summary":"The paper introduces a new lower-bound technique for the Gromov–Hausdorff distance: instead of constructing optimal correspondences, it uses asymptotic dimension to rule out correspondences with small distortion. The central theorem states that if a target space X has asymptotic dimension at least n and a non-trivial stabilizer, and if a source space A can be covered by k ≤ n uniformly bounded families that are pairwise separated by more than r, then every correspondence between A and X has distortion at least r, so d_GH(A,X) ≥ r/2. Applied to the plane and the integer lattice, the chessboard coloring of Z² supplies two nearly √2-disjoint uniformly bounded families, giving d_GH(Z²,R²) ≥ √2/2; the standard Hausdorff upper bound gives the reverse inequality, so equality follows. A second example, a comb-like subset of the plane, is handled by the same mechanism and yields d_GH(A,R²) = 1/2.","feed_headline":"Asymptotic dimension pins lattice-plane distance to √2/2","feed_subtitle":"A covering argument gives the exact Gromov–Hausdorff value where only bounds were known before.","key_machinery":"The machinery is the r-disjoint cover definition of asymptotic dimension together with the stabilizer St_X = {λ > 0 : λX is isometric to X}. A correspondence with distortion < r maps k r-disjoint uniformly bounded families of A to ε-disjoint uniformly bounded families of X; multiplying by a stabilizer λ > 1 stretches both separations and diameters, so the ratio stays fixed but the scale grows without bound, contradicting asdim X ≥ n whenever k ≤ n. The chessboard coloring of Z² supplies the two bounded families used in the main example.","core_discovery":"Theorem 3 is the paper's central discovery: a lower bound on d_GH(A,X) obtained without building correspondences. For metric spaces X and A, if asdim X ≥ n and St_X ≠ {e}, and if A admits a cover by k r-disjoint families of uniformly bounded subsets with 1 ≤ k ≤ n, then d_GH(A,X) ≥ r/2. The proof takes an arbitrary correspondence R with dis R < r, pushes the r-disjoint families from A into X, where they become ε-disjoint uniformly bounded families, and then uses a stabilizer λ > 1 to scale them, producing arbitrarily large separated families that contradict asdim X ≥ n. For X = R² and A = Z², the two chessboard color classes play the role of the two families, yielding d_GH(Z²,R²) = d_H(Z²,R²) = √2/2.","pith_inferences":["A natural extension, not pursued in the paper, is to apply the theorem to Zⁿ inside Rⁿ with the ℓ∞ metric: the parity coloring gives two uniformly bounded families separated by distance 1, so for every n ≥ 2 the same argument would yield d_GH(Zⁿ,Rⁿ) = 1/2, matching the Hausdorff bound.","If the strict inequality in the definition of r-disjointness is relaxed to d ≥ r, a limiting version of Theorem 3 would likely hold, making Example 1 apply directly at r = √2 instead of requiring a sequence r → √2.","The proof suggests a sharper principle: whenever an isometric embedding realizes the Hausdorff distance, it is Gromov–Hausdorff optimal exactly when the source space admits r-disjoint bounded covers with k ≤ asdim of the target.","The asymmetric nature of the argument points toward a dual statement: covering properties of the target space might yield upper bounds on d_GH, complementing the lower bounds obtained here."],"forward_implications":["For the integer lattice and the Euclidean plane, the exact value d_GH(Z²,R²) = √2/2 follows, matching the Hausdorff distance of the standard inclusion.","For the comb-shaped set A = R×{0} ∪ ∪_{n∈Z} {n}×R inside R², the same theorem gives d_GH(A,R²) = d_H(A,R²) = 1/2.","Any n-dimensional normed space has asymptotic dimension n, so the theorem applies to every such space with a non-trivial stabilizer, giving a broad class of exact lower bounds.","When a space A admits k ≤ n uniformly bounded r-disjoint covering families, the lower bound d_GH(A,X) ≥ r/2 is automatic; thus any isometric embedding of A into X whose Hausdorff distance equals r/2 is automatically Gromov–Hausdorff optimal.","The method converts exact Gromov–Hausdorff computation into a finite covering problem, potentially yielding new exact distances wherever such separated bounded covers are easy to describe."],"supporting_citations":[{"why":"Supplies the formula 2 d_GH = inf dis R that turns a distortion bound into a distance bound.","marker":"[2]"},{"why":"Supplies the r-disjoint cover definition of asymptotic dimension on which the contradiction in Theorem 3 rests.","marker":"[1]"},{"why":"Supplies the theorem asdim R^n = n, used to fix X = R² as having asymptotic dimension 2.","marker":"[3]"},{"why":"Supplies the stabilizer St_X and its subgroup property, the tool used for the scaling step in the proof.","marker":"[4]"}],"fun_headline_variants":["Asymptotic dimension yields exact lattice–plane distance","Lattice vs plane: exact GH distance = √2/2","Covering argument pins Z²–R² distance to √2/2","Exact Gromov–Hausdorff distance without correspondences","Asymptotic dimension computes GH distance exactly"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything rests on finding k ≤ n uniformly bounded families in A whose mutual distances are strictly greater than r, together with a genuine scaling similarity of X; if the separation is only equal to r, the positive margin used in the proof collapses.","fun_headline_variants_meta":{"raw":{"variants":["Asymptotic dimension yields exact lattice–plane distance","Lattice vs plane: exact GH distance = √2/2","Covering argument pins Z²–R² distance to √2/2","Exact Gromov–Hausdorff distance without correspondences","Asymptotic dimension computes GH distance exactly"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000669,"raw_usage":{"total_tokens":2980,"prompt_tokens":807,"completion_tokens":2173,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":423,"completion_tokens_details":{"reasoning_tokens":2087}},"tokens_in":423,"tokens_out":2173,"duration_ms":17598,"temperature":1.0,"reasoning_tokens":2087,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T04:45:42.879494+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a correspondence between Z² and R² with distortion strictly below √2; by Proposition 1 this would give d_GH(Z²,R²) < √2/2 and refute the paper's equality. A direct check of Example 1 at r = √2 is also decisive: the chessboard color classes have minimum same-color distance exactly √2, so under Definition 9 they are not strictly √2-disjoint, and the theorem must be applied along a sequence r → √2.","supporting_citations":[{"cited_title":"155 (2008), 1265–1296","cited_arxiv_id":null,"evidence_quote":"Supplies the r-disjoint cover definition of asymptotic dimension on which the contradiction in Theorem 3 rests."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the theorem asdim R^n = n, used to fix X = R² as having asymptotic dimension 2."}],"review_version":1}