Descent: a minimal counterexample with more than nine vertices has a removable vertex
OpenErdos9796Mission.minimal_counterexample_removableLet be a nonempty finite strictly convex point set with more than nine vertices, and assume every vertex has four other vertices at a common positive distance. Assume in addition that no smaller nonempty strictly convex point set anywhere in the plane has this four-neighbour property. Then some vertex can be removed while preserving that property:
The smaller-set assumption quantifies over all point sets, not only subsets of . This is the repository's open minimal-counterexample descent obligation. Convex independence survives deletion and the remaining set is nonempty, so such a deletion contradicts minimality.
Closed by the mission owner on 2026-09-13 after the Kruer–Kohlmeyer–Price negative resolution of Erdős 96 and 97. No further work is requested on this historical project task. This retirement is administrative and does not assert that this individual lemma is false. The resolution is recorded on Erdos9796Mission.problem97, Erdos9796Mission.problem96, and Erdos9796Mission.combined.
/- Statement-only mission draft: SKETCH — NOT PROMOTABLE. Source and precise status are recorded in items.json. -/ import Definitions.Def_Erdos9796Mission open Erdos9796Mission
theorem Erdos9796Mission.minimal_counterexample_removable :
∀ A : Finset Plane, A.Nonempty → ConvexIndep (A : Set Plane) → HasNEquidistantProperty 4 A → 9 < A.card → (∀ B : Finset Plane, B.card < A.card → B.Nonempty → ConvexIndep (B : Set Plane) → HasNEquidistantProperty 4 B → False) → ∃ x ∈ A, HasNEquidistantProperty 4 (A.erase x) := 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, suppose that is nonempty, every point is outside the real convex hull of , every point has some positive real radius for which has cardinality at least , and . Suppose also that for every finite set of points in the plane, whenever , is nonempty, every point of is outside the real convex hull of the other points of , and every point of has a positive radius giving at least points of at that distance, the proposition holds; this minimality clause quantifies over all such smaller finite sets and imposes no subset relation between and . Then there exists a point such that, after removing from , every point has some positive real radius (possibly depending on ) with at least points at distance .
Confirmed by the mission captain (proposal self-audit).