Let mathcalC=(mathcalC0,mathcalC1) be a (small) strict monoidal category. Pick a field mathbbK, and let mathbbK[mathcalC1] be the vector space with basis the morphism of mathcalC. It is an associative unital algebra under tensor product otimes (the identity morphism on the otimes unit is the algebra unit).
I will now define a coassociative comultiplication on mathbbK[mathcalC1], although without restriction on mathcalC the comultiplication will not converge. I'll give two descriptions:
- mathbbK[mathcalC1] is an associative algebra not only under otimes, but also under composition: if a,binmathcalC1, then ab=acircb if that composition is defined in mathcalC1, and 0 otherwise. But mathbbK[mathcalC1] has a distinguished basis (namely mathcalC1), and hence a distinguished map mathbbK[mathcalC1]to(mathbbK[mathcalC1])∗; using this map, turn the composition multiplication into a comultiplication.
- For each morphism cinmathcalC1, there is some set (a,b)inmathcalC1timesmathcalC1texts.t.acircb=c of ways to factorize c. Define Delta(c)=sumacircb=caotimesb; where here the otimes is the exterior one (not the other multiplication on mathbbK[mathcalC1].
From either description, it's clear that the comultiplication isn't really defined: in general that sum diverges. So let's suppose that mathcalC has the property that any morphism has only finitely many factorizations. Clearly this requirement is evil.
Question 0: Is there a less evil way to talk about this comultiplication? Actually, even the requirement that mathcalC be strict is evil, but without it mathbbK[mathcalC1] is not associative. Is there a less evil fix for this?
The comultiplication is co-unital. The counit on mathbbK[mathcalC1] sends identity morphisms to 1inmathbbK and non-identity morphisms to 0. (A less-evilization might want to send, say, isomorphisms to 1, or something.)
So, I have a vector space mathbbK[C1] with a multiplication (coming from the monoidal structure on mathcalC) and a comultiplication (coming from the composition structure on mathcalC).
Question 1: Are there simple general conditions that assure that this structure is a bialgebra?
In the categories I am most interested in, mathbbK[mathcalC1] is a bialgebra. My intuition is that when mathcalC is sufficiently free, everything works. Here's an example. The category of braided graphs has objects the non-negative integers, thought of as distinguished subsets of mathbbR. A morphism between m and n is: a graph G with m univalent vertices marked "in" and n univalent vertices marked "out", along with a smooth embedding GtomathbbR2times[0,1] so that GcapmathbbR2times0 consists of precisely the m "in" vertices, spaced out on the integers 1,dots,mtimes0times0, and similarly for the out vertices, and such that every edge of G is never horizontal. Two morphisms are identified if they are isotopic rel boundary among embedded graphs with non-horizonal edges. Composition are the monoidal structure are obvious. Equivalently, the category of braided graphs is the free braided monoidal category generated by a single basic object V and a basic morphism in each hom(Votimesm,Votimesn).
In any case, once you have a bialgebra, you are lead inexorably to the following question:
Question 2: When is mathbbK[mathcalC1] Hopf?
For very free categories, it is Hopf: a free category is graded, by setting the generators to have grading 1; the degree-zero part is mathbbK[textidentitymaps], and these themselves are graded by the number of objects; the degree-zero part of this is mathbbK, generated by the identity map on the monoidal unit; then bootstrap back up. Probably this works for less-free things too, using filtrations rather than gradings (i.e. filtered quotients of free monoidal categories).
No comments:
Post a Comment