\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*{weighted colimit}

A weighted colimit is a concept of [[colimit]] suitable for [[enriched category theory]], dual (in the enriched sense) to the concept of [[weighted limit]].

[[Mike Shulman|Mike]]: Are weighted limits and weighted colimits really different enough that they need entirely separate pages?

[[Todd Trimble|Todd]]: I saw a lot of requests for weighted colimits from other pages; thus prompted, I started writing this.

I haven't been following discussion about duplication of material. I'm guessing it irritates some people, which I don't understand really. My own guess is that in the present case, it might help having separate pages, rather than force non-experts to deduce what they need to know about weighted colimits by staring at the article on weighted limits. But I'm generally open to discussion.

\emph{Toby}: For pedagogical purposes, the examples might well be different. In any case, since this is written somewhat differently from [[weighted limit]], we could also consider which is better and edit the other to match (or not, if we want to give its approach a chance too).

\hypertarget{motivation}{}\subsection*{{Motivation}}\label{motivation}

Recall that a colimit of a diagram in a category $C$, that is, of a functor $F: J \to C$, is given by a universal cocone for $F$. A \textbf{cocone} for $F$ is a natural transformation from $F$ to a constant diagram

\begin{displaymath}
\Delta(c) = (J \to 1 \stackrel{c}{\to} C)
\end{displaymath}
so that a cocone for $F$ is an object of a [[comma category]]

\begin{displaymath}
F \downarrow \Delta
\end{displaymath}
where $\Delta: C^1 \to C^J$ is the diagonal functor obtained by pulling back along the unique functor $J \to 1$. A \textbf{universal cocone} is simply an initial object of $F \downarrow \Delta$.

In enriched category theory, where one considers categories $C$ enriched in a ``nice'' [[monoidal category]] $V$ (generally one where $V$ is [[complete category|complete]], [[cocomplete category|cocomplete]], [[closed monoidal category|closed]] [[symmetric monoidal category|symmetric monoidal]]) there is in general no $V$-enriched diagonal functor $\Delta: C \to C^J$ to speak of. For example, when $V$ is the category [[Ab]], we have $C \simeq C^I$ where $I$ is the unit $V$-category having one object $1$ for which $hom(1, 1) = \mathbb{Z}$, but then for a general [[Ab-enriched category]] $J$, there is no [[enriched functor]] $J \to I$ to pull back along (or, there may be many, but none stand out as canonical). This shows that the usual notion of colimit doesn't adapt particularly well to the general enriched setting.

The more flexible notion of weighted colimit (also called an \emph{indexed colimit} in some of the older accounts) was introduced by Borceux (and Kelly?) as giving the \emph{right} notion of colimit for enriched category theory.

\hypertarget{weighted_colimits_in_ordinary_category_theory}{}\subsection*{{Weighted colimits in ordinary category theory}}\label{weighted_colimits_in_ordinary_category_theory}

First we reformulate ordinary colimits in the language of [[tensor product]]s, in a way that suggests more general weighted colimits.

Assume for the moment that the receiving category $C$ has all [[coproduct]]s and [[coequalizer]]s. As is well known, it follows that $C$ has all colimits; the proof is we can write down a formula for the colimit of $F: J \to C$: as a coequalizer of a pair

\begin{displaymath}
\sum_{j, k \in Ob(J)} hom(j, k) \times F(j) \overset{\to}{\to} \sum_{k \in Ob(J)} F(k) \to colim_J F
\end{displaymath}
where the cartesian product on the left refers to a coproduct of copies of $F(j)$ indexed over the set $hom(j, k)$. One of the two parallel arrows is induced by a collection of actions of the category $J$ on $F$, viz.

\begin{displaymath}
hom(j, k) \times F(j) \to F(k) = \langle F(f): F(j) \to F(k) \rangle_{f: j \to k}
\end{displaymath}
and the other is induced by a collection of projections

\begin{displaymath}
hom(j, k) \times F(j) \to F(j)
\end{displaymath}
each of which is the application of the functor $- \times F(j): Set \to C$ to the unique map $!: hom(j, k) \to 1.$

We can think of the map $hom(j, k) \to 1$ also as a component of an [[action]]: where $J$ acts on the terminal functor $1: J \to Set$. Or rather, dual to the way in which $J$ acts covariantly on $F$ (so $F$ is a \emph{left} $J$-module), we will think of $J$ acting \emph{contravariantly} on the terminal functor $1: J \to Set$ (so that $1$ becomes a \emph{right} $J$-module).

