Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Why is it possible to get any possible subset of nodes of a d+1 simplex in IR^d using halfspaces?

share|cite|improve this question
up vote 2 down vote accepted

For convenience, let the vertices of the simplex be $v_0 = (0,\ldots,0)$ and $v_i$ the vector with $(v_i)_i = 1$ and $(v_i)_j = 0$ otherwise. Let $y$ be a vector with entries in $\{0,1\}$. Then $v_i . y > 1/2$ for those $i \ge 1$ with $y_i = 1$, while $v_i . y < 1/2$ otherwise. Thus any set of vertices will be the set of vertices in either the halfspace $\{x : x . y < 1/2 \}$ or the halfspace $\{x: x . y > 1/2 \}$ (depending on whether the set contains $v_0$) for suitable $y$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.