Large triangles in dense planar sets

Fix a triangle with three noncollinear vertices. Suppose a measurable set in the plane occupies a positive fraction of arbitrarily large squares. The squares may have different centres. Must the set contain the vertices of a rotated and translated copy of the triangle at every sufficiently large scale?

Why it matters and what counts as progress

Why it matters: Positive density makes many distances unavoidable. A triangle imposes three distances at once and also fixes the angle between two sides.

What counts as progress: Prove the exact containment for all sufficiently large scales, bound the scale threshold, or extend the result to other planar patterns.

How the problem developed

  1. 2022 · Exact copies above density one half [6]

    Kenneth Falconer, Vjekoslav Kovač and Alexia Yavicoli Proved the planar result above upper Banach density one half.

  2. 2023 · Positive-density conjecture [7]

    Davi Castro-Silva Conjectured the exact triangle conclusion for sets with positive upper density in origin-centered squares.

  3. 6 Nov 2026 · Exact copies at positive density [1][2]

    Polona Durcik with GPT 6 Astra Pro Reported exact copies of every sufficiently large dilate under the positive upper Banach density hypothesis.

  4. 10 Nov 2026 · Lean verification [3][4]

    Polona Durcik with Claude Opus 5.5 Registered the Lean theorem for the full geometric conclusion.

AI contribution

Sources

  1. Triangles in the plane: a self-contained proof blueprint
  2. Durcik’s account of the proof and Lean development
  3. Lean statement of the planar triangle theorem
  4. Palomar checking record
  5. Furstenberg, Katznelson and Weiss on geometric configurations
  6. Falconer, Kovač and Yavicoli on large similar copies
  7. Castro-Silva’s planar density conjecture
Publication history