Wiki
Wiki

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): K\mathcal K is the set of planar convex bodies with the Hausdorff metric; J(K,n)J(K,n) is the set of points P∈∂KP\in\partial K for which some circle centred at PP meets ∂K\partial K in at least nn points. In a Baire space, "most points" satisfy a property when the set of points satisfying it contains a dense GδG_\delta set (p. 260).

Theorem 1.4 (printed p. 254). "For most convex bodies K∈KK\in\mathcal K, the set

⋂n∈NJ(K,n)\bigcap_{n\in\mathbb N}J(K,n)

contains most points of ∂K\partial K."

Theorem 4.1 (printed p. 260), the stronger statement proved. A circle S\mathcal S meets ∂K\partial K transversally at QQ when every neighbourhood of QQ contains points of S\mathcal S in the interior of KK and points of S\mathcal S outside KK; J0(K,n)⊂J(K,n)J_0(K,n)\subset J(K,n) is the set of P∈∂KP\in\partial K for which some circle centred at PP meets ∂K\partial K transversally in at least nn points. "For most convex bodies K∈KK\in\mathcal K, the set ⋂n∈NJ0(K,n)\bigcap_{n\in\mathbb N}J_0(K,n) contains most points of ∂K\partial K."

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 Kn,m\mathcal K_{n,m} be the bodies KK such that every P∈∂KP\in\partial K has a point of J0(K,n)J_0(K,n) within distance 1m\frac1m. Lemma 4.2 (p. 260) shows each Kn,m\mathcal K_{n,m} open and dense in K\mathcal K, density by replacing far vertices of an approximating polygon with nn vertices on a circle about a side's midpoint. The intersection over n,mn,m is then a dense GδG_\delta, and for KK in it each J0(K,n)J_0(K,n) is open and dense in ∂K\partial K. 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.