Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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 residually finite

Statement

Free groups are residually finite.

Facts & Assumptions

Given: A free group F(X) and a nonidentity element gF(X).

[F1]

The finite residual is trivial exactly when every nonidentity element is omitted by some finite-index normal subgroup (The finite residual is the intersection of the finite-index normal subgroups, and a group is residually finite when that intersection is trivial).

Proof

technique · direct
1.1

By [L1], replace g by a conjugate and assume it is represented by a nontrivial cyclically reduced word w=x1xn in finitely many letters. Build a finite pointed labelled graph with distinct vertices v0,,vn and a distinguished path from vk1 to vk labelled xk. Because w is reduced, these prescribed edges define partial injective transitions. Complete each partial transition to a permutation of the finite vertex set, so every vertex has exactly one incoming and one outgoing edge of each used label.

L1givenconstruct
2.1

Reading words from v0 gives an action of the free group on the finite vertex set. The word w sends v0 to the distinct vertex vn. Therefore the induced homomorphism F(X)Sym(V) does not kill g.

step 1.1algebra
3.1

The kernel of that finite permutation action has finite index and omits g. Since g1 was arbitrary, [F1] shows that the finite residual is trivial. Hence free groups are residually finite.

F1step 2.1

Depends on

Used by

Dependency tree · two levels

13 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