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.

January 5, 2008

Geometric Representation Theory (Lecture 19)

Posted by John Baez

In the penultimate lecture of last fall’s Geometric Representation Theory seminar, James Dolan lays the last pieces of groundwork for the Fundamental Theorem of Hecke Operators.

I’ll actually state the Fundamental Theorem in the next lecture. But for those of you who can’t stand the suspense, there’s some supplementary reading below, where the theorem is actually stated — and in a much more detailed way! Right now this is just a rough draft, not containing proofs. It’ll seem awfully dry if you haven’t been following the seminar so far, because it lacks all the fun examples we’ve been talking about all along. I’ll fix that later.

  • Lecture 19 (December 4) - James Dolan on the Fundamental Theorem of Hecke Operators. Answer to last week’s puzzle. A new puzzle: find an interesting groupoid with cardinality e e. A harder one: find an interesting groupoid with cardinality π.

    Degroupoidification turns a finite groupoid G into a finite-dimensional vector space, its zeroth homology H 0(G). It turns a span of finite groupoids

    GjSkH into the linear operator defined as the composite

    Gj !Sk *H

    where k * is the pushforward (defined in an obvious way) and j ! is the transfer (defined in a clever way using groupoid cardinality, as explained here).

    Degroupoidification is a weak monoidal 2-functor

    D:FinSpanFinVect

    where

    FinSpan=[finitegroupoids,spansoffinitegroupoids,equivalencesbetweenspans]

    and

    FinVect=[finitedimensionalvectorspaces,linearoperators,equationsbetweenlinearoperators]

    The latter is really just a category in disguise. So, we can use degroupoidification to obtain a weak 3-functor

    D¯:[bicategoriesenrichedoverFinSpan][categoriesenrichedoverFinVect]

    For us, the key example of a bicategory enriched over FinSpan is the Hecke bicategory of a finite group G, Hecke(G). This has finite G-sets as objects, and for any pair of finite G-sets A and B it has

    hom(A,B)=(A×B)//G

    Composition in the Hecke bicategory involves a “trispan”.

    Future directions: following the plan outlined on page 400 of Daniel Bump’s book Lie Groups, in the chapter “The Philosophy of Cusp Forms”.



Posted at January 5, 2008 3:08 AM UTC

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

26 Comments & 1 Trackback

Re: Geometric Representation Theory (Lecture 19)

The Fundamental Theorem of Hecke Operators says that D¯(Hecke(G)) is the category of permutation representations of G.

Hold on - I’m confused here. I have the same confusion with the supplementary reading. Don’t you have to tensor the hom-sets with the ground field k? In the category of permutation representations of G, the hom-sets are k-vector spaces.

Posted by: Bruce Bartlett on January 6, 2008 2:31 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Bruce wrote:

Hold on - I’m confused here.

Good!

I’m glad you’re reading this stuff, Bruce! You claimed to be dying of suspense, wanting to know how the Fundamental Theorem of Hecke Operators really worked. Well, now you can see how it really works! And, I hope you’ll find it as mindbending and cool as I did. I’m dying to explain it to you.

The first step is to be completely confused, just like I was.

You see, the correct statement of the Fundamental Theorem is quite different from my original failed attempt. It’s just similar enough for the resemblance to be really confusing! Going from the incorrect statement to the correct one is like waking up from a dream.

Don’t you have to tensor the hom-sets with the ground field k?

No! For one thing, there aren’t really hom-sets. There are hom-groupoids. And what you do is degroupoidify these hom-groupoids. That turns them into k-vector spaces.

In the category of permutation representations of G, the hom-sets are k-vector spaces.

Right. And in the Hecke bicategory of G, the hom-thingies are groupoids. The Hecke bicategory of G is a bicategory enriched over

FinSpan=[finitegroupoids,spansoffinitegroupoids,equivalencesbetweenspans]

So, for any pair of finite G-sets A and B, we have a hom-groupoid

hom(A,B)=(A×B)//G

And, if we ‘degroupoidify’ this groupoid — take the free vector space on the set of isomorphism classes — we get the vector space of intertwiners from the permutation representation associated to A, to the permutation representation associated to B!

Never mind all the fancy machinery for a minute, like enriched bicategories. The important thing is: do you see why the last paragraph is true? Do you see why an isomorphism class in (A×B)//G is just an orbit for the action of G on A×B, and these orbits give a basis of intertwining operators between the permutation representations?

(The last is something Jim explained way back in lecture 3 — we called the elements of this basis ‘Hecke operators’. Of course, I’ll need to flesh out my little paper a lot more, to make it self-contained.)

Posted by: John Baez on January 6, 2008 4:34 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Hi John,

As you know, the reason I’m interested in this stuff is firstly, of course, because I’m a big fan of the HDA series, but also because many of the patterns which crop up in your and Jim’s course on Geometric Representation Theory also crop up in 2-representations; one just has to sprinkle the words “U(1)-central extension” here and there.

But unless I am still confused it seems to me that, without that Doplicher-Roberts reconstruction stuff (which sounds very interesting), the current version of the Fundamental Theorem of Hecke Operators has no actual content!

Of course that’s a very strange thing to say, so let me explain myself. I’m going to break up the theorem into two parts.

(a) The “intertwiners and groupoids” part. John wrote:

So, for any pair of finite G-sets A and B, we have a hom-groupoid

hom(A,B)=(A×B)//G

