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.
Extension of scalars is left adjoint to restriction of scalars
Statement
Let be a homomorphism of commutative rings, let be an -module, and let be an -module. There is a natural bijection
It sends to . Its inverse sends to the -linear map determined by
Facts & Assumptions
Given: A ring map , an -module , and an -module .
Restriction uses , while extension is the -module with (Restriction of scalars and extension of scalars along a ring homomorphism ).
Balanced pairings induce unique homomorphisms from tensor products (Universal property of the tensor product for balanced maps into abelian groups).
An elementary-tensor prescription descends exactly when its underlying pairing is balanced (A formula on elementary tensors defines a homomorphism exactly when its underlying pairing is balanced).
Proof
If is -linear, define . Then , so is -linear into the restriction of .
If is -linear, the pairing is -balanced because . By [L2] and [L3] it induces a homomorphism .
The map is -linear because .
For , one has .
Precomposition in and postcomposition in commute with both displayed formulas, so the inverse bijections are natural in both modules.
For , one has by -linearity, so uniqueness on elementary tensors gives .
Steps 2.2, 2.3 and 3.1 prove that extension of scalars is left adjoint to restriction of scalars.
Depends on
Used by
Dependency tree · two levels
12 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
- MIT 18.721 Algebraic Geometry notes, Lemma 2.1.35 (standard reference, not scraped)