Bourbaki

3. Factorial domains

1. Definition of factorial domains

Definition 1

A Krull domain all of whose divisorial ideals are principal is called a factorial (or unique factorization) domain.

In other words, the group of divisor classes (§ 1, no. 2) is reduced to 0.

Examples (1) Every principal ideal domain is factorial (and, recall, is a Dedekind domain). Conversely, every factorial Dedekind domain is a principal ideal domain by § 2, no. 2, Theorem 1 (c). (2) In particular, if K is a field, the rings K[X] and K[[X]] are factorial domains (see Theorem 2 and Proposition 8 below for generalizations). (3) \* The local ring of a simple point of an algebraic variety is a factorial domain. The ring of germs of functions analytic at the origin of Cn\mathbf{C}^n is a factorial domain. \*

2. Characterizations of factorial domains

Given a ring AA, we need to consider the following condition:

(M) Every non-empty family of integral principal ideals of AA has a maximal element.

Theorem 1

Let AA be an integral domain. The following conditions are equivalent: (a) AA is factorial; (b) the ordered group of non-zero fractional principal ideals of AA is a direct sum of groups isomorphic to Z\mathbf{Z} (ordered by the product order); (c) condition (M) is satisfied and the intersection of two principal ideals of AA is a principal ideal; (d) condition (M) is satisfied and, for every extremal element pp of AA, the ideal ApAp is prime; (e) AA is a Krull domain and every prime ideal of height 1 is principal.

We shall denote by K the field of fractions of A and by P∗\mathscr{P}^* (or P∗(A)\mathscr{P}^*(A)) the ordered group of non-zero fractional principal ideals of A. The proof will be carried out by proving the following implications:

(a) ⇔ (b) ⇔ (c) ⇔ (d) ⇔ (e)

We show that (a) implies (b); if A is factorial, P∗\mathscr{P}^* is isomorphic to the group of divisors of A and hence to a direct sum of groups Z\mathbf{Z} (§1§ 1, no. 3, Theorem 2).

Note now that the relation "the intersection of two integral principal ideals of A is a principal ideal" means that every ordered pair of elements of A admits a lcmlcm, that is that P∗\mathscr{P}^* is a lattice-ordered group (Algebra, Chapter VI, §1§ 1, no. 9, Proposition 8). The fact that (b) implies (c) (and even is equivalent to it) therefore follows from Algebra, Chapter VI, §1§ 1, no. 13, Theorem 2. The fact that (c) implies (d) follows from Algebra, Chapter VI, §1§ 1, no. 13, Proposition 14 (DIV).

The fact that (d) implies (b) follows from Algebra, Chapter VI, §1§ 1, no. 13, Theorem 2 applied to the group S∗\mathscr{S}^*.

We show that (b) implies (e). If (b) holds, there is an isomorphism of P∗\mathscr{P}^* onto Z(l)\mathbf{Z}^{(l)}; let (vi(x))i∈I(v_i(x))_{i \in I} denote the element of Z(l)\mathbf{Z}^{(l)} corresponding to the ideal AxAx (x∈K∗x \in K^*). It is seen immediately that each viv_i is a discrete valuation on K, that A is the intersection of the rings of the viv_i and that, for x∈K∗x \in K^*, vi(x)=0v_i(x) = 0 except for a finite number of indices ii; hence A is a Krull domain. On the other hand, let q be a prime ideal of A of height 1; it contains a non-zero element a which is necessarily not invertible and hence also (by definition of a prime ideal) one of the extremal elements of A; as ApAp is prime and non zero, q=Apq = Ap, which proves that q is principal.

Finally we show that (e) implies (a). Let a be a divisorial ideal of A. There exist prime ideals pip_i of A of height 1 such that div⁡a=∑inidiv⁡pi\operatorname{div} a = \sum_i n_i \operatorname{div} p_i where ni∈Zn_i \in \mathbf{Z}. If (e) holds, pip_i is of the form ApiAp_i, whence div⁡a=div⁡(∏iApini)\operatorname{div} a = \operatorname{div} \left( \prod_i Ap_i^{n_i} \right) and hence a=∏iApinia = \prod_i Ap_i^{n_i} since a is divisorial.

Proposition 1

