Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
The conjecture refuted (p. 1). The paper quotes Larman and Rogers's Conjecture 1 (Mathematika 19 (1972), 1--24) as: "Suppose that the distance 1 is not realized in a closed subset of a spherical ball of radius 1. Then the Lebesgue measure of is less than times the Lebesgue measure of ." An open ball of radius realizes no distance , so the bound would be tight.
The construction (p. 1). Let and . Put
so is the intersection of the open ball of radius about , the open unit ball about the origin and the open halfspace . Then is a measurable subset of the unit ball containing no two points at distance , and for every
The abstract states the result in this form, for each . Since the conjecture asks for a closed set, the paper's footnote 1 (p. 1) takes closed inner approximations of ; a closed subset of of volume close enough to still exceeds and is then a counterexample in every dimension .
Volumes (pp. 1--2). With the volume of , the paper writes (p. 1)
and reports and , against and . On p. 2 it records the asymptotic relation, displayed as (1),
and states that a suitable choice of the constant in the concentration inequality below gives for all , the remaining cases being checked directly. The paper does not print the computations for .
Choice of (Figure 1, p. 2). The caption says that makes equidistant from the hyperplane and from the hyperplane containing the intersection of the spheres and , and that this choice maximizes the volume of . (That hyperplane is , the breakpoint of the two integrals above.)
Source. F. M. de Oliveira Filho and F. Vallentin, A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1, Mathematika 65 (2019), 785--787; arXiv:1808.07299. Pages are those of the arXiv version 2 (11 March 2019) identified on the source card: the conjecture, the construction, the volume formula and the values for on p. 1; Figure 1, relation (1) and the range on p. 2.
Read depth. Claims checked: the quoted conjecture, the definition of and , the volume formula, the two numerical ratios, relation (1) and the range were read clause by clause on the printed pages. The direct checks for the dimensions below are not printed and were not checked; nothing here is independently reviewed.
Proof pointer
The paper calls the avoidance property easy to see. In the corpus's words: two points of lie in one open ball of radius , so their distance is below ; a point of and a point of satisfy and , so . The same holds inside by symmetry.
For the volume bound with the paper keeps only the first integral, the part of cut from the small ball by the slab , and uses the concentration of the volume of a ball near its equator, citing Theorem 2.7 of Blum, Hopcroft and Kannan, Foundations of Data Science: if and , the fraction of lying in the slab is at least . Applied to the ball of radius about , almost all of its volume lies in a slab about that shrinks with and so eventually sits inside ; each of and then has volume , which is (1). The paper states the consequence without printing these steps.
Dependencies
The concentration inequality for the ball quoted above, cited by the paper from Blum, Hopcroft and Kannan (Theorem 2.7); nothing else.
Bears on
- Problem 1070: indirect, through , the supremum of the upper densities of measurable planar sets avoiding distance , which the problem page uses. The paper (p. 2) recalls L. Moser's conjecture, popularized by Erdős and which it calls still open, that every measurable planar set with no two points at distance has upper density less than , upper density being defined in its footnote 3 as the supremum over of the limsup, as , of . It notes that Larman and Rogers's conjecture would have given only the bound at most , so it would not have implied Moser's even if true. The construction refutes the local conjecture for the unit disk (, ratio ), so that route to fails; it gives no bound on or on the problem's and settles nothing in Problem 1070. Moser's conjecture has since been proved by Ambrus, Csiszárik, Matolcsi, Varga and Zsámboki (), as the problem page records.