math.CA — Classical Analysis and ODEs
Erdős's 1974 distance-product volume problem resolved: the ball as unique maximizer, sharp inradius stability, and other miscellanea
We consider the set of all points of ℝ^d whose distances to n given points have product at most one. Erdős (1974) asks how large its volume can be. We show that in every dimension d ≥ 3, and for every integer n ≥ 1, this volume is at most that of the unit ball. Equality holds only and exactly when all n given points coincide. This completely answers Erdős's question; in the plane, the same statement is Pólya's theorem of 1928. In fact we settle a more general problem, with weighted points. Our theorem also shows that the two-point counterexample in dimension three, reported by Erdős in 1976 and repeated in 2018 and 2026, cannot exist. We also prove a sharp stability estimate: for each fixed d ≥ 3, if such a set falls short of the maximal volume by a small fraction D, it still contains a ball of radius at least 1 − (1/(d − 2) + o(1))D as D tends to zero, uniformly in the number, weights and positions of the points. The same holds for every compactly supported probability measure in place of the points. Two equally weighted points approaching each other show that the coefficient 1/(d − 2) cannot be lowered. Finally, the product of the distances is at most one exactly when their geometric mean is at most one, and we ask what happens when the geometric mean is replaced by the weighted power mean of order p. We show that the same volume bound holds for all placements exactly when p ≥ 2 − d, and that in this range equality again requires coincident points. For p ≥ 2 − d we deduce the bound from the weak estimate of Tang and Wang; for p < 2 − d the polarization theorem of Erdélyi and Saff gives placements that violate it. We prove the equality statement at the endpoint p = 2 − d directly, and for p < 2 − d we compute the leading term of the excess volume of the region of two nearby points.