nLab
Tannaka duality

Contents

Idea

Tannaka duality or Tannaka reconstruction theorems are statements of the form:

for A some algebraic structure, represented on objects in a category D, one may reconstruct A from knowledge of the endomorphisms of the forgetful functor – the fiber functor

F:Rep D(A)DF : Rep_D(A) \to D

from the category Rep D(A) of representations of A on objects of D that remembers these underlying objects.

For permutation representations

A simple case of Tannaka duality is that of permutation representations of a group, i.e. representations on a set. In this case, Tannaka duality follows entirely from repeated application of the Yoneda lemma.

Theorem

(Tannaka duality for permutation representations)

Let G be a group, Rep Set(G) the category of its permutation representations and F:Rep Set(G)Set the forgetful functor that sends a representation to its underlying set.

Then there is a canonical isomorphism of groups

Aut(F)G.Aut(F) \simeq G \,.

Here Aut(F) denotes the group of invertbile natural transformations from F to itself.

Quick Proof

With a bit of evident abuse of notation, the proof is a one-line sequence of applications of the Yoneda lemma: we show End(F)G, i.e., each endomorphism on F is invertible, so End(F)=Aut(F)G.

Write C:=Set G=Rep Set(G). Observe that the functor F:CSet is the representable F=C(G,). Then the argument is

End(F)=Set C(F,F)Set C(C(G,),C(G,))C(G,G)G.End(F) = Set^C(F, F) \cong Set^C(C(G, -), C(G, -)) \cong C(G, G) \cong G.

The ”G” here is used in multiple senses, but each sense is deducible from context.

Long-winded Proof

Let BG be the delooping groupoid. Then

Rep Set(G):=Func(BG op,Set).Rep_{Set}(G) := Func(\mathbf{B}G^{op}, Set) \,.

The canonical inclusion i:*BG induces the fiber functor

Func(i,Set):Rep Set(G)SetFunc(i,Set) : Rep_{Set}(G) \to Set

which evaluates a functor ρ:BG opSet on the unique object of BG. By the Yoneda lemma this is the same as homming out of the functor represented by that unique object

Func(i,Set)=Hom PSh(BG)(Y BG)*,),Func(i,Set) = Hom_{PSh(\mathbf{B}G)}(Y_{\mathbf{B}G}) {*}, -) \,,

where Y BG:BGPSh(BG) is the Yoneda embedding.

But this way we see that Func(i,Set):PSh(BG)Set is itself a representable functor in the presheaf category PSh(PSh(BG) op)

Func(i,Set)=Y PSh(BG) opY BG*.Func(i,Set) = Y_{\mathbf{PSh(\mathbf{B}G)^{op}}} Y_{\mathbf{B}G} * \,.

So applying the Yoneda lemma twice, we find that

Aut PSh(PSh(BG) op)Func(i,Set) =Aut PSh(PSh(BG) op)Y PSh(BG) opY BG* Aut PSh(BG) op)Y BG* Aut BG* G.\begin{aligned} Aut_{PSh(PSh(\mathbf{B}G)^{op})} Func(i,Set) & = Aut_{PSh(PSh(\mathbf{B}G)^{op})} Y_{\mathbf{PSh(\mathbf{B}G)^{op}}} Y_{\mathbf{B}G} * \\ & \simeq Aut_{PSh(\mathbf{B}G)^{op})} Y_{\mathbf{B}G} * \\ & \simeq Aut_{\mathbf{B}G} * \\ & \simeq G \,. \end{aligned}

References

The following paper shortens the Deligne’s proof

  • Alexander L. Rosenberg, The existence of fiber functors, The Gelfand Mathematical Seminars, 1996–1999, 145–154, Birkhäuser, Boston 2000.

Ulbrich made a major contribution at the coalgebra and Hopf algebra level

  • K-H. Ulbrich, On Hopf algebras and rigid monoidal categories, in special volume, Hopf algebras, Israel J. Math. 72 (1990), no. 1-2, 252–256.

A generalization of several classical reconstruction theorems with nontrivial functional analysis is in

Categorically oriented notes were written also by Pareigis, emphasising on using Coend in dual picture. His works can be found here but the most important is the chapter 3 of his online book

  • Bodo Pareigis, Quantum groups and noncommutative geometry, Chapter 3: Representation theory, reconstruction and Tannaka duality, pdf

A very neat Tannaka theorem for stacks is proved in

See also talk

and the remark