Bourbaki

Appendix

Infinite products in normed algebras

1. Multipliable sequences in a normed algebra

Let AA be a normed algebra over a non-discrete valued field KK (Chapter IX, § 3, no. 7, Definition 9); we shall denote by ∣∣x∣∣||x|| the norm of an element x∈Ax \in A, and we shall assume that this norm satisfies the inequality ∣∣xy∣∣≤∣∣x∣∣⋅∣∣y∣∣||xy|| \leq ||x|| \cdot ||y||; also we shall assume that AA has an identity element ee.

Let (xn)n∈N(x_n)_{n \in \mathbf{N}} be an infinite sequence of points of AA. Every finite subset JJ of N\mathbf{N}, linearly ordered by the ordering of N\mathbf{N}, defines a sequence (xn)n∈J(x_n)_{n \in J} of points of AA, and we define the product

pJ=∏n∈Jxn p_J = \prod_{n \in J} x_n

of this sequence; this product is called the finite partial product of the sequence (xn)n∈N(x_n)_{n \in \mathbf{N}}, corresponding to the finite subset JJ of N\mathbf{N} (recall that if J=∅J = \varnothing we put ∏n∈∅xn=e\prod_{n \in \varnothing} x_n = e).

Definition 1

The sequence* (xn)n∈N(x_n)_{n \in \mathbf{N}} is said to be multipliable in the normed algebra AA if the mapping J→pJJ \to p_J has a limit with respect to the filter of sections of the set F(N)\mathfrak{F}(\mathbf{N}) of finite subsets of N\mathbf{N}, ordered by the relation ⊂\subset; this limit is called the product of the sequence (xn)n∈N(x_n)_{n \in \mathbf{N}}, and is denoted by ∏n∈Nxn\prod_{n \in \mathbf{N}} x_n (or simply ∏nxn\prod_n x_n); the xnx_n *are called the factors of this product.

Definition 1 is equivalent to the following: the sequence (xn)(x_n) is multipliable and its product is pp if for each ε>0\varepsilon > 0 there exists a finite subset J0J_0 of N\mathbf{N} such that, for every finite subset J⊃J0J \supset J_0 of N\mathbf{N}, we have ∣∣pJ−p∣∣≤ε||p_J - p|| \leq \varepsilon.

Remark 1

When AA is a commutative algebra, Definition 1 is identical with that given in Chapter III, § 5, no. 1, Remark 3; but when AA is not commutative, the order structure of the index set N\mathbf{N} is essentially involved in Definition 1. If σ\sigma is an arbitrary permutation of N\mathbf{N}, we cannot in general assert that the sequence (xσ(n))(x_{\sigma(n)}) is multipliable if the sequence (x_n) is multipliable; and if both sequences are multipliable, their products will in general be different.

Remark 2

Definition 1 can be immediately generalized to the case of a family (x_n)_{n \in I} whose index set I is a subset of \mathbf{Z} (linearly ordered by the order induced by that of \mathbf{Z}). We leave it to the reader to extend to this case the results below (cf. Exercises 1 and 2).

2. Multipliability criteria

From now on we shall assume that the normed algebra A is complete.

Theorem 1

Let (x_n)_{n \in \mathbf{N}} be a sequence of points in a complete normed algebra A. a) If (x_n) is multipliable and if its product is a unit of A, then for each ε>0\varepsilon > 0 there exists a finite subset J_0 of \mathbf{N} such that, for every finite subset L of \mathbf{N} which does not meet J_0, we have ∥e−pL∥≤ε\|e - p_L\| \leq \varepsilon. b) Conversely, if the sequence (x_n) satisfies this condition, it is multipliable. Moreover, if each x_n is a unit, then ∏n∈Nxn\prod_{n \in \mathbf{N}} x_n is a unit.

a) Let p be the product of the multipliable sequence (x_n), and suppose that p is a unit in A; then (Chapter IX, § 3, no. 7, Proposition 13) there exist α>0\alpha > 0 and a>0a > 0 such that, for all y∈Ay \in A for which we have

