Jump to content

Topics in Abstract Algebra/Sheaf theory

From Wikibooks, open books for an open world

Sheaf theory

[edit | edit source]

We say ℱ is a pre-sheaf on a topological space X if

  • (i) ℱ(U) is an abelian group for every open subset U⊂X
  • (ii) For each inclusion U↪V, we have the group morphism ρV,U:ℱ(V)→ℱ(U) such that
    ρU,U is the identity and ρW,U=ρV,U∘ρW,V for any inclusion U↪V↪W

A pre-sheaf is called a sheaf if the following "gluing axiom" holds:

For each open subset U and its open cover Uj, if fj∈ℱ(Uj) are such that fj=fk in Uj∩Uk, then there exists a unique f∈ℱ(U) such that f|Uj=fj for all j.

Note that the uniqueness implies that if f,g∈ℱ(U) and f|Uj=g|Uj for all j, then f=g. In particular, f|Uj=0 for all j implies f=0.

4 Example: Let G be a topological group (e.g., 𝐑). Let ℱ(U) be the set of all continuous maps from open subsets U⊂X to G. Then ℱ forms a sheaf. In particular, suppose the topology for G is discrete. Then ℱ is called a constant sheaf.

Given sheaves ℱ and 𝒢, a sheaf morphism ϕ:ℱ→𝒢 is a collection of group morphisms ϕU:ℱ(U)→𝒢(U) satisfying: for every open subset U⊂V,

ϕU∘ρV,U=ρV,U∘ϕV

where the first ρV,U is one that comes with ℱ and the second 𝒢.

Define (ker⁡ϕ)(U)=ker⁡ϕU for each open subset U. ker⁡ϕ is then a sheaf. In fact, suppose fj∈ker⁡ϕUj. Then there is f∈ℱ(U) such that f|Uj=fj. But since

(ϕUf)|Uj=ϕUj(f|Uj)=ϕUjfj=0

for all j, we have ϕUf=0. Unfortunately, im⁡ϕ does not turn out to be a sheaf if it is defined in the same way. We thus define (im⁡ϕ)(U) to be the set of all f∈𝒢(U) such that there is an open cover Uj of U such that f|Uj is in the image of ϕUj. This is a sheaf. In fact, as before, let f∈𝒢(U) be such that f|Uj∈im⁡ϕUj. Then we have an open cover of U such that f restricted to each member V of the cover is in the image of ϕV.

Let ℱ0,ℱ1,ℱ2 be sheaves on the same topological space.

A sheaf ℱ on X is said to be flabby if ρX,U:ℱ(X)→ℱ(U) is surjective. Let ℱp=limU∋pℱ(U), and, for each f∈ℱ(U), define supp⁡f={x∈U|f|p≠0}. supp⁡f is closed since f|p=0 implies p has a neighborhood of U such that f|q=0 for every q∈U. Define Supp⁡ℱ={x∈X|ℱx≠0}. In particular, if i:Z↪X is a closed subset and Supp⁡ℱ⊂Z, then the natural map ℱ→i∗i−1ℱ is an isomorphism.

4 Theorem Suppose

0⟶ℱ0⟶ℱ1⟶ℱ2⟶0

is exact. Then, for every open subset U

0⟶ΓZ(U,ℱ0)⟶ΓZ(U,ℱ1)⟶ΓZ(U,ℱ2)

is exact. Furthermore, ΓZ(U,ℱ1)→ΓZ(U,ℱ2) is surjective if ℱ0 is flabby.
Proof: That the kernel of ker⁡ℱ0⟶ℱ1 is trivial means that ker⁡ℱ0(U)⟶ℱ1(U) has trivial kernel for any U. Thus the first map is clear. Next, denoting ℱ1→ℱ2 by d, suppose f∈ℱ1(U) with df=0. Then there exists an open cover Uj of U and uj∈ℱ(Uj) such that duj=f|Uj. Since duj=f=duk in Uj∩Uk and dUj∩Uk is injective by the early part of the proof, we have uj=uk in Uj∩Uk and so we get u∈ℱ(U) such that du=f. Finally, to show that the last map is surjective, let f∈ℱ2(U), and Ω={(U,u)|du=f|U}. If {(Uj,uj)|j∈J}⊂Ω is totally ordered, then let U=∪jUj. Since uj agree on overlaps by totally ordered-ness, there is u∈ℱ(U) with u|Uj=uj. Thus, (U,u) is an upper bound of the collection (Uj,uj). By Zorn's Lemma, we then find a maximal element (U0,u0). We claim U0=U. Suppose not. Then there exists (U1,u1) with du1=f|U1. Since d(u0−u1)=0 in U0∩U1, by the early part of the proof, there exists a∈ℱ0(U0∩U1) with da=u0−u1. Then d(u1+da)=du1=f|U1 (so (U1,u1)∈Ω) while u1+da=u0 in U0∩U1. This contradicts the maximality of (U0,u0). Hence, we conclude U0=U and so du0=f. ◻

4 Corollary

0⟶ℱ0⟶ℱ1⟶ℱ2⟶0

is exact if and only if

0⟶ℱp0⟶ℱp1⟶ℱp2⟶0

is exact for every p∈X.

Suppose f:X→Y is a continuous map. The sheaf f∗ℱ (called the pushforward of ℱ by f) is defined by f∗ℱ(U)=ℱ(f−1(U)) for an open subset U⊂Y. Suppose f:Y→X is a continuous map. The sheaf f−1ℱ is then defined by f−1ℱ(U)= the sheafification of the presheaf U↦lim→V⊃f(U)ℱ(V) where V is an open subset of X. The two are related in the following way. Let U⊂X be an open subset. Then f−1f∗ℱ(U) consists of elements f in ℱ(f−1(V)) where V⊃f(U). Since f−1(V)⊃U, we find a map

f−1f∗ℱ→ℱ

by sending f to f|U. The map is well-defined for it doesn't depend on the choice of V.