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.
Localisation commutes with quotient modules and arbitrary direct sums
Statement
Let be a commutative ring and let be multiplicative.
- For every submodule , there is a natural isomorphism
- For every family of left -modules, there is a natural isomorphism
Facts & Assumptions
Given: A commutative ring and a multiplicative subset .
Localisation is naturally (Localisation of modules is extension of scalars).
Tensoring a right-exact sequence with a fixed module preserves right exactness (Tensoring is right exact).
Tensor products commute with arbitrary direct sums (Tensor products commute with arbitrary direct sums).
A quotient module is the module of cosets (Quotient module with scalar multiplication on additive cosets).
Proof
For a submodule , the sequence is right exact, so [L2] and [L1] give a right-exact sequence . Therefore is the quotient of by the image of , namely by the submodule .
For a family , [L3] and [L1] give .
Thus naturally in and .
Steps 2.1 and 1.2 prove the quotient and direct-sum claims.
Depends on
Used by
- Localisation commutes with finite intersections of submodules Corollary
- Localisation need not commute with infinite products Example
- Localised Hom can fail without finite presentation of the source Example
- Assuming the Axiom of Choice, a sequence of modules is exact exactly when all prime localisations are exact Theorem
- Support of an arbitrary direct sum is the union of the supports Theorem
Dependency tree · two levels
19 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
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Corollary 12.22 (standard reference, not scraped)
- The Stacks Project, Section 10.9: Localization (standard reference, not scraped)