Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

The additive group of Zp is torsion-free

Statement

The additive group of Zp has no nonzero torsion element.

Facts & Assumptions

Given: An element x=(xn)Zp and a positive integer m with mx=0.

[F1]

An element of Zp is a compatible tuple of residue classes modulo pn (The p-adic integers are the compatible residue-class tuples in the inverse limit of Z mod p^n).

Proof

technique · direct
1.1

Write m=pau with a0 and pu. Multiplication by u is an automorphism of each cyclic group Z/pnZ, so from mx=0 it follows that pax=0. Assume for contradiction that x0, and choose the least index t1 with xt0. By [F1], the earlier coordinates vanish and the tuple is compatible, so xt is represented by an integer divisible by pt1; because xt0 in Z/ptZ, that representative is not divisible by pt. Thus xt has exact p-adic divisibility pt1.

F1givenchooseassume-contraalgebra
2.1

Compatibility propagates that exact divisibility to the coordinate xt+aZ/pt+aZ, because reducing xt+a modulo pt gives the nonzero class xt. Hence paxt+a is divisible by pt+a1 but not by pt+a, so it is nonzero in Z/pt+aZ. This contradicts pax=0. Therefore x=0, and Zp is torsion-free.

F1step 1.1discharge-contradiction

Depends on

Used by

Dependency tree · two levels

3 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