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.
Every abelian group embeds in a divisible abelian group
Statement
Every abelian group admits an injective homomorphism into a divisible abelian group. The construction uses no choice principle.
Facts & Assumptions
Given: An abelian group , viewed as a -module.
The canonical map is surjective and identifies with , where is its kernel (Every module is a quotient of a free module).
An abelian group is divisible if multiplication by every nonzero integer is surjective (Divisible modules over an integral domain).
Direct sums consist of finite-support tuples (The direct sum of an indexed family of modules).
is a field and therefore permits division by every nonzero integer (The rationals form a field).
Proof
Let , let be the canonical surjection, and put ; by [L1], .
The group is divisible: for a finite-support tuple and a nonzero integer , divide each of its finitely many nonzero rational coordinates by using [L2].
Embed coordinatewise into , and regard as a subgroup of . Define and by . This is well defined and injective because .
A quotient of a divisible group is divisible: if and , choose with by step 1.2; then . Thus is divisible by [F1].
Composing the isomorphism from step 1.1 with the injection of step 2.1 embeds in the divisible group . Every division was coordinatewise on finite support, so no choice was used.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 34 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- A. Kleshchev, Lectures on Abstract Algebra for Graduate Students, sections 3.6, 3.14, and 3.15 (standard reference, not scraped)
- The Stacks Project, Algebra (standard reference, not scraped)
- P. Hekmati, Homological Algebra, section 3.1 (standard reference, not scraped)