And, if we `degroupoidify’ this groupoid — take the free vector space on the set of isomorphism classes — we get the vector space of intertwiners from the permutation representation associated to A, to the permutation representation associated to B!

The important thing is: do you see why the last paragraph is true?

Yes… though I didn’t see it at first. Now that I think I understand it, wouldn’t most mathematicians consider this as sort of trivial though?

Here’s my (perhaps flawed) understanding of it. For any two representations σ and ρ of G, the space of intertwiners between them computes as the space of invariants of the tensor product (using the dual of the first one),

(1)Hom(σ,ρ)Hom(1,σ ρ).

So for permutation representations, one computes: Hom([A],[B]) Hom(1,[A] [B]) Hom(1,[A][B]) Hom(1,[A×B]) =linearcombinationsoforbitsin(A×B)//G, which is precisely what you are saying (though it seems to be an elementary computation).

(b) The “degroupoidification/topos” part. In your notes, the final theorem is stated as:

(2)D¯(K¯(Hecke(G)))Perm(G).

Then you say:

The point of this theorem is that the familiar category Perm(G) is obtained from the Hecke bicategory Hecke(G) by a ‘degroupoidification’ process, namely D¯, after a slight change in viewpoint, namely K¯.

For any others reading this, let me explain what is being stated here. Hecke(G) is the bicategory with:

  • objects are finite G-sets
  • given G-sets A, B, the hom-category hom(A,B) is the category of functors from (A×B)//G into Set.

The Fundamental Theorem of Hecke Algebras then states that if we apply “Process D¯K¯” to Hecke(G), then we gets Perm(G). What are these processes?

Well the first one, “Process K¯”, is the machine which takes Hecke(G) and forms a new bicategory, which has

  • the same objects, namely finite G-sets
  • and hom-groupoids given by Hom(A,B)=(A×B)//G.

But without any Doplicher-Roberts-style input, “Process K¯” has no content! It simply transforms hom-categories into groupoids,

(3)Fun((A×B//G),Set)(A×B)//G,

but it doesn’t do it intrinsically , it just does it by definition!

So the theorem doesn’t start with the cool bicategory Hecke(G), perform some abstract intrinsic manipulations, and then output Perm(G). Rather, it sort of cheats - it converts Hecke(G) by hand into a bicategory where the hom-sets are (A×B)//G… and then states that if we apply “Process D¯” to this new bicategory - in other words, if we degroupoidify the hom-groupoids - we’ll get out Perm(G). But this last step is basically trivial - it is precisely part (a) above!

In other words, in the way I am understanding it, “Process K¯” has no content, while the degroupoidification “Process D¯” is elementary, so the theorem looks empty. On the other hand, I know that there is definitely something to this theorem… so what is it?

Posted by: Bruce Bartlett on January 6, 2008 5:19 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Bruce wrote:

Now that I think I understand it, wouldn’t most mathematicians consider this as sort of trivial though?

Sure, if they understood it. Most mathematicians think anything they really understand is trivial. I think that’s why we usually explain things so badly: to keep other mathematicians — and even ourselves — from really understanding things, and then labelling them ‘trivial’.

If I’d just told you that there was a systematic way to take the category of permutation representations of a finite group and boost it up to a bicategory, you might have been impressed. Or maybe not — after all, there are some very trivial ways to do this, e.g. by throwing in identity 2-morphisms.

If I’d told you that no, I wasn’t doing anything silly like that, and by the way: this bicategory makes no mention of the complex numbers or any other ground field, you might have been impressed.

I could probably even have revealed more details without letting you understand what was going on. I could have said: I’m going to take any category Perm(G) of finite-dimensional representations of a finite group, and obtain it from a bicategory Hecke(G) consisting of

  • finite G-sets
  • spans of finite G-sets
  • maps of spans of finite G-sets

by means of a systematic process that turns certain nice bicategories into Vect-enriched categories. That sounds sort of impressive.

But, since I explained it well enough for you to understand how it really works, you think it’s trivial.

Actually, you only discussed the easiest part in your comment: how the hom-groupoids

hom(A,B)=(A×B)//G

turn into the hom-spaces

hom([A],[B])

when we degroupoidify. We also have to check that composition gets preserved! We start with a composition like this

:hom(A,B)hom(B,C)hom(A,C)

which really means

:(A×B)//G × (B×C)//G (A×C)//G

But notice, the arrow here is not a functor — it’s a span! Jim explained this span at the end of his lecture. I think it’s sort of cool.

And then, we need to check that this span gets sent to the usual composition of intertwining operators

:hom([A],[B])hom([B],[C])hom([A],[C])

For this, of course, we need to use the recipe for turning spans of groupoids into linear operators.

There’s also the part about getting an instrinsic characterization of ‘nice topoi’, which will allow the reconstruction of a finite groupoid X from the nice topos Set X. As you note, that should obscure things enough to make the result more impressive.

Okay — it’ll actually be interesting, too. But not as interesting as you seem to think. After all, this part is bound to work, if the outline I’ve sketched so far is correct. As soon as we know

J:[finitegroupoids,spans,equivalencesofspans] [topoi,functors,naturalisomorphisms] X Set X

is ‘one-to-one’ (in the suitable bicategorical sense), then we can characterize its ‘image’

Nice=[nicetopoi,nicefunctors,nicenaturalisomorphisms]

and get an equivalence

J:[finitegroupoids,spans,equivalencesofspans]Nice

which will then have an ‘inverse’

K:Nice[finitegroupoids,spans,equivalencesofspans]

which is our ‘reconstruction theorem’.

Indeed, all these ‘reconstruction theorems’ have a certain stage magic quality to them: you make a big deal of pulling a rabbit out of the hat, and it impresses everyone tremendously — but all you did was invert the process of putting the rabbit in. All these theorems do is characterize the image of a 1-1 function and then construct its inverse — or some categorified version thereof!

But let me explain why I actually like the ‘Fundamental Theorem of Hecke Operators’.

Most of all, it suggests how to take big wads of finite group representation theory and categorify it! For example, those ‘Hecke algebras’ people like to talk about — those q-deformed versions of the group algebras of symmetric groups — are really algebras naturally sitting inside Perm(G) where G=GL(n,F q). And using the ‘Fundamental Theorem’, it turns out these Hecke algebras can be categorified! An algebra is a one-object category enriched over Vect; when we categorify the Hecke algebra we’ll get a one-object bicategory enriched over Nice — some sort of monoidal category. And since the Hecke algebra is a quotient of the braid group algebra, closely related to the Jones polynomial, this means we’ll have categorified some aspects of ‘quantum topology’.

Jim already explained this back in lecture 13 — that’s what all those braid diagrams were about. The ‘Fundamental Theorem’ just puts this in its proper context.

Next quarter we’ll say more about this and a bunch of other applications…

Posted by: John Baez on January 6, 2008 8:08 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Sure, if they understood it. Most mathematicians think anything they really understand is trivial. I think that’s why we usually explain things so badly: to keep other mathematicians — and even ourselves — from really understanding things, and then labelling them ‘trivial’.

Indeed, you’re right. Very depressing thought.

In this spirit, let me admit : I actually still don’t really understand why the original statement of the theorem failed, though at the time I fooled myself into believing I did! Gulp.

We also have to check that composition gets preserved.

As you stress nicely in your notes, talking about ‘spans between thingy A and thingy B’ is the same as talking about “setwise representations of A×B ”… by definition, basically. As a quirky personal preference, I prefer to work exclusively in this latter language; everything is nice and explicit, and its also the language you used in TWF.

So, a morphism σ:AB between G-sets is just a set-representation of B×A (nicer to swap arguments),

(1)σ:B×ASet.

Essentially as you taught us in TWF, I think of this as a collection of “equivariant transition amplitudes”. In other words, for each aA and bB, we have the set

(2)bσa

which simply tells us the collection of ways to go from aA to bB. Said in this way, it’s clear how to compose them. If ρ:BC is another such gismo, then the composite ρσ:AC will have transition amplitudes

(3)cρσa= bBcρb×bσa.

As Feynman and Zeno taught us, “The collection of ways to go from a to c equals the sum over all intermediate points b of the ways of going from a to b times the ways of going from b to c”. Of course, this is just the definition of composition of spans, but somehow it seems more primeval and quantum-y written this way.

There’s also the part about getting an instrinsic characterization of ‘nice topoi’, which will allow the reconstruction of a finite groupoid X from the nice topos Set X…. this part is bound to work, if J is one-to-one in the appropriate bicategorical sense… we characterize its ‘image’…which gives us our ‘reconstruction theorem’ [warning : severe distortion of John’s original!]

I think I disagree with this. That’s not a reconstruction theorem…that’s basically no more than a play on words!

If I understand you correctly, you are saying that (once we have sorted out the one-to-one thing, which isn’t hard) all we need to do is define the 2-category Nice to have, as objects, morphisms and 2-morphisms, the thingies in the image of our functor. Then we get reconstruction for free. You are surely the first to agree this is an empty procedure (though I sadly agree so many ‘reconstruction theorems’ nowadays have this flavour); indeed you say so in your notes,

We would also like intrinsic characterizations of nice functors and nice natural transformations.

An intrinsic reconstruction theorem would be like Doplicher-Roberts and say something like, “Want to recover the groupoid X from the category Set X ? No problem. All you have to do is take the groupoid of fiber functors, i.e. the monoidal thingy-preserving functors from Set X into Set.” In other words, a categorified Gelfand-Naimark theorem… for G-sets. But I’d be interested to see a precise version of that!

Okay, let me summarize my thoughts. I like the bicategory Hecke(G) - objects are finite G-sets, and the hom-categories are Hom(A,B)=[A×B,Set] - I like it a lot. But I’d like a cleaner, intrinsic mechanism for getting from Hecke(G) to the bicategory which has finite G-sets for objects, and hom-groupoids given by Hom(A,B)=(A×B)//G.

Posted by: Bruce Bartlett on January 6, 2008 11:30 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Bruce wrote:

n this spirit, let me admit: I actually still don’t really understand why the original statement of the theorem failed, though at the time I fooled myself into believing I did! Gulp.

Don’t feel bad — I’m really glad to have someone out there paying enough attention to get into serious discussions of these things.

In the originally failed version, here’s how I tried to build the vector space of intertwiners between permutation representations, namely what you’re calling

hom([A],[B])

where A and B are finite G-sets.

First, I took the action groupoid:

(A×B)//G

Then, I looked at actions of this on finite sets:

hom((A×B)//G,FinSet)

This is a finitely generated free FinSet-module. Decategorifying, it gives a finitely generated free -module. Tensoring with , it becomes a finite-dimensional vector space.

Unfortunately this vector space is too big! We want a vector space that has one basis element for each orbit of the action of G on (A×B)/G. These orbits correspond to components of the groupoid (A×B)//G. But the vector space we get has lots of basis elements for each component of (A×B)//G.

Why?

Well, our vector space has one basis vector for each ‘indecomposable’ action of (A×B)//G. (There’s an obvious concept of the ‘direct sum’ of actions of a groupoid on finite sets, and every such action is a direct sum of ‘indecomposable’ ones.) What are these indecomposable actions like? We get one by first choosing a connected component of the groupoid (A×B)//G, which is equivalent to some group… and then choosing a transitive action of that group on some finite set.

The italicized phrase is the reason we’re getting a vector space that’s too big.

There are various ways to fiddle with this idea and get it to work, but pretty soon Jim Dolan saw a better thing to do. Instead of taking

hom((A×B)//G,FinSet)

and trying to beat it down into the correct vector space, just take the groupoid

(A×B)//G

and form the free vector space on its set of components!

That much is obvious. But that much alone would be unsatisfying. We wanted

hom((A×B)//G,FinSet)

to be in the picture, because objects in here are spans of G-sets from A to B, and these are very nice things.

The trick is to realize that

(A×B)//G

and

hom((A×B)//G,FinSet)

are just different ways of talking about the same thing: a groupoid, and its category of actions on finite sets. We can go back and forth between these two! That’s how the ‘nice topos’ idea got into the act.

(Right now I’m guessing it may be technically a bit easier to characterize

hom((A×B)//G,Set)

than

hom((A×B)//G,FinSet)

That’s why my notes talk about the former.)

On a separate note, regarding this ‘reconstruction’ theorem:

If I understand you correctly, you are saying that (once we have sorted out the one-to-one thing, which isn’t hard) all we need to do is define the 2-category Nice to have, as objects, morphisms and 2-morphisms, the thingies in the image of our 2-functor. Then we get reconstruction for free. You are surely the first to agree this is an empty procedure…

Sure! But I think of this as like throwing a thin rope across a canyon, as the first step towards building a bridge. Once we’ve shown this 2-functor is sufficiently ‘one-to-one’, it’s just a matter of cleverness and hard work to find better and better characterizations of its image, and better and better ways to describe the inverse. Someone is bound to find really nice answers. It may take a while… but there’s no true suspense as to whether it will go through.

An intrinsic reconstruction theorem would be like Doplicher-Roberts and say something like, “Want to recover the groupoid X from the category Set X ? No problem. All you have to do is take the groupoid of fiber functors, i.e. the monoidal thingy-preserving functors from Set X into Set.” In other words, a categorified Gelfand-Naimark theorem… for G-sets. But I’d be interested to see a precise version of that!

Yes, I agree that it will be nice to see. That’s why I want to find it!

By the way, there’s already a well-known Tannaka-Krein reconstruction theorem in this context, at least in the case where our groupoid X is a group. In fact it works for any algebraic theory, not just ‘the theory of G-sets’. You start with the category of models of your algebraic theory, together with its ‘fiber functor’ down to Set, and recover the algebraic theory from that. Lawvere did it in his thesis, and you can probably almost guess how it goes.

So, at least in this case, we deserve to have a Doplicher-Roberts version too, where we deny ourselves the use of a fixed fiber functor to Set.

In fact, this result may even be known already! For example when G is a group, topos theorists know a lot of fun stuff about Set G. They call it the ‘classifying topos for G-torsors’, meaning that geometric morphisms ESet G (where E is any topos over Set) correspond to ‘G-torsors over E’. I don’t know this stuff very well — I’m just reading it out of Mac Lane and Moerdijk. But, it’s the kind of thing that might help us recover G from the topos Set G. And, there’s a lot of other stuff about topoi of presheaves on groupoids that could help, too.

(Another dirty trick would be to use the usual Doplicher–Roberts theorem to prove this set-based one. But, there must be something nicer.)

Posted by: John Baez on January 7, 2008 2:30 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

By the way, Bruce, I should warn you — and everyone else in the universe — of a slight difference between my notation in this blog entry and my notation in the supplementary reading.

In this blog entry — and also the forthcoming final lecture — I wanted to avoid mentioning topoi, because 9 out of 10 mathematicians suffer a brain seizure every time they see the word ‘topos’. (Whoops!) So, I described Hecke(G) as a gadget whose hom-thingies are finite groupoids. This is actually the most useful viewpoint when we’re trying to ‘degroupoidify’ and get a gadget whose hom-thingies are vector spaces.

But, as Jim realized, it’s also very important to think of Hecke(G) as a gadget whose hom-thinges are nice topoi. This is the outlook I take in the supplementary reading. A nice topos is just a category equivalent to one of the form Set X for some finite groupoid X. You don’t need to know what a topos is to accept this definition. I could have used any other word equally well. It just happens that Set X is a topos.

If everything I believe turns out to be true, there’s a ‘Doplicher-Roberts reconstruction theorem’ that takes a nice topos and gives you back the groupoid X. So, it’s only a matter of taste whether we think of Hecke(G) as having hom-groupoids or hom-(nice topoi).

In the supplementary reading, I say Hecke(G) has hom-(nice topoi), and use K¯(Hecke(G)) to stand for the corresponding thing that has hom-groupoids… the thing I’m calling Hecke(G) here.

I’m too tired right now to explain just why the ‘nice topos’ perspective is so handy; to a zeroth approximation you can just ignore it! I just want to warn you about the difference in notation.

Posted by: John Baez on January 6, 2008 5:21 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Okay — I have a thought about how this ‘reconstruction’ process might work, where we recover a finite groupoid X from the category of its actions on sets, Set X. I’m hoping some of the topos experts out there can say if I’m making sense. I don’t feel I understand this stuff very well.

I’ll limit myself to the case where our groupoid is a group G… but I won’t need G to be finite.

Someone hands us a category equivalent to the category of G-sets for some group G, but doesn’t tell us which G. How do we recover G?

First, we riffle through Mac Lane and Moerdijk and note that the category of G-sets, Set G, is the classifying topos for G-torsors. This apparently implies gives an equivalence

HOM(Set,Set G)GTor

where HOM means the category of geometric morphisms between topoi, and natural transformations between these, and GTor is the usual category of G-torsors.

So, we’ve recovered the category of G-torsors. How do we recover G itself?

Well, there’s a forgetful functor GTorSet. The natural isomorphisms from this functor to itself form a group, and I think this group is G.

So, we’ve got G.

More formally: I hope that if someone hands us a category C equivalent to Set G for some G, we can take HOM(Set,C) and find that it’s automatically equipped with a forgetful functor to Set, say

F:HOM(Set,C)Set

Then, we form the group Aut(F) of natural isomorphisms from F to itself, and that’s our group G.

Is this right? How does that “automatically” work, exactly? Does it generalize to groupoids?

Posted by: John Baez on January 7, 2008 7:01 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

I don’t know whether what you say is correct, but for finite groupoids (indeed, finite categories) the story is even simpler than the one you tell.

There are two crucial points:

  • For a small category C, HOM(Set,Set C)Flat(C op,Set) where the right-hand side is the category of flat functors and natural transformations between them. I talked about this here. I didn’t explain what ‘flat’ meant, but for groupoids it just means ‘torsor’.
  • Representables are always flat, and if C is a finite category then the representables are the only flat functors C opSet. So CFlat(C op,Set).

Putting these together, if C is a finite category then HOM(Set,Set C)C. This is how you can recover C from Set C. In particular, you can do it for finite groupoids.

Isn’t it clear anyway that GTorG, for any group G? Or do you need finiteness?

There’s also a reassuring background fact that for any (small?) category C, you can recover C from Set C — up to Cauchy completion, anyway. Cauchy completion is the process of forcing idempotents to split (i.e. for every idempotent arrow e in the category, adding in arrows p and i such that pi=1 and ip=e). Groupoids are always Cauchy complete, since they have no idempotents except identities, so if G is a groupoid then you can certainly recover it from Set G.

The method of recovery for general categories is slightly complicated. One has to find a way of characterizing the representables among all presheaves. There are a couple of ways to do this, and I can have a bash at explaining if anyone wants me to. But I never found it very enlightening.

Posted by: Tom Leinster on January 7, 2008 7:34 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Wow! This stuff sounds great! It’ll take me a while to absorb it, but let me start by explaining why I did something absurd:

Tom wrote:

Isn’t it clear anyway that GTorG, for any group G?

Yes, it’s clear: for any group G, all left G-torsors are isomorphic, so a skeleton of GTor has one object, which might as well be G itself, viewed as a G-torsor. The automorphism group of G as a left G-torsor is just G itself, acting via right translations. So, GTorG.

So, once I got my paws on GTor I was done getting G. And I should have known this; I’m a big fan of this fact. It was absurd for me to do any further finagling to recover G. Why did I bother getting G as automorphisms of the forgetful functor GTorSet? It’s because I was in the mood for ‘Tannaka–Krein reconstruction’, where we recover an algebraic gadget from endomorphisms of a forgetful functor.

While it was absurd, it wasn’t wrong. Once we remember GGTor, we see the automorphism group of the forgetful functor GTorSet is the same as the group of all transformations of G that commute with left translations — and this is just G, acting via right translations!

Posted by: John Baez on January 7, 2008 8:15 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Thanks Tom and John, this is very good to know! I don’t know anything about topoi and geometric morphisms… though luckily James my housemate does.

I’m quite surprised by the final form of the equation,

(1)CHOM(Set,Set C)

I would have expected it to be more of the flavour of HOM(Set C,Set)…it’s not, and that’s interesting.

Posted by: Bruce Bartlett on January 7, 2008 11:18 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

It would have been helpful if I’d said what that equivalence CHOM(Set,Set C) was.

Here goes. I’ll describe the functor from left to right. This functor exists no matter what C is, though it’s not necessarily an equivalence unless C is finite.

Given any cC, I have to describe a geometric morphism SetSet C. In other words, I have to describe a functor SetSet C with a finite-limit-preserving left adjoint.

In this case the left adjoint is easier to describe than the right. It’s simply evaluation at c. This preserves all limits.

The right adjoint maps a set S to Set(C(,c),S)Set C, which is itself the functor mapping dC to Set(C(d,c),S).

You can check for yourself that this is an adjoint pair. The way I look it is that the left adjoint ev c:Set CSet (evaluation at c) is isomorphic to tensoring with C(,c), whereas the right adjoint is homming out of C(,c). Think of covariant functors on C as left C-modules and contravariant functors on C as right C-modules, if you like.

Maybe the reason why this goes against your expectation is that there’s a conventional choice of direction for geometric morphisms, and sometimes it seems inconvenient. (I waffled about this before.)

Posted by: Tom Leinster on January 7, 2008 11:42 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Without attempting to justify why this conventional choice of direction is ‘natural’ (in the sense of Tom’s recent and very elegant post), it’s at least a ‘useful’ direction in a number of respects. For example,

  • If G and H are groups, then a group homomorphism GH induces a geometric morphism Set GSet H, and up to isomorphism every such geometric morphism is so induced.
  • If X and Y are (sober ) topological spaces, then every continuous map XY induces a geometric morphism Sheaves(X)Sheaves(Y), and up to isomorphism every such geometric morphism is so induced.
Posted by: Todd Trimble on January 8, 2008 12:20 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Thanks Tom.

I waffled about this before.

You can rest assured that I have been studiously saving up all the posts you have made on topos-affairs in the last couple of months :-) I intend to hit them with a vengeance very soon… on the way to London for Chris Isham’s talk, for instance.

Posted by: Bruce Bartlett on January 8, 2008 12:35 AM | Permalink | Reply to this

Nice Toposes

John,

Here are some very preliminary thoughts on this issue you brought up in your notes, on characterizing ‘nice toposes’ in intrinsic terms (p. 4). I think it should be possible to state it all much more cleanly, but this is a first pass.

A ‘nice’ topos is the category of presheaves over some finite groupoid C. One nice fact is

Theorem. C is a groupoid iff Set C op is a Boolean topos.

(‘Boolean’ means that every subobject i:cd has a complementary subobject: one whose union with i is all of d, and whose intersection with i is initial (empty). It’s easy to see that G-Set, for G a groupoid, is Boolean.)

So it would be enough to give an intrinsic characterization of presheaf toposes, and add the word ‘Boolean’.

I’ll start with a simple characterization theorem for presheaf toposes. I’ve talked about this a little elsewhere, but looking at what I said there it seems brutally abstract, and it would be better to say it again a little more nicely.

By the way, Tom has of course already stated some pertinent facts on presheaf toposes in the language of toposes and geometric morphisms. But I want to put geometric morphisms a little to the side for the time being, and talk more in the language of presheaf categories and cocontinuous maps, because that’s where nice toposes and nice functors actually live.

Let E be a small-cocomplete category. Here is the key definition (due to Lawvere?):

Definition. An object e of E is tiny if the hom-functor E(e,):ESet preserves small colimits.

(By the way: in email you were singling out the role of indecomposable = transitive G-sets. These are those presheaves X on G [or on G op if you wish] such that hom(X,) preserves small coproducts. Such objects are sometimes called connected objects. Here I’m strengthening that condition to connected and projective: hom(X,) also preserves coequalizers.)

Notice that when E is a presheaf topos Set C op, the representable presheaves hom(,c) are tiny, since

Set C op(hom(,c),F)F(c)=eval c(F)

by Yoneda, and evaluation at an object c preserves colimits of presheaves since colimits of presheaves are computed object-wise.

In fact, the Cauchy completion of C is equivalent to the full subcategory of tiny presheaves on C. This gives a reconstruction of a small category C from Set C op, if C is already Cauchy complete (as it will be in the case where C is a groupoid, as Tom has already pointed out).

To characterize those cocomplete categories E which are presheaf categories, it therefore makes sense to focus on the full subcategory of tiny objects of E, and ask what else we need. Well, in the presheaf case, every presheaf can be expressed as a canonical colimit of representables (= tiny presheaves). We say that the representables are dense in the category of presheaves. Thus it makes sense to focus on the condition that the tiny objects form a dense subcategory.

(Returning to your email, you had observed that every G-set is the coproduct of indecomposables, i.e., the coproduct of objects X whose representables hom(X,) are coproduct-preserving. Here, we are pursuing an analogous statement, that every G-set is the colimit of objects X whose representables hom(X,) are colimit-preserving.)

More precisely, a full subcategory i:CE is dense if every object e of E is the colimit of the cone of C over e, i.e., the colimit of the composite

(ie)projCiE.

In the language of weighted colimits, this says that the canonical map

E(i,e) Ci= cE(ic,e)ice

is an isomorphism for every e (the tensor inside the coend is a coproduct of copies of ic indexed over the hom-set E(ic,e)). This arrow is actually the counit of an adjunction between E and Set C op:

E(X Ci,e)Set C op(X,E(i,e));

this adjunction simply restates the universal property of weighted colimits. I will call this adjunction the Kan adjunction induced by the functor i:CE.

Here then is the characterization or recognition theorem for presheaf toposes. I think this theorem goes pretty far back in the day; I have some dim trace memory that Lawvere told me it’s in Marta Bunge’s thesis.

Theorem. Let E be small-cocomplete. E is equivalent to a presheaf category iff the full subcategory of tiny objects, i:Tiny(E)E, is essentially small and dense.

Let me just prove the “if” direction. The equivalence ESet Tiny(E) op is given by the Kan adjunction of i:C=Tiny(E)E. As we have seen, density of i is equivalent to the fact that the counit of this adjunction is an isomorphism. It remains to see that the unit of the Kan adjunction is also an isomorphism. But for every weight X:C opSet, the component of the unit at X is given by the composite

X(c) c X(c)C(c,c) [bytheYonedalemma] cX(c)E(ic,ic) [theembeddingiisfull] E(ic, cX(c)ic) [bythefactthatcistiny] = E(ic,X Ci).

(To be continued; this is probably not yet the most illuminating theorem to apply toward the problem of intrinsically characterizing nice toposes.)

Posted by: Todd Trimble on January 8, 2008 9:07 AM | Permalink | Reply to this

Re: Nice Toposes

Thanks, Todd — all this stuff is great! I would really like to keep talking about this until we find a good intrinsic characterization of nice topoi, nice functors, and nice natural transformations. Alas, right now it’s the first week of class, and I’m also trying to finish up two papers by mid-February. So, I will be rather slow to actually do anything — except for saying stuff like “Huh! Wow! Cool!” But, in the longer run, I think some sort of collaboration on this topic would be a real blast.

Posted by: John Baez on January 10, 2008 3:24 AM | Permalink | Reply to this

Re: Nice Toposes

I know I’ve come to this a bit late, but: is it true that every locally finite topos is equivalent to FSet C op, where FSet is the category of finite sets? This seems intuitively likely to me, but I can’t see how the condition Todd gives above trivilises in this case.

Posted by: Jamie Vicary on February 11, 2008 12:42 PM | Permalink | Reply to this

Re: Nice Toposes

I think this is not quite true. For instance if you have a pro-finite group G, then the category of finite (discrete) G-sets is probably a locally finite topos, but in general I doubt it will be of the form you want. For instance let G be the additive group of p-adic integers. Then the category is the category of finite sets equipped with an automorphism whose order is a power of p. I bet this is not the category of actions of some category on finite sets.

On the other hand, I wouldn’t be surprised if pro-finite issues are really the only obstruction. I would expect that theory of the fundamental groupoid shows that any locally finite topos is the category of finite sets equipped with an action of a pro-finite groupoid.

Can someone who really knows these things can confirm this?

Posted by: James on February 12, 2008 4:03 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Tom wrote:

For a small category C,

HOM(Set,Set C)Flat(C op,Set)

where the right-hand side is the category of flat functors and natural transformations between them. I talked about this here. I didn’t explain what ‘flat’ meant, but for groupoids it just means ‘torsor’.

Cool!

In your previous comment about flat functors, you wrote:

OK… but what’s a flat functor? I won’t give the definition, but to a first approximation, a flat functor is a functor that preserves finite limits. This is actually true when C has finite limits. It’s also true that flat functors preserve all finite limits that exist in C. It’s somehow a bit daft to think about finite-limit-preserving functors on a category that doesn’t have all finite limits; flatness is the righteous concept.

Somehow this scared me off, as if you were saying “I could tell you what flat functors actually are, but that would drive you stark raving mad, so I’ll spare you…”

So, this time I looked at Mac Lane and Moerdijk (which I’d already been perusing) and was mildly relieved to discover that this concept of ‘flat functor’ is closely akin to the concept of ‘flat module’ for a ring — which is something I know from homological algebra: namely, a module such that tensoring with it is left exact.

More precisely: for any category C, they define a way to ‘tensor’ a functor F:CSet with a functor G:C opSet and get a set. Then, they say a functor F:CSet is flat if tensoring with F is left exact.

Hey — is this ‘tensoring’ just what some people call a ‘coend’? If so, I actually understand it.

Anyway, while I don’t feel I understand this, it’s not driving me stark raving mad.

The main problem with me understanding this topos stuff is not that any piece of it seems devilishly tricky: it’s that there’s so much of it… it seems locally trivial, but globally nontrivial.

Posted by: John Baez on January 10, 2008 3:15 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Yeah, I know what you mean. I didn’t develop a taste for topos theory until recently, and even now it comes and goes.

However, I see the flatness story as part of category theory in general, not topos theory in particular.

I can see how I scared you off by mentioning flat functors but not defining them. It’s always a risky expository strategy: it seems so ominous. The reason is that although I could have given the definition very briefly, I wouldn’t really want to without saying some further things.

It’s like if someone asks you what it means for a topological space to be compact: you can tell them it means that every open cover has a finite subcover, but that definition requires so much digestion that it’s almost pointless to give it without saying something more. If you’re only allowed one sentence, it might be more useful to tell them what the compact subsets of n are.

If I was feeling a lot more energetic than I am, I’d go into a big explanation of flatness. But as it is, I’ll just respond to what you wrote.

and was mildly relieved to discover that this concept of ‘flat functor’ is closely akin to the concept of ‘flat module’ for a ring

Yes. You won’t be surprised to learn that both definitions are special cases of the definition of flat enriched functor. On the one hand, if C is an ordinary category then you know what it means for a functor CSet to be flat. On the other, if R is a ring (= one-object Ab-enriched category) then you know what it means for a left R-module (= Ab-enriched functor RAb) to be flat. So you can guess the next bit: if V is a symmetric monoidal category satisfying suitable hypotheses, and if C is a V-enriched category, you can say what it means for a V-enriched functor CV to be flat.

There are a whole lot of conditions equivalent to flatness, and there’s the important idea that flatness is the morally correct substitute for ‘finite-limit-preserving’, to be used in cases where the domain category doesn’t have all finite limits. But I’ll skip that.

Hey — is this ‘tensoring’ just what some people call a ‘coend’?

Yes, it’s an example of a coend. In ‘ordinary’ algebra you can construct the tensor product of two modules as a quotient, i.e. a colimit. And coends are the same kind of thing as colimits. Coends deserve their own explanation too! Hmm, I’m not sure whether you’re understanding tensor products by using what you already know about coends, or vice versa… In any case, the formula GF= cG(c)×F(c) expresses the tensor product of functors G:C opSet and F:CSet as a coend.

You can also characterize tensor products via adjointness: FHom(F,), as one might guess.

All of this makes me wish, for the umpteenth time, that there was a good successor to Categories for the Working Mathematician: a second course in category theory. Borceux is good for many things, but more detailed than what I have in mind. I once tried to persuade someone to write it, and this person wasn’t totally opposed to the idea, so I may keep pushing them.

Posted by: Tom Leinster on January 10, 2008 4:05 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Tom wrote:

I can see how I scared you off by mentioning flat functors but not defining them. It’s always a risky expository strategy: it seems so ominous.

Yeah. I often do this sort of thing myself, in TWF — withholding information that’s not absolutely necessary, to keep the exposition from spiralling into an endless series of digressions. But, I should remember that this can make people think things are scarier than they actually are. I guess one trick is to say “It’s not really that hard, but I don’t feel like explaining…”

Coends deserve their own explanation too!

Right; luckily I don’t really need that.

Hmm, I’m not sure whether you’re understanding tensor products by using what you already know about coends, or vice versa…

Both. I keep having to remember the idea of coends, or at least these tensor products, whenever I try to explain how the geometric realization of a simplicial set F:Δ opSet is built using the obvious functor ΔSet. For some reason I need to do this about once a year, just enough time to completely forget it. But it gets a little easier each time.

Anyway, almost everything you’re saying now is discussed in Mac Lane and Moerdijk — so now that you’ve given me the initial nudge, I can probably get it out of there as needed.

I once tried to persuade someone to write it, and this person wasn’t totally opposed to the idea, so I may keep pushing them.

Do it… gently.

Posted by: John Baez on January 10, 2008 5:04 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Hey — is this ‘tensoring’ just what some people call a ‘coend’? If so, I actually understand it.

I’m a little surprised you asked; we had a big discussion of it almost a year ago, kicked off with comments by you, here.

Well, on second thought, you didn’t quite say ‘tensoring’ in that comment; you said ‘indexed (or weighted) colimit’. I guess ‘tensoring’ and ‘weighted colimit’ are so closely conjoined in my mind that I missed at first that you said one but not the other! (I said something on why they are so closely conjoined in my mind later in that discussion, here.)

[I was interrupted and came back to see that Tom pipped me a little, so I’ll just say a few more words.]

Anyway, yes, as Tom was saying: the typical formula for tensoring say a left module F:XSet and a right module (or weight) G:X opSet is the weighted colimit

G XF= xOb(X)G(x)×F(x)

which you knew of course and which involves a coend. And, there’s homming a left module G:XSet with a left module H:XSet, which involves an end:

hom X(G,H)= xOb(X)H(x) G(x)

and this is also called a weighted limit.

If you think about it, the formula for the weighted colimit is analogous to a formula for a general colimit in terms of sums and coequalizers. It is a particular (and particularly useful) presentation of a weighted colimit in terms of more specialized concepts (as a conical colimit is analogously presented in terms of special colimits, e.g., sums and coequalizers).

So we can also turn it around and say that taking a coend

x:Set X×X opSet

is tensoring (or taking a weighted colimit) with some special weight. Which one? Why, the hom-functor of course! That is:

xF(x,x)=hom X (X×X op)F.

Speaking of tensoring and topos theory, a classic example of tensoring with a flat module is taking geometric realization of simplicial sets,

Set Δ opTop,

where you’re tensoring with a flat module σ:ΔTop (the affine simplex functor). This sort of exemplifies what Tom was saying: flat functors don’t belong just to topos theory, but are part of a more general categorical landscape. (At the same time, it’s still fun to think of geometric realization as classifying a certain model of a theory, whose classifying topos is simplicial sets. What theory is that? The theory of the interval – Top has one of course! No, Top isn’t a topos, but the idea is still there, and in fact some people do replace Top by a spatial topos here.)

Posted by: Todd Trimble on January 10, 2008 5:12 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

John wrote:

Hey — is this ‘tensoring’ just what some people call a ‘coend’? If so, I actually understand it.

Todd replied:

I’m a little surprised you asked; we had a big discussion of it almost a year ago, kicked off with comments by you, here.

Well, on second thought, you didn’t quite say ‘tensoring’ in that comment; you said ‘indexed (or weighted) colimit’.

Yeah. I think I understand coends and weighted colimits, in a flickering intermittent way which flares into full flame once a year when I actually use them. But right now I was just reading about flat functors in Mac Lane and Moerdijk, and they defined these in terms of some mysterious thing called ‘tensoring’.

Flipping pages backwards to read about tensoring, I didn’t see them mention coends or weighted colimits… but when I stared at their formula for tensoring, it looked suspiciously familiar! It was sort of like seeing someone you know, but without any sign of recognition on their part: it makes you wonder if it’s the same person, or someone who just looks similar. So, my question was a kind of sanity check.

At the same time, it’s still fun to think of geometric realization as classifying a certain model of a theory, whose classifying topos is simplicial sets. What theory is that? The theory of the interval… !

I think it’s too late in the evening for this much fun. Earlier this afternoon Jim and I figured out how the trefoil knot, the discriminant of a cubic, the zeros of the 24th power of the Dedekind eta function, the cusp of the moduli space for elliptic curves, the ideal in the ring of modular forms generated by g 2 327g 3 2, and the image of the Weyl chamber walls for A 2 under the map

2 2/S 3 2

are secretly almost the same thing! That was fun, but suddenly adding all these new connections almost shorted out my central nervous system. Thinking about what you just said could do me in.

Posted by: John Baez on January 10, 2008 7:46 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

The fact you can reconstruct a groupoid from the category of its representations is just part of Galois theory (in the Grothendieck style; I think this appeared first in Exposé V of SGA 1, and it was achieved by Olivier Leroy at the end of the 1970’s, and the (unpublished) work of Leroy was independently rediscovered by Ieke Moerdijk at the begining of the 1980’s).

The basic result of the theory is that given any groupoid G, you can always compute canonically G as the category of points of the topos Ĝ=Set G op. In other words, there is a canonical equivalence of categories {geometricmorphismsSetĜ}G.

I propose a little recollection of this. I will tell the Galois theory just because I find beautiful, and finish with something that might help to understand the notion of `nice functors’ as well.

