Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source: published paper, printed p. 221, Lemma 2.4.

Statement

A finite 11-separated K⊂RnK\subset\mathbb R^n has, for every s≥1s\ge1, an ss-separated subset K′K' with

∣K′∣≥∣K∣/(2s+1)n.|K'|\ge |K|/(2s+1)^n.

Full proof

Choose a remaining point, put it in K′K', and remove all remaining points at distance at most ss from it. By Lemma 2.2, each step removes at most (2s+1)n(2s+1)^n points, including the chosen point. Repeat until none remain. Distinct chosen points have distance greater than ss, and hence at least ss. The number of steps is at least ∣K∣/(2s+1)n|K|/(2s+1)^n.

In particular s=5s=5 gives a 55-separated subset with ∣K′∣≥11−n∣K∣|K'|\ge11^{-n}|K|, as needed in the main theorem.

Related proof pages. lemma 2 2.

Bears on. Problem 188.