\documentclass[12pt]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern,amsmath,amssymb,amsthm,mathtools} \usepackage[margin=1.05in]{geometry} \usepackage{enumitem,booktabs,needspace,array} \usepackage{tikz} \usetikzlibrary{patterns} \usepackage[colorlinks=true,urlcolor=blue,linkcolor=black,citecolor=black]{hyperref} \renewcommand{\UrlBreaks}{\do\/} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{conjecture}[theorem]{Conjecture} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{remark}[theorem]{Remark} \newtheorem{computation}{Computation} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \newcommand{\W}{\mathcal O} \newcommand{\Lf}{\mathcal L} \newcommand{\A}{\mathcal S} \newcommand{\conv}{\operatorname{conv}} \newcommand{\inter}{\operatorname{int}} \newcommand{\vol}{\operatorname{vol}} \newcommand{\GL}{\mathrm{GL}} \setlist[enumerate]{leftmargin=*,label=\textup{(\roman*)}} \emergencystretch=2em \raggedbottom \hypersetup{pdftitle={Wills' (1981) conjecture holds if and only if the dimension is at most 4},pdfauthor={Dave Goel},pdfkeywords={Ehrhart polynomial, lattice polytope, centrally symmetric, interior lattice point, Wills' conjecture}} \title[Wills' (1981) conjecture]{Wills' (1981) conjecture holds if and only if the dimension is at most 4}\thanks{$^{*}$Additionally, Theorems~\ref{thm:four}, \ref{thm:five} and~\ref{thm:equality} and Corollaries~\ref{cor:exact} and~\ref{cor:g2} are derived in Lean~4 from six published results (Ehrhart's theorem, the properties (E1)--(E3) of Ehrhart polynomials, the boundary triangulation used in Lemma~\ref{lem:few}, and Minkowski's theorem on lattice tilings used in Lemma~\ref{lem:frame}) and five computer checks (Computations~\ref{comp:cube}, \ref{comp:index2}, \ref{comp:lattices} and~\ref{comp:frame}, and the volume of~$W$), each stated as an explicit hypothesis, and checked with \texttt{lake comparator}: \url{https://github.com/david44hello/paper_wills-1981-conjecture/tree/v3.32}\nopunct} \author{Dave Goel} \email{david44hello@gmail.com} \subjclass[2020]{Primary 52B20; Secondary 11H06, 52-08, 52C07} \keywords{Ehrhart polynomial, lattice polytope, centrally symmetric polytope, interior lattice point, Wills' conjecture} \date{} \dedicatory{\normalfont\footnotesize First version: November 3, 2026. This version (3.32): November 16, 2026.}\thanks{An expanded version of this paper, with further results, is~\cite{Goel26}, at \url{https://doi.org/10.5281/zenodo.23955454}\nopunct} \begin{document} \begin{abstract} Let $P$ be a lattice polytope in $\R^n$ that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient $g_i(P)$ of the Ehrhart polynomial of $P$ is at most the corresponding coefficient of the cube $[-1,1]^n$, that is, $g_i(P)\le 2^i\binom ni$. Wills proved this for $n\le3$, and Henze showed in 2014 that it fails for every $n\ge7$; the dimensions $4$, $5$ and $6$ remained open. We settle them. In dimension $4$ the conjecture holds; the new bounds are $g_1(P)\le8$ and $g_2(P)\le24$, and, up to unimodular equivalence, $g_1(P)=8$ only for the cube, one explicit $24$-cell and one explicit cross-polytope. In dimension $5$ we give a polytope with $50$ vertices in $[-1,1]^5$ whose linear Ehrhart coefficient is $101/10>10$; products with segments then give counterexamples in every dimension $n\ge6$. Hence Wills' conjecture holds in $\R^n$ if and only if $n\le4$. The proof in dimension $4$ combines Ehrhart reciprocity, the lower bound theorem for triangulated $3$-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry.$^{*}$ \end{abstract} \maketitle \section{Introduction}\label{sec:intro} A \emph{lattice polytope} in $\R^n$ is the convex hull of finitely many points of $\Z^n$. Ehrhart~\cite{Ehr62} proved that for a lattice polytope $P$ of dimension $n$ the number of lattice points in the dilate $kP$ is a polynomial in the integer $k\ge0$, \[ L_P(k)=\#(kP\cap\Z^n)=g_0(P)+g_1(P)\,k+\dots+g_n(P)\,k^n , \] the \emph{Ehrhart polynomial} of $P$. Here $g_0(P)=1$, the leading coefficient $g_n(P)$ is the volume of $P$, and $g_{n-1}(P)$ is half the lattice surface area of $P$ (Section~\ref{sec:prelim}); the remaining coefficients have no such simple description and may be negative \cite{BR15}. Minkowski's first theorem~\cite{Min96} states that a convex body $K\subset\R^n$ that is symmetric about the origin and has no lattice point other than $0$ in its interior has volume at most $2^n$, the volume of the cube $C_n=[-1,1]^n$. Wills~\cite{Wil81} looked for a discrete analog of this theorem, one that bounds every Ehrhart coefficient of a lattice polytope. Let $\W^n$ be the set of lattice polytopes $P\subset\R^n$ with $P=-P$ whose only interior lattice point is the origin. The cube $C_n$ belongs to $\W^n$, and $L_{C_n}(k)=(2k+1)^n$, so $g_i(C_n)=2^i\binom ni$. Wills called these numbers the expected values of the coefficients \cite[Remark~(b)]{Wil81}, and the following statement is known as Wills' conjecture. We state it as in~\cite[Conjecture~1.1]{Hen14}; see also~\cite{GW93}. \begin{conjecture}[Wills' conjecture]\label{conj:wills} For every $n\ge1$, every $P\in\W^n$ and every $i\in\{0,1,\dots,n\}$, \[ g_i(P)\le g_i(C_n)=2^i\binom ni . \] \end{conjecture} For $i=0$ there is equality, and for $i=n$ the inequality is Minkowski's theorem. Wills proved the case $i=n-1$ in every dimension \cite[Theorem~(i)]{Wil81}; hence the conjecture holds for $n\le2$. Wills also proved it for $n=3$ \cite[Theorem~(i), (ii)]{Wil81}, and, in dimension $4$, the bounds $g_1(P)<21$, $g_2(P)<31$ and $g_2(P)\le g_1(P)+16$ \cite[Theorem~(iii)]{Wil81}. A discrete version of Minkowski's first theorem by Betke, Henk and Wills~\cite[Theorem~2.1]{BHW93} implies that $L_P(k)\le L_{C_n}(k)$ for every $P\in\W^n$ and every integer $k\ge0$, which is the inequality of the conjecture for the values of the two polynomials instead of their coefficients. For $i=n-1$, a bound in terms of the successive minima that implies Wills' bound is due to Henk, Sch\"urmann and Wills~\cite{HSW05}. Henze~\cite{Hen14} constructed a family of polytopes $P_n$ and showed that $P_7\in\W^7$ has $g_1(P_7)=1534/105>14$; taking products with segments, he obtained counterexamples in every dimension $n\ge7$. On the positive side, Henze proved the conjecture for every $P\in\W^n$ whose Ehrhart roots all have real part $-1/2$ \cite[Corollary~3.3]{Hen14}; by a theorem of Bey, Henk and Wills~\cite{BHW07}, every such polytope is reflexive. About the remaining dimensions, Henze wrote \cite[Remark~2.2]{Hen14}: ``In dimensions 4, 5 and 6 we tested Wills' conjecture on lattice polytopes that have a similar structure to $P_n$. [\dots] None of these examples turned out to be a counterexample.'' We settle these three dimensions. \begin{table}[ht] \centering\small \caption{The best results before this paper and the results of this paper.}\label{tab:results} \begin{tabular}{>{\raggedright\arraybackslash}p{0.43\linewidth}>{\raggedright\arraybackslash}p{0.47\linewidth}} \toprule Best result before this paper & New result\\ \midrule $g_1(P)<21$ \cite[Theorem~(iii)]{Wil81} & $g_1(P)\le8$ for every $P\in\W^4$, with equality exactly for $C_4$, a $24$-cell $T$ and a cross-polytope $X$, up to unimodular equivalence (Theorems~\ref{thm:four} and~\ref{thm:equality})\\\addlinespace $g_2(P)<31$ and $g_2(P)\le g_1(P)+16$ \cite[Theorem~(iii)]{Wil81} & $g_2(P)\le24$ for every $P\in\W^4$, with equality exactly for $C_4$, up to unimodular equivalence (Theorem~\ref{thm:four} and Corollary~\ref{cor:g2})\\\addlinespace no counterexample known for $n\le6$; the tested families in dimensions $4$, $5$, $6$ contain none \cite[Remark~2.2]{Hen14} & the polytope $W$ of Table~\ref{tab:witness} is in $\W^5$ and has $g_1(W)=101/10>10$; counterexamples in every dimension $n\ge5$ (Theorem~\ref{thm:five})\\\addlinespace true for $n\le3$ \cite{Wil81}; false for $n\ge7$ \cite{Hen14} & Conjecture~\ref{conj:wills} holds in $\R^n$ if and only if $n\le4$ (Corollary~\ref{cor:exact})\\ \bottomrule \end{tabular} \end{table} \needspace{4\baselineskip} \medskip\noindent\textbf{Results.} Our main results are Theorems~\ref{thm:four} and~\ref{thm:five} and Corollary~\ref{cor:exact} below, and Theorem~\ref{thm:equality} in Section~\ref{sec:equality}, which determines the polytopes $P\in\W^4$ with $g_1(P)=8$. Table~\ref{tab:results} compares them with the best earlier results, and Figure~\ref{fig:status} shows the status of the conjecture in each dimension. Two of the three polytopes with $g_1(P)=8$ have Ehrhart roots off the line $\operatorname{Re}z=-\frac12$, so Henze's theorem does not cover them (Remark~\ref{rem:roots}). \begin{theorem}\label{thm:four} Every $P\in\W^4$ satisfies $g_1(P)\le8$ and $g_2(P)\le24$. \end{theorem} \begin{theorem}\label{thm:five} The polytope $W\subset\R^5$ of Table~\ref{tab:witness} belongs to $\W^5$, and \[ L_W(k)=1+\tfrac{101}{10}\,k+\tfrac{127}{12}\,k^2+\tfrac{139}{6}\,k^3+\tfrac{557}{12}\,k^4+\tfrac{386}{15}\,k^5 . \] In particular $g_1(W)=101/10>10=g_1(C_5)$. For every $n\ge6$ the polytope $W\times C_{n-5}$ belongs to $\W^n$ and has $g_1=2n+1/10>2n=g_1(C_n)$. \end{theorem} \needspace{4\baselineskip}\begin{corollary}\label{cor:exact} Wills' conjecture holds in $\R^n$ if and only if $n\le4$. \end{corollary} \begin{proof} For $n\le3$ this is Wills' theorem \cite{Wil81}. For $n=4$, $g_0=1$ by (E1) of Section~\ref{sec:prelim}, $g_3\le32$ by \cite[Theorem~(i)]{Wil81}, $g_4\le16$ by Minkowski's theorem, and $g_1$, $g_2$ are bounded by Theorem~\ref{thm:four}. For $n\ge5$, Theorem~\ref{thm:five} gives a counterexample. \end{proof} \begin{figure}[ht] \centering \begin{tikzpicture}[x=1.05cm,y=0.62cm,font=\small] \foreach \row/\lab in {1/{Known before this paper},0/{After this paper}}{ \node[anchor=east] at (0.3,\row*1.9) {\lab}; } \fill[green!18] (0.6,1.5) rectangle (3.6,2.3); \fill[pattern=north east lines] (3.6,1.5) rectangle (6.6,2.3); \fill[red!18] (6.6,1.5) rectangle (10.6,2.3); \node at (2.1,1.9) {true (Wills \cite{Wil81})}; \node[fill=white,inner sep=2pt] at (5.1,1.9) {open}; \node at (8.6,1.9) {false (Henze \cite{Hen14})}; \draw (0.6,1.5) rectangle (10.6,2.3); \fill[green!18] (0.6,-0.4) rectangle (3.6,0.4); \fill[green!55!black] (3.6,-0.4) rectangle (4.6,0.4); \fill[red!18] (6.6,-0.4) rectangle (10.6,0.4); \fill[red!70!black] (4.6,-0.4) rectangle (6.6,0.4); \draw (0.6,-0.4) rectangle (10.6,0.4); \draw[line width=1.6pt] (3.6,-0.4) rectangle (6.6,0.4); \node[text=white] at (4.1,0) {\textbf{true}}; \node[text=white] at (5.6,0) {\textbf{false}}; \node at (2.1,0) {true}; \node at (8.6,0) {false}; \foreach \n in {1,...,9}{ \node at (\n-0.4+0.5,-0.95) {$\n$}; } \node at (10.15,-0.95) {$\cdots$}; \node[anchor=east] at (0.3,-0.95) {dimension $n$}; \end{tikzpicture} \caption{The status of Wills' conjecture in each dimension $n$. Before this paper the conjecture was known to hold for $n\le3$ (Wills~\cite{Wil81}) and to fail for $n\ge7$ (Henze~\cite{Hen14}); the dimensions $4$, $5$ and $6$ (hatched) were open. This paper proves it for $n=4$ (Theorem~\ref{thm:four} and Corollary~\ref{cor:exact}) and disproves it for every $n\ge5$ (Theorem~\ref{thm:five}); the dimensions settled here are drawn in full colour, inside the thick frame.}\label{fig:status} \end{figure} \medskip\noindent\textbf{Idea of the proofs.} Theorem~\ref{thm:five} is a computation. The polytope $W$ is given by its $50$ vertices, and since $W$ has only one interior lattice point, its linear coefficient is determined by four numbers: the numbers of lattice points in $W$, in $2W$ and in the interior of $2W$, and the volume of $W$ (Proposition~\ref{prop:fournumbers}). Products with segments carry the example to every higher dimension. For Theorem~\ref{thm:four} we use Ehrhart reciprocity. Since $P\in\W^4$ has exactly one interior lattice point, $L_P(-1)=1$; comparing this with $L_P(1)=\#(P\cap\Z^4)$ shows that $g_1(P)\le8$ is equivalent to the inequality \[ \#(P\cap\Z^4)\le \sigma(P)+17 \] between the number of lattice points of $P$ and its lattice surface area $\sigma(P)=2g_3(P)$, and that this inequality also gives $g_2(P)\le24$ (Proposition~\ref{prop:reduction}). A triangulation of the boundary of $P$ that uses every boundary lattice point, together with Walkup's lower bound theorem for triangulated $3$-spheres~\cite{Wal70}, proves the inequality when $P$ has at most $29$ lattice points (Lemma~\ref{lem:few}). For $P$ with at least $31$ lattice points (their number is odd, since they come in pairs $\pm x$ together with $0$) we look at the integer linear functionals that take values in $[-1,1]$ on $P$. Either they contain a basis of $\Z^4$, and then $P$ is unimodularly equivalent to a polytope in the cube $C_4$; or they span $\R^4$ without containing a basis, and then a linear map carries $P$, together with its lattice, onto a polytope in $C_4$ with vertices in a sublattice of index $2$; or they span a proper subspace. In the last case we fix four lattice points of $P$ whose determinant is as large as possible; in their coordinates the lattice points of $P$ lie in $[-1,1]^4$, in one of $39$ lattices, up to signed permutations of the coordinates (Section~\ref{sec:cases}). This reduction, by four lattice points of largest determinant, follows Averkov and Schymura~\cite{AS24}, who used it to compute the largest number of columns of a $\Delta$-modular integer matrix for small parameters; their enumeration builds on that of Averkov, Borger and Soprunov~\cite{ABS21}. In each case only finitely many sets of lattice points remain, and they are enumerated by computer (Section~\ref{sec:computations}). Section~\ref{sec:prelim} collects the facts we use from Ehrhart theory. Section~\ref{sec:five} proves Theorem~\ref{thm:five}. Sections~\ref{sec:reduction}--\ref{sec:computations} prove Theorem~\ref{thm:four}, and Section~\ref{sec:equality} identifies the equality cases. The expanded version~\cite{Goel26} of this paper also gives a second proof of Case~III of Section~\ref{sec:cases}, determines the second largest value of $g_2$ in dimension~$4$, and describes the computations in more detail. \section{Preliminaries}\label{sec:prelim} \subsection{Ehrhart polynomials} Let $n\ge1$, let $\Lambda\subset\R^n$ be a lattice (a discrete subgroup of rank $n$), and let $P$ be a polytope of dimension $n$ whose vertices lie in $\Lambda$. Then $L_{P,\Lambda}(k)=\#(kP\cap\Lambda)=\sum_ig_i(P)k^i$ is a polynomial in $k$ of degree $n$ \cite{Ehr62}; its coefficients $g_i(P)$ depend on $\Lambda$, which will be clear from the context, and we write $L_P$ when $\Lambda=\Z^n$. We call two pairs $(P,\Lambda)$ and $(P',\Lambda')$ \emph{isomorphic} if a linear isomorphism $\phi$ of $\R^n$ satisfies $\phi(P)=P'$ and $\phi(\Lambda)=\Lambda'$; then $\phi(kP)\cap\Lambda'=\phi(kP\cap\Lambda)$ for every $k$, so $L_{P',\Lambda'}=L_{P,\Lambda}$. When $\Lambda=\Lambda'=\Z^n$, the map $\phi$ lies in $\GL_n(\Z)$, and the two lattice polytopes are called \emph{unimodularly equivalent}. We use four standard facts \cite[Chapters~3--5]{BR15}. \begin{enumerate} \item[(E1)] $g_0(P)=1$ and $g_n(P)=\vol(P)/\det\Lambda$. \item[(E2)] \emph{Reciprocity} (Ehrhart, Macdonald): $L_{P,\Lambda}(-k)=(-1)^n\,\#(\inter(kP)\cap\Lambda)$ for every integer $k\ge1$. \item[(E3)] For a facet $F$ of $P$ let $u_F$ be the primitive vector of the dual lattice $\Lambda^*$ that is an outer normal of $F$, and let $b_F$ be the integer with $F\subset\{x:\langle u_F,x\rangle=b_F\}$. Let $\operatorname{relvol}(F)$ be the $(n-1)$-dimensional volume of $F$, measured so that a fundamental domain of the lattice $\Lambda\cap\operatorname{aff}(F-F)$ has volume $1$. Then $g_{n-1}(P)=\frac12 \sigma(P)$, where $\sigma(P)=\sum_F\operatorname{relvol}(F)$ is the \emph{lattice surface area}. If $0\in\inter P$, then $\vol(P)/\det\Lambda=\frac1n\sum_F b_F\operatorname{relvol}(F)$, by cutting $P$ into the pyramids with apex $0$ over its facets. \item[(E4)] $L_{P\times Q}=L_P\,L_Q$ for lattice polytopes $P\subset\R^p$ and $Q\subset\R^q$, with the lattice $\Z^{p+q}$, since $k(P\times Q)\cap\Z^{p+q}=(kP\cap\Z^p)\times(kQ\cap\Z^q)$. \end{enumerate} In (E3), $b_F$ is an integer because $F$ contains points of $\Lambda$; when $0\in\inter P$ it is positive, and it is the lattice distance of $F$ from the origin. \subsection{The class \texorpdfstring{$\W^n$}{W\^{}n}} Let $\W^n_\Lambda$ be the set of polytopes $P$ with vertices in $\Lambda$, $P=-P$ and $\inter P\cap\Lambda=\{0\}$; so $\W^n=\W^n_{\Z^n}$. A polytope in $\W^n_\Lambda$ has dimension $n$, because $0$ is an interior point. We write $G(P)=\#(P\cap\Lambda)$. Since the lattice points of $P$ other than $0$ come in pairs $\pm x$, $G(P)$ is odd. \begin{lemma}\label{lem:member} Let $Y\subset\{-1,0,1\}^n$ be a set with $Y=-Y$ whose convex hull $P$ has dimension $n$. Then $P\in\W^n$. \end{lemma} \begin{proof} The polytope $P$ is a lattice polytope with $P=-P$. It has an interior point $x$, so $-x$ is interior too, and so is $0=\frac12x+\frac12(-x)$. Finally $\inter P\subset\inter C_n=(-1,1)^n$, whose only lattice point is $0$. \end{proof} The same proof applies to a sublattice $\Gamma\subseteq\Z^n$ in place of $\Z^n$: if $S\subseteq\Gamma\cap C_n$ is symmetric and spans $\R^n$, then $\conv S\in\W^n_\Gamma$. We use this in Sections~\ref{sec:cases} and~\ref{sec:computations}. \begin{lemma}[{cf.\ \cite[Proposition~2.3]{Hen14}}]\label{lem:product} If $P\in\W^p$ and $Q\in\W^q$, then $P\times Q\in\W^{p+q}$ and $g_1(P\times Q)=g_1(P)+g_1(Q)$. \end{lemma} \begin{proof} The product $P\times Q$ is a symmetric lattice polytope, and $\inter(P\times Q)=\inter P\times\inter Q$ contains only the lattice point $0$. By (E4) and (E1), the coefficient of $k$ in $L_PL_Q$ is $g_1(P)\cdot1+1\cdot g_1(Q)$. \end{proof} \section{A counterexample in dimension five}\label{sec:five} We compute four numbers for the polytope $W$ of Table~\ref{tab:witness}, three lattice-point counts and the volume; by Proposition~\ref{prop:fournumbers} they determine $g_1(W)$. \begin{table}[ht] \centering\small \caption{The polytope $W\subset\R^5$ is the convex hull of the $50$ points $\pm p$, where $p$ runs over the $25$ points below ($\bar1$ stands for $-1$). All $50$ points are vertices of $W$, and $W$ has $92$ facets.}\label{tab:witness} \begin{tabular}{ccccc} $(0,0,1,\bar1,\bar1)$ & $(0,0,1,1,\bar1)$ & $(0,1,\bar1,0,0)$ & $(0,1,0,1,\bar1)$ & $(0,1,0,1,1)$\\ $(0,1,1,\bar1,\bar1)$ & $(0,1,1,\bar1,0)$ & $(1,\bar1,\bar1,\bar1,0)$ & $(1,\bar1,0,1,0)$ & $(1,\bar1,0,1,1)$\\ $(1,\bar1,1,0,\bar1)$ & $(1,0,\bar1,0,\bar1)$ & $(1,0,\bar1,1,\bar1)$ & $(1,0,\bar1,1,1)$ & $(1,0,0,\bar1,1)$\\ $(1,0,0,1,1)$ & $(1,0,1,\bar1,0)$ & $(1,0,1,\bar1,1)$ & $(1,0,1,0,\bar1)$ & $(1,1,\bar1,\bar1,\bar1)$\\ $(1,1,\bar1,\bar1,0)$ & $(1,1,\bar1,1,0)$ & $(1,1,1,\bar1,0)$ & $(1,1,1,\bar1,1)$ & $(1,1,1,1,0)$\\ \end{tabular} \end{table} \begin{proposition}\label{prop:fournumbers} Let $P\in\W^5$. Then \[ g_1(P)=\frac{4\bigl(G(P)+1\bigr)+24\vol(P)-A(P)}{6},\qquad A(P)=\tfrac12\bigl(\#(2P\cap\Z^5)+\#(\inter(2P)\cap\Z^5)\bigr). \] \end{proposition} \begin{proof} Write $L=L_P$ and $g_i=g_i(P)$. By (E2) with $n=5$, $L(-1)=-1$ and $L(-2)=-\#(\inter(2P)\cap\Z^5)$. Hence \[ L(1)-L(-1)=2(g_1+g_3+g_5)=G(P)+1,\qquad L(2)-L(-2)=2(2g_1+8g_3+32g_5)=2A(P). \] Eliminating $g_3$ and using $g_5=\vol(P)$ (E1) gives $6g_1=4(G(P)+1)+24\vol(P)-A(P)$. \end{proof} \begin{proof}[Proof of Theorem~\ref{thm:five}] The $50$ points of Table~\ref{tab:witness} lie in $\{-1,0,1\}^5$, form a symmetric set and span $\R^5$; by Lemma~\ref{lem:member}, $W\in\W^5$. Direct computation gives \[ G(W)=117,\qquad \#(2W\cap\Z^5)=1815,\qquad \#(\inter(2W)\cap\Z^5)=243,\qquad \vol(W)=\tfrac{386}{15}, \] so $A(W)=1029$ and, by Proposition~\ref{prop:fournumbers}, $g_1(W)=\bigl(4\cdot118+24\cdot\frac{386}{15}-1029\bigr)/6=\frac{101}{10}$. The whole polynomial is determined by $L_W(0)=1$ and the values $L_W(k)$ for $k=1,\dots,5$, namely $117$, $1815$, $10765$, $39927$ and $112639$. All numbers in this proof can be computed with Normaliz~\cite{Normaliz} or LattE~\cite{LattE}; the input files are in~\cite{Repo}. For $n\ge6$, Lemma~\ref{lem:product} gives $W\times C_{n-5}\in\W^n$ and $g_1(W\times C_{n-5})=\frac{101}{10}+2(n-5)=2n+\frac1{10}$, since $g_1(C_m)=2m$. \end{proof} \section{Dimension four: the key inequality\texorpdfstring{\\}{ } and polytopes with few lattice points}\label{sec:reduction} From now on $n=4$. For $P\in\W^4_\Lambda$ we write $G=G(P)$, $g_i=g_i(P)$ (with respect to $\Lambda$) and $\sigma=\sigma(P)$. \begin{lemma}\label{lem:identities} For $P\in\W^4_\Lambda$, $\;g_1+g_3=g_2+g_4=\frac{G-1}{2}$. \end{lemma} \begin{proof} We have $L(1)=G=1+g_1+g_2+g_3+g_4$, and by (E2) $L(-1)=\#(\inter P\cap\Lambda)=1=1-g_1+g_2-g_3+g_4$. Subtracting the second equation from the first, and adding the two, gives the two identities. \end{proof} \begin{proposition}\label{prop:reduction} Let $P\in\W^4_\Lambda$. Then $g_4\le16$ and $g_3\le 2g_4\le32$. Moreover \[ g_1\le8\iff G\le \sigma+17, \] and if $g_1\le8$ then $g_2\le g_4+8\le24$. \end{proposition} \begin{proof} The bound $g_4=\vol(P)/\det\Lambda\le16$ is Minkowski's theorem, applied in the coordinates of a basis of $\Lambda$. Since every $b_F\ge1$, (E3) gives $2g_3=\sigma\le\sum_Fb_F\operatorname{relvol}(F)=4g_4$; this is Wills' argument for $g_{n-1}$ \cite[Theorem~(i)]{Wil81}. By Lemma~\ref{lem:identities}, $g_1=\frac{G-1}2-g_3$, so $g_1\le8$ if and only if $G\le2g_3+17=\sigma+17$. If this holds, then $G\le4g_4+17$, and Lemma~\ref{lem:identities} gives $g_2=\frac{G-1}2-g_4\le g_4+8\le24$. \end{proof} So Theorem~\ref{thm:four} is equivalent to the key inequality $G\le \sigma+17$ on $\W^4$. Let $\operatorname{NVol}(F)=3!\operatorname{relvol}(F)$ be the normalized volume of a facet, so that a lattice tetrahedron in $\operatorname{aff}F$ has normalized volume a positive integer. The inequality reads \begin{equation}\label{eq:star} \sum_F\operatorname{NVol}(F)\ \ge\ 6G-102 . \end{equation} \needspace{4\baselineskip} \begin{lemma}\label{lem:few} If $P\in\W^4_\Lambda$ and $G\le29$, then~\eqref{eq:star} holds with strict inequality; hence $g_1<8$. \end{lemma} \begin{proof} Take a triangulation $\Delta$ of the boundary of $P$ whose vertex set is the set of all $G-1$ boundary lattice points and in which every tetrahedron lies in a facet. To construct one, take a triangulation of $P$ whose vertices are exactly the points of $P\cap\Lambda$; one exists, for example by strong pulling (\cite[Lemma~2.1(2)]{HPPS21}, applied in the coordinates of a basis of $\Lambda$). Its faces that lie in the boundary of $P$ form $\Delta$. Then $\Delta$ is a triangulated $3$-sphere with $f_0=G-1$ vertices. Each of its $f_3$ tetrahedra is a lattice tetrahedron in the affine hull of a facet, so it has normalized volume at least $1$, and $\sum_F\operatorname{NVol}(F)\ge f_3$. Walkup's lower bound theorem~\cite[Theorem~1]{Wal70} gives $f_1\ge4f_0-10$ for every triangulated $3$-sphere, and the Dehn--Sommerville relations $f_0-f_1+f_2-f_3=0$, $2f_2=4f_3$ give $f_3=f_1-f_0$. Hence $\sum_F\operatorname{NVol}(F)\ge3f_0-10=3G-13$, and $3G-13>6G-102$ because $G\le29$. \end{proof}\par The proof gives a bound on $g_1$ for every $P\in\W^4_\Lambda$: by Lemma~\ref{lem:identities} and (E3), $g_1=\frac{G-1}2-\frac\sigma2$, and $\sigma=\frac16\sum_F\operatorname{NVol}(F)\ge\frac{3G-13}6$, so $g_1\le\frac{3G+7}{12}$ (the solid line in Figure~\ref{fig:maxg1}). \begin{remark}\label{rem:three} With Euler's formula in place of Walkup's theorem, a similar triangulation argument gives Wills' theorem in dimension~$3$ (see~\cite{Goel26}). In dimension $4$ the lower bound theorem proves~\eqref{eq:star} only when $G\le29$; this is why the computations of Section~\ref{sec:computations} are needed. \end{remark} \section{Dimension four: three cases}\label{sec:cases} By Lemma~\ref{lem:few} it remains to prove~\eqref{eq:star} for $P\in\W^4$ with $G\ge31$. For such $P$ let \[ M(P)=\{u\in\Z^4:\ |\langle u,x\rangle|\le1\ \text{for all }x\in P\},\qquad r(P)=\dim\operatorname{span}M(P). \] The set $M(P)$ is finite (since $P$ contains a ball around $0$) and symmetric, and $\langle u,x\rangle\in\{-1,0,1\}$ for $u\in M(P)$ and $x\in P\cap\Z^4$. We distinguish three cases: $M(P)$ contains a basis of $\Z^4$ (Case~I); $r(P)=4$ but $M(P)$ contains no basis (Case~II); $r(P)\le3$ (Case~III). Figure~\ref{fig:cases} shows how each case is settled. \begin{figure}[ht] \centering \begin{tikzpicture}[font=\fontsize{9}{11}\selectfont,box/.style={draw,rounded corners,align=flush center,inner sep=3pt,text width=3.1cm,anchor=north},hand/.style={fill=blue!12},comp/.style={fill=orange!18},>=stealth] \node[box,text width=1.6cm] (root) at (0,0) {$P\in\W^4$}; \node[box,hand,text width=2.2cm] (few) at (-6.0,-0.9) {$G\le29$:\\ Lemma~\ref{lem:few}}; \node[box,comp] (one) at (-2.4,-0.9) {$G\ge31$, Case~I:\\ $M(P)$ has a basis;\\ $P$ equivalent to a\\ polytope in $C_4$\\ $\to$ Computation~\ref{comp:cube}}; \node[box,comp] (two) at (1.4,-0.9) {$G\ge31$, Case~II:\\ $r(P)=4$, no basis;\\ index-$2$ sublattice\\ $\to$ Computations~\ref{comp:index}, \ref{comp:index2}}; \node[box,comp] (three) at (5.2,-0.9) {$G\ge31$, Case~III:\\ $r(P)\le3$;\\ $39$ classes of\\ frame lattices\\ $\to$ Computations~\ref{comp:lattices}, \ref{comp:frame}}; \foreach \t in {few,one,two,three} \draw[->] (root) -- (\t.north); \end{tikzpicture} \caption{The proof of Theorem~\ref{thm:four} splits $\W^4$ into four parts. Polytopes with at most $29$ lattice points are handled by Lemma~\ref{lem:few} (the blue box, on the left); for the others (the three orange boxes), the integer functionals bounded by $1$ in absolute value on $P$ decide which finite enumeration of Section~\ref{sec:computations} contains $P$, up to isomorphism (Section~\ref{sec:prelim}). The frame lattices are defined after Lemma~\ref{lem:frame}.}\label{fig:cases} \end{figure} \subsection{Case I} For a lattice $\Gamma$, a set $S\subseteq\Gamma$ is called \emph{$\Gamma$-saturated} if $\conv S\cap\Gamma=S$; when the lattice is clear, we say \emph{saturated}. If $M(P)$ contains a basis $u_1,\dots,u_4$ of $\Z^4$, let $U\in\GL_4(\Z)$ have rows $u_i$. Then $UP\subset C_4$, so $UP=\conv S$ for the set $S=UP\cap\Z^4\subset\{-1,0,1\}^4$, which is symmetric and saturated. \subsection{Case II} Let $r(P)=4$, and let $u_1,\dots,u_4\in M(P)$ be linearly independent, with $U$ the matrix of rows $u_i$ and $d=|\det U|$. Then $d\ge2$, since otherwise $M(P)$ would contain a basis. The map $x\mapsto Ux$ carries $\Z^4$ onto the sublattice $\Gamma=U\Z^4$ of index $d$ and carries $P$ into $C_4$; so $(P,\Z^4)$ is isomorphic to $(UP,\Gamma)$, $UP\in\W^4_\Gamma$, $L_{UP,\Gamma}=L_P$, and $UP=\conv S$ for the $\Gamma$-saturated symmetric set $S=UP\cap\Gamma\subset\Gamma\cap\{-1,0,1\}^4$. In particular \[ 31\le G(P)\le\#(\Gamma\cap\{-1,0,1\}^4). \] Moreover $d\le16$: the set $S$ spans $\R^4$, so it contains four linearly independent points of $\Gamma\cap\{-1,0,1\}^4$; their determinant is a nonzero multiple of $d$, and it is at most $16$ in absolute value by Hadamard's inequality. The sublattices of index $2$ are $\Gamma_I=\{x:\sum_{i\in I}x_i\text{ even}\}$ for nonempty $I\subseteq\{1,2,3,4\}$. A point of $\{-1,0,1\}^4$ lies in $\Gamma_I$ exactly when an even number of its coordinates in $I$ are nonzero, so \[ \#(\Gamma_I\cap\{-1,0,1\}^4)=3^{4-m}\cdot\frac{3^m+(-1)^m}{2}=27,\ 45,\ 39,\ 41\qquad(m=|I|=1,2,3,4). \] Computation~\ref{comp:index} shows that a sublattice of index $3\le d\le16$ contains at most $27$ points of $\{-1,0,1\}^4$ whenever these points span $\R^4$. Since $27<31$, in Case~II we have $d=2$ and $\Gamma=\Gamma_I$ with $|I|\in\{2,3,4\}$. \subsection{Case III: the frame} Now let $r(P)\le3$. Choose lattice points $v_1,\dots,v_4$ of $P$ for which $D=|\det(v_1,\dots,v_4)|$ is as large as possible, and let $V$ be the matrix with columns $v_i$. We call $(v_1,\dots,v_4)$ a \emph{frame} of $P$. Since $P$ spans $\R^4$, $D\ge1$. The map $x\mapsto V^{-1}x$ carries $\Z^4$ onto the lattice $\Lambda=V^{-1}\Z^4\supseteq\Z^4$, of index $D$ over $\Z^4$, and carries $P\cap\Z^4$ onto a set $S$. \begin{lemma}\label{lem:frame} In this situation: \begin{enumerate} \item $S\subset\Lambda\cap C_4$, $S=-S$, and $S$ contains the unit vectors $\pm e_1,\dots,\pm e_4$; \item $|\det(s_1,\dots,s_4)|\le1$ for all $s_1,\dots,s_4\in S$; \item $\conv S\cap\Lambda=S$ and $\inter(\conv S)\cap\Lambda=\{0\}$; \item $\Lambda$ contains no point $c\ne0$ with $|c_1|+\dots+|c_4|<1$; \item $D\le23$. \end{enumerate} \end{lemma} \begin{proof} For $x_1,\dots,x_4\in P\cap\Z^4$ we have $|\det(V^{-1}x_1,\dots,V^{-1}x_4)|=|\det(x_1,\dots,x_4)|/D\le1$ by the choice of $v_1,\dots,v_4$, which gives (ii). For (i), write a lattice point $x$ of $P$ as $x=\sum c_iv_i$; by Cramer's rule $|c_i|=|\det(v_1,\dots,x,\dots,v_4)|/D\le1$. Property (iii) holds because $x\mapsto V^{-1}x$ carries $\conv(P\cap\Z^4)\cap\Z^4=P\cap\Z^4$ and $\inter P\cap\Z^4=\{0\}$ to the corresponding statements for $S$ and $\Lambda$. For (iv), the open cross-polytope $\{c:|c_1|+\dots+|c_4|<1\}$ lies in the interior of $\conv\{\pm e_i\}\subseteq\conv S$, so by (iii) its only point of $\Lambda$ is $0$. For (v), $P$ contains the cross-polytope $\conv\{\pm v_i\}$ of volume $\frac{2^4}{4!}D=\frac23D$, and $\vol(P)\le16$, so $D\le24$. If $D=24$, then $P=\conv\{\pm v_i\}$ and $\vol P=16$. The translates $\frac12P+z$, $z\in\Z^4$, have disjoint interiors (an overlap would put a nonzero lattice point in $\inter P$) and total density $\vol(\frac12P)=1$, so they tile $\R^4$: the union of the translates is closed, and its complement is open, invariant under $\Z^4$ and of density $0$; a nonempty such set would contain a ball and all its $\Z^4$-translates, hence have positive density. A convex polytope that tiles space by lattice translations has centrally symmetric facets (Minkowski~\cite{Min97}; see Venkov~\cite{Ven54} and McMullen~\cite{McM80}), but the facets of a cross-polytope are tetrahedra. So $D\le23$. \end{proof} Let $\Lf$ be the set of lattices $\Lambda\supseteq\Z^4$ of index at most $23$ over $\Z^4$ that satisfy (iv); a lattice of index $D$ over $\Z^4$ lies in $\frac1D\Z^4$, so $\Lf$ is finite. We call the lattices in $\Lf$ the \emph{frame lattices}. For $\Lambda\in\Lf$ let $\A(\Lambda)$ be the family of sets $S$ satisfying (i)--(iii). The signed permutation matrices act on $\Lf$, and Computation~\ref{comp:lattices} shows that $\Lf$ consists of $39$ orbits; we fix one representative in each. Integer functionals transfer as well. For a set $S\subset\Lambda$ let $M(S)=\{w\in\Lambda^*:|\langle w,s\rangle|\le1\text{ for }s\in S\}$ and $r(S)=\dim\operatorname{span}M(S)$. Since $\langle u,Vs\rangle=\langle V^{\mathsf T}u,s\rangle$ and $V^{\mathsf T}\Z^4=\Lambda^*$, a vector $u\in\Z^4$ lies in $M(P)$ if and only if $V^{\mathsf T}u$ lies in $M(S)$; so $r(P)=r(S)$. In Case~III we therefore have a lattice $\Lambda$ among the $39$ representatives and a set $S\in\A(\Lambda)$ with $\#S\ge31$ and $r(S)\le3$ such that $(P,\Z^4)$ is isomorphic to $(\conv S,\Lambda)$ (by $x\mapsto V^{-1}x$, followed by a signed permutation of the coordinates); in particular $L_{\conv S,\Lambda}=L_P$. Lemma~\ref{lem:frame} does not use $r(P)\le3$, so this reduction applies to every $P\in\W^4$. We use it only in Case~III, where the condition $r(S)\le3$ shortens the search of Computation~\ref{comp:frame}; the polytopes with $r(P)=4$ are listed directly, in Cases~I and~II. \section{The computations}\label{sec:computations} All enumerations below are exhaustive and use exact integer and rational arithmetic; the repository~\cite{Repo} contains the programs and, for each computation, its output. Computations~\ref{comp:cube}, \ref{comp:index2} and~\ref{comp:frame} list sets of lattice points up to the symmetries named. For each set $S$ the Ehrhart polynomial of $\conv S$ is computed exactly: in Computations~\ref{comp:cube} and~\ref{comp:index2} from $G=\#S$ and the volume and the lattice surface area of $\conv S$ (taken from a triangulation of its boundary), by Lemma~\ref{lem:identities}, (E1) and (E3); in Computation~\ref{comp:frame} from the numbers of lattice points of $k\conv S$ for $k=1,2,3$ and of the interior of $k\conv S$ for $k=1,2$, which give its values at $k=-2,\dots,3$ by (E1) and (E2) and so determine it. Figure~\ref{fig:maxg1} shows, for each $G\ge31$, the largest value of $g_1$ in Case~I (Computation~\ref{comp:cube}) and the three equality cases of Theorem~\ref{thm:equality}, and, for $G\le29$, the bound on $g_1$ stated after the proof of Lemma~\ref{lem:few}.\begin{figure}[ht] \centering \begin{tikzpicture}[x=0.13cm,y=0.85cm,font=\footnotesize] \fill[blue!12] (9,2.5) rectangle (29,8.7); \node at (19,8.45) {$G\le29$}; \draw[->] (9,2.5) -- (86,2.5) node[right] {$G$}; \draw[->] (9,2.5) -- (9,8.9) node[left] {$g_1$}; \foreach \g in {9,19,29,39,49,59,69,79} \draw (\g,2.5) -- (\g,2.4) node[below] {$\g$}; \foreach \v in {3,4,5,6,7,8} \draw (9,\v) -- (8.4,\v) node[left] {$\v$}; \draw[red!70!black,dashed] (9,8) -- (84,8); \draw[blue!70!black,thick] (9,{34/12}) -- (29,{94/12}); \node[blue!70!black] at (20,3.35) {$g_1\le\frac{3G+7}{12}$}; \foreach \g/\v in {81/8.0000, 79/7.5000, 77/7.0000, 75/7.3333, 73/6.8333, 71/7.0000, 69/6.8333, 67/6.6667, 65/6.6667, 63/7.0000, 61/6.5000, 59/6.5000, 57/6.6667, 55/6.3333, 53/6.0000, 51/6.3333, 49/6.0000, 47/5.8333, 45/6.0000, 43/6.0000, 41/5.8333, 39/5.6667, 37/6.0000, 35/5.8333, 33/5.6667, 31/5.6667} \fill[black!45] (\g,{\v}) circle (1.3pt); \fill[green!55!black] (49,8) circle (3.2pt) node[above=2pt] {$T$}; \fill[green!55!black] (33,8) circle (3.2pt) node[above=2pt] {$X$}; \fill[green!55!black] (81,8) circle (3.2pt) node[above=2pt] {$C_4$}; \end{tikzpicture} \caption{The largest values of $g_1$ in Case~I, and the three equality cases of Theorem~\ref{thm:equality}, against the number $G$ of lattice points. The small grey dots show, for each odd $G\ge31$, the largest value of $g_1$ in Case~I (Computation~\ref{comp:cube}). The three larger green dots mark the polytopes $C_4$, $T$ and $X$ of Theorem~\ref{thm:equality}: $C_4$ belongs to Case~I, and $T$ and $X$ belong to Case~III. For Cases~II and~III only the largest value of $g_1$ over all $G$ is recorded: at most $6$ in Case~II (Computation~\ref{comp:index2}), and at most $8$ in Case~III, attained only by $T$ and $X$ (Computation~\ref{comp:frame}). The dashed line is $g_1=8$. In the shaded region $G\le29$, the solid line is the bound $g_1\le\frac{3G+7}{12}$ stated after the proof of Lemma~\ref{lem:few}.}\label{fig:maxg1} \end{figure} Computations~\ref{comp:cube} and~\ref{comp:index2} walk downward from the full set, $\{-1,0,1\}^4$ or $\Gamma_I\cap\{-1,0,1\}^4$, deleting one pair of opposite vertices at a time. By the next lemma, such a walk reaches every saturated symmetric subset of the full set. Sets that a symmetry carries onto each other form a class, and the walk keeps one set of each class; classes are recognized by a canonical form, the least image of the set under the symmetry group in a fixed total order. This loses no class: a symmetry $\gamma$ maps saturated symmetric sets to saturated symmetric sets and the vertices of $\conv Q$ to those of $\conv\gamma Q$, so the sets obtained from $\gamma Q$ by deleting a pair of opposite vertices are the images under $\gamma$ of those obtained from $Q$. Computation~\ref{comp:frame} uses a different method, a sandwich search, described after its statement. \begin{lemma}\label{lem:walk} Let $\Lambda$ be a lattice and $Q\subset\Lambda$ a finite symmetric set with $\conv Q\cap\Lambda=Q$. \begin{enumerate} \item If $v$ is a vertex of $\conv Q$, then $Q'=Q\setminus\{v,-v\}$ is symmetric and satisfies $\conv Q'\cap\Lambda=Q'$. \item If $S\subsetneq Q$ is symmetric with $\conv S\cap\Lambda=S$, then some vertex $v$ of $\conv Q$ is not in $S$, and $S\subseteq Q\setminus\{v,-v\}$. \end{enumerate} \end{lemma} \begin{proof} (i) Since $v$ is a vertex, $v\notin\conv(Q\setminus\{v\})\supseteq\conv Q'$, and by symmetry $-v\notin\conv Q'$; as $\conv Q'\cap\Lambda\subseteq Q$, it equals $Q'$. (ii) If every vertex of $\conv Q$ were in $S$, then $Q=\conv Q\cap\Lambda\subseteq\conv S\cap\Lambda=S$. A vertex $v\notin S$ has $-v\notin S$ by symmetry. \end{proof} So every saturated symmetric $S\subseteq Q$ is reached from $Q$ through saturated symmetric sets that contain $S$; in particular a search that stops at $31$ points misses no set with at least $31$ points. \begin{computation}\label{comp:cube} \emph{Case~I.} We list all symmetric sets $S\subseteq\{-1,0,1\}^4$ with $\conv S\cap\Z^4=S$ and $\#S\ge31$, up to the $384$ signed permutations of the coordinates. Each such $S$ spans $\R^4$ (a hyperplane through $0$ contains at most $27$ points of $\{-1,0,1\}^4$, since on it one coordinate is determined by the other three), so $\conv S\in\W^4$ by Lemma~\ref{lem:member}. There are $2{,}547{,}694$ classes; for all of them the linear coefficient $g_1$ of $\conv S$ is at most $8$, with equality only for $S=\{-1,0,1\}^4$. \end{computation} \begin{computation}\label{comp:index} \emph{Index bound.} We list every sublattice $\Gamma\subset\Z^4$ of index $d$ with $2\le d\le16$ once, as $\Gamma=B\Z^4$ with $B$ in Hermite normal form under column operations ($B\mapsto BU$); there are $40{,}406$ of them. For each $\Gamma$ whose points in $\{-1,0,1\}^4$ span $\R^4$ we count these points. The maximum is $45$ for $d=2$, and it is at most $27$ for every $d\ge3$. \end{computation} \begin{computation}\label{comp:index2} \emph{Case~II.} A permutation of coordinates carries $\Gamma_I$ onto $\Gamma_J$ when $|I|=|J|$, so it suffices to take $\Gamma_m=\Gamma_{\{1,\dots,m\}}=\{x:x_1+\dots+x_m\text{ even}\}$ for $m=2,3,4$. For each of these three lattices we list all $\Gamma_m$-saturated symmetric sets $S\subseteq\Gamma_m\cap\{-1,0,1\}^4$ that span $\R^4$ and have $\#S\ge31$, up to the signed permutations that preserve $\Gamma_m$; each such $\conv S$ lies in $\W^4_{\Gamma_m}$ (see the paragraph after Lemma~\ref{lem:member}). There are $531$, $58$ and $27$ classes for $m=2$, $3$, $4$, and for all of them the linear coefficient $g_1$ of $\conv S$ with respect to $\Gamma_m$ is at most $6$. \end{computation} \begin{computation}\label{comp:lattices} \emph{The frame lattices.} We list all lattices in $\Lf$. For $U\in\GL_4(\Z)$ the frame matrices $V$ and $UV$ give the same lattice $\Lambda=V^{-1}\Z^4$, so it suffices to take $V$ in Hermite normal form under row operations ($V\mapsto UV$), with determinant $D\le23$, and to keep the lattices $\Lambda$ that satisfy (iv). There are $1{,}040$ frame lattices, in $39$ orbits under signed permutations, with indices $D\in\{1,\dots,10,12,16,18\}$. \end{computation} \begin{computation}\label{comp:frame} \emph{Case~III.} For each of the $39$ representatives $\Lambda$ we list all $S\in\A(\Lambda)$ with $\#S\ge31$ and $r(S)\le3$, up to the signed permutations that preserve $\Lambda$. There are $588{,}592$ classes; for all of them the linear coefficient $g_1$ of $\conv S$ with respect to $\Lambda$ is at most $8$, with equality for exactly two of them, one with $G=49$ and one with $G=33$. The search follows \cite[Algorithm~1]{AS24}. It keeps a lower set $S^-\in\A(\Lambda)$ and an upper set $S^+\supseteq S^-$, and it starts from $S^-=\conv\{\pm e_1,\dots,\pm e_4\}\cap\Lambda$ and $S^+=\Lambda\cap C_4$. Every member of $\A(\Lambda)$ lies between these two sets: it lies in $S^+$ by (i), and it contains $S^-$ by (i) and (iii). The set $S^-$ is itself a member: its points $c$ have $|c_1|+\dots+|c_4|\le1$, so (ii) holds by Hadamard's inequality and (iii) by (iv). For a pair $\pm v$ in $S^+\setminus S^-$ the search branches: either $\pm v$ is excluded and $S^+$ is replaced by $S^+\setminus\{\pm v\}$, or $\pm v$ is included and $S^-$ is replaced by $\conv(S^-\cup\{\pm v\})\cap\Lambda$; every saturated set between $S^-$ and $S^+$ lies in exactly one branch. An include branch is abandoned when the new $S^-$ is not contained in $S^+$, violates (ii), or has a nonzero point of $\Lambda$ in the interior of its convex hull, since then no set in the branch satisfies (i)--(iii). A pair $\pm y$ in $S^+$ for which $S^-\cup\{\pm y\}$ violates (ii) is removed from $S^+$, since no member contains it together with $S^-$. A branch is abandoned when $\#S^+<31$ or $r(S^+)=4$; the second rule uses that $M$ reverses inclusion, that is, $M(Q')\subseteq M(Q)$ whenever $Q\subseteq Q'$, so that every subset of a set $Q'$ with $r(Q')=4$ also has $r=4$. The search stops at the pairs $(S^-,S^+)$ with $S^-=S^+$. Each include step keeps $S^-$ in $\A(\Lambda)$, so these sets are members, and they are the sets found. A pair $(S^-,S^+)$ that a signed permutation preserving $\Lambda$ carries onto a pair met earlier in the search is discarded, since the permutation carries the sets between the two pairs onto each other; the sets found are then reduced to one of each class by the canonical form described before Lemma~\ref{lem:walk}. \end{computation} \begin{proof}[Proof of Theorem~\ref{thm:four}] Let $P\in\W^4$. If $G(P)\le29$, Lemma~\ref{lem:few} gives $g_1(P)<8$. If $G(P)\ge31$, then by Section~\ref{sec:cases} the pair $(P,\Z^4)$ is isomorphic to $(\conv S,\Lambda_S)$ for a set $S$ listed in Computation~\ref{comp:cube} (Case~I), in Computation~\ref{comp:index2} (Case~II, using Computation~\ref{comp:index}), or in Computation~\ref{comp:frame} (Case~III, using Computation~\ref{comp:lattices}), where $\Lambda_S$ is the lattice of that computation ($\Z^4$, $\Gamma_m$ or a frame lattice); so $L_P=L_{\conv S,\Lambda_S}$. In each list $g_1\le8$. Hence $g_1(P)\le8$, and Proposition~\ref{prop:reduction} gives $g_2(P)\le24$. \end{proof} \section{The equality cases}\label{sec:equality} Let $T\subset\R^4$ be the convex hull of the $24$ points $\pm f_a\pm f_b$, $1\le a