Skip to content

Erdős Problem #838

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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

A planar subset is in convex position when every selected point is a vertex of its convex hull. Erdős and Hammer asked how many such subsets every input point set must contain, and whether the logarithmic growth has a sharp leading constant.

For n points in R² with no three collinear, count subsets that are in CONVEX POSITION: each chosen point is a vertex of the convex hull of the subset. f(n) is the minimum over all input configurations of the number of such subsets. Does log f(n)/(log n)² converge to a universal constant? Subsets of a finite point set cannot be geometrically convex sets in the literal set-theoretic sense except singletons, so use convex-position terminology.

A small example

Four vertices of a strictly convex quadrilateral give all 2^4=16 subsets in convex position if empty set is counted (15 nonempty). Three triangle vertices and one interior point give exactly 15 subsets including empty: only the full four-element set is not in convex position, assuming no three collinear. Convexity of singleton/pairs is by convention.

This finite calculation is not an asymptotic or all-parameter proof.

What is known

Maintained /latex/838 read 2026-10-14: Erdős–Hammer question, Erdős [Er78c] (1978) proved n^(c1 log n)<f(n)<n^(c2 log n) for some positive constants. These bounds imply log f(n) is of order (log n)², but do not prove the ratio tends to a fixed limit. #107 related. Original 1978 proof not independently replayed.

The source-reported bounds have the form

$$

\exp(c_1(\log n)^2)<f(n)<\exp(c_2(\log n)^2)

$$

for some positive constants. This does not prove that \(\log f(n)/(\log n)^2\) converges. A subset counts as in convex position when each selected point is an extreme point of its own convex hull. The empty-set convention affects the count only by one.

GCL's current state

The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.

Preserved source-review qualifications: open convex position subset exp log squared limit. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Write exact orientation-and-convex-hull predicate and four-point enumeration under no-three-collinear. Independently read Erdős 1978 for subset-empty convention and bounds. Keep limit constant OPEN.

The original primary mathematical proofs, quantified status, finite definitions and deployed rendering must be independently checked before protected admission. No such admission is claimed here.

Sources and claim boundaries

  • Maintained Erdős problem #838, LaTeX/bibliography and authenticated issue source return, checked 14 October 2026.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. Original papers and unresolved proof obligations are identified in the source comment.
  • Critical review: PENDING. Protected publication: NONE. Deployed MathJax: NOT VERIFIED. GCL theorem certification: NONE.

Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2109 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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