Let A be a Krull domain. If every divisorial ideal of A is invertible, then, for every maximal ideal m of A, AmA_m is factorial. The converse is true if it is also assumed that every divisorial ideal of A is finitely generated (in particular if A is Noetherian).

Suppose that every divisorial ideal of AA is invertible; as A,,A_{,,} is a Krull domain (§1§ 1, no. 4, Proposition 6), every divisorial ideal aa of A,,A_{,,} is the intersection of two principal fractional ideals (§1§ 1, no. 5, Corollary 2 to Proposition 9); hence a=bAma = bA_m, where bb is a divisorial ideal of AA (Chapter II, §2§ 2, no. 4); as bb is invertible by hypothesis, we deduce from Chapter II, §5§ 5, no. 6, Theorem 4 that aa is principal and hence A,,A_{,,} is a factorial domain (no. 1, Definition 1). Conversely, if all the A,,A_{,,} are factorial and cc is a finitely generated divisorial ideal of AA, cAmcA_m is a divisorial ideal of A,,A_{,,}, as follows from §1§ 1, no. 5, Corollary 2 to Proposition 9 and Chapter II, §2§ 2, no. 4; by hypothesis cAmcA_m is principal and hence it follows from Chapter 11, §5§ 5, no. 6, Theorem 4 that cc is invertible.

3. Decomposition into extremal elements

Let AA be an integral domain, KK its field of fractions and UU the multiplicative group of invertible elements of AA. Recall (Algebra, Chapter VI, §1§ 1, no. 5) that there is a canonical isomorphism of K∗/UK^*/U onto the group P∗\mathscr{P}^* of non-zero fractional principal ideals of AA. Condition (b) of Theorem 1 may then be translated as follows:

Proposition 2

Let AA be an integral domain. For AA to be factorial, it is necessary and sufficient that there exist a subset PP of AA such that every a∈A−{0}a \in A - \{0\} may be written uniquely in the form a=u∏p∈Ppn(p)a = u \prod_{p \in P} p^{n(p)}, where u∈Uu \in U and the n(p)n(p) are positive integers which are zero except for a finite number of them.

If PP satisfies this condition, clearly all its elements are extremal and every extremal element of AA is associated with a unique element of PP. Recall that PP is then called a representative system of extremal elements of AA (Algebra, Chapter VII, §1§ 1, no. 3, Definition 2).

Suppose always that AA is factorial. It has been seen (no. 2, Theorem 1) that the group P∗\mathscr{P}^* is a lattice. We may therefore apply the results of Algebra, Chapter VI, §1§ 1, nos. 9 and 13. In particular, every element of K∗K^* may be written in an essentially unique way in the form of an irreducible fraction. Any two elements a,ba, b of K∗K^* have a g.c.d. and a l.c.m.; if a=u∏p∈Ppn(p)a = u \prod_{p \in P} p^{n(p)} and

b=u′∏p∈Ppm(p) b = u' \prod_{p \in P} p^{m(p)}
are decompositions of aa and bb as products of extremal elements, then:
(1)g.c.d.(a,b)=w∏p∈Ppinf⁡(m(p),n(p)) \text{(1)} \quad \text{g.c.d.}(a, b) = w \prod_{p \in P} p^{\inf(m(p), n(p))}
(2)l.c.m.(a,b)=w′∏p∈Ppsup⁡(m(p),n(p)) \text{(2)} \quad \text{l.c.m.}(a, b) = w' \prod_{p \in P} p^{\sup(m(p), n(p))}

where w,w′w, w' are in U. We recover, in particular, the results of Algebra, Chapter VIII, § 1, no. 3.

For all p∈Pp \in P, the mapping a↦n(p)a \mapsto n(p) is a discrete valuation vpv_p on K whose ring is obviously AApA_{A_p}. It follows from Theorem 1(e) that the vpv_p are just the essential valuations of A and that the ideals ApAp (p∈Pp \in P) are just the prime ideals of A of height 1.

4. Rings of fractions of a factorial domain

Proposition 3

Let A be a Krull domain and S a multiplicative subset of A not containing 0.

(i) If A is factorial, S−1AS^{-1}A is factorial. (ii) If S is generated by a family of elements pip_i such that the principal ideals ApiAp_i are prime and S−1AS^{-1}A is factorial, then A is factorial.

This follows immediately from Definition 1 of no. 1 and § 1, no. 10, Proposition 17.

5. Polynomial rings over a factorial domain

Let A be a factorial domain, K its field of fractions and ff a non-zero element of K[X]K[X]; an element c of K∗K^* will be called a content of ff if it is a g.c.d. of the coefficients off. Let ν\nu be a valuation on K which is essential for A and νˉ\bar{\nu} its canonical extension to K[X]K[X] (defined by νˉ(∑aiXi)=inf⁡ν(ai)\bar{\nu}\left(\sum a_i X^i\right) = \inf \nu(a_i); cf. Chapter VI, § 10, no. 1, Proposition 2); then νˉ(f)=ν(c)\bar{\nu}(f) = \nu(c).

Lemma 1 (Gauss)

Let f,f′f, f' be non-zero elements of K[X]K[X] and c, c′c' contents off, f′,f′f', f'. Then cc′cc' is a content of ff′ff'.

Let d be a content of ff′ff'. For every valuation ν\nu on K which is essential for A, let νˉ\bar{\nu} denote its canonical extension to K[X]K[X]. Then

ν(d)=νˉ(ff′)=νˉ(f)+νˉ(f′)=ν(c)+ν(c′)=ν(cc′). \nu(d) = \bar{\nu}(ff') = \bar{\nu}(f) + \bar{\nu}(f') = \nu(c) + \nu(c') = \nu(cc').
Hence cc′d−1cc'd^{-1} is an invertible element of A.

Theorem 2

Let A be a factorial domain, K its field of fractions, (pλ)(p_\lambda) a representative system of extremal elements of A and (Pλ)(P_\lambda) a representative system of irreducible polynomials of K[X]K[X], each PλP_\lambda having 1 as a content. Then:* (i) A[X] is a factorial domain; (ii) *the set of pλp_\lambda and PλP_\lambda is a representative system of extremal elements of A[X].

Let ff be a non-zero element of A[X]A[X]. In the ring K[X]K[X] ff can be decomposed uniquely in the form:

f=a∏λPλn(λ)(a∈K∗,n(λ)≥0). f = a \prod_\lambda P_\lambda^{n(\lambda)} \quad (a \in K^*, n(\lambda) \geq 0).

Lemma 1 proves that aa is a content off. Hence a∈Aa \in A. As AA is factorial, aa can be decomposed uniquely in the form:

a=u∏pim(i)(u invertible in A, m(i)⩾0). a = u \prod p_i^{m(i)} \quad (u \text{ invertible in } A,\ m(i) \geqslant 0).

Whence the existence and uniqueness of the decomposition:

f=u∏pim(i)⋂λpλn(λ). f = u \prod p_i^{m(i)} \bigcap_{\lambda} p_{\lambda}^{n(\lambda)}.

Note that this theorem proves that every element of AA admits the same decomposition into extremal elements in AA and A[X]A[X]. The g.c.d. of a family of elements of AA is therefore the same in AA and in A[X]A[X].

We may also use Proposition 18 of § 1, no. 10 to show that A[X]A[X] is a factorial domain if and only if AA is a factorial domain.

Corollary

If AA is a factorial domain, the domain A[X1,…,Xn]A[X_1, \ldots, X_n] is factorial.

Argue by induction on nn.

This corollary may be extended to the case of an infinite family of indeterminates (cf. Exercise 2).

6. Factorial domains and Zariski rings

Proposition 4

Let AA be a Zariski ring and A^\hat{A} its completion. If A^\hat{A} is a factorial domain, AA is a factorial domain.

This follows from no. 1, Definition 1 and § 1, no. 10, Proposition 16.

Corollary

If the completion of a Noetherian local ring AA is a factorial domain, AA is a factorial domain.

7. Preliminaries on automorphisms of rings of formal power series

Lemma 2

Let f(X1,X2,…,Xn)f(X_1, X_2, \ldots, X_n) be a formal power series ≠0\neq 0 with coefficients in a ring EE. There exist integers u(i)⩾1u(i) \geqslant 1 (1⩽i⩽n−11 \leqslant i \leqslant n - 1) such that

f(Tu(1),…,Tu(n−1),T)≠0. f(T^{u(1)}, \ldots, T^{u(n-1)}, T) \neq 0.

