\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 kernel}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{enriched_category_theory}{}\paragraph*{{Enriched category theory}}\label{enriched_category_theory}

[[!include enriched category theory contents]]

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

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{generalized_kernels_and_their_quotients}{Generalized kernels and their quotients}\dotfill \pageref*{generalized_kernels_and_their_quotients} \linebreak
\noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak
\noindent\hyperlink{factorization_systems}{Factorization systems}\dotfill \pageref*{factorization_systems} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


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

In an [[Ab-enriched category]], it is natural to produce an [[image]] factorization of a morphism by first forming its [[kernel]] and then the [[cokernel]] of the kernel. Similarly, in a [[regular category]] we can produce an image factorization by first forming the [[kernel pair]] and then the [[coequalizer]] of the kernel pair. Several similar situations arise in the study of [[2-categories]] as well. The theory of \textbf{generalized kernels} in [[enriched categories]] subsumes all of these examples.

\hypertarget{generalized_kernels_and_their_quotients}{}\subsection*{{Generalized kernels and their quotients}}\label{generalized_kernels_and_their_quotients}

Let $V$ be a [[cosmos]] and let $\mathbf{2}$ denote the [[interval category]] regarded as a $V$-category, i.e. it has two objects $0$ and $1$, with $hom(0,0) = hom(1,1) = hom(0,1) = I$ (the unit object of $V$) and $hom(1,0) = \emptyset$ (the initial object of $V$). Let $H$ be a $V$-category which contains $\mathbf{2}$ as a full subcategory, and let $J$ be the full subcategory of $H$ containing all the objects except $1$. Then the inclusions of $J$ and $\mathbf{2}$ into $H$ induce a [[profunctor]] $K\colon \mathbf{2} &#8696; J$. This is the input data for a notion of kernels.

Now suppose that $C$ is a $V$-category with sufficiently many limits and colimits, and that $f\colon x\to y$ is a morphism in $C$. Then $f$ can be identified with a $V$-functor $\ulcorner f \urcorner \mathbf{2}\to C$. The \textbf{kernel} of $f$ is defined to be the $K$-[[weighted limit]] of $\ulcorner f \urcorner$, which is a $V$-functor $ker(f)\colon J\to C$. By construction of $K$, it can equivalently be described as the (enriched, pointwise) right [[Kan extension]] of $\ulcorner f \urcorner$ from $\mathbf{2}$ into $H$, followed by restriction to $J$. Since the inclusion of $\mathbf{2}$ into $H$ is fully faithful, it follows that $ker(f)(0) = \ulcorner f \urcorner (0) = x$.

Similarly, let $M$ be a $V$-functor $J\to C$; we call such a functor \textbf{kernel data}. The \textbf{quotient} of $M$ defined to be its $K$-weighted colimit. This is a functor $\mathbf{2}\to C$, i.e. a single morphism in $C$. Again, by construction of $K$, the quotient of $M$ can equivalently be described by the left Kan extension of $M$ to $H$, followed by restriction to $\mathbf{2}$, and since $J\to H$ is fully faithful, the source of the quotient of $M$ is the object $M(0)$.

Since colimits and limits weighted by a fixed profunctor are adjoint to each other (or equivalently, since left and right Kan extension are left and right adjoint to restriction), we obtain an adjunction

\begin{displaymath}
quot: [J,C] \;\rightleftarrows\; [\mathbf{2},C] :ker
\end{displaymath}
Moreover, by the remarks above, for any object $x\in C$ this adjunction restricts to an adjunction

\begin{displaymath}
quot: [J,C]_x \;\rightleftarrows\; x/C :ker
\end{displaymath}
where $[J,C]_x$ denotes the subcategory of $[J,C]$ on those functors $M$ such that $M(0)=x$. Of course the analogous subcategory $[\mathbf{2},C]_x$ is just the [[coslice category]] $x/C$.

Of particular interest is the [[counit]] of this adjunction at a morphism $f\colon x\to y$, which is a morphism $quot(ker(f)) \to f$ in $x/C$. In other words, it is a \emph{factorization} of $f$. Often the factorizations produced in this way are familiar.

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

\begin{enumerate}%
\item With $V=Set$, let $H$ be the category

\begin{displaymath}
z \;\rightrightarrows\; 0 \to 1
\end{displaymath}
with the two composites $z\to 1$ being equal. That is, $H$ is the ``[[walking structure|walking]] fork.'' Then kernel data is a pair of parallel arrows, the kernel of a morphism is its [[kernel pair]], and the quotient of a parallel pair is their [[coequalizer]]. In a [[regular category]], the factorization produced in this way is the usual [[image]] factorization.

Note that since coequalizers are epic, the full image of $quot\colon [J,C] \to [\mathbf{2},C]$ is a preorder, and thus in this case the adjunction is [[idempotent adjunction|idempotent]]. This yields the familiar fact that a morphism is a coequalizer iff it is the coequalizer of its kernel pair, and a parallel pair is a kernel pair iff it is the kernel pair of its coequalizer.


\item Again with $V=Set$, let $H$ be the category

\begin{displaymath}
\itexarray{ 0 \\ & \searrow \\ z & \to & 1 }
\end{displaymath}
Then kernel data is just a pair of objects, the kernel of a morphism $f\colon x\to y$ is the pair $(y,x)$, and the quotient of a pair $(y,x)$ is the [[coproduct]] injection $x \to (x\sqcup y)$. The factorization of $f\colon x\to y$ obtained in this way is $x \to (x\sqcup y) \overset{[f,id]}{\to} y$.


\item With $V=Ab$, let $H$ be the [[Ab-enriched category]] with three objects $z,0,1$ and $H(z,z) = H(0,0) = H(1,1) = H(z,0) = H(0,1) = \mathbb{Z}$ and all other hom-groups being $0$. Then a diagram of shape $H$ in an Ab-category consists of a pair of composable arrows whose composite is zero. Then kernel data is also just a single morphism, the kernel of a morphism is its [[kernel]] in the usual sense, and the quotient of a morphism (considered as kernel data) is its [[cokernel]] in the usual sense. The resulting factorization is again the usual image factorization, and the adjunction is again idempotent.


\item With $V=Cat$, let $H$ be the (strict) [[2-category]] with three objects $z,0,1$ and $H(0,1) = *$, $H(z,1) = \mathbf{2}$, and $H(z,0)$ the ``[[walking structure|walking]] [[parallel pair]]'' $(\cdot \rightrightarrows \cdot)$. Then kernel data in a 2-category consists of a pair of parallel 2-cells, and the quotient of such a pair is their [[coequifier]]. In $Cat$ at least, the kernel $f\colon x\to y$ of a functor is the category of parallel pairs in $x$ which become equal in $y$, and the resulting factorization of $f$ consists of an bijective-on-objects-and-full functor followed by a faithful one. Since bijective-on-objects-and-full functors are epic in $Cat$, the adjunction is again idempotent.


\item Again with $V=Cat$, let $H$ be the 2-category with three objects $y,0,1$ and $H(0,1)=*$, $H(y,0)$ the discrete category with two objects, and $H(y,1)=\mathbf{2}$. Then kernel data is a pair of parallel 1-morphisms, and the quotient of such a pair is their [[coinserter]]. The kernel of a morphism $f\colon x\to y$ is the [[comma object]] $(f/f)$.


\item Once again with $V=Cat$, let $H$ be the 2-category

\begin{displaymath}
\itexarray{ && 0\\ & \nearrow & \cong & \searrow \\ z && \to && 1}
\end{displaymath}
Then kernel data is again a single arrow, its quotient is its pseudocolimit, and the kernel of a morphism is its pseudolimit. The resulting factorization is one of the ones arising in the [[canonical model structure]] on any 2-category.


\item Continuing with $V=Cat$, let $H$ be the 2-category on $z,0,1$ with $H(0,1)=*$, $H(z,0) = \mathbf{2}$, and $H(z,1)$ the [[walking structure|walking]] [[isomorphism]]. Then kernel data is a 2-cell, and its quotient is its [[coinverter]]. The kernel of a morphism is sometimes called its [[invertee]]. Since coinverters are epic, the adjunction is idempotent: thus a morphism is a coinverter iff it is the coinverter of its invertee, and a 2-cell is an invertee iff it is the invertee of its coinverter.


\item Finally with $V=Cat$, let $H$ be the 3-truncated augmented [[simplex category]] with additional 2-cells added, in such a way that kernel data is \emph{codescent data} and the quotient of such data is a [[codescent object]]. Then the factorization produced in $Cat$ consists of a bijective-on-objects functor followed by a fully faithful one.



\end{enumerate}
\hypertarget{factorization_systems}{}\subsection*{{Factorization systems}}\label{factorization_systems}

In some of the above examples, the resulting factorization of a morphism is not what one would hope for. In particular, it need not give a [[factorization system]] of any kind. However, the adjunction does induce a [[comonad]] $Q_1 = quot \circ ker$ on $[\mathbf{2},C]$ such that $dom(Q_1(f)) = dom(f)$. This is the ``left half'' of the factorization obtained in this way; the ``right half'' $R_1$ is merely a [[pointed endofunctor]] such that $cod(R_1(f)) = cod(f)$. The [[algebra for an endofunctor|algebras]] for $R_1$ are usually what one would hope for as the ``right class'' of the (weak) factorization systems intuitively associated to the above examples.

Now this data is exactly the required input for the construction of a \emph{free} [[algebraic weak factorization system]]. If $C$ is sufficiently well-behaved (such as [[locally presentable category|locally presentable]]), then this free nwfs exists, and gives the factorizations we would hope for in most cases. It is constructed by (possibly transfinite) iteration, i.e. we take the quotient of the kernel, then take the quotient of the kernel of the right half of the resulting factorization, and so on. The resulting monad $R$ is usually [[free monad|algebraically-free]] on $R_1$, and thus the $R$-[[algebra for a monad|algebras]] are again just what we would expect.

For example, in the coinverter-invertee example above, the right clas of the factorization system produced in this way consists of [[conservative functor|conservative]] functors.

\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item [[kernel]], [[cokernel]]


\item \textbf{generalized kernel}



\end{itemize}
\hypertarget{references}{}\subsection*{{References}}\label{references}

This sort of idea has been thought of by various people at various times. The above version, especially the view of factorization systems, is a slight modification of one presented by [[Richard Garner]] to the Sydney category seminar in February 2010. Other references include

\begin{itemize}%
\item Betti, Schumacher, and [[Ross Street|Street]], ``Factorizations in bicategories'' (unpublished)


\item Betti, ``Adjointness in descent theory'', JPAA


\item [[Mathieu Dupont]], \emph{Abelian categories in dimension 2}, \href{http://arxiv.org/abs/0809.1760}{arXiv:0809.1760}, section 1.2.2



\end{itemize}
[[!redirects generalized kernels]] [[!redirects generalized cokernel]] [[!redirects generalized cokernels]]



\end{document}