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.
If is flat then , and for finitely generated this is equivalent to generation by an idempotent
Statement
Let be a commutative ring and an ideal.
- If is flat as an -module, then .
- If for an idempotent , then is flat.
- If is finitely generated, then the first two clauses combine to the usual criterion: is flat if and only if is generated by an idempotent.
Facts & Assumptions
Given: A commutative ring and an ideal .
Flatness is equivalent to injectivity of for every ideal (Flatness is equivalent to preserving injections and to the ideal and finitely generated ideal tests).
For every -module , there is a natural isomorphism ( naturally).
A direct summand of a flat module is flat (Direct sums and direct summands of flat modules are flat).
If a finite module satisfies , then for some (Determinant trick for Nakayama).
Proof
Assume is flat. Apply [L1] to the ideal and the module . The multiplication map is injective, but it is also the zero map because every acts trivially on . Hence By [L2], this tensor product is , so .
If with , then and the quotient identifies with the direct summand . Since is free, hence flat, [L3] shows that is flat. Thus is flat.
Now assume is finitely generated and is flat. Step 1.1 gives , so [L4] applied to the finite module gives with . Thus every satisfies , whence ; the reverse inclusion follows from . Moreover , so . Therefore is generated by an idempotent.
Step 1.1 proves clause 1, step 1.2 proves clause 2 and the reverse implication in clause 3, and step 2.1 proves the forward implication in clause 3.
Depends on
Used by
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
- Allen B. Altman and Steven L. Kleiman, A Term of Commutative Algebra, Exercise (9.9) (standard reference, not scraped)
- Stacks Project, Section 10.39: Flat modules and flat ring maps (standard reference, not scraped)