Appendix 2
Infinite products in normed algebras
1. Multipliable sequences in a normed algebra
Let be a normed algebra over a commutative non-discrete valued field (IX, p. 37, def. 9); we shall denote by the norm of an element , and we shall suppose moreover that admits a unit element .
Let be an infinite sequence of points of ; every finite subset of , totally ordered by the order of , defines a sequence (A, I, p. 3) of points of ; in Algebra (A, I, p. 3) the product of this sequence has been defined, which we shall call the finite partial product of the sequence , corresponding to the finite subset of (recall that, for , one puts ).
Definition 1
One says that the sequence is multipliable in the normed algebra if the mapping has a limit following 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 (or simply ); the are called the factors of this product.
Def. 1 is equivalent to the following one: the sequence is multipliable and has product if, for every , there exists a finite subset of such that, for every finite subset of , one has .
Remark 1
When is a commutative algebra, def. 1 is identical with that which was given in III, p. 37 (Remark 3); but when is not commutative, the order structure of the set of indices intervenes in an essential way in def. 1; if is any permutation of , nothing permits one to assert in general that the sequence is multipliable when the sequence is; moreover, when these two sequences are multipliable, their products are in general different.
Remark 2
Def. 1 generalizes immediately to the case of a family whose set of indices is a subset of (totally ordered by the order induced by that of ); we leave to the reader the task of extending to this case the following properties (cf. IX, p. 125, exerc. 1 and 2).
2. Criteria of multipliability
We shall henceforth restrict ourselves to the case where the normed algebra is complete.
Theorem 1
Let be a sequence of points of a complete normed algebra .
a) If is multipliable and has for product an invertible element of , for every , there exists a finite subset of such that, for every finite subset of not meeting , one has .
b) Conversely, if the sequence satisfies this condition, it is multipliable. Moreover, if each of the is invertible, is invertible.
a) Let be the product of the multipliable sequence , and suppose that is invertible in ; then (IX, p. 40, prop. 14), there exist and such that, for every such that , is invertible, and . By assumption, for every such that , there exists a finite subset of such that, for every finite subset of containing , one has . Let be an interval of containing ; for every finite subset of not meeting the integers belonging to are all greater than those belonging to ; therefore, if one sets , one has . Now, since , is invertible, and one has ; from the relation , one deduces and finally .
b) Suppose that, for every , there exists a finite subset of such that, for every finite subset of not meeting , one has . Let be an interval of containing ; every finite subset of containing can be written , where the integers belonging to are greater than those belonging to ; we therefore have , and since does not meet , , and consequently . If , the sequence is obviously multipliable and has product 0; excluding this trivial case, there exists an interval , containing and such that, for every finite subset of not meeting , one has . We deduce as above that, for every finite subset
The Cauchy criterion therefore shows that has a limit in following the filtered set .
If all the are invertible, the same is true of all the finite partial products ; for every finite subset containing , one can therefore write
this shows that, in the multiplicative group of the invertible elements of , the image by the mapping of the filter of sections of is a Cauchy filter basis for the left uniform structure of the group ; but since is complete (, p. 40, prop. 14), the limit of the mapping belongs to .
Remark
When is multipliable and has a noninvertible product, the condition of th. 1 is no longer necessarily verified; for example, if all the are equal to the same element such that , the sequence is multipliable and has product 0, and for every nonempty finite subset of , one has .
Corollary 1
If* is a multipliable sequence whose product is invertible in , .
Corollary 2
If* is a multipliable sequence whose product is invertible in , any sequence extracted from (() being a strictly increasing sequence of integers) is multipliable.
This is what the criterion of th. 1 (, p. 79) immediately shows.
Theorem 2
Let* be a complete normed algebra; if is an absolutely convergent series of points of , the sequence is multipliable in ; moreover, if all the elements are invertible in , the same is true of .
Apply the criterion of , p. 79, th. 1; for every finite subset of , we have , ranging over the set of the non-empty subsets of (totally ordered by the induced order). Since , one can write
Now, since the series of general term is convergent by assumption, the sequence is multipliable in (, p. 35, th. 4); for every , there therefore exists a finite subset of such that, for every finite subset of not meeting , we have ; whence the theorem.
Corollary
If the series of general term* is absolutely convergent, and if none of the elements is a divisor of 0 in , the product is not a divisor of 0 in .
Indeed, there are 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 of the element , all of whose factors are invertible (IX, p. 39, corollary), and which is consequently itself invertible; since is the product of a finite number of elements which are not divisors of 0, it is not a divisor of 0, and the same is true of .
The sufficient condition for multipliability given in th. 2 is not necessary in general (cf. IX, p. 126, exerc. 6). It is, however, necessary in the important case where is an algebra of finite rank over the field (in particular when is the field 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 invertible, the series of general term is absolutely convergent.
It is known (VII, p. 16, prop. 2) that there exists a number such that, for every finite family of points of , one has
(1)
Let be any sequence of elements of . For every finite subset of , put
Lemma 1
For every finite subset of , let For every subset of , one has*
Lemma 2
If is a finite subset of such that , one has *.
Indeed, since for every subset of , one has, after (2),
since, by virtue of (1), one has , it follows that , whence the lemma.
That being so, let be a multipliable sequence in , whose product is invertible; according to th. 1 (IX, p. 79), there exists a finite subset of such that, for every finite subset of not meeting , one has
3. Infinite products
To every sequence of points of a normed algebra , let us make correspond the sequence of the partial products ; one calls infinite product of general factor , the couple of the sequences and . The infinite product of 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 .
Proposition 2
Let be a sequence of points of a complete normed algebra .
a) If the infinite product of general factor is convergent and if is invertible, for every , there exists such that, for , one has .
b) Conversely, if the sequence satisfies this condition, the infinite product of general factor is convergent; moreover, if each of the is invertible, is invertible.
We leave to the reader the development of the proof of this proposition, which is copied step by step from that of th. 1 of IX, p. 79 (the finite parts of which occur in the latter having simply to be replaced by intervals).
Corollary 1
If the infinite product of general factor* is convergent, and if is invertible, .
Corollary 2
If the infinite product of general factor* is convergent, and if is invertible, the infinite product of general factor *is convergent.
The product of the sequence is denoted by , and is also called the remainder of index h of the infinite product of general factor .
Assuming still that is invertible, we deduce also from prop. 2 (IX, p. 82) that, if is a sequence such that except for a finite number of indices, the product of general factor is convergent.
Proposition 3
Let* be a strictly increasing sequence of integers () : if the infinite product of general factor converges, and if one sets , the infinite product of general factor is convergent, and one has .
Indeed, the sequence of partial products of the sequence is extracted from the sequence of partial products of the sequence .
Finally, by the same reasoning as for commutative groups (III, p. 44), one sees that if, in a normed algebra , a sequence is multipliable, the product of general factor is convergent, and one has (which is also written ); the converse is of course false (cf. IX, p. 126, exerc. 7).
Exercises
Exercises
See the exercises for Appendix 2.