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⊂Rn is 1-separated, has diameter at most
R−1, where R>2, and
∣K∣≥10000nlog2R.
Put t=log2R, x=20−n, and let
q≥(10000/11)nt. Then
4xq>2n2ln(50q),4xq>2n3ln(180nR).(1)
The factor 180, in place of the source's 60, accounts for period
3R. The non-strict cardinality hypothesis is sufficient.
Full proof
A ball of radius R−1 centered at any point of K contains K.
Lemma 2.2 gives ∣K∣≤(2R−1)n. Since log2R>1, the hypothesis
implies (2R−1)n>10000n. In particular R>5000.5 and t>3.
Write A=10000/11, B=500/11>45, and q0=Ant. We first note
Bn>40n4(n≥1).(2)
This holds at n=1; its induction step follows from
((n+1)/n)4≤16<B.
Use ln50<4, lnA<7 and lnt≤t−1. Since t>3,
tln(50q0)<34+7n+1=37+7n≤314n.
On the other hand xq0/t=Bn. By (2),
Bn>40n4>3112n3>8n2tln(50q0).
The function u/ln(50u) increases for u≥q0>1, because its
derivative has the sign of ln(50u)−1. Therefore the first inequality
in (1), proved at q0, holds for every q≥q0.
For the second inequality, ln180<6, lnn≤n−1, ln2<1
and t>3 give
tln(180nR)<36+(n−1)/2+1=6n+17≤3n.
Thus 2n3ln(180nR)<6n4t, whereas
xq/4≥Bnt/4>10n4t by (2). This proves (1).
The elementary logarithm bounds follow, for example, from the power series
for e and lnu≤u−1; no floating-point approximation or finite
search is used. Feasibility of the packing hypothesis supplies t>3
uniformly, including dimension one.