In a topos X, you can define what it means for a sheaf F (i.e. an object of X) to be locally constant. It means that there is an epimorphism U1 (we might call this a cover of X) such that U×F is a constant sheaf on X/U (equivalently, U×F is isomorphic to U×I over U in X, where I is a constant sheaf). We can then define the category LC(X) as the full subcategory of X made of locally constant sheaf. When everything is easy, LC(X) is a topos, and it is the category of representations of the fundamental groupoid π 1(X) of X. In the general case, there is a bigger category SLC(X) defined as the full subcategory of X whose objects are the sums of locally constant sheaves. And the good news is that (under the mild assumption that X is locally connected) SLC(X) is actually a topos and that the inclusion functor XSLC(X) preserves finite limits and arbitrary small colimits. Whence we get a geometric morphism of topoi XSLC(X). What have we done? To understand this, define a Galois topos to be a topos X which is generated by its locally constant sheaves (i.e. such that X=SLC(X)). One can characterize these as the topoi which are generated by their Galois covers (i.e. , in the case X is connected, sheaves F which are torsors under the discrete group Aut(F)). The construction SLC(X) is thus obviously the universal Galois topos associated to X. But to really understand Galois theory, we have to track back some groupoids. So here they come!

There is also another notion we all know from topology: simply connected topoi. A topos X is locally simply connected if there exists a sheaf U on X such that any locally constant sheaf on X is constant on U (in classical literature, in case X is a good old topological space, such a U is called a universal cover). Then one can check easily that a topos X is locally simply connected if and only if LC(X)=SLC(X). Moreover, the category of points of LC(X) is a groupoids, usually denoted by π 1(X), and there is an equivalence of topoi π 1(X)̂LC(X). But that is not all: the 2-functor GĜ induces an equivalence of 2-categories from the 2-category of groupoids to the 2-category of locally simply connected Galois topoi. Finally, any Galois topos is a filtering 2-limit of locally simply connected Galois topoi. In other words, the fundamental group of a general topos X is a pro-group. The theory of fundamental groupoids is thus a mere 2-pro-adjoint of the inclusion of groupoids in topoi (you get Van Kampen theorem on the nose with this).

