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.
An algebraic extension generated by separable elements is separable
Statement
Let be algebraic and suppose for a set of elements separable over . Then is separable.
Facts & Assumptions
Given: An algebraic extension whose generators are separable over .
An element is separable over when it is algebraic over and its minimal polynomial over is separable; the extension is separable when every element is (Separable algebraic elements and separable extensions).
The generated field is the smallest subfield containing (Field extensions, generated subrings , generated subfields , and simple extensions).
The separable degree of a simple algebraic extension is the number of distinct roots of its generator's minimal polynomial (The separable degree of is the number of distinct roots of ).
The degree of a simple algebraic extension is the degree of that minimal polynomial (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Separable degree is multiplicative in finite towers (Separable degree is multiplicative in finite towers: ).
Ordinary degrees multiply in finite towers (Tower law for finite extensions: ).
Finitely many algebraic generators produce a finite extension (An extension generated by finitely many algebraic elements is finite).
A finite extension is separable exactly when its separable degree equals its ordinary degree (A finite extension is separable if and only if ).
Proof
The union of over the finite subsets is a subfield containing , so by [L2] it equals . Hence every lies in for finitely many .
Put , so that , , and . Each is algebraic over by [L1], so [L7] makes finite and every step of the tower finite.
The minimal polynomial of over divides its minimal polynomial over , which is separable by [L1]; a divisor of a polynomial with no repeated root has none, so the relative minimal polynomial has as many distinct roots as its degree. Hence [L3] and [L4] give at every step.
Multiplying these equalities over the tower, [L5] and [L6] give , so [L8] makes separable and the chosen separable over .
Since was arbitrary, [L1] makes separable. If , [L2] gives , whose separable and ordinary degrees are both one, so the conclusion holds there as well.
Depends on
- Separable algebraic elements and separable extensions
- Field extensions, generated subrings $F[S]$, generated subfields $F(S)$, and simple extensions
- The separable degree of $F(\alpha)/F$ is the number of distinct roots of $m_{\alpha}$
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- Separable degree is multiplicative in finite towers: $[L:F]_s=[L:K]_s[K:F]_s$
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- An extension generated by finitely many algebraic elements is finite
- A finite extension is separable if and only if $[K:F]_s=[K:F]$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 74 results over 18 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)