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.
Existence and generators of Kähler differentials
Statement
Let be a homomorphism of commutative rings. Let be the free -module on the set underlying , with basis written for , let be the -submodule generated by all elements
for and , and put with , . Then is a Kähler differential module for in the sense of Universal Kähler differential module: for every -module the assignment is a bijection , natural in . In particular a Kähler differential module exists for every ring homomorphism , with no finiteness hypothesis on over , and is generated as a -module by the classes of the elements of .
Facts & Assumptions
Given: A homomorphism of commutative rings, the free -module on the set underlying , the submodule of the three relator families, and the pair with and .
Universal algebraic differentials and A-derivations: the module of algebraic differentials is for the free -module on the set underlying with basis symbol , modulo the submodule generated by , and , and is its universal -derivation.
Derivation of an algebra: an -derivation of into a -module is an additive, -constant map satisfying , and is the -module of all such maps.
Universal Kähler differential module: is a Kähler differential module for when is a bijection for every -module , naturally in .
Proof
The pair of [F1] is a -module with an -derivation. The free module is a -module and is a -submodule by construction, so is a -module and is a map . Each of the three relator families lies in , hence vanishes in the quotient: gives , the element gives , and gives . So is additive, -constant and satisfies Leibniz, that is, by [F2].
Every derivation descends to a map out of . Let be a -module and . Since is free with basis , there is a unique -linear map with for all . By [F2] the map is additive, -constant and satisfies Leibniz, so kills each relator: , similarly , and ; here we used that is -linear, so that . The three families generate as a -submodule and [F1] presents , so factors through a -linear with , that is, .
The construction of step 2.1 is the unique inverse. Let be -linear with for some . Evaluating on gives for every , where is the map produced in step 2.1. The classes range over the images of a basis of the free module , so they generate as a -module, and two -linear maps agreeing on a generating set are equal; hence . Therefore is a bijection for every -module .
Naturality in . Let be -linear and let . Then as maps , since both sides send to , and is again -linear, so the assignment of step 3.1 carries followed by to the derivation ; this is exactly the commutativity required of the bijections in [F3].
Conclusion. Steps 1.1, 2.1 and 3.1 verify both clauses of [F3] for the pair of [F1], and step 4.1 verifies naturality, so that pair is a Kähler differential module for . The construction used only the free module on the set and the submodule generated by the three relator families, so it exists for every ring homomorphism with no finiteness hypothesis, and step 3.1 exhibits the classes as a generating set of over .
Depends on
Used by
- Derivations are maps out of Ω Corollary
- Sheaf of relative Kähler differentials Definition
- Finite separable extensions have zero Omega Example
- Finite-type field extensions with zero Ω Lemma
- The diagonal ideal modulo its square is Omega Lemma
- Conormal exact sequence for an algebra quotient Theorem
- Transitivity sequence for differential modules Theorem
Dependency tree · two levels
5 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.2–3 (standard reference, not scraped)
- Vakil §22.2.2, p.575 (standard reference, not scraped)