Lemma 100.6.6. Let $f : \mathcal{X} \to \mathcal{Y}$ be a separated (resp. quasi-separated, resp. quasi-DM, resp. DM) morphism of algebraic stacks. Then

1. given algebraic spaces $T_ i$, $i = 1, 2$ and morphisms $x_ i : T_ i \to \mathcal{X}$, with $y_ i = f \circ x_ i$ the morphism

$T_1 \times _{x_1, \mathcal{X}, x_2} T_2 \longrightarrow T_1 \times _{y_1, \mathcal{Y}, y_2} T_2$

is proper (resp. quasi-compact and quasi-separated, resp. locally quasi-finite, resp. unramified),

2. given an algebraic space $T$ and morphisms $x_ i : T \to \mathcal{X}$, $i = 1, 2$, with $y_ i = f \circ x_ i$ the morphism

$\mathit{Isom}_\mathcal {X}(x_1, x_2) \longrightarrow \mathit{Isom}_\mathcal {Y}(y_1, y_2)$

is proper (resp. quasi-compact and quasi-separated, resp. locally quasi-finite, resp. unramified).

Proof. Proof of (1). Observe that the diagram

$\xymatrix{ T_1 \times _{x_1, \mathcal{X}, x_2} T_2 \ar[d] \ar[r] & T_1 \times _{y_1, \mathcal{Y}, y_2} T_2 \ar[d] \\ \mathcal{X} \ar[r] & \mathcal{X} \times _\mathcal {Y} \mathcal{X} }$

is cartesian. Hence this follows from the fact that $f$ is separated (resp. quasi-separated, resp. quasi-DM, resp. DM) if and only if the diagonal is proper (resp. quasi-compact and quasi-separated, resp. locally quasi-finite, resp. unramified).

Proof of (2). This is true because

$\mathit{Isom}_\mathcal {X}(x_1, x_2) = (T \times _{x_1, \mathcal{X}, x_2} T) \times _{T \times T, \Delta _ T} T$

hence the morphism in (2) is a base change of the morphism in (1). $\square$

## Comments (0)

There are also:

• 8 comment(s) on Section 100.6: Higher diagonals

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