Iterating the Big--Pieces operator and larger sets
Abstract
We show that if an Ahlfors-David regular set E of dimension k has Big Pieces of Big Pieces of Lipschitz Graphs (denoted usually by BP(BP(LG))), then E⊂ E where E is Ahlfors-David regular of dimension k and has Big Pieces of Lipschitz Graphs (denoted usually by BP(LG). Our results are quantitative and, in fact, are proven in the setting of a metric space for any family of Ahlfors-David regular sets F replacing LG. A simple corollary is the stability of the BP operator after 2 iterations. This was previously only known in the Euclidean setting for the case F= LG with substantially more complicated proofs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.