Skip to the Main Content

Note:These pages make extensive use of the latest XHTML and CSS Standards. They ought to look great in any standards-compliant modern browser. Unfortunately, they will probably look horrible in older browsers, like Netscape 4.x and IE 4.x. Moreover, many posts use MathML, which is, currently only supported in Mozilla. My best suggestion (and you will thank me when surfing an ever-increasing number of sites on the web which have been crafted to use the new standards) is to upgrade to the latest version of your browser. If that's not possible, consider moving to the Standards-compliant and open-source Mozilla browser.

February 9, 2007

Day on RCFTs

Posted by Urs Schreiber

The short note

Brian J. Day
Association schemes and classical RCFT’s as “graphic” Fourier transformations
math.CT/0702208

is apparently a message from a mathematician to physicist saying: “Notice this standard fact. It might be useful for what you are doing.” As Brian Day writes in the abstract:

Mathematically, this is a fairly straightforward observation, but may be worth pursuing from a physical viewpoint.

The main statement seems to concern a construction of something “realising” a fusion ring, i.e. a ring of equivalence classes in a semisimple braided tensor category. These fusions rings are a big deal in (rational) conformal field theory.

Unfortunately, the note is entirely internal to enriched category theory. I curse myself for still not having taken the time to learn how make ends and coends meet in enriched category theory.

On the train back home I will look at

G. M. Kelly
Basic Concepts in Enriched Category Theory

Hopefully after that I’ll be able to decode Brian Day’s message.

(Is he maybe just talking about reconstructing a tensor category from its fusion ring?)

Posted at February 9, 2007 3:28 PM UTC

TrackBack URL for this Entry:   http://golem.ph.utexas.edu/cgi-bin/MT-3.0/dxy-tb.fcgi/1156

48 Comments & 1 Trackback

Re: Day on RCFTs

Here are a few comments that might help you a little when it comes to ends, coends and enriched categories.

First, you’ll notice that Kelly’s book discusses ‘ends’ shortly before discussing ‘indexed limits’. This is because the two concepts, while distinct, are interchangeable, in the sense that they’re both special cases of each other.

Kelly tackles ends first, and then indexed limits. You’ll see on page 37 that he says: “… is the limit precisely when … is an end.” Here is reducing the theory of indexed limits to the theory of ends.

Personally I think it’s easier to go the other way: first learn about indexed limits, then, if necessary, learn about ends.

In fact, I prefer to dualize, and think about indexed colimits and coends instead of indexed limits and ends.

The reason is this: the theory of indexed colimits is a straightforward categorification of the theory of integrals.

If you’re trying to categorify inner products, path integrals and other integrals, this is good to know!

Here’s how it goes, in a nutshell.

If we have a finite set X we can think of a measure on X as just a map

w:X

assigning to each point its ‘weight’. Suppose L is any vector space. We can integrate any vector-valued function

f:XL

with respect to the measure w as follows:

Xfdw= xXw(x)f(x)

Kelly’s theory of indexed colimits — usually called the theory of weighted colimits — categorifies this idea!

The replacement for our set X is a category X.

The replacement for is a cocomplete symmetric monoidal category V. The colimits of V are the categorified version of ‘addition’, while the tensor product in V is the categorified version of ‘multiplication’.

The replacement for our vector space L is a category L that’s enriched over V and tensored over V. ‘Enriched over V’ says that given objects x,yL, we have hom(x,y)V. ‘Tensored over V’ means that given xL and vV, we can define vxL. There is of course more to the definitions of these concepts that I’m giving here, but this is enough to get the idea.

The replacement for the vector-valued function we’re integrating is a functor

f:XL

The replacement for our measure is what Kelly calls an ‘indexing type’, but most people prefer to call a ‘weight’: it’s a functor

w:X opV

Note the all-important ‘op’!

The weighted colimit, when it exists, is an object

XfdwL

In the simple case where X is a discrete category (basically just a set), we have

Xfdw= xXw(x)f(x)

