Proof. [00Q8]
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.
(Sketch) For any fixed , the function is a concave function of . By our assumptions, the set of saturating the maximum must be the set of vertices of some simplex in the triangulation of . A more effective version of this observation is the Lemma in the case, and the case follows by Prop. 3.2. ∎