Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

Free groups are torsion-free

Statement

Every free group is torsion-free: if gg is not the identity and n1n\geq 1 is a natural number, then gng^n is not the identity. Equivalently, every nonidentity element has infinite order in the sense of The order G|G| of a finite group and the order ord(g)\operatorname{ord}(g) of an element, with ord(g)=\operatorname{ord}(g) = \infty when no positive power of gg is the identity.

Facts & Assumptions

Given: A free group FF on a set XX, a nonidentity element gFg\in F, and a natural number n1n\geq 1.

[L1]

Every nonempty reduced word has the form tct1tct^{-1} with cc nonempty and cyclically reduced (Every nonempty reduced word has the form tct1tct^{-1} with cc nonempty and cyclically reduced).

[L2]

The reduced words on XX1X\sqcup X^{-1} form a group when the product of reduced words is their concatenation followed by free reduction, and the map sending xXx\in X to the one-letter word xx has the universal property of the free group on XX (Reduced words form the free group on an alphabet).

[L3]

Free groups on the same set are uniquely isomorphic compatibly with their generators (Free groups on the same set are uniquely isomorphic compatibly with their generators).

[F1]

A reduced word is cyclically reduced when it is empty or its first letter is not the formal inverse of its last letter (Cyclically reduced words).

Proof

technique · direct
1.1

First work in the reduced-word model and let ww be a nonidentity element. Then ww is itself a nonempty reduced word, and [L1] gives a literal reduced factorisation w=tct1w=tct^{-1} with cc nonempty and cyclically reduced.

L1L2given
2.1

For every n1n\geq1, the literal concatenation cnc^n is reduced and nonempty: each copy is reduced, and the seam between consecutive copies does not cancel because the last letter of cc is not the inverse of its first.

F1step 1.1
3.1

In the product wnw^n, the adjacent factors t1tt^{-1}t cancel between copies, leaving tcnt1tc^nt^{-1}; its two outer seams are the same seams as in the reduced word tct1tct^{-1}, so it is reduced and nonempty by step 2.1, and [L2] therefore shows that wnw^n is not the identity.

L2step 1.1step 2.1
4.1

The reduced-word model is a free group on XX by [L2], so [L3] gives a generator-compatible isomorphism from an arbitrary free group on XX onto it; transporting gg along that isomorphism, which preserves the identity and natural powers, step 3.1 gives gneg^n\neq e.

L2L3step 3.1
5.1

Thus no nonidentity element has a positive power equal to the identity, so by [F2] every nonidentity element has infinite order and every free group, including the trivial free group on the empty set, is torsion-free.

F2step 4.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 59 results over 16 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