Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 2 of Jafar Shaffaf, A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture, Discrete Comput. Geom. 60 (2018), no. 2, 283-293, states that, assuming the Bombieri-Lang conjecture, there is no dense rational distance subset of the plane, which would answer Problem 212 no. The tool is Theorem 1: for an even number of points in the plane, not all on a line, the distance surface
projectivized in , is a surface of general type. For Theorem 2 the paper takes a dense rational distance set containing and , whose points then have the form with rational and a squarefree integer (Lemma 2), chooses six points of in general position, and considers their distance surface over . By Theorem 1, is of general type, so the Bombieri-Lang conjecture forbids a Zariski-dense set of -rational points on it; but is Zariski dense in the plane and is birationally a double cover of , so lifts to a Zariski-dense set of -points of , a contradiction. Corollary 1 draws from the same argument, with the Solymosi-de Zeeuw theorem that lines and circles are the only irreducible plane algebraic curves carrying an infinite rational distance set, that a rational distance set with infinitely many points not all on a line has all but at most four of its points on a line or all but at most three on a circle. The library card shaffaf_2018_solution_erdos_ulam_problem_rational_distance records Theorems 1 and 2 and Corollary 1. Terence Tao's blog post of 20 December 2014 derives the same conditional answer independently (its page); the post mentions an unpublished result of Shaffaf, and the preprint of this paper was posted to arXiv eleven days later.
Hypothesis. The paper states the hypothesis as the Weak Lang conjecture: for a projective variety of general type defined over a number field , the set of -rational points is not Zariski dense. Theorem 2 uses it for one surface over the field . The conjecture is unproven, so the claim is conditional and derives no standing for the problem by itself; the paper presents the result as a witness to the strength of the Bombieri-Lang conjecture rather than a proof of the Erdős-Ulam conjecture.
Acceptance. Refereed: Discrete & Computational Geometry, volume 60, issue 2
(September 2018), pp. 283-293, published online 4 May 2018; the preprint is
arXiv:1501.00159, first posted 31 December 2014. The site labels the problem
OPEN, so the curator's remark that Shaffaf obtained the conditional answer is
commentary on an open problem and not acceptance, and no reviewed evidence is
listed. The proof is not checked here.
Depends on. Nothing in this wiki.