See? It’s just like what we had before!

Another simple case is when we use the most boring possible weight

w:XV

namely the one with

w(x)=1

for every object xX, and w(f)=1 1 for every morphism f in X.

If we use this weight, our weighted colimit reduces to an ordinary colimit:

fdw=colim xXf(x)

So, the theory of weighted colimits generalizes the theory of colimits much as the theory of integrals generalizes the theory of sums.

But, in the simple examples I just gave, we don’t see the need for the ‘op’ in the weight

w:X opV

If you already know and love coends, you can guess why this ‘op’ shows up. From our weight and our functor

f:XL

we can form a functor

X op×Xw×fV×LL

where the second arrow uses the fact that L is tensored over V.

This kind of functor

X op×XL

is precisely the sort of thing we take a coend of, getting an object of L!

But, if you don’t already know and love coends, you now see why we need them: precisely to do weighted colimits.

By the way, you might complain my use of the term ‘integral’ is overblown, since the only integrals I’m really considering are weighted sums. That’s a valid complaint. So, you might prefer it if I changed my main message to this:

The theory of weighted colimits is a straightforward categorification of the theory of weighted sums.

Posted by: John Baez on February 12, 2007 10:11 PM | Permalink | Reply to this

Re: Day on RCFTs

The theory of weighted colimits is a straightforward categorification of the theory of weighted sums.

Thanks a lot for these hints!

I started reading Kelly’s book last weekend, and roughly understand the definition and the usage of ends and coends now.

What I still need to learn is what these p(a,b,c) are that Day uses a lot.

I recall that a while ago David Corfield pointed me to some references on that. But I cannot find these links anymore!

By the way: do you understand what Day is talking about on his three pages to the extent that you could say in one simple sentence what it is that he considers in the last paragraph?!

Posted by: urs on February 13, 2007 12:58 PM | Permalink | Reply to this

Re: Day on RCFTs

Did you mean the links here?

I find Google best for finding my way around this blog.

Posted by: David Corfield on February 13, 2007 1:22 PM | Permalink | Reply to this

Re: Day on RCFTs

Did you mean the links here?

Yes! Thanks for taking care of an internet illiterate…

Posted by: urs on February 13, 2007 1:30 PM | Permalink | Reply to this

Re: Day on RCFTs

Urs wrote:

By the way: do you understand what Day is talking about on his three pages to the extent that you could say in one simple sentence what it is that he considers in the last paragraph?!

No, alas. Luckily now the ‘pros’ are helping you out.

Posted by: John Baez on February 24, 2007 12:05 AM | Permalink | Reply to this

Re: Day on RCFTs

Luckily now the ‘pros’ are helping you out.

Yes, that was very helpful. A little probiotic category theory a day is said to be potentially beneficial.

How many people are there in the world, who might be able to appreciate the connection Day makes between rational conformal field theory and probicategories?

But we are working on it…

Currently I am strucggling with the following:

We know that 2-dimensional conformal field theories are extended QFTs with values in 𝒞-vector spaces (𝒞-module categories), where 𝒞 is a modular tensor category – in particular simple.

By Ostrik’s theorem all these 𝒞-vector spaces are equivalent to categories of modules of algebras internal to 𝒞.

The question is: what happens to this statement when the CFT is no longer rational and 𝒞 is no longer simple?

A natural guess would be that then we need categories of module of algebroids internal to 𝒞.

If 𝒞 is closed (only case I know of where this is the case is 𝒞=Vect), then there is a nice way to say this:

A 𝒞-vector space N being equivalent to a category of internal modules means that it has a basis A: N[A,𝒞].

Here I am thinking of the algebra (or algebroid) A internal to 𝒞 as a 𝒞-enriched category, and denote by [.,.] the category of 𝒞-functors, which is hence nothing but the category of A-modules.

This is a concept of “basis” for 2-vector spaces slightly more general than what is used sometimes. It categorifies that fact that an ordinary vector space has a basis iff there is a set S such that V[S,K], where K is the ground field and [S,K] denotes the space of K-valued functions on S.

