Blog Archive

Thursday, June 25, 2026

Finite-Dimensional PROP Models Enriched over Aff_k: From monoidal naturality to derivations

 

PROP Models and Affine Hom-Schemes

Homomorphisms, automorphisms, and derivations of finite-dimensional algebraic structures

Let k be a field.

I want to record a small observation about finite-dimensional algebraic structures. The observation is simple, but it reorganizes several familiar notions in a useful way.

The usual starting point is to say that a homomorphism is a map preserving the operations. For example,

F(xy)=F(x)F(y)

for associative algebras, or

F([x,y])=[F(x),F(y)]

for Lie algebras.

But these formulas are not isolated accidents. They are instances of one naturality equation.

Similarly, derivations are often introduced by writing down a Leibniz rule. But for self-valued derivations, it is more conceptual to start from automorphisms: a derivation should be an infinitesimal automorphism. The Leibniz rule is then obtained by linearizing the condition of preserving the structure.

The rough slogan is:

homomorphisms are natural transformations, and derivations are infinitesimal automorphisms.

The affine geometry enters because these naturality equations are polynomial equations.


1. Finite-dimensional vector spaces already have affine Hom-spaces

Before adding algebraic structure, start with finite-dimensional vector spaces.

Let V,W be finite-dimensional k-vector spaces. The set

Homk(V,W)

is not only a set, nor only a vector space. It is the set of k-points of an affine space.

More precisely, define

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

This affine scheme represents the functor

RHomR(VkR,WkR)

on commutative k-algebras. In other words,

Homk(V,W)(R)=HomR(VR,WR),

where

VR=VkR,WR=WkR.

The finite-dimensionality assumption matters here. It ensures that the Hom functor is represented by an ordinary affine space.

Composition of linear maps is matrix multiplication. Hence composition is polynomial in coordinates, and gives a morphism of affine schemes

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

The identity map idV is a k-point of

Homk(V,V).

Equivalently, it is a morphism

SpeckHomk(V,V).

Since the monoidal unit of (Affk,×k) is Speck, this is exactly the unit map required for enrichment.

Thus one may regard

FinVectk as enriched over Affk.

This is the ground-level affine geometry. Algebraic structures will be obtained by imposing polynomial equations inside these affine Hom-spaces.


2. PROPs and their models

A convenient language for many algebraic structures is the language of PROPs.

I will use the following convention. A one-coloured k-linear PROP P is a strict symmetric monoidal k-linear category whose objects are

0,1,2,

and whose tensor product on objects is addition:

mn=m+n.

A morphism

p:mn

in P should be thought of as an operation with m inputs and n outputs.

A model of P in finite-dimensional vector spaces is a strict symmetric monoidal functor

A:PFinVectk.

If

A(1)=V,

then strict monoidality gives

A(n)=Vn.

A PROP operation

p:mn

is interpreted as a linear map

A(p):VmVn.

This notation covers many familiar operations:

multiplication: 21,
comultiplication: 12,
unit: 01,
counit: 10.

So Lie algebras, associative algebras, commutative algebras, coalgebras, bialgebras, and Frobenius algebras can all be treated in the same format.

The benefit of the PROP language is that the phrase “preserve the structure” becomes a naturality condition.


3. Morphisms are monoidal natural transformations

Let

A,B:PFinVectk

be two finite-dimensional P-models. Write

A(1)=V,B(1)=W.

A morphism of models is a monoidal natural transformation

η:AB.

Because η is monoidal, it is determined by its component at 1:

η1=f:VW.

The component at n is then

ηn=fn:VnWn.

Now take a PROP operation

p:mn.

Naturality of η gives the commutative square

A(m)A(p)A(n)ηmηnB(m)B(p)B(n).

Since

A(m)=Vm,A(n)=Vn,

and

B(m)=Wm,B(n)=Wn,

this square says precisely

B(p)fm=fnA(p).

This is the basic equation.

All the usual homomorphism conditions are instances of it.

For multiplication m:21, it gives

f(xy)=f(x)f(y).

For a Lie bracket [,]:21, it gives

f([x,y])=[f(x),f(y)].

For comultiplication Δ:12, it gives

ΔBf=(ff)ΔA.

So the familiar formulas are not separate definitions. They are the same naturality equation seen through different PROPs.


4. Why the naturality equations are polynomial

Now let us spell out why the equation

B(p)fm=fnA(p)

is a polynomial condition on the matrix entries of f.

Choose bases

v1,,vr

of V, and

w1,,ws

of W.

Write

f(vi)=α=1sxαiwα.

