3
$\begingroup$

For example, given etale maps $p : X \to B$, $r : Y \to B$ and continuous maps $f, g : X \to Y$ such that $p = r \circ f = r \circ g$, the equalizer of $f$ and $g$ seems to be $E = \lbrace x \in X \mid f x = g x \rbrace$ with the inclusion map $e : E \to X$ and the etale map $p \circ e : E \to B$. This works because whenever $f$ and $g$ agree at a point, they agree on a neighborhood of the point, and so $E$ is an open subspace of $X$.

Similarly, if I am not mistaken, the coequalizer of $f$ and $g$ is again computed simply as the quotient $Q = Y/{\sim}$ where $\sim$ is the least equivalence relation satisfying $f x \sim g x$ for all $x \in X$. The equivalence relation $\sim$ is fiber-wise, i.e., it never relates things from different fibers. The canonical quotient map $q : Y \to Q$ is compatible with $r$ and so we get a map $t : Q \to B$, which turns out to be etale.

Is this correct? Where can I find a reference? Most textbooks that prove the category of etale maps over a given base to be a topos make a detour via the category of sheaves on $B$, which makes the calculations of limits and colimits indirect, as they pass through the equivalence between etale maps and sheaves.

$\endgroup$

1 Answer 1

3
$\begingroup$

It follows from Theorem 2 of II.6 of Mac Lane-Mordijk that the inclusion functor from etale maps over X to bundles over X is left adjoint to taking the etale space of the sheaf of cross-sections. Thus the inclusion preserves all colimits and so colimits are fiber-wise. Exercise 6 of that chapter implies the inclusion preserves finite limits and so they are fiber-wise as well. I think it is not hard to see that an infinite fiber product of etale maps is not etale. This comes from the fact that basic neighborhoods in the product topology only see finitely many factors.

$\endgroup$
2
  • $\begingroup$ Thanks, in the meanwhile (7 months) I computed these facts myself with bruce force. $\endgroup$ Dec 3, 2011 at 10:01
  • $\begingroup$ Sorry, I just saw the question now :) $\endgroup$ Dec 3, 2011 at 12:04

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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