Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
Proof.
All statements follow easily from the definition of
. Namely, the cells correspond to the subsets : the corresponding linear functions
, saturate the maximum in .
Since is a concave function this can happen only
if is a set of vertices of some simplex
. This proves (1).
For (3) we notice that a -cell is a domain of linearity of
, labeled by the vertex whose
corresponding linear
function is maximal. In particular,
the central cell is the set of , such that
the maximum is achieved by , i.e.
|
|
|
which are exactly the defining inequalities for .
More generally, a point is in (the closure of)
if and only if:
|
|
|
|
|
|
which are exactly the defining inequalities for the polyhedron
.
∎