Bourbaki

Exercise 3, § 7

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

Theory of Sets, III, 251

Let (Eα,fαβ)(\mathrm{E}_\alpha, f_{\alpha\beta}) and (Fα,gαβ)(\mathrm{F}_\alpha, g_{\alpha\beta}) be two inverse systems of sets relative to the same index set I. For each α∈I\alpha \in \mathrm{I}, let uαu_\alpha be a mapping of Eα\mathrm{E}_\alpha into Fα\mathrm{F}_\alpha, such that the uαu_\alpha form an inverse system of mappings. Let Gα⊂Eα×Fα\mathrm{G}_\alpha \subset \mathrm{E}_\alpha \times \mathrm{F}_\alpha be the graph of uαu_\alpha. Show that (Gα)(\mathrm{G}_\alpha) is an inverse system of subsets of Eα×Fα\mathrm{E}_\alpha \times \mathrm{F}_\alpha and that its inverse limit may be canonically identified with the graph of u=lim←⁡uαu = \varprojlim u_\alpha.

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 (Eα,fαβ)(\mathrm{E}_\alpha, f_{\alpha\beta}) and (Fα,gαβ)(\mathrm{F}_\alpha, g_{\alpha\beta}) be two inverse systems of sets relative to the same index set I\mathrm{I}. For each α∈I\alpha \in \mathrm{I}, let uα:Eα→Fαu_\alpha : \mathrm{E}_\alpha \to \mathrm{F}_\alpha be a mapping such that the family (uα)(u_\alpha) is an inverse system of mappings, i.e. gαβ∘uβ=uα∘fαβg_{\alpha\beta} \circ u_\beta = u_\alpha \circ f_{\alpha\beta} whenever α⩽β\alpha \leqslant \beta. Let Gα⊂Eα×Fα\mathrm{G}_\alpha \subset \mathrm{E}_\alpha \times \mathrm{F}_\alpha be the graph of uαu_\alpha, so Gα={(x,uα(x))∣x∈Eα}\mathrm{G}_\alpha = \{ (x, u_\alpha(x)) \mid x \in \mathrm{E}_\alpha \}.

For α⩽β\alpha \leqslant \beta, the mapping fαβ×gαβ:Eβ×Fβ→Eα×Fαf_{\alpha\beta} \times g_{\alpha\beta} : \mathrm{E}_\beta \times \mathrm{F}_\beta \to \mathrm{E}_\alpha \times \mathrm{F}_\alpha sends (x,y)(x,y) to (fαβ(x),gαβ(y))(f_{\alpha\beta}(x), g_{\alpha\beta}(y)). If (x,y)∈Gβ(x,y) \in \mathrm{G}_\beta, then y=uβ(x)y = u_\beta(x), and

(fαβ(x),gαβ(y))=(fαβ(x),gαβ(uβ(x)))=(fαβ(x),uα(fαβ(x)))∈Gα, (f_{\alpha\beta}(x), g_{\alpha\beta}(y)) = (f_{\alpha\beta}(x), g_{\alpha\beta}(u_\beta(x))) = (f_{\alpha\beta}(x), u_\alpha(f_{\alpha\beta}(x))) \in \mathrm{G}_\alpha,
where the second equality uses the hypothesis gαβ∘uβ=uα∘fαβg_{\alpha\beta} \circ u_\beta = u_\alpha \circ f_{\alpha\beta}. Hence the restriction hαβ=(fαβ×gαβ)∣Gβh_{\alpha\beta} = (f_{\alpha\beta} \times g_{\alpha\beta})|_{\mathrm{G}_\beta} maps Gβ\mathrm{G}_\beta into Gα\mathrm{G}_\alpha. We verify that (Gα,hαβ)(\mathrm{G}_\alpha, h_{\alpha\beta}) satisfies the inverse system axioms. - For each α\alpha, fαα=id⁡Eαf_{\alpha\alpha} = \operatorname{id}_{\mathrm{E}_\alpha} and gαα=id⁡Fαg_{\alpha\alpha} = \operatorname{id}_{\mathrm{F}_\alpha}, so fαα×gαα=id⁡Eα×Fαf_{\alpha\alpha} \times g_{\alpha\alpha} = \operatorname{id}_{\mathrm{E}_\alpha \times \mathrm{F}_\alpha}. Restricting to Gα\mathrm{G}_\alpha gives hαα=id⁡Gαh_{\alpha\alpha} = \operatorname{id}_{\mathrm{G}_\alpha}. - If α⩽β⩽γ\alpha \leqslant \beta \leqslant \gamma, then fαγ=fαβ∘fβγf_{\alpha\gamma} = f_{\alpha\beta} \circ f_{\beta\gamma} and gαγ=gαβ∘gβγg_{\alpha\gamma} = g_{\alpha\beta} \circ g_{\beta\gamma}, hence fαγ×gαγ=(fαβ×gαβ)∘(fβγ×gβγ)f_{\alpha\gamma} \times g_{\alpha\gamma} = (f_{\alpha\beta} \times g_{\alpha\beta}) \circ (f_{\beta\gamma} \times g_{\beta\gamma}). Since hβγh_{\beta\gamma} maps Gγ\mathrm{G}_\gamma into Gβ\mathrm{G}_\beta, the restriction of the composition to Gγ\mathrm{G}_\gamma equals hαβ∘hβγh_{\alpha\beta} \circ h_{\beta\gamma}, while it is also hαγh_{\alpha\gamma}. Thus hαγ=hαβ∘hβγh_{\alpha\gamma} = h_{\alpha\beta} \circ h_{\beta\gamma}. Therefore (Gα,hαβ)(\mathrm{G}_\alpha, h_{\alpha\beta}) is an inverse system of subsets of Eα×Fα\mathrm{E}_\alpha \times \mathrm{F}_\alpha.