∥y−p∥≤α, \|y - p\| \leq \alpha,
y is a unit and ∥y−1∥≤a\|y^{-1}\| \leq a. By hypothesis, for every ε\varepsilon such that 0<ε<α0 < \varepsilon < \alpha, there is a finite subset H_0 of \mathbf{N} such that, for every finite subset H of \mathbf{N} containing H_0, we have ∥pH−p∥≤ε\|p_H - p\| \leq \varepsilon. Let J0=[0,m]J_0 = [0, m] be an interval of \mathbf{N} which contains H_0; for each finite subset L of \mathbf{N} which does not meet J_0, the integers belonging to L are all greater than those belonging to H_0; hence, if H=H0∪LH = H_0 \cup L, we have pH=pH0pLp_H = p_{H_0} p_L. Now, since ∥pH0−p∥≤ε≤α\|p_{H_0} - p\| \leq \varepsilon \leq \alpha, pH0p_{H_0} is a unit, and
∥e−pH0−1p∥≤ε∥pH0−1p∥≤aε; \|e - p_{H_0}^{-1} p\| \leq \varepsilon \|p_{H_0}^{-1} p\| \leq a \varepsilon;
since ∥pH0pL−p∥≤ε\|p_{H_0} p_L - p\| \leq \varepsilon, we deduce
∥pL−pH0−1p∥≤ε∥pH0−1∥≤aε, \|p_L - p_{H_0}^{-1} p\| \leq \varepsilon \|p_{H_0}^{-1}\| \leq a \varepsilon,
and finally ∥e−pL∥≤2aε\|e - p_L\| \leq 2a \varepsilon.

b) Suppose that, for each ε>0\varepsilon > 0, there exists a finite subset J_0 of \mathbf{N} such that, for every finite subset L of \mathbf{N} which does not meet J_0, we have ∥e−pL∥≤ε\|e - p_L\| \leq \varepsilon. Let H0=[0,p]H_0 = [0, p] be an interval of \mathbf{N} which contains J_0; then every finite subset H of \mathbf{N} which contains H_0 can be written in the form H0∪LH_0 \cup L, where the integers in L are all greater than those in H_0; hence we have pH=pH0pLp_H = p_{H_0} p_L, and since L does not meet J0J_0, ∥pH−pH0∥≤ε∥pH0∥\|p_H - p_{H_0}\| \leq \varepsilon \|p_{H_0}\|, and consequently ∥pH∥=(1+ε)∥pH0∥\|p_H\| = (1 + \varepsilon)\|p_{H_0}\|. If pH0=0p_{H_0} = 0, the sequence (xn)(x_n) is evidently multipliable and its product is 0; excluding this trivial case, there is an interval H1=[0,q]H_1 = [0, q] containing H0H_0 and such that, for every finite subset LL of N\mathbf{N} which does not meet H1H_1, we have ∥e−pL∥≤ε(∥pH0∥)−1\|e - p_L\| \leq \varepsilon (\|p_{H_0}\|)^{-1}. As above, it follows that, for each finite subset H⊃H1H \supset H_1,

∥pH−pH1∥≤(∥pH0∥)−1∥pH1∥ε≤ε(1+ε). \|p_H - p_{H_1}\| \leq (\|p_{H_0}\|)^{-1}\|p_{H_1}\|\varepsilon \leq \varepsilon (1 + \varepsilon).

Cauchy’s criterion therefore shows that J→pJJ \to p_J has a limit in AA with respect to the directed set F(N)\mathfrak{F}(\mathbf{N}).

If all the xnx_n are units, then so are all the finite partial products pJp_J; hence for each finite subset HH containing H0H_0 we have

∥e−pH0−1pH∥≤ε, \|e - p_{H_0}^{-1}p_H\| \leq \varepsilon,

and this shows that, in the multiplicative group GG of units of AA, the image under the mapping J→pJJ \to p_J of the section filter of F(N)\mathfrak{F}(\mathbf{N}) is a Cauchy filter base with respect to the left uniformity of GG; but since GG is complete (Chapter IX, § 3, no. 7, Proposition 13), the limit of the mapping J→pJJ \to p_J belongs to GG.

