Combinatorial proofs of two theorems of Lutz and Stull
share
The purpose of this note is to give combinatorial-geometric proofs for two Marstrand-type projection theorems for arbitrary, possibly non-analytic, sets, originally due to Lutz and Stull. The original proofs were based on algorithmic information theory, and the notion of pointwise dimension. In this note, the proofs instead rely on δ-discretised variants of a standard "potential theoretic" argument, and the pigeonhole principle.
READ FULL TEXT
