Heilbronn triangle problem in a triangle $\Delta(4)$
The largest possible area of the smallest triangle formed by three of $4$ points in a triangle of unit area.
Value: $\frac{1}{3}$ (≈0.3333333) lower bound Checked construction upper bound Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| undated | $\ge \frac{1}{3}$ (≈0.3333333) |
Trivial or easy according to the secondary source.
[via T. Stead, The Heilbronn problem: triangle, tables of the best known configurations of n points in a triangle of unit area for n = 3 to 36, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.] |
Checked construction
Certificate heilbronn-triangle-4-lower-1over3, submitted by daniel-munro, 2026-11-21 [construction from Trivial or easy according to the secondary source.] |
| undated | $\le \frac{1}{3}$ (≈0.3333333) |
Trivial or easy according to the secondary source.
[via T. Stead, The Heilbronn problem: triangle, tables of the best known configurations of n points in a triangle of unit area for n = 3 to 36, with their record histories (linked from Erich Friedman's Packing Center), retrieved 2026-11-21.] |
Literature |