Blog Archive

Monday, June 29, 2026

Affine Geometry of Monoidal Functor Categories

 

 

From Free Enrichment to Monoidal Derivations

There are two layers in the story.

The first layer is formal:

ordinary functor categories inherit enrichment.

The second layer is geometric:

monoidal natural transformations are cut out by polynomial equations.

The point of this note is to separate these two layers.

The affine enrichment of ordinary representation categories such as group representations, quiver representations, associative algebra representations, and Lie algebra representations is essentially free. It comes from the general enriched functor category construction.

The genuinely geometric step appears when we pass from ordinary natural transformations to monoidal natural transformations. In finite-dimensional linear algebra, the latter are defined by polynomial equations, generally quadratic ones. This is why the natural base is not Vectk, but Affk.

The final chain is:

lax/strong monoidal functoraffine Hom-schemesautomorphism group schemeLie algebra of monoidal derivations.

The free layer: ordinary functor categories

Let V be a monoidal category with the relevant small products and equalizers. Let A be a V-enriched category, and let C be an ordinary small category.

Then the ordinary functor category

[C,A0]

inherits a V-enrichment, provided the required ends exist.

For two functors

F,G:CA0,

the Hom-object is the end

Nat(F,G)=xCA(Fx,Gx).

Equivalently,

Nat(F,G)=Eq(xA(Fx,Gx)a:xyA(Fx,Gy)).

The two arrows encode the two sides of naturality:

ηxG(a)ηx

and

ηxηyF(a).

Thus the equalizer imposes the equations

G(a)ηx=ηyF(a).

No closed structure on V is needed here. In particular, one should not assume that Affk is Cartesian closed. It is not. What is needed is the existence of the relevant products and equalizers.

Since

Affk(CAlgk)op

and CAlgk is cocomplete, Affk has the limits needed for this construction.


Finite-dimensional vector spaces as an affine-enriched category

The category Vectkfd is enriched over Affk by

Homk(V,W)=A(Homk(V,W)).

For every k-algebra R,

Homk(V,W)(R)=HomR(VkR,WkR).

Composition is induced by matrix multiplication, hence is a morphism of affine schemes:

Homk(W,U)×Homk(V,W)Homk(V,U).

Therefore, for every ordinary small category C,

[C,Vectkfd]

inherits an Affk-enrichment:

Nat(F,G)=xCHomk(Fx,Gx).

This explains, for free, the affine enrichment of many basic representation categories.

For a group G,

Repkfd(G)=[BG,Vectkfd].

Equivalently,

Repkfd(G)kG-Modfd.

For a quiver Q, representations are functors from the path category P(Q):

Repkfd(Q)=[P(Q),Vectkfd].

If Q has finitely many vertices, this is equivalently

Repkfd(Q)kQ-Modfd,

where kQ is the path algebra. For infinite quivers, one should either keep the path-category formulation or use the locally unital path algebra.

For a k-algebra A, finite-dimensional A-modules also belong to this same layer. An A-linear map

f:MN

is simply a k-linear map satisfying

f(am)=af(m).

These are linear equations inside

Homk(M,N).

For a Lie algebra g,

Repkfd(g)U(g)-Modfd.

Thus representations of groups, quivers, associative algebras, and Lie algebras all sit in the unary/module-theoretic layer. Their affine Hom-objects are obtained either from the general functor-category construction or from the elementary fact that module homomorphisms are cut out by linear equations.

This is not the main geometric point.


The geometric layer: lax monoidal functors

Now let C be a small monoidal category. For notational simplicity, assume C is strict monoidal. In the non-strict case, one inserts the associativity and unit constraints.

Let

F,G:CVectkfd

be two lax monoidal functors.

Thus F comes with structure maps

μx,yF:F(x)F(y)F(xy),

and

ηF:kF(1).

Similarly, G comes with

μx,yG:G(x)G(y)G(xy),

and

ηG:kG(1).

We are not constructing a moduli space of lax monoidal functors. The functors F and G are fixed.

The object we want is the affine scheme of monoidal natural transformations

FG.

The construction proceeds in two steps:

ordinary natural transformationsmonoidal natural transformations.

The first step is formal. The second step is geometric.


Ordinary natural transformations

First ignore the monoidal structures.

An ordinary natural transformation

α:FG

is a family of linear maps

αx:F(x)G(x)

such that, for every morphism

a:xy

in C, one has

G(a)αx=αyF(a).

Since all vector spaces involved are finite-dimensional, the possible maps αx are represented by affine spaces

Homk(F(x),G(x)).

Hence ordinary natural transformations are represented by

Nat(F,G)=Eq(xHomk(F(x),G(x))a:xyHomk(F(x),G(y))).

The two arrows send a family (αx)x to

(G(a)αx)a

and

(αyF(a))a.

Thus this equalizer imposes precisely the ordinary naturality equations.

For every k-algebra R, its R-points are ordinary R-linear natural transformations

FRGR,

where

FR(x)=F(x)kR,GR(x)=G(x)kR.

Monoidal natural transformations

Now we impose the condition that α is monoidal.

A natural transformation

α:FG

is monoidal if, for every pair x,yC, the square

F(x)F(y)μx,yFF(xy)αxαyαxyG(x)G(y)μx,yGG(xy)

commutes.

Equivalently,

αxyμx,yF=μx,yG(αxαy).

It must also satisfy the unit equation

α1ηF=ηG.

Thus monoidal natural transformations are ordinary natural transformations satisfying extra multiplicativity equations.

This is the crucial difference. Naturality is linear. Monoidality is generally quadratic.


Polynomial equations in coordinates

After choosing bases, this becomes completely concrete.

For each object xC, write the matrix entries of

αx:F(x)G(x)

as variables

tijx.

The ordinary naturality equation

G(a)αx=αyF(a)

becomes a collection of linear polynomial equations in the variables tijx and tijy.

The unit equation

α1ηF=ηG

is also linear.

The monoidal equation

αxyμx,yF=μx,yG(αxαy)

is different. The entries of

αxαy

are products of entries of αx and entries of αy. Therefore, in coordinates, the monoidal equation is generally quadratic.

Thus the coordinate ring of the Hom-object is obtained from the polynomial coordinate ring on all matrix entries of the αx by quotienting by:

naturality equations+unit equations+monoidal compatibility equations.

The first two types are linear. The third type is generally quadratic.

This is the intuitive reason Affk is the correct base: Vectk remembers linear structure, but Affk remembers polynomial equations.


The closed subscheme of monoidal natural transformations

Let

N=Nat(F,G).

By definition of N, there is a universal natural transformation over N:

αuniv:FNGN.

For fixed x,yC, consider the two maps

F(x)F(y)kONG(xy)kON

given by

αxyunivμx,yF

and

μx,yG(αxunivαyuniv).

The condition that these two maps are equal is the vanishing of their difference.

Since all vector spaces involved are finite-dimensional, this difference is a section of the finite free ON-module

Homk(F(x)F(y),G(xy))kON.

The vanishing of such a section defines a closed subscheme of N.

The unit condition

α1univηF=ηG

is closed in the same way.

Now impose these equations for all pairs x,yC. Since C is small, this is a set of equations. Their simultaneous vanishing defines a closed affine subscheme

MonNat(F,G)Nat(F,G).

By construction,

MonNat(F,G)(R)=MonNat(FR,GR).

So MonNat(F,G) represents R-families of monoidal natural transformations.

This is the geometric step:

monoidal natural transformations form a closed subscheme of ordinary natural transformations.

The finite-dimensionality of the values of F and G is used here. It ensures that the relevant Hom-functors are represented by affine spaces of the expected form, and that the differences above are sections of finite free modules after base change.


Composition

Let

FαGβH

be monoidal natural transformations.

Their composite is the ordinary composite natural transformation

βα:FH,

defined pointwise by

(βα)x=βxαx.

We check that it is monoidal.

Compute:

(βα)xyμx,yF=βxyαxyμx,yF.

Since α is monoidal,

αxyμx,yF=μx,yG(αxαy).

Therefore

(βα)xyμx,yF=βxyμx,yG(αxαy).

Since β is monoidal,

βxyμx,yG=μx,yH(βxβy).

Hence

(βα)xyμx,yF=μx,yH(βxβy)(αxαy).

But

(βxβy)(αxαy)=(βxαx)(βyαy).

Therefore

(βα)xyμx,yF=μx,yH((βα)x(βα)y).

So βα is monoidal.

On affine schemes, ordinary composition is induced by pointwise matrix multiplication. Hence it defines a regular morphism

MonNat(G,H)×MonNat(F,G)MonNat(F,H).

The identity natural transformation is monoidal, so it gives the unit map

SpeckMonNat(F,F).

Associativity and the unit laws follow from ordinary composition.

Therefore

LaxMon(C,Vectkfd)

with monoidal natural transformations as morphisms is enriched over Affk.


Strong monoidal functors

The strong case uses the same Hom-schemes.

A strong monoidal functor is a lax monoidal functor whose structure maps

μx,yF:F(x)F(y)F(xy)

and

ηF:kF(1)

are isomorphisms.

But once two strong monoidal functors F,G are fixed, the condition for

α:FG

to be a monoidal natural transformation is still

αxyμx,yF=μx,yG(αxαy),

and

α1ηF=ηG.

Thus the Hom-scheme between two strong monoidal functors is still

MonNat(F,G).

So

StrMon(C,Vectkfd)

is also enriched over Affk.

The strong condition changes the objects. It does not change the Hom-equations between fixed objects.


Why this is not ordinary enriched category theory

For ordinary functors,

Nat(F,G)=xHom(Fx,Gx)

is formal.

For monoidal functors, the relevant Hom-object is

MonNat(F,G)Nat(F,G),

cut out by multiplicative equations.

This is not a formal consequence of enrichment over an arbitrary base category. For example, monoidal natural transformations are generally not closed under addition, and therefore usually do not form a vector space.

The base Affk works because affine schemes encode equations, including nonlinear equations.

So the correct distinction is:

ordinary natural transformations form an end;
monoidal natural transformations form a closed subscheme of that end.

Automorphisms in a Cartesian-enriched category

Let V be a Cartesian monoidal category with finite limits, and let A be a V-enriched category.

For an object XA, set

E=A(X,X).

Composition and identity make E a monoid object in V:

m:E×EE,
e:1E.

To define automorphisms, one should not simply say “the invertible elements of E,” because existence of an inverse is not a finite-limit condition. Instead, include the inverse as part of the data.

Define

Aut(X)=Eq(E×EE×E),

where the two arrows are

(a,b)(ab,ba)

and

(a,b)(1,1).

Thus Aut(X) internally represents pairs (a,b) satisfying

ab=1,ba=1.

Multiplication is

(a,b)(c,d)=(ac,db).

The unit is

(1,1),

and inversion is

(a,b)(b,a).

These operations satisfy the group object axioms by the monoid axioms for E.

Therefore:

in a Cartesian-enriched category, endomorphisms form an internal monoid,

and

automorphisms form its internal group of units.

Returning to affine schemes

Now take

V=Affk.

It is Cartesian monoidal under fiber product over Speck, and it has finite limits.

Therefore, if A is enriched over Affk, then every object XA has an affine group scheme of automorphisms:

Aut(X).

Apply this to

A=LaxMon(C,Vectkfd)

or

A=StrMon(C,Vectkfd).

For a lax or strong monoidal functor F, we obtain an affine group scheme

AutMon(F).

Its R-points are the monoidal natural automorphisms of

FR:CVectRfd.

If C is finite, or if the defining equations are finitely generated in the relevant sense, this group scheme may be of finite type. Without such hypotheses, it is safer to call it an affine group scheme rather than an affine algebraic group.


The Lie algebra

The Lie algebra of an affine group scheme G is defined using dual numbers:

Lie(G)(R)=ker(G(R[ϵ])G(R)),

where

R[ϵ]=R[t]/(t2).

Hence

LieAutMon(F)

consists of monoidal natural automorphisms of FR[ϵ] reducing to the identity modulo ϵ.

Such an automorphism has the form

αx=idF(x)R+ϵDx.

Its inverse is

idF(x)RϵDx.

The naturality condition for α linearizes to

F(a)Dx=DyF(a)

for every morphism

a:xy

in C.

Now linearize the monoidal condition

αxyμx,y=μx,y(αxαy).

The left-hand side is

(id+ϵDxy)μx,y=μx,y+ϵDxyμx,y.

The right-hand side is

μx,y((id+ϵDx)(id+ϵDy)).

Since ϵ2=0,

(id+ϵDx)(id+ϵDy)=id+ϵ(Dx1+1Dy).

Therefore the right-hand side is

μx,y+ϵμx,y(Dx1+1Dy).

Comparing the ϵ-terms gives

Dxyμx,y=μx,y(Dx1+1Dy).

The unit equation linearizes to

D1η=0.

Thus

LieAutMon(F)

is the space of natural endomorphisms D satisfying

Dxyμx,y=μx,y(Dx1+1Dy),

and

D1η=0.

These are the monoidal derivations of F.

So

LieAutMon(F)=DerMon(F).

The bracket is the pointwise commutator:

[D,E]x=DxExExDx.

Closure under this bracket follows from the general fact that the Lie algebra of an affine group scheme is a Lie algebra.

If one wants to see the closure directly, it is just the cancellation of the mixed terms. If

Dxyμ=μ(Dx1+1Dy)

and

Exyμ=μ(Ex1+1Ey),

then applying the two formulas twice gives

[D,E]xyμ=μ([D,E]x1+1[D,E]y).

The unit condition is preserved because

D1η=0,E1η=0.

Thus monoidal derivations form a Lie algebra.

lax/strong monoidal functoraffine Hom-schemesautomorphism group schemeLie algebra of monoidal derivations.

 

Popular Posts