Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)
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.

Every finitely generated free group is subgroup separable

Statement

Every finitely generated free group is subgroup separable.

Facts & Assumptions

Given: A finitely generated free group F, a finitely generated subgroup H≤F, and an element g∈F∖H.

[F1]

Every finitely generated subgroup H of a finite-rank free group F is a free factor of some finite-index subgroup K≤F (Every finitely generated subgroup of a finite-rank free group is a free factor of a finite-index subgroup).

Proof

technique · direct
1.1F1given

By [F1], choose a finite-index subgroup K≤F with a free-product decomposition K=H∗J. If g∉K, set L=K. Then L has finite index in F, contains H, and omits g.

2.1F1F2step 1.1algebra

If g∈K, the free-product decomposition gives a retraction r:K→H that fixes H and kills J. Since g∉H, the element d=gr(g)−1 is nonidentity. By [F2] there is a homomorphism π:K→Q to a finite group with π(d)≠1. The homomorphism k↦(π(k),π(r(k))) to Q×Q has finite image. Let L be the preimage of its diagonal subgroup. Then L has finite index in K, contains H because r(h)=h, and omits g because π(g)≠π(r(g)). Thus L also has finite index in F.

3.1step 1.1step 2.1algebra∎

In either case let N be the core of L in F, the intersection of its finitely many conjugates. Then N is a finite-index normal subgroup of F contained in L. Consequently H⊆HN⊆L while g∉L, so g∉HN. This is exactly the separation required by A subgroup is separable when it is closed in the profinite topology, and a group is LERF when every finitely generated subgroup is separable. Since H and g were arbitrary, F is subgroup separable.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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