In my previous post I neglected to mention something quite crucial, namely, that (at least for now) we are only talking about finite sets of labels and finite sets of structures. That is, we do not consider structures with infinitely many labels, and given a particular finite set of labels, there must be only a finite number of structures with those labels. The category is the category of finite sets and bijections, not of all sets as I said previously.

Of course, in practice we do want to think about infinite sets of structures and labels, especially in relation to a non-strict language like Haskell! But the theory was invented by mathematicians interested in counting things. I do intend to explore ways to extend the theory to encompass infinite structures, but for now we’ll stick to the finite.

Before moving on to talk about the algebraic approach to species, I also want to point out a few simple implications of the formal definition. Instead of spelling them out in detail, I will pose them as exercises: you can either take them on faith, or try working through the exercises to deepen your understanding.

Let denote the set 1, and write as an abbreviation for , i.e. the application of the species to the label set . Show that given we can determine for any with .

(This shows that “size is all that matters”: in some sense species are really indexed not by sets of labels but by size.)

[BLL2 Exercise 1.1.2] Show that we get an equivalent definition if we take species to be functors from to (the category of finite sets and (total) functions) instead of endofunctors on .

(Apparently one can generalize the notion of species by replacing with other categories, but at present I am not sure of the implications.)

The species literature uses , but (as every good computer scientist knows) counting ought to begin at zero.↩

I will use “BLL” to refer to Bergeron, Labelle, and Leroux, Combinatorial Species and Tree-Like Structures (see the references at the end of the previous post for the full citation).↩