Heilbronn triangle problem in a square $H(3)$
The largest possible area of the smallest triangle formed by three of $3$ points in a unit square.
Value: $\frac{1}{2}$ (≈0.5) 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}{2}$ (≈0.5) |
Trivial or easy according to the secondary source.
[via M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144.] |
Checked construction
Certificate heilbronn-square-3-lower-1over2, submitted by daniel-munro, 2026-11-21 [construction from Trivial or easy according to the secondary source.] |
| undated | $\le \frac{1}{2}$ (≈0.5) |
Trivial or easy according to the secondary source.
[via M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144.] |
Literature |