C AHIERS DE
TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES
M ARCO G RANDIS
On distributive homological algebra, I. RE-categories
Cahiers de topologie et géométrie différentielle catégoriques, tome 25, n
o3 (1984), p. 259-301
<http://www.numdam.org/item?id=CTGDC_1984__25_3_259_0>
© Andrée C. Ehresmann et les auteurs, 1984, tous droits réservés.
L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
Article numérisé dans le cadre du programme
ON DISTRIBUTIVE HOMOLOGICAL
ALGEBRA,
I. RE-CATEGORIESby
Marco GRANDIS CAHIERS DE TOPOLOGIEET GEOMETRIE DIFFÉRENTIELLE
CATÉGORIQUES
voz . XXV-3 (1984)
R6sum6. Cet article est le
premier
d’une s6rie de trois articles consacr6e aux "th6orieshomologiques
distributives"(comme
lecomplexe
filtr6 ou le doublecomplexe)
et leurs modeles cano-niques.
Ici nous introduisons lesRE-cat6gories,
i.e. descat6go-
ries ordonn6es involutives
g6n6ralisant
lescategories
de rela-tions sur les
categories exactes,
et nous 6tudions leur2-cat6go-
rie RE : celle-ci est strictement
complete,
un faitqui simpli-
fiera notre
approche.
0. Introduction.
0.1. General outline. Exact
categories,
in the sense ofPuppe-Mitchell [20, 18],
and theircategories
of relations are a flexible frame forstudy- ing
basichomological
facts. This series of three works is devoted tostudying
theories with values in exactcategories
and their canonicalmodels, mostly
in the distributive case. A review of resultsappeared
in
[9].
In Part I exact
categories,
moreprecisely
theircategories
ofrelations,
aregeneralized by RE-categories,
i.e. involutive ordered cat-egories satisfying
certain conditions.RE-categories
form a(strictly) complete 2-category RE,
where(strict)
universalproblems
can be solved.Part II will introduce RE-theories and prove the existence of their canonical
models,
via thecompleteness
ofRE ;
this also proves the existence of bicanonical models for theories with values in exactcategories.
Atheory
is distributive if itsclassifying
exactcategory E0
isso
(i.e.
it has distributive lattice ofsubobjects) ;
in this caseE
is an exact
subcateqory
ofI,
the distributive exactcategory
of sets andpartial bijections,
and the canonical model has a setrepresentation.
Part III will
supply
the canonical models for some(distributive)
theories of interest in
homological algebra :
e.g., the bifilteredobject,
the
(discrete
orreal)
filteredcomplex,
the doublecomplex,
the filtereddifferential
object.
Theirclassifying categories
can be "drawn" in the(discrete
orreal) plane, yielding quick "graphic" proofs
of various resultson
spectral
sequences as well as a tool ofinvestigation which,
in theauthor’s
opinion, justifies
the task ofproving (once
forall)
thatthe exhibited models are indeed canonical. For the differential filtered
object
one recovers the Zeemandiagram [231*;’ actually
the need of pre- cise foundations for thatrepresentation
was thestarting point
of thisresearch.
A notion of distributive
homological algebra, concerning
distribu-tive theories in exact
categories (or
inRE-categories)
arises from theabove
approach ;
this notion isalready present
in Zeeman[231,
when he
points
out that the bifilteredcomplex
is not"distributive",
andtraces back to this fact the
difficulty
of thattheory.
Distributive the- ories notonly
stand out forhaving
a setrepresentation,
butalso,
froma
purely algebraic viewpoint,
for thecomposability
of canonical isomor-phisms
betweensubquotients,
which characterizes distributive exactcategories [7].
Last we notice that a non-trivial abeliancategory
is never distributive : the frame of abeliancategories
seems to be toonarrow for
studying
basicproperties
ofhomological systems.
0.2. As
concerning
PartI,
theproblem
we are interested in canbe
guessed
from thefollowing
trivialexample.
The
2-category
EX of exactcategories,
exact functors and nat- ural transformations has no initialobject ;
however any null exact cat- egoryE 1)
is biinitial[22J :
for any exactcategory E
there is an ex-act functor
Ejo -> E,
determined up to aunique isomorphism
of functors2).
More
generally,
any smallgraph A
determines a(strict)
univers-al
problem
fordiagrams -+ E (E
inEX)
which has nosolution,
while itcan be shown that the
corresponding
biuniversalproblem
has a solu-tion
(the
bifree exactcategory generated by A),
which is determined up toequivalence.
It may be remarked thatFreyd’s
Theorem onthe initial
object
cannot beapplied,
because EX is notcomplete [17J.
0.3. As well
known,
this situation isby
no means confined toEX,
butgenerally
occurs for2-categories
formedby categories possessing
certainlimits or colimits and
by
the functors which preserve them(obviously,
up to
isomorphism).
Forexample,
see the canonical models for theories with values intoposes [16].
0.4. However in our case, that is for
EX,
one can observe that the re-quired "limits", essentially
kernels andcokernels,
aresubobjects
andquotients
and thus can be simulatedby
endorelations :just consider,
in-stead of the
subobject
m : M +A(resp.
thequotient
p :A -> P)
the pro-jection
These endorelations do not
present
anyproblem
of choice orquotienta- tion,
since(1)
All the objects are zero-objects, that is initial and terminal ; in other words,Eo
is equivalent to 1.(2) For "weak" limits in 2-categories we use the
terminology
of Street[221
onbilimits.
are
equivalent
monics iffmm = nn ; they
allow to define "--kernels"(6.2)
which arestrictly preserved by (the symmetrization of)
any exact functor.Thus we are led to simulate exactness
by
involutive orderedcategories possessing suitable, uniquely determined, projections;
these areto be
strictly preserved by good
functors.0.5. In
§1, 2,
we consider the2-category
ofRO-categories, i.e., categ-
ories
provided
with aregular
involution and a consistent order. It should be noticed that RO-transformations are lax-riatural.Any RO-category
A can be
fully
embedded in afactorizing
one,Fct(A)y
whoseobjects
arethe
projections
of the former(§ 3).
In § 4,
5 the2-category
RE is introduced : aRE-category
is aRO-category
where anyprojection
has a numerator and a denominator(still projections)
and everyobject
has suitable nullprojections ;
RE-functors
strictly
preserve all that.The connections between EX and RE are studied
in §
6 : anycategory
of relationsRel(E)
on an exactcategory E
isa RE-category ; conversely,
anyRE-category
A isfully
embedded in thefactorizing
RE-category Fct(A),
which isisomorphic
to thecategory
of relations on its propermorphisms Prp
Fct A(a componentwise
exactcategory) :
RE-cat-egories
can be characterized as the fullsubcategories
ofcategories
ofrelations on
componentwise
exactcategories (6.6),
or also as thePrj-full
involutivesubcategories
ofcategories
of relations on exact cat-egories (6.8).
In § 7,
8 we introduce the transfer functorof a
RE-category
A into theRE-category
of modular lattices and modul-ar relations
[10].
We alsostudy transfer, distributive, boolean, idempot-
ent
RE-categories ;
in Parts II and III distributive andidempotent
RE-theories will be the main
object
ofinvestigation.
Last, §9
proves that RE is acomplete 2-category.
0.6. Conventions. We
generally
use Mac Lane’s[15] terminology
for cat-egories
andKelly-Street’s [14, 13, 22]
for2-categories. However,
a sub-object
will be a "chosen monic" rather than a class ofequivalent monics ;
the set of
subobjects (resp. quotients)
of theobject
A in thecategory
C will be writtenSubc (A) (resp. Quo c (A) ).
We
choose,
once forall,
a reference universe U. AU-category
C has
objects
andmorphisms belonging
toU,
while we do notrequire
itto have small
Hom-sets ;
C is small whenever the set ofmorphisms
(and
therefore also the set ofobjects) belongs
to U. We writeU-CAT,
or CAT for
short,
the2-category
ofU-categories,
their functors and their natural transformations.An exact rqtpnnrv F (alwnys in thp sense nf PIJppp-Mitrhp11
[20, 18])
is acategory
withzero-object 0 (initial
andterminal),
inwhich every
morphism
factorizes via a conormalepi
and a normal monic.In
particular
everymorphism
u : A’ -> A" has kernels andcokernels,
which will be written(1)
ker u : Ker u >->A’ ,
cok u : A" ->-> Cok uand assumed to
be, respectively,
asubobject
and aquotient.
A functorbetween exact
categories
is exact whenever it preserves(up
toequival- ence)
kernels and cokernels.For exact
categories
and theircategories
of relations we refer to[20, 18, 3, 4, 2, 5, 7, 8, 10] ;
the last reference contains a short re- view of results. Here an exactcategory
willalways
be assumedto be a
well-powered U-category (hence
alsowell-copowered).
If F : A + B is a 2-functor between
2-categories,
and B an ob-ject
in itscodomain,
an i--universal arrowfrom B to F will be
given by
anobject A.
of A and amorphism b.
ofB such that :
a)
for everymorphism
b : B-> F(A)
in B there is somemorphism
a :
Ao -+ A
in Averifying
b =F(a)bo , b)
for every cellin B there is some cell
in A
verifying 8
=F(a) bo ;
a is determinedby a
1 and a2 -Notice that the condition a is
formally superfluous,
but useful forcheckings.
Themorphism
a :A. -
A in a is determined up to a un-ique isomorphic
cell a of A such thatlb
=F(a) b. ;
theobject Ao
is det-ermined up to
equivalence
in A.Every
2-universal arrow isi-universal,
and every i-universal one isbiuniversal ;
i-universal arrows compose in the usual way.1.
RO-categories.
1.1. An involutive
category
A =(A, -)
is acategory provided
with aninvolution - :
A -> A,
i.e. a contravariantendofunctor,
identical on ob-jects
andinvolutory,
whose result on themorphism
a : A’ -> A" will bewritten a :
A" -> A’. An involutivecategory
is selfdual.Assume now that the involution of A is
regular,
that isa =
aaa
for eachmorphism
a.An
endomorphism
e : A ->A is called aprojection
if itis
symmetrical
andidempotent ( e = e=ee ) ;
anequivalent
condition isThe
projections
of A form a setPrjA(A) canonically
orderedby :
It is well known that the
composition
of e, f EPrj(A)
isalways idempotent :
it is a
projection
iff e and f commute.1.2. Definition. A
RO-category (A, -, )
will be acategory
Aprovided
with a
regular
involution - and with an order relation onparallel
mor-phisms,
consistent withcomposition
and involution. Wealways
assumeA to be a
U-category
with smallprojection-sets ;
notice that these have two orderrelations
and «(1.1.1),
which aregenerally
different.For any exact
category E,
thecategory Rel(E)
of relations onE has such a structure
(see
Calenko[ 3, 4 ] ;
forgeneralizations [2, 5] ;
the smallness of
projection-sets
follows from[5],
Ch.3, III-IV).
A
RO-category (A, -, )
has an obvious2-category structure,
with 2-cellsgiven by ,
y and threeopposite RO-categories :
the firstopposite (A*, - *, ),
the secondopposite (or
orderopposite) (Ag -
,>-),
and the
biopposite (A*, -*, >)
; oneeasily
sees thatare
isomorphic,
and so the other two.In the
following (A, -, ),
or A forshort,
is aRO-category.
1.3. For any
morphism
a : A’ -> A" there are two transfermappings
ofprojections ([6], § 2.17-18):
yielding two projections accociated with a:
which
simulate, respectively,
thecoimage
and theimage
of a(see 3.6.8).
The transfer
mappings preserve
and « : if e = ef inPrj(A’)
thenIf a and b are
composable
1.4.
Owing
to theregularity
of theinvolution,
it is easy to seethat,
for any
morphism
a :a)
a is monic iff it is acoretraction,
iffaa -
1(c(a) = 1), b)
a isepi
iff it is aretraction,
iffag =
1(i(a) = 1),
c)
a is monic andepi
iff it isiso,
iffa
and a arereciprocal
isos.It follows that
epi-monic
factorizations a = a2 a 1 whenexisting,
areunique
up toisomorphism.
1.5. One verifies
easily
that themapping (1) (resp. (2)) :
is an
embedding (resp. anti-embedding)
of ordered sets withregard
to« : in
particular
A iswell-powered
andwell-copowered.
Themappings (1)
and(2)
are consistent with theanti-isomorphism
and will be seen
(3.3)
to besurjective (for
everyobject A)
iff A hasepi-monic
factorizations.In any case, the
projections
of anobject
in aRO-category
A(more generally
in anycategory provided
with aregular involution)
sub-stitute
advantageously
thesubobjects
also when(1)
is abijection,
be-cause the
projections
do notpresent
anyproblem
of choice ofrepresent-
ants or of
quotientation.
1.6. A restriction of A will be an
endomorphism
e : A -> A such that e 1 : it is hence aprojection,
asAll restrictions of A build a small set
Rst(A),
which is a semilattice withregard
tocomposition:
if e, f ERst(A)
then ef 1 is arestriction,
hence a
projection
andmoreover and « coincide on
Rst(A) :
if e f thenconversely,
if e °° f thenAnalogously,
the corestriction e : A->A,
e ?1,
form a semilatticeCrs(A)
CPrj(A),
in which e f iff e °° f .1.7. A
morphism
u: A’ ->A" of theRO-category A
is proper if :These
morphisms
form asubcategory Prp(A)
ofA,
non-closedunder the
involution,
whose induced order is trivial :because
In the above
example A
=Rel(E) (1.2),
one recovers the firstcategory :
1.8. A
morphism
a : A’ -> A" is said to be nullif,
for every a’: A"-> A’,
aa’a = a. Null
morphisms
form an ideal N =Nul(A)
of A(the composi-
tion of any
morphism
with a null one isnull).
Other trivialproperties ((7)
follows from(5), (6)
and(2)) :
1’) We shall always suppose that the construction of
Rel(E)
is carried out so that thisequality
holds.for any a for any a :
(7)
if u, v : A’ ->+ A" are proper andnull,
then u = v.1.9. An
object A.
is said to be null if it has aunique endomorphism,
that is if its
identity
isnull ;
ifA.
and Al are nullobjects,
connected inA
4),
there existunique isomorphisms A0 -> A 1
:actually,
two suchmorphisms
arenecessarily reciprocal.
Any morphism
which factorizesthrough
a nullobject (hence by
anull
identity)
is a nullmorphism.
2. The
2-category
RO.2.1. A RO-functor F : A -> B is a functor between
RO-categories,
whichpreserves involution and order. It also preserves :
projections
and theircanonical order «, transfer
mappings
the
operators
c andi,
monics andepis,
restrictions andcorestrictions,
proper
morphisms.
It need not preserve nullmorphisms
and nullobjects (a counterexample
with A = 1 can beeasily given).
A faithful RO-functor F reflects
projections
and their canonicalorder, monics, epis, isos,
nullmorphisms
and nullobjects.
A RO-functor F : A + B has a restriction
Prp
F:Prp A -> Prp B ;
on the other
hand,
azero-preserving
functorF 0 : E -> E’
between exactcategories
extends to a RO-functor F :Rel(E) +Rel(E’)
iffFo
is exact([5]y
Theorem6.15);
in such a case F is(trivially) uniquely determined,
and will be written
Rel(F 0).
2.2. A
RO-square
of A will be a squarediagram
inA,
of thefollowing type :
where the second and third condition are
equivalent (when
the firstholds) :
ifva bu,
then(4)
In the involutivecategory E
this simply means thatA(Ao,Al)
is not empty.Obviously, RO-squares
can becomposed, horizontally
and verti-cally ;
the verticalcomposition
has a verticalinvolution,
which isregular 5).
By 1.7.2,
theRO-square (1)
is commutative when a and bare proper.2.3. A RO-transformation
between
pprallel
RO-functors F and G is afamily (a A)AEObA satisfying : a)
for any A E ObA,
oc A : FA - GA is a propermorphism, b)
for every a : A’ -> A" inA,
thefollowing
square isR06) O6)
Remark that the square
(1)
is commutative when a EPrp
A(2.2) :
thusthe RO-transformation a determines a natural transformation
with
(Prp a)A
= aA,
on anyobject
A.2.4. RO-transformations have an obvious vertical
composition : given
another RO-transformation
we
get
by
verticalcomposition
ofRO-squares.
The verticalcomposition
ofRO-transformations is
associative,
and has obvious identitiesRemark that the RO-transformation
(5)
Thecategory
of RO-squares of A and vertical composition has an obvious RO- structure, which yields the cotensor product2 y A ([13];
see also 9.6).(6)
In other words a is lax-natural according to[14, 12J
("quasi-natural" accord- ing to[11]).
is an
isomorphism
between F and G(with regard
to the vertical compo-sition)
iff thefollowing
conditions hold :(2)
for anyobject A,
a A isiso ,
inB,
(3)
for anymorphism
a : A* -> A" the square 2.3.1 is commutative in B.Actually,
thesufficiency
of thesebeing obvious,
suppose thatis
reciprocal
to a ;then,
for anyobject A,
a A andBA
arereciprocal isos,
and for anymorphism
a : A’ -> A" thecommutativity
of 2.3.1follows from :
2.5. RO-transformations have also a horizontal
composition :
ifis RO take for any A :
where the second
equality
comes from the squarewhich is commutative
because y
is RO and a A is proper. Nowis
RO, by
the horizontalcomposition
ofRO-squares.
The horizontal
composition
of RO-transformations isassociative,
and has identities
2.6.
RO-categories,
RO-functors andRO-transformations,
with the hor- izontal and verticalcompositions,
buildobviously
a2-category
RO(or
also
U-RO) :
the"interchange
law" and other axioms areeasily
verified,
in the same way that in CAT.There is a canonical 2-functor
which has
already
been defined in1.7,
2.1 and 2.3.2.7. Let EX
(or U-EX)
denote thesub-2-category
of CATconsisting
ofexact
categories (0.6),
exact functors and natural transformations. There is also a 2-functorwhose
composition
withPrp :
RO -> CAT is the inclusion. It hasalready
been considered on
objects (1.2)
andmorphisms (2.1). Now,
ifis a 2-cell in
EX,
takeso that
(Rel a)A
isalways
proper ; for any a ERel E(A’, A")
the"quat-
ernary factorization" a =
nqpm ([5J], § 1.5), yields the following
commut-ative
diagram
ofE’ :
a fortiori all the squares are
RO-squares ; by
vertical involution and verticalcomposition (2.2),
onegets
theRO-square
2.3.1.2.8. Remark. In any
RO-category
the order betweenmorphisms is
det-ermined
by
its restriction toprojections,
in thefollowing
way : a b iffActually,
if a b :conversely,
if(1)
holds :Analogously :
a = b iff2.9. It follows that an involution
preserving functor F : A +B
betweenRO-categories
is a RO-functor iff itpreserves
betweenprojections ;
moreover a RO-functor is faithful iff it reflects
idempotent
endomor-phisms (from endomorphisms)
and is faithful onprojections.
3.
Factorizing RO-categories.
A is
always
aRO-category.
3.1. We say that the
RO-category
A isfactorizing (or FRO-category )
if any
morphism
a has anepi-monic
factorization a = a2a,(necessarily unique
up toisomorphism, by 1.4) ;
thenwhich also proves that if a is proper, we have an
epi-monic
factoriza-tion of a in
Prp
A.These
categories
determine asub-2-category
FRO of RO.3.2. If e : A -> A is an
endomorphism
in theRO-category A,
withepi-
monic factorization e = mp, it is easy to
verify
that :a)
e isidempotent
iff pm=1,
b)
e is aprojection
iff p =m,
c)
e is a restriction iff p = m and. m EPrp A, d)
e is a corestriction iff p = m and p EPrpA.
3.3.
Proposition.
Thefollowing
conditions areequivalent : a)
A isfactorizing,
b)
for anyobject A,
theembedding
1.5.1 :is an
isomorphism
of ordered sets(with regard
to«).
c)
for anyobject A,
theanti-embedding
1.5.2 :is an
anti-isomorphism
of ordered sets(with regard to « ).
Proof. a => b
by 3.2 ;
b =>cby
theanti-isomorphism 1.5.3 ;
c =>a : ifa : A -> A’ is a
morphism
andc(a)
=pp (
p EQuo(A)),
thenand
ap
is monic since3.4. Lemma. Consider the
(possibly non-commutative) diagram (1)
in theRO-category
A :where u, v are proper and a = a2ai, b =
b2b,
areepi-monic
factoriza-tions. Then the outer square is RO
(i.e.,
vabu )
iff there exists aproper
morphism W
such that the inner squares are so ; in such a caseProof. First suppose that the outer square is
RO,
and take w =blual ;
then
Conversely,
if there exists a propermorphism w
such that theinner squares are
RO,
theglobal
square is so and :3.5. We associate to any
RO-category
A aFRO-category F’ct(A) ,
whichwill be seen
(3.8)
tosatisfy
the obvious i-universalproblem.
Theobjects
of Fct A are theprojections
ofA,
itsmorphisms
are thetriples :
The
composition,
involution and order in Fct A areobviously :
3.6. So Fct A is a
RO-category,
and :(a ;
e,f)
is aprojection
iff e =f,
a is aprojection
and a a e,(a ;
e,f)
is monic iffc(a) =
e ,epi
iff1 (a) = f,
theprojection (e ; f, f)
is a restriction iff ef,
a
corestriction iffe>f, (a ;
e,f)
is proper iffc(a) ?
e andi(a) f,
(a ;
e,f)
is null iff a is null in A.Moreover Fct A has
epi-monic
factorizations :where we write
3.7. It is now easy to define a 2-functor
so
that, for any
RO-transformationa :(7 )
Equivalently : a - fae.We
verify only
that Fct a isreally
a RO-transformation from Fct F to FctG ; actually
themorphism (3)
is proper in Fct 8by 3.6.6,
andwhile every
(a ;
e,f)
inFct(A) supplies
thefollowing RO-square
inFct B
(where
A’ = Dom e, A" = Domf) :
3.8. The canonical full
embedding
of anyRO-category
A in Fct Agives
a 2-natural transformationn: 1 ->
T.Fct : RO ->RO,
where T :FRO -> RO is the inclusion.
Moreover
(1)
is an i-universal arrow(0.6)
from theobject
Ato the 2-functor T.
Actually,
every RO-functor F :A +T(B)
towards aFRO-categ-
ory extends to a RO-functor G :
Fct(A) ->B,
in thefollowing
way. For anyprojection
e’ ofB,
choose amonomorphism m,,
so that e’ =m,, (m,, )(3.2 b)
and take :Thus,
G is a RO-functorwhich extends
F,
as we assume thatmls = Is
for eachobject
B of B.Suppose
now thatis a
RO-transformation,
and thatGi : Fct(A) -> B
extendsFi ( i
=1, 2).
For each e E
Prj(A)
theepi-monic
factorization of(e ;
1 A,lA)
inFct(A) :
is transformed
by Gi
into anepi-monic
factorization oftherefore, by 3.4,
there is aunique
propermorphism
of Bsuch that the inner squares of
(7)
areRO-squares :
hence a
unique
FRO-transformation y:G
-G2 such that y. n A = p.3.9. It is easy to see that this functor G is faithful iff F is iso.
Now,
if theRO-category
A isfactorizing
it follows(by taking
F = 1
A)
that there is a faithful functor G : Fct A -> A which is a retrac- tion(G. Tl A
=lA ) :
A and Fct A areequivalent categories.
4.
RE-categories.
We introduce here our
generalization
of(the categories
of rel-ations
on)
exactcategories, essentially
based on the fact that in a RO-category Rel(E)
everyprojection
e : A ->A is associated with asubquo-
tient
H/K
of A withregard
to E[5],
hence it has a numeratorand a denominator
the latter is also determined
by
the associated corestrictionThe null restriction
and the null corestriction
will also be of interest.
4.1. Definition. A
RE-category
is atriple
A =(A,- , ) satisfying : (RE.O)
A is aRO-category,
(RE.1)
for everyprojection
ea)
there existsexactly
one restrictionn(e) (the
numerator ofe)
such that e °° ne e.
b)
there existsexactly
one corestrictiondC(e) (the c-
denominator of e8))
such thate°° dce >
e.(RE.2) Every object
A has a null restrictionwA
and a null corestrictionQ A (unique by 1.8.5-6).
The order
duality (1.2)
turns numeratorsinto c-denominators
and null restrictions into null corestrictions.
4.2. Lemma. In the
RO-category
Asatisfying (RE.1),
withProof.
(1)
(2) : obvious ; (3) :
iff > 1,
ne is the numerator of theprojection efe,
since efe °° ne e efe..
4.3. Lemma. In the
RO-category
Asatisfying (RE.1),
thefollowing
con-ditions on a, b E
A(A’, A")
areequivalent : a)
ab,
b)
there exist e eRst(A’)
and f ECrs(A")
such that fa =be, c)
there exist e ERst(A’)
and f ECrs(A")
such that(8)
Thedenominator,
a restriction, will be defined in 4.8.Proof. It is obv ious that d => c => b => a ; a => d :
4.4.
Proposition.
If A is aRO-category satisfying (RE.1),
and e , f inPrj(A) :
Proof. The
right-hand equivalences
follow from 1.6.a)
If e « f theprojections (1.6) :
verif y
hence
(4.2.2)
Conversely,
when these conditions hold :and :
and
applying
4.2.3 to the first and last term of(4)
onegets :
that is
ne °° nf ; by
orderduality, dce °° dcf .
The converseproperty
fol- lows at once from 4.2.1.4.5. A
RO-category
A satisfies(RE.2)
iff it satisfies thefollowing
con-dition :
(RE.2’)
for everyobject
A there existendomorphisms wA’ S2a :
A -> A such that :
a)
for everyendomorphism a : A -> A, wA a Q A
Actually, (RE.2) implies (RE.2’)
via1.8.5-6 ; conversely
if a andb
hold,
thenwA
1A S2A
and for any a’ : A -> A :We notice also that the
object A
is null(1.9)
iff1A = W A,
iff1A =QA, iff w A= QA.
4.6. From now on A is a
RE-category.
IfNrp(A)
is the set of null pro-jections z
of theobject A,
orderedby ,
there are biunivocal corresp- ondences :which, by 4.4,
preserve the orders .Actually,
for e ERst(A)
and z ENpr(A) :
4.7.
By composing 4.6, 1-2,
onegets
a biunivocalcorrespondence :
which
preserves (hence
reverses « ). Inparticular :
It should be noticed that
this C-duality
between restrictions and corestrictions of aRE-category
A isgiven by
the wholeRE-structure,
and has little to do with the order
duality (which
turns restrictions of A into corestrictions of itsorder-opposite RO-category, preserving
theorder « ).
It will be seen(6.1.5)
thatthe c-duality
extends the(ker-cok)- duality
betweensubobjects
andquotients,
in an exactcategory.
4.8. This
duality supplies,
for anyprojection
e EPrj(A),
a denominatord(e)
ERst(A)
and a c-numerator!2C(e)
ECrs(A) :
where the
right equality
in(1)
follows from4.7.1, 4.6.1,
4.2.4 :4.9.
Proposition.
For e EPrj(A)
and a : A’ ->A" :c)
theprojections
e’ = de and e" = n c e arerespectively
charac-terized
by (1)
and(2) :
Proof.
a)
b)
If e isnull,
de =n(e we) =
ne;conversely
if de - ne, thenc)
e’ = ne verifies(1) by
a ;conversely
anyprojection
e’ satis-fying (1)
coincides with de =n(e we)
since(4.2.2)
itsproduct with dC(ewe)=
= ewe is ewe
4.10.
Every morphism
a : A’ -> A" of theRE-category
A determines thefollowing
restrictions of its domain andcodomain,
which we call defini-tion, values,
indetermination : .so that
a is monic il
a is proper i
a is null iff
It will be seen in 6.2
that,
when A is acategory
of relationsRel(E), def(a)
simulates theE-subobject
def(a): Def(a)
>-> A’[5 ],
andso on.
4.11. Let A be
a RE-category :
for every connectedobjects A’,
A" there exist
unique
w A’ A",QA’A", 0A’A" £ A(A’, A")
such that :(1)
for each I-(2)
for each aEquivalent
characterizations are :indeed,
take some a and def ine :Then the
properties (1)-(3’)
areeasily verified,
while theuniqueness
isobvious or follows from 1.8.
4.12. As a consequence of 1.9 and
4.11,
any nullobject
in a connectedRE-category
A is azero-object (i.e.,
initial andterminal)
forPrp
A.We shall see that such
objects necessarily
exist when A is alsofactorizing
and
non-empty.
5. RE-functors and RE-transformations.
A and B are
RE-categories.
5.1. Definition. A RE-functor will be a RO-functor F : A -> B between
RE-categories,
which satisfies thefollowing equivalent
conditions :a)
F preserves nullmorphisms, b)
for anyobject A, F(wA)
= WFA,c)
for anyobject A, F(PA ) = QFA,
d) for any cnnected pair A’, A": FwA’,A")-wRA’,FA:
e)
for any connectedpair A’,
A" :F( QA, A") E2FA1,FA"
ff)
for any connectedpair A’,
A" :F(0A’A"-
=0FA’
,FA",g)
F preserves theoperators n, dC , d, nc, def,
ann,val,
indand Qduality.
5.2. Let F : A+ B be an
involution-preserving
functor(between
RE-cat-egories) ;
it is easy to see that :a)
F preserves the order iff it preserves restrictions and cores- trictions(from 4.3),
b)
if A isfactorizing,
F preserves the order iff it preserves pro- permorphisms (from
a and3.2),
c)
if A isconnected,
with a nullobject Ao,
F preserves nullmorphisms
iffF(Ao)
is null in B.5.3. Definition. A RE-transformation will be a RO-transformation
between RE-functors.
Thus,
we haveRE,
asub-2-category
of RO.5.4. Lemma. Let F : A -> B be a
RE-functor,
and a, b EA(A’, A");
thenFa Fb iff there exist
a’, b’
EA(A’, A")
such thatProof. The condition
(1)
isclearly sufficient ; conversely,
ifFa
F bby
4.3 d :and therefore it suffices to take
5.5.
Corollary.
A faithful RE-functor F : A + B reflects the order bet-ween
parallel morphisms ;
it also reflects propermorphisms
and null mor-phisms ;
moreover, whenacting
onendomorphisms,
it reflects restric- tions and corestrictions.(9) Here
a’ -F
b’ means that a’ and b’ are parallel maps and Fa’ = Fb’.5.6. It follows from 5.2 a and 5.5
that,
ifare RE-structures on the same involutive
category (A, -)
and moreoverthe restrictions and corestrictions of A 1 are still so in
A2 ,
then A1 = A2.The same condition
holds,
afortiori, if 1 implies 2 .
It can be noticed
that,
ifA1 = (A, -)
is a non-nullRE-categ-
ory
(has
some non-nullobject),
then A1 itself and its orderopposite A 2
=(A, -,>,
are different RE-structures onLA, -),
becauseWA#
Q A forevery non--null
object
A(4.5).
5.7.
A RE-subcategory
A’ of A is an involutivesubcategory satisfying : (1)
for each A E Ob A’ and each e EPrj
A(A),
theprojections n( e) , dc(e),
wA,QA belong
to A’.Then A’ will be
provided
with the inducedRE-structure,
thatis the
only
one which makes the inclusion A’ - A a RE-functor.It should be noticed that any full
subcategory (more generally
anyPrj-full
involutivesubcategory (5.11))
of aRE-category is
a RE-sub-category,
and any intersection ofRE-subcategories
is so.5.8. If A is a
subgraph
ofA,
theRE-subcategory
of Aspanned by
A isthe intersection A’ of all
RE-subcategories
of Acontaining A ;
A’ isgiven by :
where the sets
An
C Mor A areinductively
defined as :(3’)
if a Eb:.n ,
thena
EAn+1
(3")
ifa, b
EAn
arecomposable
inA,
then(3"’)
if e 6An
is aprojection
ofA,
thenThis proves that
card(Mor A’) max(card(Ob A), card(Mor A), N0).
Any
two RE-functorsF,
G : A + B which coincide on A coincide alsoon A’.
5.9. A RE-functor F : A +C is called a
RE-quotient
if it isbijective
on the
objects
andfull ; by
5.4 the RE-structure on C(i.e., composition,
involution and
order)
is then determinedby
the one ofA,
andby
F.Analogously,
if F : C -> B is a faithfulRE-functor,
the RE-structure of C is determined
by
the one ofB, by
themapping
F andby
the domain and codomain
mappings
of C(by 5.5).
5.10.
Any
RE-functor F : A -> B has anessentially unique
RE-factoriza- tionwhere
Fi
1 is aRE-quotient
andF2
is a faithful RE-functor. To prove theexistence,
consider the(usual)
CAT-factorization of F[10] : F1
is aquotient
andF2
a faithfulfunctor ;
then define the involution on C viaF1 (F1 (a) - = Fl (a) )
and the order via F2 : rc c’ iff
they
areparallel
in C andF2(c)
F2(c’)
inB ;
C is thus a
RO-category
and(1)
a factorization in RO.Now,
any e inPrj C(F1A)
is theF1-image
of some e EPrj A (A) : actually,
ifthen
thus the existence of numerators and c-denominators of
projections
ofC comes from
A,
while theiruniqueness
comes fromB ;
last Flsupplies
the null restrictions
( w )
and the null corestrictions( Q )
ofC,
and F2preserves them.
5.11. The RE-functor F : A - B will be said to be
Prj-full (resp. Prj - faithful )
if for any A E Ob A themapping
is
surjective (resp. injective) ;
any full(resp. faithful)
functor is so.Analogously
one can define Rst-fullRE-functors,
and so on.However,
thefollowing
conditions on the RE-functor F :A -* B, having
RE-factorization F =F2F1 ,
areequivalent :
a)
F isPrj-full, b)
F isRst-full,
c) F2
isPrj-full (and Prj-faithful), d) F2
is Rst-full(and Rst-faithful).
In
fact,
a => c and b => d areobvious,
while c => d follows from 5.5 and 4.7.Analogous
results hold for the "local" faithfulness of F andF 1 .
We also remark that a Rst-faithful RE-functor reflects the order «of
projections,
hence also their order(4.4) ;
it also re-flects
monics, epis, isos,
propermorphisms,
nullmorphisms (4.10.7-9).
6. Exact
categories
andRE-categories.
6.1. Main Theorem. Let A =
(A,
N,)
be aRO-category
and E =Prp
A.Then the
following
conditions areequivalent :
a)
A is afactorizing, connected, non-empty RE-category.
b)
E is exact and theembedding
E ->A is(isomorphic to)
thecanonical
symmetrization
ofL,
that is theembedding E - Rel(E).
If these conditions
hold,
for any e EPrj A (A) (notations
as in(4) Ao
is a zeroobject
for E iff it is a nullobject
for A.(5)
there are commutative squares of orderisomorphisms (->)
and anti-isomorphisms (-- ->),
withregard
to - :Proof. First we prove b => a, as well as
properties (1)-(5).
We can sup- pose that A -Rel(E)
isprecisely
theRO-category
of relations on the exactcategory
E =Prp
A : thus A istrivially
connected andnon-empty (so
isE)
andfactorizing [5].
Asregards (RE.l) :
if e EPrj(A), then ([5],
§ 5.21),
are proper
morphisms,
so thatconversely,
ifthen
(3.2)
where n is monic and p is
epi
in E(and
inA) ;
now,is a
coternary
factorization ofe([5]y §
5.15) so thatin other words
are
uniquely determined,
and two formulas in(1)-(2)
are checked.Now,
the axiom(RE.2)
istrivially
satisfiedby assuming (3),
and(4)
is a consequence of 4.12. Let usverify (5) :
letthen
commute([5], §
5.21.1-2) andby 4.9.1,
e =d(f)
=fc.
The other two formulas in(1)-(2)
followeasily ;
for
example,
:Conversely,
let a be assumed. First we prove that A has some null ob-ject ;
if A is anobject,
consider theepi-monic
factorization of0A A
in A :then
hence
A,
is null in A and azero-object
inE (4.12).
Weproceed
now to
verify Puppe’s
axioms(Kl-3) [201,
to ensure b.The first follows