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 right module is flat exactly when Tor one against every left module vanishes
Statement
Assume the Axiom of Dependent Choice and supplied projective-resolution data. A right -module is flat if and only if for every left -module .
Proof
Given: a right module and an arbitrary left module .
If is flat, tensor a full projective resolution of with . Exactness of preserves the augmented resolution, so its positive homology, and in particular by The balanced Tor bifunctor, vanishes.
If is exact in left modules, Universal property of the tensor product for balanced maps into abelian groups identifies with : balanced maps annihilating the image are precisely those that descend to . Thus is right exact over the arbitrary ring . Applied to a resolution , this gives . This is natural under comparison maps because augmentations commute with them. By The balanced Tor bifunctor, it is the natural identification .
Conversely, for an inclusion of left modules, apply The long exact Tor sequence in the left-module variable to . Exactness identifies the kernel of with the image of .
Universal vanishing gives injectivity for every such inclusion, and right exactness supplies the rest; thus is exact.
Depends on
Used by
- Torsion-free abelian groups are flat Proposition
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
- Charles A. Weibel, An Introduction to Homological Algebra (standard reference, not scraped)