Suppose that integers u(i)⩾1u(i) \geqslant 1 (1⩽i⩽k−11 \leqslant i \leqslant k - 1) are determined such that f(Xnu(1),…,Xnu(k−1),Xk,…,Xn)≠0f(X_n^{u(1)}, \ldots, X_n^{u(k-1)}, X_k, \ldots, X_n) \neq 0. We shall determine an integer u(k)⩾1u(k) \geqslant 1 such that

f(Xnu(1),…,Xnu(k−1),Xnu(k),Xk+1,…,Xn)≠0. f(X_n^{u(1)}, \ldots, X_n^{u(k-1)}, X_n^{u(k)}, X_{k+1}, \ldots, X_n) \neq 0.

The lemma will then be proved by induction.

Observe that the series f(Xnu(1),…,Xnu(k−1),Xk,…,X)f(X_n^{u(1)}, \ldots, X_n^{u(k-1)}, X_k, \ldots, X) can be considered as a series in XkX_k and XnX_n with coefficients in E[[Xk+1,…,Xn−1]]E[[X_{k+1}, \ldots, X_{n-1}]]. Thus we see that it suffices to establish the lemma for n=2n = 2.

Therefore let

f=∑i,jeijXiYj∈E[[X,Y]] f = \sum_{i,j} e_{ij} X^i Y^j \in E[[X, Y]]
where f≠0f \neq 0. Let G⊂N×NG \subset \mathbf{N} \times \mathbf{N} be the non-empty set of ordered pairs (i,j)(i, j) such that eij≠0e_{ij} \neq 0. Let N×N\mathbf{N} \times \mathbf{N} be given the lexicographical ordering. Let (c,d)(c, d) be the least element of GG. Choose an integer p>dp > d. In the expansion of
f(Tp,T)=∑(i,j)∈GeijTip+j f(T^p, T) = \sum_{(i, j) \in G} e_{ij} T^{ip + j}
we look for the terms of degree cp+dcp + d. If ip+j=cp+d,i≥c+1ip + j = cp + d, i \geq c + 1 is impossible, for this would give
ip+j≥(c+1)p+j≥(c+1)p>cp+d; ip + j \geq (c + 1)p + j \geq (c + 1)p > cp + d;
nor is i<ci < c possible, for (c,d)(c, d) is the least element of GG; therefore i=ci = c and then j=dj = d. The term of degree cp+dcp + d in f(Tp,T)f(T^p, T) is therefore ecdTcp+de_{cd} T^{cp + d}. Since ecd≠0,f(Tp,T)≠0e_{cd} \neq 0, f(T^p, T) \neq 0. Whence the lemma.

In the ring E[[X1,…,Xn]]E[[X_1, \ldots, X_n]], let aa be the ideal of formal power series without constant term. If w1,…,wnw_1, \ldots, w_n are elements of aa, recall that the mapping f(X1,…,Xn)↦f(w1,…,wn)f(X_1, \ldots, X_n) \mapsto f(w_1, \ldots, w_n) is the unique endomorphism ss of the ring E[[X1,…,Xn]]E[[X_1, \ldots, X_n]] such that s(Xi)=wis(X_i) = w_i for 1≤i≤n1 \leq i \leq n (Chapter III, § 4, no. 5, Proposition 6).

We take w1=X1+Xnu(1),…,wn−1=Xn−1+Xnu(n−1),wn=Xnw_1 = X_1 + X_n^{u(1)}, \ldots, w_{n-1} = X_{n-1} + X_n^{u(n-1)}, w_n = X_n, where the u(i)u(i) are integers ≥1\geq 1. Let s′s' be the endomorphism of E[[X1,…,Xn]]E[[X_1, \ldots, X_n]] which maps X1X_1 to X1−Xnu(1),…,Xn−1X_1 - X_n^{u(1)}, \ldots, X_{n-1} to Xn−1−Xnu(n−1)X_{n-1} - X_n^{u(n-1)} and XnX_n to XnX_n. Then s′(s(Xi))=Xis'(s(X_i)) = X_i for 1≤i≤n1 \leq i \leq n and hence s′∘ss' \circ s is the identity automorphism; similarly for s∘s′s \circ s'. Hence ss is an automorphism.

Lemma 3

Let ff be a non-zero element of E[[X1,…,Xn]]E[[X_1, \ldots, X_n]]. There exist integers u(i)≥1(1≤i≤n−1)u(i) \geq 1 (1 \leq i \leq n-1) such that the automorphism ss of EE defined by*