The scalars xαi are coordinate functions on the affine space

Homk(V,W).

Fix a PROP operation

p:mn.

The two models give linear maps

A(p):VmVn,

and

B(p):WmWn.

Use multi-index notation. For

I=(i1,,im),

write

vI=vi1vim.

For

J=(j1,,jn),

write

vJ=vj1vjn.

Similarly, for

K=(α1,,αm),

write

wK=wα1wαm,

and for

L=(β1,,βn),

write

wL=wβ1wβn.

Write the structure maps in coordinates:

A(p)(vI)=JAIJvJ,

and

B(p)(wK)=LBKLwL.

We compute the two sides of the naturality equation on a basis tensor vI.

First,

fm(vI)=f(vi1)f(vim).

Since

f(via)=αaxαaiawαa,

we get

fm(vI)=K(a=1mxαaia)wK.

Applying B(p) gives

B(p)fm(vI)=K(a=1mxαaia)B(p)(wK).

Using

B(p)(wK)=LBKLwL,

we obtain

B(p)fm(vI)=L[KBKLa=1mxαaia]wL.

So the coefficient of wL on the left-hand side is

KBKLa=1mxαaia.

This is a polynomial of degree m in the matrix entries of f.

Now compute the right-hand side.

We have

A(p)(vI)=JAIJvJ.

Applying fn gives

fnA(p)(vI)=JAIJfn(vJ).

But

fn(vJ)=L(b=1nxβbjb)wL.

Therefore

fnA(p)(vI)=L[JAIJb=1nxβbjb]wL.

So the coefficient of wL on the right-hand side is

JAIJb=1nxβbjb.

This is a polynomial of degree n in the matrix entries of f.

Therefore the naturality equation is equivalent to the collection of polynomial equations

KBKLa=1mxαaiaJAIJb=1nxβbjb=0

for all input multi-indices I and output multi-indices L.

The convention is that an empty product is 1. Thus the same formula also covers operations of type 0n, such as units, and operations of type m0, such as counits.

This is the concrete reason why morphisms of finite-dimensional PROP-models are cut out by polynomial equations.


5. The Hom-scheme of two PROP models

The affine space

Homk(V,W)

parametrizes all underlying linear maps f:VW.

The equations

B(p)fm=fnA(p)

cut out precisely those linear maps which define monoidal natural transformations

AB.

Thus we obtain a closed affine subscheme

HomP(A,B)Homk(V,W).

Equivalently, this affine scheme represents the functor

RHomP-ModR(AR,BR),

where

AR=AkR,BR=BkR.

The ordinary Hom-set is recovered by taking k-points:

HomP-Modk(A,B)=HomP(A,B)(k).

Thus the Hom-set is only the visible k-point layer of a more geometric object.

One can package this as follows. For every operation p:mn, define a regular map

Φp:Homk(V,W)Homk(Vm,Wn)

by

Φp(f)=B(p)fmfnA(p).

Then

HomP(A,B)=pΦp1(0).

If the PROP is generated by specified operations, it is enough to impose these equations for those generators. Naturality for composites and tensor products follows formally from functoriality and monoidality.


6. Enrichment over affine schemes

Let A,B,C be finite-dimensional P-models.

Composition of underlying linear maps is polynomial, since it is matrix multiplication:

(gf)ij=rgirfrj.

Moreover, the composite of two monoidal natural transformations is again a monoidal natural transformation.

Therefore composition gives a morphism of affine schemes

HomP(B,C)×kHomP(A,B)HomP(A,C).

The identity morphism of A is the identity natural transformation

idA:AA.

It gives a k-point

SpeckHomP(A,A).

Since the monoidal unit of

(Affk,×k)

is

Speck,

this is the unit map required for enrichment.

Hence

P-Modkfd

is enriched over

Affk.

The ordinary category is recovered by taking k-points of each Hom-scheme.


7. Examples

For Lie algebras, the main operation is the bracket

[,]:VVV,

of type 21. A linear map

F:gh

is a Lie algebra homomorphism if

F([x,y]g)=[F(x),F(y)]h.

This is exactly the naturality equation

B(p)F2=FA(p).

In coordinates, if

[ei,ej]g=rcijrer,

and

[fα,fβ]h=γdαβγfγ,

while

F(ei)=αxαifα,

then the homomorphism condition becomes

rcijrxγr=α,βdαβγxαixβj.

So the Lie algebra Hom-scheme is cut out by quadratic equations.

For associative algebras, the multiplication

m:AAA

also has type 21. A homomorphism satisfies

F(xy)=F(x)F(y).

