Lemma 3.4. There is a fixed number , such that for and any (or ), there is a simplex in the triangulation of , verifying for .
Verified tagged author-source HTML · 1912.02360v1 · cited publication edition alignment unverified.
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. ∎