s(Xi)=Xi+Xnu(i)(1≤i≤n−1) s(X_i) = X_i + X_n^{u(i)} \quad (1 \leq i \leq n-1)
*and s(Xn)=Xns(X_n) = X_n, maps ff to an element gg such that g(0,…,0,Xn)≠0g(0, \ldots, 0, X_n) \neq 0.

g(0,…,0,Xn)=f(Xnu(1),…,Xnu(n−1),Xn)g(0, \ldots, 0, X_n) = f(X_n^{u(1)}, \ldots, X_n^{u(n-1)}, X_n). Lemma 3 is therefore a consequence of Lemma 2.

8. The preparation theorem

In this no. A will denote a local ring, mm its maximal ideal and k=A/mk = A/m its residue field. Suppose that A is Hausdorff and complete with the mm-adic topology. Let B=A[[X]]B = A[[X]]; it is local ring whose maximal ideal n\mathfrak{n} is generated by mm and XX; with the A\mathfrak{A}-adic topology, B is Hausdorff and complete (Chapter III, § 2, no. 6, Proposition 6).

For every formal power series

f=∑i=0∞aiXi∈B, f = \sum_{i=0}^{\infty} a_i X^i \in B,
we write
f~=∑i=0∞aˉiXi∈k[[X]], \tilde{f} = \sum_{i=0}^{\infty} \bar{a}_i X^i \in k[[X]],
where aˉi\bar{a}_i denotes the canonical image of aia_i in kk. The series f~\tilde{f} will be called the reduced series off; if f~≠0\tilde{f} \neq 0, the order of f~\tilde{f} (that is the least integer ss such that as∉ma_s \notin m) will be called the reduced order off.

Proposition 5

Let f∈Bf \in B be a series whose reduced series is non-zero. Let ss denote its reduced order and MM the sub-A-module of BB with basis {1,X,…,Xs−1}\{1, X, \ldots, X^{s-1}\}. Then BB is the direct sum of MM and ff is not a divisor of zero in BB.

(a) We show that f∣B∩M=(0)f \mid B \cap M = (0). Suppose that there is a relation:

(∑i=0∞biXi)f=r0+r1X+⋯+rs−1Xs−1(bi∈A,rj∈A). \left( \sum_{i=0}^{\infty} b_i X^i \right) f = r_0 + r_1 X + \cdots + r_{s-1} X^{s-1} \qquad (b_i \in A, r_j \in A).
We show that the bib_i (and hence the rjr_j) are all zero, which will prove in particular that ff is not a divisor of zero in BB. Since AA is Hausdorff, it suffices to show that bi∈mnb_i \in m^n for all i≥0i \geq 0 and all n≥0n \geq 0. It is obvious for n=0n = 0. We shall argue by double induction: we shall assume that bi∈mn−1b_i \in m^{n-1} for all ii and bi∈mnb_i \in m^n for i<ki < k and show that this implies that bk∈mnb_k \in m^n. For this, we write f=∑i=1∞aiXif = \sum_{i=1}^{\infty} a_i X^i and compare the coefficients of Xs+kX^{s+k} in (3); then:
(b0as+k+⋯+bk−1as+1)+bkas+(bk+1as−1+⋯+bk+sa0)=0. (b_0 a_{s+k} + \cdots + b_{k-1} a_{s+1}) + b_k a_s + (b_{k+1} a_{s-1} + \cdots + b_{k+s} a_0) = 0.
The terms in the first bracket belong to mnm^n since the bi∈mnb_i \in m^n for i<ki < k; similarly for those in the second, since the bi∈mn−1b_i \in m^{n-1} for all ii and the ai∈ma_i \in m for i≤s−1i \leq s-1. Hence bkas∈mnb_k a_s \in m^n and, as asa_s is an invertible element of AA, bk∈mnb_k \in m^n.

(b) We show that f∣B+M=Bf \mid B + M = B. We write

