Appendix
Infinite products in normed algebras
1. Multipliable sequences in a normed algebra
Let be a normed algebra over a non-discrete valued field (Chapter IX, § 3, no. 7, Definition 9); we shall denote by the norm of an element , and we shall assume that this norm satisfies the inequality ; also we shall assume that has an identity element .
Let be an infinite sequence of points of . Every finite subset of , linearly ordered by the ordering of , defines a sequence of points of , and we define the product
of this sequence; this product is called the finite partial product of the sequence , corresponding to the finite subset of (recall that if we put ).
Definition 1
The sequence* is said to be multipliable in the normed algebra if the mapping has a limit with respect to the filter of sections of the set of finite subsets of , ordered by the relation ; this limit is called the product of the sequence , and is denoted by (or simply ); the *are called the factors of this product.
Definition 1 is equivalent to the following: the sequence is multipliable and its product is if for each there exists a finite subset of such that, for every finite subset of , we have .
Remark 1
When is a commutative algebra, Definition 1 is identical with that given in Chapter III, § 5, no. 1, Remark 3; but when is not commutative, the order structure of the index set is essentially involved in Definition 1. If is an arbitrary permutation of , we cannot in general assert that the sequence 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 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 . b) Conversely, if the sequence (x_n) satisfies this condition, it is multipliable. Moreover, if each x_n is a unit, then 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 and such that, for all for which we have
b) Suppose that, for each , 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 . Let 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 , where the integers in L are all greater than those in H_0; hence we have , and since L does not meet , , and consequently . If , the sequence is evidently multipliable and its product is 0; excluding this trivial case, there is an interval containing and such that, for every finite subset of which does not meet , we have . As above, it follows that, for each finite subset ,
Cauchy’s criterion therefore shows that has a limit in with respect to the directed set .
If all the are units, then so are all the finite partial products ; hence for each finite subset containing we have
and this shows that, in the multiplicative group of units of , the image under the mapping of the section filter of is a Cauchy filter base with respect to the left uniformity of ; but since is complete (Chapter IX, § 3, no. 7, Proposition 13), the limit of the mapping belongs to .
Remark
If is multipliable and its product is not a unit, the condition of Theorem 1 is not necessarily satisfied: for example, if all the are equal to the same element , where , the sequence is multipliable and its product is 0, and for each non-empty finite subset of , we have .
Corollary 1
If* is a multipliable sequence whose product is a unit of , then .
Corollary 2
If* is a multipliable sequence whose product is a unit of , then every subsequence of [ being a strictly increasing sequence of integers] is multipliable.
This follows immediately from the criterion of Theorem 1.
Theorem 2
Let* be a complete normed algebra. If is an absolutely convergent series of elements of , then the sequence is multipliable in ; and if all the elements are units in , then so is .
Let us apply the criterion of Theorem 1. For every finite subset of , we have , where runs through the set of all non-empty subsets of (linearly ordered by the induced ordering). Since , we may write
Now since the series whose general term is is convergent by hypothesis, the sequence is multipliable in (Chapter IV, § 7, no. 4, Theorem 4). Hence for each there exists a finite subset of such that, for every finite subset of which does not meet , we have ; hence the result.
Corollary
If the series whose general term is is absolutely convergent, and if none of the elements is a zero divisor in , then the product is not a zero divisor in .
There is only a finite number of integers such that . Let be an interval of containing all these integers. The product of the sequence is the product of and the element , all of whose factors are units (Chapter IX, § 3, no. 7, Corollary to Proposition 12), and is therefore itself a unit; since is the product of a finite number of non-zero divisors, it is not a zero divisor, and hence 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 is an algebra of finite rank over the field (i.e., is finite-dimensional as a vector space over ); in particular this is the case if is the division ring of quaternions , or a matrix algebra :
Proposition 1
Let be a normed algebra of finite rank over . If is a multipliable sequence in , whose product is a unit of , then the series whose general term is is absolutely convergent.
From Chapter VII, § 3, no. 1, Proposition 2, there exists a number such that, for every finite family of points of , we have
Let be an arbitrary sequence of elements of . For each finite subset of , put
Lemma 1
For each finite subset of , let . Then for each subset of we have
The lemma is obvious if is empty; we shall prove it by induction on the number of elements in . Let , where is strictly larger than every . Then and
so that
and by the inductive hypothesis and the definition of , we have
which proves the lemma.
Lemma 2
If is a finite subset of such that , then
For since for every subset of , we have from (2)
and since also , from (1), it follows that
which leads to the result.
Now let be a multipliable sequence in , whose product is a unit; by Theorem 1 there exists a finite subset of such that, for each finite subset of which does not meet , we have
By Lemma 2, it follows that for every finite subset of which does not meet , and hence (Chapter IV, § 7, no. 1, Theorem 1) the family is summable in .
3. Infinite products
To each sequence of points in a normed algebra , let us make correspond the sequence of partial products ; then the pair of sequences and is called the infinite product whose general factor is . The infinite product with general factor is said to be convergent if the sequence is convergent in ; the limit of this sequence is then called the product of the sequence and is denoted by .
Proposition 2
Let* be a sequence of points in a complete normed algebra .
a) If the infinite product whose general factor is is convergent and if is a unit in , then for each there exists an integer such that
b) Conversely, if the sequence satisfies this condition, the infinite product with general factor is convergent; and if each of the is a unit in , then 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 of in the proof of Theorem 1 are to be replaced by intervals).
Corollary 1
If the infinite product with general factor* is convergent, and if is a unit, then .
Corollary 2
If the infinite product with general factor* is convergent, and if is a unit, then the infinite product with general factor
The product of the sequence is denoted by , and is also called the residue of index of the infinite product with general factor .
Still under the assumption that is a unit, it follows from Proposition 2 that if is a sequence such that for all but a finite number of indices, then the product with general factor is convergent.
Proposition 3
Let* be a strictly increasing sequence of integers , such that ; if the infinite product with general factor converges, and if we put
then the infinite product whose general factor is is convergent and we have
For the sequence of partial products of the sequence is a subsequence of the sequence of partial products of the sequence .
Finally, the same argument as was used for abelian groups (Chapter III, § 5, no. 7) shows that if a sequence in a normed algebra is multiplicable, then the product whose general factor is is convergent, and
(which is also written as ); the converse is of course not true (cf. Exercise 7).
Exercises
See the exercises for Appendix 0.