Then the colimit of $F$ above is precisely a [[tensor product]] of the left module $F$ with the right module $1$. More explicitly, the tensor product is the coequalizer of two arrows

\begin{displaymath}
\sum_{j, k} 1(k) \times hom(j, k) \times F(j) \overset{\to}{\to} \sum_j 1(j) \times F(j)
\end{displaymath}
where one arrow is induced from a right action of $J$ on the functor 1, having components

\begin{displaymath}
\rho_{j, k} \times F(j): (1(k) \times hom(j, k)) \times F(j) \to 1(j) \times F(j)
\end{displaymath}
and the other is induced from a left action of $J$ on $F$, having components

\begin{displaymath}
1(k) \times \lambda_{j, k}: 1(k) \times (hom(j, k) \times F(j)) \to 1(k) \times F(k)
\end{displaymath}
From this standpoint, the colimit of $F$ is a rather specialized tensor product of the form

\begin{displaymath}
1 \otimes_J F
\end{displaymath}
and the unsuitability of this notion for general enriched categories could be thought of as a case of putting all one's eggs in the $1$ basket.

A general right $J$-module $W: J^{op} \to Set$ may be called a \textbf{weight} (with $W(j)$ the weight at $j$). Thus instead of giving all objects $j$ an equal weight $W(j) = 1$, we vary the weight and get a more general notion of colimit (just as weighted averages generalize ordinary averages). More importantly, this notion of weighted colimit makes perfect sense in the context of enriched categories.

\hypertarget{definition}{}\subsection*{{Definition}}\label{definition}

Let $J$ be a [[small category]]. Given a functor $W: J^{op} \to Set$ (the \emph{weight}) and a functor $F: J \to C$ (the \emph{diagram}), the \textbf{weighted colimit} or tensor product is an object $W \cdot F$ of $C$ together with an isomorphism

\begin{displaymath}
C(W \cdot F, c) \cong Set^{J^{op}}(W, C(F-, c))
\end{displaymath}
that is [[natural isomorphism|natural]] in objects $c$ of $C$. (By the [[Yoneda lemma]], such an isomorphism is induced by a uniquely determined transformation

\begin{displaymath}
W(j) \to C(F(j), W \cdot F),
\end{displaymath}
natural in $j$, which is a weighted analogue of the universal cocone.)

The notion of weighted colimit carries over in straightforward fashion to categories enriched in a complete, cocomplete, closed symmetric monoidal category $V$. In that case, if $J$ is a small $V$-category (that is a $V$-enriched category whose object class is small), and if $F: J \to C$ and $W: J^{op} \to V$ are $V$-functors, then a colimit of $F$ with respect to the weight $W$ is an object $W \cdot F$ of $C$ together with an $V$-[[enriched natural transformation|natural]] isomorphism

\begin{displaymath}
C(W \cdot F, c) \cong V^{J^{op}}(W, C(F-, c))
\end{displaymath}
(between $V$-functors in the argument $c$). In fact, we can dispense with the conditions that $V$ be complete, cocomplete, and closed, at the cost of not being able to refer to functor categories $V^{J^{op}}$, without which the notion is conceptually harder to express.

A leitmotif playing in the background is that the category of weights $Set^{J^{op}}$ on $J$ (or $V^{J^{op}}$ in the enriched case) is the free ($V$-enriched) cocompletion of $J$. In other words, if $C$ is a ($V$-)category which is cocomplete in the ``right'' sense of the word, then every ($V$-)functor $F: J \to C$ extends, uniquely up to unique ($V$-)isomorphism, to a ($V$-)cocontinuous functor

\begin{displaymath}
\widetilde{F}: V^{J^{op}} \to C
\end{displaymath}
which is given by the weighted colimit construction $W \mapsto W \cdot F$.

\hypertarget{examples}{}\subsection*{{Examples}}\label{examples}

To be filled in. The [[tensor product of functors]] is a general example.

\hypertarget{references}{}\section*{{References}}\label{references}

\begin{itemize}%
\item Very nice descriptions on the n-Cafe by:\begin{itemize}%
\item \href{http://golem.ph.utexas.edu/category/2007/02/day_on_rcfts.html#c007688}{John Baez}
\item \href{http://golem.ph.utexas.edu/category/2007/02/day_on_rcfts.html#c007723}{Todd Trimble}

\end{itemize}

\item Notes by Emily Riehl based on a talk by Mike Shulman \href{http://www.math.jhu.edu/~eriehl/weighted.pdf}{Weighted Limits and Colimits}

\end{itemize}


\end{document}