Checkerboards, Lipschitz functions and uniform rectifiability.
In his recent lecture at the International Congress [S], Stephen Semmes stated the following conjecture for which we provide a proof.Theorem. Suppose Ω is a bounded open set in Rn with n > 2, and suppose that B(0,1) ⊂ Ω, Hn-1(∂Ω) = M < ∞ (depending on n and M) and a Lipschitz graph Γ (with constant L) such that Hn-1(Γ ∩ ∂Ω) ≥ ε.Here Hk denotes k-dimensional Hausdorff measure and B(0,1) the unit ball in Rn. By iterating our proof we obtain a slightly stronger result which allows us...