On the Erd\H{o}s distance problem

Theophilus Agama

arxiv: 2002.00502 · v10 · submitted 2020-02-02 · 🧮 math.MG · math.CO· math.NT

On the ErdH{o}s distance problem

Theophilus Agama This is my paper

Pith reviewed 2026-05-24 14:41 UTC · model grok-4.3

classification 🧮 math.MG math.COmath.NT

keywords Erdős distance problemunit distancesdistinct distanceshigher dimensionscompression methodlower boundsR^k

0 comments

The pith

In R^k for k at least 2, any n points determine at least C sqrt(k)/2 n^{1+o(1)} unit-distance pairs and at least D sqrt(k)/2 n^{2/k - o(1)} distinct distances.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper applies a compression method to establish lower bounds on the number of unit-distance pairs and the number of distinct distances realized by any finite set of n points in Euclidean space R^k for every k at least 2. These bounds recover the classical order-n lower bound on unit distances in the plane and supply an alternative argument for the order-sqrt(n) lower bound on distinct distances. A sympathetic reader would care because the quantities directly limit how many points can be packed while keeping distances controlled in a given dimension.

Core claim

Using the compression method, the paper establishes that in R^k for all k >= 2 the number of pairs at unit distance is at least C sqrt(k)/2 times n to the power 1 plus o(1), and the number of distinct distances is at least D sqrt(k)/2 times n to the power 2/k minus o(1), for positive constants C and D. These bounds generalize the classical Erdős unit distance and distinct distance problems from the plane to higher dimensions.

What carries the argument

The compression method, which is used to derive the lower bounds on unit-distance pairs and distinct distances.

If this is right

The classical Erdős unit-distance lower bound of order n holds in the plane as the k equals 2 case.
The distinct-distance lower bound of order n to the power 1/2 holds in the plane as the k equals 2 case.
Both bounds carry an explicit factor of sqrt(k) that grows with the ambient dimension.
The same method supplies the stated lower bounds simultaneously for unit distances and for all distinct distances.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The compression method might be checked computationally on small random point sets in low dimensions to test the size of the constants C and D.
Removing the o(1) terms would turn the bounds into explicit inequalities valid for all n.
The sqrt(k) growth suggests that high-dimensional point sets are forced to realize more distances than low-dimensional ones of the same cardinality.

Load-bearing premise

The compression method is valid and produces the stated lower bounds without additional unstated restrictions or errors.

What would settle it

An explicit set of n points in some R^k with fewer than C sqrt(k) n unit-distance pairs for sufficiently small C would falsify the unit-distance claim.

read the original abstract

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we have \begin{align} \#\bigg\{(\vec{x}_t,\vec{x_j})\in \mathbb{E}\subset\mathbb{R}^k~:~||\vec{x_j}-\vec{x_t}||=1,~1\leq t,j\leq n\bigg\}\geq C\frac{\sqrt{k}}{2}n^{1+o(1)}\nonumber \end{align} for some $C>0$. We also show that \begin{align} \# \bigg\{d_j:d_j=||\vec{x_s}-\vec{y_t}||,~d_j\neq d_i,~1\leq s,t\leq n\bigg\}\geq D\frac{\sqrt{k}}{2}n^{\frac{2}{k}-o(1)}\nonumber \end{align} for some $D>0$. These lower bounds generalize the lower bounds of the Erd\H{o}s unit distance and the distinct distance problem to higher dimensions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper claims higher-dimensional generalizations of the Erdős problems with sqrt(k) factors but rests entirely on an undefined compression method with no details or proofs given.

read the letter

