Constructive proof of the existence of an algebraic closure

It is well-known that, assuming the axiom of the choice (in the form of Zorn’s lemma), one can prove that any field $F$ has an algebraic closure. One proof roughly goes as follows: consider the partially-ordered set of algebraic extensions $K/F$, ordered by inclusion; show that it satisfies the hypotheses of Zorn’s lemma; then Zorn’s lemma implies the existence of a maximal element; show that this maximal element is algebraically closed.

Now, in my Algebraic Number theory class, the professor gave a “constructive” proof of this fact: let $S$ be the set consisting of all non constant polynomials in $F[X]$, and construct the ring $R=F[X_f:f\in S]$ (that is, a polynomial ring with one variable for each element of $S$); let $A_0$ be the ideal of $R$ generated by polynomial $\{f(X_f):f\in S\}$; show that it is a proper ideal, and so it is contained in a maximal ideal $A$; the quotient $R/A$ is thus a field, which contains $F$ as a subfield; iterate, and take the union of all these fields; then, this union is the algebraic closure of $F$. He also mentionned (if I recall correctly) that one can prove that after only one iteration, you get the algebraic closure. Now, I put quotation marks around “constructive”, because I suspect that one still needs the axiom of choice at some point to prove that, indeed, you have the algebraic closure (although I haven’t checked the details).

So, here’s my question:

Is it the case that this proof is constructive?

Another question:

Can one prove the existence of an algebraic closure within ZF (without the axiom of choice)?

Thanks in advance.

Solutions Collecting From Web of "Constructive proof of the existence of an algebraic closure"

“…is a proper ideal, and so is contained in a maximal ideal of $A$.”

The fact that proper ideals are contained in maximal ideals of rings with unity is actually equivalent to the Axiom of Choice, so this isn’t really avoiding AC, it’s just hiding it.

There are models of ZF in which there are fields with no algebraic closure, so it’s known that you need at least some Choice to prove that every field has an algebraic closure.

There is an article by Bernhard Banaschewski, Algebraic closure without choice, Z. Math. Logik Grundlag. Math. 38 (1992), no. 4, 383-385, which says that you can prove that every field has an algebraic closure if you only assume the Boolean Ultrafilter Theorem, which is strictly weaker than AC.

By the way, the argument given is attributed in Lang’s Algebra to Artin.