Wiki
Wiki

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

Updated


Statement

Suppose the plane has no red unit-distance pair and no blue ℓ5\ell_5. If a unit triangular lattice LL contains no red T3T_3, its coloring, up to translation and rotation by a multiple of 60∘60^\circ, has

(a,b) red⟺2a+b≡0(mod5).(1)(a,b)\text{ red}\quad\Longleftrightarrow\quad2a+b\equiv0\pmod5. \tag{1}

All other lattice points are blue. In particular, both primitive unit directions are color periods after multiplication by 55.

Obtaining the first red pair

Use the triangular coordinates and forcing rules. The lattice contains a red point AA, since otherwise any five consecutive points along a unit lattice direction would be blue. Translate AA to (0,0)(0,0). The three lattice points (−1,2),(2,−1),(−1,−1)(-1,2),(2,-1),(-1,-1) form a side-33 equilateral triangle with center AA. By Lemma 2, at least one is red. A rotation by a multiple of 60∘60^\circ lets us take that red point to be B=(−1,2)B=(-1,2).

The local pair rule: Figure 10

The following coordinates specify the entire forcing step:

PointCoordinatesReason for its color when immediate
DD(−2,1)(-2,1)Blue: A,B,DA,B,D would be a red T3T_3
GG(1,1)(1,1)Blue: A,B,GA,B,G would be a red T3T_3
E,FE,F(−1,1),(0,1)(-1,1),(0,1)Blue unit neighbors of BB
H,IH,I(−1,3),(0,2)(-1,3),(0,2)Blue unit neighbors of BB
J,KJ,K(−2,2),(−2,3)(-2,2),(-2,3)Blue unit neighbors of BB
B′B'(2,1)(2,1)Forced red below
NN(2,0)(2,0)Blue once B′B' is red
CC(−2,4)(-2,4)Forced red below
A′A'(3,−1)(3,-1)Forced red below

The progression D,E,F,G,B′D,E,F,G,B' has unit step (1,0)(1,0), so B′B' is red. Then its unit neighbor NN is blue. The progression C,H,I,G,NC,H,I,G,N has unit step (1,−1)(1,-1), forcing CC red, and A′,N,G,I,HA',N,G,I,H has unit step (−1,1)(-1,1), forcing A′A' red.

Put w=(−1,2)w=(-1,2) and s=(3,−1)s=(3,-1) in this proof. We have established the following rule: if PP and P+wP+w are red, then

P+2w,P+s,P+s+ware red.(2)P+2w,\qquad P+s,\qquad P+s+w \quad\text{are red}. \tag{2}

The rule holds at every translate of the diagram. Applying its half-turned version to P,P−wP,P-w gives the corresponding rule with w,sw,s replaced by −w,−s-w,-s. These operations preserve the hypotheses, including the absence of a red T3T_3 anywhere in LL.

From the pair rule to all parallel lines

Starting with 0,w0,w, rule (2) repeatedly extends the red line to 2w,3w,…2w,3w,\ldots. Applying the reversed rule to w,0w,0 gives −w-w, and repetition gives all negative multiples too. Thus Zw\mathbb Zw is red. Since w=(−1,2)w=(-1,2) has coprime coordinates, these are exactly the lattice points on that line.

Rule (2) at 0,w0,w gives the pair s,s+ws,s+w, which similarly extends to the entire line s+Zws+\mathbb Zw. The reversed rule applied to w,0w,0 gives w−sw-s and −s-s, so −s+Zw-s+\mathbb Zw is red as well. Apply the same two operations on a red line ms+Zwms+\mathbb Zw: they produce the lines (m+1)s+Zw(m+1)s+\mathbb Zw and (m−1)s+Zw(m-1)s+\mathbb Zw. Induction proves that every point of

H=Zw+ZsH=\mathbb Zw+\mathbb Zs

is red. This explicitly supplies both directions of the line propagation implicit in Figure 9.

The subgroup HH consists exactly of the integer pairs in (1). Indeed, 2a+b2a+b vanishes modulo 55 on both generators. Conversely, if 2a+b≡0(mod5)2a+b\equiv0\pmod5, then

(a,b)=a+3b5 w+2a+b5 s,(a,b)=\frac{a+3b}{5}\,w+\frac{2a+b}{5}\,s,

and both coefficients are integers. To determine every remaining color, observe that the homomorphism (a,b)↦2a+b(mod5)(a,b)\mapsto2a+b\pmod5 takes the unit directions v,u,−u,−vv,u,-u,-v to 1,2,3,41,2,3,4, respectively. For any point outside HH, subtract the unit direction with its nonzero residue. The result is a red point of HH, forcing the original point blue. This proves (1) and its periods.

Source and dependencies

Lemma 7, Figures 9–10, published pp. 7–8; Lemma 2.6 in arXiv v2. The source's reference to three points at distance 3\sqrt3 from a lattice point is made precise by selecting three alternating points from its six such neighbors. The finite progressions, backward propagation, parallel-line induction and remaining residue classes are all explicit above. No external theorem is used beyond elementary lattice arithmetic and Lemma 2.

Bears on. #188.