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 free group on one generator is isomorphic to
Example
Let be a one-element set. Every free group on is isomorphic to , by the isomorphism carrying to .
Facts & Assumptions
Given: The word-quotient free group .
Every class in contains exactly one reduced word (Every class in contains exactly one reduced word).
If has infinite order, then for , implies (If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for ).
If and are free groups on the same set , then there is a unique group isomorphism with (Free groups on the same set are uniquely isomorphic compatibly with their generators).
The word-quotient group , with , is a free group on (The word-quotient group satisfies the universal property of the free group on ).
The cyclic subgroup generated by is exactly the set of integer powers of : (, and every cyclic group is abelian).
Integer powers satisfy for all (Exponent laws in a group: and for all , and when and commute).
Verification
A reduced word on cannot contain both letters, since a change from one to the other creates an adjacent inverse pair; hence every reduced word is uniquely for or for , with the empty word corresponding to exponent .
Thus generates the group, and no positive power is the identity because its reduced representative is nonempty; therefore has infinite order.
Since generates by step 2.1, [L5] makes every element of equal to for some , and [L2] applied to the infinite-order element makes that exponent unique; so is a well-defined injection, it is surjective because , and [L6] makes it a homomorphism. Construct as this isomorphism, which carries to .
By [L4] the word-quotient model is a free group on , so for any free group on the isomorphism of [L3] satisfies ; then is an isomorphism carrying to .
Depends on
- Every class in $W(X)/{\sim}$ contains exactly one reduced word
- The word-quotient group $W(X)/{\sim}$ satisfies the universal property of the free group on $X$
- $\langle g \rangle = \{\, g^{n} : n \in \mathbb{Z} \,\}$, and every cyclic group is abelian
- If $\operatorname{ord}(g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$, the powers $g^{0}, \dots, g^{n-1}$ are distinct, and $\langle g \rangle$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$
- Exponent laws in a group: $g^{m+n} = g^{m}g^{n}$ and $(g^{m})^{n} = g^{mn}$ for all $m, n \in \mathbb{Z}$, and $(gh)^{n} = g^{n}h^{n}$ **when $g$ and $h$ commute**
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- Free groups on the same set are uniquely isomorphic compatibly with their generators
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: 79 results over 20 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
- John McKernan, Presentations and Groups of Small Order, Lecture 12 (standard reference, not scraped)