English

A Continuum Erd\H{o}s-Beck Theorem

Classical Analysis and ODEs 2024-06-17 v1 Combinatorics Metric Geometry

Abstract

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let XRnX\subset \mathbb{R}^n Borel and k[0,n1]k \in [0, n-1] be an integer. Let dim(XH)=dimX\dim (X \setminus H) = \dim X for every kk-dimensional hyperplane HA(n,k)H \in \mathcal{A}(n,k), and let L(X)\mathcal L(X) be the set of lines that contain at least two distinct points of XX. Then, a recent result of Ren shows dimL(X)min{2dimX,2k}. \dim \mathcal{L}(X) \geq \min \{2 \dim X, 2k\}. If we instead have that XX is not a subset of any kk-plane, and 0<infHA(n,k)dim(XH)=t<dimX, 0<\inf_{H \in \mathcal{A}(n,k)} \dim (X \setminus H) = t < \dim X, we instead obtain the bound dimL(X)dimX+t. \dim \mathcal{L}(X) \geq \dim X + t. We then strengthen this lower bound by introducing the notion of the "trapping number" of a set, T(X)T(X), and obtain dimL(X)max{dimX+t,min{2dimX,2(T(X)1)}}, \dim \mathcal L(X) \geq \max\{\dim X + t, \min\{2\dim X, 2(T(X)-1)\}\}, as consequence of our main result and of Ren's result in Rn\mathbb{R}^n. Finally, we introduce a conjectured equality for the dimension of the line set L(X)\mathcal{L}(X), which would in particular imply our results if proven to be true.

Keywords

Cite

@article{arxiv.2406.10058,
  title  = {A Continuum Erd\H{o}s-Beck Theorem},
  author = {Paige Bright and Caleb Marshall},
  journal= {arXiv preprint arXiv:2406.10058},
  year   = {2024}
}

Comments

15 pages, 3 figures

R2 v1 2026-06-28T17:06:03.695Z