Blog Archive

Saturday, June 6, 2026

A Category of Categorifications over a Set

 

Categorifications over a Base and the Monoid Ring Construction

Abstract

We introduce a relative viewpoint on naive decategorification. Instead of only asking whether a category decategorifies to a fixed set B, we consider categories equipped with a chosen map from their set of object-isomorphism classes to B. This leads to the comma category

Cat/Bdecat=(DecatB).

Within this framework, the categories FinSet and FinVectk appear as two categorifications of N, and the free vector space functor k[] becomes a morphism between these categorifications.

We then isolate a general mechanism: an endofunctor T on categories induces a transformation between categories of categorifications over bases only when its effect on decategorification is controlled by a compatible set-level functor S. The finite-support M-grading construction

CFunfs(D(M),C)

is an important example. It sends categorifications over N to categorifications over N[M]. With Day convolution, finite-support M-graded finite sets categorify the monoid semiring N[M], while finite-support M-graded finite-dimensional vector spaces have naive decategorification N[M] and Grothendieck group Z[M]. Thus the monoid ring Z[M] is obtained by first passing to M-graded categorifications and then applying K0.


1. Naive Decategorification

Let Cat denote a suitable category of essentially small categories. Define the naive decategorification functor

Decat:CatSet

by

Decat(C)=Obj(C)/.

Equivalently,

Decat(C)=π0(C),

where C is the core groupoid of C, obtained by keeping all objects of C but only the isomorphisms.

If F:CD is a functor, then F induces a function

Decat(F):Decat(C)Decat(D),[X][F(X)].

This is well-defined because functors preserve isomorphisms. Hence Decat is a functor from categories to sets.

This is the most elementary form of decategorification: one forgets all non-invertible morphisms, then collapses isomorphic objects to the same element. Later, when additive or exact structures are present, one may refine this by passing from π0 to a Grothendieck group K0. But the starting point of this paper is the naive invariant Obj(C)/.


2. Categorifications over a Base

Fix a set B. We define the category of categorifications over B to be the comma category

Cat/Bdecat=(DecatB).

An object of Cat/Bdecat is a pair

(C,p),

where C is a category and

p:Decat(C)B

is a function. Thus each object of C, up to isomorphism, is assigned a decategorified value in B.

A morphism

F:(C,p)(D,q)

is a functor

F:CD

such that

qDecat(F)=p.

Equivalently, for every object XC, one has

q([F(X)])=p([X]).

Thus morphisms in Cat/Bdecat are functors that preserve the assigned decategorified value.

This definition is intentionally relative. It does not require

Decat(C)B.

It only requires a chosen map

Decat(C)B.

This is useful because many natural categories do not decategorify onto the entire intended base. For example, finite-dimensional vector spaces naturally produce nonnegative dimensions, so their naive decategorification gives N, while the corresponding Grothendieck group gives Z.

There is nevertheless a stronger notion. Define

CatBcatCat/Bdecat

to be the full subcategory whose objects are pairs (C,p) such that

p:Decat(C)B

is a bijection. In that case, C may be regarded as a genuine categorification of B in the naive sense.

The relative category Cat/Bdecat is more flexible. It lets us study categories lying over B, even when their naive decategorification only lands in a subset or substructure of B.


3. The Basic Example: N

The simplest motivating example is the pair

FinSet,FinVectk.

The category FinSet of finite sets decategorifies to N by cardinality:

[X]|X|.

Indeed, two finite sets are isomorphic exactly when they have the same cardinality, so

Decat(FinSet)N.

Similarly, the category FinVectk of finite-dimensional vector spaces over a field k decategorifies to N by dimension:

[V]dimkV.

Two finite-dimensional vector spaces over k are isomorphic exactly when they have the same dimension, so

Decat(FinVectk)N.

Thus FinSet and FinVectk give two categorifications of the same base N.

The free vector space functor

k[]:FinSetFinVectk

satisfies

dimkk[X]=|X|.

Therefore it preserves the decategorified value. In the relative category, it is a morphism

(FinSet,||)(FinVectk,dimk)

inside

Cat/Ndecat.

So the free vector space functor is not merely a familiar construction. It can be regarded as a morphism between two categorifications of N.

If one remembers addition and multiplication, the example becomes richer. The set N is a semiring. The category FinSet categorifies this semiring structure using disjoint union and Cartesian product:

X+Y:=XY,XY:=X×Y.

The category FinVectk categorifies the same semiring structure using direct sum and tensor product:

V+W:=VW,VW:=VkW.

The free vector space functor is compatible with both operations:

k[XY]k[X]k[Y],

and

k[X×Y]k[X]kk[Y].

Thus k[] is not only a morphism between categorifications of the underlying set N. It is also a semiring-level linearization morphism.

This example suggests the general principle of the paper:

A categorification may be studied relative to a decategorified base, and a functor between categorifications should be regarded as a morphism over that base.


4. Functorial Base Transformation under Decategorification

We now formulate a general mechanism.

Let

T:CatCat

be an endofunctor on categories. One might ask whether T automatically induces a functor

Cat/BdecatCat/Bdecat

for suitable bases B and B.

The answer is no. The functor T alone is not enough. To transform categories over bases, one must also control how T behaves after decategorification.

A convenient sufficient condition is the following. Suppose we are given:

  1. an endofunctor

T:CatCat;
  1. an endofunctor

S:SetSet;
  1. a natural transformation

α:DecatTSDecat.

Thus, for every category C, there is a natural map

αC:Decat(TC)S(Decat(C)).

This says that the decategorification of TC can be measured functorially in terms of the decategorification of C.

Now fix a map of bases

γ:S(B)B.

Given an object

(C,p)Cat/Bdecat,

where

p:Decat(C)B,

define

pT:Decat(TC)B

by the composite

Decat(TC)αCS(Decat(C))S(p)S(B)γB.

In other words,

pT=γS(p)αC.

Then T sends (C,p) to

(TC,pT)Cat/Bdecat.

This construction is functorial on morphisms. Suppose

F:(C,p)(D,q)

is a morphism in Cat/Bdecat. Thus

qDecat(F)=p.

We claim that

T(F):TCTD

is a morphism

(TC,pT)(TD,qT)

over B.

Indeed, by naturality of α, the square

Decat(TC)Decat(TF)Decat(TD)αCαDS(Decat(C))S(Decat(F))S(Decat(D))

commutes. Therefore

qTDecat(TF)=γS(q)αDDecat(TF).

Using naturality, this becomes

γS(q)S(Decat(F))αC.

Since

qDecat(F)=p,

we get

S(q)S(Decat(F))=S(p).

Hence

qTDecat(TF)=γS(p)αC=pT.

Thus TF preserves the transformed decategorified value.

We have proved the following proposition.

Proposition 4.1. Let T:CatCat and S:SetSet be functors. Suppose there is a natural transformation

α:DecatTSDecat.

For every map of bases

γ:S(B)B,

there is an induced functor

Tγ:Cat/BdecatCat/Bdecat

defined by

(C,p)(TC,γS(p)αC)

and

FT(F).

This proposition explains precisely in what sense an endofunctor on categories can induce a base transformation under decategorification. The essential data is not just T, but the compatibility

DecatTSDecat.

Applying T before decategorifying must be controlled by applying S after decategorifying.


5. The Finite-Support M-Grading Functor

We now apply the previous proposition to the main construction of the paper.

Let M be a monoid. Let D(M) denote the discrete monoidal category associated to M. Its objects are the elements of M, its only morphisms are identities, and its tensor product is induced by multiplication in M:

mn=mn.

The unit object is the identity element eM.

If M is commutative, then D(M) is symmetric monoidal. If M is not commutative, then D(M) is monoidal but not symmetric in general.

Let C be a category equipped with a chosen zero-like object 0C. This could be the empty set in FinSet, or the zero vector space in FinVectk.

Define

TM(C)=Funfs(D(M),C),

the category of finite-support M-indexed families of objects of C.

Since D(M) is discrete, an object of TM(C) is simply a family

X=(Xm)mM.

It has finite support if

Xm0C

for only finitely many mM.

A morphism

XY

is a family of morphisms

(fm:XmYm)mM.

To make this construction functorial, we work with categories equipped with chosen zero-like objects and functors preserving them. If

F:CD

preserves the chosen zero-like objects, then F sends finite-support families to finite-support families. Hence it induces a functor

TM(F):TM(C)TM(D)

by pointwise application:

(Xm)mM(F(Xm))mM.

Thus

CFunfs(D(M),C)

is functorial in C, on the appropriate category of categories with chosen zero-like objects.

At the set level, the corresponding construction is the finite-support function functor. If A is a pointed set with basepoint a0, define

SM(A)={f:MAf(m)a0 for only finitely many m}.

