\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*{natural transformation (discussion)}

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{discussion_20}{Discussion 2.0}\dotfill \pageref*{discussion_20} \linebreak


\hypertarget{discussion_20}{}\subsection*{{Discussion 2.0}}\label{discussion_20}

[[Eric]]: This discussion began when I asked the following questions:

\begin{quote}%
[[Eric]]: For some reason, I always thought a natural transformation was a more general map between functors $\alpha:F\Rightarrow G$, where

\begin{displaymath}
F:A\to B\quad\text{and}\quad G:C\to D.
\end{displaymath}
Then $\alpha(F):C\to D$ is a functor and we'd probably also want \textbf{2-component} functors $\alpha_C:A\to C$ and $\alpha_D:B\to D$ such that the following diagram commutes

\begin{displaymath}
\itexarray{
\end{displaymath}

\end{quote}
\begin{verbatim}A 
& 
\stackrel{F}{\to} 
& 
B 
\\ 
\mathllap{\scriptsize{\alpha_C}}\downarrow 
&\mathllap{\scriptsize{\alpha}}\Downarrow & 
\downarrow\mathrlap{\scriptsize{\alpha_D}}
\\ C 
& 
\stackrel{G}{\to} & D \end{verbatim}
\}

\begin{displaymath}
>If this is not a natural transformation, is there another name for it?

>When $A = C$ and $B = D$, this should coincide with the usual definition. If so, why don't we define natural transformation in this more general way? It seems more "natural" to me.

[[Eric]]: I hope to pick up where we left off because I was making some progress understanding some of this stuff.

I like the above concept, but I'm still trying to find the right label for it. The standard definition of [[natural transformation]] involves a map between functors (sharing the same domain and codomain) together with **component morphisms**. What I'm trying to describe is a map between functors (not necessarily with the same domain and codomain) together with **component functors**.

This seems to be a natural thing to do, especially when thinking of functors as maps between morphisms, together with component morphisms, as put forward at [[functor (discussion)]].

From there, it is a skip away from thinking of morphisms as maps between objects together with component objects. Hmmm...

The whole thing just wants to bumped up incrementally in dimension.

###Functor Revisited###

####Definition (Experimental)####

Given categories $A$, $B$ and inclusion maps $i_A:A\to A\sqcup B$, $i_B:B\to A\sqcup B$, a **functor** is a map $F:A\to B$ together with component morphisms $\alpha_x:i_A(x)\to i_B\circ F(x)$ and $\alpha_y:i_A(y)\to i_B\circ F(y)$ for any morphism $f:x\to y$ in $A$ such that the following diagram commutes:
\end{displaymath}
$\backslash$array\{ i\_A(x) \& $\backslash$stackrel\{i\_A(f)\}\{$\backslash$to\} \& i\_A(y) $\backslash$ $\backslash$mathllap\{$\backslash$scriptsize\{$\backslash$alpha\_x\}\}$\backslash$downarrow \&$\backslash$mathllap\{F\}$\backslash$Downarrow \& $\backslash$downarrow$\backslash$mathrlap\{$\backslash$scriptsize\{$\backslash$alpha\_y\}\} $\backslash$ i\_B$\backslash$circ F(x) \& $\backslash$stackrel\{i\_B$\backslash$circ F(f)\}\{$\backslash$to\} \& i\_B$\backslash$circ F(y) \}

\begin{displaymath}
For a less cluttered diagram, we can omit the obvious inclusion maps and look at
\end{displaymath}
$\backslash$array\{ x \& $\backslash$stackrel\{f\}\{$\backslash$to\} \& y $\backslash$ $\backslash$mathllap\{$\backslash$scriptsize\{$\backslash$alpha\_x\}\}$\backslash$downarrow \&$\backslash$mathllap\{F\}$\backslash$Downarrow \& $\backslash$downarrow$\backslash$mathrlap\{$\backslash$scriptsize\{$\backslash$alpha\_y\}\} $\backslash$ F(x) \& $\backslash$stackrel\{F(f)\}\{$\backslash$to\} \& F(y) \}

