• No results found

Cat valued sheaves

N/A
N/A
Protected

Academic year: 2020

Share "Cat valued sheaves"

Copied!
53
0
0

Loading.... (view fulltext now)

Full text

(1)

Cat-VALUED SHEAVES

Saikat Chatterjee

School of Mathematics, Indian Institute of Science Education and Research, Maruthamala P.O., Vithura, Thiruvananthapuram, Kerala695 551, India

e-mail: [email protected]

(Received14 August2017; accepted19 September2017)

Let O(e B) be the category of (open) subcategories of a topological groupoid B. In this paper we studyCat-valued sheaves over categoryO(e B).The paper introduces a notion of categorical union, such that the categorical union of subcategories is a subcategory. We use this definition of categorical unions to define a categorical cover of a topological category. Instead of assuming a Grothendieck topology, we defineCat-valued sheaves in terms of the categorical cover defined in this paper. The main result is the following. For a fixed categoryC, the categories of local functorial sections fromBtoCdefine aCat -valued sheaf onO(e B).ReplacingCwith a categorical groupG,we find aCatGrp-valued sheaf onO(e B).We also relate and distinguish our construction with the notion of stacks. Key words: Presheaves; sheaves; union of subcategories; categorical groups.

1. Introduction

This paper is a sequel to [15], which deals withCat-valued presheaves andCat-valued sieves. For this paper we will follow-up the definition of Cat-valued presheaves introduced in [15] and develop the notion ofCat-valued sheaves. We have reviewed and recalled all the required results (without proofs) of [15] here as well, so this paper can be read as a more or less self contained piece. Before we get into the topic of this paper, let us recollect the thoughts and motivation, explained in Section 1 of [15], behind the introduction ofCat-valued presheaves.

Traditionally a presheaf is defined, for a given categoryC,as a contravariant functor [9, 24]

(2)

whereSetis the (locally small) category of small sets. Cis typically chosen to be the category

e

O(B) of open subsets of a topological spaceB, that is,

Obj

µ e

O(B)

:={Open U| U ⊂B},

Hom(U, V) :={Continuous f :U //V|open U, V ⊂B}.

(1.2)

In (1.1) instead ofSet,one may possibly consider any otherconcrete category such as the category of (small) groupsGrp, the category of (small) vector spaces Vector the category of (small) rings Ring, and accordingly one gets “presheaf of groups”, “presheaf of vector spaces” or “presheaf of rings” respectively. We will often adopt an alternate terminology for them, such as, presheaf of groups will be calledGrp-valued presheaf, and likewise

presheaf of vector spaces=Vect-valued presheaf

presheaf of rings=Ring-valued presheaf

and so on.

Now suppose instead of a topological spaceB, we are interested in a “topological category” B. By a topological category we mean a category whose object and morphism sets are both topological spaces. Note that this taxonomy of topological category is not universal in literature. We adopt the definition of [11]. In this context a natural object of interest would be the category O(B) of subcategories ofe B. A natural choice would be to consider the category Cat of small categories as the codomain of a presheaf in this context, rather thanSet (or any other concrete category). HoweverCat is not a concrete category, and we cannot proceed with the existing definition of presheaf given in (1.1), and we need a new framework. In [15] we propose such a framework for Cat-valued presheaves, and develop a corresponding theory of Cat-valued sieves. In this paper we establish the corresponding notion of sheaves, namelyCat-valued sheaves. It should be pointed out here that a stack is “morally” a generalization of the notion of ordinary sheaves to categorical sheaves [12, 13, 36]. However our motivation and construction is slightly different than that of stacks. This issue has been discussed in Section 6.

(3)

of a cover of a topological category, and in turn that requires a “reasonable definition” of the union of (open) subcategories. So, before advancing toCat-valued sheaves fromCat-valued presheaves, we work out a definition of “categorical union” of subcategories. The categorical unions and categorical intersections satisfy usual inter-relations enjoyed by their set theoretic counterparts. We also define “open subcategories”, and “open categorical cover” of an open subcategory. We construct an example of “Cat-valued sheaf of functorial sections” for a fixed categoryC,where an objectUObj(O(B)) is sent to the category of functors frome UtoC. Since the categorical union of subcategories is not merely union of morphism sets and object sets, it is really a “non-trivial” task to establish that categories of local functorial sections indeed define a sheaf (that is, they satisfy appropriate “locality” and “gluing” conditions). In fact at first sight it may seem that this construction is not going to work. However, it is remarkable that despite all the intricacies, it turns out that local functorial sections (and natural transformations between them) do define aCat-valued sheaf. Theorem 4,2, which is the main result of this paper, establishes the preceding discussions.

As an application of Theorem 4.2 we also consider the “sheaves of categorical groups” or “CatGrp-valued sheaves”, where CatGrp is the category of categorical groups, treated as a full subcategory (identified via an obvious full faithful forgetful functorCatGrp−→Cat) of Cat. Let C be a category of a set of small categories; that is, the objects are a set of small categories and the morphisms are functors between them. We work with aCat-valued presheaf overC given by a contravariant functor:

R:Cop −→Cat. (1.3)

(4)

when we have to recall PM, we would give a heuristic description without going into the technicalities. For a detailed exposition on the topic, we refer to [5, 18, 30].

Notation and convention

We borrow our notation from [15]. LetCand D be a given pair of categories.

Fun(C,D) (1.4)

will denote the set of all functors fromCtoD.The set of all natural transformations between functors fromCtoDwill be denoted as

N(C,D). (1.5)

Ifθ1, θ2 :C //D are a pair of functors, then

Nat(θ1, θ2) (1.6)

is the set of all natural transformations betweenθ1 and θ2. We will often denote a natural

transformation Φ from a functorθ1 to another functor θ2 as

Φ :θ1=⇒θ2. (1.7)

The category of functors will be denoted as

F(C,D); (1.8)

that is

Obj

µ

F(C,D)

= Fun(C,D)

Mor

µ

F(C,D)

=N(C,D).

(1.9)

Given a morphism f in some category,s(f), t(f) will respectively denote the source off and target off; that is,

s(f)−→f t(f).

will denote theempty category; i.e. a category whose object and morphism sets are null sets.

Overview of the sections

(5)

In Section 2 we review some of the constructions and results from [15]. We work with a category of a set of small categories, C. In particular, in this section we recall the definition of a Cat-valued presheaf over C introduced in [15]. We state a version of Yoneda embedding in Proposition 2.3.

Section 3 prepares the stage for the next section. We first define the categorical union of subcategories, and Proposition 3.1 ensures that the categorical union and intersection satisfy Boolean relations (the proof is carried out in the Appendix). We take B to be a groupoid. We call a subcategory open if both object and morphism sets are open, and the subcategory is a groupoid. This particular definition of open subcategories is essential to have a well defined sheaf of functorial sections. We introduce the notion of an open categorical cover and provide some examples for the same.

Section 4 is the central theme of this paper. The ultimate goal in this section is to construct the (Cat-valued) sheaf of functorial sections. We define aCat-valued sheaf overO(B) to be ae Cat-valued presheaf satisfying certain locality and gluing conditions (described in (4.6)-(4.13)).

Next we fix a categoryC.Our goal is to construct the (Cat-valued) sheaf of functorial sections to category C. Finally in Theorem 4.2 we prove that functorial sections with respect to categoryCoverB define a Cat-valued sheaf.

In Section 5 we first give a brief review of categorical groups, and show (Proposition 5.1) thatGU :=F(U,G) form a categorical group, whereG is a fixed categorical group and Uany category. We define (category of categorical groups)CatGrp-valued presheaves. In Proposition 5.2 we show that if we replace Cof Section 3 by a categorical groupG, then we get a CatGrp-valued sheaf onO(B).e

In Section 6 we give a brief review of the notion of stacks and compare our construction with that of stacks.

The Appendix contains the proof of Proposition 3.1.

(6)

Summary of the paper

Main objective of this paper is to propose a framework for Cat-valued sheaves and con-struct an example of “Cat-valued sheaf of (local) functorial sections” defined on a topological groupoidBwith respect to a fixed categoryC. Our starting point is theCat-valued presheaf onC introduced in [15] and recalled in Section 2.

A Cat-valued presheaf onC is a contravariant functor

Cop−→Cat.

With the motivation to define Cat-valued sheaves on O(B),e we introduce a new notion of categorical union of subcategories, which ensures that union of subcategories is a sub-category. We show that categorical unions thus defined and intersections of subcategories are consistent with the standard set theoretic relation. We turn to defining open subcate-gories and categorical cover of an open subcategory of a topological groupoidBand illustrate the definitions with several examples. Then we define a Cat-valued sheaf onO(B) to be ae Cat-valued presheaf satisfying certain “gluing” and “locality” conditions.

We fix a categoryCand consider the functor categories CU :=F(U,C) defined by open subcategoriesU of B.We show that the prescription

U7→CU

then produces a Cat-valued sheaf on O(B).e We call them Cat-valued sheaf of functorial sections on O(B).e

As a special case of above construction, taking Cto be a categorical groupG,we obtain aCatGrp-valued sheaf onO(B).e

2. Cat-valued Presheaves

For ease of reference, in this section we briefly review and collect some of the relevant material from [15]. Some parts would be verbatim from [15]. We keep the details to a bare minimum, and skip the proofs. We will provide references to corresponding Proposition/Theorem num-bers in [15].

(7)

the categoryO(B),e whereB is a given topological category and,

Obj

µ e

O(B)

:={“open” U|UB}= set of all “open subcategories” of B, [Open subcategories are defined in Section 3]

Hom(U,V) ={“continuous”functor Θ:U−→V|open U,VB}.

(2.1)

We will also work with the categoryO(B),whose objects are same as those ofO(B); bute the only morphism between any two subcategories (objects) is the inclusion functor if one is subcategory of the other, otherwise no morphism exists. Thus:

Obj

µ

O(B)

:={open U|UB}= set of all open subcategories of B, Hom(U,V) ={i:U,→V|UVB},

where i is the inclusion functor, and

Hom(U,V) =∅,if U6⊂V.

(2.2)

LetCat be the category of all (small) categories. Analogous to the contravariant Hom-functor in a set theoretic framework, we have the contravariant Hom-functor FU :Cop //Cat, corresponding to eachUObj(C) as follows.

FU : Obj(C) //Obj(Cat)

V7→ F(V,U) (2.3)

FU : Mor(C)µ //Mor(Cat) V−→Θ W

7→

µ

F(W,U)−−−−→ FFU(Θ) (V,U)

, (2.4)

where Θ is a functor from the category V to W, and (2.4) is specified by following two equations.

FU(Θ) : Obj

µ

F(W,U)

−→Obj

µ

F(V,U)

, Ψ7→ΨΘ,

V

ΨΘ

²

²

w

w

o o o o o o o

W Ψ //U

(2.5)

(8)

and

FU(Θ) : Mor

µ

F(W,U)

−→Mor

µ

F(V,U)

, FU(Θ) :N(W,U)−→ N(V,U),

¡

FU(Θ)

¢

(S) :=SΘ∈ N(V,U).

(2.6)

Following proposition confirms that indeedFU :Cop //Cat is a functor.

Proposition2.1 — [Proposition 2.1 [15]]. LetCbe a category of a given set of (small)categories and Cat be the category of all (small) categories. Then, for each U Obj(C), we have a contravariant functorFU :Cop //Cat defined as in (2.3), (2.5) and (2.6).

Moreover the functorsFU are consistent with the Yoneda lemma.

Proposition2.2 — [Proposition 2.2 [15]]. There exists an isomorphism between Fun(U,V) and Nat(FU,FV) :

Fun(U,V)= Nat(FU,FV). (2.7)

2.1 Presheaves of categories

Two prominent directions of enquiry, which immediately emerge out of the definition of presheaves, are sheaves and sieves. In [15] we have introduced the notion of Cat-valued presheaf to study the Cat-valued sieves. Here we will recall the definition of Cat-valued presheaf given in [15]. In this paper our focus will beCat-valued sheaves.

As before, let C be a category of a set of (small) categories, andCat be the category of all small categories. We work with following definition ofpresheaves of categories over C. A presheaf of categories (or, aCat-valued presheaf), over the category C, is a functor

R:Cop //Cat. (2.8)

An immediate consequence of the definition above and Proposition 2.1 is the following.

Lemma2.1 [Corollary 3.1, [15]]. For each UObj(C),the functor

FU :Cop //Cat

(9)

LetPrsh(C,Cat) :=F(Cop,Cat) denote the category ofCat-valued presheaves, over the

categoryC; that is,

Obj

µ

Prsh(C,Cat)

= Fun(Cop,Cat), Mor

µ

Prsh(C,Cat)

=N(Cop,Cat).

(2.9)

Using Lemma 2.1 and Proposition 2.2 we prove a version of Yoneda embedding of C in Prsh(C,Cat).

Proposition 2.3 — [Theorem 3.2, [15]]. Let C be a category of a collection of (small) categories, andCatbe the category of all small categories. LetPrsh(C,Cat) :=F(Cop,Cat) be the category of Cat-valued presheaves over the category C. Then there exists a full and faithful functor

C −→Prsh(C,Cat).

In other words, C can be identified as a full subcategory of Prsh(C,Cat).

Instead of working with the entire categoryCat,one can consider a presheaf of subcate-gories ofCat. For example, one may define a presheaf of ”categorical groups”, overC,to be a contravariant functor from C toCatGrp:

R:Cop //CatGrp,

whereCatGrpis the category of categorical groups. We will denote “category of presheaves of categorical groups” by

Prsh(C,CatGrp).

In section 5 we will construct such an example of presheaf of categorical groups.

3. Categorical Cover

In the next section we are going to introduce the notion of “Cat-valued sheaves”. As a prerequisite we need a “reasonable definition” for a cover of a sub category. This section will provide the necessary frame-work for union of subcategories (namely “categorical union”) of a given category, and categorical cover of a “topological category”.

3.1 Categorical cover

(10)

then we call it atopological groupoid. For example, a Lie groupoid is a topological groupoid. We will soon see another example of a topological groupoid, the “path space groupoid” of a topological space, which would be more relevant for this paper. It is easy to see that the intersection of two subcategories U and V,defined as:

Obj(UV) := Obj(U)Obj(V),

Mor(UV) := Mor(U)Mor(V), (3.1)

is also a subcategory. However, if we define the union of two subcategories in similar fashion,

Obj(UV) := Obj(U)Obj(V),

Mor(UV) := Mor(U)Mor(V), (3.2)

then this union fails to be a subcategory. One can see that the obstruction, for the above union of subcategories to be a subcategory, is precisely the Obj(U)Obj(V).Because of the following reason. Suppose a −→f1 b Mor(U) and b −→f2 c Mor(V), where b Obj(U) Obj(V).Thenf2, f1Mor(U)Mor(V),butf2◦f1∈/ Mor(U)Mor(V).Note that ifUV

is empty, then we have a well define union of subcategories defined as in (3.2).

Figure 1: A schematic diagram for categorical union of a pair of subcategories

As a remedy to this problem we define the categorical union of two subcategories U and V to be the smallest subcategory containing U and V.Explicitly UV has following description.

Obj(UV) := Obj(U)Obj(V), Mor(UV) :=Gen

µ

Mor(U)Mor(V)

(11)

where

Gen

µ

Mor(U)Mor(V)

=

½

f2◦f1|f2, f1 Mor(U)Mor(V), s(f2) =t(f1)

¾

; (3.4)

that is, Mor(UV) is the subset of Mor(B),generated by Mor(U) and Mor(V).Note that Mor(U)Mor(V)Gen

µ

Mor(U)Mor(V)

,and (3.4) can be rewritten as

Gen

µ

Mor(U)Mor(V)

= Mor(U)[Mor(V)[

n

f2◦f1|f2 Mor(U), f1 Mor(V), s(f2) =t(f1)Obj(U)Obj(V)o [

n

f2◦f1|f2 Mor(V), f1 Mor(U), s(f2) =t(f1)Obj(U)Obj(V)

o

.

(3.5)

For non-intersectingU and V,we have

Gen

µ

Mor(U)Mor(V)

= Mor(U)Mor(V), if UV=∅.

It is obvious that the categorical union of U,V, defined in (3.3), is a subcategory of B.Henceforth by union of subcategories we will always understand the categorical union of subcategories.

It would be often convenient to visualize B as the path space category (groupoid) on a (smooth) topological space B.We will not discuss the path space category here in detail. [5, 4, 18] can be consulted for the same. Intuitively, the path space category of a topological space B is the category whose objects are elements of B and morphisms are paths on B (modulo “certain equivalence relations”), and composition is given by usual concatenation of paths. The equivalence relation is typically chosen to be “thin homotopy equivalence” [29] or “back-track equivalence” [18]. The later is a slightly weaker condition compare to the former (see Section 3 of [18] for a comparison between the two). Since every “path” can be reversed, this category in fact is a groupoid. The morphism space of a path space groupoid is equipped with usual compact-open topology. We will denote the path space category(groupoid) on B asPB,

Obj(PB) =B,

(12)

U ⊂B and V ⊂B, respectively. Obviously U,V are subcategories of PB := B. So, in this caseGen

µ

Mor(U)Mor(V)

is basically the set of all paths (modulo “certain equivalence

relations”) lying onU∪V ⊂B.In other words,UVis the path space categoryP(U∪V) of U∪V ⊂B. On a related note we observe that even without the smoothness condition onB we can construct the path space groupoidPB by taking the morphism space to be the space of homotopy equivalent paths on B, which is of course stronger equivalence condition than the previous two.

The intersection and (categorical) union of subcategories respectively defined in (3.1), (3.3) satisfy usual set theoretic Boolean relations of unions and intersections. Here we list some of them, and have provided a proof for the following proposition in the Appendix.

Proposition 3.1 — Let U,V,W be subcategories of a category B. Suppose intersection and (categorical) union of subcategories are respectively defined as in (3.1), (3.3). Then following relations hold:

(i) U(VW) = (UV)W and U(VW) = (UV)W, (ii) U(VW) = (UV)(UW).

(iii) U(VW) = (UV)(UW),

Proof : See the Appendix. ¤

LetU be a subcategory of a topological groupoid B,such that Obj(U) and Mor(U) are open (in Obj(B) and Mor(B),respectively). Then we callU to be anopen subcategory ofB, ifUis also a groupoid. The following obvious result would be useful later.

Lemma 3.1 — Suppose U is an open subcategory of a topological groupoid B, and for a−→f1 b, b−→f2 c, a−→f10 b0, b0 −→f20 cMor(U),we have

f2◦f1=f20 ◦f10. (3.7)

Then there exists an isomorphismb−→g0 b0 Mor(U),such that g0◦f1=f10

f2◦g−01 =f20.

(3.8)

(13)

Figure 2:

In the context of the path space groupoidPB over a smooth topological spaceB,there is an elegant approach, namely “back-track erasing” [18, 26], to deal with such a situation and the condition in (3.7)-(3.8) is ensured by imposing certain equivalence relation on the space of paths. Roughly the idea is as follows. If U is an open subset of B, and U := PU is the path space category overU , that is

Obj(PU) =U,

Mor(PU) ={paths on U}/“some equivalence relations”. (3.9)

Suppose two pairs of paths (modulo equivalence), a−→γ1 b, b−→γ2 c Mor(PU), and a γ10 −→ b0, b0 γ20

−→c∈Mor(PU) such that

γ2◦γ1=γ20 ◦γ10,

then we have the path segment b−→γ0 b0 between band b0,satisfying γ0◦γ1=γ10

γ2◦γ01 =γ20.

(3.10)

Figure 2 illustrates (3.10).

For future reference we make following observation.

Lemma3.2 — LetU,V be open subcategories of a topological groupoidB . ThenUV and UV are also open subcategories ofB.

Proof: Straightforward verification. ¤

LetUbe an open subcategory of a topological groupoidB.An indexed family of subcat-egories {Uα}α∈I is an open categorical cover of U,if eachUα is an open subcategory ofU, and

U=[ α

(14)

where the union of subcategories is taken according to the definition in (3.3).

Following examples illustrate the idea behind an open categorical cover of a topological category.

Example3.1 : We call a category A trivially discrete, if the objects form a set, and the only morphisms in Mor(A) are identity morphisms:

Mor(A) ={1a|a∈Obj(A)} 'Obj(A).

Let B be a topological space with an open cover {Ui}i∈I, and Bdis be the corresponding trivially discrete category. Then, it is obvious that the set of trivially discrete categories, corresponding to{Ui}i∈I,defines a categorical cover ofBdis.

Example3.2 : SupposeB :=M is a smooth manifold with an open cover{Ui}i∈I.LetUik denotes the intersection ofUi and Uk,

Uik:=Ui∩Uk.

LetB:=PM be the path space category overM; that is, (skipping the technicalities) Obj(PM) =M

Mor(PM) ={C1-paths on M}/“some equivalence relations”. Let, for each i∈I,

Ui :=PUi be the path space category on the open setUi :

Obj(Ui) =Ui,

Mor(Ui) ={C1-paths onUi}/“some equivalence relations”.

Clearly eachUi is a subcategory ofPM.Observe that every path onM has to locally lie on some Ui.That means, for each path γ on M, we haveJ ⊂I, such thatγ entirely lies on

S

j∈JUj.SupposeJ ={j1,· · ·, jk},and

γjr :=γ|Ujr = restriction of γ to Ujr.

(15)

Note thatγjr Mor(Ujr).In other words, according to the definition in (3.3), γ Morµ [

j∈J Uj

.

Also as explained before eachUi is a groupoid. Hence, as a consequence,{Ui}i∈I define a categorical cover of PM,

[

i∈I

Ui=PM.

Example3.3 : This is rather an example of what is not an open categorical cover. LetB be a smooth topological space with an open cover {Ui}i∈I. Let Uik denotes the intersection of Ui andUk,

Uik :=Ui∩Uk.

LetBbe the path space grouopidPB.LetUij, i, j ∈I,be the set of all morphisms whose sources are inUi and targets are in Uj :

Uij :={f Mor(B)|source(f)∈Ui,target(f)∈Uj} ⊂Mor(B). (3.12)

Note that also,

Uij∩Ukl =Uikjl,

whereUikjlis the set of morphisms starting in Uik,and terminatingUjl.Since {Ui}is an open cover of B,every morphism inBhas to start in some Ui and terminate in someUj.In other words,

[

i,j∈I

Uij = Mor(B).

Now let us define a categoryUk

i,for each i, k∈I, as follows: Obj(Uji) =Ui∪Uj,

Mor(Uji) =Uij∪ {1p|p∈Ui∪Uj}.

(3.13)

Thus eachUji is a subcategory of U,and

[

i,j∈I

Uji =B, (3.14)

(16)

4. Cat-valued Sheaves and Functorial Sections

In this section first we will introduce the notion of “Cat-valued sheaves”, and finally, our intention is to construct an example ofCat valued sheaf of “functorial sections”.

4.1 Cat-valued sheaves

SupposeBis a topological groupoid. Let us consider the categoryO(B) of open subcategories:e

Obj

µ e

O(B)

:={openU|UB}

= set of all open subcategories of B,

Hom(U,V) =:U−→V|openU,VB,Θcontinuous}.

(4.1)

By a continuous functor we mean a functor which is continuous both on objects and morphisms. Henceforth O(B) will always denote the category of open subcategories of ae topological groupoidB as described in (4.1).

Recall the definition of a Cat-valued presheaf defined in (2.8). LetR be a Cat-valued presheaf overO(B),e

R:O(B)e op //Cat. (4.2)

LetUbe an open subcategory ofB,and{Uα}α∈I be an open categorical cover ofU(see (3.11)). Let

iα :Uα ,→U, α∈I

be the inclusion functor. Thus,R(iα) defines a functor from the category R(U)∈Obj(Cat) to the categoryR(Uα)Obj(Cat) :

R(iα) :R(U)−→ R(Uα), (4.3) for eachα∈I.Similarly, if Uα∩Uβ :=Uαβ is non empty, then we have a pair of inclusion functors (we use same notation for both of them)

iαβ :Uαβ ,→Uα, iαβ :Uαβ ,→Uβ,

(4.4)

and corresponding to them we have functors

R(iαβ) :R(Uα)−→ R(Uαβ),

(17)

respectively. We call R to be a Cat-valued sheaf over O(B) provided following conditionse are satisfied:

1. [Locality]

(i) IfΨ1,Ψ2 Obj

µ

R(U)

,such that,

R(iα)(Ψ1) =R(iα)(Ψ2), (4.6)

for all α∈I,then,

Ψ1 =Ψ2. (4.7)

(ii) If Ψ1,Ψ2,Ψe1,Ψe2Obj(R(U)) satisfy

R(iα)(Ψ1) =R(iα)(Ψ2),

R(iα)(Ψe1) =R(iα)(Ψe2),

(4.8)

for all α∈I,and

µ

Ψ1−→S1 Ψe1

,

µ

Ψ2 −→S2 Ψe2

Mor

µ

R(U)

such that,

R(iα)(S1) =R(iα)(S2), (4.9)

for all α∈I,then,

S1 =S2. (4.10)

2. [Gluing]

(i) If for each α∈I,a Ψα Obj

µ

R(Uα)

is given, such that, for any non empty Uαβ

R(iαβ)(Ψα) =R(iαβ)(Ψβ), (4.11) then there exists aΨObj(U),such that

R(iα)(Ψ) =Ψα, ∀α∈I.

(ii) If for each α∈I, a

µ

Ψ −−→Ψe

Mor

µ

R(Uα)

is given, such that, for any non empty Uαβ

R(iαβ)(Ψα) =R(iαβ)(Ψβ), R(iαβ)(Ψeα) =R(iαβ)(Ψeβ),

(18)

and

R(iαβ)(Sα) =R(iαβ)(Sβ). (4.13)

then there exists a

µ

Ψ−→S Ψe

Mor(U),such that,

R(iα)(S) =Sα.

Example 4.1 : The above definition of a Cat-valued sheaf is a generalization of the standard definition of a sheaf.

If we consider the trivially discrete (see Example 3.1 for the definition) topological cat-egoryBdis corresponding to a topological space B,then a Cat-valued sheaf overO(Bdis) is

same as a sheaf in the traditional sense. ¤

We end this section with a more interesting example of aCat-valued sheaf over O(B).e 4.2 Cat-valued sheaf of functorial sections

Fix a topological categoryC.For anyU Obj

µ e

O(B)

,let

F(U,C) :=CU

be the category of functors fromU−→C; that is: Obj(CU) = Fun(U,C)

Mor(CU) =N(U,C). (4.14)

Lemma4.1 — For any

µ

U−→Θ V

Mor

µ e

O(B)

,we have a functor

R(Θ) :CV−→CU,

given as follows:

R(Θ) :Obj(CV)−→Obj(CU), Ψ7→ΨΘ,

R(Θ) :Mor(CV)−→Mor(CU), S 7→ SΘ.

(19)

Proof: Define a new category of categoriesCbby attachingCwith the original category

e

O(B) :

Obj(C) := Objb

µ e

O(B)

∪ {C},

Mor(C) := Morb

µ e

O(B)

µ [ U⊂B

Fun(U,C)

µ [ U⊂B Fun(C,U) ¶ µ Fun(C,C) ¶ .

Then according to Proposition 2.1, forCObj(C) we have the functorb

FC:Cbop −→Cat. (4.16)

In particular, ifU,VObj¡O(B)e ¢Obj(C) andb

µ

U−→Θ V

then

µ

U−→Θ V

7→

µ

CV−−−−→FC(Θ) CU

,

sinceFC(U) =F(U,C) =CU.It is immediate thatFC restricted toO(B) is in fact thee R in the statement of the lemma;

FC|Oe(B)=R.¤ Therefore we have aCat-valued presheafR:

R:O(B)e op //Cat,

Obj µ e O(B) ¶ / /Obj(Cat),

U7→CU, Mor µ e O(B) ¶ / /Mor(Cat), µ

U−→Θ V

7→

µ

CV−−−→R(Θ) CU

.

(4.17)

Rest of this section will be devoted to prove (Theorem 4.2) that theCat-valued presheaf, defined above, is in fact a Cat-valued sheaf.

Theorem 4.2 — Let B be a topological groupoid. Let O(B)e be the category of open subcategories. Let R be as defined in Lemma 4.1. Then Ris a Cat-valued sheaf overO(B).e

Note that if{Uα}α is an open categorical cover ofB,then Lemma 3.2 ensures, Uαβ :=Uα∩Uβ Obj

¡e

O(B)¢, Uα∪Uβ Obj

¡e

(20)

Before we carry out the proof of this theorem, we will work in a simpler situation to get an insight into the overall methodology of the proof.

We have to verify thatRsatisfies[Locality]and [Gluing]conditions. The crucial issue here is that, if{Uα} is a categorical cover ofU, then in general

S

αMor(Uα) is a subset of Mor

µ S

αUα

= Mor(U). In other words, there may exist a morphism in Mor(U), which

does not belong to any Mor(Uα).Now, if Ψ1,Ψ2 Obj(R(U)) = Obj(CU) = Fun(U,C),

such that Ψ1,Ψ2 coincide in each Uα,then it is not obvious that Ψ1 =Ψ2. Because, there

is a possibility thatΨ1,Ψ2 are different on some f Morµ[

α Uα

= Mor(U),

f /∈[ α

Mor(Uα).

(4.19)

But we will see, remarkably, that does not actually happen! And, even for an f as in (4.19), Ψ1(f),Ψ2(f) are completely determined by the local data; i.e. if (4.6) holds for

Ψ1,Ψ2, then Ψ1(f) = Ψ2(f), for any f Mor(U) including one like in (4.19). Similarly, other conditions of[Locality] and [Gluing] also hold. To see this, at first we deal with a “test case”, where an open subcategoryU of B is covered by only two (open) subcategories {U1,U2}:

U1U2 =U. (4.20)

Before we proceed further, let us simplify our notations. If U is a subcategory of V, and i : U ,→ V is the inclusion functor, then for Ψ Obj(CV),S ∈ Mor(CV), we will respectively denote,

µ

R(i)

(Ψ) :=Ψ|U Obj(CU),

µ

R(i)

(S) :=S|U Mor(CU).

(4.21)

Proposition 4.1 — LetO(B) be the category of open subcategories. Lete Rbe as defined in Lemma 4.1. LetU be an open subcategory ofO(B) with categorical covere {Uα}α∈{1,2}. Then onU [Locality] and [Gluing]conditions, listed between (4.6)-(4.13), hold.

Proof : First we verify[Locality] conditions. LetΨ1,Ψ2 Obj(CU) = Fun(U,C),such that,

(21)

Recalling the definition of categorical union given in (3.3) we see: Ψ1 =Ψ2 on objects.

Also, Ψ12 on Mor(U1)Mor(U2)Mor(U).Now, consider an arbitraryg∈Mor(U), that means there existg2 Mor(U2) and g1 Mor(U1),such that

g=g2◦g1.

[To be precise, ˜g1 Mor(U1),g˜2 Mor(U2),and ˜g1˜g2 =g is also an alternate possibility.

But, this case can be dealt in exactly same fashion as the other. And, we will not explicitly consider it]. Thus,

Ψ1(g) =Ψ1(g2)Ψ1(g1) [∵Ψ1is a functor]

=Ψ2(g2)Ψ2(g1) [∵g2 Mor(U2), g1 Mor(U1),

and Ψ1|Uα =Ψ2|Uα, α∈ {1,2}] =Ψ2(g2◦g1) [∵Ψ2 is a functor]

=Ψ2(g).

(4.22)

ThusΨ1=Ψ2 on U.

Similarly, if¡S1 :Ψ1 =Ψ2

¢

,¡S2:Ψ1 =Ψ2

¢

Mor(CU) =N(U,C), such that, S1|Uα =S2|Uα, α∈ {1,2},

then for any (a−→f b)∈Mor(U1)Mor(U2),we have the commuting diagram,

Ψ1(a)

S(a)

²

²

Ψ1(f) // Ψ1(b)

S(b)

²

²

Ψ2(a) Ψ

2(f)

/

/Ψ2(b)

, (4.23)

where we denote S := S1|Uα = S2|Uα, α ∈ {1,2}. Now suppose (a g

c) Mor(U) is an arbitrary morphism in Mor(U). That means we have (a −→g1 b) Mor(U1),(b −→g2 c)

Mor(U2),such that

g=g2◦g1.

S extends to (a−→g c)∈Mor(U) as follows. We have commuting diagrams, Ψ1(a)

S(a)

²

²

Ψ1(g1) // Ψ1(b)

S(b)

²

²

Ψ2(a) Ψ

2(g1)

/

/Ψ2(b)

(22)

and,

Ψ1(b)

S(b)

²

²

Ψ1(g2) // Ψ1(c)

S(c)

²

²

Ψ2(b)

Ψ2(g2)

/

/Ψ2(c)

. (4.25)

Since Ψ2,Ψ1 are functors, composing above commuting diagrams we get the commuting diagram,

Ψ1(a)

S(a)

²

²

Ψ1(g) // Ψ1(c)

S(c)

²

²

Ψ2(a)

Ψ2(g)

/

/Ψ2(c)

[ putting g2◦g1 =g]. (4.26)

ThusS =S1 =S2 for the categoryU.

Our next task is to verify[Gluing] conditions.

For that, suppose Ψα Obj(CUα) = Fun(U

α,C) given for α ∈ {1,2}, such that: Ψ1|U12 =Ψ2|U12.Then we define (Ψ:U−→C)Fun(U,C) = Obj(CU) as follows:

Obj(U) //Obj(C)

Obj(U1)Obj(U2) //Obj(C)

a7→Ψα(a), if a∈Uα, α∈ {1,2}, (4.27) and,

Mor(U) //Mor(C)

Gen

µ

Mor(U1)Mor(U2)

/

/Mor(C),

f2◦f17→Ψ2(f2)Ψ1(f1),

f2 Mor(U2), f1 Mor(U1). (4.28)

Since Ψ1|U12 = Ψ2|U12, (4.27) is well defined. For the same reason, right hand side of (4.28) makes sense [∵t(f1) =s(f2)Obj(U12).So,s(Ψ2(f2)) =t(Ψ1(f1)).]. But we have to check if (4.28) is well defined; that is, iff0

2◦f10 =f2◦f1,for some otherf20 Mor(U2), f10

Mor(U1),then we should have

(23)

Let

s(f2) =b=t(f1), s(f1) =a=s(f10), t(f20) =c=t(f2), s(f20) =b0 =t(f10), sob, b0Obj(U

12).

By Lemma 3.1 we have an isomorphismb−→g0 b0Mor(U) such that: g0◦f1=f10,

f2◦g−01 =f20.

In fact,

b−→g0 b0 Mor(U12).

Then

Ψ2(f20)Ψ1(f10)

=Ψ2(f2◦g−01)Ψ1(g0◦f1)

=Ψ2(f2)Ψ2(g01)Ψ1(g0)Ψ1(f1)

=Ψ2(f2)Ψ1(f1) [∵g0 Mor(U12) and Ψ1|U12 =Ψ2|U12].

(4.29)

Hence, (4.28) is well defined, and we have (Ψ : U −→ C) Fun(U,C) = Obj(CU) satisfying

Ψ|Uαα, α={1,2} Next, suppose ¡Sα : Ψα = Ψ0

α

¢

Mor(CUα) = N(U

α,C) given for α ∈ {1,2}, such that,Ψ1,Ψ2glue to form aΨFun(U,C),similarly,Ψ01,Ψ02glue to form aΨ0 Fun(U,C),

[as described in the previous part of the proof] and satisfy

S1|U12 =S2|U12. (4.30)

We defineS ∈ N(U,C) by:

S(a) =Sα(a), for a∈Obj(Uα), α∈ {1,2}. (4.31) Above equation makes sense because of (4.30). We have to ensure that (4.31) is a well defined natural transformation between Ψ and Ψ0. It is obvious that for any a f b Mor(U1)Mor(U2)Mor(U) = Mor(U1U2),we have the commuting diagram:

Ψ(a)

(a)

²

²

Ψ(f) //

Ψ(b)

(b)

²

²

Ψ0(a)

Ψ0(f) //Ψ 0(b)

(24)

wherea −→f b Mor(Uα), α={1,2}. We have to verify that S is well defined (as a natural transformation) for all (a −→g c) Mor(U). Again, by the previous argument, we have g = g2◦g1,for some (a−→g1 b) Mor(U1),(b −→g2 c) Mor(U2).[ Here also we are ignoring the

possibilityg= ˜g2˜g1,where (a−→˜g1 b0)Mor(U2),(b0 −→˜g2 c)∈Mor(U1),as it can be handled

in an exactly same manner.] We have a pair of commuting diagrams respectively inU1 and U2,

Ψ(a)

S1(a)

²

²

Ψ(g1) //

Ψ(b)

S1(b)

²

²

Ψ0(a)

Ψ0(g1) //Ψ 0(b)

, (4.33)

and,

Ψ(b)

S2(b)

²

²

Ψ(g2) //

Ψ(c)

S2(c)

²

²

Ψ0(b)

Ψ0(g2) //Ψ0(c)

. (4.34)

Since b∈Obj(U12),and S1|U12 =S2|U12,we have a commuting diagram

Ψ(b)

S1(a)

²

²

Ψ(g) //

Ψ(c)

S2(c)

²

²

Ψ0(b)

Ψ0(g) //Ψ 0(c)

[ putting g2◦g1 =g]. (4.35)

So we have a well defined natural transformation (S :Ψ=Ψ0)∈ N(U,C) satisfying: S|Uα =Sα, α∈ {1,2}.

In conclusion, we have proven that, onU=U1U2,Rsatisfies[Locality]and[Gluing]

conditions. ¤

Now we turn to the proof of Theorem 4.2. The proof would be rather long, and we proceed by one step at a time. The verification of[Locality] is not very difficult. The main hardship is to ensure that the[Gluing]conditions are satisfied. Let us first explain what we are trying to achieve here, and give a brief description of the strategy of our proof.

(25)

⊂I such that

f =fjm◦ · · · ◦fj1, (4.36) where fjr Mor(Ujr), r∈ {1,· · ·, m}.Note thatUjr Ujr−1, r∈ {2,· · ·, m},is always non empty, because

s(fjr) =t(fjr1). If we are given aΨα Obj(CUα) = Fun(U

α,C) for each α∈I,satisfying Ψα|Uαββ|Uαβ for any non-empty Uαβ,

we intend to find a ΨObj(CU) = Fun(U,C),such that Ψ|Uαα. We defineΨas follows

Ψ(f) :=Ψjm(fjm)◦ · · · ◦Ψj1(fj1). (4.37) [Here and afterwards we will focus on the gluing (respectively locality) condition only for morphisms. For the objects it is obvious due to the first part of (3.3)].

Now, suppose for some otherJ0:={j0

1,· · · , jn0} ⊂I, we have f =fj00

n◦ · · · ◦f 0 j0

1, (4.38)

where f0 j0

k Mor(Uj 0

k), k∈ {1,· · ·, n}.ThenΨ to be well defined, we should have Ψjm(fjm)◦ · · · ◦Ψj1(fj1) =Ψj0

n(f 0 j0

n)◦ · · · ◦Ψj01(f 0 j0

1). (4.39)

Our primary concern is to prove (4.39). Rest of the proof is straightforward.

Strategy of the proof : The proof of (4.39) will be carried out by the method of induction. First we will prove that, ifJ ={j1}andJ0 ={j20, j10},that is,f Mor(Uj1) andf =fj00

2◦f 0 j0

1, then

Ψj1(f) =Ψj0 2(f

0 j0

2)Ψj 0 1(f

0 j0

1). Next, we make the induction assumption:

[Ind assum 1]: “If J = {j1} and J0 = {j10,· · · , jk0}, that is, f Mor(Uj1) and f = f0

j0

k ◦ · · · ◦f 0 j0

1,then

Ψj1(f) =Ψj0 k(f

0 j0

k)◦ · · · ◦Ψj 0 1(f

0 j0

(26)

Then we show that it is true for J = {j1} and J0 = {j10,· · ·, jk0+1}. Thus, it holds for

J ={j1} andJ0 ={j0

1,· · · , jn0}.We proceed with a second induction assumption.

[Ind assum 2]: “If J = {j1,· · · , jk} and J0 = {j10,· · · , jn0}, that is, fjl Mor(Ujl) and fjk◦ · · · ◦fj1 =fj00

n◦ · · · ◦f 0 j0

1,then

Ψjk(fjk)◦ · · · ◦Ψj1(fj1) =Ψj0 n(f

0 j0

n)◦ · · · ◦Ψj10(f 0 j0

1).”

Then we show that it holds for J = {j1,· · · , jk+1} and J0 = {j10,· · · , jn0}. Thus, we can conclude that it holds forJ ={j1,· · · , jm}and J0 ={j10,· · · , jn0}.

And, that would complete the proof of (4.39).

Proof of (4.39): We implement our strategy described above.

Proposition 4.2 — With notations and conventions as above, let U be a subcategory of B,with an open categorical cover {Uα}αI.Let j1, j0

1, j20 ∈I,and

f =fj00 2 ◦f

0 j0

1 Mor(Uj1)Mor(Uj 0

1Uj20), wheref Mor(Uj1), fj00

2 Mor(Uj 0 2), f

0 j0

1 Mor(Uj 0

1).Then,

Ψj1(f) =Ψj0 2(f

0 j0

2)Ψj10(f 0 j0

1). (4.40)

Proof : First we observe that, bothUj1∩Uj0

1 and Uj1 Uj20 are non empty [∵s(f) = s(f0

j0

1), t(f) =t(f 0 j0

2),ands(f), t(f)Obj(Uj1)]. Now, using (iii) of Proposition 3.1, we write f Mor

µ

Uj1

¡

Uj0 1Uj20

¢¶

= Mor

µ¡

Uj1 Uj0 1

¢

¡Uj1 Uj0 2

¢¶

.

That means, there exists f2Mor¡Uj1 Uj0 2

¢

, f1 Mor¡Uj1Uj0 1

¢

,such that

f =f2◦f1.

By (3.7)-(3.8), we have an isomorphism g0 Mor(Uj0

1 Uj20),such that fj20 ◦g0 =f2,

(27)

So,

Ψj1(f) =Ψj1(f2◦f1)

j1(f2)Ψj1(f1)[∵Ψj1 is a functor, and f2, f1 Mor(Uj1)] =Ψj0

2(f2)Ψj10(f1) [∵Ψj1|Uj1j0

ij

0

i|Uj1ji0, i∈ {1,2}, and f2Mor(Uj20), f1 Mor(Uj01)] =Ψj0

2(f 0

j2◦g0)Ψj0 1(g0

1f0 j1) =Ψj0

2(f 0 j0

2)Ψj10(f 0 j0

1)[∵Ψj10|Uj10j20j20|Uj01j02]

(4.41)

This proves the proposition. ¤

We assume[Ind assum 1].

Proposition 4.3 — Suppose [Ind assum 1]is true. Let j1 ∈I,Je0 ={j10,· · · , jk0+1} ⊂I,

and

f =fj00

k+1◦ · · · ◦f 0 j0

1 Mor(Uj1)

\

Morµ [ j0

i∈Je0 Uj0

1

,

where f Mor(Uj1), fj00

i Mor(Uj 0

i), i∈ {1,· · · , k+ 1}.Then, Ψj1(f) =Ψj0

k+1(f 0 j0

k+1)◦ · · · ◦Ψj 0 1(f

0 j0

1). (4.42)

Proof: In spirit, the proof is similar to that of Proposition 4.2. Let us denote

Uj0

1 ∪ · · · ∪Ujk0

notation

= U(j10,· · ·, jk0). Again Uj1 U(j10 · · ·jk0) and Uj1 Uj0

k+1 are non empty [ ∵ s(f) = s(f 0 j0

1), t(f) = t(f 0 j0

k+1), and s(f), t(f)Obj(Uj1)]. Then we have,

f Uj1

U(j10 · · ·jk0)Uj0 k+1

=

µ

Uj1 U(j10,· · · , jk0)

¶ [µ

Uj1∩Uj0 k+1

. Therefore there exists g1 Mor¡Uj1U(j0

1,· · · , jk0)

¢

, and g2 Mor¡Uj1 Uj0 k+1

¢

,such that,

f =g2◦g1.

So, we have an isomorphismg0 Mor(Uj0

k)Mor(Ujk+10 ) satisfying, g1 =g−01◦fj00

k◦ · · · ◦f 0 j0

1, g2 =fj00

k+1◦g0.

(28)

Since g1 Mor

¡

Uj1 U(j10,· · · , jk0)

¢

,we can apply [Ind assum 1]to obtain, Ψj1(g1) =Ψj0

k(g 1 0 ◦fj00

k)◦ · · · ◦Ψj 0 1(f

0 j0

1). (4.44)

Similarly for g2,we have

Ψj1(g2) =Ψj0 k+1(f

0 j0

k+1◦g0). (4.45)

Composing (4.44) and (4.45) we arrive at our desired result,

Ψj1(f) =Ψj1(g2)Ψj1(g1)

[∵Ψj1 is a functor, and g2, g1 Mor(Uj1)] =Ψj0

k+1(f 0 j0

k+1◦g0)Ψj 0 k(g

1 0 ◦fj00

k)◦ · · · ◦Ψj 0 1(f

0 j0

1) =Ψj0

k+1(f 0 j0

k+1)Ψj 0 k(f

0 j0

k)◦ · · · ◦Ψj 0 1(f

0 j0

1) [∵Ψj0

k+1|Uj0k+1j0kj0k|Uj0k+1jk0].

(4.46)

Hence proved. ¤

That means, if for J0 ={j10,· · · , jn0} ⊂I, f Mor(Uj1) satisfies f =fj00

n◦ · · · ◦f 0 j0

1, wheref0

j0

k Mor(Uj 0

k), k∈ {1,· · · , n},then, Ψj1(f) =Ψj0

n(f 0 j0

n)◦ · · · ◦Ψj01(f 0 j0

1). (4.47)

Next we come to the second induction assumption[Ind assum 2].

Proposition 4.4 — Suppose [Ind assum 2] is true. Let {j1,· · · , jk+1} ⊂ I, J0 =

{j0

1,· · ·, jn0} ⊂I,and

fjk+1◦ · · · ◦fj1 =fj00

n◦ · · · ◦f 0 j0

1 Mor

µ [

jl∈J Ujl

¶ \

Morµ [ j0

i∈J0 Uj0

i

,

wherefjl Mor(Ujl), l∈ {1,· · · , k+ 1}, fj00

i Mor(Uj 0

i), i∈ {1,· · · , n}.Then, Ψjk+1(fjk+1)◦ · · · ◦Ψj1(fj1) =Ψj0

n(f 0 j0

n)◦ · · · ◦Ψj10(f 0 j0

1). (4.48)

Proof : We follow our previous notation,

(29)

and

Uj0

1∪ · · · ∪Uj0n

notation= U(j0

1,· · ·, jn0). Again U(j1,· · · , jk)U(j01,· · ·, jn0) and Ujk+1∩Uj0

n are non empty [∵s(fj1) =s(f 0 j0

1), t(fjk+1) =t(f0

j0

n),ands(f)Obj(Uj1), t(f)Obj(Ujk+1)]. Then we have, fjk+1◦ · · · ◦fj1 =fj00

n◦ · · · ◦f 0 j0

1

µ

U(j1,· · ·, jk)Ujk+1

¶ \µ

U(j10,· · ·, jn0)

=

µ

Ujk+1∩U(j10,· · · , jn0)

¶ [µ

U(j1,· · · , jk)U(j10,· · · , jn0

.

(4.49)

Therefore there exists g1 Mor

¡

U(j1· · ·jk) U(j10 · · ·jn0)

¢

, and g2 Mor

¡

Ujk+1 U(j0

1,· · · , jn0)

¢

,such that, fj00

n◦ · · · ◦f 0 j0

1 =fjk+1◦ · · · ◦fj1 =g2◦g1.

So, we have a pair of isomorphisms g0 Mor(Ujk) Mor(Ujk+1), g00 Mor(Uj0 n−1) Mor(Uj0

n) satisfying,

g1 =g−01◦fjk◦ · · · ◦fj1, g2 =fjk+1◦g0,

and,

g1 =g00−1◦fj0

n−1 ◦ · · · ◦f 0 j0

1, g2 =fj0

n◦g 0

0.

Now applying [Ind assum 2], and using same argument as previous proposition, we deduce ,

Ψjk+1(fjk+1)◦ · · · ◦Ψj1(fj1) =Ψj0 n(f

0 j0

n)◦ · · · ◦Ψj01(f 0 j0

1).

Hence proved. ¤

Proof : By induction, we conclude, if fjl Mor(Ujl), fj00

i Mor(Uj 0

i) and for J = {j1,· · ·, jm}, J0 ={j10,· · ·, jn0} ⊂I,we have

fjm◦ · · · ◦fj1 =fj00

n◦ · · · ◦f 0 j0

1, then,

Ψjm(fjm)◦ · · · ◦Ψj1(fj1) =Ψj0 n(f

0 j0

n)◦ · · · ◦Ψj01(f 0 j0

(30)

So, (4.39) is proven.

Proof of Theorem 4.2 : We conclude this subsection by presenting the proof of Theorem 4.2. We have already derived all the required results. We only have to collect and organize them. We do not reiterate the notation. They should be assumed to be as per with the Theorem 4.2 and subsequent part of this section.

Verification of [Locality] condition is virtually identical to the given in the proof of Proposition 4.1. For the sake of completeness, we only state the result here.

If, Ψ1,Ψ2 Obj(CU) = Fun(U,C),such that,

Ψ1|Uα =Ψ2|Uα, ∀α∈I, thenΨ1 =Ψ2.

(4.51)

Similarly, if ¡S1 :Ψ1 =Ψ2

¢

,¡S2 :Ψ1 =Ψ2

¢

Mor(CU) =N(U,C),such that,

S1|Uα =S2|Uα, ∀α∈I,

thenS1 =S2. (4.52)

Let us verify the[Gluing]condition.

Ψα Obj(CUα) = Fun(Uα,C) given for eachα I, such that: Ψα|Uαββ|Uαβ, for every non-emptyUαβ.Then we define (Ψ:U−→C)Fun(U,C) = Obj(CU) as follows:

Obj(U) //Obj(C)

Obj([ α∈I

Uα) //Obj(C)

a7→Ψα(a), if a∈Uα, α∈I, (4.53)

and,

Mor(U) //Mor(C)

Genµ [ α∈I

Mor(Uα)

/

/Mor(C),

fjm◦ · · · ◦fj1 7→Ψjm(fjm)◦ · · · ◦Ψ1(fj1), where fjk Mor(Ujk), k∈ {1,· · · , m},

(31)

Since Ψα|Uαβ = Ψβ|Uαβ, (4.53) is well defined. Also (4.39) ensures that (4.54) is well defined. Thus we have a (Ψ:U−→C)Fun(U,C) satisfying,

Ψα =Ψ|α, α∈I.

Next, suppose ¡Sα : Ψα = Ψ0 α

¢

Mor(CUα) = N(U

α,C) is given for each α I, such that, {Ψα} glue to form a Ψ Fun(U,C), and similarly, {Ψ0α} glue to form a Ψ0 Fun(U,C),[as described in the previous part of the proof] andSα satisfy

Sα|Uαβ =Sβ|Uαβ. (4.55)

We defineS ∈ N(U,C) by:

S(a) =Sα(a), for a∈Obj(Uα), α∈I. (4.56)

Above equation is well defined because of (4.55). The proof that (4.56) defines a natural transformation from ΨtoΨ0,is exactly same as the counter part in Proposition 4.1.

And, that completes the proof of Theorem 4.2. ¤

5. Sheaves of Categorical Groups

Objective of this section is to define the (pre)sheaves of categorical groups, and construct an example for the same. In section 2 we made some passing remarks about categorical group valued presheaves. Here we will take a more formal approach. Before that let us briefly review categorical groups, and associated notions.

5.1 Categorical groups

There are many equivalent definitions of a categorical group available in literature [19, 22, 25, 27]. For our purpose we will mostly think of a categorical group in terms of acrossed-module. A categorical group G is given by a categoryG along with a functor

G × G //G (5.1)

which makes both Obj(G) and Mor(G) groups. Some of the immediate consequences are as follows:

(i) the identity-assigning map

(32)

is a homomorphism, and so, 1eis the identity element in Mor(G),whereeis the identity element in Obj(G),

(ii) the source and target maps

s, t: Mor(G) //Obj(G) (5.2)

are both homomorphisms;

(iii) functoriality of (5.1) implies the following exchange law,

(φ2ψ2)(φ1ψ1) = (φ2◦φ1)(ψ2◦ψ1), (5.3)

whenever right hand side is well defined for φ1, φ2, ψ1, ψ2 Mor(G). Here and onwards

will denote the composition of morphisms (as usual) and juxtaposition of two elements denote group product.

Specializing to the case, where both Obj(G) and Mor(G) are Lie groups and the mapss, tand x7→1x are smooth, we have acategorical Lie groupG.

A crossed-moduleis given by a pair of groups Gand H, along with maps α:G×H //H : (g, h)7→αg(h) and τ :H //G,

where τ is a homomorphism, αg is an automorphism of H for each g G, and the map g7→αg Aut(H) is a homomorphism. The map τ and the mapα interrelated via following identities

τg(h)) =gτ(h)g−1,

ατ(h)(h0) =hh0h−1 for all g∈G, h, h0 H. (5.4)

We write a crossed module as (G, H, α, τ). When G and H are Lie groups, and α and τ are smooth, (G, H, α, τ) is called a Lie crossed module. For us, most useful property of a (Lie) crossed module is the following.

It is well known that there is a one-to-one correspondence between categorical (Lie) groups and (Lie) crossed modules [5, 6, 18]. The bijection is given as follows.

(33)

for all g∈G and h ∈H. Then we have a group isomorphism Mor(G) ' // HoαGdefined by the map

Mor(G) //HoαG

:φ7→¡φ1s(φ)1, s(φ)

¢

.

The target mapt, viewed as a mappingHoαG //G, is given by

t(h, g) =τ(h)g for all (h, g)∈HoαG. (5.5)

We note here that the group product inHoαGis given by the usual group multiplication law for a semi direct product

(h2, g2)(h1, g1) =

¡

h2αg2(h1), g2g1

¢

(5.6)

for all (h2, g2),(h1, g1)∈HoαG. It also easily follows that the composition of morphisms in Mor(G)'HoαGis given by

(h2, g2)(h1, g1) = (h2h1, g1); (5.7)

of course this composition is defined only when

τ(h1)g1=t(h1, g1) =s(h2, g2) =g2.

Amorphism between a pair of categorical groups G andH is a functor [5, 6].

λ:G −→ H, (5.8)

such that, both λ: Obj(G) // Obj(H) and λ: Mor(G) // Mor(H) are homomorphisms of groups.

The category of all categorical groups; that is, the category whose objects are categorical groups and morphisms are morphisms between categorical groups (defined in (5.8)), will be denoted as

CatGrp.

Clearly there is a full, faithful, forgetful functor

(34)

andCatGrp is a full subcategory of Cat.Our next goal is to consider theCatGrpCat valued presheaf over a category of a set of (small) categories, C. We define a presheaf of categorical groups or aCatGrp-valued presheaf, over C,to be a contravariant functor from C toCatGrp:

ρ:Cop //CatGrp. (5.9) We shall denote thecategory of presheaves of categorical groups by

Prsh(C,CatGrp). (5.10)

LetBbe a topological category andO(B) be as defined in (4.1). A presheaf of categoricale groups over O(B) is ae sheaf of categorical groups over O(B) if it satisfiese [Locality] and [Gluing]conditions listed between (4.6)-(4.13).

5.2 Functor categoryGU

Let U be a category, and Φ1,Φ2 :U //G be a pair of functors from U to a categorical

groupG.Then the pointwise productΦ2Φ1:U //G is also a functor. In other words, we

have following result [[17], Proposition 3.2].

Lemma5.1 — The set of all functors from U toG form a group.

Proof : Φ2Φ1 is defined as follows.

¡

Φ2Φ1

¢

(x) =Φ2(x)Φ1(x), (5.11)

wherex is in Obj(U) or Mor(U).Thus, iff2, f1Mor(U) and they are composable, then

(Φ2Φ1)(f2◦f1) =Φ2(f2◦f1)Φ1(f2◦f1)

=¡Φ2(f2)Φ2(f1)

¢¡

Φ1(f2)Φ2(f1)

¢

=¡Φ2(f2)Φ1(f2)

¢

¡Φ2(f1)Φ1(f1)

¢

[using (5.3)]

=¡Φ2Φ1

¢

(f2)

¡

Φ2Φ1

¢

(f1).

So Φ2Φ1 is a functor. It is obvious that the constant functor

Φ0 : U //G

References

Related documents

scheme, there are several types of entities: a cloud provider, cloud users, a blacklisting controller and verifiers. The cloud provider and blacklisting controller could be

camera height and angle, sensor integration time and light source distance and height on the 11.. spectra’s signal-to-noise ratio (SNR) were evaluated under laboratory

Medicare 7 Private Health Insurance 7 Emergencies 7 Medical Assistance 8 Dental Services 8 Gyms 8 Accommodation Renting Property 9 Furniture 9 Household Utilities 9 Getting

This paper is devoted for comparing the effect of temperature change on the attenuation coefficient of optical fiber when two laser types [He-Ne and solid state laser]

“I feel like I know that they are not going to find a cure in my lifetime or it is very doubtful that they will but I feel like even at this stage I by participating in the

Home theater experts agree that a theater-like experience is only achieved when the screen size is large enough with respect to the viewing distance from the screen – generally, when

The log files store actions performed by the Red Hat Update Agent such as when your RPM database is opened, when it connects to Red Hat Network to retrieve information from your

Under the Basel II standardized and IRB approaches the Pillar 3 disclosure requirements make the quality of an individual bank’s risk management systems either fully (sections 4 to