Remark

If (xn)(x_n) is multipliable and its product is not a unit, the condition of Theorem 1 is not necessarily satisfied: for example, if all the xnx_n are equal to the same element xx, where ∥x∥<1\|x\| < 1, the sequence (xn)(x_n) is multipliable and its product is 0, and for each non-empty finite subset HH of N\mathbf{N}, we have ∥pH∥≤∥x∥<1≤∥e∥\|p_H\| \leq \|x\| < 1 \leq \|e\|.

Corollary 1

If* (xn)(x_n) is a multipliable sequence whose product is a unit of AA, then lim⁡n→∞xn=e\lim_{n \to \infty} x_n = e.

Corollary 2

If* (xn)(x_n) is a multipliable sequence whose product is a unit of AA, then every subsequence (xnk)k∈N(x_{n_k})_{k \in \mathbf{N}} of (xn)(x_n) [(nk)(n_k) being a strictly increasing sequence of integers] is multipliable.

This follows immediately from the criterion of Theorem 1.

Theorem 2

Let* AA be a complete normed algebra. If (un)(u_n) is an absolutely convergent series of elements of AA, then the sequence (e+un)(e + u_n) is multipliable in AA; and if all the elements e+une + u_n are units in AA, then so is ∏n∈N(e+un)\prod_{n \in \mathbf{N}} (e + u_n).

Let us apply the criterion of Theorem 1. For every finite subset LL of N\mathbf{N}, we have pL−e=∏n∈L(e+un)−e=∑M(∏n∈Mun)p_L - e = \prod_{n \in L} (e + u_n) - e = \sum_M \left( \prod_{n \in M} u_n \right), where MM runs through the set of all non-empty subsets of LL (linearly ordered by the induced ordering). Since ∏n∈Mun≤∏n∈M∣un∣\prod_{n \in M} u_n \leq \prod_{n \in M} |u_n|, we may write

∣∣p1−e∣∣=∑M(∏n∈Mun)⋅∏i∈I(1+∣ui∣)−1. ||p_1 - e|| = \sum_M (\prod_{n \in M} u_n) \cdot \prod_{i \in I} (1 + |u_i|) - 1.

Now since the series whose general term is ∣un∣|u_n| is convergent by hypothesis, the sequence 1−∣un∣1 - |u_n| is multipliable in R+∗\mathbf{R}_+^* (Chapter IV, § 7, no. 4, Theorem 4). Hence for each ε>0\varepsilon > 0 there exists a finite subset J0J_0 of N\mathbf{N} such that, for every finite subset LL of N\mathbf{N} which does not meet J0J_0, we have ∣∏n∈L(1+∣∣un∣∣)−1∣≤ε\left| \prod_{n \in L} (1 + ||u_n||) - 1 \right| \leq \varepsilon; hence the result.

Corollary

If the series whose general term is unu_n is absolutely convergent, and if none of the elements e−une - u_n is a zero divisor in AA, then the product ∏n∈N(e+un)\prod_{n \in \mathbf{N}} (e + u_n) is not a zero divisor in AA.

There is only a finite number of integers nn such that ∣un∣>1|u_n| > 1. Let J=[a,m]J = [a, m] be an interval of N\mathbf{N} containing all these integers. The product of the sequence (e+un)(e + u_n) is the product of pJp_J and the element ∏n∉J(e−un)\prod_{n \notin J} (e - u_n), all of whose factors are units (Chapter IX, § 3, no. 7, Corollary to Proposition 12), and is therefore itself a unit; since pJp_J is the product of a finite number of non-zero divisors, it is not a zero divisor, and hence ∏n∈N(e+un)\prod_{n \in \mathbf{N}} (e + u_n) is not a zero divisor.

The sufficient condition for multipliability given by Theorem 2 is not in general necessary (cf. Exercise 6). However, it is necessary in the important case where AA is an algebra of finite rank over the field R\mathbf{R} (i.e., AA is finite-dimensional as a vector space over R\mathbf{R}); in particular this is the case if AA is the division ring of quaternions H\mathbf{H}, or a matrix algebra Mn(R)\mathbf{M}_n(\mathbf{R}):