I will finish with a few words on `nice functors’. Given two small groupoids G and H, one can look at the cocontinuous functors (i.e. the colimit preserving functors) ĜĤ. The theory of Kan extensions says to us that the category of such functors is equivalent to the category (G×H)̂. But given a presheaf F on G×H, one can form its category of elements EF (sometimes called in the literature the translation groupoid associated to F), which happends to be a discrete fibration over G×H. EFG×H Hence we obtain a span of groupoids. GEFH And what happends is that the `nice functor’ obtained from this span is canonically isomorphic to the cocontinuous functor we started from.

Conclusion: `nice functors’ are just cocontinuous functors :-)

We can use this correspondance to describe geometric morphisms ĤĜ: we have to understand under which restriction on EF the cocontinuous functor will preserve finite limits. But preserving finite limits implies in particular preserving the terminal object. This last property implies that the projection EFH is an isomorphism. Hence geometric morphisms from Ĥ to Ĝ are just functors from H to G. This is how you prove the functor GĜ is locally an equivalence of categories (i.e. is 2-fully faithful). The fact that G is equivalent to the category of points of Ĝ is now equivalent to that fact the category of functors from 1 to G is G itself, which is not too awfull to check…

Last remark: this description of `nice functors’ works for general small categories. This is often called the theory of distributors.

