TITLE: Constructive proof of algebraic elements forming a subfield
QUESTION [5 upvotes]: Let $F \leqslant E$ be a field extension.
If $a, b \in E$ are algebraic over $F$ then $a+b$ and $ab$ are algebraic as well. There is an short proof of this using the extension $E(a,b)$:
$[E(a,b):E]$ is finite so all elements are algebraic otherwise powers non-algebraic would form an infinite linearly independent set. In particular $a+b \in E(a,b)$ and $ab \in E(a,b)$ are algebraic.
But this proof doesn't construct the actual polynomial. Is there a constructive proof or any reason for such a proof not to exist?

REPLY [4 votes]: This question keeps getting asked on forums, e.g.:
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=61&t=202382 and www.artofproblemsolving.com/Forum/viewtopic.php?f=61&t=180471 .
This fact is a particular case of a more general fact, which claims that if $A$ is a subring of a commutative ring $B$, and if $a$ and $b$ are two elements of $B$ integral over $A$, then $a+b$ and $ab$ are integral over $A$, too. This is a standard result in commutative algebra, and usually proven constructively: e.g. Corollary 2.1.11 in Swanson-Huneke yields it.
PS. This might be clear to you, but there is no chance to get the minimal polynomial of either $a+b$ or $ab$ by any algorithm. What you can get are polynomials, both of degree $\left[E\left(a\right):E\right]\cdot\left[E\left(b\right):E\right]$, that have $a+b$ resp. $ab$ as roots. These can be obtained as resultants in a way similar to Felipe's, or by executing any of the above-mentioned constructive proofs as programs.