But how do I say that nicely for cases where 𝒞 is not closed? Certainly I can then still consider algebroids internal to 𝒞 (where I really mean 𝒞-enriched categories) and modules for them. But now I am no longer sure in which sense to write the category of all such modules for a given A in the form [A,something].

Posted by: urs on February 24, 2007 8:23 PM | Permalink | Reply to this

Re: Day on RCFTs

John wrote:

Another simple case is when we use the most boring possible weight w:XV namely the one with w(x)=1 for every object xX, and w(f)=1 1 for every morphism f in X.

I can’t resist explaining why weighted (co)limits are not only good, but, if you want to do enriched category theory, necessary.

In Kelly’s general development, John’s category ‘X’ is not a mere category, but a V-enriched category. Let me write I instead of 1 for the unit object of V. Now look at the end of the definition of ‘the most boring possible weight’: it says

w(f)=1 I for every morphism f in X.

Well, X is an enriched category, so it doesn’t make sense to talk about the morphisms f of X.

Instead, to define an enriched functor w:XV which does xI on objects, we have to define for each x,yX a map w x,y:X(x,y)V(I,I) in V. Here V is meant to be closed, so that it can be regarded as a category enriched in itself. Explicitly, V(p,q) is the ‘function space’ [p,q] for any p,qV, and in particular V(I,I)=I. So we have to define for each x,yX a map w x,y:X(x,y)I in V.

This is all very well if the unit object I of V happens to be terminal - as in the familiar case of ordinary category theory, (V,,I)=(Set,×,1 ).

But for a general V, there’s simply no way to do this! Hence there’s no ‘most boring possible weight’, hence there are no ordinary (co)limits. There are only weighted (co)limits.

Posted by: Tom Leinster on February 13, 2007 1:48 PM | Permalink | Reply to this

Re: Day on RCFTs

I ended the above entry with the question:

(Is Brian Day maybe just talking about reconstructing a tensor category from its fusion ring?)

On second reading, I think the answer is yes.

A promonoidal category A is supposed to be like an ordinary monoidal category, but V-enriched and with functors replaced by profunctors.

So in particular, the tensor product functor :A×AA is taken to be a V-profunctor, i.e. a V-functor p:A op×A op×AV (where “×” is the V-tensor product).

Just like monoidal categories are just bicategories with a single object, promonoidal categories are just probicategories with a single object.

Hence, more generally, we have lots of objects x,y,z, and V-Hom-objects A(x,y) etc. and horizontal composition is a V-profunctor :A(x,y)×A(y,z)A(x,z) hence an ordinary V-functor p:A(x,y) op×A(y,z) op×A(x,z)V.

Next, when considering morphisms (2-functors) F:AB between promonoidal categories, we want composition be respect ed by enforcing something like F(a)F(b)F(c) for c the composite of a and b.

In the probiotic language – er, I mean: in the probicategory language, this amounts to demanding cp(a,b,c)F(c)F(a)F(b), where the integral sign denotes a coend.

As far as I am beginning to understand the point of Brian Day’s paper here, he emphasizes that this composition law has a very important and familiar incarnation in the context of Moore-Seiberg data of RCFTs, namely in the context of semisimple braided tensor categories.

There, we consider abelian monoidal (=”tensor”) categories with a finite number of isomorphism classes of simple objects U i, such that U iU j kU k N ij k.

Brian Day notes that if we set V=Vect K for K our ground field and moreover set p(i,j,k)=K N ij k then this is a special case of the above probiotic composition law U iU j kp(i,j,k)U k.

As far as I understand. (So somehow the coend reduces to a mere coproduct here.)

Moreover, Day indicates how we can, this way, understand every such semisimple tensor category for given fusion data N ij k as the image of a suitable probifunctor from something like the universal such category to a suitable codomain.

Roughly, at least. Somehow Kan extensions play a role, too, and we don’t just take the domain to be A, but [A,Vect].

