I am studying convex optimization right now, and the text book claims that a second order cone is a collection of intersections of half space
$$K_n = \bigcap_{ u:\|u\|_2 \leq 1} \{(x,y) \in R^{n+1 } \::\:\: y \geq u^Tx\}$$
I am interested in seeing a proof for the statement, how would I justify the claim?
The key to your formula is $$\|x\| = \sup_{\|u\|_2\le1} u^\top x.$$ This should help showing the equality above.