Probability simplex (${\Delta }_n=\{x\in {\mathbb{R}}^n:x\ge 0,1^{T}x=1\}$)

The probability simplex consists of vectors of nonnegative weights summing to one. It is the convex hull of the coordinate vectors. A linear function $r^{T}x$ has maximum ${\max }_i{r}_i$ on this simplex; equality holds exactly when the weights are supported on maximizing indices.

On the probability simplex, ${\sum }_i{x}_i=1$. The Cauchy-Schwarz inequality gives $1\le \sqrt{n}\Vert x\Vert$, with equality only when all coordinates are equal. Thus the displayed centroid is the unique closest point to the origin. It is also equidistant from all coordinate vertices, since $\Vert x-e_i{\Vert }^2=\Vert x{\Vert }^2-2x_i+1$.