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 , a finitely generated subgroup , and an element .
Every finitely generated subgroup of a finite-rank free group is a free factor of some finite-index subgroup (Every finitely generated subgroup of a finite-rank free group is a free factor of a finite-index subgroup).
Every subgroup of a free group is free (Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis), and free groups are residually finite (Free groups are residually finite).
Proof
By [F1], choose a finite-index subgroup with a free-product decomposition . If , set . Then has finite index in , contains , and omits .
If , the free-product decomposition gives a retraction that fixes and kills . Since , the element is nonidentity. By [F2] there is a homomorphism to a finite group with . The homomorphism to has finite image. Let be the preimage of its diagonal subgroup. Then has finite index in , contains because , and omits because . Thus also has finite index in .
In either case let be the core of in , the intersection of its finitely many conjugates. Then is a finite-index normal subgroup of contained in . Consequently while , so . 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 and were arbitrary, is subgroup separable.
Depends on
- A subgroup is separable when it is closed in the profinite topology, and a group is LERF when every finitely generated subgroup is separable
- Every finitely generated subgroup of a finite-rank free group is a free factor of a finite-index subgroup
- Under the stated choice boundary, every subgroup of a free group is free with its nontrivial Schreier generators as a basis
- Free groups are residually finite
- The free product of an arbitrary family of groups
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
- Brian Osserman, Math 6112 notes on inverse limits and profinite groups (standard reference, not scraped)
- H. W. Lenstra, Profinite groups and Galois groups (standard reference, not scraped)
- Rita Gitik and Eliyahu Rips, On separability properties of free groups (standard reference, not scraped)