Posted by: Denis-Charles Cisinski on January 12, 2008 12:06 AM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

Your argument that nice functors = cocontinuous functors is very, how shall we say: nice! And it seems you are also suggesting the additional nice fact that nice transformations are just transformations.

So in other words, the 2-category NICE is biequivalent to the bicategory Bim gpd of groupoids and bimodules (= profunctors = distributors) between them. The 2-category Gpd of groupoids and functors sits inside of NICE, where a functor f:GH induces a nice functor

Set G opSet H op,

namely the Kan extension which is left adjoint to the pulling-back functor

Set f op:Set H opSet G op

which is itself a nice functor. Or in other words, that we have a homomorphism

i:GpdBim gpd

which maps 1-cells to left adjoint 1-cells. Conversely, since groupoids are Cauchy complete, every left adjoint 1-cell in Bim gpd arises in this way.

Bim gpd is an example of what is called a cartesian bicategory, a notion meant to capture a ‘generalized calculus of relations’. This would include the calculus of ordinary relations in a suitably nice category (a regular category), but is intended to cover also the 2-categorical calculus of spans in a finitely complete category, and of internal categories and bimodules in a finitely complete category, and other examples of similar ‘relational’ character. In recent years cartesian bicategories have undergone a renaissance, due to efforts of people like Wood, Carboni, Kelly, and Walters to properly address the technical monoidal bicategory aspects (which hadn’t been worked out when Carboni and Walters first introduced the notion).

