supremum of an array of a convex functions If $\{J_n\}$ is an array of a convex functions on a convex set $U$ and $G(u)=\sup J_i(u), u\in U$, how to show that $G(u)$ is convex too?  
I've done this, but I am not sure about properties of a supremum.  
Since $U$ is convex, $\alpha x +(1-\alpha) y)\in U$ for all $x,y\in U$.
If $G$ is convex, than it would be $G(\alpha x +(1-\alpha) y)\leq \alpha G(x)+(1-\alpha) G(y)$ i.e. $\sup J_i(\alpha x +(1-\alpha) y)\leq \alpha \sup J_i(x)+(1-\alpha) \sup J_i(y)$.  
So, I've done this  
$G(\alpha x +(1-\alpha) y)=\sup J_i(\alpha x +(1-\alpha) y)\leq sup \{\alpha J_i(x)+(1-\alpha)J_i(y)\}\leq \alpha \sup J_i(x)+(1-\alpha) \sup J_i(y)=\alpha G(x)+(1-\alpha) G(y)$.  
Is this ok?

It seems that you assume that your $J_n$ are convex real-valued functions. One can prove that their pointwise supremum is a convex without assuming that the common domain $U$ is convex, or even that the set of indices $n$ is finite.
A function $J_n$ is convex iff its epigraph is a convex set. The epigraph of the supremum $G=sup_n J_n$ is precisely the intersection of the epigraphs of the $J_n$'s. But an intersection of (an arbitrary number of) convex sets is convex, from which it follows that $G$ is convex.
