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.
Regular algebras over a perfect field are geometrically regular
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a perfect field (Perfect fields: every irreducible polynomial is separable) and let be a finite-type -algebra that is regular (regular noetherian ring). Then is a regular ring for every field extension , not only for the finitely generated ones. In particular a regular finite-type algebra over a perfect field is geometrically regular (Field tests for geometric regularity).
No assumption is made on the extension field : it need not be perfect. In characteristic the hypothesis that is perfect is automatic, and the statement says that regular finite-type algebras over such fields stay regular after arbitrary scalar extension.
Facts & Assumptions
Given: A perfect field , a regular finite-type -algebra , and the Axiom of Choice.
A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective: is perfect if and only if either , or and the Frobenius map is surjective; iterating, every element of a perfect field of characteristic is a -th power for every .
Perfect fields: every irreducible polynomial is separable: a field is perfect when every algebraic extension of it is separable, equivalently (in characteristic ) when its Frobenius endomorphism is surjective.
Pure inseparability and its conjugate, embedding, and separable-degree criteria: for algebraic of characteristic , is purely inseparable if and only if every has for some ; in characteristic a purely inseparable extension is trivial.
The binomial theorem over an arbitrary commutative ring and A prime divides for : in a commutative ring of characteristic one has and hence for every ; in a field forces .
Field tests for geometric regularity: under the Axiom of Choice, a finite-type -algebra is geometrically regular over if and only if is regular and is regular for every finite purely inseparable ; and then is regular for every field extension .
regular noetherian ring: a commutative Noetherian ring is regular when all its prime localisations are regular local rings.
Proof
Every finite purely inseparable extension of is trivial. Let be finite purely inseparable. If the characteristic is , then by [F3]. If the characteristic is , fix ; by [F3] there is with , and since the Frobenius map of is surjective by [F1] we may write with . Then by [F4], and is a field, so . Hence .
Applying the field tests. The algebra is regular by hypothesis, and by step 1.1 the only finite purely inseparable extension of is itself, for which is regular. Hence [F5] makes geometrically regular over , and its second clause makes regular for every field extension .
Thus a regular finite-type algebra over a perfect field is geometrically regular, and every scalar extension is regular, whether or not is perfect or finitely generated; in characteristic the perfectness hypothesis is automatic by
Depends on
- Field tests for geometric regularity
- A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective
- Perfect fields: every irreducible polynomial is separable
- Pure inseparability and its conjugate, embedding, and separable-degree criteria
- The binomial theorem over an arbitrary commutative ring
- A prime $p$ divides $\binom pk$ for $0<k<p$
- regular noetherian ring
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
46 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.45.3–4 (standard reference, not scraped)