Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Positive roots suffice for divisibility

PDF p. 13: Divisibility of the Picard group

Statement

An abelian group is divisible if and only if, for every positive integer n, multiplication by n is surjective.

An abelian group is written additively. Multiplication by n means repeated addition, extended to negative integers using additive inverses. A map is surjective if every element of its codomain has a preimage.

Facts & Assumptions

[F1]

A divisible abelian group is a divisible integer module: for every nonzero integer m and every element a, there is an element b with mb = a (Divisible modules over an integral domain).

Given: An abelian group A.

Goal: Prove the stated equivalence.

Proof

1.1F1given

If A is divisible, apply [F1] with m=n for each positive n to obtain surjectivity.

2.1F1givenchoose∎

Conversely, assume each positive multiplication map is surjective. For nonzero m and a in A, choose b with ∣m∣b=a. If m is positive use b; if m is negative use -b. In either case the chosen element maps to a under multiplication by m. Thus [F1] gives divisibility.

Depends on

Used by · 1

Dependency tree · 3 levels

Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.