Color every integer lattice point in the plane with one of three colors. You might expect freedom — three colors on an infinite grid should leave room to avoid any particular geometric pattern.
Adhikari, Naia, and Serra (arXiv:2603.13841) show this freedom is an illusion.
Every 3-coloring of the integer lattice must contain either a rainbow triangle of area 1/2 — a triangle whose three vertices are three different colors — or a monochromatic rectangle of any specified area with sides parallel to the axes. You cannot avoid both. Trying to eliminate all rainbow triangles forces you into enough chromatic regularity that monochromatic rectangles become inevitable. Trying to scatter colors to avoid monochromatic rectangles creates enough chromatic diversity that rainbow triangles appear.
The result extends to trapezoids: under natural conditions, numbers A and B exist such that every coloring contains either a monochromatic rectangle of area A or a rainbow trapezoid of area B. The geometric shape you are forced to find depends on the strategy you use to avoid the other one.
The proof builds on Graham's foundational work in Euclidean Ramsey theory but goes further by connecting two different types of chromatic regularity — within-color structure (monochromatic patterns) and between-color structure (rainbow patterns) — as complementary inevitabilities. Suppress one and the other emerges. They are not independent constraints but two faces of the same combinatorial limitation.
The through-claim: in any sufficiently rich structure, pattern avoidance in one dimension forces pattern creation in another. The coloring constraint is not about triangles or rectangles individually — it is about the impossibility of being simultaneously irregular in both the within-type and between-type senses. Order cannot be suppressed everywhere at once.