TOPOLOGICAL ALGEBRAS
NORTH-HOLLAND MATHEMATICS STUDIES 185 (Continuation of the Notas de Matematica)
Editor: Saul LUBKIN University of Rochester New York, U.S.A.
2000 ELSEVIER Amsterdam
- Lausanne
- New
York
- Oxford
- Shannon
- Singapore
- Tokyo
TOPOLOGICAL ALGEBRAS
V.K. BALACHANDRAN
Ramanujan Institute for Advanced Study in Mathematics Chennai, India
2000 ELSEVIER Amsterdam
- Lausanne
- New
York-
Oxford
- Shannon
- Singapore
- Tokyo
9 Narosa Publishing House, India - 1999 Licenced edition of Elsevier Science - 2000 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, w i t h o u t the prior permission of the copyright owner.
Elsevier Science ISBN for this volume: 0 444 50609 8 Elsevier Science Series ISSN: 0304-0208 Published by: Elsevier Science Sole distributors for Europe, North America and Japan" Elsevier Science
The paper used in this publication meets the requirements of ANSI/NISO Z39.48-1992 (Permanence of Paper). Printed in The Netherlands.
To my grand-children S h o b h a n a and V i v e k
for delaying the completion of the writing of the book
This Page Intentionally Left Blank
CONTENTS
Preface
ix
..............................................
Chapter 1: Algebraic Preliminaries w 1. w 2. w 3. w 4. w 5. w 6. w 7. w 8. w 9.
Some Basic C o n c e p t s and R e s u l t s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ideals and R a d i c a l . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . C h a r a c t e r s and H y p e r m a x i m a l Ideals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . E x t e n s i o n s of Ideals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . R e g u l a r R e p r e s e n t a t i o n and P r i m i t i v e Ideal . . . . . . . . . . . . . . . . . . . . . . . Real and C o m p l e x A l g e b r a s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . S p e c t r u m and Q u a s i - s p e c t r u m . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . E x t e n d e d S p e c t r u m and E x t e n d e d Q u a s i - s p e c t r u m . . . . . . . . . . . . . . . . Strictly R e a l A l g e b r a s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1 12 22 30 36 43 52 61 67
Chapter 2: Topological Preliminaries w 1. T o p o l o g i c a l G r o u p s and L i n e a r Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 2. T o p o l o g i c a l A l g e b r a s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 3. C o m p l e t i o n s of Topological L i n e a r Spaces and Topological A l g e b r a s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
73 84 91
Chapter 3" Some Types of Topological Algebras w 1. Q u a r t e r - n o r m s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 2. p - S e m i n o r m s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w Q u a r t e r n o r m e d Algebras; ( F ) A l g e b r a s . . . . . . . . . . . . . . . . . . . . . . . . . w 4. p - S e m i n o r m e d Algebras; p - B a n a c h Algebras . . . . . . . . . . . . . . . . . . . . w 5. B o u n d e d L i n e a r T r a n s f o r m a t i o n s on p - S e m i n o r m e d L i n e a r Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 6. T o p o l o g i c a l A l g e b r a s with Inverses . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 7. T o p o l o g i c a l Zero Divisors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
100 110 116 131 140 148 158
Chapter 4" Locally Pseudo-Convex Spaces and Algebras w 1. w 2. w 3. w 4. w 5. w 6. w 7. w 8.
p-Convexity .................................................... Locally B o u n d e d A l g e b r a s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . L o c a l l y P s e u d o - C o n v e x Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Locally Pseudo-Convex Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . P r o j e c t i v e Limit D e c o m p o s i t i o n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Metrizable Locally Pseudo-Convex Algebras . . . . . . . . . . . . . . . . . . . . . Ample Algebras ................................................. Topological Spectral Radius . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
174 185 189 195 201 207 213 216
viii
Chapter w 1. w 2. w 3. w 4. w 5.
6" S p e c t r a l
Analysis
in Topological
7" G e l f a n d
Representation
262 264 275 282 284 290
Theory
Ideals of Topological Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296 Gelfand Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 The Gelfand R e p r e s e n t a t i o n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311 GB Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324 Holomorphic Functional Calculus for a Single Algebra Element . . . 3 3 5 A u t o m o r p h i s m s and Derivations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 344
Chapter
8: C o m m u t a t i v e
Topological
Algebras
w 1. w 2. w 3. w 4. w 5.
Function Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shilov B o u n d a r y . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hull-Kernel Topology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Completely R e g u l a r Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Holomorphic Functional Calculus for Several C o m m u t a t i v e Algebra Elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . w 6. Shilov I d e m p o t e n t T h e o r e m . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chapter w 1. w 2. w 3. w 4.
222 227 234 239 253
Algebras
Spectral P r o p e r t i e s . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The Resolvent Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The Pseudo-Resolvent Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Spectral Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . G e l f a n d - M a z u r and O t h e r Similar Theorems . . . . . . . . . . . . . . . . . . . . . Turpin's T h e o r e m on Locally Convex Algebras . . . . . . . . . . . . . . . . . . .
Chapter w 1. w 2. w 3. w 4. w 5. w 6.
Analysis
Vector-valued Differentiability and Analyticity . . . . . . . . . . . . . . . . . . . E x p o n e n t i a l and Logarithmic Vector Functions . . . . . . . . . . . . . . . . . . . Square Roots and Quasi-square Roots . . . . . . . . . . . . . . . . . . . . . . . . . . . C o m p l e x Vector-valued Line Integrals and Cauchy's T h e o r e m s . . . Power Series O p e r a t i o n s in Topological Algebras . . . . . . . . . . . . . . . . .
Chapter w w w w w w
5: S o m e
9: N o r m U n i q u e n e s s
353 361 370 377 388 403
Theorems
N o r m - u n i q u e n e s s T h e o r e m of Gelfand . . . . . . . . . . . . . . . . . . . . . . . . . . . Rickart Seperating Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Topological Modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . N o r m - U n i q u e n e s s T h e o r e m s for N o n - c o m m u t a t i v e Algebras . . . . . .
411 412 416 419
Appendix
427 429 431 435 443 445
........................................................
Type C h a r t Bibliography
...................................................... .....................................................
Index ............................................................ L i s t of S p e c i a l S y m b o l s
...........................................
List of Special Abbreviation8
......................................
PREFACE There are very few books devoted to general topological algebras. This book is the outcome of an attempt to present a fairly self-contained and systematic exposition of a number of basic topics concerning such algebras. For the sake of completeness and to increase the usefulness of the book as a reference source (for the material treated) I have not hesitated in stating explicitly (and proving) herein several corollaries and deductions emerging from the main results. I hope to be able to follow this volume with another treating algebras with involution and other topics. In this book I have considered both complex and real algebras, with and without unity. There is found in the literature on Banach algebras two types of real algebras: the strictly real algebras and the formally real algebras. Both these types of algebras are treated here in more general settings and it turns out that for such strictly real algebras most of the results available for corresponding complex algebras can be extended while such formally real algebras share a few properties with the corresponding complex algebras. In the treatment of the spectrum I have made some conventional changes. The usage of the term "spectrum of an element" is limited to unital algebras. To take care of the non-unital case the following procedure is adopted. If A is any algebra (non-unital or not) it has its formal unitization A1 a unital algebra. The spectrum with respect to A1 is denoted by hA1 , and set for x in A , a '(x) - a f t ( x ) aAl(X ) ( t h e spectrum of x in A1), and call a '(x) the quasi-spectrum of x. If A is itself unital the spectrum a(x) -= OA(X) make sense and we have the simple relation a '(x) = a(x)I,.J {0}. It is to be noted that always 0 e a '(x) so that a~(x) r 0. For a real algebra A we have, for x in A, besides a ' ( x ) , a ( x ) also the extended quasi-spectrum J '(x) and extended spectrum J(x) (when A is unital)which are defined in the following way. Every real algebra A has a complexification, a complex algebra A. Set ~" '(x) - a ~ ( x ) and ~(x) - a3.(x ) (note ~
I
that when A is unital A is also unital). The above changes or extensions in the terminology for the spectrum I feel are ideologically justified and technically useful.
The book consists of nine chapters. Chapter 1 is devoted to algebraic preliminaries. Here I have included more material than strictly needed in the following chapters; for instance it contains an interesting result generalizing a well-known property of the Heisenberg commutation equation but this is not used anywhere in the book. The chapter can be profitably read independently for the topics treated. For the definition of the circle operation in a ring I have followed Perlis-Kaplansky rather than Hille-Jacobson; thus the definition adopted here is at variance with the one employed by Ricart or Bonsall-Duncan in their books (this has to be bourne in mind when comparing results) but agrees with that in Neumark's book. Chapter 2 deals with some of the basic definition and results concerning topological groups, topological linear spaces and topological algebras. For dealing with continuity questions I have used largely the approach via net convergence since I find this particularly suitable. I have included in this chapter a construction for the completion of a topological algebra using nets, imitating the classical construction of Hausdorff for the completion of a metric space. In connection with the construction I have isolated a property which I have called "essentially bounded" applicable to a net in a topological linear space. This property is weaker than boundeness of the net ( as a set). In fact there are convergent nets which are not bounded but every convergent- or even Cauchy net is essentially bounded. In Chapter 3 I have considered some generalizations of the norm: quarter-norm, (F) norm, p-seminorm, p-norm. These give rise to different types of topological algebras: quarter-normed algebras, (F) algebras, p-seminormed algebras, p-normed algebras and p-Banach algebras. Some properties of these algebras are studied here. Based on special properties of quasi-inversion or inversion, topologival algebras come under the following categories: C algebras, Q algebras, I algebras, CQ algebras and CI algebras. Various results concerning there categories are obtained. Finally the chapter contains a large number of results pertaining to topological zero divisors. Chapter 4 is concerned with a generalization of the notion of convexity called p-convexity. This concept leads to some gener-
xi alizations of locally convex spaces and algebras giving rise to; locally p-convex, locally pseudo-convex spaces and algebras; locally sm. p-convex, locally sm. pseudo-convex algebras; pseudo Fr~chet algebras. After giving a basic treatment of these spaces and algebras the projective limit decomposition, discovered by Michael, is obtained for certain locally sm. pseudo-convex algebras. This decomposition enables the extension to these algebras of some results available for p-Banach algebras. Also contained in this chapter is a section on ample algebras and another on topological spectral radius. The latter contains a proof of an important theorem, due to Zelazko, for generating seminorm from p-seminorm. In chapter 5 some differential and integral analysis involving vector valued functions is developed. The extensions to p-Banach algebras of the Banach algebra theorems of Nagumo (on the range of the exponential function) and of Gleason-Kahane-Zelazko (on characters) are obtained. There is a section devoted to square roots and quasi-square roots which ends up with a useful result regarding existence of idempotents. The final section concerns power series operation in topological algebras and includes the proof of a theorem of Mitjagin-Rolewvicz-Zelazko affirming local submultiplicativity property for Frechet algebras on which all entire functions can operate. Chapter 6 is concerned with spectral analysis and applications. Besides quasi-spectrum and resolvent function, I also consider the pseudo-resolvent function which is a useful tool in the study of algebras without unity. As applications of the spectral analysis is obtained a number of Gelfand-Mazur type theorems which include those due to Arens, Shilov, Zelazko. The last section of the chapter is taken up with the proof of an interesting theorem due to Turpin, affirming the local submultiplicativity property for all commutative Frechet algebras which are Q algebras. The Gelfand representation theory is the subject-matter of chapter 7. For properly understanding and appreciating Gelfand's results I have found it convenient to introduce two classes of topological algebras called Gelfand algebras and spectrally Gelfand algebras. Besides I have also introduced the class called G B algebras i.e. algebras in which the spectral radius formulae of Gelfand and Beurling (in a modified form) hold. The proof of the Beurling-
xii Gelfand-Zelazko theorem that every complex p-Banach algebra is a G B algebra is presented. Other topics considered in this chapter are holomorphic functional calculus for a single element and, automorphirms and derivations. The functional calculus in the strong form has been developed for an element of a p-Banach algebra and using the projective limit decomposition theorem the final result extended in the weak form to pseudo-Michael algebras. The Singer-Wermer theorem on derivation has been obtained for p-Banach algebras and an extended version for pseudo-Michael algebras. Chapter 8 deals with function algebras, Shilov boundary, hullkernel topology, completely regular algebras, holomorphic functional calculus for several elements of a commutative p-Banach algebra and Shilov idempotent theorem. Finally, in chapter 9 an exposition of the norm uniqueness theorems of Gelfand and Johnson (extended to p-Banach algebras) is given. For writing this book I have drawn material and ideas from the Banach algebra books of Neumark, Rickart, and Bonsall-Duncan, from the memoir of Michael on locally convex algebra and lecture notes of Zelazko on topological algebras. Besides, I have also been influenced by the topological algebra book of Guichardet and the treatment of Banach algebras in Rudin's book on functional analysis. I wish to acknowledge here my indebtedness to these authors. I wish to thank P.S. Rema (a former Director) and S. Sri Bala (the present Director) of the Ramanujan Institute for their unstinted help in connection with the publication of the book. I thank N. Vijayarangan (UGC project assistant) for his help in proof reading. I wish to record my thanks to G. Narayanan, (Assistant Technical Officer (Computer)) of the Ramanujan Institute for his help in the preparation of the well-executed laser print copy of the book. Finally, I wish to express my appreciation to N.K. Mehra of Narosa Publishing House for readily agreeing to publish the book and for his understanding role in the production of the book.
V.K. Balachandran
CHAPTER I ALGEBRAIC
w 1.
Some
Basic
PRELIMINARIES
Concepts
and
Results
1 . 1 . 1 . Recall t h a t in a ring R an element el (respy. t er) is called a left (respy. right) unity if eza = a (respy. aer = a) for all a in R. If e is both a 1. ( = l e f t ) u n i t y and a r. ( = r i g h t ) unity then e is called a unity. If R has a unity, R is called unital. We always assume t h a t the unity e # 0. The meaning of a positive power a m of an element a is clear. Also, in a ring R with unity e, we define for any element a, a ~ - e. This is well-defined since unity is unique (see 1.1.2). 1 . 1 . 2 . LEMMA. I f R has a I. unity ez and a r. u n i t y e r then necessarily el - er - e (say) and e is a u n i t y of R which is moreover unique.
PROOF. clear.
el-
(et)e~ -- e l ( e ~ ) -
e~. The uniqueness of e is
1 . 1 . 3 . Let R be unital with unity e. An element a~-i (respy. a~-1) is called a I. (respy. r.) inverse or l.i. (respy. r.i.) of an element a if a [ l a e (respy. a a r 1 - e). An element a -1 is called an inverse of a if it is both a 1.i. and a r.i. If the inverse a -1 of a exits we call a invertible or regular. 1 . 1 . 4 . LEMMA. ( a ) I f a has a l . i . a l I and a r . i . a r 1 then az 1 _ a r l _ a - 1 (say) and a -1 is the unique inverse of a. In particular, the inverse of an element, w h e n e v e r it exists, is unique.
(b) The invertible e l e m e n t s of a unital ring R f o r m a group Gi - G i ( R ) under multiplication. (c) I f a e Gi then - a e Gi a n d ( - a ) -1 - - a -1. PROOF. (a) a / 1 -- a ~ l e -1 ar .
t respy.-- respectively.
a l l ( e a r 1) -- (a~la)a-~ 1 -- ear 1 -
Algebraic Preliminaries
(b) It suffices to observe that if a, b are invertible then b - l a -1 is the inverse of ab and a is the inverse of a -1. (c) This is an immediate consequence of the identity x y =
(x, v
R).
1.1.5. LEMMA. (Kaplansky). In a unital ring R (with unity e) if an element a has a unique I. (or r.) inverse then a is invertible.
ba-
PROOF. Suppose that a has a unique 1. inverse b, so that e. Then (ab - e + b)a - aba - a + ba - a - a + e - e.
By uniqueness of 1. inverse, a b - e by 1.1.4 (a), a is ivertible.
+ b-
b or a b -
e. Therefore,
1.1.6. Let F be a field and A an (associative, i.e., linear associative) algebra over F. Given a subset S of A, there exists a smallest subalgebra A ( S ) containing S, called the subalgebra of A generated by S; A ( S ) is the intersection of all subalgebras of A containing S. Explicitly, A ( S ) is the set of all finite sums of the form ~ Akxk, where )~k E F and (each) xk a finite product of elements from S (clearly this set is a subalgebra A ( S ) containing S and every subalgebra containing S contains A ( S ) ) . If A has a unity e then we have also the smallest subalgebra AI(S) containing S and e. We have AI(S) - Fe + A ( S ) - {~e + x " ~ E F , x E A(S)}. If A is only a unital ring then we have the analogous subrings A ( S ) and AI(S). Here A I ( S ) - 7/e + A ( S ) . A subalgebra (respy. subring) A0 of a unital algebra (respy. ring) A is called a subunital algebra (respy. subunital ring) of A if the unity e(of A ) c A0; then A0 is automatically unital with e as its unity. Note, however, that a subalgebra (respy. subring) of A can be unital without being subunital (i.e. A0 can have a unity e0 ~= e). For example in the algebra A of 2 • 2 diagonal matrices over a field F the subalgebra A0 comprising diagonal matrices with second entry 0 is unital but not subunital ( e - diag (1, 1),
w 1. Some Basic Concepts and Results
e0-- diag (1,0)). 1.1.7. Let A be an algebra (or a ring). For a,b E A we write a ~ b if a b - b a and say t h a t a and b commute. For two c o m m u t i n g elements a, b we have the Binomial Theorem.
(a + b) '~ --
a'~-kb k, where (~) -- k,(=-k),, n
(.)
k=0
a positive integer. (This can be proved by induction as in the classical case of the theorem, see [13, p.52].) For two subsets $1,$2 of A we write $1 ~ $2 if for every a c $1, b E $2 we have a +-~ b. We also write for an element a E A a n d a s u b s e t S of A, a ~ S if a~-~b, for every b E S . If S ~-~ S we say that the (subset) S is commutative. For a subset S of A we set S ~ = {x C A : x ~ S} and call S I the c o m m u t a n t (or centralizer) of S in A. S" = (S~) ~ is called the double c o m m u t a n t of S. 1.1.8. LEMMA. Let S be a subset of an algebra (or ring) A. Then (i) S' is a subalgebra (subring) of A. (ii) S c_ S" and consequently A ( S ) unital, A I ( S ) C S".
C_ S";
also when A
is
(iii) If S C T C A, where T is a subset, then T I C_ S I. (iv) S ' -
S'".
(v) S is commutative ifft
S C S I iff S" is commutative.
(vi) If S is commutative so are the subalgebras A ( S ) , S " . (vii) If S is a maximal commutative subset then S -
S".
PROOF. (i), (ii), (iii) an clear. By (ii)we have S ' _ (S')" S'". On the other hand, since S _c S" (by (ii)), we get; using (iii), S'" _ S'. Hence S ' - S'" which is (iv). For (v), we observe t h a t t iff-
if and only if.
Algebraic Preliminaries "S is commutative" iff S c_ S'. If S _c S' then by (iii), (iv),
S" C_ S ~ C_ (S") ~, so t h a t S" is commutative. On the other h a n d "S" commutative" trivially implies "S commutative" (since S _ S"). For (vi), we note t h a t by (v), S" is c o m m u t a t i v e and so also
A(S) c_ S" (see (ii)). Finally, for (vii), we have by (vi), S C_ S" and S" is commutative by (vi). The maximality of S implies t h a t S - S". 1.1.9. PROPOSITION. Every commutative subset S of an algebra A is contained in a maximal{ commutative subalgebra Am(S) of A such that
s _c a ( s ) c
s"c_ a = ( s ) .
In particular, each element a of A is contained in a maximal commutative subalgebra Am(a). If A is unital with unity e then c A=(s) PROOF. By 1.1.8 (vi), A ( S ) , S " are c o m m u t a t i v e subalgebras, and S c_ A(S) c S". Since the union of any linearly ordered (with respect to inclusion) family of c o m m u t a t i v e subalgebras is a c o m m u t a t i v e subalgebra we can apply Zorn's lemma to obtain a m a x i m a l c o m m u t a t i v e subalgebra Am(S) D S". If A has unity e then $1 - S O{e} is c o m m u t a t i v e and hence
Am(Sl) ~ Am(S)~ S. By maximality of Am(&) -
Am(S)
we
have
Am(S1)
--
Am(S),
e
E
1 . 1 . 1 0 . Let A,A* be two algebras (over the same field F). A m a p p i n g ~ 9A ~ A* is called a homomorphism if it is linear, and multiplicative, i.e. p(ab) = ~o(a)p(b) for all a,b e A. An injective or 1 - 1 h o m o m o r p h i s m ~ is called a monomorphism and a surjective or onto h o m o m o r p h i s m is called an epimorphism. A h o m o m o r p h i s m ~o which is both 1 - 1 and onto is called an t i.e. if $1 is a commutative subMgebra of A with Am(S) C_$1 then
S,-Am(S).
w 1. Some Basic Concepts and Results isomorphism (of A onto A*). Sometimes we use the term "isomorphism into" for a monomorphism and "homomorphism onto" for an epimorphism. 1.1.11. Given two algebras A1, A2 (over F) we have the direct product algebra A - A1 x A2" A-
E Al,a2 c A2}.
{(al, a 2 ) ' a l
The algebra operations on A are given by"
(al, a2) + (bl, b2)
-
(al + hi, a2 + b2)
A(al, a2)
-
(Aal, Aa2)
(ai, a2)(bl, 52)
-
(aibi, a252)
where al, 51 E A1; a2, b2 E A2; )~ E F. 1.1.12. An algebra A (over F) can be extended canonically into a unital algebra A1 called the unitization of A. We take for A1 the cartesian product linear space (over F) given by" A 1 -
F x A-
{(,k, a)" )~ E F, a E A}.
Write (1, 0) - el, (0, a) - h. Then" ()~, a) -- )ke1 -~- (2, (12, b) - 12el -[- b. Define multiplication in A1 by" +
+ b) -
+
+ , a + a/,.
It is easy to check that under this multiplication A1 is an algebra and that the map a ~-, a is a monomorphism. We identify h with a and write. ()~, a) = ,~el + a, so that A1 = Fel + A. We observe that A as a linear subspace of A1 has codim t 1. Further it is clear from the definition of multiplication in A1 that A is both a left as well as a right ideal of A1. If B is a subalgebra of a unital A with its unity e ~ B then B1 = Fe + B is unital subalgebra of A called the unitization of t codim- codimension- dim(AliA).
Algebraic Preliminaries BinA. We note that the above construction for A1 can be carried out even when A has a unity e; of course el =fi e (since el r A). Finally, we remark that a ring R has a unitization R1. It is given by RI-~ t xR-7/el+R with (me1 -4- a)(nel + b) - m n e l + mb -4- na + ab (m, n E -~). 1.1.13. Let R be a ring and ' o ' denote the binary operation, called circle operation, on R given by
hob-
a+b+ab
(a, b E R).
We denote R with this binary (multiplication) operation by So So (R); So is a multiplicative system. 1.1.14. LEMMA. Let R be unital, with unity e, and So as defined above. Denote by S - S ( R ) the underlying multiplicative semi-group structure of R. Then the map. r-
r(S)
9x E S ~
x-
e E So
is an isomorphism of S onto So (as multiplicative structures). Hence So is a semi-group with '0 ' as the identity element. PROOF. Clearly r is bijective. Further
7(a) ov(b) - ( a - e) o ( b - e) - a b - e - 7(ab). 1.1.15. COROLLARY. Let R be any ring. Then So - - S o ( R ) is a semi-group with '0' as identity. PROOF. Consider the unitization R1 of R. Then el + R = {el + x : x c R}, under multiplication, is a subsemi-group S* of S(R1). By considering the restriction of the isomorphism (see 1.1.14), r : S(R1) --+ So(R1) to S* we get the desired conclusion for So. 1.1.16. If a o b = 0 then a is called a l.q.i.(=left quasi2 - {0,+1,+2,...} (the ring of integers).
w 1. S o m e Basic Concepts and Results
inverse) of b and b a r.q.i. (=right quasi-inverse) of a; also then b (respy. a ) i s said to be l.q. (respy. r . q . ) i n v e r t i b l e . If a is b o t h 1.q. invertible and r.q. invertible it is called q. invertible or q. regular (the m e a n i n g s of 1.q. regular and r.q. regular are clear). !
1 . 1 . 1 7 . LEMMA. (a) If a E R has a l.q.i, a~l and a r.q.i, a r then a~l- a ir - a I (say) and a I is q.i. of a. Moreover, a ~ a'. (b) The set Gq of q. invertible e l e m e n t s of R is a group under the multiplication 'o '; Gq is a subsemi-group of So. PROOF. (i) T h e proof of the first s t a t e m e n t is similar to t h a t of 1.1.4 (a); for the second we note t h a t a o a ~ - 0 - a ~ o a =2z aa ~ - a~a.
(ii) The proof is similar to t h a t of 1.1.4 (b). 1.1.18. LEMMA. Suppose that a is an invertible (respy. q. invertible) e l e m e n t of a unital ring (respy. ring) R , x E R and x ~ a. T h e n x ~ a -1 (respy. x ~ al). In particular a -1 (respy. a') e {a}" (the double c o m m u t a n t ) .
a -1
PROOF. xa - 1 ( a - l a ) x a -1 -- a - l ( a x ) a - 1 - x. Similarly, x o a I - a I o x.
a-l(xa)a -1-
1.1.19. COROLLARY. Let A m be a m a x i m a l , c o m m u t a tive subalgebra of an algebra A. I f b E A m is invertible (respy. q. invertible) in A then b-1 (respy. b') E A m . PROOF. By 1.1.18, b -1 ~-~ A m and so S A m U{b - 1 } is c o m m u t a t i v e . By 1.1.8 (vi), the s u b a l g e b r a A ( S ) is c o m m u t a t i v e . Since A ( S ) D_ S D A m , b y m a x i m a l i t y o f A m , A m - S - A ( S ) , so t h a t b -1 C S C A m . Similarly b~ c Am. 1 . 1 . 2 0 . LEMMA. Let R be a unital ring with unity e. T h e n an e l e m e n t a of R has a l.q.i. (respy. r.q.i.) b iff e 4- a has e + b as a l.i. (respy. r.i.). In particular a is q. invertible iff e + a is invertible and then we have (e + a) - 1 - e + a I, a I being the q.i. of a. Moreover, 7 -1 " a ~ e § a is an i s o m o r p h i s m of Gq onto Gi. PROOF. The s t a t e m e n t s follow from the identity
Algebraic Preliminaries
(e + a)(e § b) -= e § (a o b).
1.1.21. LEMMA. If A1 is the unitization of an algebra (or ring) A and a E A has a l.q.i. (or a r.q.i.) bl in A1 then bl E A. Hence a is q. invertible in A1 iff its q. invertible in A. PROOF. Write b l - - C ~ e l + b , where b E A and c~E F or 7/ according as A is an algebra over F or a ring. Then a o bl -- O :~ a + o~el + b + o~a + ab = O =~ o~ = O =:~.bl = b.
1.1.22. R e m a r k . Related to o-operation in R is the operation denoted by x and given by a x b = a + b - a b (a, b E R). This operation is again associative and has other similar properties of o. If S• denotes the multiplicative system in R corresponding to x, then the map a H - a is easily seen to be an isomorphism of So onto S• The operations o, x are mutually connected by: aob=
( a x -b); a x b =
(ao-b).
The operation x has been introduced by Hille (following a suggestion of J acobson) and called by him as cross-product. Some authors like Rickart, Bonsall-Duncan adopt the definition of the cross-product for the circle operation. 1 . 1 . 2 3 . LEMMA. Every np. (=nilpotent) element a of a ring R is q. invertible with
a' - - a § a 2 + . . . - 4 - a k-1 (a k - O ,
ak-17s
(.)
Further, if R is unital with unity e, then e + a is invertible with
(e § a) -1 - a - a 2 + . . . - + - a k-1.
(**)
PROOF. It is straightforward to check that a ~ as defined in (.) is the q.i. of a, and ( e + a ) -1 as defined in (**) is the inverse of e § 1.1.24. LEMMA. If ~ is a h o m o m o r p h i s m of a ring R then 99 preserves o-operation and hence also I. (or r.) q. invertibility.
w 1. Some Basic Concepts and Results If R is unital with unity e then ~(e) is the unity of ~(R) preserves I. or r. invertibility.
and
PROOF.
~ ( a o b) - ~(a + b + ab)
--
~9(a) + ~(b) + ~(a)~a(b)
=
p(a) o 99(b) (a. b E R).
F u r t h e r , since p ( 0 ) - 0, a o b -- 0 ::~ ~p(a)o ~p(b) - 0, completing the proof of the first s t a t e m e n t . The second s t a t e m e n t is an i m m e d i a t e consequence of ~p being a h o m o m o r p h i s m . 1 . 1 . 2 5 . LEMMA. In a ring, if a o b is l.q. (respy. r.q.) invertible then b - O.
(respy. b o a ) - a
and a
PROOF. Suppose t h a t a o b -- a. T h e n b-0ob-
(a~zoa) o b - a
lo(aob)-a
loa-0.
Similarly, b o a - a ==~ b - 0. 1 . 1 . 2 6 . LEMMA. Let A be an algebra and u E A an idempotent. Then" (i) For any A # - 1 , A u is q. invertible with (Au)' - - A ( 1 + A ) - l u . In particular u ' - - 8 9 Also, when e ezists, e ' 1 2 e.
(ii) If - u is q. invertible then u is not q. invertible.
O. Hence, in a unital A,
-e
(iii) If A has unity e then e + u is invertible with (e + u) - 1 -_
a, e
_
#
0).
PROOF. (i) A u - A(1 + ) ~ ) - l t l - A2(1 + )~)-ltI -- O, whence (Au)' -- --A(1 + A ) - I u . (ii) ( - u ) o u - - u + u - u 2--u. Hence, by 1.1.25, u - 0 . (iii) (e + u) 1 _ e + u' - e - ~u. Since (Ae)(A-le) - e and Ae +-~ A - l e , (Ae) -1 -- A-le. -
1.1.27. tities:
1
PROPOSITION. (a) In any ring R we have the iden-
(i) ba o ( - b a - bxa) - - b ( a b o x)a
10
Algebraic P r e l i m i n a r i e s
(ii) ( - b a - bxa) o ba - - b ( x o ab)a (iii) - a 2 o b - a o ( - a o b ) (iv) b o - a 2 - ( b o - a ) o a where a, b, x E R.
(b) In a u n i t a l ring R with u n i t y e we have: (v) (bxa + e)(e - ba) -- bx(e - ab)a + e - be (vi) ( e - b a ) ( b x a + e ) - b ( e - a b ) x a + e - b a where a, b, x E R.
PROOF. (i) LHSt - b a + ( - b e - b x a ) + b a ( - b a - b x a ) = - b ( x -4- ab + a b x ) a - - b ( a b o x ) a -
RHS t
(ii) Similar to (i). (iii) a + ( - a o b ) + a ( - a o b) RHS a - a + b - ab + a ( - a -a2
t b-
a2b--a
+ b - ab)
2 o b-
LHS.
(iv) Similar to (iii). (v) L H S - bx(a - aba) + e - ba - b x ( e - ab)a + e - ba (vi) Similar to (v).
RHS.
1.1.28. COROLLARY. (i) ab is l.q. (respy. r.q.) invertible iff ba is l.q. (respy. r.q.)invertible. In particular, ab is q. invertible iff ba is q. in vertible. (ii) e - ab is I. (respy. r.) invertible iff e - be is I. (respy. r.) invertible. In particular, e - ab is invertible iff e - ba is invertible. PROOF. ( i ) B y taking x - (ab)~z (respy. (ab)~r) in (ii)(respy. (i)) we conclude that "ab is 1.q. invertible (respy. r.q. invertible)" ::> " ba is 1.q. invertible (respy. r.q. invertible)". This plus symmetry consideration proves (i). (ii) Taking x - ( e - a b ) ~ 1 (respy. ( e - a b ) r I in (v)(respy. (vi)) of 1.1.27, and using symmetry we get the desired conclusions. t LHS - Left Hand Side; RHS- Right Hand Side.
w 1. Some Basic Concepts and Results
11
1 . 1 . 2 9 . LEMMA. In a unital ring R with unity e, if ab has a r.i. (respy. l.i.) c then be (respy. ca) is a r.i. (respy. l.i.) of a (respy. b). Similarly, in any ring R, if a o b has a r.q.i. (r py. l q.i. ) c b o (r py. o a) a r.q.i. (r py. l.q.i.) o/ a (respy.) b. PROOF. Clear. 1 . 1 . 3 0 . COROLLARY. The elements ab, ba are invertible iff a,b are invertible. In particular, if a ~ b and ab invertible then a, b are invertible. Similarly, aob, boa are q. invertible iff a,b are q. invertible, and when a ~ b, a o b is q. invertible iff a,b are q. invertible. PROOF. If a, b an invertible then as already seen, ab is invertible with b - l a -1 as its inverse. On the other hand if ab, ba are invertible t h a n by applying 1.1.29, 1.1.4 (a) we conclude t h a t a,b are invertible. Hence the s t a t e m e n t s concerning invertible elements. The proof of the s t a t e m e n t s concerning q. invertible elements is similar. 1 . 1 . 3 1 . PROPOSITION. Let R be a ring and x , a E R. If x ~,
(a § x'a)ll and (a § ax')lr exist then (x § a)' exists and (x § a)' - (a § x'a)'l o x' - x ' o (a + ax)'r. PROOF. We have
( a + x a )I l o Ix '
O
(x+a)
-
(a § x'a)ll o ( x ' + x + a + x'x + x'a)
--
(a + x'a)ll o (x' o x § a + x'a)
--
(a § x'a)' l o (a § x'a) - O (since x ' o x -- 0)
Similarly,
(x § a) o x' o (a § ax')'r
--
(x § a § x' § xx' + ax') o (a + ax)'7"
--
(a § ax') o (a § ax)' r
--0
It follows t h a t x § a is b o t h 1.q. invertible and r.q. invertible and so q. invertible. The required conclusions are now clear. 1 . 1 . 3 2 . COROLLARY. With the hypothesis in 1.1.31 we have
(x § a)' - x' - (a § x'a)'l § (a § x'a)'lx' - (a § x'a)'r § x'(a + x'a)'r.
12
Algebraic P r e l i m i n a r i e s
1 . 1 . 3 3 . COROLLARY. I f x +-+ a a n d x ~, (a + axe) ~ exist, t h e n (x -4- a) I exists with (x § a)' - x' o (a + a x ' ) ' - (a + ax')' o x'. PROOF. Since x ~ a, by 1.1.18, x ~ ~ a, so t h a t (a § x'a)~z - (a § ax')~z - (a § ax')~r - (a + x'a)~r. T h e required result now follows by 1.1.31.
w 2.
Ideals
and
Radical
1 . 2 . 1 . Let R be a ring. If I is b o t h a 1.(-left) ideal and a r . ( - r i g h t ) ideal of R it is called a bi-ideal. We will use the t e r m ideal for d e n o t i n g any one of these: a 1. ideal, a r. ideal or a biideal. W h e n R is c o m m u t a t i v e or a n t i - c o m m u t a t i v e , t h e r e is, of course, no distinction between a 1. or a r. ideal and the t e r m ideal has an u n a m b i g u o u s m e a n i n g . If a ring R is an algebra (over a field F ) t h e n we have also the algebra ideals i.e. ring ideals which are also linear subspaces. While every algebraic ideal is a ring ideal the reverse is not always true. T h u s , if the 1-dim real linear space R is given the trivial a l g e b r a s t r u c t u r e (~2 t - {0}) the subset ~ of ~ is a ring ideal which is not an a l g e b r a ideal. This distinction vanishes for a u n i t a l a l g e b r a A since we have the relation )~a = ( ~ e ) a (~ E F; a E A; e - - u n i t y of A ). Let R be a ring (or algebra). Recall t h a t an element a =/: 0 of R is called a l . z . d . ( = l e f t zero divisor) if there is an element b J= 0 with ab = 0. Similarly, a ~= 0 is a r . z . d . ( = r i g h t zero divisor) if t h e r e is a c # 0 with ca - O. Given a subset S of R the left a n n i h i l a t o r a n n i h i l a t o r ~ r ( S ) are defined by: .~l(S) -- { x e R : xa = O,V a e S } ~ r ( S ) = {y E R : ay - 0,V a E S}.
Az(S)
and right
t In a ring R, for two subsets S1,Se we write $1S2 - {xy 9x E S I , y E $2}; also for a subset S , S ~ - SS.
13
w2. Ideals and Radical
{a} then we write ~t(a),.4r(a) for the corresponding annihilator ideals. If S = R we denote the two annihilators by ~l and At. A ring R (respy. algebra A) is called a ring (respy. algebra) with trivial multiplication if R 2 (respy. A 2) - {0}. If s
-
1.2.4. LEMMA. ( i ) ~ l ( S ) ( r e s p y .
~4r(S)is a l.(respy, r.)ideal
of R. (ii) If I is a I. (respy. r.) ideal of R then Az(I) (respy. A~(I))
is a hi-ideal. (iii) Mr, Mr are nilpotent bi-ideals: A 2 _ ~ 2 _ {0}. PROOF. (i) Clear. (ii) Let I b e a l . ideal, x e ~ z ( I ) , y E A a n d a e I . Then x y . a - - x . y a - - O , xy C ~z(I), proving Az(I) is a bi-ideal. Similarly, A~(I) is a bi-ideal. (iii) If a,b e ~z then ab e a A {0}, so that A~ - {0}. Similarly, M ~ - {0}. 1.2.5. PROPOSITION. If a ring R (respy. algebra A ) ~ {0} has no l.-ideals # R,{0} (respy. no 1.(algebra)ideals # A,{0} then R (respy. A) ist either a division ring (respy. division algebra) or a ring (respy. algebra) with trivial multiplication and with underlying additive group of R (respy. linear space of A) of prime order (respy. of dim 1). If R (respy. A) is unital then R (reA) a ivi io ring (r py. algebra) PROOF.
Assume that
R (respy. A) has a 1.z.d. a, so that
ab = 0 with a J: 0, b ~: 0. Then Ii = ~z(b) ~: {0} so that the hypothesis implies that Il = R (respy. A). Thus
nb = {0}
(respy. A b -
(0}).
Since R (respy. A) is a r. ideal its right annihilator I is a biideal with b c I, and since I -7(= {0} we conclude that I = R (respy. A). Therefore R 2 (respy. A 2) - {0}. It follows that the additive subgroup of R (respy. subspace of A) is cyclic of prime order (respy. of dim 1). t The same conclusions hold if a similar condition is put on r. ideals instead of 1. ideals.
14
Algebraic Preliminaries
Next suppose t h a t R (respy. A ) has no 1.z.d., so t h a t R* = R \ { 0 } (respy. A* - A \ { 0 } ) t is closed under multiplication. If a c R* (respy. a e A * ) then R e (respy. A a ) i s a l . ideal ~={0}. Hence, by our hypothesis, Ra-
R ( respy. A a -
A)
(,)
It follows t h a t there is an element e ~= 0 with ea - a. T h e n (e 2 - e)a - a - a 0, so t h a t e 2 - e since R (respy. A ) has no 1.z.d.. For a r b i t r a r y x E R* (respy. A* ), e(ex-x)ex-ex0 and hence e x x, so t h a t e is a 1. unity of R* (respy. A* ). Again, by (.), there is an element b c R* (respy. b C A* ) such t h a t ba = e, so t h a t a has a 1. inverse b. It follows t h a t R* (respy. A*) is a group tt and R (respy. A ) is a division ring (respy. algebra). Finally, if R (respy. A ) is unital then clearly R 2 (respy. A 2) =/= {0} and R (respy. A ) i s a division ring (respy. algebra). 1 . 2 . 6 . A 1. ideal (respy. r. ideal) I of an algebra (or a ring) A is called regular or m o d u l a r if there is an element u in A such that x u - x (respy. u x - x) E I for all x E A.
T h e condition can be expressed briefly by writing A ( u - 1) (respy. ( u - 1)A)_C I. T h e element u is called a relative r. unity (respy. relative I. unity) for I; u is not unique (see 1.2.8). If u is b o t h a relative 1. unity and a relative r. unity it is called a relative b i - u n i t y or just relative u n i t y . We also use sometimes the word relative unity for a relative r or 1. unity. The precise sense of the usage will be clear from the context. W h e n A is c o m m u t a t i v e , relative r. unity and 1. unity concepts coincide and relative unity has an u n a m b i g u o u s meaning. 1 . 2 . 7 . R e m a r k . In a unital A every ideal I is regular, with unity e as a relative unity (since x e - x = ex - x = 0 E I ). On t If S , T are two sets, we denote the difference set consisting of all elements in S which are not on T by S \ T . tt A semi-group with a 1. unity in which every element has a 1. inverse is a group.
15
w 2. Ideals a n d R a d i c a l
the other h a n d if A has trivial multiplication then no ideal ~ A is regular (since x u - x, u x - x - - x for all x.) In the ring of even integer 27/, the (principal) ideal 67/is regular (with relative unity u - 4) while the ideal 4?7 is not regular. 1 . 2 . 8 . PROPOSITION. (a) I f u is a relative r. (respy. l . ) u n i t y f o r a regular I. (respy. r.) ideal I a n d a E I then u + a is a relative r. (respy. I.) u n i t y f o r I. (b) Let u, v be relative r. (respy. l.) u n i t i e s f o r I. T h e n u v , a n d hence u ~ (n - 1, 2 , - . . ) , are relative r. (respy. l.) u n i t i e s flor I. F u r t h e r , x ( u - v ) ( r e s p y . (u - v ) x ) C I
(x E A ) .
(c) For a regular bi-ideal I, every relative r. or I. u n i t y f o r I is a relative (hi-} u n i t y . M o r e o v e r , i f u, v are relative u n i t i e s t h e n u-v c I. F i n a l l y , u is a relative u n i t y f o r I i f f u # - u + I is a u n i t y of the q u o t i e n t A # - A / I .
PROOF. (a) Let I be a 1. ideal. T h e n x ( u + a) - x -- ( x u -
x) + x a E I + I - -
I
(x E A ) .
The proof w h e n I is a r. ideal is similar. (b) A s s u m e t h a t I is a 1. ideal. Since x u v - x -- x u . v - x u + x u - x E I +
I--
I
u v is a relative r. unity for I. Taking v - u and using induction we get u ~ is a relative r. unit for I. Further,
The c o r r e s p o n d i n g results when I is a r. ideal are proved similarly. (c) Suppose t h a t u (respy. v ) i s a relative r. (respy. 1.)unity for I. T h e n u - v - ( v u - v) - ( v u - u) E I + I -
I.
Therefore, by (a), u - v + (u - v) is a relative 1. unity.
16
Algebraic Preliminaries
Similarly, xEA, xu-
v is a relative r. unity.
Finally, observe t h a t for
x, u x -
x#
x E I iff x # u
#
-
u#x
#
-
x#
where x ~ x # is the canonical quotient h o m o m o r p h i s m . 1.2.9. LEMMA. Let A be an algebra (or a ring) and I regular I. (respy. r.)ideal with relative unity u. Then: (i) If u C I then I (ii) If I # A then - u
a
A is not l.q. (respy. r.q.) invertible
(iii) A n y I. (respy. r.)ideal J containing I is regular with u as a relative unity for J. PROOF. It is enough to prove the results when I is a 1. ideal. (i) Since u E I , xuEI§
for any x C A , x u E I whence I - A .
(ii) Suppose that - u
and hence x - x - x u §
is 1.q. invertible with a as its 1.q.i.. Then
a-u-au - O, so t h a t u I - A - a contradiction.
a-au
E I, and so by (i),
(iii) Obvious. 1 . 2 . 1 0 . LEMMA (Krull). Let I ~ A be a regular ideal. Then there is a m a x i m a l regular ideal M of the same type (l., r. or bi-) as I with I C M. PROOF. If u is a relative unity for I, Apply Zorn's lemma, to the poset t of ideals as I) # A, to obtain M (note t h a t if {I a} in the poset then u r U I s , since u ~ any
by 1.2.9(i), u r I. (all of the same type is any chain of ideals Is).
1 . 2 . 1 1 . COROLLARY. In a unital A contained in a m a x i m a l ideal.
every ideal ~ A
1 . 2 . 1 2 . LEMMA. Let A be unital with unity e. Then:
t For definition see 2.1.1.
is
w 2. Ideals and Radical
17
(i) I f I r A is an ideal then e ~ I. (ii) I f Iz (respy. I~) is a I. (respy. r.) ideal r A then Il (repy. ca, not contain any I. (r py. r.) in rtibl of A.
(iii) A a - A
(respy. a A -
A)
iff a is a I. (respy. r.)invertible
element.
PROOF. (i) Since e is a relative unity for I this follows from 1.2.9 (i). (ii) If a c Iz is 1. invertible then e - a z l a E It, so t h a t Iz - A. Similarly I~ -- A if I~ contains a r. invertible element. (iii) If A a = A then there is a b c A with ba = e, whence a is 1. invertible. Conversely, if a is 1. invertible then since a E A a we m u s t have A a = A by (ii). Similarly we can prove a A = A iff a is r. invertible. 1.2.13. LEMMA. In a unital A an e l e m e n t a is l.(respy, r.)invertible iff a is not contained in any I. ideal (respy. r. ideal) 7~ A.
PROOF. This is o b t a i n e d by combining (ii), (iii) of 1.2.12 (noting t h a t A a (respy. a A ) is a 1. (respy. r . ) i d e a l ) . 1 . 2 . 1 4 . COROLLARY. A n e l e m e n t a E A is l.(respy, r.) invertible iff a does not belong to any m a x i m a l 1. (respy. r.) ideal of A. In particular, when A is c o m m u t a t i v e , a is invertible iff it does not belong to any m a x i m a l ideal. PROOF. This follows from 1.2.13, 1.2.10. 1 . 2 . 1 5 . LEMMA. (a) I f I and g a regular bi-ideal of A ideal of A (b) I f I is a hi-ideal of A J is a hi-ideal of A. Further,
is a regular I. (respy. r . ) i d e a l of A then I ~ J is a regular I. (respy. r.) and J a regular hi-ideal of I then J is regular if I is regular.
PROOF. (a) Let I be a regular 1. ideal with relative r. unity u and J a regular bi-ideal with relative unity v. Write w v + u - vu. Then, for x c A, where x w - x = x u - x - x ( v u - v) E I § I - - I.
(1)
18
Algebraic Preliminaries
Also, x w -- x = xv - x - (xv - x ) u e J + J u = J.
(2)
It follows from (1), (2) that I A J is 1. regular with w as as a relative r. unity. (b) Let u be a relative unity for J in I. If x E A then u x c I and hence, if a E J then u x a E J. Also xa E I, so that u . x a - xa E J. Therefore xa = u x a - ( u x a - xa) C J + J = J, proving J is a 1. ideal. Similarly, J is a r. ideal. Assume now that I is also regular with relative unity v. Set w = u § v - vu. Then xw-x=xv-x-(xv-x)uEJ (since x v - x E I ) . Thus J is regular with relative unity w. 1.2.16. LEMMA. Let ~ " A--~ A* be an e p i m o r p h i s m Then: (i) For any ideal I of A , I * = ~ ( I )
is an ideal of A*
of the
s a m e type (l., r. or hi.) as I.
(ii) I f I is regular with relative unity u then I* is regular with relative unity u* = ~ ( u ) .
(i) Clear. (ii) The regularity of I* follows from the identity ~ ( x ) ~ ( u ) ~(x) = ~(xux) when I is a 1. ideal and from the analogous identity when I is a r. ideal. PROOF.
1.2.17. LEMMA. Let 9a : A ~ necessarily e p i m o r p h i s m ). Then: (i) For an ideal I* of A * , I -
A* be a h o m o m o r p h i s m (not
! p - l ( I * ) i s an ideal of A of the
s a m e type.
(ii) If I* is regular with a relative unity u* belonging to ~ ( A ) , then I is regular with any u E ~ - l ( u * ) as a relative unity. (iii) I f p is an e p i m o r p h i s m and M* is a m a x i m a l regular ideal of A* then M -
~-I(M,) is
a m a x i m a l regular ideal of A.
PROOF. (i), (ii): Clear. (iii) It is enough to observe that the map
I* ~--~ ~9-1(/*)
(I* an ideal of A*)
19
w 2. Ideals and Radical
is a bijection between the ideals of A* and the ideals of A containing ker ~. 1.2.18. R e m a r k . The condition "u* E ~ ( A ) " in ( i i ) o f 1.2.17 cannot be omitted. This is shown by the following counterexample. A is an algebra (over F) with trivial multiplication and A1 its unitization and ~ the natural injection A ~ A1. If a c A and I - - F a then I is an ideal of both A1 and A. As an ideal of A1, I is regular (since A1 is unital) but as an ideal of A it is not regular (see 1.2.7). 1.2.19. Write
LEMMA. Let A be an algebra (or ring) and a E A.
II(a) = {xa q- x : x e A}, It(a) = {ax + x : x e A}. Then Ii(a) (respy. It(a)) is a regular I. (respy. r.) ideal with - a as a relative r. (respy. l.) unity. PROOF. It is easily seen that I t ( a ) i s a 1. ideal and I t ( a ) i s a r. ideal. Further, since x ( - a ) - x = ( - x ) a - x, the regularity for Iz(a) follows. The regularity for I~(a) also follows similarly. 1.2.20. COROLLARY. a E A is 1.q. (respy. r.q.) invertible iff IL(a) (respy. I t ( a ) ) : A. PROOF. If It(a) -- A, then since - a E Iz(a) there is a b E A with
- a - ba § b, whence boa - O, so that Conversely, if a has a 1.q.i.b. then we have -a=ba+bcIt(a), so that, by 1.2.19,
a is 1.q. invertible.
It(a) : A. The proof of the assertion for It(a) is similar. 1.2.21. LEMMA. (cf. [22, p.173]) (a) a e A is l.q. (respy. r.q.) invertible iff to each maximal regular I. (respy. r.) ideal Mt (respy. Mr) there is an element b possibly depending on Mt (respy. Mr) such that b o a E Mz (respy. a o b E Mr) (b) a e A is l.q.(respy, r.q.)invertible iff - a is not a relative r. (respy. l.) unity for any maximal regular I. (respy. r.) ideal of A. PROOF.
(a) If a has a 1.q.i. b then b o a : 0 E Mr. Next
20
Algebraic Preliminaries
assume that the stated condition is satisfied for all Ml. If a is not 1.q. invertible then by 1.2.20, Iz(a) ~ A. By 1.2.10, there is an Mz with Iz(a) c__ Ml. By our assumption we can find a b with boa c ML. It follows t h a t
- a - b + b a - (boa) E Il(a) + Mt C_ Mz + Mz - Mz. By 1.2.19, - a is a relative unity for Il(a) and so also for Ml. Hence, by 1.2.9(i), Ml = A - which is impossible. So a is 1.q. invertible, as required The proof of the s t a t e m e n t concerning r.q. invertible is similar (b) The statement to be proved for 1.q. invertibility is clearly equivalent to: a is not 1.q. invertible iff - a is a relative r. unity of some maximal regular left ideal Mz. If - a is not 1.q. invertible then by 1.2.20, Iz(a) r A and so Iz(a) c_ (some) Ml. By 1.2.19, - a is a relative unity for Iz(a) and so also for Mz. Conversely, if - a is a relative r. unity for some Mz then by 1.2.9(ii), a = - ( - a ) is not 1.q.i. The proof of the s t a t e m e n t for r.q. invertibility is similar. 1.2.22. A 1. or r. ideal I is called q. invertible if every element of I is q. invertible. Denote the intersection of all maximal regular 1. ideals (respy. the intersection of all maximal regular r. ideals) of A by ~ A (respy. ~r-~). If there are no maximal regular 1. ideal (respy. r. ideal) in A we define x ~ ( ~ ) - A. 1.2.23. LEMMA. ( a ) I f every element 4 a l.(respy, r.) ideal I is l.q. (respy. r.q.) then I is q. invertible. (b) The image, under an epimorphism, of a q.i. ideal is a q.i. ideal (of the same type). PROOF. (a) It suffices to prove the result when I is a 1. ideal. For a C I, let aIz be a l.q.i. Since a I z o a - 0 we have a I - a - ala E I. By our hypothesis, a I has a l.q.i, b" boa I - O . By 1.1.17 (a) - applied to a~z- we get a - b, which implies t h a t a is q. invertible with a ~ - a~z. (b) If ~ : A ~ A* is an epimorphism and I an ideal then by 1.2.16, I* = ~ ( I ) is an ideal of A* of the same type as I. By 1.1.24, I* is q. invertible. 1.2.24. PROPOSITION. (a) ~
(respy. ~ / ~ ) is a q. invertible
w 2. Ideals and Radical
21
I. (respy. r.) ideal containing every q. invertible I. (respy. r.) ideal of A. In particular, every e l e m e n t of ~ or ~ / A is q. invertible. (b) x ~ x)~x/r~ (say); x / ~ is a hi-ideal containing every q. invertible I. or r. ideal of A. (c) ~ contains every n i l - in particular nilpotent - I. or r. ideal of A. (d) I f u # O is an i d e m p o t e n t of A then u ~ x / ~ . In particular, when A is unital with unity e, e ~ v/A.
PROOF. (a) Since ~ - ~Mz, if a E x ~ C Mz then a o a a + a + a 2 E Mz, whence by 1.1.21 (a), a is 1.q. invertible. So by 1.2.23 (a) r is q. invertible. Let Iz be any q. invertible 1. ideal of A. If Iz g x ~ then there is an Mz with It g Mz, so that we have" (*)Mz + It - A. If u be the relative r. unity for Ml then by (.) we have - u - a + b (a E M z , b E Iz).
Since b C Iz its q.i. b~ exists and therefore u-
-a-b
=
- a - ( - b ' - b'b) - - a + b' + b ' ( - u - a) - a + (b' - b'u) - b'a E Mz,
which is impossible (since Mz # A). Hence Iz _c Mz, as required. The corresponding result for ~ is proved similarly. (b) For a ~ ~ A and x E A we claim that the principal 1. ideal {ax}z - A a x + 2Zax is q. invertible. If y is any element of this ideal then y - bax + n a x - (ba + n a ) x
(b E A, n @ Z).
Since a E ~/-A, yo -- x ( b a + n a ) E ~ and hence y0 is q. invertible. By 1.1.28(i), y is q. invertible, so that the ideal {ax}z is q. invertible. By (a), {ax}~ C_ r In particular a x e C/--A, whence ~ A is a bi-ideal. Similarly, ~r~ is a bi-ideal. Since r (respy. ~ ) is a q.i.1. (respy. r.)ideal we must have by (a), _c ~ (respy. ~ _c ~ ) . Hence ~ ~/-A. (c) By 1.1.23, every nil ideal is q. invertible and so contained in V ~ (by (b)).
22
Algebraic Preliminaries
(d) If u E ~ then - u E v/A, and - u is q. invertible. But then by 1.1.26(ii), u - 0 - a contradiction. 1.2.25.
The bi-ideal v/A is called the J acobson radical or
radical of A. Following Neumark [22,p.173] an element of ~ is called an essentially nilpotent element of A. In view of 1.1.24, an element a is essentially nilpotent iff the principal 1. ideal {a}z = A a + Za (or equivalently, the principal r. ideal {a}r) is
q. invertible. Further, if A is commutative then every nilpotent element a is essentially nilpotent (since {a}t = {a}r is a nil ideal). 1.2.26. ~(v~)
LEMMA.
If ~9 " A ~
A* is an epimorphism then
c vIA *.
PROOF. By 1.1.24, ~(v/A) is a q. invertible bi-ideal of A*, whence by 1.2.24 (b), ~ ( v / A ) _ v/A *. 1.2.27. An algebra A in which ~ A is called a radical algebra. Note that an algebra is a radical algebra iff every element is q. invertible. Any algebra A0, with trivial multiplication (A02 - {0}) is a radical algebra (since every a e A0 is q. invertible with a' = - a ) . An algebra A 7~ {0} is called s.s. (=semi-simple)if x / ~ -
{0} 1.2.28. LEMMA. In a s.s algebra A we have
PROOF. By 1.2.4 (iii), 1.2.24 (c), Az, Ar C_ X / ~ - {0}.
w3.
Characters
and Hypermaximal
ideals
1.3.1. Let A be an algebra over a field F. A homomorphism X of A onto F (as a 1-dim algebra) is called a character of A; X-1 ( 0 ) - - ker X is called the kernel of X. We denote by A -- A(A) the set of all characters of A; A may be empty.
w 3. Characters and H y p e r m a x i m a l ideals
Let X be a linear space over F. A linear m a p r called a linear functional. 1 . 3 . 2 . LEMMA. field F and to: A ~
X=X*
23
X --. F is
Let A , A * be two algebras over the s a m e A* an epimorphism. If X* E A ( A * ) then
o ~ C A(A).
PROOF. Clear. 1 . 3 . 3 . L EMMA. A h o m o m o r p h i s m i ~ it is non-trivial (i.e. X ~ 0 ~ ).
X" A ~ F is a character
PROOF. If X J= 0 there is an element a0 E A with x(a0) r 0. If fl E F t h e n X ( f l ~ - l a 0 ) - fl, proving X is surjective, whence X is a c h a r a c t e r . The converse is trivial. 1 . 3 . 4 . LEMMA. A subspace B is of codim 1 iff it is the kernel r f u n c t i o n a l d2 on A.
of a L S ( - linear space ) A of a non-trivial linear
PROOF. If r y~ 0 there is an a0 E A w i t h r - A ~= 0. Write ) ~ - l a 0 - - u ; then r 1. For x E A we can write x - r where y x-r e kerr B (say). It follows t h a t A - F u q- B, so t h a t c o d i m B - 1. Conversely, if c o d i m B - 1, there is an ao E A \ B such t h a t A - Fao § B. If x E A and x - Aa0 4-b, define r It is clear t h a t r is a linear functional on A with k e r r 1 . 3 . 5 . LEMMA. A regular I. or r. ideal I, of codim 1, of an algebra A is a hi-ideal, which is moreever, m a x i m a l as a I. or a r. ideal, or also, as a hi-ideal. PROOF. Let I be a c o d i m 1 regular 1. ideal with u as a relative r. unity. Since c o d i m I - 1 we have F u q - I - A. If y c A t h e n y - c~u 4- b, with c~ E F , b E I. Therefore, if a E I,
ay - a ( ~ u § b) - ~ ( a u - a)4- ~a q- ab e I, whence I is a r. ideal so a bi-ideal. T h e p r o o f of this w h e n I is a r. ideal is similar. T h e m a x i m a l i t y assertions are i m m e d i a t e consequences of the c o d i m 1 p r o p e r t y of I. t '0' denotes the zero-functional mapping everything to 0.
Algebraic Preliminaries
24
1.3.6. DEFINITION. A codim 1 regular ideal I of A is called a hypermaximal ideal; by 1.3.5 every hypermaximal ideal is a biideal. 1.3.7. If an algebra A has hypermaximal ideals we denote their intersection by ~/-A. We set ~ f A - A if A has no hyperm a x i m a l ideal. We call ~-A the hyper-radical of A, and we say t h a t A is h.s.s. ( - h y p e r semi-simple)if ~ f A - {0}. 1.3.8. L EMMA. x / A _
~/A.
PROOF. By 1.3.5 every hypermaximal ideal is maximal regular 1. ideal. The inclusion relation now follows from 1.2.24 (b) and the definition of x~-A. 1.3.9. PROPOSITION. The hypermaximal ideals of an algebra A are precisely the kernels M• -- k e r x of characters X of A. Moreover, the correspondence X ~-~ M• is a bijection between the set /~ of characters and the set 91I of hypermaximal ideals. PROOF. Since X is a homomorphism, M• is a bi-ideal, and since X is surjective there is a u E A with X(U) = 1. Further, for any x e A, we have ( . ) X ( x u - x ) = X(x)" 1 - X ( x ) = O, whence M x is regular with u as relative unity. Also, by 1.3.4, codim M x = 1, whence M x is hypermaximal. If M is any h y p e r m a x i m a l ideal the quotient A # - A / M has dim 1. If u is relative unity for M, by 1.2.8 (c), u # - u + M is unity of A #. If x # C A # then x # = a ~ u # where a x E F , since dim A # = 1. The map X = XM : X ~ a~ is clearly a character of A with ker X = M = M x. Finally, it is clear from the construction of XM from M t h a t M1 - M2 ::> XM, --XM2" Hence X ~ Mx is a bijection. 1 .3 .1 0 . COROLLARY. (i) The relative unities for M - - M x are precisely the elements u in A satisfying X(u) - 1. In particular, if A has unity e then x(e) - 1 and further x(a) ~ 0 for any invertible a. (ii) The set of all relative unities ( - bi-unities) [or M• is the unity coset E of A # - A I M x.
PROOF.
(i) It is clear from the relation (,) in the proof of
1.3.9 t h a t any u with
X(U)-
i is a relative unity for
M - M•
w3. Characters and Hypermaximal ideals
25
Conversely, let v be any relative unity for M. Choose any element ao c A \ M ; then x(ao) ~ O. Since aov - ao e M we get x(ao)X(V)
-
x(ao),
X ( V ) --
1.
If a is any invertible element then
x(a)x(a-1) --x(e)- 1, whence x(a)
~ O.
(ii) Since M - M• is a bi-ideal, by 1.2.8, E - u # is the set of relative unities for M, u being a relative unity for M. Also, by 1.2.8 (c), E is the unity coset of A #. 1.3.11.
LEMMA. Every character X of A vanishes on x/~.
PROOF. By 1.3.8, V ~ __C_~
__ k e r x , hence the result.
1.3.12. Remark. If A is a radical algebra then A ( A ) ~ ) ( i f A - A ( A ) J: 0, X E A then x / ~ _c k e r x c A, so t h a t A is not a radical algebra). Again, for the m a t r i x algebra A - M,~(F)(n > 1 ) , A ( A ) - 0, since A being simple has no h y p e r m a x i m a l ideals. 1.3.13.
(a)
EXAMPLES
OF
HYPERMAXIMAL
IDEALS"
Let G be a finite group of order n and A FIG] the group algebra of G over a field F of characteristic 0. Write a - ~ g , where the sum in A is over all elements g of G; a E A. Clearly, ag - A. for each g E G, whence a 2 - - ha. 1 then u 2 - u . Writing v - e - u , If we write u - ~a, it is easy to see t h a t M Av is h y p e r m a x i m a l (since it has a 1-dim direct s u m m a n d A u - Fu).
(b) Let L I ( G ) be the group algebra of a locally c o m p a c t Hausdorff group G. Consider the functional h(f)-
fc I(t)dt
where the integral is the (left invariant) Haar integral. Clearly A is linear. Further h(f
9 g)
--
If* g(t)dt--f (/f(s)g(s-lt)d8)dt
Algebraic Preliminaries
26
--
f f(8)d8 f g(8-Xt)d(8-xt) - A ( f ) a ( g ) ,
where we have used the left invariance of the Haar measure. Finally, h ~ 0. For, if U is a nucleus t of G with 0 compact, and to E G \ U , we can, by local compactness of G, choose a positive continuous f with f(to) - O, f ( t ) - 1 on U. Then _
_
A(f)-
fo f(t)dt>
fCt)
t-
> 0,
where #~ denotes the left Haar measure of G. Thus h is a character and M - ker h is a h y p e r m a x i m a l ideal ( M is called the a u g m e n t a t i o n ideal). (c) Let F be a field and F s denote the algebra, under pointwise operations, of all F - v a l u e d of functions f = f ( s ) on a set S. If so c S then the m a p Xso : f ~-~ f(so) is easily seen to be a character and M8 ~ - k e r x % - { f e F S ' f ( s o ) 0)} is a h y p e r m a x i m a l ideal. 1 . 3 . 1 4 . LEMMA. Let J be a bi-ideal of A. If M is a hypermaximal ideal of J then M is a hi-ideal of A. If J is regular in A then M is also regular in A. PROOF. These follow ideal is a regular bi-ideal. The first assertion can way. Let )/ be the character of Take u C J with X ( U ) and
from 1.2.15 (b) since a h y p e r m a x i m a l also be proved directly in the following J determined by M " M - ker X. 1. If x E A , a E M _ J then x a E J
x ( x a ) - X ( u ) x ( x a ) - X(uxa) - X ( u x ) x ( a ) - O. Therefore xa E M, similarly ax E M. Thus M is a bi-ideal of A. t for definition see 2.1.3.
27
w 3. Characters and H y p e r m a x i m a l ideals
1.3.15. PROPOSITION. Let A be an algebra and J a hi-ideal of A.
Then:
(i) E v e r y character X of J x(ax)
(x e A,
satisfies the condition
x(xa)
-
a e J).
(ii) X can be uniquely extended to a character ~ of A. PROOF. 1, then M unity. Take M we have
If M - k e r x , and u an element of J with X ( U ) is a hypermaximal ideal of J with u as a relative x E A. Then ux, x u c J and by hypermaximality of the relations.
UX -- m + ~ t t ; x u
-- m 1 -J- ~ t t
(1)
( m , rtz 1 e M )
Then UXU -- m u -F aU2; UXU -- u m l -F ~U 2
(2)
since m u , u m l E M we obtain from (2) - ~ x ( u ~) - x ( ~ u ~) - x ( u = u ) - x ( Z u ~) - / ~ .
So (1) gives x(u=) - ~-
~-
x(=u).
Now extend X on J to ~ on A by setting ~(=) - x(u=)
- x(=u)
(= ~
A).
Clearly ~ is linear. Further
,t(xy)
:
x(u=y)x(u)-
x(u=.yu)-
x(u=)x(yu)
- ~(=);~(y).
x(ux)x(uy)
This proves that ~ is a character of A which is an extension of X. Further, if X, is any character of A extending X then x , (x) - x , ( x ) x ( u ) - x , (~)x, (',.,) - x, (=,.,) - x(=~)
- :~(=),
which shows that the extension f~ is unique. Finally, x(=a)
-
~(=a)
-- :~(=);~(a)
-
;~(a);~(=)
-- ~(a=)
-- x(a=)
28
Algebraic Preliminaries
where x E A , a E J . 1 . 3 . 1 6 . COROLLARY. Every hypermaximal ideal M satisfies the s y m m e t r y condition for x E A, a 6 J, xa
of J
6 M r ax E M .
PROOF. This follows from 1.3.15 (i) since M = k e r x some character X of J.
for
1 . 3 . 1 7 . COROLLARY. Every character X of an algebra A can be extended uniquely to a character X1 of its unitization A1. PROOF. If X1 C A I , X 1 : )~el~-X ()t E F , x E a) then XI(Xl) -A + X(x) is easily checked to yield, a character of ~i'l of A. The uniqueness of Xi follows from 1.3.15 (ii) (taking J = A ) or can also be seen directly using the fact t h a t for any character X~ of AI we have x l ( e l ) = 1. 1 . 3 . 1 8 . LEMMA. Let A = A1 @ A2 be a direct sum of subalgebras A1,A2. I]" A = A ( A ) , A j = A ( A j ) ( j = 1,2) then A is the disjoint union A - A~ ~ o / s u b s e t s Ajo such that A joI A j -- A j
(i.e. if x c A jo then x I A j c A j
PROOF. Let X E A and X(u) = 1 (u E A). Since u = ttl-~-u 2 with uj C A j , and UlU2 - U2Ul - 0 (since AzA2 - A2A1 A1 A A2 = {0}) we obtain 1 : X(u) : X(tL1) -~- ~'(tL2), X ( t t l ) X ( u 2 ) = O.
From these equations it follows t h a t precisely one of X(tL1), X(tL2) is 1 and the other 0. If X(ui) = 1,X(u2) = 0 then for y 6 A2, s l y = 0, so t h a t 0 - - X(Uly)~-- X ( U l ) X ( y ) - -
X(Y).
This shows t h a t X E Al~ Similarly, if X ( U 2 ) - 1 then X E A ~ 1 . 3 . 1 9 . LEMMA. (cf.[24,p.233]). Let A be a unital algebra and X a linear functional with x(e) = 1. The following two statements are equivalent:
w 3. C h a r a c t e r s and H y p e r m a x i m a l ideals
29
(i) X is a character. (ii) M - ker X is closed f o r squares,
i.e. x c M ==~ x 2 E M.
PROOF. (i) ~ (ii), since M is an ideal by 1.3.9. To prove t h a t (ii) => (i), assume t h a t (ii) holds. Since X is a linear functional ~- 0, codim M - 1. For x, y E A we have x -- x ( x ) e + a,
y - x ( y ) e + b (a, b E M ) .
C o m p u t i n g from these relations the p r o d u c t x y and s u b s t i t u t i n g it for x y in X ( x y ) and simplifying we get
X(xy) -- X(x)x(y) + x(ab)
(1)
Taking y - x, b - a in (1) and using hypotheses (ii) we obtain
X(X 2) - X(X) 2 for all x C A
(2)
Replacing in (2), x by x + y we obtain X((x + y)2) _ (X(X) + X ( y ) ) 2 which reduces to
x ( x y + yx) - 2 x ( ~ ) x ( ~ )
(3)
x or y E M ::~ x y + y x E M
(4)
It follows that"
Now we have the identity
( x y - yx)~ + ( x y + yx) ~ - 2((xy) ~+ (~)~) - 2(~y~.y+ y.xy~) (5) where x , y c A. If y E M, then by (4), x y + y x as well as the end expression in (5) belong to M. Therefore, by applying X to b o t h sides of (5) and by using linearity of X and relations (2),(4) we obtain xy - yx E M (6) From (4), (6) we conclude t h a t if y E M then x y c M This means t h a t in (1) we m u s t have x(ab) - 0, so t h a t (1) reduces to
x(~y) - x(~)x(y) proving X is a character, as desired.
Algebraic Preliminaries
30 w4.
Extension
of Ideals
1.4.1. Let J be a bi-ideal of an algebra A. For a 1. ideal Jz of J we set Jl - {a C A" Ja C_ Jz}. (*) Similarly, for a r. ideal Jr of J we set
Jr -- {a E A" aJ c Jr}.
(**)
1.4.2. PROPOSITION. (i)^dt is a 1. ideal of A with JL c_ dz; .]~ is a r. ideal of A with Jr C_ Jr. (ii) If I' is a regular l.(respy, r.)ideal of J with relative r. (respy. l.) unity u, then P is also regular with u as a relative r. (respy. 1.)unity. Further, if I' ~ J then J ~ i', hence in particular ~l ~ A. (iii) If I is a l. (respy. r.) ideal of A and I' - J ~ I then I C I'. (iv) If M ' is a maximal regular I. (respy. r.) ideal of J then 2~I' is a maximal regular I. (respy. r.) ideal of A such that M ' - J 0 ~/I~. Also, if M ~ is a maximal regular hi-ideal of J then Is ~ is a maximal regular hi-ideal of A. (v) If M is a maximal regular I. (respy. r.) ideal of A such that J ~ M then M has a relative r. (respy. l.) unity j belonging to J; further M ' - J ~ M is a maximal regular I. (respy. r.)ideal of J with j as a relative r. (respy. l.) unity and M - I~'. Finally, if M is a maximal regular hi-ideal of A with J ~ M then M I = J ~ M is a maximal regular hi-ideal of J. PROOF. We shall prove only the results for 1. ideals. (i) Clearly Jl i s a l i n e a r s u b s p a c e o f A. For a E J t , x E A we have J . x a J x . a cC_ Ja c Jz,xa E Jz, so that Jz is a 1. ideal of A. (ii) If x C A and a c J then a x c J . By regularity for f , a x axu c I ~. This implies that J ( x - x u ) c f , whence x - x u E P,/~' is regular. Further, by 1.2.8 (b) u 2 is a relative r. unity of I ~, so that if I ~ r J then u 2 ~ I ~. It follows that J u ~ I ' , u ~ I', so that J ~ _T'.
w4. Extension of Ideals
31
(iii) Let I be 1. regular with relative r. unity u. If x E I then J x c A x C I and J x C J (since J is a bi-ideal). Therefore J x c J ['l I - I ' , x c P, so t h a t I __ /~'. (iv) Assume t h a t M ~ is a m a x i m a l regular 1. ideal of J with r. unity u. By (ii), h~/~ is regular with relative r unity u. If I is a 1. ideal of A , I ~ A, with I 2 / ~ _ _ _ M ~ then I is regular with u as relative r. unity and u ~ I (since I ~ A). Further, J N I _ M ' , and since u ~ J N I , J n x = / = J . By maximality of M t , J ~ I - M t. Since I ___ h~/t _ M t we get J ~ / ~ / ' - M ' . For x e I, x u x-(x-xu) e I (using regularity of I ) ; also xu e J (since u e J ) . Thus xu c J A I - M ~. It follows that J x u c_ J M ~ c_ M ~, whence xu c i~I'. Consequently x - x u - ( x u - x ) e 1~I'. This proves I - / ~ / t , h~/t is maximal. (v) Let M be a m a x i m a l regular 1. ideal with relative r. unity u. Since J ~ M, by maximality of M we have J § A. Therefore u has a representation (.) u - j + m (j E J, m E M ) , so t h a t for any x E A x-
~.o
z3 - x -
z(u-
m) - x -
xu + x m ~ M .
Thus j E J is a relative r. unity for M. By restricting x to J we get x - x j E J ['1 M - M ~ showing t h a t M ~ is regular (in J ) w i t h relative r. unity j. Since u ~ M it follows from (.) t h a t j ~ M , j ~ M ' , M ' r J. Consider now a 1. ideal I t of J with I t ~= J , P ~ M t. Then A _ ~ t _ /~/t. Also, by (iii), M C_ h~/'. By maximality of M we obtain I ' - h ~ / ' - M. It follows t h a t M ' JAMJ ~ I ' D I t, so t h a t I t - M t and M t is maximal. Finally, by (iv), M t - J[")/~/' - J A M . 1.4.3. PROPOSITION. Let J be a hi-ideal of an algebra A. Then there is a bijection between the maximal regular 1. (respy. r.) ideals M of A with J ~_ M , and the maximal regular I. (respy. r.) ideals M ' of J given by M'-
JNM,
M-
I~I'.
Algebraic Preliminaries
32
In particular, M' is hypermaximal iff M is hypermaximal. Finally, the map M ~ M' - J A M is a bijection between the maximal regular hi-ideals of A and those of J. PROOF. The first s t a t e m e n t follows from 1.4.2 ((iv),(v)). To prove the particular case s t a t e m e n t assume t h a t M is h y p e r m a x imal and X the character determining it. Let X ~ be the character of J obtained by restriction of X- Then it is clear t h a t M ' = J n M = ker X~ and hence M ~ is a h y p e r m a x i m a l ideal of J. Conversely, if M ~ is h y p e r m a x i m a l ideal of J and X~ the character determining it then X~ can be extended, by 1.3.15, uniquely to a character X - X' of A. If M - k e r x then M is h y p e r m a x imal and clearly we have J A M = M'. Finally, by 1.4.2 ((iv), (v)) M ~ is maximal regular bi-ideal iff M is a m a x i m a l regular bi-ideal. 1.4.4. COROLLARY. V ~ -- J n x/~. PROOF.
N(JNM')
-
n M'-
:
JA(A ~')- J r ] ~
(since in the c o m p u t a t i o n of the right hand end t e r m above the m a x i m a l regular 1. ideals of A which contain J can be clearly dropped). 1.4.5. COROLLARY. If A1 is the unitization of an algebra A then
~-
ANv%.
PROOF. By 1.4.4 (since A is a bi-ideal of A1 ). 1.4.6. Let A Iz (respy. I~) be a r. (respy. 1.)unity u. can form Il (respy.
be an algebra and A1 its unitization. Let regular 1. (respy. r.)ideal of A with relative By taking A1 for A and J - A in 1.4.1, we /~r ). We also set
{Xl e A " u x l e it}. 1.4.r. PRovosITION. (i)i~ (r~py. i~)i~ a I. (~py. ~.)ie~l Il - - { X l E A 1 " X l U e I I } ; Ir --
of A1 with
~ c i, c i~; ~ c i~ c i~
(,)
33
w4. Extension of Ideals Further, if I1 (respy. It) =fi A then il (ii) Given a l.(respy, r.)ideal I1 the ideal I = A ~ I 1 is regular and r. (respy. l.) unity u for I such that el (iii) If I is a regular I. (respy. r.) r. (respy. l.) unity u then -- 1-4- A l ( e l
- it) ( r e s p y .
(respy. it) =fi A1. of A1 with I1 ~ A, we can choose a relative - u E I1 ideal 7s A with relative
(**)
I + (el - u)A1),
I - - A ~ [. Further, if I17 ~ A is a l.(respy, r.) ideal of A1 with I - A A I1 then II C_C_i. (iv) For a regular hi-ideal I with a relative (bi-) unity u we have i -- I -4- A1 ( e l - u ) -- I q- ( e l -
u)A
-
- u),
I + F(el
and [ is bi-ideal. (v) If M is a maximal regular I. (respy. r.)ideal of A then 2~ is a maximal regular I. (respy. r.)ideal of A1 and M - ~/I, M -
AN g4. PROOF. As before we will prove all results only for 1. ideals. (i) It is clear from the definition of it that it is a subspace of A1. Further, if Xl E -ft (so that XlU E It) and yl ael + y (y E A), we have y l X l U -- OLXlU + y ' X l U
E I l + I l -- If.
It follows that ylXl E iz, showing that iz is a 1. ideal of A1. If xl E /~t and y C A then y l x u E Ix. Since y X l E A and Il is regular we get ylZl - yzlu-
(yzlu-
yZl) E Iz,
whence Axl C It, so that Xl E II, and /~L,C /~t. Also, if Iz ~ A then u ~ Ix,el ~ It, and _Tl ~ A1. (ii) Let I1 be a 1. ideal and choose an element. a l -- ,~el
-f- a (~ e F, )~ # 0, a e A) in
I1
\A.
Algebraic Preliminaries
34 Then u -
- A - l a E A, and for any x E A we have XU-
X -- --A-lxal
E
A~
I1 - I,
so t h a t u is a relative r. unity for I1. Also, el - - u -
(iii) If xl
-
Ael
A-lal
E 11.
--k x E A l ( x E A), then
(X 1 -- X l t t ) U -
X l U -- X l t t ' t t
E I-
Il
(since XlU e A).
It follows t h a t X 1 - - X l u E I I , SO that A I ( e 1 - u ) _ II. This inclusion with (first half o f ) ( , ) yields" Iz + A i ( e - u) C_ Iz. To prove the reverse inclusion relation consider an Xl E _TI (so t h a t x l u c Ii ). Then X l - - X l U + X l -- X l u E Il + A l ( e l
- u),
completing the proof of the relation (**). Further, it is clear that It c A['l[l. On the other hand, if a E A , a E it then h U E I~ and so a E Iz(since u is a r e l a t i v e r , unity of Iz). Thus Il - A N-Tl. Finally, consider the ideal I1. By (ii) we can choose for I A N I 1 a relative r. unity u such t h a t el - u E 11. If Yl -- Ael + y E 11 then yl U -- A u + yu E A.
Also, Yl u -
Yl -- Yl (el -- u) E /1 -Jr- /1 -- /1.
So y l u C A ~ I 1 required.
-
h_c
I, whence yl E [. Thus,
~, as
(iv) If xl C A1, Xl - ,~el ~- x (x E A) then X l ( e 1 - it)
--
~ ( e l -- It) Jr X -- XU E F ( e l
-
u)+I
(el - U ) X l
--
A(el - It) + x -
-
it) --[- I
ltx E F(el
Hence I + A l ( e I - tt) - - I + F(el - u) -- I + (e I -- u)A1 i (say). Clearly i is a bi-ideal.
35
w4. Extension of Ideals
(v) By (,) we have / ~ c_/~. Again, by 1.4.2 (iv), M - A["I h4. It now follows, by (iii), that M c h~/. Combining the two inclusions we get / ~ / - / ~ / , and M - A ["1 M - A ~ ]t~/. 1.4.8. COROLLARY. The correspondence I1 ~-~ I - A ~ J 1 is injective over each of the following sets of ideals o] A1 " the set of all hi-ideals I1 ~_ A; the set of maximal I. ideals M1 ~ A; the set of maximal r. ideals M1 ~ A. Also, every maximal regular I. (respy. r.) ideal M of A is of the form M - A ~ I(/I, where h:r
{Xl E A" XlU (respy. uxl) E M } .
PROOF. Suppose I1,J1 ~ A are bi-ideals of A1 with n ~ I 1 - n ~ J1 - I (say). If I A, clearly I1 - J1 - A1 (since codim A - 1 ). We may therefore assume that I ~: A. By 1.4.7 (ii) we can choose relative r. unities u,v for I such that el - u ~ /1, el - v c J1. By 1.2.8 (c), v - u E I __C_ J1. If xl - Ael + y (A E F , y E A) is an element of 11 then we can write: X 1 -- ,~(e 1 -- V)-~- ~(V -- it) -~- )~U -~- y,
)~U @ y - - X l U - - ( y U - - y).
(1) (2)
It follows from (2) that )~U -~- y E XlU @ I C I1 ~- I -- I1( s i n c e XlU E I1)
so that )~u+yEA~Ii-IC__
J1.
(3)
Since e l - v , v - u ~ J1, it follows from (1),(3) that Xl e J1. T h u s , / 1 _ J1, and by symmetry considerations we conclude that I1 = J1. The injectiveness over the set of maximal regular 1. (respy. r.)ideals M follows from 1.4.3, 1.4.7(v). The final assertion concerning the form of M is a consequence of 1.4.7(v) and 1.4.2 ((iii), (iv)). 1.4.9. COROLLARY. (a) A is a hypermazimal ideal of A1. (b) The correspondence M1 ~-~ M A ~ M 1 is a bijection between the hypermaximal ideals M1 ~ A of A1 and the hypermaximal ideals M of A; moreover M1 - M.
Algebraic Preliminaries
36
(c) ~ F X - A N ~ / A ~ . PROOF. (a) This follows from the construction of A~ (see 1.1.12). (b) By 1.4.7^(v), h : / - h4, M - A NhYr The bijectivity of the map M ~ M - M1 is ensured by 1.4.3. (c) This follows from (b) and the definitions of ~r-~, ~/A1. 1.4.10. R e m a r k . The character of A1 determined by the hypermaximal ideal A is denoted by Xo and called the distinguished or canonical character of A1. It is given by x0
+
-
e A).
It follows from 1.4.9 and 1.3.17 that there is a bijection X ---* X1 between the sets of characters A and AI\{X0}, where X1 is the unique extension of X to A1. 1.4.11. PROPOSITION. Let A be a radical algebra and A1 its unitization. Then: (i) no ideal I ~ A is regular; (ii) v/-X1- A; (iii) A1 is a local algebra having A as its unique maximal ideal. PROOF. (i) If A has a regular 1. (or r.)ideal # A then there is a maximal regular 1. (or r.)ideal M, whence V ~ _c M ~- A, contradicting A is a radical algebra. (i), (iii): If A1 has a maximal 1. (or r.)ideal M1 r A then M = A A M1 is a regular ideal of A, ~- A, contradicting (i). On the other hand, A is a maximal (1. or r. or bi-ideal) of A1. Thus v/A1 - A and A is the unique maximal ideal of A1. w 5.
Regular
Representation
and Primitive
Ideal
1.5.1. Let A be an algebra over a field F and X a linear space over F. A homomorphism ~a" A -* E (X) (=the algebra of linear endomorphismst of X) is called a linear representation t i.e. linear maps of X into itself.
37
w 5. Regular Representation and Primitive Ideal
or just a representation of A in X. It is well-known t h a t a representation ~ of A gives rise to an A - m o d u l e structure on X : a.x -- ~ ( a ) x . Conversely, if X is an A - m o d u l e it yields a n a t u r a l representation a ~ la, where la is the linear map on X given by la : x ~ ax (a @ A, x E X ) In particular we have for an algebra A the representation. ~ " a ~ la(a E A), where la is now given by la'xHax
(xEA).
is called the (left) regular representation of A The kernel of the h o m o m o r p h i s m ~ is given by ker ~ = {a E A : a A = 0} --the left annihilator ~qz. ~ is faithful (i.e. is a m o n o m o r p h i s m ) iff ~qz = {0}. In particular, by 1.2.28, ~ is faithful whenever A is s.s.. 1.5.2. If Iz is a regular 1. ideal of A then the regular representation ~ induces a representation ~ # in the quotient space A # - A / I l . ~ # is given by 9 ~ # 9 a ~-. la~, with l ~ ( x § Il) - ax § Iz(x § A ) . ~ # is called the regular representation of A in A #. The representation ~ # is called irreducible if A # is a simple t ( ~ # - ) module. For ~ # to be irreducible it is a necessary and sufficient t h a t I be a maximal regular 1. ideal of A. If ~ # is the regular representation of A in A # - A / I , we write (Iz'A)-ker~#-{aEA'la
~-0}-{aEA'aAC
Il}
Similarly, we write for a regular r. ideal It, (If'A)
- {a E A " Aa C_ It}.
1.5.3. LEMMA. Let I be a regular I. (or r.)ideal of A.
Then
t A module E over a ring R is called a simple R-module if RE ~ {0} and has only E and ~ 0 } as its submodules.
38
Algebraic Preliminaries
( I " A) is a bi-ideal of A with J - ( I " A) c I; also J is the largest bi-ideal (of A) contained in I. If I is a regular bi-ideal
th~n ( I A ) - ~. PROOF. T h a t J - ( I ' A ) is a bi-ideal is clear. Assume now t h a t I is a r e g u l a r 1. ideal. Then for x E J, x A C I, so t h a t in particular xu c I, where u is a relative right unity for I.
x-
x - xu § xu E I,
JCI.
Further, if J~ is a bi-ideal of A with j t _ I then J I A C J~ C_C_I, whence J~ CC_(I " A) - J. The proofs of these s t a t e m e n t s when I is a r. ideal are similar. Finally, when I itself is a bi-ideal we have clearly (I" A) - J - I. 1.5.4. Let A be an algebra (or even a ring). An ideal P is called I. (=left) primitive if there is a maximal regular 1. ideal Ml of A with P = (Ml : A) Similarly, if there is a maximal r. ideal Mr of A with P = ( M ~ : A ) then P is called r. primitive. By 1.5.3 a 1. or r. primitive ideal is a bi-ideal In general a 1. primitive ideal of a ring need not be r. primitive, t If an ideal P is b o t h 1. and r. primitive then it is called hi-primitive. If A is c o m m u t a t i v e then all these concepts evidently coincide. In the sequel we shall use the t e r m primitive for 1. primitive. We call an algebra (or ring) A primitive if the zero ideal {0} is primitive; equivalently, if there is a maximal regular 1. ideal Mt with {0} = ( M l : A). 1.5.5. LEMMA. Let A, A* be algebras (or rings) and p 9 A ---. A* be an epimorphism. If P is a primitive ideal of A with ker ~ c P, then p ( P ) is primitive. PROOF. If P -- ( M 9A), where M is a maximal regular 1. ideal of A, then ~ ( M ) is a maximal regular 1. ideal of A* and ~(P) -(p(M)'A), whence ~ ( M ) is primitive. 1 . 5 . 6 . COROLLARY. If P is a primitive ideal of A and 8" A ~ AlPA* the canonical homomorphism, then ~ ( P ) - {0'} See [ 4 ' , p p . 4 7 3 - 75]
w5. Regular Representation and Primitive Ideal
39
is primitive. 1.5.7. PROPOSITION.
If A is an algebra (or ring) and A r
V ~ , then n(Mz
9A) - N(M
9A)
where Ml (respy. Mr) runs through all maximal regular I. (respy. r.)ideals of A. In particular A is the intersection of all (1.) primitive ideals of A as well as the intersection of all r. primitive ideals. PROOF. By 1.2.22, 1.2.24 (b) we have ~ c Mz, whence by 1.5.3, ~ c ( M I ' A ) . Also, since Ml is regular we have (M~ 9 A) C Mz. Therefore
_c N ( M , so that x / A - N ( M z ' A ) ,
9A) _c
n
Mz
-
~/A.
Similarly, x / A - n ( M r "A).
1.5.8. LEMMA (cf. [27, p.144]). A maximal regular I. (respy. r.) ring ideal of an algebra A is an algebra ideal. Further, every primitive ring ideal of A is an algebra ideal. Hence the algebra radical of A coincides with the ring radical of A. PROOF. Let M be a maximal regular 1. ring ideal of A and write M1 - {x E A; Ax c M}. Clearly, M1 is a 1. algebra ideal and M c M1. Further, if u is a relative r. unity for M then u ~ M 1 . (since U C M l = = a u 2 E M = F M - A , by 1.2.8 (b), 1.2.9 (i)). By ,maximality of M we conclude that M1 - M, whence M is an algebra ideal. Similarly, the proof when M is a r. ideal. Now if P is a p r i m i t i v e ring ideal of A then P (A" M) where M is a maximal regular 1. ideal. If a E P, ~ E F then
c ~ a A - a.c~A C_ aA C_ M, so that aa c P, where P is an algebra ideal. 1.5.9. prime, t
LEMMA.
(Jacobson).
Every primitive ideal P is
t Abi-ideal P in a ring R is called prime or aprimeide~lif P ~ : R ~ndfor ~nybi-ide~ls I,J I J C P = : a I C P or J _ P .
Algebraic Preliminaries
40
PROOF. (cf. 21, p.54). Suppose that I J C P - ( M ' R ) and J ~ P. Then J R ~ M and hence, by maximality of M, J R + M - R. It follows that
I R C I ( J R § M) C_ I J § M C P + M so that I C (M" R ) -
M
P.
1.5.10. PROPOSITION. (a) Every maximal regular bi-ideal M is hi-primitive, in particular prime. Furthermore, the quotient A # - A I M is unital and simple. If A is commutative then A # is a division algebra. (b) If A is commutative then the primitive ideals of A are precisely the maximal regular ideals. PROOF. (a) Let Mz be a maximal regular 1. ideal with M __ Mz. Then M C (Mz " A) C_ Mt. Since ( M z ' A ) is a bi-ideal, by maximality of M, M - (Mr" A), whence M is (1.)primitive. Similarly it is r. primitive. Further, the bijection, between the bi-ideals of A # and the bi-ideals of A containing M, shows that A # is simple. A # is further unital since M is regular. Finally, when A is commutative it follows from 1.2.5 that A # is a division algebra. (b) In view of (a) we have only to show that a primitive ideal I is maximal regular. Since I is primitive there is a maximal regular ideal M with I - ( M " A) But since now M is a biideal, by 1.5.3, ( M " A) - M. Thus, I - M and I is maximal regular. 1.5.11. The intersection of all maximal regular bi-ideals of an algebra A is called the strong radical and is denoted by ~r-~; if A has no maximal regular bi-ideal we define A to be ~/A" ~ - A. 1.5.12. PROPOSITION. In any algebra A we have
PROOF. The first inclusion relation follows since every maximal regular hi-ideal is (by 1.5.10 (a)) primitive; the second is a
w 5. Regular R e p r e s e n t a t i o n and P r i m i t i v e Ideal
41
consequence of every h y p e r m a x i m a l ideal being (by 1.3.5) a maximal regular bi-ideal. 1 . 5 . 1 3 . Let A be an algebra. An A - m o d u l e X is said to be cyclic, with generator xo, if x0 E X and Axo = X . Also, an A - m o d u l e X is said to be irreducible if (i) A x ~ {0} and (ii) the only submodules of X are {0 } and X. If X is an A - m o d u l e , for x0 E X we write kerxo = {a E A : axo-O}. Similarly, for a 0 C A we write k e r a 0 - { x E x ' a 0 x 0}. Clearly kerx0 is a 1. ideal of A and kera0 a submodule of X. 1 . 5 . 1 4 . LEMMA. Let X
be an A - m o d u l e .
Then:
(i) If X is cyclic with generator xo then kerx0 I. ideal of A.
is a regular
(ii) I f X is irreducible then it is cyclic with any non-zero element xo as generator. Further, M -- ker xo is a m a x i m a l regular I. ideal of A. PROOF. (i) Since X = Axo there is an element u c A with xo -- uxo. Then ( a - auo)xo --- axo - axo = 0 , so t h a t a - au E ker x0 whence ker x0 is regular with u as a relative r. unity. (ii) The set X0 = {x e X : Axo = {0}} is clearly a submodule of X. By irreducibility of X we have X0 = {0} or X. But condition (i) in the definition of irreducibility rules out X0 = X and so we must have X0 = {0}. Thus, if xo E X , xo ~ 0 then A x o ~ {0} and so Axo = X, proving X is cyclic with generator x0. Also, by (i), M = kerx0 is a regular 1. ideal. It remains to prove t h a t M is maximal. If L is a l . i d e a l o f A with L D M, we can choose an element b E L \ M , and then bxo ~ O. It follows t h a t Abxo --- X , whence there is an a0 E A with aobxo = xo. But then, for any a E A, a - aaob c ker xo = M c L.
(,)
Since b E L and L is a 1. ideal we conclude from (,) t h a t a E L, which means L - A, proving M is maximal. 1.5.15.
If A is an algebra and Il a 1. ideal of A, then the
42
Algebraic P r e l i m i n a r i e s
quotient A # - A / I z is canonically a left A-module: a ( x § Ii) -- ax + Ii
(a, x E A).
The corresponding representation ~ # is given by, ~ # 9a ~ l~, where l~ is the linear transformations on A # such t h a t l ~ ( x + Il) - ax + Iz (cf.1.5.2). ~ # is faithful (i.e. 1-1) if (It "A) - {0}. 1 . 5 . 1 6 . LEMMA. Let I -- Iz be a regular I. ideal of an algebra. Then:
(i) The quotient module A # - A / I is cyclic. (ii) A # is irreducible iff I is m a x i m a l . PROOF.
(i) If u is a relative r. unity for I then x + I = x u § I - x ( u + I), so that A # is cyclic with u + I as generator. (ii) If 7r - A ~ A # is the canonical module h o m o m o r p h i s m given by x~-~ x + I, then clearly ~r-l(x0), where X0 ranges t h r o u g h all submodules of X - A #, are precisely the 1. ideals of A containing I. Hence the irreducibility of X is equivalent to the m a x i m a l i t y of I. 1 . 5 . 1 7 . LEMMA. Let X xo and I - ker xo.
be a cyclic A - m o d u l e with generator
Then 9 "a
§ I ~
is a module i s o m o r p h i s m of A # - A / I
axo onto X .
PROOF. (I) is well-defined since al + I - - a 2 -~ I ~ a l x o -a2xo. Since every element of X has the form axo, 9 is surjective. Finally, (I) is a module h o m o m o r p h i s m since r
§ I)) -- r
+ I) -- baxo -- b r
+ I)
1 . 5 . 1 8 . Let A be an algebra and X an A - m o d u l e . Write D - / ) (X) - the set of all A - e n d o m o r p h i s m s (i.e. e n d o m o r p h i s m T of the additive group of X satisfying T a x - a T x for all a E A). Clearly /) is a unital algebra, with the identity m a p of X as the unity element. 1,5.19.
LEMMA (Schur). For an irreducible A - m o d u l e
D is
a division algebra.
PROOF.
If T C P , T =fi 0 then T X , k e r X
are submodules
43
w6. Real and Complex Algebras
with T X X, ker T -
~ { 0 } , k e r T r X. By irreducibility of X, {0}, so that T is invertible and T -1 E P.
TX-
1.5.20. Let X be an irreducible A-module and P - D(X). If x 1 , ' " , xn E X these vectors are said to be P - i n d e p e n d e n t if for any T 1 , ' - ' , T n c D,
T1X l
--~- "
" -~- T n
x n
-
0
::~ T1
--
"'"
-
Tn
-
O.
Since /) is a division algebra, X can be regarded as a linear space over P. Then clearly P-independence is the same as linear independence in this linear space. 1.5.21. THEOREM (Jacobson's Density Theorem). Given D independent vectors Xl, " " ,xn and arbitrary vectors Y l , " " , Yn all in irreducible module X , there is an a in A with ax i - yj(1 ~< j<.n). PROOF. See [4, p.123].
w6.
Real
and
Complex
1.6.1. Let K denote either the real field C. An algebra over K is called real is ~ or C. Every complex algebra A A [a] if we restrict the scalars for A to said to have a complex structure if A can algebra A It] such that (A[C]) [~] - A .
Algebras
field ~ or the complex or complex according as becomes a real algebra ~. A real algebra A is be made into a complex
1.6.2. LEMMA. A real algebra A has a complex structure iff A admits a linear endomorphism J such that: (,) J ( x y ) ( g x ) y § x ( g y ) ; j 2 _ - I , where I is the identity map of A. PROOF. If A is a complex algebra, J defined by J x ix (i - ~ 1 ) satisfies the above condition (,). Conversely, if there is a J satisfying (,), a complex structure can be defined by setting (a + i ~ ) x - a x + ~ J x
1.6.3.
( a , ~ E ~ , x E A).
COROLLARY. A real unital algebra with unity e has
44
Algebraic Preliminaries
a complex structure iff there is an element j such that j2 _ - e .
in the centre of A
PROOF. If A is complex we can take j - ie. Conversely, if an element j satisfying the above condition exists then J x - j x will define a linear endomorphism satisfying (,) of 1.6.2. N
1.6.4. Let A be a real linear space and A the set of ordered pairs ( x , y ) with x , y e A. We denote ( x , y ) by x + iy, where i - - ~ - 1 . For z - ( x , y ) - x + i y , we write R e z - x, I m z - y The set A becomes a complex linear space if we define addition and multiplication in A by"
(Xl + i y l ) + (X2 + iy2) -- (Xl + X2) + i ( y l + Y2) + iZ)(x + iv) -
- Zv) + i ( . v +
(1) (2)
where x j , y j (j -- l, 2), x, y G A ; a , / ~ E ~ . We identify x C A with x + i 0 - (x, 0). In particular 0 - 0 + i0 - (0, 0). For z C A , z - x + i y , we set 2 - x - i y . Then it is straight forward to check that the map 0 ~ ' z ~ w ( z ) - 2 (called conjugation) has the properties: zl+z2-Z1+~2;
)~z-)~Z;z=z
( Z l , Z 2 , Z C A , ~ E C). If now A is a real algebra then A can be made into an algebra by defining multiplication in A via the equation N
ZlZ2 --
(zj - xj + iyj ( j -
(3)
(XlX2 -- YlY2) + i(XlY2 + X2Yl)
1 , 2 ) e ft.).
The complex algebra A is called the complezification of the real algebra A. Also it is easy to check that conjugation preserves N
N
multiplication" ZlZ2 - ZlZ2. For any subset S __ A we write S for w ( S ) . We also write Re , 5 - {
Rez'ze N
5}, I m p 5 - {
Imz'zeS}. N
,~
We call a subset S self-conjugate if S - S. 1.6.5. PROPOSITION. (a) A is a subalgebra of (.A)[~].
45
w 6. Real a n d C o m p l e x Algebras
(b) ft. is c o m m u t a t i v e iff A is c o m m u t a t i v e . (c) A is u n i t a l iff A is u n i t a l and then both A , A N
N
have the
same unity element.
Clear. (b) This follows from (3) of 1.6.4. _(c) If A has a unity e it is easily checked that e is also a unity of A. On the other hand if ~ is a unity of 1i then it is easily seen that the element e - Re ~ is a unity of A and consequently also of A. By uniqueness of the unity, ~ - e, completing the proof. PROOF.
(a)
1.6.6. LEMMA. S u p p o s e that a, b, c, d E A and ,v
z - (a + ib) o (c + id) i n A . Then - (a - i b ) o (c - id)
PROOF. Write zl - a + ib, z2 - c + id. Then Z
--
1.6.7.
Z 1 o Z2
--
( Z l -3t- Z2 + Z l Z 2 )
--
21 o 22 .
- - Z'I -+- 2'2 -~ ZIZ2
LEMMA.
I f c -4- i d (respy. a -f- ib) has a § ib (respy. c + id) as l.q.i, respy, r.q.i) then c - id (respy. a - ib) has a - ib (respy. c - id) as l.q.i. (respy. r.q.i). In particular, a - ib is q. invertible iff a + ib is q. invertible and then we have ( a - ib) ~ = c - i d i f (a + ib)' - c + id.
PROOF. This follows from 1.6.6, by taking z - 0 (noting that 0-0) 1.6.8. LEMMA. ( a § ( respy, c o a) -- O,
- 0 (respy. c o ( a + i b ) where a,b,c are e l e m e n t s o f A.
- O) =~ a o c
PROOF. This is obtained by equating real parts on both sides of the equation (after expanding). 1.6.9. L EMMA. Let A be unital. T h e n a - i b .v
A
is invertible in
N
iff a+ib
isinvertiblein
A,
and then we have
(a - ib) -1 - c - i d if (a + ib) -1 - c + id.
Algebraic Preliminaries
46
P R O O F . If zlz2 = e, t h e n now readily follows. 1.6.10.
ZlZ2
=
ZlZ2
--
e,--
e. T h e l e m m a
LEMMA. Let A be a real algebra and A its complex-
ification. Then: (i) A n element a E A is q. invertible in ffI iff it is q. invertible
in A. (ii) If A is unital, then a E A is invertible in A iff it is invert-
ible in A. N
P R O O F . (i)_since A c A it is e n o u g h to prove t h a t "a is q. i n v e r t i b l e in A " =~ "a is q. invertible in A " . S u p p o s e t h a t
a o (c + id) = 0 = (c + id) o a. By 1.6.8, a o c - 0 - c o a, t p r o v i n g a is q. invertible in A. (ii) T h e p r o o f is similar to t h a t of (i)
1.6.11. LEMMA. I/' I, i~ a I. ( r ~ p y . r . ) i d ~ / # A th~n ~(I) i~ a t. (,~py. r . ) i d ~ l of A. Further, if I i~ r~gut~; ~ith ,'dati,~ r. (r~py. t.) ~,~ity ~ th~n ~(I) i~ ,~g~l~, ~ith ,. (,e~py. t.) ~,~ity
~(~).
P R O O F . E a s y c o n s e q u e n c e s of the p r o p e r t i e s of w. N
1.6.12.
PROPOSITION.
complezification.
Let A be a real algebra and A its
Then: N
N
(i) If S is a subspace of A , S -
S + i S is a subspace of A.
(ii) If
I is a l. (respy. r.) ideal of A , I I + i I is a I. (respy. r.) ideal of A. Moreover, I is regular whenever I is regular and every relative r. (respy. l.) unity for I is also a relative r. (respy. l.) unity for I. If M is a m a x i m a l regular l. (respy. r.) ideal of A then M - M + i M is a m a x i m a l regular I. (respy. r . ) i d e a l of A. Finally, M is h y p e r m a x i m a l whenever M is hypermaximal. ,..,
N
t Since c is also a q. inverse of a in .4, by uniqueness of q.i., c - c +id, or d = O .
w6. Real and Complex Algebras
47
(iii) If S is a subspace of A then R e S - Im S - S (say) is a subspace of A such that S c_ S + iS, A N S c__ S. Further, -
s + is
ig
ll- oni,,gat ,
th n S - A N
Re/ is a (iv) If I is a I. (respy. r.) ideal of A, I I. (respy. r.)ideal of A. Also, if I is regular with relative r. (respy. l.) unity fi then I is regular with relative r. (respy. l.) unity u - Re ~. -
N
(v) Every self-conjugate regular I. (respy. r.)ideal I of A has a relative r. (respy. l.) unity u belonging to A, which is also a relative r. ( respy, l.) unity for I - Re I - A ('11. Further, if ~ 71 then I ~ A. Finally, the correspondence N
I ~-~ I + i I - I (say) is a bijection between the set of regular l. (respy. r.) ideals of A and the set of self-conjugate regular I. (respy. r.)ideals of A; I - A ~ I . PROOF. (i) This follows from (1),(2) of 1.6.4. (ii) The first statement is a consequence of (1), (3) of 1.6.4. If I is a regular 1. ideal with a relative r. unity u then (x+iy)u-(x+iy)-xu-x+i(yu-y)~I+iI-I, proving u is also a relative r. unity for I (the proof of the corresponding result when I is a r. ideal is similar). If M is a regular 1. ideal of A with a relative r. unity u, then as seen above u is a relative r. unity for 2(/I- M + i M . Since u r M, u ~ 1~ and so h : / r A. By 1.2.10 there is a maximal regular 1. ideal hS/1 of with M __ /~1. It follows that M __ Re h/l, whence by the maximality of M we have M Re M1. So ,v
]~1 ~ Re ]~1 + i (Im ]~1) _ M + iM - h~, N
N
~,
whence M 1 - M and M is maximal (the proof of this when M is a r. ideal is similar). Suppose now that M is hypermaximal. Then / ~ is (maximal) regular. If z - x + i y E A (x, y E A) and u is a relative unity ['or M, we have x-
au + re, y -
~u + m l ,
48
Algebraic Preliminaries
where a, fl 6 ~ and re, m1 6 M . Therefore
Z -- (~ ~- i~)U Jr- ( m -~- i m l ) , so t h a t A - Cu + / ~ , whence / ~ is hypermaximal. (iii) It follows from (1),(2) of 1.6.4 and the definition of Re S t h a t it is a subspace of A. Also, since for z E A, we have Re ~, I m i z , I m z - Re ( - i z ) it follows t h a t R e S - I m S - S (say). Further, since z Re~. - i I m z we have S c_ S + i S . Clearly, A N S _c S. Finally, if S is self-conjugate and z E S then 2 C S, Rez-~
1(z§
ES
so t h a t S, and hence, i S C__S, whence S - S + iS, S - A O S. (iv) By (iii), I is a subspace of A. Also, it follows from (3) of 1.6.4 t h a t it is a 1. (respy. r.) ideal. Assume now t h a t I is a regular l. i d e a l w i t h 5 - u + i v (u,v E A) as a r e l a t i v e r. unity. Then, for x E A, we have x ( u § iv) - x - xu - x § i x v E I,
so t h a t x u - x C I R e I , proving I is regular with u Re as a relative r. unity. The proof of the corresponding result when I is a r. ideal is similar. (v) Since ~7 is self-conjugate, by (iii), I-- I§
I--
Re i , I - A N ~
7.
By (iv), I is regular and by (ii), any relative r. unity for I is a relative r. unity for I is a relative r. unity for I. The bijectiveness of the m a p I ~ I + i I is immediate. ,v
1.6.13. LEMMA. Let I be a regular I. (respy. r.) ideal of A A § i A . Then I Re I A iff I has a relative r.(respy, l.) unity of the f o r m i v ( v E A). PROOF. It suffices to prove the result when I is a 1. ideal. Assume t h a t ~ - iv is a relative r. unity for I. By 1.6.12 (iv), Re ~ - 0 is a relative r. unity for I. Since 0 E I , I - A. Conversely, assume t h a t I - A. Let ~ - u § ivo be a relative r. unity for I. Since u C A - I R e I we must have u §
49
w6. Real and Complex Algebras N
for some y 0 E A . we have
Then, for any z - - x + i y E A
and v - v 0 - Y 0 ~,
N
z i ~ - z - z i ( v o - v o ) - z - z(~ + i v o ) - ~ - ~(~ + iyo) e I + z -
.v
z
N
whence iv is a relative r. unity for I. N
1.6.14. Let A be a real algebra and A its complexification. If J" is a functional (= real-valued function) on A, the extension f of f given by" (x, y E A)
/ ( ~ + y) - f (~) + i f ( y )
is called the canonical extension of f (to A). It is straightforward to verify that f is a linear functional (respy. character) of A if f is a linear functional (respy. character) of A A character )~ of A is called real if X - )~1A is real-valued (and then X is a character of A). Note that the canonical extension )~ of a character X of A is real. N
N
,v
1.6.15. PROPOSITION. ( a ) E v e r y real character fC of A satisfies" 2(2) - )C(z) (z C A). (b) A character )C of A is real iff ker)~ is self-conjugate. (c) There is a bijection between the set of all characters of A and the set of all real characters of A, given by X ~ X, where X is a character of A and ~ its canonical extension to A. N
proof.
(~) ~(~)
=
~ ( x - iv) - x ( ~ ) - i x ( v )
=
(x(x) + ix(v))
- ~(z)
(b) If )~ is real then it follows from conjugate. Conversely, if k e r ~ M is 1.6.12 (iii), M M + i M , where M 1.6.12(v), M has a relative unity for M. maximal. It follows that if x E A then N
(a) that ker ~ is selfself-conjugate then by Re M. Therefore, by By 1.3.9, ~'/ is hyper-
x - (a + ifl)u + m l + ira2, for some a, fl E ~; m l , m 2 E M.
By taking real parts we get from the above equation x -- a u + m l , whence ~(x) - a E ~,
50
Algebraic Preliminaries
so t h a t ~ is real. (c) If ;~ is a real character of A and X - : ~ 1 A, then X is a character of A and further :~ is the canonical extension of XThe bijectiveness of the map X ~ X is now clear. ,v
1 . 6 . 1 6 . PROPOSITION. The complexification A of a real s.s. algebra is s.s. . PROOF. Let M be any maximal regular 1. ideal. By 1.6.12 (ii), I ~ M+iM is a maximal regular 1. ideal of A. If z -
x§ c v / A then z E /~, whence x , y E M. Since M is an arbitrary maximal ideal we obtain x, y C ~ M - x / ~ - { 0 } .
Thus, z - 0 a n d ~ - { 0 } .
1 . 6 . 1 7 . DEFINITION. An algebra A over K is called formally real if it satisfies the condition t x, y E A and x 2 + y2 _ 0 :~ x - y - 0.
(,)
A formally real algebra A ( # {0}) is necessarily real. For, if A is complex, x C A and x ~ 0 then x 2 + (ix) 2 - 0, so t h a t it is not formally real. 1 . 6 . 1 8 . REMARK. Any real algebra whose elements are realvalued function on a set S is formally real (f(s) 2 § g(s) 2 - 0 ::~
1 . 6 . 1 9 . PROPOSITION. Let A be a formally real algebra. Then A as well as its complexification contain no non-zero nilpotent element. PROOF. It follows from the definition of formal reality t h a t 0-x 2-x 2§ Now suppose t h a t y E A , y n - 0, y n - I ~ 0(n ~ 3). I f n - 2 k then y2k _ (yk)2 _ 0 ::~ yk _ 0, contradicting yn-1 ~s O. Similarly, if n - - 2k § 1 then since yn+l - 0 we get y k + l _ O, again contradicting yn-1 7s O. Thus A has no non-zero nilpotent element. t This condition which is weaker than the Artin-Schreier condition for formal reality in the case of fields has been used by Arens and appears to be due to him.
w6. Real and Complex Algebras
51
Next s u p p o s e t h a t z - x + i y ( x , y E A) and z 2 we get x 2 - y2 _ 0, xy + yx - 0 It follows t h a t X4 -
X2.~ 2 --
X(Xy)y- X(--~X)y- --(X~)
0. T h e n
2,
(x2) 2 + (xy) 2 - 0 , whence by formal reality of A, x 2 - 0 , y2 _ x 2 - 0, so t h a t x , y , z - O. We can show as above t h a t the condition "z 2 - 0 ~ z - 0" is sufficient to conclude t h a t A contains no non-zero n i l p o t e n t element. N
1 . 6 . 2 0 . PROPOSITION. ( a ) T h e complexification n of a commutative real division algebra A is a division algebra iff A is formally real. (b) Every commutative real division algebra which is not formally real has complex structure. PROOF. (a) Suppose t h a t A is formally real. If z E A , z x + i y ~ 0 t h e n by formal reality of A, x 2+y2 _~ 0 and so invertible (since A is a division algebra). Since we have
z2-
2z - x 2 + y 2
by 1.1.30, z is invertible and A is a division algebra. Conversely, suppose t h a t A is a division algebra and for some x , y c A we have x 2 + y2 _ 0. Then, writing z - x + iy we get ,v
z2 - x 2 § y2 _ O, ,v
so t h a t z - 0, since A is a d i v i s i o n algebra. Thus, x - y - 0 and A is formally real. (b) Since A is not formally real there exist in it elements x , y -/= 0 with x 2 + y2 _ 0. Writing j - y x - 1 - x - l y , we get e + j2 _ 0, or j2 _ --e. Therefore, by 1.6.3, A has complex structure. 1 . 6 . 2 1 . LEMMA. If A is a commutative formally real algebra and M a m a x i m a l regular ideal, than the quotient A # - A I M is formally real. PROOF. If x #2 + y#2 _ 0 # then x 2 + y2 _ M c h:/, where h~/ is the complexification of M ; M is also m a x i m a l regular. Since (x + iv)(
- iv) -
+
e
Algebraic Preliminaries
52 ,v
N
M is prime (by 1.5.9, 1.5.10 (a)) and M conclude t h a t x -t- iy E M , whence
is self-conjugate we
N
x , y E M , x # - 0 # , y # - 0 #, proving A # is formally real.
w 7.
Spectrum
and
Quasi-spectrum
1.7.1. DEFINITION. Let A be a unital algebra over a field F. For x c A set
aA(X) - {)~ E F " x -
Xe is not invertible }
where e is the unity of A. The set a(x) - aA(x) of scalars is called the spectrum of x and its set-complement p(x) - F \ a ( x ) the resolvent set of x ; a ( x ) or p(x) can be empty. 1.7.2. LEMMA. Let A be a unital algebra. If x E A is invertible, then either a(x) - a ( x -1) - q}, or a(x) ~ 0 and
~7(X-1) -- {X -1 9X C 6r(x)). PROOF. Since x and (hence) x -1 are invertible we have 0 c p(x), 0 e p(x-1). If A(~ 0) e p(x) then there is a y such t h a t
This can be rewritten as y(--~X)(X
-1
--
,~-le)-
e-
(X - 1 -
,~-le)(--)~x)y
which shows that x-1 _ )~-1 e has a 1. inverse as well as a r. inverse and hence (by 1.1.4)it is invertible. Thus )~-1 e p(x-1). Further, since ( x - l ) -1 - x we conclude t h a t
o) c p(:)
x-' e p(:-i).
The l e m m a now follows by passing to the set-complements of p ( x ) , p ( x -1) in F. 1.7.3. PROPOSITION. Let A be a unital algebra over F with e as its unity and x E A be such that a(x) r ~. Then:
w 7. Spectrum and Quasi-spectrum
53
(i) o(0) - {0}; (ii) a(e) - {1); (iii) a ( # x ) - # a ( x ) ( # E F); (iv) a ( # e + x) - # + a ( x ) , (# E F); (v) For any polynomial P over F, we have a ( p ( x ) ) D P ( a ( x ) ) t. (,) When F is algebraically closed - in particular, when F - C there is equality in (,), i.e. we have a(P(x)) - P(a(x)).
(**)
PROOF. Since 0 - Ae - -Ae is invertible for A ~= 0, and e-Ae( 1 - A)e is invertible for A J= 1 we obtain (i),(ii). For(iii), the identity # x - Ae - #(x - # - l A e ) , (# ~= 0, A e F) shows that A E a ( # x ) iff ~ - l x E a(x). Also, if p - 0, (iii) follows from (i). Thus we have (iii). Next, (iv) follows from the identity
It remains to prove(v). If P - ~0 is a constant polynomial then (.) holds since both sides reduce to {c~0}. Next assume that P is nonconstant. If A E a(x) then y - x - Ae is not invertible. So, by 1.2.12 (iii), one at least of Ay, y A ~ A, whence there is a 1. or r. ideal J ( - - A y o r y A ) with y E J, J - f l A . If P ( x ) - o~,~xn §
and
§ o~oe (oq E F)
z k -- xk-1 nL AX k-2 ~_...-4- A k - l e ,
then x k _ )~ke - - ( x - - Ae)zk -- yzk -- zky E J, w h e r e y - x - A e ,
so that n
P(x)-
P(A)e - ~
c~k(x k - Ake) e J.
k--1
t We write P(~r(x)) for {P(A)" A E a(x)}
Algebraic Preliminaries
54
Since J # A, P ( x ) - P(A)e is not invertible and P(A) E a(P(x)), proving (.). Assume now that F is algebraically closed and that P -P(X) is a polynomial of degree n > 0, over F. Then we have the factorization P ( X ) - ~ - ( ~ ( X - # 1 ) " " ( X - #n), where cz, #j E F and ~j are the zeros of the polynomial P - )~. It follows that P ( # j ) - A ( j - 1 , - . . , n). Further we have the factorization
y - P(x) - )~e- a ( x - # l e ) ' " ( x - #he). If A C a(P(x)), y is not invertible, whence by virtue of 1.1.30, some x - #ke is not invertible. It follows that ttk E a(x) and - P ( # k ) e P(a(x)). Thus, a(P(x)) c_ P(a(x)). Combining this with (.) we get (**). It remains to deal with the case where deg P - 0. In this case, if P(X) - c~o (say), (**) holds since as noted in the proof of the first assertion in (v), each side of (**) reduces to {c~0}. 1.7.4.
LEMMA. Let A be unital, with unity e, and x E A .
Then )k(# O) E if(x) iff -,~-lx i8 not q. invertible PROOF. The identity X - ~e -- - - ) ~ ( e - )~-lx)
(X E A, )~ E F,)~ # 0)
and 1.1.20 show that A E p(x) iff - A - i x is q. invertible. The required result now follows (by taking the negation of the statements on both sides of "iff"). 1.7.5. DEFINITION. Let A be an algebra over F, not necessarily without a unity, and A1 its unitization. For x E A we write a' (x) -- alA (X) -- aA~ (x) and call a'(x) the quasi-spectrum of x; its complement p'(x) -
is called the quasi-resolvent set of x. 1.7.6.
LEMMA.
0
e A,
that
always nonempty PROOF. If possible let x have an inverse y + )~el (y E A,)~ E
55
w 7. Spectrum and Quasi-spectrum
F) in A1. T h e n el - x(y + Ael) - xy + Ax C A which is impossible. Hence 0 E aA~ (x) - a'(x). 1.7.7. PROPOSITION. ( i ) o " ( 0 ) - O; ( i i ) a ' ( # x ) #a'(x)(# E F); (iii) If P is a constant-free polynomial over F then
D with the inclusion relation becoming equality when braically closed, so that then
F
is alge-
a'(P(x)) - P(a'(x)). PROOF. These follow from 1.7.3 since for any element a in A we have a ' ( a ) - aA~(a). 1.7.8.
LEMMA (Kaplansky).
Let A
be an algebra x E A.
PROOF. Since X - Ael -- --A(el -- A - i x )
r o)
where el is the unity of the unitization A1 of A, we obtain: x(el
Ael is not invertible in A1 -
)~-lx) is not invertible in A1
- A - i x is not q. invertible in A1 (by 1.1.20) - A - i x is not q. invertible in A (by 1.1.21). 1.7.9. COROLLARY. If u ~ 0 is an idempotent then a'(u) {0,1}. Further, if A is unital, with unity e, and u 7s O,e then a(u) -- {0, 1}. PROOF. The first s t a t e m e n t follows from 1.7.8, 1.1.26 (i). For the second we note t h a t by (**) of 1.7.21, we have a(u) U { o } - a'(u) - {0, 1}. If 0 r a(u) then u is invertible and since u 2 - u we get u - e, contradicting the assumption on u. Thus 0 E a(u), a(u) - g ( u ) U { 0 }
- g'(u) - {0,1}.
56
Algebraic Preliminaries
1.7.10. LEMMA. If u is a relative unity for a regular I. or r. ideal I ~ A then 1 E al(u). PROOF. By 1.2.9 (ii) - u is not q. invertible, whence by 1.7.8, 1 C a'(u). 1.7.11. COROLLARY. If X is any character of A and x E A th n x(x) e PROOF. Since always 0 E a'(x) we may assume that X ( x ) = A -r 0. Then X(A-lx) - 1, so that by 1.3.10, u - A - i x is a relative (bi-) unity of M• whence by 1.7.10, 1 E a ' ( u ) - a ' ( A - l x ) A-la'(x), so that A E a'(x). 1.7.12. LEMMA. q.i. x ~. Then a'(x') -
A s s u m e that x E A is q. invertible with
A a~ } l § A " A E (x) .
o PROOF. First note that 0 E a~(x) and 1+o -- 0 E Since x is q. invertible, by 1.7.8, - 1 r a(x). For A r 0 we have the (easily verifiable) identity:
X' o(--,~-lx)-- (--)~-lx)oX ' : It follows, by 1.7.8 and 1.1.30, that - ~ ~ completing the proof.
~I +XA
I.
E a ~(x) iff A E a ~(x),
1.7.13. D E F I N I T I O N . An element x in A is called quasinilpotent or q. nilpotent if a'(x) -- {0}. The set of q. nilpotent elements of A is denoted by Aqn;O E A q" (by 1.7.7 (i)).
1.7.14. R e m a r k . In the algebra M n ( F ) of all n • matrices over a field F, a q. nilpotent element is nothing but a nilpotent matrix. This is a consequence of the fact that a matrix is nilpotent iff all its eiginvalues are 0. 1.7.15. PROPOSITION. Let A be an algebra. Then: (i) An element x in A is q. nilpotent iff Ax is q. invertible for every A c F, in particular, a q. nilpotent element is q. invertible.
57
w 7. Spectrum and Quasi-spectrum
(ii) A nilpotent or essentially nilpotent element is q. nilpotent. (iii) x ~ c A q'~ c ~'-A. PROOF. (i) This follows from 1.7.8, 1.7.13. (ii) If x is nilpotent so is Ax, and hence by 1.1.23, Ax is q. invertible, whence by (i), x is q. nilpotent. Again, if x is essentially nilpotent then by definition x E x/~, and hence also Ax e v/A, Ax is q. invertible (by 1.2.24 (a)) so that by (i) x is q. nilpotent. (iii) The first inclusion follows from (ii). For the second, we note that if x e A qn, f f ' ( x ) - {0}. If X e A, X(x) e a'(x) (by 1.7.11) so that X(x) - O, whence x e ~'-A. 1.7.16. R e m a r k . Every element of a radical algebra A (A = v/A) is q. nilpotent, so that A - A an. On the other hand, in the one-dimensional algebra F, 0 is the only q. nilpotent element (since, by 1.7.20, a'(A) = a(A)U{O} = {A, 0}). 1.7.17.
An algebra A is called quasi-semiif 0 is the only q. nilpotent element of A, i.e.
DEFINITION.
simple or q.s.s, A q n : {0}.
1.7.18. R e m a r k . In view of 1.7.15 (iii), every q.s.s, algebra is s.s. Note that the matrix algebra M , ( F ) is s.s. (actually simple) but not q.s.s, when n /> 2 (since there are non-zero nilpotent matrices in M,~(F), n/> 2). 1.7.19. LEMMA. Let A , B be algebras (over the same field), ~ : A--~ B a h o m o m o r p h i s m and x E A. Then we have: C
PA( ) C whenever A , B unity of A.
C
(*)
C
(**)
are unital and B has as unity ~(e),
PROOF. If A E p~A(X) then - A - i x 1.1.24, _
e being the
is q. invertible and so by
58
Algebraic Preliminaries
is q. invertible, so t h a t A E p~B(~(x)). clusion relation in (,) and the second complements of both sides in F. For proving (**), we observe that in (,) of 1.7.21, the first conclusion in as
This proves the first inone follows by taking setby using the first relation (,) above can be written
(,')
p~(=)\{0} c p . ( ~ ( = ) ) \ { 0 }
If 0 E pA(x), x is invertible and then ~p(x) is also invertible, and 0 E PB(P(=)). The inclusions in (**) now readily follow from
(,')
1.7.20. COROLLARY. Let A be a subalgebra of an algebra B and x E A. Then we have:
p~(~) c p~(~); ~(~) c ~ ( ~ )
(,)
p~(x) c p,(x); ~.(x) c_ ~(x)
(**)
whenever B is unital and A is a subunital t algebra of B. PROOF. This follows from 1.7.19 by taking ~ to be the inclusion map A --~ B. 1.7.21. PROPOSITION. If A is a unital algebra over F and x c A, then: p'(x) = p(x)\{0}; (,)
~,(~)
-
(**)
~(~)U{o}.
PROOF. Let A1 be the unitization of A and el,e the unities of A1, A respectively. If A E PAl (x) then for some y E A, # E F we have the equations (X-)lel)(y-~-
~ e l ) -- e I -- (y-~- ~ e l ) ( X -
)lel).
(1)
Multiplying the terms in (1) by e from the left and then by from the right we obtain
( x - ~ ) ( y + ~ ) - ~ - (y + ~ ) ( ~ - ~ ) It follows from (2) that A C pA(x). Thus, i.e. if e is the unity of B
then
eEt.
(2)
w 7. Spectrum and Quasi-spectrum
59
p'(~) - p~, (~) c p~(z) - p(~). On the other hand, if A E pA(X),A :/: 0 then since X- )~e- --)i(e- )i-lx), - - ~ - l x is q. invertible in A and hence also in A1, whence A E p~(x). Further 0 ~ PA~(X), for otherwise either of the equations (1) with A = 0 shows that el c A, which is impossible. This completes the proof of (,), and (**) follows from (,) by taking set-complements in F.
1.7.22. PROPOSITION. Let x , y be elements of an algebra A. Then we have
~' (xy) - ~' (y~), ~(xy) U { 0 } - ~ ( y x ) U { 0 }
(,)
(,.1
whenever A is unital. PROOF. First assume that A is unital with unity e. If A E a(xy), A ~ 0 then x y - Ae, and hence also ()~-lx)y -- r -- - - ( r
(~-lx)y)
is not invertible. By 1.1.28 (ii), 1.1.14 (c), - ( e - y(A-lx)) y A - l x - e is not invertible, so that A E a(yx). Thus
r
U{o} c r
Interchanging x, y we get the reverse inclusion. By combining the two inclusions we obtain (**). To obtain (.) it is enough to apply (**) to the unitization A1 of A (remember that for any a E A, Oca'(a)). 1.7.23. LEMMA. Let A be a unital algebra (over F) with unity e, and X a linear functional on A such that x(e) - 1. Then the following conditions are equivalent
(i)
Every element x E ker X is not invertible, or equivalently, X(x) # 0 for every invertible element x.
(ii) X(x) c r
Algebraic Preliminaries
60
PROOF. (i) => (ii). If X ( X ) = , ~ t h e n x - ) ~ e E k e r x - J : A, whence it is not invertible, so t h a t )~ E a(x). (ii) ~ (i). If x c k e r x t h e n 0 = X(x)C_ a(x), whence x is not invertible. 1 . 7 . 2 4 . LEMMA. Let A be a unital algebra and X a character
of A. Then X(x) e a(x) (x e A). PROOF. If X(x) -- )~ t h e n x - l e C k e r x = M r therefore x - l e is not invertible, and so I E a(x).
A and
a E A and ~ E F. If there is a non-zero element b E A such that a b - lb, then I E al(a). 1.7.25.
LEMMA. Suppose that A is an algebra over F,
PROOF. In the unitization A1 of A the above condition can be r e w r i t t e n as (a - )~el)b = 0. Since b r 0, a - )~el is not invertible and consequently )~ E al(a).
1.7.26.
Let A be an algebra and a E A.
PROPOSITION.
Then we have: (i)
The double commutant Ao = {a}" is a commutative subalgebra of A containing a such that alAo(a) - alA(a).
(*)
(ii) If Am = Am(a) is a maximal commutative subalgebra of A,
containing a then alAm (a) -- alA (a).
(**)
(iii) If A is unital with unity e then =
(~ ~*)
PROOF. First let A have a unity e. By 1.1.8 (vi), A0 is a c o m m u t a t i v e s u b a l g e b r a and clearly e E A0. If a - l e has an inverse b in A then by 1.1.18 b ~-~ { a -
)~e}' - {a}', whence b E {a}" - A0.
w8. Extended Spectrum and Extended Quasi-spectrum
61
Therefore p A ( a ) C PAo(a), so t h a t by (**) of 1.7.20, p A ( a ) - PAo(a). Also, we have (see 1.1.9) Ao C Am C A. It follows (using 1.7.20) t h a t p A ( a ) = PAre(a)- pA(a). Therefore, by taking setc o m p l e m e n t s in F we obtain (, 9 ,). Next let A be non-unital. By applying, ( , , ,) to the subalzebras (A0)l - Ao + Fei, (Am)l -- Am + Fel of the unitization A1 of A we obtain (.) and (**). 1.7.27. PROPOSITION. Let A q. inverse closed t subalgebra of A. Then
~,;(=) -
,,'~(x)
be an algebra and B
a
(= e B)
Similarly, if A is unital and B a inverse closed subunital algebra of A then
o.(=)-
~,A(x)
(= e .4).
PROOF. The first assertion follows from 1.7.8, B being q. inverse closed in A. The second is a consequence of B being inverse closed in A and the definition of the spectrum.
w8.
Extended
Spectrum
and Extended
Quasi-spectrum N
1.8.1. DEFINITION. Let A be a unital real algebra, A its complexification and x c A. We write
~(=)- ~ ( x ) - ~(=) and call 5(x) the extended spectrum of x. Similarly, writing 5'(x) - a(~)l(x), where (A)I denotes the unitization of A, we call 5'(x) the extended quasi-spectrum of x; its set-complement fi'(x) - K\5'(x) is called the extended quasi-resolvent set of x. 1.8.2. LEMMA. If A is a real algebra and x E A then
~'~(~) - ~'~(~) N ~.
(,)
t A subalgebra (respy. subunital algebra) B of A is called q. inverse (respy. inverse) closed if for ~ny x 6 B, the q. inverse x' (respy. inverse z -1) of x in A exists ==~x' (respy. x -1) 6 B .
62
Algebraic Preliminaries
If A is unital we have also -
(**)
a,,
In particular, a~A(X) C 5~A(X), aA(X) C_ 5A(X). ~ PROOF. We have A(# 0) e a~A(X)["l~a ,I i ( z ) A R
iff - A -
1 x
is not q. invertible in ,a iff - A - i x is not q. invertible in A iff Ac r This prove (,) (since '0' clearly belongs to both sides of (,)). The equality (**) follows by applying (,) to A1 and using 1.7.21. 1.8.3. PROPOSITION. Let A be a real algebra and x E A. Then 5'(x) is a s y m m e t r i c t subset of C; also when A is unital, 5(x) is symmetric. PROOF. We have
~(~ # 0) e a'(~)
i~
- A - i x is not q. invertible in
iff
( A_lx )
~
~
~-1
X
is not q. invertible in .~i (see 1.6.7.) iff
i e a'(~), N
and 0 - 0, where bar denotes the conjugation in A (see 1.6.4). Thus 5 ' ( x ) i s symmetric. The s y m m e t r y of 5 ( x ) i s an i m m e d i a t e consequence of (**) of 1.7.21 and the s y m m e t r y of 5'(x). ~
1.8.4. PROPOSITION. Let A be a real algebra, A its complexification, and x E A. Then: N
(i) If ~ - ~ + iZ # 0 (~, Z c ~), _ ~ - 1 x is q. in vertible in A iff z2-2a* is q. invertible in A I~l N
(ii) If A is unital with unity e, then x - Ae is invertible in A iff (x - ae) 2 + fl2e is invertible in A. PROOF. Write z -- - A~- i x ; then 2. - - A - i x where bar denotes the conjugation in A. By 1.6.7, z is q. invertible iff 2 is q. invertible. Since z +-+ ~,, by 1.1.30, z o 2 is q. invertible iff z (hence 2) is q. invertible. Since } Asubset S of C is said to be symmetric if )~ES :=>~ES, where denotes the complex conjugate of ~.
8. Extended Spectrum and Extended Quasi-spectrum
63
x 2 - 2ax z
o
z
w
I;~12
(i) follows. The result (ii) can be proved similarly by using the identity (~ - . ~ ) ( x - ~ ) - ( ~ - o,~)~ + / ~ and 1.1.30. 1.8.5. COROLLARY. If A - a + ifl(a, fl E ~), A # 0 then c ~'(x) i g ~ - (x ~ - 2 . x ) ( . ~ + Z~)-I i~ ~ot q. i~v~rtibl~ i~ A. Similarly, when A is unital, A E 5(x) iff y is not q. invertible in A, and O E h ( x ) iff x is not invertible in A.
PROOF. The first assertion is an immediate consequence of 1.8.4 (i). Since 5'(x) - 5(x) U{0} the second assertion follows from the first together with the observation that if x is not invertible in A it is also not invertible in A ((Xl + i y l ) x - e X(Xl -+-iyl) ~ X l X - e - XXl, where X, Xl, Yl E A). 1.8.6. PROPOSITION. (Rickart). Let A be a complex algebra and A [~] denote A as a real algebra. Then, for x E A, we have
where bar denotes complex conjugation.
PROOF. We denote the general element of A[~] by x + j y , where j2 _ - 1 ; x l , y E A[R] - A (as a set). By 1.6.10, if x E A A [~] has a q.i. in A[~], it has also a q.i. in A. So, by 1.7.8, a~A(X) C 5AI~I(x ) and hence by 1.8.3. ~'A(:) C
-' aA[~] (x).
To complete the proof it is enogh to show that
~-~,E.~(x) ___~;.(~)U o-~(~). Suppose that
.,, r 4,(x)U,,-~(:),
# __ _ ~ - 1 .
64
Algebraic P r e l i m i n a r i e s
Then # x , p x
are q. invertible. Write (#X)'
if # - - / + i a
-- y,
(-/,acR),
(/~X)' -- Yl"
then in Ale] we have # x - "Ix - j a x .
# x - .ix + j a x ,
It follows from 1.6.8 that we have (")'X)' -- ( ~ X ) '
-- y -
(~X)'
-- Yl.
Therefore # x - y' - yl1 - p x , whence a - 0, # - ~/. Thus #x - ~/x E A [~] - A,
(#x) ~ - y E A
so t h a t #x is q. invertible in A. It follows t h a t ,~ E ~A[~], completing the proof. 1 . 8 . 7 . DEFINITION. An element x of a real algebra A is called e x t e n d e d q u a s i - n i l p o t e n t or ext. q. n i l p o t e n t if 8 A ( X ) -- {0}, i.e. if x is q. nilpotent in A. N
1.8.8. R e m a r k . By (**) 1.8.2, every ext. q. nilpotent element is q. nilpotent. On the other hand, in the real algebra A - C [a], the element i is q. nilpotent but not ext. q. n i l p o t e n t . For, a~4(i) - aA(i) U{0} -- {0} since aA(i) -- {~ ( i - - ce being invertible in A for every real a}. But, by 1.8.7,
ab,(i) - 4 (i) O 4 (i) -
{o, +i}.
1.8.9. LEMMA. L e t A be a real algebra. T h e n every e l e m e n t of x / A
is ext. q. n i l p o t e n t .
PROOF. Take x E x / ~ and let ) ~ - a + i / ~ # 0 . Then, x/A being a bi-ideal, we have y - (x ~ - 2 a x ) ( a 2 +/~2)-1 e v/-A, so t h a t y is q. invertible. It follows from 1.8.5 t h a t A ~ 5~(x), whence 5'(x) - {0}, as desired. 1 . 8 . 1 0 . DEFINITION. Let A be an algebra over K and x E A. The spectral radius r(x) is defined by
r(x) - r A ( m ) - sup{{AI" A ~ ,r'(m)}.
w8. Extended Spectrum and Extended Quasi-spectrum
65
If A is unital and a(x) :/: 0 then we also have
r(x)
-
-
sup(l~Xl 9 tx c ~ ( x ) } .
Similarly, we have the extended spectral radius ~(*) - s u p { l ~ x l
,x c ~ ' ( ~ ) }
for an element x of a real algebra A. When A is unital and 5(x) ::/: 0 we have ~(x) - sup{],x I 9 A ~ a ( x ) } .
1.8.11. R e m a r k .
Clearly we have the inequalities"
0 <~ r(x) <~c~; r(x)<~ ~(x). 1.8.12.
LEMMA. Let A be an algebra over K, and x E A.
Then" (i) r(0) - 0. (ii) r(#x) - I # l r ( x ) ( # E K); in particular, r ( - x ) - r(x). (iii) r(x '~) - r ( x ) " ,
provided A is a complex algebra.
(iv) If u ~ 0 is an idempotent of A then r(u) - 1; in particular, r(~)- ~ ( ~h~,~, ~ i t y ~ ~i~t~) (v) r(xy) - r(yx)
(x, y c A).
P r o o f . ( i ) B y 1.7.7 (i), a ' ( 0 ) - 0
so that r ( 0 ) - 0.
(ii) By 1.7.7 (ii), a ' ( # x ) - #a'(x) and hence the result. (iii) By 1.7.7 (iii), a'(x n) -[a'(x)] n, hence the result. (iv) By 1.7.9, a ' ( u ) - {0, 1}, whence the result. (v) An immediate consequence of (,) of 1.7.22. 1.8.13.
DEFINITION.
Let A be a unital complex algebra
66
Algebraic Preliminaries
with unity e. A is called a Liouville algebrat if for every element xEA, x r Ce, r ( x ) - o c . If A has no unity then A is called a Liouville algebra if for every x =fi 0, r(x) - c~. 1 . 8 . 1 4 . EXAMPLE. The algebra A - C[X] of all complex polynomials is a Liouville algebra. Here if x E A, x r Ce then
~(x)
-
c, r(x)
~.
-
1 . 8 . 1 5 . PROPOSITION. in particular s.s..
Every Liouville algebra A is q.s.s.,
PROOF. If A is unital and x ~ Ce then r ( x ) - o c and x is not q. nilpotent. Also, if x - Ae, a(x) - {A} and r(x) - 0 A 0. Thus A is q.s.s.. When A is not unital, by definition of the Liouville algebra, if x ~= 0, r(x) - oc and so x is not q. nilpotent. Thus A is q.s.s. 1 . 8 . 1 6 . PROPOSITION. Let A be a unital algebra over K such that the spectrum a(x) of every element x of A is nonempty and bounded. Then the Heisenberg commutator equation Ix, y] -- x y ha~ ~o ~ol~tio~, for ~ y
y x -- #e
(e-
unity of A)
, e K\{0}.
PROOF. Suppose, to the contrary, there are elements x, y E A with x y -- y x § #e for some #. It follows t h a t
~(xy) - ~(y~ + ~ ) - , + ~ ( ~ x )
(1)
By 1.7.22, we have
o-(~y) U{o} - o-(y~)U{o}.
(2)
From (1), (2) we obtain
(3) t This notion appears to have been first studied by Birtel [5~].
w9. Strictly Real Algebra
67
If 0 E a(yx) then (2)becomes (4) It follows that By repeatedly using ( 4 ) w e get n# c a(yx)(n >1 1). But this contradicts the boundedness of a(yx) since I n # [ - nlit[ --. oo (as n --. c~). Therefore 0 ~ a(yx). By a similar argument (with x,y interchanged and It replaced by - i t ) we also get 0 ~ a(xy). Thus, the equation (2) becomes just
(2') So (1) can be rewritten as (1') Since a(xy)7s 0 there is a A(~= 0) in a(xy). Then, by (1'), # + A E a(xy). Once again by (1'),
and so on. Thus, nit + A E a(xy) for all n >/0. Since
once again we are led to contradict the boundedness of a(xy). Thus the Heisenberg equation has no solutions as asserted. 1.8.17. R e m a r k . The result 1.8.16 is an algebraic generalization of the well-known fact that the Heisenberg commutation relation of quantum mechanics" p Q _ Qp _ 2~ri h ( h denoting Planck's constant) has no bounded operator solution.
w9.
Strictly
Real Algebras
1.9.1. DEFINITION. An element x of a real algebra A is called strictly real if its extended quasi-spectrum is real: ~ ( x ) ___~; by 1.8.2, this condition is equivalent to" ~ ' ( x ) - a'(x).
68
Algebraic Preliminaries
If A is unital the "strictly real" condition can also be stated as" 5(x) c_ R, or, 5(x) - a(x). An algebra A is called strictly real if all its elements are strictly real. 1.9.2. R e m a r k . In any real algebra A the element 0 or more generally, a nilpotent element x is strictly real (by 1.7.15 (ii), x is q. nilpotent in A, so a AI ( x ) (0}). Again, if A is unital with unity e, the elements )~e()~ E ~) are strictly real
1.9.3. PROPOSITION. (a) Every real radical algebra A - in particular real algebra Ao with trivial multiplication - is strictly real. (b) Ao is not formally real. PROOF. (a) Recall that every element a of a radical algebra is q. invertible (cf. 1.2.27). It follows from 1.8.4 (i), 1.7.8 that 5~A(X)- {0}, whence A is strictly real. (b) This follows from 1.6.19 since every element of A0 is nilpotent. 1.9.4. R e m a r k . In A0 we have an example of a strictly real algebra which is not formally real. 1.9.5. LEMMA. The unitization A1 of a real algebra A is strictly real iff A is strictly real. PROOF. If A is strictly real, and xl E A1, xl -- ~e + x (x E A , ~ E R) then 5(X1) -- (~(Ae + X) -~ A + 5(X) C ~ (since 5(x) C_ ~, A E ~), proving A1 is strictly real. Conversely, if A1 is strictly real and x E A we have _
,
which proves that A is strictly real. 1.9.6. PROPOSITION. A real algebra A is strictly real iff for any x E A, x 2 is q. invertible. PROOF.
Suppose that A is strictly real.
By 1.9.5 A1 is
w9. Strictly Real Algebra
69
strictly real, whence -
It follows t h a t
c
~'(x 2) - - a ( ~ i ) x ( x 2) - - a ( ~ ) x ( x ) 2 > ~ t 0 ,
- 1 ~ ~(x2), so t h a t x 2 is q. (by 1.6.10 (ii)). Conversely, suppose t h a t A A. We have to show t h a t ~'(x) a n u m b e r a + i f l with / 3 ~ - 0
whence
invertible in A and so also in A satisfies t h a t condition for all x in _c ~. If possible let ~'(x) contain ( a , / 3 E ~ ) . Write
Y _ ( a x 2 _ (c2 _ fl3)x)/fl(c 2 + f12); then y E A. By 1.7.7 (iii), k'(y) ~ {c~(a + i/3) 2 - (a2 _ f12)( a + ifl)}/~(o~2 + f12) _ i, so t h a t ~,(y2) ~ i 2 _ - 1 . It follows t h a t y2 is not q. invertible in A and so also not q. invertible in A, contradicting our supposition on A. Thus, ~ ( x ) c _ R, as desired. 1 . 9 . 7 . COROLLARY. Let A be unital with unity e. Then A is strictly real iff for each x E A, e + x 2 is invertible. ?? PROOF. This is an immediate consequence of 1.1.20 and 1.9.6. 1.9.8.
COROLLARY.
Every epimorphic image of a strictly real
algebra is strictly real. PROOF. An i m m e d i a t e consequence of 1.1.24 and 1.9.6. 1 . 9 . 9 . GELFAND'S EXAMPLE OF A NON-STRICTLY REAL ALGEBRA The algebra consists of all real-valued functions f = f ( t ) on [ - 1 , 1] which are holomorphically extendable to the closed unit disc. It is not strictly real since the function 1/(t 2 + 1) does not belong to the algebra, as its analytic extension 1/(z 2 + 1) has poles at ~ i . t i.e. if .~E~'(x 2) then ~>~0. tt The condition "e+x 2 is invertible for all x E A" was used by Gelfand [7 ~, p.147] to define the notion of strict reality for unital commutative real Banach algebras; strictly real Banach algebras were called by him just real Banach algebras.
Algebraic Preliminaries
70
1.9.10. Remark. The algebra in 1.9.9 is however formally real (see 1.6.18). Thus we have here an example of a formally real algebra which is not strictly real (cf. 1.9.4). 1 . 9 . 1 1 . LEMMA. Let Am be a maximal commutative subalgebra of a strictly real algebra. Then Am is strictly real. PROOF. If x C Am C A. By 1.1.19, (x2) ~ E A m , whence x 2 is q. invertible in Am, Am is strictly real. 1.9.12. Remark. A real algebra A which has a complex s t r u c t u r e is not strictly real. To see this, we may assume, by 1.9.5, t h a t A is unital. Since a -- e §
(ie) 2 -- 0,
(.)
a is not invertible and so by 1.9.7, A is not strictly real. Thus in particular C as a real algebra is not strictly real. The relation (.) also shows t h a t the real algebra H of Hamilton quaternions is not strictly real (note here however t h a t H has no complex structure). 1 . 9 . 1 3 . PROPOSITION. Every strictly real q.s.s, algebra A is formally real. PROOF. Then
For, suppose t h a t x 2 + y2 = 0 (x, y E A). !
! -
(,)
By strict reality, a ,i ( x2 ) - aA, ( x ) 2 >/ 0, aA, ( y 2 ) >/ 0. It follows from (.) t h a t t a~(x)
2
t -- a~(y)
2
-- O, whence
I r a~A(X) -- aA(x) -- O,a~A(y) -- aX(y) -- O. Since A is q.s.s, we m u s t have x = y = O, proving t h a t A is formally real.
1 . 9 . 1 4 . PROPOSITION. A formally real division algebra is strictly real. Conversely, a strictly real commutative division algebra is formally real. PROOF. Let A be a formally real division algebra and x E A. Then by formal reality e + x 2 = e 2 + x 2 r 0, whence it is invertible. So, by 1.9.7, A is strictly real.
71
w9. Strictly Real Algebra
Suppose now t h a t A is a strictly real c o m m u t a t i v e division algebra and x, y E A , x2+y2-0. If x - ~ 0 then we have e + x-2y
2 -
e +
(x-ly) 2 - 0 ,
contradicting strict reality. Therefore x = 0 and similarly y = 0. Thus A is formally real. 1 . 9 . 1 5 . PROPOSITION. (Kaplansky [8', p.405]). A primitive strictly real algebra A is a division algebra. PROOF. Since A is primitive there is a m a x i m a l regular 1. ideal Mz with (Mz: A ) = {0} (see 1.5.4). Then X = A / M z is a faithful A - m o d u l e (see 1.5.15) which is further irreducible (by 1.5.16 (ii)). By 1.5.19 we have the division algebra P = P ( X ) . Denote by dim X the dimension of X as a linear space over P. If dim X > 1 there are two P - i n d e p e n d e n t vectors x, y E X. By density t h e o r e m (1.5.21) there is an a E A with ax = y, ay = - x . Then a2x = ay = - x . Since A is strictly real, a 2 has a q.i. b : a 2 + b + ba 2 = 0. It follows t h a t a2 x + bx + ba2x - O, i.e. - x + bx - bx - O,
i.e. x - 0-impossible. So dim X - 1 and X is a division algebra. Since X is a faithful A - m o d u l e , A is a division algebra. 1 . 9 . 1 6 . PROPOSITION. Let A be a strictly real algebra and its complezification. Then" (i) If i r A is a regular I. (respy. r.) ideal of A then I is a regular I. (respy. r.) ideal of A with I # A.
Re 7
N
N
(ii) i f M
a maximal t. of A and M -- Re M then M is a m a x i m a l regular 1. (respy. r.) ideal of A, and M M § iM, MA ~ M ; in particular M is self-conjugate.
(iii) The correspondence M ~ M - M + i M is a bijection between the set of m a x i m a l regular I. (respy. r.) ideals of A and those of A. PROOF. (i) In view of 1.6.12 (iv) we have only to show t h a t [ =/= A. For this, by 1.6.13, it is enough to show t h a t I does N
Algebraic Preliminaries
72
not have any relative r. (respy. 1.)unity of the form iv (v e A). Suppose that I has a relative r. (respy. 1.)unity of the form iv. Then, by 1.2.8. ( b ) , - v 2 - (iv) 2 is a relative r. (respy. 1._)unity for 7. Since _T :fi A, by 1.2.9, v 2 is not q. invertible in A. On the other hand, since A is strictly real v 2 is q. invertible in A and so also in A. This contradiction proves that I has no relative unity of the form iv, and (so_) I ~ A. (ii) By 1.6.12 (iii), M c_ M + i M . Let ~ - u+iv (u, v E A) be a relative r. (respy. 1.)unity for M. By 1.6.12 (iv), u is a relative r. (respy. 1.)unity for M. Since, by (i), M :/: A, u r M whence u ~ M+iM, M+iM~ A, so that by maximality of M we have M - M + iM. By 1.6.12 (iii), M is self-conjugate. (iii) If M is a maximal regular 1. (respy. r.)ideal then by 1.6.12 (ii), M + i M is a maximal regular 1. (respy. r.)ideal of A. Also, by (ii) above, every maximal regular 1. (respy. r.)ideal of A is of the form M + iM. The bijection assertion in now clear. ,v
N
N
N
1.9.17. COROLLARY. Every maximal regular (l. orr.) ideal of
ft is self-conjugate.
Hence v / A is self-conjugate.
Also, x / ~ -
ANv PROOF. By 1.9.15 (ii), every maximal regular (1. or r.)ideal of A is of the form l ~ I - M + i M whence hT/ is self-conjugate. Since v//i - nhT/, x / ~ is self-conjugate. Finally,
- N M - NIA N
A NIN
AN N
1.9.18. PROPOSITION. Let A be a strictly real algebra A its complexification. Denote by A, A the set of characters of A, A respectively. Then the map X ~ ft, where fC is the canonical extension of X is a bijection between A and A. PROOF. In view of 1.6.14 (c), it is enough to prove that every character ~ of A is real. But this readily follows from 1.6.15 (b) and 1.9.17. N
CHAPTER TOPOLOQICAL
1.
Topological
II
PRELIMINARIES
Qroups
and
Linear
Spaces
2 . 1 . 1 . Recall first the notion of a poset. A set ~ t o g e t h e r w i t h an ordering relation <, between certain pairs of its elements, which is reflexive, transitive, and a n t i - s y m m e t r i c or p r o p e r (a ~< b, b -< a ==~ a - b) is called a poset (or partially ordered set). ~ is called directed (above) if for any ~, ~ E .4 there is a - / E ~q with Let S b e a s e t and ( x ~ ) ( c ~ e ~ ) a n e t i n S (i.e. x ~ e S for each c~ e .4, where .4 is a directed set) A net (x~,), ((~' e ~') in S is called a s u b n e t t o f a n e t ( x ~ ) i n S if ~q' _c ~ (so t h a t (x~,) is a subset of (x~)) and for each ~ e ~ there is an ~' e .4' w i t h c~ -< c~~. Let S be a topological space. A net (x~) in S is said to converge to x in S, in symbols x~ --~ x, if for any n e i g h b o u r h o o d U of x there is a ~ = f?(U) in .d such t h a t x~ E U for all c~ >/~ t t . It is clear t h a t if a net x~ ~ x then every s u b n e t x~, ~ x. F u r t h e r , in a Hausdorff space a convergent net has a unique limit, i.e., if x~ --~ x , y t h e n x - - y. (If x~ ~ x and y ~= x we can choose n e i g h b o u r h o o d s U, V of x, y respectively w i t h U n v = o. Since x~--~ x there is an c~0 such t h a t {x~ :c~ >- c~0} c U and so disjoint w i t h V, whence x~ ~ y (i.e. x~ does not converge
to S u p p o s e now a net (x~) in S does not converge to x : x ~ 74 x. T h e n there is a n e i g h b o u r h o o d U0 of x such t h a t for each c~ there is an a ~ w i t h a~> - a,x~, ~ Uo. The x~, as a varies clearly form a s u b n e t (x~,) which is disjoint with U0. It follows t h a t no s u b n e t of (x~,) converges to x. T h u s we have the following useful result:
(,)
9
subnet
of
subnet
t We have adopted a restricted definition for the subnet since that would suffice for our purposes. For a more general definition see [16,p.70]. tt i.e. p < ~ .
Topological Preliminaries
74
2.1.2. Remark. In t e r m s of net convergence the c o n t i n u i t y of a m a p f " S ~ S ~, where S, S t are topological spaces, can be expressed by the condition: x~ --. x in S ~ f ( x ~ ) ---. f ( x ) in S'. 2 . 1 . 3 . A group G t o g e t h e r w i t h a topology on it is called a topological group or T G if the m a p s rrt# . (x,y)e--+ x y , ~# " X--+ X - 1
(X,y E G)
are continuous. Any n e i g h b o u r h o o d of the identity e l e m e n t e of G is called a nucleus. If S is a subset of G we write S -1 - {a -1 9a C S}. We call S s y m m e t r i c if S -1 - S . Also, for two subsets $1,$2 of G we write S 1S 2 -- { a b 9a E S1, b E $2 }.
2 . 1 . 4 . PROPOSITION. Let G be a TG. Then" (i) The maps la " x ~ ax, ra " x ~ xa, i # 9x ~-~ X -1 where a, x c G, are h o m e o m o r p h i s m s . (ii) I f S is a subset of G and a E G then a S - a S , S a S a , S - 1 _ (-S)-I where bar denotes closure (iii) For any open subset 0 of G and subset S of G, O S S O are open. (iv) If U is an open nucleus t and a E G then aU, Ua are open neighbourhoods of a, and evey open neighbourhood of a has these f o r m s .
(v) If u an open (vi) W with W c_ U.
u
Y-
U N u -1
s y m m e t r i c nucleus such that V C U. A n y open nucleus U contains a s y m m e t r i c open nucleus W 2 C_ U. A n y such W has the property that its closure. Hence every T G is regular, tt
PROOF. (i) It follows from the definition of a T G t h a t la, ra,i # are continuous. Since la 1 - l~-~,la I is continuous and t i.e. a nucleus which is also an o p e n set. ~f A t o p o l o g i c a l space S is called regular if for every p o i n t s in S any n e i g h b o u r h o o d of s c o n t a i n s t h e closure of some n e i g h b o u r h o o d of s.
1. Topological Groups and Linear Spaces
75
hence la is a homeomorphism. Similarly ra is a homeomorphism. Finally, since (i#)2 _ 1 , i # - 1 _ i #, so t h a t i # is a homeomorphism. (ii) This is a consequence of (i). (iii) Since l~ is a h o m e o m o r p h i s m l~(O) - aO is open. Hence S O ~ Ua aO(a C S) is open. Similarly O S is open. (iv) These follow from the h o m e o m o r p h i s m property of the maps la, ra. (v) By h o m e o m o r p h i s m property of i #, U -1 is an open nucleus. Hence V is an open nucleus which moreover is clearly symmetric. (vi) The first assertion follows from the continuity of the m a p m # at ( 0 , 0 ) a n d (v). To prove the second assertion take an element b c W, where bar denotes closure. We must have W ~ b W ~ O, whence there are elements w, wl E W with w bwl Therefore b - ww I- 1 E W W - 1 - W 2 C__V. This proves t h a t W c V. It follows t h a t for any element a E G , a W - - a W c_ aU, whence G is regular. 2.1.5. L EMMA. Let G be a TG with identity element e Then" (i) ~ - {e} is the intersection of all nuclei of G and -~ is a normal subgroup of G. (ii) For x ~ G, ~ - x-~. (iii) G is T1 iff -~- e. PROOF. If U is any nucleus, by 2.1.4(vi) there is a nucleus W with W c U. Thus ~ c W _C U. If a r e there is a symmetric nucleus V with e ~ V a. Then a-1 ~ V, and so by s y m m e t r y of V, a ~ V. Therefore ~ is the intersection of all nuclei. If a, b E then ab E a - ~ - ae - ~ c__ ~,a -1 ~ ~-1 _ e-1 _ ~. Further, if x E G then x - l ~ x - x - l e x - - ~ . Thus ~ is a n o r m a l s u b g r o u p , completing the proof of (1). We have ~ - x--~- x~ which is (ii), and (iii)follows from (ii).
(-
2.1.6. LEMMA. A T1 group G is T3, in particular it is T2 Hausdorff ).
PROOF. By 2.1.4(vi), G is regular T1 and so T3 (by definition of T3). Suppose that a, b E G and a~=b. By T l - p r o p e r t y there is a neighbourhood V of a with b r V. By regularity choose
76
Topological Preliminaries
a neighbourhood Va of a with Va c_ V. Set V b - G\Va. Then Vb is a neighbourhood of b. Clearly, V a ~ V b - 0, whence G is 7'2. 2.1.7. THEOREM. (Birkhoff-Kakutani). Every first countable TG G admits a one-sided invariant (for multiplication) semimetric d which induces the topology of G. Further, the semimetric d is a metric iff G is Hausdorff. PROOF. See [21, pp.34-36]. 2.1.8. PROPOSITION. (Zelazko). Let G be a group endowed with a complete metric topology such that la, ra are continuous for each a c G. Then the map x ~-~ x -1 is continuous. PROOF. First we show that if a sequence Yn ~ e (in G) then y~l ~ e. For establishing this it is enough to show that (y,~) has a subsequence ( Y k - Ynk) such that y k - l ~ e (see 2.1.1). Define inductively the subsequence (Y-k-)of (y,) as follows. Set Yl - yl. Suppose that yi-,"" y---~ has been chosen such that
1
--1)
d(pr,Pr+l) < 2r+l,d(prY-s 1,pr+lys
1
< 2r+1
(1)
for r -- 1 , 2 , . . . , k 1, s - 1 , 2 , - . . , k , where Pr - y--i-'"y---r (product). Then we can choose Yk+l so that ( 1 ) i s s~tisfied for r -- 1 , - . . , k , s - 1 , . . . , k + 1. This choice is possible by taking nk+l sufficiently large, since there are only a finite number of inequalities to be satisfied, Yn ~ e, and multiplication on the left or right is continuous. From(l), by using the triangle inequality for d we obtain 1 ( 1 1 ) d(pr,pr+8) < 2,.+ 1 1 + ~ + ~ - ~ + . . .
2
1
d(pry21,pr+lY21) < 2 r
1 < 2~+1 = 2r ,
(2)
It follows by the completeness of d that Pk ~ P (say),
(3)
PkY-s 1 --~ qs (say).
(4)
77
w 1. Topological Groups and Linear Spaces
Then q~ -
lim PkY~-I -+oo
9 -
1
-
1
9
(5)
Further, by using (2),(3),(5), we get
d(p, pk) ~ 2 -k, d(qs,PkY~ 1 <~ 2-k) 9
(6)
It follows t h a t
d(p, qs) <~ d(p, psy-s 1) § d(qs,psy-s 1) - d(p, ps-1) + d(qs,psy-81) 1
1 - -
_
1
_
<~ 2s_ 1 -~ 2s
2s-2 '
whence q~ --+ p. Therefore, by (5), -Yk - 1 -- p-lqk ---~p - lp -- e. Next, if x,+ ---, x0 in G then XnXo 1 ~ e, so t h a t x o x n I ~(x,~xol) - 1 - - + e , whence x , l ~ x o 1. Thus the map x ~ x 1 is continuous, proving the proposition. 2.1.9. The letter D( will denote as before C or R. A linear space or LS X over K is called a topological linear space or TLS if X is equipped with a topology such that: (Wl) The m a p (x,y) ~ x + y of X x X ~ X is continuous. (W2) The m a p (A, x ) H Ax of N: • X --~ X is continuous. By taking A - - 1 in (T2) we obtain (T3) The m a p x~-~ - x is continuous. In terms of net convergence the continuity conditions (T1)(T3) can also be put in the forms: (TI~) If xa---,x,y/~---,y in X then x a + y / ~ x + y in X. (T2 ~) If As--+A in U(, and xf~ ~ x in X then A~xf~--+Ax (in X) ( T 3 ' ) If x ~ - - + x in X then - x ~ - x . In a TLS a neighbourhood of 0 is called a nucleus. 2 . 1 . 1 0 . LEMMA. For each A E K, the map x ~ A x ( x E X ) is continuous, and, for each A # 0 it is a homeomorphism. PROOF. The first half of the s t a t e m e n t follows from (T 2). For
Topological Preliminaries
78
the second half we observe t h a t if m~ denote the m a p x ~-~ )~x, then for )~ -/= 0, m~ 1 - m > - i and so m~ 1 is also continuous. 2 . 1 . 1 1 . R e m a r k . While every group G is a T G u n d e r either the discrete t or the i n d i s c r e t e t topology, a LS X (over N:) is a TLS u n d e r the indiscrete topology but not under the discrete 1 topology (if x J= 0 i n X t h e n ~x J= 0 and so lxn 74 0 - 0 . x , 1 0). though ~
Every n-dimensional Hausdorff TLS is linearly homeomorphic to K n. 2.1.12.
THEOREM (Tychnoff).
PROOF. See [14, p.13]. 2 . 1 . 1 3 . LEMMA. The underlying additive group of a TLS X is a TG. Further, O - {0} is a closed subspace of X . X is gausdorff iff {0} is closed. PROOF. The first s t a t e m e n t follows from (T 1), (T 3) of 2.1.9. For the second s t a t e m e n t we note t h a t , by 2.1.5(i), 0 is a closed subgroup. T h a t it is a subspace follows from the continuity of scalar multiplication ()~0 _ ) ~ 0 - 0). Finally, the last s t a t e m e n t follows from 2.1.5(iii), 2.1.6.
2.1.14.
LEMMA. Every TLS X
is path connected and hence
connected. PROOF. For x, y E X , { ( 1 - ) ~ ) x + ) ~ V " joining x and y.
0~<)~ ~< 1} is a p a t h
2 . 1 . 1 5 . A subset S of LS X is called symmetric if x c S => - x E S ( S - - S ) . It is called balanced if x E S,)~ E K, I)~l ~< 1 => )~x E S. Note t h a t a balanced set is s y m m e t r i c and t h a t if S is a balanced set and ]'~1 ~< I#l then ,~S tt _c # S ()~x ~ ( A p - 1 ) x , IA~ -1] ~< 1). A subset S is called absorbing if to each x c X there is a real n u m b e r e - e~ > 0 such t h a t )~x E S for all )~ w i t h 0 < I)~1 ~< e. Trivially the set X is absorbing; on the t The discrete topology on a set S is that in which every subset is open and the indiscrete topology that in which empty set and S are the only open subsets. ~t If S isasubset ofaLS X and ,~EN~ then , ~ S = { , ~ x ' x E S } .
w 1. Topological Groups and Linear Spaces
79
other hand (0} can never be absorbing (unlesss X - (0}). Also, if S is absorbing and a J: 0 then a S is absorbing (,~x E a S iff '9~ a - l z C S ) .
2.1.16. LEMMA. (i) The closure S (ii) Every nucleus (iii) Every nucleus
Let X be a TLS. Then" of a balanced set S in X is balanced. U is absorbing. U contains a balanced open nucleus as well as a balanced closed nucleus.
PROOF. (i) This follows from the inclusion AS _c AS. (ii) Since the map (A,x) ~ Ax is continuous at (0, x), there is an c > 0 and a neighbourhood x + V of x ( V a nucleus; cf.2.1.4(v)) such that for I)~I <~e and y e x + V we have ~y e V. In particular, Ax E U for I)~1 ~< e whence U is absorbing. (iii) From the continuity of the map (A, x)~+ )~x at (0,0)we obtain an c > 0 and an open nucleus V such that if ])~] ~ e and x c V then Ax e U. Write h~ - {A e K'I)~ I ~< e} and W - A~V. Since W U)~V, when )~ ranges in h e \ { 0 } , W is open (using 2.1.10 each AV is open). Further, if )~EAe,]#I ~< 1 and x E V then I#AI - I#IIAI ~< e. # A e he and #Ax e W , proving W is balanced. Also it is clear that 0 E W ___ U. Finally, by 2.1.4 (vi) there is a nucleus W1 with W1 __ U. By what has been just proved there is a balanced nucleus W2 _c W1. Then W2 c W1 _C U and W2 is balanced (by (i)). 2.1.17.
PROPOSITION. Every T L S X has a basis ~l of nuclei with the following properties" (i) Each U E LI is balanced and absorbing. (ii) If U1, U2 E ~I, there is a U3 E ~l with U3 c_ U i N U2. (iii) If U c Ll there is a V E ~l with V + V C V. (iv) If U E ~l and A C N there is a V E ~l with AV C_ U. Conversely, given a n o n e m p t y family Ll of subsets of a L S X such that ~l satisfies (i)-(iii), it determines a unique topology in X making it a T L S having ~l as a basis of nuclei. PROOF. See [28, p.96]. 2.1.18. Let X be a TLS and X0 a subspace of X. Then the quotient LS X # - X / X o {x§ x E X} carries a n a t u r a l
80
Topological Preliminaries
topology, viz., the quotient topology" a subset S # C X # is open iff ~ r - l ( s #) is open in X, where 7r is the canonical homomorphism x ~ x # - x + X 0 . 2.1.19. LEMMA. The quotient space X # is a T L S which is Hausdorff iff Xo is closed in X. The canonical map r is open and continuous. PROOF. By 2.1.17 we can choose a base ~/ of nuclei of X. Write L/# - { all subsets U # of X # such that ~ r - l ( u #) E ~/}. Then it is easy to see that ~/# has the properties (i)-(iv) of 2.1.17, whence by this proposition X # is a TLS. Further, by 2.1.13, X # is Hausdorff iff 0 # - X0 is closed. By definition of the quotient topology, ~r is continuous. It is also open as can be easily seen by using 2.1.4 (iii). 2.1.20. A subset S of a TLS X is called topologically bounded or t. bounded or just bounded if for every nucleus U there is a ) ~ - )~(U)~= 0 in ~: such that S __c )~U. 2.1.21. LEMMA. (i) Every subset of a bounded set is bounded. (ii) The closure S of a bounded set S is bounded. (iii) If S is a bounded set then to each nucleus U there is a positive real number c - e(U) such that S C #U for every # E K with I#I >1 E. In particular, there is a positive integer n such that SCnU. PROOF. (i) Clear (if S G AU, S' C S then S ' G AU). (ii) Given a nucleus U there is a nucleus V with V _ U (see 2.1.4(vi)). Since S is bounded there is a # with S _ #Y. It follows that S _C #V - #V __ #U, whence S is bounded. (iii) Choose a balanced nucleus V _c U. By boundedness of S, there is a A -r 0 with S C_ AV, so that if x E S , x - Av (v E V). Set e - I A I . If I#1/> IAI then I#-IA[ ~< 1 , # - l A y e V since V is balanced), so that x-
$v - # . # - l ~ v E #V __C#U.
Also, S CC_nU for any integer n/> e. 2.1.22. THEOREM (Mazur-Kolmogorov). A subset S of a T L S X is bounded iff for each sequence (xn) in S and sequence
w 1. Topological Groups and Linear Spaces
81
(~,~) in ~ with ~,~ --~ 0, we have A,x,~ ~ O. PROOF. Suppose t h a t S is bounded. By 2.1.21 (iii) there is an e > 0 with S__C#U for I#] > e. Write r / - e -1 and c ~ - / ~ - l . T h e n c~S C U for ]al ~< r/. Since there is an integer N such t h a t IA~] ~ ~7 for n/> N, it follows t h a t Anxn E AnS C_ U for n/> N, whence )~x~ ~ 0. Conversely, if S is not b o u n d e d there is a nucleus U such t h a t S ~ )~U for any )~ ~= 0 in K. Therefore, in particular, S ~ n U ( n - 1 , 2 , . . . ) . It follows t h a t we can choose x~ in S such t h a t W ~" r U. Then clearly -h~" 74 0 (though ~1 0) violating the s t a t e d condition, which completes the proof. 2 . 1 . 2 3 . COROLLARY. For S to be bounded it is sufficient that the following condition is satisfied:
For any xn E S,
Xn
~ O.
n
2 . 1 . 2 4 . DEFINITION. A TLS is said to be locally bounded if it has a b o u n d e d nucleus. Note t h a t if U is a b o u n d e d nucleus so is every nucleus V c_ U (see 2.1.21(i)). 2 . 1 . 2 5 . PROPOSITION. Let X be a locally bounded T L S and U a bounded nucleus of X. If #n E K\{O} and #n --~ 0 then { u , U } is a basis of nuclei. Thus, X is first countable and hence semi-metrizable. In particular, every locally bounded Hausdorff T L S is metrizable. PROOF. Suppose t h a t V is any nucleus of X. Since U is b o u n d e d , there is, by 2.1.21 (iii), an e > 0 such t h a t U c #V for all # E K with I#] >/c. Since #n ~ 0 we can choose a sufficiently large n such t h a t I#,~l-l~> e. The U c # ~ I V or #nU c V. The s t a t e m e n t s regarding semi-metrizability and metrizability follow by applying 2.1.7 to the underlying additive TG of X. 2 . 1 . 2 6 . L EMMA. Let X , X* be T L S ' s and T " X --~ X* a linear transformation. If T is continuous at some point xo then it is continuous everywhere. P r o o f . Assume t h a t T is continuous at x0, and t h a t x~ ~ x. Then x~ - x § x0 --+ x0, so t h a t T x a - T x + Txo ~ Txo, whence
Topological Preliminaries
82
T x a ~ Tx. 2.1.27. LEMMA. If T 9 X --+ X* is a continuous (or more generally, sequentially continuous) linear transformation and S(C_ X ) a bounded set so is T ( S ) . Proof.
If x ~ c S
then ~--' -"~ 0 n
TX~n - T ( ~ )
so t h a t
--+ T ( O ) - O ,
proving (by 2.1.23) t h a t T ( S ) is bounded. 2 . 1 . 2 8 . Let X, X* TLS's and T 9X -~ X* a linear transformation. T is said to be t. bounded or (sometimes) just b o u n d e d if it carries b o u n d e d sets to bounded sets. By 2.1.27, a continuous linear t r a n s f o r m a t i o n is t. bounded. 2 . 1 . 2 9 . PROPOSITION. Let X be a first countable (or equivalently semi-metrizable) TLS and X* any TLS. Then a linear transformation T " X --+ X* is t. bounded iff it is continuous. PROOF. In view of remark in 2.1.28 we have to prove only the "if" part. Let T be bounded. If T is not continuous it is not continuous at 0 (by 2.1.26) so t h a t there is a nucleus U* such t h a t T - I ( u *) is not a nucleus. Since X is first countable it has a countable decreasing sequence of open nuclei as basis: U1 D U2 D - - . . By 2.1.10, u___~, is an open nucleus Since T - I ( u *) is 1~ not a nucleus we have: v___~,g T - I ( u , ) (n - 1 2 . . . ) This means t h a t there are elements xn e Un such t h a t ~ ~ T - l ( V *) (n 1 , 2 , - - - ) . Since {Un} is a decreasing basis and xn E Un, Xn --+ 0 and so x , is b o u n d e d (see 2.3.7. (a)). Since T is b o u n d e d (Txn) is b o u n d e d . This means by 2.1.21 t h a t T (z__~) _ T~, ~ 0, so 1% /% t h a t Txn e U* for n /> N. But then z__. e T - I ( u *) (n /> N ) n n contradicting the choice of x~. Hence the proposition. 2 . 1 . 3 0 . LEMMA. Let X be a TLS and f a linear functional t on X. Then f is continuous iff k e r r is closed. PROOF.
It suffices to prove the "if" part.
t i.e. a function with values in •.
We may assume
w 1. Topological Groups and Linear Spaces
83
t h a t f r 0, k e r r is closed. Then, for any e > 0, the translate Xo- {xEX" f(x)-e} o f k e r jr is closed, so that U - X \ X o is an open nucleus. By 2.1.16 (iii), there is a balanced nucleus V c U. We claim that for any x E V, t]'(x)l < e. If not there is a x0 e V with 5 - If(x0)I >/e. Write yo - (e/5)xo. Then I]'(Y0)I- e, so that f ( y o ) - eO where 0 e N, I O I - 1. Hence f(Oyo) - e, so that zo - Oyo E Xo. On the other hand, since x0 c V and V is balanced, m
0E zo - Oyo - --;-xo c V 0
since I-~] ~< 1. Therefore zo E Xo N V, contradicting Xo N V -- O. Thus, ]f(x)l < E (x c V) proving f is continuous. 2.1.31. LEMMA. Let X be a T L S with {Us} as a basis of nuclei and f a continuous functional on X with f (O) - O . Then, given C > O, there is a U o - U~ o such that ]]'(x)I < C for all
xCUo. PROOF. Set G {x E X " If(x)l < C}. Since ] ' ( 0 ) - 0, 0 c G and so by continuity of f , G is an open nucleus. {U~} being a basis we must have G _D some U~ 0 which implies the lemma. oo
2.1.32.
Let X be a TLS. A series ~ x , ~
in X is said to
rt--1
converge to x if the sequence (sn) of partial sums s,~ - X l + ' . "+ xn converges to x in X ' s n ~ x. More generally, a generalized series ~ E ~ x~, where ~q is any indexing set, is said to converge to x if the net sF, where franges through all finite subsets of .4 and S F - ~ x~, converges to x; x is called the generalized s u m c~EF
of the x~
~s . oo
2.1.33. LEMMA. If ~
x,
converges in X
then x,~ ~ 0.
n=l
PROOF. Given a nucleus U, choose a symmetric nucleus W (DO
with W §
U. Suppose that ~ x n - x . r~=l
Then there is an No
Topological Preliminaries
84 N
x,~ - x E W for N / > No. It follows t h a t
such t h a t n=l
XN+I
_
fN+lxn
-- X
c
W+W
c__ U
--
X n-
X
for N / > No.
It follows t h a t xn ~ 0.
w 2.
Topological
Algebras
2 . 2 . 1 . DEFINITION. An algebra A over K is called a topological algebra or a TA if it is equipped with a topology such that: (TA1) The map (x, y) ~ x + y of A x A -~ is continuous. (TA2) T h e m a p (2, x) ~ )~x of E x A ~ A is continuous. (TA3) The m a p ( x , y ) ~ - . xy of A x A ~ A. is continuous. In view of (TA1), (TA2) every TA is a TLS. Also, the condition (TA3) can be expressed in terms of net convergence as:
xa --~ x, yz --~ y ~ xay~ --~ xy. 2.2.2. DEFINITION. An algebra A is called a weak topological algebra or a WTA if the underlying linear space of A is a TLS and further we have: ( T A 3 ' ) The maps l a : X ~ a x , r a : x ~ xa ( x , a e A) are continuous for all a. Clearly (TA3) ~-, (TA 3' ), so t h a t a TA is a WTA. Using 2.1.26, it is easy to see t h a t in terms of net convergence the condition (TA 3 I) can be expressed as ( T A 3 " ) If x ~ - - ~ 0 then a x a ~ O , x a a ~ O for each a E A .
2 . 2 . 3 . LEMMA. For a W T A A to be a TA it is necessary and s u ~ c i e n t that (,) the map (x,y)~-~ xy is continuous at (0,0). PROOF. We have only to prove the sufficiency of the condition (,). For this it is enough to show t h a t in an A satisfying (.), (TA3) holds.
85
w 2. Topological Algebras
Assume now that (.) is satisfied, and in A x a ~ x0, yf~ --+ y0. By (TA 3") we have o;
(1)
(xa - xo)Yo --+ O.
(2)
xo(y,
- yo)
Again, by (.) we have -
- y0)
0
(3)
From (1),(2),(3)we obtain (by adding the terms) x a y z - xoYo ~ O, or , x a y z -~ xoYo.
Thus,(TA3) holds and A is TA. 2.2.4. E x a m p l e s . (i) Every algebra over K is a TA under the indiscrete topology. (ii) The algebra A - K S of all ~:- valued functions (algebra operations being point (or coordinate)-wise is a TA under pointwise net convergence : i.e., if f ~ , f E A then f~ ~ f if f~(s) --. f ( s ) Vs e S; this topology is called weak topology or topology of simple convergence. A is a commutative TA. (iii) Let .~ be a Hilbert space and B = B ( ~ ) the algebra of all bounded 1.o. t ' s on ~. B is an algebra which not commutative if dim ~ > 1. Under the weak or strong operator topology B is a W T A but not a TA (since multiplication is not jointly continuous; see [22, p.448]). The weak or strong operator topology is defined vic net convergence as follows. Ta --, T in the weak operator topology if (T,~x,y} --~ ( T x , y} for every x,y e -O, where (.} denotes the inner product of ~. Similarly, Ta --~ T in the strong operator topology if l I T ~ x - Txtl ~ o for every x E -O, where I1" II is the norm induced by the inner product" I l x l l - ( x , x ) 8 9 In the norm topology, B is a TA; Tn --~ T in the norm topology if IIT,~- TII ~ 0 (for definition of IITII(T E B), see 3.5.1). t 1.o.=linear operator.
Topological Preliminaries
86
2.2.5. LEMMA. A WTA or a TA is a TG under addition. Under multiplication a TA A is a TSG. t PROOF. The first s t a t e m e n t follows from 2.1.12; the second is a consequence of condition (TA3) of 2.2.1. 2 . 2 . 6 . LEMMA. In a unital TA A, semi-topologicaltt groups and the map
the groups Gq,Gi
are
7 -1 " a E G q ~ - ~ e + a E G i is a t. isomorphism. PROOF. By (TA1), (TA3), Gq and Gi are semi-topological groups. Also, by 1.1.20, r -1 is an isomorphism. T h a t r -1 is topological follows from the fact that translation is a homeomorphism (see 2.1.4(i)). 2 . 2 . 7 . LEMMA. closed hi-ideal of A.
In a TA (or even WTA) A, 0 -
{0} is a
B
PROOF. By 2.1.13, 0 is a closed subspace of A. Further, from the continuity of I. or r. multiplication in A we obtain x0 _c x0 - 0,0y _c 0 b
which show that 0 is a bi-ideal, completing the proof.
2.2.8. LEMMA (a) Any subalgebra of a TA (respy. WTA) is a (respy. WTA). (b) Any direct product or direct sum of TA's (respy. WTA's) is a TA (respy. WTA). TA
PROOF. (a) Clear.
t TSG- topological semi-group, i.e., a semi-group with a topology under which multiplication is continuous. ~t A semi-topological group is a group with a topology under which multiplication continuous (inversion may not be continuous). :~ t. isomorphism - topological isomorphism, i.e. an (algebraic) isomorphism which is also a homeomorphism.
87
w2. Topological Algebras
(b) Since the operations of the direct p r o d u c t are coordinatewise and a direct sum is a subalgebra of the direct p r o d u c t , the s t a t e m e n t s follow. 2.2.9. PROPOSITION. The unitization A1 of a TA (respy. WTA) A is a TA (respy. WTA) under the product topology of A 1 - K • A. Further, A is a closed bi-ideal of A1 and A1 is Hausdorff whenever A is Hausdorff. PROOF. Clearly A1 is a TLS in either case. t h a t A is a TA and t h a t in A1 we have Xlc~
--
)i~e 1 + x~ --+ Xl -- )lel -~- x
Yl~
----
~f~el -~ y/~ --+ Yl -- ~el + y
Suppose now
where x, y C A and )~, #t~, )~, # C ~:. Then
It follows t h a t
) ~ e l + )~y + ~x + xy -- XlYl, showing A is a TA. Next suppose t h a t
A is a WTA, and yla -
# a e l + Ya --+
#el + y - Yl. Then l ~ ( y l ~ ) - )~#oLel + )tya + # a x + xyo~ --~ l ~ ( g e l + y ) - l ~ (Yl). This shows t h a t l ~ is continuous. Similarly r= 1 is continuous. Hence A1 is a WTA. We have already noted t h a t A is a bi-ideal of A1 (see 1.1.12). T h a t it is closed in A1 is clear from the definition of the topology of A1. Finally, if A is Hausdorff, {0} is closed in A and so also in A1 (since A is closed in A1 ) and consequently A1 is also Hausdorff (by 2.1.5,2.1.6). N
2.2.10.
TA
The complexification A
PROPOSITION.
WTA) A
TA
(r py. WTA)
of a real
topology o/
A• PROOF. The proof is on the same lines as the proof of the first p a r t of 2.2.9. 2.2.11.
PROPOSITION.
Let A be a TA and I a bi-ideal of
88
Topological Preliminaries
A. Then the quotient algebra A # - A / I is a TA relative to the quotient topology. Moreover, A # is Hausdorff iff I is closed. PROOF. In view of 2.1.19, it is enough to prove t h a t multiplication in A # is continuous. Let U # be an open neighbourhood of x # y # - (xy) #. Then U - ~ - I ( u # ) , where r is the canonical m a p A -~ A #, is an open neighbourhood of xy. Choose open neighbourhoods V,W, of x , y respy, such t h a t V W c_ U. Then, since r is open (by virtue of 2.1.19), V # - r ( V ) , W # - r ( W ) are open neighbourhoods of x # , y # respy, with V # W # c_ U #, proving the continuity of multiplication in A#. 2 . 2 . 1 2 . COROLLARY. Let A be a TA. Then A/O is a Hausdorff TA. PROOF. This is an i m m e d i a t e consequence of 2.2.7 and 2.2.11. 2 . 2 . 1 3 . THEOREM. Every WTA has a basis ~l of nuclei satisfying (i)-(iv) of 2.1.17 and (v) Given U E Ll and a E A there are V, W E [I such that aVE_U,
WaC_U.
Conversely, if ~l is a nonempty family of subsets of an algebra A satisfying (i)-(iii)(o]'2.1.17.), and ( v ) ( a b o v e ) t h e n ~l is a basis of nuclei of a unique topology on A making it a WTA. PROOF. By 2.1.17 we can choose a basis ~/ of nuclei satisfying (i)-(iv). Then L/ also satisfies (v) since l~, ra a r e continuous for each a c A. For the converse we observe that by 2.1.17, A is a TLS. To prove t h a t A is a W T A it remains to show t h a t each la and each ra are continuous. By 2.1.26 it is enough to prove t h a t la, ra are continuous at 0. But this is precisely what condition (v) expresses. 2 . 2 . 1 4 . THEOREM. Every TA A has a basis [l of nuclei satisfying (i)-(iv) of 2.1.17 (v) of 2.2.13, and also (vi) Given a U E ~l there is a V E I l such that V 2 C_ U. Conversely, every algebra A together with a family ~l of subsets satisfying (i)-(iii) of 2.1.17, (v) of 2.2.13, and (vi) above is a TA under a unique topology having [l as a basis of nuclei. PROOF. If A is a TA then it is a W T A and so by 2.2.13, has
w2. Topological Algebras
89
a basis ~/ of nuclei satisfying (i)-(v). This also satisfies (vi) since, multiplication in A is continuous. The converse s t a t e m e n t follows from the converse part of 2.2.13, and 2.2.3. 2.2.15. R e m a r k .
In terms of convergence of nets the condi-
tions (v),(vi) above take the forms: x~ -~ 0 then ax~ --~ 0, x~a ~ 0;
If
(v I)
x~ -~ 0, yf~ ~ 0 then x~y~ ~ O.
If
(vi I)
2 . 2 . 1 6 . LEMMA. Let A be a TA. We have" (i) If in A,x,~ ~
0 and (y,)
is bounded then x , y n
~
O,
y,~Xn --~ O. (ii) If S , T C_ A are bounded subsets so is ST. PROOF. (i) Given a nucleus U choose a nucleus V such t h a t V 2 _ U. Since (Yn) is bounded then is a scalar A ~= 0 such t h a t {Yn} C AV. Since xn---*O we can find N such t h a t x n E A - 1 V for n/> N. Therefore XnYn E )i-lv
9) i V -
V 2 C U
for n/>
N,
whence xnyn -~ O. (ii) Any sequence in S T is of the form (xn),(yn) are sequences in S , T respy.. Since bounded ~---"--~ 0 (by 2 1 2 2 ) Since {y~} c by result (i), ~"u" , -~ 0 , whence by 2.1.23, S T is
(xnyn) where {xn} C_ S is T is bounded bounded.
2 . 2 . 1 7 . LEMMA. In a Hausdorff, TA (respy. unital TA) A, if oo
(x)
the series E ( - 1 )
nxn (respy. E ( e
n-----1
- x) n) converges then x is
n=O
q invertible (respy. invertible) and its q inverse x' (respy. inverse x - l ) is given by oo X I
~(-1)nx n-1
oo
n (x - 1 -
E(e--x)n). n--O
90
Topological Preliminaries
oo
PROOF.
Write
y -
~ ( - 1 ) ' ~ x n.
Then
xoy
--
x+
n=l oo
lim ( - 1) Nx N + I -- 0 (by 2.1.33).
N--~oo
n--1
Similarly, y o x - 0. Therefore x ~ - y, proving the assertion concerning q invertibility. Again, if we set e - x - z, by 2.1.33, z ~ -~ 0. Therefore we have oo
( e - z) ~
z~ -lim(e-
z ~+1) - e, whence
rt--0
oo
OO
Z zn~ n=O
(e--Z) -1-
x-1 r~:O
completing the proof. 2.2.18.
In a TA A we denote by Ar -
Ar
the set of
all continuous characters; A - A(A) will denote the set of all characters. Of course Ac (or even A ) can be empty. We set {NX-I(O)'x~Ae} A
,~z-~ _
ifAr162 if Ac - O.
Since ~ - A is the intersection of all closed h y p e r m a x i m a l ideals (of A ) it is closed and we have clearly the inclusion relation
(,) 2.2.19.
DEFINITION. Following Michael, [20, p.48] we call a TA A f u n c t i o n a l l y c o n t i n u o u s if every character of A is continuous, i.e. if A r
A.
In a functionally continuous algebra we have
(**)
w3. Completions of Topological Linear spaces Completions
of Topological Linear Topological Algebras
spaces
91
and
2.3.1. DEFINITION. Let X be a TLS. Two nets (xa),(y#) in X are said to be equivalent, in symbols, ( x a ) , ~ (yf~) if they satisfy the condition: (.) Given a nucleus U of X there are indices a0,/~0 such t h a t x~ - y/~ c U for a >- a0,/3 >-/30. A net (xa) is called a Cauchy net or a C-net if we have (xa) (xa), i.e. if for each nucleus U there is an a0 such t h a t x a - x ~ E U for a,/3 >- a0. A TLS X is called complete if every C-net in X converges to some element in it. 2.3.2.
LEMMA. The notion of equivalence of nets in X
has
the properties: (i) If (x~) ~ (yz) then (yz) ,.., (xa). (ii) If (x~)... (y~), (yz) ..~ (z.y) then (x~).~ (z.~). (iii) If ( x ~ ) ~ (y~) and (x~,) is a subset of (x~) then (xa,) ..~ (Y,).
(iv) Let (x~) be a net and (x) a principal net. Then (x~) ,.~ (x) i f f Xc~ ----~ X.
(v) If (xa) ... (y~) and ~ C •
then (~xa) ,'. ()~Yt~), in particular
( - x ~ ) ~ (-y~). (vi) If (x~)..~ (yz), ( z ~ ) ~ (u~) then (x~ - z~).~ (yz - u 6 ) . PROOF. (i) Given a nucleus U select a symmetric nucleus V _ U. Since (x~)..~ (yz) there are ao,/30 such t h a t x ~ - y~ E V (a ~- ao,/3 >--/3o) whence y~ - x~ - - ( x ~
- y~) ~ - v
- v c u (~ ~ ~0, Z ~ Z0).
(ii) Given a nucleus U select a nucleus V with V + V __c U, and choose a0,/30,/31,'/1 such t h a t Xa -- y~ C V(o~ ~ o/0,/~ ~ / ~ 0 ) , Yfl - z~/ E V(/~ ~ / ~ 1 , ~ ~- ~1).
Topological Preliminaries
92
Then, for a >- no,'/>- "/1, we have x a - z~ - x~ - yz, + yZ, - zu ~ V + V _ U( where ~' >- ~o, ~1). (iii) Given U, choose ao,f~o such that x a - y~ E U(a >no,/3 >- f~o). Since (x~,) is a subnet there is an a~ >- no. Then x ~ , - y~ c U(a' ~ a~,fl >-/~o), whence (xa,).-. (yz). (iv) Clear. (v) Given U, by 2.1.17(iv), there is a Y with ,~Y _c U. Choose ao,flo such that xc~ - yz ~ V ( a >- a o , ~ ~ ~o). Then a x ~ - ,~yz - ,~(z~ - y z )
E ,~v _c u.
(vi) Select a symmetric V with V + V _C U. By hypothesis there are indices no,/~o,'/o, ~o such that x~ - yz E v ( ~
> ~ o , Z >- ~o), z~ - ~e e v ( ~
>- ~o, ~ > ~o).
Then ( x ~ - z ~ ) - ( y z - u c ) - x ~ - y ~ - ( z ~ - u c ) e V + V _ C (~ ~ ~o,/~ ~ r >- ~o,6 >- ~o). 2.3.3. COROLLARY. ( i ) I f (x~) is a C-net in X a subnet then it is a C-net such that (x~,)... (xa).
U
and (x~,)
(ii) If (xc~) is a C-net in X so is ()~xc~); in particular ( - x a ) is a C-net. (iii) If (x~), (yz) are C-nets so is ( x ~ - y~). PROOF. (i) From (x~)-~ (x~), by 2.3.2 (iii), (x~,) ,~ (xa) and also by 2.8.2.((i), (iii))we get ( x ~ , ) ~ (x~,). (ii) Follows from (v) of 2.3.2. (iii) Follows from (vi) of 2.3.2. 2.3.4. L EMMA. Let X , X * be TLS's and T " X ~ X* a continuous linear transformation. Let (xa), (y~) be nets in X with (xa) ~ (y~). Then (Txa) ... (Txz). In particular, (Txa) is a C-net whenever (xa) is a C-net. PROOF. Given a nucleus U* of X* , there is, by continuity of T a nucleus U of X with T ( U ) c _ U* 9 Since ( x ~ ) . . - ( y ~ ) t h e r e
w 3. C o m p l e t i o n s of Topological Linear spaces
are indices a0, fl0 such that xa - y ~
93
E U ( a >- a o , f l >- flo). Then
T x ~ - Ty~ - T ( x ~ - yZ) e T ( U ) C_ U*,
proving ( T x ~ ) ~ (Ty~). 2.3.5. DEFINITION. A net (x~) in a T L S X is called bounded if it is bounded as a set (see 2.1.20). A net (x~) in X is called essentially bounded if given a nucleus U of X there is an index ao=ao(U) andascalar A=A(U)~O) such t h a t
{x~ "a >- ao} _ AU. Trivially, a bounded net is essentially bounded. 2.3.6. gent n e t -
PROPOSITION. Every C - n e t (xa) is essentially bounded.
in particular a conver-
PROOF. Given a nucleus U choose a balanced nucleus V such t h a t V + V _ U. Since (xa) is a C-net there is an a0 such t h a t x ~ - x~ o E V for a >-a0, so that x~ E X~o + y
(a >- a0)
Since Y is absorbing (by 2.1.16(ii)) and balanced (by choice) we can choose A/> 1 such that Xao E AV. Then x~ E ~ v + v _q ~ v + ~ v - ~ ( v + v ) c ~ v
(~ >- ~0),
proving t h a t (x~) is essentially bounded. 2.3.7. PROPOSITION. (a) Every essentially bounded sequence - in particular, a C-sequence or a convergent sequence - is bounded. (b) Not every convergent net is bounded. PROOF. (a) Given a nucleus U choose a balanced nucleus V with V _c U. Since (x~) is essentially bounded there is an integer N ~> 1 and a s c a l a r A1 such that {xn " n _> N} _c A1V. Using the absorption and balanced properties of V we can choose a A2 with xj e A2V (j- 1,...,N).
94
Topological Preliminaries
Set , ~ - max (1~11,1~21). Then
{z.} c_
___au,
proving the boundedness of the sequence (xn). (b) It is enough to construct a convergent net in R which is not bounded. Write J~ -- {O~1,~2,''"
;~1,~2,'''}
and define a partial ordering in A by ~ 1 -'~ /~2" "" ;C~m -~ ~ n ( m -
1,2,...;n-re,
m + 1,...).
Then A is a directed set (as can be easily verified). Define a net x~ (~/c ~) in E by setting 1 X a n - - n~Xf~ n =
--. n
Then x, ~ 0, but (x~) is unbounded in N (since nXc~nl -- 1 -/4 0).
2.3.8. PROPOSITION. Let A be a TA. Then we have" (i) Let (xa), (yz), (z~), (u~) be essentially bounded nets in A such that (xa) ~ (z~), (Y,) ~ (u~).
(ii) If (x~), (yz) are C-nets then so is (xay~). (iii) If xa ~ 0 and (yz) is essentially bounded then xayz --~ O, y~xa --~ O. PROOF. (i) Given a nucleus U(of A) we can find, using 2.1.17(iii), 2.2.14(vi), a nucleus V with V z + V 2 C U.
(1)
95
w 3. Completions of Topological Linear spaces
By essential boundedness of the nets we have scalars, A, # ~ - 0 such t h a t
{ y ~ . ~ ~- Z~} c ~v, {z~ .~ ~ ~1} c , v .
(2)
Since (x~),-, (z,), (y~),--(u6) we have x a - z, e ~ V ( a >- ao,'~ >"/2),Yfl- u5 E X1V(fl >- fl2,5 >- 52) Choose flo >- fll,fl2 and "~0 >- ~/1, "~2. Then x a y f l - z,~u5
--
( ~ - ~,)y~ + ~ , ( y , - u~) IV )~
&V + # V
1V - V 2 + V 2 c U # -
(a >- ao, fl ~- flo, "~ ~- "~o, 5 ~- 50)
proving (xayfl),': (z,~u6). (ii) Since by hypothesis (xa) ~ (xa), (yfl),-, (yfi) and by 2.3.6, C-nets are essentially bounded w~ conclude using(i) (xayfi) ,,, (x~y~) i.e. (x~yz) is a C-net. (iii) Given a nucleus U, choose a nucleus V such t h a t V 2 c U. Since (y~) is essentially bounded there is a A ~: 0 and a fl0 with {yfl " fl >- rio} c )~V. Since xa --* 0 we have xa E A-1V for a >- a0. It follows t h a t x~vz c v 2 c u (~ ~- ~0,fl ~- rio).
Hence xayz---, O. Similarly, y~xa ~ O. 2 . 3 . 9 . Let X be a TLS. The relation ,~ between nets in X is not only s y m m e t r i c and transitive but also reflexive when confined to C-nets. So ~ is an equivalence relation in the usual sense on the class of all C-nets (xa) in X. Denote by )~ the set of the resulting equivalence classes [(xa)]. To each subset S of X we associate a subset S of )( given by ;~ - { [(xa)] E ) ( " for some representative (xa) of the class we have xa E S for all a } . If (x) is a principal net the corresponding class (denoted by) [x] = [(x)] is called a principal class. 2.3.10.
LEMMA.
,~ is a LS and the map j "
x ~-, Ix] is
Topological Preliminaries
96
linear. It is injective iff X is Hausdorff.
PROOF. If ~ - [(xa)], ~ --[(yfl)] E X,)~ E K we define linear operations in X by"
-
[(x~)] + [(y,)] - [ ( x ~
=
~[(~.)]- [(~x~)]
+ y~)]
These operations are well-defined in view of 2.3.2. The linearity of j is an immediate consequence of the definition of linear operations"
Ix + y ] - [x] + [y], [ ~ ] - ~[~] Finally, if X is Hausdorff and x, y E X, x ~= y there is a nucleus U such that x - y ~ U, so that (x) 7~ (y), [x] # [y]. On the other hand, if X is not Hausdorff it is not T1 (see 2.1.6). Therefore there is an x 7~ 0 with x E 0. If U is any nucleus then by 2.1.5(i), x e 0 _C U, whence (x) .~ (0), I x ] - [0], so that j is not injective. 2.3.11. LEMMA. (i) If ,S'I _C S2(___ X ) then S1 CC_$2. (ii) AS - AS. (iii) If x E S then [x] ~ S. (iv) If Ix] E ~5 then x E S, where bar denotes closure in X. (v) If (x=) is a C-net such that xa E S for a >- ~1 then
[(x~)] e ~ PROOF. (i)-(iii)" Clear. (iv) If [ x ] e S there i s a n e t ( x ~ ) . ~ ( x ) with x a e S ~). By 2.3.2 (iv), x ~ - ~ x, whence x e S.
(for all
(v) Since (x~ 9c~ >- ~1) is a subnet of (x~) it is, by 2.3.2(iv), equivalent to (xa). Hence the result. 2.3.12. LEMMA. If U is a nucleus of X then U is an absorbing subset of X . If U is balanced so is U. PROOF. Choose a balanced nucleus V with V + V c U. Suppose that [{yz}] E .~. Then y~ - y~, e V(/3,/3' >- /30). Since V, as a nucleus, is absorbing, Y~o E AV for some A/> 1. It follows
97
w3. Completions of Topological Linear spaces
that for /~ >-/30 y, -
- y o) +
c v +
c
+
-
+ v)
c
Hence, by 2.3.11 (v), [{yz}] E ,~U, proving U is absorbing. Now assume that U is balanced. If [(x~)] E / ) with x~ E U, then since U is balanced, Ax~ e U([AI ~< 1), so that A [ ( x ~ ) ] - [(Axe)] e 0 , proving f) is balanced. 2.3.13. THEOREM. X can be made into a TLS such that: (i) j : x ~ [x] is continuous; if X is Hausdorff j is a homeomorphism. (ii) j ( X )
is dense in 2 .
(iii) X is complete. (iv) 2
is Hausdorff.
( v ) ) ( has the following universal mapping property: given any complete Hausdorff TLS X* and continuous linear map 99 : X --, X*, there is a unique continuous linear map ~ " fc ~ X* such that ~ - ~b o j. PROOF. Choose a basis ~/ of nuclei of X satisfying (i)-(iv) of 2.1.17. By 2.3.12, the family ~ - {0 9 U E L/} of subsets of 2 satisfies (i) of 2.1.17. Further, by monotonicity of the (set) map S ~ S (see 2.3.11(1))it satisfies ( i i ) o f 2.1.17. Finally, given U E ~ we can choose a V E /2 with V + V __ U. Select [(x~)],[(y~)] ~ V. We may assume that (x~),(y~) C_ V. Then [(x~) + ( y / ~ ) ] - [(x~ +y/~)] C U since x~ + y~ e U. Thus satisfies (iii) of 2.1.17. We can now apply the converse part of 2.1.17 to conclude that X is a TLS with Z) as a basis of nuclei. It remains to prove the statements (i)-(v) above. By definition of D we have j ( U ) _ /), whence j is continuous. Let now X be Hausdorff. Then, by 2.3.10, j is 1-1. Let V be any nucleus of X and choose anucleus W of X with W c_ V. If [x] E then x c W _c V. It follows that j - l ( I ~ ) c_ V, whence j - 1 is continuous. This completes the proof of (i). For proof of (ii) it is enough to observe that j ( x ~ ) - [xa]--~ [(xa)]. To prove (iii), Let x~ -[(x~(u))] be a C-net in ~7. Therefore,
Topological Preliminaries
98
given a nucleus U of )~, for each ~/ there is a ~/u such that ~-~,
E U for ~/,~/~ >- "/v , i.e,. we have x ~~ ( ~ )
-
x (~' ~,)
C
U
for all a(-/), a(~/') with ~/, ~/'>- ~/~. This mean that the net (with index ~/) of principal classes ~
By considering ordering
(X~(v)) as
(.(u)-
a net indexed by pairs (7, U) with the
(~/, U) < ('r', U ' ) i f "~ -< -/', U ' _ U it is clear that it converges to the element [(x (u))] of X -.
[(x
o
So
~(u))], completing the proof of (iii).
For proving (iv) take ~ - [(x~)] ~: [0]. Then x~ ~ 0. So we may assume that there is a nucleus U of X with the representative (x~) of ~ disjoint with it. Choose a symmetric nucleus W with W + W c U. We claim that I/V ~ [(x~)]. For, if [(x~)] E I2r then there is a C-net ( y z ) E W with (xa),-~ (yz). It follows that there are xa,, ya, with x ~ , - yz, E W. Then x~,-x~,-y~,+y~,EW+W
c U
contradicting U 0. Thus, I?V is a nucleus of 2 not containing ~, whence X is T1 and so Hausdorff. Finally, for proving (v), take an element [{x~}] e )(. By 2.3.4, (~p(x~)) is a C-net in X* and so converges uniquely to x* e X*. Set -
This is well-defined, since if (x~) ,~ (Ye) then ( ~ ( x a ) ) , , ~ (~(yz)), so that ~ ( Y e ) + x*. Also, ~(x)-
~b([x])- # o j(x).
Finally, if r is a continuous linear map with r o j - ~b o j then clearly r - ~5 on the dense subspace j(X) and hence everywhere.
w3. Completions of Topological Linear spaces
99
This completes the proof. 2 . 3 . 1 4 . THEOREM. If A is a TA then its completion ~i (as a TLS) is a complete TA. PROOF. By 2.3.13, A is a complete TLS. So we have only to show t h a t A is a TA. If ~ - [(x~)], ~ - [(Yt~)] are two elements of A then, by 2.3.8(ii), (x~y~) is a C-net and so determines an element [(x~yz)] of A. We define multiplication in A by setting ~!) - [(x~yz)] (that this product is well-defined is assured by 2.3.8). It is easy to see that under this multiplication A is an algebra. To prove t h a t A is a TA, consider a nucleus U and an element a E A. Since la is continuous there is a nucleus V with aV c_ U. Suppose now t h a t ~n - [(x~(n))] -~ 0 in ft.. Then there is a "/0 such t h a t for ~/>- ~/0, x n~(n) E Y if a(~/) >- some an(~). It follows that
ax~(~) c aV c_ U whence 5x~n ~ 0 .
(1)
Similarly, using continuity of ra we get
x~a -~o
(2)
The conclusions (1),(2) imply t h a t A is a WTA. Further, since A is a TA, given a nucleus U, there is a nucleus V such t h a t v 2 c u.
Assume now t h a t
~
- f(x (~))] -~ o, g~ - [(y~(~))] -+ o.
Then we have for some "/o , ~o, x ~~(u),Y ~ (6) E V 2 _c U, whence
x~}6 --~ 0, completing the proof t h a t A is a TA.
(3)
CHAPTER
SOME
III
TYPES OF TOPOLOGICAL ALGEBRAS
w 1.
Quarter-norms
3 . 1 . 1 . DEFINITION. A real-valued function p = p(x) on an additive abelian group X is called a subadditive or sad. functional if it satisfies: ( q l ) p(0) = 0;
(Q2) p ( - x ) = p(~)(~ c x); (Q3) p(x + y) <<.p(x) + p(y) (x, y E X ) . If p is a sad. functional then we have also (Q4) p(x) >! 0 (x c X )
(0 = p(O) = p(x - x) <~ p(x) + p ( - x ) = p(x) + p(x) = 2p(x)). If p satisfies (Q5) p(x) = o ~ x = O then p is called faithful. 3 . 1 . 2 . LEMMA. Let X be an additive abelian group and p a sad. functional on X. Then:
(i) p(nx) < Inlp(~) for any int~g~ n. (ii)
Ip(x) - P(Y)I ~< p(x - y).
(iii) If p(a) = O then p(x + a) = p(x) for all x E X. (iv)
d p ( x , y ) - p ( x - y) is a s e m i - m e t r i c t variant for translations: dp(x + a, y + a) -- dp(x, y)
on X
which is in-
(x, y, a E X ) .
Also, dp is a metric iff p is faithful. t d is called a semi-metric or pseudo-metric if it satisfies all metric axioms except: d(x,y) - O ~ x = y.
101
w 1. Quarter-norms
If d is any semi-metric on X invariant for translations then p(x) - d(x, O) is a sad. functional. PROOF. (i) If n is positive we have p(nx) <~p ( ( n - 1 ) x + x) ~< p((n - 1 ) x ) + p(x) from which the inequality follows for positive n by induction. If n is negative then p(nx) = p ( - n . x) - n p ( - x ) = - n p ( x ) = Inlp(x), completing the proof for all n. (ii) p(x) = p(x - y + y) <~p(x - y) + p(y). Interchanging x, y we get p(y) <~ p(y - x) + p(x) = p(x - y) + p(x). The required inequality now follows. (iii) p(x + a) <~ p(x) + p(a) - p(x) + 0 - p(x). Also p(x) p(x + a - a) <. p(x + a) + p ( - a ) = p(x + a). Hence the required equality. (iv) By (Q4), dp(x,y) >1 0 and by (Q1), dp(x,x) = 0. The s y m m e t r y and triangle inequality properties for dp follow from (Q2), (Q3). Further, we have clearly dp(x + a, y + a) - dp(x, y). Finally, if p is faithful then dp(x, y) -- p ( x - y) -- 0 ::~ x = y, so t h a t p is a metric. Conversely, if dp is a metric then p is faithful ( ; ( x ) = 4 ( x , o) = o ~
9 = o)
Suppose now d is an invariant semi-metric and p(x) = d(x, 0). Then p(0) = d(0, 0) = 0,
p ( - x ) - d ( - x , O ) - d ( x - x , x ) - d(0, x ) -
d(x, O ) - p(x).
Finally,
;(x + y) <
d(~ + y, 0) - d(x,-y) ~< d(~, 0 ) + d ( 0 - y) ;(x) + p(-y) - p(x) + p(y)
3.1.3. L EMMA. Let X be an additive abelian T G and p a sad. functional on X. If p is continuous at 0 then it is uniformly continuous on X. PROOF. Let {Ua} be a basis of nuclei of X. Then, for x E X, {x + U~} is a basis of neighbourhoods of x. Suppose now t h a t p is continuous at 0. Then, given e > 0 there is a nucleus Ua such t h a t p(a) < c when a E Ua. Therefore, for any x E X,
x+acx+Ua,
]p(x + a) - p(x)l <. p(a) < e
which show t h a t p is uniformly continuous on X. 3.1.4. The topology induced on X by the semi-metric dp is
102
S o m e Types of Topological Algebras
called the p-topology and X with the p - t o p o l o g y is denoted by ( X , p ) . A neighbourhood basis for a point x0 in the p - t o p o l o g y is given by the family of sets {X(x0, e ) ' e > 0}, where
Since h/(X0, 9 El) ___ , h i ( x 0 , { 2 ) f o r
{1 < E2
1 it follows t h a t the subfamily {X(x0, ~) " n - 1 , 2 , . . . } is also a n e i g h b o u r h o o d basis at x0, whence the p-topology is first countable. It is clear t h a t a sequence x,~ --~ x in the p - t o p o l o g y iff p ( x n - x) --~ O. We call the p - t o p o l o g y complete if it is complete with respect to dp. As already seen in 3.1.2 (iv), dp is a metric if p is faithful. Two sad. functionals Pl,P2 on X are said to be equivalent, in symbols, pl ~" p2 if both of t h e m induce the same topology on X.
3 . 1 . 5 . LEMMA. Let p be a sad. f u n c t i o n a l on an additive abelian group X . Then: (i) X
is a T G under the p-topology;
(ii) p is a continuous f u n c t i o n on (X,p); (iii) k e r p - {x E X " p(x) - O} is a closed subgroup and k e r p 0 (iv) I f pl "" p2 then k e r p l - kerp2. In particular pl is faithful iff p2 is faithful. PROOF. (i) It follows from (Q3) that the m a p (x, y)~-+ x + y is a continuous and from (Q2) the m a p x ~-+ - x is continuous. So X is a TG. (ii) The continuity of p follows from 3.1.2 (ii). (iii) If x, y E kerp then p ( x - y) <~ p(x) + p(y) - 0 + 0 - 0, whence x - y E kerp. So k e r p is a subgroup. Further, it is closed since k e r p - p - l ( 0 ) and p is continuous. Since 0 E k e r p and k e r p is closed, 0 _c kerp. On the other hand, if p(x) - O, p(O-x)-p(-x)-p(x)-O, so that 0 , 0 , . . . - + x , x e O . Thus, 0 - ker p.
103
w 1. Quarter-norms (iv) By (iii), her pl
--
0
--
her p2.
3 . 1 . 6 . The set G of all sad. functionals on X can be partially ordered by: p-< q if p(x) <.q(x) for all x E X ( p , q E G). 3.1.7. LEMMA. (a) If p is a sad. functional and t > 0 then
tp is a sad. functional. (b) If p j ( j - 1 , . . . , n ) P -- Pl +''"-Jr- Pn,
are sad. functionals on X then so are
q -- P l k / ' ' '
k/Pn
-- m a x pj(x)) 3
"~ ( q ( x )
PROOF. (a) Clear. (b) T h a t p is sad. is clear. To prove t h a t q is sad. it is clearly enough to show t h a t it satisfies (Q3). Now, by definition of q, we have for given x,y e X, an index j with q(x + y) - pj(x + y). Then
pi(x + y) <~pj(x) + Pi(Y) <~q(x) + q(y), so t h a t q(x + y) <~q(x) + q(y). 3.1.8. DEFINITION. Let X be a LS and p a sad. functional on the underlying additive group of X. Then p is called a quarternorm if it satisfies. (Q6) If (x,~) is a sequence in X, x e X , p(xn-x)~O and A,--~ A in K, then p(Anx,~- A x ) ~ 0 (i.e. if in the p - t o p o l o g y x~ ~ x and An ~ A in K then A,~xn ~ Ax). The condition (Q6) can be split up into three sub conditions : (Q6a) If p(x,) ~ 0, A,~ ~ 0 then p(A,~x,) ---, 0. (Q6b) If p ( x , ~ - x ) ~ O then p ( A x , ~ - A x ) ~ O , AeK. (Q6c) If An ~ A then p(Anx - Ax) ~ 0, x e X. T h a t (Q6) implies each of these subconditions is clear. Conversely, it follows from the identity -
-
-
-
+
-
+
-
(,)
t h a t the subconditions can be replaced by (Q6). 3 . 1 . 9 . R e m a r k . If p is a q u a r t e r - n o r m on X, define p* on X by: p*(x) = p(x) or 1 according a p(x) ~< 1 or p(x) > 1. T h e n it is easy to see t h a t p* is also a quarter-norm; p* is called a reduced q u a r t e r - n o r m , the reduced form of p. It is clear t h a t t q is the lattice sum (see 8.6.7) with respect to the partial order defined in 3.1.6.
104
Some Types of Topological Algebras
p* ,-, p and that p* is bounded (as a functional)" p*(x) < 1 for all x in X, or briefly p*~< 1. 3.1.10. LEMMA. Let p be a quarter-norm on X. Then p** -p / l + p is a quarter-norm which is also bounded: p** <, 1. Further, p** ,,~ p. PROOF. For proving p** is a quarter-norm only the subadditivity has to be checked (since the rest of the properties are clear). If p ( x + y ) = 0 then p * * ( x + y ) = 0 and then the subadditivity holds trivially. Next assume that p(x + y) > 0. Then 0 < p ( x + y) <~p(x) + p(y), whence 1§
1
p(x + y)
/> 1 §
1
p(x) + v(y)'
so that
+ y)
=
1
p(x) + p(y)
1 + v(~lu) <" 1 + p(z)+p(y) 1
<.
1 § p(x)
+
--
1 § p(x) + p(y)
P(Y) - ;* *(x) § v* *(y). 1 +p(y)
The boundedness of p** is evident from its definition. Also, the definition of p** shows that p** (x, - x) -~ 0 iff p(xn - x) ~ O, whence p** ~, p, completing the proof. 3.1.11.
Let X be a L S over K. A is a quarter-norm iff X is a T L S un-
PROPOSITION.
sad. functional p on X der the p-topology.
PROOF. This follows from 3.1.5 (i) and the observation that the condition (Q6) is equivalent to the continuity of the map (A,x) ~-~ Ax in the p-topology. 3.1.12.
COROLLARY. A T L S X
is quarter-normed iff it is
first countable.
PROOF. Since the p-topology is first countable (see 3.1.4) we have only to prove the "if" part. If X is first countable then by 2.1.7 it has an invariant (with respect to addition) semi-metric d.
105
w 1. Quarter-norms
By 3.1.2, p(x) -- d(x, 0) is a sad. functional which is, by 3.1.11, a q u a r t e r - n o r m , so t h a t X is quarter-normed. 3 . 1 . 1 3 . R e m a r k . It can be shown easily t h a t if X - (X, p) is a q u a r t e r - n o r m e d LS then it is complete as a TLS iff it is complete with respect to p (i.e. with respect to the semi-metric dp). Such a q u a r t e r - n o r m p is called a complete quarter-norm. 3 . 1 . 1 4 . Let X be a LS over K and p a faithful quarternorm. Then X with the p-topology is called a pre- (F) space. The q u a r t e r - n o r m in this case is called a (F) norm and will be usually denoted in the sequel by I" I. If the (F) norm 9I is complete then X is called a ( F ) s p a c e . Note t h a t a (F) space is a complete metric linear space. 3 . 1 . 1 5 . THEOREM (Open mapping theorem). If T is a continuous linear transformation of a (F) space X onto a (F) space X* then T is open (i.e. T maps every open set of X on an open
8at of x* ). PROOF. See [22, p.48]. 3 . 1 . 1 6 . THEOREM (Closed graph theorem). Let X , X * be (F) spaces. If T : X ~ X* is a linear map which is closed then it is continuous. (A map T : X ~ X* is called closed if xn--~ x in X and T x n - - ~ y in X* ~ y = T x . ) PROOF. See [22, p.50]. 3 . 1 . 1 7 . Let P be a family of quarter-norms p on a LS X. Then the P - t o p o l o g y on X is t h a t topology in which a net x~ --~ x iff p(x~ - x) --~ 0 for each p E P. It is easy to see t h a t X is a TLS under the P -topology. If the family P consists of a single p then the P - t o p o l o g y reduces to the p-topology defined in 3.1.4. A neighbourhood basis for a point x0 in X, in the P topology, is given by the family of all sets of the form h[(Xo 9 "Pl,''"
,Pn, s -- {X E X ' p j ( x
-- Xj) < e , j -
1,...
,n}
where P l , " " ,Pn E P and e > 0. We write X = (X, P) to denote X with the P-topology.
106
Some
Types o f Topological A l g e b r a s
Two families Pl, P2 of quarter-norms on X are said to be Pl "~ P2 if the Pl-topology and the P2topology are the same: (X,)~ - (X, P2) (cf. equivalence of 2 sad.'s in 3.1.4). e q u i v a l e n t , in symbols,
3.1.18. X
LEMMA.
If pj(j
-- 1 , . . - , n )
are q u a r t e r - n o r m s
on
so are P -- Pl + "'" + Pn,
Further,
p ~ {Pl,'",Pn}
q -- Pl V . . .
V Pn
'~ q.
PROOF. By 3.1.7 (b), p and q are sad. functionals. The verification that they are also quarter-norms is straightforward. Further, since p(x
- x)
o
p i ( x a - x) ~ q ( x ~ - x) ~
0 (j-
1,...,n)
0
the equivalence statement follows. 3 . 1 . 1 9 . LEMMA. ( a ) I f p , p * are q u a r t e r - n o r m s t h a t there are c o n s t a n t s C 1 , C 2 > 0 s a t i s f y i n g
Cap <~p* <~C2p
on X
such
(,)
t h e n p ,,~ p *.
(b) I f p is a q u a r t e r - n o r m n o r m with tp ,~ p.
and t > 0 then
tp
is a q u a r t e r -
PROOF. (a) This is an immediate consequence of the inequalities -
p*
-
-
(b) T h a t tp is a quarter-norm is clear. The equivalence assertion follows from (a) (taking p* - tp, C1 - C2 - t). 3 . 1 . 2 0 . If P is any family of quarter-norms (or more generally sad. functionals) on X we write kerP-Nkerp
(pEP).
A net (x~) is called a C-net with respect to a quarter-norm p if given c > 0 there is an a0 - a0(c) such that p ( x ~ - xf~) < e for
107
w 1. Quarter-norms
all a, fl >- a0. It is called a C-net with respect to a family P of q u a r t e r - n o r m s if it is a C-net with respect to each p in P. X is called P - c o m p l e t e if every C-net with respect to P converges in X. 3 . 1 . 2 1 . LEMMA. Let X family of quarter-norms on X .
(X,P) Then:
be a TLS, where P is a
(i) B~,v - {x c X " p(x) < e} is a s y m m e t r i c nucleus of X , for each p E P. (ii) 0 -
{0} - ker P, where bar denotes closure in X .
(iii) X
is Hausdorff iff ker P - {0}.
(iv) X
is a complete T L S iff it is P - c o m p l e t e .
(v) If f is a continuous functional on X ker P ___ ker f.
with f ( O ) - 0
then
PROOF. ( i ) B y definition of P-topology, B~,v is a nucleus of X; further it is s y m m e t r i c since p ( - x ) - p ( x ) ( x e X ) . (ii) Since p(0) - 0, for any p, 0 E ker P. Now ker P is closed by virtue of 3.1.5 (iii). So, 0c_ k e r P . If x E k e r P , p(0-x)-p ( - x ) - p(x) -- 0 (Vp), so that 0 , 0 , . . . ~ x, whence x e 0. Therefore 0 - ker P. (iii) This follows from (ii) and 2.1.13. (iv) This is clear from the definitions of the C-net and P topology. (v) If x c k e r P - 0, we have 0 , 0 , . . . ~ x. By continuity of f, the sequence f ( 0 ) , f ( 0 ) , . - . ~ f(x). Since f(0) - 0, we get 0 , 0 , . . . ~ f ( x ) . By uniqueness of limit property in K, we conclude t h a t f ( x ) - O, completing the proof. 3 . 1 . 2 2 . PROPOSITION. Let X (X,p) be a quarter-normed L S and Xo a subspace of X . Write X # - X / X o and define p# on X # by p # ( x + X0) - i n f { p ( x - 4 - a ) ' a e X0}. The
I't "
(i) The canonical map ~r " x ~ x + Xo - x # - r ( x )
satisfies
Some Types of Topological Algebras
108
(ii) The functional p# is a quarter-norm. (iii) The topology of the quotient space X # is induced by p#. (iv) p# is faithful i g Xo is closed in X. (v) If p is complete so is p#. PROOF. (i) Evident. (ii) We have
p#(x + y+ Xo)
<.
p(x+y+a+b)
<.
p(x + a) + p(y + b), so that
p#(x+ y+Xo) .< p# (~ +
(a, b E X o )
Xo) + p#(~ + Xo).
Since O C X o and p ( O ) - O , we get p#(O # ) - 0 . Again p(x) - p ( - x ) :=>p(x #) - p ( - x # ) , where x # - x + X o . Thus p# is a sad. functional. Suppose now that xn# -+ x #, )~,~--+ ~. Since
p# (~.# - ~#1 - p# ((~. - ~1#1 + o, using the definition of p#, we can first fix x,~ E r - l ( x # ) , 7r-l(x #) and then choose suitably an r Xo such that p(xn + an - x) < p#(x#n -- X# ) + -
1 12
x e
(n -- 1 , 2 , ' ' ' ) .
So p(xn + a,~ - x) --~ O. Since p is a quarter-norm we obtain p(An Xn + )tn an -- ,XX) --~ O, whence by using the inequality in (i)we get p# (~nX#n-)~x #) -+ O, which shows p# is a quarter-norm. (iii) Consider the ball B # - B # ( x # , e ) - {y# E A # 9 p# ( y # - x #) < E}. We shall show that B # is open in the quotient topology. Now -1(B#)
--
rr-l(B#(x#,e)) -
U B(x + a,e) aEXo
and hence open in A. Since, by 2.1.18, r is an open map, B # = 7r(~r-l(B#)) is open in the quotient topology. It follows that every
w1. Quarter-norms
109
open set of (A #, p#) is open in the quotient topology. Conversely, let G # be an open set in the quotient topology and x # E G #. By continuity of r, r - l ( G #) is open in A and so we have" (,) 7r-l(-G #) ___B(x,e) for any x e r - l ( x *) and some e - e~ > 0. If y# e B # ( x #) then p # ( ( y - x) #) < e, whence p ( y - x+ a) < e for some a c X 0 . Then y + a e S ( x , e ) C 7r-l(G #) (using, ( , ) ) , and y# - r(y+a) E G #, whence G # is open in the p#-topology. (iv) Now p#(x+Xo) - 0 r x e -Xo where bar denotes closure in the p-topology. It follows that p# is faithful iff x E X0 =~ x E X0, i.e. iff X 0 - X0. (v) Suppose that p is complete and (xn~) is a C-sequence of X #. We can find a subsequence (X~k) with 1
Choose inductively xk E X with r ( x k ) - x#~k and p(Xk,Xk+l) < is a C-sequence of X and so xk --~ x (say) in X 21k . Then ( x k) (since p is complete). By continuity of r,
and since (x L ) is a subsequence of the C-sequence (x~) we have also x~n--, x #, proving p# is complete. 3.1.23.
DEFINITION.
Let X be a TLS of the form X (3O
(X, P), where P is a family of quarter-norms. A series ~
xn in
n----1 (3(3
X is said to absolutely converge if ~
p(x,) converges for each
n--1
p~P. 3.1.24. L EMMA. Let X (X, P) be sequentially complete ( in particular, complete). Then every absolutely convergent series (x)
xn converges in X. n=l
PROOF. This follows from the inequality.
p(Zn+l -~- "'" -~- Zn+k ) <~ p(Xn+l) -~- ''" + p(Xn+k)(p E ~).
110
Some Types of Topological Algebras
3 . 1 . 2 5 LEMMA. Let T " X ~ Y be a continuous transformation (not necessarily linear) with T O - O, where X (X, P), Y - (Y, Q) are T L S ' s and P, Q families of quarter-norms. Then for x E ker P, q z ( T x ) - O for all qz E Q. PROOF. By continuity of T,
T x , T x , . . . ~ TO - O. So q~(Tx) ~ q~(O) - O, whence q z ( T x ) - O.
w 2.
p-Seminorms
3 . 2 . 1 . DEFINITION. Let X be a LS over K and p a real n u m b e r such t h a t 0 < p ~< 1. A real-valued function p = p(x) on X is called a p - t seminorm if it satisfies: (Q3) p(x + y) <~p(x) + p(y) for all x, y e X; (Q7) p(Ax) = IAIOp(x) for all x e X, A e N. If in the above, p = 1 t h e n p is called a seminorm. (Q7) is called p-modulus homogeneity (modulus homogeneity if p - 1) c o n d i t i o n and p is called the homogeneity index of p. A p-seminorm (respy. s e m i n o r m ) p is called a pnorm(respy, norm) if p is faithful (i.e. satisfies (Q5) of 3.1.1). 3.2.2. Remark. The h o m o g e n i t y index of a p ~= 0 tt is uniquely d e t e r m i n e d ; for, if p is b o t h p - s e m i n o r m e d and p~s e m i n o r m e d then for an x0 with p(xo) ~ 0 we have p(2x0) -2 P p ( x 0 ) - 2P'p(x0), whence p - p'. 3 . 2 . 3 LEMMA. If p j ( j - - 1 , 2 , . . . , n ) then so are
P = pl + " " + p , , [q defined as in 3.1.7).
are p - s e m i n o r m s on X
q = pl V " " V P,~.
PROOF. S t r a i g h t f o r w a r d and so o m i t t e d . t In literature the letter p has been used in the place of our p. We have adopted p to avoid conflict with p used by us with a different connotation. tt i.e. p is not identically 0.
w 2. p - S e m i n o r m s
3.2.4.
111
PROPOSITION.
Every p - s e m i n o r m p, on X is a quarter-norm. In particular it satisfies ( q l ) , (Q2), (Q4) of 3.1.1 and also (i), (ii) of 3.1.2.
PROOF. By taking in ( Q 7 ) , ) ~ - 0 , - 1 successively we get (Q1),(Q2), so t h a t p is a sad. fnctional To show that it is a quarternorm we have to prove (Q6). Using the identity (.) of 3.1.8, (q3) and ( Q 7 ) w e get
from which (Q6) readily follows. 3.2.5. LEMMA. Let X be a TLS, p a p - s e m i n o r m on X and V - {x C X " p(x) < 1}. Then p is continuous iff O e Y ~ int V) PROOF. If p is continuous then since p(0) - 0 there is an open nucleus U such that if x E U then p(x) < 1. This implies that 0 E U c_ V ~ Conversely, if 0 E V ~ then, using 1
1
2.1.10, we get c~V ~ is an open nucleus. If x E V ~ y - e~ x then p(y) - Ep(x) < c. Hence p is continuous at 0 and so everywhere (by 3.1.3). 3.2.6. If p is a p-seminorm on a LS X then the resulting TLS, X = ( X , p ) (cf. 3.1.4)is called a p - s e m i n o r m e d LS. If p is a p - n o r m then X is called a p - n o r m e d LS. We generally denote a p - n o r m by the symbol ]I" ]] instead of p. Further, if p = II" II is complete then X is called a p - B a n a c h space (a B a n a c h space if p - 1). A p-seminorm p and a p~-seminorm p~ are said to be equivalent, p ~ p~, if they are equivalent as sad functionals (i.e. if they induce the same topology). 3.2.7.
LEMMA.
Let X -
(X,p)
be a p - s e m i n o r m e d LS.
Then we have"
(i) If B~ -
{x E X " p(x) < r},-B~ - ( x e X " p(x) <. r} then Br is the (topological) closure of Br in X , where r E N,r > O. Further more, Br (respy. Br) is a balanced open (respy. closed) nucleus of X .
(ii) Let (r,~) be a sequence of positive numbers with rn ~ O. If
112
Some Types of Topological Algebras V, - Br., Un - B~. then {Vn}, {Un} are bases of nuclei. PROOF.
(i) Trivially,
B~ __C B~. By continuity of p (see 1
3.1.5(iii)) B~ is closed. For x E B~, set xn - (1 - ~-i)l ~X. Since
p(xn) <~ (1
1
n+l
)r < r
(n-
1 2 --.) ' '
x,~ c B~ and clearly x,~ ~ x. It follows t h a t Br is the closure of Br (ii) If n is sufficiently large then we have
V,,U,~ c_ B , -
)r
Hence the result. 3 . 2 . 8 . LEMMA. connected.
A p - s e m i n o r m e d LS X -
(X,p)
is locally
PROOF. Since {B~ 9r > 0} is a basis of nuclei, it is enough 1
to show t h a t (each) B~ is connected. But B~ - r~B1 is homeomorphic to B1 (see 2.1.10), so t h a t it suffices to prove t h a t B1 is connected. Now B1 is p a t h - c o n n e c t e d (and hence connected), since if x E B1 then p(x) < 1 and { t x " 0 ~< t < 1} is a p a t h in B1 joining 0 and x. 3 . 2 . 9 . LEMMA. If p is a p - s e m i n o r m (O < p ~ 1) on a LS p, X (over ~) and O < p ~ < . p . Then q - p 7 isa pl_seminormwith q ... p. In particular, if p is a seminorm, pP is a p - s e m i n o r m with pP ~ p. P' -- t, so t h a t 0 < t ~< 1 , and q - pt . If PROOF. Write -~ x, y E X then
q(x + y)
-
+
.<
.<
+ p(y)'
(since 0 < t ~ 1)
<~
q(x) + q(y).
Also, if A E ~:,
qCAx) - p(Xx) t -IAl~tp(~)
t
-I)~}V'q(x).
w 2. p -Seminorms Finally, it is clear t h a t q ( x , - x ) proving q .-- p.
113
- p ( x , ~ - x ) t ---, 0 iff p ( x n - x ) ~ O,
Let ( X , p ) , (X*,p*) be respy, a ps e m i n o r m e d LS and a p~-seminormed LS. Let T : X --~ X* be a linear transformation. Then T is continuous iff there is a constant C > 0 such that 3.2.10.
PROPOSITION.
p* (Tx) ~ Cp(x) p'/~
(x E X ) .
(,)
PROOF. Suppose (,) holds. Then
p* (Tx~ - T x ) - p* (T(x~ - x)) <~ Cp(x~ - x) p'/p whence T is continuous. Conversely, suppose t h a t T is continuous. By continuity of T at 0, given e > 0, we can find 5 > 0 such t h a t p* (Tx) ~<e whenever p(x) ~< 5. (**) For any x with p(x) r O, write y - 5 l / p x / p ( x ) ~ . T h e n p ( y ) so t h a t by (**) we have p*(Ty) <~ e, which reduces to
p * ( T x ) <~ Cp(x) p'/p,
with C -
e/5 p'/~
5,
(,)
Suppose next p(x) = O, then for any integer n, p(nx) = O, so t h a t by (**),
p * ( n T x ) <. e, i.e. nP*p*(Tx) <~ e. Since n is a r b i t r a r y we conclude t h a t p*(Tx) - 0, so t h a t the inequality (,) holds in this case as well. The proof is complete. 3 . 2 . 1 1 . COROLLARY. Let p,p* be respectively a p - s e m i n o r m and a p * - s e m i n o r m on a L S X. Then
(i) p* is continuous in the p-topology iff there is a constant C > 0 such that p*
p* <.cpo
(,)
(ii) p* ..~ p iff there are constants C, C* > 0 such that ,
p
P
cpo,
p
(**)
Some Types of Topological Algebras
114
(iii) Suppose that p* - p. Then p* , ~ p C1,C2 > 0 such that
C l p <~p* <~ C2p.
iff there are constants
(* * *)
(iv) If p is a p -seminorm on X and C > O, then so is p* - Cp; further, p* ,,~ p. PROOF. (i) This follows from 3.2.10 by taking X* = X and T = 1z (the identity map) (ii) This follows from (i) (by considering also the continuity condition for p in the p*-topology). (iii) This follows from (**) (taking C1 = l / C * , C2 -- C). (iv) Clear. 3 . 2 . 1 2 . DEFINITION. Let p be a p - s e m i n o r m on a LS X. A subset S of X is said to be bounded with respect to p or p-bounded if there is a constant M > 0 such t h a t
p(x) <<,M for all x E S, i.e. p[S is bounded. If p - II" II is a p - n o r m then instead of p - b o u n d e d we also say norm bounded or n.bounded. 3 . 2 . 1 3 . PROPOSITION. Let X (X,p) be a p - s e m i n o r m e d LS. A subset S of X is bounded ( i . e . t . bounded) iff it is p bounded. PROOF. Assume t h a t S is bounded. Since B - {x E X 9 p(x) < 1} is a nucleus of X, there is a Ao ~: 0 such t h a t S __c AoB. If x E S , x - A o a ( a C B ) then p(x)-
]A0iPp(a) < IA0[p so t h a t piS is b o u n d e d .
Conversely, assume t h a t p(x) < M for all x E S. Let V be any nucleus. Then we can choose e > 0 such t h a t
{x
<
_c V
Write r / - e/M. If x E S then 1
E
115
w 2. p - S e m i n o r m s 1
1
1
so t h a t r/~S___ BE, or S___ r/- ~ BE ___ ,kV, where , k - r / - -p. This proves S is bounded. 3 . 2 . 1 4 . COROLLARY. Every p - s e m i n o r m e d LS X bounded.
PROOF.
is locally
B1 is a bounded nucleus for X. oo
3.2.15.
COROLLARY.
If
~
Xn is a convergent series in
r~=l
X
-
(X,p),
then the sets {Xl,X2," "} arid { 8 1 , 8 2 , ' ' ' }
where
n
sn - ~ xj , are p -bounded. j=l
PROOF.
Since the sequences
(sn)
of partial sums
s,
=
tz
xj converges, by 2.3.7(a), (sn) is bounded and so, by 3.2.13 j-1 { S l , S 2 , " ' } is p - b o u n d e d . Suppose that p ( s , ) < ~ M for all n. Then p(Xn) -- p(Sn -- 8 n - l ) ~ p(sn) + p(sn-1) < 2M,
whence
{Xl, X2,'" "}
is bounded.
3.2.16. THEOREM (Banach-Steinhauss). Let X be a p Banach space and {Y~ : ~ E A} be a family of p - n o r m e d linear spaces and Tc~ : X ~ Y~ a family of continuous linear transformations. If for each x E X there is a Cz > 0 with ]]Taxll ~< Cz for all c~ then there is a C > 0 such that" IIT, II t <. c for all c~. PROOF. tt For each positive integer n, write X , ~ - {x E X " IIT~(x)Jl ~< n for all c~}. The continuity of the Ta and the fact t h a t II" II is a p - n o r m (see 3 . 5 . 7 ) i m p l y t h a t X,~ is closed in X. Furthermore oo
U Xn--X(sincexEXnifn>lCz). n--1
t IIT~II is the same as the bound IT~[ of To defined in 3.5.1. tt Follows closely the exposition of the proof of the theorem for Banach spaces given by Simmons [26, p.239]
Some Types of Topological Algebras
116
Since X is a complete metric space, by Baire's category t h e o r e m there is an X~ o ~- 0. It follows t h a t Xno contain a ball So B o - {x c X " t l x - x011 < r0} Therefore /IT~(x)II ~< no for all x e So, and all a or briefly IIT~(So)[[ ~< no for all a. Clearly S -
SO -- x 0 1
(,)
is the closed unit ball.
_
If x E S ,
x
y - x0 1 (y E So), then _
ilT~(x)l I _ ]]Ta(y)- Ta(x0)]l ~< ro
no § no ro
=
2no
= C( say )
ro
(using (,) and noting xo E So). By 3.5.2, IiTall ~< C, completing the proof.
w 3.
Quarter-normed
Algebras;
(F)
Algebras
3 . 3 . 1 . DEFINITION. Let A be an algebra (over ~:) and p a q u a r t e r - n o r m on A as a LS. Then (A,p) is called a quarternormed algebra if p satisfies the condition (QA) If p ( x , - x), p(yn - y) ~ 0 then. p(xny,~ - xy) --~ 0 (here (xn), (Yn) are sequences of elements and x , y elements, of A). It is clear t h a t (QA) is precisely the condition needed to make A a TA under the p-topology. More generally, if P is any family of q u a r t e r - n o r m s on A with each p E P satisfying (QA) then A is a TA under the P topology; A with the topology will be referred to as a P - a l g e b r a . 3.3.2. PROPOSITION (Arens). Let A be a WTA whose topology is induced by a complete quarter-norm p. Then A is a (complete) quarter-normed algebra. PROOF. It is clearly sufficient to prove t h a t A is a TA (under the p - t o p o l o g y ) . Set U, - {x e A ' p ( x )
1 < -} n
(n - 1 , 2 , . - . ) .
w
Quarter-norm Algebra; (F) Algebras
117
T h e n U , is closed (since p is continuous) and s y m m e t r i c (since
p ( - x ) - p(x)). Thus, by virture of 3.1.21 (i), {U~} is a basis of closed s y m m e t r i c nuclei. We shall now show t h a t for any closed s y m m e t r i c nucleus U and element x E A there is an integer no such t h a t
xU,~o C_ U + U. Write
An - {x C A" xUn C_ U}. T h e n A , is closed. For, if x~ E A~ and x , ~ x in A then for any y E Un, xny ~ xy (since r~ is continuous), so t h a t xy E U (U being closed), whence x E An and An is closed. Since l~ 9 y ~ xy (x E A) is continuous at y - 0 there is an n such t h a t xUn c_ U, so t h a t x E An. This means t h a t OO
LJ An - A. Since A is complete semi-metric it is Baire (i.e. of n--1 the second category), t Consequently there is an no such t h a t A.o D B -
e X "p ( x -
< r0}
for some Xo C X and r0 > 0. If x C A and p(x) ~ r0 then y-
x + x0 E B __ A~o;
in p a r t i c u l a r xo - 0-4- xo c Ano. It follows t h a t zU.
o -
yU.
o -
x 0 U . o __ U +
U.
Given any nucleus V, we can find, using 2.1.14 (vi), 2.1.16 (iii), a closed balanced (hence s y m m e t r i c ) nucleus U with U + U __ V. Therefore
xU,~o C_ U + U C_ V. This means t h a t if
p(x) < r0, p(y) < t See [16, pp.200-1]
1
no
(i.e. y E Uno)
Some Types of Topological Algebras
118
then xy E xUno c_ V, proving t h a t the map (x, y) ~ xy is continuous at (0,0), whence by 2.2.3, A is a TA. 3 . 3 . 3 . DEFINITION. Let S be a (multiplicative) semi-group and p a non-negative real-valued function on S. The function p is called submultiplicative or sm. if
p(x, y) <~p(x)p(y)
for all x, y E S.
The function p is called almost submultiplicative or a.sm. if there is a constant C > 0 such t h a t
p(x, y)<~ Cp(x)p(y)
(x, y E S).
The smallest constant C satisfying the above inequality is denoted by [Pl, and we have"
p(xy) <~ ]plp(x)p(y). It is clear t h a t p is sm.
iff [p[ ~< 1. Also, for any a. sm.
p, if
p*(x) = [pip(x) then clearly p* is sm. 3 . 3 . 4 . LEMMA. (Zelazko). Let p on S be sm. Then, for any x c S either p(x") >1 1 for all n >>.1, or p(x n) ~ O. PROOF. Then
Suppose t h a t p(x ~~ < 1 for some integer no > O.
p(x .O)
o
k
Write M m a x { p ( x " ) : 1~< n<~ no}. Given e > 0, choose No such t h a t for k>lNo, p(x kn~ < ~ . Write N - N o n o . Then for n>~N, n = q n o + r , with q / > N and r < n 0 . Hence
p(X n) ~ p(xqn~
e .Mr) < --~
e,
and p(x '~) --~ O. 3 . 3 . 5 . DEFINITION. Let p be a non-negative real-valued function on the semi-group S. Set up(x) - lim sup p(x '~) -};up (x) - sup p(x n) 88 n----4 O 0
n
w
Quarter-norm Algebra; (F) Algebras
119
Then clearly 0 ~< ~;(x) ~< ~;(x) ~< ~r Moreover, it is evident t h a t v p ( x ) < oo iff vp(x) < oo. 3 . 3 . 6 . LEMMA. (Gelfand t ) . For an a. sm. p we have
Up(X)-
lim p(xn) -} < oo
(x E S).
tl----*oo
If p is sin. then we have also u p ( x ) - i n f . p ( x = ) 8 8 PROOF. Assume first that p is sm. and set c - i n f p(x'~)~ (<. p(x) < oo). n
Then, given c > 0, there is an integer k > 0 such t h a t 1
p ( z k) -~ < c + ~.
(1)
For any integer n > 0, we write
n -- q(n)k + r(n)
(2)
where q(n), r(n) are non-negative integers with 0 ~< r(n) < k. Then
1
qCn)
rCn)
k
n
nk '
so t h a t
q(n) n
---~
1 k
~
as
D,-----~
c~
(3)
(since r ( n ) / n k < 1). Using ( 2 ) a n d sm. property of p we get n
(4) Using (1), we have, for sufficiently large n,
c < p(x ~) .~- <~ p(xk)-~ + e < c § 2e (using (1)). t He obtained the result for a sm. norm.
(5)
120
Some Types of Topological Algebras lim p( x n) •n
Therefore
--
C.
~ - - - + OO
Now suppose that p is a.sm. and write p* - ]pip. Then p* is sm. and so up. (x) -
lim p* (x ~) 88 exists. But n----~ c o
lim p*(x")-~-
n----~ O 0
lim Ipl 88188
lim p(z") 88
n----~ O 0
since Pl !- ~ 1, and so uv(x ) -
n------~O 0
lim p(xn) ~.
3.3.7. PROPOSITION. Let p t be an a.sm. function on S. Then u(x) - vp(x) (x e S) has the following properties: (i) 0 ~< u(x) <~ IPlp(x); in particular p ( x ) - 0 (ii) (a) v ( x y ) -
~ u(x)-
O.
v(yx) (b) v(x k) - v(x) k.
(iii) If x ~ y then u(xy) <~ u(x)u(y). (iv) If u is an idempotent with p(u) > 0 then u ( u ) -
1.
(v) If S has unitytt e and p # O then u ( e ) - l, and for any invertible x E S, u(x) > O. (vi) If p is sm. then:
0 <<. v(x) <~ p(x), and v(x) - p(x) iff p(x 2) - p(x) 2 iff p(x n) p(x) n (for integers n >1 1). PROOF. (i) We have p(x")<~ Ip]n-lp(x) ", whence v(x) -
lim p(x '~) !- ~< lim [ p l l - ~ p ( x ) tl---~ O 0
It---* O 0
IPlP(~).
(ii) (a) By observing that
(xy) n -- x ( y x ) n - l y ( n
>/ 2)
we obtain
p((xy) n) <~ Ipl2p(x)p((yx)n-1)p(y) t As always we assume p # 0. t t i.e. S is a monoid.
(1)
w
121
Quarter-norm Algebra; (F) Algebras
so t h a t n ~ [p[-~p(x) n [ p ( y x ) n - 1 ] - ~ p ( y ) n .
(2)
If p(x) or p(y) - - 0 then it follows from (1) t h a t
;((xy)")
- o, ~(~y) - o , . ( y ~ )
- 0
(interchanging x, y)) so t h a t in this case we have v ( x y ) - v(yx). Next consider the case p ( x ) , p ( y ) > O. By allowing n ~ 0o in (2) we obtain v(xy) <~ v(yx), so t h a t by s y m m e t r y consideration we conclude t h a t v ( x y ) - v(yx). (b) v(x k) - l i m , p(xk~)~ - l i m , . , ( p ( x k ' ~ ) ~ ) k -- v(x) k. (iii) Since x +-+ y, (xy) ' ~ - x'~y n. Therefore
l~;(~.y,)-~
- ~< lim [p[ 88
'~)
n
~<
~(~)~(y).
(iv) v(u) - l i m , p(u n) 88- l i m , p(u) 88- 1 (since p(u) > 0). (v) Since p :fi 0 there is an xo in S with p ( x o ) > 0. Then 0 < p(xo) - p ( e x o ) <~ [p[p(e)p(xo), whence p(e) > 0. Taking u - e in (iv) we get ~ ( e ) - 1. Again since 1 - v(e) ~< v ( x ) v ( x - X ) , v ( x ) > 0. (vi) The inequality herein follows from (1), since p being sm., p ~< 1. We now assume that p(x 2) -p(x) 2. By iteration we get p(x 2k) -- p(x) 2k
(k - 1, 2,...).
For a r b i t r a r y integer n > 1, choose integer k such t h a t n < 2 k and write 2 k - n § m ( m > 0). Then 8'
p(x)";(x) ~
=
p(x) 2k -- p(x2~) < p(xn)p(x ~)
<
p(x'~)p(x) m
whence p(x) ~ <~ p(x=), so t h a t p(x) '~ - p(xn). Hence it follows from its definition t h a t u(x) - p(x). Conversely, if u(x) - p(x) then
122
Some Types of Topological Algebras
so that p(x n) - p(x) '~. This completes the proof of the proposition. 3.3.8. If A is an algebra, by conAdering the underlying multiplicative semi-group of A we can speak of an a.sm. or a sm. quarter-norm or p-seminorm on A. 3.3.9. LEMMA. Let p be an a.sm. quarter-norm on an algebra A. Then ( A , P ) is a quarter-normed algebra. More generally if P is a family of a.sm. quarter-norms on A then ( A , P ) is a P -algebra. PROOF. Using the identity x.y.
- ~y -
(~, - x)(y.
- y) + ( ~ , - x ) y + ~ ( y .
- y)
(.)
and a.sm. property of p we get
p(~y.-~y) <<.Ipl{p(~.-~)p(y.-y)+p(~.-~)p(y)+p(~)(p(y.)-p(y))}.
(**)
It follows from (**) that p satisfies (QA) of 3.3.1, whence (A,p) is a TA. Similarly, since each p E P satisfies (**), ( A , P ) is a TA. 3 . 3 . 1 0 . LEMMA. Let A be an algebra. Then we have" (i) If p is an a.sm. quarter-norm (respy. p-seminorm) then tp(t > O) is also an a.sm. quarter-norm (respy. pseminorm) with tltp I - [ p l , tp ,,~ p. (ii) If p is a sm. quarter-norm (respy. p-seminorm) and t >>,1 then tp is also a sm. quarter-norm (respy. p-seminorm). (iii) If p is a.sm. then p * - [ P I P is sin. and p*,,~ p. PROOF. (i) Clearly pl _ tp is a quarter-norm (respy. pseminorm). Also,
p'(xy)-
tp(xy) <<.tlplp(x)p(y ) <<.t-llplp'(x)p'(y).
So we have [p'[ ~ t-1]p]. Similarly, by considering p - t - l p ' we get IP ~ tip'[. Combining the two inequalities we obtain Iplt[tp I. Also, by 3.1.19 (b), tp ~ p. (ii) Since t >/1 we have t 2/> t so that tp is sm.
w
123
Quarter-norm Algebra; (F) Algebras
(iii) By (i) p* is a quarter-norm (respy. p-seminorm). Further, P*(~Y) - JPlP(~Y) < IPJ~P(x)P(Y) - P* (~)P* (Y). Finally, by 3.1.19 (b), p * ~ p. 3.3.11. LEMMA. If p j ( j 1,...,n)are a.sm. quarternorms (respy. p - s e m i n o r m s ) then q - Pl V ... V Pn is also an a.sm. quarter-norm (respy. p-seminorm) with ]q] < m.ax IPj]. 3
PROOF.
By 3.1.18 (respy. 3.2.3) q is a quarter-norm (respy. p-seminorm). Further, if C - max IPj] then
;j(xy) ~ Ipjl;j(x)pj(y) ~ c ; j ( x ) v j ( y )
(j-
1,...,n)
whence q(xy) <~ Cq(x)q(y), so that [q[ ~< C. 3.3.12. PROPOSITION. (Zelazko). Let A - (A,p) be a unital quarter-normed algebra with p a.sm. Then A is locally bounded. PROOF. Write U - B 1 - { x E A ' p ( x ) < 1}. If x ~ E U , A,~CK with A , - ~ 0 , then
Hence, by 2.1.22, U is bounded and so A is locally bounded. 3.3.13. DEFINITION. A quarter-normed algebra A - (A,p) is called a p r e - ( F ) algebra if the underlying LS of A is a p r e - ( F ) space (i.e. if p is faithful). A p r e - ( F ) algebra is called a (F) algebra if p is complete. If A is a p r e - ( F ) or (F) algebra its quarter-norm p will be usually denoted by I" I and called a (F) norm (cf. remark in 3.1.14). If the (F) norm is sm. we call A a sm. pre-(F) algebra or sm. (F) algebra as the case may be. 3.3.14. E x a m p l e s of (F) a l g e b r a s (i) Let K ~ denote the algebra of all infinite sequences x - (a~) of elements a~ from K, the operations being coordinatewise, i.e. if x - ( a n ) , y - ( f i n ) and A e K then + y - (.. + Z.), ~y-
(..Z.),
~
- (~..).
124
Some Types of Topological Algebras
Set 1
_~--~
2n
.=1
I..I 1+
I ,,I
1
where Ic~l denotes the norm or absolute value of a in K ( - R or C). It can be shown that (K ~ , I" Ioo) is a commutative unital (F) algebra over •. (ii) Denote by H ~ the real algebra of all sequences x - (qn) of elements from H (with coordinate-wise operations), where H stands for the algebra of Hamilton quaternions; H - • + ~i + ~ j + ~k, i 2 , j2 , k2 = _1, i j = k = - j i , j k = - kj, ki = - i k . Define Ixloo as in example ( i ) w i t h q~ replacing an, and Iqnl -- ( a2 + a2 + a2 + a23) 89 if qn -- aO + a l i + a 2 j + a3k. Then (Hco, I" Ico) is a real unital (F) algebra which is not commutative.
(iii) Denote by ~' the algebra (under pointwise operations) of all entire functions f - f ( z ) of a complex variable z; ~" is a unital complex algebra. The following metric I la introduced by V.G.lyer is an (F) metric on ~ 9 if co
/ -/(z)
I/1
-
-
up{l 01,
I .1 - , n
>~ 1} (see
rt--0
[6', Theorem 1, Remark 2]). It is known that the convergence under this metric is the same as uniform convergence over compacta in C (ibid, Theorem 3). The algebra ~" - (~,1" la) is a unital (F) algebra. ~' is not locally bounded (ibid, Theorem 2 ) a n d hence, by 3.3.2, the (F) norm I" la is not a.sm.. Finally, ~' is separable since the set of polynomials with complex t rationalt coefficients is dense in ~. (iv) The entire functions form an algebra also with respect to pointwise linear operations and Hadamard multiplication" if oo
f-
co
~ a , ~ z '~, g -
~
n--O
n--O
~nz '~ the Hadamard product f x g
is defined by t i.e. having rational real and imaginary parts.
w
Quarter-norm Algebra; (F) Algebras
125
oo
rt=0 (Note that pointwise multiplication of f and g corresponds to Cauchy multiplication of the associated power series.) We denote the above algebra by $ ( • ~'(• has no unity element (since 1 + z + z 2 + . . . is not entire). Also, we have clearly
If • gig <. lflGIg]a. So ~'(• - (5 (• [" [G) is a sin. (F) algebra which again is not locally bounded (note that both ~, ~'(• have the same topology). (v) Let M M([O, 1]) be the algebra of (equivalence classes) of almost everywhere defined Lebesgue measurable complex functions on [0,1]. For f E M, if we set
If[-
~0 1 § if(t)j 1
If(t)]
dt then it is an
(r)
norm and M is an
(F) algebra. The norm or metric convergence in M is the same as convergence in measure (see [28, pp.116-17]). 3.3.15.
The unitization A1 of a quarter-normed is canonically a quarter-normed algebra ( A I , P l )
LEMMA.
algebra (A,p) with
pl(,~el -~- X) --I,,~[-~- p(x) (X E A, ,~ C ~(),so that pl(el) -- 1. (*)
Further, A1 is a pre-(F) algebra or (F) algebra according as A is a pre- (F) algebra or (F) algebra. PROOF. We already know that A1 is a TA under the product topology of ~: x A (see 2.2.9). It remains to see t h a t pl (defined as in (,)) induces the topology of A1. But this readily follows since we have Pl (Ael + x~ - (Ael + x)) = ]An - A I + p(x, - x). If p is faithful, and pl(Ael + x) = 0 then IA] = O, p(x) = 0, s o t h a t A = 0, x -- 0, whence Pl is faithful. Again when p is complete, it is easy to see, using (,), that pl is complete. 3.3.16. Remark. Pl may fail to be sm. when p is sm. A counter example is provided by the unitization (~.(x))~ of the
126
Some Types of Topological Algebras
algebra ~.(x) of 3.3.14 (iv). If Pl --I" [1 then pl cannot be sm., for in that case by 3.3.12 (~'(X))l is locally bounded whence also ~.(x) which is impossible (see 3.3.14 (iv)). So [. I is not sin. (nor even a.sm.). a.a.lr.
PROPOSITION.
pr - (F) ,,Igr
A-
The metric completion A of a sm. (F) algebra
(A, p) is canonically a sm.
-
PROOF. If ~,~) E A] and ~ we define
limx,~,
- lim y,
(xn, y, E A)
+ ~) - lim(x. + y.), i~) - l i m x . y . , A& - lim Ax.. The above limits exist since the sequences defining them are C sequences, as can be verified by using the sa. and sm. properties of p as well as the property (Q6b) of p (given in 3.1.8). We extend p to i~ on A by defining i ~ ( ~ ) - limp(x,~) where xn E A, Xn --~ ~; the limit exists since p(x,~) is a C-sequence (as can be seen using 3.1.2 (ii)). It is straightforward to verify that ~ is a (F) norm. Further, fi is sm. since
P(:~9)- tl----+ limO 0 p(x,~y.) <~tl-----* lim p(x.)p(y,~) <~p(i)p(~). O0 This complete the proof. 3.3.18. LEMMA. ( A , I . t ) b e a sm. pre-(F) (i) An
x E A
with
algebra Then:
Ix[ < 1 is q. invertible iff the series
O(3
~ n=l
by
(-1)'~x '~ converges and then the q. inverse x ~ is given co
x'-~-~(-1)nx
".
(*)
n:l
In particular, if A is complete (i.e. A is an (F) algebra) then every x with Ixl < 1 is q. invertible with its q. inverse given by (,). (ii) Let A be unital with unity e. Then an element x E A with oo
] e - x] < 1 is invertible iff the series ~ n--O
( e - x) n converges,
w
Quarter-norm Algebra; (F) Algebras
127
and then the inverse x -1 is given by co
n--0
In particular, if A is an (F) algebra every x with ]e-x] < 1 is invertible with x -1 given by (**). PROOF. (i) In view of 2.2.17 it is enough to prove the "only if" part, i.e. if x ~ exists then the series ~ ( - 1 ) n x n converges to x ~. Since Ix I < 1, by 3.3.4, ]x~l ~ 0, so t h a t xn---~ 0 in A. Therefore N
N
xo~(-1)nx
n-
(--1)Nx N, whence, Z ( - 1 ) n x
n--1
n-
xlo(-1)Nx N
n--1 co
Making N - - ~ c ~
we get ~ ( - 1 )
nx n - x ' o O - x ' .
n--1
Now assume that ]. ] is complete. Since Ix] < 1 the numerical co
series ~
co
]x] n converges, whence the series ~ ( - 1 ) n x
n: 1
n converges
n: 1
absolutely and consequently, by 3.1.24, it converges and so has x ~ for its limit. (ii) The proofs are similar to t h a t of (i). 3 . 3 . 1 9 . PROPOSITION. Let A : ( A , ] . [) be a sm. ( r ) algebra-in particular a p-Banach algebra-and v - el. I . If v(x) < 1 (in particular if ]x I < 1) then x is q. invertible with co
xI - ~(-1)"x
n
,
(,)
n~l
where the series converges absolutely. Moreover, if x is q. invertible and lY - x] < (1 + ]xt]) - 1 t h e n y i8 q. invertible. Hence, every q. invertible x has an open (ball) neighbourhood B(x, (1 + Ixl) -1) co i ti g of q. i v rtibl PROOF. Since p ( x ) < 1 we can choose rl such t h a t v ( x ) < rl < 1. Then Ixn] ! < ~ < 1 for n/> N. This implies t h a t co
co
[xn] ~< ~ n=N
n-N
rl ~ < c r
(since rl < 1).
Some Types of Topological Algebras
128
(3O
If follows that the series ~ ( - 1 ) n x n--1
'~ converges absolutely and co
hence also in A (by 3.1.24).
By 3.3.18 (i), x'= ~ ( - 1 ) n x
n is
rt--1
q. inverse of x. Assume that x c A isq. invertibleand y E A (1 + Ix'l) -1. Using x' o x - 0 we have 9' o y - x' + y + ~ ' y - ( - ~
-
~'~) + y + x'y -
y -
with lY-Xl < 9 + ~'(y -
~).
Therefore
Ix ' ~ Yl < l Y - xl § Ix'llY- x l -
(1 + Ix'])ly- x I < 1.
Similarly, lyox~l < 1. It follows that x ~oy, y o x I are q. invertible, whence by 1.1.30 that y is q. invertible, as required. 3 . 3 . 2 0 . COROLLARY. Let A - ( A , I . I) be a unital sin. (F) ~lgebra with ~nity ~ If ~(x) < 1 (in p~rticul~ Ixl < 1) th~n:
(i) e • x are invertible with oo
(e -~- X) -1 -- E (--1) "xn
(*)
rt--0 oo
(e--x) -1-
Ex n n--0
(**)
(ii) If u ( e - y ) < 1 (in particular le-yl < 1) then y is invertible with co y-1 __ E (e -- y)n. (, , ,) n-'-O
PROOF. The representation (,) follows from (,) of 3.3.19 by using the fact that e + x is invertible iff x is q. invertible. The representation (**) is, of course, got from (,) by replacing x by - x . Finally the representation (***) is got from (**) by putting x-e-y.
w
3.3.21.
Quarter-norm
Algebra; ( F )
129
Algebras
COROLLARY. If x E A t h ~ y i~ i~v~rtibl~ ~ith
is
invertible
and
ly- xl < Ix-l1-1,
y-1
o(3 __ E [ X - I ( x _
y)]n x -1
n--0
H e n c e , e v e r y i n v e r t i b l e x has an open n e i g h b o u r h o o d B ( x , Ix -11-1
)
comprising invertible elements.
PROOF. Since ] X - I ( x - y)[ ~ Ix-l[ [ X - y[ < 1
[e- x-lyl-
is invertible (by 3.3.20 (ii)), and we have
x-ly
co
oo
y-lx
--(x-ly)
-1-
E(e-n--O
Hence
X- l y ) n __ E [ X - I ( x _
y)]n.
n--0
oo y--1 __ E [ X - - I ( x
__
y)]nX--1
n--0
3.3.22.
PROPOSITION.
Let p
be an a . s m . q u a r t e r - n o r m
on
an algebra A a n d x, y q. i n v e r t i b l e e l e m e n t s of A with q. i n v e r s e s x ~, y~ respy. T h e n :
p(y'-x')[1-(l+[p[p(x'))[p[p(y-x)]
p(y'-x')[1-
y' -
(1 §
p(x'))p(y- x)]
< (l+lp[p(x'))2p(y-x).
~< (1 §
p(x'))2p(y- x)if
(,) [p[ ~< 1.
(**)
P R O O F . t Write y -- x + a, y~ -- x ~ + b. Then 0 - y o (x+a) o(x'+b) which, on using x o x ' - 0, reduces to
a + b + xb + a x ~ + ab - O.
Therefore x o b - x - a - a x I - ab.
t The principle underlying the proof is essentially due to Arens who obtained (**) of 3.3.23 for normed algebras.
Some Types of Topological Algebras
130
By pre-multiplying (with respect to o operation) by x ~ we get b - x ' o ( x - a - a x ' - ab) - - a -
ax'- ab- x'a- x'ax'-
x'ab,
using x: o x - 0. It follows that
p(b)
.<
p(a) + [p[p(a)p(x') + IPlp(a)p(b) + [p]p(x')p(a) +tpl2lp(x')Up(a)-4- Ipl2p(x')p(a)p(b), so that
p ( b ) [ 1 - I p l p ( a ) - [pl2p(x')p(a)]
p(a) + 2]plp(a)p(x' ) +lpl~p(~')~p(a) = (1 -+-]p]p(x'))2p(a)
which is same as (,). When ]Pl ~< 1 it is clear that the inequality remains unchanged if we drop the terms [p[, [p[2 whence we obtain
(**). 3.3.23. PROPOSITION. If A - (A,p), where p is an a.sm. quater-norm, is unital and x, y E A are invertible then we have: p(y-1 _
X-1)[1
_
[p[2p(y_ x ) p ( x - 1 ) ] <~ [ p [ 2 p ( x - 1 ) 2 p ( y _
p(y-l--xl)(1--p(y--x)p(x-1))
X)
(*)
<~ p ( x - 1 ) 2 p ( y - - X) if ]p[ < 1. (**)
PROOF. The proof of (,) is similar to that of 3.3.22 and even simpler. Writing a - - y -- x , b - y - 1 _ x - 1 w e get e - yy-X _ (x q- a ) ( x - 1 q- b) w h i c h r e d u c e s to xb - - a x -1 - ab, i . e . b - - x - l a x - 1 - x - l a b . Applying p to both sides, using a.sm. property of p, and rearranging terms we get (,). Once again (**) follows from (,) by here omitting the term [p[2 in (,). 3.3.24. COROLLARY (Bonsall-Duncan). 1 p ( y - x) <. i p ( x - 1 ) - 1 then p(y-1 _
x-l)
~
2p(x-1)2p(y_
For a sm. p,
if
X).
1 whence the P r o o f . We have 1 - p ( y - x)p(x -1) >1 1 21 -_ ~, required inequality follows from (**) of 3.3.23.
w w 4.
p - S e m i n o r m e d Algebras; p - B a n a c h Algebras
p-Seminormed
Algebras;
p-Banach
131
Algebras
3 . 4 . 1 . LEMMA. I f p is an a.sm. p - s e m i n o r m on an algebra A and q any p - s e m i n o r m on A with q ..~ p. Then q is also a.sm. . PROOF. By virtue of 3.2.11 (iii), there are constants e l , C 2 > 0 with Clp <~q <~ C2p. Therefore q(xy) <~ C2p(xy) <<.C~IPlP(~)P(Y) <
whence q is a.sm.
C2[p[Cx2q(x)q(y),
.
3 . 4 . 2 . LEMMA. Let p be a p - s e m i n o r m on an algebra A such that the map m # " ( x , y ) ~ x y is continuous at (0,0) in the p-topology, Then: (i) ker p is a closed bi-ideal of A; (ii) p is a.sm.
.
PROOF. (i) By 2.1.13, 3.1.21 (ii), k e r p is a closed subspace of A. It remains to show t h a t it is a bi-ideal. Since m # is continuous at (0,0), given e > 0, there is a 5 > 0 such t h a t
p(x),p(y) < ~ ~ p(~y) < ~
(1)
For a given y E A we can choose n such t h a t 1
p(-Y)~ - ~ p ( y ) -<
(2)
(the choice being possible since p > 0). If p(x) -- 0 then ; ( n ~ ) = n ; p ( ~ ) = o.
From (1), (2), (3) we obtain
n
(3)
132
Some Types of Topological Algebras
Since e is arbitrary, p(xy) -- O; similarly p(yx) -- O. This completes the proof. (ii) Suppose that x, y E A, p ( x ) , p ( y ) r O. Writing 1 X 1 -- ~;/p(x);,
we find that p(xl) reduces to
-- P(Yl)
--
1 Yl~,
1 ~-~176
1
whence by (1), p(xy) <. e which
p(xy) <~Cp(x)p(y)
(4)
where C - e/5 2. If p(x) or p ( y ) - 0, then by (i), p ( x y ) - 0, so that ( 4 ) h o l d s trivially. Thus (4)holds for all x , y and p is a.sIn.
.
3.4.3. COROLLARY. Let p be a p - s e m i n o r m on an algebra A. Then A is a TA under the p-topology iff p is a.sm. . PROOF. The "only if' part clearly follows from 3.4.2. The "iff' part is a consequence of 3.3.9. 3.4.4. A TA A whose topology is induced by a p-seminorm p is called a p - s e m i n o r m e d algebra (semi-normed algebra if p = 1 ) and we write A = (A,p). A complete p-seminormed algebra is called a p-semi-Banach algebra (semi-Banach algebra if p - - 1 ). In view of 3.4.3 the p in (A,p) must be necessarily a . s m . . Such a conclusion is not possible if p were only a quarter-norm (cf. 3.3.16). Since, by 3.3.10, p* = IPlP is a sm. p-seminorm with p* ~ p, we can assume when necessary, without any loss of generality, that the p-seminorm p of (A,p) is sm. . The meaning of a p-normed or a p-Banach algebra is clear. Of course, when p = l , a p-normed (respy. p-Banach) algebra is just a normed (respy. Banach) algebra. Note that a p-normed algebra is a pre-(F) algebra and a p-Banach algebra an (F) algebra.
v-
3.4.5. LEMMA. Let (A,p) be a p - s e m i n o r m e d algebra. Then vp has the property
PROOF.
v(Ax)
-
lim.p(A"x ") 88 -
lim. lAlPp(x ")~
=
p-Seminormed Algebras; p-Banach Algebras
3.4.6. E x a m p l e s Banach algebras.
of p - s e m i n o r m e d
algebras
133
and
p-
(i) Let S be any set. The set K s of all K-valued functions f on S, under pointwise operations, is a unital commutative algebra over K. Fix a point so in S and define P o ( f ) If(s0)l. Then P0 is a sm. semi-norm on K 8 and (K~,p0) is a sm. semi-Banach algebra. For 0 < p ~< 1, if we set, p ~ ( f ) - If(s0)l p then (K~,p~) is a p-semi-Banach algebra. (ii) ~:~ is a Banach algebra under the norm
I1 11-
I ~ l t - + - ' " l,~l, where x -- ()~1,''" ,)~n) E •n.
(iii) The set Hs, where H is the 4-dim real algebra of Hamilton quaternions, is under pointwise-operations an algebra over which is not commutative. Defining, as above, po(f) If(s0)l, where I" I is now the quaternion norm (see 3.314(ii)) we obtain a real p-semi-Banach algebra (HS,p~) which is not commutative. (iv) If B - B ( S , K ) denotes the set of all bounded K-valued functions on S then B is a Banach algebra over K under the sup ( - s u p r e m u m ) n o r m : Ilflloo - s u p s ~ s If(0)l(f e B). It is commutative. Also (B, I1" I1~) is a p - B a n a c h algebra (the p - n o r m property of I1" I1~ follows from 3.2.9). Similarly, we have the real p-Banach algebra B ( S , H ) of all bounded H-valued functions with p - n o r m I1" I1~ " IIfll~ = sup~ lf(s)l p, where I" I denotes the absolute value in H (see 3.3.14(ii)) This algebra is not commutative. co
(v) All sequence (xn) of elements in K such that ~-~lxnl p (0 < rt--1
p ~< 1) form under coordinate-wise operations a tative p - B a n a c h algebra I p - l P ( K ) under the tlxllp - ~ , Ix, Ip, which is sm. (Ixylp - ~ , l x , ~,~ xnlPlY,~Ip <-Ilxl pllYlIp). More generally, if S is denote by lP(S) the set of all K-valued functions
commup-norm
y,~lp any set, f on S
134
Some Types of Topological Algebras such t h a t the generalized sum ~]8 [f(s)lP < co. T h e n lP(S) is a p - B a n a c h algebra under the n o r m Ilfll - E~ [/(s)[~, which again is sm." IlfglJ~ ~< Ilfll~lJgfl~.
(vi) Let L 1 - LI[0,1] denote the space of (equivalent classes) of absolutely Lebesgue integrable functions on [0,1]. L1 is a Banach space under the n o r m Ilfll - f l l f l ( t ) d t _ f l if(t)ldt" L 1 is closed for a multiplication ' , ' called convolution defined as follows:
f 9g ( s ) -
fo ~ f ( s - t)g(t)dt
( f 9 g exists for almost all s by Fubini's t h e o r e m and so f , g E L1). It is straightforward to check t h a t the operation 9 is associative and commutative. Thus L 1 is a c o m m u t a t i v e Banach algebra; we have IIf * gll-< ]]flf[fg]]. (See [lO,p 17]). (vii) Let S be a compact Hausdorff space C ( S ) = C ( S , K ) t h e algebra of K-valued continuous functions on S. T h e n C ( S ) is a Banach algebra under the 'sup' norm. If S is a locally c o m p a c t Hausdorff space, denote by Co(S) the algebra of K-valued continuous functions f which vanish at co (i.e. f has the property t h a t for any e > 0 there is a c o m p a c t set g = KE such t h a t f = 0 on S \ K ) . C o ( S ) i s also a Banach algebra under the sup norm; of course, if S is compact, Co(S) -- C ( S ) . If S is locally compact Hausdorff and Soo is its one-point compactification then it is easy to see t h a t C(Soo) is the unitization of Co(S). 3 . 4 . 7 . PROPOSITION (Zelazko). Let G be a discrete TG. Then the set L p = L p ( G ) = Lp(G,K), O < p~< 1, of all K-valued functions x = x ( s ) ( s e G) such that ~ , Ix(s)[P < co, is an algebra (over K) under pointwise linear operations and convolution as multiplication: if x, y E L p then its convolution product is defined by x , y ( s ) - Etx(t)y(t-ls). For s e G, set xs(t) - 1 or 0 according as s - t or s r t Then xs E L p, and the map s ~-~ x8 is 1-1 and x~, xt = x~t (so that G is multiplicatively embedded in
w4.
p - S e m i n o r m e d Algebras; p - B a n a c h Algebras
135
LP(G)). Moreover, L p is a p - B a n a c h algebra under the p - n o r m - E 8
PROOF. T h a t L p is a LS and I1" lip is a p - n o r m are clear (the
subadditivity of []. IJp depends on the inequality (s + t) p <~ s p + t p, 1). If x, y E L p
if s, t / > 0 , 0 < p ~ < [ix * Yllp
=
x ( t ) y ( t - l s ) [ p <" E
E[~ s
t
[x(t)[PlY(t-ls)[ p
s,t
Ix(t)l ( t
-<
then
ly(t-
)l
s
-
I (t)l lfylJ t
Ilxll llyll .
It follows t h a t L p is closed for convolution and t h a t I1" lip is sm. T h e proof of completeness of L p is s t r a i g h t f o r w a r d (and will be o m i t t e d ) . T h u s LP is a p - B a n a c h algebra. F u r t h e r it is clear t h a t x~ E L p and s ~-+ x~ is 1 - 1. Finally, by a simple c o m p u t a t i o n , X s 9 X t -- Xst.
3 . 4 . 8 . COROLLARY. LP(G) is commutative iff G is commutative. PROOF. If G is c o m m u t a t i v e then
x * y(s)
---
E
x ( t ) Y ( t - i s ) -- E
t
t
E
Y(U)X(8u-l) tt
Y(t-ls)x(t)
-- E
Y(U)X(u-18)
-- y $ X(8)
it
On the other h a n d , if L ~ is c o m m u t a t i v e we have xst - x8 * xt xt*x~ - xt~, st - ts (since s ~ x~ is 1-1) and G is c o m m u t a t i v e . 3.4.9. Remark. Zelazko [31, p.12, T h e o r e m 29] has shown t h a t if G is a locally c o m p a c t group then for 0 < p < 1, L p LP(G) the space of (left) Haar m e a s u r a b l e functions x(s) on G such t h a t f Ix(s)lPd~ < cc is closed for convolution multiplication iff G is discrete. Thus, under convolution, L p is a p - B a n a c h a l g e b r a only when G is discrete. L 1, on the other hand, is always a B a n a c h algebra (under convolution). 3 . 4 . 1 0 . PROPOSITION. Let W p denote the set of all continuous complex-valued 2~-periodic ]unctions f - f ( t ) on ~ having
136
Some Types of Topological Algebras oo
oo
~-~f(n)e i'u with ~ l f ( n ) t p < oo. Then
a Fourier expansion f -
--00
--GO
W p is under pointwise linear and multiplication operations a commutative p-Banach algebra (the Wiener-Zelazko algebra)with poo
norm
II~ll~- ~l/(n)ll". --(X)
PROOF. Clearly WP can be identified with the algebra L P ( ~ , C ) - L P ( Z ) - IP(Z). By 3.4.7, LP(1_)is p-Banach which moreover, by 3.4.8 is commutative (since 2z is commutative). 3.4.11. LEMMA. Let A be an algebra (over K) and A1 its unitization. Then a p - s e m i n o r m p on A has a canonical extension Pl on A1 with p l ( e l ) - - 1. If p is a.sm. so is Pl alzd lPII = max{i, IP]}. In particular, PI ~8 8m. w h e n p ~8 8m. Further, Pl is faithful or complete according as p is faithful or complete. PROOF. Define Pl by setting for x 1 E A I , X l -- )~el + (x E A) p l ( X l ) -- I)klp -+- p ( x ) . Clearly p l ( e l ) -- 1 and P l is a p - s e m i n o r m o n A1. If p is a.sm. and Y l - - # e l § then x
-
pl(XlYl)
If C -
I~1 ~ + p(~y + ~ + xy) I~1~1~1~ 4-IAIPp(y)+ I~lpp(x)+
Iptp(x)p(y).
(,)
max(1, lpl ) then ( , ) i m p l i e s
p l ( X l y l ) <~ c(l~l
~+
p(x))(l~l ~ + p(y)) - c p l ( X l ) p l ( y l )
(**)
whence ]Pll ~ C. On the other hand, IPl < [pl[ and 1 - p l ( e l ) Pl(e2) ~< Ipllp(el) 2 - Ipx], so that [px] ~> C. Hence [ p l [ - C - m a x ( l , JpF)). If p is sin. then ]p[ ~< 1, so that [ P l ] - max(l, p [ ) 1, whence pl is sm.. Finally, that pl is faithful (respy.complete) when p is f~ithful (respy. ~omplete) follows ~s in the ~ s e of (F) norms (see proof of 3.3.15). 3.4.12. R e m a r k . Note that the canonical extension of a pseminorm p differs from the canonical extension of p as a quarternorm (except when p - 1 ). 3.4.13.
DEFINITION. A p-seminorm p on an algebra A is
w4.
p - S e m i n o r m e d Algebras; p-Banach Algebras
called normalized if p is sm., and p ( e ) unity e.
137
1 whenever A has a
3.4.14. LEMMA. Let ( A j , p j ) ( j 1,-.-,n) be pseminormed algebras. Then the product TA A - A1 • • An (under coordinate-wise operations) is a p-seminormed algebra A-(A,q) where q is given by: for x -
(Xl,...
, Xn) C A, q(x) - m a x pj(xj). 3
Moreover, Iql < maxlPjl. In particular q is sm. if each pj is sin. If the Aj are unital and pj normalized then A is unital with q normalized. PROOF. It is clear from the definition of q t h a t a sequence in A converges with respect to q iff their associated coordinate sequences converge in the respective factor spaces. But this precisely m e a n s t h a t the q-topology is the same as the p r o d u c t topology. Further, if x = ( X l , " - , x , ) , y = ( Y l , " ' , Y n ) are in A then
q(xy) - max p j ( x j y j ) <~max Ipilpi(xj)pj(yj) <~Cq(x)q(y) 3
3
where C = m a x lpj] , so t h a t Iql ~< c , as required. If pj are sm. then pj[ ~< 1, whence Iql-< c m a x l p j l - < 1, so q is s m . . Finally, if ej is the unity of A j ( j = 1 , . . . , n ) then e = ( e l , ' " , e , ~ ) is unity of A and q ( e ) = m a x p j ( e j ) = 1 (since each p j ( e j ) = 1).
3 . 4 . 1 5 . PROPOSITION. Let p be a quarter-norm on an algebra A and I be a hi-ideal of A. Write A # - A / I . Define p# on A # by p # ( x + I) - i n f { p ( x + a) " a e I}.
Then: (i) p# is a quarter-norm on A # . (ii) If p is a p - s e m i n o r m so is p#. (iii) If p is a.sm. then so is p# sm. whenever p is sm. .
with
Ip#l
~< Ipl; hence p#
is
138
Some Types of Topological Algebras
(iv) If A is unital so is A#; if i 7s A (bar denoting closure) and p is normalized then so is p#. PROOF. (i) This follows from 3.1.22. (ii) It is enough to check modulus homogenity condition for p#. Now
p#(Ax + I) -- inf{p(Ax + a) " a C I} <. IAl0p#(x+ I).
(1)
If A~=0 then
p#(x + I)
-
p#(A-1Ax q- I) ~< [A-11pp#(Ax + [).
(2)
From (1),(2)we get the homogenity condition (when)~ # 0). When A - 0 the homogenity condition holds trivially since both sides are 0. (iii) This follows from the inequality"
p#((x+I)(y+l))
<<.p ( ( x + a ) ( y + b ) ) <~ Iplp(x+a)p(y+b)(a,b E I).
(iv) Let A have unity e. Then e# - e + I is the unity of A #. Assume now that p is normalized, so that p ( e ) - 1 and p is sm. (consequently also p# is sm.) Since 7 # A,e ~ I and so p#(e #) r O. Since p#(e #) - p#(e # . e #) ~< p#(e#) 2 we conclude that p#(e # ) ) 1. On the other hand, p#(e #) ~ < p ( e ) - 1. Thus, p#(e #) -- 1, as required. 3.4.16. COROLLARY. If (A,P) is a p-seminormed algebra then the quotient A # is p-normed iff I is closed. In particular, A~ kerp is a p -normed algebra with
pC~:(x #) _ p(x) (x E A, x # -- x + ker p). PROOF. The first statement follows from 3.1.22(iv). For the second it suffices to note that if a E ker p then by 3.1.2(iii), p(x + a) - p ( x ) .
3.4.17. PROPOSITION. The completion of a p-normed algebra (A,p) is a p-Banaeh algebra (A,~). PROOF. We may assume that p is sm. The construction of and /~ is exactly as in 3.3.17. That /~ is now a p-seminorm is
w4.
p-Seminormed Algebras; p-Banach Algebras
139
an easy consequence of the definition of /3" if xn E A, ~ E A and xn ~ 3: then 16(Ax)- lirnoop(Axn ) - nlim [A[Op(xn)- ]A[PI6(X).
Let A - (A,p) be a real p-normed algebra which has a complex structure and let the resulting complex algebra A [c] be denoted by ~t. Set for x E A ( = A), 3.4.18.
PROPOSITION.
p(x)-
p(~o~).
sup
O~<0~<2~r
Then (A,p) is a complex p-seminormed algebra with p <~ P, IPl <<-lP. In particular, if p is sin. so is [~. PROOF. First note t h a t p(x) <<.p(x), since e i~ x 0 -- 0. F u r t h e r we have
~(~ + y)
supp(ei~
+ Y)) <~sup(p(ei~
0
x when
+ p(ei~
0
sup p(e i~x) + sup p(e i~y) -- I~(X) + ~(y). 0
0
Also, for a C N,
~(,r
- sup ;(e~(~§176
- r
0
For A C C we write A -
[A[ei~ and we get
sup p(IAlei~ei~
-
1$1 ~
sup p(e i~
0
0
Finally,
io(xy)
=
sup
p(~,o~y) <~sup
0
<. whence 1i6 ~< IPl.
p ~(x)p(y) <.
Iv p(~O~)p(y)
0
pl~(~)~(~),
Some Types of Topological Algebras
140
Bounded Linear Transformations p-seminormed LS's 3.5.1. DEFINITION. Let X - (X,p), respy, a p-seminormed and a p*-seminormed and T 9X --, X* a linear transformation. bounded (= norm bounded) or sometimes just a constant C > 0 such that
on
X* - (X*,p*) be LS's (with p r 0) T is said to be n. bounded if there is
p* (Tx) <. Cp(x)~ for all x E X.
(,)
The smallest C satisfying (,) is denoted by IT I and is called the bound of T; we have
p* (Tx) <~ ITIp(x)~ (x E X). We use ITII p -normed.
for ITI
when the LS's X,X*
(**) are p - n o r m e d and
3.5.2. PROPOSITION. For a linear transformation T, write
C1
=
C2
=
C3
--
sup{p*(Tx)/p(x) ~ " p(x) > 0}, sup{p* (Tx)" p(x) ~< 1}, sup{p* (Tx) " p(x) - 1}.
If T is bounded, then IT I - C 1 - C 2 - C 3 . PROOF. We see from (**) of 3.5.1 t h a t p(x) - 0 ~ p* (Tx) p
0. It follows t h a t p*(Tx) <~Clp(x)7
for all x, whence IT I <~ C1.
On the other hand, (**) shows t h a t if p(x) > 0, p*(Tx)/p(x)K ]T[, so t h a t C1 <~ [T]. Thus I T ] - C1. It is clear from the definitions t h a t C3 ~< C1. To prove the reverse inequality assume t h a t p(x) > 0,
y-
1
x/p(x)~. Then
p(y) - 1, p* (Tx)/p(x) ~ - p* (Ty), proving C1 ~< C3, so t h a t C1 -- C3"
Finally, assume t h a t 0 < p(x) ~< 1. Then
p* (Tx) <~p* (Tx)/p(x) ~ - p* (Ty) <~C3,
w5. Bounded Linear Transformations on p-seminormed LS's 141
where y - x/p(x)~, p ( y ) - 1. The inequality p*(Tx)<. C3 is also satisfied when p ( x ) - 0 (since then p * ( T x ) - 0), whence C2 ~< C3. Since trivially C3 ~< C2 we conclude that C 2 - C3, completing the proof of the proposition. 3.5.3.
COROLLARY. A linear transformation T is bounded
iff C3 < c~. PROOF. If T is bounded then by 3.5.2, C3 - IT] < c~. Conversely, assume now that C3 < co. We shall show t h a t this implies C2 < c~. Suppose to the contrary C2 - c~. Then there is a sequence (x,~) e X with p(x,~) <~ 1, p*(Tx,~) -~ cr If there are an infinity of these x,~, say xn, ( n ' - 1 , 2 , . . . ) with 0 < p(x,~,) <~ 1, then 1
setting Yn' -- x,~,/p(xn,) ~ we obtain p(yn,) - 1 and r
P*
p (Ty,,) - p ( T x , , ) / p ( x , , ) - 7 >1p* (Tx,,) ~ c~, which contradicts t h a t C3 < oc. On the other hand,if there are only a finite number of x , with 0 < p(x,~) ~< 1 then we may assume after omitting these that p(x,) - 0 for all n, p * ( T x , ) co. Since p=/= 0 there is a y with p ( y ) - 1. Set z , ~ - x , ~ - y ; then by 3.1.2 (iii), p ( z n ) - 1. Since
p* (Txn) - p* (Ty)l <~p* ( T x , - Ty) - p* (Tz,~) and p * ( T x , ) ~ oc, we get p * ( T z , ) ~ ~ , again contradicting t h a t C3 < cr Therefore C2 < cr It follows from this that for all x with 0 < p(x) we have
p* (Tx) <~C2p(x) ~-
(* * *).
1
If p ( x ) - - 0
then p ( n T x ) -
0, and since C2 < cr we get
np* (Tx) <<.C2
(n - 1 , 2 , . . . ) .
This clearly implies t h a t p*(Tx) - O, so t h a t (, 9 ,) holds for all x and T is bounded. 3 . 5 . 4 . COROLLARY. For T to be bounded it is sufficient that there exist constants C, D > 0 such that
p(x) <<.C ~ p*(Tx) <<.D.
(,)
142
Some Types of Topological Algebras
PROOF. Suppose that (,) holds. If p ( x ) C, so that by (,), we have
1
1, then p ( C - i x ) -
I
p* ( T C ~ x) <. D, whence p* (Tx) <~C - 7
p*
D.
Hence C3 (in the notation of 3.5.2) < c~, whence by 3.5.3, T is bounded. 3.5.5. PROPOSITION. Let T 9 X --~ X* be a linear transformation, where X (X,p) is a p - s e m i n o r m e d LS and X* - (X*,p*) a p*-seminormed LS. Then the following statements are equivalent. (i) T is n. bounded. (ii) T is continuous. (iii) T is t. bounded. PROOF. If T is (n.) bounded then we have p*(Tx~ - T x ) - p*(T(x~ - x)) ~ I T I p ~ ( x ~ - x)
whence T is continuous. Conversely, if T is continuous; given E > 0 there is a 6 > 0 such that p*(Tx) <<.e whenever p(x) <~ 6. Hence, by 3.5.4, T is (n.) bounded. Thus (i)+-, (ii). Since (X,p) is first countable the equivalence of (ii) and (iii) follows from 2.1.29. (We can also easily deduce directly the equivalence of (i) and (iii), using 3.2.13). 3.5.6. COROLLARY. Let p,p* be respectively a p - s e m i n o r m and a p * - s e m i n o r m on the same LS X . Then p ..~ p* iff there are contants C,C* > 0 such that 9
p
,
< ~ C pP~ ,
_P__
p<~ C , p , p * .
w5. Bounded Linear Transformations on p - s e m i n o r m e d LS's 143
PROOF. The above conditions clearly express the boundedhess of the identitly maps" (X, p) -~ (X, p*) and (X, p*) --. (X, p), whence by 3.5.5 they are continuous and so p ,~ p*. 3 . 5 . 7 . PROPOSITION. Let X - ( X , p ) t be a p - s e m i n o r m e d LS. Then the bounded linear operators T on X form a unital pseminormed algebra B - B ( X ) with the bound [T[ of T as the p - s e m i n o r m . Moreover, .[ is sm. and satisfies [I] = 1 (I being the identity operator). Finally, if p is a p - n o r m or a complete p - n o r m then so is [.[. PROOF. T h a t [. ] is a p - s e m i n o r m follows from its definition and the p - s e m i n o r m properties of p. To prove t h a t [. [ is sm. We observe t h a t
p(TIT2x) <~ [Txlp(T2x) <<.ITIIITelp(x), so t h a t IT1T2 <. ITIIIT I Trivially, I/1 = 1. Further, if p is a p - n o r m then I T [ - 0 ::> p ( T x ) - 0 :::>T x -- 0 (for all x E X) ::> T - - 0 , so t h a t [-[ is a l s o a p - n o r m . Assume now t h a t p is also complete. If (Tn) in B is a C sequence then we have
IIT - T II
n).
(1)
This clearly implies
IIT x- T xll < llxll
>/
N).
(2)
If follows from ( 2 ) t h a t (T,~x)is a C - s e q u e n c e in A and let us write T x = lim Tnx (the limit existing since p is complete). Then T is linear. For, if T y = limT~y then T x + T y lim(T,~x+T,~y) -lim T ~ ( x + y ) = T ( x + y ) . By uniqueness of limit property (X being Hausdorff) we get T ( x + y) - T x + Ty. Similarly, T A x = ATx. Finally, by allowing, m - . oo in (1)we get ][Tn-TI[ < e (n >1 N ) , so t h a t l i m T ~ - T, and B is complete. 3 . 5 . 8 . PROPOSTION. Let A - ( A , p )
t We always assume p ~= 0.
be a p - s e m i n o r m e d
Some Types of Topological Algebras
144
algebra and B - - B ( A ) (see 3.5.7) the p-seminormed algebra of all bounded linear operators on the underlying seminormed LS of A. Then the left regular representation l : x ~ Iz is a continuous homomorphism of A into B. Also, II~l <~ Ip[p(z); in particular, if p is sm., then I/z] ~< p(x). The map l is injective iff the annihilator ideal At = {0}. In the unital case we have p(x) <~ [l~lp(e ), whence l is a t. isomorphism. Besides, if p(e)-- 1 then p ( x ) = 11~[. PROOF. T h a t l is a h o m o m o r p h i s m is easily verifiable and in fact a s t a n d a r d result in algebra. Since
p(l~y)- p(~y) < Iplp(~)p(y) we obtain
[l~I <~ sup{p(xy) "p(y) <~ 1} ~< IPlP(~), i.e. II~l ~ IPlP(x)
(1)
Hence Iz E B and l is bounded and so continuous (by 3.5.5). If p i s s m . then IPl ~< 1, so t h a t (1) gives
II~l < p(~).
(2)
The injectiveness (or faithfulness) conlusions are clear. Further, in the unital case we have
p ( x ) - p(t~) ~ II~lp(~),
(3)
so t h a t 1-1 is bounded and so continuous. Thus in this case l is a t. isomorphism. Finally, if p ( e ) - 1, (3) gives p(x) <~ [l,[ which together with (2) yields [ / z l - p(x). 3.5.9. THEOREM ( B o n s a l l - D u n c a n t ) . Let A - (A,p) be a p-seminormed algebra and S a bounded (multiplicative) subsemigroup of A. Then we can find a sm. p-seminorm q such that (i) q ,.~ p,
t They confine themselves [4, p.18] to the case where p is a sm. norm.
w 5. Bounded Linear Transformations on p - s e m i n o r m e d LS's 145 (ii) q(s) <<. 1 for all s in S.
Further, if p is a p - n o r m so is q and if A has unity e then q ( e ) - 1 (so that q is normalized).
PROOF. By replacing A by its unitization A1 (if necessary) we may assume t h a t A has a unity e. Write S 1 - S U{e}. Clearly, S 1 is a subsemigroup of A which is also b o u n d e d , say, p(s) <~ M for all s c S 1. Define Pl (Z) -- s u p { p ( s x ) " 8 C S 1}. Since
p(sx) <. [plp(s)p(x) <. IP M p ( x ) , it follows t h a t
pl(X) < cx3 and further Pl <~ C p
(C- IpIM).
(1)
It is easy to see t h a t Pl is a p-seminorm. Since e E S 1 we obtain"
(2)
p ( x ) -- p ( e x ) <<.pl(x). From (1), (2) we obtain"
pl ~ p .
(3)
Further
s u p { p ( s x y ) " s E S 1} <~ Pl sup{p(sx) " s E S l } p ( y )
pl(xy)
Ptpl(x)p(Y) <<. ]PIPl(X)pl(Y)
(using (2)).
Setting
q(x) - I / ~ l l - s u p { p l ( x y ) . pl(y) <~ 1} we find t h a t
q(x) <<.Ipllpl(x).
(4)
Since
q(xy) -
I/~ull-
II~lu[1 <~ I/~lll/ulx- q(x)q(y),
q is sm. If we write a - e/p~/P(e), then p x ( a ) - 1 p l ( x a ) -- p l ( x ) / p l ( e ) , so t h a t
pl(X) ~
and q(x)>/ (5)
146
S o m e Types of Topological Algebras
From (3), (4), (5) we conclude t h a t q ~ pl "~ p, which proves (i). To prove (ii), we observe t h a t if s E S 1, p l ( S X ) -- s u p { p ( t s x )
(6)
S 1} < pl(X)
"t E
(since ts C S1). It follows t h a t q(s)
--
s u p { p l ( s y ) " p l ( y ) <~ 1)~< s u p { p l ( y ) " p l ( y ) <~ 1} (using (6))
~<
1.
(7)
In particular, q(e) ~ 1. But q ( e ) - q(e 2) ~ q(e) 2, whence q(e) >>. 1. Therefore q(e) - 1, as desired. Finally, by (3), Pl is faithful when p is faithful and then, by virtue of 3.5.7, q - I/zll is a p - n o r m . 3.5.10.
(i)
COROLLARY
v ( x ) - Vp(X) - i n f { q ( x ) ' q
is a sm. p - s e m i n o r m with q
p}. (ii) If A has unity e then v ( x ) - inf{q(x) s e m i n o r m with q ~ p, q(e) - 1}.
9 q is a s m .
p-
PROOF. (i) Since u(x)<~ q(x) for all q we get u(x) ~< inf q ( x ) -
t (say).
n --+1 (as Suppose t h a t v ( x ) < t, so t h a t u ( x ) / t < 1. Since n+l n --+ cxD we can choose a sufficiently large n t h a t we have
t
<
n+l
<1.
(1)
1
Set y -- ((n + 1 ) / n t ) ~ x. T h e n q ( y ) - ((n + 1 ) / n t ) q ( x ) ,
so t h a t we have
inf q(y) - n + 1 inf -..a(x) - ~+-----:tn _ q nt q nt
n+l
(2)
Now, by 3.4.5,
- n+l nt
n+ 1 v(x) -
n
t
<
n+l n
.1-
n+l
- inf q(y) q
(a)
w 5. B o u n d e d Linear Transformations on p - s e m i n o r m e d L S ' s 147
where in the last step we have used (2). Again, v(y) -- n + l ~v(x)nt
n + l v(x)
~ . ~ n
Since v ( y ) l-i m p ( y n )
t
<
n + l n
n
n+l
= 1
(using (1)).
~- < 1 we get p(yn) < 1 for all n >/ No,
n
whence it folows that the semigroup S = {y" : n = 1 , 2 , . . - } is p-bounded. By 3.5.9, there is a sm. p-seminorm q0 "~ P and qo(y) ~< 1 < ,~+1 contradicting (2) Therefore we must have n ~ v ( x ) - - t , proving (i). (ii) This can be proved in exactly the same way as (i). 3.5.11. PROPOSITION. ( a ) L e t X be a p - s e m i n o r m e d L S and X* a p * - B a n a c h space. Let Xo be a dense subspace and T :X0 --~ X* a continuous linear tranformation. Then T can be uniquely extended to a continuous linear transformation 2 P - X --+ X* with
TI-
ITI.
(b) Suppose that A is a p - s e m i n o r m e d algebra, Ao a dense subalgebra of A and A m a p - B a n a c h algebra. Then every continuous h o m o m o r p h i s m !p:A0 ~ B can be uniquely extended to a continuous h o m o m o r p h i s m 95" A ~ B with [t5[- ]!PlPROOF. x c X,
(a) Let X = (X,p),
X* = (X*,p*). Suppose that
Xn --+ x (xn E Xo). Then p * ( T x , ~ - T x m ) <~ [T[p(x,~- Xm)~1p
~
0 7
so by completeness of Y, Tx,~ --~ x*. Define T x - x*. By using the uniqueness of limit property of convergent sequences in X* (which is Hausdorff)it is easy to verify that 5b is well-defined (i.e. independent of the particular choice of the sequence xn ---+ x) and linear. Further we have p* (Tx) - lim p* ( T x , ) <. ITlp(x.) ~* p <<.[TIp(x) ~* p, so that ^15b] ~< T I. On the other hand, T being an extension of T, IT[ < IT[. Thus I T [ - IT]. The continuity if T is an immediate
148
S o m e Types of Topological Algebras
consequence of its boundedness. Finally, the uniqueness of 55 is also clear. (b) Extend ~ (as a linear transformation) to ~b on A as in (a); then 95 is continuous linear. We have to show t h a t ~5 is a h o m o m o r p h i s m . If x, y c A, (xn), (y,) E A0, xn ~ x,y,~ ~ y then 9 b ( x y ) - l i m ~ ( x . y , ~ ) - l i m ~ ( x . ) ! p ( y . ) 95(x)gb(y), proving 9b is a h o m o m o r p h i s m and completing the proof.
w6.
Topological
Algebras
with
Inverses
3 . 6 . 1 . DEFINITION. Let A be an algebra (over K) and a E A. Denote by Ia the map x ~ - + a o x ( x E A ) . Similarly r a is the map x ~ xoa. 3 . 6 . 2 . LEMMA. Let A be a W T A . T h e n la,r ao are continuous. I f a is q. invertible then l a0 , r a0 are h o m e o m o r p h i s m s of A.
PROOF. Since la(x ) -- a § x § lax (la " x ~-~ ax) the continuity of l~ follows from the continuity of addition and the continuity of l~. The continuity of r~ follows similarly. If a is q. invertible with a ~ as q.i, so t h a t a ~oa = o - a o a ~, then la,l a - l a ,o oa - - l ~ __ 1A __ lala,. o o 0 Therefore, l~ is invertible with its inverse (/a) -1 - I a, continuous. It follows t h a t I a is a homeomorphism. Similarly, since (ra) -1 -r a,, r a~ is a homeomorphism.
3 . 6 . 3 . LEMMA. I f A is a unital W T A and a E A is invertible then la, ra are linear h o m e o m o r p h i s m s . PROOF. Here we have la I - l a - l , r a 1 - ra-1 and hence the result. 3 . 6 . 4 . DEFINITION. A TA A is called a C algebra or a continuous algebra if the map x ~-~ x ~ of Gq --~ Gq is continuous, where Gq denotes the group of q. invertible elements of A. 3 . 6 . 5 . PROPOSITION. (a) A TA A is a C algebra iff Gq is a
TG.
149
w6. Topological Algebras with Inverses
(b) A unital TA A is a C algebra iff its group Gi of invertible elements is a TG. (c) In a unital C algebra the groups Gq,Gi are TG's and the map 7 -1 " X E G q - - ~ e + x E G i
is a t. isomorphism. PROOF. (a) Since A is a TA the map (x, y ) ~ xy is always continuous. It follows t h a t Gq is a TG iff the map x ~ x ~ is continuous, i.e. iff A is a C algebra. (b) By 1.1.20, y - e+x E Gi iff x E Gq and y-1 _ ( e + x ) - i = e + x ~. It follows t h a t Gi is a T G iff y ~ y-1 is c o n t i n u o u s i f f x ~ x ~ is continuous iff Gq is a TG. (c) The first half of the s t a t e m e n t follows from (a),(b). Also, T- l ' x ~ e + x is an isomorphism of Gq onto Gi Again, r , r -1 being translations in A, are continuous. Hence the second half of the s t a t e m e n t . 9
3.6.6. LEMMA. Every quarter-normed algebra (A,p) with an a.sm. p is a C algebra. In particular, any p - s e m i n o r m e d algebra is a C algebra. PROOF. The first s t a t e m e n t is an immediate consequence of the inequality (.) of 3.3.22. The second s t a t e m e n t folllows from the first since, by 3.4.3, the p - s e m i n o r m p of a p - s e m i n o r m e d algebra is always a.sm.. 3.6.7. DEFINITION. A TA A is called a Q algebra or algebra with q. inverses if there is an open neighbourhood U(0) of 0 consisting of q. invertible elements. A unital TA A is called an I algebra or algebra with inverses if there is an open neighbourhood U(e) of e consisting of invertible elements. 3.6.8. LEMMA (Michael). Let A be a TA. Then: (i) If S is a balanced subset of A comprising q. invertible elements then r(s)<<. 1 for every s in S, where r(s) denotes the spectral radius of s. (ii) Write G = {x E A : r(x) <~ 1}. Then A is a Q algebra iff int G = G~ -~ O.
150
Some Types of Topological Algebras
PROOF. (i) Suppose that r(s) > 1 for some s E S. Then there i s a )~e a(s) with I)~] > 1. By 1.7.8, s 0 - - ) ~ - l s is not q. invertible. But since ])~-11 < 1,s E S and S is balanced we must have so E S, so that so is q. invertible. This contradiction proves (i). (ii) First assume that A is a q algebra with U(0) a nucleus comprising q. invertible elements. Choose a balanced open nucleus V __c U(0). By(i), Y _C G so that G ~ ~ 0. Conversely, 1 assume that in A we have G o r 0. Then U - ~G ~ ~= 0 and open. If x E U then 2x E G, so that by 1.8.11(ii), r(x) ~< ~1 < 1. It follows that - 1 ~ a~(x) whence, by 1.7.8, x is q. invertible. Thus every x C U is q. invertible and A is a Q algebra. 3.6.9. LEMMA. If A is a Q (respy. I) algebra then each q. invertible (respy. invertible) element x has an open neighbourhood. U~ - l;(U(O)) ( respy. U(x) - l,(U(e)) comprising q. invertible (respy. invertible) elements. Hence the set Gq
) of q. i
rtibl (r py i , tibl )
of
Q
spy. I) algebra A is open. PROOF. Since Gq (respy. Gi) is a group we have U~ x o U ( 0 ) C Gi (respy. U ( x ) - xU(e)C_ G , ) F u r t h e r , U~ (respy. U(x)) is open since l~ (respy. l, ) i s , by 3.6.2 (respy.3.6.3) a homeomorphism.
For a TA (respy. unital TA) A to be a Q (respy. I) algebra it is necessary and su~cient that Gq (respy. Gi) is open. In particular, a TA which is a division algebra is an I algebra iff it is Hausdorff. 3.6.10.
PROPOSITION.
PROOF. The "necessity" follows from 3.6.9 and the "sufficiency" is immediate from the definition of a Q (respy. I ) algebra (since 0 C Gq, e E G i ). Since in a division algebra Gi - A\{O} the assertion concerning TA's which are division algebras is clear. 3 . 6 . 1 1 . COROLLARY. Let A be a TA under two topologies 71,r2. If r2 is finer than rl and (A, 71) is a Q algebra (respy. I
w6. Topological Algebras with Inverses
151
algebra) then (A, 72) is also a Q algebra (respy. I algebra) P r o o f . Clear ( Gq r l - o p e n ==~ Gq r2-open). 3 . 6 . 1 2 . LEMMA. Let A be a unital TA with unity e. If there is an open neighbourhood U(O) of 0 consisting of q. invertible
consisting of invertible elements. Conversely, if V(e) is an open n ighbo rhood of con i ting ol i, v tiU th n V(O)= an open n ighbo rhood of 0 con i ting of q. inv rtiU elements. PROOF. By 1.1.20, x E A is q. invertible iff x + e is invertible. Moreover, the translations x ~ x + e, y ~ y - e of A are homeomorphisms. The statements of the lemma are now clear. 3 . 6 . 1 3 . COROLLARY. A unital algebra A is an I algebra iff
it is a Q algebra. 3.6.14.
LEMMA. A Q algebra A is commutative iff Gq is
commutative. commutative.
Also, an I algebra A is commutative iff Gi is
PROOF. Suffices to prove the "if' parts. Suppose t h a t Gq is commutative and x, y E A. Since z_ 0 and Gq is open n ~ n ~_ ~ x there are integers nl, n2 such t h a t ~1' ~y E Ca. Then ~ ~-~ l'b 2 t,~ 1 whence x ~ y, A is commutative. Again, if Gi is commutative so is Gq since Gq isomorphic to Gi (by 1.1.20). This completes the proof. 3.6.15. Remark. The above lemma can fail if the algebra is not a Q algebra. For example, consider the algebra P * = P * ( X , Y ) of all polynomials P = P ( X , Y ) over K in two non-commuting variables X,Y. This algebra can be normed by: IIPII = the m a x i m u m of the absolute values of the coefficients of the monomials of P. It is easy to check this gives a norm t h a t is sm.: IIPQII < IIPIIIIQII. It is clear t h a t the group of invertible elements G{ = K\{0} which is commutative, but P* is not commutative since X Y ~ Y X . Note here that Gi is not open in P*
t
i.e., U ( e ) - {x + e ' x
E U(O)}.
152
Some Types of Topological Algebras
so t h a t P* is not a Q algebra. 3 . 6 . 1 6 . THEOREM ( A r e n s t - B a n a c h ) . A (F) algebra A (A, ]. ]) is a C algebra iff its group Gq i8 a G 5 ~ set of A. PROOF (cf.[31,p.4]). First assume t h a t A is a C algebra, so t h a t the m a p x ~ x ~ is continuous on Gq. (,) For n - 1 , 2 , - . . define W~ - {x c Gq 93 an ~ - ~(x,n) > 0 such t h a t if y , z E 1 Gq, i y - x I < r / , I z - x I < r / then l y ' - z ' I < ~}, where the bar in Gq d e n o t e s closure. It is easy to see, using continuity of the m a p ( , ) , t h a t W,~ is open in Gq. Also it is clear t h a t Wn D Gq, so that WN,~W,~ 2 Gq. Thus, W is a G6 in G and Gq as a
close subset of the metric space A is a G6 of A. It follows t h a t W is a G5 of A. We shall complete the proof of the "only if" p a r t by showing t h a t Gq - W. S u p p o s e t h a t x c W C_ Gq,X n E Gq and x,~ ~ x. T h e n I I x! ~ - X mI l ~ 0 as n , m ~ oo, so t h a t x,~ ~ yEA (since A is c o m p l e t e ) . It follows t h a t x o y - (lim x , ) o (lim x~) - lim(x,~ o x,~) - 0. Similarly y o x - 0. So y - x ~,x E Gq, proves W - Gq. It r e m a i n s to prove the 'if' p a r t and assume therefore t h a t Gq is a G6 of A. Since A is a complete metric space, Gq is topologically complete and consequently there is in Gq an equivalent metric u n d e r which it is complete. By applying p r o p o s i t i o n 2.1.8 to Gq (with this complete metric) we conclude t h a t inversion is c o n t i n u o u s in Gq, c o m p l e t i n g the proof. 3 . 6 . 1 7 . COROLLARY. A unital (F) algebra A is a C algebra iff the group Gi of its invertible elements is a G5 of A. PROOF. It suffices to observe t h a t the m a p x ~ h o m e o m o r p h i s m of A which carries Gq onto Gi. 3.6.18.
e + x is a
COROLLARY. An (F) algebra which is a Q algebra
is also a C algebra.
t Arens proved (essentially) only the "if" part of the theorem and that under the additional assumption that Gq is seperable. tt i.e. Gq is the intersection of a countable family of open sets of A.
w6. Topological Algebras with Inverses
153
PROOF. Since an open set is a G~ this follows from 3.6.16. 3 . 6 . 1 9 . R e m a r k . There exist Q algebras which are not C algebras. For instance, the algebra 9Y~ of germs of meromorphic functions of one complex variable in the neighbourhoods of 0 in C is a commutative division algebra. This can be topologized so as to make it into a complete Hausdorff locally convex TA. It is known that 9.R is not a C algebra (see [29, p.136]). On the other hand since it is a Hausdorff division algebra, by 3.6.10 it is a Q algebra. There are also C algebras which are not Q algebra. For example, if B1 is the closed unit ball in K denote by P the algebra of the restriction of polynomials in one variable to B1 with coefficients from K. P is a normed algebra under the sup norm. By 3.6.6, P is a C algebra. On the other hand since the invertible elements in P are just the non-zero constants, P is clearly not an I (and hence also not a Q ) algebra. 3.6.20. DEFINITION. A Q (respy. I ) algebra is called a CQ (respy. CI) algebra or algebra with continuous q. inverses (respy. continuous inverses) if the map x ~ x' (respy. x ~ x -1 ) from U(0) (respy. U(0) ) into A is continuous, where U(0) (respy. U(e)) as in 3.6.7. 3.6.21. LEMMA. An algebra A is C Q (respy. C I ) a C algebra and a Q (respy. I) algebra.
iff it is
PROOF. The "if" part follows from 3.6.5((a),(b)) For the "only if" part, in view of 3.6.13, it is enough to prove t h a t a C Q algebra is a C algebra. Let A be a C Q algebra and U(0) as in 3.6.7. If y c U(0) then x o y e U~ (as defined in 3.6.9) and (xoy)' = y'o x ~. The m a p x o y ~-~ ( x o y ) ~ is continuous since it is the composite O of the continuous maps x o y ~-~ y - Iz,(x o y), y ~-~ y~, yl ~ yl o x ~. This proves that A is a C algebra. 3 . 6 . 2 2 . LEMMA. Every C I algebra is a C Q algebra. Conversely, every unital C Q algebra is a C I algebra. PROOF. In view of 3.6.21, 3.6.13 it is enough to prove t h a t the m a p x ~ x ' ( x c U(0)) is continuous iff the map ( e + x )
154
Some Types of Topological Algebras
(e -Jr- X) -1 (X E U(0)) is continuous. But this is immediate since (e+
X) - 1 -- e +
X I.
3.6.23. PROPOSITION. (a) A sm. (F) algebra is a CQ, alge-
bra. (b) Every p-Banach algebra is a CQ p-Banach algebra a C I algebra.
algebra and a unital
PROOF. (a) By virtue of 3.3.18, a sm. (F) algebra is a Q algebra and hence by 3.6.18, 3.6.21 it is a CQ, algebra. (b) By the remark in 3.4.4 we may assume that the norm of the p - B a n a c h is sm. and the first half of the required result follows from (a). The second half follows from the first in view of 3.6.13, 3.6.21. 3 . 6 . 2 4 . LEMMA. Let B be a q. inverse-closedt subalgebra (respy. inverse-closed subunitaltt algebra) A. If A is a Q (respy. I) algebra then so is B; if A is CQ (respy. CI) then so is B. PROOF. If Gq(B),Gq(A) denote the groups of q. invertible elements of B, A respy, then we have clearly the relation Gq(B) B 1"7Gq(A) Hence the statements regarding Q and CQ properties of B. The I and C I properties of B follow similarly from the corresponding relation Gi(B) - B ~ G i ( A ) . 3.6.25. PROPOSITION. Let A - (A,p) be a sm. (F) algebra which is a Q algebra. If B is a closed subalgebra of A then B is also a Q algebra. PROOF. Since A is a Q algebra we can choose an open neighbourhood U(0) of 0 in A such t h a t x e U ( 0 ) = ~ x is q. invertible and p ( x ) < 1. Suppose that x e U 0 - B NU(0). By oo
3.3.18, x ~ exists and is given by x I -
~ - ~ ( - 1 ) n x ~. Since x n E B n=l
and B is a closed subspace, x~E B, so that x~E Uo. Thus, Uo is an open
t i.e. if z E B has q.i. x' (respy.inverse x -1) in A then x' (respy. x - 1 ) C B . tt For definition see 1.1.6.
w6. Topological Algebras with Inverses
155
neighbourhood of 0 in B, comprising q. invertible elements and B is a Q algebra. 3 . 6 . 2 6 . L EMMA 9 Let A, A* be T A ' s a n d p ' A - - - . A * a continuous open epimorphism. Then A* is a Q (respy. CQ) algebra provided A is a Q (respy. CQ) algebra. PROOF. If A is a Q algebra then G q is open in A and consequently G* - ~(Gq) is an open neighbourhood of 0 in A*. By 1.1.24, every element y C G* is q. invertible with y~ E G*. Hence A* is a Q algebra. Next suppose that A is a CQ algebra. Then as above G* - ~(Gq) is an neighbourhood of 0 in A*. For Y0 E G*, choose an open neighbourhood V ~ of y~ with V I _c G*. Set U ' - ~ - 1 ( V - 1 ) ~ G q . Then U' is an open set, so t h a t U - {x e A" x I E U ~} is an open neighbourhood of x0, where p(x0) - y0. It follows t h a t V - ~ ( U ) is an open neighbourhood of y such t h a t q#(Y) c_ Y', where q# is the map y ~ y' (y e Gq(A*)). This proves the continuity of q# at Y0 an arbitary point of G*, whence A* is a CQ algebra. 3 . 6 . 2 7 . COROLLARY. In a Q (respy. CQ ) algebra A, if I is a hi-ideal the quotient algebra A # - A / I is a Q (respy. CQ) algebra.
PROOF. This follows from 3.6.26 since the canonical m a p r 9A ~ A # is an open continuous epimorphism. 3.6.28. PROPOSITION. Let A be a TA and A1 its unitization. Then AI is a Q (respy. CQ) algebra iff A is a Q
(respy. CQ) algebra. PROOF. First assume that A is a Q algebra and U an open neighbourhood of 0 comprising q. invertible elements. Choose a balanced open neighbourhood V of 0 with V § V _c U. Then, for 0 ~ [#l ~< 1, we have (I§
c_V§
C_V§
c_ U.
1 Choose ~ such t h a t 0 ~< I#1 < ~. 1 Then I1 § #1 > 1 - I#1 > 2" 1 (1-+-#)-1 Writing A - ~ we get [A[ < 1, so that for x E V, Ax E V.
Some Types of Topological Algebras
156
Since y-
x(1 + # ) - 1 _ 2)~X E 2)~V _C U
it follows t h a t y is q. invertible. Therefore, e l + y is invertible and hence also (1 § # ) ( e 1 Jr- y) z (1 + #)e 1 -[- x.
is invertible. It follows t h a t 1
V1 - {(1 + ~)e I + x" 0 ~ [#[ < ~ , x E V} is an open neighbourhood of el comprising invertible elements, whence A1 is an I algebra and so also a Q algebra. Conversely, assume that A1 is an I algebra; then it is a Q algebra and so, by 3.6.10, the g r o u p Gq1 of q. invertible elements of A1 is open. If Gq denotes the group of q. invertible elements it is clear (see 1.1.21) t h a t Gq - A ~ G q1, so that Gq is open in A. By 3.6.10, A is a Q algebra. It remains to prove that A1 i s a CQ algebraiff A i s a CQ algebra. But for this, by 3.6.21 and the result already proved it is enough to show that A1 is a C algebra iff A is a C algebra. Now by virtue of 1.1.20, Yl -- Ae + x (A E K , x E A) in A1 is invertible (i.e. yl E G~) it~ )~ ~ 0 and A - i x E Gq, and then we have the relation Yl-1 -- A- 1 (e 1 + ()~- 1x)'), w h e r e d a s h d e n o t e s q.i.. Again, if x C Gq then e l + x E G 1 and ( e l + x ) -1 - e l + x ~. It follows from these relations that the map yl ~-~ y~-I in G 1 is continuous, which completes the proof of the proposition. 3.6.29. PROPOSITION. The complexification A of a commu-
tative Q algebra A is a Q algebra. PROOF. Let U be a nucleus ( = a neighbourhood of 0 ) c o m prising q. invertible elements. Then by 2.1.17(iii)(applied twice) and 2.2.14(vi) we can choose nuclei V,W such that
V+V+V+VC_U,
W 2C_V, W c _ v .
If x , y in W then we have u -- 2x + x2 + y 2 E W + W + W 2 + W 2 CC__V --[-V + V --F-V C_ U
157
w6. Topological Algebras with Inverses
so that u is q. invertible in since (x + iy) o ( ~ - iy) - u, It follows that W - W + i W invertible elements, so that A
A and hence also in A. But then N
x + iy is also q._invertible in A.
is a nucleus of A, comprising q. is a Q algebra.
3 . 6 . 3 0 . COROLLARY. The complexification A of a c o m m u tative real I algebra A is an I algebra. PROOF. Since, by 3.6.13, a unital algebra is an I algebra iff it is a Q algebra, the corollary follows from the proposition. 3.6.31. PROPOSITION. The complexification ~i of a c o m m u tative real C I algebra A is a C I algebra. PROOF. In view of 3.6.21, 3.6.30 it is enough to prove t h a t the m a p (.) z ~ z -1 of (~i onto itself is continuous where (~i is the group of invertible elements of A. Suppose that za, z E Gi, za --~ z,z~ - x~+iy~,z - x+iy, where x a , y a , x , y E A. By 1.6.7, z~ - x~ - i y ~ and - 2 - x - iy lie in Gi and hence the products as -- z~z~ -- x 2~ + y 2 a -- z - 2 - x 2 + y2 also lie in Gi. But as, a C A, whence by 1.6.10, an, a E Gi. It follows that N
N
,v
z -~ l __ -~ a ( X 2 +
y2)-I
__
-2 a a -~ l __~ -~ a - 1
_
~-(x 2 _{_ y 2 ) - i
_ z-1
proving the continuity of the map (.). 3.6.32. COROLLARY. The complexification A of a real comalgebra A is a C Q algebra.
mutative CQ
PROOF. By 3.6.28, the unitization A1 of A is a C Q , and hence by 3.6.22, a C I algebra. By 3.6.31, A1 - (A)I is a C I algebra and hence C Q . So, by 3.6.28, A is C Q . N
,v
3 . 6 . 3 3 . WILLIAMSON'S ALGEBRA. The field C ( X ) of rational functions over C can be embedded in the algebra M of example (V) of 3.3.14, by identifying a rational function P ( X ) / Q ( X ) ( P , Q polynomials over C) with the almost everywhere defined function P ( t ) / Q ( t ) in M. The topology thereby inherited from M makes C ( X ) into a Hausdorff topological field (more precisely, a commuttive Hausdorff division algebra in which inversion is continuous). In particular, C ( X ) is a C I algebra as also a p r e - ( F )
158
Some Types of Topological Algebras
algebra. This method of topologizing C(X) is due to Williamson [14' ,p.731]; we call C(X) with this topology as Williamson's algebra and denote it by ~ .
w 7.
Topological
Zero Divisors
3.7.1. DEFINITION. Let A be an algebra. Write GqI (respy. Gq) - the set of 1.q. invertible (respy. r.q. invertible elements) of A. Then Gq - Gqz ~Gqr. Write
S~ - A\Glq, Sq - A\Grq, Sq - S~ U S~. l r The elements of Sq, Sq, Sq are called respectively l.q. singular,
r.q.singular, and q. singular. When A is unital, we have also G~ (respy. G~) - the set of 1. invertible (respy. r. invertible) elements of A. Then Gi - G~ ('1 G'~. Now write
S' -- A\G~,
S r-
A\G~,S b' - S I N St,
S -
SIU
S r.
The elements of S Z, S r S bi, S are called respectively I. singular, r. singular, hi-singular, and singular. 3.7.2. LEMMA. Let A be any algebra. Then x/~ C_ Gq. If A is unital then x/~ c_ S bi. PROOF. The first inclusion follows from 1.2.24 ((a), (b)). Let now A be unital. Then by 1.2.2.4, x / ~ is a bi-ideal with e ~ v/-A. So, no element of x / ~ is 1. or r. invertible, whence __ s 3.7.3. DEFINITION. (Arens). Let A be a TA. An element x in A is called a left (respy. right) topological zero divisor t , or a 1.t.z.d. (respy. r.t.z.d.) if there is a closed set F such t h a t t The notion t.z.d, under the name generalized zero divisor was first introduced by Shilov for commutative Banach algebras [ 7', p.208]; his definition is essentially based on the condition (**) of 3.7.5.
w 7. Topological Zero Divisors
0 ~ F and0ExFrespy.
159
Fx
where bar denotes closure. An element which is both a 1.t.z.d. and a r.t.z.d, is called a hi-topological zero divisor or a bi-t.z.d.. Obviously, when A is c o m m u t a t i v e every 1.t.z.d. or r.t.z.d, is a bi-t.z.d. The same is true (as can be easily seen) when A is anticommutative. We denote by 3 zt, 3 rt, 3 bit respectively the sets of 1.t.z.d's, r.t.z.d.'s and bi-t.z.d.'s of A. 3.7.4. R e m a r k . In any TA whose topology is not indiscrete, 0 is a b i - t . z . d . For, if x E A \ 0 , ~ then 0 ~ ~ - F (say). But OcOF-FO-O. 3.7.5. LEMMA. Let A be a TA. For an element x E A to be a l.t.z.d. (respy. r.t.z.d.) it is necessary and s u ~ c i e n t that
(,)
3 a net (xa) in A w i t h xa 74 0 but xxa
( respy, x~x) -~ O. If A is first countable then (.) can be replaced by"
3 a sequence (xn) in A with xn 74 O, xxn (respy. x,~x) ~ O.
(**)
PROOF. Suppose there is a closed set F such t h a t 0 F and 0 E x F (respy. F x ) . Choose xa E F such t h a t xxa (respy. x~x) -~ 0, then the net (xa) clearly satisfies the condition (.). Conversely, suppose (.) holds. Since xa ~ 0 there is a subnet (xa,) such t h a t none of its subnets converge to 0. This means t h a t if F = {x~,} then F is a c l o s e d such t h a t 0 ~ F, 0 c x F (respy. 0 e F x ) , whence x is a l.t.z.d. (respy. r.t.z.d.). This completes the proof of the first s t a t e m e n t in the lemma. The second s t a t e m e n t is clear. 3.7.6. PROPOSITION. (a) If x E A is a l.t.z.d. (respy. r.t.z.d.) and y C A then yx (respy. xy) is a l.t.z.d. (respy. r.t.z.d.). In particular, if x is a bi-t.z.d, and x ~ y then xy is a bi-t.z.d. t For an element a E A we write ~ for {a}.
Some Types of Topological Algebras
160
(b)
I/xy
(r~py.
i~ a t.t.z.~.
,.t.z.~.)
th~
9 o, y i~ a t.t.z.~.
(respy. r.t.z.d.). In particular, x 2 is a 1.t.z.d. (respy. r.t.z.d.) is a l.t.z.d. (respy. r.t.z.d.).
==~x
PROOF. (a) It suffices to observe t h a t xx~ ~ 0 (respy. x~x 0) implies t h a t yxx~ ~ 0 (respy. x ~ x y ~ 0). (b) Suppose t h a t xyya---+O, ya ~ 0 . If y y a - - ~ O then y is a 1.t.z.d. On the other hand, if yy~ :/-+ 0, writing xa = yy~ we get x~ J-+ O, xx~ ~ 0, whence x is a 1.t.z.. Similarly the proof when xy is a r . t . z . d . . 3 . 7 . 7 . In a unital algebra A a formal sum A + x (A E K, x E A) can be identified with the element Ae + x. But in the case of an algebra w i t h o u t unity A + x can be treated only as a formal sum. The notion of t.z.d, can be extended to formal sums. Thus we call A § x a 1.t.z.d. (respy. r.t.z.d.) if there is a net x~ 74 x with Axa -k xxa = (A + x)xa --~ 0 (respy. xa(A + x) ~ 0).
Let A be a TA and x E A. If 1 + x is a l.t.z.d. (respy. r.t.z.d.) then x is I. (respy. r.) q. singular. If A is 3.7.8.
~ital
a~
LEMMA.
x i~ a t.t.z.~.
(r~py. r.t.z.~.)
th~
9 i~ I. ( , ~ p y .
,.)
singular. PROOF. Suppose t h a t x a - ~ 0 and xa + xxa---+ O. Then x o x~ ~ x. If x~t exists then by premultiplying by x~z on both sides we get x~ --+ 0 - a contradiction. So x is 1.q. singular. Similarly, when 1 + x is r.t.z.d., x is r.q. singular. Next let A be unital with unity e. Then if x in A is a l.t.zd., writing x - e-4-y we see t h a t l + y - e + y - x i s a l . t . z . d . So by above y is 1.q. singular, whence x -- e + y is 1. singular. 3 . 7 . 9 . LEMMA. Let A be a Hausdorff TA. Then" (i) Every l.z.d. (respy. r.z.dt ) is a l.t.z.d. (respy. r.t.z.d.). (ii) When A is finite-dimensional,
a l.t.z.d. nothing but a l.z.d. (respy. r.z.d.).
(respy. r.t.z.d.)
(iii) An element x in A is a l.t.z.d. (respy. r.l.z.d.) spy. rz) is not a topological m o n o m o r p h i s m . t l.z.d. (respy. r.z.d)
-
-
left (respy. right) zero divisor.
is
iff l~ (re-
w 7. Topological Zero Divisors
161
PROOF. (i) If x y = O and x , y r then F = { y } is closed (since A is Hausdorff), 0 ~ F a n d 0 ~ {0} = ~ = z y = x F , so t h a t x is a 1.t.z.d.. Similarly, y is a r . t . z . d . . (ii) Since A is finite-dimensional we may assume t h a t it is a n o r m e d algebra (see 3.4.6. (ii), 2.1.12). If x is a 1.t.z.d., then by 3.7.13 there is a sequence (x,~) with xx,~ ~ O, I1 .11- 1. Since closed unit ball of A is c o m p a c t (A being h o m e o m o r p h i c to Kn), we can choose a subsequence (Yn) of ( x , ) with Yn ---+ Y. T h e n xy,~+O, xy,~xy. So x y = O and x i s a l . z . d . Similarly, if x is r.t.z.d, it is r . z . d . . (iii) If l~ is not a m o n o m o r p h i s m then x is a 1.z.d. and so by (i) a 1.t.z.d. Next suppose t h a t l~ is a m o n o m o r p h i s m which is not topological. T h e n l~-1 is not continuous (since l~ is always continuous) so t h a t there is a net yc~ ---* 0, but xa - l-~lya J-~ O. Therefore x x ~ l , , x ~ - y~--+ O. By 3.7.5, x is a 1.t.z.d. This proves the "if" part. For the "only if" p a r t assume t h a t x is a 1.t.z.d., so t h a t there is a net (x~) such t h a t
(,)
If l~ is not 1 - 1 it is not a m o n o m o r p h i s m , and if it is 1 - 1, the condition (.) implies t h a t l~ 1 is not continuous. Thus, Iz is not a topological m o n o m o r p h i s m in either case, completing the proof. (The proof of the corresponding s t a t e m e n t concerning r.t.z.d. is similar.) o
7.10. Examples
of t.z. divisiors
(i) In the B a n a c h algebra C - C ([0,1] K ) t h e function f o ( t ) t is not a zero-divisor. But it is a t . z . d . . To see this, define if t < n" 1 f,~ E C by 9 f , ~ ( t ) - 0 if t~> ~1 and - 1 - n t Since 0 ~< fn ~< 1 and fn(O) - 1 we have I l f n l l - 1. Also 1 Thus f0 is a t.z.d . . f o f , ~ 0 since Ilfof,~ll <~ ~. (ii) Write 11 - ll (K), the space of all infinite sequences x - (x,~) oo
(Xn E N,) w i t h E lXnl < OO; ll is a B a n a c h space u n d e r the n=l oo
lx.I. Denote by B - B ( l l ) the algebra of a n=l all b o u n d e d linear o p e r a t o r s on /1; B is a B a n a c h algebra (under o p e r a t o r norm). T h e n 1.o's S, T, U defined by S x - (x2, x 3 , ' - - ) , T x = (0, Xl, X2, " " "), U x -- (xx, 0, 0 , . - . )
norm
Ilxll-
162
Some Types of Topological Algebras
belong to B: [tS[t ~< 1, [ITl[- 1, IfUll ~ 1. Further S T - - I (I = identity operator), U T = O. T as a r.z.d, is a r.t.z.d.. On the other hand T being 1. invertible is not a 1.t.z.d.. 3.7.11. DEFINITION. An element x in A is called a symmetric topological zero divisor or s.t.z.d, if there is a net (xa) in A with x ~ - - . O, xx~ and x~x--+ O. Evidently a s.t.z.d, is a bit . z . d . P . G . Dixon has given an example of an element in a Banach algebra which is a bi-t.z.d. (actually a bi.z.d.) but not s.t.z.d. (see [4, p.13, Example 13]). 3.7.12. R e m a r k . It is clear from the definitions t h a t a 1.t.z.d. or a r.t.z.d, x of A continues to be so with respect to any T A B which is an extension t of A. If both A, B are unital then by 3.7.8, x is singular in A as well as B. Following Lorch we call a singularity which continues to be a singularly in any unital extension a p e r m a n e n t singularity. Thus any t.z.d, is a p e r m a n e n t singularity. F. Quigley has shown that every unital Banach algebra A has a unital Banach algebra extension B such t h a t every singular ,element of A is a zero-divisor of B (see [23, pp.25-27]). On the other hand Arens has proved that in commutative unital Banach algebra the permanently singular elements are precisely the t.z.d.'s. For a proof of this theorem (extended to p - B a n a c h algebra) and other interesting connection between permanently singular elements and t.z.d's in TA's see [31, p.32 and pp.112-123]. 3.7.13. element x in A with a s.t.z.d, if
LEMMA. In a p - n o r m e d algebra A = (A, I I II) ~ is a l.t.z.d. (respy. r.t.z.d.) iff there is sequence (xn) [Ixnll-=-1, xxn (respy. xnx)--~ O. In particular, x is there is a sequence (xn) with ]lxnl[ = 1 and xxn --+ O,
XnX --+0.
PROOF. The "if" part of the first statement follows form 3.7.5 (since IIx~ll- 1 ~ x,~ ~ 0). For the, "only if" part assume t h a t x is a 1.t.z.d. Since A is first countable, by (**) of 3.7.5 there is a sequence (xn) with x , 74 O, xxn --~ O. We may assume (after passing to a subsequence if necessary) that IIx,~ll I> r / > 0 for all t i.e.
A is ~ subalgebra of B and the topology of A is the relative
topology from B.
163
w 7. Topological Zero Divisors 1
n and some r/ > O. Set Y n xy,~ --+ 0 since Ilxy, ll - Ilxx, The proof of the "only if" part final assertion of the lemma is
x , / l l x , lf~. Then IlYnll- 11111, and ll/llx, l[ < -lttxx lI, 0. when x is a r.t.z.d, is similar. The clear.
3 . 7 . 1 4 . LEMMA. Let A be a p - n o r m e d algebra and ft its completion. If x c A is a l.t.z.d., r.t.z.d, or s.t.z.d, of ~I then it is accordingly the same of A. PROOF. We shall prove the result only when x is a 1.t.z.d. (the proofs for the other two being similar). By 3.7.13 there is a sequence (~,~)in A with I I ~ , l l - 1, x ~ n - ~ o. Choose x,~ e A such that I I x . - .ll < 1 so that x , ~ - i , - , 0 (as n - + OO). Then
Itx.II II .II- II .- x.II
1
1 2n
1
~> 2'
so that xn 7z~ O. Also, XXn -- X(Xn -- i n ) + Xin --* O. Therefore x is a 1.t.z.d. of A. 3 . 7 . 1 5 . PROPOSITION (Rickart). Let A be a p - B a n a c h algebra and a E A. Then we have" (i) a is a l.t.z.d. (respy. r.t.z.d.) iff
cot(a) -- 0 (respy. wr(a) - 0), where c o l ( a ) - inf Ila~ll/llxll c o t ( a ) - inf IIxall/llxll. zr
~
zr
(ii) Suppose that la (respy. ra) is 1 - 1. Then a is not a l.t.z.d. (respy. r.t.z.d) iff a A (respy. Aa) is closed. (iii) If a is not a l.t.z.d. (respy. r.t.z.d.) then a A (respy. Aa) is closed. PROOF. As usual we shall prove only all results pertaining to 1.t.z.d.. (i) If cot(a)
--0,
(an)in
there is a sequence
A which
1
Iiaanll/lianll -~ o. Writing xn --Ilanll--~an, we get [ [ x n l l 1, Ilax~ll--. O, whence by 3.7.13, a is a 1.t.z.d. Conversely, if Ilxnll - 1, [laxnll -~ 0 then clearly wz(a) - O.
164
S o m e Types of Topological Algebras
(ii) Since la is 1 - 1, la 1 exists and l a l ( a A ) A. If a A is closed then aA, as a closed subspace, is a p - B a n a c h space. By the open m a p p i n g theorem, la I is bounded. But this means t h a t sup Ilxll/llaxll < cr so t h a t wl(a) # O, and so z
by (i), a is not a 1.t.z.d.. Conversely, suppose t h a t a is not a 1.t.z.d. and axn ~ b. Then w z ( a ) > 0, whence 11/21111/wl(a) < cr Since
[[x~ - Xml] <~ [[1~111 IlaXn
-
axml[ ~ o,
as n , m ~ oo, by completeness of A, xn ~ x (say). Then axn --+ ax. By Hausdorff p r o p e r t y of A, a x - b and a A is closed. (iii) This follow from (ii) since if a is not a 1.t.z.d. it is also not a 1.z.d. so t h a t la is 1 - 1. 3 . 7 . 1 6 . LEMMA. Let A be a p - B a n a c h algebra containing an element a satisfying the conditions" (i) There is a sequence (An) in K with A , ~ each Ana is r. (respy. l.) q. invertible.
oo such that
(ii) The element a is not a l.t.z.d. (respy. not a r.t.z.d.). Then A has a I. (respy. r.) unity u. PROOF. Write bn - (Ana)lr. Then Ana + bn + Anabn - O, so that ab.
-
bn
-a
(1)
and hence also bn a ------i- =
IIb.ll
a
IIb.ll
1
bn
1"
(2)
If I]b~lI - ~ c~ then in (2) the R.H.S. + 0 and a would be a 1.t.z.d., contradicting the hypothesis (ii). So we must have Ilbnll <~ C for all n, whence it follows from (1) t h a t abn --~ - a , - a E a A = a A (by (ii) above and 3.7.15 (iii)). It follows t h a t a - au for some u c A. Now for any x E A we have a ( u x - x ) = 0. Since a is
w 7. Topological Zero Divisors
165
not a 1.z.d., we conclude t h a t ux - x, proving u is a 1. u n i t y of A. 3 . 7 . 1 7 . PROPOSITION. Every element of a radical p - B a n a c h algebra A is a bi-t.z.d. . PROOF. S u p p o s e t h a t A contains an element a which is not a b i - t . z . d . . Since every element of ~ A is q. invertible, we can a p p l y 3.7.16 to conclude t h a t A contains a 1. or a r. u n i t y u, and hence a non-zero i d e m p o t e n t u. B u t this c o n t r a d i c t s 1.2.24. Hence the proposition. 3 . 7 . 1 8 . COROLLARY. If A is a p - B a n a c h algebra then every element of v / A is a bi-t.z.d. . P R O O F . If a ~ v/A t h e n by 3.7.17, a is a bi-t.z.d, and so also of A.
of vfA
3.7.19. Let A be a real TA and A its complexification. T h e n the p r o p e r t y of an element x in A being a 1.t.z.d., r.t.z.d., or s.t.z.d, clearly carries over when x is r e g a r d e d as an element of A. F u r t h e r we have 3 . 7 . 2 0 . LEMMA. (i) x + i x is a l.t.z.d., r.t.z.d., or s.t.z.d, of A according as x is a l.t.z.d., r.t.z.d., or s.t.z.d, of A. (ii) If x C A is a 1.t.z.d. (respy. r.t.z.d.) of ~i then it is already a 1.t.z.d. (respy. r.t.z.d.) of A. N
PROOF. (i) Clear. (ii) A s s u m e t h a t x(x~ + iy~) ~ 0, x~ + iya 74 O(xa, ya E A). T h e n either xa 74 0 or y~ 74 0, while xxa --~ O, yya -~ O. ,v T h e r e f o r e x is a 1.t.z.d. of A if it is of A. Similarly x is a r.t.z.d, of A if it is of A.
3.7.21.
Let A (A,]]-II) p- orm d algebra (respy. a unital p - n o r m e d algebra) and (xn) a sequence of q. invertible (respy. invertible) elements g A such that (i) x~ ~ x t t (ii) sup Ilx~ll (respy. s u p I l z n- l l l -- CX:), where x,~ (respy. x n- 1 ) is n
LEMMA.
n
q. inverse (respy. inverse) s.t.z.d. .
of xn.
Then
1 + x
(respy. x)
is a
166
S o m e Types of Topological Algebras
PROOF. First consider the case where x,~ are q. invertible. We assume (as we may) t h a t I1" II is sm. and by passing to a ! subsequence (if n e c e s s a r y ) w e can also assume t h a t IIx, II ~ oo. 1
I I Define Yn - xn/llxnll ~, so t h a t IlYnll- 1. Then, by using the relation xn § x n' § x n x ~ - O, we have
(l+x)yn-yn+xy,~
Xn
- y,~+(x-xn)yn+xnyn-
1 ~ (X-- XI2)yI2 , I
so t h a t
ll(1 + x)y,~l] <~ I]x'~]l + llx- xn]].
IIx'.ll
I ]ix.Itco we get (1 + x)yn---* O. Similarly, yn(1 + x) ~ co. So 1 + x is a s.t.z.d.. Next, consider the case where x , are invertible. Writing zn x,-e, z-x-e we see t h a t z, a r e q . invertible, z n ~ z , sup [Iz~n[[- sup [[xn I - e [ [ - co.
Since x,~--~ x,
By the first part (proved a b o v e ) w e have xyn - (e + z ) y n (1 + z ) y n --~ 0, and similarly y n x -~ O. Also IlYnll- 1. So, by 3.7.13, x is a s.t.z.d.. 3 . 7 . 2 2 . LEMMA. Let A be a unital TA, Gi its group of invertible e l e m e n t s and xa, x c Gi, xa --~ x. Then x~ 1 -+ x -1 iff the net (x~ 1) i8 essentially bounded. PROOF. If x~ 1 --+ x -1 then (x~ 1) being a C - n e t is essentially bounded (by 2.3.6). Conversely, if (x~ 1) is essentially bounded then, by 2.3.8 (iii), m
x a l ( x a - x) ~ O, i.e. x-~lx --+ e.
It follow,~ that xal
__ ( x ~ - l x ) x
1 __~ e X - 1
__ X
1
3.7.23. PROPOSITION. Let A be a unital H a u s d o r f f complete TA whic,h is a C algebra. Suppose that xa E Gi and xa---, x in A. T h e n x c G i iff (x~ 1) is a C - n e t .
PROOF If x E Gi then, A being a C - a l g e b r a , x~ 1 ~ x -1 so t h a t (x~ 1) is a C - n e t . On the other hand, if we suppose t h a t 9
167
w 7. Topological Zero Divisors
(X~ 1) is a C - n e t then by completeness of A, x~ 1 --~ y (say) C A. Since (xa) is convergent it is essentially bounded, and so by 2.3.8 (iii), x ~ ( x ~ 1 - y) ~
0, o r ,
x~y
~
e.
Also, x~y ~ xy, whence by uniqueness of limits (A being Hausdorff) we get xy - e. Similarly we can show that yx = e. Thus x is invertible, x E Gi, completing the proof. 3.7.24. PROPOSITION. Let A be a C I (respy. C Q ) algebra, Gi (respy. Gq) its group of invertible (respy. q. invertible) elements. If (xn) E Gi (respy. Gq) and Xn --~ x E A theft x E G i ( r e s p y . Gq)
i f f Xn I (respy. (Xln)) ~8 bounded.
PROOF. First suppose that xn E Gi, xn --~ x, x E Gi. Then Xni __+ X-I (since A is a C algebra) and hence (x~i) is bounded. Next suppose that x n E G i , X n - + x E A and (x~ 1) is bounded. Then by 2.3.8 (iii), (X n -- X ) X n 1 --+ O, X n l ( X n -- X) --+ 0 i.e. X,Xn 1 --> e, X n l X --~ e.
Therefore, since A is a I algebra, x x nl and x n i x are invertible for sufficiently large n, whence by 1.1.30, x is invertible, x E Gi. This completes the proof of the part relating to inverses. To prove the part relating to q. inverses, consider the unitization A1 of A and observe that (el -Jr-Xn)
--
I
1 _ el jr_ Xn"
It follows that (x~) is bounded iff ((r -1) is bounded. Therefore, by the p a r t proved, el -~-x E Gi iff ((el-Jr-Xn) -1) -! (e I -~- Xn) is bounded iff (x~n) is bounded, completing the proof. 3.7.25. COROLLARY (Gelfand). Let A be a unital p t_ Banach algebra, Gi its group of invertible elements, Xn E Gi and xn --~ x C A. Then x C Gi iff there is a constant C > 0 t Gelfand considered only the case p - 1.
168
Some Types of Topological Algebras
that
of A.
llx II
c
II.II
p- o m
PROOF. Since a unital p - B a n a c h algebra is a CI algebra (by 3.6.23(b)) and the boundedness in A is the same as the boundedness with respect to ]]. ]1 (by 3.2.13), the corollary follows from 3.7.24. 3.7.2,6. COROLLARY. In a unital p - B a n a c h algebra A the limit of a convergent sequence of invertible elements is either an invertible element or is a s.t.z.d. . In particular, every element of OGi t is a s.t.z.d. . PROOF. The first assertion follows by combining 3.7.25 and 3.7.21. The second follows from the first since G~ being open 0Gi is disjoint with Gi. 3.7.2',7. COROLLARY. Every element of the radical x / ~ of a unital p - B a n a c h algebra is a s.t.z.d. (cf. 3.7.17). PROOF. If a E v/A then since na E x/~, na is q. invertible and consequently (e § na) -1 exists. It follows t h a t (~ § a) -1 = n(e § na) -1 exists, whence by 3.7.26, a - l i m , ( ~e + a) is either invertible or a s . t . z . d . . But a cannot be invertible since a E x / ~ , so a is a s.t.z.d, as required. 3 . 7 . 2 8 . PROPOSITION. Let A be a unital p - B a n a c h algebra, x c A and a(x) the spectrum of x. If a(x) 7s tt and )~ c Oa(x) then x - Ae is a s.t.z.d. . PROOF. Since A E On(x) and a(x) is closed, there is a sequence )~n e p ( x ) = K \ a ( x ) s u c h t h a t )~, ~ )~. Then x A~eCG~.. x - ~ e ~ Gi. Since x - ) ~ , ~ e ~ x - ) ~ e it follows t h a t x - Ae E ,~Gi and consequently, by 3.7.26, x - ~e is a s . t . z . d . . 3.7.2!9. PROPOSITION (Rickart). Let A - ( A ,
li" II)
be a
,t For a subset S of a topological space X we denote by OS the frontier of S i.e., OS(- OS') - s - A s ' , where S ' = X \ S and bar denotes closure. tt This condition is satisfied for every element x if A is complex or strictly real. Moreover, whenever cr(x) ~ 0 we have also O~(x) ~ O, since by 6.1.2, a(x) ~ [~, is closed but not open (by connectedness of [K).
169
w 7. Topological Zero Divisors
p - B a n a c h t algebra with I111 ~m. and xn --. x in A with x,~ +-+ X (for all n). Let v - Vll. I. Then"
(i) If A is unital, x,~ invertible a n d V(Xn 1) i8 bounded then x is invertible.
(ii)
If xn are q. invertible q. invertible.
and
u(x~)
bounded
then
x
is
PROOF. (i) Suppose that V(Xn 1) ~< C. Then we have
V(XnlXrt -- XnlX)
V(Xnl)V(Xn -- X)
(using 3.3.7. (iii)) ~<
CII
- -
O.
It follows that for sufficiently large n, v ( e - x n l x ) < 1, whence by 3.3.20 (ii), x ~ l x is invertible, so that x is also invertible. (ii) This can be deduced from (i) by passing to the unitization A1 of A. 3.7.30.
PROPOSITION.
Let A = (A,[[. II) be a unital p n o r m e d algebra with Gi its group of invertible elements. I f xn E G i , x n --+ x in A and x is a t.z.d, then s u p l ] x ; 1 ] l - 0o and x is a s.t.z.d. .
PROOF. Let A be the completion of A. Then x is a t.z.d, of and so not invertible in A, whence by 3.7.26, sup IIx;X]]- oo and so by 3.7.21, x is a s.t.z.d.. 3 . 7 . 3 1 . COROLLARY. A n element x E O G i \ G i iff sup I l x n l ] ] - CX3, where Xn E Gi and xn ~ x.
is a s.t.z.d.
PROOF. This follows from 3.7.21, 3.7.30. 3.7.32.
PROPOSITION.
PROOF.
Since x is singular and A is strictly real we have
In a strictly, real unital p - B a n a c h algebra A every singular element is a bi-t.z.d, and the square of a singular element a s . t . z . d . .
t Rickart considered only Banach algebras (i.e. p - 1 case).
170
Some Types of Topological Algebras
0 C a(x) -- 5(x) __ ~, and consequently we have 0 e 5(x) 2 = 5(x 2) -- a(x2). Since 5(x) _C ~, a(x 2) - 5(x) 2 /> 0. It follows t h a t 0 E 0a(x2), so that by 3.7.28, x ~ is a s.t.z.d.. Hence, by 3.7.6 (b), x is a bi-t.z.d. 3.7.33. COROLLARY. In (a strictly real) A we have S(= s z U s ~)- s hi- s t - s ~ - 3 u - 3 "t- 3 bit. PROOF. It suffices to observe that a bi-t.z.d, is, by 3.7.8, both 1. singular and r. singular. 3 . 7 . 3 4 . R e m a r k s . In the Banach algebra of complex valued continuous functions on the unit interval, with sup norm, every singular element is a t . z . d . . On the other hand, in the Banach algebra A of all complex-valued continuous functions f = f ( z ) on the closed unit Izl ~< 1 which are holomorphic on tzl < 1, the function fo(z) = z (Iz] <~ 1) is singular but not a t.z.d. (see [10, p.70] or [7's p.29]). Further the real algebra A[~] gives an example of a real Banach algebra containing a singular element ([0) which is not a t.z.d.; note that A ~ is not strictly real (since it has complex structure), so that this example does not contradict 3.7.32.
Let B be a complex or strictly real unital p-Banach algebra and A a closed subunital algebra of B. Then, for every x E A, 3.7.3',5. PROPOSITION.
Further, if either (hA(X))~
c
(.)
c
(**)
0 or pB(x) is connected we have =
(, 9 ,)
PROOF. The relation (.) has already been obtained (see 1.7.20). For proving (**) we note that if A E hA(X) then by 3.7.28, x--Ae is a s.t.z.d, of A and hence also of B. In particular x - A e is singular in B and so A e as(x). Thus OaA(X)C_ aS(X). Again, by (**) of 1.7.20, pA(x) C_ ps(x). Therefore
w7. Topological Zero Divisors
-
171
-
which is (**). Assume now that (aA(X)) ~
O. Then
(since aB(X) is closed). Combining this inclusion with the inclusion ( , ) w e get ( , , ,). Next let pB(x) be connected. Since pA(X) C pB(X) we can write pB(x) -- pA(X)O(pB(x)\pA(X)) - p A ( x ) U ( a A ( x ) \ a B ( x ) )
(1)
where 0 denotes disjoint union. Since 0 a A ( X ) C aS(X) every point of aA(X)\aS(X) is an interior point, i.e. aA(X)\aS(X) is open. The connectedness of pB(x) and (1) imply that aA(X) -aB(x), proving (, 9 ,) in this case as well. 3.7.36. COROLLARY. Let A be a closed subunital algebra of a unital complex p-Banach algebra B and x E A. Then
c
o.(x) c
and when these inclusions hold we have actually aA(x) - aB(X). PROOF. Since always fiB(X) _C 6rA(X) it is enough to prove the "if" part of the "iff" assertion. Assume therefore that fiB(X)C_ ~. By (**) of 3.7.35, OaA(X) < OaS(X) C ~, and by 6.1.2, aA(X) is compact. It follows that (aA(X)) ~ = 0, whence by 3.7.35, aA(X) = fiB (X), completing the proof. 3.7.37. PROPOSITION. A closed subalgebra A of a strictly real p-Banach algebra B is strictly real. PROOF. First assume that B is unital with unity e and set A1 - A + ~e (A1 - A if e E A). Consider the complexification B of B and write A1 - A1 + iA1; A1 is a closed subunital algebra
172
Some Types of Topological Algebras
of 1~. Now a [ 4 1 ( x ) - a~l ( x ) , a ' S ( X ) - a[~(x). Since B is strictly a[~(x) !~_ ~. By 3.7.36, a)4x(x) - ax~ (x) - a[~(x) C ~. It follows that A1, and hence A (by 1.9.5) is strictly real. If B has no unity, consider its unitization B1 which again is strictly real. Also A is closed in Bx (since B is closed B1 ). Applying the result just obtained above to the unital Bx we conclude that A is strictly real.
(Zelazko).
3.7.38. DEFINITION. Let A be a TA. A pair ( S , T ) of subsets of A is called a generalized topological divisor of zero [31,p.73] or g.t.z.d, if 0 ~ S, T but 0 E S T , where bar denotes the closure. 3.7.39. LEMMA. A g.t.z.d. ( S , T ) with S {y}) is a l.t.z.d, x (respy. r.t.z.d, y).
{x} (respy. T =
PROOF. Write T - F. Then we have 0 ~- F while 0 C S T =
xT c_ xT - xF, proving x is a 1.t.z.d.. Similarly, y is a r.t.z.d.. 3.7.40. LEMMA. A pair of nets (x~),(y~) such that xa 74 O, y~ ~ 0 and x~y~ ~ 0 determine a g.t.z.d. PROOF. Since xa ~ 0 there exists a nucleus U and a subnet (x~,) of (x~) which lies outside U. It follows that if S - {x~, } then 0 r S. Similarly there is a subnet (yZ,) of (yz) such that 0 @ T, where T - {y~,}. Since (xa, y ~ , ) i s a subnet of (xayz) and x~yr ~ 0 we get 0 C S T , proving ( S , T ) is a g.t.z.d. 3.7.41. PROPOSITION (Zelazko). A commutative unital Hausdorff TA which admits no g.t.z.d, must be a C algebra. PROOF. Suppose that A is not a C algebra. Then we can find a net (x~) in Gi with x~ --. x0 e Gi (1); x~ 1 74 xo 1.
(2)
By 3.7.22, (x~ 1) is not essentially bounded and so by 2.3.6, it is not a C - n e t . It follows that there is a nucleus U and subnets ( x z ) , ( x z , ) of the net (xa) such that x~,1 - x~ 1 ~ U, so that _
§
o.
(3)
w7. Topological Zero Divisors
173
As subnets of (xa) it follows from (1) that X~ --~ X0~ Xt~t --+ X0
whence
x~,z;3 ~ z2o ~ 0
(since x 2 C Gi).
Since A is Hausdorff we have
x~,xz 74 O.
(4)
On the other hand, by using the commutativity of A we get X~tXI3(X-~I 1 -- X~ 1) -- X/~ -- X/~, ~
0.
(5)
From (4), (3), (5) we conclude, by 3.7.40, that A has a g.t.z.d., contradicting the hypothesis. Hence A is a C algebra. 3.7.42. R e m a r k . pp.73-77].
For more information on g.t.z.d, see [31,
3.7.43. R e m a r k . For the class of topological algebras called locally sm. convex (defined in 4.4.11) there is a weaker definition of t.z.d, due to Michael. For results concerning such t.z.d.'s see [20, pp.43-48].
C H A P T E R IV LOCALLY
PSEUDO-CONVEX AND ALGEBRAS
w 1.
SPACES
p-convexity
4.1.1. DEFINITION. Following Landsberg [9~, p.104] a subset S of a LS X (over K) is called p-convex, where 0 < p ~< 1, if
x , y , c S; ~,/~ E ~,~,/~/> 0 and ~P +/~P - 1
(.)
ax + fly E S. It is called absolutely p-convex if x, y e S ; c ~ , / ~ E K
and I~1p+I/~t p~
(**)
ax + fly E S. Evidently when p - 1, p-convex (respy. absolutely p-convex) is just convex (respy. absolutely convex) in the usual sense. Let '~ be a subset of X. An element of the form ~ a j x j J n
~ a j P-- 1 , is called a pj convex linear combination of elements of S. The meaning of an absolutely p-convex linear combination of elements of S is clear. For any subset S of X we denote by Cp(S) (respy. ICpI(S)) the set of all p-convex (respy. absolutely p-convex) linear combination of elements of S; Cp(S) (respy. ICpI(S)) is called the p-convex (respy. absolutely p-convex) hull of S. Obviously, Cp(S) c_ ICp(S)l.
~-~ajxj, with xj C S , j-1
a i />0
and
4.1.2. LEMMA. ( a ) I f S is p-convex (respy. absolutely pc o ~ ~ ) t h ~ s = c~(s) ( ~ p y levi(s)). (b) For any subset S of X, C,(S) (respy. ]Cpl(S)) is the smallest p-convex (respy. absolutely p-convex) subset of X containing S.
w 1. p -convexity
(c)
175
If S is p-convex (respy. absolutely p-convex)so is AS tl
PROOF. (a) Let S be p-convex and x -
~ajxj
with ~ j />
j=l
n l a j P -- 1. We shall show t h a t x E S 0, xj c S and (,) ~ j = by induction on n the length of the combination). If n - 2, x c S by the definition of p-convexity. Assume now t h a t x E S p whenever the length is n - 1. For the a j occuring in (,) write n-1
PZ O~j j=l
n-1
tip (say) , so t h a t we ~ - - ~as xj
E S. Therefore
since
j-1
aj f~P + a~ -- 1, it follows t h a t ~ cux j - ~ -k-xj + c~nx~ E S. j=l \j=l Thus, Co(S ) C_ S whence Cp(S) - S (since always S C_CCo(S)). _ The assertion concerning ICoI(S) is proved similarly. (b) It follows from (a) t h a t if $1 is a p-convex set with $1 _D S then $1 - Co(S1 ) D_Cp(S). We will now show t h a t Co(S ) is pconvex. Suppose t h a t m
rt
x - ~ ~;~;, y - ~ ~y~ (~j, y~ e s) j=l
k=l
m
tI
with O~<cu, /~k; ~-'~lcuI p -
1, ~ l / ~ k l o -
j=l
If O ~ , # ; ~ P + # P - -
1.
k=l
1 then m
n
~x + ~y - ~ ~ j ~ j + ~ . ~ y ~ . j=l
k=l
Since
~--~(Aaj)P+~(#f~k) pj--1
Ap
a
+#P
/~;
- A'+# p - 1
k=l
we conclude t h a t Ax+#y E Cp(S) which proves t h a t Cp(S) is pconvex. The proof of the assertion concerning ICpI(S) is similar.
Locally Pseudo-convex Spaces and Algebras
176
(c) Clear. 4.1.3.
If ~ a i x 3 . , ~~3.x3.
Remark.
3"=1
are absolutely
p-
3.=1
convex linear c o m b i n a t i o n s of elements and I,~1~ + I"1' <-
1, then
n
~-~()~%, + #~i)x3. is also an absolutely p-convex linear combinaj=l
tion of elements. In fact we have
< ~ ( l ~ l I~jl + I~l~jl) ~ J
3"
3"
(since 0 < p <~ 1)
3"
3"
the .other h a n d , the analogous assertion for p-convex linear c o m b i n a t i o n can fail if p < 1. For example, take n - 2; a l = On
_
1
_
1
/32--
4.
)~_/~_
1;
p _
1
Then 1
I
~1 -
(,~al + ~f~i)~
-
12 '
"~2 -
(~c~2 + u Z 2 ) ~
5
-
12
so t h a t "~1 + "/2 - ~/ig+5 12 < 1 showing t h a t ~/2x +-/2x2 is not a p-convex linear combination.
A subset S (of a LS X) is absolutely pconvex iff it is p-convex and balanced. Also, if S is any bal4 . 1 . 4 L EMMA.
a n c ~ ~ub~t th~n C ~ ( S ) i~ ~b~ol~t~ly p-~on,~,, ~o that IC~I(S) c~(s). PROOF. If S is absolutely p-convex it is trivially p-convex. Moreover, it is also balanced since I)~] ~< 1 =~ I,~lp <~ 1. Conversely, s u p p o s e t h a t S is p-convex and balanced. If xj E S, ~--~lai] p ~< 1 J
177
w 1. p -convexity
c~j then ~ l - i f [ ~ where r p~< 1. We assume j 3 that all Icu[ > 0 and set ~j - a j / l a j l . Then ~.xj E S (since S is balanced) and so by p-convexity .
3ix i ~ S ,
i.e. ~ ~ . ~ j x j C S .
3
3
By balanced property of S we get ~ a i x j E S, completing the J proof of the first assertion. For the second we assume that S is balanced. If aj ) 0 , ~ a j O _ l , IA[ ~ 1 and x j E S then J
~ ajxj=~ aj(Axy) E C : ( S ) (since Axj J
E S, S being balanced).
3
Hence Cp(S) is balanced and Co(S ) - I C ] o ( S ) . 4.1.5. LEMMA. If S is p-convex and a,/~ > 0 then 1
1
1
+
If S is convex (i.e. p - l )
c_
then a S + /3S - ( a + fl)S.
PROOF. For x , y E S 1
+
[
1
1 ]
a-; x + /3-;y 1
E
(a + fl); S (by p-convexity).
If p - 1 the above gives a S + flS C_ (a + ~ ) S . On the other hand, since (a + ~)x - ax + fly the reverse inclusion relation also holds. 4.1.6. LEMMA. If U is an open subset of a TLS X Ic~[(u) is open. tI
PROOF. Consider an element x -
~ j-1
a;-aj (aj E U),
then
178
~
Locally Pseudo-convex Spaces and Algebras
# 0, ~
I~jl ~ ~< 1. Since U is open we can choose a balanced 3" open nucleus V such that aj + V _C U ( j 1 , . . - , n ) . Write ~l~;I-
~ ( > o). f o r a C V we h~ve
J x -~- c~a --
oljaj + ~ I~jla - ~ ~j(aj + ~;xl~jla ), J
J
J
Since V is balanced, a ~ ll a j l a E V, aj + a ; l l a j l a E U, so t h a t x + aa c ]Cpl(U),x + a Y cC_ ICpl(U). Since x is an arbitrary element of ICpl(U) we conclude t h a t ICpl(U) is open. 4.1.7. LEMMA. If S is absolutely p-convez (0 < p ~ 1) and 0 < p~ <: p then it is also absolutely p~-convex. In particular, if
S is absolutely convex it is absolutely p-convex for every p with O
P (since ~ ) 1)
pt
p
~<
1~-1.
Therefore, every absolutely p~-convex linear combination is an absolutely p-convex linear combination, whence the lemma. 4.1.8. DEFINITION. Let S be an absorbing subset of a LS X. For x E X , 0 < p ~ < 1, set -
p,~(x) - p o , s ( x ) - p s ( x )
=
i n f { a > O ' x E a-iS}
-
i~f{flP'fl
1
> O,x E flS}.
The non-negative realvalued function p is called the p-gauge (gauge if p - 1). The gauge of S is also known as the Minkowski functional of S. It is clear from the definition of the p-gauge t h a t we have"
Ps2 <~Ps~ if S1 C $2,
(,)
w 1. p -convexity
179
(**)
p~ - 0 , 1 po~ - ~p~
(, 9 ,)
(~ e K \ { o } ) . pt
4.1.9 R e m a r k . p - p;.
If 0 < p~ ~< p < 1 then p;, - p-Z, where
4.1.10. PROPOSITION. Let S be an absorbing subset of X. Then the p-gauge p - ps has the following properties: (i) p(o) - o.
(ii) p ( A x ) - APp(x) if A >10. (iii) p ( A x ) -
[A["p(x) for all A E K, provided S is balanced.
provided S is
(iv) p ( x + y) ~ p(x) + p(y) for all x , y E X p -convex.
In particular, p is a p-seminorm if S is absolutely p-convex (and also absorbing). 1
PROOF. (i) Since S is absorbing, 0 E S and hence 0 E a ~ S for all a > 0, whence p(0) - 0 1
(ii) x E a ~ S
1
iff Ax E (APa)~S(A > 0). Hence p(Ax) -
~p(x) (iii) Assume first that
I A I - 1; then A - 1 S - S 1
since S is
1
1
balanced. It follows that Ax E a ~ S iff x E a ~ A - 1 S - a ~ S . Therefore p(Ax) - p(x). Next for arbitrary A e K, A ~= 0, write A - [A]# where I # l - 1. Then, by (ii) (since I # ] - 1). Finally, the relation clearly holds if A - 0. 1
(iv) Given e > 0, we can choose a, fl > 0 such that x E a ~ S , 1
y C f3-~S ; a < p(x) + e, fl < p(y) + e. Since, by 4.1.5, 1
it follows that
1
1
180
Locally Pseudo-convex Spaces and Algebras
From tile arbitrariness of c we conclude that
;(x + y) < p ( x ) + ;(y) proving the first result of (iv). For the second result we remark t h a t it follows from this and (iii), since an absolutely p-convex set is both p-convex and balanced. 4 . 1 . 1 1 . LEMMA. Let S j ( j - 1 , . . . ,n) be absorbing balanced sets and S - $ 1 ~ " " ~ Sn; then S is absorbing and balanced. If pj, p are p -guages of Sj, S respectively then p - pl V . . . V pn. t PROOF. T h a t S is absorbing and balanced are easy consequences of the definitions (see 2.1.15). Since S c Sj we have pj ~
Again we have, for some en ~ 0, 1
1
x e (pj(~) + ~.)~ sj
C_
(q(x) + cn)~ Sj (since S i is balanced)
=
~sj ( ~ y )
It follows t h a t )~-lx E S, SO that 1
c ~ s - (q(x)+ ~.)~ s. This impities t h a t p(x) <. q(x) + en, whence making en --~ 0 we get p(x):<, q(x) <~p(x). Thus q - p, completing the proof. 4 . 1 . 1 2 . PROPOSITION. Let S be a subset of a LS X (over •), which is absolutely p-convex (0 < p <~ 1) and absorbing. Then: (i) The p-gauage p B1 -
Ps is a p - s e m i n o r m such that if
{x c A'p(x)
<
1},
B1 - {x e A " p(x) < 1}
then B1 C_ S c_ B1; in particular, kerp _c S. (ii) S B1 or B1 p -topology.
according as S is open or closed in the
t See 3;.1.7 (b) for the definition.
w 1. p -convexity
181
(iii) If A is an algebra and S a (multiplicative) subsemigroup of A then p is sm.. PROOF.
(i) By 4.1.10, p is a p-seminorm. If x E B1 then 1
for some e > 0, p(x) < e < 1, x E c ~ S . 1
_1
Then e P x E S, and
1
1
since I c ~ [ - Icl~ < 1 and S is balanced, x -
1
e~(e-~x)e
S, so
1
t h a t B1 C S. Again, if x E S whence S _c B1.
then x E I~S, so that p(x) <~ 1, 1
(ii) Assume first t h a t S is open and x e S. Since ( 1 - ~ 1) ~ x --+ 1
x and S is open, (1 - ~1 ) ; x ~ S for some n/> 2, so t h a t p(x) <~ 1 - ~ 1 < 1, whence B 1 - S. Next assume t h a t S is closed. By 3.2.7, B1 is the closure of B1. Therefore, since by (i), B1 _C S C B1 and S is closed, it follows t h a t S - B1. (iii) By definition of p, since S is balanced, we have for any c > 0 with 0 < e < 1, 1
x c (p(x) + ~)~ s,
1
y e (p(y)+ ~)~ s.
Therefore
xy e [(p(~) + ~)(p(y) + ~)]~s ~ c [p(~)p(y) + c ~ ] ~ s , where C is a constant independent e. By making e ~ conclude t h a t p(xy)<~ p(x)p(y), i.e., p is sm..
0 we
4 . 1 . 1 3 . PROPOSITION. Let p be a p - s e m i n o r m on an algebra A. Then B1, B1 (as defined in 4.1.12) are absolutely pconvex and absorbing. Further, B1 is open, B1 is closed in the p-topology and we have p . , - p-~ - p
(,)
If p is sm. then B1, B1 are subsemigroups. PROOF. Using the identity p ( A x ) - [AIPp(x ) it is straightforward to check t h a t B1, B1 are absolutely p-convex. Next, for any 1
x C A , set ) ~ - 1 if p ( x ) - O and A ~ - ( 2 p ( x ) ) - ~ if p ( x ) ~ 0 . 1 Then p(Axx) - 0 or ~, so t h a t ) ~ x E B1 _c B1, proving t h a t B1, B1 are absorbing. It is further clear from the definition of the
Locally Pseudo-convex Spaces and Algebras
182
p-topology that B1 is open, and B1 is closed, being the closure of B1 (by 3.2.7.). Again it is immediate from the sm. property that BI: B1 are subsemigroups whenever p is sm.. It remains to prove the equalities (.). Since B1 c_ B1 we have (1)
p-~ (x) <~PB~ (x). 1
Again, if A > p(x) then x E A;B1, so that PB~ (x) ~ A, whence
p(x).
(2)
Xw
Finally, p(x)<~ A iff x E A~B1. Hence
(3)
P-B~( x ) - inf{A" A/> p(x)} >/p(x). From (1), (2), (3) we obtain (.).
4.1.14. R e m a r k . If p be as in 4.1.12, and r > 0, then we can show as above (for the r - 1 case) that Br - {x E A " p(x) < r}, Br - {x E A " p(x) <~ r}
are respy, open absolutely p-convex and closed absolutely pconvex. Also, when p is sm., Br, Br are subsemigroups for 0
0 <
! P
p ~ 1, 0 < p' <~ 1. Then p ' - p - ; is a p ' - s e m i n o r m i f f t h e unit ball B1 -- {x 9p(x) < 1} is p'-convex. In particular, p' is a p ' - s e m i n o r m for all p' with 0 < p' < p.
PROOF. Note first that we have also B1 - {x 9 pt(x) < 1}. If p~ is a p~-seminorm then, by 4.1.12, B1 is p~-convex. Conversely, let B1 be p~ convex. Denote by p ~ the pt-gauge 1
determined by B1 9 Then PB~(X) ~ < A
-:
:~ A ~ x
E B1
-:
>
1
p ' ( A - T x ) < 1 iff p'(x) < A. Therefore p' - PB1 and consequently
183
w 1. p -convexity
p~ is a pt_seminorm. Then second assertion in the proposition is an immediate consequence of the first and 4.1.7. 4 . 1 . 1 6 . THEOREM (Rickart t ) . Let A - (A,p) be a real p s e m i n o r m e d algebra, 0 < p <~ 1, and A the complexification of the algebra A. Then fi is a p - s e m i n o r m e d algebra. Further, ffi is unital, p - n o r m e d or p - B a n a c h according as A has the corresponding property. Moreover, we can choose the p - s e m i n o r m of A in such a way that the map x ~ x + i.O of A into A is an N
N
N
~, ~ith p ( ~ ) - 1, ~ d f i ~ I t y ~ i~ ~m. if p i~ ~m.. PROOF (following the method of Bonsall-Duncan [4, p.68]). Write U - {x E A " p(x) < 1}, U - the absolute p-convex hull of U in A. Then U is absorbing in ii.. To see this, suppose that z-x§162 (x, y E A ) and N
#P > m a x { p ( x ) , p ( y ) } .
(1)
Then x / p , y / # E U, so that 1
21/ppz -
1
x
i
21/p ( ; ) +
y
-
2-~/p ( ; ) E U
(2)
N
proving U is absorbing. We next prove that ~r has the property" z-
x§
U ~ x, y E U.
(3)
Assume that z has the representation n
Z
I"/klP ~< 1.
~
k
k=l
Writing "~k -
a k + i/~k
we get Z - - X + iy, w h e r e x -
k
akzk, y -- ~ Z~Yk. k
t Rickart [23, p.8] obtained the results when A is a real normed algebra.
Locally Pseudo-convex Spaces and Algebras
184
Since, lakl, I~1 < I~l it follows, by the absolute p-convexity of U in A, that x,y E U, whence~ (3)holds. Denote by /3 the gauge of U (in A); then /5 is a p-seminorm on A. Writing BI - {z E A " i0(z) < 1}, by 4.1.12(i), we get
/~1 C (/".
(4)
On the other hand, if n
z-
~
Akxk E U (xk E U, Ak E c ) , ~ I A k I p ~< 1,
k--1
k
we can choose e > 0 such that p(xk) < e < 1 for all k. Then 1
1
N
e p xk C U, so that e p z E U, whence /5(z) <~ c < 1. It follows therefore that
U-
B1
(5)
and so in particular U is i6-bounded. From (1),(2)it follows that /5(z) ~< 2 max{p(x), p(y)}.
(6)
Again, if )~ > 0,,~z C U then by (3), ~x,)~y E U, so that
p()~x),p()~y) < 1, whence AP max(p(x),p(y)) < 1.
(7)
For a given e > 0, we can choose the A > 0 such that 1
Ap <
+
(8)
We conclude from (7),(8), since e is arbitrary, that
max{p(x),p(y)} <~l~(z).
(9)
The inequalities (6),(9) imply that /5 induces the topology of A, and also that io is faithful (respy. complete) when p is faithful (respy. complete). If x E A and A E ~ then it is clear from (3) that N
Ax + i0 ~ U iff A x c U, whence p(x) - ~(x). When A is unital we can, using 3.5.9, assume t h a t p ( e ) - 1, so that then we get l o ( e ) - p ( e ) - 1.
w 2. Locally B o u n d e d Algebras
185
Finally, let p be sm.; then U is a subsemigroup of A. We shall show t h a t ~r is a subsemigroup of A. Suppose now t h a t N z, z ~ E U, then they have representations ~--~Akxk, z' -- ~---~Alxz, where xk, xz E U and Z k l
la lo, k
lallo .< 1. Now l zz' - E
and
AkAll xkxl,
k,l
k,l
k
l
Since U is a semigroup, xkx~ E U and consequently the above relations show t h a t z z ~ E ~], so t h a t U is a subsemigroup of A, as desired, completing the proof of the theorem.
w 2.
Locally
Bounded
Algebras
4 . 2 . 1 . L EMMA. Let X be a locally bounded T L S and U a bounded balanced nucleus of X . Then we can f i n d a p,O < p <~ 1 such that 1 U § U C 2-~U. (,) PROOF. Since U is bounded, by 2.1.25, { -1~ U ' n is a basis of nuclei, so that there is a N / > 2 such t h a t U
U
c u.
1, 2, . . . }
(,,)
1
Write p - l o g 2 / l o g N .
X
Then N -
4 . 2 . 2 . L EMMA (K6the). Let S such that
s+sc2
2~ and (,')==~ (,). be a balanced subset of a L S 1
s
(1)
where O < p <~ 1. Then ki
2-7S §
k~
+ 2- o S C_S
(2)
Locally Pseudo-convex Spaces and Algebras
186
lrt
for all integers kj >1 1 such that
2 -kj ~< 1, and further
j-1 1
levi(s) ~ 2~s.
(3)
PROOF. ([18,p.165]). To prove (2) it is clearly sufficient to prove the, special case (2 ~) of (2) where we have rt
2 -kj -- 1.
(*)
j=l
We call k - max kj, the order of the resolution (,). We prove J (2') by induction on k. If k - 1 the relation (2)reduces just to the hypothesis (1) and so (2) holds for this case. Next assume that (2 ~) holds for order k >/ 1. To prove that it holds for order k § 1, observe that each decomposition (,) of order k + 1 is obtained from a decomposition of order k, by replacing one (or more) of the summands 2 -k by 2-(k+l) + 2-(k+l), since it follows from ~ 2 - k J - 1 that the summands 2 -(k+l) occurs an even number of times. Thus, to obtain (2 ~) for order k + 1 starting k from (2 ~) for order k we have to replace the summand 2 - ~ S by k+i
i
k+i
i
2 - - ~ S + 2 - - 7 - S. But this is permissible since 2-~ S + 2-~ S _c S (by (1)). This completes the proof of (2') (by induction). n
It remains to prove (3). Suppose that ~ l a j ] p ~< 1 and xj e j=l
S. Determine integers kj such that 2-kJ 4 [aj] p < 2-kJ + 1 - 2 92-kJ. Then J
l~jl ~ < 2
2-ki ~<2. ~ I~jl~ < 2 , 1 -
2
J
since S is balanced,
-kj+l
ajxj E a i S c Jails c_ 2 ..~ S, so that
kj+l J
J
1(
~) J
1
2~ S (using (2)),
187
w 2. Locally B o u n d e d Algebras
proving (3). 4 . 2 . 3 . PROPOSITION. A TA A (or more generally a T L S ) is p - s e m i n o r m e d (0 < p <~ 1) iff it has a bounded nucleus U such that 1 UtUC2~U. Moreover, when A is s e m i - n o r m e d we can even choose the U so that it is a subsemigroup of A.
PROOF. If A is a p - s e m i n o r m e d algebra (A,p) we may assume t h a t p is sm. (see 3.4.4). By 4.1.13, U - B1 is an open absolutely p-convex nucleus which is a subsemigroup. U is, moreover, b o u n d e d (by 3.2.13). Finally, if x , y E U then by p -convexity, x Yi 1 ~-~EU, 2~ 2~
so t h a t U §
1
Conversely, suppose that U is an open nucleus having the stated properties. Then, by 4.2.2,
v-
Ic l(u) c
1
(,)
and by 4.1.6, V is an open nucleus. The boundedness of U together with the inclusion (,) implies t h a t V is bounded. Since V is absolutely p-convex the gauge p - Pv is a p - s e m i n o r m (by 4.1.10). By 4.1.12(ii), Y - B1 - {x E A " p(x) < 1} and hence (.) gives" 1 - T V ___ U ___V - B1. (**) 2~ Since U , V are bounded nuclei it follows from (**) t h a t the topology of A coincides with the p-topology, whence A is pseminormed. 4 . 2 . 4 . COROLLARY. Every locally boundedt n o r m e d algebra for some p, 0 < p <~ 1.
TA is a p - s e m i -
t A TA is said to be locally bounded if it is locally bounded as a TLS (i.e. it has a bounded nucleus).
188
Locally Pseudo-convex Spaces and Algebras
PROOF. This is an immediate consequence of 4.2.1, 4.2.3. 4 . 2 . 5 . R e m a r k . Rolewicz [12 ~] has shown t h a t to each locally bounded TLS X there is a largest number p0,0 < p0 ~ 1, such t h a t if 0 < p < p0 then the topology of X can be induced by a p-seminorm. 4 . 2 . 6 . COROLLARY. A TA A is a semi-normed algebra iff it has a bounded convex nucleus U. PROOF. If A ---- (A, P) is semi-normed we can take U B1 = {x E A : p(x) < 1}. On the other hand, if A has a bounded convex nucleus U then we have, by 4.1.5, U + U - 1. U + 1 - U - (1 § 1)U - 21U. By 4.2.3, A is semi-normed. 4 . 2 . 7 . COROLLARY (Kolmogorov t ). A Hausdorff TA is a normed algebra iff it has a bounded convex nucleus. PROOF. This follows from 4.2.6 since the topology induced by a semi-norm p is Hausdorff iff p is a norm. 4 . 2 . 8 . PROPOSITION. An infinite direct product of locally bounded ttausdorff T L S ' s - in particular such a product of TA's cannot be locally bounded. PROOF. Suppose X - - I I X a , where {Xa} is an infinite family of locally bounded Hausdorff TLS's. Denote by 7r~ the factor projection: X ~ X~. Then sets of the form U -- 71~1(Uc~1) C I ' ' " N 7t--l(uc~n)c~.
where U~j run through an open basis of X~j, form a basis of nuclei for X. Fixing a U, let /3 be an index with fl 7s a l , ' " , an and x =/= 0 an element of the space Xt~. Then the sequence ( n x ) ( n = 1, 2 , . . . ) of elements clearly belong to U (after suitable
Actually Kolmogorov proved the following result: A Hausdorff TLS is normable iff it has a bounded convex nucleus.
w3. Locally Pseudo-convex Spaces
189
identification?). Since _1. nx - x ~ 0 this sequence does not n converge to 0 and consequently U is not bounded. Since U is an a r b i t r a r y basis nucleus we conclude t h a t X is not locally bounded. 4 . 2 . 9 . COROLLARY. A direct product of p-seminormed algebras is p-seminormed iff it is a 'finite direct product'. PROOF. If A - - A 1 • " " • An, when A j - - ( A j , p j ) are ps e m i n o r m e d algebras then A is p - s e m i n o r m e d under q : q ( x ) m a x j p j ( x ) , where x e A, x - ( x l , ' " , x , ) , x j e Aj (cf. 3.3.11). Conversely, if a direct product A of p - s e m i n o r m e d algebras is p - s e m i n o r m e d then A is locally bounded (by 3.2.14) and hence by 4.2.8, A is a finite direct product.
w 3.
Locally
Pseudo-convex
Spaces
4 . 3 . 1 . DEFINITION. Following Waelbroeck [29,p.4] we call a subset S of a LS X (over ~:) pseudo-convex if it is p-convex for some p (0 < p ~< 1). A TLS X is called locally pseudo-convex if it has a basis {Us} of pseudo-convex nuclei Us; if Us is p~convex we also say t h a t X is locally {p~)-convex. If all the p~ (some) p then X is called locally p-convex, and if p -= 1 then X is called locally convex. A p - s e m i n o r m p is also called a pseudo-seminorm and p is called the homogenity index of the pseudo-seminorm p (cf. 3.2.1). 4 . 3 . 2 . If P is a family of pseudo-seminorms on a LS X, the P - t o p o l o g y (see 3.1.7) makes X a locally pseudo-convex space ( X , P ) ; if P - {p~) and B ~ {x e X 9 p~(x) < r} (r e ~ , r > 0) then the family of all finite intersections of the B~ ( a , r varying) give a basis of pseudo-convex nuclei for ( X , P ) . Conversely, if X is any locally pseudo-convex space with {Us} as a basis of pseudo-convex nuclei t h e m the gauges p~ associated with the U~ determine a family P - - { p ~ } of pseudo-seminorms Pa.
~. The element xt~ E Xt~ is identified with the element x - (x~) in X suchth~t x ~ = 0 if c ~ # p , x ~ - x ~ if ~--fl.
Locally Pseudo-convex Spaces and Algebras
190
4 . 3 . 3 . Let G* denote the set of all pseudo-seminorms on a LS X. We introduce an order -< in G* by writing i
I
p -< p' if p~ < p ;
1
I
(i.e. p(x)-; <<.p ' ( x ) 7 Yx E X ) and p' ~< p,
where p,p~ c ~* are respectively a p - s e m i n o r m and a p~seminorm. Clearly, the relation -< is reflexive and transitive. It is 1 pl ~ pl also anti-symmetric, for, i f p - < p ' , p ' - < p then p ~ 7, p, so t h a t p - p~. Thus -< is a partial order. We also note t h a t if p -< p' then for 0 < e ~< 1, Bep' _c B p (since if p'(x) < e then p
p(x) .< p' 4.3.4,,
< LEMMA.
The poset 0" -
(~*,-<)
is closed for all
finite lattice sums. PROOF. If pj C G* and pj is a p - s e m i n o r m ( j -
1,..-,n)
_R_
, - P 0j ;q(x) - max py(x). , set p - min{py} PY By 3.2.9, py' is a Y ' 1 p - s e m i n o r m and so by 3.2.3, q is a p-seminorm, so t h a t q E G*. It easily follows from the definition of q t h a t q >- py, and t h a t if p t E G * , f f ;>- p y for all j then p' >- q. So q is indeed the lattice sum plV'"Vpn.
4 . 3 . 5 . LEMMA. If pj e and O< c <~ 1 then
(j-
1, 9. . , n ) , q - -
plV'"VPn,
B q C_ B E p ~ N . . . N Bep"-
PROOF. Since py -< q we have B e _ BeP~ (see 4.3.3). The required result is now clear. 4.3.6. then
LEMMA.
1, . . . , n)
If pj,py' C G * ( j !
P l V . . . V P n "" P l V . . .
I
V Pn"
PROOF. By (**) of 3.2.11 we have oy i.~1
I
py <~~jpy
orJ
i I
Py
,pj <. c~py
and PJ "~ PY'
191
w 3. Locally P s e u d o - c o n v e x Spaces
Set C ~ - m a x C~., p - min pj. Then p -7-
Pl V . . . V Pn
=
max pjP1 ~< C t max pjt p1
~< C'(plV...Vp',, 1. Similarly, Pl V . . . V p~ <. C ( p l Hence the lemma.
V
" " " V
Pn), where C - m a x Cj.
4 . 3 . 7 . DEFINITION. A family P of pseudo-seminorms is called saturated if it satisfies the condition Pl,''',Pn
E P ::~ pl V ' ' ' V
pn E P.
(*)
For any subset P of O* we set P -- {q E 6* " q - - p l
V . . . V p n , p j E P}.
The set P clearly satisfies the condition saturated closure of P.
(.)
and is called the
4 . 3 . 8 . LEMMA. (a) P, P induces on X the s a m e topology. (b) If Po is a cofinalt subset of P (with respect to the order in 4.3.3) then Po induces on X the same topology as P. ( c ) / f P is a saturated f a m i l y then the f a m i l y { B p " p E P, e > 0} is a basis of nuclei. PROOF. (a) It is sufficient to observe t h a t p(x~ - x) --~ 0 for each p c P iff q ( x ~ - x ) - - ~ O for each q c P. (b) It is enough to note that i f p - 4 p 0 (PEP,P0EP0) and B-
{x C X'p(x)
< r}, B o -
{x E X ' p o ( x )
< r'}
PO
where r t - r-i-,p o (respy. p) being the homogenity index of p0 (respy p.), then B0 __c_B. (c) This follows from 4 93.5 and the simple fact t h a t B ~ uC B rp2 if 0 < r l < r2.
t i.e. given any p E P
there isa poEPo with p-<po.
Locally Pseudo-convex Spaces and Algebras
192
4.3.9,, Let P be a family of pseudo-seminorms on a LS X. A subset S of X is said to be P -bounded if the numerical functions p(x)(p e 2) are bounded on S (i.e. plS is bounded for each p e P ). The meaning of p - b o u n d e d where p is a pseudo-seminorm is clear.
4.3.11}. LEMMA. Let X - (X, P) be a locally pseudo-convex
space. A .subset S of X is (t.) bounded iff it is P-bounded. PROOF. Let S be bounded. If possible let p~lS be not bounded for some pa in P. Then we can find a sequence (xn) in 1
S with p,~(xn) ) n. Writing Yn - n p~xn we have: P~(Yn) ) 1. It follows t h a t yn ~ 0 in X, contradicting the boundedness of S. Conversely, suppose now S is such t h a t pals is bounded for all Pa. Then, for ( x , ) in S,A,~ ~ 0 we have pot(Anxn) [A,~l;~p~(x~) -+ 0, since the sequence is bounded and pa > 0. Therefore S is bounded. -
-
Let X - (X, P), Y - (Y, g)) be locally pseudo-convex spaces, with P saturated. Then, a linear transformation T " X --~ Y is continuous iff for each q~ E ~_ there is a pa E P and a constant C - C a ~ > 0 such that 4.3.11.
PROPOSITION.
p~
(,)
where pa,p~ are respectively the homogenity indices of pa,p~. PROOF. The condition (.) clearly implies continuity of T at 0 and and hence also everywhere. Conversely, if T is continuous then (by continuity at 0), given q/~ and E > 0 there is a pa and a fi > 0 such that
(**)
p~(x) <~ ~ ~ qz(Tx) <~ e. 1
For an x with p ~ ( x ) ~ O, write X1 - - ( ~ p a ( x ) - I ) - A - ~ X . Then p~(xl) -- ~;, so that by (**) we get q~(Txl) <~ e which reduces o~ to (,) above will C - e~ P~. If p~(x) - O, we can argue exactly
w 3. Locally Pseudo-convex Spaces
193
as in the proof or 3.2.10 and show t h a t q~(Tx) - 0, so t h a t (.) holds trivially in this case. 4 . 3 . 1 2 . LEMMA. Let X be a TLS, Y - (Y,~_) a locally pseudo-convex space, T : X --+ Y a linear transformation. For each qz E D we set p*~(x) - q~(Tx). Then p*~ is a pseudos e m i n o r m on X with the same homogenity index as q~. The transformation T is continuous iff all p*~ are continuous. PROOF. We have
+ y) - qz(Tx + Ty) <.
+
Further, if a is the
homogenity index of qz then: pz(Ax)* - q~(TAx) - q z ( A T x ) -- IA] p *p~(x). To prove the criterion for continuity of T it is enough, in view of 2.1.26, 3.1.3, to consider the continuity of both at 0. Now T is continuous at 0 iff: x~ -~ 0 in X ==~p*~(x~) - q~(Tx~) ~ 0 (for all qt~ ), iff all p} are continuous at 0. This proves the lemma. 4 . 3 . 1 3 . LEMMA. Let X - (X, P) be a locally pseudo-convex space, where P is saturated. Then: (i) For any continuous linear functional f on X there is a p~ E P such that f is p a - c o n t i n u o u s , i.e. f is a continuous functional of the p s e u d o - s e m i n o r m e d linear space
(ii) If p is any continuous p s e u d o - s e m i n o r m on X is a pa such that
then there
p <~ Cp~ ~, where C is some constant > 0 and P, Pa the homogenity indices of p, pa.
PROOF. (i) By 2.1.31, there is a p~ and an e > 0 such t h a t pa(x) < e ==~ [f(x)t < 1.
It follows from 3.5.4 t h a t f " ( X , p ~ ) ~ K is n. bounded, whence by 3.5.5, it is continuous.
Locally Pseudo-convex Spaces and Algebras
194
(ii) The identity m a p : (X, P ) ~ ( X , p ) is continuous by hypothesis on p. So, by 4.3.11, there is a C > 0 and a pa with _2__
as desired. 4 . 3 . 1 4 . DEFINITION. Let X -- ( X , P ) be a locally pseudoconvex TLS - or more generally a TLS with its topology induced by a family P of quarter-norms. A m a p
T : PT(C_ X ) - ~ X where PT is the d o m a i n of T, is called a contraction if we have for each p a E P a c o n s t a n t ea with 0 < c a < 1 such t h a t for all x, y C P T w e h a v e
p~(Tx-
Ty) <<.e ~ p ~ ( x - y).
Note t h a t a contraction m a p is automatically continuous. 4.3.15. THEOREM (Contraction m a p p i n g principle). Let X : (X, P) be a complete (or even sequentially complete) Hausdorff TLS, with P a family of p - s e m i n o r m s (or more generally quarter-norms). Let T " S --~ S be a contraction, where S is a closed subset of X. Then T has a unique fixed point x* E S with x* -- l i m T n x 0 , where xo is an arbitrary point of S. PROOF.
Define X1 ---Txo,xn - - T x , ~ - I : T'~xo. If m < n
then
p~(x,~ - x , ) = p~(Tmxo - T~xo) <~ (e~)mp~(xo - Xn-m) (Ea)m[pa(Xo (Ea)mpa(Xo
---
Xl) -[-''.-[- p a ( X n _ ( m _ l ) Xl)[1 Jr- Ec~-Jr-'''E~ -m]
--
Xm_l) ]
1
< (cc~)mpa(xo -- X l ) l -- c~ It follows t h a t p ~ ( X m - x , ) -~ 0 as m , n ~ c~ (for each a ) . By completeness of X the sequence xn --~ some x* E X; since xn E S and S is closed, x* E S. By continuity of T
w4. Locally Pseudo-convex Algebras we have"
Tx*-
lim T x n .
195
By the construction of T we have
n---+ OO
also
9
lim T x ~ ~t----~ O O
lim X~+l
--
X*
. Therefore, since X is Haus-
~t---~ OO
dorff, Tx* -- x*. Thus x* is a f i x e d point of T. If T y have
y, we
p~(x* - y) - p~(Tx* - T y ) ~ e~pa(x* - y). Since ca < 1 we must p ~ ( x * - y ) - 0 ( X being Hausdorff).
for all p~, whence x * - y
4 . 3 . 1 6 . LEMMA. A locally pseudo-convex space X - (X, P) is locally connected. PROOF. Let P be the s a t u r a t e d closure of P, so t h a t we have also X - ( X , P ) . Since the open balls B~ - {x E X ' p ~ ( x ) < r}(p~ E P) form a base of nuclei the lemma follows since each B~ is connected (see proof of 3.2.8). w4.
Locally
Pseudo-convex
Algebras
4 . 4 . 1 . DEFINITION. A TA A is called locally pseudo-convex if it is locally pseudo-convex as a TLS. This means t h a t a locally pseudo-convex algebra A is of the form A - - ( A , P ) , where P is a family of pseudo-seminorms. If each pa E P is sm. then A is called locally sin. pseudo-convex algebra. Again, if each pa is a semi-norm, A is called a locallyt sin. convex algebra. 4 . 4 . 2 . LEMMA. If A is locally sm. pseudo-convex then it has a basis consisting of pseudo-convex subsemigroup nuclei. Conversely, if A is a TA which admits such a basis then it is locally sm. pseudo-convex. PROOF. If A = ( A , P ) with each pa E P sm. then, by 4.1.13, B~ = {x e A : p~(x) < r } , 0 < r ~< 1, are pseudo-convex subsemigroup nuclei. On the other hand if A has such a bais then the associate gauges pa are sm. pseudo-convex (by 4.1.12 ((i), (iii))). t This is the same as locally m. convex algebra in the terminology of Michael [20].
196
Locally Pseudo-convex Spaces and Algebras
4 . 4 . 3 . L EMMA. If P l , ' " P n are sin. P i - s e m i n o r m s (j -1 , . - . , n ) then q - pl V . . . V pn is a sin. p - s e m i n o r m with p rain{p:-}, where pj is the homogenity index of pj. _L
PROOF.
By 4.3.4,
q(x) -- m a x p i ( x ) PJ, and J seminorm. Further, we have oK_
~
q is a p-
__P__
q ( x y ) - m.~xp;(~y)o; .< m ~ x p ; ( ~ ) o ; p ; ( ~ ) I o ; - q(~)q(y), :
j
whence the lemma. 4 . 4 . 4 . PROPOSITION. Let A be an algebra (over K) P a family of pseudo-seminorms on A, and P the saturated closure of P. Then A is a TA under the P-topology iff for each. pl E P there is a Po C P and a C > O such that I
pl
pl
p (~v) <~cpo(x) Tpo(y)7
(,)
(~, v ~ A)
where pl, po are respectively the homogenity indices of p~,po. PROOF. The proof is somewhat similar to that of 3.4.3. First suppose that (.) holds for each p~ E P. Assume t h a t in A, x~ --~ x, y~ --~ y. Then from the identity
we obtain, using (.) and the subadditivity of pl, the inequality: pl
~, ~, +po(~) ~ p o ( y ~ - y) ;o + p o ( ~
pl
~, ~, } - ~) ;o ;o(y)oo .
It follows t h a t p ~ ( x ~ y p - xy) --+ 0, for every p~, whence x ~ y ~ - ~ x y , and ( A , P ) i s a T A . Next suppose t h a t (A, P) is a TA. Since the m a p (x, y) ~ xy is continuous, given pS E P and e > 0 then is a p0 E - P and a 5 > 0 such that (1)
197
w4. Locally Pseudo-convex Algebras 1
For x , y
~ A with po(x),po(y) ~ O, set
1
Xl
--
1
t~PX/po(X)
P---~
1
Yl -- ~ o(---~y/po(y)~o where P0 is the homogenity index of p0. Then po(xl) - - 5 - - PO(Yl), whence by (1), p ' ( x l y l ) < e which reduces to
Cpo(x)
oa
~
opo(y)oo
(2)
where C - E/5 2p'Ip. It remains to consider the case where po(x) or po(Y) - O. Suppose t h a t po(x) - O. Then po(n2x) - 0 for any integer n ~< 1. For arbitrary y c A we can choose n (large enough) t h a t
, y
p'(y)
n
rt pl
"
Then, by (1), p ' ( n x y ) - p ' ( n 2 x . y / n ) <. e which gives nP'p'(xy) <~ e. Since n is arbitralily large we get p'(xy) - O. Similarly p'(xy)-0 if x is arbitrary and P o ( y ) - O. Thus ( 2 ) h o l d s for all x , y as required. 4.4.5. COROLLARY. Let A -- (A, P) be a locally pseudoconvex algebra. Then for each pl E P we can find a pseudos e m i n o r m p* on A such that pl
pl
(**)
P* "~ Pl V . . . V Pn for some pj E P. 4.4.6. COROLLARY. If P is any family of sm. pseudos e m i n o r m s on an algebra A then under the P-topology A is a locally (sm.) pseudo-convex algebra.
PROOF. By sm. property of p~ E P we have p a ( x y ) p ~ ( x ) p ~ ( y ) and the condition (,) of 4.4.4 evidently holds.
<~
4.4.7. LEMMA. Let A = ( A , P ) be a locally pseudo-convex algebra. If P - {p~} and p o - - i n f p ~ > 0, when p~ is the homogenity index of pa, then A is a locally Po-pseudoconvex algebra. PROOF.
By 3.2.9, qa - p~O/p, is a po-seminorm such t h a t
198
Locally Pseudo-convex Spaces and Algebras
q~,-~p~. Thus A - - (A,Q) where !2 = {q~} i s a f a m i l y of p0seminorms, whence A is a locally p0-pseudoconvex algebra. 4.4.8. PROPOSITION. The locally {pa}-convex algebras A are precisely the TA 's of the form A = (A, P ), where P is a family of p - mi orm o= A ati4yi g (,) of 4.4.1. Moreover, A is Hausdorff iff ker P -- {0}. PROOF. The first statement is essentially a restatement of 4.4.4. The second statement follows from 3.1.21 (iii). 4.4.9. DEFINITION. A family P of pseudo-seminorms on an algebra A is called well-behaved if fi is saturated and further for each p ~ E P there i s a p E P such that pl
pl
7p(y) 7
(**)
where pt,p are respectively a pt-seminorm and a p-seminorm. 4.4.10. PROPOSITION. The locally pseudo-convex algebras are precisely the TA', A of the from A - (A,P), where P is a well-behaved family of pseudo-seminorms. PROOF.
If P is well-behaved then by (**)of4.4.5 and (,) of 4.4.4, A is a TA (under the p-topology) which by 4.3.2, is locally pseudo-convex. Next assume that A is a locally pseudo-convex algebra. Then, by 4.4.4, A - (A,P) with P satisfying (,) of 4.4.4. Let P denote the saturated closure of P and write - { p E G* "p,,,qE--fi} where G* denotes the set of all pseudo-seminorms on A. Then, by 4.3.6, ,P is saturated. Further, by 4.4.5, ,P is well-behaved. 4.4.11. LEMMA. Let A bra such that:
(A,P) be a locally p-convex alge-
(i) P - {p~} is a well-behaved family; (ii) s u p p a ( x ) < oo for each x e A. Pa
w4. Locally Pseudo-convex Algebras
199
Then p ( x ) - sup pc~(x) is a sm. p-seminorm and (A,p) is a pP~
seminormed algebra. PROOF. Since P is well-behaved, for each pa E P there is a p/~ E P such t h a t
pc~(xy) <~p~(x)p~(y) <<.p(x)p(y). Taking the s u p r e m u m of the first term over all a we get
p(xy) <~p(x)p(y). 4 . 4 . 1 2 . PROPOSITION. Let A - (A, P) be a locally pseudoconvex ( respy, locally sm. pseudo-convex) algebra. Then: (i) Any subalgebra Ao of A under the relative topology is locally
pseudo-convex (respy. locally sin. pseudo-convex). (ii) If I is a bi-ideal of a
and A # - A / I , then A #, under the quotient topology, is locally pseudo-convex (respy. locally sin. pseudo-convex).
PROOF. (i) We may assume t h a t P is well-behaved. For p~ C P write P ~ o - P~IAo (restriction to a0) and P 0 - {P~o}. Then it is clear that (Ao, Po) has the required properties. (ii) Let p~ be defined in terms of Pa as in 3.4.15 and write P # - {p~}. Then ( a #, P # ) is the quotient algebra and this has the required properties (the proof t h a t P # induces the quotient topology is similar to that of 3.1.22 (iii)). 4 . 4 . 1 3 . PROPOSITION. The unitization A1 or the complexification A of a locally pseudo-convex or locally sin. pseudo-convex algebra A is again an algebra of the same type. PROOF. If A -- (A, P) then for each p E P denote by Pl the canonical extension of p to A1 as defined in 3.4.11 and by /5 the extension of p to A as defined in the proof of 4.1.16. Write N
Pl -- {Pl " p E P } , Then n I -- (AI, Pl), A -
P -- { p ' p E
P}.
(A, P) have the stated properties.
4 . 4 . 1 4 . LEMMA. Let A - (A,P) be sequentially complete-in particular complete-Hausdorff locally sm. p-convex algebra. If for
200
Locally Pseudo-convex Spaces and Algebras
an x E A we have u~(x) < 1 for all uc~ co
then
x
is q. invertible,
~
( - 1 ) '~xn
converges in
A
and the
n--1
q. inverse co
x'n=l
PROOF. As in the proof of 3.3.19, we obtain for each p~, co
p (x
<
n--1
So
N+r ) N+r P a ( n~N ( -- i ) n x n <~ ~-~ P a ( Xn) --+0, N
as
N , r --+ c~ .
co
This means t h a t
~ - ~ ( - 1 ) n x n converges absolutely and so also n--1
in
A.
Exactly
as in the proof of 3.3.19 we can show t h a t
co
-
x'.
r~--1
4 . 4 . 1 5 . PROPOSITION. A locally sm. pseudo-convez algebra (or more generally a TA whose topology is induced by a family of a. sm. quarter-norms) is a C algebra. PROOF. Let A - ( A , P ) , where P - {pa} and each a. s m . . Then, by 3.3.22, each pa satisfies the inequality (.) therein. It follows t h a t if (each) p a ( x n - x ) --+ 0 ( x ~ , x then p~(x'~ - x I) -+ O, which proves t h a t the m a p x ~-+ x I is continuous, so t h a t A is a C algebra.
A-
4.4.16. (A,P),
p~ is stated e Gq) of Gq
LEMMA. In a locally sm. pseudo-convez algebra where P is saturated, for any continuous pseudo-
w 5. Projective Limit Decompositions
201 1
1
s e m i n o r m p on A there is a p~ E ? such that v~ <~ vi~~, where P, Pn are homogenity induces of p, pn respectively. ~p
PROOF. By 4.3.13 (ii) there is a pa with p <~ Cp~ ~ . Therefore
Up (x) -
lim (p(x'~ ) ) -~-
~--~ O0
lim C ~ ~ [ l i m p ~ ( x ~ ) ~~] _e__ o~
<~
n---+ O0
Ln---~ O0
P
1
1 p~
so t h a t v~ ~< vn , as required. w 5.
Projective
Limit
Decompositions
4 . 5 . 1 . Let {A~ : a E ~ } be a family of TA's with the indexing set .4, a poset directed above by -< . Suppose t h a t for each pair (c~, fl) of elements of .4, with a -< fl, there is given a continuous h o m o m o r p h i s m ~p~Z : A z --. A~, such t h a t (i) p ~ = 1A~ (ii) p ~ o ~ for c~ -< /3 -< ~/. Write A-
the Cartesian p r o d u c t
17I An. nCA
Under coordinate-wise operations A is an algebra. Set
Ao -- { x -
(x~) C A " ~ Z ( x ~ ) -
x~ whenever ~ -4 fl}.
A0 is called the projective limit of the A 0 - - 1 i 4--mAn, x--lim xn (xEA0). l----
An
and we write
The projective limit A0 has the following universal mapping property: for any TA B and continuous h o m o m o r p h i s m s COn " B - + An such t h a t ~n~ o c o Z - con (whenever a - < /3), there is a unique continuous h o m o m o r p h i s m 0 9 B ~ A0 such t h a t ~rn o 0 - con (a E ~q), where r n denotes the n a t u r a l projection A --+ A~. (It is easy to see t h a t 0 is given by 0(b) - (co~(b)), for
boB) 4 . 5 . 2 . LEMMA. Ao is a closed subalgebra of A. PROOF. By 2.2.8 (b), A is a TA, and since ~ Z
are homo-
Locally Pseudo-convex Spaces and Algebras
202
morphisms, A0 is a subalgebra of A. It follows from the continuity of ~ that A0 is closed in A. 4.5.3.
THEOREM (Michael t ). Every complete Hausdorff lo-
cally sm. pseudo-convex algebra A is ( t. isomorphic to) a projective limit, l i m A a of pseudo-Banach algebras tt Aa. In particular, +.._
if A is locally p-convex, then A - l i m A , , Banach algebras. Conversely, a projective limit B -
limBa
with all fia as pof pseudo-Banach
algebras Ba, is a complete Hausdorff locally sm. pseudo-convex algebra. PROOF. Let A - ( A , P ) , where we may assume that P = {p~} is saturated. Set A ~ - A/N~, where N ~ - kerp~. Then A ~ - ( A ~ , p ~ ) i s a p~-normed algebra (p~ being the homogenity index of p~) whose completion A~ is, by 3.4.17, a p~-Banach algebra. Make the indexing set .4 - {a} a directed set (directed above) by defining a -< ~ if pa -< p~, where the latter -< is the order introduced in 4.3.3 (the directedness of the order is a consequence of the family P being saturated). If a -< fl, it is clear that N~ _C N~, where N ~ kerp~, N~ - k e r p . Consequently, the map ~ 9xz - x + NZ ~ xa - x + Na (x C A) is well-defined and is a continuous homomorphism of A~ onto An, which can be extended, by 3.5.11 (b), to a homomorphism ~b~ of A~ into An. It follows that
is a projective system of pseudo-Banach algebras which defines the projective limit t Michael [20, p.17.] established the theorem for the particular case of the locally sm. convex algebras but his method of proof extends to our general case. tt
A pseudo-Banach
algebra is lust a p-Banach
algebra for some
0 < p ~ I. This algebra is not to be confused with the pseudo-Banach introduced
by Allen-Dales-McClure
limit of Banach
algebras.
who
p,
algebra
use the term for a certain inductive
203
w 5. P r o j e c t i v e L i m i t D e c o m p o s i t i o n s
Ao- lim A~ __ 1-I A~" Similarly, {As " 99~f~} gives rise to the projective limit A0 - lim Aa, which is identifiable as a s u b a l g e b r a of Ao. T h e m a p ~p 9A -~ Ao given by ( ~ ( x ) ) ~ - x § N~ - x~ is a h o m o m o r p h i s m , since each of the m a p s ~ 9x ~ x ~ ( a E A) is a h o m o m o r p h i s m . It is 1-1 since x~ - 0 for all a ==~ x e n N~ - {0} (since A is Hausdorff). F u r t h e r , ~p is continuous since each !Pa is continuous. We now show t h a t ~ is "onto". Take any element y - lim ya in Ao. For any finite subset S of A, choose a fl E A such t h a t fl >- a for all a E S. Take an element x s E A such t h a t ( ~ ( x s ) ) z - y~; t h e n ( ~ ( a s ) ) ~ - y~ for all x e S. Also, given finite subsets $1,
$2 with $ 1 ~ $ 2
~ O, we have
( t o ( x s 1 ) ) ~ -- y~ - (99(xs2))~ for all a E S 1
N
This relation implies t h a t XSl - XS2 E N o C_ U~,E - { x E A " p ~ ( a ) < e }
(e>0).
It follows t h a t ( x s ) - S varying a m o n g all the finite subsets of - is a C - n e t . Since A is c o m p l e t e xs ~
(some) x E A.
Since ~ is c o n t i n u o u s we o b t a i n y~ - - ( g 9 ( x s ) ) ~
( S varying)
--, (~p(x))~ -- x~,
i.e. y~ -- x~, so t h a t y - ~p(a), proving t h a t ~p is "onto". We n e x t show t h a t ~ - 1 is continuous. Consider a net (x (~)) in A such t h a t
c A) T h e n by 3.4.16 we have p a ( z (~) - x) -- p#a (x ('x) - x a ) --+ 0 for all a.
Locally Pseudo-convex Spaces and Algebras
204
This means that x (~) -~ x in A, proving the continuity of ~9-1. To complete the proof of the first statement of the theorem it remains to show that A0 - A0. Now any non-empty open set Ifd of A0 contains an open set V of the form
where ( ~ j
N...
N, o,
are open sets in fi.~j and r--1 the natural projection
~rA~-+ A~j ( j - 1 , - - . , n ) choose an (Xrt+l E .~ with an+l >" a j ( j = 1 , . . . ,n). Then we have the homomorphisms
~j,Olnj_l
"
(j= 1,...,n).
l~Olnj_l ~ l~Otj
Set _
,,-1
Gc~,~+l -- ~1,~,~+1 Then
Set
~n,~n+l
~o,j,o,,,+, (G~,,+,) ___r C~rtA-1
n "
(j= 1,...,n).
c~n+l
~
9
Since A~.+I is dense in A~.+~ we can find x E A so that x~.+~ E (~,~+~. It follows that ~(x) E U, so that U n A 0 # 0. Therefore A0 is dense in A0. But A0 is complete, being t. isomorphic to the complete space A and consequently closed. Thus, A0 - fi-0. The second (or converse) statement follows since every pseudoBanach algebra is a complete Hausdorff locally sm. pseudo-convex algebra and these properties carry over to direct products and to closed subalgebras. 4.5.4. For descriptive convenience we call a complete Hausdorff locally sm. pseudo-convex algebra A as a pseudo-Michael algebra. If it is a locally sm. p-convex algebra then it will be referred to as a p-Michael algebra. Finally, if p - 1, A is called
w5. Projective Limit Decompositions
205
a Michael t algebra. If completeness hypothesis is dropped in any of the above definitions then the resulting notions will be indicated by employing pre-Michael instead of Michael in their names 4 . 5 . 5 . COROLLARY. Every pseudo-pre-Michael algebra is a dense subalgebra of a projective limit lim/}~ of pseudo-Banach 4--
algebras [~s. PROOF. of A.
It suffices to apply 4.5.3 to the completion
B -
4 . 5 . 6 . PROPOSITION (Michael). Let A -
(A, P) be a pseudoMichael algebra with projective limit decomposition A--limzi.s (A~ a pseudo-Banach algebra). For x E A, x--limxs (i) x -
(xs C fis) we write x -
(xs). Then:
(xs) is q. invertible in A iff xs E fis is q. invertible
(for ach (ii) A is unital iff all ft~
are unital, and then the unity e (es), es being unity of fis. (iii) u = (u~) is idempotent in A iff for each a, u~ is idempotent in fis. (iv) If A is unital, then an element x - - (xs) is invertible iff for each (~, xa is invertible in fia. PROOF. (i) If x is q. invertible then, by 1.1.24, xs is q. invertible in As and so also in As _~ As. Conversely, if for each a, x s , has q.i. xs, ' then ( x ~ ) C A To see this, note t h a t i f / ~ > a , ~9sZ ..3,Z --~ As the element !psf~(x~) is q.i. of ipsz(xf~) - xs, so that ~f~(x~)-
x~. ' It follows t h a t
~(x~) e limfi,~ - A, whence
there is an element x I E A with (xl)s - x s. Since multiplication and addition are component-wise it is clear t h a t x ~ is q.i. of x. (ii), (iii): These follow at once since multiplication in A is component-wise. t Such algebras h~ve ~lso been considered by Areas.
Locally Pseudo-convex Spaces and Algebras
206
(iv) The proof is similar to that of (i). 4.5.7. COROLLARY. For x -
(x(2) E A we have:
(1 / a~(x) -- Ua2~(x(2); c~
(2) rA(x) -- sup rA,(xa); c~
(3) aA(X) -- U a~i~(x~) whenever A is unital. cg
PROOF. By 1.7.8 A(r 0) E a ~ A ( X ) i f f - - A - i x is not q. invertible, i.e. by 4.5.6 (i), iff for some a, - A - l x a is not q. invertible in A~ iff A E a'^ (xa) This proves (1) and (2)readAs " ily follows from (1). For (3), assume now that A is unital; then each .1i(2 is unital. From (1) and 1.7.21 we obtain (x)U(0)
-
9
If 0 ~ aA(X) then x is invertible and consequently each xa is invertible, so that 0 ~ UaA~(x~). On the other hand, if 0 e c~
aA(X) then x is not invertible and consequently, some x(2 is not invertible so that 0 E aA1 (x(2). Thus, the equality in (3) holds in both cases.
4.5.8. COROLLARY. PROOF. bi-ideal. So
N~I(~/Aa)
_ x/~-- N~9~l(v~a).
(2
(2
By 1.2.17 (i), each ~ I ( ~ A ~ ) o r
(2
(fi)~l(~~a) is a
(2
are bi-ideals of A. By 1.2.26, ~ ( V ~ ) C V~(2. So x / ~ _ I. On the other hand, if x E I then x(2 E V~(2 and so x(2 is q. invertible. Consequently, by 4.5.6 (i), x is q. invertible so that I is q.i. bideal, whence I ___ x/~. Thus x / ~ I. Again, if x E J then
w6. Metrizable Locally Pseudo-convex Algebras
207
x~ E V//i~, x~ is q. invertible and consequently x is q. invertible. Thus, J is a q. invertible ideal whence J c_C_x/~. w6.
Metrizable
Locally
Pseudo-convex
Algebras
4.6.1. PROPOSITION. Every first countable locally pseudoconvex algebra A is semi-metrizable and has the form A - (A, P), where P - { p l , p 2 , ' " } is a countable well-behaved family of pseudo-seminorms such that Pl ~ P2 -< "'" t
(,)
PJ p j ( x y ) ~ Pj+I (X)~176
Pj+I
(j1 , 2 , . . . ) , where pj, indices of Pj,Pj+I.
are
Pi (**)
respectively the homogenity
PROOF. That first countability implies semi-metrizability lows from 2.1.7. Since A is first countable its topology is duced by a countable family Q - {q,} of pseudo-seminorms. P ~ n - ql V . . . V qn and P ' - { p ~ } . Then p~ -< p~ -< . . . . PI --P~. By 4.4.4, there an integer i(1) such that
folinSet Set
Pl (xy) -- pl1 (xy) ~ C l p ~ ( 1 ) ( x ) ~o, pi(1) I (y)-~P'
where Pl, p, are homogenity indices of PI,P~(1) and C1 a constant __E_
which we may clearly suppose /> 1 9 Set p2 - C~~ i'( 1 ) "
Then
P2 ~" P'i(1) and satisfies pl
pl
For P2 we can similarly choose P~(2) ~ with i(2) /> i(1) ~ 2 such that C
!
! 1
1"
t Recall that pj -K Py+l means: pjoy ~ pyPiu
and py+l ~ py.
208
Locally Pseudo-convex Spaces and Algebras
where we can assume t h a t C2 ) C1
9
Set p 3 -
C 2"~2 v"~ i(2)
and we
have
Thus proceeding we get ~3 _ { P l , P 2 , " ' } with the desired properties. It is clear from the way we constructed t h a t P is equivalent to a cofinal subset of P~ ~ whence ~3 ... pt ..~ Q 9 So A - (A, P), completing the proof. 4.6.2. DEFINITION. A first countable Hausdorff locally pseudo-convex algebra is called a pseudo-pre-Frechet algebra or a pseudo-pre-~ algebra. If A is also complete it is called a pseudoFrechet or a pseudo-~ algebra. 4.6.3.
DEFINITION. A p s e u d o - p r e - ~ algebra A is called a locally sm. p s e u d o - p r e - ~ algebra if its topology can be induced by a countable family Q = {qn} of sm. p n - s e m i n o r m s for some p,~ with 0 < p n ~ < 1, n = l , 2 , . . . . 4 . 6 . 4 . LEMMA. Every pseudo-pre-~ algebra A is of the form
A = (A,~_) where ~_ = {qn} is a countable family of pseudoseminorms with ker Q = {0}. If A is locally sm. pre-pseudoalgebra then we can choose ~_ such that each q E ~_ is sin.. PROOF. This follows from 4.6.1, 3.1.21 (iii). 4.6.5. DEFINITION. If in a pseudo-pre- ~ algebra A = ( A , Q ) , all q E Q are p - s e m i n o r m s for some fixed p ( 0 < p ~ < 1) then A is called a p-pre- ~ algebra. If in addition each q is s m . , then A is called a locally sm. p-pre- ~ algebra. The meaning of a p- ~ algebra or a locally sm. p- ~ algebra is clear. Finally, when p = 1, we say simply ~ algebra or locally sm. ~ algebra as the case may be.
The locally sm. pseudo-~ (respy. locally sm. p - ~ ) algebras are precisely projective limits of sequences of pseudo-Banach (respy. p-Banach) algebras. 4.6.6.
PROPOSITION.
PROOF. This follows from 4.6.4, 4.5.3. 4 . 6 . 7 . PROPOSITION. Every pseudo-pre- ~ (respy. pseudo- ~)
209
w 6. Metrizable Locally P s e u d o - c o n v e x Algebras
algebra A is a p r e - ( F )
(respy. ( F )
PROOF. Let A ker ~ - {0}. Then
(A,Q),
Ixl - ~
1
-2~
algebra.
~- -- {qn " n -
l + q,(x)
1,2,---}
and
)
is a (F)norm and A ( A , Q ) is complete.
(n, I.I). Further, I'l is complete whenever
4.6.8. algebras
of metrizable
Examples
locally pseudo-convex
(i) Let (p,) be a sequence of real numbers such t h a t 0 < pn <~ 1. The set C of all ~:-valued continuous functions x - x ( t ) on ~ is an algebra (over K) under pointwise operations. Set
Ilxll.- sup [x(t)lp ;
then
Iris<-
]1" II-
is a sm. p,~-seminorm. It can be seen t h a t : - 1, 2 , . . . } ) is a locally sm. pseudo- ~ pn -- p then C is a locally sin. p - ~ algebra. p : 1, we get a locally sm. ~ algebra which
C = (C, {11" algebra. If all Finally, when we denote by
(ii) Let I p - IP(K) denote the algebra of all sequences (x(n))n~1761 of elements of N such t h a t p ( x ) - ~ - ~ x(n)lP < c~, under rt
coordinate-wise operations. Consider the Cartesian power A-
If y -
(Yl,"',Yn,'")
(IP) w - I p • I p • . . . . Yn E I p then set
E A,
Pn(Y) -
(x)
p(y,~) -
~
ly("~)l p, where y~
-
(Y('~))~=I" Then it is easy
m=l
to check t h a t ( A , P ) is a p - ~ algebra, where P - {pn}. Further, it is locally sm. p- ~ algebra since each Pm is sm..
210
Locally Pseudo-convex Spaces and Algebras
(iii) We have already noted in 3.3.14 (example (iii)) that the algebra ~ of all entire functions (under pointwise operations) is a unital (F) algebra. Now set for f E ~', sup
Ilfll~-
If(z)l.
I~I-<,,
Then I1" II~'s are clearly sm. seminorms* and the family {IJ" [ [ ' n - 1 , 2 , . . . } induces the same topology as the (F) metric I1" I[a since convergence with respect to either is uniform convergence over compacta. Thus, (s {[l" I1.~ 1, 2,...}) is a locally sm. ~-algebra (over C). (iv) For 0 < p ~< 1, let L~ denote all ~:-valued measurable functions x - x(t) (or rather equivalence classes of such functions) on the unit interval [0, 1] such that 1
IlXll(np) - (fO 1 Ix(t) ["Pdt )n
< c~.
Now [[[xy[[(nP)] n
-
fo 1 Ix(t) ]'~Ply(t) ['~Pdt 1
<~
1
~/oI Ix(t)[2"Pdt ]~ [foI ly(t)12"Pdt ~~,
whence we conclude that II~yJl~.~) <
(p)
II~ll~.)lly[[2..
Again, if 0 < r < s, then by applying HSlder's inequality 8 1 = l - - 1 we obtain for x pr and 1, with p - ~,p, r
1
/01[x(t)lPr" ldt <~ (/oI [x(t)lo~'-~dt )~ x (/01lP'dt )~ which gives 1
1
(/oI Ix(t)l~ )~ <<. (/oI [x(t)l~ )~ t Actually they are norms.
w6. Metrizable Locally Pseudo-convex Algebras
211
It follows that we have IIXII1 ~ IIXII2 ~ ' ' "
(i.e.Ilxl[1 -< Ilxl[2 -<...)
so that P - {[[. ] [ n ' n - 1 , 2 , . . . } is a well-behaved (countable) family of p-norms and L~ is a p - ~ algebra. It is not a C algebra. To see this, consider elements of the algebra given by:
gin(t) --
1/(1 + ( m 1
1
1)~)
1
for 0 <~t~<. m~/p for 1/m~ < t ~< 1.
Then
-
gml(t) --
{ l+(m-
1) 1/p
1
(0 ~ t ~ 1/rn l/p) (1/m I/p < t ~ 1).
Since 1
f0
(gin- 1)nPdt-
1
(m--l) p
m (1 + ( m - 1)7)no
--~0
as m --~ c~, for each n, we get gm --~ 1. On the other hand 1
f0
(gin 1 -
m-1
1)nPdt- ~ ( m m
1) "-1 --, cr (if n > 1)
which implies that g ~ l ~ 1. Thus L~ is not a C algebra. Therefore, by 4.4.15, it is not locally sm. ( p - ~ ) algebra. The algebra L ~ - L~ is a Frechet algebra which may be called Aren's algebra since this was introduced and studied first by Arens [1'] who also showed [2'] that it is not a C algebra. (v) Let T be any locally compact, a - c o m p a c t , Hausdorffspace. Then the algebra C - C(T, K), of all the K-valued continuous functions under the topology of uniform convergence over compacta, is a locally sm. ~ algebra. (If T - [.J Kn, K,~ compact, f e C, tlf][n - s u p { I f ( t ) ] "t e gn} then C - (C, {11" [I,~}). If T is compact C is a Banach algebra.
212
Locally Pseudo-convex Spaces and Algebras When T is not compact C may fail to be an I algebra. For example, take T - ~, Kn - [-n,n]. Then [[. [[1 ~< [[" ]12 ~ < " ' . Clearly, if
U,~,~- ( f E c " llfll~ < ~} then {U,~,~ "n/> 1, E > 0} is a basis of nuclei, so that
{Un,e(1)}-{l+Un,~} is a basis of neighbourhoods ~x
2n
u~:
of 1.
Since the function
(z ~ ~), ~x
fn,E(x) - 1 + 2n C Un,E(1) and f,,~ is not invertible since it vanishes at x -
2n -~.
It
follows that C(~) is not an I algebra. (vi) Let C ~ - C~176 1] be the algebra of all K-valued infinitely differentiable functions on the closed interval [0,1], with pointwise operations. For f c C ~ write sup If(t)l ,
Ilflloo-
0~<e~
and set n
llfll~- ~ llflk)Jlo~, /c=O
where f(k) denotes the k th derivative of f ( f ( o ) _ follows from the definitions that we have Ilfll~ ~ Ilfll~§
(n-
f). It
0,1,2,...).
It can be shown by induction, using Leibnitz's theorem, that
Ilfgll~ ~ 2"+lllfll.llgll~. If we
set
Ilfll~- 2~+111fll. then I1" II~ is
sm.
and I1" I1~
I1" rl~. It is easy to see that (C ~r {11" II;~" ~ - 0, 1, 2,...}) is
213
w7. Ample Algebras
a locally sm. Frechet algebra. Further it is an I algebra. To see this consider its group Gi of invertible elements; Gi {f e C ~ 9 f ~ 0 on [0,1]}. We claim that Gi is open. For, given f E Gi we have by compactness of [0, 1], m 0 1 inf0.
0 choose an e with 0 < e < ~m0. If g E C ~ , ] I g - flI0 < e then
g(t)l >1 I f ( t ) ] - I f ( t ) - g(t)] /> m o - e
>
m0
2
> 0,
so that g E Gi. Thus Gi is open and C ~ is an I algebra. Finally, by 4.4.15, it is a C algebra. Thus C cr is a locally sm. ~ algebra which is a C I algebra (cf. Example V). (vii) In 3.6.33 we have seen that the field C(X) of rational functions carries a topology (Williamson topology) under which it is a CI (division) algebra W. There is another topology on C(X) making it a pre-~ algebra which is also an I algebra. This topology as well is due to Williamson (for details, see [14', pp.731-32] or [31, p.83]).
w 7.
Ample
Algebras
4.7.1. DEFINITION. A TLS X is called ample if its (continuous) dual X* separates points of X " given elements Xl ~= x2 in X there is an f E X* with f(Xl) ~= f(x2). The separation condition is clearly equivalent to the simpler condition: given x ~ 0 in X there is an f c X* with f(x) # 0 (it suffices to observe that f ( x l ) # f(x2) iff f(Xl - x2) # 0). A TA A is called ample if it is ample as a TLS. 4.7.2. R e m a r k . Clearly an ample algebra (or TLS) must necessarily be Hausdorff. 4.7.3. PROPOSITION. ( a ) E v e r y subalgebra Ao of an ample algebra A is ample. (b) A direct product or direct sum of ample algebras in ample.
Locally Pseudo-convex Spaces and Algebras
214
PROOF. (a) If y E A0, y # 0 then by ampleness of A there is an f E A* with f(y) #- 0. Write f o - flAo. Then f0 E A~ and fo(y) = f(y) # O, whence A0 is ample. (b) Let A = IF[ A~ be a direct product of ample algebras Aa. If a = ( h a ) # 0 in A then aa o # 0 for some a0. Since Aa o is ample we can choose f~o E A~o with fao(aao) # 0. Define f on A by f ( x ) = f~(rax), where x = ( x a ) a n d r~ is the projection x ~ x~. Clearly f E A* and f(a) = f(aao) # 0 , so that A is ample. Since the direct sum ~ Aa is a subalgebra of A, by (a) it is also ample, completing the proof. 4.7.4. PROPOSITION. ( a ) T h e unitization A1 of an ample algebra A is ample. (b) The complezification A of an ample real algebra A is ample. (c) If an ample real algebra A has complex structure then the resulting complexal gebra /i is ample. PROOF. (a) Let al - he1 + a (a E A) be a non-zero element of A1. We have to show that there is a fl E A[ with f l ( a l ) # 0. For the construction of fl we have to consider two cases. C a s e 1: c z - 0 , a l - a . Since A is ample there is an l E A * with f ( a ) # O. Extend f to fl on A1 by setting for X l - Ael+x ( x E A , ) ~ e K) f l ( X l ) - ) ~ + f ( x ) . Then fl e A~. and f l ( a l ) -
f(a) :/:0. C a s e 2: fl(al)
a-#- 0. Set ] ' l ( ) ~ e l + x ) -- )~. Then fl C A~ and
= (x 76 O. a.,
(b) Suppose that zo e A, zo - xo+ iyo # 0 (xo, Yo C A). Since A is ample, and x0 or Y0 # 0 , there is an f0 E A* with fo(xo) or fo(yo) # O. Setting N
+ N
N
N
(z- z+iv) N
and f(z) - f o ( z ) - i f o (iz), it is easy to check that f is C-linear and f e (A)*. Since ] ' ( z 0 ) - 2(fo(xo)+ifo(Yo)) # O, A is ample. (c) For f e A* set ] ( x ) - f ( x ) - if(ix). Then
w7. Ample Algebras
/ ( ( ~ + iz)~)
215
=
/((,~ + ifl)x) - i / ( i ( , ~ + ifl)~)
=
,~f(x) + fl/(;~)
=
(~ + i~)[/(~) - ;/(;~)] - (~ + ; ~ ) ] ( ~ )
- ;._
fl/(~) - ;,~f(;~)
so that f E (r If x0 E A - A and x0 #- 0 then by ampleness of A there is an f e A* with f(xo) r O. But then ] e (ft.)* and f (xo) - f (xo) - i f (ixo) # O, proving A is ample. 4.7.5. PROPOSITION. For a TA which is a division algebra to be ample it is sufficient that A* 7s {0}.
If a x fa
PROOF. Suppose that A is a division TA with A* ~: {0}. f E A*, f # 0 there is an a0 E A with f(ao) ~ O. For any in A with a ~- 0 define fa(X) - f (xa-lao). Since the maps ~ xa -lao and y ~ f(y) are continuous, fa is continuous, E A*. Since f~(a) - f(ao) # 0, A is ample as required.
4.7.6. PROPOSITION. Every locally convex algebra - i n particular a Banach algebra- is ample. PROOF. This is an immediate consequence of the HahnBanach theorem (see [24, p.59]). 4.7.7. R e m a r k . For 0 < p < 1; there are p-Banach algebras which are ample as well as those which are not ample. For instance the algebra I p = IP(D<) (example (v) of 3.4.6) is an ample p-Banach algebra. To see this define, for each n /> 1, fn(x) - xn, where x - ( X l , X 2 , . . . , X n , . . . ) - - ( X n ) e lP. Then it is easy to see that fn e (lP) *. If a - - (an) e l p, a 7 s then for some n, an ~ 0. Then fn(a) -- an ~ 0, proving I p is ample. Consider next the space L p -- LP[0, 1] consisting of (equivalence classes) of 0<-valued Lebesgue measurable functions f such that
fo If(t)l"dt < c~. With llfll-
fox If(t)] adt,
LP is a p-Banach space. It can be made into a p-Banach algebra by introducing in it trivial multiplication" for x, y E LP, xy - O.
Locally Pseudo-convex Spaces and Algebras
216
L p is not ample since it is known that '0' is the only continuous linear functional on L p (see [24, p.36]).
w8.
Topological
Spectral
Radius
4.8.1. DEFINITION. Let A - (A,p) be a p-seminormed algebra. Then, by 3.4.3, p is a. sm. and so the limit 1
Vp(X)- lim p(xn)-z < cr ll---~O0
exists, by 3.3.6. The non-negative real number Vp(X) is called the topological spectral radius of A, the adjective "topological" being justified by" 4.8.2. Vq
--
LEMMA.
If q is a p-seminorm with q ..~ p then
/2p.
PROOF. By 3.4.1, q is also a. sm.. Further, by 3.2.11 (ii) we have constants Ca,Cp such that p < C q, q <<.c p. Therefore, 1
!
1
vv(x ) -- n -lim p(z'~)-z <. n -lim C~q(x")~ < vq(x), -400 -'-~O0 1
since
aim C q " - 1. Similarly,
n---~ o o
vq(x) <~ Vp(X). Then v p ( x ) -
Vp(y), as desired. 4.8.3. PROPOSITION. The topological spectral radius v(x) vp(x) possesses, besides the properties (i) - (v) of 3.3.7, the fol-
lowing: (vi) v ( A x ) - ]A]Pv(x); (vii) v(x + y) <~v(x) + v(y) provided x ~ y. PROOF. The property (vi) has already been established in 3.4.5. So we have only to prove (vii). For this it is convenient to follow the method of Bonsall-Duncan [4, p.71]. We may assume that p is sm.. Choose e > 0 and set 1 -
+
1 ,
-
217
w 8. Topological Spectral R a d i u s
Since
x ~
y we have also u ~ v. Also, by c o n s t r u c t i o n < 1, so t h a t by 3.3.6, p ( u n ) , p ( v n) < 1 for all sufficiently large n. If follows t h a t the semi-groups { u n 9 n 1 , 2 , - - - } , { v n : n : 1 , 2 , . . . } are p - b o u n d e d . Since u ~ v the semi-group S g e n e r a t e d by u , v is u(u),u(v)
{u k,v y, u k v j 9k , j - 1, 2,---}. Since p is sm. we have It follows from the above t h a t S is p - b o u n d e d . By 3.5.10 we can find a sin. p - s e m i n o r m q such t h a t q ,,, p, q ( u ) , q ( v ) K 1. By 4.8.2 we have Vp - vq - v (say). T h e n 1
q(x)-
q((v(x)+e)-~u)-
(v(x)+e)q(u)
<~ v ( x ) + e
(since q ( u ) <. 1).
Similarly, q ( y ) <. v ( y ) + e. It follows t h a t
,(~ + y) <. q(x + y) .< q(~) + q(y) .< ~(,) + ,(y) + 2~. F r o m the a r b i t r a r i n e s s of e we conclude t h a t u(x + y) ~< u(x) +
-(y). If A is c o m m u t a t i v e t h e n v is a c o n t i n on A ( A , p ) . F u r t h e r , uv - u.
1 . 8 . 4 COROLLARY. uous sm. p-seminorm
PROOF. T h a t v is a sm. p - s e m i n o r m follows from 3.3.7 (iii), 4.8.3 ((vi), (vii)). T h e continuity of v is a consequence of the inequality in 3.3.7 (i). Finally, v~ = v since v ( x n) - v(x)'* (by 3.3.7 (ii b)). 1 2n
4 . 8 . 5 . LEMMA.
lim
-- 2.
n--+ oo
PROOF. Write an -- nn(n!) -1. T h e n a n ~ a n - 1 - ( 1 - 1 ) / ( 1 1)n. Using the well-known result lim (1 + z ) n _ e z t (z e C) we n--+ oo get t We denote the classical exponential function by e z, so that in partic1 1 ularwehave e - l + ~+~+-.-
Locally Pseudo-convex Spaces and Algebras
218
lim
an 1
n--,oo an-
1
=
1 e- 1
lim (1 - ~1) n
~---~ (x)
--e.
It follows that •
lim a , ~ -
lim
n - -,, oo
Therefore
an
(1)
---e.
n - - , oo a n - 1
1
1
2n
~im
lim
n---+ o o
(~)2 1
lira { 2, 1
lim ( 2n' ) ~ n--,c~ (2n)2n -1
--
e
=
2.
1
92- n---+ limO0
( n n ) -~ -~.
92. e, where we have used (1).
4.8.6. THEOREM (Zelazko). Let A be a commutative algebra (over E, p ( r O) a sm. p-seminorm on A, u - up. Then"
(i) Th~ unit b~U B 1 - {* c A ~(~)< 1} i~ ~o~,~,. 1
(ii) ][x[] - u(x)-~ is the gauge of Ul and it is a sin. seminorm. PROOF. (i) By 4.8.4, u is a p-seminorm and consequently, by 3.2.7 (i), B1 is closed in the u-topology. To show that B1 is convex it is enough to show that it is midpoint convex, t Assume first that u ( x ) , u ( y ) < 1. Then l(x§ 1 1 n)-i
~(~
~ ( ~ + Y) - 2-7l i % p((~ + y) ..
(1)
n
Since x ~ y, (x + y)n) _ ~ ( ~ ) x ~ y n-k, so that by subadditivity k=O
of p, we have
p((~ + y~) .< ~
p(~y"-~).
k=O
Choose e > 0 such that u ( x ) , u ( y ) < e < 1. t i.e. x, y C B 1
==~ -~+Y T- EB1
(see [15, p.17])
(2)
w8. Topological Spectral Radius
219
Since u ( x ) , p ( y ) < 1 we can find N1 such that 1 1 p(xn)~,p(yn)-~ < e, or, p(xn),p(y n) < en < 1
for n >~ N1. Therefore, by 3.3.4, p(xn),p(y n) --~ 0 and consequently we can find C > 0 such that p(xn),p(y n) < C, for all n.
Since cn --~ 0 we can choose N2 such that er'C < 1 for all n/> N2. It follows that for n/> N - max(N1, N2) and arbitrary rn
p(xny m) <. p(xn)p(y m) < enC < 1.
(3)
Similarly for arbitrary n and rn ~< N,
p(xny m) < 1.
(4)
From (2), (3), (4) we obtain for n/> N,
p((x + y)2n)~<~-~
p(xky 2n-k) <~~
k:0
<~(2n + 1)
k=O
(5) since (~'~) ~< (2~) for all k. From the definition of u and (15) w e get u(x + y)
:
2
1
1
1 lim p((x + y)2n)~ l i m ( ( 2 n + 1)
)~
2P n ~ c r 1
1
~<
2n
20 n--,oolim(2n + 1 ) ~ ( l i r n
)P
1
1
~<
~-~(lirn
2.
1
)~ (since lim (2n + 1 ) ~ -- 1) n----~ o o
1
~<
2P " 2~ (using 4.8.5)
~<
1,
which proves l ( x + y) E B1. Next, if u(x), u(y) ~< 1, we can choose a sequence An with 0 < An < 1 and An ~ 1. Then u(Anx), u(Any) < 1, so that, by the result above, Zn - 89 (Anx+ A~y) c B~. It follows that ~1 ( x + y ) - l i m z , E B a . Thus B1 is midpoint convex, completing the proof of (i).
Locally Pseudo-convex Spaces and Algebras
220
(ii) Since clearly, B1 - {x E A " II~ll < 1}, it follows from 4.1.13 t h a t I1" II is the gauge of B1. Finally, since p is sm., Si is a subsemigroup and consequently the gauge II. I[ is s m . . 4 . 8 . 7 . COROLLARY. then ]l.]] is a norm.
If the algebra A is a division algebra
PROOF. If x E A, x ~- 0 then x is invertible, and so by 3.3.7
(v),
Ilxll
> o.
4 . 8 . 8 . DEFINITION. An element x of p - s e m i n o r m e d algebra A = (A, p) is called topologically nilpotent or t. nilpotent if v ( x ) = vp(x) = 0. If A = (A, {p~}) is a locally pseudo-convex algebra t h e n an element x E A is called t. nilpotent if each ca(x) --
~ (x)=0 Clearly every nilpotent element is t. nilpotent
(x n -
0
p~(~)~ -o). 4 . 8 . 9 . LEMMA. If x is t. nilpotent then (i) ~ -~ o, (ii) Ax is t. nilpotent for every A E K. PROOF. (i) Take any c with 0 < e < 1. Since va(x) aim p~ (x") 1 - - 0 , we have p~(x n) < en < e for n i> N. It follows t h a t p~(x '~) --~ O, x '~ --~ O. (ii) By 4.8.3 (vii), v ~ ( A x ) - ] A l P v ~ ( x ) - 0. 4.8.10. gebra A ideal of A.
PROPOSITION. In a commutative p - s e m i n o r m e d al( A , p ) the set I of t.nilpotent elements is a closed
PROOF. By 4.8.4, 3.3.7 (iii) we have"
-(~ § y)~< ~(~)§ ~(v), ~ ( ~ ) - I~1'~(~),~(~y)~< ~(~)~(y). Therefore I is an ideal. Moreover, 7" is closed, as follows from the continuity of p (see 4.8.4). 4 . 8 . 1 1 . PROPOSITION. Let A be a p - B a n a c h algebra and x E A. Then: 1 r(x) <~ ~,(x)~. (.)
w 8. Topological Spectral Radius
221
If A is real we have also 1
~(~) < .(~)~.
(**)
PROOF. We may assume the norm !1" II to be sm. and write 1
v-v,,.
If I~1 > v ( x ) ; then
V(--)~-lx)- I~1-,~(~) < 1, so that by 3.3.19, -A-~x is q. invertible. It follows by 1.7.8 that 1
~'(.) c {~ ~ K I~I-< ~(~)a} so that (,) holds. N
If A is real we apply (,) to A and deduce (**). 4.8.12. COROLLARY. In any p - B a n a c h algebra a t. nilpotent element is q. nilpotent. 1
PROOF. Since r(x) ~< v(x)7, hence the result.
v(x) -
0 ::~ r(x) -- 0 and
CHAPTER V SOME
1.
Vector-valued
ANALYSIS
Differentiability
and Analyticity
5.1.1. DEFINITION. Let X be a Hausdorff TLS and X* its (continuous) dual. Let G C_ K be an open set. A function f : G --~ X is called weakly differentiable if there is a function g : G --~ X such t h a t for each x* E X*, the scalar-valued function x ' f (A) - x*(f(~)) has the scalar-valued function x*g(~) as its derivative in the usual sense; we write g - f~(w) and call f~(w) the weak derivative of f. The function f is called strongly differentiable if for each 2 E G, f ( # ) - f(A) lim exists in the topology of X. We denote this limit by /'()~) and call f ' the strong derivative of f. 5.1.2. LEMMA. A strongly differentiable function f is weakly differentiable and continuous, and moreover, the strong derivative fl coincides with the weak derivative fl(w). PROOF. It follows from the definition of the strong derivative that lim ( f ( # ) - f(,~)) - lim (/~ - )~)f'()~) - 0 proving f is continuous. Again, lim
x* f (tt) - x* f (A)
= lim x * ( / ( # ) - / ( ) ~ ) ) ~-~ #-~
x*f'(~),
whence f is weakly differentiable with f l ( w ) _ fl. 5.1.3. DEFINITION. A function f : G - - - , X is called weakly analytic if x*f(A) = x*(f(~)) is an analytic function of ~ on G in the usual sense, for each x* E X. We call f strongly analytic on G
w1. Vector-valued Differentiability and Analyticity
223
if around each point Ao E G _C K, there is a neighbourhood {A E K "l A - ,k0l < r0} in which f has a power series representation t oo
rt--0
where x , E X and the series converges in the topology of X. If X is a complex TLS we will also use the expression weakly holomorphic (respy. strongly holomorphic) for weak analyticity (respy. strong analyticity). 5.1.4.
LEMMA.
A strongly analytic function f is weakly
analytic. PROOF. Suppose t h a t oo
rt--0
Then, for each x* E X*, we have oo
n=O
so t h a t f is weakly analytic. 5.1.5. Remark. If X is a complex, Frechet space (i.e. a complete metrizable locally convex space) then for a function f : G --, X, weak holomorphy of f ==~ strong holomorphy of f (see [24, p.79]). 5 . 1 . 6 . Let X -
(X, I1" tl) be a p - B a n a c h space and oo
rt:0
a series in X. P u t t In the representation we find it convenient to write the scalars on the right side (instead of the customary left side)
Some Analysis
224
1
1
r0 -
1
lim I[x,]l~,R0 - ro 1 , R - Rg - ro ~ (lim - lim sup).
Ft--~ OO
R is called the radius of convergence and {A e K ' I A I -- R} the circle t of convergence of the series (,). Next let X - (X, {p~}) be a complete n a u s d o r f f locally pseudo-convex space. Set 1 n---~ (x)
R
-
1 P~
infR~-infr~
R again is called the radius of convergence of the series ( , ) and {A e K ' I A I - R} its circle of convergence. 5 . 1 . 7 . PROPOSITION. (a) The series (,) converges absolutely
uniformly for IAI <~r, for any r with O < r < R. (b) If IAI > R the terms of the series are unbounded and consequently the series diverges (i.e. does not converge).
(c)
diiT
got ] om (,)
ti t d oo
rt--1
PROOF. We will first treat the case where X is a p - B a n a c h sp~ce ( x , II-II). The proofs are all modelled after those of the corresponding classical results. oo
ll .ll(l l ) - - which is a
(a) The absolute-valued series n-0
numerical series - converges, by the classical Abel's lemma, for IAI p < R0, or equivalently, for IAI < R. Further, this series t In the real case the circle of convergence is to be interpreted as the end-points of an interval.
w 1. V e c t o r - v a l u e d
Differentiability
converges uniformly for IA[p <~ r p, whence formly for IAI ~< r. (b) If IAI > R, choose r so t h a t IAI > r > 1
rP
<
1
Rp
--
1
Ro
..
225
and Analyticity
,,
(,)
converges uni-
R. T h e n ,,
-- llmllXnllK,,,, n --,oo
and consequently there are arbitrarily large n with 1
1
1
tlxnll~ > ~-~, or [[Xn[[ > rp n It follows t h a t ---~ 0 0 .
T h u s the series (,) is not b o u n d e d (for [A] > R ) and so not convergent (by 3.2.15). (c) If we put r ' -
1
lim[l(n+l)xn+l[[~,
then
tl--* oo
1
n-i-1
r' --n-,oolim[{(n + 1) a--4-f}P [[Xn+l II h--4-Y] --K-1
1 _
_
di~rn~ ]]xn+ll['~-I
_ r,
1
where we have used the well-known result " n ~ -~ 1 as n --~ oo. To extend the above proofs to the case where X is locally pseudo-convex, we note t h a t if [A[ < R~ (for each a , ) so t h a t oo
the proof above for (a) shows t h a t
~-[~pa(Xn)([A[P") n < oo, for n--0
each pa, where X ( X , { p ~ } ) . Hence ( a ) f o l l o w s for the locally pseudo-convex case. Further, if [A[ > R t h e n there is an a such t h a t IAI > R~, whence it can be shown, as above, t h a t p~(xnA n) --~ c~, so t h a t the series is not p a - b o u n d e d . Therefore the series is once again divergent, proving (b) for the general case. Finally, if we set r ~'
-
pa((n + n----~ o o lim
1
1)Xn+l)"+'
then as in the proof above for p - B a n a c h spaces we o b t a i n r~ - r ~ot~ whence R ~ - R, where R' is the radius of convergence of the
Some Analysis
226 series (**).
5.1.8. PROPOSITION. The function oo
rt--0
is strongly differentiable inside its circle of convergence and we have
E oo
ft()~) _
Xnn~n-l"
(**)
n=l
In particularly, /(A) is a continuous function of A. PROOF. The proof we give is again modelled after the proof in the classical case (see [25, p.200]). We take x , e X = (X, {p~}) and assume that the radius of convergence of the series (,), R > 0 (if R = 0 there is nothing to prove). Choose a A c N: with IA] < R. Take a real number r with IAI < r < R. Writing O(3
n--1
we have, for ]#1 < r, Oo
#-
A
-g
(1)
--n=l
where ft. - ( ~ " - A " ) / ( # - A ) - n)~ n - 1 . Clearly fll - O , and for n >/2, we get n-1
fin -- ( ~ - )i) E k'~k-lI~n-k-1
(2)
k=l
(as can be easily checked). Since IAI ' I~t] < r, and
I~.1 -< t . - al ( ~ k ) k-1
~ k =n-1 X k ~< n 2 , w e
obtain from (2)
~"-~ -< I.- ~1~=~"-= (- ~>2).
(3)
w 2. Exponential and Logarithmic Functions
227
Therefore oo
co
rt--1
r
n=
1
n:
2
(since fll -- O) oo
n--2
(using (3)) i.e.
(4)
P~ n=l
n--0 oo
For the series
+
", wo h ve
n--O
r~' -
lim p~(x,+2) • (n + 2 ) ~ - -
n - - ~ O<)
lim p~(xn) ~-. - r~.
n---+ OO
It follows that R ~ - R. Since r < R - R ~, the series on the RHS of (4) converges, whence by (1), (4), as tt --+ A we obtain
ft(A) -- g(A) proving (**). The continuity, of f follows from 5.1.2.
w 2.
Exponential
and Logarithmic
Functions
5.2.1. DEFINITION. Let A be a unital Hausdorff TA with unity e. The exponential function in A is defined by c<)
E t(x)-
Exp(x)-
~
~z",
(x ~
e, 0 ! - 1)
(,)
n:0
whenever the series on the right converges. We denote by PE the domain of E and by s its range. Since 0 E P E , e E s both t The Hausdorff assumption ensures that E is well-defined.
Some A nalysis
228
PE, ]~E are non-empty. The inverse function Log is defined on )~E by setting Logy - x if y - E(x). The function Log is in general many-valued. We denote the classical exponential function by )k 2
E(A)-e ~-I+A+2.v +"" (ACE). In particular, we write e--l+l+~+.--
1
5.2.2. PROPOSITION. DE -- A if A is a unital pseudoMichael algebra -inparticular a unital p-Banach-algebra; moreover the series converges absolutely for all x E A. PROOF. Let A Pa
(A, P ) , P -
~
~<
{pa}. Since = un
(say)
and un+X Pa(X)pa --~ 0 , ~ne "" serms " for E(x) converges absolutely un = (n+l) and so also in A for all x E A, by 3.1.24. 5.2.3. PROPOSITION. Let A be a pseudo-Michael algeba- in particular a p-Banach algebra - w i t h unity e. Then: (i) E ( 0 ) - e ;
E(e)-ee.
(ii) E ( x + y) - E ( x ) E ( y ) provided x ~ y. (iii) E ( - x ) -
E(x) -1.
(iv) If A is complex and u an idempotent then E(2~riu) -
0
(i -
PROOF. (i) Clear. oo
(ii)
E ( x + y) -
~(*+u)"=! . Expanding the s u m m a n d s on n-:O
the RHS, using the binomial theorem, and regrouping the terms (which is permissible because of absolute convergence) we find t h a t yn the cofficient of W.t is
229
w2. Exponential and Logarithmic Functions
e+
(n + 1)x n § 1
+
(n § 2)(n + 1)
x2
2!
(n + 2)(n + 1)
III
J
Q
x 2
= e + x + -~. + . . . -
E(x).
Thus, y2
E ( x + y) - E ( x ) ( e + y + ~. + . . . ) - E ( x ) E ( y ) . (iii) This follows from (ii) by taking y = - x
and using (i).
(iv) E ( 2 . i u ) - e + {27ri+ 2! + ' " .}u. The expression in the bracket above - e 2~ri - 1 - 1 - 1 - 0 . So we get E(21riu) - e. 5 . 2 . 4 . COROLLARY. Let T be a bounded l.o. on a p - B a n a c h
space X.
Then T2 E ( T ) - I + T + ~. + . . .
is an invertible bounded l.o. on X. PROOF. Consider the p - B a n a c h algebra B ( X ) (iii). Note t h a t E ( T ) - 1 - E ( - T ) . 5.2.5. ormaliz
and use 5.2.3
If A is a Banach algebra with unity e and I1" It, the.
LEMMA. o,m
]JE(x)]f ~< E(]Jxjj). P R O O F . Clear.
5 . 2 . 6 . If A is a TA w i t h o u t unity we can introduce the quasiexponential function Eq by x2
+...
which makes sense (whenever there is convergence). If A1 is the unitization of A and E the exponential function in A1 then we have the obvious relation
E ( x ) : el + Eq(x)
(x E A),
Some A nalysis
230
where el is the unity of A1. Using this relation and 5.2.3 (ii) we can easily deduce the identity
Eq(x) o Eq(y) - Eq(x + y) whenever x ~-~ y. Since E q ( O ) - 0
we get Eq(-X) - (Eq(x))'.
5.2.7. DEFINITION. Let A be a TA and Gq its group of q. invertible elements. The connected component of Gq containing 0 is called the principal component of Gq and we denote it by Gqo. Similarly, if A has unity e, the connected component of the group Gi (of invertible elements) containing e is denoted by Gie; Gie is called the principal component of Gi. 5.2.8. PROPOSITION. In a C algebra A, Gqo is a closed normal subgroup of Gq. If A has a unity e, Gie is a closed normal subgroup of Gi. PROOF. Since A is a C algebra, by 3.6.5 ((a), ( b ) ) G q and Gi are TG's. The stated results now follow by applying to these groups a standard result [21, p.39] in the theory of topological groups regarding the identity component. 5.2.9. COROLLARY. If A is a p-Banach algebra then Gqo is a clopent normal subgroup; if A is, besides unital then Gie is a clopen normal subgroup of Gi. These results hold, more generally, when A is a pseudo-Michael Q algebra. PROOF. In view of 5.2.8 we have only to prove Gqo , Gie are clopen. By 3.6.23 (b), 3.6.21, 3.6.10 we conclude that Gq,Gi are open when A is a p-Banach algebra. Also they are open in the pseudo-Michael algebra case by virtue of the Q algebra hypothesis we have in this case. Finally, in all the cases A is locally connected (see 3.2.8, 4.3.16). Hence the clopen properties of Gqo, Gie.
Let A -
5.2.10. PROPOSITION. Banach algebra. Then:
(A,[[. ]]) be a unital p-
(x)
(i) The series Log x - - ~
1 ( e - x) n converges absolutely for
n--1
all x E A with v ( e - x) < 1, where u clopen=closed and open
vii.[[.
231
w2. Exponential and Logarithmic Functions (ii) E ( L o g x ) - x.
(iii) For each x e A, the function Ez(A) - E(Ax) is analytic for all A E K. In particular, Ez is entire when K - C. PROOF. Suppose that u ( e - x ) < e < 1, then ]l(e-~)"11 < ~" for n/> (some) N. It follows that 1
En
I1 (e - x) ~ II -- ~ II (e - x)" II < n
< n p
~"-
oo
Since ~
E,~ converges the series for Logx converges absolutely
n-N
for u ( e - x) < 1. The identity (ii) can be checked, as in the classical case, by substituting the series for Log x in each summand of the series oo (Logx)n E(Logx)- ~ n! n=0
and simplifying (the needed steps for the simplication are justified because of absolute convergence). Finally, we have oo
xn ~n
r~--O
n!
Thus radius of convergence for the above power series in A (see 1
5.1.7) by r 0 P, where Xn
I
r o - ,~--,oolimI1~. II~
=
lim Ilxnll 88
.-~oo (~!)~
1 1
P
Now lim ( 1
)-
1 n
- lirn
(1
1)
( n + 1)!/~.
-- lim
n+l
=0.
Some Analysis
232 1
So r0 -- 0, r0 p -- 1 = oo, whence the series Ez(A) converges for 0p
all ,~ and (iii)follows. 5.2.11. R e m a r k . Proposition 5.2.10 can be extended to unital pseudo-Michael algebra A = (A, {p~}) in the following form: For every x in A with c a ( e - x ) < 1, for all a , the series for Log x (defined in 5.2.10) converges absolutely and for all such x the identity (ii) of 5.2.10 holds. Further, the function E , - E,()~) is analytic for all A E K, for each x E A. 5.2.12. PROPOSITION. Let A be a unital p-Banach algebra. The range RE of the expoential function E generates (algebraically) the principal component Gie (i.e. Gie is the smallest subgroup of Gi containing ]~E). PROOF. Since A is connected and E continuous, RE is connected. By 5.2.3 (iii), RE C_ Gi. Since e E RE (by 5.2.3 (i)) and ~ E is connected, ]~E C Gie. Write
U--{xEA']le-x]]
< 1}.
Then, by 5.2.10 ((i), (ii)), U C RE C_ Gie. Since U is an open neighbourhood of e in Gie and Gie is connected, U and hence RE generates Gie (see [20, p.37]). 5.2.13. COROLLARY. ]~E- Gie iff ]~E is a subgroup. In particular, if A is commutative, ]~E- Gie. PROOF. The first statement is immediate. For the second we observe that by 5.2.3 ((i), (iii)), ~E is a subgroup and hence the result.
If y C ]~E then y belongs to a connected abelian subgroup of Gi. Conversely, every connected abelian subgroup H of Gi is contained in ]~E. Hence y E ]~S (i.e. y has a logarithm)iff y belongs to a connected abelian subgroup H of Gi. 5.2.14.
COROLLARY.
(Theorem of Nagumo [11']).
PROOF. If y e ~E then y - E(x), and H - { E ( A x ) ' - o o < A < 0o} is clearly a connected abelian subgroup of Gi. Next, by 1.1.9, there is a commutative subalgebra B0 with H _c B0. Then
w2. Exponential and Logarithmic Functions
233
B - B0 is a c o m m u t a t i v e unital p - B a n a c h algebra with H _c B. By 5.2.13, the range E(B) - Gi~(B) (the principal component in B). Since e E H and H is connected we have
H c G i ~ ( B ) - E(B) c_ E ( A ) -
~E.
The above two results clearly imply the final assertion in the corollary.
Let A be a complex unital p-Banach algeba. A linear functional X on A is a character iff 5.2.15.
THEOREM ( G l e a s o n - K a h a n e - Z e l a z k o t ) .
(i) x ( e ) -
1.
(ii) k e r x comprises non-invertible elements. PROOF. Suppose t h a t X is a character. Then, by 1.3.10, condition (i) holds. Further, if x is invertible, X(x)x(x -1) x ( e ) - 1, so t h a t X ( X ) ~ 0 and (ii) also holds. It remains to prove the "if" part of the theorem. So assume t h a t X is a linear functional satisfying (i), (ii). Write M - ker X. Then X being a linear functional ~= 0, M is a subspace of A o f c o d i m 1, so t h a t we have A C e + M . We shall now show t h a t X is bounded with IIXII ~< 1. If x e M, X ( x ) - O , so t h a t 0 - I X ( X ) I <~ Ilxll. Next consider an element y e A \ M . Then y has the form y -- A t - x
(A E C,A ~: 0, x E M ) .
Since A - i x E M, by hypothesis (ii) it is not invertible and so, by 3.3.20 (ii), l i e - A-lxll tt /> 1. Therefore
Ix(y)l-
Ix(~,~ - ~)1-
I~,1
<
=
I~lll~1
A-lxll ~ -II~,~-
Ilyll ~ (u~ing ~-
~-
~11~
y).
It follows that Ilxll ~< 1, in p,,rti~ul~r that X is ~ontinuou~. To prove t h a t X is a character it is enough by 1.3.19, to show that xEM~x 2EM. Consider now an x E M. We have to show t h a t x 2 E M. We may clearly limit ourselves to the case t h a t I l x l l - 1. Set t These authors have obtained the result for Banach algebras. tt We assume (without loss of generality) that I1" II is sm..
Some A nalysis
234
oo
~
f(A)-
n=O
X(Xn)An
(A C C)
n!
Since
1
(1) "
n
Ix(x")l < IIxll IIx"ll~ < II~ll ~ - 1
(2)
and co
I~1" = E(f~f) n=O
n!
(3)
"
it follows t h a t the series for f(A) is absolutely convergent and hence f(A) is an ordinary entire function. Further, since oo
n!
-
E(IAI),
rt--0
f has order at most 1. By continuity of X we have
I(A) - X
n!
(4)
- x(E(Ax))
where E is the exponential function in A. Since E(Ax) is invertible, f(A) 7- 0, by (4) and (ii). We now apply H a d a m a r d ' s factorization theorem to conclude t h a t f(A)-
e ~+f~
(5)
(~,fl e C)
where e )' denotes the classical exponential function. From (1) we find f ( 0 ) 1 and f ' ( 0 ) X ( X ) - 0 (since x e M). These imply t h a t in (5) a - ~ - 0, whence f(A) - 1. Therefore X(X 2) - f " - 0, whence x 2 E M, completing the proof.
w 3.
Square
Roots
and
Quasi-square
Roots
5.3.1. DEFINITION. Let A be an algebra and x E A. An element y such that y2 _ x is called a square root or sq.r. of x; it may or may not exit. (Since (_y)2 _ y2 _ x a sq.r. even
w 3. Square Roots and Quasi-square Roots
235
w h e n it exists is not unique). Similarly, an element y such t h a t y o y - x is called a quasi-square root or q.sq.r, of x. 5 . 3 . 2 . LEMMA. I f A has a unity e then an e l e m e n t y is a q.sq.r, of an e l e m e n t x iff y + e is a sq.r. of x + e. PROOF. This follows from the identity (y + e) 2 - e + y o y. 5 . 3 . 3 . LEMMA. (cf. [4, p.44, L e m m a 12]). Let A - ( A , P = {pa}) be a p s e u d o - M i c h a e l algebra, x, y E A , x ~ y, and x o x y o y . I f v ~ ( x + y) < 2 p~ (p~ - h o m o g e n i t y index of p~) for all a then x - y. PROOF. Write a - iI ( X + y) , b -- x - y . Then a b - l(x2 y2) _ - b (using x o x yoy). This implies a o b a. Since v ~ ( a ) - l__v2p~~(x + y) < 1, by 4.4.14, a is q. invertible, so t h a t by 1.1.25 b - 0, x - y. 5 . 3 . 4 . PROPOSITION. (cf. [4, p.44, Proposition 13]). In a p s e u d o - M i c h a e l algebra A - ( A , { p a } ) every e l e m e n t a with v ~ ( a ) < 2 p~ - 1 has a unique q.sq.r.b, with ca(b) < 2 p~ - 1. Further, b ~ a and v~(b) <~ v~(a). In particular, every t. nilpotent e l e m e n t a has a unique t. nilpotent q.sq.r.b. PROOF. Following Bonsall-Duncan [4, p.44], we use m e t h o d based on the existence of fixed point for o b t a i n i n g results. For each a, fix an r/a such t h a t c a ( a ) < r/a < 2 p~ T h e n , by 3.5.10(i), we can choose a sm. p a - s e m i n o r m such
the the - 1. that
c a ( a ) ~
-
x2
T x - ----~---(x e S ) .
T h e n we have
t
2~ -
1 -
2.2 ~-~ -
1 -
2~-'
+ (2 ~ - ~ -
1) ~< 2 ~ - ~
(~ince
p < 1).
Some Analysis
236
q~(Tx)
1
-
1
1
~<
1
x 2) ~< 2--~-(r/a + r/2) - 2-7-(1 + r/a)r/a
2P. q . ( a -
92 p" r/~ - r/~,
2p~
so t h a t T is a m a p p i n g S ~ S. Further, if x , y E S, q~(Tx - Ty)
-
x 2 _ y2 1 q a ( ~ 2 ) < 2-;:q~ (~ + y)q~ (~ -- y) 1
2P~
92 r / , ~ q ~ ( x - y) - # ~ q , ( x - y),
where #a - 21-p"Wa < 2 1 - p " ' 2 p"-I - 1. Thus T is a c o n t r a c t i o n m a p p i n g and so by 4.3.15, T has a fixed point b 9 T b - b. It follows t h a t 2b - a - b2 or b o b - a. Since b E S c_ Ba, b +-~ a. Also, va(b) <~ qa(b) ~< r/a < 2 p~ - 1 ~< 2 p~-I.
To prove the uniqueness of b (under the condition v~(b) < 2 p~ 1 ) we suppose t h a t there is a bl with blobl - a, va(bl) < 2 p ~ - 1 ~< 2 p~-I (for all a ) . T h e n abl -- (2bl + b21)b1 - b1(2b1 + b21) - bla,
i.e. a ~-~ bl. Since b E Ba it is the limit of a sequence of polynomials in a. Hence b ,-~ bl. Therefore +
<
< 2
+ 2
2 o.
By 5.3.3, b - bl. Further, the uniqueness assertion implies t h a t b is i n d e p e n d e n t of the p a r t i c u l a r choice of rla satisfying v a ( a ) < ~a < 2 p" - 1 . Hence, since va(b) ~< rl,, we conclude t h a t va(b) ~< va(a). Finally, the inequalities v,(b) ~< va(a) imply t h a t v a ( b ) - 0 w h e n e v e r v a ( a ) - 0. This m e a n s t h a t when a is t. n i l p o t e n t its q.sq.r.b, is also t. nilpotent. 5 . 3 . 5 . COROLLARY. In a unital p s e u d o - M i c h a e l algebra A (A, {p~}) with u n i t y e, every e l e m e n t el with u a ( e - a l ) < 2 p~ 1, for all a, has a unique square root bl with v~(e - bl) < 2 p~ - 1,bl ~ al; then va(e - bl) <~ u ~ ( e - al).
w3. Square Roots and Quasi-square Roots
237
PROOF. Write al - e -- a. Then, by 5.3.4, a has a q.sq.r.b. with b +-~ a , v ( b ) ~ v(a). Writing bi = a-4-b, by 5.3.2, bi is a square root of al. Also, the uniqueness of bl is an i m m e d i a t e consequence of the uniqueness of b. COROLLARY. In a p-Banach algebra A = (A,[]. ]]) with v - v[i.ii , every element a with v(a) < 2 p - 1 is q. invertible and has a unique q.sq.r, b. with v(b) < 2 p - l , b ~ a, v(b) <~ v(a); 5.3.6.
b is also q. invertible. If a is t. nilpotent so is b. PROOF. Since a p - B a n a c h algebra is a Michael algebra the existence of b and all the properties s t a t e d in the corollary except q. invertibility of a, b are i m m e d i a t e consequences of 5.3.4. The q. invertibility of a or b follows from 3.3.19, since v ( a ) , v ( b ) < 2 P - 1 , < 1. 5.3.7. Remark. An element y of an algebra A such t h a t y" = x (x E A) is called an n th root. Similarly if we write
yon = Y o y o . . . o y(n factors ) and yon = x, then y is called a quasi n t h root or q . n t h root of x. If A has a unity e we have the relation e + y~ = (e + y)'~, so t h a t if y is a q . n t h root of x then e + y is n t h root of e § x. Proposition 5.3.4 can be generalized for q.n th roots as follows: Each element a of a pseudo-Michael algebra A with 2n
1)
va(a) < 2 p" - 1/( n
has a unique q. n th root b with b ~ a, va(b) <~ va(a). In particular every t. nilpotent element a has a unique t. nilpotent q. n th root b. The proof is again by the fixed point t h e o r e m m e t h o d . Here we take r/a < 2 p " - 1 / ( ~ - ~ - 1) and define T by
T x - - nl ( a (observe:
(e§
( ~t
) x 2 "'" ( nn - 1
( ~
)
Y§247
) xn-1 _ xn) .
( n n-
1
)yn-l
+
yn
(y E
A).) 5.3.8.
PROPOSITION.
Let A be a complex or strictly real,
Some Analysis
238
commutative unital, p s e u d o - M i c h a e l - in particular p-BanachAlgebra. For every element b E A with a(b) - {0,1} there is a unique element d E x/A such that u - b + d is idempotent. PROOF. Since, by 7.2.21, A is t. spectrally Gelfand we have
{x(b)'x E/ke}.
{0, 1} -- a ( b ) -
It follows that for every X,x(b) x(b), b 2 - b E ker X. Therefore
0 or 1, so that,
c -- b2 - b E ~ f A - x / ~
x(b 2) -
(see 7.2.12).
Now
a ( 2 b - e ) - 2 a ( b ) - 1 - { - 1 , 1} ~ 0, hence (2b e) -1 exists. It follows that - 4 c ( 2 b - e) -2 e x / ~ and so it is a t. nilpotent element (see 7.4.10). This element has, by 5.3.4 a t. nilpotent q.sq.r, f0 E A. By 7.4.10, f0 E x/~. It follows t h a t if f - e + f0 then -
f2 __ e - 4c(2f - e) -2. Set t
d-
2b - e
2b- e
2
2
f.
Then d-
2b- e ----~(f-
e)-
2b- e ------~-fo E x/rA.
Also
b+d-
2
and a simple computation shows that (b + d) 2 - b + d. Thus u - b+d, with d E x/~, is an idempotent. If v - b+dl(dl ~ x/~) is also an idempotent then u - v E v ~ , so that, by 7.2.12, 7.2.21, a ' ( u - v) - {0}. If follows from ( v i i ) o f 7.2.22, and 7.2.23 t h a t u - v, d - dl, proving the uniqueness of the choice of d E x/~.
t For a motivation of the definition of g see [30, p.48].
w4. Complex Vector-valued Line Integrals
239
5.3.9. COROLLARY. If the algebra A is s.s. then every element b e A, with a(b) - {0, 1}, is an idempotent.
PROOF. Since v / A tent.
~4.
Complex
{0}, d - 0 ,
and b -
b + d is idempo-
Vector-valued Line Integrals Cauchy's Theorems
and
5.4.1. Let X be a complex TLS and F a rectifiable (continuous) path in the plane C, represented by z - z(t) (~ < t < ~; ~, ~ e ~)
Let f " F --~ X be a (vector-valued)function on r. If r - { t o a < tl < t2 < " ' " < t~ --/~} be a partition of [a, ~] we set n
s(~)
- s(~
. z;.) - ~
f(g.)(~j
-
~j_,)- ~ f(g.)A~j,
j=l We where zj - - z(tj),z;, _ z(t~) for some t~. with tj-1 ~< tjt ~ < t j . denote m a x l t j - tj-ll by I~1. If l i m S ( ~ ) , as [~[ ~ 0, exists we J
say
that the line integral;
f fdz Jr
exists and write
fr f dz - ~r f (z)dz It is clear that if f r f d z ,
flg)dz (a, fl e C) and we have
lim S ( r ) .
I~l -.o
frg
dz exist so does fr(c~f §
fr(
c~f § flg)dz
5.4.2. LEMMA. Let X , Y
f-
f (z) 9F --~ X
be complex TLS's, F c C a path,
a function such that / f dz exists. Let T " Jr
Some A nalysis
240
X -~ Y be a continuous linear transformation.
Then f T f dz
exists and T fr f d Z - f r T / d z . PROOF.
T fr f dz
T lim ~-" IZxl-~o lim IAl-,o
5.4.3.
~-~(T f(z~))Az k - fr Tfdz.
If ~ fdz exists and x* E X*, t then
COROLLARY.
PROOF. T h i s follows from 5.4.2 by t a k i n g Y - X* and T -
X*. 5 . 4 . 4 . COROLLARY. 5.4.2, and x E A then (i)
If X -
A is a TA, F and f as in
X ( f r f dz ) - fr(xf)dz.
(ii) PROOF. These follow from 5.4.2, by t a k i n g Y - A and T -
lx or rx. Let X - (X, I1"11) be a complex Banach space, F a rectifiable path in C, and f " F -~ X a continuous 5 . 4 . 5 . PROPOSITION. Arm
function. Then / f d z Jr
exists and we have
t X* denotes the (continuous) dual of X.
w4. Complex Vector-valued Line Integrals
241
f
(,)
II Jr f dzJJ < MIFI. where M -
sup{llf(A)l I 9A c F} and IF[ denotes the length of
F. PROOF (following [14, p.62]). Let F have parametric representation z - z(t)(a <.t<~ ~). Since f is continuous on F, the function f * ( t ) - f ( z ( t ) ) i s continuous on I - [a,/~]. Since I is compact, f* is uniformly continuous on I. Hence, given e > 0, there is a 6 > 0 such that c [If*(t')- f , (t")[[ < 2-~ if a ~< t ~ <
tu
~< fl,
It ~ - t"[ < ~, where JF[ denotes the length of F. Let 71"1,~ 2 be two partitions of I with [rl],lr21 < ~. Let ~r3 be a common refinement of r l , Ir2. Then it is easy to see that E
E
[[S(Trj)- S(7r3)11 < 2 - ~ " I F ] - ~
(j-
1,2).
Therefore we have [[S(F1)--S(71-2)II <
E
E
][S(~l)-S(~3)ll+[[s(~3)-s(~2)][ < ~ + ~ -
It follows from the completeness of X that fr f d z -
~.
lim S(~r)
I~1--+0
exists. Further, since clearly IIS(~r)[[ ~< MIF[, for each r, the inequality (,) follows. 5.4.6. The general existence result for line integrals proved above (5.4.5) is no longer valid if X is a complex p-Banach space with 0 < p < 1. However, even for such spaces the line integral exists for a special class of functions (see 5.4.9). 5.4.7. DEFINITION. Let X be a complex p-Banach space and P a rectifiable path in C. A function f 9F --~ X is called p-admissible or p-admissible on F if f has a representation co
f(z) -- ~ xjpj(z) j=l
(1)
Some Analysis
242
where x3. E X, ~3. - !p3.(z) are bounded complex functions on r such that the ordinary line integrals fr 993.dz exists and further
Ilxjllll~.ll ~' < ~
(2)
3. where II~jll - II~jllr - sup I~;(~)1, The condition (2) ensures, by the vector analogue of Weierstrass M-test, that the series in (1) converges uniformly on I'. It follows that the function f will be continuous whenever all the g)f are continuous. oo
5.4.8.
LEMMA.
(a).
If f -
oo
)-~xi~i,
g -
j=l
)-~xj~ i are j=l
p-admissible on r so is f + g. o(
(b) If f -
E x 3 . ~ j is p-admissible and r a continuous func3.=1 oo
tion on r
the,,
~~;(~;r
i~ p - a e m i ~ i b l ~ on r
3"=1
PROOF. (a) Since
we have (3O
j--1
OO
OO
Ilxjll II~j + cjllf, ~ ~ II~jll II~o,llf, + ~ Ilxill IIr j--1
j=l
Hence f + g is p-admissible.
(b) II~jr
- sup I~j(~) Cj(~)lf, ~ II~jllf, ll~llf-,,
so that co
j=l
oo
II~jllll~j~llf, ~ IIr
j=l
IIx,.llll~ojllf,)< ~,
< ~.
w 4. Complex Vector-valued Line Integrals
243
which proves (b). 5 . 4 . 9 . THEOREM.([31, p.57]). If f is p-admissible on F then the line integral fr f dz exists and we have GO
j=l
PROOF. The series in (,) converges absolutely since oo
II jll j--1
j
Irl
j GO
-< Irl
II jllll jllf
< oo,
j=l where IFI denotes the length of the curve F. Therefore, this series converges in X (by 3.1.24). Let z - z(t) (a <~ t <~ fl) be the parametric representation of F. Let 7r - {a - to < tl < " " < tn - fl} be a decomposition of [a, fl], I~-I- max Itj - tj_il , and n
S-
S(Tr) - Zf(ztk)(Zk -- Zk_l) k=l
with z~ - z(t~), zk - z(tk) and tk-1 ~ tlk ~ tk. We have" GO
JJs - ~ , ~j fr ~jdzll = j-1
rt
Z
GO
GO
E Xj~gj(Ztk)(Z k -- Zk_ 1) -- E Xj ~ ~jdz
k=l j = l
j=l
k-1 zj)~j
j--1
3"=1
- lIE1 + E211
(1)
Some Analysis
244
where m
oo
xiAi 3"=1
j=m+l
and
)kj -- E
~J (zlk)(zk -- Zk-1) -
(pjdz.
k=l
Since
If~ ~jdzl
(2)
<. I1~;11 Irl,
where we have written II~;ll for II~;llr, we obtain
I~jl ~ II~jll Irl + I1~,11 Irl- 211~jll Irl. It follows t h a t oo
oo
j~jll 9 < ~
j=m+l
j=m+l
II~lll~;I ~ oo
<2"[rl ' ~
[[~jllll~jll ~
j=m+l co
~<21rl ~ ~
j=m+l
li~jllil~;ll ~,
F r o m (3), by using (2) of 5.4.7, we can find, integer N such t h a t for m / > N we have
(3)
for a given e > 0 an
I1~11 < ~.
(4)
N e x t , for any fixed m / > N we can choose a 5 > 0 such t h a t for a d e c o m p o s i t i o n r w i t h Irl < 5 we have n
I~jl~ - [ f r ~ i d z - ~ ~j(z'~)(zk - Zk_l)l p k=l s
~<
m
(j - 1 , . . . , m ) .
(5)
II~lll ~ ~ llxjll I~jl ~ < ~,
(6)
k=l
It follows t h a t m
j=l
w4. Complex Vector-valued Line Integrals
245
so t h a t by the choice of N we get, using (1),(4),(6),
S- ~Xj
~gjdz - - { 1 ~ 1
+ ~2[I ~< ][~111-+-ll~2l[
< E,
j=l
for any S -
S(Tr) with I~l < ~ Therefore oo
/r
lim S - ~ - ~ X J / r ~ J d z f dz - I~l--'o j=l
completing the proof. 5.4.10. COROLLARY. II fP
fdzll <. E I[xjll II~jll~lr[ ~
PROOF. This follows from (.) of 5.4.9, using the inequalities (2) therein. 5 . 4 . 1 1 . DEFINITION. Let X be a complex p - B a n a c h space, G _c C, an open set, and f 9G --+ X a function. The function f is called p-admissible holomorphic on G if f has a representation oo
f - ~
j-1
xi~J
(*)
with xj C X, Wj an ordinary holomorphic function on G, and further for every compact set K C G, we have oo
j=l
where II~jlIK- ~upl~j(~)l. AEK
The condition ( * * ) i m p l i e s t h a t the series
~ x j w i ( A ) con-
J verges absolutely for every A E K. For any A E G, by taking
K - {~) w~ conclude that the ~eries ~ j ~ j ( ~ )
r
~bso-
3" oo
lutely ~nd we h~ve f ( ~ ) -
~;(~).
~ j=l
5.4.12. be
DEFINITION.
A function f
9G ~
X is said to
locally p-admissible holomorphic at A0 E G if there is an
Some Analysis
246
open set Go such that )~0 E Go _C G and flGo ~ X is padmissible holomorphic. If f is locally p-admissible holomorphic at every point A E G we call f locally p-admissible holomorphic on G. Clearly "p-admissible holomorphic on G" ==~ "locally padmissible holomorphic on G " , but not vice-versa (see 6.2.9). Oo
5.4.13. LEMMA (~) If f -
Oo
~xj~j,
g- ~jCj
j=l
~
tocaUy
j=l
p-admissible (respy. p-admissible) holomorphir on G then so is
f+g, oo
(b) If f
-
~j~j
i~ locaUy p-a~mi~ibl~ (,~py. p-
j-1
admissible) holomorphic on G and r a holomorphic function on G then co
j=l
is locally p-admissible (respy. p-admissible) holomorphic on G. PROOF. Similar to that of 5.4.8. 5.4.14. PROPOSITION. A p-admissible holomorphic function f " G ~ X is strongly holomorphic and its strong derivative S t is p-admissible holomorphic. Moreover, we have oo
s'(~) - ~ j=l
xj~.(~)
(,)
and in general, oo
f(-)(~) - ~ ~j-. j (-) (~)
( ~ - 1,2,...)
(**)
j=l
where f(n) is the nth strong derivative of f and ~.n) the nth ordinary derivative of ~91. PROOF. We have, for )~, ~ + # E G,
247
w4. Complex Vector-valued Line Integrals
f(A + #) - f(A)
~~~(~)il - ~.(,X)}ll
3"
# - ~oj(A)[ p.
j
(1)
#
Let D be a closed disc centre A and radius r such that D c G, and write C - O D {# e c l ~ l r}. Using the classical Cauchy integral representation theorem we have
- ~(~)
# = 2ri
[1{1 ~j(z)
;
z-A-#
1} z-A
, ] - ( z - A ) 2 dz.
r Now choose # such that I#l < ~, so that for z E C ]z-A-#l) Iz-A I- I#l-r-I#[ > 2" Then
.•!
1 1 --II~jllc'~'~'2~r 2
t
we have
211~illc [~1 -
r--------~
From (1),(2)we get
9
(2)
co
II f(~ + ~) - f(~) - ~ ~j~(~)ll #
~ j
j=l
2 2 oo Jlxjll(~)~ll~jll~l~l ~ -- (~)~l~l ~ ~ Ilxjllll~jll~.
(3)
j=l
Since f is p-admissible the last sum ~ in ( 3 ) i s finite. By making # - ~ 0 in ( 3 ) t h e R . H . S - - ~ 0 and we get (,). It remains to prove that f~ is also p-admissible. Let K _c G be a compact set. Since G is Hausdorff locally compact we can find an open set H with K _ H _C K 1 - H _C G and K1 c o m p a c t . Choose an open covering {D~} of K by open discs D~ _C H. Let 5 be the Lebegue number of this covering. Then for any A c K,
248
Some Analysis
we have (the disc) D D(,k, ~)C_ some Da C_ H C_ K1. By Cauchy's estimates we have"
IG'(~)I--<
II~jlID
-<
~/3
311~jlIK~
so t h a t I~;.lIK-< 311~jlIKx ~ . It follows t h a t 3 j--1
cr j-1
whence f~ is p-admissible. Finally, the representation obtained by iteration (using (.)).
(**) is
5 . 4 . 1 5 . We proceed to obtain a version of the Cauchy integral formula for vector-valued functions. First we recall some classical concepts. We call a closed rectifiable path in the plane C a contour. The index of a point A E C \ F with respect to a contour F is the integer I given by the integral
I - I(A, r) -
1 f
az
2 r i Jr z -
A
If F is contained in an open set G _ C, we call F homologous to zero (in G ) , in symbols, F ~ 0, if I()i, F) - 0 for all A 6 C \ G . Again, we call F homotopic to 0 (in G), in symbols, F ~ 0, if F is homotopic to a constant curve (i.e. a point) in G in the usual topological sense. It is known t that" F ~ 0 :~ F,~, O. Let G __ C be an open set and S _ G a s u b s e t . Following [24, p.241] we say t h a t a contour F C_ G surrounds S in G if the following conditions are satisfied: S ~ F - 0,
t See, for example [8, p.93, 6.10].
w4. Complex Vector-valued Line Integrals
1 0
I(I, F)-
249
if A E S if ~ E C\G.
5.4.16. THEOREM (Cauchy integral theorems). Let X be a compl~ p-Ba~ach ~p~c~ (0 < p < 1) a~d f - f(A) a X - v ~ l ~ d (complex) strongly differentiable function on an open set G C C_ C. If 0 < p < 1 we also assume that f is locally p-admissible holomorphic on G. Let F be contour in G with P ... O. Then we have: (a) Integral theorem" fr f ( z ) d z - O. (b) Integral formulae" For every A e G\F with I ( A , F ) - 1,
1 f(A)-
27ri fr
dz
(,)
and more generally,
n! ~r ( z - f(z) d~ A) "+1
f ( ~ ) ( A ) - 2~ri
( ~ - 1,2,...)
(**)
where f('~) denotes the nth strong derivative of f. PROOF. (a)First assume that X is a Banach space ( p - 1). Then by 5.1.2, 5.4.5 fr f ( z ) d z exists. If x* E X then by 5.4.3
x.(/:
/(~)- ~ xj:j(~)(~ e a) Y when ~j are holomorphic. By 5.4.9, fr f (z)dz - ~ xj f r ~pj(z)dz - O, J
Some Analysis
250
since each fr pjdz - 0, by the classical Cauchy theorem. Next consider the case where f is only locally p-admissible holomorphic on G. Since F is compact we find open sets
aj(j-
1,..., n) c__G
such that fj - fIGi ~ X is p-admissible holomorphic on Gj. It is not h a r d t to see that we can find contours F j such that Fj c Gj and F ~ FI+.--+F~. It follows that n
j--1
J
(b) In the case X is a Banach space the integral formula (,) is obtained by applying x* E X*, exactly as in the above proof of (a). Thus
1 /r fz(Z~d z ) - ~1 frX*f(Z)dz-x*f(z ) z- A
*(-f~ri
for every x*, whence (,) follows. The proof of (**) (for this case) is similar. Next consider the case where X is a p-Banach space and f p-admissible holomorphic. Write (3O
f ( z ) - ~ xjpj(z) (~j holomorphic )
(1)
j=l
f(z) ~j(z) g(z)- (z-)~)n+l' Cj(z)- (z-- ,~)n+l" Then oo
g(z) - ~ ~jcj(~). j=l
See [31, pp.62-63 (diagrams)].
(2)
w4. Complex Vector-valued Line Integrals
251
First assume that f is p-admissible on G. Then we see that each Cy is holomorphic on Go - G\{A}. Let K C_ Go, be compact. By compactness of K there is an r > 0 such that Iz - A
>rforallzEK.
Therefore
IlCj
I~j(z)l
IK - zEK sup ] z - ,~In+l ~
II~jll~ r n+l
so that oo
K
IlxjllllCjll~
)-~ IlxJll r(,~+i)p
j=l
J
1
<
oo
r(n+l)p E .i=1 (20.
Ilxjllll~jll~
It follows that g(z) is p-admissible holomorphic on Gj, so that by (,) of 5.4.9 we obtain from (2)
27r~
g(z)dz
=
E xj~ j--1
E J
(z -- )t) n+l dz
~(~)
x y ~ n!
1
n! f('~)(A) (by (**) of 5.4.14).
(3)
Again from (1) we get
1 fr ( z - f(z) dz. g(z)dz - 2~ri ~)n+l
2~i
From ( 3 ) , ( 4 ) w e conclude that
n! /r
2~i
f(z)
dz-
( z - ~)~+1
fr
(4)
252
Some Analysis
The extension of the proof to the case where f is locally pholomorphic on G is carried out as in the proof of (a). 5.4.17. COROLLARY. I f f ( A ) -
EXj~j(A)
then
J ~j
J PROOF. We have
~~ I(")(~)
=
2~;
/(z) (z_a).+i ~z- ~~j~.
(z _ ~).+1 dz
J
J (using the classical Cauchy representation theorem for pj). 5.4.18. COROLLARY(Cauchy's estimates). Suppose that A E G c_ C and F0 a circle centre A, radius r, such that F0 C G. Then: (i) If X is a complex Banach space and f " G ~ X strongly differentiable (strongly holomorphie) then
IIf(~)(~)ll <
Mn! rn
sup l/(z)l. Iz-,Xl--~ (ii) If X is a complex p-Banach space and f " G ~ X missible p-holomorphic, then where M -
n!
oo
IIf(")(~)ll < (~)~ ~ II~Jllll~Jll~o, j=l
PROOF. (i) We have from the integral formula
IIf(")(~)ll <~
n~ f~ (z-~)-+l f (z) I1~. n!
M
dz[i
2r "r '~+1" 2rr( using ( , ) o f 5.4.5) Mn! rn
ad-
(*)
w5. Power Series Operating in TA's
253
(ii) Here we have
n!)o j
.7"=1
using the classical Cauchy estimates. Thus we get (.). 5 . 4 . 1 9 . COROLLARY. A (strongly) entire (respy. p-admissible
entire) function on a complex, Banach space (respy. p-Banach space) is a constant. PROOF. This follows, as in the classical case, from the Cauchy e s t i m a t e for n - 1, by making r ~ oc.
w 5.
Power
Series
Operating
in TA's
co
5.5.1.
Let f(A) -
~ T n A n ('In C K) be a power series. Let n-=0
A be a unital TA (with unity e) and x E A. We say t h a t
f
oo
operates on x if the series ~ ' l n x n (recall x ~ - e) converges in rL:0
A. Even when A has no unity it is meaningful to consider the operation of a power series f with f(0) = "~0 = 0 on an element o@
x" ~--~3'~x". (A power series f with f ( 0 ) i s called a power series n-=l
vanishing at 0.) Let now A = (A, {pa}) be a locally pseudo-convex algebra. T h e n we can speak of f - ~--~Tnx '~ operating absolutely on x n
if ~ p a ( x '~) converges for each pa. If A is complete (or even n
sequentially complete) and f operates absolutely on x then f also operates on x (because of 3.1.24). An entire t function ]" with f(0) - 0 is said to operate on t entire in the rea.1case means real analytic everywhere, i.e. is represented by a power series which converges everywhere in ~ .
Some Analysis
254
an element x of a TA A if its power series expansion ~ / , ) ~ n n
operates on x; if A is unital we can consider the operation of any entire function on x. If a power series f operates on every x E A we say t h a t f operates on A. 5.5.2. Remark. Every entire function f with f ( 0 ) 0 (respy. every entire function f ) clearly operates on any nilpotent element a of a TA A (respy. unital TA A ) . Every such f operates also on an idempotent element u "/nun--~/0e+
~/n
U .
5 . 5 . 3 . PROPOSITION. Let A - ( A , { p a } ) be a complete (or even sequentially complete) locally pseudo-convex TA. Then all entire functions vanishing at 0 operate on an element x iff
u~(x) - limpa(x n) !n
<00~
n
or equivalently ,
1
ua(x ) -- suppa(xn)-~ < oo, n
for every Pa. In particular, entire functions vanishing at 0 operate on any t. nilpotent element.
C-
PROOF. First suppose t h a t ua(x ) < c~ for all a. Choose a Ca > 0 such t h a t u~ ~< C. Then p~(x")<. C n ( n - 1, 2 , . . . ) oo
Let f ( ) ~ ) - ~ T n ) ~ n be an entire function (vanishing at 0). T h e n n-1 1
lim 12~1~ - O. It follows that, given an e with 0 < e < 1, there is n--, oo an integer N Therefore
N~ > 0 such t h a t for n/> N, 17nl !. < (ec_l)o~.x
oo
E n--N
Pa(~'nzn)
--
E n oo
n=N
]"/nlP"Pa (an) ~ E ( E C - 1 ) nCn n
w5. Power Series Operating in TA's
255
T h u s ~-~7~x n converges absolutely and so also in A. T h i s m e a n s n
that
f o p e r a t e s on x, as required . N e x t s u p p o s e t h a t va(x) - cc for some a. Let p - pa be the h o m o g e n i t y index of pa. Since va(x) - co, there is a sequence 0 < n l < n2 < ' " of integers such t h a t 1
pa(x nk)"---k > k (k - 1, 2 , . . . ) . B u t t h e n the entire function oo
~nk
k-1
which vanishes at 0, does not o p e r a t e on x, since pa(x nk)/k nk > 1 xnk (so t h a t ) ~ 74 0 and the series for f ( x ) does not converge (by k~ 2.1.32). For the p a r t i c u l a r case s t a t e m e n t in the p r o p o s i t i o n it is e n o u g h to observe t h a t if x is t. n i l p o t e n t then, by definition, v~(x) = 0 for all a. 5 . 5 . 4 . COROLLARY. All entire functions vanishing at 0 oper-
ate on A iff v~*(x) < c~ for all x and all a. 5 . 5 . 5 . COROLLARY. All entire functions vanishing at 0 operate on any complete locally sm. pseudo-convex algebra A. PROOF.
If A -
(A,{pa})
t h e n since pa
is sm., by 3.3.6,
v~(x)(<~ pa(x)) < co, and c o n s e q u e n t l y v~(x) < co. T h e corollary now follows f r o m 5.5.4. 5.5.6.
PROPOSITION.
algebra with Pl -< P2 -< " " . 1 , 2 , . . . ) such that (i) p j ( x l x 2
""Xn)
< Cj,nPj+l(Xl)"'P.i+l(Xn)
A (ii) sup ~n c . n
Let A ( A , { p j } ) be a p s e u d o - ~ If there are constants Cj,n ( j , n -
-- c i < cc
for X l , ' ' ' , X n
e
256
Some Analysis
then there exists a family {qj " j >1 2} of sin. pj-seminorms with {qj " j >>2} ,-- {pj " j >1 1}, so that A is a locally sm. pseudo-~algebra.
PROOF. Write B j ( r ) (i),(ii) we have
{x E A ' p j ( x )
< r}. By conditions
pj(XlX2"''Xn) <~c~pj(Xl)'''pj(Xn).
(1)
It follows that the Cartesian n th power B~+l(C~ 1) - - ( B j + l ( c ~ l ) ) n C_ Bj(1).
(2)
Set oo
UJ+1 -- Cpj+I ( U B~+l(C21)) (J - 1,2,...)
(3)
n=l
where Cpj+l denotes the p/+l-convex hull. Since pj+l ~ Pj, Bj(1) - which is absolutely p j - c o n v e x - is also, by 4.1.7, absolutely pj+i-convex, so that (2) implies that Uj+I _c Bj(1). Also, from the definition of Uj+I we have Bj+l(cji ) C Yj+ 1. Thus
Bj+I(C; 1) C_ Uj+I C_ Bj+I(1). By 4.1.10, (since Uj+I pj+i-gauges of 4.1.8 and
(4)
Uj+I determines a p/+l-gauge qj+l which is sm. is a subsemigroup as can be easily seen). Taking the of the sets in (4) and using the relations (,), (, 9 ,) Remark 4.1.9 we get
t,j+~ Pj
Pj
~ qj+l ~ Cj-1 Pj+I-
(5)
It follows from (5) that { q n ' n >1 2} ~ { p n ' n >1 1}, completing the proof. 5.5.7. LEMMA. 9 " , x n C A set Xl,
W(,•) k ( xl~
Let A
9,
be a commutative algebra.
x,) -
(x,1 + . . . + x,k)" n
For
257
w5. Power Series Operating in TA's
where the s u m m a t i o n is over all i l , . . . , i k n. Then
with 1 <<.il < i 2 . . . i k
n
X l X 2 . . . X n -- ( - 1n!) '~ ~ ( _ l ) k W ("'k n)
k=l
(Xl'''''Xn)"
(, )
PROOF. Using the multinomial theorem the coefficient of "~. ..xi~~ (1 ~< r ~< k) in th e development the typical term xi~ n, (at!) ( ~ - r )r of W k(n) is (/21!)--.
'
since ( ~ - r )r
of the sub-
sets of { 1 , - - . , n } which have k elements contain i l , ' " , i r and each of these subsets yield the typical term with the coeffin! cient ( n l ! ) - ' . (n~!)" Therefore the coefficient of xi,r t l . . . x ~ f in n
~-~(-1) ktcT(n) "'k , is equal to
k=l n!
k ~r
(n 1!)... (rtr!) _ (--1) k (~
- r _ n! )n-r r ) (nl!)''" (nr!)(1 - 1 -- 0
when r -r n, and is equal to n!(-1) n when r - n This completes the proof. 5.5.8. THEOREM. Let A - (A,{pj}) be a commutative ~ algebra, where we may assume that {pj} satisfy the condition Pl "< P2 4< " ' ' ; pj(xy) ~ Pj+l(X)pj+l(y)
(*) (**)
(see 4.6.1). If there exist constants c~,n such that (i) p j ( x n) <~ c;,, pj+i(x) n ( n , j - 1 , 2 . . . )
(ii) sup, ~ , ~
- cj* < cr
(j-
1, 2, ...)
then A is a locally sin. ~-algebra.
PROOF. Suppose that X l , X 2 , . . . ,x n E A. Assume first that pj+l(Xk) ~ 0 ( k 1 , . . . , n ) . Write yk - xk/pj+l(Xk); then P j + I ( Y k ) - 1 ( k - 1 , . . - , n ) . It follows that
Some A nalysis
258
p j ( X l X 2 " ' ' X n ) -P j + l ( X l ) "" "Pj+I(Xn)pj(YlY2 "'"
Yn)
pj+l(Xl) " ""pj+l(Xn)pj( (-1)n W~ n) n! E (Yl,"',Yn)) k <~
1 -~..Pj+l(Xl) "" "Pj+l(Xn) E P j
(W~n)
(YI,""" ,Yn))
(1)
k where we have used indentity ( , ) of 5.5.7 and the subadditvity of pj 9 Using the definition of W k(n) we obtain the inequality"
w(,~) (y~,--.,y.)) pj(,,~
~
<~
pJ((y,~+... + y,~)")
l ~i l <~i2""~ik
; E c;,.k" ~ E c;.n" (2) From ( 1 ) , ( 2 ) w e get pj(XlX2 "''Xn)
,
<~
) nn)pJ+l(xl) "''pj+l(Xn)
k <
(3)
Cj,nPj+l(Xl)'''p.i+l(Xn)
where _
1 ,
cjo-,cjo(E( k
If for some k , p j ( x k ) - O, then by condition pj(XlX2"''Xn)
--
2nn n ,
n,
(4)
(**) above we have
p j ( X l X 2 " " " Xk-1 Xk+l " " " XnXk) p j + I ( X l X 2 " ' ' x k - 1 Xk+ l ' ' ' x n ) p j ( x k )
-- 0
so that (3) is satisfied trivially. Thus (3) holds w i t h o u t any restriction on xk. This means that condition (i) of 5.5.6 holds. We
w5. Power Series Operating in TA's
259
shall next show condition (ii) of 5.5.6 also holds. Now 2nn
n
2n
~
( n! )~--ff~. so t h a t lim
2n
n
= 2 lim
= 2e
(5)
where we have used for the last equality the result (1) in the proof of 4.8.5. It follows from (4),(5) t h a t lim ( cj,n )~X - 2 e
, ) n~ - ~ - 2 e c j ., lim (ci,
n----~ O0
n---~ O0
The t h e o r e m now follows from 5.5.6 5.5.9. R e m a r k . One does not know whether the result in 5.5.8 is valid for p - ~ - a l g e b r a s (0 < p < 1). The above m e t h o d of proof, however, breaks down in the p- ~ case, since corresponding to the limit in (4) we now have l i m 2 n / ( n ! ) ~ which turns out to be infinite (lim
n
(~!)o
_
__
lim
n
.~oo (,!)
.
~r~ 1 -
p __+ e p . O 0
--
00 ) .
5 . 5 . 1 0 . THEOREM (Zelazko [31, p.140]). Let A (A, {pa}) be a commutative ~-algebra, where we assume that the sequence {p~} ~ati~fy th, c o , d i t i o ~ (,),(**) i~ 5.5.s. If for , v , , y ~ e A and every j we have
~j (~) *
suppj(~")-'
--
n
< 0 0
n
then A is a locally sm. ~ algebra. PROOF. Observe first t h a t v ] ( x ) -
fn(2)
-
l i m n f ~ ( x ) , where
pj(x k) l<<.k<<.n m a x
Since the pj are continuous so are f,~. Hence v ; ( x ) is the pointwise limit of continuous functions of x on a complete metric
Some Analysis
260
space. Therefore u] belongs to the first Baire class of functions and consequently u~ has at least one point of continuity x0 in A. This means that there are constants C, 5 > 0 and an integer k ~ such that
p~,(~- ~o) <~ ~ ~ ~;(x) <~ c. If k = m a x ( j , k I) then we have
; ~ ( ~ - ~o) ~< ~ ~ ~;(~)<- c, since by hypothesis pj <~ Pj+a for every j. So we get from the definition of uj t h a t
pk(x - xo) <~ 6 ==>pi(x n) ~ C n (n = 1 , 2 , . - . ) .
(1)
In particular, we have pj(xr~) ~ C n. Writing y = x - x 0 , we have for any x satisfying the condition in (1),
_ilx_xo,nl-pj_i(
Pj-I(Y n)
k=O
.< 2 - c ~ =
k=O
(2c) ~.
(2)
Let now y be an element of A with Pk(Y) :/: O. Writing yl = 5y/pk(y) we have p k ( y i ) = 5, so that by (2) we obtain
(2C)'~,
Pj-1 (yr~)
~
Pj-l(y n)
<~ (2-~~)npk(y)n.
which gives
(3)
If Pk(Y) = 0 then since k ) j we have
Pj_l(yn) ~ pj(y)pj(yn-1) ~ pk(y)pk(yn-1) _ O. This means t h a t (3) holds in this case as well. The integer k figuring above depends on j, so we shall write
k = k(j). Set n 1 -- 1, rt 2 -- k ( 2 ) , ' - ' ,
rtj-
]r
1 + 1).
w5. Power Series Operating in TA's
261
If we set qj - {Pnj } then {qj} ~ {pj} and by virtue of inequality (3), the conditions (i),(ii) of 5.5.8 are satisfied and the theorem follows from 5.5.8. 5.5.11. COROLLARY (Mitagin-Rolewicz-Zelazko [10' p.295]). A commutative ~-algebra on which all entire functions vanishing at 0 operate is a locally sm. ~-algebra.
PROOF. This follows from 5.5.4, 5.5.10.
C H A P T E R VI SPECTRAL
w 1.
ANALYSIS
Spectral
I N TA s
Properties
6.1.1. PROPOSITION. Let A be a Q algebra (in particular a p-Banach algebra) and x E A. Then the quasi-resolventt set
q a i- p ct, mt
compact
subset of K. PROOF. If A0 E p ' ( x ) t h e n A0 ~ 0 (by 1.7.6)and --~olx is q. invertible. Since A is a Q algebra there is an open neighbourhood U of - A o l x , comprising q. invertible elements. Since the map A ~ - A - i x is continuous, there is an open neighbourhood N of A0 such that for A c N, - A - i x E U, so that - A - i x is q. invertible. Thus N C_ pt(x)and pt(x)is open, its complement at(x) is closed. Next let U(0) be an open nucleus comprising q. invertible elements. Since - A - i x -~ 0 as IAI-~ oo and U(0) is open there is a constant C such that - A - i x E Y(0) for I)~l > c . Hence, for such A, - A - i x is q. invertible and A E p~(x). This implies that if A E a~(x) then IAI ~< C, whence a~(x) is bounded. Being both bounded and closed a t(x) is compact, as required. 6.1.2. C o r o l l a r y . In an I algebra (in particular a unital pBanach algebra) A, p(x) is open, a(x) is compact, and a(x) # K. PROOF. By 3.6.13, A is a Q algebra and so by 6.1.1, a ( x ) U { 0 } = a'(x) is compact. If 0 r a(x) then x is invertible. Since A is an I algebra there is an open neighbourhood U of x, comprising invertible elements. Since x - Ae ~ x as IAI--.0, there is an e > 0 such that for IAI < e , x - ~ e E U and hence invertible, so that A e p(x). It follows that 0 ~ a(x) (the closure of a(x)). On the other hand, since a(x) c a'(x) and
t For definition see 1.7.5.
w 1. Spectral Properties
263
at(x) is closed we have a(x) c_ a'(x) - a(x) [,J{O}. Hence a(x) a(x),a(x) is compact and p ( x ) i s open. Finally, since a ( x ) i s b o u n d e d , a(x) :/: K. If A is a real Q algebra and x E A then the extended quasi-spectrum St(x) is compact, in particular 6.1.3.
PROPOSITION.
PROOF. Let A - a § ifl ~ 0, be a complex number. T h e n x 2 - 2ax
x2 - 2ax
(note lal//IAI 2 ~< & I~l ~ 0) It follows t h a t if U is a nucleus of A, comprising q. invertible elements then there is a C > 0 such t h a t x2 - 2ax
E U,
and hence y q. invertible, if IAI > C. This implies, by 1.8.5, t h a t for IA] > C, A r 5'(x). This means t h a t 5'(x) is bounded. To complete the proof of its compactness it remains to show t h a t 5'(x) is closed, or equivalently, ~'(x) is open. Using 1.8.5 and the fact t h a t x 2 - 2ax x 2 - 2(Re A)x
is a continuous function of A (for A ~= 0), it can be shown, exactly as in the proof in 6.1.1 for p'(x) being open, t h a t ~'(x) is open, completing the proof of the proposition. 6.1.4.
COROLLARY. If A is a u nital Q algebra then 5(x)
is compact. PROOF. It is clearly sufficient to prove t h a t 5(x) is closed in 5'(x) - 5(x)I.J{0} and we carry out the proof as in 6.1.2. We can assume t h a t 0 ~ 5(x), so t h a t 0 E ~(x). Then x, and hence x 2, is invertible. Therefore, A being an I algebra we can choose an open n e i g h b o u r h o o d U of x 2, comprising invertible elements. Since _
_
+
0
264
Spectral Analysis in TA's
we can find an e > 0
such t h a t for ]a),ifl[ < e ,
z~,z -
xa,/~EU. If
9 - (~ + i/~)~
then z~,~,~
- x~,~ e U for [a[, I/~[ < e.
From the choice of U, x~,/~ and hence z~,~, is invertible, whence A - cz + i/~ E ~(x) for tat, I~] < e. This implies t h a t 0 ~ 6(x), whence 6 ( x ) i s desired.
w 2.
The
Resolvent
closed in 6'(x), as
Function
6 . 2 . 1 . DEFINITION. Let A be a unital algebra (over a field F ) , z E A and p(x) the resolvent set of x. We assume t h a t p(x) ~ O. The vector-valued function
R,
~ ~ x~ - x ( A ) -
(~- ~)-1
on p(x) is called the resolvent f u n c t i o n of x; x~ is called a resolvent of x.
6.2.2. PROPOSITION. Let A be a unital algebra and x E A. Then: x~ - x~ - (A - # ) x ~ x t, (A,# E p(x))
(~- ~)-1
_ (~- ~)-1
(Hilbert relation);
_ (~ - ~ ) ( ~ - ~ ) - , ~ ( ~ _
(A - 0 or A-I E p(x), # - 0 or ~ - I E p(x)).
(,)
,~)-1 (**)
PROOF.
(x_~)(x_,~) ~ [(~_~)+(~_~)~] (~_,~)-1_~+(~_~)~. Multiplying both sides of the above equation, on the left, by x~ we get ( x _ ~ e ) - I x~ + (~_ A)x~x~
265
w2. The Resolvent Function
which gives changing signs on both sides we get relation (,). The relation (**) can be obtained by noting that
(~ - ~x)(~ - ~ ) - ~
6.2.3.
-
[(~- ,x)+
(~ - ~)~](~ - , x ) - ~
--
e Jr-(~- ~)x(e-
~x) -1.
COROLLARY. Any two resolvents xa,
xu of x com-
mute" x~ ~-~ xu.
PROOF. Interchanging )~,# in (,) of 6.2.2 we get
,'). Changing the sign in (,') and comparing it with (,) we get
Since we may assume that A ~= # we conclude that xa ~ x~. 6.2.4.
PROPOSITION. Let A be a unital Hausdorff TA and
x c A. Assume that
(i) p(x) is open; (ii)
A ~ xx (A C
p(x))
is continuous.
Then the resolvent function xa is a strongly infinitely differentiable function with dxa = ~ d~
(.)
and in general, d"xa = . ! ~ + 1 d~ ~
(**)
Further, if
(iii) a(x) # 0 and compact and p # ( x ) - (p(x))\{0}) -1 U{0} (p(~)\{o}) -~ - { ~ - ~ - ~
c p(~)\{o}}
266
Spectral Analysis in TA's
then p # (x) is open and on it (e-,,~X) -1 with dn dA n [ ( e - )iX) -1]
i8 ~nfin~tely
differentiable
n ! x n [ ( e - )~X)-I] n ()~ E p # ( X ) ) .
--
* * :4:)
PROOF. If A E p(x) then A + # E p(x) for sufficiently small # since p(x) is open. Using the Hilbert relation we get XA+ # -- X A
xA+#X A .
Making # --~ O, and using condition (iN) above we get (,). The formulae (**) is obtained by induction. Assume thus d n - i xA
dan-1 - - ( n -
Then d
dnx~ dAn
= (n-
1)!x~.
1)! d
~-~(x~). Now
1
dA (x'~)=L,~o-~(x'~+~
-
x~)
-
L.-,o x ~ + g - x ~ ~ #
dx~ n-1 dA 9rLxA
-
-
x~+gx~
O<j+k=n- 1
n x ~ + l ( using (,))
where we have written L for lim. Therefore dd~,~- (n!)x~ +1. (The factorization of x~+~ - x~ used in the above calculation is based on the property x~+u ~-~ xA which is assured by 6.2.3.) It remains to prove the assertions on p#(x). Since p(x) is open, (p(x)/{O}) -1 is also open. To prove that p#(x) is open it is enough to show that 0 is an interior point of p# (x). Since a(x) is compact we have 0 ~ r(x) < co. If r ( x ) - O, then a(x) - {0} and so p # ( x ) - ~ is open. Next assume that 0 < r(x)< co. If 0 < [AI < - ~ then I)~-11 > r(x), so that )~-1 E fl(X),)t E p # ( x ) . Therefore 0 is an interior point of required.
p#(x) and p#(x) is open as
Finally, the relation ( , , , ) i s established by using ( * * ) o f 6.2.2 and induction in exactly the same way as for the proof of
267
w2. The Resolvent Function
(**) above. 6.2.5. COROLLARY. Let A* be the continuous dual of A and x* E A*. Then F~,(A)-x*(x~) is a ~<-valued infinitely differentiable function on p(x) with d~F~,(A) dnx~ dA n =X*( dA n )
(n-
1,2...).
When ~: - C, Fz. is a holomorphic function and xa a weakly holomorphic function on p(x).
PROOF. This follows form 5.1.2. 6.2.6. COROLLARY. The conclusions and formulae ( , ) , ( * * ) , ( , , ,) of 6.2.4 hold in any Hausdorff CI algebra (in particular, a unital p-Banach algebra or more generally a unital sm. (F) algebra). PROOF. It is enough to prove that the hypotheses (i),(ii) of 6.2.4 are satisfied. By 3.6.22, 3.6.23 a unital (F) algebra A is a CI algebra and so, by 6.1.2, hypothesis (i) of 6.2.4 is satisfied. Again the continuity of the maps A ~ x - A e , y~-+ y-1 ( A b e i n g a C algebra) implies that their composite map A ~ x~ is continuous (which is hypotheses (ii)of 6.2.4). 6.2.7. LEMMA. In a C I - in particular a p-Banach - algebra A, x~ --~ 0 as (A PROOF. As IAI-+ c~, II-11 --, 0, and A being a CI algebra we have X,k - -
--)~-l(e
--
A - l x ) -1 --+
6.2.8. PROPOSITION. Let A = (A, algebra and x E A. Then we have
O.
I1"11)
e --
O.
a unital p-Banach
(i) If [AlP > u(x) - limn IIx"[] 88 then A e p(x) and the resolvent x~ is given by oo XA - - ( X -
xn
,'~C)- 1 - - -- E ~ n + l ' n--0
with the series converging absolutely.
(*)
268
Spectral Analysis in TA's
(ii) If A c p(x) and ] A - #1 <
IIx~ll-~
the~ ~ c p(x) a~d
oo
x.-
~(,-
a)"x~§ 1,
(**)
n--0
with the series converging absolutely. PROOF. Write A have, by 3.3.20 (i), XA - - ( X - ) ~ e )
A-1 9 Since v ( A x ) -
-1 -- -A(e-
]A]Pv(x)< 1 we
oo
oo
Xn
--
_
A ~-~1
Ax) -1
which is (,). To prove (**), we first note that we can write - , ~ - (~ - ~ ) k
+ (a - , ) ~ ] .
(1)
Since
[Ix~ll
9 II*~ll-
1,
by 3.3.20, e + (A - #)xa is invertible and so by (1) X#
--
[e -~- ()i -- ~ ) x , ~ ] - l x , ~ oo ( # -- ) ~ ) n x ~ n--O
- - [e -- ( # -- ) i ) x A ] - l x A
oo "X A -- ~(#
-- ) ~ ) n x ~ + l
'
n--0
proving (**). 6.2.9. THEOREM. Let A be a complex unital p-Banach algebra and x E A. Then the resolvent .function x,~ is locally padmissible holomorphic on p(x) U{c~}. PROOF. Let A -
(A, [l" II) where we may assume that []-I1 is
sm.. By 6.2.8(ii), we have for A0 e p(x) and ]A-Aol < IIX~ol]-~, oo
x~ - ~ ( ~ n--O
n
~o/~o
n+l
269
w 2. The Resolvent Function
Write
g~n(A)
-
-
(A-
A0) n , xn
--
and
~o
X n+l
Do-
{A E C
9
1
[ A - Aol < []X~oll-~}. Clearly ~p~ is holomorphic on Do. If K C_ Do and K is compact it is clear t h a t we can encloset K in a 1
closed disc D(,~o, ro)with r0 < tlX~oll- ~ . So
ill-IlK <~ s u p ( [ ~ - ~ol", ~ E Do) ~< r~. It follows t h a t oo
~o Ilronp ~<~llx~ol
IIx, llll~,ll~ ~ ~ l l n--O
xn+l
rg
ro
In + l np
lq,
~ o(3
-- IIx~oll
IIx~oroll" < oo ( since [Ix~oroll < 1)
n--O
proving t h a t x~ is locally p-admissible at Po. Write Gz - {A E 1
c
l~l > ~,(x)~}. By 6.2.8 (i), we have oo X n _ 1
x~ - ( ~ -
~1-~ = - ~
~---~,
(,1
n--1
1
the series on the right converging absolutely for IAI > v(x)~. Writing x,~ - x ~-1, pn(A) - - 1 / A '~, we get for xa the representation x ~ -- E
xn ~n .
rt
Each ~ , is clearly holomorphic on G z. Any compact set in G z can be enclosed in an annulus K-
{A C K ' r l
<~ IAI ~< r2}
1
where v(x)~ < rl < r2. Now we have for A E K, 1" If C - sup{IA-Aol" A E K } , then by compactness of K there is a ,~1 C K with C - I , ~ l - A o I < IIx~0It-~. We can choose for the radius of any ro will C < r o < [[x~01I-~.
Spectral Analysis in TA's
270
1
1
I~.(~) ~< r-~' so t h a t Ll~lIg ~ ~ It follows t h a t oo
oo
EIlIXn-IlIII~gnlIPK <~ Ilxn-lllrl p -- E tlxn-lll < CX), n=
n=l
r~
where for the last inequality we have used the absolute convergence property of the series in (,). This proves the p-admissible holomorphy of x~ on Gx. By interpreting Gz as an open neighb o u r h o o d of c~ we see t h a t what we have just proved a m o u n t s to x~ being locally p-admissible holomorphic at c~. This completes the proof of the theorem. 6 . 2 . 1 0 . PROPOSITION. Let A be a complex unital p - B a n a c h algebra and x c A. Let F be a contour in C surrounding a(x) U{0} (in C). Then:
]r
Amx~dA - - 2 f i x m (m - O, 1 , 2 , . . - ;x ~ - e).
(,)
1
In particular, if r > v(x)~ we have
~
c~ i~ th~ ~i~d~ I~1 = r (~ e C)
/ c AmX~dA - - 2 r i x m.
(**)
r
PROOF. have
Since F
N~(z)
= 0, r
~r A m x ~ d A - -
c p(z)
~oo x" f r n=O
and so by 5.4.9, we
A'~ dA )~n+l
(1) "
We can choose r sufficiently large t h a t Cr C p(x) and Cr ~ F in p(x). Then we have
2ri
A.+ 1 dA - 2~i
r
An+ 1 dA -
01
(2)
w2. The Resolvent Function
271
by the classical results. The formulae (.), (**) now ready follow from (1), (2). 6.2.11. THEOREM (Beurling-Gelfand spectral radius formula). In a complex Banach algebra A we have for any x E A,
r(x)-
u(x)-
If the norm I1" II
1
lim ]]x"}}~.
hav
(*)
also
(**)
r(x) - v(x) <~ Ilxtl.
PROOF. Our proof makes use of the formula (,) of 6.2.10 and is essentially on the lines in the exposition in [24, p.236]. We assume (as we may) that A is unital. By 4.8.11, r(x) ~< v(x) (since here p = 1). So to prove (,) it is enough to show that v(x)<~ r(x). If r > r(x), then by 6.2.10 (**), we have
_xm_
1 / c Amx~dA" 2~ri
(1)
Since x~ is a continuous function of A and C~ is compact we have
M(r)-
sup(llx~]]" IAI - r )
< cr
(2)
using (,) of 5.4.5 we obtain from (1),(2)
1 rmM(r) " 2rr - r m+lM(r). Ilxm]l <~ 2---~ Therefore 1
1
I]xml]-~ <~ r(rM(r))-~ whence
. ( x ) .< r It follows that v(x) <. r(x), completing the proof. 6.2.12.
COROLLARY.
If A is a real Banach algebra then
272
Spectral Analysis in TA's
~(x) -- u ( x ) , where ~(x) is the extended spectral radius. In particular, if Z is strictly real then r ( x ) - u(x). N
PROOF. Apply 6.2.11 to the complexification A. 6.2.13. R e m a r k . We shall obtain later (see 7.4.6) extensions of the above results for p-Banach algebras. 6.2.14. PROPOSITION. Let A - (A, II" II), with a unital p-Banach algebra and x E A. Then:
I1" II
sm., be
(i) a(x) is an upper semi-continuous function of x, i.e., given an open set G C_C_K with a(x) C_ G, there is a ~ > 0 such that a(x + y)C_ G for every y c A with Ilyll < ~. (ii) For ~ c p(x) if d(1) denotes the distance of ~ from a(x) then IIx~ll ~> l/d()~)P; whence I I ~ l l - ~ ~r as d ( ~ ) ~ O. PROOF. By 6.2.6, x~ is a continuous function of )~; by 6.2.7, xa ~ 0 as I)~l ~ c~. It follows that there are numbers C l , r > 0 such that Ilxall < c1 for all )~ with 1)~1 > r, Write D r - {A e K " I)~l 4 r}. Then g - ( K \ G ) N D ~ is compact, so that there is a C2 > 0 such that Ilxal[ < C2 for ~ E K. It follows that if A E K \ G then Ilx~ll < c max{C1,C2}. If y in A with IlY]I < (~ - - C - 1 and )~ E K \ G then
is invertible since )~ ~ p(x) and
II~yll ~< IIx~llllull
<
CC-1-- 1 (
see
3.3.20).
This means that )~ r a(x + y), whence a(x + y) c_ G, proving (i). If A C p(x) and # E a(x) then by 6.2.8 (ii)we have I A - # ] > 1
IIx:~[[-~, so that
II~ll ~ 1/1 ,x -~l p, IIx~ll ~
lld(~) p
proving (ii). 6.2.15. COROLLARY. continuous at x -- O.
PROOF. Take G -
r(x) -+ 0 as x ~ O. Thus r(x) is
{A E N ' [ A I < e}. Then G ___ a ( O ) - O ,
w2. The Resolvent Function
273
whence by u p p e r semicontinuity at 0 we have a(x) c_ G, r(x) ~< e for IIx]] < 5. This shows t h a t r(x) ~ 0 as x -~ O. 6 . 2 . 1 6 . COROLLARY. If A is a p - B a n a c h algebra and x c A then al(x) is upper semi-continuous. PROOF. It suffices to observe t h a t a'(x) - aAl(X) where A1 is the unitization of A. 6 . 2 . 1 7 . PROPOSITION ( R i c k a r t t element of a unital p - B a n a c h algebra either complex or strictly real. Let V of O in K. Then there is a 5 > 0 such IIx - yll < 5 and xy - y z we have"
o(y) c
[23, p.36]). Let x be an A(A,I I 9II) which is be an open neighbourhood that for every y E A with
+ v;
(,)
c o(y)+ v.
(**)
PROOF. Since a(x) + V is an open set containing a(x), the relation (.) follows from 6.2.14(i). To prove (**) we will assume t h a t is is false and show t h a t this leads to a contradiction W i t h o u t loss of generality we can take Y = {A E K : IAI < 2e}. By our a s s u m p t i o n we can find a sequence xn --~ x with xn ~ x, such t h a t a(x) ~ C,~ = a(xn) + V for all n. (1) Choose An C a ( x ) \ G n .
If # e a(xn) then
An - # ~ V, so t h a t IAn - #1/> 2e.
(2)
Since A, e a(x) and a(x) is compact we can, by passing to a subsequence if necessary, assume t h a t
e
(3)
From ( 2 ) , ( 3 ) w e get: IA0 - #I I> 2e > e for every # E a(xn)
(4)
so t h a t A0 r a(x~) for every n. For obtaining the contradiction we have to consider separately the cases A0 - 0, A0 ~ 0. t He obtained the result for complex B~nach ~lgebras.
274
Spectral Analysis in TA's
C a s e 1. ) ~ 0 - 0. Then 0 ~ a(x,) and xn is invertible. Since Igl > c for # e a(x~) we get r ( x ; 1) - s u p ]#-11 ~< e -1. So, by 7.4.6, u ( x ; 1) - r(x;1)P ~< e-p, whence, by 3.7.29(i), x - limx,~ is invertible contradicting 0 - )~0 E a(x). C a s e 2. ,~0 J= 0. Since ,~0 r a(xn), q. invertible for all n. By 1.7.12 a'(Y n) -
1 +a
Yn
-
9a e
-- )io l xn
is
(5)
Since )~ E a(y,) iff -)~,~0 E a(xn), and by (4) I)~0+ )~)~0l > e for - ~ o E a(xn), we get 1
IIx ll
I
1 + )~1 - I)~~ + ,~o,~ I ~<
e
c
~< --e
(6)
for some C > 0 (since the sequence xn being convergent is bounded). From (5),(6) we conclude that r(y~n), and hence by G B formula (see 7.4.6.) u(y~) is bounded. So, by 3.7.29(ii), lim y,~ - -)~o ix is q. invertible, contradicting the fact that )~0 E 6.2.18. COROLLARY. If the algebra A of 6.2.17 is not unital then we have inclusion relations analogous to (,)(**) obtained by replacing a by a I (the quasi-spectrum). PROOF. We have only to apply 6.2.17 to the unitization A1 of A. 6.2.19. COROLLARY.
If A is commutative, r(x) is continu-
ous everywhere. PROOF. This follows from ( , ) , ( * * ) o f 6.2.17. 6.2.20. PROPOSITION. The completion ft of a commutative strictly real p-normed algebra A is strictly real. PROOF. Consider an element x E ti. If possible let a ' i ( x ) contain a complex number )~o - c~o + i~o, with /~o r 0. Write 1 r ] - ~1/~ol > 0. Choose a sequence ( x ~ ) i n A with x~ ~ x. Since
A is strictly real, ~a(x,~) c_ ~. Since A _C Ji we have also Ji _c ti,
275
w3. Pseudo-Resolvent Function and
so
~ ( x . ) c ~(~.) c ~ .
(1)
Write V - {A c C" A - a + i~ with a e R, lilt < ~}. By (**) of 6.2.17, there is a 5 > 0 such that
a(x) c a ( y ) + V whenever I I x - Yll < ~. Choose n sufficiently large t h a t I I x , - ~ll < ~. Then
~5(x) c ~ ( x . ) + It follows t h a t
v c R + v - v. 1 ~1~01, whence / ~ 0 -
A0 e V,l~01 < r l -
0-
a
contradiction. Therefore ~ i ( x ) __ N and A is strictly real.
w 3.
Pseudo-Resolvent
6 . 3 . 1 . DEFINITION. and x E A . Set
Function
Let A be an algebra (over a field F)
pV(x) - {A E F " (Ax)' exists}; pV(x) is called the pseudo-resolvent set of x. Since (0x)' 0 c pP(x) and we have always pV(x) r 0. Write
9'~ - ( ~ ) '
0~ -
0,
(~ c p~(~))
and call x~ a pseudo-resolvent or a p-resolvent of x; A H x~ is called a pseudo-resolvent function, t 6.3.2.
Remark.
The m a p
A ~
_~-1
is a bijection of
p ' ( x ) - p ' ( x ) \ { 0 } onto pP(x)\{O}, where p ' ( x ) d e n o t e s the quasiresolvent set of x. If F - K the map is also a h o m e o m r o h p i s m . If xis q. nilpotent then a'(x) - {0}, p'(x) - F \ { 0 } . Therefore, t This function has been considered implicity by Kaplansky [10 ", p.400, Lemm~ 3.2].
276
Spectral Analysis in TA's
p P ( x ) - - { F \ { 0 } } -1 [..J{0}- {F\{0}} U { 0 } - F. 6.3.3. LEMMA. (a)x~ ~ xu'
(~,~ e p~(~))
I
(b) x . #
4 = ~_ ~ A
(A,~ e p ~ \ { o } )
PROOF. (a) Since Ax ~ #x, by applying 1.1.18 twice we get I Xtt.
(b) We have Ax + (Ax)' + (Ax)(Ax)' - 0
(1)
ux + (u~)' + (u~)(u*)' - 0
(2)
Denoting the expressions in the equations (1), (2) above also by (1), (2)we get u • ( 1 ) - ~ • ( 2 ) - u . 0 - ~. 0 -
0,
which gives ,(~)'
- ~(u~)' - ~ u x [ ( u ~ ) ' - ( ~ ) ' ] .
(3)
Again, (1)x (#x)' and 'Ax" ( ~ x (2) give A tt
x(u~)' + (~)'(u~)' + ~(~)'(u~)' - 0 .
(4)
9( ~ ) , + (~)'(u~)' + ~ ( ~ ) ' (u~), - 0 .
(5)
#
From (4), (5) we obtain by subtraction
1
'(u~)'
and from (3), (6)we get
Ap
A#
(6)
w3. Pseudo-Resolvent Function
277
which reduces, after a change of sign, to the equation in (b). 6.3.4. LEMMA. In a Q algebra A, for each x E A, pC(x) is an open set containing O. PROOF. For A E pP(x), let U be an open neighbourhood of $x comprising q. invertible elements. By continuity of scalar multiplication there is an open neighbourhood N of A such that N x c_ U. If follows that N C_ pP(x) and pC(x)is open. 6.3.5. PROPOSITION. (a) Let A be a Hausdorff C algebra, and x an element of A such that pP(x) is open in ~. Then x~ is a strongly differentiable function of ~ on pP(x), with dx~ dA = - x ( 1 + x~) 2, (,)
dnxk _ (_l)nn!xn(1 + xk) n+l dA,~
(**)
We have also the relation
dn (Xk) d1,~
__ , (_~)n+l
-~-
n.
(A # o).
(b) In a Hausdorff CQ algebra A, the formulae (.), (. **) are valid for every element x in A.
(***) **),
PROOF. (a) From the equation ( 1 ) i n the proof of 6.3.3 we obtain, for ~ E pq(X)\{O}, 9 A
--
A
t = - x ( 1 + xA).
(1)
Making A --+ 0 we obtain
[dx'
(2)
If A, p C pP(x)\{O}, by 6.3.3 (b) we have
!
I
Spectral Analysis in TA's
278
Making #--~ ~ we obtain d,~
(3)
,~2,
which reduces to x~ 1 dx~ ~2 t ~ d~
x~ ~2 '
whence we get dx~ _ x~ (1 + x~) -- - x ( 1 + x~) 2 dA A
(4)
(,)
when )~ ~- 0 . On the other hand (2) shows that the formula in (4) (or (,)) is valid for ~ = 0, completing the proof of (,) for all ~. To prove (**), assume by induction that dn-lx~ _ ( _ l ) n - l ( n 1 ) ! x n - l ( 1 + Xk) n dan_ 1 where we have used
Thus we have proved
Differentiating both sides of the above equation we get dnx~ d/~n
--
( - - 1 ) n - l ( n -- 1)iX n - l " n(1 + xk) n-1 dxk
--
9 d,k (--1)n-ln!xn-l(1 + X~) n - l " - x ( 1 + x~) 2 (using (4))
=
(-1)nn!xn(1 + X~) n+i
which is (**). Finally, by successive differentiation we obtain (, 9 ,) from (3). (b) This follows from ( a ) a n d 6.3.4. 6.3.6. PROPOSITION. Let A be a p-Banach algebra and x E A. Then x~ exists for all ~ such that v(Ax) < 1, or equivalently, 1
lA] < v(x)
p, and we have oo
x~ - ~ (-1)'~(Ax) n
(,)
n=l
with the series on the right converging absolutely. In particular, 1
x~ is analytic for I)~l < v(x)
o.
PROOF. Consider the unitization A1 of A. Then we have (el + ~x) - 1 -
ex + (~x)'
279
w 3. P s e u d o - R e s o l v e n t Function
where el is the unity of A1. By (,) of 3.3.20 we have (3O
~(-1)"(Ax)",
( e I -~- ) ~ X ) - 1 -
rt=0
the series converging absolutely. It follows that we have (x)
x~ - (Ax)' - ~
(-1)n(Ax) n
rt--1
(with the series converging absolutely). 6.3.7.
COROLLARY.
If
A
is a complex p - B a n a c h
then x i is p - a d m i s s i b l e holomorphic on {A e
cl l
algebra I
< ~(~)-~)
PROOF. Set r
(-1)nAn; x . -- x n.
Then (,) of 6.3.6 can be rewritten as oo
n--1 1
For any r0 with 0 ~ r0 < v ( x ) - ~ , set K -- Kr ~ -- {A E C ' l ~ l
r0}.
Then
lie.IlK < So oo
oo
0(3
n= 1
n= 1
n= 1
since v ( r o x ) - r~v(x) < 1. Hence the corollary. 6.3.8. PROPOSITION. Let A be a complex ample C-algebra. I f x e A\{O} is q. nilpotent then {x~ " A e C} is unbounded. PROOF. First note that by 6.3.1 and definition of q. nilpotent, pV(x) - C. Since A is a Hausdorff C-algebra, by 6.3.5 (a),
280
Spectral Analysis in TA 's
z~($z)' is strongly differentiable, and hence for x* E A* F~.($) - x*(x~) is an entire function. If possible let x~ be a bounded function of )~. Then Fzl.()~) is bounded and so by classical Liouville's theorem Fz'.()~ ) is a constant. Since Fz'.(0 ) = 0 we must have F~. (A) - 0
for all A E C.
Putting ) ~ - 1, we get x * ( x ' ) - O. Since A is ample we conclude that x' - 0 which implies x - 0, contradicting the choice of x. Therefore {x~} is unbounded as required. 6.3.9. COROLLARY. (Kaplansky). In a complex normed algebra A, if x ~ 0 is q. nilpotent then {x~} is unbounded. PROOF. Since a normed algebra is an ample C-algebra, the corollary follows from 6.3.8. 6.3.10. LEMMA. Let A be a normed algebra and x E A be q. nilpotent. If ~ . e K are such that the sequence (()~.x)') is unbounded then I~,~l ~ c~. PROOF. First note that since x is q. nilpotent (~x)' exists for all )~ c ~:. Assume now that, to the contrary, I)~n[ ~< C for all n. Since (()~,x)') is unbounded there is, by 2.1.23, a nucleus U and a subsequence ((An,x)') such that U for all n'.
n t
(.)
Since IAn, I ~< C, for all n', we can choose a subsequence (An,,) of (An') with An,,--+ (some) A0. Since A is a C - a l g e b r a we get (An,,x)'--~ (A0x)', whence the sequence ((An-X)') is bounded. But by (*), a