Proposition 1

Let AA be a normed algebra of finite rank over R\mathbf{R}. If (e+un)(e + u_n) is a multipliable sequence in AA, whose product is a unit of AA, then the series whose general term is unu_n is absolutely convergent.

From Chapter VII, § 3, no. 1, Proposition 2, there exists a number c>0c > 0 such that, for every finite family (xi)i∈I(x_i)_{i \in I} of points of AA, we have

∑i∈I∥xi∥≤csup⁡J⊂I∣∑i∈Jxi∣. \sum_{i \in I} \|x_i\| \leq c \sup_{J \subset I} \left| \sum_{i \in J} x_i \right|.

Let (ai)i∈N(a_i)_{i \in \mathbf{N}} be an arbitrary sequence of elements of AA. For each finite subset II of N\mathbf{N}, put

pI=∏i∈I(e+ai),sI=∑i∈Iai,σI=∑i∈I∥ai∥. p_I = \prod_{i \in I} (e + a_i), \quad s_I = \sum_{i \in I} a_i, \quad \sigma_I = \sum_{i \in I} \|a_i\|.

Lemma 1

For each finite subset II of N\mathbf{N}, let φ(I)=sup⁡J⊂I∣∣pJ−e∣∣\varphi(I) = \sup_{J \subset I} ||p_J - e||. Then for each subset JJ of II we have

∣∣pJ−e−sJ∣∣≤φ(I)σJ. ||p_J - e - s_J|| \leq \varphi(I)\sigma_J.

The lemma is obvious if JJ is empty; we shall prove it by induction on the number of elements in JJ. Let J=K∪{j}J = K \cup \{j\}, where {j}\{j\} is strictly larger than every i∈Ki \in K. Then pJ=pK(e+aj)p_J = p_K(e + a_j) and

sJ=sK+aj, s_J = s_K + a_j,

so that

pJ−e−sJ=pK−e−sK+(pK−e)aj, p_J - e - s_J = p_K - e - s_K + (p_K - e)a_j,

and by the inductive hypothesis and the definition of φ(I)\varphi(I), we have

∣∣pJ−e−sJ∣∣≤φ(I)σK+φ(I)∣∣aj∣∣=φ(I)σJ, ||p_J - e - s_J|| \leq \varphi(I)\sigma_K + \varphi(I)||a_j|| = \varphi(I)\sigma_J,

which proves the lemma.

Lemma 2

If II is a finite subset of N\mathbf{N} such that φ(I)<1/c\varphi(I) < 1/c, then

σI≤cφ(I)/(1−cφ(I)). \sigma_I \leq c\varphi(I)/(1 - c\varphi(I)).

For since σJ≤σI\sigma_J \leq \sigma_I for every subset JJ of II, we have from (2)

∣∣sJ∣∣≤φ(I)σI+∣∣pJ−e∣∣≤(1+σI)φ(I); ||s_J|| \leq \varphi(I)\sigma_I + ||p_J - e|| \leq (1 + \sigma_I)\varphi(I);

and since also σI≤c⋅sup⁡J⊂I∣∣sJ∣∣\sigma_I \leq c \cdot \sup_{J \subset I} ||s_J||, from (1), it follows that

σI≤cφ(I)(1+σI), \sigma_I \leq c\varphi(I)(1 + \sigma_I),

which leads to the result.

Now let (e+un)(e + u_n) be a multipliable sequence in AA, whose product is a unit; by Theorem 1 there exists a finite subset J0J_0 of N\mathbf{N} such that, for each finite subset HH of N\mathbf{N} which does not meet J0J_0, we have

∣∏i∈H(e+ui)−e∣≤1/2c. \left| \prod_{i \in H} (e + u_i) - e \right| \leq 1/2c.

