Quantitative Besicovitch projection theorem for irregular sets of directions
Damian D\k{a}browski

TL;DR
This paper establishes a quantitative version of the Besicovitch projection theorem for AD-regular sets, showing that large measure sets of directions with bounded projections imply the set is mostly contained in a Lipschitz graph, even when the directions are merely measurable.
Contribution
It extends previous results by allowing the set of good directions to be merely measurable and large in measure, not necessarily an arc, providing a broader applicability.
Findings
A large measure set of directions with bounded projections implies the set is mostly Lipschitz graph.
The result generalizes classical theorems by relaxing the regularity condition on the set of directions.
Provides new insights into the structure of AD-regular sets with respect to their projections.
Abstract
The classical Besicovitch projection theorem states that if a planar set with finite length is purely unrectifiable, then almost all orthogonal projections of have zero length. We prove a quantitative version of this result: if is AD-regular and there exists a set of direction with such that for every we have , then a big piece of can be covered by a Lipschitz graph with . The main novelty of our result is that the set of good directions is assumed to be merely measurable and large in measure, while previous results of this kind required to be an arc. As a corollary, we obtain a result on AD-regular sets which avoid a large set of directions, in the sense that the set of directions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Point processes and geometric inequalities
