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.
Finite separable extensions have zero Omega
Example
For every finite separable field extension one has . The proof differentiates the minimal polynomial of a primitive element, so the separability hypothesis is used both to obtain a primitive element and to ensure that its minimal-polynomial derivative is nonzero and hence invertible; the converse direction, that a finitely generated field extension with is finite and separable, is a strictly harder result and appears on the category page (Finite-type field extensions with zero Ω).
Facts & Assumptions
Given: A finite separable field extension and a primitive element with .
Existence and generators of Kähler differentials: a Kähler differential module exists for the ring map , the map is a -derivation of , and is generated as an -module by the elements for .
A finite extension generated by elements all but possibly one of which are separable is simple: every finite separable extension is simple, so for some .
The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element: the minimal polynomial of the algebraic element is the unique monic irreducible generator of the kernel of evaluation , ; hence if and only if .
An irreducible polynomial over a field is separable exactly when its derivative is nonzero: an irreducible polynomial over a field is separable if and only if its formal derivative is not zero.
Separable algebraic elements and separable extensions: an extension is separable when every element is separable, and an element is separable when it is algebraic with separable minimal polynomial.
A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree : every element of the simple algebraic extension is a polynomial in with coefficients in ; evaluation , , is an isomorphism .
Verification
By [F2] there is with ; since is separable, [F5] makes separable over , so its minimal polynomial is monic, irreducible and separable.
By [F4] the separability of the irreducible polynomial says , where is the formal derivative; since , the minimality statement of [F3] shows : a vanishing of at would force and hence .
Because is a -derivation [F1] and , applying to the relation with and using additivity, -linearity and the Leibniz rule gives , with the value at of the formal derivative. Since by step 2.1 and is a field, is invertible in , so .
It follows that vanishes on all of : by [F6] every equals for a polynomial , and the Leibniz rule over the expansion of in powers of gives , since [F1, step 3.1].
By [F1] the module is generated over by the elements with , and step 4.1 shows that each such generator is zero; hence .
Depends on
- Existence and generators of Kähler differentials
- A finite extension generated by elements all but possibly one of which are separable is simple
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- An irreducible polynomial over a field is separable exactly when its derivative is nonzero
- Separable algebraic elements and separable extensions
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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
- Stacks Algebra 10.158.1 (standard reference, not scraped)
- Vakil 22.2.F, p.577 (standard reference, not scraped)