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 of is the number of distinct roots of
Statement
If is algebraic over , then equals the number of distinct roots of the minimal polynomial in any algebraic closure of .
Facts & Assumptions
Given: An algebraic element over and an algebraic closure .
Separable degree counts -embeddings into an algebraic closure (The separable degree as a count of embeddings into an algebraic closure).
Such embeddings of correspond bijectively to the distinct roots of (-embeddings of into an algebraically closed field correspond to the distinct roots of ).
The embedding count is independent of the chosen algebraic closure (The separable degree is independent of the chosen algebraic closure).
Proof
By [L2], the embedding set counted in [L1] is in bijection with the distinct-root set of in .
Taking finite cardinalities gives the assertion, and [L3] removes dependence on .
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 38 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)