Wiki
Wiki

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

Updated

Lemma 2 — lattice averaging for unit pairs


Statement

Let d≥1d\geq1, let Λ\Lambda be a full-rank lattice in R2d\mathbb R^{2d}, and let ∥⋅∥\|\cdot\| be any norm on that space. Suppose π:Λ→R2\pi:\Lambda\to\mathbb R^2 is an injective group homomorphism, and write ∣⋅∣|\cdot| for the Euclidean norm on R2\mathbb R^2. Set

ρ=min⁡{∥v∥:v∈Λ∖{0}}\rho=\min\{\|v\|:v\in\Lambda\setminus\{0\}\}

and

M=#{v∈Λ:∥v∥≤1, ∣π(v)∣=1}.M=\#\{v\in\Lambda:\|v\|\leq1,\ |\pi(v)|=1\}.

For every real R>1R>1 there is a finite nonempty U⊂R2U\subset\mathbb R^2 such that

∣U∣≤(2Rρ+1)2d(1)|U|\leq\left(\frac{2R}{\rho}+1\right)^{2d} \tag{1}

and, for the ordered unit-pair count

Dord(U)=#{(u1,u2)∈U2:∣u1−u2∣=1},D_{\mathrm{ord}}(U) =\#\{(u_1,u_2)\in U^2:|u_1-u_2|=1\},

one has

Dord(U)∣U∣≥(1−1R)2dM.(2)\frac{D_{\mathrm{ord}}(U)}{|U|} \geq\left(1-\frac1R\right)^{2d}M. \tag{2}

Proof

For w∈R2dw\in\mathbb R^{2d} and r>0r>0, let

B(r,w)={x∈R2d:∥x−w∥≤r}.B(r,w)=\{x\in\mathbb R^{2d}:\|x-w\|\leq r\}.

We will take

U=π(B(R,w)∩Λ)U=\pi(B(R,w)\cap\Lambda)

for a suitable center ww. Injectivity of π\pi makes its cardinality equal to #(B(R,w)∩Λ)\#(B(R,w)\cap\Lambda).

The open norm-balls of radius ρ/2\rho/2 about the lattice points in B(R,w)B(R,w) are pairwise disjoint. All lie in B(R+ρ/2,w)B(R+\rho/2,w). Since volume in 2d2d dimensions scales by the 2d2d-th power of the radius,

#(B(R,w)∩Λ)≤(R+ρ/2ρ/2)2d=(2Rρ+1)2d,\#(B(R,w)\cap\Lambda) \leq\left(\frac{R+\rho/2}{\rho/2}\right)^{2d} =\left(\frac{2R}{\rho}+1\right)^{2d},

which proves (1).

Now fix v1∈B(R−1,w)∩Λv_1\in B(R-1,w)\cap\Lambda. For every vector vv counted by MM, the point v2=v1+vv_2=v_1+v lies in B(R,w)∩ΛB(R,w)\cap\Lambda by the triangle inequality, and

∣π(v2)−π(v1)∣=∣π(v)∣=1.|\pi(v_2)-\pi(v_1)|=|\pi(v)|=1.

Distinct choices give distinct ordered pairs after projection. Therefore

Dord(U)∣U∣≥#(B(R−1,w)∩Λ)#(B(R,w)∩Λ)M.(3)\frac{D_{\mathrm{ord}}(U)}{|U|} \geq \frac{\#(B(R-1,w)\cap\Lambda)} {\#(B(R,w)\cap\Lambda)}M. \tag{3}

It remains to choose ww. Choose it uniformly in a fundamental domain of Λ\Lambda. Unfolding the translates of that domain shows that, for every r>0r>0,

Ew#(B(r,w)∩Λ)=vol⁡(B(r,0))covol⁡(Λ)=r2dvol⁡(B(1,0))covol⁡(Λ).(4)\mathbb E_w\#(B(r,w)\cap\Lambda) =\frac{\operatorname{vol}(B(r,0))} {\operatorname{covol}(\Lambda)} =\frac{r^{2d}\operatorname{vol}(B(1,0))} {\operatorname{covol}(\Lambda)}. \tag{4}

Consequently the expectation of

#(B(R−1,w)∩Λ)−(1−1R)2d#(B(R,w)∩Λ)\#(B(R-1,w)\cap\Lambda) -\left(1-\frac1R\right)^{2d} \#(B(R,w)\cap\Lambda)

is zero. Put N(w)=#(B(R,w)∩Λ)N(w)=\#(B(R,w)\cap\Lambda). Equation (4) gives EN(w)>0\mathbb E N(w)>0, so N(w)>0N(w)>0 on a set of positive measure. When N(w)=0N(w)=0, the inner count and the displayed difference are also zero. If that difference were negative at every center with N(w)>0N(w)>0, its expectation would be strictly negative, a contradiction. Thus some center has both N(w)>0N(w)>0 and nonnegative difference. For that center UU is nonempty, and (3) gives (2), completing the proof.

Source scope

This is Lemma 2 on physical pp. 3--4 of the arXiv v1 manuscript. The notation DordD_{\mathrm{ord}} makes explicit that the source construction counts oriented pairs.

Used by. Lemma 5.

Bears on. Problem 90.