\begin{displaymath}
<img src="http://ncatlab.org/nlab/files/alt_functor.jpg" width = "250"/>

##Discussion 1.0##

[[Eric]]: For some reason, I always thought a natural transformation was a more general map between functors $\alpha:F\Rightarrow G$, where
$$F:A\to B\quad\text{and}\quad G:C\to D.
\end{displaymath}
Then $\alpha(F):C\to D$ is a functor and we'd probably also want \textbf{2-component} functors $\alpha_C:A\to C$ and $\alpha_D:B\to D$ such that the following diagram commutes

\begin{displaymath}
\itexarray{ 
    A 
    & 
    \stackrel{F}{\to} 
    & 
    B 
    \\ 
    \mathllap{\scriptsize{\alpha_C}}\downarrow 
    &\mathllap{\scriptsize{\alpha}}\Downarrow & 
    \downarrow\mathrlap{\scriptsize{\alpha_D}}
    \\ C 
    & 
    \stackrel{G}{\to} & D 
  }
\end{displaymath}
If this is not a natural transformation, is there another name for it?

When $A = C$ and $B = D$, this should coincide with the usual definition. If so, why don't we define natural transformation in this more general way? It seems more ``natural'' to me.

[[Urs Schreiber]]: I suppose your 2-arrow in the middle labeled $\alpha$ is supposed to be a natural transformation (in the standard sense)?

Then this is a square in the 2-category of categories. Such squares appear in turn as the \emph{components} of [[lax natural transformation]]s of 2-functors into [[Cat]].

[[Eric]]: Thanks. I was hesitant to put that 2-arrow in there. I'm still learning this stuff and am on shaky ground. But no. That 2-arrow is not supposed to be a natural transformation in the traditional sense because it is not a map between functors with the same domain and codomain. It is tempting to say we might want $\alpha_D\circ F\Rightarrow\alpha_C\circ G$ to be a natural transformation in the traditional sense though.

\emph{Toby}: That arrow certainly \emph{looks} to me like a $2$-arrow from $\alpha_D\circ F$ to $\alpha_C\circ G$. Unless it has no particular meaning and is just labelling the entire square as $\alpha\colon F \Rightarrow G$. In any case, there is the question of what, if anything, goes between $\alpha_D\circ F$ and $\alpha_C\circ G$. If nothing, then I would call such a thing a \textbf{square} of functors. If something more interesting, see my answer at [[ericforgy:Natural Transformation]] (which I saw first).

\emph{Todd}: Here's one way of considering how the standard notion of natural transformation is the ``right'' one. Just as in topology we would like to consider the ``space of all continuous maps $X \to Y$'' from one space to another as a topological space, and the right notion of topology so we get an appropriate universal property, we want the same thing here. So the term analogous to ``space'' is ``category'', the term analogous to ``continuous map'' is ``functor'', and the term analogous to ``space of all continuous maps from one space to another'' or ``function space'' is ``category of all functors from one category to another'' or ``functor category''. And there should be a universal property which gives the right such category.

In the end, if $D^C$ denotes the functor category, the universal property provides an equivalence between functors $X \to D^C$ and functors $X \times C \to D$. Pursuing this, let's figure out what morphisms in $D^C$ should look like. In an ordinary category $Y$, a morphism in $Y$ corresponds to a functor $\mathbf{2} \to Y$, where $\mathbf{2}$ is a category with two objects $0, 1$ and exactly one nonidentity arrow $0 \to 1$. So morphisms in $D^C$ should correspond to functors $\mathbf{2} \to D^C$. And the universal property says these are equivalent to functors $\mathbf{2} \times C \to D$. Now: if you carefully work through what functors of that form give you, you get precisely the notion of natural transformation. This is an exercise well worth working out.

This is how you know the notion of natural transformation is morally the ``right'' one.

[[Urs Schreiber]]: I added above a subsection on this characterization in terms of the cartesian closed monoidal structure on $Cat$.

[[Eric]]: I think I got it.

Given two functors $F:A\to B$ and $G:C\to D$, let $\alpha:F\Rightarrow G$ together with component functors $\alpha_C:A\to C$ and $\alpha_D:B\to D$ be a map such that

