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.
A finite separable extension and an inseparable extension with differentials
Example
Let be a field.
- If is a finite separable extension, then .
- Suppose and . Put and let also denote the class of the variable. Then is a field and , a one-dimensional -vector space: a field extension with nonzero module of differentials, necessarily not separable.
Both computations are quotient computations in one variable; no separability of is available in the second case, and none is used.
Facts & Assumptions
Given: A field , for clause 1 a finite separable extension , and for clause 2 a prime and an element .
A finite extension generated by elements all but possibly one of which are separable is simple: if is finite and all but possibly one of the generators are separable over , then is simple; in particular every finite separable extension is simple.
The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element: for algebraic over a field the evaluation map has kernel generated by the monic minimal polynomial of , so , and implies .
Differentials of a polynomial quotient and the Jacobian cokernel: for with and the module is the cokernel of multiplication by on , that is with generator ; the conormal map need not be injective.
Repeated roots in extension fields and separable polynomials, A nonzero polynomial over a field is separable exactly when its gcd with its derivative is : a nonzero polynomial over a field is separable exactly when , equivalently when and have no common root in any extension field; a separable polynomial of degree has distinct roots in a splitting field.
Every nonzero nonunit polynomial over a field factors into irreducible polynomials, For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible: a nonzero nonunit polynomial over a field is a product of irreducibles, so has a monic irreducible factor , and is a field.
The binomial theorem over an arbitrary commutative ring, A prime divides for : in characteristic the binomial coefficients for are divisible by , so in every commutative ring of characteristic ; iterating, and deriving termwise, gives .
Proof
The separable case. By [F1] write , and let be the monic minimal polynomial of , so that by [F2]. Since is separable the element is separable, so is separable and by [F4]; as and would force by [F2], impossible for of degree less than , we get . By [F3] applied to the presentation the module is , and is a unit of the field , so .
The polynomial is irreducible. Let be a monic irreducible factor of [F5] and put , a field with class of satisfying [F5]. By [F6] the identity holds in , so every root of in a splitting field is a root of , hence equals : the polynomial has exactly one distinct root. If then and , contrary to the hypothesis, so ; and with would make separable with distinct roots by [F4], a contradiction. Hence , which in characteristic means that is a polynomial in and, since has degree at most , forces ; so is irreducible, is a field by [F5], and satisfies hence .
The differentials of the inseparable field. By [F3] applied to the single equation with and , and by the derivative computation of [F6], the module is , generated by ; explicitly is one-dimensional over the field and nonzero. Since with , the element is not separable over , so this is a field extension with a nonzero differential module, in contrast with clause 1.
Depends on
- A finite extension generated by elements all but possibly one of which are separable is simple
- Differentials of a polynomial quotient and the Jacobian cokernel
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- For a nonconstant $p$ in $F[x]$, the ideal $(p)$ is maximal and $F[x]/(p)$ is a field exactly when $p$ is irreducible
- A nonzero polynomial over a field is separable exactly when its gcd with its derivative is $1$
- Every nonzero nonunit polynomial over a field factors into irreducible polynomials
- Repeated roots in extension fields and separable polynomials
- The binomial theorem over an arbitrary commutative ring
- A prime $p$ divides $\binom pk$ for $0<k<p$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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
- Vakil §22.2.F, p.577 (standard reference, not scraped)
- Stacks Algebra 10.131.14 and 10.143.2 (standard reference, not scraped)