We know that the set $\mathbb{A}$ of algebraic numbers is a field. But there is a constructive proof of this statement? I.e. : given a sum (or a product) of numbers of the form $\sqrt[n]{q}$ with $ q \in \mathbb{Q}$ we can find a polynomial in $x$, with rational coefficients, that has as solution this sum (or product)? I've find that such a proof can be given using the resultant of the polynomials that have as roots the given numbers, but, as far as I know, the resultant is a number, so how can we find a polynomial?
I would appreciate an example: e.g. how to find the rational polynomial that has root $ \sqrt{2}+\sqrt[3]{3}$.
Hint $ $ Let $\,a=\sqrt2,\,b=\sqrt[3]3.\,$ $\Bbb Q(a,b)\cong \Bbb Q\langle1,b,b^2, a,ab,ab^2\rangle$ as a vector space. $\,x\mapsto (a\!+\!b)\,x\,$ is a linear map on this vector space. Compute its matrix, then apply Cayley-Hamilton, to compute a (characteristic) polynomial having $\,a\!+\!b\,$ as root (e.g. by computing a determinant).
Remark $\ $ Such "determinant tricks" generalize to arbitrary rings. More efficiently (and precisely), one can use Grobner bases to do the elimination (e.g. via ideal-contraction), or resultants.
Mechanically, we can use resultants to eliminate $\,z,y\,$ from $\,x = y+z,\ x^2=2,\ y^3 = 3.$ First eliminating $\,z\,$ we have ${\rm res}(x\!-\!y\!-\!z,z^2\!-\!2,z) = (x\!-\!y)^2\!-\!2,\,$ then eliminating $\,y\,$ we have $\,{\rm res}((x\!-\!y)^2\!-\!2,y^2\!-\!3,y) = x^6\!-\!6x^4\!-\!6x^3\!+\!12x^2\!-\!36x\!+\!1\,$ (e.g. computed via Alpha)
Alternatively we can contract the ideal $\,(x\!-\!y\!-\!z,z^2\!-\!2,y^3\!-\!3)\,$ to $\,\Bbb Q[x],\,$ using Grobner bases.