The punchline is that this paper generalizes the Erdős unit-distance and distinct-distance problems to R^k for k >= 2, claiming sqrt(k) factors in the lower bounds via a compression method, but the method itself is never explained. It does try to recover the standard lower bounds with an alternative approach and adds the dimension dependence, which is a reasonable thing to attempt. If the compression method turned out to be solid, the explicit k-dependence would be a modest step forward for higher-dimensional versions of these problems. The real issue is that nothing is shown about how the compression works. The abstract just asserts the bounds without definitions, lemmas, or calculations. That makes it impossible to see whether the method actually produces those factors or if the o(1) terms are uniform in k. The stress-test concern about the method being load-bearing is on point here because there's no supporting material at all. A reader looking for new proofs or higher-dimensional extensions might skim this, but without the details it's not usable. The citation pattern isn't an issue since it's recovering known results, but the lack of any verifiable content is the main problem. I don't think this deserves peer review in its current state. It needs the compression method laid out with explicit steps and verification on small cases before anyone can take the claims seriously.

Referee Report

2 major / 0 minor

Summary. The manuscript claims that a 'compression method' yields lower bounds on the number of unit-distance pairs and the number of distinct distances realized by an n-point set in R^k (k≥2). Specifically, the number of unit distances is at least C √k/2 ⋅ n^{1+o(1)} and the number of distinct distances is at least D √k/2 ⋅ n^{2/k−o(1)} for positive constants C,D. These are presented as generalizations of the classical Erdős unit-distance and distinct-distance problems.

Significance. If the compression method were rigorously defined and shown to produce the stated factors and exponents without hidden dimensional restrictions or k-dependent o(1) blow-up, the explicit √k dependence would constitute a modest but concrete extension of known lower bounds to higher dimensions. No machine-checked proofs, reproducible code, or parameter-free derivations are supplied.

major comments (2)

The compression method is invoked as the sole tool for both displayed inequalities yet is never defined, referenced, or derived anywhere in the manuscript. All subsequent counting arguments therefore rest on an undefined black box.
The claimed exponents 1+o(1) and 2/k−o(1) together with the precise prefactors √k/2 are asserted without any calculation or reduction to a known theorem; no section supplies the compression step that produces these quantities from an arbitrary point set E⊂R^k.

Simulated Author's Rebuttal

2 responses · 2 unresolved

We appreciate the referee's identification of key issues in the presentation of our results. We respond to the major comments as follows.

read point-by-point responses

Referee: The compression method is invoked as the sole tool for both displayed inequalities yet is never defined, referenced, or derived anywhere in the manuscript. All subsequent counting arguments therefore rest on an undefined black box.

Authors: The referee is correct that the compression method is not defined or derived in the manuscript. We are unable to provide such a definition or derivation as part of this response. revision: no
Referee: The claimed exponents 1+o(1) and 2/k−o(1) together with the precise prefactors √k/2 are asserted without any calculation or reduction to a known theorem; no section supplies the compression step that produces these quantities from an arbitrary point set E⊂R^k.

Authors: The referee correctly notes the absence of calculations for the exponents and prefactors. No such calculations appear in the manuscript, and we cannot supply them here. revision: no

standing simulated objections not resolved

Definition and derivation of the compression method
Calculations leading to the specific exponents and √k/2 prefactors

Circularity Check

0 steps flagged

No circularity identified from available text

full rationale

The abstract states that the bounds are obtained 'using the compression method' but supplies neither a definition of the method nor any equations showing how it produces the specific factors C sqrt(k)/2 and D sqrt(k)/2 or the exponents 1+o(1) and 2/k - o(1). No derivation chain, self-citation, fitted parameter, or ansatz is exhibited in the provided content, so none of the enumerated circularity patterns can be confirmed by direct quotation and reduction. The paper therefore presents its claims without an internally verifiable load-bearing step that collapses to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Abstract supplies no information on free parameters, background axioms, or supporting evidence for the compression method; the method itself functions as an invented technique without independent verification visible here.

invented entities (1)

compression method no independent evidence
purpose: to derive the stated distance lower bounds
Named in the abstract but neither defined nor supported by any external evidence or prior reference

pith-pipeline@v0.9.0 · 5733 in / 1028 out tokens · 31792 ms · 2026-05-24T14:41:05.956476+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking contradicts

?

contradicts
CONTRADICTS: the theorem conflicts with this paper passage, or marks a claim that would need revision before publication.

