Bourbaki

Exercise 2, § 7

Tag 03OS, permanent. Cite it as [Bourbaki, Tag 03OS].

Theory of Sets, III, 251

Let (Eα,fαβ)(\mathrm{E}_\alpha, f_{\alpha\beta}) be an inverse system of sets relative to a directed index set, let E=lim←⁡Eα\mathrm{E} = \varprojlim \mathrm{E}_\alpha, and let fα:E→Eαf_\alpha : \mathrm{E} \to \mathrm{E}_\alpha be the canonical mapping for each α\alpha. Show that, if all the fαβf_{\alpha\beta} are injective, then fαf_\alpha is injective.

Solution

This solution was written by nemotron-3-ultra-free and judged by a machine. It is not Bourbaki's and it has not been checked by a person.

Let II be a directed ordered set and (Eα,fαβ)(E_\alpha, f_{\alpha\beta}) an inverse system of sets relative to II such that each transition map fαβ:Eβ→Eαf_{\alpha\beta} : E_\beta \to E_\alpha (for α≤β\alpha \leq \beta) is injective. Let E=lim←⁡EαE = \varprojlim E_\alpha be the inverse limit and, for each α∈I\alpha \in I, let fα:E→Eαf_\alpha : E \to E_\alpha be the canonical mapping.

We must show that fαf_\alpha is injective for every α∈I\alpha \in I.

Fix α∈I\alpha \in I and take x,y∈Ex, y \in E with fα(x)=fα(y)f_\alpha(x) = f_\alpha(y). Since EE is a subset of the product ∏β∈IEβ\prod_{\beta \in I} E_\beta, the elements xx and yy are families (xβ)β∈I(x_\beta)_{\beta \in I} and (yβ)β∈I(y_\beta)_{\beta \in I} satisfying the compatibility condition xα=fαβ(xβ)x_\alpha = f_{\alpha\beta}(x_\beta) and yα=fαβ(yβ)y_\alpha = f_{\alpha\beta}(y_\beta) whenever α≤β\alpha \leq \beta; this is the definition of the inverse limit, and the canonical mappings are the projections fα(x)=xαf_\alpha(x) = x_\alpha. In particular, for any β∈I\beta \in I with β≥α\beta \geq \alpha we have fα(x)=fαβ(fβ(x))f_\alpha(x) = f_{\alpha\beta}(f_\beta(x)) and fα(y)=fαβ(fβ(y))f_\alpha(y) = f_{\alpha\beta}(f_\beta(y)) (formula (2) of §7 no. 1).

Now let β∈I\beta \in I be arbitrary. Because II is directed, there exists an index γ∈I\gamma \in I such that γ≥α\gamma \geq \alpha and γ≥β\gamma \geq \beta. Applying the compatibility relations at γ\gamma, we obtain

fα(x)=fαγ(fγ(x)),fα(y)=fαγ(fγ(y)). f_\alpha(x) = f_{\alpha\gamma}(f_\gamma(x)), \qquad f_\alpha(y) = f_{\alpha\gamma}(f_\gamma(y)).
Since fα(x)=fα(y)f_\alpha(x) = f_\alpha(y) by hypothesis, the injectivity of fαγf_{\alpha\gamma} yields fγ(x)=fγ(y)f_\gamma(x) = f_\gamma(y). Using the compatibility relation for β≤γ\beta \leq \gamma we then have
fβ(x)=fβγ(fγ(x))=fβγ(fγ(y))=fβ(y). f_\beta(x) = f_{\beta\gamma}(f_\gamma(x)) = f_{\beta\gamma}(f_\gamma(y)) = f_\beta(y).
Thus fβ(x)=fβ(y)f_\beta(x) = f_\beta(y) for every β∈I\beta \in I, which means x=yx = y in the product ∏β∈IEβ\prod_{\beta \in I} E_\beta, and hence in EE. Therefore fαf_\alpha is injective.

Since α\alpha was arbitrary, all canonical mappings fαf_\alpha are injective.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.