Past exam of the computer science course of the University of Oxford / 2019 / Algorithms / 2 / a / i / Solution

Take $u,v\in P$ and $0\le \lambda \le 1$. Their convex combination satisfiesThus every such convex combination remains in $P$, so $P$ is a convex set. The assertion also holds when $P$ is empty.