Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every counterexample has at least ten points

Proved
Erdos9796Mission.counterexample_card_ge_ten

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

discrete-geometryerdos-97small-cardinality

Every nonempty finite planar point set in strictly convex position such that, at each vertex, four other points lie at some common positive distance from that vertex has at least ten points. The radius may depend on the vertex.

Preamble
import Theorems.Thm_Erdos9796Mission_counterexample_card_ge_nine
import Theorems.Thm_Erdos9796Mission_finite_nine_exclusion

open Erdos9796Mission
Formal statement
theorem Erdos9796Mission.counterexample_card_ge_ten :
    ∀ A : Finset Plane, A.Nonempty → ConvexIndep (A : Set Plane) →
      HasNEquidistantProperty 4 A → 10 ≤ A.card := by sorry
Source
https://github.com/mysticflounder/erdos-97-96-formalization/blob/10136cbd97ce7adae0b7bdb0fa28a67dfde01906/lean/Erdos9796Proof/P97/SmallCardinality.lean#L31-L38

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