By Lemma 2, it follows that ∑i∈H∣∣ui∣∣−1\sum_{i \in H} ||u_i|| - 1 for every finite subset HH of N\mathbf{N} which does not meet J0J_0, and hence (Chapter IV, § 7, no. 1, Theorem 1) the family (∣∣un∣∣)(||u_n||) is summable in R\mathbf{R}.

3. Infinite products

To each sequence (xn)(x_n) of points in a normed algebra AA, let us make correspond the sequence of partial products pn=∏k=0nxkp_n = \prod_{k=0}^n x_k; then the pair of sequences (xn)(x_n) and (pn)(p_n) is called the infinite product whose general factor is xnx_n. The infinite product with general factor xnx_n is said to be convergent if the sequence (pn)(p_n) is convergent in AA; the limit of this sequence is then called the product of the sequence (xn)(x_n) and is denoted by ∏n=0∞xn\prod_{n=0}^\infty x_n.

Proposition 2

Let* (xn)(x_n) be a sequence of points in a complete normed algebra AA.

a) If the infinite product whose general factor is xnx_n is convergent and if ∏n=0∞xn\prod_{n=0}^\infty x_n is a unit in AA, then for each ε>0\varepsilon > 0 there exists an integer n0n_0 such that

∥∏k=mnxk−e∥≤ε \left\| \prod_{k=m}^n x_k - e \right\| \leq \varepsilon
whenever n0≤m≤nn_0 \leq m \leq n.

b) Conversely, if the sequence (xn)(x_n) satisfies this condition, the infinite product with general factor xnx_n is convergent; and if each of the xnx_n is a unit in AA, then ∏n=0∞xn\prod_{n=0}^\infty x_n is a unit.

The proof of this proposition follows step by step the proof of Theorem 1, and is left to the reader (the finite subsets LL of NN in the proof of Theorem 1 are to be replaced by intervals).

Corollary 1

If the infinite product with general factor* xnx_n is convergent, and if ∏n=0∞xn\prod_{n=0}^\infty x_n is a unit, then lim⁡n→∞xn=e\lim_{n \to \infty} x_n = e.

Corollary 2

If the infinite product with general factor* xnx_n is convergent, and if ∏n=0∞xn\prod_{n=0}^\infty x_n is a unit, then the infinite product with general factor

yn=xn+h(n≥0) y_n = x_{n+h} \quad (n \geq 0)
is convergent.

The product of the sequence (yn)(y_n) is denoted by ∏n=h∞xn\prod_{n=h}^\infty x_n, and is also called the residue of index hh of the infinite product with general factor xnx_n.

Still under the assumption that ∏n=h∞xn\prod_{n=h}^\infty x_n is a unit, it follows from Proposition 2 that if (zn)(z_n) is a sequence such that zn=xnz_n = x_n for all but a finite number of indices, then the product with general factor znz_n is convergent.

Proposition 3

Let* (kn)(k_n) be a strictly increasing sequence of integers ≥0\geq 0, such that k0=0k_0 = 0; if the infinite product with general factor xnx_n converges, and if we put

un=∏p=knkn+1−1xp, u_n = \prod_{p=k_n}^{k_{n+1}-1} x_p,

then the infinite product whose general factor is unu_n is convergent and we have

∏n=0∞un=∏n=0∞xn. \prod_{n=0}^{\infty} u_n = \prod_{n=0}^{\infty} x_n.

For the sequence of partial products of the sequence (un)(u_n) is a subsequence of the sequence of partial products of the sequence (xn)(x_n).

Finally, the same argument as was used for abelian groups (Chapter III, § 5, no. 7) shows that if a sequence (xn)(x_n) in a normed algebra A\mathbf{A} is multiplicable, then the product whose general factor is xnx_n is convergent, and

∏n=0∞xn=∏n∈Nxn \prod_{n=0}^{\infty} x_n = \prod_{n \in \mathbf{N}} x_n

(which is also written as ∏n=0∞xn\prod_{n=0}^{\infty} x_n); the converse is of course not true (cf. Exercise 7).

Exercises

See the exercises for Appendix 0.

Transcribed from the printed volume. Not translated.