Anyway, we now have a tie-in between Groupoidification and the theory of cartesian bicategories which is already pretty well-developed, and at this point I think I can give a good answer to the question ‘why groupoids?’ (or perhaps better, ‘why not categories?’). We can get a hint of this by looking at what Denis-Charles said above: one can play a similar game with nice functors between more general presheaf categories,

F:Set CSet D,

where they basically amount to functors f:C op×DSet (that is, bimodules), or to discrete fibrations of the form

El(f)C op×D

which gives a span in Cat from C op to D. Notice the variance however! But in Gpd, we can straighten out the variance so as to consider spans from G to H.

But more to the point, the real reason that spans of groupoids work so well is that in Bim gpd, we have a Beck-Chevalley condition which allows us to compose spans – this Beck-Chevalley condition doesn’t hold in the bicategory of categories and bimodules! For example: when we want to compose a nice functor g !f * given by a span

HfGgJ

with another nice functor k !h * given by a span

JhKkL,

we have to work k !h g !f into the form () !() *, which we do by passing through the weak pullback

P q K p h G g J

and applying the Beck-Chevalley condition, which gives the invertibility of the canonical map q !p h g !. This means we can write

k !h g !f (kq) !(fp)

and all is well. But, we need groupoids in order for Beck-Chevalley to work.