If the algebras are unital, the unit operation has type 01, and the condition

F(1A)=1B

is another naturality equation.

For coalgebras, the comultiplication

Δ:CCC

has type 12. A coalgebra homomorphism satisfies

ΔDF=(FF)ΔC.

Again, this is the same PROP naturality equation.

Thus multiplication, brackets, units, counits, and comultiplications are all handled by the same mechanism.


8. Endomorphism monoid schemes

For a finite-dimensional P-model A, define

EndP(A)=HomP(A,A).

Since endomorphisms compose, this Hom-scheme carries a multiplication morphism

EndP(A)×kEndP(A)EndP(A).

The identity endomorphism gives a unit point

SpeckEndP(A).

Thus

EndP(A)

is an affine monoid scheme.

On coordinate rings, this means that

O(EndP(A))

is a commutative bialgebra. The comultiplication is dual to composition.

This applies equally to Lie algebras, associative algebras, coalgebras, and other finite-dimensional PROP-models.


9. Automorphism group schemes

Let A be a finite-dimensional P-model with underlying vector space

A(1)=V.

An endomorphism of A is an automorphism exactly when its underlying linear map

VV

is invertible.

Therefore

AutP(A)

is the open subscheme of

EndP(A)

where the determinant is invertible:

AutP(A)=D(det)EndP(A).

Equivalently,

AutP(A)=EndP(A)GL(V).

Thus

AutP(A)

is an affine group scheme.

If

E=O(EndP(A)),

then

O(AutP(A))=E[det1].

In a classical reduced setting over an algebraically closed field, one often calls this an affine algebraic group. Scheme-theoretically, the safer phrase is affine group scheme.


10. Derivations from automorphisms

The word “derivation” is often introduced by writing down a Leibniz rule.

For an associative algebra, one says that a linear map D:AA is a derivation if

D(xy)=D(x)y+xD(y).

For a Lie algebra, one says that D:gg is a derivation if

D([x,y])=[D(x),y]+[x,D(y)].

These formulas are correct, but they are not the primitive idea.

For self-valued derivations, the more conceptual definition is

DerP(A):=Lie(AutP(A)).

In words:

derivations are infinitesimal automorphisms.

This definition explains why the Leibniz rule has the form it does.


11. The Lie algebra functor

Let G be an affine group scheme over k.

For every commutative k-algebra R, define

R[ε]=R[X]/(X2).

Thus

R[ε]=RRε,ε2=0.

There is a projection

R[ε]R,a+εba.

The Lie algebra functor of G is

Lie(G)(R)=ker(G(R[ε])G(R)).

So Lie(G)(R) consists of those infinitesimal R[ε]-points of G which reduce to the identity over R.

For example,

Lie(GLn)(R)=Mn(R),

because every element of the kernel has the form

I+εA,AMn(R),

and

(I+εA)1=IεA.

Now take

G=AutP(A).

Then an element of

Lie(G)(R)

is an automorphism of AR over R[ε] which reduces to the identity modulo ε.

Such an automorphism has the form

id+εD,

where

DEndR(VR).

It is automatically invertible as a linear map, with inverse

idεD.

The only remaining condition is that it preserves the PROP structure.


12. Recovering the usual Leibniz rules

Let us now look carefully at what the general linearized equation says in familiar examples.

The general situation is this. We have an operation

θ:VmVn.

An infinitesimal automorphism of the underlying vector space has the form

id+εD,ε2=0.

To say that this infinitesimal automorphism preserves the operation θ means

(id+εD)nθ=θ(id+εD)m.

Expanding this equation to first order in ε gives

(j=1n1(j1)D1(nj))θ=θ(i=1m1(i1)D1(mi)).

This is the general derivation condition associated to the operation θ.

The usual Leibniz rules are obtained by applying this formula to particular operations.


Associative algebras

Let A be an associative algebra with multiplication

μ:AAA.

Here the operation has type

21.

An infinitesimal automorphism of the underlying vector space is

id+εD.

The condition that it preserves multiplication is

(id+εD)μ=μ((id+εD)(id+εD)).

Evaluate both sides on a pure tensor xy.

The left-hand side is

(id+εD)(xy)=xy+εD(xy).

The right-hand side is

μ((x+εD(x))(y+εD(y))).

Using bilinearity of multiplication, this becomes

(x+εD(x))(y+εD(y))=xy+εD(x)y+εxD(y)+ε2D(x)D(y).

Since

ε2=0,

the last term vanishes. Hence the right-hand side is

xy+ε(D(x)y+xD(y)).

Therefore multiplication is preserved to first order if and only if

xy+εD(xy)=xy+ε(D(x)y+xD(y)).

Comparing the coefficients of ε, we obtain

D(xy)=D(x)y+xD(y).

This is the usual Leibniz rule for associative algebras.

If the algebra is unital, there is also a unit operation

u:kA,11A.

Preserving the unit means

(id+εD)u=u.

Evaluating at 1k, this says

1A+εD(1A)=1A.

Thus

D(1A)=0.

So for unital associative algebras, the infinitesimal automorphisms are precisely the linear maps D:AA satisfying

D(xy)=D(x)y+xD(y),D(1A)=0.

This is exactly the usual notion of a derivation.


Lie algebras

Let g be a Lie algebra with bracket

[,]:ggg.

Again, this operation has type

21.

An infinitesimal automorphism of the underlying vector space is

id+εD.

The condition that it preserves the bracket is

(id+εD)([x,y])=[x+εD(x),y+εD(y)].

The left-hand side is

[x,y]+εD([x,y]).

The right-hand side is

[x+εD(x),y+εD(y)].

Using bilinearity of the Lie bracket, this expands to

[x,y]+ε[D(x),y]+ε[x,D(y)]+ε2[D(x),D(y)].

Since

ε2=0,

the last term vanishes. Therefore the right-hand side is

[x,y]+ε([D(x),y]+[x,D(y)]).

Thus bracket preservation to first order is equivalent to

[x,y]+εD([x,y])=[x,y]+ε([D(x),y]+[x,D(y)]).

Comparing coefficients of ε, we get

D([x,y])=[D(x),y]+[x,D(y)].

This is the usual derivation condition for Lie algebras.

So the Lie algebra Leibniz rule is not an independent mystery. It is simply the first-order expansion of the equation

F([x,y])=[F(x),F(y)]

near

F=id.

Equivalently,

Der(g)=Lie(AutLie(g)).

Coalgebras

Now let C be a coalgebra with comultiplication

Δ:CCC.

This operation has type

12.

An infinitesimal automorphism of the underlying vector space is again

id+εD.

The condition that it preserves comultiplication is

((id+εD)(id+εD))Δ=Δ(id+εD).

We compute both sides.

Using Sweedler notation,

Δ(c)=c(1)c(2).

The left-hand side is

((id+εD)(id+εD))Δ(c).

So

((id+εD)(id+εD))(c(1)c(2))

equals

(c(1)+εD(c(1)))(c(2)+εD(c(2))).

Expanding this gives

c(1)c(2)+εD(c(1))c(2)+εc(1)D(c(2))+ε2D(c(1))D(c(2)).

Since

ε2=0,

the last term vanishes. Thus the left-hand side is

Δ(c)+ε((D1+1D)Δ(c)).

The right-hand side is

Δ((id+εD)(c))=Δ(c+εD(c)).

By linearity of Δ, this is

Δ(c)+εΔ(D(c)).

Therefore comultiplication is preserved to first order if and only if

Δ(c)+ε((D1+1D)Δ(c))=Δ(c)+εΔ(D(c)).

Comparing coefficients of ε, we get

(D1+1D)Δ=ΔD.

This is the usual coderivation condition.

If the coalgebra is counital, there is also a counit operation

ϵ:Ck.

This has type

10.

Preserving the counit means

ϵ(id+εD)=ϵ.

Thus, for every cC,

ϵ(c+εD(c))=ϵ(c).

Equivalently,

ϵ(c)+εϵ(D(c))=ϵ(c).

Hence

ϵ(D(c))=0

for all c, or

ϵD=0.

So for a counital coalgebra, an infinitesimal automorphism is a linear map D:CC satisfying

(D1+1D)Δ=ΔD,

and

ϵD=0.

This is exactly the usual notion of a coderivation compatible with the counit.


The point

The three examples have the same source.

For an operation

θ:VmVn,

an infinitesimal automorphism

id+εD

must satisfy

(id+εD)nθ=θ(id+εD)m.

The first-order part of this equation says that D acts on every output slot of θ in the same way as it acts on every input slot of θ.

For multiplication and Lie brackets, there is one output and two inputs, so one obtains

D(operation(x,y))=operation(D(x),y)+operation(x,D(y)).

For comultiplication, there is one input and two outputs, so one obtains

(D1+1D)Δ=ΔD.

Thus the Leibniz rule is not the root definition. It is the coordinate expression of a more structural statement:

a derivation is an infinitesimal automorphism.a derivation is an infinitesimal automorphism.

 

No comments:

Post a Comment

Popular Posts