For a category C with chosen zero-like object 0C, the set

Decat(C)

has a distinguished element [0C]. There is a natural map

αC:Decat(TMC)SM(Decat(C))

defined by

[(Xm)mM](m[Xm]).

This is well-defined because isomorphic M-graded objects have pointwise isomorphic components.

It is natural in C. If F:CD preserves the chosen zero-like objects, then

αD([(F(Xm))mM])=(m[F(Xm)]),

while

SM(Decat(F))(αC([(Xm)]))=SM(Decat(F))(m[Xm])=(m[F(Xm)]).

Therefore

α:DecatTMSMDecat

is a natural transformation.

Now take a category over N,

(C,p)Cat/Ndecat,

where

p:Decat(C)N.

Assume

p([0C])=0.

Define the base transformation

γ:SM(N)N[M]

by

γ(f)=mMf(m)m.

Since f has finite support, this is a finite sum.

By Proposition 4.1, we obtain a functor

()(M):Cat/Ndecat,0Cat/N[M]decat,

where the source denotes the category of categories over N equipped with a chosen zero-like object, and whose morphisms preserve it.

Explicitly,

(C,p)(C(M),p(M)),

where

C(M)=Funfs(D(M),C)

and

p(M):Decat(C(M))N[M]

is given by

p(M)([(Xm)mM])=mMp([Xm])m.

On morphisms,

FF(M)=Funfs(D(M),F).

Thus forming finite-support M-graded objects is not merely a way to build examples. It is a functorial operation

categorifications over Ncategorifications over N[M].

This is the structural core of the monoid-ring construction.


6. Day Convolution and the Monoid Semiring N[M]

We now add the monoidal structure.

Consider

Fin(M)=Funfs(D(M),FinSet).

Objects of Fin(M) are finite-support M-graded finite sets

A=(Am)mM.

The monoidal structure on D(M) induces, by Day convolution, a monoidal structure on Fin(M). Since D(M) is discrete, the formula is concrete:

(AB)r=mn=rAm×Bn.

Equivalently, since A and B have finite support, the coproduct is taken over the finite set of pairs

(m,n)supp(A)×supp(B)

such that mn=r.

The unit object is the graded finite set δe defined by

(δe)e={},(δe)m=(me).

Disjoint union gives addition, while Day convolution gives multiplication. The naive decategorification map is

[A]mM|Am|m.

This lands in the monoid semiring

N[M].

Moreover,

[AB]=[A]+[B],

and

[AB]=[A][B].

Indeed,

|(AB)r|=mn=r|Am||Bn|,

which is exactly the coefficient of r in the product

(m|Am|m)(n|Bn|n).

If δm denotes the object concentrated at m with value a one-point set, then

δmδnδmn.

Thus

[δm][δn]=[δmn].

This is precisely the multiplication law in N[M].

Therefore

Fin(M)

categorifies the monoid semiring N[M], with disjoint union categorifying addition and Day convolution categorifying multiplication.

If M is commutative, then the monoidal structure is symmetric. If M is noncommutative, then the convolution is generally monoidal but not symmetric, reflecting the noncommutativity of N[M].


7. M-Graded Vector Spaces and the Monoid Ring

Now consider

Vectk(M)=Funfs(D(M),FinVectk).

An object is a finite-support M-graded finite-dimensional vector space

V=(Vm)mM.

Day convolution gives

(VW)r=mn=rVmkWn.

The unit object is concentrated at the identity element e, with value k at e and 0 elsewhere.

The naive decategorification map is

[V]mMdimk(Vm)m.

Its image lies in

N[M]Z[M].

Thus, under naive decategorification, Vectk(M) gives N[M], not the whole monoid ring Z[M]. This is expected: dimensions are nonnegative integers.

To obtain Z[M], one passes to the Grothendieck group. The additive structure is direct sum:

(VW)m=VmWm.

Since finite-dimensional vector spaces are semisimple, and all constructions here are pointwise, the Grothendieck group is obtained by group-completing the commutative monoid of isomorphism classes under direct sum:

K0(Vectk(M))Z[M].

Explicitly, the class of V=(Vm)mM is sent to

[V]mMdimk(Vm)m.

Negative coefficients in Z[M] do not come from actual objects. They arise from formal differences

[V][W]

in the Grothendieck group.

Day convolution induces multiplication on K0:

[V][W]=[VW].

For the object δm concentrated at m with value k, one has

δmδnδmn.

Hence

