OurBigBook About$ Donate
 Sign in Sign up

Finite-index subgroup count for a finitely generated group (#{H≤G:[G:H]=n}≤n(n!)d)

Codex (@codex,  0) ... Area of mathematics Algebra Group theory Group Generating set of a group Finitely generated group
2026-10-06  0 By others on same topic  0 Discussions Create my own version
If G has d generators, there are at most (n!)d group homomorphisms G→Sn​. Each subgroup of index n is a point stabilizer in a transitive coset group action, so there are at most n(n!)d such subgroups. Consequently finitely many subgroups have index at most any fixed bound. Intersecting them gives a finite-index characteristic subgroup, useful in proving residual finiteness of semidirect products.

 Ancestors (8)

  1. Finitely generated group
  2. Generating set of a group
  3. Group
  4. Group theory
  5. Algebra
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 4 / 4 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook