A NOTE ON FREE REGULAR AND EXACT COMPLETIONS AND THEIR INFINITARY GENERALIZATIONS
HONGDE HU AND WALTER THOLEN
Transmitted by Michael Barr
ABSTRACT. Free regular and exact completions of categories with various ranks of weak limits are presented as subcategories of presheaf categories. Their universal properties can then be derived with standard techniques as used in duality theory.
Introduction
A category Awith nite limits isregular(cf. 2]) if every morphism factors into a regular epimorphism followed by a monomorphism, with the regular epimorphisms being stable under pullback it isexactif, in addition, equivalencerelations are e ective, that is, if every equivalence relation in A is a kernel pair. It was noted by Joyal that, in the de nition of regular category, one may replace \regular epimorphism" by the weaker notion of \strong epimorphism" in the sense of Kelly 11].
In 4] Carboni and Magno presented a one-step construction of the free exact comple- tionCexof a categoryCwith nite limits (=lex), in terms of so-called pseudo-equivalence relations. Recently, Carboni and Vitale 5] have constructed the free regular completion
C
reg of C with weak nite limits (= weakly lex), and the free exact completion Aex=reg
for a regular category A, so that Cex can be obtained as (Creg)ex=reg for C with weak nite limits. The objects of Creg are given by nite sources (fi : X ! Xi)i2I of arrows in C, and the morphisms are de ned to be equivalence classes of suitably compatibleC- morphisms between the domains of the given sources. Also for Aex=reg the description of objects is simple, asA-objects with a xed equivalence relation, while morphisms are less easily described: they are given by relations between the underlyingA-objects satisfying certain compatibility conditions with the structure-preserving equivalence relations.
Quite a di erent approach to Cex for C weakly lex and C small was given by Hu 9]
who generalized a result by Makkai 14]: the exact completionCexis given by the category
C
+ =QFilt(C Set)
of product- and ltered-colimit-preserving set-valued functors on
Partial nancial assistance by the Natural Sciences and Engineering Research Council of Canada is acknowledged.
Received by the editors 31 January 1996 and, in revised form, 4 December 1996.
Published on 18 December 1996
1991 Mathematics Subject Classi cation : 18A35, 18E10, 18G05.
Key words and phrases: regular category, exact category, regular completion, exact completion, at functor, accessible category.
c Hongde Hu and Walter Tholen 1996. Permission to copy for private use granted.
113
C
= Flat(C Set)
the category of at functors on C note thatC is a nitely accessible category since C is small, and that it has products sinceC is weakly lex. We show here that for any category
C with nite limits, Creg and Cex are full subcategories of C+ with some additional properties (see Remark 2.5).
In a talk in the Sydney Category Seminar in February 1995, Max Kelly proposed to make better use of the Yoneda embedding
y :C!(Cop Set)
when constructing Creg and Cex. Because of the correspondences X ;!Yi
y(X);!y(Yi) y(X);!Y
i2Iy(Yi) y(X);!e A;m!Y
i2Iy(Yi)
(with e being a regular epimorphism and m being a monomorphism) the Carboni-Vitale construction suggests to take as objects of Creg those F 2 (Cop Set) which appear at the same time as quotients of representables and as subobjects of nite products of rep- resentables.
This paper outlines Kelly's construction ofCreg and shows that Cex may be described conveniently within (Cop Set) as well, as Kelly had anticipated in his talk: take those F 2 (Cop Set) which admit a regular epimorphism e : y(X) ! F whose kernel pair K is again covered by a representable functor, so that there is a regular epimorphism y(Y )! K. The proof that Cex constructed this way is indeed nitely complete remains a bit laborious, but we nd it convenient that most proofs reduce to checking closedness properties of Creg and Cex within the familiar presheaf environment, which allows to present the intrinsic connection between both categories more directly.
We also stress the point that it takes no additional e ort to prove all results for a category C with weak -limits, rather than just weak nite limits here is a regular in nite cardinal or the symbol1. Recall that a (weak) -limit inC is a (weak) limit of a diagram D : J ! C with #J < , which in case = 1 simply means that J must be small. Then the notion of regularity and exactness must be \- ed" as follows: C is -regular (-exact) if C is regular (exact), has -limits, and if -products of regular epimorphisms are regular epimorphisms. Note that for =@0, the latter property comes for free:
f g = (f idD)(idAg) : AC !BD
is the composition of a pullback ofg with a pullback of f. Notice furthermore that -Barr- exactness in the sense of 13] and 9] implies-exactness 1-regular is called \completely regular" in 5].
A simple description of Cex with C co-accessible is also given at the end of the pa- per. We show that for a co-accessible category C with weak limits, the objects of Cex are exactly all those F 2 (Cop Set) which admit a regular epimorphism into F with representable domain.
Acknowledgment: We thank Enrico Vitale for detecting a gap in an earlier version of the proof of Theorem 3.4. We are also grateful for valuable comments by Max Kelly and the anonymous referee.
1. Flat Functors
Let be an in nite regular cardinal or the symbol1. A categoryCis said to beweakly- completeif it has weak-limits, i.e., for any -diagram D : I !C (so that the morphism set of I has cardinality less than which, in case = 1, just means that I must be small), a weak limit of D exists in C.
1.1. Definition. (9]) Let C be a weakly -complete category, and B a category with -limits. A functor F :C !B is called -at, if for any -diagram G : I !C, and for each weak limit cone (fi : D ! G(i))i2I on G, the morphism k : F(D)! limF G with F(fi) =pi k for all i2I, is a regular epi here the morphisms pi are limit projections.
1.2. Remark. (i) ForC small, and B the category Set of sets, as pointed out in 9], F is -at i it is a - ltered colimit of representable functors.
(ii) For B having (regular epi, mono)-factorization, we notice that F is -at i there is a cone (fi :D !G(i))i2I on G with F(fi) =pik as in 1.1, so that k is a regular epi.
(iii)@0-at functors were called left covering functors in 5].
1.3. Proposition. For any locally small category C, let y : C ! (Cop Set) be the Yoneda embedding. If C is weakly -complete, then y is - at.
Proof. Follows from 1.1 and the fact that a morphism a : M ! N in (Cop Set) is regular epi i aC :M(C)!N(C) is surjective for each C 2C.
1.4. Proposition. Let F :C!B be any functor. If C and B have -limits, then F is - at i it preserves -limits.
Proof. One only needs to show that a -at functor F preserves -limits, that is, equal- izers and -products. Since similar proofs can be found in 7] and 5], we can omit the proof here.
1.5. Proposition. For any weakly -complete category C, the category C (= ; Flat(C Set)) of set-valued - at functors has products. Moreover, for an innite reg- ular cardinal, C has -ltered colimits.
Proof. Let (Fi)i2I be a small family of functors of C. Since Fi is -at, for any - diagram G : J ! C, the morphism ki : Fi(D) ! limFi G is surjective for each i 2 I.
Therefore, the morphism Qki : QFi(D) ! QlimFi G is surjective. QlimFi G is isomorphic to limQFi G in Set, so we have that C is closed under products in (C,
Set).
Suppose that is an in nite regular cardinal. Let M : I !C be a- ltered diagram.
Since M(i) is -at, the morphism ki : M(i)(D) ! limM(i)G is surjective for each i 2 I here G : J ! C is a -diagram. For any u 2 colimJlimI M(i) G, there are i 2 I and ui 2 limM(i)G such that u = fi(ui) with fi the colimit injection. Denote colimIlimJM(i)G by Q, and consider the following commutative diagram:
colimM(i)(D)
M(i)(D)
Q
limM(i)G k -
6
fi
6
fi(D)
ki-
where k is a morphism induced by the family hkiii2I. Each ki is surjective, so there is x 2 M(i)(D) such that ki(x) = ui we let y = fi(D)(x) and we have k(y) = u. Since - ltered colimits commute with -limits inSet,Q is isomorphic to limJcolimIM(i)G.
Therefore,C is closed under - ltered colimits in (C Set).
2.
Cregand
Cex2.1. Definition. Let y : C ! (Cop Set) be the Yoneda embedding. A functor F :
C op
! Set is weakly representable if there is a regular epimorphism y(C) ! F with C in C we also say that F is regularly covered by C or y(C) in this case. We dene extensions C;reg and C;ex of C as follows, for any weakly -complete category C:
(i) C;reg is the full subcategory of (Cop Set) whose objects are these weakly repre- sentable functors which are subfunctors of -products of representable functors.
(ii) C;ex is the full subcategory of(Cop Set)of functorsF such that there is a regular epimorphism e : y(C) !F whose kernel pair (m n : G!y(C)) has the property that G again is weakly representable.
Since we keep xed, we shall writeCreg,Cex for C;reg, C;ex, respectively.
2.2. Remark. Given B 2 Creg, we have a mono m : B !Qi2Iy(Ci) with #I < . Let the pi's be the projections of the product Qy(Ci), and let (u v : A ! B) be the kernel pair of a regular epi e : y(D) ! B with D 2 C. Then A is a limit of the family of (pime pime)i2I. By 1.3, A can be regularly covered by y(S), where S is a weak limit of the family (pi me pime). Thus, Creg is a full subcategory of Cex.
2.3. Theorem. If C is weakly -complete, then Creg is -regular, and Cex is -exact moreover, the inclusions from Creg and Cex into (Cop Set) are-regular.
Proof. Step 1. Creg has -products.
Let (Fi)i2I be a family of objects of Creg with #I < . If, in (Cop Set), Fi is a subobject of the product Qj2Iiy(Cj), then QFi is a subobject of the product of all
Qj2Iiy(Cj), with i 2 I. If the morphisms pi : y(Di) ! Fi are regular epis, also Qpi :
Qy(Di) ! QFi is a regular epi. Let Q be a weak product of all Di in C by 1.1, the unique arrow y(Q)!Qy(Di) is a regular epi. Consequently, we have a regular epi from y(Q) onto QFi. This shows that QFi is in Creg.
Step 2. Creg has equalizers.
Let (u v : M ! N) be a pair of arrows in Creg, and m : P ! M be an equalizer of u and v in (Cop Set). P is a subobject of M, and M is a subobject of a -product of representable functors, so P is a subobject of the product. To show that P can be regularly covered by a representable functor, let s : y(C) ! M and t : y(D) ! N be regular epis. Letm0:P0 !y(C) be an equalizer of us and vs. We then have a unique arrow w : P0!P making the following diagram a pullback:
P0
P
y(C)
M m0 -
?
s
?
w
m -
wherew is a regular. Also, P0can be regularly covered by a representable functor. Indeed, let k : N ! Qi2Iy(Bi) be mono, and qi : Qy(Bi) ! y(Bi) be the product projections.
Then P0 is a joint equalizer of the family (qi us qivs : y(C) ! y(Bi))i2I. Since C and Bi are in C and since y is full and faithful, we can write y(ui) = qius and y(vi) =qivs. By 1.2, P0is regularly covered byy(W) here W is a weak joint equalizer of the family (ui vi :C !Bi)i2I.
This completes the proof that Creg has -limits.
Step 3. Cex has -products.
Let (Fi)i2I be in Cex, with #I < . There are regular epis pi : y(Di) !Fi such that the kernel pair Mi of pi
Mi fi
;;!
;;!
gi y(Di) p;;!i Fi
can be regularly covered by some y(Bi). Given the regular epis qi : y(Bi) ! Mi (for all i), then also Qqi : Qy(Bi) ! QMi is a regular epi. So QMi is regularly covered by y(W) here W is a weak product of the family of Bi. Mi is a subobject of the product y(Di)y(Di), soQMi is a subobject of the product of ally(Di)y(Di). This shows that
QMi is inCreg. Let s : y(Z)!Qy(Di) be a regular epi hereZ is a weak product of Di.
Thus, we have the regular epi Qpis : y(Z)! QFi. Forming pullbacks, we obtain the following diagram:
y(Z) G H
Qy(Di)
QMi
G0
QFi
Qy(Di) y(Z)
b0 - -
g
b - Qfi-
s - Qpi-
?
a0
?
f
?
a
? Qgi
?
s
? Qpi
Note that y(Z), QMi and Qy(Di) are in Creg. Hence, also H is in Creg and can be regularly covered by a representable functor. But H is the domain of the kernel pair of the regular epi Qpis. This shows thatQFi is in Cex.
Step 4. Cex has pullbacks.
Case 1. First we deal with the case of a kernel pair
M f
;;!
;;!
g y(D) p;;!G
of a regular epi p : y(C) ! G with G 2 Cex such that M is regularly covered by a representable functor. Also, M is a subobject of the product y(C)y(C), so M 2Creg. From Remark 2.2, we have that M is in Cex.
Case 2. For arrows s : y(A) ! G and t : y(B) ! G with G 2 Cex, we can write s = ps0 and t = pt0 for the regular epimorphismp of Case 1. We form the following diagram of pullbacks:
H - M -y(B)
? ? ?
t0
N - G0 -y(C)
? ? ?
p
y(A) s0 -y(C) p - G
Since G0, y(A) and y(B) are in Creg, so is H. Thus, H is in Cex, i.e., the pullback of s and t is in Cex.
Case 3. For any arrows s : F ! G and t : F0 ! G of Cex, let p : y(A) ! F and q : y(B)!F0 be regular epis. We form the following diagram of pullbacks:
H - M -y(B)
? ? ?
q
N - G0 - F0
? ? ?
t
y(A) p - F s - G
As in Case 2,H is in Creg. Also, G0is regularly covered byH as p and q are regular epis.
Say that e : H !G0is the regular epi given by the diagram, and m : G0!FF0 is the mono determined by the pullback of s and t. Note that F F0 is in Cex. We form the kernel pair of me:
H0 u
;;!
;;!
v H m;;;;;e!FF0
That H0 can be regularly covered by a representable functor follows from the same prop- erty for H. Also, H0 is a subobject of H H, so H0 2Creg. This shows that the kernel pair ofe is in Creg. Using the same argument as in Step 3, we can show that G0 is inCex. This completes the proof that Cex has pullbacks.
Step 5. Every kernel pair of any morphism in Creg has a coequalizer.
In fact, let (u v : M ! N) be the kernel pair of f : N ! G in Creg. Take the coequalizer of u and v:
M u
;;!
;;!
v N g;;!G0 Then G0 is a subobject of G. Thus, G0 is in Creg.
Step 6. Every equivalence relation in Cex has a coequalizer.
Let (u v : M ! N) be an equivalence relation of objects in Cex, and g : N ! G be the coequalizer of u and v in (Cop Set) we show that G is in Cex, as follows. Given the regular epi s : y(A)!N, we form the following diagram of pullbacks:
H - M00 -y(A)
? ? ?
s
M0 - M u - N
? ?
v
?
g
y(A) s - N g - G
Sincey(A), N and M are in Cex, so isH. Thus, the kernel pair H of the regular epi gs is regularly covered by a representable functor. This shows thatG is in Cex.
Finally, that regular epis in Creg and Cex are stable under pullback and under - products follows immediately from the corresponding properties of (Cop Set).
2.4. Corollary. Let k : C ! Creg and l : C ! Cex be the restricted Yoneda embed- dings. If C is weakly -complete, then
(i) k and l are- at
(ii) for every C 2 C, k(C) and l(C) are regularly projective in Creg and Cex, respec- tively
(iii) for each A 2Cex, there areC 2C and a regular epi l(C)!A inCex. Moreover, A is in Creg i A is a subobject of a -product of objects in C.
Proof. By 1.3 and 2.3.
2.5. Remark. (i) In the next section we only use the properties of 2.4 to show the universal properties of Creg and Cex. Consequently, these are necessary and sucient conditions describing the free regular and exact completions ofC.
(ii) For any weakly-complete category, C of 1.5 has products. Let
Q(C Set)
be the category of set-valued functors preserving products. Then Q(C Set) is 1-exact, since products commute with regular epimorphisms and limits in Set. Consider the evaluation functor
eC:C !Q(C Set)
It is clear that eC is full and faithful. From 2.3 and (i) above, Cex is equivalent to the full subcategory of Q(C Set) whose objects F are covered by a regular epimorphism eC(C)! F whose kernel pairs have the same property again. Likewise, we can describe
C
reg as a full subcategory of Q(C Set).
(iii) For an in nite regular cardinal, let
C
+ =QFilt(C Set)
be the category of set-valued functors preserving products and - ltered colimits. C+ is -exact, as - ltered colimits commute with regular epimorphisms and -limits in Set. Therefore,Creg and Cex can be described as full subcategories of C+ as in (ii).
3. Universal properties of
Cregand
Cex3.1. Proposition. Let C be a weakly -complete category. With k and l as in 2.4 one has:(i) If B is-regular, then every - at functor F :C!B has a left Kan extension F!
along k, and F! preserves regular epimorphisms.
(ii) If B is -exact, then every - at functor F :C!B has a left Kan extension F!
along l, and F! preserves regular epimorphisms.
Proof. We only give the proof of part (ii), as (i) can be done in the same manner. For convenience, we assume thatl is the inclusion functor.
The proof here follows the same argumentation as in 3.5 of 9]. For the existence of F!, by the dual of Theorem X.3.1. in 12], it suces to show that the composite F P : l=C0 !C !B has a colimit in B for each C02 Cex, where P is the projection
hC C ! C0i 7!C. Since C02Cex, we have a regular epimorphisme : A!C0 withA in
C. Let
D u0
;;!
;;!
v0 A
be the kernel pair ofe so e is the coequalizer of (u0 v0), and there is a regular epimorphism d : S !D with S 2C. Then e is a coequalizer of the morphisms (u0d v0d). Denote u0d by u, and v0d by v. De ne a categoryE whose only non-trivial arrows are
e u
;;!
;;!
v eu
Leti :E !l=C0 be the inclusion functor. One then has:
3.2. Lemma. i is nal.
Proof. Firstly, f=i is non-empty, for any f : C ! C0 with C 2 C. Indeed, by the projectivity of C, there is a morphism w : C !A such that f = ew.
To show that f=i is connected, let m n be any two morphisms in f=i. Then we only need to consider the following three cases.
Case 1: m n : f ! e, i.e., em = en = f. Since hu0 v0i is the kernel pair of e, there is a unique morphism k0 : C ! D such that m = u0k0 and n = v0k0. By the
projectivity ofC , we obtain a morphism k : C !S with k0=dk. Thus, m = uk and n = vk, i.e., u : k !m and v : k !n here k : f !eu is in f=i.
Case 2: m n : f ! eu, i.e., eu0dm = ev0dn = f. Since hu0 v0i is the kernel pair of e, there is a unique morphism k0 : C ! D such that u0dm = u0k0 and v0dn = v0k0. By the projectivity of C, we have a morphism k : C ! S with k = dk0. We conclude thatum = uk and vn = vk. Thus, we have four morphisms u : m!uk, u : k !uk, v : n!vk, and v : k !vk joining m and n.
Case 3: m : f !e and n : f ! eu. By the projectivity of C, there is a morphism m0:f !eu such that m = um0, because u is regular epi. Thus, we have morphisms m0 n : f ! eu. That f=i is connected now follows from Case 2. This completes the proof of that f=i is connected.
We continue with the proof of 3.1. Sincei is nal, according to Theorem IX.3.1 in 12], to prove that F! exists, we only need to show that the pair of morphisms (F(u) F(v)) has a coequalizer inB.
Let (p q) be the product projections of F(A)F(A), and let : F(S)!F(A)F(A) be the unique morphism so that F(u) = p and F(v) = q. Since B is{exact, has a factorization = yx with y : Q!F(A)F(A) mono and x : F(S)!Q regular epi, for someQ2B.
3.3. Lemma. y is an equivalence relation on F(A).
Proof. (i) (Reexivity) The diagonal :F(A)!F(A)F(A) factors through y.
Let k0:A!D be the morphism so that idA =u0k0=v0k0. Since S is projective, one obtains a morphismk : A!S with k0=dk, hence idA =uk = v k. It follows that
idF(A) =F(u)F(k) = pyxF(k) = qyxF(k):
Consequently, = y(xF(k)):
(ii)(Symmetry) There exists a morphism t : Q ! Q such that py = q yt and qy = pyt. Let (1 2) be the product projections of AA, and let m : D !AA be the induced morphism of (u0 v0). Since the kernel pair of a morphism always yields an equivalence relation, there exists n : D ! D such that 1 m = 2 m n and 2m = 1 mn. Since d : S !D is regular epi, by the projectivity of S, there is a morphismn0:S!S such that nd = dn0. Thus, we have1mdn0 =2md and 2mdn0=1md, i.e., un0 =v and vn0 =u. Applying F to the above equalities, we obtain F(u)F(n0) =F(v) and F(v)F(n0) =F(u). Hence
pyxF(n0) =qyx and qyxF(n0) =pyx:
Let (f g) be the kernel pair of x. Then,
pyxF(n0)f = qyxf = qyxg = pyxF(n0)g:
Similarly,
qyxF(n0)f = qyxF(n0)g:
Consequently,yxF(n0)f = yxF(n0)g. But y is monic, so xF(n0)f = xF(n0)g.
Since (f g) is the coequalizer of x, there is a unique morphism t : Q ! Q such that tx = xF(n0). It is easily seen that t is the required morphism.
(iii) (Transitivity) For the pullback diagram of py and qy Q
P
F(A)
Q
-
py
6
qy
6
b
a -
the morphism =h(py)a (qy)bi:P !F(A)F(A) factors through y.
Let (z w : U !F(S)) be the pullback of F(u) and F(v). There is a unique morphism : U ! P such that xz = b and xw = a. Then, is a regular epi. In fact, let b0 :U1 !F(S) and x1 :U1 !P be the pullback of x and b, and let x2 :U2 ! P and a0:U2 !F(S) be the pullback of a and x. Since x is regular epi, so are x1 and x2. If x02 and x01 is the pullback of x1 and x2, then b0x02 and a0x01 is the pullback of F(u) and F(v). Therefore, = x1x02 =x2x01. That is regular epi follows from the fact that x1 and x02 are regular epis.
Since F is -at, there are two morphisms s t : V ! S in C with us = vt such that F(s) = z and f(t) = w for some regular epi : F(V ) ! U in B. Thus, : F(V )! P is a regular epi in B.
Note that (u0 v0) is an equivalence relation on A. Let D
T
A
D u0 -
6
v0
6
c1
c2 -
be the pullback diagram ofu0andv0. Thus, the morphismc =hu0c2 v0c1i:T !AA factors as c = mr0 for somer0:T !D here m is as in the proof for symmetry. Since us = vt, i.e., u0ds = v0dt, there exists a unique morphism d0 :V ! T such that ds = c1 d0 and dt = c2d0. By the projectivity of V , we have r : V ! S with dr = r0d0. Since
u0dt = u0c2d0=1cd0=1mr0d0=u0dr
one obtains ut = ur. Similarly, vs = vr. Applying F to the above equalities, one gets F(u)F(t) = F(u)F(r) and F(v)F(s) = F(v)F(r). Since F(u) = pyx and F(v) = qyx, it follows that
pyxF(r) = pyxF(t) = pyxw = pya and qyxF(r) = qyb . Let (f0 g0) be the kernel pair of . Then
pyxF(r)f0=pyxF(r)g0 qyxF(r)f0=qyxF(r)g0
and consequentlyyxF(r)f0=yxF(r)g0, which impliesandxF(r)f0=xF(r)g0 as y is monic. Since is the coequalizer of f0 and g0, there is a unique morphism : P !Q such that = xF(r). Thus, pya = py and qyb = qy. Consequently, = y.
Finally we can complete the proof of 3.1. SinceBis-exact, every equivalence relation is e ective, so (py qy) has a coequalizer. Since F(u) = pyx and F(v) = qyx, it follows that (F(u) F(v)) has a coequalizer as x is regular epi. This completes the proof of the existence of F!.
From the above proof, we see that F! takes any regular epi with domain in C into a regular epi. Indeed, given a regular epie : P !Q inCex, we take a regular epid : C !P with C 2C. Since F(e)F(d) is a regular epi, so is F(e).
For -regular categories A and B, recall that a functor F :A !B is -regular if F preserves-limitsand regular epimorphisms. We denote the category of -regular functors from A into B by-Reg(A B). For C and B as in 2.1, -Flat(C B) is the category of -at functors from C intoB.
3.4. Theorem. Let C be a locally small category with weak -limits.
(a) Creg has the following universal property which characterizes it as the free-regular completion of C:
(i) For any -regular B, the functor
:;Reg(Creg B)!;Flat(C B) M 7!M k induced by k of 2.4 is an equivalence of categories.
(ii) The quasi-inverse of the equivalence of (i) takes a - at functor F :C!B to its left Kan extension F! along k.
(b) Cex has the following universal property which characterizes it as the free -exact completion of C:
(i) For any -exact category B, the functor
:;Reg(Cex B)!;Flat(C B) M 7!M l induced by l is an equivalence of categories.
(ii) The quasi-inverse of the equivalence of (i) takes a - at functor F :C!B to its left Kan extension F! along l.
Proof. We give a proof of part (b) the proof of (a) proceeds similarly.
The fullness and faithfulness of follow from the properties of Cex described in 2.5.
For details, see the proof of Proposition 5.8 in 8]. We now prove that is essentially surjective on objects. Since is full and faithful, by Corollary X.3.3 in 10], it suces to show that for any-at functor F :C !B,F has a left Kan extension F! of F along eC, and F! is -regular. The existence of F! was shown in Proposition 3.1. Since F! preserves regular epimorphisms, it remains to be shown that F! preserves -limits, and by 1.4, we only need to show that F! is -at. We proceed in several steps.
Step 1. F! is at w.r.t. -products. Indeed, let (Bi)i2I be a family of objects in
C
ex with #I < , and pi : Ci ! Bi be regular epis with Ci in C. By 3.1, F!(pi) is regular epi for every i 2 I. Since regular epis are stable under -products in B,
QF!(pi) : QF!(Ci) ! QF!(Bi) is a regular epi. Let W be a weak product of Ci in
C. The induced arrow t : F(W) ! QF!(Ci) is a regular epi as F is -at. There is a canonical arrow s : F(QBi)!QF!(Bi), and the weak projections ei :W !Ci of W in
C, when composed with pi induce an m : W !QBi. SincesF!(m) = QF!(qi)t, with
QF!(qi)t regular epi, also s must be a regular epimorphism.
Step 2. F! is at w.r.t. pullbacks. We proceed as in 2.3.
Case 1. Let e : A !B be a regular epi in Cex with A2C. Consider the kernel pair of F!(e):
Q f
;;!
;;!
g F!(A) F!(e);;;;;!F!(B)
Let (u v : D !A) be the kernel pair of e in Cex, and a : S ! D be a regular epi with S 2 C. From the proof of 3.1, we can see that the unique arrow x : F!(S) ! Q is a regular epi in B. Let b : F!(D) ! Q be the unique arrow so that F!(u) = f b and F!(v) = gb. Then x = bF!(a), and this implies that b is a regular epi.
Case 2. Let e be the morphism of Case 1, and f : C ! B be any arrow with C 2C. Since C is regular projective, f = eg for some g : C ! A. We form the following diagram of pullbacks:
Q0 c0 -F!(C) g0
? ?
F!(g)
Q c -F!(A)
c
? ?
F!(e) F!(C) F!(e)-F!(B)
As before, we let D be the kernel pair of e in Cex, and b : F!(D)!Q and a : S !D be regular epis in Case 1. We form a weak pullbackS0ofg and ua inCex hereF!(u) = fb.
Thus, we have the following diagram of pullbacks:
Q00 s - Q0 c0 -F!(C) F!(d)
? ?
g0
?
F!(g) F!(S) ab- Q c -F!(A)
where s is a regular epi as ab is a regular epi. Let S0 be a weak pullback of g and ua in C. Since F is -at, the unique arrow p : F!(S0) ! Q00 is a regular epi. Thus, we have a regular epi sp : F!(S0) ! Q0. Let D0 be the pullback of e and f in Cex, and b0 : F!(D0) ! Q0 be the unique arrow determined by the universal property of the pullbackQ0. Thensp = b0F!(s0) heres0 :S0!D0 is the unique arrow determined by the universal property of the pullback D0. This shows that b0 is a regular epi.
Case 3. Now we consider arrows f : K !B and g : A ! B of Cex with K A 2 C. Lete : C !B be a regular epi with C 2C. Then f = ef0 and g = eg0. We form the following pullback diagrams
Q0 m0 -F!(K)
? ?
F!(g0)
Q m -F!(C)
e0
? ?
F!(e) F!(A) F!(f)-F!(B)
Let (u : S!C v : S !A) be the pullback of e and f. From the argument of Case 2, the unique arrow b : F!(S)!Q is a regular epi. Let a : D !S be a regular epi with D 2C. Then bF!(a) : F!(D)!Q is a regular epi. We form the consecutive pullback diagrams
Q00 b0 - Q0 m0 -F!(K)
? ? ?
F!(g0) F!(D) bF!(a)- Q m -F!(C)
LetD0be a weak pullback ofua and g0. SinceF is -at, the unique arrow b0:F!(D0)! Q00 is a regular epi. Thus, cb0 :F!(D0)!Q0 is a regular epi. Consequently, the unique arrow F!(S0)!Q0is a regular epi here S0 is the pullback of f and g.
Case 4. Next we consider arrows f : A ! B and g : K ! B with A 2 C. Let e : C !K be a regular epi with C 2C. We form the pullback diagrams
Q0 e0 - Q g0 -F!(A)
? ? ?
F!(f) F!(C) F!(e)-F!(K) F!(g)-F!(B)
LetS0 be the pullback off and ge. From the Case 3, the unique arrow b : F!(S0)!Q0 is a regular epi. Thus, we have a regular epi e0b : F!(S0) ! Q as e0 is a regular epi.
Consequently, the unique arrow a : F!(S)!Q is a regular epi here S be the pullback of f and g.
Case 5. Finally, for arbitrary arrows f : A!B and g : K !B ofCex, we can reduce the proof to the case just mentioned.
Step 3. F! is at w.r.t. equalizers.
Given f g : A !B in Cex, letm : Q!F!(A) be the equalizer of F!(f), F!(g) in B. With a regular epi u : C !A in Cex with C 2C one forms the pullback
P n -F!(C)
k
? ?
F!(u)
Q m -F!(A)
so that n is the equalizer of F!(fu), F!(gu). The pullback
R s -F!(C)
t
? ?
F!(gu) F!(C)F!(f u)-F!(B)
gives an arrow q : P !R which is an equalizer of s t. There is a weak pullback of f u, gu, with projections x y : E !C inC, and the induced arrow p : F(E)!R is regular epi. For the pullback diagram
R0 s0 - P t0
? ?
q
F(E) p - R
t0 is easily recognized as the equalizer of F(x), F(y). But since F is at, there is a weak equalizer Z of x and y such that the induced arrow i : F(Z) ! R0 is regular epi. As pullbacks of regular epis, alsos0andk are regular epi. Consequently, ks0i : F(Z)!Q is a regular epi.
Step 4. F! preserves equalizers. Looking at the kernel pair of a monomorphism f in
C
ex, one sees immediately that F!(f) is mono as well, since F! is at w.r.t. pullbacks.
But atness w.r.t. equalizers and preservation of monos makesF! preserve equalizers.