"A good stock of examples, as large as possible, is indispensable for a thorough understanding of any concept, and when I want to learn something new, I make it my first job to build one." – Paul Halmos

Posts Tagged ‘groupoids’

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 groupoidof , 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 .

Suitably nice groupoids have a numerical invariant attached to them called groupoid cardinality. Groupoid cardinality is closely related to Euler characteristic and can be thought of as providing a notion of integration on groupoids.

There are various situations in mathematics where computing the size of a set is difficult but where that set has a natural groupoid structure and computing its groupoid cardinality turns out to be easier and give a nicer answer. In such situations the groupoid cardinality is also known as “mass,” e.g. in the Smith-Minkowski-Siegel mass formula for lattices. There are related situations in mathematics where one needs to describe a reasonable probability distribution on some class of objects and groupoid cardinality turns out to give the correct such distribution, e.g. the Cohen-Lenstra heuristics for class groups. We will not discuss these situations, but they should be strong evidence that groupoid cardinality is a natural invariant to consider.

My current top candidate for a mathematical concept that should be and is not (as far as I can tell) consistently taught at the advanced undergraduate / beginning graduate level is the notion of a groupoid. Today’s post is a very brief introduction to groupoids together with some suggestions for further reading.