Let X be a normed space and $A,B \subset X$.
I need to prove that if $A$ and $B$ are compact and convex then $conv(A \cup B)$ is compact. (Here $conv(A \cup B)$ is the convex hull of $A \cup B$)
If $U_{i \in I}$ is a finite cover for $A$ and $V_{j \in J}$ is a finite cover for $B$, how do I cover the elements of $z \in conv(A \cup B)$ such that $z \notin A$ and $z \notin B$?
I tought to pick one element of each $U_{i}$ and $V_{j}$ and for each pair $(u_{i},v_{j})$, the number of pairs $(u_{i},v_{j})$ is finite, create a line segment. Then at each midpoint create an open ball that covers the entire line. But I can't prove that this will cover all that points in the convex hull and I think that this will not be the right path.
I think you can consider the function $f : A \times B \times [0,1] \rightarrow \mathrm{Conv}(A \cup B)$ defined by $$\forall (a,b,t) \in A \times B \times [0,1], \quad f(a,b,t)=ta+(1-t)b$$
I think that $f$ is surjective (because $A$ and $B$ are convex), and that it is continuous on the compact $A \times B \times [0,1]$ (for the natural topology), so its image is compact.