Over on the cartesian bicategories side, the Beck-Chevalley condition is closely tied to the fact that groupoids and bimodules form what is called a discrete cartesian bicategory (which is the special case of Beck-Chevalley where the weak pullback involved is the coassociativity square for the diagonal map δ:GG×G). If you write out the Beck-Chevalley condition in that special case, it says that G is a Frobenius monoid in Bim gpd, where the comultiplication is the bimodule δ !:GG×G and the multiplication is the bimodule δ *:G×GG.

I commented earlier on Beck-Chevalley for bimodules, but I didn’t see clearly how it ties in with Groupoidification until after seeing Denis-Charles’s comment. Thanks, Denis-Charles!

Posted by: Todd Trimble on January 13, 2008 7:15 PM | Permalink | Reply to this

Re: Geometric Representation Theory (Lecture 19)

We might still perform a good theory for small categories by considering Todd’s remarks about the Beck-Chevalley property. It means that we cannot take arbitrary spans, but something like `Beck-Chevalley spans’. For this we need some definitions. Further details can be found for example here.

Let’s call 0-equivalences the functors f:CD which induce a bijection at the level of connected components π 0(C)π 0(D).

A functor f:CD is 0-aspherical if for any object d of D, the comma category C/d is 0-connected. Dually, a functor f:CD is 0-coaspherical if for any object d of D, the comma category d\C is 0-connected.

We can define now what is a 0-proper functor. It is a functor f:CD such that for any object d of D, the functor C dC/d is 0-coaspherical. There is also the dual notion of 0-smooth functor: f:CD is 0-smooth if for any object d of D, the functor C dd\C is 0-aspherical. Note that a functor f:CD is 0- proper (resp. 0-aspherical) if and only if f op:C opD op is 0-smooth (resp. 0-coaspherical). A baby version of Quillen’s Theorem A is that any 0-(co)aspherical map is a 0-equivalence.

Grothendieck’s observation (in Pursuing stacks) is that a functor f:CD (resp. v:DD) is 0-proper (resp. 0-smooth) if and only if any pullback of shape

CfD uv CfD

has the Beck-Chevalley property, and if this is still verified after any base change.

A prototype example of a 0-proper (resp. 0-smooth) functor is a Grothendieck op-fibration (resp. fibration). 0-proper (resp. 0-smooth) functors are stable by composition and base change. Hence we have a good notion of `Beck-Chevalley spans’ defined as the spans CpEqD such that p (resp. q) is a 0-proper (resp. 0-smooth) functor.

