\documentclass[12pt,titlepage]{article} \usepackage{amsmath} \usepackage{mathrsfs} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsthm} \usepackage{mathtools} \usepackage{graphicx} \usepackage{color} \usepackage{ucs} \usepackage[utf8x]{inputenc} \usepackage{xparse} \usepackage{hyperref} %----Macros---------- % % Unresolved issues: % % \righttoleftarrow % \lefttorightarrow % % \color{} with HTML colorspec % \bgcolor % \array with options (without options, it's equivalent to the matrix environment) % Of the standard HTML named colors, white, black, red, green, blue and yellow % are predefined in the color package. Here are the rest. \definecolor{aqua}{rgb}{0, 1.0, 1.0} \definecolor{fuschia}{rgb}{1.0, 0, 1.0} \definecolor{gray}{rgb}{0.502, 0.502, 0.502} \definecolor{lime}{rgb}{0, 1.0, 0} \definecolor{maroon}{rgb}{0.502, 0, 0} \definecolor{navy}{rgb}{0, 0, 0.502} \definecolor{olive}{rgb}{0.502, 0.502, 0} \definecolor{purple}{rgb}{0.502, 0, 0.502} \definecolor{silver}{rgb}{0.753, 0.753, 0.753} \definecolor{teal}{rgb}{0, 0.502, 0.502} % Because of conflicts, \space and \mathop are converted to % \itexspace and \operatorname during preprocessing. % itex: \space{ht}{dp}{wd} % % Height and baseline depth measurements are in units of tenths of an ex while % the width is measured in tenths of an em. \makeatletter \newdimen\itex@wd% \newdimen\itex@dp% \newdimen\itex@thd% \def\itexspace#1#2#3{\itex@wd=#3em% \itex@wd=0.1\itex@wd% \itex@dp=#2ex% \itex@dp=0.1\itex@dp% \itex@thd=#1ex% \itex@thd=0.1\itex@thd% \advance\itex@thd\the\itex@dp% \makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}} \makeatother % \tensor and \multiscript \makeatletter \newif\if@sup \newtoks\@sups \def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}% \def\reset@sup{\@supfalse\@sups={}}% \def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else% \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}% \else \append@sup#2 \@suptrue \fi% \expandafter\mk@scripts\fi} \def\tensor#1#2{\reset@sup#1\mk@scripts#2_/} \def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2% \reset@sup\mk@scripts#3_/} \makeatother % \slash \makeatletter \newbox\slashbox \setbox\slashbox=\hbox{$/$} \def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$} \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa \copy\slashbox \kern-\@tempdima \box\@tempboxa} \def\slash{\protect\itex@pslash} \makeatother % math-mode versions of \rlap, etc % from Alexander Perlis, "A complement to \smash, \llap, and lap" % http://math.arizona.edu/~aprl/publications/mathclap/ \def\clap#1{\hbox to 0pt{\hss#1\hss}} \def\mathllap{\mathpalette\mathllapinternal} \def\mathrlap{\mathpalette\mathrlapinternal} \def\mathclap{\mathpalette\mathclapinternal} \def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}} \def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}} \def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}} % Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2} \let\oldroot\root \def\root#1#2{\oldroot #1 \of{#2}} \renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}} % Manually declare the txfonts symbolsC font \DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n} \SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n} \DeclareFontSubstitution{U}{txsyc}{m}{n} % Manually declare the stmaryrd font \DeclareSymbolFont{stmry}{U}{stmry}{m}{n} \SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n} % Manually declare the MnSymbolE font \DeclareFontFamily{OMX}{MnSymbolE}{} \DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n} \SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n} \DeclareFontShape{OMX}{MnSymbolE}{m}{n}{ <-6> MnSymbolE5 <6-7> MnSymbolE6 <7-8> MnSymbolE7 <8-9> MnSymbolE8 <9-10> MnSymbolE9 <10-12> MnSymbolE10 <12-> MnSymbolE12}{} % Declare specific arrows from txfonts without loading the full package \makeatletter \def\re@DeclareMathSymbol#1#2#3#4{% \let#1=\undefined \DeclareMathSymbol{#1}{#2}{#3}{#4}} \re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46} \re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12} \re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64} \re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6} \re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77} \re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77} \makeatother % \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE \makeatletter \def\Decl@Mn@Delim#1#2#3#4{% \if\relax\noexpand#1% \let#1\undefined \fi \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}} \def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}} \def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}} \Decl@Mn@Open{\llangle}{mnomx}{'164} \Decl@Mn@Close{\rrangle}{mnomx}{'171} \Decl@Mn@Open{\lmoustache}{mnomx}{'245} \Decl@Mn@Close{\rmoustache}{mnomx}{'244} \makeatother % Widecheck \makeatletter \DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}} \def\@widecheck#1#2{% \setbox\z@\hbox{\m@th$#1#2$}% \setbox\tw@\hbox{\m@th$#1% \widehat{% \vrule\@width\z@\@height\ht\z@ \vrule\@height\z@\@width\wd\z@}$}% \dp\tw@-\ht\z@ \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@ \setbox\tw@\hbox{% \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box \tw@}}}% {\ooalign{\box\tw@ \cr \box\z@}}} \makeatother % \mathraisebox{voffset}[height][depth]{something} \makeatletter \NewDocumentCommand\mathraisebox{moom}{% \IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{% \IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}% }{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}% \mathpalette\@temp{#4}} \makeatletter % udots (taken from yhmath) \makeatletter \def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.} \mkern2mu\raise4\p@\hbox{.}\mkern1mu \raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}} \makeatother %% Fix array \newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}} %% \itexnum is a noop \newcommand{\itexnum}[1]{#1} %% Renaming existing commands \newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}} \newcommand{\widevec}{\overrightarrow} \newcommand{\darr}{\downarrow} \newcommand{\nearr}{\nearrow} \newcommand{\nwarr}{\nwarrow} \newcommand{\searr}{\searrow} \newcommand{\swarr}{\swarrow} \newcommand{\curvearrowbotright}{\curvearrowright} \newcommand{\uparr}{\uparrow} \newcommand{\downuparrow}{\updownarrow} \newcommand{\duparr}{\updownarrow} \newcommand{\updarr}{\updownarrow} \newcommand{\gt}{>} \newcommand{\lt}{<} \newcommand{\map}{\mapsto} \newcommand{\embedsin}{\hookrightarrow} \newcommand{\Alpha}{A} \newcommand{\Beta}{B} \newcommand{\Zeta}{Z} \newcommand{\Eta}{H} \newcommand{\Iota}{I} \newcommand{\Kappa}{K} \newcommand{\Mu}{M} \newcommand{\Nu}{N} \newcommand{\Rho}{P} \newcommand{\Tau}{T} \newcommand{\Upsi}{\Upsilon} \newcommand{\omicron}{o} \newcommand{\lang}{\langle} \newcommand{\rang}{\rangle} \newcommand{\Union}{\bigcup} \newcommand{\Intersection}{\bigcap} \newcommand{\Oplus}{\bigoplus} \newcommand{\Otimes}{\bigotimes} \newcommand{\Wedge}{\bigwedge} \newcommand{\Vee}{\bigvee} \newcommand{\coproduct}{\coprod} \newcommand{\product}{\prod} \newcommand{\closure}{\overline} \newcommand{\integral}{\int} \newcommand{\doubleintegral}{\iint} \newcommand{\tripleintegral}{\iiint} \newcommand{\quadrupleintegral}{\iiiint} \newcommand{\conint}{\oint} \newcommand{\contourintegral}{\oint} \newcommand{\infinity}{\infty} \newcommand{\bottom}{\bot} \newcommand{\minusb}{\boxminus} \newcommand{\plusb}{\boxplus} \newcommand{\timesb}{\boxtimes} \newcommand{\intersection}{\cap} \newcommand{\union}{\cup} \newcommand{\Del}{\nabla} \newcommand{\odash}{\circleddash} \newcommand{\negspace}{\!} \newcommand{\widebar}{\overline} \newcommand{\textsize}{\normalsize} \renewcommand{\scriptsize}{\scriptstyle} \newcommand{\scriptscriptsize}{\scriptscriptstyle} \newcommand{\mathfr}{\mathfrak} \newcommand{\statusline}[2]{#2} \newcommand{\tooltip}[2]{#2} \newcommand{\toggle}[2]{#2} % Theorem Environments \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{lemma}{Lemma} \newtheorem{prop}{Proposition} \newtheorem{cor}{Corollary} \newtheorem*{utheorem}{Theorem} \newtheorem*{ulemma}{Lemma} \newtheorem*{uprop}{Proposition} \newtheorem*{ucor}{Corollary} \theoremstyle{definition} \newtheorem{defn}{Definition} \newtheorem{example}{Example} \newtheorem*{udefn}{Definition} \newtheorem*{uexample}{Example} \theoremstyle{remark} \newtheorem{remark}{Remark} \newtheorem{note}{Note} \newtheorem*{uremark}{Remark} \newtheorem*{unote}{Note} %------------------------------------------------------------------- \begin{document} %------------------------------------------------------------------- \section*{Schur functor} \hypertarget{context}{}\subsubsection*{{Context}}\label{context} \hypertarget{representation_theory}{}\paragraph*{{Representation theory}}\label{representation_theory} [[!include representation theory - contents]] \hypertarget{contents}{}\section*{{Contents}}\label{contents} \noindent\hyperlink{idea_and_definition}{Idea and definition}\dotfill \pageref*{idea_and_definition} \linebreak \noindent\hyperlink{the_category_of_schur_functors}{The category of Schur functors}\dotfill \pageref*{the_category_of_schur_functors} \linebreak \noindent\hyperlink{schur_functors_on_more_general_categories}{Schur functors on more general categories}\dotfill \pageref*{schur_functors_on_more_general_categories} \linebreak \noindent\hyperlink{change_of_base}{Change of base}\dotfill \pageref*{change_of_base} \linebreak \noindent\hyperlink{the_action_of_young_symmetrizers}{The action of Young symmetrizers}\dotfill \pageref*{the_action_of_young_symmetrizers} \linebreak \noindent\hyperlink{constructing_schur_functors}{Constructing Schur functors}\dotfill \pageref*{constructing_schur_functors} \linebreak \noindent\hyperlink{schur_functors_are_natural}{Schur functors are ``natural''}\dotfill \pageref*{schur_functors_are_natural} \linebreak \noindent\hyperlink{conceptual_description_of_schur_functors}{Conceptual description of Schur functors}\dotfill \pageref*{conceptual_description_of_schur_functors} \linebreak \noindent\hyperlink{representability}{Representability}\dotfill \pageref*{representability} \linebreak \noindent\hyperlink{structure_of_the_representing_object}{Structure of the representing object}\dotfill \pageref*{structure_of_the_representing_object} \linebreak \noindent\hyperlink{composition_of_schur_functors}{Composition of Schur functors}\dotfill \pageref*{composition_of_schur_functors} \linebreak \noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak \noindent\hyperlink{old_stuff}{Old Stuff}\dotfill \pageref*{old_stuff} \linebreak \hypertarget{idea_and_definition}{}\subsection*{{Idea and definition}}\label{idea_and_definition} Classically, a `Schur functor' is a specific sort of [[functor]] \begin{displaymath} S: FinVect \to FinVect \end{displaymath} where [[FinVect]] is the category of [[finite dimensional vector spaces]] over the [[complex numbers]]. Namely, it is a functor where $S(X)$ is obtained by taking the $n$th [[tensor power]] of the vector space $X$ and then picking out a subspace that transforms in a certain way with respect to the [[symmetric group]] $S_n$. In fact, Schur functors can be defined on a large class of [[categories]] resembling $FinVect$: for example, [[categories of representations]] of a [[group]], or [[vector bundles]], or [[coherent sheaves]]. After an elementary introduction to Schur functors, this article will give a conceptual approach based on the fact that these functors are precisely those that can be `[[natural transformation|naturally]]' --- or more precisely, `[[pseudonatural transformation|pseudonaturally]]' defined on all [[symmetric monoidal category|symmetric monoidal]] [[linear category|linear]] [[Cauchy complete categories]]. The most famous examples of Schur functors are these: \begin{itemize}% \item For each $n \geq 0$, the $n^{th}$ [[symmetric power]] $X \mapsto S^n(X)$ is a Schur functor. \item For each $n \geq 0$, the $n^{th}$ [[alternating power]] $X \mapsto \Lambda^n(X)$ is a Schur functor. \end{itemize} More generally, complex [[irreducible representation]]s of $S_n$ correspond to $n$-box [[Young diagram|Young diagrams]], so Schur functors are usually described with the help of these. An $n$-box Young diagram is simply a pictorial way of writing $n$ as a sum of natural numbers listed in decreasing order. For example, this 17-box Young diagram: describes the partition of $17$ as $5 + 4 + 4 + 2 + 1 + 1$. However, it also can be used to construct an irreducible complex representation of the permutation group $S_{17}$, and thus a Schur functor. In general, here is the recipe for constructing the Schur functor $S_\lambda$ associated to an $n$-box Young diagram $\lambda$. For now we only say what this functor does to objects (that is, [[finite-dimensional vector spaces]]): \begin{itemize}% \item Given an $n$-box Young diagram $\lambda$ and a vector space $X$, we first form the [[tensor power]] $X^{\otimes n}$. We think of each factor in this tensor power as corresponding to a specific box of the Young diagram. \item Then we pick out the subspace of $X^{\otimes n}$ consisting of tensors that are \emph{unchanged} by any permutation that interchanges two boxes in the same \emph{row}. \item Then we project this subspace onto the space of tensors that \emph{change sign} under any permutation that interchanges two boxes in the same \emph{column}. The result is called $S_\lambda(X)$, where $S_\lambda$ is the Schur functor corresponding to $\lambda$. \end{itemize} It is easy to see from this description that: \begin{itemize}% \item The tall skinny Young diagrams with one column and $n$ rows give the Schur functors $\Lambda^n$. \item The short fat Young diagrams with one row and $n$ columns give the Schur functors $S^n$. \end{itemize} We can also think of this relation between Young diagrams and Schur functors in a slightly more abstract way using the [[group algebra]] of the symmetric group, $\mathbb{C}[S_n]$. Suppose $\lambda$ is an $n$-box Young diagram. Then we can think of the operation `symmetrize with respect to permutations of the boxes in each row' as an element $p^S_\lambda \in \mathbb{C}[S_n]$. Similarly, we can think of the operation `antisymmetrize with respect to permutations of the boxes in each column' as an element $p^A_\lambda \in \mathbb{C}[S_n]$. By construction, each of these elements is [[idempotent]]: \begin{displaymath} (p^A_\lambda)^2 = p^A_\lambda \, , \; \; (p^S_\lambda)^2 = p^S_\lambda \end{displaymath} Now, it is easy to see that the product of commuting idempotents is idempotent. The elements $p^S_\lambda$ and $p^A_\lambda$ do not commute, but amazingly, their product \begin{displaymath} p_\lambda = p^A_\lambda p^S_\lambda \end{displaymath} is idempotent up to a scalar multiple! This element $p_\lambda \in \mathbb{C}[S_n]$ is called the \textbf{Young symmetrizer} corresponding to the $n$-box Young diagram $\lambda$. There is a functor, called a \textbf{Schur functor}: \begin{displaymath} S_\lambda : FinVect \to FinVect \end{displaymath} defined on any finite-dimensional vector space $X$ as follows: \begin{displaymath} S_\lambda(X) = p_\lambda X^{\otimes n} \end{displaymath} Here we are using the fact that $S_n$, and thus its group algebra, acts on $X^{\otimes n}$. Thus, $p_\lambda$ acts as an idempotent operator on $X^{\otimes n}$, and $S_\lambda(X)$ as defined above is the range of this operator. An even deeper approach to Schur functors is based on the relation between Young diagrams and representations of the symmetric groups. The subspace \begin{displaymath} V_\lambda = p_\lambda \mathbb{C}[S_n] \subseteq \mathbb{C}[S_n] \end{displaymath} has an obvious right action of the algebra $\mathbb{C}[S_n]$, and thus becomes a representation of the group $S_n$. In fact, it is an irreducible representation of $S_n$, and every irreducible representation of $S_n$ is isomorphic to one of this form. Even better, this recipe sets up a one-to-one correspondence between $n$-box Young diagrams and isomorphism classes of irreducible representations of $S_n$. (Strictly speaking, to think of $p_\lambda$ as an element of $\mathbb{C}[S_n]$, we must choose a way to label the boxes of the Young diagram with numbers $1, \dots, n$. Such an identification is called a \textbf{Young tableau}. For our purposes it will cause no harm to randomly choose a Young tableau for each Young diagram, since different choices give isomorphic representations $V_\lambda$. In other contexts, the difference between various choices of Young tableaux can be extremely important.) This description of irreducible representations of $S_n$ paves the way towards an important generalization of Schur functors. First, note that \begin{displaymath} X^{\otimes n} \cong \mathbb{C}[S_n] \otimes_{\mathbb{C}[S_n]} X^{\otimes n} \end{displaymath} It follows that \begin{displaymath} \itexarray{ S_\lambda(X) &=& p_\lambda X^{\otimes n} \\ &\cong& p_\lambda \mathbb{C}[S_n] \otimes_{\mathbb{C}[S_n]} X^{\otimes n} \\ &\cong& V_\lambda \otimes_{\mathbb{C}[S_n]} X^{\otimes n} } \end{displaymath} These isomorphisms here are natural, so there is no harm in \emph{defining} the Schur functor $S_\lambda$ by \begin{displaymath} S_\lambda(-) = V_\lambda \otimes_{\mathbb{C}[S_n]} (-)^{\otimes n} \end{displaymath} This formula defines the Schur functor not only on objects but also on morphisms. Even better, we can use the same formula to define a functor \begin{displaymath} S_R : FinVect \to FinVect \end{displaymath} for \emph{any} representation $R$ of $S_n$, as follows: \begin{displaymath} S_R(-) = R \otimes_{\mathbb{C}[S_n]} (-)^{\otimes n} \, . \end{displaymath} These more general functors are still called `Schur functors'. Even more generally, any finite direct sum of the Schur functors just described may also be called a Schur functor. In other words, if $R = \{R_n\}_{n \ge 0}$ where $R_n$ is a finite-dimensional representation of $S_n$, and only finitely many of these representations are nonzero, then we define the \textbf{Schur functor} \begin{displaymath} S_R(-) = \bigoplus_{n \ge 0} R_n \otimes_{\mathbb{C}[S_n]} (-)^{\otimes n} \, . \end{displaymath} \begin{itemize}% \item For each $n \geq 0$, the $n^{th}$ [[tensor power]] $V \mapsto V^{\otimes n}$ is a Schur functor. \item If $F$ and $G$ are Schur functors, the functor $V \mapsto F(V) \oplus G(V)$ is a Schur functor. \item If $F$ and $G$ are Schur functors, the functor $V \mapsto F(V) \otimes G(V)$ is also a Schur functor. \item If $F$ and $G$ are Schur functors, the composite $V \mapsto F(G(V))$ is a Schur functor. This way of constructing Schur functors is known as [[plethysm]]. \end{itemize} \hypertarget{the_category_of_schur_functors}{}\subsection*{{The category of Schur functors}}\label{the_category_of_schur_functors} There is a category $Schur$ with \begin{itemize}% \item Schur functors $S_R : FinVect \to FinVect$ as objects. Here \begin{displaymath} S_R(-) = \bigoplus_{n \ge 0} R_n \otimes_{\mathbb{C}[S_n]} (-)^{\otimes n} \, \end{displaymath} each $R_n$ is a finite-dimensional representation of $S_n$, and only finitely many of these representations are nonzero. \item natural transformations between such functors as morphisms. \end{itemize} In the rest of this article, we would like to give a conceptual explanation of this category. As a warm-up, let us note that $\Schur$ has has a nice description in terms of groupoid of finite sets and bijections. This groupoid is the [[core]] of the category [[FinSet]], so it is denoted $core(FinSet)$. What is the relation between Schur functors and this groupoid. Every Schur functor is a finite direct sum of Schur functors coming from irreducible representations of symmetric groups $S_n$ for various $n$. But what sort of entity is a \emph{direct sum of representations of symmetric groups $S_n$ for various $n$?} It is nothing but a representation of the [[permutation groupoid]]: \begin{displaymath} \mathbb{P} = \bigsqcup_{n \ge 0} S_n \, , \end{displaymath} where objects are natural numbers, all morphisms are automorphisms, and the automorphisms of $n$ form the group $S_n$. In other words, it is a functor \begin{displaymath} R : \mathbb{P} \to Vect \end{displaymath} But conceptually, the importance of $\mathbb{P}$ is that it is a [[skeleton]] of the groupoid of finite sets and bijections. So, \begin{displaymath} \mathbb{P} \simeq core(FinSet) \, . \end{displaymath} As a result, any Schur functor gives a functor \begin{displaymath} R : core(FinSet) \to Vect \end{displaymath} Following [[Andre Joyal|Joyal]]`s work on combinatorics, such functors are known as $Vect$-valued [[species]], or $Vect$-valued [[structure type|structure types]]. The idea here is that just as an ordinary Set-valued species \begin{displaymath} T : core(FinSet) \to Set \end{displaymath} assigns to any finite set a \emph{set} of structures of some type, a $Vect$-valued species assigns to any finite set a \emph{vector space} of structures of some type, Thanks to the `free vector space on a set' functor \begin{displaymath} F: Set \to Vect \, , \end{displaymath} we can linearize any ordinary species $T$ and obtain a linear species $F \circ T$. This process is extremely important in the work of [[Marcelo Aguiar]] and [[Swapneel Mahajan]]: \begin{itemize}% \item [[Marcelo Aguiar]] and [[Swapneel Mahajan]], [[Monoidal Functors, Species and Hopf Algebras]], 2010. \end{itemize} However, not all $Vect$-valued species corresond to Schur functors, because we have defined Schur functors to arise from \emph{finite} direct sums of irreducible representations of permutation groups. So, $Schur$ is equivalent to the category where: \begin{itemize}% \item objects are \textbf{polynomial species}: that is, functors $R: core(Fin\Set) \to FinVect$ such that $R(n) = \{0\}$ for all sufficiently large finite sets $n$; \item morphisms are natural transformations. \end{itemize} We call this the \textbf{category of polynomial species}. The reason for the term `polynomial' is that any functor of the form \begin{displaymath} S_R(X) = \bigoplus_{n \ge 0} R_n \otimes_{\mathbb{C}[S_n]} X^{\otimes n} \end{displaymath} gives rise to a formal power series called its \textbf{generating function}: \begin{displaymath} \sum_{n \ge 0} \frac{dim(R_n) \, x^n}{n!} \, , \end{displaymath} and this power series is a polynomial precisely when $R$ is a polynomial species. The category of representations of any groupoid has many nice features. For example, it is a [[symmetric monoidal category|symmetric monoidal]] [[abelian category]], by which we mean a symmetric monoidal category that is also abelian, where tensoring with any object is right exact. So, the category of $Vect$-valued species is symmetric monoidal abelian --- and it is easy to check that the subcategory of polynomial species inherits this structure. Since $Schur$ is equivalent to the category of polynomial species, it too is symmetric monoidal abelian. In particular, $Schur$ has two monoidal structures, $\oplus$ and $\otimes$, defined by \begin{displaymath} (F \oplus G)(V) = F(V) \oplus G(V) \end{displaymath} and \begin{displaymath} (F \otimes G)(V) = F(V) \otimes G(V) \end{displaymath} Since $\otimes$ distributes over $\oplus$, these make $Schur$ into a [[rig category]]. In the literature on species, the operation $\oplus$ is often called \textbf{addition}, since adding species this way corresponds to adding their generating functions. \hyperlink{AMbook}{Aguiar and Mahajan} call $\otimes$ the \emph{Hadamard product} (see section 8.1.2). But the category of representations of a groupoid has even more nice features when the groupoid itself has a [[monoidal category|monoidal structure]]: then the representation category acquires a monoidal structure thanks to [[Day convolution]]. The groupoid $\mathbb{P}$ has, in fact, \emph{two} important monoidal structures, coming from the product $\times$ and disjoint union $+$ of finite sets. Since $\times$ distributes over $+$, these make $\mathbb{P}$ into a [[rig category]]. Thanks to Day convolution, these give the category of representations of $\mathbb{P}$ two more monoidal structures, making it into a rig category in another way. The same is true for the subcategory $Schur$. In the literature on species, the monoidal structure coming from $+$ is often called \textbf{multiplication}, since multiplying species in this way corresponds to multiplying their generating functions. Aguiar and Mahajan call this monoidal structure the \emph{Cauchy product}. The monoidal structure coming from $\times$ has no commonly used name, but it deserves to be called the \textbf{Dirichlet product}. Aguiar and Mahajan point out that some of the relationships between the ``pointwise'' products (addition and Hadamard) and the ``Day'' products (Cauchy and Dirichlet) can be described in terms of [[duoidal categories]]. Specifically, the Hadamard and Cauchy products form duoidal structures in both orders. On top of all this, the composite of Schur functors is again a Schur functor. This gives $Schur$ a fifth monoidal structure: the \textbf{plethystic tensor product}. Unlike the four previous monoidal structures, this one is not symmetric. Mathematicians often work with a decategorified version of $Schur$: its [[Grothendieck group]], also known as the ring of [[symmetric functions]]. The various structures that $Schur$ possesses endow this ring with corresponding structures. Among other things, it is the free [[lambda-ring]] on one generator. As we shall see, corresponds to the fact that $Schur$ is the free [[symmetric monoidal category|symmetric monoidal]] [[Cauchy complete category|Cauchy complete]] [[linear category]] on one object. \hypertarget{schur_functors_on_more_general_categories}{}\subsection*{{Schur functors on more general categories}}\label{schur_functors_on_more_general_categories} We have described Schur functors as special functors \begin{displaymath} F: FinVect \to FinVect \end{displaymath} But in fact, functors such as the $n^{th}$ alternating power, $n^{th}$ symmetric power, etc. make sense in much wider contexts. For starters, we can replace the complex numbers by any field $k$ of characteristic zero, and everything in our discussion still works. More importantly, Schur functors can be applied to any [[symmetric monoidal category|symmetric monoidal]] [[Cauchy complete category|Cauchy complete]] [[linear category]] (``[[tensor category]]''). Here by \textbf{linear category} we mean a category [[enriched category|enriched]] over [[Vect]], the category of vector spaces over $k$. Such a category is \textbf{Cauchy complete} when: \begin{itemize}% \item it has [[biproducts]], also known as [[direct sums]], and \item [[idempotent|idempotents]] [[split idempotent|split]]. \end{itemize} To illustrate the full breadth of this generalization, here are a few examples: \begin{itemize}% \item the category [[Vect]], consisting of vector spaces over any field $k$ of [[characteristic zero]] \item the category [[FinVect]], consisting of [[finite-dimensional vector spaces]] over $k$ \item the [[category of representation]] of any [[group]] on vector spaces (or [[finite-dimensional vector spaces]]) over $k$ \item the category of [[super vector spaces]], [[graded vector space|graded vector spaces]] or [[chain complexes]] over $k$ \item for $k = \mathbb{R}$ or $\mathbb{C}$, the category of finite-dimensional real or complex [[vector bundle|vector bundles]] over any [[topological space]], or smooth vector bundles over any smooth [[manifold]] \item the category of algebraic vector bundles over any [[algebraic variety]] (or more generally, [[scheme]] or [[algebraic stack]]) over $k$ \item the category of [[coherent sheaves]] of vector spaces over any algebraic variety (or scheme or algebraic stack) over $k$ \end{itemize} These examples can be hybridized, and thus they multiply indefinitely: for example, we could take coherent sheaves of chain complexes, or vector bundles equipped with a group action, and so on. In the following subsections, we explain how to define Schur functors on any category of this sort. A somewhat novel feature of our treatment is that we \emph{do not require the theory of Young diagrams} to define and study Schur functors. Our strategy is as follows. We fix a symmetric monoidal Cauchy complete linear category, $C$. The group algebra $k[S_n]$ begins life as a [[monoid]] in the symmetric monoidal category $FinVect$. However, we shall explain how interpret it as living in $C$ by a ``change of base'' functor going from $FinVect$ to $C$. This will let us use the Young symmetrizers $p_\lambda$ to construct idempotents on $V^{\otimes k}$ for any object $V \in C$. Splitting these idempotents, we obtain the Schur functors $S_\lambda : C \to C$. \hypertarget{change_of_base}{}\subsubsection*{{Change of base}}\label{change_of_base} To achieve the desired change of base, let $Mat$ be the linear category whose objects are integers $m \geq 0$ and whose morphisms $m \to n$ are $m \times n$ matrices with entries in $k$. Because $C$ is Cauchy complete and in particular has finite biproducts (direct sums), there is an evident linear functor \begin{displaymath} Mat \to C \end{displaymath} which takes $m$ to $I^m$, the direct sum of $m$ copies of the tensor unit $I$. It is the unique linear functor taking $1$ to $I$, up to unique linear isomorphism. In the case $C = FinVect$, the linear functor \begin{displaymath} Mat \to FinVect, \end{displaymath} taking $1$ to $k$, is a linear equivalence (exhibiting $Mat$ as a [[skeleton]] of $C$). Because of this equivalence, we could equally well say that there is a linear functor \begin{displaymath} i: FinVect \to C \end{displaymath} which, up to unique linear isomorphism, is the unique linear functor taking $k$ to $I$. Notice that a [[symmetric monoidal functor]] of this form must take the tensor unit $k$ to $I$ (up to coherent isomorphism, as always), and in fact $i$ is symmetric monoidal, because there is a canonical isomorphism \begin{displaymath} I^m \otimes I^n \cong I^{m n}, \end{displaymath} using the fact that $\otimes$ preserves direct sums in each argument, and the fact that there is a canonical isomorphism $I \otimes I \cong I$. In summary, we have the following proposition. \begin{prop} \label{}\hypertarget{}{} There is exactly one symmetric monoidal linear functor $i: FinVect \to C$, up to symmetric monoidal linear isomorphism. \end{prop} \hypertarget{the_action_of_young_symmetrizers}{}\subsubsection*{{The action of Young symmetrizers}}\label{the_action_of_young_symmetrizers} Next we explain how given an object $X \in C$, any Young symmetrizer in $k[S_n]$ acts as an idempotent on $X^{\otimes n}$. For this we only need to know a little bit about the group algebra $k[S_n]$, which we recall here. By [[Maschke's theorem]], for any finite group $G$, the [[group algebra]] $k[G]$ decomposes as a direct sum of matrix algebras \begin{displaymath} \bigoplus_{\lambda} hom(V_\lambda, V_\lambda) \end{displaymath} where $\lambda$ ranges over isomorphism classes of irreducible representations of $G$. The identity elements of these matrix algebras $hom(V_\lambda, V_\lambda)$ thus correspond to certain special elements $p_\lambda \in k[G]$. Clearly these elements are [[idempotent]]: \begin{displaymath} p_\lambda^2 = p_\lambda \, . \end{displaymath} We are particularly interested in the case $G = S_n$. In this case, we call the idempotents $p_\lambda$ are `Young symmetrizers'. However, we will not need the formula for these idempotents. The key step is to apply base change to $k[S_n]$. Here we exploit the fact that \begin{displaymath} k[S_n] = \bigoplus_{\sigma \in S_n} k \end{displaymath} is a [[monoid]] in the monoidal category $FinVect$. Since $i : FinVect \to C$ is a monoidal functor, it follows that $i$ carries $k[S_n]$ to a monoid in $C$, which we again call $k[S_n]$ by abuse of notation. As an object of $C$, we have \begin{equation} k[S_n] \cong \bigoplus_{\sigma \in S_n} I \label{sum}\end{equation} There is a general concept of what it means for a monoid in a monoidal category to [[action|act]] on an object in that category. In particular, if $X$ is an object of $C$, the monoid $k[S_n]$ acts on the tensor power $X^{\otimes n}$. To see this, note that for each $\sigma \in S_n$, there is a corresponding symmetry isomorphism \begin{displaymath} \sigma : X^{\otimes n} \to X^{\otimes n} \end{displaymath} Putting these together with the help of \eqref{sum} we obtain a morphism \begin{displaymath} k[S_n] \otimes X^{\otimes n} \to X^{\otimes n} \end{displaymath} which is the desired action. Finally, we would like to describe how each Young symmetrizer $p_\lambda \in k[S_n]$ acts on $X^{\otimes n}$. Quite generally, any element $x \in k[S_n]$ gives a linear map from $k$ to $k[S_n]$, namely the unique map sending $1$ to $x$. Applying the functor $i$ to this, we obtain a morphism which by abuse of language we call \begin{displaymath} x : I \to k[S_n] \end{displaymath} This then yields an endomorphism \begin{displaymath} \widetilde{x}: X^{\otimes n} \to X^{\otimes n } \end{displaymath} given as the composite \begin{displaymath} X^{\otimes n} \stackrel{\cong}{\longrightarrow} I \otimes X^{\otimes n} \stackrel{x \otimes 1}{\longrightarrow} k[S_n] \otimes X^{\otimes n} \longrightarrow X^{\otimes n} \end{displaymath} It is easy to check that for any $x,y \in k[S_n]$, \begin{displaymath} \widetilde{x y} = \widetilde{x} \widetilde{y} \end{displaymath} Thus for any Young symmetrizer $p_\lambda$, the morphism \begin{displaymath} \widetilde{p}_\lambda : X^{\otimes n} \to X^{\otimes n} \end{displaymath} is idempotent, because $p_\lambda$ is. \hypertarget{constructing_schur_functors}{}\subsubsection*{{Constructing Schur functors}}\label{constructing_schur_functors} By construction, the morphisms \begin{displaymath} \widetilde{p}_\lambda : X^{\otimes n} \to X^{\otimes n} \end{displaymath} are the components of a natural transformation from the functor $X \mapsto X^{\otimes n}$ to itself. Since idempotents split in $C$, we can form the cokernel of $1 - \widetilde{p}_\lambda$, or in other words, the coequalizer of the pair \begin{displaymath} X^{\otimes n} \stackrel{\widetilde{p}_\lambda}{\underset{1}{\rightrightarrows}} X^{\otimes n} \end{displaymath} \begin{defn} \label{}\hypertarget{}{} For any Young diagram $\lambda$, the \textbf{Schur functor} $S_\lambda: C \to C$ is defined as follows. Given an object $X$ of $C$, let $S_\lambda(X)$ be the cokernel of $(1 - \widetilde{p}_\lambda) : X^{\otimes n} \to X^{\otimes n}$. Given a morphism $f: X \to Y$ in $C$, let $S_\lambda(f)$ be the unique map $S_\lambda(X) \to S_\lambda(Y)$ such that \begin{displaymath} \itexarray{ X^{\otimes n} & \to & S_\lambda(X) \\ f^{\otimes n} \downarrow \; \; & & \downarrow S_\lambda(f) \\ Y^{\otimes n} & \to & S_\nu(Y) } \end{displaymath} commutes, where the horizontal arrows are the cokernel maps. \end{defn} More generally we can define a \textbf{Schur functor} \begin{displaymath} S_R : C \to C \end{displaymath} for any finite-dimensional representation $R$ of $S_n$, as follows. We can write $R$ as a finite direct sum of irreducible representations: \begin{displaymath} R = \bigoplus_i V_{\lambda_i} \end{displaymath} and then define \begin{displaymath} S_R(-) = \bigoplus_i S_{\lambda_i}(-) \, . \end{displaymath} \hypertarget{schur_functors_are_natural}{}\subsubsection*{{Schur functors are ``natural''}}\label{schur_functors_are_natural} Suppose now that we have a symmetric monoidal linear functor $G: C \to D$. We can think of $G$ as a ``change of base category'', and Schur functors are ``natural'' with respect to change of base. That is to say: if $G$ is a symmetric monoidal linear functor $C \to D$, then by definition $G$ preserves tensor products (at least up to coherent natural isomorphism), and $G$ will automatically preserve both direct sums (by linearity) as well as splittings of idempotents (as all functors do). Therefore, for a Schur functor $S_\lambda(X) = V_\lambda \otimes_{S_n} X^{\otimes n}$, we have natural isomorphisms \begin{displaymath} \itexarray{ S_{\lambda, D} (G X) = V_{\lambda, D} \otimes_{S_n} (G X)^{\otimes n} & \cong & V_{\lambda, D} \otimes_{S_n} G(X^{\otimes n}) \\ & \cong & G(V_{\lambda, C}) \otimes_{S_n} G(X^{\otimes n}) \\ & \cong & G(V_{\lambda, C} \otimes_{S_n} X^{\otimes n}) \\ & \cong & G(S_{\lambda, C}(X)) } \end{displaymath} where the first isomorphism uses the symmetric monoidal structure of $G$; the second uses the fact that $V_{\lambda, D} \cong G(V_{\lambda, C})$ because there is, up to isomorphism, only one symmetric monoidal linear functor $FinVect \to D$; the third uses the symmetric monoidal structure again and preservation of idempotent splittings. If $R$ is any representation, then by writing $R$ as a direct sum of irreducible representations $V_\lambda$ and using the fact that $G$ preserves direct sums, we have more generally \begin{displaymath} S_{R, D} \circ G \cong G \circ S_{R, C}. \end{displaymath} In summary, Schur functors $S_R$ transfer ``naturally'' across change of base functors $G: C \to D$. \hypertarget{conceptual_description_of_schur_functors}{}\subsection*{{Conceptual description of Schur functors}}\label{conceptual_description_of_schur_functors} As we have seen, Schur functors $S_R$ are definable under fairly mild hypotheses: working over a field of characteristic zero, they can be defined on any symmetric monoidal linear category $C$ which is Cauchy complete. So, for such $C$ we can define a Schur functor \begin{displaymath} S_R: C \to C \end{displaymath} and moreover, if $G: C \to D$ is a symmetric monoidal linear functor, the Schur functors on $C$ and $D$ are ``naturally'' compatible, in the sense that the diagram \begin{displaymath} \itexarray{ C & \stackrel{G}{\to} & D \\ S_{R, C} \downarrow & & \downarrow S_{R, D} \\ C & \underset{G}{\to} & D } \end{displaymath} commutes up to a canonical isomorphism $\phi_G: S_{R, D} \circ G \cong G \circ S_{R, C}$, and moreover these $\phi_G$ fit together sensibly when we compose symmetric monoidal linear functors. In this abstract framework, it may be wondered what significant role is played by the representations $R$ of the symmetric group. The natural isomorphisms $\phi_G$ which relate the Schur functors across change of base $G: C \to D$ are pleasant to observe, but surely this is just some piddling general nonsense in the larger story of Schur functors $S_R$, which are after all deeply studied and incredibly rich classical constructions? Let us put the question another way. We have seen the Schur functors $S_R$ are constructed in a uniform (or ``polymorphic'') way across all symmetric monoidal Cauchy complete linear categories $C$, and this construction is natural with respect to symmetric monoidal change of base functors $G: C \to D$. Or rather: not natural in a strict sense, but \emph{pseudonatural} in the sense that naturality squares commute up to isomorphism $\phi_G$. Now pseudonaturality is a very general phenomenon in 2-category theory. So the question is: among all such pseudonatural transformations $S$, what is special about the Schur functors $S_R$? What extra properties pick out exactly the Schur functors $S_R$ from the class of all pseudonatural transformations $S$? The perhaps surprising answer is: no extra properties! That is, the Schur functors $S_R$ are \emph{precisely} those functors that are defined on all symmetric monoidal Cauchy complete linear $C$ and that are pseudonatural with respect to change of base $G: C \to D$! Let us now make this precise. Schur functors are defined on certain symmetric monoidal linear categories, but they respect neither the symmetric monoidal structure nor the linear structure. So, we have to forget some of the structure of the objects on which Schur functors are defined. This focuses our attention on the `forgetful' 2-functor \begin{displaymath} U: SymMonLinCauch \to Cat \end{displaymath} where: \begin{defn} \label{}\hypertarget{}{} \textbf{SymMonLinCauch} is the 2-category with \begin{itemize}% \item small symmetric monoidal Cauchy complete linear categories as objects, \item symmetric monoidal linear functors as morphisms, \item symmetric monoidal linear natural transformations as 2-morphisms. \end{itemize} \end{defn} As we shall see, Schur functors correspond to [[pseudonatural transformations]] from $U$ to itself, and morphisms between Schur functors correspond to [[modifications]] between these pseudonatural transformations. For the reader unaccustomed to these 2-categorical concepts, we recall: \begin{defn} \label{}\hypertarget{}{} Given two 2-functors $U, V: S \stackrel{\to}{\to} C$ between 2-categories, a \textbf{pseudonatural transformation} $\phi: U \to V$ is a rule that assigns to each 0-cell $s$ of $S$ a 1-cell $\phi(s): U(s) \to V(s)$ of $C$, and to each 1-cell $f: r \to s$ of $S$ an invertible 2-cell $\phi(f)$ of $C$: \begin{displaymath} \itexarray{ U(r) & \stackrel{U(f)}{\to} & U(s) \\ \phi(r) \downarrow & \phi(f) \swArrow & \downarrow \phi(s) \\ V(r) & \underset{V(f)}{\to} & V(s) } \end{displaymath} such that the following pasting diagram equalities hold: \begin{displaymath} \itexarray{ U(r) & \stackrel{U(f)}{\to} & U(s) & \stackrel{U(g)}{\to} & U(t) & & U(r) & \stackrel{U(g f)}{\to} & U(t) & & \\ \phi(r) \downarrow & \phi(f) \swArrow & \downarrow \phi(s) & \phi(g) \swArrow & \downarrow \phi(t) & = & \phi(r) \downarrow & \phi(g f) \swArrow & \downarrow \phi(t) & & & \\ V(r) & \underset{V(f)}{\to} & V(s) & \underset{V(g)}{\to} & V(t) & & V(r) & \underset{V(g f)}{\to} & V(t) & & & } \end{displaymath} and \begin{displaymath} \itexarray{ U(r) & \stackrel{U(1_r)}{\to} & U(r) & & \\ \phi(r) \downarrow & \phi(1_r) \swArrow & \downarrow \phi(r) & = & 1_{\phi(r)} \\ V(r) & \underset{V(1_r)}{\to} & V(r) & & } \end{displaymath} \end{defn} \begin{defn} \label{}\hypertarget{}{} With notation as above, let $\phi, \psi: U \to V$ be two pseudonatural transformations. A \textbf{modification} $x: \phi \to \psi$ is a rule which associates to each 0-cell $s$ of $S$ a 2-cell $x(s): \phi(s) \to \psi(t)$ of $C$, such that the following compatibility condition holds: \end{defn} [[tincan.png:pic]] We now propose our conceptual definition of Schur functor: \begin{defn} \label{}\hypertarget{}{} An (abstract) \textbf{Schur functor} is a pseudonatural transformation $S: U \to U$, where \begin{displaymath} U: SymMonLinCauch \to Cat \end{displaymath} is the forgetful 2-functor. A \textbf{morphism} of Schur functors is a modification between such pseudonatural transformations. \end{defn} What this proposed definition makes manifestly obvious is that \emph{Schur functors are closed under composition}. This provides a satisfying conceptual explanation of \emph{plethysm}, as we will explore in the next two sections. However, we should first check that this proposed definition gives a category of Schur functors equivalent to the category $Schur$ defined earlier! Before launching into the proof, it is worth pondering an easier problem where we replace categories by sets, and symmetric monoidal linear Cauchy-complete categories by commutative rings.\newline So, instead of $Cat$ let us consider $Set$, and instead of $SymMonLinCauch$ let us consider $CommRing$. There is a forgetful functor \begin{displaymath} U : CommRing \to Set \, . \end{displaymath} What are the natural transformations from this functor to itself? Any polynomial $P \in \mathbb{Z}[x]$ defines such a natural transformation, since for any commutative ring $R$ there is a function $P_R: U(R) \to U(R)$ given by \begin{displaymath} P_R : x \mapsto P(x) \end{displaymath} and this is clearly natural in $R$. But in fact, the set of natural transformations from this functor turns out to be \emph{precisely} $\mathbb{Z}[x]$. And the reason is that $\mathbb{Z}[x]$ is the free commutative ring on one generator! To see this, note that the forgetful functor \begin{displaymath} U : CommRing \to Set \end{displaymath} has a left adjoint, the `free commutative ring' functor \begin{displaymath} F : Set \to CommRing \, . \end{displaymath} The free commutative ring on a 1-element set is \begin{displaymath} F(1) \cong \mathbb{Z}[x] \end{displaymath} and homomorphisms from $F(1)$ to any commutative ring $R$ are in one-to-one correspondence with elements of the underlying set of $R$, since \begin{displaymath} U(R) \cong hom(1, U(R)) \cong hom(F(1), R) \, . \end{displaymath} So, we say $F(1)$ [[representable functor|represents]] the functor $U$. This makes it easy to show that the set of natural transformations from $U$ to itself is isomorphic to the underlying set of $\mathbb{Z}[x]$, namely $U(F(1))$: \begin{displaymath} [U,U] \cong [hom(F(1), -), hom(F(1), -)] \cong hom(F(1), F(1)) \simeq U(F(1)) \end{displaymath} In the first step here we use the representability $U \cong hom(F(1), -)$; in the second we use the [[Yoneda lemma]], and in the third we use the adjointness between $U$ and $F$. We shall carry out a categorified version of this argument to prove that $Schur$ is the category of endomorphisms of the 2-functor \begin{displaymath} U: SymMonLinCauch \to Cat \end{displaymath} The key is that $Schur$ is the free symmetric monoidal linear Cauchy-complete category on one generator. [[John Baez]]: I added explanatory remarks above. Okay? \hypertarget{representability}{}\subsection*{{Representability}}\label{representability} To build a bridge from abstract Schur functors as pseudonatural transformations to the more classical descriptions, we start with the following key result. In what follows we use $k \mathbb{P}$ to denote the `linearization' of the permutation groupoid: that is, the linear category formed by replacing the homsets in $\mathbb{P}$ by the free vector spaces on those homsets. We use $\widebar{k \mathbb{P}}$ to denote the Cauchy completion of the linearization of $\mathbb{P}$. As we shall see, $\widebar{k \mathbb{P}}$ is equivalent to the category of Schur functors. But first: \begin{theorem} \label{}\hypertarget{}{} The underlying 2-functor \begin{displaymath} U: SymMonLinCauch \to Cat \end{displaymath} is represented by $\widebar{k \mathbb{P}}$. In other words: \begin{displaymath} U(-) \simeq hom(-, \widebar{k \mathbb{P}}) \end{displaymath} \end{theorem} \begin{proof} It is well-known that the permutation category $\mathbb{P}$, whose objects are integers $m \geq 0$ and whose morphisms are precisely automorphisms $m \to m$ given by permutation groups $S_m$, is the representing object for the underlying 2-functor \begin{displaymath} U_0: SymMonCat \to Cat \, . \end{displaymath} Let $SymMonLin$ denote the 2-category of small symmetric monoidal linear (but not necessarily Cauchy complete) categories, and let $Lin$ denote the 2-category of small linear categories. Let $k(-): Cat \to Lin$ denote linearization, given by change of base \begin{displaymath} k \cdot - : Set \to Vect \end{displaymath} applied to a $Set$-enriched category $(C_0, hom: C_0 \times C_0 \to Set)$ to yield a linear category $(C_0, C_0 \times C_0 \to Vect)$. $k(-): Cat \to Lin$ is left 2-adjoint to the underlying 2-functor $U_0: Lin \to Cat$. For this, we use the fact that if $V$ is a nice closed category (here $Vect$) -- in particular cocomplete -- then the lax monoidal functor $\hom(I, -): V \to Set$ has a left adjoint $- \cdot I: Set \to V$ (here linearization) which is strong (symmetric) monoidal. This induces a 2-functor $Cat = Set$-$Cat \to V$-$Cat$ which is strong 2-symmetric monoidal. It therefore sends symmetric pseudomonoids in $Set$-$Cat$ to symmetric pseudomonoids in $V$-$Cat$. In other words, it sends symmetric monoidal categories to symmetric monoidal linear categories. Therefore, the 2-adjunction $k(-) \dashv U_0$ between $Cat$ and $LinCat$ lifts to one between $SymMonCat$ and $SymMonLinCat$: \begin{displaymath} (k(-): SymMonCat \to SymMonLin) \dashv (U_1: SymMonLin \to SymMonCat) \end{displaymath} Finally, let $LinCauch$ denote the 2-category of small Cauchy complete linear categories. The linear Cauchy completion gives a 2-reflector $\widebar{(-)}: Lin \to LinCat$ which is left 2-adjoint to the 2-embedding $i: LinCauch \to Lin$, and again the 2-adjunction $\widebar{(-)} \dashv i$ lifts to the level of symmetric monoidal structure to give a 2-adjunction \begin{displaymath} (\widebar{(-)}: SymMonLin \to SymMonLinCauch) \dashv (U_2: SymMonLinCauch \to SymMonLin) \end{displaymath} For this, the key fact is that if $A \otimes B$ denotes the tensor product of two $V$-enriched categories, then there is a canonical enriched functor $\overline{A} \otimes \overline{B} \simeq \overline{A \otimes B}$ making Cauchy completion into a lax 2-monoidal functor on $V$-$Cat$. Even better, it is lax 2-symmetric monoidal. So, it sends symmetric pseudomonoids to symmetric pseudomonoids. In this case, then, it sends symmetric monoidal linear categories to symmetric monoidal linear Cauchy-complete categories. Putting this all together, the underlying functor $U: SymMonLinCauch \to Cat$ is the evident composite \begin{displaymath} SymMonLinCauch \stackrel{U_2}{\to} SymMonLin \stackrel{U_1}{\to} SymMonCat \stackrel{U_0}{\to} Cat \end{displaymath} and therefore we have pseudonatural equivalences \begin{displaymath} \itexarray{ SymMonLinCauch(\widebar{k(\mathbb{P})}, -) & \cong & SymMonLin(k(\mathbb{P}), U_2 -) \\ & \cong & SymMonCat(\mathbb{P}, U_1 U_2 -) \\ & \cong & U_0 U_1 U_2 \\ & \cong & U } \end{displaymath} so that $\widebar{k \mathbb{P}}$ is the representing object. \end{proof} [[John Baez]]: I took remarks from the query box here and used them to improve the proof above. However, it could still use more improvement. Could you polish it up a bit, Todd? \hypertarget{structure_of_the_representing_object}{}\subsubsection*{{Structure of the representing object}}\label{structure_of_the_representing_object} Let us now calculate $\widebar{k \mathbb{P}}$. In general, the linear Cauchy completion of a linear category $C$ consists of the full subcategory of linear presheaves $C^{op} \to Vect$ that are obtained as retracts of finite direct sums of representables $C(-, c): C^{op} \to Vect$. In the case $C = k\mathbb{P}$, these are the functors \begin{displaymath} F: \mathbb{P}^{op} \to FinVect \end{displaymath} where $F(n) = 0$ for large enough $n$. For it is clear that this category contains the representables and is closed under finite direct sums and retracts. On the other hand, every polynomial $F$ is a sum of monomials $F(0) \oplus F(1) \oplus \cdots \oplus F(n)$, and by Maschke's theorem, each $S_j$-module $F(j)$ is the retract of a finite sum of copies of the group algebra $k[S_j]$ which corresponds to the representable $k\mathbb{P}(-, j)$. So, inspired by Joyal's work on [[combinatorial species]], we make the following definition: \begin{defn} \label{}\hypertarget{}{} A \textbf{polynomial species} is a functor $F: \mathbb{P}^{op} \to FinVect$ where $F(n) = 0$ for all sufficiently large $n$. A morphism of polynomial species is a natural transformation between such functors. \end{defn} As we have mentioned, the category of polynomial species inherits two monoidal structures from $\mathbb{P}$ via [[Day convolution]]. Most important is the one coming from the \emph{additive} monoidal structure on $\mathbb{P}$, which is given on the level of objects by adding natural numbers, and on the morphism level given by group homomorphisms \begin{displaymath} S_m \times S_n \to S_{m+n} \end{displaymath} which juxtapose permutations. This can be linearized to give algebra maps \begin{displaymath} k[S_m] \otimes k[S_n] \to k[S_{m+n}] \end{displaymath} which give the monoidal category structure of $k\mathbb{P}$. This monoidal structure uniquely extends via [[Day convolution]] to the Cauchy completion $\widebar{k\mathbb{P}}$, which is intermediate between $k\mathbb{P}$ and the category of $Vect$-valued presheaves on $k\mathbb{P}$. The general formula for the Day convolution product applied to presheaves $F, G: \mathbb{P}^{op} \to Vect$ is \begin{displaymath} (F G)(n) = \sum_{j+k = n} (F(j) \otimes G(k)) \otimes_{S_j \times S_k} k[S_n] \end{displaymath} [[John Baez]]: Todd had written $S_n$ where I have put $k[S_n]$ here. Okay? or, in other notation, \begin{displaymath} (F G)(n) = \sum_{j+k = n} Ind_{S_j \times S_k}^{S_n} F(j) \otimes G(k) \end{displaymath} and by restriction this formula gives a tensor product on polynomial species. This tensor product is a kind of categorification of the usual definition of product of ordinary polynomials, where given \begin{displaymath} F(x) = \sum_{0 \leq j \leq M} \frac{f_j x^j}{j!} \qquad G(x) = \sum_{0 \leq k \leq N} \frac{g_k x^k}{k!} \end{displaymath} the $n^{th}$ Taylor coefficient of the product $F(x)G(x)$ is \begin{displaymath} \sum_{j+k = n} \frac{n!}{j! k!} f_j g_k \end{displaymath} So in summary: \begin{theorem} \label{}\hypertarget{}{} $\widebar{k \mathbb{P}}$ is equivalent to the symmetric monoidal category of polynomial species. \end{theorem} Now, having defined Schur functors abstractly as pseudonatural transformations $U \to U$, the representability theorem together with the 2-categorical Yoneda lemma means that the category of Schur functors is equivalent to the category of symmetric monoidal linear functors on $\widebar{k \mathbb{P}}$. Accordingly, we calculate \begin{displaymath} [U, U] \cong SymMonLinCauch(\widebar{k\mathbb{P}}, \widebar{k\mathbb{P}}) \cong U(\widebar{k\mathbb{P}}) \end{displaymath} In other words, \begin{theorem} \label{}\hypertarget{}{} The category $Schur$ is equivalent to the category of polynomial species $\mathbb{P}^{op} \to FinVect$. \end{theorem} NB: This theorem refers only to the underlying category $U(\overline{k\mathbb{P}})$. In other words, this category certainly has linear tensor category structure as well, but this structure is not respected by Schur functor composition which we consider next. \hypertarget{composition_of_schur_functors}{}\subsection*{{Composition of Schur functors}}\label{composition_of_schur_functors} Now we consider composition of Schur functors $U \to U$, or equivalently symmetric monoidal linear functors $\widebar{k\mathbb{P}} \to \widebar{k \mathbb{P}}$. Composition endows $[U, U]$ with a monoidal structure, and this monoidal structure transfers across the equivalence of the preceding theorem to a monoidal structure on the underlying category of Schur functors, or equivalently, polynomial species $\mathbb{P}^{op} \to FinVect$. We proceed to analyze this monoidal structure. It may be easier to do this in reverse. Any Schur functor may regarded as a functor \begin{displaymath} 1 \stackrel{F}{\to} \overline{k\mathbb{P}} \, . \end{displaymath} This induces a symmetric monoidal functor, unique up to (unique) symmetric monoidal isomorphism: \begin{displaymath} \mathbb{P} \stackrel{F^\sim}{\to}\overline{k\mathbb{P}}: m \mapsto F^{\otimes m} \end{displaymath} Here $F^{\otimes m}$ is a Day convolution product of $m$ copies of $F$. Finally, the functor $F^\sim$ is linearized and extended (uniquely) to the linear Cauchy completion, to give a symmetric monoidal linear functor on $\widebar{k \mathbb{P}}$. The efficient tensor product description is \begin{displaymath} - \otimes_{\mathbb{P}} F^\sim: \overline{k\mathbb{P}} \to \overline{k\mathbb{P}} \end{displaymath} as this manifestly preserves colimits in the blank argument and therefore all colimits needed for the Cauchy completion. (And since the extension to the Cauchy completion is unique, this formula must be correct! The only question is whether this functor is valued in $\overline{k\mathbb{P}}$.) In the language of species, this construction is called the \emph{substitution product}, and is denoted $G \circ F$. This is morally correct because it is indeed an appropriate categorification of polynomial composition. However, to avoid overloading the symbol $\circ$ in ways that might be confusing, we will rename it $G \boxtimes F$. Thus, \begin{displaymath} G \boxtimes F = G \otimes_{\mathbb{P}} F^\sim \end{displaymath} In notation which looks slightly less abstract, this is the Schur object given by the formula \begin{displaymath} (G \boxtimes F)(n) = \sum_{k \geq 0} G(k) \otimes_{S_k} F^{\otimes k}(n) \end{displaymath} It should be noted that $(G \boxtimes F)(n)$ is indeed $0$ for $n \gt (deg G)(deg F)$, so that $G \boxtimes F$ is indeed a polynomial species. It is just the polynomial special case of the substitution product which is defined on general \textbf{linear species} $F, G: \mathbb{P}^{op} \to Vect$. \begin{prop} \label{}\hypertarget{}{} The product $\boxtimes$ makes the category of polynomial species into a monoidal category. The unit for this product is polynomial species $X$ given by the representable $\mathbb{P}(-, 1): \mathbb{P}^{op} \to FinVect$. \end{prop} \begin{proof} The following proof is adapted from a similar argument due to Max Kelly ref: we exhibit an associativity isomorphism $\alpha: (- \boxtimes F) \boxtimes G \to - \boxtimes (F \boxtimes G)$ on the basis of universal properties. The point is that by the universal property of $\overline{k\mathbb{P}}$, the category of functors \begin{displaymath} F: 1 \to \overline{k\mathbb{P}} \end{displaymath} is equivalent to the category of symmetric monoidal linear functors \begin{displaymath} H: \overline{k\mathbb{P}} \to \overline{k\mathbb{P}} \end{displaymath} The correspondence in one direction takes $F$ to the symmetric monoidal functor $H = - \boxtimes F$, and in the other direction takes $H$ to $F = H(X)$. By the equivalence, we have a unit isomorphism $X \boxtimes F \cong F$. Also by this equivalence, symmetric monoidal linear transformations between symmetric monoidal linear functors of the form \begin{displaymath} (- \boxtimes F) \boxtimes G \to - \boxtimes (F \boxtimes G) \end{displaymath} are in natural bijection with morphisms $(X \boxtimes F) \boxtimes G \to X \boxtimes (F \boxtimes G)$, which by the unit isomorphism reduce to morphisms $F \boxtimes G \to F \boxtimes G$. Thus, corresponding to the identity on $F \boxtimes G$ we obtain an associativity map $\alpha: (- \boxtimes F) \boxtimes G \to - \boxtimes (F \boxtimes G)$. By similar arguments that appeal to the universal property of $\overline{k \mathbb{P}}$, we get all the required axioms: the invertibility of $\alpha$, the pentagon, etc. \end{proof} To summarize: we have equivalences between \begin{itemize}% \item The category of pseudonatural transformations $U \to U$; \item The category of symmetric monoidal linear functors $\overline{k\mathbb{P}} \to \overline{k \mathbb{P}}$; \item The category $Schur = U(\overline{k\mathbb{P}})$. \end{itemize} The equivalence $Schur \to SymMonLinCauch(\overline{k \mathbb{P}}, \overline{k \mathbb{P}})$ takes a polynomial species $F$ to $- \boxtimes F$. Moreover, the associativity isomorphism is precisely a structure \begin{displaymath} (- \boxtimes G) \circ (- \boxtimes F) \to - \boxtimes (F \boxtimes G) \end{displaymath} of strong monoidal equivalence from $(Schur, \boxtimes)$ to the monoidal category $SymMonLinCauch(\overline{k\mathbb{P}}, \overline{k\mathbb{P}})$ under endofunctor composition. (The hexagonal coherence condition for a monoidal functor follows from the pentagon; one side of the hexagon is an identity since endofunctor composition is a strict monoidal product.) The tensor product $\boxtimes$ on $Schur$ goes by another name: it is the \textbf{plethystic tensor product}. \hypertarget{references}{}\subsection*{{References}}\label{references} A nice introduction to Schur functors can be found here: \begin{itemize}% \item William Fulton and Joe Harris, \emph{Representation Theory: a First Course}, Springer, Berlin, 1991. \end{itemize} For a quick online introduction to [[Young tableaux]] and representations of the [[symmetric groups]], try: \begin{itemize}% \item Yufei Zhao, Young tableaux and the representations of the symmetric group, MIT. (\href{http://www.thehcmr.org/issue2_2/tableaux.pdf}{web}) \end{itemize} For more details on these topics, see: \begin{itemize}% \item William Fulton, \emph{Young Tableaux, with Applications to Representation Theory and Geometry}, Cambridge U. Press, 1997. \item [[Bruce E. Sagan]], \emph{The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions}, Springer, Berlin, 2001. \end{itemize} [[species|Species]] were invented here: \begin{itemize}% \item [[André Joyal]], Une th\'e{}orie combinatoire des s\'e{}ries formelles, \emph{Adv. Math} \textbf{42} (1981), 1--82. \item [[André Joyal]]: Foncteurs analytiques et esp\`e{}ces des structures, in \emph{Combinatoire \'E{}num\'e{}rative}, Lecture Notes in Mathematics \textbf{1234}, Springer, Berlin, 1986, pp. 126--159. \end{itemize} A standard reference on species is: \begin{itemize}% \item Fran\c{c}ois Bergeron, Gilbert Labelle, Pierre Leroux, \emph{Combinatorial Species and Tree-like Structures}, Cambridge University Press, Cambridge 1998. \end{itemize} Here is an important new book on combinatorics which emphasizes the use of $Vect$-valued species: \begin{itemize}% \item [[Marcelo Aguiar]] and [[Swapneel Mahajan]], \emph{Monoidal Functors, Species and Hopf Algebras}, to be published by Cambridge U. Press. (\href{http://www.math.tamu.edu/~maguiar/a.pdf}{web}) \item Kaan Akin, David A Buchsbaum, Jerzy Weyman, \emph{Schur functors and Schur complexes}, Adv. Math. \textbf{44}:3 (1982) 207-278 \item Marcin Chaupnik, \emph{Extensions of Weyl and Schur functors}, Homology, Homotopy and Applications 11(2), s. 27-48, 2009. \end{itemize} See also \begin{itemize}% \item [[Martin Brandenburg]], \emph{Operations on categories of modules are given by Schur functors} (\href{https://arxiv.org/abs/1610.02180}{arXiv:1610.02180}) \end{itemize} \hypertarget{old_stuff}{}\subsection*{{Old Stuff}}\label{old_stuff} [[John Baez]]: this stuff should go somewhere, perhaps: The first thing that should be understood from the beginning is that a general Schur functor $F$ is \emph{nonlinear}: the action on [[hom-set|hom-sets]] \begin{displaymath} hom(V, W) \to hom(F(V), F(W)) \end{displaymath} is not assumed to respect the linear structure. In fact, linear Schur functors are rather uninteresting: because every finite-dimensional space is a finite [[direct sum]] of copies of the $1$-dimensional space $\mathbb{C}$, and because [[linear functor|linear functors]] preserve finite direct sums (that is, [[biproduct|biproducts]], it turns out that every linear Schur functor $F$ is [[representable functor|representable]] as $hom(X, -)$ where $X = F(\mathbb{C})$. So, the category of linear Schur functors is equivalent to $FinVect$. [[John Baez]]: This stuff should get worked into the discussion near the end of how Schur functors are like polynomials\ldots{} \hypertarget{modules_over_a_bimonoid}{}\subsubsection*{{Modules over a bimonoid}}\label{modules_over_a_bimonoid} Next we exploit the fact that, just like any [[group algebra]], $k[S_n]$ is a [[bialgebra]] --- or in fancier language, a [[bimonoid]] in the [[symmetric monoidal category]] [[FinVect]]${}_k$. Since $i \colon FinVect_k \to C$ is a [[symmetric monoidal functor]], this means that $i$ carries $k[S_n]$ to a bimonoid in $C$. As noted above, we call this bimonoid by the same name, $k[S_n]$. The [[category of modules]] over a [[bimonoid]] is a [[monoidal category]]. More explicitly, in the case of the bimonoid $k[S_n]$ in $C$ with comultiplication \begin{displaymath} \delta: k[S_n] \to k[S_n] \otimes k[S_n] \,, \end{displaymath} the tensor product $V \otimes W$ of two $k[S_n]$-modules in $C$ carries a module structure where the action is defined by \begin{displaymath} k[S_n] \otimes V \otimes W \stackrel{\delta \otimes 1_{V \otimes W}}{\to} k[S_n] \otimes k[S_n] \otimes V \otimes W \stackrel{1 \otimes \sigma \otimes 1}{\to} k[S_n] \otimes V \otimes k[S_n] \otimes W \stackrel{\alpha_V \otimes \alpha_W}{\to} V \otimes W \end{displaymath} where $\sigma$ is a symmetry isomorphism and $\alpha_V$, $\alpha_W$ are the actions on $V$ and $W$. Now we consider a particular case of tensor product representations. If $X$ is an object of $C$, the symmetric group $S_n$ has a representation on $X^{\otimes n}$. (Indeed, for each $\sigma \in S_n$, there is a corresponding symmetry isomorphism $X^{\otimes n} \to X^{\otimes n}$. From this one may construct an action \begin{displaymath} k[S_n] \otimes X^{\otimes n} \cong \bigoplus_{\sigma \in S_n} I \otimes X^{\otimes n} \to X^{\otimes n} \end{displaymath} which is the required representation.) So, if $V_\nu$ is a Young tableau representation of $k[S_n]$ in $C$, we obtain a tensor product representation \begin{displaymath} V_\nu \otimes X^{\otimes n} \end{displaymath} of $k[S_n]$ in $C$. Consider next the \textbf{averaging operator} $e = \frac1{n!} \sum_{\sigma \in S_n} \sigma$: \begin{displaymath} e: V_\nu \otimes X^{\otimes n} \to V_\nu \otimes X^{\otimes n} \end{displaymath} This operator makes sense since $k$ has characteristic zero, and crucially, this operator is \emph{idempotent} (because $e = \sigma e$ for all $\sigma \in S_n$). Because we assume idempotents split in $C$, we have a (split) coequalizer \begin{displaymath} V_\nu \otimes X^{\otimes n} \stackrel{\overset{e}{\to}}{\underset{1}{\to}} V_\nu \otimes X^{\otimes n} \to V_\nu \otimes_{S_n} X^{\otimes n} \end{displaymath} This [[coequalizer]] is indeed the object of $S_n$-[[coinvariants]] of $V_\nu \otimes X^{\otimes n}$, i.e., the joint coequalizer of the diagram consisting of all arrows \begin{displaymath} V_\nu \otimes X^{\otimes n} \stackrel{\sigma \cdot-}{\to} V_\nu \otimes X^{\otimes n} \end{displaymath} ranging over $\sigma \in S_n$ (it is the joint coequalizer because $e = \sigma e$ for all $\sigma$). We may now define the Schur functor $S_\nu$ on $C$ attached to a Young tableau $\nu$. [[!redirects Schur functor]] [[!redirects Schur functors]] [[!representation of the symmetric group]] [[!representations of the symmetric group]] \end{document}