Skip to content

Erdős Problem #216

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: geometry, convex.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

For \(k\ge4\), an empty convex \(k\) gon consists of \(k\) vertices from a finite planar point set, in strictly convex position, with no other point of the set in its interior. The classical empty-polygon problem asks for the smallest \(g(k)\) such that every set of at least \(g(k)\) points in general position contains one.

General position, meaning no three input points are collinear, is essential. The maintained Erdős #216 displays the question without explicitly stating it. Read literally without that hypothesis, \(g(k)\) does not exist for any \(k\ge3\): arbitrarily many collinear points contain no convex polygon. Its reported finite values therefore refer to the classical general-position formulation, not the literal unrestricted statement.

A small example

Four points that are the vertices of a square form an empty convex quadrilateral if no other chosen point lies inside. Four points with one strictly inside the triangle of the other three do not form a convex quadrilateral. The fifth point of a general-position five-point set forces an empty quadrilateral, giving \(g(4)=5\).

A point exactly on a polygon edge presents a boundary-convention issue; general position eliminates three-collinear cases, so no extra input point can lie on the edge determined by two selected vertices.

What is known

The corrected classical general-position problem is SOLVED for every \(k\):

\[ g(4)=5,\qquad g(5)=10,\qquad g(6)=30, \]

and \(g(k)\) does not exist for \(k\ge7\).

Harborth (1978) proved the exact empty pentagon number ten. Nicolás (2007) and Gerken (2008) independently proved that an empty convex hexagon is always forced at some finite size. Marijn Heule and Manfred Scheucher, Happy Ending: An Empty Hexagon in Every Set of 30 Points, established \(g(6)=30\) using large-scale SAT verification. Subercaseaux and coauthors, Formal Verification of the Empty Hexagon Number, subsequently formalized that computational result in Lean.

Horton (1983) constructed arbitrarily large general-position sets avoiding empty convex seven-gons; these also avoid larger empty polygons by considering convex subsets, so no universal threshold exists for \(k\ge7\).

GCL's current state

Pinned and live catalogue label #216 DISPROVED, meaning the universal existence-for-proposal for every \(k\) is false. Original issue #1485. The primary 2024 SAT and external Lean papers were located, but their computational certificates were not independently replayed on GCL's protected toolchain. The missing general-position qualification remains a statement-capture issue.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded task enumerates integer-coordinate point sets in general position, implements exact orientation and point-in-polygon predicates, and distinguishes convex from merely noncrossing polygons. Acceptance: five generic points force an empty quadrilateral, collinear sets explicitly violate the literal unqualified question, and the source statement is normalized with the no-three-collinear hypothesis only as a labelled corrected formulation. The SAT and Lean checks require separate exact-commit replay.

Sources and claim boundaries

No independently replayed SAT or Lean certificate, new extremal threshold or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1485 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction