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 . If a unit triangular lattice contains no red , its coloring, up to translation and rotation by a multiple of , has
All other lattice points are blue. In particular, both primitive unit directions are color periods after multiplication by .
Obtaining the first red pair
Use the triangular coordinates and forcing rules. The lattice contains a red point , since otherwise any five consecutive points along a unit lattice direction would be blue. Translate to . The three lattice points form a side- equilateral triangle with center . By Lemma 2, at least one is red. A rotation by a multiple of lets us take that red point to be .
The local pair rule: Figure 10
The following coordinates specify the entire forcing step:
| Point | Coordinates | Reason for its color when immediate |
|---|---|---|
| Blue: would be a red | ||
| Blue: would be a red | ||
| Blue unit neighbors of | ||
| Blue unit neighbors of | ||
| Blue unit neighbors of | ||
| Forced red below | ||
| Blue once is red | ||
| Forced red below | ||
| Forced red below |
The progression has unit step , so is red. Then its unit neighbor is blue. The progression has unit step , forcing red, and has unit step , forcing red.
Put and in this proof. We have established the following rule: if and are red, then
The rule holds at every translate of the diagram. Applying its half-turned version to gives the corresponding rule with replaced by . These operations preserve the hypotheses, including the absence of a red anywhere in .
From the pair rule to all parallel lines
Starting with , rule (2) repeatedly extends the red line to . Applying the reversed rule to gives , and repetition gives all negative multiples too. Thus is red. Since has coprime coordinates, these are exactly the lattice points on that line.
Rule (2) at gives the pair , which similarly extends to the entire line . The reversed rule applied to gives and , so is red as well. Apply the same two operations on a red line : they produce the lines and . Induction proves that every point of
is red. This explicitly supplies both directions of the line propagation implicit in Figure 9.
The subgroup consists exactly of the integer pairs in (1). Indeed, vanishes modulo on both generators. Conversely, if , then
and both coefficients are integers. To determine every remaining color, observe that the homomorphism takes the unit directions to , respectively. For any point outside , subtract the unit direction with its nonzero residue. The result is a red point of , 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 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.