Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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 A admits an injective homomorphism into a divisible abelian group. The construction uses no choice principle.

Facts & Assumptions

Given: An abelian group A, viewed as a Z-module.

[L1]

The canonical map F=Z(A)→A is surjective and identifies A with F/K, where K is its kernel (Every module is a quotient of a free module).

[F1]

An abelian group is divisible if multiplication by every nonzero integer is surjective (Divisible modules over an integral domain).

[F2]

Direct sums consist of finite-support tuples (The direct sum of an indexed family of modules).

[L2]

Q is a field and therefore permits division by every nonzero integer (The rationals form a field).

Proof

technique · constructive
1.1

Let F=Z(A), let ε:F→A be the canonical surjection, and put K=ker⁡ε; by [L1], A≅F/K.

L1construct
1.2

The group Q is divisible: for a finite-support tuple q and a nonzero integer n, divide each of its finitely many nonzero rational coordinates by n using [L2].

F2L2
2.1

Embed F coordinatewise into Q:=Q(A), and regard K as a subgroup of Q. Define D:=Q/K and j:F/K→D by j(f+K)=f+K. This is well defined and injective because F∩K=K.

step 1.1F2L2construct
2.2

A quotient of a divisible group is divisible: if q+K∈D and n≠0, choose y∈Q with ny=q by step 1.2; then n(y+K)=q+K. Thus D is divisible by [F1].

step 1.2F1
3.1

Composing the isomorphism A≅F/K from step 1.1 with the injection j of step 2.1 embeds A in the divisible group D. Every division was coordinatewise on finite support, so no choice was used.

step 1.1step 2.1step 2.2discharge-construct∎

Depends on

Used by

Dependency tree · two levels

13 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