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 is not the identity and is a natural number, then is not the identity. Equivalently, every nonidentity element has infinite order in the sense of The order of a finite group and the order of an element, with when no positive power of is the identity.
Facts & Assumptions
Given: A free group on a set , a nonidentity element , and a natural number .
Every nonempty reduced word has the form with nonempty and cyclically reduced (Every nonempty reduced word has the form with nonempty and cyclically reduced).
The reduced words on form a group when the product of reduced words is their concatenation followed by free reduction, and the map sending to the one-letter word has the universal property of the free group on (Reduced words form the free group on an alphabet).
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).
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).
An element has infinite order exactly when no positive natural power of is the identity (The order of a finite group and the order of an element, with when no positive power of is the identity).
Proof
First work in the reduced-word model and let be a nonidentity element. Then is itself a nonempty reduced word, and [L1] gives a literal reduced factorisation with nonempty and cyclically reduced.
For every , the literal concatenation is reduced and nonempty: each copy is reduced, and the seam between consecutive copies does not cancel because the last letter of is not the inverse of its first.
In the product , the adjacent factors cancel between copies, leaving ; its two outer seams are the same seams as in the reduced word , so it is reduced and nonempty by step 2.1, and [L2] therefore shows that is not the identity.
The reduced-word model is a free group on by [L2], so [L3] gives a generator-compatible isomorphism from an arbitrary free group on onto it; transporting along that isomorphism, which preserves the identity and natural powers, step 3.1 gives .
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.
Depends on
- Every nonempty reduced word has the form $tct^{-1}$ with $c$ nonempty and cyclically reduced
- Reduced words form the free group on an alphabet
- Free groups on the same set are uniquely isomorphic compatibly with their generators
- Cyclically reduced words
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
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
- Wilhelm Magnus, Abraham Karrass, and Donald Solitar, Combinatorial Group Theory (standard reference, not scraped)