\begin{displaymath}
\alpha_D\circ F\Rightarrow G\circ\alpha_C
\end{displaymath}
is a natural transformation (in the standard sense). Does this guy have a name?

The reason why I bring this up is that I do not like bigons. Bigons are not a good shape for doing computational geometry, geometric realization, etc. So before I could finally grok what a [[cone]] was, I had to draw a bunch of diagrams. These diagrams were bigons. Yucky!

Thanks Todd. That was a valiant effort, but didn't manage to convince me (I have a thick skull!). I still like this more general definition. Given topological spaces $W,X,Y,Z$, we could also be interested in studying spaces $(W\to X)\Rightarrow (Y\to Z)$. What you described would then be a special case where $W=Y$ and $X=Z$.

Here is my attempt to formalize an alternative definition:


\vspace{.5em} \hrule \vspace{.5em}
\begin{quote}%
\hypertarget{definition}{}\subsection*{{Definition}}\label{definition}

Given categories $A$,$B$,$C$,$D$ and functors $F:A\to B$,$G:C\to D$ a \textbf{natural transformation} $\alpha:F \Rightarrow G$

\begin{displaymath}
\itexarray{
\end{displaymath}

\end{quote}
\begin{verbatim}A 
& 
\stackrel{F}{\to} 
& 
B 
\\ 
\mathllap{\scriptsize{\alpha_C}}\downarrow 
&\mathllap{\scriptsize{\alpha}}\Downarrow & 
\downarrow\mathrlap{\scriptsize{\alpha_D}}
\\ C 
& 
\stackrel{G}{\to} & D \end{verbatim}
\}

\begin{displaymath}
>assigns functors $\alpha_C:A\to C$ and $\alpha_D:B\to D$ called **component functors** and for any morphism $f:x\to y$ in $A$ assigns morphisms $\alpha_x:\alpha_D\circ F(x)\to G\circ\alpha_C(x)$ and $\alpha_y:\alpha_D\circ F(y)\to G\circ\alpha_C(y)$ in $D$ called **component morphisms** such that the following diagram commutes in $D$:
\end{displaymath}
$\backslash$array\{ $\backslash$alpha\_D$\backslash$circ F(x) \& $\backslash$stackrel\{$\backslash$alpha\_D$\backslash$circ F(f)\}\{$\backslash$to\} \& $\backslash$alpha\_D$\backslash$circ F(y) $\backslash$ $\backslash$mathllap\{$\backslash$scriptsize\{$\backslash$alpha\_x\}\}$\backslash$downarrow \&\& $\backslash$downarrow$\backslash$mathrlap\{$\backslash$scriptsize\{$\backslash$alpha\_y\}\} $\backslash$ G$\backslash$circ$\backslash$alpha\_C(x) \& $\backslash$stackrel\{G$\backslash$circ$\backslash$alpha\_C(f)\}\{$\backslash$to\} \& G$\backslash$circ$\backslash$alpha\_C(y) \}

\begin{displaymath}
***

Again, this reduces to the traditional definition when $\alpha_C$ and $\alpha_D$ are identity functors. What do you think? If this doesn't already have a name (it probably does), what would be a good name for it?

_Toby_:  This is exactly what I was talking about at [[ericforgy:Natural Transformation]].  I would call it a __lax commutative square of functors__.

[[Eric]]: Ok, but this seems to be "rotated $45^\circ$" relative to what you said there. Here $\alpha:F\Rightarrow G$ is a map between functors (not composites functors) with distinct domains and codomains having component functors $\alpha_C$, $\alpha_D$ and component morphisms $\alpha_x$, $\alpha_y$. I'm trying to emphasize the map $\alpha:F\Rightarrow G$. Now, I'm trying to think about how I might reinterpret functors in this way so that we can iterate the process to higher degrees.

_Urs_: no, the $\alpha$ the way you defined it _is_ a transformation between the composite functors: it is precisely a natural transformation from $\alpha_D \circ F$ to $G \circ \alpha_C$

