Worth emphasis: we can give a simple more concrete (high-school level) proof of the key Theorem in the accepted answer as follows. First note that we can represent algebraic integers as eigenvalues of square-integer matrices. Such matrices have monic integral characteristic polynomials, so their eigenvalues are algebraic integers. Conversely, $\alpha\,$ is an eigenvalue of its companion matrix, i.e. the matrix of the linear map $\,x\mapsto \alpha x\,$ on $\,\Bbb Z[1,\alpha,\ldots\,\alpha^{n-1}].\,$
Now in $\,\Bbb Z[1,\alpha,\ldots,\alpha^{n-1}]\!\times\! [1,\beta,\ldots,\beta^{k-1}]=\Bbb Z[\alpha^i\beta^j],\,$ $\, i<n,\,j<k,\,$ with basis $\,{\bf v} = [\alpha^i\beta^j],\,$ we can construct $\,nk \times nk\,$ matrices $\,L,M\,$ such that $\, \alpha {\bf v} = L{\bf v},\ \beta {\bf v} = M{\bf v},\,$ i.e. in the products $\,\alpha^i\beta^j\,$ that occur as entries in $\,\alpha\bf v\,$ and $\,\beta\bf v, \,$ use the (minimal) polynomials of $\,\alpha\,$ and $\,\beta\,$ to rewrite $\,\alpha^n\,$ and $\,\beta^k\,$ into polynomials in lower powers of $\,\alpha\,$ and $\,\beta.\,$ Therefore
$$\begin{eqnarray}
(L+M){\bf v} &=& L{\bf v} + M{\bf v} = \alpha{\bf v} + \beta{\bf v} = (\alpha+\beta){\bf v}\\[.5em]
(LM){\bf v} &=& L(M{\bf v}) = L(\beta{\bf v}) = \beta(L{\bf v}) = \beta\alpha {\bf v}\\
\end{eqnarray}$$
Hence, being eigenvalues of square integer matrices, $\,\alpha+\beta\,$ and $\,\alpha\beta\,$ are algebraic integers.
Algebraic integers are closed under sums and products, so the sought result follows immediately, since polynomials $\in\Bbb Z[\alpha]\,$ are compositions of sums and products of algebraic integers.