g=as+as+1X+as+2X2+⋯ ; g = a_s + a_{s+1} X + a_{s+2} X^2 + \cdots;
it is an invertible element of BB. Then
f−Xsg=a0+a1X+⋯+as−1Xs−1; f - X^s g = a_0 + a_1 X + \cdots + a_{s-1} X^{s-1};
if therefore we write fg−1−Xs=(f−Xsg)g−1=−hfg^{-1} - X^s = (f - X^s g) g^{-1} = -h, the coefficients of hh belong to mm. Then let rr be an element of BB. By induction on nn we define a sequence (q(n))(q^{(n)}) of elements of B: we take q(0)q^{(0)} to be the unique series satisfying:
r≡Xsq(0)(modM); r \equiv X^s q^{(0)} \pmod{M};
writing h=∑i=0mhiXih = \sum_{i=0}^m h_i X^i and q(n)=∑i=0∞qi(n)Xiq^{(n)} = \sum_{i=0}^\infty q_i^{(n)} X^i, the qi(n)q_i^{(n)} are defined by:
qi(n)=∑j=0i+shjqi+s−j(n−1) q_i^{(n)} = \sum_{j=0}^{i+s} h_j q_{i+s-j}^{(n-1)}
It follows immediately from (6) that:
Xsq(n)≡hq(n−1)(modM). X^s q^{(n)} \equiv h q^{(n-1)} \pmod{M}.
As hj∈mh_j \in m for all jj, it also follows from (6), by induction on nn, that qi(n)∈mnq_i^{(n)} \in m^n for all ii and all nn. As A is complete, it follows that the series
q(0)+q(1)+…+q(n)+… q^{(0)} + q^{(1)} + \ldots + q^{(n)} + \ldots
converges to an element qq of B. By (5) and (7),
Xs(q(0)+q(1)+…+q(n))≡r+h(q(0)+…+q(n−1))(modM). X^s(q^{(0)} + q^{(1)} + \ldots + q^{(n)}) \equiv r + h(q^{(0)} + \ldots + q^{(n-1)}) \pmod{M}.
As M is closed, at the limit (8) gives r≡(Xs−h)q(modM)r \equiv (X^s - h)q \pmod{M}, that is
r∈fg−1q+M⊂fB+M. r \in fg^{-1}q + M \subset fB + M.
We may also use the results of Chapter III, § 2 to show the relation B=fB+MB = fB + M (cf. Exercise 12). The method followed here has the advantage of being applicable to convergent series.

Corollary

With the hypotheses and notation of Proposition 5, suppose that s≥1s \geq 1, so that f∈Bm+BXf \in Bm + BX. Then the A-homomorphism hh of B′=A[[T]]B' = A[[T]] to B=A[[X]]B = A[[X]] such that h(T)=fh(T) = f (Chapter III, § 2, no. 9, Proposition 11 (a)) defines on B a free B′B'-module structure admitting {1,X,…,Xs−1}\{1, X, \ldots, X^{s-1}\} as basis. In particular hh is injective.

Let the B′B'-module B be given the (T)-adic filtration, which consists of the fnBf^n B for n≥0n \geq 0 (Chapter 111, § 2, no. 1). Then B/fBB/fB is a free module over the ring A=B′/TB′A = B'/TB' and the images of the XiX^i (0≤i≤s−10 \leq i \leq s-1) in this A-module form a basis of it (Proposition 5); as moreover ff is not a divisor of zero in B (Proposition 5), Bfn/Bfn+1Bf^n/Bf^{n+1} is also a free (B′/TB′)(B'/TB')-module of rank s, so that condition (GR) of Chapter 111, § 2, no. 8 is satisfied (replacing A by B' and M by B). On the other hand, since B' is Hausdorff and complete with respect to the (T)-adic filtration and gr(B) is a finitely generated gr(B')-module by the above, it is seen first (Chapter III, § 2, no. 9, Corollary 1 to Proposition 12) that B is a finitely generated B' module. The first assertion of the corollary then follows from Chapter III, § 2, no. 9, Proposition 13. The second follows immediately from it.

Definition 2

A polynomial* F∈A[X]F \in \mathbf{A}[X] is called distinguished if it is of the form

F=Xs+as−1Xs−1+⋯+a0, F = X^s + a_{s-1} X^{s-1} + \cdots + a_0,
where ai∈ma_i \in \mathfrak{m} for 0≤i≤s−10 \leq i \leq s - 1.

Note that the product of two distinguished polynomials is a distinguished polynomial.

Proposition 6 (Preparation Theorem)

Let* f∈Bf \in B be a series whose reduced series is not zero and ss its reduced order. Then there exists a unique ordered pair (u,F)(u, F) such that uu is an invertible element of BB, FF a distinguished polynomial of degree ss and f=uFf = uF.

We write F=Xs+GF = X^s + G, where G=g0+⋯gs−1Xs−1G = g_0 + \cdots g_{s-1} X^{s-1} (gi∈Ag_i \in \mathbf{A}). The relation f=uFf = uF is equivalent to F=u−1fF = u^{-1}f, that is to Xs=u−1f−GX^s = u^{-1}f - G. Hence Proposition 5 shows the uniqueness of GG and u−1u^{-1} and therefore of FF and uu. It also shows that there exist v∈Bv \in B and a polynomial G=g0+⋯+gs−1Xs−1G = g_0 + \cdots + g_{s-1} X^{s-1} (gi∈Ag_i \in \mathbf{A}) such that Xs=v−GX^s = v - G; it remains to show that vv is invertible in BB and that gi∈mg_i \in \mathfrak{m} for all ii. Now, writing gˉi\bar{g}_i for the canonical image of gig_i in kk and fˉ,vˉ\bar{f}, \bar{v} for the reduced series of f,gf, g,

Xs+gˉ0+gˉ1X+⋯+gˉs−1Xs−1=fˉvˉ; X^s + \bar{g}_0 + \bar{g}_1 X + \cdots + \bar{g}_{s-1} X^{s-1} = \bar{f} \bar{v};
since fˉ\bar{f} is of order ss, gˉi=0\bar{g}_i = 0 for all ii and vˉ\bar{v} is of order 0, hence vv is invertible.

Proposition 7

Let* FF be a distinguished polynomial and g,hg, h two formal power series of BB such that F=ghF = gh. Then there exists an invertible element uu of BB such that ugug and u−1hu^{-1}h are distinguished polynomials and F=(ug)(u−1h)F = (ug)(u^{-1}h).

In fact, the reduced series of gg and hh are ≠0\neq 0; hence, by Proposition 6, there exist invertible elements u,vu, v of BB such that ugug and vhvh are distinguished polynomials. Then uvF=(ug)(vh)uvF = (ug)(vh) is a distinguished polynomial and uvuv is invertible. Passing to the reduced series, it is seen immediately that FF and uvFuvF have the same reduced order, that is the same degree. The uniqueness assertion in Proposition 6 therefore shows that F=uvFF = uvF, whence uv=1uv = 1.

Corollary

Suppose further that* A\mathbf{A} is an integral domain and FF a distinguished polynomial of degree ss. For FF to be extremal in A[X]\mathbf{A}[X], it is necessary and sufficient that it be extremal in B=A[[X]]B = \mathbf{A}[[X]].

Suppose that FF is not extremal in A[X]\mathbf{A}[X], so that F=f1f2F = f_1 f_2, where f1f_1 and f2f_2 are non-invertible elements of A[X]\mathbf{A}[X]; the product of the dominant coefficients of f1f_1 and f2f_2 being equal to 1, these coefficients are invertible in A\mathbf{A} and the hypothesis implies that f1f_1 and f2f_2 are of degrees >0> 0 and <s< s; as the reduced polynomials fˉ1,fˉ2\bar{f}_1, \bar{f}_2 satisfy fˉ1fˉ2=Xs\bar{f}_1 \bar{f}_2 = X^s, neither fˉ1\bar{f}_1 nor fˉ2\bar{f}_2 can be invertible in k[[X]]k[[X]], for, if fˉ1\bar{f}_1 were invertible, fˉ2\bar{f}_2 would be of order ss, which is absurd. A fortiori, neither f1f_1 nor f2f_2 is invertible in BB and FF is not extremal in BB.

Conversely, if F is not extremal in A[[X]]A[[X]], then F=ghF = gh, where neither g nor his invertible in B; their reduced orders are therefore ≥1\geq 1; then the distinguished polynomials ugug and u−1hu^{-1}h of Proposition 7 are not constant, which shows that F is not extremal in A[X]A[X].

9. Factoriality of rings of formal power series

Proposition 8

Let C be a ring which is either a field or a discrete valuation ring. Then the domain of formal power series C[[X1,…,Xn]]C[[X_1, \ldots, X_n]] is factorial.

