{"id":"2d0cd142-484f-4399-a39e-b8fb5021cff2","arxiv_id":"2411.13539","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A subset A of finite-dimensional Euclidean space has finite Gromov-Hausdorff distance to the whole space if and only if A is an epsilon-net for some epsilon.","lead":"This paper proves that the Gromov-Hausdorff distance between Euclidean space R^n and a subset is finite exactly when the subset reaches every point within some fixed radius. It also shows the statement fails for infinite-dimensional Hilbert space, where a proper isometric copy can be at distance zero without being a net.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The final contradiction in Theorem 3.1 assumes an empty ball whose sphere meets A; under the paper's closed-ball convention this cannot happen, so the central proof is incomplete as written.","rationale":"The theorem is plausible and the overall strategy is sound: a finite-distortion correspondence, restricted to a large sphere, gives a Euclidean isometric approximation via Memoli's inequality, and the cone argument then forces A to meet every large ball. The infinite-dimensional counterexample in ℓ2 is correct. I do not regard the imported Memoli theorem as the most load-bearing risk, because it is a published external result and its use is limited to bounded sets via closure. The proof's compressed steps around Q^{-1}(p) = Q(p) = {p} and the constant T are also repaired by choosing N sufficiently large and by correcting a notation typo. The serious internal problem is the final reduction: the assertion that one may choose an empty ball whose sphere contains a point of A is contradicted by the paper's own closed-ball definition, and even under an open-ball reading it fails for open half-spaces. This gap is fixable, since bounded A is already handled by the diameter argument and for unbounded A one can perturb an empty ball to have A arbitrarily close to its sphere; but the fix is nontrivial and absent from the manuscript. The reader's verdict of CONDITIONAL is therefore appropriate: the central claim is likely correct, but Theorem 3.1 is not fully proved as written.","tokens_in":5824,"tokens_out":30723,"duration_ms":359110,"concrete_test":"Set A = {u ∈ R^2 : u_2 > 0}. For every center x and radius r with closed ball B_r(x) ⊂ R^2 \\ A, verify directly that S_r(x) ⊂ {u_2 ≤ 0}, hence S_r(x) ∩ A = ∅. Then check the final paragraph of Theorem 3.1 with this A: the asserted point a ∈ A ∩ S_r(x) does not exist, so the final contradiction cannot be executed under the paper's definitions. Next test the intended fix: for R = d(x, A) > r, choose a ∈ A with |a − x| < R + δ where δ < N − c, and verify that the cone shell at distance N from a lies inside B_r(x) for sufficiently large r. This singles out whether Theorem 3.1 survives with a revised final step or requires a genuinely new idea.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In the final paragraph of Theorem 3.1 the proof says: 'Let us choose some ball B_r(x) ⊂ Rn \\ A. Without loss of generality, suppose that there exists a point a ∈ A such that a ∈ S_r(x).' But Section 2 defines B_r(a) as the closed ball {x : |ax| ≤ r}, and S_r(x) ⊂ B_r(x). Therefore B_r(x) ⊂ Rn \\ A implies S_r(x) ∩ A = ∅; the 'without loss of generality' statement is impossible under the paper's own definitions. This is not just a notational slip: if B_r is read instead as an open ball, the assertion is still false for non-closed A. For example, take A = {u ∈ Rn : u_n > 0}. Every ball contained in Rn \\ A lies in {u_n ≤ 0}, so its sphere is disjoint from A. The proof therefore needs a replacement limiting argument: choose a ∈ A with |a − x| only slightly larger than r, and use the cone from a through x so that the fixed shell at distance N from a lies inside B_r(x). Such a perturbation is plausible when t = ∞, since one can take centers with d(x, A) arbitrarily large and radii close to that distance, but it is not written. Without this step the contrapositive does not rule out arbitrarily large empty balls, so Theorem 3.1 is not established as it stands.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves Theorem 3.1: for a non-empty subset A of R^n, the Gromov–Hausdorff distance d_GH(R^n, A) is finite if and only if A is an epsilon-net for some epsilon > 0, equivalently if and only if t = sup{r : there is a closed ball B_r(x) contained in R^n \\ A} is finite. The forward direction is elementary. The reverse direction assumes a finite-distortion correspondence R, chooses a large sphere X = S_N(p) around a point p paired with a fixed a in A, uses Memoli's Euclidean Gromov–Hausdorff inequality to produce an approximate isometry f, and derives a cone property: for every a in A and every cone with vertex a of the stated shape, some point of A lies in the shell B_{N+c}(a) \\ B_{N-c}(a) inside that cone. The contrapositive then tries to contradict this property using an empty ball B_r(x). Example 3.1 shows that the statement fails in l_2.","tokens_in":6031,"tokens_out":14452,"duration_ms":166593,"significance":"If the gap described below is repaired, the theorem gives a clean characterization of which subsets of finite-dimensional Euclidean space lie at finite Gromov–Hausdorff distance from R^n, and it sharpens the cloud picture from Gromov's book. The main estimates are coherent: the distortion bound c, the choice of N with 3T sqrt(N) < N/2, the diameter control, and the cone absorption argument all check out algebraically. The proof depends essentially on Memoli's Theorem 2.1, and the paper is explicit about this dependence and about the resulting failure in infinite dimension. The result is modest but appropriate for a short paper in math.MG, and the presentation is mostly readable.","major_comments":[{"comment":"The step 'Without loss of generality, suppose that there exists a point a in A such that a in S_r(x)' is impossible under the paper's own convention that B_r(x) is the closed ball {u : |ux| <= r}. Indeed, B_r(x) subset R^n \\ A implies S_r(x) subset B_r(x) subset R^n \\ A, so A and S_r(x) are disjoint. If B_r were read as an open ball, the claim would still fail for non-closed A, as the example A = {u : u_n > 0} shows. This step is load-bearing because the cone-shell contradiction requires a point a in A whose ray to the center x forms the cone axis. I recommend replacing this with a limiting argument: from t = infinity, choose a center x with d(x,A) arbitrarily large, set r = d(x,A) - epsilon, and choose a in A with |ax| < d(x,A) + delta; with delta and epsilon small relative to N - c, the shell pieces of the cone with vertex a and axis through x lie inside B_r(x), yielding the same contradiction. As written, the contrapositive does not rule out arbitrarily large empty balls, so Theorem 3.1 is not established.","section":"Section 3, final paragraph of Theorem 3.1"}],"minor_comments":[{"comment":"The sentence 'Since R'(p) = {a}' is not justified: the restriction of the correspondence R to X' and Y' may pair p with several elements of Y. However, the subsequent conclusion U(a) = {p} follows from the weaker and correct fact that a is in R'(p) together with Q(p) = {p}, so this is a local repair rather than a fatal flaw.","section":"Section 3, after the proof that Q^{-1}(p) = {p}"},{"comment":"The text first says 'Let us choose some ball B_r(x)' and then says 'Let us choose r so large that the following inclusion holds.' Since r is fixed by the choice of the ball, the second instruction is logically inverted; the proof should choose an empty ball of sufficiently large radius at the outset, which is possible because t = infinity.","section":"Section 3, final paragraph"},{"comment":"The theorem should state explicitly that A is non-empty, since the Gromov–Hausdorff distance and the correspondence machinery are defined only for non-empty spaces.","section":"Section 2, Definition 3 and Theorem 3.1"},{"comment":"The equalities d_GH(X,Y) = d_GH(cl X, cl Y) and d_EH(X,Y) = d_EH(cl X, cl Y) are standard but are used without proof or citation; a one-line justification would help the reader.","section":"Section 3, Corollary 1 proof"}],"recommendation":"major_revision","confidential_remarks":"To the editor: the result is likely correct and the gap in the final limiting argument appears repairable, but as submitted the central theorem is not fully proved because of the invalid 'without loss of generality' step. A revised version that supplies a correct limiting argument, and that corrects the unjustified R'(p) = {a} assertion, would be publishable. The paper's reliance on Memoli's theorem is explicit and does not seem problematic."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here is my read. The main theorem—d_GH(R^n, A) < ∞ iff A is an ε-net—is new and worth having. The proof strategy is sound: take a finite-distortion correspondence, restrict to a large sphere, apply Memoli's inequality to force a good Euclidean isometric approximation, and use a cone argument to show A must meet every large ball. The estimates are coherent; I checked the choice of N, the diameter bounds, and the distortion of Q. The infinite-dimensional counterexample is exactly the right one and makes the finite-dimension hypothesis visible.\n\nThe soft spot is the final paragraph of Theorem 3.1. Under the paper's convention, B_r(x) is the closed ball, so if B_r(x) ⊂ R^n \\ A then S_r(x) ⊂ R^n \\ A as well. The 'without loss of generality' assertion that some a ∈ A lies on S_r(x) is simply false in that setup. If you read B_r as an open ball, it is still false for non-closed A—the half-space {u_n > 0} gives arbitrarily large balls whose spheres avoid A entirely. The contrapositive needs a perturbation argument: from arbitrarily large empty balls, pick a ∈ A with |a−x| slightly larger than r and use the cone from a through x so that the shell B_{N+c}(a) \\ B_{N−c}(a) is absorbed into the empty ball. That is plausible, but it is not written. So the proof as it stands is incomplete, not merely terse.\n\nThe dependence on Memoli's Theorem 2.1 is explicit and legitimate; that is the one external input, and the authors flag it themselves. No circularity, no fitted constants.\n\nBottom line: this deserves a serious referee. The gap is local and fixable, and the result will be used by people working on Gromov–Hausdorff clouds and non-compact spaces. I would send it out with a request to repair that final paragraph. If I wrote in this area, I would cite it.","headline":"The epsilon-net characterization of finite GH distance to R^n is new and mostly proved; one local gap in the final contradiction needs fixing but looks fixable.","tokens_in":6636,"tokens_out":4066,"would_cite":true,"duration_ms":42559,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["51F30","53C23","54E35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that a subset A of R^n is at finite Gromov–Hausdorff distance from R^n exactly when it is an ε-net, and that this equivalence fails in infinite-dimensional Euclidean space.","keywords":["Gromov–Hausdorff distance","ε-net","Euclidean space","metric space","infinite-dimensional counterexample","distortion","metric realization"],"falsifier":"A concrete test: let $A_k$ be $\\mathbb{R}^n$ with $k$ disjoint closed balls of radius $k$ removed, placed far apart, and compute $d_{\\mathrm{GH}}(\\mathbb{R}^n, A_k)$; the theorem forces these distances to grow without bound as $k \\to \\infty$, so bounded values would refute it.","tokens_in":5558,"feed_emoji":"📐","tokens_out":20699,"duration_ms":194449,"temperature":0.7,"pith_summary":"This paper asks when a subset $A$ of finite-dimensional Euclidean space $\\mathbb{R}^n$ lies at finite Gromov–Hausdorff distance from the whole space. The answer is: exactly when $A$ is an $\\varepsilon$-net for some $\\varepsilon > 0$, meaning every point of $\\mathbb{R}^n$ is within distance $\\varepsilon$ of $A$. Equivalently, the largest closed ball that fits entirely inside the complement of $A$ has finite radius. This gives a clean geometric description of the collection of spaces at finite Gromov–Hausdorff distance from $\\mathbb{R}^n$, and the paper shows the description is special to finite dimension: in the infinite-dimensional space $\\ell_2$, a coordinate hyperplane is isometric to the whole space, so the Gromov–Hausdorff distance is zero, yet the hyperplane is not an $\\varepsilon$-net.","feed_headline":"In R^n, finite Gromov-Hausdorff distance means being an epsilon-net","feed_subtitle":"Equivalently, no empty ball of arbitrarily large radius exists; this fails in infinite dimensions.","key_machinery":"The proof is carried by an external inequality from reference [6], used as Corollary 1: for bounded subsets $X, Y \\subset \\mathbb{R}^n$, the Euclidean Gromov–Hausdorff distance — the minimal Hausdorff distance between $X$ and an isometric image of $Y$ under the isometry group of $\\mathbb{R}^n$ — is at most $c'_n (\\max\\{\\mathrm{diam}\\, X, \\mathrm{diam}\\, Y\\})^{1/2} d_{\\mathrm{GH}}(X,Y)^{1/2}$. This inequality turns a finite-distortion correspondence into an approximate Euclidean isometry. Given a correspondence with distortion $c < \\infty$, the proof fixes a point $p$, takes a large sphere $S_N(p)$ together with its center, and uses the inequality to make the image of $A$ nearly coincide with that sphere in Hausdorff distance. The distortion bound then forces every cone of fixed angle with vertex $p$ to meet $A$ within an annulus of radii $N-c$ and $N+c$. If the complement of $A$ contained a large ball, a suitably placed cone would lie inside that ball, forcing a point of $A$ inside the empty ball — a contradiction. The cone and sphere geometry is where the Euclidean isometry group enters, which is why the theorem does not follow for arbitrary finite-dimensional normed spaces.","core_discovery":"The central discovery is Theorem 3.1: for a subset $A \\subset \\mathbb{R}^n$, let $t = \\sup\\{r : \\exists B_r(x) \\subset \\mathbb{R}^n \\setminus A\\}$. Then $d_{\\mathrm{GH}}(\\mathbb{R}^n, A) < \\infty$ if and only if $t < \\infty$. Since $t < \\infty$ is the same as saying that $A$ is an $\\varepsilon$-net for some $\\varepsilon > 0$, the finite-distance subsets of $\\mathbb{R}^n$ are exactly its $\\varepsilon$-nets. Finite dimensionality is essential: Example 3.1 shows that the hyperplane $x_1 = 0$ in $\\ell_2$ is isometric to $\\ell_2$, hence has Gromov–Hausdorff distance $0$ from $\\ell_2$, but is not an $\\varepsilon$-net for any $\\varepsilon > 0$.","pith_inferences":["A quantitative version the paper does not state likely holds: $d_{\\mathrm{GH}}(\\mathbb{R}^n, A)$ should be bounded by a function of the empty-ball radius $t$ and the dimension $n$, not merely finite.","The same cone-and-sphere strategy would characterize finite-distance subsets of any homogeneous metric space whose isometry group is rich enough to admit a square-root estimate like the one imported from reference [6].","For computational geometry, the theorem reduces a question about an abstract distance to a coverage check: a point cloud is at finite Gromov–Hausdorff distance from $\\mathbb{R}^n$ exactly when it is an $\\varepsilon$-net, which can be tested by locating the largest empty ball.","The $\\ell_2$ example suggests that in infinite-dimensional settings, zero Gromov–Hausdorff distance can coexist with arbitrarily large holes, so a different kind of invariant would be needed there."],"forward_implications":["If $A \\subset \\mathbb{R}^n$ is at finite Gromov–Hausdorff distance from $\\mathbb{R}^n$, then $A$ is automatically an $\\varepsilon$-net, so the Gromov–Hausdorff cloud of $\\mathbb{R}^n$ is exactly the class of $\\varepsilon$-nets.","Finite distance also bounds the size of holes: the complement of $A$ cannot contain closed balls of arbitrarily large radius.","For every $\\varepsilon$-net $A$, the distance $d_{\\mathrm{GH}}(\\mathbb{R}^n, A)$ is at most $\\varepsilon$, so on the class of subsets the net radius controls the Gromov–Hausdorff distance.","The characterization is dimension-sensitive: in infinite-dimensional Euclidean space, an isometric hyperplane has distance zero but is not an $\\varepsilon$-net.","The paper leaves open whether the analogous statement holds for arbitrary finite-dimensional normed spaces, since the proof uses the isometry group of Euclidean space."],"supporting_citations":[{"why":"Supplies the square-root upper bound (Theorem 2.1, used as Corollary 1) that turns Gromov–Hausdorff closeness into Euclidean isometric closeness for bounded subsets of R^n.","marker":"[6]"},{"why":"Provides the correspondence characterization, composition inequality, and diameter bound (Claims 1, 2, and 4) used to control distortions in the main proof.","marker":"[2]"},{"why":"Cited alongside [2] for the same correspondence–distortion tools; the lecture notes give the foundational claims the proof invokes.","marker":"[8]"}],"fun_headline_variants":["In R^n, finite GH distance ⇔ subset is an epsilon-net","Finite GH distance in R^n forces an epsilon-net (converse too)","No ball of unbounded radius: GH finiteness in R^n means epsilon-net","Infinite dims fail: zero GH distance despite non-net subset","R^n: GH finite iff epsilon-net; ℓ2 hyperplane is a counterexample"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof relies on the inequality from reference [6] that for bounded subsets of $\\mathbb{R}^n$ the Euclidean Gromov–Hausdorff distance is at most a dimension-dependent constant times the square root of the maximum diameter times the Gromov–Hausdorff distance; the paper imports this theorem without reproving it, and if that inequality failed the argument would lose the approximate isometries it needs.","fun_headline_variants_meta":{"raw":{"variants":["In R^n, finite GH distance ⇔ subset is an epsilon-net","Finite GH distance in R^n forces an epsilon-net (converse too)","No ball of unbounded radius: GH finiteness in R^n means epsilon-net","Infinite dims fail: zero GH distance despite non-net subset","R^n: GH finite iff epsilon-net; ℓ2 hyperplane is a counterexample"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000963,"raw_usage":{"total_tokens":4040,"prompt_tokens":823,"completion_tokens":3217,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":439,"completion_tokens_details":{"reasoning_tokens":3115}},"tokens_in":439,"tokens_out":3217,"duration_ms":22438,"temperature":1.0,"reasoning_tokens":3115,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T16:19:14.857426+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete test: let $A_k$ be $\\mathbb{R}^n$ with $k$ disjoint closed balls of radius $k$ removed, placed far apart, and compute $d_{\\mathrm{GH}}(\\mathbb{R}^n, A_k)$; the theorem forces these distances to grow without bound as $k \\to \\infty$, so bounded values would refute it.","supporting_citations":[{"cited_title":"Memoli, Gromov-Hausdorff distances in Euclidean spaces , in IEEE Computer Society Confer- ence on Computer Vision and Pattern Recognition Workshops, June (2008), pp","cited_arxiv_id":null,"evidence_quote":"Supplies the square-root upper bound (Theorem 2.1, used as Corollary 1) that turns Gromov–Hausdorff closeness into Euclidean isometric closeness for bounded subsets of R^n."}],"review_version":1}