I need to better understand this. But so much for now.

Posted by: urs on February 13, 2007 2:50 PM | Permalink | Reply to this

Re: Day on RCFTs

Grrr… I just spent a long time composing a comment, hit preview, and was told there was an internal server error and lost all this work. Time to follow Jeff Morton’s advice, and write out posts in advance on a word editor!

In the meantime, there have been a number of posts and it looks like Urs has got things mostly or maybe completely sorted out by now, but I’ll throw out a few comments anyway, and hope some of them stick.

Most (probably all) of the coends which appear in Brian Day’s note are really tensor products of modules – that really is a prototypical application of coends, and gives a great way of understanding how weighted colimits work generally.

Let’s first consider modules over a ring R: let A be a right R-module and B a left R-module. Their tensor product is a coequalizer of a pair of maps

ARBAB

where one arrow is A tensor the action on B and the other is the action on A tensor B. Now think of R as a one-object category enriched in Ab (I’ll call its object ‘1’). A left module amounts to an enriched functor B:RAb, and a right module to an enriched functor A:R opAb. In other words, these functors are tantamount to actions of the hom-object R=hom(1 ,1 ), and the tensor product can be expressed as the coequalizer of a diagram written

A(1 )hom(1 ,1 )B(1 )A(1 )B(1 ).

Much more generally now, take any category X enriched in any symmetric monoidal closed category V (assume V complete and cocomplete), and let F:XV be a covariant action of X, meaning we have maps

F(x)hom(x,y)F(y)

expressing functoriality of F (I should say ‘enriched’, but I get tired of saying that – please insert as appropriate!). Similarly, let G:X opV be a contravariant action. Then the tensor product F XG is the coequalizer of the evident pair of maps built out of the actions:

x,yOb(X)F(x)hom(x,y)G(y) xF(x)G(x)

and this is also called the colimit of F weighted by G, also denoted

xF(x)G(x).

Similarly, if one has two modules F,G:XV, one can form their module-hom hom X(G,F) as an object of V, as an equalizer of a pair of maps again built from the actions, again directly generalizing the case of modules over a ring. This is a limit of F weighted by G.

More generally still, given a V-category C, a V-functor F:XC, and a weight G:X opV, one can define the notion of colimit of F weighted by G, as an object of C. The trick is to define it universally, by stipulating that all contravariant hom-functors hom(,c) carry this weighted colimit to the appropriate weighted limit in V. [It is not generally correct to try to define it as a colimit of a diagram in the underlying (ordinary) category of C – instead, bring it back to hom-base (“home base”) V, where you are safe.]

Day’s note is written in the well-known style of hardcore Australian category theory: powerful medicine, but not always gentle on the system. But here’s a way of understanding this probicategory and p(a, b, c) business: a probicategory enriched in V is really a bicategory internal to the bicategory of V-categories and V-profunctors between them. (A V-profunctor from C to D is just a bimodule from C to D, i.e., a covariant-C contravariant-D functor CD opV. These are composed by taking tensor products of bimodules, as in the discussion above.) Thus, a probicategory consists of a collection of objects x, y, z, …, and hom-categories hom(x,y) enriched in V, and compositions

hom(x,y)hom(y,z)hom(x,z)

which are bimodules, and so forth and so on. If you unravel all this in nuts-and-bolts terms, you find yourself looking at all these coend thingies that Day writes down.

Posted by: Todd Trimble on February 13, 2007 9:00 PM | Permalink | Reply to this

Re: Day on RCFTs

Then the tensor product F XG is the coequalizer of the evident pair of maps built out of the actions x,yOb(X)F(x)hom(x,y)G(y) xF(x)G(x) and this is also called the colimit of F weighted by G, also denoted xF(x)G(x)

Thanks for saying that! Now that you said it, I recall having read and thought about this once (in the context of Costello’s work), but apparently mostly forgotten it.

So I am entitled to think of a weighted colimit as a many-object generalization of the tensor product of bimodules. Great.

