The maximum area of the convex hull of a polyhex

Get email updates

Pragyaan Gaur

For n edge-connected cells in the regular hexagonal tiling, the convex-hull area is at most one sixth of the ceiling of n2+14n/3n^{2} + 14n/3, measured in units of one cell. The paper gives a matching construction for every n.

What was already known

Kurz’s 2008 conjecture put the floor of n2+14n/3+1n^{2} + 14n/3 + 1 in place of the ceiling of n2+14n/3n^{2} + 14n/3. The new upper bound is one sixth of a cell smaller when n is a multiple of three.

AI involvement AI-centered

Principia Math produced the first informal upper-bound argument. Gaur replaced the spanning-tree insertion lemma and final arithmetic step. Claude helped develop the strategy and prepared the Lean proofs, including the later Euclidean bridge.

Importance Notable

The AI-origin strategy, completed with human replacement steps, proves the conjectured bound in a sharp form.

Technical verification Formal (Lean + human)

Gaur reports a Lean proof of the two upper bounds and the conversion from the lattice model to regular unit-area hexagons. The author also reports checking the mathematics and comparing the Challenge with the paper.

Formal checking

Gaur reports a Lean proof of the two upper bounds and the conversion from the lattice model to regular unit-area hexagons. The author also reports checking the mathematics and comparing the Challenge with the paper.

Checker
Pragyaan Gaur, reporting Lean 4 verification
Scope
Gaur reports a Lean proof of the two upper bounds and the conversion from the lattice model to regular unit-area hexagons. The author also reports checking the mathematics and comparing the Challenge with the paper.
Basis
Reported by the linked checker

Gaur reports a Lean proof of the two upper bounds and the conversion from the lattice model to regular unit-area hexagons. The author also reports checking the mathematics and comparing the Challenge with the paper.

Checker
Pragyaan Gaur
Scope
Gaur reports checking the mathematics of the upper-bound argument and the correspondence of the challenge statements to the paper.
Basis
Reported by the linked checker

Human understanding Partial

Gaur supplied proofs of the insertion and arithmetic steps, documenting human understanding of those parts of the retained upper-bound argument.

Correction and publication history