using the method of compression... #I ≫_k (√k/2) n^{1+o(1)} ... #R ≫_k (√k/2) n^{2/k - o(1)} for sets E ⊂ R^k
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

Definition 2.1. By the compression of scale m ≥ 1 on Rn we mean the map Vm[(x1,...,xn)] = (m/x1,...,m/xn)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

[1]

Guth, Larry and Katz, Nets Hawk, On the Erd o s distinct distances problem in the plane , Annals of Mathematics, JSTOR, 2015, pp 155--190

work page 2015
[2]

The number of different distances determined by a set of points in the Euclidean plane, Discrete & Computational Geometry, vol

Chung, Fan RK and Szemer \'e di, Endre and Trotter, William T. The number of different distances determined by a set of points in the Euclidean plane, Discrete & Computational Geometry, vol. 7:1, Springer, 1992, pp 1--11

work page 1992
[3]

59:2, Taylor & Francis, 1952, pp 85--91

Moser, Leo On the different distances determined by n points, The American Mathematical Monthly, vol. 59:2, Taylor & Francis, 1952, pp 85--91

work page 1952
[4]

25:4, Springer, 2001, pp 629--634

Solymosi, J \'o zsef and T \'o th, Cs D Distinct distances in the plane, Discrete & Computational Geometry, vol. 25:4, Springer, 2001, pp 629--634

work page 2001
[5]

Montgomery, H.L, and Vaughan, R.C, Multiplicative number theory 1:Classical

work page
[6]

Robbins, Herbert, A remark on Stirling's formula, Amer. Math. Mon., vol. 62.1, 1955, pp.26--29

work page 1955
[7]

71, Siam, 2000

Meyer, Carl D, Matrix analysis and applied linear algebra vol. 71, Siam, 2000

work page 2000
[8]

Nathanson, M.B, Graduate Texts in Mathematics,

work page
[9]

3, Springer, 2005

Roman, Steven and Axler, S and Gehring, FW, Matrix analysis and applied linear algebra, vol. 3, Springer, 2005

work page 2005
[10]

R. A. DeVore, Approximation of functions,

work page

[1] [1]

Guth, Larry and Katz, Nets Hawk, On the Erd o s distinct distances problem in the plane , Annals of Mathematics, JSTOR, 2015, pp 155--190

work page 2015

[2] [2]

The number of different distances determined by a set of points in the Euclidean plane, Discrete & Computational Geometry, vol

Chung, Fan RK and Szemer \'e di, Endre and Trotter, William T. The number of different distances determined by a set of points in the Euclidean plane, Discrete & Computational Geometry, vol. 7:1, Springer, 1992, pp 1--11

work page 1992

[3] [3]

59:2, Taylor & Francis, 1952, pp 85--91

Moser, Leo On the different distances determined by n points, The American Mathematical Monthly, vol. 59:2, Taylor & Francis, 1952, pp 85--91

work page 1952

[4] [4]

25:4, Springer, 2001, pp 629--634

Solymosi, J \'o zsef and T \'o th, Cs D Distinct distances in the plane, Discrete & Computational Geometry, vol. 25:4, Springer, 2001, pp 629--634

work page 2001

[5] [5]

Montgomery, H.L, and Vaughan, R.C, Multiplicative number theory 1:Classical

work page

[6] [6]

Robbins, Herbert, A remark on Stirling's formula, Amer. Math. Mon., vol. 62.1, 1955, pp.26--29

work page 1955

[7] [7]

71, Siam, 2000

Meyer, Carl D, Matrix analysis and applied linear algebra vol. 71, Siam, 2000

work page 2000

[8] [8]

Nathanson, M.B, Graduate Texts in Mathematics,

work page

[9] [9]

3, Springer, 2005

Roman, Steven and Axler, S and Gehring, FW, Matrix analysis and applied linear algebra, vol. 3, Springer, 2005

work page 2005

[10] [10]

R. A. DeVore, Approximation of functions,

work page