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.
Localised Hom can fail without finite presentation of the source
Example
Fix a prime number , let , let
and let . The source is not finitely presented, and the natural map
is not surjective.
Facts & Assumptions
Given: A prime number , the multiplicative set , the free -module , and the target module .
The finite-presentation theorem gives an isomorphism only under finite-presentation hypotheses on the source (Localisation of Hom for finite and finitely presented modules).
Localisation commutes with direct sums, so (Localisation commutes with quotient modules and arbitrary direct sums).
A homomorphism out of a direct sum is determined by its values on the coordinate inclusions (Universal property of a direct sum of modules, The direct sum of an indexed family of modules).
Verification
The module is free on countably many generators, so it is not finitely generated and therefore not finitely presented.
By [L2] and [L3], there is a -linear map with for every .
Suppose were in the image of the localisation-of-Hom map. Then there would be a homomorphism and an integer such that for every . Taking gives , impossible in . Therefore is not in the image.
So the localisation-of-Hom map fails to be surjective for this non-finitely-presented source, exactly as warned by [L1].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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., Exercise 12.26 (standard reference, not scraped)