qedbot

Erdős·erdos:216

Erdős 216

problem formal record: unclassified source: disproved F2 declared

No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.

Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

geometry, convex·Source

AI activity

How grades work

No AI contribution recorded against this statement.

F2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

declares divergences from its source reviewed by an agent

Declared by the projects

1

As each project's formalization.yaml states it.

Horton's theorem: arbitrarily large planar point sets in general position with no empty convex 7-gon (Erdős Problem 216, k ≥ 7)IamMikeHelsel/lean-erdos-proofs · joined by names · no independent check

Read formalization.yaml

authors
Mike Helsel
method
agent — claude-opus-5-5
review
agent-reviewed (claude-fable-5-1 (orchestrating agent), second Claude Code agent (statement comparison))
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
4 main results named, checked with Comparator, with an alignment table
sources
Sets with no empty convex 7-gons — formalizes, authors not-contacted; Erdős Problem #216 — background, authors n/a; Formal Verification of the Empty Hexagon Number — background, authors not-contacted; formal-conjectures pull request #6775: Erdős Problem 216 — other, authors not-contacted
divergences
(1) Emptiness: an empty convex k-gon is required to have no other point of the set in the interior of its convex hull (Mathlib `interior (convexHull ℝ T)`). This is the weakest emptiness condition, so the non-existence statements proved are the strongest form; for point sets in general position it is equivalent to the closed-hull notion, which is also proved (Horton.not_hasEmptyConvexKGon'). (2) General position means no three distinct points are collinear (Mathlib `Collinear ℝ {p, q, r}`), the standard hypothesis of the problem. (3) Convex position means no point lies in the convex hull of the remaining points. (4) The plane is modelled both as ℝ × ℝ (erdos_216_ge_seven) and as EuclideanSpace ℝ (Fin 2) (horton_euclidean, and the formal-conjectures statements); the definitions are stated for an arbitrary real vector space. (5) The formal-conjectures definitions are copied with primed names; NonTrilinear is specialised from an arbitrary Euclidean affine space to ℝ², and `answer(False)` is read as `False`. (6) For exactly N points the construction uses a prefix of a Horton set of size 2^N with explicit integer coordinates.
checked by
nobody independent of its authors yet

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 0

No formal statement located.

Cited proofs · 0

No proof artifact cited by the formal record.

Also known as · 1
  • https://www.erdosproblems.com/216

Cite this record

qed.bot, “Erdős 216”, https://qed.bot/s/erdos-216, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.