To make this working well enough, we have to be careful about the way we realize functors F:C op×DSet as Beck-Chevalley spans. In fact, we may consider functors F:C op×DCat. For each object c of C, we can consider the Grothendieck construction E(c) associated to the functor dF(c,d), which gives rise to an opfibration E(c)D. These opfibrations can be seen as a natural transformation from the functor E to the constant functor with value D. We can thus take the Grothendieck construction E of E, and we get a functor EC×D (the Grothendieck construction of the constant functor with value D on C is just C×D). It is an easy exercise to check that the projection EC is a fibration and the projection ED an opfibration. Hence we get a 2-functor Fun(C op×D,Cat){BeckChevalleyspans} which is a good starting point.

Last remark: we can define notions of smooth or proper functors depending on different notions of `weak equivalences of categories’. If you replace 0-equivalences by -equivalences (i.e. functors whose nerve is a weak equivalence of simplicial sets), then this story of Beck-Chevalley spans will still be meaningful in the setting of higher categories (you can consider SSet instead of Set, and derived Kan extensions).

These notions of smooth or proper functor has also been considered by Joyal for quasi-categories (details can be found in Lurie’s book on higher topoi).

Posted by: Denis-Charles Cisinski on January 14, 2008 3:00 PM | Permalink | Reply to this
Read the post Geometric Representation Theory (Lecture 20)
Weblog: The n-Category Café
Excerpt: At last: the Fundamental Theorem of Hecke Operators!
Tracked: January 10, 2008 7:40 AM

Post a New Comment