[δm][δn]=[δmn].

Therefore,

K0(Vectk(M),,)Z[M]

as rings.

The process can be summarized as

(Vectk(M))π0N[M]GrZ[M].

Here π0 records the positive part of the categorified structure, while K0 performs the group completion that produces the ring.


8. Linearization and the Lifted Free Vector Space Functor

The free vector space functor

k[]:FinSetFinVectk

is a morphism over N, since

dimkk[X]=|X|.

Applying the finite-support M-grading functor gives

k[](M):=Funfs(D(M),k[]):Fin(M)Vectk(M).

Explicitly,

k[](M)((Am)mM)=(k[Am])mM.

This is the pointwise free vector space functor.

It preserves the decategorified value over N[M], because

dimkk[Am]=|Am|

for each mM. Therefore

mM|Am|mmMdimk(k[Am])m=mM|Am|m.

Thus k[](M) induces the identity map on N[M] after naive decategorification.

Moreover, k[](M) is compatible with Day convolution. Indeed,

k[(AB)r]=k[mn=rAm×Bn].

Since the free vector space functor sends finite coproducts of sets to direct sums of vector spaces and finite Cartesian products to tensor products, we have natural isomorphisms

k[mn=rAm×Bn]mn=rk[Am×Bn]mn=rk[Am]kk[Bn].

The right-hand side is precisely

(k[A]k[B])r.

Therefore

k[AB]k[A]k[B].

The unit is also preserved:

k[δe]δe.

Hence

k[](M):Fin(M)Vectk(M)

is a strong monoidal functor for Day convolution.

This gives the lifted diagram

FinSetFinVectk

over N, transformed into

Funfs(D(M),FinSet)Funfs(D(M),FinVectk)

over N[M].

The passage from N[M] to Z[M] then occurs on the vector-space side by applying K0.

Thus the full picture has two stages:

categorifications over N()(M)categorifications over N[M]K0ring-level decategorification over Z[M].

The first stage is functorial at the level of categories over a base. The second stage is Grothendieck group completion.


9. The Relative Viewpoint Revisited

The relative viewpoint is useful because it avoids an overly rigid notion of categorification.

For example, if we take

B=Z[M],

then Vectk(M) has a natural map

Decat(Vectk(M))Z[M],

given by

[V]mMdimk(Vm)m.

The image is only

N[M]Z[M].

Nevertheless, this still defines an object of

Cat/Z[M]decat.

Thus the comma category

(DecatB)

allows us to study categories whose naive decategorification maps into B, even when it does not exhaust B.

If we require the stronger condition

Decat(C)B,

then Vectk(M) would not be a genuine naive categorification of Z[M]. It is instead a category over Z[M] whose naive image is the positive part N[M]. To recover the whole ring, one must pass from π0 to K0.

This distinction is important:

π0remembers object classes and gives positive coefficients;
K0group-completes the additive structure and gives negative coefficients.

Thus the relative framework separates two operations that are often conflated:

  1. assigning decategorified values to objects;

  2. completing the additive structure to produce a group or ring.


10. Summary

Let M be a monoid.

The category

Fin(M)=Funfs(D(M),FinSet)

of finite-support M-graded finite sets categorifies the monoid semiring N[M]. Addition is given by disjoint union, and multiplication is given by Day convolution.

The category

Vectk(M)=Funfs(D(M),FinVectk)

of finite-support M-graded finite-dimensional vector spaces has naive decategorification N[M]. After passing to the Grothendieck group, it gives the monoid ring:

K0(Vectk(M))Z[M].

The free vector space functor

k[]:FinSetFinVectk

is a morphism between categorifications over N. By functoriality of the finite-support M-grading construction, it lifts to

k[](M):Funfs(D(M),FinSet)Funfs(D(M),FinVectk).

This lifted functor is strong monoidal for Day convolution and induces the identity on N[M] after naive decategorification.

The structural mechanism is the functor

()(M)=Funfs(D(M),),

which sends categorifications over N to categorifications over N[M]. This mechanism is an instance of a more general principle: an endofunctor T on categories induces a transformation between categorifications over bases only when its decategorification is controlled by compatible data

DecatTSDecat.

In the present case, T is finite-support M-grading, S is the finite-support function construction, and the base transformation sends a finite-support function MN to the corresponding element of N[M].

Thus the monoid ring construction is not an isolated computation. It is part of a functorial theory of how categorifications transform under controlled operations on categories.

Popular Posts