The Stacks project

Lemma 7.8.8. Let $\mathcal{C}$ be a category. Let $\text{Cov}(\mathcal{C})$ be a proper class of coverings satisfying conditions (1), (2) and (3) of Definition 7.6.2. Let $\text{Cov}_1, \text{Cov}_2 \subset \text{Cov}(\mathcal{C})$ be two subsets of $\text{Cov}(\mathcal{C})$ which endow $\mathcal{C}$ with the structure of a site. If every covering $\mathcal{U} \in \text{Cov}(\mathcal{C})$ is combinatorially equivalent to a covering in $\text{Cov}_1$ and combinatorially equivalent to a covering in $\text{Cov}_2$, then $\mathop{\mathit{Sh}}\nolimits (\mathcal{C}, \text{Cov}_1) = \mathop{\mathit{Sh}}\nolimits (\mathcal{C}, \text{Cov}_2)$.

Proof. This is clear from Lemmas 7.8.7 and 7.8.3 above as the hypothesis implies that every covering $\mathcal{U} \in \text{Cov}_1 \subset \text{Cov}(\mathcal{C})$ is combinatorially equivalent to an element of $\text{Cov}_2$, and similarly with the roles of $\text{Cov}_1$ and $\text{Cov}_2$ reversed. $\square$

Comments (0)

There are also:

  • 6 comment(s) on Section 7.8: Families of morphisms with fixed target

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 00VY. Beware of the difference between the letter 'O' and the digit '0'.