Where do coends come in from this point of view. Is this already equivalently a coend?

Posted by: urs on February 13, 2007 9:38 PM | Permalink | Reply to this

Re: Day on RCFTs

To check if I got this right, I’ll try to spell out one of my favorite examples in a pro way.

That favorite example of mine is the inclusion Bim VectMod of the 2-category of algebras, bimodules and bimodule homomorphisms in the 2-category (I say 2-category for bicategory) of Vect module categories.

This sends an algebra A to the category Mod A of its modules (on which Vect acts by tensoring each module from the left by a vector space), sends every A-B bimodule N to the Vect-linear functor Mod A Mod B M M AN and similarly sends every bimodule homomorphism to a natural transformation of these.

Okay. Now I should reformulate this in Vect-enriched language.

So I take V=Vect and regard all my algebras A as 1-object V-enriched categories Σ(A). To be explicit: Hom Σ(A)(,)=AObj(Vect).

In particular, there is the algebra , which is the ground field (I take the ground field to be the complex numbers, just for definiteness so that I feel at home) regarded as an algebra over itself. This is the tensor unit in V=Vect, so I should write I:=. The corresponding 1-object V-enriched category is, in the above notation Σ().

A module S for an algebra A is now the same thing as a V-functor S:Σ(A)V, namely a vector space S()Obj(V) and a V-morphism (a linear map) AEnd V(S())=S() *S() that is compatible with composition.

This I can regard as a profunctor S:Σ()Σ(A).

Analogously, an A-B bimodule N is now a V-functor N:Σ(A) opΣ(B)V, which I may think of as a profunctor N:Σ(A)Σ(B).

In particular, an ordinary -module, i.e. an ordinary vector space W, is now nothing but a profunctor W:Σ()Σ().

