Continuum Beck-Type Theorem for Hyperplanes

• The paper introduces a continuum extension of Beck’s theorem that replaces point counts with Hausdorff dimension, accurately capturing hyperplane incidence richness in fractal settings.
• The methodology employs Frostman measures, thin k-planes, and an inductive irreducible decomposition to establish sharp lower bounds on the dimensions of hyperplane sets.
• Implications span incidence combinatorics, projection theory, and mass partition problems, linking fractal geometry with modern techniques in algebraic topology.

The Continuum Beck-Type Theorem for Hyperplanes provides a sharp quantitative extension of the classical Beck theorem into the field of high-dimensional and measure-theoretic settings, capturing incidence richness in fractal and continuum configurations. While Beck’s original result dichotomized finite planar point sets according to collinearity or incidence, the continuum versions address Borel sets in $\mathbb{R}^n$ and replace cardinality by Hausdorff dimension, revealing when a set’s configuration enforces dimensional or algebraic complexity in the family of spanned hyperplanes.

1. Classical Background and Motivation

Beck’s discrete theorem (Do, 2016) asserts: Given $n$ points in the plane with no large collinear subset (specifically, if at most $n-x$ points are collinear), at least $c x n$ distinct lines are defined, for some positive constant $c$. The motivation for a continuum generalization is to develop analogues using Hausdorff dimension rather than point counts, so that results remain meaningful for fractal and measure-theoretic sets in $\mathbb{R}^n$. This addresses not only classical point-line incidence questions, but also projection and dimension estimates relevant to fractal geometry, Falconer problems, and incidence combinatorics.

2. Main Theorem: Dimension Lower Bounds for Hyperplane Sets

The central continuum Beck-type theorem for hyperplanes (Bright et al., 13 Oct 2025, Orponen et al., 2022, Bright et al., 2024) is:

Given a Borel set $X \subset \mathbb{R}^n$ which is non-concentrated (i.e., does not cluster on lower-dimensional flats), the set of hyperplanes spanned by $n$-tuples from $X$ has large Hausdorff dimension:

$\dim \mathcal{P}^{n-1}(X) \geq n \min\{\dim X, 1\}$

This is sharp when $n$0. The term "non-concentrated" (NC, Editor's term) is formalized by assuming $n$1 carries a Frostman measure $n$2 with $n$3 for proper affine subspaces $n$4 and uniform $n$5, suppressing measure concentration on flats.

The core extension over earlier discrete results is the replacement of line count with Hausdorff dimension, addressing situations where $n$6 may be fractal and traditional combinatorial techniques are inapplicable.

3. Key Technical Concepts: Thin k-Planes and Inductive Framework

Thin $n$7-Planes

The notion of a thin $n$8-plane is introduced to quantify the minimal mass that $n$9 may allocate to tubular neighborhoods of affine $n-x$0-planes:

Given probability measures $n-x$1 supported respectively on $n-x$2, we say they span $n-x$3-thin $n-x$4-planes if there exists a Borel graph $n-x$5 with $n-x$6 and for $n-x$7 the affine plane $n-x$8 satisfies

$n-x$9

This generalizes "thin tubes" from projection theory (Orponen et al., 2022, Bright et al., 2024, Bright et al., 13 Oct 2025).

Inductive Construction and Irreducible Measures

The proof proceeds by decomposing Frostman measures on $c x n$0 into irreducible pieces supported on flats $c x n$1 but not on any proper subflat, and iteratively patching thin $c x n$2-planes into thin $c x n$3-planes. In particular, projection-theoretic results of Orponen–Shmerkin–Wang and Ren (Orponen et al., 2022, Bright et al., 2024, Bright et al., 13 Oct 2025) establish dimension estimates for thin tubes (the $c x n$4 case):

$c x n$5

for typical tubes $c x n$6 about lines, bootstrapped via robust combinatorial and analytic techniques to higher-dimensional statements for hyperplanes.

By arranging irreducible pieces in stable position (uniform transversality), the pushforward measure (mapping $c x n$7 to the hyperplane $c x n$8) inherits a Frostman exponent at least $c x n$9, yielding

$c$0

4. Extensions: Trapping Number and Dichotomy

A refined analysis, as in (Bright et al., 2024), introduces the trapping number $c$1, measuring the lowest dimension $c$2 such that $c$3 loses mass by removal of any $c$4-dimensional affine subspace:

$c$5

Depending on how $c$6 interacts with hyperplanes, two regimes emerge:

• If for every $c$7-plane $c$8, $c$9 then

$\mathbb{R}^n$0

• If there exists $\mathbb{R}^n$1-plane $\mathbb{R}^n$2 such that $\mathbb{R}^n$3 and $\mathbb{R}^n$4, then

$\mathbb{R}^n$5

A strengthened lower bound incorporates $\mathbb{R}^n$6: $\mathbb{R}^n$7

5. Connections to Incidence Theory, Classical Extensions, and Mass Partition

The continuum Beck-type theorem for hyperplanes (Do, 2016, Bright et al., 13 Oct 2025) provides a combinatorial richness criterion in high-dimensional, measure-theoretic settings. Unless $\mathbb{R}^n$8 degenerately clusters in a union of lower-dimensional flats, the set of spanned hyperplanes is as large as permitted by dimension, up to constants.

This has direct implications for point–hyperplane incidence bounds (e.g., Elekes–Tóth type estimates), covering problems, and mass partition theorems. For instance, generalized ham sandwich results (Frick et al., 2022, Crabb, 2024, Hubard et al., 2024, Sadovek et al., 2024) assert that $\mathbb{R}^n$9 measures in $X \subset \mathbb{R}^n$0 can be bisected by $X \subset \mathbb{R}^n$1 parallel hyperplanes under parity conditions derived from Stirling numbers and Fadell–Husseini index computations. These statements leverage combinatorial and algebraic topology to guarantee partitioning richness analogous to continuum Beck-type theorems.

6. Related Structure Theory and Classification

The classification of hyperplane arrangements (Kumar, 2017) using normal systems and convex positive bijections offers a paradigm to formalize equivalence and incidence complexity in continuum settings. Such machinery, while not central to the Beck dichotomy, allows for finer control over hyperplane families and their geometric combinatorial invariants—potentially informing algorithms for point covering and equipartition tasks where arrangement equivalence matters.

7. Summary and Modern Outlook

The continuum Beck-type theorem for hyperplanes establishes that in $X \subset \mathbb{R}^n$2, a non-concentrated set $X \subset \mathbb{R}^n$3 with positive dimension forces the set of hyperplanes determined by $X \subset \mathbb{R}^n$4-tuples from $X \subset \mathbb{R}^n$5 to have dimension at least $X \subset \mathbb{R}^n$6 (Bright et al., 13 Oct 2025). This result is underpinned by delicate projection-theoretic arguments, irreducibility analysis, and an inductive framework connecting thin tubes and thin planes under stable position conditions. Extensions incorporating the trapping number and refined lower bounds capture more subtle geometric degeneracy. Applications range across geometric measure theory, combinatorial incidence theory, topological mass partition, and equipartition problems, revealing deep links between discrete combinatorics, fractal dimension, and algebraic topology in modern incidence geometry.