Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Descent: a minimal counterexample with more than nine vertices has a removable vertex

Open
Erdos9796Mission.minimal_counterexample_removable

by mysticflounder · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-positiondiscrete-geometryerdos-97-96unit-distances

Let AAA 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 x∈Ax\in Ax∈A can be removed while preserving that property:

∃x∈A:  ∀p∈A∖{x}  ∃rp>0:  ∣{q∈A∖{x}:∥p−q∥=rp}∣≥4.\exists x\in A:\;\forall p\in A\setminus\{x\}\;\exists r_p>0:\;|\{q\in A\setminus\{x\}:\|p-q\|=r_p\}|\ge4.∃x∈A:∀p∈A∖{x}∃rp​>0:∣{q∈A∖{x}:∥p−q∥=rp​}∣≥4.

The smaller-set assumption quantifies over all point sets, not only subsets of AAA. 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.

Preamble
/- Statement-only mission draft: SKETCH — NOT PROMOTABLE.
Source and precise status are recorded in items.json. -/
import Definitions.Def_Erdos9796Mission
open Erdos9796Mission
Formal statement
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 sorry
Source
https://github.com/mysticflounder/erdos-97-96-formalization/blob/757d852766f377f7c1a0ffeeef6d3526bc0cb7a4/lean/Erdos9796Proof/P97/RemovableVertexAxiom/Base.lean#L53; https://github.com/mysticflounder/erdos-97-96-formalization/blob/757d852766f377f7c1a0ffeeef6d3526bc0cb7a4/lean/Erdos9796Proof/P97/RemovableVertexAxiom/RemovableVertexOfLarge.lean#L50
Read-back

What the Lean code literally says, in plain math · gpt-5.6-luna

For every finite set AAA of points in the real Euclidean plane, suppose that AAA is nonempty, every point a∈Aa\in Aa∈A is outside the real convex hull of A∖{a}A\setminus\{a\}A∖{a}, every point p∈Ap\in Ap∈A has some positive real radius r>0r>0r>0 for which {q∈A:dist⁡(p,q)=r}\{q\in A : \operatorname{dist}(p,q)=r\}{q∈A:dist(p,q)=r} has cardinality at least 444, and 9<∣A∣9<|A|9<∣A∣. Suppose also that for every finite set BBB of points in the plane, whenever ∣B∣<∣A∣|B|<|A|∣B∣<∣A∣, BBB is nonempty, every point of BBB is outside the real convex hull of the other points of BBB, and every point of BBB has a positive radius giving at least 444 points of BBB at that distance, the proposition False\mathrm{False}False holds; this minimality clause quantifies over all such smaller finite sets BBB and imposes no subset relation between BBB and AAA. Then there exists a point x∈Ax\in Ax∈A such that, after removing xxx from AAA, every point p∈A∖{x}p\in A\setminus\{x\}p∈A∖{x} has some positive real radius r>0r>0r>0 (possibly depending on ppp) with at least 444 points q∈A∖{x}q\in A\setminus\{x\}q∈A∖{x} at distance dist⁡(p,q)=r\operatorname{dist}(p,q)=rdist(p,q)=r.

Human review
  • Endorsed by Shuze Chen · Sep 8, 2026

  • Endorsed by mysticflounder · Sep 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me