# Is there a categorification of the integers in terms of “graded sets”?

One way to categorify the non-negative integers is to consider the category FinSet whose objects are finite sets and whose morphisms are functions. The isomorphism classes of objects in FinSet can be labeled "sets of cardinality 0, sets of cardinality 1," and so forth, so are a natural way of talking about the non-negative integers.

What I want is a good definition of a category FinSSet (where SSet stands for "super set") whose isomorphism classes can be thought of as "sets of cardinality k" for all integers k in a natural way. A natural candidate for the set of objects is the set of "Z2-graded sets," i.e. pairs of sets (S0, S1). What we want is to define the cardinality of such a set as card(S0) - card(S1), so we want the isomorphism classes of objects to only depend on this number.

Unfortunately, I can't find a definition of the morphisms that actually accomplishes this. What should it be? For what it's worth, I've read "From Finite Sets to Feynman Diagrams" and I think John Baez gives up a little too early on the integers.

-

Not sure if you've seen this already, but it looks like Baez talks about this in one of his "This Week's Finds" columns, where he shows that the morphisms are given by tangles.

-
Perfect! I've read that column but I somehow managed to forget the point of that construction. –  Qiaochu Yuan Oct 30 '09 at 23:35
Hmm. The categorification you get if you want the morphisms to be invertible is actually extremely boring. That's unfortunate. –  Qiaochu Yuan Oct 31 '09 at 3:00
Do you mean that it's boring because every morphism (tangle) ends up being an isomorphism? If so, I wonder if tangles can be generalized so that this is not the case. (For example, one might relax the requirement that each point pairs with exactly one other point.) It would be nice to get the usual FinSet category in the cases where S1 is empty. –  Ari Oct 31 '09 at 15:09