I recently reported about a polyhedral proof of Stoker’s theorem using a lemma of Martin Winter; this, in turn, uses technique by Izmestiev.
I wanted to take a brief moment to illustrate that technique; Gromov, a few years ago, published a marvelous little paper. He used differential geometry techniques to show that a polytope cannot be too long in every direction. Specifically: Consider P a d-dimensional polytope, and map it cellularly to a d-cube C. Pick two opposing facets ,
of that d-cube. Their preimages in P are d-1-disks.
Nice enough. Now, try to go from the preimage of to the preimage of
. If you go from one facet to an adjacent one in
, then you “pay” the angle between their normals. All together, the optimal way you can take gives a minimal angular distance between the preimage of
to the preimage of
in
; it describes how far the two preimages are apart.
Now, it would be nice, and perhaps point towards the polynomial Hirsch conjecture, if we could say something about this distance. But Gromov says: geometry naturally gives something different: If I minimize over ALL the opposing pairs of facets of , then I obtain
, the angular spread… it describes the question whether P is long in every direction. Gromov’s paper obtains a displayed
bound by passing through smooth mean-curvature geometry [1]. He needs to smoothen the polytope first, and his argument for non-simple polytopes is a bit … fishy. In comes Izmestiev, and I want to illustrate his method here, and improve the bound using it.


