Skip to content
The Lumenary

Each worksheet prints cleanly on A4 or Letter. Answer keys are on a separate page.

The Lumenary · First-year graduate

Sheaves

Name: ______________________

Date: ______________________

You will learn to

  • Define presheaves as functors O(X)op→Set\mathcal{O}(X)^{\mathrm{op}} \to \cat{Set} and state the sheaf condition both as locality-plus-gluing and as an equaliser condition
  • Prove that continuous functions form a sheaf, that constant presheaves usually do not, and that a section of a sheaf is determined by its germs
  • Compute stalks, prove that a morphism of sheaves is an isomorphism if and only if it is one on every stalk, and sheafify simple presheaves such as constant presheaves
  • Explain how sheaves of continuous, smooth and holomorphic functions encode local-to-global structure, with the logarithm and the exponential sequence as examples
  • Compute a first Čech cohomology group and explain how it measures the failure of local solutions to glue
  1. 1.

    Which of these presheaves of real-valued functions on R\R are sheaves? (Select all that apply.)

    • A.U↦U \mapsto continuous functions on UU
    • B.U↦U \mapsto smooth functions on UU
    • C.U↦U \mapsto bounded continuous functions on UU
    • D.U↦U \mapsto constant functions on UU
    • E.U↦U \mapsto locally constant functions on UU
    • F.U↦U \mapsto restrictions of polynomials to UU
  2. 2.

    How many sections does the sheaf Z/2‾\underline{\Z/2} of locally constant Z/2\Z/2-valued functions have over U=(0,1)∪(2,3)∪(4,5)⊂RU = (0, 1) \cup (2, 3) \cup (4, 5) \subset \R?

  3. 3.

    In the sheaf of continuous functions on R\R, which pair of functions has the same germ at 00?

    • A.f(x)=max⁡(0,x−1)f(x) = \max(0, x - 1) and g(x)=0g(x) = 0
    • B.f(x)=xf(x) = x and g(x)=sin⁡xg(x) = \sin x
    • C.f(x)=0f(x) = 0 and g(x)=x2g(x) = x^2
    • D.f(x)=∣x∣f(x) = |x| and g(x)=xg(x) = x
  4. 4.

    On X=C∖{0}X = \C \setminus \{0\}, the morphism exp⁡:O→O×\exp : \mathcal{O} \to \mathcal{O}^\times is surjective on every stalk. Is exp⁡:O(X)→O×(X)\exp : \mathcal{O}(X) \to \mathcal{O}^\times(X) surjective?

    • A.No: z∈O×(X)z \in \mathcal{O}^\times(X) has no global logarithm; the obstruction is its image in H1(X,Z‾)≅ZH^1(X, \underline{\Z}) \cong \Z, the winding number.
    • B.Yes, by Theorem 4: surjective on stalks implies surjective on sections.
    • C.Yes, because every non-vanishing holomorphic function has a logarithm.
    • D.No, because exp⁡\exp is not surjective on stalks at 00.
  5. 5.

    In the proof that a morphism of sheaves φ:F→G\varphi : F \to G which is bijective on stalks is surjective on sections, local preimages s(x)∈F(Vx)s^{(x)} \in F(V_x) of tt are glued. Why do s(x)s^{(x)} and s(y)s^{(y)} agree on Vx∩VyV_x \cap V_y?

    • A.Both map to t∣Vx∩Vyt|_{V_x \cap V_y}, and φ\varphi is injective on sections (proved first, from injectivity on stalks and Theorem 3).
    • B.Because GG is a sheaf.
    • C.Because they have the same value at the points of Vx∩VyV_x \cap V_y.
    • D.Because φx\varphi_x is surjective.
  6. 6.

    Cover S1S^1 by three open arcs U1,U2,U3U_1, U_2, U_3 such that each pairwise intersection is a single (connected) arc and the triple intersection is empty. What is dim⁡Z/2Hˇ1(U,Z/2‾)\dim_{\Z/2} \check H^1(\mathcal{U}, \underline{\Z/2})?

  7. 7.

    Given a cover U : ι → Opens X of V with hU : ∀ i, U i ≤ V and a compatible family s, which conclusion in the definition of IsSheaf captures both locality and gluing?

    • A.∃! t : F.sec V, ∀ i, F.res (hU i) t = s i
    • B.∃ t : F.sec V, ∀ i, F.res (hU i) t = s i
    • C.∀ t t' : F.sec V, (∀ i, F.res (hU i) t = F.res (hU i) t') → t = t'
    • D.∀ i j, F.res inf_le_left (s i) = F.res inf_le_right (s j)
  8. 8.

    Sections of the sheaf of all functions on a finite set are dictionaries. Write glue(sections) that takes a list of dictionaries (functions on subsets) and returns the single dictionary on the union that restricts to each of them, or None if two of them disagree on a common point.

    Computational — Practice

Code: Apache-2.0 · Content: CC BY-SA 4.0