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 separable degree is independent of the chosen algebraic closure
Statement
For a finite extension , the number of -embeddings of into an algebraic closure of is independent of the chosen algebraic closure.
Facts & Assumptions
Given: A finite extension and algebraic closures and .
Separable degree is the finite cardinality of the set of base-field embeddings into a chosen algebraic closure (The separable degree as a count of embeddings into an algebraic closure).
A finite extension has a finite basis over its base (The degree of a finite field extension).
Every algebraic element has a unique monic irreducible minimal polynomial over the base (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
A splitting field of a polynomial is generated over the base by all of its roots (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
Any two splitting fields of the same nonzero polynomial are isomorphic over the base (Any two splitting fields of a polynomial are isomorphic over the base field).
Proof
Choose a finite -basis of by [L2], and let be the product of their minimal polynomials over from [L3]. For , let be generated over by all roots of in . Since is algebraically closed, splits there, and [L4] makes a splitting field of .
By [L5], choose an -isomorphism . Postcomposition with gives a bijection , with inverse given by postcomposition with .
Every -embedding sends each to a root of its minimal polynomial, so . Hence .
Steps 2.1 and 1.2 give a bijection between the embedding sets into and . Their finite cardinalities are equal, so the value in [L1] is independent of the closure.
Depends on
- The separable degree $[K:F]_s$ as a count of embeddings into an algebraic closure
- The degree $[K:F]=\dim_F K$ of a finite field extension
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- Any two splitting fields of a polynomial are isomorphic over the base field
Used by
- The separable degree of F(α)/F is the number of distinct roots of m_α Corollary
- Restriction partitions embeddings in a finite tower into extension fibres Lemma
Cited to discharge well-definedness by The separable degree [K:F]ₛ as a count of embeddings into an algebraic closure.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 53 results over 10 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 4 and 5 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, Chapters 3 and 5 (standard reference, not scraped)