Heilbronn triangle problem in a triangle $\Delta(5)$
The largest possible area of the smallest triangle formed by three of $5$ points in a triangle of unit area.
Value: $3-2\sqrt{2}$ (≈0.1715729) 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 |
|---|---|---|---|
| 1988-04 | $\le \frac{1}{4}$ (≈0.25) | A. Soifer, the Five-Point Problem, Fifth Annual Colorado Mathematical Olympiad (April 1988), in A. Soifer, How Does One Cut a Triangle?, 2nd ed., Springer, 2009, Chapter 7. | Literature |
| 1989-11 | $\ge 3-2\sqrt{2}$ (≈0.1715729) | R. Peng, solution to the Erdős-Soifer problem ES1 (letter, November 1989), outlined in A. Soifer, How Does One Cut a Triangle?, 2nd ed., Springer, 2009, Section 9.3, Problem 9.3.2. |
Checked construction
via $\ge 0.1715728752$, heilbronn-triangle-5-lower-0p1715728752 |
| 1989-11 | $\le 3-2\sqrt{2}$ (≈0.1715729) | R. Peng, solution to the Erdős-Soifer problem ES1 (letter, November 1989), outlined in A. Soifer, How Does One Cut a Triangle?, 2nd ed., Springer, 2009, Section 9.3, Problem 9.3.2. | Literature |