Sheaves From Scratch Kay Werndli 11th December, 2010
Dieses Werk, sowie alle darin enthaltenen Abbildungen, stehen unter der Creative Commons CC BY:
$\ C Lizenz. Eine Kopie der Lizenz findet sich unter http://creativecommons.org/licenses/by-nc-sa/2.5/ch/ oder ist brieflich bei Creative Commons, 171 2nd Street, Suite 300, San Francisco, California, 94105, USA erhältlich. CONTENTS
Chapter 1 Categorical Preliminaries ...... 4 1. Basic Definitions and Notations...... 4 2. Limits ...... 4 Chapter 2 Kan Extensions ...... 6 1. Definition and First Properties ...... 6 2. Pointwise Kan Extensions ...... 10 3. Tensor-Hom Adjunction...... 16 Chapter 3 Sheaves on a Space ...... 19 1. Presheaves and the Gluing Axiom...... 19 2. Alternative Gluing Axioms...... 21 3. Topological Constructions of Sheaves...... 24 4. Categorical Constructions of Sheaves...... 26 5. Étale Bundles and Sheafification...... 27 6. Sheaves with Algebraic Structure ...... 33 7. More on Étale Bundles...... 34 8. Stalks and Skyscrapers...... 35 9. Image Functors...... 35 Chapter 4 Ringed Spaces ...... 37 1. Definition and First Properties ...... 37 2. Points of a Ringed Space...... 41 3. Sheaves of Modules on a Ringed Space...... 41 4. Zero Sets ...... 44 5. Dimension Theory ...... 45 6. Coherent Sheaves...... 45 7. Sheaf Cohomology ...... 48 8. Čech Cohomology...... 48 9. Flat Morphisms ...... 48 Chapter 5 Topological Preliminaries ...... 53 1. Jacobson Spaces ...... 53 Chapter 6 Algebraic Preliminaries ...... 55 1. Normal Rings ...... 55 2. The Category of Schemes...... 55 Contents 3
3. Graded Rings ...... 56 4. Chow’s Lemma...... 61 Chapter 7 Analytic Preliminaries ...... 63 1. Analytic Spaces ...... 63 2. Weierstraß’ Preparation Theorem...... 64 3. Riemann Extension Theorem...... 64 4. Dimension Theory ...... 64 Chapter 8 GAGA ...... 65 1. Analytification of Schemes...... 65 2. GAGA for Projective Spaces ...... 66 Index of Notation ...... 67
Bibliography ...... 68
Index ...... 69 Chapter 1
CATEGORICAL PRELIMINARIES
In this chapter, we review some of the categorical facts we will need later on. The reader is expected to have some knowledge of category theory and should at least be familiar with the basic definitions of categories, functors, natural transformations, (co-)limits and adjunctions. The facts and definitions are listed here for completeness’ sake and to introduce the notation used in this text.
1. Basic Definitions and Notations
2. Limits
Consider a diagram F : J → Sets in the category of sets. Recall that a limit of F is a universal (in this context terminal) cone over F , so how should we construct such a limit? A good starting point would be to take the universal object over the FI, where I runs through Q all objects of J, which is I∈|J| FI and then take the subset of all (xI )i∈|J|, which satisfy the cone condition. That is the set n o a x = (xI )I∈|J| (F a) ◦ prI x = (F a)xI = xJ = prJ x for all I −→ J in J ,
th where prI denotes the standard projection to the I component. I.e. it is the subset of all x such that (F a) ◦ prI and prJ agree for all a: I → J in J, which can obviously be stated as an equalizer condition. This process of constructing a limit is obviously completely categorical and does not depend on the category of Sets, which we only took as an example. All that we need are products and equalizers, so that we arrive at the following, well know theorem.
(2.1) Theorem. Let F : J → C be a diagram in a category C. A limit (E, σ) of F is given by the following equalizer diagram
FJ q8 O pr qq J qq pr qqq a qqq qq p e Y / Y E / / FI / FJ HH q HH I∈|J| (a: I→J)∈J HH σ HH I HH prI pra HH# FI / FJ . F a
That is to say that if (E, e) is an equalizer of p = (prJ )(a:I→J)∈J and q = (F a ◦ prI )(a:I→J)∈J, then E is a limiting object of F with limiting cone (σI = prI ◦e)I∈|J|. Paragraph 2. Limits 5
Proof. If (C, τ) is any cone over F then the arrows τI : C → FI form a cone over the objects Q FI and thus the τI factor uniquely through the product I∈|J| FI. Now, the condition that τ is a cone over F is equivalent to p ◦ (τI )I∈|J| = q ◦ (τI )I∈|J|, by which (τI )I∈|J| factors uniquely through the equalizer (E, e). I.e. there exists a unique arrow t: C → E such that (σ ) ◦ t = (τ ) , so that σ ◦ t = τ , which is what we wanted. I I∈|J| I I∈|J| I I (2.2) Corollary. A category C is (finitely) complete iff it has (finite) products and equal- izers.
Of course, all finite products (exept from a terminal object) can be constructed from binary products so that a category is finitely complete iff it has a terminal object, binary products and equalizers. But recall that if 1 ∈ |C| is a terminal object and C,D ∈ |C| any two objects, then a pullback
pr C × D D / D
prC C / 1 is nothing but a product of C and D. Moreover, if a, b: C ⇒ D are two parallel arrows, the product D × D exists, and (a, b): C → D × D is the induced arrow into this product then a pullback
e E / C
(a,b) D / D × D δ along the diagonal δ := (1D, 1D): D → D × D gives us an equalizer (E, e) of a and b. So that we can alternatively state finite completeness as follows.
(2.3) Corollary. A category C is finitely complete iff if has a terminal object and pull- backs. Chapter 2
KAN EXTENSIONS
Anyone who cannot cope with mathematics is not fully human. At best he is a tolerable subhuman who has learned to wear shoes, bathe, and not make messes in the house. Robert Anson Heinlein
1. Definition and First Properties
Let’s consider the following, so called extension problem: Given the two solid 1-arrows
? • ~ b ~~ c ~~ ~ ~ / • a •
find a (dashed) 1-arrow to make the diagram commute (in some sense). If we require com- mutativity on the nose (i.e. the equality a = c ◦ b), we call c a strict extension of a along b. As one immediately guesses, knowing some bits and pieces about 2-categories, this is usually far too strict to give us a useful tool. One should instead only require commutativity up to isomorphism, i.e. a =∼ c ◦ b, which one would (or at least should) probably call a weak extension of a along b. But we go even one step further and only require a (not necessarily invertible) universal 2-arrow a ⇒ c ◦ b to exist.
(1.1) Definition. Given an extension problem (i.e. a diagram of solid arrows as below) in a (meta-)2-category, a left Kan extension of a along b is a pair (k, η) of dotted arrows as in the diagram, with η universal from a to b∗ : Hom(B,C) → Hom(A, C) (i.e. initial in a ↓ b∗). The 2-arrow η is sometimes called the unit of the left Kan extension (whose dual for right Kan extensions is then called the counit), while the 1-arrow k is sometimes (by abuse of language) also called the left Kan extension of a along b.
? B ~ b ~~ KS k ~~ η ~ ~ / A a C If we expand this definition, this means that if we have any other such pair of arrows (k0, η0), then there is a unique 2-arrow α: k ⇒ k0 such that η0 = (α ? b) ◦ η. The notion of a right Kan extension is the co-dual to a left Kan extension (i.e. reverse all 2-arrows but not the 1-arrows). By taking the op- (i.e. reverse only 1-arrows) or coop-dual (i.e. reverse both 1- and 2-arrows), we would get something like a Kan lift. Paragraph 1. Definition and First Properties 7
As all universal constructions, a left Kan extension us unique up to canonical iso- morphism. To wit, if (k, η) and (k0, η0) are two left Kan extensions then there is a unique isomorphism α: k ⇒ k0 such that η0 = (α ? b) ◦ η (and thus also η = (α−1 ? b) ◦ η0). If there is a canonical choice for a left (resp. right) Kan extension of a along b we will usually write “Lanb a” (resp. “Ranb a”) for the 1-arrow of this canonical choice, the 2-arrow being implicit. By the observation above that a Kan extension is unique up ∼ to canonical isomorphism and by abuse of notation, it does no harm to write “k = Lanb a” for the statement “k is the 1-arrow of a left Kan extension of a along b” (and analogously ∼ “k = Ranb a” for a right Kan extension) even if there is no canonical choice for such an extension.
(1.2) Remark. Perhaps we should clarify the use of the adjective “left” in the definiton of a left Kan extensions. One will immediately see the reason if one formulates the external definition of a Kan extension instead of the internal one above. In the same situation as in the last definition, (Lanb a, η) is a left Kan extension of a along b iff ∗ ∗ ∗ η ◦ b : Hom(B,C)(Lanb a, −) → Hom(A, C)(a, b −) is a natural isomorphism of functors Hom(B,C) → Sets (of course to put it that way, we should require each Hom-category to be locally small). One should be aware that b∗ stands ∗ ∗ for two different things here and one should rather write η ◦ 1b instead. Now thas a set it is ` simply the coproduct (i.e. disjoint union) (U,s) PU as a set it is simply the coproduct (i.e. ` 0 disjoint union) (U,s) PU is means exactly that for every k ∈ Hom(B,C) we have a bijection 0 0 Hom(B,C)(Lanb a, k ) → Hom(A, C)(a, k ◦ b), α 7→ (α ? b) ◦ η, which is natural in k0. This is exactly the definition of a left Kan extension and if we are 0 just given such a natural bijection, we can recover η by putting k := Lanb a. Then η is just the image of 1Lanb a under the bijection. Moreover, one immediately deduces from this that if every arrow a has a chosen left Kan extension (Lanb a, η) along b then Lanb is (the object function of) a left adjoint to b∗ (the arrow function of course arising from the universal property of a Kan extension) and η∗ ◦ b∗ is the unit of the adjunction.
(1.3) Example. If J, C are categories and D : J → C a J-diagram in C then D has a colimit if and only if it has a left Kan extension along the unique functor !: J → 1, where 1 is the terminal 1-category. If it has a colimit (L, σ) then L ∈ Ob(C) defines a functor L: 1 → C and σ is a natural transformation D ⇒ L ◦ ! (which is the constant functor L: J → C) which together satisfy the universal property of a left Kan extension. Conversely if (K, η) is a left Kan extension of D along ! then K : 1 → C is nothing but an object in C and η is a colimiting cone D ⇒ K.
(1.4) Remark. For the following example, recall that if C is a locally small category, R ∈ Ob(C) and F : C → Sets then a natural transformation ϕ: C(R, −) ⇒ F is completely determined by r := ϕR1R. For if we have C ∈ Ob(C) and a ∈ C(R,C), we form the diagram ϕ C(R,R) R / FR
a∗ F a C(R,C) / FC , ϕC which commutes by naturality of ϕ. A quick chase of 1R around the diagram shows that ϕC a = (F a)r. 8 Chapter 2. Kan Extensions
(1.5) Example. Let C be a locally small category and C(R, −): C → Sets a func- tor, represented by R ∈ Ob(C). Then a left Kan extension of C(R, −) along a functor G: C → D is given by the functor D(GR, −), represented by GR, together with the unit η : C(R, −) ⇒ D(GR, G−), whose component at C ∈ Ob(C) is simply a 7→ Ga (i.e. the nat- 0 ural transformation determined by 1GR). For let K : D → Sets be another functor together 0 0 0 with a natural transformation η : C(R, −) ⇒ K G (which is determined by ηR1R). If there is some α: D(GR, −) ⇒ K0 satisfying η0 = (α ? G) ◦ η, we calculate
0 ηR1R = αGR ◦ ηR1R = αGR1GR, which completely defines α and gives us the required universal property.
(1.6) Example. Given an adjoint pair f : A B : g (left adjoint on the left) in a 2- category with unit η : 1A → gf and counit ε: fg → 1B then (g, η) is a left Kan extension of 1A along f and moreover f perserves this Kan extension, meaning that after composing everything with f, (fg, fη) is still a left Kan extension of f ◦ 1A = f along f (similarly (f, ε) is a right Kan extension of 1B along g and g preserves it). The converse of this statement is also true: A 1-arrow f : A → B has a right adjoint iff 1A has a left Kan extension (g, η) along f and f preserves this. If that’s the case then g is right adjoint to f and η is the unit of the adjunction.
Proof.“ ⇒”: An even stronger statement is proved in the following remark. “⇐”: As stated above, f preserving the left Kan extension (g, η) means that (fg, f ? η) is a 0 0 left Kan extension of f along itself. Putting k := 1B and η := 1f in the definition of a left Kan extension gives us a unique 2-arrow ε: fg ⇒ 1B such that (εf) ◦ (fη) = 1f which is one of the triangular equalities. We can derive the other one from the uniqueness properties of our Kan extensions available. For consider the 2-arrow (gεf) ◦ (gfη) ◦ η : 1A ⇒ gf. Because (g, η) is a left Kan extension of 1A along f there is exactly one α: g ⇒ g such that
(α ? f) ◦ η = (g ? ε ? f) ◦ (g ? f ? η) ◦ η ∆=-eq. (g ? f) ◦ η and obviously this must be α = g. But observe that by the swap trick (gfη) ◦ η = (ηgf) ◦ η and thus also α = (gε) ◦ (ηg), which is the second triangular equality.
(1.7) Remark. We can work out this example a little more: If f a g with unit η and counit ε, the Kan extension (g, η) of 1A along f is absolute, meaning that all 1-arrows h: A → C preserve it. To wit, for every 1-arrow h: A → C the composite (hg, hη) is again a left Kan extension of h ◦ 1A = h along f.
? B hg f ~ g ~~ KS ~~ η ~~ A / A / C 1A h
Proof. Let h0 : B → C and η0 : h ⇒ h0f. We are looking for an α: hg ⇒ h0 such that
h?η α?f η0 h /hgf /h0f = h /h0f . Paragraph 1. Definition and First Properties 9
The only reasonable choice for such an α from the given data is α := (h0 ? ε) ◦ (η0 ? g) and indeed this α satisfies the above equation since by the triangle equation (ε ? f) ◦ (f ? η) = 1f we calculate (using the swap trick)
(α ? f) ◦ (h ? η) = (h0 ? ε ? f) ◦ (η0 ? g ? f) ◦ (h ? η) = (h0 ? ε ? f) ◦ (h0 ? f ? η) ◦ η0 = h0 ? (ε ? f) ◦ (f ? η) ◦ η0 = (h0 ? f) ◦ η0 = η0 Moreover, this α is unique. For if any α0 satisfies the equation, we first apply horizontal com- position from the right by g (that’s 1g to be precise) and afterwards apply vertical composition from the left by h0 ? ε, yielding
h?η?g α?fg 0 η0?g 0 hg /hgfg /h0fg h ?ε /h0 = hg /h0fg h ?ε /h0 .
But again by the swap trick and the other triangle equality, we have (h0 ? ε) ◦ (α0 ? f) ◦ (h ? η) ? g = (h0 ? ε) ◦ α0 ? (f ◦ g) ◦ (h ? η ? g) = α0 ◦ (h ? g ? ε) ◦ (h ? η ? g) = α0 ◦ h ? (g ? ε) ◦ (η ? g) = α0 ◦ (h ? g) = α0 thus infering that α0 = (h0 ? ε) ◦ (g ? η0) = α. Motivated by this example, where we viewed adjoint arrows as special cases of Kan extensions, we can ask ourselves on the other hand how Kan extensions behave, when composed with an adjoint arrow.
(1.8) Theorem. Left adjoints preserve left Kan extensions. I.e. if (k, κ) is a left Kan extension of a along b as in the diagram then (fk, fκ) is a left Kan extension of fa along b.
B fk ? @ b ~ KS @ k ~~ @@ ~~ κ @@ ~ @ f ~ / / A a C o _ D g
Proof. Given any k0 : B → D and κ0 : fa ⇒ k0b we consider (g ? κ0) ◦ (η ? a): a ⇒ gfa ⇒ gk0b, where η is the unit of the adjunction. By the universal property of a left Kan extension, we get a unique 2-arrow α: k ⇒ gk0 such that (g ? κ0) ◦ (η ? a) = (α ? b) ◦ κ. This α in turn yields β := (ε ? k0) ◦ (f ? α): fk ⇒ fgk0 ⇒ k0 as required, where ε is the counit of the adjunction. β thus defined has the required property: (β ? b) ◦ (f ? κ) = (ε ? k0) ◦ (f ? α) ? b ◦ (f ? κ) = (ε ? k0 ? b) ◦ (f ? α ? b) ◦ (f ? κ) = (ε ? k0 ? b) ◦ (f ? g ? κ0) ◦ (f ? η ? a) swap= κ0 ◦ (ε ? f ? a) ◦ (f ? η ? a) ∆=-eq. κ0. Moreover, this is the unique β that does so, because α is unique. To wit, if β0 : fk ⇒ k0 is another arrow such that (β0 ? b) ◦ (f ? κ) = κ0, we want to exploit the unicity of α. Thus we consider (g ? β0) ◦ (η ? k): k ⇒ gfk ⇒ gk0 and this 2-arrow satisfies that
(g ? β0 ? b) ◦ (η ? k ? b) ◦ κ swap= (g ? β0 ? b) ◦ (g ? f ? κ) ◦ (η ? a) = (g ? κ0) ◦ (η ? a) 10 Chapter 2. Kan Extensions and thus α = (g ? β0) ◦ (η ? k). Because β = (ε ? k0) ◦ (f ? α), we conclude
β = (ε ? k0) ◦ (f ? g ? β0) ◦ (f ? η ? k) swap= β0 ◦ (ε ? f ? k) ◦ (f ? η ? k) ∆=-eq β0
As an immediate consequence of (1.3) and this theorem we get the following well- known fact “for free”.
(1.9) Corollary. Left adjoint functors preserve colimits.
2. Pointwise Kan Extensions
A particularly interesting case of a Kan extension is when we are working in the (strict) (meta-)2-category of all categories, so that our 1-arrows are functors and our 2-arrows are natural transformations. If we assume certain small- and completeness conditions then Kan extensions can be explicitly calculated as a colimit. Moreover, for a very important special case, which we will investigate later, the unit will even be an isomorphism.
(2.1) Remark. For C, D any categories, F : C → D a functor, and D ∈ Ob(D), we always have a projection
Q F ↓ D −→ C, sending an arrow a: C → C0 in C, which makes a diagram
F a FC / FC0 :: Ó :: ÓÓ b :: ÓÓb0 : ÓÑ Ó D
(with b, b0 objects of F ↓ D) commute to itself. This projection is usually not full because nothing guarantees us that for any given a: C → C0 we can find such a diagram.
(2.2) Theorem. (Colimit Formula) Given a diagram of solid 1-arrows in CAT
? E ~ G ~~ KS K ~~ η ~~ C / D F such that for each E ∈ Ob(E) we have chosen a colimit
Q F σa colim(G ↓ E −→ C −→ D) = KE, (FC −→ KE)(a: GC→E)∈Ob(G↓E) .
Then the KE constitute the object function of a functor K as in the diagram. Moreover, these colimits determine a left Kan extension (K, η) of F along G, where
η σ1 FC −−→C KGC := FC −−−→GC KGC for σ the chosen colimit for E = GC above. Paragraph 2. Pointwise Kan Extensions 11
Proof. First, let’s extend the family (KE)E∈Ob(E) to a functor. Of course, this is done by exploiting the universal property of the colimit. Any arrow f : E0 → E in E determines a 0 F cocone under G ↓ E → C −→ D, namely (σf◦a : FC → KE)(a: GC→E0)∈Ob(G↓E0), where σ is the colimiting cocone as in the proposition, thus inducing a unique arrow Kf : KE0 → KE. Plainly, this does in fact define a functor. The next thing we need to check is that η as defined in the theorem is indeed a natural transformation. For this purpose, let C,C0 ∈ Ob(C) and σ, σ0 the chosen colimits from the theorem for E = FC and E = FC0 respectively. We now draw a naturality square and include the obvious diagonal arrow
σ0 1GC0 C0 FC0 / KGC0 HH HH σGf f F f HH KGf HH HH$ CFC / KGC . σ1GC
The upper triangle commutes by definition of K and the lower triangle commutes by the naturality of σ. The last — and hardest — thing to check is the universal property of a left Kan extension being satisfied by η. To do so, let K0 : E → D be another functor and η0 : F ⇒ K0G a natural transformation. We need to find a natural transformation α: K ⇒ K0 such that η0 = (α ? G) ◦ η. The only way to construct α form the given data is to exploit once again the univeresal property of the colimit. So for E ∈ Ob(E) and σ as in the proposition, we have for each a: GC → E in G ↓ E a diagram of solid arrows as shown on the left.
0 ηC f F f GC FC / K0GC C0 / C FC0 / FC
σ 0 η0 0 a a K a C0 ηC Gf K0Gf (2.3) EKE / K0E GC0 / GC K0GC0 / K0GC ∃!αE 0 : 0 :: Õ 00 : ÕÕ 0 0 a 0 0 : Õ 0 0 a 0 K a :: ÕÕ K a 0 × : ÕÒ Õ E K0E
0 0 0 0 F By functoriality of K and naturality of η the (K a)◦ηC are a cocone under G ↓ E → C −→ D (cf. the right-hand diagram above) and by the universal property of the colimit there exists 0 a unique arrow αE : KE → K E as in the above diagram, rendering it commutative. These 0 αE do in fact define a natural transformation α: K ⇒ K as required, which follows once again form the universal property of the colimits σ. To wit, for f : E0 → E in E and σ, σ0 as above and a: GC → E0 in G ↓ E0 arbitrary (so f ◦ a: GC → E0 → E lies in G ↓ E), we get a diagram of solid arrows
FC FC Ø 66 ØØ 0 σ 66 Ø σa f◦a 6 ØØ 66 η0 Ø Kf 6 η0 C ØØ KE0 / KE 66 C (2.4) ØØ 66 ØØ ∃!ψ 66 Ø αE0 αE 6 ØØ 66 ØÓ Ø # 6 K0GC / K0E0 / K0EKo 0GC , K0a K0f K0(f◦a) 12 Chapter 2. Kan Extensions
where the upper square and the two (outer) triangles commute by definition of Kf, αE, 0 and αE0 . Thus the lower square commutes if we precompose it with σa and this holds for 0 0 0 0 all a ∈ Ob(G ↓ E ) meaning that the αE ◦ Kf ◦ σa = K f ◦ αE0 ◦ σa form cocone under G ↓ E0 → C → D and by the universal property of the colimit σ0 there exists a unique 0 0 0 0 diagonal arrow ψ as in the diagram such that ψ ◦ σa = αE ◦ Kf ◦ σa = K f ◦ αE0 ◦ σa and thus by unicity the lower square commutes. So α: K ⇒ K0 is indeed natural and going back 0 to (2.3) it obviously satisfies η = (α ? G) ◦ η, plainly by putting a = 1GC . Finally, what is left to check is the uniqueness of α. To do so let α: K ⇒ K0 be any natural transformation satisfying η0 = (α ? G) ◦ η. Then again (2.3) commutes for any C ∈ Ob(C) and a = 1GC and we need to check that this even holds for any a: GC → E because then our arbitrary α we are considering here would be the same as the one above by unicity of αE in (2.3). To prove our claim, we consider the diagram of solid arrows (2.4) and 0 put E := GC, a := 1GC . In that case the left-hand triangle as well as the both squares still commute and the path around this trapezium is the sameas the right-hand triangle, implying that this commutes, too. But this is exactly (2.3) with a replaced by f : GC → E. (2.5) Remark. As one would expect, there is a similar theorem for right Kan extensions: If in the theorem, we replace G ↓ E by E ↓ G and the colimit by a limit then the KE can be extended to a functor E → D and this together with the limiting cone determines a right Kan extension of F along G, which is then called the limit formula. It is in some sense a dual statement. However, we have to be careful as there are natural transformations involved, which means that we do not have a dual statement in the ordinary (1-categorical) sense. We can still deduce the limit formula from the colimit formula (and vice versa) as “dualising” is really a 2-categorical process. To be precise, the proof boils down to the fact that we have an involution of (meta-)2-categories CATco =∼ CAT, namely the transposition as defined in (2.12) below.
(2.6) Definition. A left Kan extension, which is given by the colimit formula from the theorem is also called a pointwise left Kan extension. Analogously for a right Kan extension determined by the limit formula.
(2.7) Corollary. Let C be a small category and D cocomplete (i.e. for every small category J the diagonal functor D → DJ has a left adjoint, meaning that we have chosen colimits). Then every functor F : C → D has a (pointwise) left Kan extension along any ∗ E C G: C → E and consequentially (cf. (1.2)) G : D → D has a left adjoint LanG.
As another corollary to the colimit formula, we get the well-known and often used characterisation of an adjunction by the existence of universal arrows. This says that a functor F : C → D has a right adjoint if and only if for every D ∈ Ob(D) there is a universal arrow from F to D, meaning that F ↓ D has a terminal object. The usual elementary proof of this fact involves lots of diagrams but as we have already done this work in the proof of the colimit formula, we get this result “for free”. (2.8) Corollary. For F : C → D the following are equivalent
(a) F has a right adjoint G with unit η : 1C ⇒ GF and counit ε: FG ⇒ 1D.
(b) For every D ∈ Ob(D) we have a chosen universal arrow εD : F GD → D (here GD is just a name for an object of C) from F to D (i.e. (GD, εD) is terminal in F ↓ D).
(c) 1C has a pointwise left Kan extension (G, η) along F , which is absolute (i.e. any functor with domain C preserves it). Paragraph 2. Pointwise Kan Extensions 13
(d) 1C has a left Kan extension (G, η) along F , which is absolute.
(e) 1C has a left Kan extension (G, η) along F and F preserves this.
Proof. “(a) ⇒ (b)”: εD is terminal in F ↓ D by the universal property of the counit ε. “(b) ⇒ (c)”: If H : D → E is any functor and D ∈ Ob(D) there is a canonical choice for a colimit of HFQ: F ↓ D → C → D → E, which is given by evaluating HFQ at the terminal object. To wit, L := HFQ(GD, εD) = HF GD is a colimiting object with colimiting cocone σ : HFG ⇒ L given by σ(C,a: FC→D) := HF !(C,a) : HFQ(C, a) = HFC → L, where !(C,a) : C → GD is the unique arrow from (C, a) into the terminal object (GD, εD). “(c) ⇒ (d) ⇒ (e)”: Trivial. “(e) ⇒ (a)”: This is just (1.6). (2.9) Corollary. In the same situation as in the theorem, if G is fully faithful then η is an isomorphism.
Proof. For C ∈ Ob(C) every object b: GC0 → GC in G ↓ GC is of the form b = Ga for 0 a unique a: C → C because G is fully faithful. Thus 1GC is a terminal object in G ↓ GC and the colimit KGC can be calculated by evaluating G ↓ GC → C → D at this terminal ∼ object, yielding that KGC = FC is this colimit with colimiting cocone ηC = 1FC , which is an isomorphism. (2.10) Corollary. Given adjoint functors F a G with unit η and counit ε then F : C → D is fully faithful if and only if η is an isomorphism.
Proof.“ ⇒”: By the two last corollaries. ∼ “⇐”: η is an isomorphism 1C = GF which is equivalent to each component ηC being an 0 0 0 isomorphism thus rendering (ηC )∗ : C(C ,C) → D(C , GF C) (with C,C ∈ Ob(C)) bijective. −1 ∼ Furthermore, by definition of an adjunction ϕC,D : C(C, GD) = D(FC,D), b 7→ εD ◦ F b is also bijective and thus (using a triangular identity) the composite
0 (ηC )∗ 0 ∼ 0 C(C ,C) −−−→ C(C , GF C) = D(FC ,FC), a 7→ ηC ◦ a 7→ εFC ◦ F ηC ◦ F a = F a is a bijection, too. But this exactly means that F is fully faithful as we claimed. This corollary can be generalized further and we can find necessary and sufficient criteria for fullness resp. faithfullness of a left adjoint in terms of the unit.
(2.11) Corollary. In the same situation as in the last corollary.
(a) F is faithfull iff all components ηC of the unit are monic;
(b) F is full iff all components ηC of the unit have a section.
In view of the next proof which might be somewhat confusing because of the unusual practice of viewing a contravariant Hom-functor as a functor with values in Setsop (if we have a contravariant functor from C to D we might either view this a a functor Cop → D or as a functor C → Dop). With the risk of even causing more confusion let us define the following.
(2.12) Definition. Let C, D be categories and F : Cop → D. We write F t for the functor C → Dop defined by F and call this the transpose of F . Obviously for F,G: Cop → D,
op DC (F,G) = DopC(Gt,F t) 14 Chapter 2. Kan Extensions and thus transposing itself defines an antiisomorphism from DCop to DopC (i.e. it is an op op isomorphism DC =∼ DopC). In fact, transposing defines a (meta-)1-functor (even an involution) CAT → CAT sending C to Cop and any functor F : C → D to its transpose F t : Cop → Dop. However it does not define a 2-functor CAT → CAT as it is contravariant on Hom-categories (as seen above), i.e. it defines a (meta-)2-functor (even an involution) CATco → CAT.
It is an easy exercise to check that (F ↓ G)op = Gt ↓ F t and with that to deduce the limit formula from the colimit formula. In fact the 2-involution “transpose” allows one to dualise a wider class of statements than “ordinary” dualising because it is a 2-functor and thus we can also dualise statements involving 2-arrows (i.e. natural transformations). Let us adopt the convention that presheaves are of the form Cop → Sets where not stated differently (in particular any representable presheaf C(−,C) will be viewed as functor of that form). Thus if P,Q are presheaves on C and we write Nat(P,Q) it is always implicitly understood that P and Q take values in Sets and thus the components of a natural transformation between these two as well. The reader might be familiar with the fact that colimits in a locally small category can be defined via limits in Sets using representable presheaves. To wit, for D a locally small category and F : J → D a diagram, a cocone (L, σ) under F is a colimit if and only if ∗ op D(L, D), (σJ )J∈Ob(J) is a limit in Sets (i.e. a colimit in Sets ). So, to check that (L, σ) is a colimit, it is enough to evaluate all representable presheaves at it and see if we get a limit then (we call this the presheaf criterion for colimits). This fact can be generalized to pointwise left Kan extensions and as for colimits we get a presheaf criterion for pointwise Kan extensions. For this, remember that a limit for a diagram F : J → D (with J small and D locally small) is the same as a representation of the functor DJ(∆−,F ): Dop → Sets (where ∆: D → DJ is the diagonal, sending every arrow to the corresponding constant transformation). That is, it’s an object L ∈ Ob(D) and for each D ∈ Ob(D) a bijection
∼ J ϕD : D(D,L) = D (∆D,F ), which is natural in D. As one would guess, this is a special instance of the Yoneda lemma which gives us a bijection
D(−,L) ⇒ DJ(∆−,F ) , DJ(∆L, F ) natural in L and F , so that a limiting cone is simply the image of a representation of DJ(∆−,F ) and vice versa.
(2.13) Proposition. Given a diagram E ←−G C −→F D in CAT with D locally small. Then F has a pointwise left Kan extension along G if and only if there is a K : E → D together with an η : F ⇒ K ◦ G such that after composing it with an arbitrary representable presheaf t op t ∗ (viewed as a functor D(−,D) : D → Sets ) the resulting D(K−,D) , (ηC )C∈Ob(C) is a left Kan extension of D(F −,D)t along G.
Proof.“ ⇒”: The representable presheaf D(−,D)t : D → Setsop preserves colimits (because D(−,D) = Dop(D, −): Dop → Sets preserves limits). In particular, it preserves pointwise left Kan extensions. “⇐”: As seen above, a colimit for a diagram H : J → D is nothing but a representation for DJ(H, ∆−): D → Sets, where ∆: D → DJ is the diagonal functor. Thus for our Kan Paragraph 2. Pointwise Kan Extensions 15 extension (K, η) to be pointwise, it is enough to show that for each E ∈ Ob(E), D ∈ Ob(D) there is a bijection F D(KE,D) =∼ Nat(G ↓ E → C −→ D,D), which is natural in D. To get this, we notice that by the universal property of a left Kan extension (upper row), we have for each K0 : Eop → Sets a bijection as in the lower row of ∼ Nat(D(K−,D)t,K0t) / Nat(D(F −,D)t,K0tG)
Nat(K0, D(K−,D)) ∼ / Nat(K0G, D(F −,D)), η0 / η0G ◦ (η−)∗ and this bijection is natural in K0 and D. In particular for K0 := E(−,E) with E ∈ Ob(E), we get bijections D(KE,D) =∼ Nat E(−,E), D(K−,D) =∼ Nat E(G−,E), D(F −,D), where the first one is just the Yoneda lemma (g 7→ γ with γE0 h := g ◦ Kh). What is left to show is that the natural transformations E(G−,E) ⇒ D(F −,D) are in 1-1-correspondence with cocones (i.e. a natural transformation) from G ↓ E → C → D to D. But this is true; for a natural transformation α: E(G−,E) ⇒ D(F −,D) is completely determined by its components, which is for each C ∈ Ob(C) a map αC : E(GC, E) → D(FC,D). I.e. for each a: GC → E in Ob(G ↓ E) an αC a: FC → D and the naturality of α is the same as the cocone-property of the αC a. Thus we have a bijection ∼ F Nat E(G−,E), D(F −,D) = Nat(G ↓ E → C −→ D,D), α 7→ (αC a)(C,a)∈Ob(G↓E), which is clearly natural in D and E. To sum this up, we have bijections F D(KE,D) =∼ Nat E(G−,E), D(F −,D) =∼ Nat(G ↓ E → C −→ D,D) all natural in D and E. As a corollary (to the proof really) we get a criterion for deciding if a (K, η) is a pointwise left Kan extension even if D is not cocomplete. (2.14) Corollary. Given a diagram E ←−G C −→F D in CAT with D locally small and K : E → D, η : F ⇒ K ◦ G. Then (K, η) is a pointwise left Kan extension of F along G if and only if for all D ∈ Ob(D), E ∈ Ob(D) the map D(KE,D) → Nat E(G−,E), D(F −,D) , g 7→ γ with γC a := g ◦ Ka ◦ ηC is a bijection. As another corollary, we get the above mentioned presheaf criterion for colimits. We will state its dual here for we will need it in that form later in the text. Recall that a colimit of a diagram F : J → C is nothing but a left Kan extension along the unique functor !: J → 1 = {0}. Obviously, any such Kan extension is automatically pointwise because the standard projection ! ↓ 0 → J is an isomorphism of categories, so that the colimit formula reads as colim(! ↓ 0 → J → C) = colim(F ) and this colimit exists because we assumed that F has a left Kan extension along !. (2.15) Corollary. (Presheaf Criterion) Let C is a locally small category, F : J → C a small diagram (i.e. J is small) and (L, σ) a cone over F . Then (L, σ) is a limit of F if and only if for every C ∈ Ob(C) the image cone C(C,L), (σJ ∗)J∈Ob(J) of (L, σ) under C(C, −) is a limit of C(C, −) ◦ F : J → C → Sets. In short terms, the family of all representable functors reflects limits. 16 Chapter 2. Kan Extensions
3. Tensor-Hom Adjunction
The important special case we mentioned at the beginning of the last section is the case where in theorem (2.2) op F = y: C → Cb = SetsC is the Yoneda embedding. The corollary (2.9) then gives us that a left Kan extension is really a weak extension (i.e. the Kan extension’s unit is an isomorphism). We will study these particular Kan extensions in this and the next paragraph. While we have not introduced ends or the so-called end formula and won’t do that in the rest of the text (simply because it is just another way of writing up the colimit formula using the less comon notion of a end) we will however at least mention the special case of an end, where it reduces to the easy-to-grasp notion of the so-called elements of a presheaf. (3.1) Definition. Let C be a category and P : Cop → Sets a presheaf. We write Z P := (∗ ↓ P )op = P t ↓ ∗ (where ∗ is a one-point set) C for the category of elements of P (be aware that the same term is also used for R C P := ∗ ↓ P ). Its objects are pairs (C, s) with C ∈ Ob(C) and s ∈ PC and the arrows (C0, s0) → (C, s) are arrows a: C0 → C in C satisfying (P a)s = s0. If C is small, this construction can obviously R R be extended to a functor C : Cb → Cat As in (2.1) the category C P comes with a natural R 0 0 projection πP : C P → C which sends and object (C, s) to C and an arrow (C , s ) → (C, s) to its underlying arrow C0 → C in C. Obviously, this projection is natural in P , i.e. it is a R natural transformation C ⇒ C, where C denotes the constant functor Cb → Cat,P 7→ C. R (3.2) Remark. An alternative description of C P , which we will use is as the comma category y ↓ P . An object of y ↓ P is nothing but a natural transformation α: y C ⇒ P , where C ∈ Ob(C) and y C = C(−,C) and the Yoneda lemma gives us the bijection ∼ Cb (y C,P ) = Nat C(−,C),P = P C, α 7→ αC 1C , which is natural in C and P . Thus, by identifying these two sets, an object of y ↓ P is nothing but a C ∈ Ob(C) together with an element of PC and (by naturality of the above bijection in C) an arrow of y ↓ P is what one would expect, indeed yielding an isomorphism y ∼ R ↓ P = C P . But because the Yoneda isomorphism is also natural in P , this is even an y ∼ R isomorphism of functors ↓ − = C and in the following we freely identify these two functors y R with one another. Of course, the standard projection ↓ − → C is precisely C → C under this identification. (3.3) Theorem. (Tensor-Hom Adjunction) Given categories C, E with C small and E cocomplete (i.e. we have chosen colimits). Then any functor F : C → E induces an adjunction
−⊗ F C / Cb o _ E , E(F,−) where − ⊗C F := K is the left Kan extension of F along y defined by the colimit formula. Explicitly, this means that for every P ∈ Ob(Cb ) and every E ∈ Ob(E) we have a bijection Z ∼ πP F E(P ⊗C F,E) = Nat(P, E(F −,E)), where P ⊗C F = colim P −−→ C −→ E C and this bijection is natural in P and E. Moreover, F factors through − ⊗C F , meaning that ∼ we have an isomorphism of functors η : F = (− ⊗C F ) ◦ y as in the last corollary. Paragraph 3. Tensor-Hom Adjunction 17
Proof. Let P ∈ Cb , E ∈ Ob(E) and θ ∈ Nat(P, E(F −,E)), so that for every f : C → C0 in C, we get a commutative diagram
θ C Nat(y C,P ) =∼ PC C / E(FC,E) O O O f (y f)∗ P f (F f)∗ C0 Nat(y C0,P ) =∼ PC0 / E(FC0,E) . θC0 R So for s ∈ PC ⊆ | C P | we get θC s: FC → E in E and as one sees from the commutative R diagram, all these θC s together form a cocone under C P → C → E thus inducing a unique [ [ arrow θ : P ⊗C F → E satisfying θC s = θ ◦ σ(C,s), where σ is the colimiting cocone from the colimit formula. This defines a map
Nat(P, E(F −,E)) → E(P ⊗ F,E)
[ [ [ [ as proposed. This map is obviously injective for if θ = ι then θC s = θ ◦σ(C,s) = ι ◦σ(C,s) = ιC s for all s ∈ PC implying that θC = ιC for all C ∈ Ob(C) and thus θ = ι. The map is also surjective for if g : P ⊗ F → E is any arrow then for C ∈ Ob(C), we define θ : P ⇒ E(F −,E) by θ : PC → E(FC,E), s 7→ g ◦ σ . θ thus defined is obviously natural and θ [ = g. C (C,a)
(3.4) Remark. Let us quickly calculate the unit and counit of this adjunction. The unit
at P ∈ Cb is the unique natural transformation
] ηP = 1P ⊗F : P ⇒ E(F −,P ⊗ F )
[ [ [ such that ηP = 1P ⊗F . But ηP is defined by (ηP )C s = ηP ◦ σ(C,s) = σ(C,s) for all C ∈ |C|, s ∈ PC and this defines the whole of ηP . Conversely, the counit at E ∈ |E| is
[ εE = 1E(F −,E) : E(F −,E) ⊗ F → E, which is again defined by εE ◦ σ(C,s) = (1E(F −,E))C s = s for all C ∈ |C|, s ∈ E(FC,E).
(3.5) Corollary. Every presheaf (of sets) on a small category C is a colimit of repre- sentables. To be more precise, if P : Cop → Sets is a presheaf on a small category C then
Z π y P =∼ colim P −−→P C −→ Cb C
Proof. Consider the left Kan extension − ⊗ y: Cb → Cb of the Yoneda embedding y: C → Cb along itself. By the theorem, this has a right adjoint Cb (y, −): Cb → Cb ,P 7→ Cb (y −,P ) and Cb (y −,P ) =∼ P by the Yoneda lemma (this is indeed an isomorphism of functors since the Yoneda isomorphism Cb (y C,P ) =∼ PC is natural in C) but by naturality of the Yoneda iso- morphism in P we do even have an isomorphism of functors Cb (y, −) =∼ 1 and by uniqueness Cb of adjoints we conclude − ⊗ y =∼ 1 , which gives the desired isomorphism as P ⊗ y is just Cb the colimit from the proposition.
The Tensor-Hom adjunction is not only useful because it gives us a pair of adjoint functors (which is already very good) but because it also gives us an equivalence of certain subcategories, as does any adjunction. Because we will need this property time and again, let us state it precisely. 18 Chapter 2. Kan Extensions
(3.6) Theorem. Let F : C → D : G be an adjunction (left adjoint on the left) with unit 0 0 η : 1C ⇒ GF and counit ε: FG ⇒ 1D and let C 6 C, D 6 D be the full subcategories of all objects where η resp. ε are isomorphisms. Then the adjunction restricts to an equivalence 0 0 0 0 ∼ ∼ F : C ' D : G , whose isomorphisms 1C0 = GF , FG = 1D0 are given by η and ε respectively. Proof. We only need to check that the functors F 0, G0 are well-defined (i.e. if C ∈ C0 then FC ∈ D0 and similarly for D ∈ D0). This follows from the triangular identity. Indeed, if we insert C ∈ C0 into one of the triangular identities, we get
1 F η ε FC −−→FC FC = FC −−−→C F GF C −−→FC FC but F ηC is an isomorphism (since ηC is) and thus εFC is its inverse and in particular an ismorphism itself. Similarly for D ∈ D0 using the other triangular identity. Chapter 3
SHEAVES ON A SPACE
I had hoped that [the] hints contained [. . .] would suffice for a skilled mathematician to develop the course of the argument. IGOR ROSTISLAVOVICH SHAFAREVICH
1. Presheaves and the Gluing Axiom
Let X be a topological space. The open subsets of X are partially ordered by inclusion and thus form a poset (even a Heyting algebra) and we write L(X) for this poset (viewed as a category) and call it the associated locale to X. In fact, L defines a functor Top → Catop (or even Top → Loc, where Loc is the category of locales), sending a continuous map f : X → Y to f −1 : L(Y ) → L(X). (1.1) Definition. A presheaf on a topological space X with values in a category A is a functor P : L(X)op → A and a morphism of presheaves is simply a natural transformation between two such functors. Thus all presheaves on X with values in A form a category, L(X)op namely PShA(X) := A . If U ⊆ X is an open set. then the elements of PU are called (cross-)sections (or U-(cross-)sections to be precise) and if i: V ⊆ U is an arrow in L(X) we write −|V := P i: PU → P V, f 7→ f|V and call this the restriction to V . A presheaf with values in Sets will be simply called a presheaf and we write PSh(X) for the category of presheaves (of sets) on X. (1.2) Example. • If U ⊆ X is open we have the representable presheaf associated to U. This sends and open subset V ⊆ X to a one-point set ∗ if V ⊆ U and to the empty set ∅ otherwise. The restriction maps are obvious.
• The (pre-)sheaf C(−, R) associates to each U ⊆ X the set of C(U, R) of continu- ous maps to the real number line. The restriction maps are plainly given by the restriction of functions. This is even a (pre-)sheaf of R-algebras. Similarly, if our topological space X is replaced by a smooth resp. complex-analytic manifold or ∞ the like, one can form the (pre-)sheaves C (−, R), H(−, C) etc. of smooth resp. holomorphic functions. • If A has a terminal object 1 (e.g. a one-point set in Sets) then we get for each x ∈ X, A ∈ Ob(A) the so-called skyscraper sheaf over x with stalk A, denoted by op Skyx(A): L(X) → A, which is defined by ( A x ∈ U U 7→ . 1 x∈ / U 20 Chapter 3. Sheaves on a Space
The restriction maps are again obvious (they are either the identity arrow A → A or the unique map to the terminal object).
(1.3) Remark. (Subpresheaves) Recall that a subpresheaf (i.e. a subobject) of P is an equivalence class of monomorphisms S P . Because a morphism of presheaves S → P is a monomorphism iff all the components SU → PU are monomorphisms (i.e. injections), every such monomorphism S P is equivalent to a unique one, where SU ⊆ PU is actually a subset and the components SU PU are inclusions (and so the restriction maps of S are induced by the restriction maps of P ). It follows that the category PSh(X) is well- powered. By abuse of language, we will usually use the term “subpresheaf” interchangeably for a subobject (i.e. a whole equivalence class) or a representative of such a subobject (i.e. a monomorphism S P ) or – even more restrictive – for the unique representative S P , where all the components SU PU are inclusions of subsets. Because the category PSh(X) is complete (since Sets is), every (small) family of T subobjects Pi P has an infimum (i.e. an intersection) S = i∈I Pi, which is nothing but the pullback of all Pi P . In the case where the components of Pi P are inclusions of subsets (which we can always assume), this is particularly easy to describe. It is nothing but T SU := i∈I PiU for U ⊆ X open. It follows that for every family (MU)U∈|L(X)| of subsets MU ⊆ PU there is a smallest subpresheaf S P containing M (i.e. MU ⊆ SU for all U ∈ |L(X)|); it is simply the intersection of all subpresheaves containing M. We call this the subpresheaf generated by M. Explicitly, it is given by
[ 0 SU = MU |U ⊆ PU (U⊆U 0)∈L(X) as one easily checks. Consequentially, every (small) family of subobjects Pi P has a supremum (i.e. a union), too. It is nothing but the subpresheaf generated by the family S i∈I PiU U∈|L(X)|.
The motivation to abstractly define the notion of a sheaf comes exactly from the second example above. The outstanding property of these (pre-)sheaves is that we can “glue together” a compatible family of functions. To be precise, if U is an open subset of X and S (Ui)i∈I an open cover of U (i.e. U = i∈I Ui) and (fi : Ui → R)i∈I is a family of continuous maps that are compatible (i.e. they agree on intersections, fi|Ui∩Uj = fj|Ui∩Uj ∀i, j ∈ I) then there is a unique continuous map f : U → R such that f|Ui = fi ∀i ∈ I (this condition is sometimes expressed as “matching/compatible functions are uniquely collatable”). This is exactly the defining property and gives one a glimpse of where sheaves might come in handy. They can be used to describe and analyse situations where one has to draw global conclusions from local properties. That is, they can be used almost everywhere.
(1.4) Definition. Let A be a category with products. A sheaf on a topological space X with values in A is a presheaf F : L(X)op → A (F from the French “faisceau”) on X with values in A that satisfies the so-called gluing axiom. This says that every open cover (Ui)i∈I of an open set U ⊆ X yields an equalizer
p e Y / Y FU / FUi / F (Ui ∩ Uj) , q i∈I i,j∈I
th where e := (F (Ui ⊆ U))i∈I , p := (F (Ui ∩ Uj ⊆ Ui) ◦ pri)i,j∈I (for pri the projection to the i component), and q := (F (Ui ∩ Uj ⊆ Uj) ◦ prj)i,j∈I . That is, e, p, and q are the unique arrows Paragraph 2. Alternative Gluing Axioms 21 making the following diagram commute for all i, j ∈ I
F (Ui∩Uj ⊆Ui) FUi / F (Ui ∩ Uj) t9 O O F (U ⊆U) tt i tt pr tt pri i,j tt tt p tt e Y / Y FU / FUi / F (Ui ∩ Uj) J q JJ i∈I i,j∈I JJ JJ pr pr JJ j i,j F (Uj ⊆U) JJ JJ% FUj / F (Ui ∩ Uj) . F (Ui∩Uj ⊆Uj )
If F is a sheaf of sets (or more generally with values in a concrete category) the maps e, p, and q are thus given by
ef = (f|Ui )i∈I , p(fi)i∈I = (fi|Ui∩Uj )i,j∈I , q(fi)i∈I = (fj|Ui∩Uj )i,j∈I and it is an easy exercise to verify that the above diagram being an equalizer is equivalent to the “classical” gluing condition described before the definition. A morphism between two sheaves is nothing but a natural transformation (i.e. a morphism of presheaves) and thus the sheaves on X (with values in A) form a full subcategory of the category of presheaves on X (with values in A). Because the gluing axiom is obviously invariant under replacing F by an isomorphic presheaf this subcategory is replete (where a subcategory D 6 C is called replete iff whenever D ∈ Ob(D) and a: C → D is an isomorphism in C then C ∈ Ob(D) and a ∈ D). We write ShA(X) or simply A(X) for the full subcategory of PShA(X) with objects all A-valued sheaves. And as for presheaves, a sheaf of sets on X will simply be called a sheaf and we write Sh(X) := Sets(X). Note that since we require A to have products it has in particular a terminal object 1 (being the empty product) and since the empty subset ∅ ⊆ X has an open cover (Ui)i∈I ∼ with I = ∅ it follows from the gluing axiom that F ∅ = 1 is a terminal object.
2. Alternative Gluing Axioms
We will state an alternative description of the gluing axiom which suggests itself do de- fine so-called B-sheaves (although there are more sophisticated methods to do that using Grothendieck topologies). Roughly, a B-sheaf is a sheaf that is only defined on a basis of our space. The problem here is that we cannot state the gluing axiom anymore as a basis is generally not closed under finite intersections. The following alternative gluing axiom (due to Grothendieck) is a typical instance where limits in a category are replaced by limits in Sets using representable functors. For that, remember that representable functors preserve limits and in particular products. Thus if A is a category, (Ai)i∈I a family of objects of A Q ∼ Q having a product and A ∈ Ob(A), we get an isomorphism A(A, i∈I Ai) = i∈I A(A, Ai) Q th given by f 7→ (fi)i∈I , where fi = pri ◦f for pri : j∈I Aj → Ai the i standard projection. (2.1) Proposition. Let A be a locally small category with products and X a topological space. A presheaf P : L(X)op → A is a sheaf if and only if it satisfies the following alternative gluing axiom: For any open cover (Ui)i∈I of an open set U ⊆ X and any A ∈ Ob(A) the map (of small sets) Y ε: A(A, P U) → A(A, P Ui), f 7→ (f|Ui )i∈I i∈I 22 Chapter 3. Sheaves on a Space is injective with image
{(fi)i∈I | fi|V = fj|V ∀i, j ∈ I,V ⊆ Ui ∩ Uj open} .
Proof. This is a special instance of the presheaf criterion (cf. (2.15)), which implies that
p e Y / Y PU / PUi / P (Ui ∩ Uj) , q i∈I i,j∈I is an equalizer diagram (with e, p, q as in the definition of a sheaf) iff for every A ∈ Ob(A)
p∗ e∗ Q / Q A(A, P U) / A A, i∈I PUi / A A, i,j∈I P (Ui ∩ Uj) q∗ =∼ =∼ p Q ∗ / Q , i∈I A(A, P Ui) / i,j∈I A(A, P (Ui ∩ Uj)) q∗ is an equalizer diagram in Sets, where the vertical isomorphisms are as described above. But this is exactly that e∗ is injective with image
{(fi)i∈I | fi|Ui∩Uj = fj|Ui∩Uj ∀i, j ∈ I} and thus, by noticing that e∗ = ε, all that is left to check is that for a family (fi)i∈I ∈ Q i∈I A(A, P Ui) we have
fi|V = fj|V ∀i, j ∈ I,V ⊆ Ui ∩ Uj open iff fi|Ui∩Uj = fj|Ui∩Uj ∀i, j ∈ I.
But the direction “⇒” is obvious (putting V = Ui ∩ Uj) and for the other one notice that P is a presheaf and thus f | = (f | )| = (f | )| = f | for V ⊆ U ∩ U open. i V i Ui∩Uj V j Ui∩Uj V j V i j By this proposition, we can redefine a sheaf to be a presheaf satisfying this alterna- tive gluing axiom. This has the formal advantage that it makes sense to talk about sheaves with values in a category, that does not necessarily have products and moreover defining a B-sheaf (which is our original motivation) is straightforward. However, this alternative gluing axiom has the logical disadvantage that we have to quantify over a usually large set, namely the objects of A (but then again, to be precise the set of all open covers of an open subset U is also large) and (because of that) it’s less conceptual. Because all categories that we “meet in nature” as codomains of sheaves (like Sets or Ab) are complete the reader may choose her favourite gluing axiom. Still, we will speak of sheaves taking values in a general abelian category which might not be complete and it should be clear from the context which gluing axiom is appropriate. We can again restate the gluing axiom from the last proposition in terms of so-called covering sieves. If we write y: L(X) → PSh(X) for the Yoneda embedding then a sieve S on U ⊆ X open is simply a subfunctor of y U (observe that y U = L(X)(−,U) simply indicates whether an open set V ⊆ X is contained in U or not, i.e. (y U)V = 1 = {∗} if V ⊆ U and 0 = ∅ otherwise). Thus for every V ⊆ X open we have an inclusion SV ⊆ (y U)V (so that again SV ∈ {0, 1}) which is natural in V . This means that a sieve S on U can alternatively be described as a lower set in L(U) meaning that S is a set of open subsets of U such that whenever we have open subsets W ⊆ V ⊆ U with V ∈ S then also W ∈ S and we can regain a functor as the characteristic function of S ⊆ L(U). For the rest of the text, we will freely switch back and forth between these two descriptions and identify the sieve S, viewed as a lower set, with its characteristic function (i.e. S viewed as a functor). We say that a sieve S on U is a covering sieve iff U is the union of the elements of S. Paragraph 2. Alternative Gluing Axioms 23
(2.2) Proposition. Let A be a locally small category and X a topological space. Then a presheaf P : L(X)op → A is a sheaf (in the sense of the last proposition) if and only if for every covering sieve S on an open set U ⊆ X and any A ∈ Ob(A) inclusion ι: S → y U induces a bijection
ι∗ : Nat y U, A(A, P −) =∼ Nat S, A(A, P −).
Proof.“ ⇒”: Let us write (Ui)i∈I for the family of elements of S (so one can choose I = S and Ui = i if one wishes to), which is an open cover of U because S is a covering sieve. Observe that a natural transformation α: S ⇒ A(A, P −) is given by its components αV : SV → A(A, P V ) but since SV = ∅ for all V/∈ S, α is completely determined by the components αUi with i ∈ I and since SUi = {∗}, αUi is nothing but an element of A(A, P Ui). This means that we Q have an injection m: Nat S, A(A, P −) → i∈I A(A, P Ui), sending α to (αUi ∗)i∈I and we get a composite map
=∼ ι∗ m Y A(A, P U) −→ Nat y U, A(A, P −) −→ Nat S, A(A, P −) −→ A(A, P Ui), i∈I where the first map is the Yoneda isomorphism, given by f 7→ ϕ with ϕV a = (P a)f. A quick calculation shows, that this is the map ε from the last proposition, which is injective. Thus ι∗ is injecitve, too. It is also surjective because the image of ε is
{(αi)i∈I | αi|V = αj|V ∀i, j ∈ I,V ⊆ Ui ∩ Uj open} but since S is a lower set, an open V ⊆ Ui ∩ Uj needs to be in S too, so that (αi)i∈I lies in the image of ε iff the αi define a natural transformation α: S ⇒ A(A, P −) with αUi ∗ = αi. That means that (αi)i∈I lies in the image of ε iff it lies in the image of m and by injectivity of m, ι∗ must be surjective. “⇐”: An open cover (Ui)i∈I of an open set U ⊆ X generates a covering sieve S by V ∈ S ⇔: V ⊆ Ui for some i ∈ I. With the same argument as before an α: S ⇒ A(A, P −) is given by the components αV with V ∈ S but by naturality of α it is already completely determined by its components αUi for if V ⊆ Ui then αV ∗ = αUi ∗ |V so that we again get an injection m and a composite map as above. This time, we already know that ι∗ is a bijection, so that the composite map ε is indeed injective. (2.3) Corollary. If X is a topological space and P : L(X)op → Sets a presheaf of sets on X the P is a sheaf if and only if for every covering sieve S on an open set U ⊆ X, the inclusion ι: S → y U induces a bijection
ι∗ : Nat(y U, P ) =∼ Nat(S, P ).
Proof. The ι∗ here is simply the ι∗ from the last proposition with A = {∗}. Thus the condition stated is clearly necessary. It is also sufficient, for if ι∗ is a bijection then (by the proof of the last proposition with A = {∗}) Y ε: PU → PUi, f 7→ (f|Ui )i∈I i∈I is injective with image
{(fi)i∈I | fi|V = fj|V ∀V ⊆ Ui ∩ Uj open} and in particular (putting V = Ui ∩ Uj) the diagram in the definition of a sheaf is an equalizer. 24 Chapter 3. Sheaves on a Space
3. Topological Constructions of Sheaves
One of the first question that arises after one has understood a definition of a new math- ematical object (especially if that definition is sufficiently complicated) is how to construct new objects from given ones. Obviously, if we have the notion of a morphism between two such objects and all of them form a category, one will look for categorical constructions (like limits and colimits), which we will cover in the next sections but for the time being, we will describe three non-categorical (i.e. topological) constructions to get a sheaf. The first construction is taking subsheaves. As all presheaves form a category we can speak of subpresheaves. A subpresheaf of a presheaf P is just a monomorphism ι: Q P (to be precise, it is an equivalence class of such monomorphisms but this abuse of language is popular practice and usually does no harm). Observe that a natural transformation ι: Q ⇒ P is monic iff all components are monic. Thus for each open subset U ⊆ X, we have a monic iU : QU PU and these respect restriction (i.e. are natural in U). The question now is the following: if F is a sheaf on X and P F a subpresheaf, when is P a sheaf? Fortunatelly, because of the local character of a sheaf, this is a local question and the condition for P to be a sheaf is the one we would expect.
(3.1) Theorem. (Subsheaves) Let F ∈ Sh(X) and ι: P F a subpresheaf. Then P is a sheaf if and only if for every U ⊆ X open, f ∈ FU and every open cover (Ui)i∈I of U we have f ∈ PU ⇔ f|Ui ∈ PUi ∀i ∈ I. Proof. Without loss of generality, we assume PU ⊆ FU for all U ⊆ X open. By the premise, if U ⊆ X is open and (Ui)i∈I an open cover of U, we have a diagram as below, where e, p, and q are as in the definition of a sheaf and the lefthand square as well as the upper and the lower square on the right obviously commute. p e Y / Y PU / PUi / P (Ui ∩ Uj) q i∈I i,j∈I
p e Y / Y FU / FUi / F (Ui ∩ Uj) q i∈I i,j∈I “⇒”: If P is a sheaf then it does obviously satisfy the stated condition for the upper row is an equalizer and is just a restriction of the lower row. “⇐”: Conversely, if P staisfies the stated condition then the lefthand square is a pullback and a simple diagram chase proves that the upper row is an equalizer. As mentioned in the definition of a sheaf. The condition there says nothing else than that we can glue together a matching family in a unique way. In the same spirit, we can even glue together a matching family of sheaves (up to isomorphism). For this to make sense, one should notice that if F is a sheaf on a space X and U ⊆ X is open, then we can restrict F to U to yield a sheaf F |U on U with the subspace topology, defined in the obvious way. In fact if U ⊆ X is an open subset, we get restriction functors
−|U : PShA(X) → PShA(U) and − |U : ShA(X) → ShA(U), defined in the obvious way. These data do turn PShA and ShA into (meta-)presheaves op op PShA : L(X) → CAT and ShA : L(X) → CAT and the following theorem exactly says that this ShA is almost a (meta-)sheaf because it is so only up to isomorphism (in fact, this eventually leads to the notion of a stack or 2-sheaf ). Paragraph 3. Topological Constructions of Sheaves 25
(3.2) Theorem. (Gluing of Sheaves) Given an open cover (Xk)k∈K of a space X and ∼ for each k ∈ K a sheaf Fk on Xk as well as a family of isomorphisms θk,l : Fk|Xk∩Xl = Fl|Xk∩Xl (k, l ∈ K) satsfying θk,m = θl,m ◦ θk,l on Xk ∩ Xl ∩ Xm for all k, l, m ∈ K. Then there exists a ∼ sheaf F on X and isomorphisms ϕk : F |Xk = Fk (k ∈ K) such that ϕl = θk,l ◦ ϕk on Xk ∩ Xl. Moreover F and the ϕk are unique up to isomorphism.
Proof. Let us fix the notation that if U ⊆ X is open, we write Uk := U ∩ Xk. Moreover, for k, l ∈ K we write Fk,l := Fk|Xk∩Xl so that we have a restriction map resk,l : Fk → Fk,l and θk,l ∼ becomes an isomorphism θk,l : Fk,l = Fl,k. If there is a sheaf F as required it must certainly satisfy the gluing condition and thus for U ⊆ X open there must be an equalizer diagram
p Y / Y FU / FkUk / Fk,l(Uk ∩ Ul) q k∈K k,l∈K must be an equalizer diagram, where p := (θk,k(Uk ∩ Ul) ◦ Fk(Uk ∩ Ul ⊆ Uk) ◦ prk)k,l∈K and q := (θl,k(Uk ∩ Ul) ◦ Fl(Uk ∩ Ul ⊆ Ul) ◦ prl)k,l∈K . Since we have equalizers in Sets we can take this as the definition of FU. If i: V ⊆ U is an arrow in L(X) then the equalizer property gives us a unique arrow FU → FV , which we define to be F i.
<++>
(3.3) Corollary. Let X be a topological space and P : L(X)op → A a presheaf. Then P is a sheaf iff there is an open cover (Ui)i∈I of X such that each P |Ui is a sheaf. Equivalently (using the axiom of choice) P is a sheaf iff for every x ∈ X there is an open neighborhood U 3 x such that P |U is a sheaf.
Recall that a basis B for the topology of a topological space X is a full subcategory of L(X) (whose objects are called basic open sets) such that every U ⊆ X open can be written as a union of objects of B. This is to say that we get every open subset of X by gluing together basic open sets. Because sheaves behave well under gluing it is reasonable to conjecture that a sheaf is uniquely determined by its values on such a basis B and in fact this is true. To formalise this, we say that a presheaf P : Bop → A is a B-sheaf or a basic sheaf on X for the basis B iff it satisfies the alternative gluing axiom from (2.1) with all open sets replaced by basic open sets. If B is closed under finite intersections (as is the case for the canonical basis of an affine scheme) this is equivalent to the original gluing axiom from (1.4) with all open sets replaced by basic open sets, as we proved in (2.1). A morphism of B-sheaves is again just a morphism of presheaves (i.e. a natural transformation) and we write ShA(B) for the category of all A-valued B-sheaves on X for the basis B.
(3.4) Theorem. (B-Sheaves) Let X be a topological space, A a complete category and B a basis for X. Then the restriction functor
r: ShA(X) → ShA(B)
(with (r F )(V ⊆ U) = F (V ⊆ U)) is an equivalence of categories.
(3.5) Example. (Affine Schemes) For any commutative ring A, we have an associated affine scheme (Spec A, Ae), where X := Spec A is the prime spectrum of A equipped with the Zariski topology (i.e. the closed sets in Spec A are all of the form
VX (a) := V (a) := {p ∈ Spec A | a ⊆ p} 26 Chapter 3. Sheaves on a Space for a A any ideal) and Ae is a sheaf of rings on X (i.e. a scheme is a special instance of a so-calledP ringed space) as defined below. One can show that the so-called special (or basic or distinct) open sets
DX (a) := D(a) := Spec A \ V (Aa) = {p ∈ Spec A | a∈ / p} for a ∈ A form a basis (closed under finite intersections because D(a) ∩ D(b) = D(ab)) for ∼ the Zariski topology and that D(a) = Spec Aa as topological spaces, where D(a) carries the subspace topology and Aa = A[1/a] is the localisation of A at a (i.e. we formally invert the 2 ∼ multiplicative system Sa := {1, a, a ,... }). This homeomorphism D(a) = Spec Aa is given −1 by p 7→ Aap = Sa p. The only reasonable choice for a structure-ring for the whole of Spec A is AXe := A itself and consequentially, the only reasonable choice of a structure ring for D(a) is ADe (a) := Aa. The restriction maps A → Aa (or more generally Ab → Aa) are of course the universal maps into the localisation. To wit, D(a) ⊆ D(b) means b ∈ p ⇒ a ∈ p for all p ∈ Spec A. Now we form the diagram of solid arrows
λb A / Ab @@ @@ @@ λa @@ , Aa which are the universal morphisms into the localisations and in order for the dotted arrow to exist, λab ∈ Aa must be invertible. If this were not so, then we would find q /Aa prime with −1 b ∈ q but then p := λa q /A would be prime, a∈ / p but b ∈ p, which is a contradiction. As one can show, the presheaf Ae thus defined on basic open sets is in fact a B- sheaf for the basis D(a) a∈A, so that it can be uniquely extended to our structure sheaf Ae, which is a sheaf of commutative rings. More generally, if the commutative ring A is even a commutative algebra over a commutative ring R then Ae is even a sheaf of R-algebras because every Aa is again an R-algebra is a canonical way (the R-algebra structure R → Aa is given by composing the R-algebra structure R → A on A with the canonical morphism λa : A → Aa). Finally, a ring homomorphism ϕ: A → B determines a map ϕ← : Spec B → −1 ← −1 Spec A, p 7→ ϕ p, which is continuous since (ϕ ) DSpec A(a) = DSpec B(ϕa) for a ∈ A, so that taking the spectrum is indeed a functor Spec: CRngop → Top or again more gener- ally Spec: R-Algop → Top.
(3.6) Example. If A = k is a field then Spec k = {0} is a one-point space and the structure sheaf ke is obviously the constant sheaf k (that is ke{0} = k and ke∅ = 0).
4. Categorical Constructions of Sheaves
(4.1) Proposition. For A an abelian category and X a topological space PShA(X) (the category of A-valued presheaves on X) is abelian, too.
Proof. Limits and colimits of functors are calculated pointwise and A is abelian.
(4.2) Theorem. Let A be an abelian category and X a topological space. Then A(X) (the category of A-valued sheaves on X) is an abelian subcategory of PShA(X). Paragraph 5. Étale Bundles and Sheafification 27
5. Étale Bundles and Sheafification
In this section our investment into the abstract machinery of Kan extensions pays off because the ususal sheafification and étalification functors is nothing but a special instance of the Tensor-Hom adjunction we get by taking Kan extensions along the Yoneda embedding. Recall that any functor F : C → E with C small and E cocomplete induces an adjunction − ⊗C F : Cb E : E(F, −) (left adjoint on the left), where Z πP F P ⊗C F = colim P −−→ C −→ E C for any presheaf P ∈ Ob(Cb ). Let’s consider the case where C = L(X) (for X some topological space), E = Top ↓ X the category of bundles over X and F : L(X) → Top ↓ X sending an open set U to the inclusion U,→ X and U ⊆ V to U,→ V (which is evidently a continuous map of spaces over X). For the sake of readability, let us write Λ := − ⊗L(X) F and Γ := (Top ↓ X)(F, −) for the induced adjoints. op R If P : L(X) → Sets is any presheaf then the category of elements L(X) P has as objects pairs (U, s) with U ⊆ X open and s ∈ PU while an arrow (V, t) → (U, s) exists (which R we abreviate by (V, t) 6 (U, s)) iff V ⊆ U and s|V = t, so that L(X) P is a poset. We can now describe the colimit ΛP , which is determined by the coequalizer diagram p a / a V / U / / ΛP , q (V,t)6(U,s) (U,s) where for (V, t) (U, s) the maps p and q are defined on ι V as the inclusions into 6 (V,t)6(U,s) ι(V,t)V and ι(U,s)U respectively (where the ιs denote standard inclusions into the coproduct). ` In a more set-theoretic manner, if we write x(U,s) for the element x ∈ ι(U,s)U ⊆ (V,t) V , ` we may say that ΛP is the quotient of (U,s) U by the equivalence relation ∼, which is the smallest equivalence relation such that x(V,t) ∼ x(U,s)U for all (V, t) 6 (U, s) and x ∈ V . Plainly, this gives the equivalence relation y(V,t) ∼ x(U,s) iff x = y and there is some W ⊆ U ∩V open such that x ∈ W and t|W = s|W . If for U ⊆ X open, x ∈ U and s ∈ PU, we write germx s for the equivalence class of x(U,s) and for a point x ∈ X
Px := {germx s | U ⊆ X open, x ∈ U and s ∈ PU} , ∼ ` we immediately see that ΛP = x∈X Px (as a set). As this colimit of the above diagram is as good as any other, we take this as the definition of ΛP , together the standard projection ΛP → X (which is really induced by the universal property of the colimit), turning ΛP into an object of Top ↓ X. Let us recall that the topology on the colimit ΛP is nothing but the final topology on it with respect to the colimiting cocone, having as components the cross- R sections s˙ : U → ΛP, x 7→ germx s (for (U, s) ∈ | L(X) P |) of the bundle ΛP → X. Finally, if α: P → Q is a morphism of presheaves on X, the map Λα:ΛP → ΛQ (given by the universal property of the colimit) is nothing but ΛP → ΛQ, germx s 7→ germx αU s. Let’s sum this all up again with the following definition. (5.1) Definition. Let X be a topological space and P ∈ |PSh(X)|. For x ∈ X an equivalence relation ∼ is defined on S {PU | U ⊆ X open and x ∈ U} by s ∼ t iff there is some W ⊆ U ∩ V open with x ∈ W and s|W = t|W . The equivalence class of s ∈ PU is then denoted by germx s and called the germ of s at x. We write Px for the resulting quotient and call this the stalk of P at x. The disjoint unionbecause limits of functors are calculated pointwise, they also carry the same topology. F a ΛP := Px, x∈X 28 Chapter 3. Sheaves on a Space
equipped with the final topology with respect to all s˙ : U → ΛP, x 7→ germx s (U ⊆ X open, s ∈ PU) is called the stalk-space or the associated étale bundle of P (strictly speaking, the associated bundle is ΛP equipped with the standard projection ΛP → X, germx s 7→ x but we usually won’t be pedantic about it). Because all the cross-sections s˙ of our bundle ΛP are injective, they are open maps and so the sU˙ = {germx s | x ∈ U} with U ⊆ X open and s ∈ PU form a subbasis for the topology of ΛP . Λ thus defined yields a functor PSh(X) → Top ↓ X by sending α: P → Q in PSh(X) to Λα:ΛP → ΛQ, germx s 7→ germx αU s. (5.2) Lemma. Let X be a topological space, F ∈ |Sh(X)|, U, V ⊆ X open and s ∈ FU, t ∈ FV . Then s|U∩V = t|U∩V iff s˙|U∩V = t˙|U∩V .
Proof. The direction “⇒” is obvious. For the other direction, observe that for each x ∈ U ∩V , ˙ we have germx s =sx ˙ = tx = germx t, so that there is some open neighborhood Wx ⊆ U ∩ V of x, satisfying s|Wx = t|Wx . But now (Wx)x∈X is an open cover of U ∩ V and the s|Wx form a matching family for this cover. Because F is a sheaf, if follows that we can collate them uniquely and thus s| = t| . U∩V U∩V (5.3) Remark. Observe that we do not need the full strength of the gluing axiom in the above proof. It suffices for F to be a so-called separated presheaf, meaning that the map e in the gluing axiom is a monomorphism but not necessarily an equalizer. This means that if
U ⊆ X is open, (Ui)i∈I an open cover of U and s, t ∈ PU such that s|Ui = t|Ui for all i ∈ I, then s = t. I.e. a presheaf is separated iff any matching family which can be glued together can be done so uniquely.
While the “germ maps” germx : PU → Px are now defined, they were done so quite nastily, first forming the union S {PU | U ⊆ X open and x ∈ U} and then imposing an equivalence relation on the resulting set, making germx the standard projection into the quotient. There is in fact a much neater way to do this, not depending on set-theoretic notions such as the union of some sets. The intuition behind it remains the same; the germ of a section at a point x should capture its behaviour near that point. One way to do this is the one described above; another one is to observe that the best approximation of the point x in L(X) would be the limit (i.e. the intersection) of all open neighborhoods of x. This limit need not exist in L(X) but after applying the given presheaf P , we land in a bicomplete category and our imaginary limit can be calculated there as a colimit. (5.4) Proposition. Let X be a topological space and P ∈ |PSh(X)|. For x ∈ X, let L(X, x) be the full subcategory of L(X) having as objects all U ⊆ X open such that x ∈ U. We then have ∼ Px = colim P |L(X,x)op = colimx∈U PU with germx : L(X, x) → Px as the colimiting cocone, which has components germx : U → Px, s 7→ germx s. Moreover, germx is natural in the sense that for α: P → Q any morphism in PSh(X) there is a unique map αx : Px → Qx such that the following square is commutative
germx PU / Px
αU αx QU / Qx germx for all U ⊆ X open with x ∈ U. So taking the germ at x is a functor −x : PSh(X) → Sets, (α: P → Q) 7→ (αx : Px → Qx) and for U ⊆ X open with x ∈ U the maps germx as in Paragraph 5. Étale Bundles and Sheafification 29
the above square determine a natural transformation evU ⇒ −x, where evU is the evaluation functor (α: P → Q) 7→ (αU : PU → QU).
Proof. Let M be any set, together with a cocone θU : PU → M (U ⊆ X open with x ∈ U). If there is any map t: Px → M such that θ = germx ◦t, it must be given by germx s 7→ θU s for s ∈ PU (for the maps germx form a surjective family, i.e. every element of Px lies in the image of some germx). This is a well defined map, for if we have open neighborhoods U, V of x and s ∈ PU, t ∈ PV with germx s = germx t then there is some W ⊆ U ∩ V open with x ∈ W and s|W = t|W , so that θU s = θW s|W = θW t|W = θV t. This proves (P, germx) the stated colimit. As for the induced map αx, observe that the germx ◦αU : PU → Qx form a cocone under P | and α is thus given by the universal property of the colimit. L(X,x) x The second functor Γ: Top ↓ X → PSh(X) is much easier to describe (because it is not defined by a universal property). It sends a bundle E → X (which, we will usually identify with E and whose fibre over x ∈ X will be denoted by Ex) to (Top ↓ X)(−,E), so that for U ⊆ X open n o s (ΓE)U = s: U → E U −→ E → X = U,→ X = {s: U → E | sx ∈ Ex ∀x ∈ U} is the set of all U-cross-sections of E and if V ⊆ U are open sets then the corresponding restriction map is simply the restriction of maps, i.e.
−|V := (ΓE)(V ⊆ U): s 7→ s|V . (5.5) Lemma. Λ: PSh(X) → Top ↓ X preserves finite limits.
Proof. Let D : J → PSh(X) be a finite diagram, together with a limit (P, λ) and let (E, µ) be a limit of Λ◦D. Observe that for any x ∈ X we get a bifunctor J×L(X, x)op → Sets, (J, U) 7→ (DJ)U. But as J is finite and L(X, x)op is filtered (that is to say that for U, V ∈ |L(X, x)| he also have U ∩ V ∈ |L(X, x)|) we have a canonical isomorphism ∼ ∼ ∼ ∼ ϕx : Px = colimU PU = colimU limJ (DJ)U = limJ colimU (DJ)U = limJ (DJ)x = Ex, which is simply germx s 7→ e, where e ∈ E is the unique element such that µJ e = germx λJ s ∈ (DJ)x for all J ∈ |J|. By the universal property of the disjoint union these maps induce a bijection ϕ:ΛP → E, which is even a homeomorphism. The inverse E → ΛP is continuous by the universal property of the limit E. For ϕ itself to be continuous, recall that ΛP carries the final topology with respect to all cross-sections s˙ : U → ΛP with U ⊆ X open ∼ and s ∈ PU = limJ (DJ)U and moreover, E carries the initial topology with respect to all µJ : E → ΛDJ. Thus all we need to check is that all composites µJ ◦ ϕ ◦ s˙ are continuous. But this is trivial, for if we write t := λJ s ∈ (DJ)U then µJ ◦ ϕ ◦ s˙ = t˙: U → ΛDJ, which is continuos by definition of ΛDJ. (5.6) Remark. The converse statement, that Γ preserves finite colimits is not true in general and Γ does usually not even preserve finite coproducts, let alone arbitrary coproducts. However, it is possible to classify those spaces X for which this holds. In fact, the following are equivalent
(a) Γ preserves coproducts;
(b) Γ preserves finite coproducts;
(c) X is irreducible. 30 Chapter 3. Sheaves on a Space
Recall that X is irreducible (also called hyperconnected) iff any open subset of X is connected.
Proof. If X is irreducible and (Ei)i∈I is a family of bundles over X then their coproduct is the ` disjoint union E := i∈I Ei carrying the final topology with respect to all inclusion Ei ,→ E. If now, U ⊆ X is open then U must be connected and in particular, any cross-section s: U → ` E must map all of U into one of the summands Ei. Consequentially (ΓE)U = i∈I (ΓEi)U as claimed. Conversely, if Γ preserves finite coproducts, let U ⊆ X open and consider the bundles E = E0 = U (with the inclusion map U,→ X) over X. The only cross-section U → E (resp. U → E0) is obviously the identity map and so Γ(E q E0)U =∼ (ΓE)U q (ΓE0)U is a two-point set, meaning that the only cross-sections U → E q E0 are the inclusions into 0 either E or E . This implies that U is connected for if U1, U2 ⊆ U are disjoint open subsets 0 with U = U1 ∪ U2 then the two inclusions U1 ,→ E and U2 ,→ E define a cross-section s: U → E q E0. Because sU = E or sU = E0 we conclude that U = or U = . 1 ∅ 2 ∅ Before putting all the above together and stating it as a theorem, let us analyze what properties are enjoyed by the images of objects under either of the functors Λ and Γ. By observing that the image ΓE of a space E over X is a presheaf of continuous maps into E, with the additional (but local) requirement that they should form a cross-section of E → X it is obvious that ΓE is always a sheaf. (5.7) Lemma. The functor Γ: Top ↓ X → PSh(X) has its values in Sh(X). Just as the local nature of being a cross-section of a bundle E is encaptured by the fact that the presheaf ΓE is in fact a sheaf, there is a corresponding notion on the topological side that accounts for the local nature of the germ of a section. This notion is that of a local homeomorphism or étale bundle. (5.8) Definition. A continuous map p: E → X is called étale or an étale bundle or étalé space over X iff it is a local homeomorphism in the sense that for every e ∈ E there is some open neighborhood U 3 e such that pU ⊆ X is open and p restricts to a homeomorphism U =∼ pU. We write Etale´ (X) for the full subcategory of Top ↓ X having as objects all étale bundles over X. (5.9) Example. Every covering space is an étale bundle.
(5.10) Example. If X = {∗} is a one-point space and E any topological space, then the unique bundle E → X is étale iff E is discrete.
(5.11) Remark. It follows immediately from the definition that étale bundles have dis- crete fibres, that every étale map is open and that any morphism of étale bundles (i.e. any continuous map of bundles over X, which happen to be étale) is again an étale map. More- 0 0 over, if E, E are two étale bundles over X then their fibred product E ×X E is again an étale bundle over X. Finally, if E is an étale bundle over a space X, then a basis for the topology of E is given by the images of all cross-sections s: U → E with U ⊆ X open (and consequentially any such cross-section is an open map), so that E carries the final topology with respect to all such cross-sections.
Proof. Only the last claim needs some justification. Let V ⊆ E open. By definition of an étale bundle, we may cover V by open sets (Vi)i∈I such that all the subsets Ui := pVi ⊆ X −1 Vi ∼ −1 are open and p induces a homeomorphism si := p|U : Vi = Ui. Because the si are all i S homeomorphisms, their inverses si : Ui → Vi are cross-sections of E and V = i∈I siVi, which proves our claim. Paragraph 5. Étale Bundles and Sheafification 31
(5.12) Lemma. Any two cross-sections of an étale bundle E over a space X, which agree on a point x ∈ X, agree locally around x. To wit, if U, U 0 ⊆ X are open neighborhoods of x ∈ X and s: U → E, t: U 0 → E cross-sections of E satisfying sx = tx then there is some 0 open neighborhood W ⊆ U ∩ U of x such that s|W = t|W .
Proof. We write e := sx = tx and choose V 3 x open, such that the standard projection p: E → X induces a homeomorphism p0 : V =∼ pV . By the above remark, pV ⊆ X is open 0 and so W := U ∩ U ∩ pV is an open neighborhood of x. But s|W and t|W are both inverses of the homeomorphism p0−1W → W we get by restricting p0, so that they must agree. (5.13) Lemma. The functor Λ: PSh(X) → Top ↓ X has its values in Etale´ (X).
Proof. Let P ∈ |PSh(X)| and germx s ∈ ΛP for some x ∈ X, U ⊆ X an open neighborhood of x and s ∈ PU. The map s˙ : U → ΛP, y 7→ germy s is open, so that V :=sU ˙ is an open neighborhood of germx s. Moreover, because s˙ is a section of the standard projection p:ΛP → X, pV = U ⊆ X is open and p restricts to a homeomorphism V =∼ pV = U having s˙ as its inverse. (5.14) Main Theorem. For any topological space X, we have adjoint functors as above
Λ / PSh(X)o _ Top ↓ X , Γ which both preserve finite limits and factor through the inclusions of full subcategories as
PSh(X) −→Λ Etale´ (X) ,→ Top ↓ X and Top ↓ X −→Γ Sh(X) ,→ PSh(X), yielding and adjoint equivalence Λ: Sh(X) ' Etale´ (X):Γ.
(5.15) Remark. Before proceeding to the proof, let us quickly calculate the unit and counit of the adjunction. As this arises as a Tensor-Hom adjunction, we may do so by using (3.4) and the fact that for P ∈ |PSh(X)| the colimiting cocone to ΛP has components R s˙ : U → ΛP, x 7→ germx s for (U, s) ∈ | L(X) P |. By this, the unit ηP : P → ΓΛP at a presheaf P is given by (ηP )U s =s ˙ for U ⊆ X open and s ∈ PU, while the counit εE : ΛΓE → E is determined by εE ◦ s˙ = s for all U ⊆ X open, s ∈ (ΓE)U = {s: U → E | sx ∈ Ex ∀x ∈ U} (this does determine εE by the universal property of the colimit ΛΓE).
Proof. The only thing we have not shown yet is the very last claim. By (3.6) it suffices to check that the unit ηP : P → ΓΛP at a presheaf P on X is an isomorphism iff P is a sheaf, while the counit εE : ΛΓE → E at a bundle E over X is an isomorphism iff E is étale. The “only if” parts have already been stated as lemmas (5.7) and (5.13), so that we only need to check the “if” parts. For this, let first P be a sheaf and we need to check that each
(ηP )U : PU → (ΓΛP )U = {t: U → ΛP | tx ∈ (ΛP )x = Px ∀x ∈ X} , s 7→ s˙ (U ⊆ X open) is bijective. This is so, for if U ⊆ X is open and t: U → ΛP is a cross-section of ΛP , then tU ⊆ ΛP is open and we can choose for each e ∈ tU an open neighborhood Ve ⊆ tU, ∼ such that the standard projection p:ΛP → X induces a homeomorphism Ve = pVe ⊆ U, −1 having the restriction t: t Ve → Ve as its inverse. By definition of the topology of ΛP , we may shrink each Ve, so that is still an open neighborhood of e but is now given as the image −1 of some s˙e : Ue → ΛP with Ue ⊆ t Ve open and se ∈ PUe. But then s˙e is nothing but the 0 restriction of t, so that s˙ | =s ˙ 0 | = t| for all e, e ∈ pU. By (5.2), this e Ue∩Ue0 e Ue∩Ue0 Ue∩Ue0 32 Chapter 3. Sheaves on a Space
implies that the se form a matching family for the open cover (Ue)e∈pU of U and we may thus uniquely collate them to s ∈ PU. So for t ∈ (ΓΛP )U, we have found a unique s ∈ PU such that s˙ = t, meaning that (ηP )U is bijective. If now, p: E → X is étale, we need to check that εE : ΛΓE → E, determined by εE ◦ s˙ = s for all U ⊆ X open and s ∈ (ΓE)U, is a homeomorphism. It is surjective, for if e ∈ E, we choose V 3 e open such that the standard projection p: E → X induces a homeomorphism V =∼ pV =: U and we write s: U → V,→ E for the inverse. This is a cross- section of E (i.e. s ∈ (ΓE)U) and so εE ◦s˙ = s and in particular εE ◦spe˙ = spe = e. It is also 0 0 0 0 injective, for if εEf = εEf for some f, f ∈ ΛΓE, we have f = germx s and f = germx0 s for 0 0 0 0 0 some x, x ∈ X, U 3 x, U 3 x open and s ∈ (ΓE)U, s ∈ (ΓE)U . Because εE is a map of 0 0 0 spaces over x, it follows that x = x and by definition of εE, we have sx = εEf = εEf = s x. So s and s0 are two cross-sections of the étale bundle E, which agree at x and thence, by 0 0 0 (5.12), s|W = s |W for some W 3 x open, meaning that f = germx s = germx s = f . Obviously, εE is continuous, because all the εE ◦ s˙ = s are continous and ΓΛE carries the −1 final topology with respect to all the s˙ and finally the inverse εE is continous, too, because −1 if s: U → E is a cross-section of E with U ⊆ X open, then εE ◦ s =s ˙ is continuous and E carries the final topology with respect to all cross-sections s: U → E.
(5.16) Remark. Observe that for the unit ηP at P to be injective, it is enough for the presheaf P to be separated.
(5.17) Corollary. (Sheafification) For any topological space X, Sh(X) is a reflective full subcategory of PSh(X), i.e. we have an adjunction
a / PSh(X)o _ Sh(X), i where i: Sh(X) ,→ PSh(X) is the inclusion and a is the so-called sheafification (or associated sheaf ) functor. The counit ε: a i ⇒ 1Sh(X) is an isomorphism and moreover, a preserves and reflects finite limits and consequentially, a preserves and reflects monomorphisms, too. (5.18) Remark. Notice that in general, if C is a full reflective subcategory of a category D (i.e. C is a full subcategory of D and the inclusion i: C → D has a left adjoint F : D → C) then by (2.10) of the last chapter the counit ε: F i ⇒ 1C is always an isomorphism. ∼ (5.19) Corollary. If X is a topological space, x ∈ X and P ∈ |PSh(X)| then Px = (a P )x, i.e. a presheaf and its sheafification have isomorphic stalks. If P is a presheaf, it is sometimes convenient to work with the associated étale bundle ΛP instead of the sheafification a P because ΛP already contains all information about a P but is usually a less complicated object to work with. To illustrate this claim, let us analyse the situation for constant presheaves, thereby introducing constant sheaves.
(5.20) Definition. (Constant Sheaves) Let X be a topological space and M any set. op The constant presheaf PM on X is simply the presheaf PM : L(X) → X, which has PM U := U for all U ⊆ X open and whose restriction maps are all identities. If there is no risk of confusion, we will usually identify M with PM . The constant sheaf FM on X is now the sheafification FM := a M of the constant presheaf M. Let us quickly analyze constant presheaves and their sheafification. For M a set (identified with he corresponding constant presheaf on X), let U, V be open neighborhoods Paragraph 6. Sheaves with Algebraic Structure 33
0 0 of a point x ∈ X and m ∈ MU = M, m ∈ MV = M. Then obviously germx m = germx m 0 iff m = m because all restriction maps are identities and it follows that Mx = M, thus ` ∼ ΛM = x∈X M = X × M as a sets over X (where the projection X × M → X is the obvious ` ∼ one). The topology on ΛM has as a subbasis all sets mU˙ = {germx m | x ∈ U} = x∈U {m} = X × {m} with U ⊆ X open (which is even a basis in this case) and in particular all fibres are descrete. Thus for the constant presheaf M we have a particularly easy description of ΛM; it is simply the product space X × M, where M carries the discrete topology. By definition a M = ΓΛM is the sheaf of all cross-section of ΛM and we arrive at the following, more elementary description: The constant sheaf a M associated to the set M is given by
(a M)U =∼ {f : U → M | f is continuous} with the usual restriction of maps, where M carries the discrete topology. Observe that if U is connected, then f : U → M must be constant. More generally, if we write c(U) for the set of connected components of U, we get an injective map
c(U) {f : U → M | f is continuous} → M , f 7→ (fC)C∈c(U) and if the connected components of X are open (e.g. if X is locally connected or if X has only finitely many connected components) then it is even surjective. Thus in that case we can identify
(a M)U =∼ M c(U) but the restriction maps get a little more complicated. To wit, if V ⊆ U is open and D ∈ c(V ) then D is a connected subset of U and thus there is some (necessarily unique) c(U) c(V ) connected component CD ∈ c(U) such that D ⊆ CD and the restriction map M → M is given by (mC )C∈c(U) 7→ (mCD )D∈c(V ).
6. Sheaves with Algebraic Structure
In most cases, the sheaves occurring in geometric contexts are really sheaves carrying an algebraic structure (e.g. the structure sheaf of a manifold, which is a sheaf of R-algebras). As an example, we consider the case of sheaves of R-modules, for R any fixed commutative ring. But the reader should carry in mind that all what follows is mutatis mutandis true for any algebraic structure (in the sense of universal algebra), e.g. sheaves of rings or algebras. A presheaf of R-modules on a topological space is usually defined as a presheaf P : L(X)op → R-Mod with values in the category of R-modules. Obviously, because R-Mod is a subcategory of Sets and we can always compose P with the standard inclusion func- tor i: R-Mod ,→ Sets, we could as well say that a presheaf of R-modules is a presheaf P : L(X)op → Sets of sets such that each FU carries the structure of an R-module and all restriction maps are R-linear. An important observation at this point is that the sheaf con- dition (i.e. the gluing axiom) is not ambiguous in this context. I.e. P : L(X)op → R-Mod satisfies the gluing axiom (in the category R-Mod that is) iff the composite i ◦ P : L(X)op → R-Mod ,→ Sets satisfies the gluing axiom (in the category Sets). The reason for this is simply that i creates and preserves limits (which comes from the fact that i has a left adjoint, namely the free construction). Thus it does no harm to define a sheaf of R-modules to be a sheaf F : L(X)op → Sets of sets such that each FU carries the structure of an R-module and all restriction maps are R-linear. Observe now that an R-module is nothing but a set M, equipped with maps M × M → M, 1 → M and R × M → M (usually called “addition”, “zero” and “scalar 34 Chapter 3. Sheaves on a Space multiplication”), such that the obvious diagrams commute. Because we can identify R with the constant presheaf PR and because products of functors are calculated pointwise, we may equally well define a presheaf of R-modules to be an R-module-object (read “PR-module- object”) in PSh(X). As noted in the last section, the functors Λ and Γ preserve products, so that for P an R-module-object in PSh(X) the corresponding étale bundle ΛP is a ΛR- module-object but ΛR =∼ X × R (where R carries the discrete topology)
7. More on Étale Bundles
As always, one of the questions one is concerned with sonner or later if one tries to work in a newly constructed category is the question of subobjects, i.e. describing the monomorphisms. This is easy in categories of algebraic structures because there a morphism is monic iff it is 0 injective. The same is true in Top and Top ↓ X because if ϕ: E → E is monic and e1, e2 ∈ E with ϕe1 = ϕe2 then we precompose ϕ with the two maps {∗} → E mapping ∗ to e1 and e2 respectively and conclude that e1 = e2. This trick no longer works in Etale´ (X) because {∗} → X is only étale iff the image of ∗ is an open point in X. This seems disappointing at first but as it turns out, monomorphisms in Etale´ (X) are even nicer than in Top ↓ X. Because observe that if ϕ: E → E0 is a monomorphism (i.e. an injective map) in Top or Top ↓ X, so that E is a subspace of E0 in the categorical sense, then this does not imply that E is a subspace of E0 in the topological sense, i.e. E =∼ ϕE, so that E can be identified with the subset ϕE of E0, carrying the subspace topology induced by that of E0. The reason for this is that the topology of E can be finer than that of ϕE. However, in the étale case, this cannot happen and even better, E is not only a subspace (in the topological sense) but even an open subspace. (7.1) Proposition. If ϕ: E → E0 is a morphism of étale bundles over X, then ϕ is monic iff it is an open embedding. Proof. Because ϕ is a morphism of étale bundles, it is itself étale and in particular open. If ϕ is an open embedding, we identify E with the open subset ϕE ⊆ E0, carrying the subspace topology. If e ∈ E ⊆ E0 then there is some open neighborhood U 0 ⊆ E0 of e such that pU 0 ⊆ X is open and U 0 =∼ pU 0 via p: E0 → X. Consequentially, U := U 0 ∩ E is an open neighborhood of e, pU is open in pU 0 and thus also in X and p restricts to U =∼ pU, which is a homeomorphism because the restriction U 0 =∼ pU 0 is so. Conversely, if ϕ is monic then it is 0 injective, for if we have e1, e2 ∈ E with ϕe1 = ϕe2 =: e , then we find open neighborhoods U1, 0 U2 ⊆ E of e1 and e2 respectively, such that ϕU1 = ϕU2 =: V ⊆ E is open and ϕ restricts to ∼ ∼ 0 homeomorphisms U1 = V and U2 = V mapping e1 resp. e2 to e . As shown above, V together ∼ with the restricted projection p|V : V → X is étale and the two maps f1 : V = U1 ,→ E and ∼ f2 : V = U2 ,→ E are morphisms of étale bundles, satisfying ϕ ◦ f1 = ϕ ◦ f2 and thus f1 = f2. 0 0 In particular, e1 = f1e = f2e = e2, so that ϕ is indeed injective, as well as continuous and open. Consequentially, ϕ is an open embedding as claimed. (7.2) Remark. (Subsheaves) Using the sheafification functor a, we can discuss sub- sheaves, analogous to (1.3) where we discussed subpresheaves. To wit, because a as well as i preserve (and reflect) monomorphisms, we have for any sheaf F a Galois connection
a / SubPSh(X)(F )o _ SubSh(X)(F ), i ∼ meaning S 6 i a S and a iE 6 E (here even a iE = E) or equivalently a S 6 E ⇔ E 6 iS for all subpresheaves S F and all subsheaves E F . Paragraph 8. Stalks and Skyscrapers 35
Describing the intersection of subsheaves is easy and we don’t need sheafification there. If F is a sheaf on X and (Fi F )i∈I a (small) family of subsheaves (without loss of generality the components FiU FU for U ⊆ X open are inclusions of subsets) then their T intersection E := i∈I Fi as subsheaves is the same as their intersection as subpresheaves. T That is EU = i∈I FiU for U ⊆ X open with restriction maps induced by those of F . Using (3.1) and the fact that the Fi are sheaves, one readily checks that E thus defined is indeed a sheaf. Consequentially, if (MU)U∈|L(X)| is a family of subsets MU ⊆ FU there is a smallest subsheaf containing M, called the subsheaf generated by M. However, its description is not as simple as in the case of subpresheaves, for if S is the subpresheaf generated by M (i.e. S 0 SU = (U⊆U 0)∈L(X) MU |U ) then a S is the subsheaf generated by M. Indeed, if E F is any subsheaf containing M then E = iE is a subpresheaf containing M and so S 6 iE, ∼ implying a S 6 a iE = E. As usually for sheafification, the subsheaf a S generated by M is best described in terms of the corresponding étale bundle ΛS. The topology on ΛS ⊆ ΛF is obviously just the subspace topology (because Λ preserves monomorphisms) and a short inspection of the definition of the stalk and of S yields that
(a S)x = Sx = Mx := {germx s | U ⊆ X open, x ∈ U and s ∈ MU} . Now, as in the case of subpresheaves, it follows that we have (small) unions of subsheaves, too and they are obviously nothing but the sheafification of the unions as subpresheaves (because a is left adjoint and thus preserves unions). Finally, we observe that by the above proposition (7.1), subsheaves of a sheaf F correspond to open subsets of ΛF under the equivalence Λ: Sh(X) ' Etale´ (X) and we can equally well define a subsheaf by specifying an open subset of the stalk space ΛF . This is in fact very convenient and will come in handy when describing ideal sheaves or more generally submodules of OX -modules (for X a locally ringed space) in the next chapter.
8. Stalks and Skyscrapers
9. Image Functors
One of the major features of étale bundles is that they are stable under base change. Thereby, if E → X is a bundle over X and Y → X a continuous map (called the base change map), ∗ then the projection ϕ E := E ×X Y → Y in the pullback diagram ϕ∗E / E
Y / X is called the pullback bundle of E along Y → X and we say that we obtained ϕ∗E → Y by base change along Y → X. Observe that while the roles of E and Y can of course be interchanged, leading to the same result, the specific terms “bundle over X” and “base change map” (both meaning nothing but “continuous map into X”) reveal the underlying line of thought, in which the roles of E and Y are not interchangeable. (9.1) Theorem. (Base change) Étality of bundles is stable under base change. I.e. if p: E → X is étale and ϕ: Y → X is continuous then the pullback bundle q : ϕ∗E → Y along ϕ is étale, too. Thus any continuous map ϕ: Y → X induces a so-called base change functor ∗ ∗ 0 ϕ : Etale´ (X) → Etale´ (Y ), mapping E to ϕ E = E ×X Y and ψ : E → E to the unique map ϕ∗E → ϕ∗E0, (e, y) 7→ (ψe, y) defined by the universal property of the pullback. 36 Chapter 3. Sheaves on a Space
Proof. Let (e, y) ∈ ϕ∗E. Because p is étale there is some open neighborhood U ⊆ E of e, which is mapped homeomorphically by p to the open set pU ⊆ X. Now, U × ϕ−1pU is open in E ×Y and thus the intersection V := (U ×ϕ−1pU)∩ϕ∗E is an open neighborhood of (e, y) ∗ −1 U −1 in ϕ E. If y ∈ ϕ pU with x := ϕy ∈ pU, there is exactly one point u = p|pU x ∈ U, which is mapped to x by p and the map
U −1 U −1 p|pU ◦ ϕ, 1ϕ−1pU : ϕ pU → V, y 7→ u = p|pU ϕy, y
V −1 thus defined is the inverse to the restriction q|qV : V → qV = ϕ pU, so that this is indeed a homeomorphism and ϕ∗E is étale. Chapter 4
RINGED SPACES
1. Definition and First Properties
For the rest of the text let us fix the convention that all rings considered are commutative and have a unit and in the same vein all algebras over a ring are required to be associative, commutative and unital. Observe, that many of the definitions still make sense in the non- commutative case but as we are going to study the connection of algebraic and analytic geometry over C all rings and algebras of our interest will be commutative. (1.1) Definition. For R a ring, a ringed space over R (or R-ringed space for short) is a topological space X together with a sheaf (called the structure sheaf of the ringed space) O : L(X)op → R-Alg of R-algebras on X. Equivalently, if we identify the ring R with the corresponding constant sheaf a R on X then we could require O to be an a R-algebra object in the category Sh(X). As an immediate consequence all stalks Ox are again R-algebras and we say that (X, O) is a locally ringed space iff all the stalks Ox are local rings, whose maximal ideal we will denote by mx(OX ) or simply mx if there is only one structure sheaf O involved. If there is no risk of confusion, we usually identify a ringed space with its underlying topological space X and the structure sheaf whose existence is implicitly assumed will then be called OX . Consequentially the stalk at x ∈ X will then by denoted by OX,x and in the case of a locally ringed space mX,x/OX,x is the maximal ideal of OX,x. If (X, OX ) and (Y, OY ) are ringed spaces # then a morphism of ringed spaces (ϕ, ϕ ):(X, OX ) → (Y, OY ) consists of a continuous map # −1 ϕ: X → Y together with a morphism of R-Alg-valued sheaves ϕ : OY → ϕ∗OX = OX ◦ϕ . Notice that for every x ∈ X and every V ⊆ Y open with ϕx ∈ V (and thus x ∈ ϕ−1V ), we have an arrow ϕ# V −1 germx OY V −−→ OX ϕ V −−−−→ OX,x # and by naturality of ϕ and germx these together constitute a cocone under the restricted op functor OY : L(Y, ϕx) → R-Alg and thus by the universal property of the colimit induce a unique morphism # # # ϕx : OY,ϕx → OX,x such that germx ◦ϕV = ϕx ◦ germϕx ∀V 3 ϕx open. # By this it makes sense to define that for (X, OX ) and (Y, OY ) locally ringed spaces and (ϕ, ϕ ) a morphism of ringed spaces we say that (ϕ, ϕ#) is a morphism of locally ringed spaces iff for # #−1 every x ∈ X the morphism ϕx is local in the sense that ϕx mX,x = mY,ϕx (or equivalently # # ϕx mY,ϕx ⊆ mX,x). As for ringed spaces, we usually identify (ϕ, ϕ ) with ϕ. We write SpcR for the category of R-ringed spaces R and LSpcR for the category of locally ringed spaces over R. 38 Chapter 4. Ringed Spaces
(1.2) Remark. In most texts, a ringed space is defined as topological space X together with a sheaf of rings on X but as Z is initial in the category of rings, every ring is a Z-algebra in a unique way and the category of Z-algebras is the category of rings. Thus our definition encompasses this case and we write Spc and LSpc as a shorthand for Spc and LSpc . Z Z Moreover, as most geometry (algebraic or analytic) is done over a fixed base field k all ringed spaces occurring in that context are naturally sheaves of k-algebras.
(1.3) Remark. If (X, OX ) is a (locally) ringed space and U ⊆ X open then (U, OX |U ) is again a (locally) ringed space. Because the notation OX |U is rather cumbersome, we will write OU := OX |U where there is no risk of confusion.
(1.4) Example. (Affine Schemes [bis]) In (3.5) of the last chapter we already defined the affine scheme (Spec A, Ae) associated to an R-algebra A (R any ring), which is a ringed space over R and in fact a locally ringed one for if p ∈ Spec A then the stalk Aep is isomorphic to Ap, the localisation of A at p (i.e. we formally invert all elements of the multiplicative system Sp := A \ p), while the colimiting cocone germp : AUe → Ap for U ⊆ Spec A open with p ∈ U is given by the canonical maps into the localisation. This Ap is obviously a local ring, −1 having Sp p (the image of p under the canonical morphism A → Ap) as its unique maximal ideal. Now, one could take the full subcategory of LSpcR containing all (Spec A, Ae) as the category of affine schemes over R but the requirement that an affine scheme is (rather than is like) a (Spec A, Ae) is usually too restrictive and one instead takes the repletion of this full subcategory. So that an affine scheme over R is a locally ringed space (X, OX ) over R, isomorphic to (Spec A, Ae) for some R-algebra A and a morphism between two affine schemes is simply a morphism of locally ringed spaces over R. We write AffSchR < LSpcR for the full subcategory of all affine schemes over R and again AffSch as a shorthand for AffSchZ; In the same spirit an affine scheme (with no base ring mentioned) is always understood to be an affine scheme over Z. In (3.5) of the last chapter we already defined Spec as a functor R-Algop → Top and one can extend this to a functor
ϕ (ϕ←,ϕ) Spec: R-Algop → AffSch,A −→ B 7→ (Spec B, Be) −−−−→e (Spec A, Ae), where ϕ is given on the basic sets D (a) of X := Spec A by ϕ := ϕ : A → B , which e X eDX (a) a a ϕa is the unique map induced by the composite of ϕ: A → B with the canonical map B → Bϕa. ← −1 Here we used that ADe X (a) = Aa and that (ϕ ) DX (a) = DSpec B(ϕa). This functor Spec is obviously an equivalence of categories and a quasi-inverse is given by
# # (ϕ,ϕ ) ϕY (X, OX ) −−−−→ (Y, OY ) 7→ OY Y −−→ OX X.
(1.5) Remark. One could think (possible encouraged by (1.2)) that our approach, using R-algebras gives a more general notion of an affine scheme but it really doesn’t. Because an R algebra A is nothing but a ring A, equipped with a morphism of rings R → A and a morphism of R-algebras is nothing but a morphism “under R”, so that R-Alg = R ↓ CRng. And by op op the above example, we know that R-Alg ' AffSchR (and in particular CRng ' AffSch for R = Z) via the spectrum functor, so that we have a series of equivalences of categories op op op AffSchR ' R-Alg = (R ↓ CRng) = CRng ↓ R ' AffSch ↓ Spec R. Thus an affine scheme over R is nothing but an object over Spec R in the category of affine schemes (over Z). As indicated in the corollaries below, such an equivalence of categories holds in a much more general context. Paragraph 1. Definition and First Properties 39
While the spectrum of a ring (as a locally ringed space) is a basic concept in algebraic geometry nowadays, it is really of a much more general nature and naturally arises in a wider context as the next theorem shall illustrate. For this let R be any ring and let us op # write Γ: LSpcR → R-Alg for the global sections functor, which sends (ϕ, ϕ ):(X, OX ) → # #op (Y, OY ) to the R-algebra morphism ϕX : OY Y → OX X (that is really to ϕX ). Γ / op (1.6) Theorem. There is an adjunction LSpcR o _ R-Alg and Spec is fully faithful. Spec
Proof. Let us check the universal property of the counit. If A is an R-algebra and Y := Spec A, the counit εA at an R-algebra A must be a ring morphism A → AYe = A and the natural candidate is εA := 1A. If now (X, OX ) is a locally ringed space and ϕ: A → OX X a morphism # of rings, we need to find a unique morphism of locally ringed spaces (ϕ,b ϕb ):(X, OX ) → (Y, Ae) making the following diagram commute.
(X, OX ) OX X B BB ϕop (ϕ,ϕ#) ϕ#op BB b b bY BB BB! (Y, Ae) A / A 1A
If there is such a morphism then for x ∈ X and p := ϕxb we get a commutative square
ϕ# = ϕ bY A / OX X
germp germx A / , p # OX,x ϕbx where germp is the canonical morphism into the localisation. Thus −1 −1 #−1 #−1 −1 −1 ϕxb = p = germp mp = germp ϕbx mx = ϕbSpec A germx mx = (germx ◦ϕ) mx, # where in the third equality, we used that ϕbx must be local. We take this as the definition of ϕb and this is indeed a continuous map for if a ∈ A and D(a) = Spec A \ V (Aa) is a basic open set then −1 ϕb D(a) = {x ∈ X | ϕxb ∈ D(a)} −1 = x ∈ X a∈ / (germx ◦ϕ) mx = {x ∈ X | germx ϕa∈ / mx} = {x ∈ X | ∃U 3 x open, ψ ∈ OX U : ϕa|U · ψ = 1} −1 so that if x ∈ ϕb D(a) =: Ua there is an open neighborhood U 3 x contained in Ua. Observe that since OX is a sheaf, Ua is the set of all x ∈ X, where ϕa is locally invertible at x and inverses are unique, we can collate the local inverses of ϕa to derive that ϕa|Ua is invertible in # OX Ua (and Ua is the biggest such open set). Now, we can describe ϕb : Ae → ϕb∗OX . If there is such a transformation then (with the same notation as before) we get another commutative square, similar to the last one
ϕ# = ϕ bY A / OX X
, Aa / OX Ua ϕ# bD(a) 40 Chapter 4. Ringed Spaces where the vertical arrows are the restriction maps of the corresponding structure sheafs. The upper leg A → OX X → OX Ua, b 7→ ϕb|Ua sends a to an invertible element and thus, by the # universal property of the localisation, ϕbD(a) must be the unique morphism
# b ϕb ϕ : Aa → OX Ua, 7→ bD(a) an ϕan
# which renders this diagram commutative and we again take this as the definition of ϕbD(a). With (ϕ, ϕ#) thus defined, the first commutative square gives us that this does indeed induce local maps between the stalks, for if x ∈ X and p := ϕxb , we have
# # −1 ϕ m = (ϕ ◦ germ )p = (germ ◦ϕ)p = (germ ◦ϕ)(germ ◦ϕ) mx ⊆ mx. bx ϕxb bx p x x x The uniqueness of (ϕ, ϕ#) follows by the above construction. b b
(1.7) Corollary. For A an R-algebra and (X, OX ) a locally ringed space over R, the map