The Stacks project

\begin{equation*} \DeclareMathOperator\Coim{Coim} \DeclareMathOperator\Coker{Coker} \DeclareMathOperator\Ext{Ext} \DeclareMathOperator\Hom{Hom} \DeclareMathOperator\Im{Im} \DeclareMathOperator\Ker{Ker} \DeclareMathOperator\Mor{Mor} \DeclareMathOperator\Ob{Ob} \DeclareMathOperator\Sh{Sh} \DeclareMathOperator\SheafExt{\mathcal{E}\mathit{xt}} \DeclareMathOperator\SheafHom{\mathcal{H}\mathit{om}} \DeclareMathOperator\Spec{Spec} \newcommand\colim{\mathop{\mathrm{colim}}\nolimits} \newcommand\lim{\mathop{\mathrm{lim}}\nolimits} \newcommand\Qcoh{\mathit{Qcoh}} \newcommand\Sch{\mathit{Sch}} \newcommand\QCohstack{\mathcal{QC}\!\mathit{oh}} \newcommand\Cohstack{\mathcal{C}\!\mathit{oh}} \newcommand\Spacesstack{\mathcal{S}\!\mathit{paces}} \newcommand\Quotfunctor{\mathrm{Quot}} \newcommand\Hilbfunctor{\mathrm{Hilb}} \newcommand\Curvesstack{\mathcal{C}\!\mathit{urves}} \newcommand\Polarizedstack{\mathcal{P}\!\mathit{olarized}} \newcommand\Complexesstack{\mathcal{C}\!\mathit{omplexes}} \newcommand\Pic{\mathop{\mathrm{Pic}}\nolimits} \newcommand\Picardstack{\mathcal{P}\!\mathit{ic}} \newcommand\Picardfunctor{\mathrm{Pic}} \newcommand\Deformationcategory{\mathcal{D}\!\mathit{ef}} \end{equation*}

Lemma 25.11.7. Let $X$ be a scheme. Let $\mathcal{B}$ be the set of affine opens of $X$. Let $\mathcal{F}$ be a presheaf of sets on $\mathcal{B}$, see Sheaves, Definition 6.30.1. The following are equivalent

  1. $\mathcal{F}$ is the restriction of a sheaf on $X$ to $\mathcal{B}$,

  2. $\mathcal{F}$ is a sheaf on $\mathcal{B}$, and

  3. $\mathcal{F}(\emptyset )$ is a singleton and whenever $U = V \cup W$ with $U, V, W \in \mathcal{B}$ and $V, W \subset U$ standard open (Algebra, Definition 10.16.3) the map

    \[ \mathcal{F}(U) \longrightarrow \mathcal{F}(V) \times \mathcal{F}(W) \]

    is injective with image the set of pairs $(s, t)$ such that $s|_{V \cap W} = t|_{V \cap W}$.

Proof. The equivalence of (1) and (2) is Sheaves, Lemma 6.30.7. It is clear that (2) implies (3). Hence it suffices to prove that (3) implies (2). By Sheaves, Lemma 6.30.4 and Lemma 25.5.1 it suffices to prove the sheaf condition holds for standard open coverings (Definition 25.5.2) of elements of $\mathcal{B}$. Let $U = U_1 \cup \ldots \cup U_ n$ be a standard open covering with $U \subset X$ affine open. We will prove the sheaf condition for this covering by induction on $n$. If $n = 0$, then $U$ is empty and we get the sheaf condition by assumption. If $n = 1$, then there is nothing to prove. If $n = 2$, then this is assumption (3). If $n > 2$, then we write $U_ i = D(f_ i)$ for $f_ i \in A = \mathcal{O}_ X(U)$. Suppose that $s_ i \in \mathcal{F}(U_ i)$ are sections such that $s_ i|_{U_ i \cap U_ j} = s_ j|_{U_ i \cap U_ j}$ for all $1 \leq i < j \leq n$. Since $U = U_1 \cup \ldots \cup U_ n$ we have $1 = \sum _{i = 1, \ldots , n} a_ i f_ i$ in $A$ for some $a_ i \in A$, see Algebra, Lemma 10.16.2. Set $g = \sum _{i = 1, \ldots , n - 1} a_ if_ i$. Then $U = D(g) \cup D(f_ n)$. Observe that $D(g) = D(gf_1) \cup \ldots \cup D(gf_{n - 1})$ is a standard open covering. By induction there is a unique section $s' \in \mathcal{F}(D(g))$ which agrees with $s_ i|_{D(gfi)}$ for $i = 1, \ldots , n - 1$. We claim that $s'$ and $s_ n$ have the same restriction to $D(gf_ n)$. This is true by induction and the covering $D(gf_ n) = D(gf_ nf_1) \cup \ldots \cup D(gf_ nf_{n - 1})$. Thus there is a unique section $s \in \mathcal{F}(U)$ whose restriction to $D(g)$ is $s'$ and whose restriction to $D(f_ n)$ is $s_ n$. We omit the verification that $s$ restricts to $s_ i$ on $D(f_ i)$ for $i = 1, \ldots , n - 1$ and we omit the verification that $s$ is unique. $\square$


Comments (0)


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 0F1A. Beware of the difference between the letter 'O' and the digit '0'.