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.
Torsion-free abelian groups are flat
Statement
Every torsion-free abelian group is a flat -module.
Proof
Given: a torsion-free abelian group .
First every subgroup is finite free, by induction on the finite integer . The case is immediate. Project to the last coordinate. If its image is zero, apply induction in . Otherwise let be the least positive integer in the image, using The well-ordering principle. Division with remainder by , from Division with remainder in : for and there are unique with and , shows that every image element is a multiple of : its remainder also lies in the image and cannot be positive and smaller than . Choose one with last coordinate . Subtracting integer multiples of gives , and the kernel is a subgroup of , so induction completes the proof. These are finitely many existential choices, not a choice function on an infinite family.
Let be injective and have zero image in . By The tensor product from the additive group underlying the free -module on , elementary tensors, and finite tensor sums, this equality to zero has a finite witness: the formal sum is a finite integer linear combination of defining additivity and balancing relations in the free abelian group on .
For any subgroup generated by a finite list , argue as follows. Choose a maximal integer-linearly-independent sublist ; there are only finitely many sublists. For each , maximality supplies an equation with a positive integer: if is not already on the sublist, a dependence among it and the has nonzero coefficient at , since the are independent. For a member of the sublist use . The finitely many equations give for , with empty product . Multiplication by is injective on the torsion-free , and . Thus is finite free by step 1.1. This also covers and .
For one finite basis of and any abelian group , the relations of The tensor product from the additive group underlying the free -module on , elementary tensors, and finite tensor sums identify with : , with inverse . The composites are identities on elementary tensors and tuples. Therefore tensoring an injection with is the corresponding coordinatewise injection. No simultaneous choice of bases for all finitely generated subgroups is made.
Let be generated by all the elements of appearing in the original sum and in this finite witness. Every relation in the witness is then a valid relation in the tensor presentation for . Consequently the same sum maps to zero in . Step 3.1 implies , so its image in is zero.
Thus preserves injections. It is right exact by Tensoring is right exact, whose commutative-ring hypothesis holds for . It therefore preserves every short exact sequence and is exact, so is flat by Left and right flat modules over an arbitrary ring. The finite-rank and finite-witness arguments require no choice axiom.
Depends on
- Left and right flat modules over an arbitrary ring
- Division with remainder in $\mathbb{Z}$: for $a \in \mathbb{Z}$ and $b > 0$ there are unique $q, r \in \mathbb{Z}$ with $a = qb + r$ and $0 \le r < b$
- The well-ordering principle
- The tensor product $M\otimes_R N$ from the additive group underlying the free $\mathbb Z$-module on $M\times N$, elementary tensors, and finite tensor sums
- Tensoring is right exact
Used by
Dependency tree · two levels
33 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)