# Convex Polytope closedness

1. Sep 22, 2011

### zcd

1. The problem statement, all variables and given/known data
Prove that every convex polytope is convex and closed.

2. Relevant equations
$$C=\{ \sum_{j=1}^n x_j a^j | x_j \geq 0, \sum_{j=1}^n x_j = 1\}$$ is a convex polytope

3. The attempt at a solution
I've already proven the convexity portion. To prove C is closed, I let $\{ b^N \}_{N=1}^\infty \subseteq C$ and assumed $\lim_{N\to\infty} b^N = b$.
$b=\sum_{j=1}^n x_j a^j$, so I have to show $\lim_{N\to\infty} x^N = x$.

I started with $x_j \geq 0, \sum_{j=1}^n x_j = 1\$ means $|x^N| \leq 1$ and the sequence $\{ x^N \}_{N=1}^\infty$ is a bounded sequence. From here, I can use the Bolzano-Weierstrass theorem to show that there exists a subsequence that converges. From here, I'm unsure of what to do because the subsequence converges to some value which may or may not be the right value

2. Sep 23, 2011

### Office_Shredder

Staff Emeritus
You know that the whole sequence converges to b, so every subsequence converges to b as well.