Bourbaki

Exercise 39, § 1

Commutative Algebra, IX

Let SS be a nonempty subset of J\mathbf{J} such that for every nn in S, S contains Jn\mathbf{J}_n. Let πS\pi_S be the canonical projection of AJA^\mathbf{J} onto ASA^S. a) The kernel of πS\pi_S is an ideal of A. We shall denote by US(A)U_S(A) the ring obtained by endowing ASA^S with the structure of quotient ring. We have a commutative diagram of ring homomorphisms

U(A)→ΦAJπS↓πS↓US(A)→ΦSAS \begin{array}{ccc} U(A) & \xrightarrow{\Phi} & A^\mathbf{J} \\ \pi_S \downarrow & & \pi_S \downarrow \\ U_S(A) & \xrightarrow{\Phi_S} & A^S \end{array}

where ΦS((an)n∈S)=(Φn((ad)d∈Jn))n∈S\Phi_S((a_n)_{n \in S}) = (\Phi_n((a_d)_{d \in \mathbf{J}_n}))_{n \in S}.

b) For every n∈Jn \in \mathbf{J}, Ker(πS)\mathrm{Ker}(\pi_S) is stable by VnV_n, and Ker(πS)\mathrm{Ker}(\pi_S) contains Vn(U(A))V_n(U(A)) if n∉Sn \notin S. By passing to the quotient VnV_n defines an endomorphism, still denoted VnV_n, of the additive group of US(A)U_S(A). c) If n∈Jn \in \mathbf{J} and if nS⊂SnS \subset S then Ker(πS)\mathrm{Ker}(\pi_S) is stable by FnF_n, which defines, by passing to the quotient, an endomorphism, still denoted FnF_n, of the ring US(A)U_S(A). d) Let n∈Jn \in \mathbf{J}. The ring US(A)U_S(A) will also be denoted by Un(A)U_n(A) if S=JnS = J_n, and by Un∞(A)U_{n^\infty}(A) if S=⋃r≥1JnrS = \bigcup_{r \geq 1} J_{n^r}.

Let pp be a prime number. Now prove that Up∞(A)U_{p^\infty}(A) is identified with the Witt ring W(A)W(A), and that, for every n∈Nn \in \mathbf{N}, Upn(A)U_{p^n}(A) is identified with the ring Wn+1(A)W_{n+1}(A) (the element (u1,up,up2,...,upn−1,upn)(u_1, u_p, u_{p^2}, ..., u_{p^{n-1}}, u_{p^n}) of Upn(A)U_{p^n}(A) will be identified with the Witt vector [a0,...,an][a_0, ..., a_n] with ai=upia_i = u_{p^i} for 0≤i≤n0 \leq i \leq n). The group endomorphisms VpV_p and FpF_p of Up∞(A)U_{p^\infty}(A) correspond respectively, by this identification, to the shift and to the Frobenius endomorphism of W(A)W(A).

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.