So if I write VCat for the 2-category whose objects are V-categories, and whose 1-morphisms are profunctors between these, then we can regard the category of vector spaces as the endomorphism category of Σ() in VCat Vect Hom Vect Cat(Σ(),Σ().

This is nice, because it makes manifest my statement from above, that the category Mod A of (right) A-module for some algebra A is itself a category with a (left) Vect-action. This action is here seen to be nothing but the composition in VectCat:

The action Vect×Mod AMod A corresponds to Hom VectCat(Σ(),Σ())×Hom VectCat(Σ(),Σ(𝔸))Hom VectCat(Σ(),Σ(𝔸)).

Unless I mixed things up, this must be painfully tautologous for the experts.

On the other hand, I feel like spelling out this tautology in even more detail: the composition in the above is composition of profunctors by weighted colimits/coends.

So, given a vector space W, regarded as a profunctor W:Σ()Σ() which is an ordinary functor Σ() opΣ()Vect and given a right A-module, S, which is a profunctor S:Σ()Σ(A) hence an ordinary functor Σ() opΣ(A)Vect their composite profunctor Σ()WΣ()SΣ(A) is that which is given by the functor cW(,c)S(c,):Σ() opΣ(A)V.

And hopefully, unless I am misunderstanding something that is, the symbol c here is the weighted colimit the way Todd explained above #, which should hence reduce, in the present case, to the ordinary tensor product of bimodules.

Which, in the above case, is just the tensor product of -bimodules hence just the tensor product of vector spaces.

So, in general, given an A-B bimodule N, regarded as a profunctor N:Σ(A)Σ(B) hence an ordinary V=Vect-functor N:Σ(A) opΣ(B)V and a B-C bimodule N, their composition as profunctors Σ(A)NΣ(B)NΣ(C) should be given by the functor cN(,c)N(c,):Σ(A) opΣ(C)V which in turn encodes the A-C bimodule that is nothing but N BN.

Now, in these terms the statement that tensoring the category of A-modules from the right with a bimodule is an operation that respect the left Vect-action on Mod A is nothing but associativity of the composition in VCat Hom VCat(Σ(),Σ())×Hom VCat(Σ(),Σ(A))×Hom VCat(Σ(A),Σ(B))Hom VCat(Σ(),Σ(B)).

All right. So the upshop of all these trivialities now is that without further effort this generalizes to the case where I allow all my algebras to be algebroids, namely general Vect-enriched categories.

(Hm, now I seem to recall that when Simon Willerton visitied a while ago, he was telling me exactly this. Took a while to sink in…)

Posted by: urs on February 14, 2007 7:11 AM | Permalink | Reply to this

Re: Day on RCFTs

I think you’ve got it. The calculus of enriched bimodules is kind of fun, and you can do a lot with it. By the way, a paper that I personally found very illuminating when I was first grappling with this stuff is Lawvere’s paper on metric spaces and generalized logic; he has some material on enriched bimodules. I particularly liked the section on Cauchy completion, and seeing how this relates to Karoubi envelopes and Morita equivalence in your favorite example.

I’d just add one comment, perhaps not a big deal but sufficiently bothersome to me to point it out. What I call a profunctor Σ(A)Σ(B) is where A acts covariantly (traditionally, on the left) and B acts contravariantly. I think you have it the other way; you call a profunctor Σ(A)Σ(B) a module of the form Σ(A) opΣ(B)V.

One reason I prefer my way is that a functor f:AB induces a profunctor from A to B: just compose f with the Yoneda embedding of B to get

y Bf:AV B op.

(Here we hear a faint echo of the fact that profunctors are secretly about the free cocompletion V B op, as touched upon in my other comment; what I’d really like to say is that the bicategory of categories and profunctors is the Kleisli bicategory of the free cocompletion monad, but alas, there are size issues there.) BTW, profunctors which come from functors in this way are left adjoints in the bicategory of profunctors, and if we stick to Cauchy complete categories, all such left adjoints arise in this way. But I’m rambling on some pet topics here; I’ll stop.

Posted by: Todd Trimble on February 14, 2007 2:26 PM | Permalink | Reply to this

Re: Day on RCFTs

Thanks for all these comments. I very much appreciate it!

Maybe one clarification:

when I write cW(,c)S(c,) above, do I have to address this is a weighted colimit or as a coend. Or is it always both? Or just under some extra conditions?

I’d just add one comment, perhaps not a big deal but sufficiently bothersome to me to point it out. What I call a profunctor Σ(A)Σ(B) is where A acts covariantly (traditionally, on the left) and B acts contravariantly. I think you have it the other way;

Yes, I am aware of that. I think here I was trying to follow Day’s conventions. But I agree that from another point of view the other convention is more natural.

the bicategory of categories and profunctors is the Kleisli bicategory of the free cocompletion monad

[…]

BTW, profunctors which come from functors in this way are left adjoints in the bicategory of profunctors

Hm, okay, one day I’ll need to understand this better than I currently do. This is closely related to some things I learned (or maybe just partially learned) from Aaron Lauda, math.CT/0502550, which in turn triggered my understanding of “FFRS formalism as locally trivialized 2-transport” #.

The point is that if we have a 2-functor tra to bimodules, and want to identify it locally with a “simpler” such 2-functor tra 0 , “without losing information”, we need at least a special ambidextrous adjunction # between them.

But if one writes this down in components, it means that one also needs a (special ambidextrous) adjunction on the objects in the image of tra.

Sorry. Now it is me who is rambling once again. :-)

Posted by: urs on February 14, 2007 3:26 PM | Permalink | Reply to this

Re: Day on RCFTs

when I write cS(c)W(c) above, do I have to address this is a weighted colimit or as a coend. Or is it always both? Or just under some extra conditions?

I’d call this (presentation of a weighted colimit) an example of an enriched coend.

An ordinary coend xF(x,x) of a functor F:C op×CD, i.e., a coend as a type of colimit in the world of ordinary categories, is a colimit of a diagram pasted together from pieces that look like

F(x,x)F(f,1 )F(y,x)F(1 ,f)F(y,y)

and another way you could put this is that the coend is a coequalizer of a pair of maps of the form

