PROP Models and Affine Hom-SchemesHomomorphisms, automorphisms, and derivations of finite-dimensional algebraic structures1. Finite-dimensional vector spaces already have affine Hom-spaces2. PROPs and their models3. Morphisms are monoidal natural transformations4. Why the naturality equations are polynomial5. The Hom-scheme of two PROP models6. Enrichment over affine schemes7. Examples8. Endomorphism monoid schemes9. Automorphism group schemes10. Derivations from automorphisms11. The Lie algebra functor12. Recovering the usual Leibniz rulesAssociative algebrasLie algebrasCoalgebrasThe point
PROP Models and Affine Hom-Schemes
Homomorphisms, automorphisms, and derivations of finite-dimensional algebraic structures
Let
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,
for associative algebras, or
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:
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
is not only a set, nor only a vector space. It is the set of
More precisely, define
This affine scheme represents the functor
on commutative
where
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
The identity map
Equivalently, it is a morphism
Since the monoidal unit of
Thus one may regard
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
and whose tensor product on objects is addition:
A morphism
in
A model of
If
then strict monoidality gives
A PROP operation
is interpreted as a linear map
This notation covers many familiar operations:
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
be two finite-dimensional
A morphism of models is a monoidal natural transformation
Because
The component at
Now take a PROP operation
Naturality of
Since
and
this square says precisely
This is the basic equation.
All the usual homomorphism conditions are instances of it.
For multiplication
For a Lie bracket
For comultiplication
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
is a polynomial condition on the matrix entries of
Choose bases
of
of
Write
The scalars
Fix a PROP operation
The two models give linear maps
and
Use multi-index notation. For
write
For
write
Similarly, for
write
and for
write
Write the structure maps in coordinates:
and
We compute the two sides of the naturality equation on a basis tensor
First,
Since
we get
Applying
Using
we obtain
So the coefficient of
This is a polynomial of degree
Now compute the right-hand side.
We have
Applying
But
Therefore
So the coefficient of
This is a polynomial of degree
Therefore the naturality equation is equivalent to the collection of polynomial equations
for all input multi-indices
The convention is that an empty product is
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
parametrizes all underlying linear maps
The equations
cut out precisely those linear maps which define monoidal natural transformations
Thus we obtain a closed affine subscheme
Equivalently, this affine scheme represents the functor
where
The ordinary Hom-set is recovered by taking
Thus the Hom-set is only the visible
One can package this as follows. For every operation
by
Then
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
Composition of underlying linear maps is polynomial, since it is matrix multiplication:
Moreover, the composite of two monoidal natural transformations is again a monoidal natural transformation.
Therefore composition gives a morphism of affine schemes
The identity morphism of
It gives a
Since the monoidal unit of
is
this is the unit map required for enrichment.
Hence
is enriched over
The ordinary category is recovered by taking
7. Examples
For Lie algebras, the main operation is the bracket
of type
is a Lie algebra homomorphism if
This is exactly the naturality equation
In coordinates, if
and
while
then the homomorphism condition becomes
So the Lie algebra Hom-scheme is cut out by quadratic equations.
For associative algebras, the multiplication
also has type
If the algebras are unital, the unit operation has type
is another naturality equation.
For coalgebras, the comultiplication
has type
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
Since endomorphisms compose, this Hom-scheme carries a multiplication morphism
The identity endomorphism gives a unit point
Thus
is an affine monoid scheme.
On coordinate rings, this means that
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
An endomorphism of
is invertible.
Therefore
is the open subscheme of
where the determinant is invertible:
Equivalently,
Thus
is an affine group scheme.
If
then
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
For a Lie algebra, one says that
These formulas are correct, but they are not the primitive idea.
For self-valued derivations, the more conceptual definition is
In words:
This definition explains why the Leibniz rule has the form it does.
11. The Lie algebra functor
Let
For every commutative
Thus
There is a projection
The Lie algebra functor of
So
For example,
because every element of the kernel has the form
and
Now take
Then an element of
is an automorphism of
Such an automorphism has the form
where
It is automatically invertible as a linear map, with inverse
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
An infinitesimal automorphism of the underlying vector space has the form
To say that this infinitesimal automorphism preserves the operation
Expanding this equation to first order in
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
Here the operation has type
An infinitesimal automorphism of the underlying vector space is
The condition that it preserves multiplication is
Evaluate both sides on a pure tensor
The left-hand side is
The right-hand side is
Using bilinearity of multiplication, this becomes
Since
the last term vanishes. Hence the right-hand side is
Therefore multiplication is preserved to first order if and only if
Comparing the coefficients of
This is the usual Leibniz rule for associative algebras.
If the algebra is unital, there is also a unit operation
Preserving the unit means
Evaluating at
Thus
So for unital associative algebras, the infinitesimal automorphisms are precisely the linear maps
This is exactly the usual notion of a derivation.
Lie algebras
Let
Again, this operation has type
An infinitesimal automorphism of the underlying vector space is
The condition that it preserves the bracket is
The left-hand side is
The right-hand side is
Using bilinearity of the Lie bracket, this expands to
Since
the last term vanishes. Therefore the right-hand side is
Thus bracket preservation to first order is equivalent to
Comparing coefficients of
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
near
Equivalently,
Coalgebras
Now let
This operation has type
An infinitesimal automorphism of the underlying vector space is again
The condition that it preserves comultiplication is
We compute both sides.
Using Sweedler notation,
The left-hand side is
So
equals
Expanding this gives
Since
the last term vanishes. Thus the left-hand side is
The right-hand side is
By linearity of
Therefore comultiplication is preserved to first order if and only if
Comparing coefficients of
This is the usual coderivation condition.
If the coalgebra is counital, there is also a counit operation
This has type
Preserving the counit means
Thus, for every
Equivalently,
Hence
for all
So for a counital coalgebra, an infinitesimal automorphism is a linear map
and
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
an infinitesimal automorphism
must satisfy
The first-order part of this equation says that
For multiplication and Lie brackets, there is one output and two inputs, so one obtains
For comultiplication, there is one input and two outputs, so one obtains
Thus the Leibniz rule is not the root definition. It is the coordinate expression of a more structural statement: