CategoricalSequence 2009-01-26 22:36:18 2009-01-26 22:36:18 Definition homological sequence categorical sequence homological sequence % it should be fine as is for beginners. % almost certainly you want these \usepackage{amssymb} \usepackage{amsmath} \usepackage{amsfonts} % define commands here \usepackage{amsmath, amssymb, amsfonts, amsthm, amscd, latexsym,color,enumerate} \usepackage{xypic} \xyoption{curve} \usepackage[mathscr]{eucal} %the next gives two direction arrows at the top of a 2 x 2 matrix \newcommand{\directs}[2]{\def\objectstyle{\scriptstyle} \objectmargin={0pt} \xy (0,4)*+{}="a",(0,-2)*+{\rule{0em}{1.5ex}#2}="b",(7,4)*+{\;#1}="c" \ar@{->} "a";"b" \ar @{->}"a";"c" \endxy } \theoremstyle{plain} \newtheorem{lemma}{Lemma}[section] \newtheorem{proposition}{Proposition}[section] \newtheorem{theorem}{Theorem}[section] \newtheorem{corollary}{Corollary}[section] \newtheorem{conjecture}{Conjecture}[section] \theoremstyle{definition} \newtheorem{definition}{Definition}[section] \newtheorem{example}{Example}[section] %\theoremstyle{remark} \newtheorem{remark}{Remark}[section] \newtheorem*{notation}{Notation} \newtheorem*{claim}{Claim} \theoremstyle{plain} \renewcommand{\thefootnote}{\ensuremath{\fnsymbol{footnote}}} \numberwithin{equation}{section} \newcommand{\Ad}{{\rm Ad}} \newcommand{\Aut}{{\rm Aut}} \newcommand{\Cl}{{\rm Cl}} \newcommand{\Co}{{\rm Co}} \newcommand{\DES}{{\rm DES}} \newcommand{\Diff}{{\rm Diff}} \newcommand{\Dom}{{\rm Dom}} \newcommand{\Hol}{{\rm Hol}} \newcommand{\Mon}{{\rm Mon}} \newcommand{\Hom}{{\rm Hom}} \newcommand{\Ker}{{\rm Ker}} \newcommand{\Ind}{{\rm Ind}} \newcommand{\IM}{{\rm Im}} \newcommand{\Is}{{\rm Is}} \newcommand{\ID}{{\rm id}} \newcommand{\GL}{{\rm GL}} \newcommand{\Iso}{{\rm Iso}} \newcommand{\Sem}{{\rm Sem}} \newcommand{\St}{{\rm St}} \newcommand{\Sym}{{\rm Sym}} \newcommand{\SU}{{\rm SU}} \newcommand{\Tor}{{\rm Tor}} \newcommand{\U}{{\rm U}} \newcommand{\A}{\mathcal A} \newcommand{\D}{\mathcal D} \newcommand{\E}{\mathcal E} \newcommand{\F}{\mathcal F} \newcommand{\G}{\mathcal G} \newcommand{\R}{\mathcal R} \newcommand{\cS}{\mathcal S} \newcommand{\cU}{\mathcal U} \newcommand{\W}{\mathcal W} \newcommand{\Ce}{\mathsf{C}} \newcommand{\Q}{\mathsf{Q}} \newcommand{\grp}{\mathsf{G}} \newcommand{\dgrp}{\mathsf{D}} \newcommand{\bA}{\mathbb{A}} \newcommand{\bB}{\mathbb{B}} \newcommand{\bC}{\mathbb{C}} \newcommand{\bD}{\mathbb{D}} \newcommand{\bE}{\mathbb{E}} \newcommand{\bF}{\mathbb{F}} \newcommand{\bG}{\mathbb{G}} \newcommand{\bK}{\mathbb{K}} \newcommand{\bM}{\mathbb{M}} \newcommand{\bN}{\mathbb{N}} \newcommand{\bO}{\mathbb{O}} \newcommand{\bP}{\mathbb{P}} \newcommand{\bR}{\mathbb{R}} \newcommand{\bV}{\mathbb{V}} \newcommand{\bZ}{\mathbb{Z}} \newcommand{\bfE}{\mathbf{E}} \newcommand{\bfX}{\mathbf{X}} \newcommand{\bfY}{\mathbf{Y}} \newcommand{\bfZ}{\mathbf{Z}} \renewcommand{\O}{\Omega} \renewcommand{\o}{\omega} \newcommand{\vp}{\varphi} \newcommand{\vep}{\varepsilon} \newcommand{\diag}{{\rm diag}} \newcommand{\desp}{{\mathbb D^{\rm{es}}}} \newcommand{\Geod}{{\rm Geod}} \newcommand{\geod}{{\rm geod}} \newcommand{\hgr}{{\mathbb H}} \newcommand{\mgr}{{\mathbb M}} \newcommand{\ob}{\operatorname{Ob}} \newcommand{\obg}{{\rm Ob(\mathbb G)}} \newcommand{\obgp}{{\rm Ob(\mathbb G')}} \newcommand{\obh}{{\rm Ob(\mathbb H)}} \newcommand{\Osmooth}{{\Omega^{\infty}(X,*)}} \newcommand{\ghomotop}{{\rho_2^{\square}}} \newcommand{\gcalp}{{\mathbb G(\mathcal P)}} \newcommand{\rf}{{R_{\mathcal F}}} \newcommand{\glob}{{\rm glob}} \newcommand{\loc}{{\rm loc}} \newcommand{\TOP}{{\rm TOP}} \newcommand{\wti}{\widetilde} \newcommand{\what}{\widehat} \renewcommand{\a}{\alpha} \newcommand{\be}{\beta} \newcommand{\ga}{\gamma} \newcommand{\Ga}{\Gamma} \newcommand{\de}{\delta} \newcommand{\del}{\partial} \newcommand{\ka}{\kappa} \newcommand{\si}{\sigma} \newcommand{\ta}{\tau} \newcommand{\lra}{{\longrightarrow}} \newcommand{\ra}{{\rightarrow}} \newcommand{\rat}{{\rightarrowtail}} \newcommand{\oset}[1]{\overset {#1}{\ra}} \newcommand{\osetl}[1]{\overset {#1}{\lra}} \newcommand{\hr}{{\hookrightarrow}} \newcommand{\hdgb}{\boldsymbol{\rho}^\square} \newcommand{\hdg}{\rho^\square_2} \renewcommand{\leq}{{\leqslant}} \renewcommand{\geq}{{\geqslant}} \def\red{\textcolor{red}} \def\magenta{\textcolor{magenta}} \def\blue{\textcolor{blue}} \def\<{\langle} \def\>{\rangle} \begin{definition} A \emph{categorical sequence} is a \emph{linear `diagram' of morphisms, or arrows, in an abstract category}. In a concrete category, such as the category of sets, the categorical sequence consists of sets joined by set-theoretical mappings in linear fashion, such as: \[ \cdots \rightarrow A\buildrel f \over \longrightarrow B \buildrel \phi \over \longrightarrow Hom_{Set}(A,B), \] where $Hom_{Set}(A,B)$ is the set of functions from set $A$ to set $B$. \end{definition} \subsection{Examples} \subsubsection{The chain complex is a categorical sequence example:} Consider a ring $R$ and the \emph{chain complex} consisting of a sequence of \PMlinkname{$R$-modules}{Module} and homomorphisms: \[ \cdots \rightarrow A_{n+1} \buildrel {d_{n+1}} \over \longrightarrow A_n \buildrel {d_n} \over \longrightarrow A_{n-1} \rightarrow \cdots \] (with the additional condition imposed by $d_n\circ d_{n+1} = 0$ for each pair of adjacent homomorphisms $(d_{n+1}, d_n)$; this is equivalent to the condition $\im d_{n+1} \subseteq \ker d_n$ that needs to be satisfied in order to define this categorical sequence completely as a \emph{chain complex}). Furthermore, a sequence of homomorphisms $$\cdots \rightarrow A_{n+1} \buildrel {f_{n+1}} \over \longrightarrow A_n \buildrel {f_n} \over \longrightarrow A_{n-1} \rightarrow \cdots $$ is said to be {\it exact} if each pair of adjacent homomorphisms $(f_{n+1}, f_n)$ is \emph{exact}, that is, if ${\rm im} f_{n+1} = {\rm ker} f_n$ for all $n$. This concept can be then generalized to morphisms in a \PMlinkname{categorical exact sequence}{ExactSequence2}, thus leading to the corresponding definition of an \PMlinkexternal{exact sequence}{http://planetmath.org/encyclopedia/ExactSequence2.html} in an Abelian category. \begin{remark} Inasmuch as categorical diagrams can be defined as functors, exact sequences of special types of morphisms can also be regarded as the corresponding, special functors. Thus, exact sequences in Abelian categories can be regarded as certain functors of Abelian categories; the details of such functorial (abelian) constructions are left to the reader as an exercise. Moreover, in (commutative or Abelian) homological algebra, an \PMlinkname{exact functor}{ExactFunctor} is simply defined as a functor $F$ between two Abelian categories, $\mathcal{A}$ and $\mathcal{B}$, $F: \mathcal{A} \to \mathcal{B}$, which preserves categorical exact sequences, that is, if $F$ carries a short exact sequence $0 \to C \to D \to E \to 0$ (with $0, C, D$ and $E$ objects in $\mathcal{A}$) into the corresponding sequence in the Abelian category $\mathcal{B}$, ($0 \to F(C) \to F(D) \to F(E) \to 0$), which is also exact (in $\mathcal{B}$). \end{remark}