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, the random-selection construction, continued on p. 222.

Statement

Let R>2R>2, L=3RL=3R, and take the maximal 1/31/3-net PP in TLn\mathbb T_L^n from the conventions. Independently include each center in QQ with probability x=20−nx=20^{-n}. Retain

S={p∈Q:dL(p,q)>5/3 for all q∈Q∖{p}}.S=\{p\in Q: d_L(p,q)>5/3\text{ for all }q\in Q\setminus\{p\}\}.

Color all lifted closed Voronoi cells of SS red and everything else blue. This periodic coloring has no red pair at distance one. Every center has probability greater than x/2x/2 of belonging to SS.

If a nonempty Euclidean configuration of diameter at most R−1R-1 has pairwise distances at least five, then its containing-cell centers correspond to mutually independent SS-membership events. Consequently, for any fixed realizable assignment of its kk points to cells, the probability that all assigned centers lie outside SS is less than e−xk/2e^{-xk/2}.

Full proof

By Lemma 2.2, a torus ball of radius 5/35/3 contains at most 11n11^n net points. One can choose nearest lifts in that ball, which remain 1/31/3-separated. Independence of the original selections gives

Pr⁡(p∈S)≥x(1−x)11n>x/2.\Pr(p\in S)\ge x(1-x)^{11^n}>x/2.

For n≥2n\ge2, Bernoulli's inequality bounds the last power below by 1−(11/20)n≥279/400>1/21-(11/20)^n\ge279/400>1/2. For n=1n=1, the exact integer inequality 2⋅1911>20112\cdot19^{11}>20^{11} gives (19/20)11>1/2(19/20)^{11}>1/2.

Two red points in the same lifted cell are at distance at most 2/32/3. Points in different translates of the same cell have distance at least L−2/3>1L-2/3>1. For two different torus centers, red points at distance one would give center distance at most 1+2/3=5/31+2/3=5/3 in the quotient. The selection rule forbids retaining both centers. These cases also cover all cell boundaries, which were included in red.

Now take containing-cell centers pip_i for the configuration in the statement. Because each cell lies within 1/31/3 of its center,

133≤∣pi−pj∣≤R−13(i≠j).\frac{13}{3}\le |p_i-p_j|\le R-\frac13\qquad(i\ne j).

For every nonzero z∈Znz\in\mathbb Z^n,

∣pi−pj+Lz∣≥L−∣pi−pj∣≥2R+13>103.|p_i-p_j+Lz|\ge L-|p_i-p_j| \ge2R+\frac13>\frac{10}{3}.

The unshifted distance is also greater than 10/310/3. Hence their quotient distances exceed 10/310/3, and their closed radius-5/35/3 neighborhoods of Bernoulli variables are pairwise disjoint. Each event pi∈Sp_i\in S is a function only of the variables in its own neighborhood. The events are therefore mutually independent, not merely pairwise independent. Thus

Pr⁡(pi∉S for all i)<(1−x/2)k<e−xk/2.\Pr(p_i\notin S\text{ for all }i) <(1-x/2)^k<e^{-xk/2}.

Why the period is changed

The source uses period RR and infers independence from the displayed bounds on the lifted centers. Those bounds do not exclude overlap of the neighborhoods modulo RR. For example, on the one-dimensional torus of length R=106R=10^6, take P=(13Z)/RZP=(\tfrac13\mathbb Z)/R\mathbb Z. The centers 00 and R−3R-3 have large lifted distance but quotient distance three. Their radius-5/35/3 neighborhoods share the centers R−5/3R-5/3 and R−4/3R-4/3. Their retention events are positively correlated: each depends on avoiding these same selected neighbors, while neither center is itself in the other center's exclusion neighborhood.

This can occur under the theorem's hypotheses, not just for a tiny test configuration. Take K={0,1,…,R−1}K=\{0,1,\ldots,R-1\} and the maximum-cardinality five-separated subset

K′={0,5,…,999990}∪{999997}.K'=\{0,5,\ldots,999990\}\cup\{999997\}.

It has 200000200000 points and contains the two centers in question. The hypothesis holds because log⁡2(106)<20\log_2(10^6)<20 and 106>10000⋅2010^6>10000\cdot20.

The period 3R3R supplies the missing neighborhood separation. The main proof and constant-bounds page retain the original 104nlog⁡2R10^{4n}\log_2R threshold with this larger period. This is a compilation-supplied repair, not an author-issued correction or a counterexample to the theorem.

Related proof pages. definitions, lemma 2 2, constant bounds, theorem 1 2.

Bears on. Problem 188.