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. 223, the final estimates in the proof of Theorem 1.2.

Statement

Suppose K⊂RnK\subset\mathbb R^n is 11-separated, has diameter at most R−1R-1, where R>2R>2, and

∣K∣≥10000nlog⁡2R.|K|\ge10000^n\log_2R.

Put t=log⁡2Rt=\log_2R, x=20−nx=20^{-n}, and let q≥(10000/11)ntq\ge(10000/11)^n t. Then

xq4>2n2ln⁡(50q),xq4>2n3ln⁡(180n R).(1)\frac{xq}{4}>2n^2\ln(50q),\qquad \frac{xq}{4}>2n^3\ln(180\sqrt n\,R). \tag{1}

The factor 180180, in place of the source's 6060, accounts for period 3R3R. The non-strict cardinality hypothesis is sufficient.

Full proof

A ball of radius R−1R-1 centered at any point of KK contains KK. Lemma 2.2 gives ∣K∣≤(2R−1)n|K|\le(2R-1)^n. Since log⁡2R>1\log_2R>1, the hypothesis implies (2R−1)n>10000n(2R-1)^n>10000^n. In particular R>5000.5R>5000.5 and t>3t>3.

Write A=10000/11A=10000/11, B=500/11>45B=500/11>45, and q0=Antq_0=A^nt. We first note

Bn>40n4(n≥1).(2)B^n>40n^4\qquad(n\ge1). \tag{2}

This holds at n=1n=1; its induction step follows from ((n+1)/n)4≤16<B((n+1)/n)^4\le16<B.

Use ln⁡50<4\ln50<4, ln⁡A<7\ln A<7 and ln⁡t≤t−1\ln t\le t-1. Since t>3t>3,

ln⁡(50q0)t<4+7n3+1=7+7n3≤14n3.\frac{\ln(50q_0)}{t} <\frac{4+7n}{3}+1 =\frac{7+7n}{3}\le\frac{14n}{3}.

On the other hand xq0/t=Bnxq_0/t=B^n. By (2),

Bn>40n4>1123n3>8n2ln⁡(50q0)t.B^n>40n^4>\frac{112}{3}n^3 >8n^2\frac{\ln(50q_0)}{t}.

The function u/ln⁡(50u)u/\ln(50u) increases for u≥q0>1u\ge q_0>1, because its derivative has the sign of ln⁡(50u)−1\ln(50u)-1. Therefore the first inequality in (1), proved at q0q_0, holds for every q≥q0q\ge q_0.

For the second inequality, ln⁡180<6\ln180<6, ln⁡n≤n−1\ln n\le n-1, ln⁡2<1\ln2<1 and t>3t>3 give

ln⁡(180n R)t<6+(n−1)/23+1=n+176≤3n.\frac{\ln(180\sqrt n\,R)}{t} <\frac{6+(n-1)/2}{3}+1 =\frac{n+17}{6}\le3n.

Thus 2n3ln⁡(180nR)<6n4t2n^3\ln(180\sqrt n R)<6n^4t, whereas xq/4≥Bnt/4>10n4txq/4\ge B^nt/4>10n^4t by (2). This proves (1).

The elementary logarithm bounds follow, for example, from the power series for ee and ln⁡u≤u−1\ln u\le u-1; no floating-point approximation or finite search is used. Feasibility of the packing hypothesis supplies t>3t>3 uniformly, including dimension one.

Related proof pages. lemma 2 2.

Bears on. Problem 188.