A computer-assisted proof of optimality for Heilbronn's problem with nine points in a triangle

We give a computer-assisted proof that the largest possible minimum triangle area among nine points in a triangle, divided by the container area, is (43/784). The known rational configuration attains this value. Equality is unique up to affine symmetries of the container and relabeling. A minimum enclosing triangle gives an affine normalization to eight contact families. A cell graph excludes incompatible regions for the free points. Exact determinant bounds, positive integer combinations, and a first-order local certificate close the remaining boxes. An exact enumeration shows that the known configuration has a unique minimum enclosing triangle, which gives the equality statement in the original container. This is an AI-assisted, computer-assisted proof awaiting independent verification. Saved run summaries do not contain a replayable certificate for each leaf.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24247460
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A computer-assisted proof of optimality for Heilbronn's problem with nine points in a triangle

Ethan Hendren
Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
preprint

A computer-assisted proof of optimality for Heilbronn's problem with nine points in a triangle

Ethan Hendren
preprint en

Abstract

We give a computer-assisted proof that the largest possible minimum triangle area among nine points in a triangle, divided by the container area, is (43/784). The known rational configuration attains this value. Equality is unique up to affine symmetries of the container and relabeling. A minimum enclosing triangle gives an affine normalization to eight contact families. A cell graph excludes incompatible regions for the free points. Exact determinant bounds, positive integer combinations, and a first-order local certificate close the remaining boxes. An exact enumeration shows that the known configuration has a unique minimum enclosing triangle, which gives the equality statement in the original container. This is an AI-assisted, computer-assisted proof awaiting independent verification. Saved run summaries do not contain a replayable certificate for each leaf.

Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon