Intereting Posts

Calculating new vector positions
Show that for any $g \in L_{p'}(E)$, where $p'$ is the conjugate of $p$, $\lim_{k \rightarrow \infty}\int_Ef_k(x)g(x)dx = \int_Ef(x)g(x)dx$
Understanding Strategy:Minimum number of weighing to find the faulty bag
Geometric understanding of differential forms.
Why can't we construct a square with area equal to a given equilateral triangle?
Alternative proof for the integral of $1/x$ being equal to $\ln (x)$?
Expected length of a sequence that contains all words of a given length.
Picard group of product of spaces
$\sum_{n=1}^{50}\arctan\left(\frac{2n}{n^4-n^2+1}\right)$
Lower bound for cyclotomic polynomials evaluated at an integer
Scheme: Countable union of affine lines
Open cover rationals proper subset of R?
Eigenvalues in terms of trace and determinant for matrices larger than 2 X 2
connected sum of torus with projective plane
Calculus of residue of function around poles of fractional order (complex analysis)

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:

- Induced map on simplices from order-preserving maps between finite ordinal numbers
- Every inﬁnite abelian group has at least one element of inﬁnite order?
- How is it shown that quintic equations can be solved by radicals and ultraradicals?
- Is there a simple explanation why degree 5 polynomials (and up) are unsolvable?
- Finite groups with periodic cohomology
- Name for Cayley graph of a semigroups?

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.

- $\mathbb C/(X^2)$ is isomorphic to $\mathbb R/((Y^2+1)^2)$
- Inverse of open affine subscheme is affine
- Proving Finiteness of Group from Presentation
- Give an intuitive explanation for polynomial quotient ring, or polynomial ring mod kernel
- When do we use Tensor?
- The p-adic numbers as an ordered group
- What is the kernel of $K \to K$, defined by $T \mapsto x$?
- How to recognize adjointness?
- nilpotent subgroup and hypercenter
- If $K/\mathbb{Q}$ is finite, then $K$ contains finitely many $n$th roots of unity

“…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.

- Limit of $\dfrac{x}{\log x}$ as $x\to\infty$
- Realizing the monoid $\mathbb{N}/(3=1)$ from a category with finite coproducts
- Infinitely many nonequivalent unprovable statements in ZFC because of Gödel's incompleteness theorem?
- Multiplication in $\mathbb{R}^n$
- Lie algebra-like structure corresponding to noncrystallographic root systems
- Why is $H_\delta^d$ monotone decreasing in $\delta$ in the definition of Hausdorff measure?
- Variance of sample mean (problems with proof)
- Show that $g:I\to\mathbb{R}$ is continuous and $f:(x-x_0)g(x)$ is differentiable
- How do we know Taylor's Series works with complex numbers?
- Is the product rule true in a Banach algebra?
- Intuitive interpretation of the Laplacian
- Derivative of a product $P_{x_n}(z) = \prod_{i=1}^n\frac{1+z+z^2 +…+z^{i-1}}{i} $
- Fields – Proof that every multiple of zero equals zero
- Help with the Neumann Problem
- $\ln|x|$ vs.$\ln(x)$? When is the $\ln$ antiderivative marked as an absolute value?