The Kernel Deficit Dominates Twice the Hull Deficit: A Sharp Strengthening of Nakano's Inequality

Abstract

A point lies in the kernel of a polygon if it can see the entire polygon. Thus the kernel measures how much of the polygon is available to a single guard, while the convex hull measures how far the polygon is from being convex. We prove that these two losses are linked by a sharp factor of two: the area lost between a polygon and its kernel dominates twice the kernel-weighted area missing from the polygon&#39;s convex hull. In terms of Sibley&#39;s guard-point ratio $G$ and exterior ratio $E$, which we denote by $A$, the result is $G \leq A/(2-A)$, which improves Nakano&#39;s inequality $G \leq A$ whenever $A < 1$. The proof passes through a convex-body cap union. From a compact convex body $K$ and finitely many points whose convex hull contains it, we join every point to $K$ and take the union $U$ of the resulting caps. Cyclically sorting the directed boundary edges of a polygonal $U$ produces a convex companion $H$. A boundary-reversal argument gives $|H| + |U| \geq 2|\mathrm{conv}\, U|$, while a support-function identity and Minkowski&#39;s mixed-area inequality give $|U|^2 \geq |K||H|$. Inner polygonal approximation handles every positive-area compact convex $K$, while a separate null-area branch covers points, segments, and all other lower-dimensional cases. Both main theorems have machine-checked Lean 4 proofs whose final statements were audited against the informal statements after kernel checking.