f:xyF(y,x) xF(x,x).

Or, put still another way, that the coend is a coequalizer of the form

x,yF(y,x)×hom(x,y) xF(x,x).

Now the last formulation suggests the right way to define an enriched coend in V (replacing × by of course). The one before that doesn’t always give the correct enriched coend; as you can see, it refers to elements f of the underlying set of the hom-object. I think it gives the enriched coend if the underlying set functor hom(I,):VSet is faithful or something; I’m not exactly sure what the precise statement should be, but hopefully it’s in that ballpark. I’m guessing that a typical example where it doesn’t give the enriched coend is where V= chain complexes, where hom(I,) is far from being faithful.

Also, this coequalizer description is for enriched coends of functors F:C opCV valued in V. I think one can run into trouble trying to extend that description to enriched coends of functors F:C opCD in a general V-category D. Instead of defining it as a coequalizer in the underlying category of D, one has to define it by saying that all the contravariant homs carry it to an appropriate end in V.

With all those caveats in place, it’s true that weighted colimits in a V-category D can be presented in terms or tensors and coends, as suggested by the formula

cF(c)W(c)

in cases where D has tensors and coends. (We say D admits tensors if each hom(d,):DV has an enriched left adjoint.) I regard that as akin to saying that all ordinary colimits in D can be presented using coproducts and coequalizers, if D has them – but that’s just one presentation. (At the same time, a coend is a very canonical sort of colimit, being a colimit of a functor F:C opCD wrt the weight hom:C opCV.)

Posted by: Todd Trimble on February 14, 2007 6:18 PM | Permalink | Reply to this

Notation

Todd (hi Todd!) wrote:

I’d just add one comment, perhaps not a big deal but sufficiently bothersome to me to point it out.

There’s nothing like a debate about terminology! And I want to join in.

Todd - and I think the majority of people - says that a profunctor AB is a functor

(1)B op×ASet.

Here A and B are ordinary, Set-enriched, categories, for sake of simplicity. What I’ve written is usually written –+–>, but for some reason I can’t type that in mathmode here.

I - and I think a sizeable minority of people - say that a profunctor AB is a functor

(2)A op×BSet.

Of course, everyone wants to have the contravariant part first, so that Hom A is a profunctor AA in both conventions.

I understand Todd’s reason for preferring (1). Here are two reasons why I prefer (2).

First reason Given a functor M as in (2), it’s good to write an element mM(a,b) (where a,bA) like this: amb. That way, every diagram a nf nf 1 a 0 mb 0 g 1 g mb m has an unambiguous composite a ng mg 1 mf 1 f nb m. (Here the f i are maps in A and the g j are maps in B.) This can be very useful: e.g. you can talk about commutativity of diagrams such as this: a b a b I’ll call this the module-element notation.

That much is uncontroversial. But the point is that if you use convention (2), a profunctor AB consists of elements ab (which is good), whereas if you use convention (1), a profunctor AB consists of elements ba (which is bad!).

There’s a further level that makes (2) even more desirable, as follows. For any B,ACat, there’s a category of left B-, right A-modules. Moreover, any diagram AABB has an unambiguous (up to iso) composite AB. In short, we have a ‘2-profunctor’ or ‘2-module’ Mod from Cat to Cat. So when we write AMB, we could either be using the module-element notation (with respect to the 2-module Mod) or be using one of conventions (1) or (2). So if we’re not to get hopelessly confused, it’s essential that the module-elements go in the same direction as the module itself - in other words, that we use convention (2).

Second reason Everyone agrees that a functor M as in (2) can be regarded as a left B, right A-module: BM A, for short. Then we have a tensor product, CN B BM A= C(N BM) A. Using convention (2), this says that AMBNCcomposestoANMC - in other words, is composition in the bicategory of modules (=profunctors). But if we use convention (1), it says that CNBMAcomposestoCMNA - in other words, is back-to-front composition in the bicategory of modules. This makes things confusing!

