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.
Finitely generated extensions of a perfect field are separably generated
Statement
Let be a perfect field and let be a finitely generated field extension. Then has a separating transcendence basis over (Separating transcendence basis and separably generated extensions): there are , algebraically independent over , such that is finite separable.
The argument in characteristic uses -power linear independence and exchanges of finitely many generators; it does not infer that is perfect, and no perfectness of any intermediate field is asserted.
Facts & Assumptions
Given: A perfect field and a finitely generated field extension , say .
Separating transcendence basis and separably generated extensions: a finite tuple is a separating transcendence basis when its entries are algebraically independent over and the residual extension is finite separable, and then is the common cardinality of all transcendence bases.
Algebraic and transcendental elements and algebraic extensions: is algebraic over a subfield when it satisfies a nonzero polynomial equation over , and transcendental otherwise; is algebraic when every element of is algebraic over .
An extension generated by finitely many algebraic elements is finite: if are algebraic over , then is finite.
A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective: is perfect if and only if , or and the Frobenius map of is surjective.
Every algebraic extension of a perfect field is separable: every algebraic extension of a perfect field is separable.
Separable algebraic elements and separable extensions: an extension is separable when each of its elements has separable minimal polynomial.
The inseparable degree of a finite extension: for a finite extension , .
Separable degree is multiplicative in finite towers: : for a finite tower .
Tower law for finite extensions: : for a finite tower.
A finite extension is separable if and only if : a finite extension is separable exactly when its separable degree equals its degree, so by [F7] a finite extension is separable exactly when its inseparable degree is .
The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element: for algebraic over , implies , where is the monic irreducible minimal polynomial; and generates the evaluation kernel.
Gauss lemma over a UFD with For every field , is a unique factorisation domain: a polynomial that is irreducible and of positive degree in one variable over a polynomial ring over a field remains irreducible over the fraction field, and a polynomial ring over a field is a unique factorisation domain.
A nonzero polynomial over a field is separable exactly when its gcd with its derivative is : for over a field, is separable if and only if .
An algebraic extension generated by separable elements is separable: an algebraic extension generated by separable elements is separable.
One element of a transcendence basis can be exchanged for a suitable rival: given transcendence bases of and there is with a transcendence basis; consequently two transcendence bases of a finitely generated extension have the same finite cardinality.
A finite extension generated by elements all but possibly one of which are separable is simple: a finite extension generated by elements all but possibly one of which are separable is simple.
The binomial theorem over an arbitrary commutative ring, A prime divides for : the binomial expansion holds in every commutative ring, and divides its intermediate coefficients for exponent . Hence in characteristic .
Proof
Running through the finite list and adjoining an element exactly when it is transcendental over the field generated by the elements already adjoined produces, after finitely many steps, an algebraically independent over which every is algebraic; then is algebraic over and finitely generated over it, hence finite over by [F3], so is a transcendence basis and is defined by [F7]. The set of values , taken over the finite, algebraically independent with finite, is a nonempty set of natural numbers and therefore has a least element; fix attaining it, and note that each such is a transcendence basis of by [F2]. If , then also has characteristic zero, so is perfect by [F4], and is separable by [F5], so is already a separating transcendence basis. Henceforth assume . Then Frobenius is surjective on by [F4], and -linearly independent elements have -linearly independent -th powers: from with and one gets , hence because is additive by [F17] and injective on the field , so all , hence all , vanish.
Suppose is not separable. By [F6] there is that is not separable over , and is algebraic over by [F2] since is algebraic. Choose nonzero of least total degree with . Then is irreducible: a factorisation with nonconstant satisfies , and either or vanishes at with strictly smaller total degree, contradicting minimality.
Suppose every monomial exponent of were divisible by . Since is perfect, write each coefficient using [F4]. Then for the nonzero polynomial , by Frobenius additivity [F17]. Evaluation gives in the field , hence , contradicting minimality because . Thus some variable occurs with an exponent not divisible by ; fix such .
Set and . Write with and . The total degree of is strictly less than that of , so by the minimality in step 2.1. Thus is a nonconstant polynomial in vanishing at , which proves algebraic over . This makes a transcendence basis of : if were dependent, a maximal independent subset would be a transcendence basis of over , and since is algebraic over by the preceding coefficient argument, the same finite set would be a transcendence basis of over with , contradicting that is a transcendence basis of that field and that all transcendence bases of a finitely generated extension have the same cardinality [F15]; so is independent, is algebraic, and is a rational function field over in the variables , . Consequently is the image of the polynomial , which has positive -degree and is irreducible in ; its coefficients are primitive, since a nonunit common factor would factor the irreducible of positive -degree. Thus Gauss' lemma [F12] makes its image irreducible in . Since some -exponent of is not divisible by , the same exponent occurs in , so and because is irreducible and ; thus is separable by [F13]. As and is irreducible, is a nonzero scalar multiple of the monic minimal polynomial of over by [F11], so is separable over and is separable by [F14].
By [F8] and [F9] the inseparable degree is multiplicative, for finite ; and by [F10]. With and we get and , while by [F10] because is not separable. Therefore , and is a transcendence basis of by step 4.1 with a strictly smaller inseparable degree than , contradicting the minimality of step 1.1. Hence is separable and is a separating transcendence basis, which proves the theorem; moreover, by [F16] the residual finite separable extension is simple, so for a single element separable over .
Depends on
- Separating transcendence basis and separably generated extensions
- Finitely generated field extensions $F(a_1,\ldots,a_r)$
- Algebraic and transcendental elements and algebraic extensions
- An extension generated by finitely many algebraic elements is finite
- A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective
- The binomial theorem over an arbitrary commutative ring
- A prime $p$ divides $\binom pk$ for $0<k<p$
- Every algebraic extension of a perfect field is separable
- Separable algebraic elements and separable extensions
- The inseparable degree $[K:F]_i=[K:F]/[K:F]_s$ of a finite extension
- Separable degree is multiplicative in finite towers: $[L:F]_s=[L:K]_s[K:F]_s$
- A finite extension is separable if and only if $[K:F]_s=[K:F]$
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- Gauss lemma over a UFD
- For every field $F$, $F[x]$ is a unique factorisation domain
- A nonzero polynomial over a field is separable exactly when its gcd with its derivative is $1$
- An algebraic extension generated by separable elements is separable
- One element of a transcendence basis can be exchanged for a suitable rival
- A finite extension generated by elements all but possibly one of which are separable is simple
Used by
Dependency tree · two levels
62 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.44.1–2 and 10.45.2 (standard reference, not scraped)