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.
A short exact sequence with flat quotient remains short exact after tensoring
Statement
Let
be a short exact sequence of modules over a commutative ring . If is flat, then for every -module the sequence
is short exact.
Facts & Assumptions
Given: A short exact sequence with flat, and an -module .
Flatness makes tensoring preserve injections (Flat and faithfully flat modules and ring homomorphisms).
Tensoring is right exact (Tensoring is right exact).
Free modules are flat, and flatness means that tensoring preserves exact sequences; hence tensoring a short exact sequence with a free module preserves short exactness (Under the stated choice boundary, free modules are projective and hence flat, Flat and faithfully flat modules and ring homomorphisms).
Every module admits a canonical surjection from a free module (Every module is a quotient of a free module).
A short exact sequence has an injective first map, a surjective second map, and image equal to kernel (Exact sequences and short exact sequences of modules).
Proof
By [L4], choose a surjection from a free module and let , so is short exact.
Tensor the sequence in step 1.1 with each of . By [L2], the three resulting columns are right exact. The map is injective by flatness of and [L1].
Tensor the given short exact sequence with . Since is flat by [L3], the middle row is short exact. Tensoring it with and gives right-exact bottom and top rows by [L2].
Let map to zero in . By right exactness of the -column, lift to . Its image maps to zero in , so right exactness of the -column gives mapping to .
The image of in maps in to the image of , which is zero because came from . The injectivity in step 2.1 therefore makes the image of in zero.
By right exactness of the bottom row in step 2.2, choose mapping to . In , the images of and of are both ; injectivity of from step 2.2 makes the image of .
The composite is zero because is zero. Hence step 5.1 gives , proving injective.
Right exactness [L2] already gives exactness at , surjectivity onto , and the terminal zero. Together with step 6.1, the tensored sequence is short exact.
Depends on
Used by
Dependency tree · two levels
20 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 Project, Lemma 10.39.12 (standard reference, not scraped)
- C. Dennis, Week 4 on tensor products and flatness (standard reference, not scraped)