Counting obstruction: a counterexample has at least nine vertices
ProvedErdos9796Mission.counterexample_card_ge_nineEvery nonempty convex-independent finite planar set with the 4-equidistant property has cardinality at least nine. The formalization follows Dumitrescu's 2006 isosceles-count route, with cap-witness refinements associated in the source with Nivasch–Pach–Pinchasi–Zerbib (2013). These citations record mathematical provenance only; the Lean declaration and proof are this project's own formalization and do not import or directly machine-check a paper proof.
/- Statement-only mission draft: SKETCH — NOT PROMOTABLE. Source and precise status are recorded in items.json. -/ import Definitions.Def_Erdos9796Mission open Erdos9796Mission
theorem Erdos9796Mission.counterexample_card_ge_nine :
∀ A : Finset Plane, A.Nonempty → ConvexIndep (A : Set Plane) → HasNEquidistantProperty 4 A → 9 ≤ A.card := by sorryRead-back
What the Lean code literally says, in plain math · gpt-5.6-luna
For every finite set of points in the real Euclidean plane, if is nonempty, every point is outside the real convex hull of , and for every point there exists a positive real radius (possibly depending on ) such that has cardinality at least , then has cardinality at least .
Confirmed by the mission captain (proposal self-audit).