\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*{generalized Gray tensor product}

\hypertarget{idea}{}\section*{{Idea}}\label{idea}

For any $n$, the category $Str n Cat$ of [[strict n-categories]] is [[cartesian closed category|cartesian closed]]. If $C$ and $D$ are strict $n$-categories, the objects of the [[exponential object]] $D^C$ are strict $n$-functors $C\to D$, its morphisms are \emph{strict} $n$-natural transformations, and likewise its higher cells are \emph{strict} higher [[transfors]].

On the other hand, one expects the weak $(n+1)$-category $n Cat$ of [[weak n-categories]] to be cartesian closed in the $(n+1)$-categorical sense, so that one has equivalences of hom-$n$-categories

\begin{displaymath}
n Cat(C\times D, E) \simeq n Cat(C, Hom(D,E)).
\end{displaymath}
In this case, $Hom(D,E)$ should consist of weak functors, pseudo transformations (which are natural up to coherent [[equivalence]]), and pseudo higher transfors. Note that although $C\times D$ (probably) means the same thing in the strict and weak worlds, $D^C$ and $Hom(D,E)$ are not the same, and in general not even [[equivalence of categories|equivalent]].

Gray tensor products are part of the general philosophy of trying to understand weak higher structures without getting bogged down in the theory of weaker higher-er structures. One instance of this philosophy is the use of [[model categories]] (or more general types of [[homotopy theory]]) to use strict functors to model weak ones. Although not every weak functor is equivalent to a strict one (already when $n=2$), one expects this to become true if the domain is suitably [[cofibrant object|cofibrant]]. This is a theorem for small values of $n$ and can be regarded as a definition of ``weak functor'' for large values of $n$; see the [[folk model structure]] for 2-categories and \href{http://www.dpmms.cam.ac.uk/~rhgg2/Womaps/Womaps.html}{this paper}.

Gray tensor products attempt to extend this to deal with weak $k$-transfors for $k\gt 0$, starting with pseudo (or lax or oplax) natural transformations, by equipping higher categories of some sort with a non-cartesian [[monoidal category|monoidal]] and/or [[closed category|closed]] structure. This began with John Gray, who showed that the category $Str2Cat$ is a non-symmetric [[closed monoidal category]] in which one internal-hom $Lax(C,D)$ consists of [[strict 2-functors]], [[lax natural transformations]], and [[modifications]] (the other contains oplax transformations instead). A straightforward modification produces a closed symmetric monoidal structure based on \emph{pseudo} natural transformations; the monoidal product is now called the [[Gray tensor product]].

Later various authors constructed analogous tensor products for [[strict ∞-categories]] and strict $\omega$-groupoids, here called the [[Crans-Gray tensor product]]. Here the internal-homs consists of strict $\omega$-functors and lax/oplax $k$-transfors for $k\gt 0$. (It appears to be unknown whether there is a pseudo version.)

\hypertarget{the_problem}{}\section*{{The Problem}}\label{the_problem}

The (pseudo version of the) Gray tensor product of 2-categories is used to define [[Gray-categories]], which are a version of [[semistrict n-category|semistrict]] 3-categories. This is very convenient because Gray-categories are just [[enriched category|categories enriched]] over $(Str2Cat,\otimes_{Gray})$, so that all of enriched category theory applies to them (as it does to 2-categories, being categories enriched over $Cat$). Thus, it is natural to hope that one might be able to iterate this process, defining a ``Gray tensor product'' of semistrict $n$-categories and then defining semistrict $(n+1)$-categories to be categories enriched over semistrict $n$-categories.

However, there is a problem:

\begin{itemize}%
\item \emph{No category $SS n Cat$ of [[algebraic definition of higher category|algebraic]] $n$-categories with weak [[interchange law|interchange]] and strict functors can admit a [[closed category|biclosed structure]] that contains non-strict transformations.}

\end{itemize}
Now there are lots of adjectives in this statement; for now just notice that the progression ``categories, 2-categories, Gray-categories, Gray-cat-categories?'' \emph{is} producing categories of algebraic $n$-categories with weak interchange and strict functors. So if this no-go statement is true, then Gray-cat does not admit a biclosed structure of the desired sort, and Gray-cat-categories probably can't be defined correctly.

To see why this no-go statement holds, imagine some hypothetical algebraic notion of semistrict $n$-category with weak interchange, and consider what sort of transformation (that is, 1-transfor) we want to model. Let $C$ and $D$ be semistrict $n$-categories and $F,G:C\to D$ (strict) functors; then a transformation $\alpha:F\to G$ should probably consist of

\begin{itemize}%
\item components $\alpha_x: F(x) \to G(x)$,
\item equivalences $\alpha_f: G(f) \circ \alpha_x \simeq \alpha_y F(f)$ for $f:x\to y$,
\item and higher data,
\item satisfying axioms.

\end{itemize}
Now the question is, how is $\alpha_{g f}$ related to the composite of $\alpha_g$ and $\alpha_f$? For pseudonatural transformations between 2-categories, they are equal (both being 2-cells, there is no room for anything weaker). For a ``fully weak'' notion of transformation in higher dimensions, one might expect them to be only equivalent---but for the sorts of transfors used in the internal-hom for the Crans-Gray tensor product of $\omega$-categories, it turns out that they are also \emph{equal}. In fact, if the transformations are to give us a biclosed category of $n$-categories and strict functors, it turns out that they \emph{must} be equal.

Consider the following: a transformation $F\Rightarrow G: C\to D$ should be the same as a functor $2 \to [C,D]$ where $2$ is the [[interval category|interval]] $n$-category. But if we are to have a closed category $SS n Cat$, giving such a functor should be equivalent to giving a functor $C\to [2,D]$. (This doesn't depend on symmetry, but if things are not symmetric then $[-,-]$ means something different in the two cases.) Now inspection of how this would work reveals that the relationship of $\alpha_{g f}$ to $\alpha_g$ and $\alpha_f$ in the first picture corresponds to the \emph{functoriality} of $C\to [2,D]$ in the second picture. That is, if $\alpha_{g f} = \alpha_g . \alpha_f$ (and so on) then the functor $C\to [2,D]$ is a strict functor, while if it is only equivalent, then $C\to [2,D]$ will be only a weak functor. Hence, if we allow only strict functors, then all our transformations must be ``semistrict'' in the sense that $\alpha_{g f} = \alpha_g . \alpha_f$.

Now, however, we meet the second horn of the dilemma: in an $n$-category with weak interchange, semistrict transformations need not be composable! Suppose that $\alpha: F \to G$ and $\beta: G\to H$ are semistrict transformations. Then we can define the components of a transformation $\beta.\alpha:F\to H$ in the obvious way, but is it semistrict? If you try to prove that it is, you'll find that you need a strict interchange law. (There is a pentagon involving all the ways to compose a 2x2 grid of square 2-cells, a picture of which can be found in Crans' paper cited below.) So we are stuck.

What can we do? Well, for one thing, the theorem is only about \emph{closed} structures, not about \emph{monoidal} structures. And Sjoerd Crans did manage to construct a non-closed ``Gray-like'' monoidal structure on Gray-cat. But it's not clear whether the resulting notion of ``Gray-cat-category'' is in fact semistrict (i.e. whether arbitrary 4-categories could be strictified to them).

Another way to escape would be to allow weak functors. This is not much good all by itself, since algebraic $n$-categories and weak functors do not generally form very good categories. They don't have many limits and colimits, for one thing, and the theory of enriched categories isn't much good when the enriching category doesn't have limits and colimits. However, if we instead use a [[geometric definition of higher category]], then we can get well-behaved 1-categories containing weak functors. And it is known for many nonalgebraic notions of higher category that there are good Gray-like tensor products; in fact, in many cases it is actually the cartesian product (an important exception being the lax version of the [[Verity-Gray tensor product]] of weak complicial sets). This is one reason why non-algebraic notions of higher category are very attractive.

Finally, a third escape that suggests itself would be to look for a notion of algebraic semistrict $n$-categories which nevertheless has strict interchange. As far as I know, the only work on strictly interchanging semistrict categories is one nonalgebraic notion which depends on weak units. The prospects for algebraic notions don't seem that appealing, however, since the whole idea of the Gray-approach was to build in the semistrictness via the iterated enrichment, but while it is easy to imagine weakening interchange this way, it is hard to see how this could produce strict interchange but weak units.

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

\begin{itemize}%
\item [[Sjoerd Crans]], \emph{A tensor product for $Gray$-categories} (\href{http://www.tac.mta.ca/tac/volumes/1999/n2/5-02abs.html}{TAC})


\item [[Joachim Kock]], \emph{Weak identity arrows in higher categories} (semistrict categories with weak units): \href{http://arxiv.org/abs/math/0507116}{math/0507116}


\item [[Michael Batanin]], Denis-Charles Cisinski, Mark Weber, \emph{Algebras of higher operads as enriched categories II} (\href{http://arxiv.org/abs/0909.4715}{arXiv})



\end{itemize}


\end{document}