1. Understanding the Problem:
We are given a figure S in the plane such that its border does not contain any lattice points. We need to prove that if we can cover the plane with copies of S such that any two lattice points x and y with distance 1 always go on lattice points, then the area of S is equal to the number of lattice points inside it.
2. Initial Setup:
Let S have x∈N lattice points in its interior and area y. We aim to show that y=x.
3. Contradiction Assumption:
Assume for contradiction that y=x. Select some ϵ>0 such that y∈/[x(1−ϵ),x(1+ϵ)].
4. Large Square Consideration:
Consider an arbitrarily large axis-aligned square of side length a in the plane, where a∈N. This square has approximately a2 lattice points inside it.
5. Lattice Points in the Square:
Since a is large, the number of lattice points inside the square is at least (1−ϵ2)a2 and at most (1+ϵ2)a2.
6. **Copies of S in the Square:**
Each of these lattice points is contained in a copy of S. For at least (1−ϵ2)a2 of these lattice points, the copy of S containing it is entirely within the a×a square.
7. Area Calculation:
The total area of the copies of S inside the square is then at least (1−ϵ2)a2⋅xy and at most (1+ϵ2)a2⋅xy.
8. Contradiction:
For small enough ϵ and large enough a, the range [(1−ϵ2)a2⋅xy,(1+ϵ2)a2⋅xy] does not overlap with the range [(1−ϵ2)a2,a2]. This leads to a contradiction.
9. Conclusion:
Therefore, our assumption that y=x must be false. Hence, y=x.
■