_Toby_:  You are right that it is rotated *conceptually*, but what I wrote there was also supposed to be rotated conceptually.  The thing itself is indifferent to being from $F$ to $G$, but once you declare (conceptually) that it is to be something from $F$ to $G$, then what you have is a morphism in an arrow $2$-category, as I wrote there.

[[Eric]]: Thanks Toby. Here is a prepared remark with a comment below:

***

I wrote the definition down intentionally so that the composite _is_ a natural transformation, but I hope I can convince you that $\alpha:F\Rightarrow G$ is _not_ a natural transformation because the domains and codomains of $F$ and $G$ do not coincide (which they must to be a standard natural transformation). I'll call it something else then. How about "sheet transformations"?

>##Definition##

>Given categories $A$,$B$,$C$,$D$ and functors $F:A\to B$,$G:C\to D$ a __sheet transformation__ $\alpha:F \Rightarrow G$
\end{displaymath}
$\backslash$array\{ A \& $\backslash$stackrel\{F\}\{$\backslash$to\} \& B $\backslash$ $\backslash$mathllap\{$\backslash$scriptsize\{$\backslash$alpha\_C\}\}$\backslash$downarrow \&$\backslash$mathllap\{$\backslash$scriptsize\{$\backslash$alpha\}\}$\backslash$Downarrow \& $\backslash$downarrow$\backslash$mathrlap\{$\backslash$scriptsize\{$\backslash$alpha\_D\}\} $\backslash$ C \& $\backslash$stackrel\{G\}\{$\backslash$to\} \& D \}

\begin{displaymath}
>assigns functors $\alpha_C:A\to C$ and $\alpha_D:B\to D$ called **component functors** such that
$$\alpha_D\circ F\Rightarrow G\circ\alpha_C
\end{displaymath}
\begin{quote}%
is a \textbf{natural transformation}.


\end{quote}

\vspace{.5em} \hrule \vspace{.5em}
\begin{quote}%
The thing itself is indifferent to being from $F$ to $G$, but once you declare (conceptually) that it is to be something from $F$ to $G$, then what you have is a morphism in an arrow $2$-category, as I wrote there.


\end{quote}
Interesting! That means a morphism in a arrow 2-category is the same thing as a ``sheet transformation'' (or vice versa :))

Urs: it seems to me what you are getting is is the relation between 2-categories and [[double category|double categories]]: a double category is a gadget whose 2-cells are squares not bigons. Every 2-category yields a double category by precisely the kind of operation that you are describing: take the squares of the double category to be things built from four 1-morphisms and one 2-morphism in the 2-category. Indeed, as a 2-morphism in the 2-category it is something that goes between the composites of the 1-morphisms, but the resulting square itself in the double category is indeed a 2-morphism to be regarded as going from the top horizontal to the bottom horizontal 1-morphism.

\emph{Toby}: Don't you have to talk about a [[double bicategory]] to get something nontrivial to fill the squares? I may have this wrong, but that's how I remember it.

[[Mike Shulman]]: No, a double bicategory is just a double category in which both composition operations are only associative and unital up to isomorphism. Sometimes I feel like ``double categories'' should really have been called ``double 2-categories,'' since they have nontrivial 2-cells. So it is true that what Eric is interested in are just the 2-cells in the double category $Sq(Cat)$ of ``squares'' or ``quintets'' in $Cat$. As such, they have two different composition operations given by pasting.

Another way to describe it is that these are the morphisms in the 2-category $2Cat_{oplax}(\mathbf{2},Cat)$, where for 2-categories $A$ and $B$, $2Cat_{oplax}(A,B)$ denotes the 2-category whose objects are 2-functors $A\to B$ and whose morphisms are [[oplax natural transformations]], and $\mathbf{2}$ denotes the [[walking arrow]]. Thus an object of $2Cat_{oplax}(\mathbf{2},Cat)$ is a 2-functor $\mathbf{2}\to Cat$, i.e. a functor, and a morphism is an oplax natural transformation, which is precisely what you've described. Composition of morphisms in $2Cat_{oplax}(\mathbf{2},Cat)$ is one of the above compositions in the double category $Sq(Cat)$.



\end{document}