The First Edge of the Cube
Posted by Urs Schreiber
One knows one is getting to the heart of the matter when the definitions in terms of which one conceives the objects under consideration categorify effortlessly.
Take the ordinary definition of a smooth fibre bundle with connection. Write it out in full detail. Stare at that page for a while and try to categorify everything in sight.
Then, when sufficiently frustrated – to increase the effect – notice that the connection on the bundle gives rise to a parallel transport functor from paths in base space, , to the category of fibers.
For a principal bundle this is for a vector bundle this is This are nothing but representations of the path groupoid.
Now categorify this. This is so trivial that trying to avoid it is like trying to avoid to breathe. Here is a parallel -transport on a principal -bundle with connection: Here is a parallel transport on an -vector bundle with connection Here is a parallel transport on an -bundle whose fibers are objects in the -category of your choice: We are just looking at representations of the path -groupoid of a space .
Not all of these -bundles with connection will be useful in applications. Most will be badly pathological. The useful ones will be locally trivial with respect to a predefined local structure.
Again, we want to say this in a way that it’s a breeze to categorify. This means we draw arrows.
A little contemplation reveals that a local structure on an -functor is a square
where is epi and is mono.
If we can complete the -functor to such a square, it makes sense to say that (-)locally the functor has -structure.
All that remains is to choose the that describes your application.
In fact, it was the observation that plenty of intricate-looking structures that people consider in the literature on gerbes and other higher gauge theory (notice that the term is catching on slowly but steadily) all follow from nothing but a square as above, for various choices of .
In particular, every such square naturally produces an object in a category of descent data, just by itself. All that is required is playing Lego with these squares: two of them paste together to give a transition function. Six to give a triangle. Twelve a tetrahedron – these shapes are the differential cocycle representing the differential cohomology class of the -transport.
And a morphism of squares gives a morphism of differential cocycles in the obvious way, so we have an -functor which extracts from an -transport with -local -trivialization this cocycle information.
All this is god-given. The first point where one actually has to do work comes when we ask if may be inverted.
Notice that two, six, twelve, etc. are even numbers. So the descent data can only know about pairs of squares (1). Can we take the square root?
If we can, and in examples we can, we get a weak inverse -functor which reconstructs an -bundle with connection from its differential cocycle data.
Thus showing that locally -trivializable -functors form an -stack, as they should.
One aspect of the power of this formulation of differential cohomology is that I haven’t even had to mention the word differentiable yet. Nor the word continuous.
While nice, this is a tad more general than what one would be willing to deal with on a normal day: we will want to be able to say that an -transport functor is not just locally trivializable – but also that its descent data has extra structure, like topological, or smooth structure.
For satisfying this demand, essentially no additional work is required beyond translating this demand into arrow-theory. It will take care of itself then.
As John Baez teaches (and as his students have written up here and here – the lore of stuff, structure and property) extra structure (on sets, here) is a faithful functor Extra structure on our -categories requires that admits enough pullbacks.
So if we want continuous transport, we choose . If we want smooth transport, we choose , the category of Chen-smooth spaces.
Given that, realize the local domain and the local codomain internal to . (For instance, let be a Lie groupoid, a groupoid internal to smooth spaces. This will enforce that -trivial transport functors locally take values in objects and morphisms of that Lie groupoid.) Then denote by the -category of descent data as before, now with everything internal to . Define to be the pre-image of that under : this are those -transport functors whose local can be lifted through , i.e. those whose descent data has -structure. Check that this restricts to an equivalence and thus obtain a notion of -transport -functor equipped with a local- -trivialization. Such a gadget is what really deserves to be called “transport” (as opposed to being an arbitrary functor). And if so, we have the urge to forget the choice of local trivialization and call the image of the forgetful morphism the -category of transport functors (locally -trivializable with -structure)
While this, again, is all given to us, the second point where we may want to do real work is in checking if an -functor in admits a unique (up to equivalence) -trivialization with -structure.
If so, we arrive at one of the main goals of the entire exercise: an equivalence which tells us that given any old -functor all we need is the guarantee that there is some locally- -trivialization of it – but we don’t need to carry it around.
All you ever want to do with such an -functor, like taking its sections or forming its curvature (which corresponds to things like finding gerbe modules or quantizing the -particle coupled to this ) you’ll do as for plain ordinary -functors .
This is, all in all, what the first edge of the cube is about: local trivialization of -functors.
And for it has now finally been written up:
K. Waldorf & U. S.
Parallel Transport and Functors
arXiv:0705.0452
Some relation to other work:
For , and the identity of a strict 2-group, and , the descent category which turns out to be equivalent to differential -cocycles subject to the constraint of fake flatness, is what I worked out with John Baez.
(The generalization to non-fake-flat -cocycles will actually involve 3-transport.)
A couple of things at that time were not as cleanly worked out as they eventually should be. This includes the relation between smooth 1-functors and -valued differential forms. In fact, one finds an equivalence of the category of these smooth 1-functors with the category of global differential -1-cocycles:
The category of local such cocycles is in fact canonically equivalent to that of suitable smooth anafunctors. A full proof of this equivalence didn’t make it into the paper.
These constructions all involve crucially the category of paths in the transition groupoid.
In fact, much of the structure one encounters here can be traced back to the fact that the functor which sends a space to its path groupoid preserves the square as a pullback square, but not as a pushout square. Instead, the pushout after applying is that category of paths in the transition groupoid.
This discussion didn’t make it into the paper.
Another equivalence which didn’t make it into this paper is that with the notion of smooth functors used by Stolz and Teichner.
All this is obtained by choosing suitable in the general theory of locally trivializable 1-transport.
Curiously, it does make good sense to consider . For instance, we might start with a principal transport and then postcompose this with the morphism which is – at the level of categories internal to an equivalence that identifies the groupoid with its vertex group – here by choosing for each -torsor in the world an isomorphism to itself.
This is of course not smooth. In fact will be badly pathological in general.
Such arbitrary functors from paths to the group are called generalized connections in parts of the literature. Applying our theorem to such pathological functors we find: either a generalized connection comes from a smooth connection by applying an as above, or it doesn’t. But if it does, then this smooth bundle with connection that it comes from is unique up to equivalence.
We give a condition to check this explicitly: a generalized connection can be equipped with a smooth local structure if and only if all its “Wilson lines” are smooth.
Update: It turns out that some discussion of this paper is taking place in the thread Quantization and Cohomology (Week 23).
Re: The First Edge of the Cube
Very neat. One day I hope to understand it.
Do you think it is possible for someone who barely knows enough category theory to state what a natural transformation is could ever have a chance of understanding “arrow theory”. It sounds like what was in the background of my thinking for ages, but I wasn’t smart enough to enunciate it.
For example, could you apply the “arrow theory” to what we did as an example? Or is that overkill?