Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (printed pp. 254 and 260): is the set of planar convex bodies with the Hausdorff metric; is the set of points for which some circle centred at meets in at least points. In a Baire space, "most points" satisfy a property when the set of points satisfying it contains a dense set (p. 260).
Theorem 1.4 (printed p. 254). "For most convex bodies , the set
contains most points of ."
Theorem 4.1 (printed p. 260), the stronger statement proved. A circle meets transversally at when every neighbourhood of contains points of in the interior of and points of outside ; is the set of for which some circle centred at meets transversally in at least points. "For most convex bodies , the set contains most points of ."
Source. I. Bárány and E. Roldán-Pensado, A question from a famous paper of Erdős, Discrete Comput. Geom. 50 (2013), 253--261, doi:10.1007/s00454-013-9507-z; Theorem 1.4 on printed p. 254, the definitions and Theorem 4.1 on p. 260. The edition read is identified on the source card. The acknowledgments (p. 261) credit Rolf Schneider with suggesting the theorem and with a different proof.
Read depth. Claims checked: both theorems and the definitions were read clause by clause on the page images. The proof (pp. 260--261) was read for structure only, and nothing here is independently reviewed.
Proof pointer
§ 4, pp. 260--261. Let be the bodies such that every has a point of within distance . Lemma 4.2 (p. 260) shows each open and dense in , density by replacing far vertices of an approximating polygon with vertices on a circle about a side's midpoint. The intersection over is then a dense , and for in it each is open and dense in . Not checked here.
Dependencies
Lemma 4.2 of the paper; the Baire category theorem, cited to Schechter, Handbook of Analysis and Its Foundations (1997), Chap. 20.
Bears on
- Problem 982: the theorem concerns the circles centred at points of a convex curve in Erdős's 1946 convex-curve statement, the strongest of the conjectures his paper poses on p. 248; it says nothing about distinct distances from a vertex of a convex polygon and leaves the problem's statement undecided.