Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The free group on one generator is isomorphic to (Z,+)(\mathbb Z,+)

Example

Let X={x}X=\{x\} be a one-element set. Every free group (F,i)(F,i) on XX is isomorphic to (Z,+)(\mathbb Z,+), by the isomorphism carrying i(x)i(x) to 11.

Facts & Assumptions

Given: The word-quotient free group Fword({x})F_{\mathrm{word}}(\{x\}).

[L1]

Every class in W(X)/W(X)/{\sim} contains exactly one reduced word (Every class in W(X)/W(X)/{\sim} contains exactly one reduced word).

[L3]

If (F,i)(F,i) and (F,i)(F',i') are free groups on the same set XX, then there is a unique group isomorphism ϕ:FF\phi:F\to F' with ϕi=i\phi\circ i=i' (Free groups on the same set are uniquely isomorphic compatibly with their generators).

[L4]

The word-quotient group W(X)/W(X)/{\sim}, with x[x]x\mapsto[x], is a free group on XX (The word-quotient group W(X)/W(X)/{\sim} satisfies the universal property of the free group on XX).

[L5]

The cyclic subgroup generated by gg is exactly the set of integer powers of gg: g={gn:nZ}\langle g\rangle=\{g^n:n\in\mathbb Z\} (g={gn:nZ}\langle g \rangle = \{\, g^{n} : n \in \mathbb{Z} \,\}, and every cyclic group is abelian).

Verification

technique · constructive
1.1

A reduced word on {x,x1}\{x,x^{-1}\} cannot contain both letters, since a change from one to the other creates an adjacent inverse pair; hence every reduced word is uniquely xnx^n for n0n\geq0 or xnx^{-n} for n1n\geq1, with the empty word corresponding to exponent 00.

L1given
2.1

Thus [x][x] generates the group, and no positive power [x]n[x]^n is the identity because its reduced representative xnx^n is nonempty; therefore [x][x] has infinite order.

L1step 1.1
3.1

Since [x][x] generates by step 2.1, [L5] makes every element of Fword({x})F_{\mathrm{word}}(\{x\}) equal to [x]k[x]^k for some kZk\in\mathbb Z, and [L2] applied to the infinite-order element [x][x] makes that exponent unique; so θ([x]k):=k\theta([x]^k):=k is a well-defined injection, it is surjective because k=θ([x]k)k=\theta([x]^k), and [L6] makes it a homomorphism. Construct θ:Fword({x})(Z,+)\theta:F_{\mathrm{word}}(\{x\})\to(\mathbb Z,+) as this isomorphism, which carries [x][x] to 11.

L2L5L6step 2.1construct
4.1

By [L4] the word-quotient model is a free group on XX, so for any free group (F,i)(F,i) on XX the isomorphism ϕ:FFword({x})\phi:F\to F_{\mathrm{word}}(\{x\}) of [L3] satisfies ϕ(i(x))=[x]\phi(i(x))=[x]; then θϕ\theta\circ\phi is an isomorphism F(Z,+)F\to(\mathbb Z,+) carrying i(x)i(x) to 11.

L3L4step 3.1discharge-construct

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: 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