Previously we learned how to count the number of finite index subgroups of a finitely generated group . But for various purposes we might instead want to count conjugacy classes of finite index subgroups, e.g. if we wanted to count isomorphism classes of connected covers of a connected space with fundamental group .
There is also a generating function we can write down that addresses this question, although it gives the answer less directly. It can be derived starting from the following construction. If is a groupoid, then , the free loop space or inertia groupoid of , is the groupoid of maps , where is the groupoid with one object and automorphism group . Explicitly, this groupoid has
- objects given by automorphisms of the objects , and
- morphisms given by morphisms in such that
It’s not hard to see that , so to understand this construction for arbitrary groupoids it’s enough to understand it for connected groupoids, or (up to equivalence) for groupoids with a single object and automorphism group . In this case, is the groupoid with objects the elements of and morphisms given by conjugation by elements of ; equivalently, it is the homotopy quotient or action groupoid of the action of on itself by conjugation.
In particular, when is finite, this quotient always has groupoid cardinality . Hence:
Observation: If is an essentially finite groupoid (equivalent to a groupoid with finitely many objects and morphisms), then the groupoid cardinality of is the number of isomorphism classes of objects in .
I promise this is relevant to counting subgroups!
Where are those subgroups?
Now let be the groupoid of actions of a finitely generated group on -element sets. The number of isomorphism classes of objects in this groupoid is the number of isomorphism classes of -sets with elements, and so this number can also be identified with the groupoid cardinality of the free loop space . But this is just
which can in turn be identified with the groupoid of -sets with elements. In other words, the number of isomorphism classes of -sets with elements is
Now, the collection of all isomorphism classes of finite -sets is a free commutative monoid (under disjoint union) on the isomorphism classes of finite transitive -sets. In other words, such an isomorphism class is described by describing the multiplicity with which each finite transitive -set occurs within it. This gives us the following count.
Theorem: Let denote the number of conjugacy classes of subgroups of index in . Then
Incidentally, this result and the previous result about subgroups of index are both exercises in Stanley’s Enumerative Combinatorics: Volume II (more precisely, Exercise 5.13a and c).
It would be nice to write this in a form that lets us more clearly extract the coefficients from the LHS. If denotes the number of subgroups of of index , then taking logarithms gives
Extracting the coefficient of from both sides gives
and hence Möbius inversion gives the following.
Theorem: With and as above, we have
Example. Let . Then for all . This recovers
Example. Now let . For abelian groups counting conjugacy classes of subgroups is the same as counting subgroups, so and turns out to be
In the same way that has Dirichlet series , this function has Dirichlet series . By induction, we find that the number of subgroups of of index is
which has Dirichlet series . We leave it as an entertaining exercise for the reader to give a direct proof of this.
A slower discussion
The generating function given above can be interpreted as the weighted groupoid cardinality of the groupoid of -sets, and the Möbius inversion formula gives some sort of relationship between transitive -sets and transitive -sets. What exactly is this relationship, and can we use it to give a more direct proof of the Möbius inversion formula?
For starters, a -set is the same thing (in the sense that we have an equivalence of categories) as a pair consisting of a -set and an automorphism of . (We already used this fact when we passed from the free loop space description to talking about above.) The -set is transitive if the combination of the action of and the automorphism is transitive. And we can identify subgroups of with pointed transitive -sets. So what do these look like?
If is a finite transitive -set, then its decomposition as a -set consist of a number of copies of the same finite transitive -set of size , which are cyclically permuted by the automorphism . If is pointed, then one of these copies has a basepoint in it, so can canonically be identified with where is the stabilizer of . The automorphism can be used to identify all of the other copies of with the copy containing the basepoint, so the only remaining data in this automorphism is the induced automorphism of .
The automorphism group of is , where denotes the normalizer
of in , and acts by left multiplication.
Altogether we’ve described a bijection between
- subgroups of of index and
- triples of a divisor of , a subgroup of of index , and an element .
This is close to, but not quite, the count we wanted, which was in terms of conjugacy classes of subgroups of of index . To get this count we need to know how many conjugates a given subgroup of index has. Every conjugate appears as the stabilizer of a point in , but two points that are related by the action of the automorphism group will have the same stabilizer, and conversely two points with the same stabilizer are related by the action of the automorphism group. The automorphism group itself acts freely, so every orbit has size . Altogether we find that has
conjugates, so after grouping all of the conjugates of together in the above bijection we find that the contribution of conjugacy classes of subgroups of of index to the count of subgroups of of index is as desired.