Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ethan Hendren (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: