The Stacks project

Lemma 4.27.10. Let $\mathcal{C}$ be a category. Let $S$ be a left multiplicative system. If $f : X \to Y$, $f' : X' \to Y'$ are two morphisms of $\mathcal{C}$ and if

\[ \xymatrix{ Q(X) \ar[d]_{Q(f)} \ar[r]_ a & Q(X') \ar[d]^{Q(f')} \\ Q(Y) \ar[r]^ b & Q(Y') } \]

is a commutative diagram in $S^{-1}\mathcal{C}$, then there exist a morphism $f'' : X'' \to Y''$ in $\mathcal{C}$ and a commutative diagram

\[ \xymatrix{ X \ar[d]_ f \ar[r]_ g & X'' \ar[d]^{f''} & X' \ar[d]^{f'} \ar[l]^ s \\ Y \ar[r]^ h & Y'' & Y' \ar[l]_ t } \]

in $\mathcal{C}$ with $s, t \in S$ and $a = s^{-1}g$, $b = t^{-1}h$.

Proof. We choose maps and objects in the following way: First write $a = s^{-1}g$ for some $s : X' \to X''$ in $S$ and $g : X \to X''$. By LMS2 we can find $t : Y' \to Y''$ in $S$ and $f'' : X'' \to Y''$ such that

\[ \xymatrix{ X \ar[d]_ f \ar[r]_ g & X'' \ar[d]^{f''} & X' \ar[d]^{f'} \ar[l]^ s \\ Y & Y'' & Y' \ar[l]_ t } \]

commutes. Now in this diagram we are going to repeatedly change our choice of

\[ X'' \xrightarrow {f''} Y'' \xleftarrow {t} Y' \]

by postcomposing both $t$ and $f''$ by a morphism $d : Y'' \to Y'''$ with the property that $d \circ t \in S$. According to Remark 4.27.7 we may after such a replacement assume that there exists a morphism $h : Y \to Y''$ such that $b = t^{-1}h$ holds1. At this point we have everything as in the lemma except that we don't know that the left square of the diagram commutes. But the definition of composition in $S^{-1} \mathcal{C}$ shows that $b \circ Q\left(f\right)$ is the equivalence class of the pair $(h \circ f : X \to Y'', t : Y' \to Y'')$ (since $b$ is the equivalence class of the pair $(h : Y \to Y'', t : Y' \to Y'')$, while $Q\left(f\right)$ is the equivalence class of the pair $(f : X \to Y, \text{id} : Y \to Y)$), while $Q\left(f'\right) \circ a$ is the equivalence class of the pair $(f'' \circ g : X \to Y'', t : Y' \to Y'')$ (since $a$ is the equivalence class of the pair $(g : X \to X'', s : X' \to X'')$, while $Q\left(f'\right)$ is the equivalence class of the pair $(f' : X' \to Y', \text{id} : Y' \to Y')$). Since we know that $b \circ Q\left(f\right) = Q\left(f'\right) \circ a$, we thus conclude that the equivalence classes of the pairs $(h \circ f : X \to Y'', t : Y' \to Y'')$ and $(f'' \circ g : X \to Y'', t : Y' \to Y'')$ are equal. Hence using Lemma 4.27.6 we can find a morphism $d : Y'' \to Y'''$ such that $d \circ t \in S$ and $d \circ h \circ f = d \circ f'' \circ g$. Hence we make one more replacement of the kind described above and we win. $\square$

[1] Here is a more down-to-earth way to see this: Write $b = q^{-1}i$ for some $q : Y' \to Z$ in $S$ and some $i : Y \to Z$. By LMS2 we can find $r : Y'' \to Y'''$ in $S$ and $j : Z \to Y'''$ such that $j \circ q = r \circ t$. Now, set $d = r$ and $h = j \circ i$.

Comments (2)

Comment #326 by arp on

Typos:

  1. In the first line of the proof, it should say not .

  2. In the second to last line of the proof, the morphism should be not .

Comment #8336 by on

I think we can give a more user-readable derivation of (notation as explained after Definition 4.27.4). After making the observation that this notation satisfies (for some diagram in , with ), we have

There are also:

  • 19 comment(s) on Section 4.27: Localization in categories

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