{"id":"056f06be-3ce8-47c3-813b-57d64a63c3c7","arxiv_id":"2607.18447","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper gives a Gromov–Hausdorff lower bound via the relative Jung constant (sound) but its stronger Jung-constant version relies on an impossible normalization step.","lead":"A math paper proves new lower bounds on Gromov–Hausdorff distance using Jung constants, but a key step in its stronger theorem is impossible as written, leaving the headline sup-norm equality unproven. The weaker bound, with the relative Jung constant, appears correct and is the paper's solid core.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 6.1 proof applies g to a witness point z outside X, where g is only defined on X; the claim w∈U3 therefore has no valid argument.","rationale":"The reader identifies the normalization y = h(y) = g(h(y)) as the fatal flaw. That step is not necessarily fatal: by relabeling the isometric copies of V that contain the images of h and g (i.e., composing with translations), one can arrange for both h and g to fix a chosen point y without changing their distortions. The genuinely load-bearing gap is different and occurs in the same paragraph: the proof evaluates g at a point z that is a witness for the intersection of the open balls and U2, but g is only defined on X, and the nerve condition does not imply z∈X. This is not a matter of missing detail; it is an undefined expression in a step essential for showing the extended simplicial map g lands in the desired nerve and that the Čech center w lies in U3. Without this, the homology contradiction collapses. The paper's central claims (Theorem 6.1 and Theorem 1.1) are therefore not established. Because the missing argument is a concrete type error rather than a debatable normalization, the appropriate verdict remains REJECT: the current proof, as written, is invalid.","tokens_in":14435,"tokens_out":36239,"duration_ms":298965,"concrete_test":"Formalize the proof in a proof assistant (or write the step in typed pseudocode) with h: V→X and g: X→V. In the second simpliciality check, the witness z is obtained from a nerve intersection of type V; the expression g(z) will fail type-checking because z is not declared to be in X. Then attempt to modify the proof by requiring z∈X∩U2: show that the nerve hypothesis (nonempty intersection of the open balls and U2) does not guarantee such a point, using V=R, X=2Z, a ball centered in X, and U2 an exterior half-line intersecting the ball in an interval with no points of X. This isolates the exact step that must be repaired.","verdict_should_be":"REJECT","load_bearing_attack":"In the proof of Theorem 6.1 (Section 6), the check that the second new simplicial map g remains simplicial considers a simplex containing the added set U2. The text chooses z∈(∩_{i<k} B(x_i;(r+ε)J)) ∩ U2 and then writes {g(x_0),...,g(x_{k-1}), g(z)} ∈ VR(X; r+2(r+ε)J). This is not legitimate: g is defined only on X, but z is chosen as a point of V from the intersection of an open ball family with U2. The nerve condition does not imply z∈X; e.g., in V=R with X=2Z, a ball centered at an even integer can intersect the far exterior U2 in an open interval containing no even integer, so g(z) is undefined. The subsequent estimate |y w| ≥ |y g(z)| − |g(z)w|, used to conclude w∈U3, depends essentially on g(z). One cannot replace z by a nearby point of X without losing the margin: |y g(x)| ≥ |y z| − |z x| − r, and |z x| may be as large as d_H(X,V), which can exceed the 6r gap between U2 and U3. Thus the simpliciality of the extended g-map, and with it the contiguity/homology contradiction, is unproved. Theorem 6.1 and its corollary Theorem 1.1 therefore lack a valid proof as written.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the Gromov–Hausdorff distance between a finite-dimensional normed space V and a subset X with finite Hausdorff distance. Theorem 3.1 gives a lower bound d_GH(X,V) ≥ d_H(X,V)/(2J_s(V)) in terms of the relative Jung constant. The authors then introduce an 'intersection property' and prove a stronger lower bound d_GH(X,V) ≥ d_H(X,V)/(2J(V)) in Theorem 6.1, from which they derive Theorem 1.1: for sup-norm spaces, d_GH(X,V) = d_H(X,V). The proof of Theorem 3.1 uses a triangulation, a surjectivity lemma, and Gulevich's theorem, and appears solid. The proof of Theorem 6.1 is toplogical, using Čech and Vietoris–Rips complexes, nerve lemmas, and the intersection property.","tokens_in":14694,"tokens_out":23398,"duration_ms":185269,"significance":"If correct, the paper would make a real contribution: it gives a quantitative lower bound for the Gromov–Hausdorff distance in terms of the Hausdorff distance and the Jung constant, and it would establish the striking equality d_GH = d_H for sup-norm spaces. The weak estimate (Theorem 3.1) is convincingly proved and appears to be a publishable result in its own right. However, the proof of the strong estimate (Theorem 6.1) contains two load-bearing errors, so the central claims of the paper are not established as written.","major_comments":[{"comment":"The proof chooses y ∈ V \\ ⋃_{x∈X} B(x;(r+ε)J), so d(y,X) ≥ (r+ε)J > 0 and in particular y ∉ X. The next sentence asserts that after translating copies of V we may assume y = h(y) = g(h(y)). This is impossible: h maps V into X and g maps X into V, so h(y) ∈ X; the equality h(y) = y would imply y ∈ X, contradicting d(y,X) > 0. An isometric copy of X cannot be translated to identify h(y) and the g-preimage of y with y unless the correspondence already has a special property. All subsequent estimates of the form |y h(z)| ≥ |y z| − r and |y g(z)| ≥ |y z| − r, used to locate the centers w in U2 and U3, rely on this identification. Thus the normalization step is invalid and the lower-bound estimates are unproved.","section":"Section 6, paragraph after diagram (1)"},{"comment":"In checking that the second new simplicial map g remains simplicial, the proof takes a simplex Δ with W_k = U_2 and chooses z ∈ (∩_{i<k} B(x_i;(r+ε)J)) ∩ U_2. It then writes {g(x_0),...,g(x_{k-1}),g(z)} ∈ VR(...), but g is defined only on X, and the nerve condition gives z ∈ V, not z ∈ X. For example, in V = R with X = 2Z, a ball centered at an even integer can meet U_2 in an open interval containing no even integer, so g(z) is undefined. The subsequent estimate |y w| ≥ |y g(z)| − |g(z)w|, which forces w ∈ U_3, depends on g(z). Replacing z by a nearby point of X would introduce an error of order d_H(X,V), which need not be small compared with the 6r gap between U_2 and U_3. Therefore the extended map g in diagram (3) is not proved simplicial, and the contiguity/homology contradiction at the end of Section 6 collapses.","section":"Section 6, simpliciality check for the extended map g"}],"minor_comments":[{"comment":"The intersection property is stated for complements V \\ \\overline{B}(0;t') with t' > t, but U_3 is defined with threshold t. This quantifier mismatch should be clarified, though it is likely fixable by shifting the thresholds.","section":"Section 6, definition of U_3"},{"comment":"In the check that g remains simplicial, the complexes denoted VR(X;...) and Č(X;...) should presumably be VR(V;...) and Č(V;...), since g takes values in V. The current notation appears to be a typo.","section":"Section 6, g-simpliciality paragraph"},{"comment":"The display in Lemma 5.2 is hard to parse: the sequence of spaces and the labels 'h', 'g', 'ι_ν' do not clearly indicate the order of the induced simplicial maps. This should be typeset more explicitly.","section":"Lemma 5.2"}],"recommendation":"reject","confidential_remarks":"The stress-test concern reported by the reader is valid: the proof of Theorem 6.1 relies on an impossible normalization and on evaluating g at points outside its domain. These are not mere presentation issues. The weak estimate (Theorem 3.1) appears sound and could form the basis of a separate paper, but the current manuscript's headline results are unproved as written. I would be willing to reconsider a substantially revised version with a correct proof of Theorem 6.1."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"What you should know about this one: it has two distinct contributions, and they are very unevenly matched. Theorem 3.1, the lower bound d_GH(X,V) >= (1/(2J_s(V))) d_H(X,V), is new and, as far as I can tell, correct. The triangulation argument is clean, the use of Bourgin–Webster is legitimate, and applying Gulevich's theorem G(V)=J_s(V) gives exactly the right constant. The sanity checks, like X = 2Z inside R, come out properly. That part of the paper deserves credit and should survive independent of what happens to the rest.\n\nThe problem is the advertised stronger result. In the proof of Theorem 6.1, the authors choose y outside the union of balls of radius (r+ε)J around X, so d(y,X) > 0 and in particular y is not in X. Then, without any real justification, they write that a parallel translation lets us assume y = h(y) = g(h(y)). But h maps V into X, so h(y) is in X, and y is not in X. That equality is unsatisfiable as stated. The distortion estimates that follow — the ones that push w into U_2 and then into U_3 — depend on this normalization. The stress-test note adds another valid objection: later in the same proof, the simplicial map g is applied to a point z chosen from an open ball intersection in V, but g is only defined on X, and z need not lie in X. Those two gaps are not cosmetic; they knock out the homology contradiction that establishes Theorem 6.1. Since Theorem 1.1 (the sup-norm equality d_GH = d_H) is a direct corollary of Theorem 6.1, the paper's main advertised results currently lack valid proofs.\n\nI want to be clear that this is not a worthless manuscript. The intersection property is a sensible definition, the examples and counterexamples are informative, and Corollary 3.6 follows cleanly from Theorem 3.1. The authors are not sloppy; the gap is the kind of subtle point-fixed-point confusion that can happen in long nerve-diagram chases. But it is load-bearing, and it is wrong. This is not repairable by a sentence or two: the proof as written simply does not go through.\n\nMy bottom line: send it to peer review, but the referees should focus on whether the strong theorem can be patched. The weak theorem is solid and citable on its own. If you use GH distance bounds, read the proof of Theorem 3.1 and ignore the second half of the paper until the authors provide a corrected version.","headline":"The weak bound in Theorem 3.1 is a genuine, well-proved new result, but the stronger Theorem 6.1 and the headline sup-norm equality rest on a step that is internally contradictory; the paper needs serious repair before it can be trusted.","tokens_in":15389,"tokens_out":1888,"would_cite":true,"duration_ms":17970,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["46B20","54E35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that the Gromov–Hausdorff distance between a finite-dimensional normed space and a subset at finite Hausdorff distance is at least the Hausdorff distance divided by twice the Jung constant, and equals it for sup-norm spaces","keywords":["Gromov–Hausdorff distance","Hausdorff distance","Jung constant","relative Jung constant","normed spaces","intersection property","sup-norm","nerve lemma"],"falsifier":"Take V = ℓ∞^2 and let X be a finite ε-net of the unit square for some ε > 0; if d_GH(X,V) turns out to be strictly less than d_H(X,V), Theorem 1.1 would be false. More generally, exhibit any finite-dimensional normed space satisfying the intersection property and a subset X for which d_GH(X,V) < d_H(X,V)/(2J(V)).","tokens_in":14190,"feed_emoji":"📏","tokens_out":9001,"duration_ms":61153,"temperature":0.7,"pith_summary":"The paper establishes a lower bound on the Gromov–Hausdorff distance between a finite-dimensional normed space V and any subset X at finite Hausdorff distance: d_GH(X,V) ≥ (1/(2J_s(V))) d_H(X,V), where J_s(V) is the relative Jung constant. When V satisfies a geometric condition called the intersection property, the bound improves to use the absolute Jung constant J(V): d_GH(X,V) ≥ (1/(2J(V))) d_H(X,V). For finite-dimensional spaces with the sup-norm, J(V)=1/2 and the intersection property holds, so the Gromov–Hausdorff distance equals the Hausdorff distance exactly. This matters because lower bounds on the Gromov–Hausdorff distance are notoriously difficult, and the result shows that for a large class of spaces the two distances are proportional.","feed_headline":"Proved: Gromov–Hausdorff equals Hausdorff in sup-norm spaces","feed_subtitle":"A Jung-constant lower bound makes the two distances coincide when the constant is 1/2, simplifying distance computations for dense subsets.","key_machinery":"The Jung constant J(V) is the supremum over unit-diameter subsets of the circumradius; the relative Jung constant J_s(V) restricts circumcenters to lie in the convex hull of the subset. The intersection property says that, far away from the origin, the intersection of a finite family of balls of bounded radius with the complement of a large ball is contractible whenever non-empty. The proof's engine is a diagram of nerve complexes of ball coverings, where the Jung constant controls the conversion between Vietoris–Rips and Čech scales, and the intersection property guarantees the nerve lemma applies after adding the 'complement of a large ball' sets; a contradiction in top homology then force","core_discovery":"The central claim is that the Hausdorff distance controls the Gromov–Hausdorff distance from below, up to a constant determined by the Jung constant. For any finite-dimensional normed space V and subset X with d_H(X,V) < ∞, the paper proves d_GH(X,V) ≥ d_H(X,V)/(2J_s(V)); for spaces with the intersection property, the relative Jung constant J_s(V) can be replaced by the usual Jung constant J(V). As a corollary, in a finite-dimensional sup-norm space, d_GH(X,V) = d_H(X,V) for every such X. The proof builds a correspondence between V and X, extends it to a triangulation, and then uses a nerve-lemma/homology argument involving Čech and Vietoris–Rips complexes, with the intersection property ens","pith_inferences":["If the proof's normalization step can be justified, the same technique may yield lower bounds for other classes of metric spaces where a Jung-type constant and a nerve-lemma argument are available.","The equality for sup-norm spaces suggests that exact Gromov–Hausdorff distance computations to dense subsets might be reduced to computing Hausdorff distance, which is far easier to estimate numerically.","The dependence on the intersection property hints that the Gromov–Hausdorff distance to a subset is controlled by the failure of ball-intersections to be contractible at large scales; spaces where this failure is bounded may admit similar proportional bounds.","A testable extension: for other polytopal norms such as ℓ1^n, compute the Jung constant and search for subsets that achieve the lower bound d_GH = d_H/(2J), which would establish sharpness of the inequality."],"forward_implications":["For any finite-dimensional sup-norm space (e.g., ℓ∞^n), the Gromov–Hausdorff distance from a subset to the whole space is exactly its Hausdorff distance.","For an n-dimensional space with the max-norm and n ≥ 3, the bound gives d_GH(X,V) ≥ (n/(2(n-1))) d_H(X,V), improving on the trivial inequality.","The equivalence of finiteness of Hausdorff distance, Gromov–Hausdorff distance, and being an ε-net (Corollary 3.5) means the coarse category of subsets of a finite-dimensional normed space is governed by ε-nets.","For any 2-dimensional normed space, or any space with a cylindrical norm, the strong lower bound holds with the absolute Jung constant.","The result extends the known equality d_GH = d_H from graph subsets to a class of normed spaces, suggesting a wider phenomenon."],"fun_headline_variants":["Gromov–Hausdorff bounded below by Hausdorff divided by 2Jung","Jung constant links Hausdorff and Gromov–Hausdorff distances","Sup-norm spaces: Hausdorff equals Gromov–Hausdorff","New bound: Gromov–Hausdorff ≥ Hausdorff/(2Jung)"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof of the strong lower bound assumes that a point y chosen outside X can be treated as a fixed point of the correspondence maps h and g after translating coordinates, a step that is asserted without being justified.","fun_headline_variants_meta":{"raw":{"variants":["Gromov–Hausdorff bounded below by Hausdorff divided by 2Jung","Jung constant links Hausdorff and Gromov–Hausdorff distances","Sup-norm spaces: Hausdorff equals Gromov–Hausdorff","New bound: Gromov–Hausdorff ≥ Hausdorff/(2Jung)"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001035,"raw_usage":{"total_tokens":4163,"prompt_tokens":679,"completion_tokens":3484,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":423,"completion_tokens_details":{"reasoning_tokens":3388}},"tokens_in":423,"tokens_out":3484,"duration_ms":23084,"temperature":1.0,"reasoning_tokens":3388,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T15:26:35.094453+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take V = ℓ∞^2 and let X be a finite ε-net of the unit square for some ε > 0; if d_GH(X,V) turns out to be strictly less than d_H(X,V), Theorem 1.1 would be false. More generally, exhibit any finite-dimensional normed space satisfying the intersection property and a subset X for which d_GH(X,V) < d_H(X,V)/(2J(V)).","supporting_citations":[],"review_version":1}