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.
-embeddings of into an algebraically closed field correspond to the distinct roots of
Statement
Let be algebraic over , and let be an algebraically closed field containing . Sending an -embedding to is a bijection from the set of such embeddings to the set of distinct roots in of the minimal polynomial . Consequently the number of embeddings is the number of distinct roots of , not the sum of their multiplicities.
Facts & Assumptions
Given: An algebraic element over , its minimal polynomial , and an algebraically closed overfield of .
An -embedding carries an algebraic element to a conjugate root of its minimal polynomial (A base-field embedding carries an algebraic element to a conjugate).
For a monic irreducible polynomial, every chosen root in an extension induces a unique homomorphism from the quotient adjoining that root (Universal property of adjoining a root of an irreducible polynomial).
Every nonconstant polynomial over an algebraically closed field has a root there (An algebraically closed field: every nonconstant polynomial has a root in the field).
Proof
By [L1], the image of every -embedding is a root of in .
Conversely, if is a root of , [L2] applied to the two realizations of gives a unique -embedding with .
The constructions in steps 1.1 and 1.2 are inverse because an -homomorphism on is determined by the image of .
The polynomial splits in by repeated use of [L3], and the bijection indexes embeddings by its distinct roots, so repeated roots are counted once.
Depends on
Used by
- For a finite extension, [K:F]ₛ≤ [K:F] Corollary
- The separable degree of F(α)/F is the number of distinct roots of m_α Corollary
- The separable degree [K:F]ₛ as a count of embeddings into an algebraic closure Definition
- ℚ(√2,√3) has four embeddings into overlineℚ Example
- ℚ(³√2) has three embeddings into overlineℚ but only one ℚ-automorphism Example
- FALSE: an algebraic closure is unique up to a unique base-field isomorphism False statement
- Pure inseparability and its conjugate, embedding, and separable-degree criteria Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 31 results over 7 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- P. L. Clark, Field Theory, Chapters 3 to 5 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, Chapters 2, 3, and 5 (standard reference, not scraped)