Bourbaki

Theorem 1

Tag 04E3, permanent. Cite it as [Bourbaki, Tag 04E3].

Commutative Algebra, chapter III, § 2. General results on filtered rings and modules

Let X, Y be two filtered groups whose filtrations (Xn),(Yn)(X_n), (Y_n) consist of normal subgroups; let u:X→Yu : X \to Y be a homomorphism compatible with the filtrations.

(i) Suppose that the filtration (Xn)(X_n) is exhaustive. For gr(u)\mathrm{gr}(u) to be injective, it is necessary and sufficient that uˉ−1(Yn)=Xn\bar{u}^{-1}(Y_n) = X_n for all n∈Zn \in \mathbf{Z}.

(ii) Suppose that one of the following hypotheses holds: (α) X is complete and Y Hausdorff; (β) Y is discrete. Then, for gr(u)\mathrm{gr}(u) to be surjective, it is necessary and sufficient that Yn=u(Xn)Y_n = u(X_n) for all n∈Zn \in \mathbf{Z}.

(i) To say that the mapping grn(u)\mathrm{gr}_n(u) is injective means that

Xn∩uˉ−1(Yn+1)⊂Xn+1. X_n \cap \bar{u}^{-1}(Y_{n+1}) \subset X_{n+1}.
This is obviously the case if (Yn+1)=Xn+1(Y_{n+1}) = X_{n+1}. Conversely, if
Xn∩uˉ−1(Yn+1)⊂Xn+1 X_n \cap \bar{u}^{-1}(Y_{n+1}) \subset X_{n+1}
for all nn, we deduce by induction on kk that Xn−k∩uˉ−1(Yn+1)⊂Xn+1X_{n-k} \cap \bar{u}^{-1}(Y_{n+1}) \subset X_{n+1} for all n∈Zn \in \mathbf{Z} and all k≥0k \geq 0. As the filtration (Xn)(X_n) is exhaustive, we see that, for all nn, XnX_n is the union of the Xn−kX_{n-k} (k≥0k \geq 0), hence uˉ−1(Yn+1)⊂Xn+1\bar{u}^{-1}(Y_{n+1}) \subset X_{n+1} for all nn and therefore Xn+1⊂uˉ−1(Yn+1)X_{n+1} \subset \bar{u}^{-1}(Y_{n+1}), which completes the proof.

(ii) To say that the mapping grn(u)\mathrm{gr}_n(u) is surjective means that

Yn=u(Xn)Yn+1. Y_n = u(X_n)Y_{n+1}.
This is obviously the case if Yn=u(Xn)Yn+1Y_n = u(X_n)Y_{n+1} for all n∈Zn \in \mathbf{Z}. Let nn be an integer and yy an element of YnY_n; we shall define a sequence (xk)k≥0(x_k)_{k \geq 0} of elements of XnX_n such that xk∈Xnx_k \in X_n, xk+1≡xk(modXn+k)x_{k+1} \equiv x_k \pmod{X_{n+k}} and u(xk)≡y(modYn+k)u(x_k) \equiv y \pmod{Y_{n+k}} for all k≥0k \geq 0. We shall take x0x_0 equal to the identity element of X, which certainly gives u(x0)≡y(modYn)u(x_0) \equiv y \pmod{Y_n}. Suppose that an xk∈Xnx_k \in X_n has been constructed such that u(xk)≡y(modYn+k)u(x_k) \equiv y \pmod{Y_{n+k}}; then (u(xk))−1y∈Yn+k(u(x_k))^{-1}y \in Y_{n+k}; the hypothesis implies that there exists t∈Xn+kt \in X_{n+k} such that u(t)≡(u(xk))−1y(modYn+k+1)u(t) \equiv (u(x_k))^{-1}y \pmod{Y_{n+k+1}} and hence u(xkt)≡y(modYn+k+1)u(x_k t) \equiv y \pmod{Y_{n+k+1}}; it is sufficient to take xk+1=xktx_{k+1} = x_k t to carry out the induction. This being so, if Y is discrete, there exists k≥0k \geq 0 such that Yn+k={e′}Y_{n+k} = \{e'\} (the identity element of Y), whence u(xk)=yu(x_k) = y and hence in this case it has been proved that u(Xn)=Yu(X_n) = Y, for all nn. Suppose now that X is complete and Y Hausdorff. As xh−1xk∈Xn+kx_h^{-1} x_k \in X_{n+k} for h≥k≥0h \geq k \geq 0, (xk)(x_k) is a Cauchy sequence in XnX_n; as

X_n is closed in X and hence complete, this sequence has at least one limit x in X_n. By virtue of the continuity of u, u(x) is the unique limit of the sequence (u(x_k)) in Y, Y being Hausdorff. But the relations u(x_k) \equiv y (\text{mod. } Y_{n+k+1}) show that y is also a limit of this sequence, whence u(x)=yu(x) = y and it has also been proved that u(Xn)=Ynu(X_n) = Y_n.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Nothing.

Transcribed from the printed volume. Not translated.