Posted by: Tom Leinster on February 14, 2007 5:02 PM | Permalink | Reply to this

Oops

Obviously my fingers refused to type something so immoral. In the last display, MN should be NM.

Posted by: Tom Leinster on February 14, 2007 5:17 PM | Permalink | Reply to this

Re: Oops

Heh, you know your Second Reason just caused a bunch of us to become happier with Convention (1). ^_^

Posted by: Toby Bartels on February 14, 2007 11:35 PM | Permalink | Reply to this

Re: Oops

Go on…

Posted by: Tom Leinster on February 14, 2007 11:52 PM | Permalink | Reply to this

Re: Oops

I just mean that for a bunch of people it seems obvious that the composite of M followed by N should be M ⊗ N. Since few math papers are written in Hebrew or Arabic, you know.

Posted by: Toby Bartels on February 15, 2007 12:09 AM | Permalink | Reply to this

Re: Notation

(Hey there, Tom!) Yeah, I know, those are points that I have an internal debate about every time I deal with these things. It usually takes me a good half hour at least to wrestle myself into a position where the me that wants to define bimodules as the mainstream does [and as I think I want] comes out on top. But the bottom half still feels uncomfortable and gives a muffled cry, for exactly the reasons you give!

I think it’s akin to the age-old debate about how to write composition of morphisms. Maybe I’m just getting old, but I think that bottom line for me is that I’ve just gotten so used to doing things one way that I would just wind up confusing myself if I didn’t come to a firm decision to stick to my guns and the heck with it. I mean, the arguments for composing as if reading English instead of Hebrew make sense to me, but I’m sorry: writing the counit of an adjunction FG as GF1 still looks perverse to me, dammit! (Jim Dolan and I must have wasted a few man-hours apiece unraveling each other’s notation when we talk – we almost always disagree it seems. Imagine the fun we have with ambidextrous adjunctions!)

Tom, in the immortal words of Talking Heads: Stop Making Sense!

Posted by: Todd Trimble on February 14, 2007 7:01 PM | Permalink | Reply to this

Re: Notation

Todd wrote:

Maybe I’m just getting old, but I think that bottom line for me is that I’ve just gotten so used to doing things one way that I would just wind up confusing myself if I didn’t come to a firm decision to stick to my guns and the heck with it.

I’m definitely there too. Uncertainty is exhausting!

Posted by: Tom Leinster on February 14, 2007 11:54 PM | Permalink | Reply to this

Re: Notation

Tom wrote (in sympathy with Todd):

Uncertainty is exhausting!

As a proponent of the antiLeibniz convention, let me just say for the record that I agree! Nobody should ever use the notation ‘fg’ (or ‘f ⋅ g’) for composition (in either order) without stating their conventions explicitly. And nobody should ever use ‘f ° g’ for composition in the antiLeibniz order (unless for some reason the unambiguous notation ‘fg’ is unavailable, in which case they should still state their conventions explicitly).

Posted by: Toby Bartels on February 15, 2007 12:13 AM | Permalink | Reply to this

server

Grrr… I just spent a long time composing a comment, hit preview, and was told there was an internal server error and lost all this work.

Just for your information, in case this happens again:

I just encountered one of these “internal server arrows” myself again. Just hitting my browser’s back-button helped: no information was lost (I had a backup anyway, but still) and hitting preview or submit a second time then had the desired result.

Posted by: urs on February 14, 2007 9:22 AM | Permalink | Reply to this

Re: Day on RCFTs

I am trying to understand the role played by these “Kan extensions” that Day mentions.

It seems that the issue is the following:

For an ordinary bifunctor F:AB respect for composition is expressed by A(x,y)×A(y,z) A A(x,z) F×F F B(Fx,Fy)×B(Fy,Fz) B B(Fx,Fy). But when composition of Hom-categories A(x,y) is just a profunctor, i.e. a functor p:A(x,y) op×A(y,z) op×A(x,z)V, then the top horizontal morphism does not land in A(x,z), but in [A(x,z),V]: