How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The complex numbers are algebraically closed
Statement
The field is algebraically closed.
Facts & Assumptions
Given: A nonconstant polynomial .
If every nonconstant polynomial in splits over , then is algebraically closed (To prove the fundamental theorem of algebra, it suffices to split every real polynomial over ).
Every finite family of nonzero polynomials has a splitting field (Every finite family of nonzero polynomials has a splitting field, obtained from their product).
An algebraic extension that is a splitting field of a polynomial is normal (An algebraic extension that is a splitting field of a polynomial is normal).
Every field of characteristic zero is perfect, and every algebraic extension of a perfect field is separable (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect, Every algebraic extension of a perfect field is separable).
For a finite Galois extension with group , the maps and are inverse inclusion-reversing bijections, and (The fundamental theorem of finite Galois theory)
Degrees multiply in a finite tower (Tower law for finite extensions: ).
Every finite group has a Sylow -subgroup (Sylow I: every finite group has a Sylow -subgroup).
Every nontrivial finite -group has a subgroup of index (Every nontrivial finite -group has a normal subgroup of index ).
Every complex number has a square root in (Every complex number has a square root, by an explicit Cartesian formula).
A square root of in a real field extension determines a unique real-field embedding of into that extension (A square root of in a real field extension determines a unique real-field homomorphism from ).
A quadratic extension in characteristic not is obtained by adjoining a square root (A quadratic extension in characteristic not is obtained by adjoining a square root).
An irreducible polynomial over has degree or an even degree (An irreducible polynomial over has degree or an even degree).
A field generated by finitely many algebraic elements over a base field is finite over that base (An extension generated by finitely many algebraic elements is finite).
If is algebraic over a field , then the degree of its minimal polynomial equals (An element is algebraic over if and only if its simple extension is finite).
Proof
By [L1], it is enough to prove that every nonconstant polynomial in splits over . Fix such a polynomial .
Put . By [L2], choose a splitting field of . The roots of are algebraic over , and is generated by finitely many of them, so [L13] makes finite. Because is a splitting field of , [L3] makes it normal, and [L4] makes it separable. Thus is finite Galois.
Let . By [L7], choose a Sylow -subgroup , and put . Then [L5] gives which is odd by the definition of a Sylow -subgroup.
Since splits in , choose with . By [L10], there is a unique real-field embedding sending to . Identify with its image, so that
Let . Since , the tower law [L6] shows that divides , so is odd. Because and step 1.2 made finite, the element is algebraic over . Fact [L14] therefore makes the minimal-polynomial degree of over equal to the same odd number ; by [L12] it must have degree . Hence . Since every element of lies in , we get .
Because , the bijection in [L5] forces . Therefore is a finite -group.
Put . Then , so step 3.1 makes a finite -group. Suppose is nontrivial.
By [L8], the nontrivial -group has a subgroup of index . Put . Then by [L5], and [L5] together with [L6] gives
The field has characteristic zero, hence not , so [L11] makes the quadratic extension equal to for some . By [L9], choose with . Then contradicting step 5.1. Therefore is trivial.
Since , the fixed field of the trivial subgroup is ; by [L5], that fixed field is also . Thus . Because is a splitting field of and divides , the polynomial splits over . By step 1.1 and [L1], this proves that is algebraically closed.
Depends on
- An irreducible polynomial over $\mathbb R$ has degree $1$ or an even degree
- To prove the fundamental theorem of algebra, it suffices to split every real polynomial over $\mathbb C$
- A quadratic extension in characteristic not $2$ is obtained by adjoining a square root
- Every finite family of nonzero polynomials has a splitting field, obtained from their product
- An algebraic extension that is a splitting field of a polynomial is normal
- Fields of characteristic zero, finite fields, and algebraically closed fields are perfect
- Every algebraic extension of a perfect field is separable
- The fundamental theorem of finite Galois theory
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- Sylow I: every finite group has a Sylow $p$-subgroup
- Every nontrivial finite $p$-group has a normal subgroup of index $p$
- Every complex number has a square root, by an explicit Cartesian formula
- A square root of $-1$ in a real field extension determines a unique real-field homomorphism from $\mathbb C$
- An extension generated by finitely many algebraic elements is finite
- An element is algebraic over $F$ if and only if its simple extension $F(a)/F$ is finite
Used by
- An irreducible polynomial in ℝ[x] has degree 1 or 2 Corollary
- Every nonconstant polynomial in ℂ[x] splits into linear factors Corollary
- The algebraic numbers in ℂ form an algebraic closure of ℚ Corollary
- The complex numbers form an algebraic closure of ℝ Corollary
- x⁵-6x+3 over ℚ is not solvable by radicals Example
- The Artin and minimum-modulus proofs of the fundamental theorem of algebra use different machinery Remark
Dependency tree · two levels
59 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. S. Milne, Fields and Galois Theory, v5.10, Theorem 5.6 (standard reference, not scraped)
- Keith Conrad, Applications of Galois Theory, Theorem 2.1 (standard reference, not scraped)