Id: palomar/PALOMAR-2026-11-20-000006 Url: https://github.com/vltanh/lean4-heilbronn/tree/a405d9b79c16eb34dc1c199b765d69231c7d17cf Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000006-v1.json Repo: https://github.com/vltanh/lean4-heilbronn Tags: math.MG, math.CO, msc:52C10, msc:52A40 Score: 0 Title: Heilbronn's triangle problem in the unit square: nine points Trust: high Domain: math.MG Source: palomar Authors: The-Anh Vu-Le Reviews: 0 Subject: math.MG Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-20 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-20-000006 The Heilbronn number H_n of the unit square is the largest possible least area of a triangle with vertices at three of n points in the closed unit square. This entry proves H₉ = (9√65 − 55)/320 ≈ 0.0548760, and that it is attained only by the configuration of Comellas and Yebra (2002), with two points on each side of the square and one inside, up to the eight symmetries of the square and relabelling. The proof normalizes a maximizing configuration by affine maps into five families, by the corners of the square it occupies, and excludes or classifies each family by geometric case analysis,…