I want to show that the category of sheaves on a topological space ($\mathbf {Sh}(X)$) is not $\mathbf{AB4^{*}}$. Recall that $\mathbf{AB4^{*}}$ means that the product of epimorphisms is an epimorphism.

What I have tried:

Let $X = \mathbb{C}$ and consider the sheaf of holomorphic functions: that is, for every open set $U$, we have the abelian group $$\mathcal{O}(U) := \left\{f\colon U \subseteq \mathbb{C} \longrightarrow \mathbb{C} : f \text{ is holomorphic in } U\right\}$$ Now consider the sheaf morphism that, given in components, is the complex differentiation map: $$ \begin{array}{rcl} d(U) \colon \mathcal{O}(U)& \longrightarrow &\mathcal{O}(U)\\ f & \longmapsto & d(U)(f) := \dfrac{df}{dz} \end{array} $$ I've seen that $d$ is an epimorphism of sheaves (not of presheaves: the function $f(z) = 1/z$ in $\mathbb{C}\setminus{\left\{0\right\}}$ is a classical counterexample), but I suspect that the product morphism is not epic. Any ideas? I accept other counterexamples, my goal is to show that $\mathbf{AB4^{*}}$ doesn't hold. $\mathbf{EDIT:}$

Given $\left\{f_{i} \colon A_{i} \longrightarrow B_{i}\right\}_{i \in \mathcal{I}}$, the product morphism is the unique morphism $$\varphi \colon \prod_{i \in \mathcal{I}} A_{i} \longrightarrow \prod_{i \in \mathcal{I}} B_{i}$$ so in my example, by product morphism I mean $d = f_{i}$ for $i \in \mathcal{I}$, where $\mathcal{I}$ is an infinite set.

  • $\begingroup$ What do you mean "the product morphism" ? $\endgroup$ – Max Jun 23 at 18:08
  • $\begingroup$ Post edited!!!! $\endgroup$ – Smm Jun 23 at 18:22
  • $\begingroup$ I was asking specifically about your example (although that wasn't clear): do you think it doesn't hold for any product ? Because in an abelian category, a finite product of epimorphisms is just as well a finite coproduct, and in any category a coproduct of epimorphisms is epic. So you're thinking of an infinite product of $d$'s ? $\endgroup$ – Max Jun 23 at 18:28
  • $\begingroup$ Sorry, of course I was thinking of an arbitrary product. $\endgroup$ – Smm Jun 23 at 18:32

I think that your example does not work. Indeed, we have the following lemma.

Lemma (Uniform surjectivity implies product surjectivity)

Let $\varphi_i : \mathcal{F}_i \to \mathcal{G}_i$ be a collection of sheaf morphisms, with base space $X$. Suppose that there is a basis $\mathcal{B}$ of $X$ such that $\varphi_i(U):\mathcal{F}_i(U) \to \mathcal{G}_i(U)$ is surjective for all $U \in \mathcal{B}$. Then $\prod_i \mathcal{F}_i \to \prod_i \mathcal{G}_i$ is sheaf surjective.

Proof. Sheaf surjectivity is equivalent to surjectivity on stalks. Take $[(g_i,U)]$ be an element of the stalk $(\prod \mathcal{G}_i)_x$. Take $x \in V \subset U$ such that $V \in \mathcal{B}$. By hypothesis, there exist $[(f_i, V)]$ that are sent to $[(g_i |V, V)]$, and we are done.

Corollary. Your example does not work. Indeed, if I well remember from complex analysis, your sheaf function is surjective on opens that are disks, and these constitute a basis.

Having in mind that we must force some disuniformity in $i$ with respect to the opens where we have a lifting, we build the following example.

  1. For $U \subset X$, define $\mathbb{Z}_U$ as the sheafification of the presheaf $Z_U$ such that $Z_U(V) = \mathbb{Z}$ if $V \subset U$, and 0 otherwise. Restriction functions are idenitites when possible and zeros otherwise. To be honest, it is possible that $Z_U$ is already a sheaf, but we don't care since we are only interested in stalks and these are preserved by sheafification.

  2. We have that $(\mathbb{Z}_U)_x = \mathbb{Z}$ if $x \in U$, and 0 otherwise, as a direct computation yields.

  3. If $\mathbb{Z}_{U}(V) \neq 0$ and $V$ is connected, then $V \subset U$. Indeed, a section $s \in \mathbb{Z}_{U}(V)$ is given by a cover $\mathcal{V}_{i \in I}$ of $V$ and coherent sections $s_i \in \mathcal{V}_i$. Suppose $V \not \subset U$. Define $\Sigma$ as the poset of subsets $Q \subset I$ such that $s_i=0$ for all $i \in Q$. Then it is non empty, because there exist i s.t $V_i \not \subseteq U$, and evidently every ascending chain has an upper bound. We can henceforth apply Zorn lemma a find a maximal $J$. Suppose by contradiction that $J \neq I$. There exist $i \in I \setminus J$ and $j\in J$ such that $V_i \cap V_j \neq \emptyset$, otherwise they would disconnect $V$. $V_i$ must be contained in $U$, otherwise $s_i$ would be zero. But then $s_i = s_i | V_i \cap V_j = s_j | V_i \cap V_j = 0$.

  4. Take $X=\mathbb{R}^k$, and $U_n =$ disk of radius $1/n$ around 0. Take the skyscraper sheaf $\mathcal{G}$ centered at zero with stalk $\mathbb{Z}$, i.e. $\mathcal{G}(U) = \mathbb{Z}$ if $0 \in U$ and 0 otherwise, with restriction given by identities when possible and zero otherwise. Define $\varphi_n: \mathbb{Z}_{U_n} \to \mathcal{G}$ in the following way. It is enough to define $\phi_n: Z_{U_n} \to \mathcal{G}$, and then $\varphi_n$ follwos by universal property of sheafification. If $V \subset U_n$, define $\phi_n(V) = 1_{\mathbb{Z}}$ and zero otherwise. It commutes with restrictions. Indeed, let $V \subset V'$ be subsets. If $V' \not \subset U_n$, the diagram starts with a zero. If $0 \not \in V$, the diagram ends with a zero. If $0 \in V \subset V' \subset U_n$, then the commuting diagram is made of all identities.

    1. Consider the sheaf morphism

$$\prod \varphi_n: \prod_{n \in \mathbb{N}} \mathbb{Z}_{U_n} \to \prod_{n \in \mathbb{N}} \mathcal{G}$$

Take the element $[(\{1\}_{n \in \mathbb{N}}, U_1)]$ in $( \prod_n\mathcal{G} )_0$, and suppose that there exist $[(\{f_n\}_{n \in \mathbb{N}},V)]$ that is sent to $[(\{1\}_{n \in \mathbb{N}}, U_1)]$. This means that, after further restricting to $V'$ if necessary, $f_n | V' = 1 $ for all $n \in \mathbb{N}$. Take $V''$ to be the connected component of $V'$ containing $0$. Recall that $V''$ is open. This imples in particular $\mathbb{Z}_{U_n}(V'') \not 0$ for all $ n \in \mathbb{N}$, i.e. $V'' \subset \bigcap_n U_n = \{0\}$; which is a contradiction.

On the other hand, the functions $\varphi_n$ are surjective, because they are surjective on stalks, and we are done.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.