Let E=lim←⁡Eα\mathrm{E} = \varprojlim \mathrm{E}_\alpha and F=lim←⁡Fα\mathrm{F} = \varprojlim \mathrm{F}_\alpha, with canonical projections fα:E→Eαf_\alpha : \mathrm{E} \to \mathrm{E}_\alpha and gα:F→Fαg_\alpha : \mathrm{F} \to \mathrm{F}_\alpha. By Proposition 1 of § 1 (tag 03OC) applied to the inverse system (Fα,gαβ)(\mathrm{F}_\alpha, g_{\alpha\beta}) and the family of mappings vα=uα∘fα:E→Fαv_\alpha = u_\alpha \circ f_\alpha : \mathrm{E} \to \mathrm{F}_\alpha, which satisfies gαβ∘vβ=vαg_{\alpha\beta} \circ v_\beta = v_\alpha for α⩽β\alpha \leqslant \beta, there exists a unique mapping u:E→Fu : \mathrm{E} \to \mathrm{F} such that vα=gα∘uv_\alpha = g_\alpha \circ u for all α\alpha, i.e.

uα∘fα=gα∘u(α∈I). u_\alpha \circ f_\alpha = g_\alpha \circ u \qquad (\alpha \in \mathrm{I}).
(Although Proposition 1 is stated for an ordered index set, its proof only uses the preorder relations — transitivity and reflexivity — and does not require antisymmetry; hence it remains valid for preordered sets.) This uu is the inverse limit lim←⁡uα\varprojlim u_\alpha.

The product inverse system (Eα×Fα,fαβ×gαβ)(\mathrm{E}_\alpha \times \mathrm{F}_\alpha, f_{\alpha\beta} \times g_{\alpha\beta}) has inverse limit canonically isomorphic to E×F\mathrm{E} \times \mathrm{F} by Corollary 2 of Proposition 4 (tag 03OH). Under this isomorphism, an element (zα)∈lim←⁡(Eα×Fα)(z_\alpha) \in \varprojlim (\mathrm{E}_\alpha \times \mathrm{F}_\alpha) corresponds to (x,y)∈E×F(x,y) \in \mathrm{E} \times \mathrm{F} with xα=pr⁡1(zα)x_\alpha = \operatorname{pr}_1(z_\alpha), yα=pr⁡2(zα)y_\alpha = \operatorname{pr}_2(z_\alpha).

The inverse limit lim←⁡Gα\varprojlim \mathrm{G}_\alpha is the subset of lim←⁡(Eα×Fα)\varprojlim (\mathrm{E}_\alpha \times \mathrm{F}_\alpha) consisting of families (zα)(z_\alpha) with zα∈Gαz_\alpha \in \mathrm{G}_\alpha for all α\alpha. Under the canonical isomorphism, this corresponds to the set of (x,y)∈E×F(x,y) \in \mathrm{E} \times \mathrm{F} such that for every α\alpha,

(xα,yα)∈Gα  ⟺  yα=uα(xα). (x_\alpha, y_\alpha) \in \mathrm{G}_\alpha \iff y_\alpha = u_\alpha(x_\alpha).
If (x,y)(x,y) satisfies this condition, then yα=uα(xα)=uα(fα(x))=gα(u(x))y_\alpha = u_\alpha(x_\alpha) = u_\alpha(f_\alpha(x)) = g_\alpha(u(x)) for all α\alpha, so y=u(x)y = u(x) because the canonical map F→∏αFα\mathrm{F} \to \prod_\alpha \mathrm{F}_\alpha is injective. Conversely, if y=u(x)y = u(x), then gα(y)=gα(u(x))=uα(fα(x))g_\alpha(y) = g_\alpha(u(x)) = u_\alpha(f_\alpha(x)), so yα=uα(xα)y_\alpha = u_\alpha(x_\alpha) for all α\alpha. Hence the image of lim←⁡Gα\varprojlim \mathrm{G}_\alpha is exactly the graph of uu. This identification is canonical because it is induced by the canonical projections.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.