The Stacks project

Lemma 39.3.5. Let $j : R \to U \times _ S U$ be a pre-relation. Assume

  1. $s, t$ are unramified,

  2. for any algebraically closed field $k$ over $S$ the map $R(k) \to U(k) \times U(k)$ is an equivalence relation,

  3. there are morphisms $e : U \to R$, $i : R \to R$, $c : R \times _{s, U, t} R \to R$ such that

    \[ \xymatrix{ U \ar[r]_ e \ar[d]_\Delta & R \ar[d]_ j & R \ar[d]^ j \ar[r]_ i & R \ar[d]^ j & R \times _{s, U, t} R \ar[d]^{j \times j} \ar[r]_ c & R \ar[d]^ j \\ U \times _ S U \ar[r] & U \times _ S U & U \times _ S U \ar[r]^{flip} & U \times _ S U & U \times _ S U \times _ S U \ar[r]^{\text{pr}_{02}} & U \times _ S U } \]

    are commutative.

Then $j$ is an equivalence relation.

Proof. By condition (1) and Morphisms, Lemma 29.35.16 we see that $j$ is a unramified. Then $\Delta _ j : R \to R \times _{U \times _ S U} R$ is an open immersion by Morphisms, Lemma 29.35.13. However, then condition (2) says $\Delta _ j$ is bijective on $k$-valued points, hence $\Delta _ j$ is an isomorphism, hence $j$ is a monomorphism. Then it easily follows from the commutative diagrams that $R(T) \subset U(T) \times U(T)$ is an equivalence relation for all schemes $T$ over $S$. $\square$

Comments (0)

There are also:

  • 6 comment(s) on Section 39.3: Equivalence relations

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