Let pp be the maximal ideal of C and xx a generator of pp (if C is a field, then π=0\pi = 0). Let C be given the pp-adic topology, which is Hausdorff. As C is a Noetherian local ring, B=C[[X1,…,Xn]]B = C[[X_1, \ldots, X_n]] is a Noetherian local ring and its completion is C^[[X1,…,Xn]]\hat{C}[[X_1, \ldots, X_n]] (Chapter III, §2, no. 6, Proposition 6). By the Corollary to Proposition 4 (no. 6), it suffices to prove that C^[[X1,…,Xn]]\hat{C}[[X_1, \ldots, X_n]] is factorial. Now, if C is a field, then C^=C\hat{C} = C; if C is a discrete valuation ring, the same is true of C^\hat{C} (Chapter VI, §5, no. 3, Proposition 5). We shall therefore assume in the remainder of the proof that C is complete.

Arguing by induction starting with the trivial case n=0n = 0, we shall assume that it has been proved that A=C[[X1,…,Xn−1]]A = C[[X_1, \ldots, X_{n-1}]] is factorial. We shall identify B with A[[Xn]]A[[X_n]] and denote by m the maximal ideal of A (generated by π,X1,…,Xn−1\pi, X_1, \ldots, X_{n-1}). We shall prove that every non-zero element g of B is, in an essentially unique way, a product of extremal elements.

Let K be the field C/CπC/C\pi; as B/BπB/B\pi is identified with K[[X1,…,Xn]]K[[X_1, \ldots, X_n]], the ideal BxBx is prime and xx is extremal. If x≠0x \neq 0, BBπB_{B\pi} is therefore the ring of a normed discrete valuation w (Chapter VI, §3, no. 6, Proposition 9); every non-zero element g of B may therefore be written as g=πw(g)fg = \pi^{w(g)} f, where f∈Bf \in B and f is not a multiple of π\pi. It will therefore suffice to show that ff is an essentially unique product of extremal elements. Now the canonical image of ff in K[[X1,…,Xn]]K[[X_1, \ldots, X_n]] is not zero; Lemma 3 (no. 7) therefore shows that there exists an automorphism of B which maps ff to an element f′f' such that the coefficients of f′(0,…,0,Xn)f'(0, \ldots, 0, X_n) are not all in CxCx; this means that the coefficients of the series f′f', considered as a formal power series in XnX_n, are not all in m. It will suffice to prove our assertion for f′f'.

In what follows, all the elements of B will be considered as formal power series in XnX_n with coefficients in A. By Proposition 6 of no. 8 (applicable since C and therefore A are separable and complete and the reduced series off' is ≠0\neq 0), f′f' is associated, in B, with a unique distinguished polynomial F. By Proposition 7 of no. 8, every series which divides f′f' (or, what amounts to the same, which divides F) is associated with a distinguished polynomial which divides F and every decomposition off' is, to within invertible factors, of the form f′=uF1⋯Fqf' = u F_1 \cdots F_q, where uu is invertible and the FiF_i are extremal distinguished polynomials (in B) such that F=F1⋯FqF = F_1 \cdots F_q. By the Corollary to Proposition 7 of no. 8, the FiF_i are also extremal in A[Xn]\mathbf{A}[X_n]. Now, as A\mathbf{A} is factorial by the induction hypothesis, so is A[Xn]\mathbf{A}[X_n] (Theorem 2, no. 5); hence, since they are monic, the FiF_i are uniquely determined by FF (up to a permutation). This shows the uniqueness of the decomposition f′=uF1…Frf' = u F_1 \ldots F_r; its existence follows from the fact that BB is Noetherian, which completes the proof.

Remarks (1) There exist factorial rings A\mathbf{A} such that the ring A[[X]]\mathbf{A}[[X]] is not factorial (Exercise 8). However, if A\mathbf{A} is a principal ideal domain, A[[X1,…,Xn]]\mathbf{A}[[X_1, \ldots, X_n]] is factorial (Exercise 9). (2) \* We shall see later, by homological methods, that every regular local ring is factorial (cf. § 4, no. 7, Corollary 3 to Proposition 16). This will give another proof, conceptually simpler, of Proposition 8. \*

Exercises

See the exercises for § 3.

Transcribed from the printed volume. Not translated.