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.
Polynomial differentials are free
Statement
Let be a commutative ring and let be the polynomial algebra on finitely many indeterminates, . Then:
- is a free -module with basis ; for this says ;
- for every -module and every -tuple there is exactly one -derivation with ;
- writing for the derivation with , one has for every .
Neither statement assumes anything of beyond commutativity, and the correspondence is natural in .
Facts & Assumptions
Given: A commutative ring , an integer , the polynomial algebra , and a -module .
Derivations are maps out of Ω: for every -module , composition with the universal derivation is a natural -module isomorphism .
Derivation of an algebra: an -derivation of into is an additive -constant map satisfying the Leibniz rule, and is a -module under pointwise operations.
Universal property of a polynomial ring on an arbitrary family of indeterminates: for commutative rings , a ring homomorphism and a family in , there is a unique ring homomorphism restricting to on and sending to .
Proof
Sections of a square-zero thickening. Let be the commutative ring whose underlying abelian group is with product , made into an -algebra by . The first projection is an -algebra homomorphism with kernel the square-zero ideal . If is an -algebra homomorphism with , write ; additivity of gives , the identity and -linearity give , and multiplicativity , expanded with in , gives ; conversely these three laws make the formula multiplicative and unital. So sections of over the identity correspond bijectively to the elements of by [F2].
Every tuple of values is realised. Let . By [F3] applied to and the family , , there is a unique -algebra homomorphism with and . The composite is an -algebra endomorphism of with , so by the uniqueness clause of [F3] it is the identity; hence for the map given by the second coordinate, and . By step 1.1 the map is an -derivation of into .
Uniqueness of the values on generators. If satisfies for all , then is an -algebra homomorphism by step 1.1, it agrees with on and on each , and hence equals by the uniqueness clause of [F3]; therefore . So for every -module the evaluation map , , is a bijection; it is -linear, and natural in because a -linear sends to with values .
Freeness. Composing the natural bijections of [F1] and of step 3.1 gives natural bijections for every -module . The image of the identity of is a -linear map , and its inverse image is a -linear map with and : both identities are checked on generating sets, the standard basis of and, by the explicit construction of the bijection in step 3.1, the elements . Hence is an isomorphism sending to , so is free with basis . For we have and , so step 3.1 says that every -derivation of into any -module is zero, and [F1] gives .
Depends on
Used by
- Jacobian presentation of Ω Corollary
- A conormal left map with nonzero kernel Counterexample
- Zero Frobenius tangent map does not imply formal etaleness Counterexample
- Differentials of a plane hypersurface Example
- Differentials of k[x,y] Example
- Dual-number vectors in affine space Example
- The conormal sequence is only right exact Remark
- Conormal sequence for a closed immersion Theorem
- Transitivity sequence for schemes Theorem
Dependency tree · two levels
10 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.131.14 (standard reference, not scraped)
- Vakil 22.2.3, p.575 (standard reference, not scraped)