The bound obtained here is, for any n-polytope P
In particular, for ,
I should say: Gromov conjectured that one could show a constant bound of . Not sure that is true. But maybe someone can throw LLM on my post and improve the bound… or find a counterexample. That said, this method here is pretty optimized. It is, in my opinion, impressive that such a bound depends on the dimension only.
The trick, in two sentences: Use the cellular map to C to construct a contraction that, in a topological sense, is nicely behaved (it needs, under what is called a Wachspress map, contain the origin in the interior). The trick is to look at the polar, and reassign the vertices to new points
Here D is the angular spread (assume it is HUGE) and measures the angular distance to facets of the cube… And if you think about it, this map can only contract angular distances. Now use the Izmestiev trick is to show that in a polytope, you cannot contract edges if the radial distance of the vertices is the same (or rather, you can, but you cannot envelope the origin: the map must be of degree zero.) Intuitively clear, but maybe nonobvious.
On the other hand, you can also show that this map cannot be of degree 0… because you can homotope it to basically a nice map to the crosspolytope. And voila, you have the contradiction.
Once you have that, it is toute simple… The main optimization lies in the object we contract to, that is where it gets a bit more technical.
(I also messed up the numbering, rearranged after the fact… wordpress doesn’t do it automatically. Apologies… the numbers of equations are not exactly consecutive integers.)
Wachspress coordinates
For the moment, let
be any full-dimensional polytope, and fix . For a convex body
containing the origin in its interior, its polar is
. Take the polar of the translated polytope:
The vertex corresponds to the facet
Define
These are the generalized Wachspress coordinates of with respect to the vertices of
; see §3.3 in [2]. You think probably: barycentric coordinates? Yes. In a way.
Indeed, the pyramids with apex and bases
partition
. Therefore
The outward unit normal of is
. Hence
Dividing by proves
Thus, on a simplex, these are necessarily the ordinary barycentric coordinates.
The functions extend continuously to all of
, including for nonsimple polytopes; see Remark 3.7 [2].
Their face-support property then follows from (4): Suppose that lies in a face
, exposed by
Then
Every summand is nonnegative, so
Given vectors , their Wachspress interpolation is
Note that on a face , the only nonzero coefficients correspond to vertices of
. And that is the key: We can map the polytope to a new world entirely, the face structure is in a way respected… and we can compare the new and old geometry. For this, we need a
comparison inequality
Fix , and abbreviate
. Vary the support parameters of
:
All derivatives below are evaluated at . Write
Moving the -th supporting hyperplane gives
For , the second variation is
Here denotes the edge set of
, and
of a point is one. In particular,
on edges. Slightly nontrivial: these support-volume derivatives exist also at nonsimple polytopes; see §2.3 and Appendix A.3 in [3].
Normalize by
Because of homogeneity, we have
Translating by
replaces
by
, without changing its volume. Differentiating gives
The remaining ingredient we need is
where denotes the ordering of symmetric matrices by positive semide finiteness.
It follows from Brunn–Minkowski: remember
for convex bodies and
. Since
the function is concave. Its Hessian at
is therefore nonpositive:
Substituting and dividing by
proves (9).
A “Izmestiev-Winter lemma” that does a lot
Assume now that .
Lemma. Let , and let
be its minimal face, meaning the unique face whose relative interior contains
. Suppose vectors
, indexed by the vertices of
, satisfy
Then
For , the inequality is strict whenever at least one edge is strictly shortened. This lemma gives some intuition what a Wachspress map does, geometrically.
Proof. Consider interior . For any configuration
, let
Expanding squared edge lengths and using (7) gives
Hence,
For the original configuration , equations (4) and (8) give:
Consequently,
This proves (10), including strictness because all edge weights are positive.
We also need the assertion on a proper face, but this is immediate from limiting and the “face compatibility” observed above. This proves the lemma.
In particular, if a fixed configuration preserves all vertex radii, lengthens no edge, and strictly shortens at least one edge, then its Wachspress map never vanishes on
. On the interior the comparison is strict, while on the boundary
. Its normalized boundary map consequently has degree zero: it extends over the ball
as a map to
.
Take a step back. Have a coffee. Realize you just proved Stoker conjecture.
The rest of the proof a contraction whose boundary degree is nevertheless nonzero.
From the polar to the crosspolytope
Translate so that
, and put
Write
The edge graph of is the facet-adjacency graph of
, and its angular edge lengths are
.
For each facet , let
be the corresponding vertex of
and
the normal. The facet maps entirely into at least one cubical facet. Choose one such facet
, k denoting direction, s the sign, and label
by
; in other words, from the map to the cube, we construct a map to the crosspolytope.
Therefore
takes values in the boundary of the crosspolytope
because there is no cancellation among opposite labels:
We claim
Think about it. It is obvious. But it is not yet the contraction. Still, we have one way to show zero degree, and one to show non-zero degree. We exploit this now.
Distortion
Let me set up a particular parameter family of distortions that we will use.
For , define
and set
Differentiating the normalization and applying Hölder gives
For , the same estimate follows directly from ordinary radial normalization.
Suppose
Along their straight segment,
Integrating (14) along that segment bounds the spherical distance:
Here is geodesic distance on the unit sphere.
Constructing the contra(di)ction
Take an map of angular separation
, and suppose, toward a contradiction, that
We now construct a Wachspress map that is simultaneously a contraction in the sense of the IW lemma, and hence of degree 0… but also homotopic to , and hence not of degree 0.
Let us denote the set of facets whose image lies in
by $latex A_{k,\pm}.
Next construct the target for the Wachspress map (for this, we need the new vertices : We want to relocate the vertices of
to new points
. Set
In other words, we measure the distance of a facet to the facets in the preimage of
.
Distance to a set is 1-Lipschitz, so
The separation assumption also gives
In particular,
Define
where .
For an edge , equations (15) and (20), together with
,
since and
. Keeping the radii fixed turns strict angular contraction into strict Euclidean edge contraction:
The comparison lemma therefore says that
never vanishes on . Hence, remember, the map has degree 0! But wait.
The contradiction
Let’s try to compare the map (as in, homotope) to . Consider
omitting terms with .
Fix , and let
be its minimal face. For any vertex
of
, write
. By (21),
. Because the labels on
contain no opposite pair,
. Consequently,
For fixed , the translation
is common to all the vectors. Hence
Equations (20), (25), and the normalization estimate (15) therefore give exactly the same angular contraction as (22), on every edge of .
Apply the Izmestiev-Winnter lemma to
It follows that
Hence and
have the same nonzero degree. Impossible. Hence
, or more accurately,
.
References
[1] Misha Gromov, Convex Polytopes, Dihedral Angles, Mean Curvature and Scalar Curvature.
[2] Martin Winter, Rigidity, Tensegrity and Reconstruction of Polytopes under Metric Constraints.
[3] Ivan Izmestiev, The Colin de Verdière number and graphs of polytopes.
[4] Martin Winter, Note on Stoker’s conjecture.
[5] Richard J. Gardner, The Brunn–Minkowski inequality.