@@ -1019,13 +1019,9 @@ Suppose we are $m$ steps through this algorithm and we are considering the inter
\begin{lemma}
Suppose the $m$--face of $X$ between the set of $m+1$ vertices $\Set{\vec{x}_i}{i \in J}$ intersects the $(n-m)$--hyperplane defined as the intersection of the $m$ hyperplanes $\Set{P_\gamma}{\gamma\in\Gamma}$.
Denote this intersection as $\vec{h}(J | \Gamma)$.
If $0\notin\Gamma$ then % now that 1-x = x * e0 the separation of cases is completely unnecessary
Note that the $(n-m)$--face of $Y$ on the intersection of $\Set{P_\gamma}{\gamma\in\Gamma}$ is on the positive side of the remaining planes $\Set{P_\eta}{\eta\notin\Gamma}$.