Theorem
Separated centers under finitely many torus covers
Finitely many centers can be chosen to avoid a fixed finite collection of iterated covering coincidences.
Statement
Let be a nonsingular integer matrix and an integer. Assume is nonsingular for . For every finite number of labels, there are rational torus points and such that
for all , except . Images and balls are taken on the unit flat torus.
Proof
Choose the centers to avoid . For distinct labels this equation is a closed set with empty interior in the product of tori. For the same label and , the forbidden points form the finite kernel of the covering induced by . The complement of the finitely many forbidden sets is open and dense; rational tuples are dense, so a rational tuple lies in the complement.
The finitely many nonzero distances have positive minimum . Choose with . The triangle inequality gives the result. It follows that corresponding preimages at levels whose difference is at most are disjoint, for every nonexcluded label pair.