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 algebraic numbers in form an algebraic closure of
Statement
Let
Then is an algebraic closure of .
Facts & Assumptions
Given: The subset of elements algebraic over .
The algebraic elements in an extension form a subfield (The elements of an extension algebraic over the base field form a subfield).
The field is algebraically closed (The complex numbers are algebraically closed).
A field generated by finitely many algebraic elements over the base field is finite over that base (An extension generated by finitely many algebraic elements is finite).
An element is algebraic over a field if and only if its simple extension over that field is finite (An element is algebraic over if and only if its simple extension is finite).
Degrees multiply in a finite tower (Tower law for finite extensions: ).
Every element of a finite extension is algebraic over the base field (Every finite field extension is algebraic).
An algebraic closure of a field is an algebraic extension whose top field is algebraically closed (An algebraic closure of a field).
Proof
By [L1], the set is a subfield of containing .
Let be nonconstant. Since is algebraically closed by [L2], the polynomial has a root .
The coefficients are algebraic over , so is a finite extension of by [L3]. The element is a root of a nonzero polynomial over , so it is algebraic over ; therefore [L4] makes finite. By [L5], the extension is finite, and then [L6] makes algebraic over . Hence .
Step 2.1 shows that every nonconstant polynomial in has a root in , so is algebraically closed. Since every element of is algebraic over by definition, [L7] makes an algebraic closure of .
Depends on
- An algebraic closure of a field
- The complex numbers are algebraically closed
- The elements of an extension algebraic over the base field form a subfield
- 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
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- Every finite field extension is algebraic
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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, Corollary 5.7(b) (standard reference, not scraped)
- P. L. Clark, Field Theory, Chapters 3 to 5 (standard reference, not scraped)