A finitely generated group has only finitely many subgroups of a given index


Let G be a finitely generated group and let n be a positive integer. Let H be a subgroupMathworldPlanetmathPlanetmath of G of index n and consider the action of G on the coset space (G:H) by right multiplication. Label the cosets 1,,n, with the coset H labelled by 1. This gives a homomorphismMathworldPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath ϕ:GSn. Now, xH if and only if Hx=H, that is, G fixes the coset H. Therefore, H=StabG(1)={gG1(gϕ)=1}, and this is completely determined by ϕ. Now let X be a finite generating setPlanetmathPlanetmath for G. Then ϕ is determined by the images xϕ of the generatorsPlanetmathPlanetmathPlanetmathPlanetmath xX. There are |Sn|=n! choices for the image of each xX, so there are at most n!|X| homomorphisms GSn. Hence, there are only finitely many possibilities for H.

References

  • 1 M. Hall, Jr., A topologyMathworldPlanetmath for free groupsMathworldPlanetmath and related groups, Ann. of Math. 52 (1950), no. 1, 127–139.
Title A finitely generated group has only finitely many subgroups of a given index
Canonical name AFinitelyGeneratedGroupHasOnlyFinitelyManySubgroupsOfAGivenIndex
Date of creation 2013-03-22 15:16:03
Last modified on 2013-03-22 15:16:03
Owner avf (9497)
Last modified by avf (9497)
Numerical id 6
Author avf (9497)
Entry type Theorem
Classification msc 20E07
Related topic Group
Related topic FinitelyGenerated