OpenAI claim summary for Math-2196
mathematicsTop Open Problemscontributionliterature_reportClaim: literature report
Summary of a claim published in openai/math; not a claim by this platform.
Heilbronn triangle power improvement: The improved construction gives a lower bound c n^(-2+eta) for the best achievable smallest triangle, but no matching upper bound, sharp asymptotic order, or optimal configurations.
This page records partial support. Complete resolution of the catalogue question is not established by this record.
Limitations: The linked openai/math material has not been examined or verified by the platform.
Manuscript
Contents
The Heilbronn Triangle Problem
OpenAI's claim
Heilbronn triangle power improvement: For every sufficiently large $n$, the paper claims $n$ points in the unit square with every triangle area at least $c n^{-2+\eta}$ for fixed positive $c,\eta$. This contradicts an upper bound with exponent arbitrarily close to minus two.Mathematical statement of the claimed result
Mathematical claim 1.
For $n\ge3$, define $\Delta(n)=\max_{P\subset[0,1]^2,\ |P|=n}\min_{\{p,q,r\}\subset P}\tfrac12|\det(q-p,r-p)|$. The claim gives absolute $\eta,c>0,n_0$ with \[\Delta(n)\ge cn^{-2+\eta}\quad(n\ge n_0).\] It therefore refutes the proposed upper estimate $\Delta(n)=O_\epsilon(n^{-2+\epsilon})$ for every $\epsilon>0$, by taking $\epsilon<\eta$. A fixed affine scaling transfers the construction to a unit disk.Outline of the argument
Heilbronn triangle power improvement: Two congruence conditions govern randomly sampled integer columns. Norm-polynomial residues control small nonzero determinants, while an independent quadratic-surface condition and lattice counts handle zero determinants. The Chinese remainder construction combines them, repeated labels supply a deletion saving, and scaling transfers the retained determinant lower bound to triangle areas.Formal verification
Family 191 describes Lean coverage for the triangle-area improvement along an unbounded sequence of sizes; the every-large-size extension is broader.Heilbronn triangle power improvement: The manuscript links HeilbronnTriangle.lean.
The documented selection does not cover the entire manuscript assertion relevant here.
This site has not run the Lean development. These links describe OpenAI’s selected formal statements and should be read with their stated scope.
Status caveat
OpenAI reports that an internal model produced the manuscripts. Their arguments have not been independently verified as proofs by this site. Any portion outside the documented formal scope may contain mistakes, and the catalogue label reports the announced mathematical claim.Sources
- OpenAI, A power improvement in the Heilbronn triangle lower bound, 2026-09-25; citation key
OAI:A-power-improvement-in-the-Heilbronn-triangle-lower-bound-September-25-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: intro:main. - Family 191: Lean scope.
- Comparator HeilbronnTriangle.json.
- Comparator HeilbronnTriangle.lean.
- OpenAI catalogue entry.