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. It is, in my opinion, 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). Once you have that, it is toute simple… A spectral trick of Ivan applies, and you get what you want. The main optimization lies in the object we contract to, that is where it gets a bit more technical (that and nonsimple polytopes).
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 INVINCIBLE. No, 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
Homogeneity and translation invariance give two identities. Since ,
Translating by
replaces
by
, without changing its volume. Differentiating this invariance gives
The remaining ingredient is
where denotes the ordering of symmetric matrices by positive semide finiteness.
Here is a direct derivation. The Brunn–Minkowski inequality says
for convex bodies and
. Since
the function is concave. Its Hessian at
is therefore nonpositive:
Substituting and dividing by
proves (9).
A lemma
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.
Proof. First consider interior . For any configuration
, let
Expanding squared edge lengths and using (7) gives
By (9),
For the original configuration , equations (4) and (8) give equality:
Consequently,
This proves (10), including strictness because all edge weights are positive.
We also need the assertion on a proper face, without assumptions on edges outside that face. For each vertex , choose a linear functional
uniquely maximized at
. Equations (7)–(8) imply
The differences on the left are strictly positive. It follows, uniformly for interior , that
Thus, as interior points approach a boundary point , the matrices have a convergent subsequence. By (5), every limiting row and column indexed outside the minimal face
vanishes.
All identities and inequalities (7)–(12) persist in the limit. The limiting edge sum involves only edges of , so the same proof establishes (10) on
. 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
.
Normalize
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.
A little technical stuff here
Take an admissible of separation
, and suppose, toward a contradiction, that
Translate so that
, and put
Write
The edge graph of is the facet-adjacency graph of
, and its angular edge lengths are
.
Each facet maps entirely into at least one cubical facet. Choose one such facet
, and label
by
. The labels on a proper face
contain no opposite pair: the corresponding facets
of
have a common point, whose image would otherwise have to lie in two opposite cubical facets.
Therefore
takes values in the boundary of the crosspolytope
because there is no cancellation among opposite labels:
We need
Here is the topological identification explicitly. For a nonempty proper face , let
where denotes the selected cubical facet. Then
. Moreover,
implies
.
Recall that the barycentric subdivision of a polytope boundary has a vertex for each nonempty proper face
, and a simplex for each chain of such faces. Thus the assignment
extends simplicially. It is homotopic to : on every subdivision simplex, the straight homotopy stays inside the cube face associated with its largest face.
Polarity reverses face inclusion and therefore induces simplicial homeomorphisms between the barycentric subdivisions of , and likewise of
. After these identifications, the preceding map sends
This map and are homotopic within those same crosspolytope faces, using the face-support property (5). Their degrees consequently agree up to the signs of the two duality homeomorphisms. Since
, equation (18) follows.
Next construct slowly varying vectors . Set
Distance to a set is 1-Lipschitz, so
The separation assumption also gives
In particular,
The contraction (finally)
Define
This is the useful polar rescaling: change directions while retaining the original radii .
For an edge , equations (15) and (20), together with
, give
since and
. Keeping the radii fixed turns strict angular contraction into strict Euclidean edge contraction:
Indeed, for unit vectors ,
The comparison lemma therefore says that
never vanishes on . Thus
To contradict this, we must relate its boundary degree to (18). 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 localized comparison lemma to
It follows that
The homotopy is continuous. Active terms have nonzero arguments by (25). When a term becomes inactive, its norm is bounded by , which tends to zero.
At , we have
. As
, positive homogeneity of
gives
The convergence is uniform: by (17),
so the arguments remain uniformly away from zero for large
.
Thus (24) extends to a nonvanishing homotopy with the endpoint in (27). Its scalar factor is positive, and
is a homeomorphism: invert the coordinatewise power and then normalize in .
It follows from (18) that
contradicting (23). Therefore is impossible.
Optimize
We have proved, for every ,
Since
the minimizing exponent is
For , this yields
and hence (2).
Finally, let be the minimum complementary dihedral angle, and let
be the shortest-path metric on the same facet-adjacency graph with every edge assigned length one. Define
using the same admissible maps, but measuring their separations with
.
Every angular edge length is at least , so
Taking separations and then suprema gives
Therefore
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.