Huisken and Sinestrari 1999, pt. 4
So I think I figured out basically what’s going on with those cones . We needed them to be convex, so we could apply Hamilton’s maximum principle for systems.
Recall that the elementary symmetric polynomials on are defined by
If we let denote the polynomial formed by omitting from
without the terms involving
. It’s immediate that
Recall also the cones . We have
.
We’re going to prove
Theorem. are convex.
Proof. We’ll proceed by induction. The base case, , is clear, since
is a half-space.
Now suppose that is convex. Consider the functions on
,
,
. In fact,
, i.e.
is the epigraph of
.
Since we’ve assumed is convex, this means that convexity of
is equivalent to
, where
.
The relation implies
and
Dividing this last identity through by , we have
So that the function , whose concavity we’d like to establish, can be written in terms of the functions
.
Now , where the bar means setting the ith component to zero. It’s easy to check that
, and by our inductive hypothesis, every second derivative of
is nonpositive on this set. So we have
, i.e.
is concave on
.
The claim is now that the concavity of implies the concavity of
. This follows from a computation, but you can kind of see what’s going on by noting that
and
are degree-1 rational functions with nonpositive second derivatives.
Consider the 1-dimensional case. A degree-1 rational function is one which is asymptotic to a line; the nonpositive second derivative means the graph of
lies above the graph of the line. For example, let’s let
Then is asymptotic to the line
, but since
, we have that the second derivative is nonpositive everywhere. Here’s the graph of
:
Now consider what happens when we take the function , analogous to
. In our example, we have
. This function, you may notice, is also asymptotic to
, but it’s asymptotic to it from below, and its second derivative is nonnegative.
But the function we’re interested in is . Actually we’re interested in its second derivative, which means the linear term
doesn’t matter, so we can discard it, and consider
, which is analogous to
, whose graph looks like
The relevant fact about this graph is that it has the same concavity as the original !
So concavity of , which we have by the inductive hypothesis that
is convex, is enough to show that each
is concave, hence
is the sum of concave functions, hence itself concave. But this implies
is convex, which completes the induction.


