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.
Assuming the Axiom of Choice, a sequence of modules is exact exactly when all prime localisations are exact
Statement
Assume the Axiom of Choice.
Let
be a sequence of -module homomorphisms with . Then the sequence is exact at if and only if, for every prime ideal , the localised sequence
is exact at . Equivalently, it suffices to check exactness at every maximal ideal.
Facts & Assumptions
Given: A commutative ring and a sequence of left -modules with .
Exactness at means (Exact sequences and short exact sequences of modules).
Localisation identifies kernels and images, and it commutes with quotient modules (Localisation commutes with kernels images and cokernels, Localisation commutes with quotient modules and arbitrary direct sums).
A module is zero exactly when all of its prime localisations are zero, equivalently all of its maximal localisations are zero (Assuming the Axiom of Choice, local criteria for zero modules and for injective, surjective, and bijective maps).
The image and kernel are the standard submodule constructions attached to a module homomorphism (Module homomorphism and isomorphism, kernel, image and cokernel).
Proof
Because , one has , so the quotient module is defined. By [L1], the original sequence is exact at if and only if .
For every prime ideal , [L2] gives . Therefore the localised sequence is exact at if and only if .
By [L3], if and only if for every prime ideal , and this is equivalent to for every maximal ideal . Combining this with steps 1.1 and 2.1 gives the prime-local and maximal-local exactness criteria.
Step 3.1 proves the theorem.
Depends on
- Assuming the Axiom of Choice, local criteria for zero modules and for injective, surjective, and bijective maps
- Localisation commutes with kernels images and cokernels
- Localisation commutes with quotient modules and arbitrary direct sums
- Exact sequences and short exact sequences of modules
- Module homomorphism and isomorphism, kernel, image and cokernel
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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., Proposition 13.43 (standard reference, not scraped)
- J. S. Milne, A Primer of Commutative Algebra, v4.03, Proposition 5.16 (standard reference, not scraped)