Distinct Volume Subsets via Indiscernibles
Abstract
Erd\"os proved that for every infinite X ⊂eq Rd there is Y ⊂eq X with |Y|=|X|, such that all pairs of points from Y have distinct distances, and he gave partial results for general a-ary volume. In this paper, we search for the strongest possible canonization results for a-ary volume, making use of general model-theoretic machinery. The main difficulty is for singular cardinals; to handle this case we prove the following. Suppose T is a stable theory, is a finite set of formulas of T, M T, and X is an infinite subset of M. Then there is Y ⊂eq X with |Y| = |X| and an equivalence relation E on Y with infinitely many classes, each class infinite, such that Y is (, E)-indiscernible. We also consider the definable version of these problems, for example we assume X ⊂eq Rd is perfect (in the topological sense) and we find some perfect Y ⊂eq X with all distances distinct. Finally we show that Erd\"os's theorem requires some use of the axiom of choice.
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.