CAMBRIDGE STUDIES IN ADVANCED MATHEMATICS 119 EDITORIAL BOARD ´ B. BOLLOBAS, W. FULTON, A. KATOK, F. KIRWAN, P. SARNAK,...
174 downloads
1449 Views
2MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
CAMBRIDGE STUDIES IN ADVANCED MATHEMATICS 119 EDITORIAL BOARD ´ B. BOLLOBAS, W. FULTON, A. KATOK, F. KIRWAN, P. SARNAK, B. SIMON, B. TOTARO
LOCALLY CONVEX SPACES OVER NON-ARCHIMEDEAN VALUED FIELDS Non-Archimedean functional analysis, where alternative but equally valid number systems such as p-adic numbers are fundamental, is a fast-growing discipline widely used not just within pure mathematics, but also applied in other sciences, including physics, biology and chemistry. This book is the first to provide a comprehensive treatment of non-Archimedean locally convex spaces. The authors provide a clear exposition of the basic theory, together with complete proofs and new results from the latest research. A guide to the many illustrative examples provided, end-of-chapter notes and glossary of terms all make this book easily accessible to beginners at the graduate level, as well as specialists from a variety of disciplines. C. P e r e z -Ga r c i a is a Professor in the Department of Mathematics, Statistics and Computation at the University of Cantabria, Spain. W. H. Sc h i k h o f worked as a Professor at Radboud University Nijmegen, the Netherlands for 40 years.
CAMBRIDGE STUDIES IN ADVANCED MATHEMATICS Editorial Board: B. Bollob´as, W. Fulton, A. Katok, F. Kirwan, P. Sarnak, B. Simon, B. Totaro All the titles listed below can be obtained from good booksellers or from Cambridge University Press. For a complete series listing visit: http://www.cambridge.org/series/sSeries.asp?code=CSAM
Already published 66 67 68 69 70 71 72 73 74 75 76 77 78 79 81 82 83 84 85 86 87 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118
S. Morosawa et al. Holomorphic dynamics A. J. Berrick & M. E. Keating Categories and modules with K-theory in view K. Sato L´evy processes and infinitely divisible distributions H. Hida Modular forms and Galois cohomology R. Iorio & V. Iorio Fourier analysis and partial differential equations R. Blei Analysis in integer and fractional dimensions F. Borceux & G. Janelidze Galois theories B. Bollob´as Random graphs (2nd Edition) R. M. Dudley Real analysis and probability (2nd Edition) T. Sheil-Small Complex polynomials C. Voisin Hodge theory and complex algebraic geometry, I C. Voisin Hodge theory and complex algebraic geometry, II V. Paulsen Completely bounded maps and operator algebras F. Gesztesy & H. Holden Soliton equations and their algebro-geometric solutions, I S. Mukai An introduction to invariants and moduli G. Tourlakis Lectures in logic and set theory, I G. Tourlakis Lectures in logic and set theory, II R. A. Bailey Association schemes J. Carlson, S. M¨uller-Stach & C. Peters Period mappings and period domains J. J. Duistermaat & J. A. C. Kolk Multidimensional real analysis, I J. J. Duistermaat & J. A. C. Kolk Multidimensional real analysis, II M. C. Golumbic & A. N. Trenk Tolerance graphs L. H. Harper Global methods for combinatorial isoperimetric problems I. Moerdijk & J. Mrˇcun Introduction to foliations and Lie groupoids J. Koll´ar, K. E. Smith & A. Corti Rational and nearly rational varieties D. Applebaum L´evy processes and stochastic calculus (1st Edition) B. Conrad Modular forms and the Ramanujan conjecture M. Schechter An introduction to nonlinear analysis R. Carter Lie algebras of finite and affine type H. L. Montgomery & R. C. Vaughan Multiplicative number theory, I I. Chavel Riemannian geometry (2nd Edition) D. Goldfeld Automorphic forms and L-functions for the group GL(n, R) M. B. Marcus & J. Rosen Markov processes, Gaussian processes, and local times P. Gille & T. Szamuely Central simple algebras and Galois cohomology J. Bertoin Random fragmentation and coagulation processes E. Frenkel Langlands correspondence for loop groups A. Ambrosetti & A. Malchiodi Nonlinear analysis and semilinear elliptic problems T. Tao & V. H. Vu Additive combinatorics E. B. Davies Linear operators and their spectra K. Kodaira Complex analysis T. Ceccherini-Silberstein, F. Scarabotti & F. Tolli Harmonic analysis on finite groups H. Geiges An introduction to contact topology J. Faraut Analysis on Lie groups: An Introduction E. Park Complex topological K-theory D. W. Stroock Partial differential equations for probabilists A. Kirillov, Jr An introduction to Lie groups and Lie algebras F. Gesztesy et al. Soliton equations and their algebro-geometric solutions, II E. de Faria & W. de Melo Mathematical tools for one-dimensional dynamics D. Applebaum L´evy processes and stochastic calculus (2nd Edition) T. Szamuely Galois groups and fundamental groups G. W. Anderson, A. Guionnet & O. Zeitouni An introduction to random matrices
Locally Convex Spaces over Non-Archimedean Valued Fields C. PEREZ-GARCIA W. H. SCHIKHOF
cambridge university press Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, S˜ao Paulo, Delhi, Dubai, Tokyo Cambridge University Press The Edinburgh Building, Cambridge CB2 8RU, UK Published in the United States of America by Cambridge University Press, New York www.cambridge.org Information on this title: www.cambridge.org/9780521192439 C
C. Perez-Garcia and W. H. Schikhof 2010
This publication is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 2010 Printed in the United Kingdom at the University Press, Cambridge A catalogue record for this publication is available from the British Library ISBN 978-0-521-19243-9 Hardback
Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate.
To my family and to my friend Nicole -C.P.G.
Contents
Preface
page xi
1 1.1 1.2 1.3
Ultrametrics and valuations Ultrametric spaces Ultrametric fields Notes
1 1 5 12
2 2.1 2.2 2.3 2.4 2.5 2.6
Normed spaces Basics Orthogonality Spaces of countable type The absence of Hilbert space Examples of Banach spaces Notes
14 15 22 28 37 41 78
3 3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 3.10
Locally convex spaces Seminorms and convexity Absolutely convex sets of countable type Definition of a locally convex space Basic facts and constructions Metrizable and Fr´echet spaces Bounded sets Examples of locally convex spaces Compactoids Compactoidity vs orthogonality Characterization of compactoids in normed spaces by means of t-frames 3.11 Notes
vii
81 83 90 91 97 108 112 114 143 158 165 168
viii
Contents
4 The Hahn–Banach Theorem 4.1 A first Hahn–Banach Theorem: spherically complete scalar fields 4.2 A second Hahn–Banach Theorem: spaces of countable type 4.3 Examples of spaces (strictly) of countable type 4.4 A third Hahn–Banach Theorem: polar spaces 4.5 Notes
170 171 175 182 192 198
5 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8
The weak topology Weak topologies and dual-separating spaces Weakly closed convex sets Weak topologies and spaces of finite type Weakly bounded sets Weakly convergent sequences Weakly (pre)compact sets and “orthogonality” Admissible topologies and the Mackey topology Notes
210 210 213 218 224 228 232 235 239
6 6.1 6.2 6.3
C-compactness Basics Permanence properties Notes
244 244 250 252
7 7.1 7.2 7.3 7.4 7.5 7.6 7.7
Barrelledness and reflexivity Polar barrelledness, hereditary properties Examples of (polarly) barrelled spaces The weak star and the strong topology on the dual Reflexivity Examples of reflexive spaces Metrizability considerations in duality theory Notes
254 255 262 272 275 282 294 300
8 8.1 8.2 8.3 8.4 8.5 8.6 8.7 8.8
Montel and nuclear spaces Compactoid operators Intermezzo: a curious property of ∞ Compactifying operators (Semi-)Montel spaces Nuclear spaces Semi-Montelness, nuclearity and metrizability Examples of (semi-)Montel and nuclear spaces Notes
301 302 308 309 311 320 324 328 334
Contents
9 9.1 9.2 9.3 9.4 9.5 9.6
Spaces with an “orthogonal” base Bases in locally convex spaces Spaces with an “orthogonal” base Fr´echet spaces with an “orthogonal” base Perfect sequence spaces K¨othe sequence spaces Barrelledness, reflexivity, Montelness and nuclearity of sequence spaces 9.7 Spaces of analytic functions 9.8 Basic counterexamples 9.9 Notes
ix
337 338 340 347 350 355 360 363 366 369
10 10.1 10.2 10.3 10.4 10.5 10.6 10.7
Tensor products The algebraic tensor product Algebraic tensor products, where the scalar field is valued Tensor products of locally convex spaces Tensor products of nuclear and semi-Montel spaces Examples of tensor products Non-Archimedean complexifications Notes
373 374 377 383 388 396 404 405
11 11.1 11.2 11.3 11.4 11.5 11.6
Inductive limits Basic facts and examples Stability properties of inductive limits Compactoid inductive limits Inductive topologies on sequence spaces Compactoid sets in inductive limits Notes
409 410 417 424 428 435 437
Appendix A Glossary of terms A.1 Sets A.2 Real numbers A.3 Groups, rings and fields A.4 Vector spaces A.5 Topological spaces A.6 Metric spaces A.7 Topological vector spaces
442 442 443 444 445 446 448 449
Appendix B Guide to the examples B.1 Spaces of continuous functions B.2 Spaces of differentiable functions
451 451 452
x
Contents
B.3 Spaces of analytic functions B.4 Valued field extensions B.5 Sequence spaces Notation References Index
452 452 452 453 457 468
Preface
Aim This book presents the basics of locally convex theory over a field K with a nonArchimedean valuation | . | : K−→[0, ∞) (see 1.2.3).1 The most important example of such a K is the field of the p-adic numbers (1.2.7). The strong triangle inequality |λ + µ| ≤ max(|λ| , |µ|) is the major difference between | . | and the absolute value function on the field of real numbers R and the field of complex numbers C. Likewise, the defining seminorms of our locally convex spaces will satisfy the strong triangle inequality. The book is self-contained in the sense that it does not require knowledge of any deep theory; only basic knowledge of (linear) algebra, analysis and topology are needed. It is intended for both (graduate) students and interested researchers in other areas, but is also of relevance for specialists.
History The founding father of non-Archimedean Functional Analysis was Monna, who wrote a series of papers in 1943 (see [152]–[155]). Over the years a wellestablished discipline developed, reflected in the 2000 Mathematics Subject Classifications 46S10 and 47S10 of the Mathematical Reviews. A milestone was reached in 1978 at the publication of van Rooij’s book [193], the most extensive treatment on non-Archimedean Banach spaces existing in the literature. In the meantime van Tiel had published his thesis [227] on non-Archimedean locally convex spaces. Both fundamental works still form a basis for new developments, and have been cited by many authors. We should also mention 1
Note that in this book all proofs, definitions, theorems, etc. are numbered decimally by chapter. They will be referred to by number only.
xi
xii
Preface
the proceedings of conferences on non-Archimedean analysis which were held every two years from 1990 onwards, [21], [88], [20], [209], [107], [135], [208], [45], [2], containing several publications on locally convex theory (we have listed the references in chronological order). The time had come for a volume on locally convex theory to appear and the present book hopefully provides an answer to this need. Our aim is to cover the fundamentals by setting up a general theory which allows a wide spectrum of subjects and examples. Our proof techniques are analytically oriented. In this context we would like to point out Schneider’s book [210]. Whereas our book is directed towards a rather general readership, Schneider, as he explains himself, had a different motivation, i.e., to offer a quick grasp to a reader working in other areas (such as number theory). Because of this, he allows for restrictions, for example working mainly over spherically complete fields. Also, the treatment in [210] has a more algebraic flavour. Despite these differences, Schneider’s book and ours are compatible and one can be used to complement the reading of the other.
Foreign affairs Complex numbers provide an excellent domain for forcing quadratic equations to have solutions. Likewise, the p-adic number field acts as a natural home for solving certain infinite systems of congruences, so it takes a prominent place in number theory. But also in other branches (such as algebraic geometry; representation of (Lie) groups; (several) complex variables; real analysis; even theoretical physics, see e.g. [34], [47] and [140]), one is more interested in the role non-Archimedean fields could play as fundamental objects. Researchers in those disciplines sometimes need a solid background in non-Archimedean locally convex spaces; we have mentioned Schneider’s reason for writing his book. This has also influenced the set up of our book, as we will later explain. The presence of the vast area of Functional Analysis over R or C, henceforth called “classical analysis” is, of course, a fruitful source of inspiration for the non-Archimedean case. However, the reader will notice that, in the course of the development of the theory, the non-Archimedean world is equally fascinating, and asks for a mathematical intuition of its own.
Book organization In Chapter 1 we present the basics of ultrametric spaces and valued fields. In Section 1.2 we quote several theorems on valued fields without proof (but with
Preface
xiii
references) as we feel that otherwise it would lead us too far away from our main track. For that matter, the results are hardly needed, but may serve to offer the reader an impression. Starting from Chapter 2 our policy changes: with obvious exceptions we present full proofs, as they really belong to the subject of the book. According to our experiences, in such cases not only the mere statements, but also their proofs, are needed in order to obtain understanding and intuition. We have also applied this philosophy to those parts in which the classical and the nonArchimedean theories seem to be similar. Not only does it facilitate a better grasp of the subtle differences but also serves those readers who may not be familiar with classical Functional Analysis theory (e.g. students and workers in other fields). In general, we hope that any reader, including the expert, will appreciate having the basic theory together with the proofs collected into a single volume. In compiling the scattered material in the literature we were often able to simplify and tidy up the original proofs of the inventors; we hope that it will add to the value of the book. The same process revealed several natural questions that have not been touched upon before. We have tried to the best of our ability to fill in those gaps. Consequently this book contains quite a few new results. To illustrate the theory we have included examples, mainly playing around spaces of continuous, analytic, and differentiable (C n , C ∞ ) K-valued functions. The reader will notice that these themes return in every chapter, connecting them with the newly developed subject. For the reader’s convenience we include a guide to the examples at the end of the book. Formally, the examples are independent of the main theory, so the reader can choose to pick his or her favourites; only occasionally will we use some space to provide a counterexample to a conjecture. We would like to point out that our examples do not cover all the present-day knowledge of these spaces. For this and related theories one should consult the following references. Spaces of continuous functions were studied by e.g. Aguayo, De Grande-De Kimpe, Katsaras, Mart´ınez-Maurica, Navarro and Perez-Garcia ([3], [5], [86], [87], [113], [114], [115], [120], [122], [123], [124], [149], [176]). Background on general theory of analytic functions was given by Escassut, [53], Robert, [190] and Robba and Christol, [188], [189]. The last reference also contains some locally convex examples and some applications to p-adic differential equations, as do [35] and [36]. More on locally convex theory of analytic functions can be found in [68], [78] and [82]. For C n (C ∞ )-functions, see [195] for general theory, and the works of De Grande-De Kimpe, Khrennikov, Navarro, Schikhof and van Hamme ([70], [83], [165], [206], [207]) for locally convex aspects. Generalizations (several variables, more abstract settings) were
xiv
Preface
treated by De Smedt ([223], [224], [225]) and by Bertram, Gl¨ockner and Neeb ([28], [61]). Throughout the book we have provided, for convenience, many crossreferences. This way the reader can have easy access to related results that have been treated earlier, and a link to developments later on in the book. The notes at the end of each chapter contain some history, references and comments. When mentioning results that are not covered by the book no completeness is pretended. In the glossary of terms (Appendix A) we explain a few concepts, terminology, notations, etc., used freely in the book, but that may be not familiar to all readers. In the guide to the examples (Appendix B) we list the most important examples treated in the book and indicate where their properties can be found. Finally, we wish to thank the Ministerio de Educaci´on y Ciencia of Spain (MTM2006-14786), for partially supporting the research concerning new results that are presented in this book.
1 Ultrametrics and valuations
Ultrametric spaces will form the building blocks of the locally convex spaces to be treated in this book, whereas valued fields will act as their scalar fields. We assume that the reader has a basic knowledge of ultrametrics and valuations; in this short chapter we will recall briefly some fundamentals that will be needed later on.
1.1 Ultrametric spaces Let X be a set. A metric on X assigns to every ordered pair (x, y) ∈ X × X a nonnegative real number d(x, y) such that: (i) d(x, y) = 0 if and only if x = y, (ii) d(x, y) = d(y, x), (iii) d(x, z) ≤ d(x, y) + d(y, z) (triangle inequality), for all x, y, z ∈ X. The pair (X, d) is called a metric space. We often write X instead of (X, d). Let (X, d) be a metric space. Let a ∈ X, r > 0. The set B(a, r) := {x ∈ X : d(x, a) ≤ r} is called the closed ball with radius r about a. (Indeed, B(a, r) is closed in the induced topology.) Similarly, B(a, r − ) := {x ∈ X : d(x, a) < r} is called the open ball with radius r about a. In cases where we want to specify X in the notation, we shall write BX (a, r) (BX (a, r − )) rather than B(a, r) (B(a, r − )). It is also customary to call the point a the centre of the balls B(a, r), B(a, r − ). This will cause no harm as long as 1
2
Ultrametrics and valuations
we keep in mind that a ball may have more than one centre (and more than one radius for that matter), see 1.1.2(b). For a non-empty set Y ⊂ X its diameter is diam Y := sup{d(x, y) : x, y ∈ Y } (possibly ∞). Analogously, the distance between two non-empty sets Y, Z ⊂ X is dist (Y, Z) := inf{d(y, z) : y ∈ Y, z ∈ Z}. For a ∈ X and Y ⊂ X, instead of dist ({a}, Y ) we write dist (a, Y ). Occasionally we shall deal with semi-metrics, i.e., cases where condition (i) above is weakened to “d(x, x) = 0”. Then the induced topology need not be Hausdorff. To avoid confusion we will use in this context sometimes expressions we left undefined (such as: Y is d-dense in X) that yet will be clear to the reader. The (semi-)metrics featuring in this book are of a special kind. Definition 1.1.1 Let X = (X, d) be a metric space. X is called an ultrametric space, and d is called an ultrametric, if d satisfies the strong triangle inequality: (iii) d(x, z) ≤ max(d(x, y), d(y, z)), for all x, y, z ∈ X. Clearly (iii) is stronger than (iii). At this point many examples of ultrametric spaces would fit here. However, most of them will be treated later on in their own right, so here we shall content ourselves with two examples. Examples 1.1.2 (a) (A typical one: the p-adic metric) Let p be a fixed prime. For m, n ∈ Z, put d(m, n) := 0 if m = n and, for m = n, d(m, n) := p−r if r is the largest nonnegative integer such that pr divides m − n. One checks easily that d is an ultrametric on Z. It may be worth mentioning that for a ∈ {0, 1, . . . , p − 1} we have B(a, 1− ) = B(a, p−1 ) = {n ∈ Z : n ≡ a (mod p)}. Similarly, for m ∈ N, a ∈ {0, 1, . . . , pm − 1} we have B(a, p −m ) = {n ∈ Z : n ≡ a (mod pm )}. Thus, balls have a numbertheoretic interpretation. Further, observe that the set d(Z × Z) of values of d equals {1, p −1 , p −2 , . . .} ∪ {0}. The induced topology is non-discrete. In fact, limn n! = 0. (b) (An extreme one: the trivial metric) Let X be any set and for x, y ∈ X put 0 if x = y d(x, y) := 1 if x = y.
1.1 Ultrametric spaces
3
Then d is an ultrametric, called the trivial metric. It clearly induces the discrete topology. Notice that, for any a ∈ X and for any r ≥ 1, X = B(a, r). So X is a ball with infinitely many radii, and every point of X serves as a centre. Below we will state several basic facts on ultrametric spaces. Though simple to derive they are fundamental for all that follows. In the remaining part of this section X = (X, d) is an ultrametric space. 1. Every point of a ball is a centre. Proof. Consider the closed ball B(a, r). Let b ∈ B(a, r) and choose x ∈ B(b, r). Then d(x, a) ≤ max(d(x, b), d(b, a)) ≤ r, so x ∈ B(a, r). By symmetry we have B(a, r) = B(b, r). A similar proof works for open balls. 2. Every ball is open and closed in the topological sense. Proof. That a closed ball is open follows from 1. Now let B be an open ball with radius r. The requirement “x ∼ y if and only if d(x, y) < r” defines an equivalence relation on X whose classes are the open balls with radius r. Since B is among them it follows that X \ B, being a union of open balls, is open, so B is closed. 3. (Mercury drop behaviour) Two balls are either disjoint, or one is contained in the other. Proof. Let B1 , B2 be two closed balls with radius r1 , r2 respectively and let a ∈ B1 ∩ B2 . If r1 ≤ r2 we have by 1, B1 = B(a, r1 ) ⊂ B(a, r2 ) = B2 . A similar proof works for two open balls and for the case of an open and a closed ball. 4. (Isosceles triangle principle) Let x, y, z ∈ X. Then among the numbers d(x, z), d(x, y), d(y, z) the largest and second largest are equal. In other words, if d(x, y) = d(y, z) then d(x, z) = max(d(x, y), d(y, z)). Proof. Suppose d(x, y) < d(y, z). Then d(x, z) ≤ max(d(x, y), d(y, z)) = d(y, z) but also, since d(y, z) is not ≤ d(x, y), d(y, z) ≤ max(d(x, y), d(x, z)) = d(x, z), and we are done.
4
Ultrametrics and valuations
5. (Equal distances between points of disjoint balls) Let B be a ball, a ∈ X, a ∈ B. Then d(a, x) = d(a, y) for each x, y ∈ B. More generally, let B1 , B2 be disjoint balls. Then, for x ∈ B1 and y ∈ B2 , the number d(x, y) is constant. We leave the proof to the reader. 6. (Some other immediate consequences) The topology of X has a base of sets that are clopen, i.e., it is zero-dimensional and, by consequence, totally disconnected. For a ∈ X, r > 0, the “sphere” {x ∈ X : d(x, a) = r} is clopen and, unless it is empty, not the boundary of B(a, r). Another implication of the strong triangle inequality is that, to find the diameter of a non-empty set Y ⊂ X, it suffices to take an arbitrary a ∈ Y and compute sup{d(a, y) : y ∈ Y }. Also, a useful feature is the fact that if B is a ball in X and Y is a subset of X that meets B, then B ∩ Y is a ball in the metric space Y . 7. (No new values of the metric after completion) Let x1 , x2 , . . . be a sequence in X converging to x ∈ X. Suppose a ∈ X, a = x. Then d(xn , a) = d(x, a) for large n. This follows easily from the isosceles triangle principle. The metric completion of X is again an ultrametric space, denoted X ∧ , with the metric on X ∧ also denoted by d. By the above remark we have d(X × X) = d(X ∧ × X∧ ). 8. Finally, a sequence x1 , x2 , . . . in X is a Cauchy sequence if and only if limn d(xn+1 , xn ) = 0. This follows from d(xm , xn ) ≤ max(d(xm , xm−1 ), . . . , d(xn+1 , xn ))
(m > n).
For later use we include the following result. Theorem 1.1.3 If X is locally compact then there is a partition of X consisting of compact balls. Proof. Choose r1 , r2 , . . . ∈ R with r1 > r2 > · · · , limn rn = 0. Let B be the collection of all closed balls in X with radius in {r1 , r2 , . . .} that are compact. Then B is a covering of X by compact balls. Every member of B is contained in a maximal member of B. These maximal balls form the desired partition. The following concept will play a key role in this book. Definition 1.1.4 X is called spherically complete if each nested sequence of balls B1 ⊃ B2 ⊃ · · · has a non-empty intersection. We obtain equivalent definitions if in the above we require all Bn to be closed balls, or all Bn to be open balls.
1.2 Ultrametric fields
5
It might be interesting to note that (ordinary) completeness of X amounts to “each nested sequence B1 ⊃ B2 ⊃ · · · of balls for which limn diam Bn = 0 has a non-empty intersection”. Thus, spherical completeness implies completeness. The converse is not true, which might seem surprising at first sight; for examples see 1.2.12 and 1.2.14. Spherical completeness has to do with best approximations. Definition 1.1.5 Let Y ⊂ X, a ∈ X. We say that a has a best approximation in Y if dist (a, Y ) is attained, i.e., min{d(a, y) : y ∈ Y } exists. Points in Y having this minimal distance to a are called best approximations (of a in Y ). Note that in general there is more than one best approximation. Theorem 1.1.6 Let X = ∅ be spherically complete. Let Z be an ultrametric space containing X as a subspace. Then each z ∈ Z has a best approximation in X. Proof. There are r1 > r2 > · · · with limn rn = dist (z, X). Each one of the balls Bn := {x ∈ Z : d(x, z) ≤ rn } has non-empty intersection with X, so B1 ∩ X ⊃ B2 ∩ X ⊃ · · · is a nested sequence of balls in X. Thus, there is an a ∈ n∈N (Bn ∩ X). Clearly d(z, a) = dist (z, X).
1.2 Ultrametric fields All fields appearing in this book are commutative. A valuation on a field K is a map | . | : K−→[0, ∞) such that: (i) |λ| = 0 if and only if λ = 0, (ii) |λ µ| = |λ| |µ| (multiplicativity), (iii) |λ + µ| ≤ |λ| + |µ| (triangle inequality), for all λ, µ ∈ K. The pair (K, | . |) is called a valued field. We often write K instead −1 of (K, | . |). Note that, for all λ, µ ∈ K, µ = 0, we have |−λ| = |λ|, λ µ = |λ| / |µ| and |1| = 1 (here we adapt the bad habit to use the same symbol 1 for the unit element of K and of R; in fact, in (i) we did the same thing for the symbol 0). Let K be a valued field. Then the map (λ, µ) → |λ − µ| is a metric on K which induces a topology for which K is a topological field (i.e., addition, subtraction, multiplication and division are continuous). The metric completion of K is in a natural way a valued field which we denote by K ∧ (the unique continuous extension of the valuation is again usually denoted by | . |).
6
Ultrametrics and valuations
The (closed) unit disk (or ball) is the set {λ ∈ K : |λ| ≤ 1} = BK (0, 1), often abbreviated by BK . Similarly, the open unit disk (or ball) is BK− := {λ ∈ K : |λ| < 1} = BK (0, 1− ). The set BK \BK− is called the unit sphere. Clearly R, C, with the absolute value function, henceforth denoted | . |∞ , are examples of complete valued fields. (Q, | . |∞ ) is a non-complete valued field with completion (R, | . |∞ ). Definition 1.2.1 Two valuations on a field are called equivalent if they induce the same topology. √ For example, the map z → |z|∞ is a valuation on C that is equivalent to | . |∞ . Theorem 1.2.2 Two valuations | . |1 , | . |2 on a field K are equivalent if and only if there is an s > 0 such that | . |2 = | . |s1 . Proof. One direction is obvious; we sketch the proof of the “only if”. For a valued field, the open unit disk is precisely the set {λ ∈ K : limn λn = 0}, so | . |1 and | . |2 have the same open unit disk. By looking at K \ BK we see that | . |1 and | . |2 also have the same closed unit disk. Then also their unit spheres are the same. From mutiplicativity one infers the existence of a function φ for which |λ|2 = φ(|λ|1 ) for all λ ∈ K. From here it is an easy exercise to show that φ is a power function. In this book we focus on valued fields that are ultrametric. Definition 1.2.3 Let K = (K, | . |) be a valued field. The valuation | . | is called non-Archimedean, and K is called a non-Archimedean valued field if | . | satisfies the strong triangle inequality: (iii) |λ + µ| ≤ max(|λ| , |µ|), for all λ, µ ∈ K. It is not our purpose to present here a complete theory of (non-Archimedean) valued fields. Instead we shall recall the most important facts and examples together to form either a refresher or a crash course, depending on the reader’s point of view. One of the facts that we will use frequently is the identity (1 − n λ)−1 = ∞ n=0 λ for λ ∈ K, |λ| < 1, where K is a non-Archimedean valued field. We leave the proof of this familiar formula to the reader. Let (K, | . |) be a non-Archimedean valued field. Then, for each n ∈ N, |n .1 | = |1 + 1 + · · · + 1| ≤ max(|1| , |1| , . . . , |1|) = 1, showing that the multiples of the unit element of K form a bounded set. This is in contrast with the “axiom of Archimedes” stating that N is unbounded in R and, at the same time, it explains the term “non-Archimedean”.
1.2 Ultrametric fields
7
The isosceles triangle principle in K, “if |λ| = |µ| then |λ + µ| = max(|λ| , |µ|)”, shows that if λ1 , λ2 , . . . is a sequence in K converging to λ = 0 then |λn | = |λ| for large n. So no new values are added after completion. We set |K| K × := K \ {0}, the multiplicative group := {|λ| : λ ∈ K} and × × of K. Also, K := {|λ| : λ ∈ K } is a multiplicative group of positive real numbers, the value group of K. There are two possibilities: (i) 1 is not an accumulation point of K × . Then K × is a discrete subset of (0, ∞) and the valuation is called discrete. It may happen that K × = {1}. Then we are dealing with the trivial valuation given by |λ| :=
0 if λ = 0 1 if λ ∈ K × ,
whose associated metric is the trivial one (see 1.1.2(b)) and whose induced topology is discrete. If the valuation is not trivial but discrete then max{|λ| : λ ∈ BK− } exists, − so there ×is a ρ ∈ nBK such that |K| ∩ (|ρ| , 1) = ∅. It is not difficult to see that K = {|ρ| : n ∈ Z}. We will call such a ρ a uniformizing element. (ii) 1 is an accumulation point of K × . Then K × is a dense subset of (0, ∞) and the valuation is called dense. A second natural object that can be assigned to every non-Archimedean valued field is defined as follows. The unit disk BK of K is not only multiplicatively, but, due to the strong triangle inequality, also additively closed. Thus, BK is a commutative ring with identity. The open unit disk BK− is easily seen to be an ideal in BK and, since each element of BK \BK− is invertible, even maximal. Thus, BK /BK− is a field, called the residue class field of K, customarily denoted by k. The canonical map BK −→k is mostly written λ → λ. Now let L be a valued field extension of K (i.e., a non-Archimedean valued field containing K as a valued subfield) with residue class fields l and k respectively. Consider the diagram BK
/ BL
k
l
where the vertical arrows represent the canonical maps and the horizontal one is the inclusion. It is easily seen that there exists precisely one map φ : k−→l
8
Ultrametrics and valuations
making the diagram BK
/ BL
k
/l
φ
commute. Clearly φ is an injective ring homomorphism with φ(1) = 1. We call this φ the natural map of k into l. Thus, we have that the value group of K is a subgroup of the value group of L and that the residue class field of K is naturally embedded into the residue class field of L. The next result is well known. Theorem 1.2.4 ([193], 1.5) Let K be a non-Archimedean valued field that is algebraically closed. Then its residue class field is again algebraically closed, its value group is divisible, and its valuation is either trivial or dense. Example 1.2.5 The p-adic valuation on Q Let p be a prime number. Define a real-valued function | . |p on Z by |0|p := 0 and, for n = 0, |n|p := p −r(n) , where r(n) is the largest nonnegative integer such that pr(n) divides n (so, in fact |n|p = d(n, 0) of 1.1.2(a)). For a rational number mn (m = 0), set n |n|p . := |m|p m p Direct verification shows that in this way a non-Archimedean valuation | . |p is defined on the field Q of rational numbers. | . |p is called the p-adic valuation on Q. We will show that – essentially – there are no other non-Archimedean valuations on Q. Theorem 1.2.6 Let | . | be a non-Archimedean valuation on Q. Then either | . | is trivial or | . | is equivalent to some p-adic valuation. Proof. Suppose | . | is not trivial. Then |n| = 1 for some n ∈ N. By the strong triangle inequality |n| ≤ 1. Hence {m ∈ N : |m| < 1} is non-empty, let p be its smallest element. Then p = 1. If p = m n for some m, n ∈ N, m < p, n < p then |m| = |n| = 1, so |p| = |m| |n| = 1, an impossibility. Thus, p is a prime number. If n ∈ N is not divisible by p there exist a ∈ {0, 1, 2, . . .} and
1.2 Ultrametric fields
9
r ∈ {1, . . . , p − 1} such that n = a p + r. Then |r| = 1 and, by the isosceles triangle principle, also |n| = 1. Hence, for each n ∈ N we have |n| = |p|r(n) , with r(n) as above. It follows easily that, for all λ ∈ Q, |λ| = |λ|sp , where s := −log |p| (log p)−1 . Q is not complete with respect to the metric induced by the p-adic valuation. (The shortest way to see it is by means of a Baire Category argument, using the countability of Q and the fact that (Q, | . |p ) has no isolated points.) Definition 1.2.7 The completion of (Q, | . |p ) is called Qp , the field of the p-adic numbers. The extended valuation on Qp is also denoted | . |p . Thus, in some natural sense, the fields Q2 , Q3 , . . . present themselves as alternatives to R: completions of Q, but with respect to the various p-adic valuations, which are obviously inequivalent. The value group of Qp is {pn : n ∈ Z}, so | . |p is discrete with uniformizing element p ∈ Qp . The unit disk is frequently denoted Zp instead of BQp , and it is called the ring of p-adic integers; it is the closure of Z in Qp . The residue class field of Qp is the field of p elements. n The fact that (1 − p)−1 = ∞ n=0 p shows that there is no linear ordering in Qp that behaves decently with respect to algebraic structure and topology. Qp is not algebraically closed. An easy way to see this is to consider the equation x 2 = p. Any solution x would have the p-adic valuation p −1/2 , but this number is not in the value group. So x 2 = p has no solutions in Qp . By considering the equation x n = p for any n > 2 we infer that the algebraic closure Qap must be of infinite degree over Qp . Qp is locally compact, i.e., each point has a compact neighbourhood. In fact each ball in Qp , in particular Zp , is compact. This is a special case of the following. Theorem 1.2.8 ([195], 12.2) Let K be a non-trivially non-Archimedean valued complete field. Then K is locally compact if and only if the valuation is discrete and the residue class field is finite. The following lemma will be needed in 2.5.22 and 2.5.34. Lemma 1.2.9 Let K be a non-trivially non-Archimedean valued field. Then K contains a closed subfield K1 that has a non-trivial discrete valuation. Proof. Let K0 be the prime field of K. If it is non-trivially valued then K0 = Q and the valuation on it is equivalent to a p-adic one (1.2.6), so is discrete and we can take K1 := K 0 .
10
Ultrametrics and valuations
If K0 is trivially valued, choose a ∈ K, 0 < |a| < 1. By using the isosceles triangle principle we see that, for λ0 , λ1 , . . . , λn ∈ K0 , λ0 + λ1 a + · · · + λn a n = max λi a i . 0≤i≤n
f , g
So the elements where f, g are polynomials in a with coefficients in K0 , g = 0 form a valued subfield K0 (a) of K with discrete value group {|a|n : n ∈ Z}, and we can take K1 := K0 (a). Before giving the next example we first quote an extension theorem. Theorem 1.2.10 ([195], 14.1, 14.2) Let (K, | . |) be a non-Archimedean valued field. Let L be a field extension of K, i.e., L is a field containing K as a subfield. Then | . | can be extended to a non-Archimedean valuation on L. If, moreover, K is complete and L is of finite degree over K (i.e., L is finite-dimensional as a K-vector space) then this extension is unique. Example 1.2.11 The field C p of the p-adic complex numbers Each point of the algebraic closure Qap of Qp lies in a field extension of Qp of finite degree over it, so by the previous theorem there is precisely one nonArchimedean valuation on Qap that extends | . |p . Unfortunately, Qap is no longer complete ([195], 16.6), so we define Cp := (Qap )∧ . Fortunately, the completion of an algebraically closed field is again algebraically closed ([195], 17.1). So Cp is in some sense the smallest complete algebraically closed extension of Qp , hence deserves the name field of the p-adic complex numbers. We will denote the extension of the p-adic valuation to Cp again by | . |p . We now quote some facts on Cp . Theorem 1.2.12 ([195], 17.2, 20.6) The value group of Cp is {p r : r ∈ Q}, its residue class field is the algebraic closure of the field of p elements. So the valuation is dense and the residue class field is infinite. Cp is not locally compact, but still separable, complete but not spherically complete. That the field of the p-adic numbers is spherically complete follows from the next theorem. Theorem 1.2.13 If K is a discretely valued complete non-Archimedean field then K is spherically complete. Proof. Let B1 ⊃ B2 ⊃ · · · be a nested sequence of balls in K, let dn := × diam Bn . Then d1 ≥ d2 ≥ · · · and dn ∈ K for each n. By discreteness either the sequence B1 , B2 , . . . becomes stationary or limn dn = 0. For both cases (for the last one use completeness) we find n∈N Bn = ∅.
1.2 Ultrametric fields
11
Remark 1.2.14 A similar proof works for any non-empty closed subset of K. However, if K is complete with respect to a dense valuation then K has closed subsets that are complete but not spherically complete. Indeed, take X := K \ BK . Choose λ1 , λ2 , . . . ∈ K such that |λ1 | > |λ2 | > . . . and limn |λn | = 1. Then n → BX (λn , |λn |) is a nested sequence of balls and n∈N BX (λn , |λn |) = ∅. Next we quote the existence of a “spherical completion” of K. Definition 1.2.15 Let (K, | . |) be a non-Archimedean valued field. A valued field extension (L, | . |) of (K, | . |) is called immediate if the value groups of K and L are the same and their residue class fields are naturally isomorphic. (K, | . |) is called maximal if it has no proper immediate extensions. It is easy to see that the extension is immediate if and only if for each non-zero a ∈ L there is a λ ∈ K with |a − λ| < |a|. Theorem 1.2.16 ([193], 4.47, 4.49) Let K = (K, | . |) be a non-Archimedean valued field. Then we have the following: (i) K is maximal if and only if K is spherically complete. (ii) K has an immediate extension that is maximal. Now let L1 and L2 be two maximal immediate extensions of K. One can prove that there is a bijective K-linear isometry L1 −→L2 that leaves K pointwise fixed, but we cannot always choose this map to be a field homomorphism ([193], 4.59). Despite this we shall denote any maximal immediate extension of K by K ∨ , and even call K ∨ the spherical completion of K! This will be harmless as long as the properties of K ∨ we will be interested in have to do with | . | and the structure of K ∨ as a K-vector space. Non-Archimedean valued fields admit a natural version of the well-known Weierstrass Theorem, which we will use in the sequel several times. Theorem 1.2.17 ([195], 43.3) Let K = (K, | . |) be a non-Archimedean valued field, let X be a compact subset of K, let f : X−→K be a continuous function, and let ε > 0. Then there exists a polynomial function P : K−→K such that |f (x) − P (x)| < ε for all x ∈ X. The remaining part of this section is not needed for the sequel but has been included to serve as some background account. We first present an example of a non-Archimedean valued field of different nature. Let L(X) be the field of rational functions in one indeterminate X over
12
Ultrametrics and valuations
a field L. Let h ∈ L(X), h = fg , where f, g are polynomials in X, g = 0. Put 0 if f = 0 |h| := 2degree f −degree g if f = 0. One can easily check that | . | defines a non-trivial non-Archimedean valuation on L(X). By choosing for L a finite field we obtain that L(X) has non-zero characteristic. Thus, with the extension theorem 1.2.10 it is possible to construct many examples of non-Archimedean valued fields of arbitrary characteristic. The following theorem says roughly that, except for the absolute value | . |∞ , all valuations are non-Archimedean. Theorem 1.2.18 ([18], p. 127) Let (K, | . |) be a valued field. Then either: (i) there is an equivalent valuation on K for which K is isometrically isomorphic to a valued subfield of (C, | . |∞ ), or (ii) the valuation | . | is non-Archimedean. The next two theorems also demonstrate the abundance of non-Archimedean valued fields. Theorem 1.2.19 ([193], 1.3, 1.J, 2.G) Let k be any field, let be any multiplicative subgroup of (0, ∞). Then there exists a non-Archimedean valued field K whose value group is and whose residue class field is isomorphic to k. This K can be chosen to be (spherically) complete. Theorem 1.2.20 ([194], Theorem 1) Every ultrametric space can isometrically be embedded into a suitable non-Archimedean valued field. Theorem 1.2.21 ([193], 2.2) Let K be a non-trivially non-Archimedean valued complete field. Then every compact ultrametric space can homeomorphically be embedded into K.
1.3 Notes We will briefly describe the so-called Krull valuations; these are generalizations of our non-Archimedean ones. Inspection of the axioms for valuations shows that, by passing from the ordinary to the strong triangle inequality, addition of real numbers is no longer involved, but only ordering. Of course multiplicativity is also required. This gives rise to the idea of allowing the range of the valuation to lie in an ordered group, rather than just (0, ∞). We give the formal definitions.
1.3 Notes
13
Let G be a multiplicatively written linearly ordered abelian group (i.e., there is a linear ordering < on G satisfying g1 < g2 =⇒ h g1 < h g2 for all g1 , g2 , h ∈ G). Augment G by adjoining an element 0 and define 0 < g, 0 . g := g . 0 := 0 . 0 := 0 for all g ∈ G. Let K be a field. A Krull valuation with value group G is a surjective map | . | : K−→G ∪ {0} such that: (i) |λ| = 0 if and only if λ = 0, (ii) |λ µ| = |λ| |µ|, (iii) |λ + µ| ≤ max(|λ| , |µ|), for all λ, µ ∈ K. For systematic theory, see [58] for ordered groups and [230] for Krull valued fields. We here only mention the following. The map (λ, µ) → |λ − µ| behaves like an ultrametric in the sense that it induces a field topology in the usual way. However, the situation may be different from what we are used to. For example, the topology on K may not be metrizable and even when it is, it still may happen that 1, λ, λ2 , . . . does not tend to 0 for some λ ∈ K, |λ| < 1.
2 Normed spaces
From now on in this book, unless explicitly stated otherwise, K = (K, | . |) is a complete non-Archimedean valued field. The valuation | . | is assumed to be non-trivial. By imposing the strong triangle inequality x + y ≤ max(x, y) we will develop in this chapter the theory of normed K-vector spaces, roughly only inasmuch it is needed for locally convex theory. See [193] for a treatment of normed spaces in its own right. More on normed spaces will also appear in Sections 3.10 and 8.2 and in Subsection 7.5.1. Fundamentals, like finite-dimensional spaces, completions, Banach spaces, quotient spaces, the Open Mapping Theorem, are considered in Section 2.1, parallel to the classical set up. After that the theory is going to diverge from the classical one. A curious difference is already that the range of the norm function may be different from |K|, so that non-zero vectors cannot always be normalized, leading to the notion of a solid norm (2.1.10). Attempts to define Hilbert spaces over K, starting from an inner product will not lead to satisfactory results; we provide the details in Section 2.4. On the other hand, there is a notion of orthogonality (x ⊥ y if dist (x, Ky) = x) that is symmetric and works for every normed space. We study this in Section 2.2 and prove, unlike in the Hilbert space case, that orthogonality is stable under small perturbations. The concept of orthogonality will be an important tool throughout this book. In Section 2.3 we “linearize” the notion of separability to obtain the concept “of countable type”, useful for spaces over not necessarily separable K. These spaces will turn out to be more important than their classical counterparts. We will prove the curious facts that all infinite-dimensional Banach spaces of
14
2.1 Basics
15
countable type over K are linearly homeomorphic, and that closed subspaces have a closed complement. As for the examples in Section 2.5, the study of a valued field L ⊃ K, considered as a normed space over K (Subsection 2.5.4) is a typical nonArchimedean feature. Notice that, as an application, in 2.5.48 we construct an operator on a Banach space E over a non-spherically complete K having no closed invariant subspaces other that {0} and E. The other examples look familiar at first sight, but one has to keep in mind that the definitions of “analytic function” and “C n -function” are different from the classical ones. For convenience we provide most details that are needed to present the examples. References for deeper study were given in the preface to this book (in the section “Book organization”). Finally, the reason for excluding trivial valuations will become clear as soon as we have defined locally convex spaces, see the end of the notes to Chapter 3.
2.1 Basics Definition 2.1.1 Let E be a K-vector space. A norm on E is a map . : E−→[0, ∞) such that: (i) x = 0 if and only if x = 0, (ii) λ x = |λ| x, (iii) x + y ≤ max(x, y), for all x, y ∈ E, λ ∈ K. We call (E, . ) a K-normed space or a normed space over K. We frequently write E instead of (E, . ). E is called a K-Banach space or a Banach space over K if it is complete with respect to the induced ultrametric (x, y) → x − y. The closed unit ball of a K-normed space E is the set BE (0, 1) usually abbreviated by BE . Similarly we define the open unit ball BE− . Also, E := {x : x ∈ E}. From now on we often drop the prefix “K -” and write vector space, normed space, Banach space instead of K -vector space, K -normed space, K -Banach space respectively. The induced topology makes a normed space into a Hausdorff topological vector space (addition and scalar multiplication are continuous).
16
Normed spaces
Remark 2.1.2 Maps . : E−→[0, ∞) satisfying (i), (ii) and the ordinary triangle inequality x + y ≤ x + y (x, y ∈ E), but not (iii) are called Anorms in the literature. For example, (λ1 , λ2 ) → |λ1 |2 + |λ2 |2 is an A-norm on K 2 , whereas (λ1 , λ2 ) → max(|λ1 | , |λ2 |) is a norm. Although A-norms can be a source for interesting topological problems, all spaces that appear naturally in the duality theory of this book carry norms (or seminorms, see Chapter 3) in the sense of 2.1.1. So A-norms will not be our main concern. A sequence x1 , x2 , . . . in a normed space E is summable with sum x ∈ E if limn x − ni=1 xi = 0. We sometimes express summability of x1 , x2 , . . . as “ i xi exists” and write x = ∞ i=1 xi . Now let x1 , x2 , . . . be summable with sum x. From the fact that x − n i=1 xi ≤ sup{xn+1 , xn+2 , . . .} for all n ∈ N, we easily conclude that the summation is unconditional i.e., if σ is a permutation of N then xσ (1) , xσ (2) , . . . is summable, again with sum x. So here the situation is simpler than in the classical case. In the same non-Archimedean spirit we have the following. Theorem 2.1.3 (Completeness Criterion) A normed space is complete if and only if each sequence converging to 0 is summable. Proof. Left to the reader.
The completion of a normed space E is in a natural way again a normed space. We denote it by E ∧ . Theorem 2.1.4 Let E, F be normed spaces, let T : E−→F be a continuous linear map. Then T is Lipschitz and T extends uniquely to a continuous linear T ∧ : E ∧ −→F ∧ . Proof. By continuity of T at 0 there is a δ > 0 such that z ∈ E, z ≤ δ implies T (z) ≤ 1. Choose any ρ ∈ K, 0 < |ρ| < 1; we prove that T (x) − T (y) ≤ |ρ|−1 δ −1 x − y for all x, y ∈ E. To this end we may assume y = 0. Let x ∈ E, x = 0. There is an n ∈ Z such that |ρ|n x ≤ δ ≤ |ρ|n−1 x. From the first inequality we obtain T (ρ n x) ≤ 1, so by the second inequality, T (x) ≤ |ρ|−n ≤ |ρ|−1 δ −1 x. The rest of the proof is straightforward. For normed spaces E, F we will denote the collection of all continuous linear maps E−→F by L(E, F ). Under pointwise operations L(E, F ) is again a vector space, normed by the Lipschitz norm T −→ T := inf{M ≥ 0 : T (x) ≤ M x for all x ∈ E}. This infimum is in fact a minimum as we have T (x) ≤ T x for all x ∈ E. If G is a normed space, T ∈ L(E, F ), S ∈ L(F, G) then S ◦ T ∈ L(E, G) and
2.1 Basics
17
S ◦ T ≤ S T . As customary we denote the identity E−→E by I . Also, we will write L(E) for L(E, E) and E for L(E, K). (We tacitly assume that K is normed by its valuation.) E is called the dual space of E. By E F we mean that there is a linear isometrical bijection E−→F and we say that E is isometrically isomorphic to F . An embedding T : E−→F is a linear homeomorphism of E onto the image. If, in addition, T is surjective we say that E is linearly homeomorphic to F . Theorem 2.1.5 Let E, F be normed spaces. If F is a Banach space then so is L(E, F ). In particular, E is a Banach space.
Proof. Classical.
Let D be a closed subspace of a normed space E, let π : E−→E/D be the canonical map. Then the formula π(x) := dist (x, D)
(x ∈ E)
defines a norm on E/D, the so-called quotient norm. Its induced topology is the quotient topology (i.e., the strongest topology on E/D for which π is continuous). Unless explicitly stated otherwise, we always assume E/D to be equipped with the quotient norm. Clearly π ∈ L(E, E/D) and π ≤ 1. Let F be a normed space and let T ∈ L(E, F ) be such that D ⊂ Ker T . Then there is a unique map T1 : E/D−→F making the diagram E? ?? ?? ? T ??
π
F
/ E/D zz zz z z T z }z 1
commute. T1 ∈ L(E/D, F ) and T1 = T . We will say that F is a quotient of E (by D) if T1 is an isometrical bijection. Theorem 2.1.6 Let D be a closed subspace of a normed space E. Then we have the following: (i) If E is a Banach space then so is E/D. (ii) If D and E/D are Banach spaces then so is E. Proof. Although the proof is classical, (ii) may be less known, so for convenience we provide its proof. Let x1 , x2 , . . . be a Cauchy sequence in E. Then, with π as above, π (x1 ), π (x2 ), . . . is Cauchy in E/D, hence there exists a y ∈ E such that limn π(xn ) = π (y). Thus, dist (y − xn , D) → 0, i.e., there are d1 , d2 , . . . ∈ D such that y − xn − dn → 0. Therefore, d1 , d2 , . . . is Cauchy and so converges to some d ∈ D. It follows that x1 , x2 , . . . converges to y − d.
18
Normed spaces
Two norms on a vector space are called equivalent if they induce the same topology. Theorem 2.1.7 Two norms . 1 and . 2 on a vector space E are equivalent if and only if there exist positive constants c and C such that c x1 ≤ x2 ≤ C x1 for all x ∈ E. Proof. Apply 2.1.4 to the identity (E, . 1 )−→(E, . 2 ) and its inverse. The following lemma we need in 2.2.12, but its logical place seems to be here. Lemma 2.1.8 Let (E, . ) be a normed space, let D be a subspace of E. Suppose . is a norm on D such that c x ≤ x ≤ C x
(x ∈ D)
for some constants 0 < c ≤ C. Then . can be extended to a norm . on E such that c x ≤ x ≤ C x
(x ∈ E).
Proof. For x ∈ E set x := inf max(C x − d, d ). d∈D
(2.1)
We obtain (by taking d = 0 in (2.1)) x ≤ C x and, since for every d ∈ D max(C x − d, d ) ≥ max(c x − d, c d) ≥ c x, also x ≥ c x, so the required inequalities are established. Straightforward verification shows that . is a norm. Finally, let x ∈ D. Then (by taking d = x in (2.1)) we obtain x ≤ x . On the other hand, for each d ∈ D we have max(C x − d, d ) ≥ max(x − d , d ) ≥ x , showing that x ≥ x . Thus, . is an extension of . , which finishes the proof. In classical analysis one can normalize a non-zero vector x by taking x−1 x. In our case this is not possible, but one can hope for a λ ∈ K such that |λ| = x; then λ−1 x would have length 1. Unfortunately if |K| is strictly contained in [0, ∞) we can give counterexamples. It suffices to choose s ∈ [0, ∞) \ |K| and put on K the unorthodox norm λ → |λ| s. (A more natural example is Cp as a Qp -vector space with norm | . |p .) We have, however, the following. Theorem 2.1.9 Let (E, . ) be a normed space over a discretely valued field K. Then there is an equivalent norm . on E for which E ⊂ |K|.
2.1 Basics
19
Proof. For x ∈ E take x := max{|λ| : λ ∈ K, |λ| ≤ x}. One checks easily that . is a norm on E with values in |K| and |ρ| x ≤ x ≤ x, where ρ is a uniformizing element. Curiously, the analogue for densely valued base fields is unknown. Renorming problem Let (E, . ) be a normed space over a densely valued field K . Does there exist an equivalent norm . on E for which E ⊂ |K |? In many circumstances, however, it is “approximate normalizing” (for every non-zero x ∈ E there is a λ ∈ K such that λ x is close to 1; more precisely: E ⊂ |K|) that is important, rather than the exact version. As a case in point, for normed spaces E, F the norm T −→ T 0 := sup{T (x) : x ∈ BE } on L(E, F ) is equivalent, but not always equal to, the usual Lipschitz norm . ! Nevertheless, if E ⊂ |K| and F ⊂ |K| we have equality. We leave the easy proofs to the reader. Definition 2.1.10 A norm . on a vector space E is called solid if E ⊂ |K|. Using this terminology we arrive at the next immediate conclusions. Theorem 2.1.11 If the valuation of K is dense all norms are solid. For discretely valued K a norm . on a vector space E is solid if and only if E ⊂ |K|. Every norm is equivalent to a solid one. Notice that the quotient norm of a solid norm is solid, and that the Lipschitz norm on L(E, F ) is solid if the norms on E, F are. We will return to the subject of solidity in 3.1.1. The following lemma on one-dimensional spaces is obvious; we state it for reference. Lemma 2.1.12 Any norm on a one-dimensional space E = Kx (x ∈ E, x = 0) has the form λ x → |λ| C for some C > 0. E is complete. E is spherically complete if and only if K is spherically complete. Any linear map between one-dimensional normed spaces is continuous. The next statements are well-known. The proofs are classical. Theorem 2.1.13 (see also 3.4.26) Let E be a normed space. An element f ∈ E ∗ is continuous if and only if Ker f is closed.
20
Normed spaces
Proof. Let f ∈ E ∗ , f = 0 such that Ker f is closed. Let π : E−→E/Ker f be the canonical map. Then π is continuous. Let f1 : E/Ker f −→K be such that the diagram E? ?? ?? ? f ??
/ E/Ker f vv vv v vv f1 zv v
π
K
commutes. Now f1 is continuous by the above lemma. Hence so is f1 ◦ π = f . Theorem 2.1.14 (i) Each finite-dimensional normed space is complete. Each subspace is closed. (ii) Each linear map between finite-dimensional normed spaces is continuous. (iii) All norms on a finite-dimensional normed space are equivalent. Proof. (i). Completeness is shown by induction with respect to the dimension. In fact, 2.1.12 takes care of the one-dimensional case and 2.1.6(ii) of the induction step. Closedness of subspaces is now obvious. (ii). By (i) and 2.1.13 linear functionals are continuous. For the general case let T : E−→F be linear, where E, F are finite-dimensional normed spaces. Let y1 , . . . , ym be an algebraic base of T (E). Then there are f1 , . . . , fm ∈ E ∗ such that T (x) = f1 (x) y1 + · · · + fm (x) ym
(x ∈ E),
and the continuity of T follows. (iii). This is a consequence of the fact that linear bijections are continuous. A standard example is the space K n , where n ∈ N, equipped with the canonical norm (λ1 , . . . , λn ) → maxi≤i≤n |λi |. From 2.1.14(iii) we obtain the following. Corollary 2.1.15 Every finite-dimensional normed space E is linearly homeomorphic to K n , with n := dim E. We now introduce direct sums and products of normed spaces. Definition 2.1.16 Let I be an index set. For every i ∈ I let Ei be a normed space.
2.1 Basics
21
The normed product of the Ei is the vector space Ei : {xi : i ∈ I } is bounded (xi )i∈I ∈ i∈I
equipped with the norm (xi )i∈I −→ sup xi . i∈I
b
b
We denote this space by i∈I Ei , or i Ei . The normed direct sum of the Ei is the (normed) subspace of all (xi )i ∈ b that, for every ε > 0, {i ∈ I : xi ≥ ε} is finite. This space is i Ei such
denoted by i∈I Ei , or i Ei .
Clearly if all Ei are Banach spaces then so are bi Ei and i Ei . b
If I = {1, . . . , n} for some n ∈ N then i Ei and i Ei are identical. So
instead of bi Ei or i Ei we often write E1 × · · · × En . Note that E1 × · · · × En = K n when Ei = K for all i ∈ {1, . . . , n}. The classical Banach Open Mapping Theorem is derived from the Baire Category Theorem and scalar multiplication considerations, so there will be no problem in carrying over the proof to the non-Archimedean case. However, we can obtain slightly more. Theorem 2.1.17 (Banach’s Open Mapping Theorem) Let E, F be Banach spaces, let T ∈ L(E, F ) be surjective. Then T is an open mapping; more generally, for every ball B in E the image T (B) is clopen. The proof follows easily from the lemma below. Lemma 2.1.18 Let E, F be normed spaces, let T ∈ L(E, F ). Then we have the following: (i) If T is surjective and F is complete then T (BE ) is open. (ii) If E is complete and T (BE ) is open then T (BE ) = T (BE ). Proof. (i). Let λ1 , λ2 , . . . ∈ K, 0 < |λ1 | ≤ |λ2 | ≤ · · · , limn |λn | = ∞. From E = n∈N λn BE and surjectivity we obtain F = n∈N λn T (BE ) = n∈N λn T (BE ). By completeness of F and the Baire Category Theorem there is an n such that A := λn T (BE ) has a non-empty interior, so there is an x ∈ A and an r > 0 such that x + BF (0, r) ⊂ A. But, by the strong triangle inequality, BE is an additive group, hence so is A. Therefore, for each y ∈ A we have y + BF (0, r) = y − x + x + BF (0, r) ⊂ A + A + A ⊂ A; it follows that A is open. Then so is T (BE ) = λ−1 n A.
22
Normed spaces
(ii). As T (BE ) is an additive group, it suffices to prove the following. If BF (0, r) ⊂ T (BE ) for some r > 0 then BF (0, r) ⊂ T (BE ). To this end, let y ∈ BF (0, r), let ρ ∈ K, 0 < |ρ| < 1. Since y ∈ T (BE ) there is an x0 ∈ BE such that y − T (x0 ) < |ρ| r. Then ρ −1 (y − T (x0 )) < r and again there is an x1 ∈ BE such that ρ −1 (y − T (x0 )) − T (x1 ) < |ρ| r, i.e., y − T (x0 ) − T (ρ x1 ) < |ρ|2 r. Carrying on like this we inductively find x0 , x1 , . . . ∈ BE such that, for every n, (2.2) y − T (x0 + ρ x1 + ρ 2 x2 + · · · + ρ n xn ) < |ρ|n+1 r. n Now limn ρ n xn = 0, so by assumption x := ∞ n=0 ρ xn exists and x ∈ BE . From (2.2) and continuity of T we obtain T (x) = y, so y ∈ T (BE ) and we are done. We have the following three traditional results; we state them for reference, the proofs run as in the Archimedean case. Corollary 2.1.19 (i) A continuous linear bijection between Banach spaces is a homeomorphism. (ii) (Closed Graph Theorem) Let E, F be Banach spaces, let T : E−→F be a linear map whose graph is closed in E × F . Then T is continuous. Theorem 2.1.20 (Uniform Boundedness Principle) Let E be a Banach space, let F be a normed space. Let {Ti : i ∈ I } be a collection in L(E, F ) that is pointwise bounded, i.e., for every x ∈ E the set {Ti (x) : i ∈ I } is bounded. Then {Ti : i ∈ I } is uniformly bounded, i.e., supi Ti < ∞. Corollary 2.1.21 (Banach–Steinhaus Theorem) Let E, F be as in 2.1.20, let T1 , T2 , . . . be a sequence in L(E, F ) such that T (x) := limn Tn (x) exists for every x ∈ E. Then T ∈ L(E, F ).
2.2 Orthogonality We introduce a concept of orthogonality, valid in every normed space, and therefore sometimes called norm orthogonality. In Section 2.4 we shall study the possibility of form orthogonality, i.e., a notion derived from a bilinear or Hermitian form. Recall the isosceles triangle principle (Section 1.1) that in the normed case can be written as if x = y then x + y = max(x, y). The following simple consequence will be used frequently.
2.2 Orthogonality
23
Theorem 2.2.1 (Principle of van Rooij) Let t ∈ (0, 1], let x, y be elements of a normed space such that x + y ≥ t x. Then x + y ≥ t y. Proof. The statement is clear if x ≥ y. Now suppose x < y. Then, by the isosceles triangle principle, x + y = y ≥ t y. Definition 2.2.2 Let x, y ∈ E, where E is a normed space. We say that x is . -orthogonal to y, notation x ⊥ y, if dist (x, Ky) = x. We often omit the prefix “ . -”. So x ⊥ y means that the function λ → x − λ y (λ ∈ K) attains a minimum at 0. However, apart from trivial cases, this minimum is attained also at other points! Notice that dist (x, Ky) ≤ x holds for all vectors x, y, so the crucial point of 2.2.2 is that dist (x, Ky) ≥ x. Finally the natural interpretation of 2.2.2 in classical Hilbert space leads to the usual “form orthogonality”, as is easily seen. Theorem 2.2.3 (Symmetry) Let x, y be vectors in a normed space. Then x ⊥ y if and only if, for all λ, µ ∈ K, λ x + µ y = max(λ x, µ y).
(2.3)
Proof. Trivially λ x + µ y ≤ max(λ x, µ y), and also (2.3) holds for λ = 0. Now let x ⊥ y and λ = 0. Then λ x + µ y = |λ| x + λ−1 µ y ≥ |λ| x = λ x. By the Principle of van Rooij, λ x + µ y ≥ λ y and (2.3) is proved. Conversely, if (2.3) holds then, by taking λ := 1, x + µ y = max(x, µ y) ≥ x, so inf{x + µ y : µ ∈ K} ≥ x, whence x ⊥ y. So we have x ⊥ y if and only if y ⊥ x and we can use the expression “x and y are ( . -)orthogonal (to one another)”. Also, we have 0 ⊥ x for all x, x ⊥ x implies x = 0, and x ⊥ y implies λ x ⊥ µ y for all λ, µ ∈ K. Notice, however, that there are crucial differences with orthogonality in Hilbert space. For example, in K 2 with the canonical norm (λ1 , λ2 ) → max(|λ1 | , |λ2 |), choose the vectors e1 := (1, 0), e2 := (0, 1). Then e1 ⊥ e2 , e1 ⊥ e1 + e2 , e2 ⊥ e1 + e2 , but not e1 + e2 ⊥ e1 + e2 . Thus, {x ∈ K 2 : x ⊥ e1 + e2 } is not a vector space! The following definitions will not come as a surprise to the reader. Definition 2.2.4 Let E be a normed space. For two sets X1 , X2 ⊂ E we say that X1 and X2 are ( . -)orthogonal, notation X1 ⊥ X2 , if x1 ⊥ x2 for all x1 ∈ X1 , x2 ∈ X2 . For x ∈ E we write x ⊥ X2 instead of {x} ⊥ X2 .
24
Normed spaces
Now let D1 , D2 be subspaces of E. We say that D2 is an ( . -)orthogonal complement of D1 if D1 ⊥ D2 and E = D1 + D2 . A subspace D is called ( . -)orthocomplemented if it has an orthogonal complement. Clearly D1 ⊥ D2 implies D1 ∩ D2 = {0}, so the above sum D1 + D2 is direct. Notice that a subspace may have more than one orthogonal complement. In fact, in the above example K 2 the subspaces Ke2 and K(e1 + e2 ) are both orthogonal complements of Ke1 . If D1 , D2 are subspaces of E with E = D1 + D2 , then D1 and D2 are orthogonal complements of each other if and only if d1 + d2 = max(d1 , d2 ) for each d1 ∈ D1 , d2 ∈ D2 . Also, for x ∈ E we have x ⊥ D2 if and only if dist (x, D2 ) = x. Orthocomplemented subspaces are closed. (The converse is false, as we will see in 2.3.23.) Definition 2.2.5 Let E be a normed space. A linear map P : E−→E is called a projection if P 2 = P . It is an orthogonal projection, or ( . -) orthoprojection if, in addition, Ker P ⊥ Im P . Observe that every orthoprojection is automatically continuous and its norm is ≤ 1. More precisely, if P = 0 is a continuous projection then P is an orthoprojection if and only if P = 1. Now we relax the above notions. A subspace D of E is called complemented if there exists a continuous projection P ∈ L(E) (not necessarily an orthoprojection) with P (E) = D. Then D = Im P and D1 := Ker P are closed subspaces (such a D1 is called a complement of D) and E is the algebraic direct sum of D and D1 . Conversely, if E is a Banach space and D, D1 are closed subspaces such that the algebraic direct sum of them is E, then D is complemented and D1 is a complement of D. In fact, the norm d + d1 → max(d, d1 ) (d ∈ D, d1 ∈ D1 ) makes E into a Banach space as well as is greater than or equal to the original one on E. Now use 2.1.19(i) to see that the projection d + d1 → d is continuous. We will return to complementation in 3.4.27 and 3.4.28. Next, we extend the notion of orthogonality to more than two points. The vectors e1 , e2 , e1 + e2 from our previous example in K 2 are mutually orthogonal but the system {e1 , e2 , e1 + e2 } is linearly dependent and it would be silly to call this system “orthogonal”. Therefore, it seems natural to call a system of vectors orthogonal if each element is orthogonal to the linear span of the remaining vectors. To avoid annoying trivialities we shall exclude 0 from our orthogonal systems. Definition 2.2.6 A subset X of a normed space E, 0 ∈ X, is called an ( . -) orthogonal system (set) if for each x ∈ X we have x ⊥ [X \ {x}]. If, in addition, x = 1 for all x ∈ X, X is called an orthonormal system.
2.2 Orthogonality
25
Clearly X is an orthogonal system if and only if each finite subset of X is an orthogonal system; hence any orthogonal system is linearly independent. The following gives a practical test for orthogonality and ties in with formula (2.3) of 2.2.3. Theorem 2.2.7 Let e1 , . . . , en be distinct non-zero vectors of a normed space E. Then the following are equivalent: (α) {e1 , . . . , en } is an orthogonal system. (β) For all λ1 , . . . , λn ∈ K, λ1 e1 + · · · + λn en = max λi ei . 1≤i≤n
(γ ) For each j ∈ {1, . . . , n − 1}, ej +1 ⊥ [e1 , . . . , ej ]. Proof. Clearly (α) and (β) are equivalent and (α) =⇒ (γ ). To prove (γ ) =⇒ (β), notice that λ1 e1 + · · · + λn en ≥ λn en . This is a consequence of (γ ) if λn = 0, and trivial if λn = 0. By the Principle of van Rooij we have λ1 e1 + · · · + λn en ≥ λ1 e1 + · · · + λn−1 en−1 . Now again (γ ) can be used to arrive at λ1 e1 + · · · + λn−1 en−1 ≥ λn−1 en−1 . Continuing in this way we arrive after n steps at (β). Note When we are considering orthogonality of a set X ⊂ E \ {0} it is sometimes useful to “index” X by taking a set I with the same cardinality as X, a bijection i → ei of I onto X, and write X = (ei )i∈I . If I ⊂ N we sometimes are sloppy by talking about “orthogonal sequences”. This will be harmless as long as we define orthogonality of a sequence e1 , e2 , . . . of non-zero vectors as en ⊥ [em : m = n] for all n ∈ N: it then follows that e1 , e2 , . . . are mutually distinct. Remark 2.2.8 It is easily seen that if e1 , e2 , . . . is a sequence in a normed space such that, for n = m, en and em are in different cosets of K × then e1 , e2 , . . . is orthogonal. Contrary to the Hilbert space case, perturbing the vectors of an orthogonal system a little does not disturb orthogonality. Theorem 2.2.9 (Perturbation Lemma) Let (ei )i∈I be an orthogonal system in a normed space E. For each i ∈ I let ei ∈ E be such that ei − ei < ei . Then (ei )i∈I is also an orthogonal system.
26
Normed spaces
Proof. We may assume I = {1, . . . , n} for some n ∈ N. By the isosceles triangle principle we have ei = ei for each i. Now let λ1 , . . . , λn ∈ K, not all λi = 0. Write n n n λi ei = λi (ei − ei ) + λi ei . i=1
i=1
i=1
By assumption and 2.2.7
n
λi (ei − ei ) ≤ max |λi | ei − ei < max |λi | ei = 1≤i≤n
i=1
1≤i≤n
n
λi ei .
i=1
Again by the isosceles triangle principle
n
λi ei =
i=1
n
λi ei = max λi ei = max λi ei ,
i=1
1≤i≤n
1≤i≤n
and by 2.2.7 we obtain the orthogonality of (ei )i∈I .
Remark 2.2.10 An easy application of Zorn’s Lemma shows that every orthogonal system is contained in a maximal one. In [193], 5.4 it is proved that two maximal orthogonal systems in a normed space have the same cardinality, but we will not need it here. However, see 2.3.18. In several circumstances a less restrictive form of orthogonality is appropriate. Definition 2.2.11 A subset X of a normed space is called (an) “orthogonal” (system) if there is an equivalent norm for which X is orthogonal. We now prove that “orthogonality” is equivalent to a weak form of (β) of 2.2.7. Theorem 2.2.12 Let E be a normed space and let 0 ∈ X ⊂ E. Then the following are equivalent: (α) X is “orthogonal”. (β) There is a t ∈ (0, 1] such that, for all distinct e1 , . . . , en ∈ X and λ1 , . . . , λn ∈ K, n λi ei ≥ t max λi ei . i=1
1≤i≤n
Proof. (α) =⇒ (β). Let . be an equivalent norm for which X is orthogonal; let c, C be positive constants such that c . ≤ . ≤ C . . Then
n i=1
λi ei ≥ C −1
n
λi ei = C −1 max λi ei ≥ c C −1 max λi ei .
i=1
So (β) is established with t := c C −1 .
1≤i≤n
1≤i≤n
2.2 Orthogonality
27
(β) =⇒ (α). By linear independence every x ∈ [X] has a unique represen tation x = i∈J λi ei , where J ⊂ I is finite. Set x := maxi∈J λi ei . Then . is a norm on [X], x ≥ x ≥ t maxi∈J λi ei = t x and, since ei = ei for each i, X is orthogonal with respect to . . It suffices now to extend . to an equivalent norm on E, see 2.1.8. This leads to the following more quantitative notion. See 3.9.9, 3.9.10 for an extension to the locally convex case. Definition 2.2.13 Let E be a normed space, let t ∈ (0, 1]. A vector x ∈ E is t-orthogonal to y ∈ E (with respect to . ) if dist (x, Ky) ≥ t x. By the Principle of van Rooij, if x is t-orthogonal to y then λ x + µ y ≥ t max(λ x, µ y) for all λ, µ ∈ K, so t-orthogonality is symmetric. 1-orthogonality is what we called earlier orthogonality. The same goes for the next concept. Definition 2.2.14 Let t ∈ (0, 1], let X be a subset of a normed space E, 0 ∈ X. X is called a t-orthogonal system (set) (with respect to . ) if for each x ∈ X, y ∈ [X \ {x}], x is t-orthogonal to y. Clearly X is t-orthogonal if and only if each finite subset of X is t-orthogonal, if and only if for each n ∈ N, each distinct e1 , . . . , en ∈ X, and each λ1 , . . . , λn ∈ K, λ1 e1 + · · · + λn en ≥ t max λi ei . 1≤i≤n
Concluding we can say that X is “orthogonal” if and only if there is a t ∈ (0, 1] such that X is t-orthogonal. Remark 2.2.15 In contrast, the natural interpretation of (γ ) of 2.2.7, dist (ej +1 , [e1 , . . . , ej ]) ≥ t ej +1 for all j ∈ {1, . . . , n − 1} is not enough to conclude t-orthogonality. In fact, take E := K 3 with the canonical maximum norm and let ρ ∈ K, 0 < |ρ| < 1. Choose e1 := (1, 0, 0), e2 := (1, ρ, 0) and e3 := (0, 1, ρ). Then dist (e3 , [e1 , e2 ]) = dist (e2 , [e1 ]) = |ρ|. But e1 − e2 + ρ e3 = |ρ|2 < |ρ| = |ρ| max(e1 , e2 , ρ e3 ). We can easily prove the following.
28
Normed spaces
Theorem 2.2.16 Let e1 , . . . , en be distinct non-zero vectors in a normed space E. Let t2 , . . . , tn ∈ (0, 1] be such that dist (e2 , [e1 ]) ≥ t2 e2 , dist (e3 , [e1 , e2 ]) ≥ t3 e3 , .. . dist (en , [e1 , . . . , en−1 ]) ≥ tn en . Then {e1 , . . . , en } is t2 t3 · · · tn -orthogonal. Remark 2.2.17 Let {ei : i ∈ I } be an orthogonal system and let {λi : i ∈ I } ⊂ K × . Then {λi ei : i ∈ I } is also an orthogonal system. In particular, let ρ ∈ K, 0 < |ρ| < 1. Then we can choose λi ∈ K × such that |ρ| ≤ λi ei ≤ 1, for each i. We will often use this fact. Similar procedures can be carried out for t-orthogonal systems, where t ∈ (0, 1).
2.3 Spaces of countable type Recall that a topological space is called separable if it has a countable dense subset. Now let E be a normed space over K, E = {0} and suppose E is separable. Then its one-dimensional subspaces are homeomorphic to K, so K must be separable as well. Thus, for normed spaces the concept of separability is of no use if K is not separable. (Such K exist, see 4.2.7.) However, by “linearizing” the notion of separability we obtain a generalization, useful for every scalar field K. Definition 2.3.1 A normed space E is of countable type if it contains a countable set whose linear hull is dense in E. Clearly every separable normed space is of countable type. So, for example, (Cp , | . |p ) is of countable type, viewed as a normed space over any closed subfield of Cp . It is not hard to see that for separable K a normed space is of countable type if and only if it is separable. But also for non-separable K we have non-trivial examples such as finite-dimensional normed spaces. Now we give an infinite-dimensional example. Example 2.3.2 Standard space of countable type Let c0 be the vector space of all sequences (λ1 , λ2 , . . .) ∈ K N for which limn λn = 0, with coordinatewise operations and norm . ∞ : (λ1 , λ2 , . . .) −→ max |λn | . n∈N
2.3 Spaces of countable type
29
Clearly the linear span of the unit vectors (1, 0, 0, . . .), (0, 1, 0, 0, . . .), . . . is dense in c0 . Also, c0 is easily seen to be a Banach space. As for hereditary properties, it is straightforward to prove that finite products (compare with 2.5.15) and countable normed direct sums of spaces of countable type are of countable type. In this context, observe that the space c0 equals
n∈N Kn , where Kn = K for each n. Also, continuous linear images, in particular quotients by closed subspaces, of spaces of countable type are of countable type. The problem for subspaces is more subtle and will be solved in 2.3.14. The completion of a normed space of countable type is obviously of countable type. Somewhat less trivial is the following. Theorem 2.3.3 Let E be a normed space with a dense subspace D. Then E is of countable type if and only if D is of countable type. Proof. Suppose E is of countable type. Let X ⊂ E be countable, [X] dense in E. For each x ∈ X choose a countable subset Yx of D such that x ∈ Yx . Then Y := x∈X Yx is countable, lies in D and X ⊂ Y , so [Y ] = D, from which we deduce that D is of countable type. Remark 2.3.4 The reader will notice that the concept “of countable type” will be studied thoroughly in this book; we devote more attention to it than “separability” usually gets in classical text books. The reason is that in nonArchimedean theories spaces of countable type have nice properties concerning duality (Hahn–Banach Theorem, see Section 4.2) that other spaces may not have. Therefore, it is often important to know whether a given space is of countable type or not. The system {e1 , e2 , . . .} of unit vectors in c0 is clearly orthogonal. Further, for each (λ1 , λ2 , . . .) ∈ c0 the sequence λ1 e1 , λ2 e2 , . . . is summable and (λ1 , λ2 , . . .) = ∞ n=1 λn en . Hence c0 is not only of countable type, but even {e1 , e2 , . . .} is acting as a base in a “topological” sense. We now will study this feature in more detail. Definition 2.3.5 Let E be a normed space, let t ∈ (0, 1]. A sequence e1 , e2 , . . . in E is called a t-orthogonal base (of E) if {e1 , e2 , . . .} is t-orthogonal and every x ∈ E has an expansion x = ∞ n=1 λn en , where λn ∈ K. The base e1 , e2 , . . . is orthogonal if t = 1, orthonormal if, in addition, en = 1 for all n ∈ N.
30
Normed spaces
By continuity of the norm, for x ∈ E as above we have limn λn en = 0 and x = lim m
m
λn en ≥ t lim max λn en = t max λn en , m 1≤n≤m
n=1
n∈N
so the expansion of x is unique: if also x = ∞ n=1 µn en for certain µn ∈ K then ∞ 0 = n=1 (λn − µn ) en , so that t maxn∈N (λn − µn ) en = 0, i.e., λn = µn for all n. Note In the spirit of the Note following 2.2.7 we will speak about torthogonality of indexed systems (ei )i∈I and t-orthogonal sequences. Clearly the unit vectors form an orthonormal base of c0 . Any space with some t-orthogonal base is of countable type. For the converse we first prove a useful test to decide whether a t-orthogonal sequence is a base. Theorem 2.3.6 Let t ∈ (0, 1], let e1 , e2 , . . . be a t-orthogonal sequence in a normed space E. If [e1 , e2 , . . .] is dense in E then e1 , e2 , . . . is a t-orthogonal base of E. Proof. We may assume that E is a Banach space. Let ρ ∈ K, 0 < |ρ| < 1. By suitable scalar multiplication we may assume that |ρ| ≤ en ≤ 1 for all n. Now let (λ1 , λ2 , . . .) ∈ c0 . Then limn λn en = 0, so by completeness ∞ n=1 λn en exists in E. The formula T : (λ1 , λ2 , . . .) −→
∞
λn en
n=1
defines a linear map T : c0 −→E for which T (c0 ) is dense in E. But also, for x = (λ1 , λ2 , . . .) ∈ c0 , T (x) =
∞
λn en ≤ max λn en ≤ max |λn | = x n∈N
n=1
n∈N
and, by t-orthogonality, T (x) =
∞ n=1
λn en ≥ t max λn en ≥ t |ρ| max |λn | = t |ρ| x, n∈N
n∈N
so that T is a homeomorphism. Thus, T (c0 ) is complete, hence closed in E, and dense, so T is surjective, which proves the theorem. Now we are ready to prove the main theorem of this section. Theorem 2.3.7 Let E be a normed space of countable type. Then, for each t ∈ (0, 1), E has a t-orthogonal base.
2.3 Spaces of countable type
31
Proof. For convenience we assume that E is infinite-dimensional. (For finitedimensional spaces the inductive construction below breaks off.) There are linearly independent x1 , x2 , . . . ∈ E such that [x1 , x2 , . . .] is dense in E. Set Dn := [x1 , . . . , xn ] for n ∈ N. There are t2 , t3 , . . . ∈ (0, 1) such that ∞ n=2 tn exists and is ≥ t. For each n ≥ 2 the distance of xn to Dn−1 is positive since Dn is closed (2.1.14(i)) and xn ∈ Dn−1 , therefore there is a dn−1 ∈ Dn−1 such that tn xn − dn−1 ≤ dist (xn , Dn−1 ). Now choose e1 := x1 , en := xn − dn−1 for each n ≥ 2. We claim that e1 , e2 , . . . is a t-orthogonal base of E. In fact, for each n we have Dn = [e1 , . . . , en ], so [e1 , e2 , . . .] is dense in E, and for n ≥ 2 dist(en , Dn−1 ) = dist(xn , Dn−1 ) ≥ tn xn − dn−1 = tn en . So by 2.2.16 {e1 , · · · , en } is t2 · · · tn -orthogonal, hence t-orthogonal. From this we get t-orthogonality of e1 , e2 , . . . and the theorem is proved after applying 2.3.6. Remark 2.3.8 For a discussion on what happens for the case t = 1, see 2.3.25 and 2.3.26. Corollary 2.3.9 Each normed space of countable type is linearly homeomorphic to a subspace of c0 . Each infinite-dimensional Banach space of countable type is linearly homeomorphic to c0 . Proof. We only prove the second assertion. Let t ∈ (0, 1), let e1 , e2 , . . . be a t-orthogonal base of a Banach space E of countable type, and let ρ ∈ K, 0 < |ρ| < 1. Without loss, assume |ρ| ≤ en ≤ 1 for all n. Now take the map T : c0 −→E of the proof of 2.3.6. This result shows that, up to linear homeomorphisms, there exists, for given K, only one infinite-dimensional Banach space of countable type, viz. c0 . This is in contrast to the Archimedean theory, where there exist separable Banach spaces without a Schauder base, [51], and where Banach spaces having Schauder bases (see below for this concept) may not be linearly homeomorphic (e.g. 1 and 2 ). Because we will need them later on, we now introduce two other concepts of “base”. Definition 2.3.10 Let E be a normed space, let e1 , e2 , . . . be a sequence in E of non-zero vectors. It is called a (topological) base if for every x ∈ E there exist unique λ1 , λ2 , . . . ∈ K such that x = ∞ n=1 λn en , a Schauder base if, in addition, the coefficient functionals x → λn (n ∈ N) are continuous. Clearly every space with a base is of countable type and every t-orthogonal base is Schauder.
32
Normed spaces
Theorem 2.3.11 In a Banach space, each base is Schauder, each Schauder base is t-orthogonal for some t ∈ (0, 1]. Proof. Let e1 , e2 , . . . be a base of a Banach space (E, . ). It is enough to prove it to be t-orthogonal for some t ∈ (0, 1]. For every x = ∞ n=1 λn en ∈ E we have limn λn en = 0, so x1 := maxn∈N λn en exists. . 1 is a norm ≥ . , and by using completeness of E it is not difficult to see that (E, . 1 ) is also complete. But then . 1 and . are equivalent by 2.1.19(i), so there is a C ≥ 1 with . 1 ≤ C . . Hence, for x = ∞ n=1 λn en ∈ E we have x ≥ C −1 x1 = C −1 max λn en , n∈N
which proves C
−1
-orthogonality.
Remarks 2.3.12 (a) There are non-complete normed spaces with bases that are not Schauder. In fact, let K ⊃ Qp for some prime number p, let E be the vector space of all polynomial functions of Zp to K equipped with the canonical supremum norm. Consider the sequence e1 , e2 , . . . in E given by en (x) := x n−1 (x ∈ Zp ). Clearly e1 , e2 , . . . is an algebraic base of E. Also, for each f ∈ E its expansion f = ∞ n=1 λn en is unique. So e1 , e2 , . . . is a base of E. But the associated second coefficient functional f → f (0) is not continuous (where f (0) is the derivative of f at 0, defined in the usual way, see (x ∈ Subsection 2.5.7). In fact, f1 , f2 , . . . given by fn (x) := x(x−1)···(x−n+1) n! Zp ) is a bounded sequence in E for which f1 (0), f2 (0), . . . is unbounded in K. (b) There are non-complete normed spaces with Schauder bases that are torthogonal for no t ∈ (0, 1]. In fact, let ρ ∈ K, 0 < |ρ| < 1 and let E be the linear hull of the unit vectors of c0 , with the norm induced by the supremum one of c0 . Set en := (1, ρ, ρ 2 , . . . , ρ n−1 , 0, 0, . . .) (n ∈ N). It is easily seen that this sequence is a Schauder (algebraic) base of E that satisfies the required conditions. The next result on spaces of countable type may also be surprising. Theorem 2.3.13 Let E be a Banach space of countable type. Then each closed subspace D of E is complemented. In fact, for every ε > 0 there exists a continuous projection P ∈ L(E) onto D with P ≤ 1 + ε. Proof. Let π : E−→E/D be the canonical map; it suffices to construct a T ∈ L(E/D, E) with T ≤ 1 + ε and for which π ◦ T is the identity on E/D. (Then take P := I − T ◦ π.) To this end, let t := (1 + ε)−1/2 and let z1 , z2 , . . . be a t-orthogonal base of E/D (2.3.7). There are e1 , e2 , . . . ∈ E
2.3 Spaces of countable type
33
with π (en ) = zn , en ≤ t −1 zn for each n. For z = ∞ n=1 λn zn ∈ E/D set ∞ T (z) := n=1 λn en . (Since limn λn en = 0 and E is complete the latter sum exists.) Clearly T is linear, π (T (z)) = z for all z ∈ E/D, and T (z) = =t
∞
λn en ≤ max λn en ≤ t −1 max λn zn ≤ t −2
n=1 −2
n∈N
n∈N
∞
λn zn
n=1
z = (1 + ε) z,
hence T ≤ 1 + ε.
This leads to a result for which we do not know a more direct proof. Corollary 2.3.14 If a normed space is of countable type then so are its subspaces. Proof. Let D be a subspace of a normed space E of countable type. Then E ∧ is of countable type, so we may assume that E is Banach. By 2.3.13 there is a continuous projection P ∈ L(E) onto D, hence D = P (E) is of countable type, then so is D (2.3.3). Corollary 2.3.15 If D is a closed subspace of a normed space E, then E is of countable type if and only if D and E/D are of countable type. Proof. Left to the reader.
Problem Let E be a non-complete normed space of countable type. Is every closed subspace D of E complemented? For countable systems we formulate an extension of the Perturbation Lemma 2.2.9. Theorem 2.3.16 (Full Perturbation Lemma) Let e1 , e2 , . . . be non-zero vectors in a normed space E, t-orthogonal for some t ∈ (0, 1]. Let e1 , e2 , . . . ∈ E. Then we have the following: (i) If en − en < t en for each n ∈ N then e1 , e2 , . . . is also t-orthogonal. (ii) If e1 , e2 , . . . form a t-orthogonal base of E and, for all n ∈ N, en − en < s t en for some s, 0 < s < 1 then e1 , e2 , . . . is again a t-orthogonal base of E. Proof. (i). The proof of the Perturbation Lemma 2.2.9 applies with obvious modifications. (ii). By 2.3.6, e1 , e2 , . . . is also a t-orthogonal base of E ∧ , so it suffices to show that [e1 , e2 , . . .] is dense in E ∧ . (Then it is dense in E and we apply (i) and again 2.3.6.) Thus, it is enough to prove (ii) for Banach spaces E.
34
Normed spaces
Let x ∈ E have expansion ∞ n=1 λn en . Then λn en = λn en → 0, so y := ∞ n=1 λn en exists and x − y ≤ s t maxn∈N λn en ≤ s x. So, with D := [e1 , e2 , . . .], we have dist (x, D) ≤ s x for all x ∈ E. It follows easily that x ∈ D, i.e., E = D. Next we prove that t-orthogonal systems in spaces of countable type are at most countable. To this end, a lemma. Lemma 2.3.17 Let E be a normed space of countable type. Let X ⊂ E be such that [X] = E. Then there is a countable Y ⊂ X with [Y ] = E. Proof. We first prove that for every x ∈ E there is a countable Yx ⊂ X with x ∈ [Yx ]. In fact, there are x1 , x2 , . . . ∈ [X] with x − xn < n1 for each n. There are also finite sets F1 , F2 , . . . ⊂ X such that xn ∈ [Fn ] for each n. Set Yx := n∈N Fn . Then Yx is countable and x1 , x2 , . . . ∈ [Yx ]. Hence x ∈ [Yx ]. Now let e1 , e2 , . . . ∈ E be such that [e1 , e2 , . . .] = E. By the first part of the proof there are countable sets Y1 , Y2 , . . . ⊂ X with en ∈ [Yn ] for each n. Set Y := n∈N Yn . Then Y is countable, [Y ] contains e1 , e2 , . . . , so [Y ] = E. Theorem 2.3.18 Every t-orthogonal system in a normed space of countable type is countable. Proof. Let (ei )i∈I be a t-orthogonal system. Then D := [ei : i ∈ I ] is by 2.3.14 of countable type. By the lemma above there is a countable J ⊂ I such that D = [ej : j ∈ J ]. If I were uncountable there would be an i ∈ I , i ∈ J . By t-orthogonality we would have ei ∈ [ej : j ∈ J ] = D, a contradiction. Now we shall study spaces with an orthogonal base. Lemma 2.3.19 Let E be a normed space with an orthogonal base e1 , e2 , . . .. Then each one-dimensional subspace has an orthogonal complement. Proof. Let x ∈ E, x = 0 has expansion x = ∞ n=1 λn en . Then there is an m ∈ N with x = λm em . Let D be the closed linear span of {en : n = m}. Then each d ∈ D has an expansion ∞ n=1 µn en , where µm = 0. We see that x − d ≥ x, so x ⊥ D. Also, Kx + D = Kem + D = E, so D is an orthogonal complement of Kx. Lemma 2.3.20 Let E be a normed space with the property that every onedimensional subspace has an orthogonal complement. Then every finitedimensional subspace has an orthogonal complement. Proof. We prove the following. Let D be an orthocomplemented subspace, let D1 := D + Kx for some x ∈ E, x ∈ D. Then D1 is orthocomplemented. In fact, since D is orthocomplemented there is an orthogonal projection P of E
2.3 Spaces of countable type
35
onto D. Choose a non-zero d ∈ D1 with P (d) = 0. (Then D1 = D + Kd.) By assumption there is an orthogonal projection Q of E onto Kd. One verifies directly that P + Q − Q ◦ P is an orthogonal projection of E onto D1 . Corollary 2.3.21 Let E be a finite-dimensional normed space with an orthogonal base. Then every subspace has an orthogonal base and is orthocomplemented. Theorem 2.3.22 Let E be a normed space with an orthogonal base e1 , e2 , . . . . Then every subspace has an orthogonal base. Proof. Let D be a subspace of E. For convenience we assume that D is infinite-dimensional (if not the process below stops after finitely many steps). D is of countable type (2.3.14), so there are subspaces D1 ⊂ D2 ⊂ · · · with dim Dn = n for each n and n∈N Dn dense in D. Choose d1 ∈ D1 , d1 = 0. By the above lemmas, for each n > 1, Dn−1 is orthocomplemented in Dn , so we can find a dn ∈ Dn , dn = 0 with dn ⊥ Dn−1 . Then by 2.2.7, d1 , d2 , . . . is orthogonal and, since Dn = [d1 , . . . , dn ], their linear span is dense in D, so it is an orthogonal base of D, by 2.3.6. Remark 2.3.23 In the above theorem we cannot conclude, as we did in 2.3.21, that every closed subspace of E is orthocomplemented. As an example, let K have a dense valuation, choose ρ1 , ρ2 , . . . ∈ BK− with limn |ρn | = 1. Let E := c0 and let f ∈ E be defined by f (x) :=
∞
λn ρ n
(x = (λ1 , λ2 , . . .) ∈ E).
n=1
One can easily check that f = 1 and |f (x)| < x for all x ∈ E, x = 0. Take D := Ker f . Suppose there is an x ⊥ D, x = 0. Then, for each d ∈ D, |f (x + d)| |f (x + d)| |f (x)| ≥ = , x max(x, d) x + d so
|f (x)| x
≥ f = 1, a contradiction.
Spherical completeness enters the picture when we ask the question whether every space of countable type has an orthogonal base. First a lemma. Lemma 2.3.24 Let E1 , E2 be spherically complete Banach spaces. Then so is E1 × E2 . Proof. Straightforward (each nested sequence of balls in E1 × E2 induces naturally nested sequences of balls in E1 and E2 ).
36
Normed spaces
Theorem 2.3.25 Let K be spherically complete. Then each normed space of countable type has an orthogonal base. Proof. Again assume that the space E is infinite-dimensional. Then there are subspaces D1 ⊂ D2 ⊂ · · · of E with dim Dn = n for each n and n∈N Dn dense in E. Choose e1 ∈ D1 , e1 = 0. Then Ke1 is spherically complete (2.1.12), so by 1.1.6 there is an e2 ∈ D2 , e2 ∈ D1 , e2 ⊥ Ke1 . Then D2 is isometrically isomorphic to Ke1 × Ke2 , hence spherically complete by the previous lemma, so there is an e3 ∈ D3 , e3 ∈ D2 , e3 ⊥ D2 , etc. The sequence e1 , e2 , . . . is orthogonal by 2.2.7. Further, [e1 , e2 , . . .] is dense, so by 2.3.6 it is an orthogonal base. For non-spherically complete K the above conclusion is not true. In fact, we proceed to construct a two-dimensional space over K without orthogonal base! Example 2.3.26 Let K be not spherically complete. Then there is a norm ν on K 2 such that ν(x) ∈ |K| for all x ∈ K 2 and such that there is no ν-orthogonal base. Proof. Let B1 ⊃ B2 ⊃ · · · be balls in K with empty intersection. Choose λn ∈ Bn for each n ∈ N and define ν(α1 , α2 ) := lim |α1 − α2 λn | . n
To show that this limit exists, assume α2 = 0. Then there is an m ∈ N such that α1 α2−1 ∈ Bn for n ≥ m, so α1 α2−1 − λn = dist (α1 α2−1 , Bn ) is a non-zero constant for n ≥ m (see Section 1.1, property 5 of ultrametrics). So ν is welldefined and ν(α1 , α2 ) = 0 if and only if α1 = α2 = 0. The other requirements for a norm are clear. To see that there is no ν-orthogonal base it suffices by 2.3.21 to show that the linear hull of e1 := (1, 0) has no orthogonal complement, i.e., that x is ν-orthogonal to e1 for no x except 0. Without loss, take x = (α, 1), α ∈ K. There is an m ∈ N with α ∈ Bm , so ν(x) = lim |α − λn | = |α − λm | > |λn − λm | n
for all n > m (since λn ∈ Bm , α ∈ Bm ), which again is ≥ limn dist (λm , Bn ) = ν(λm , 1) = ν(x − (α − λm ) e1 ). Thus, there is a β ∈ K (viz. β = α − λm ) such that ν(x − β e1 ) < ν(x), so x is not ν-orthogonal to e1 . Note The above space – which we call Kν2 from now on – will be used in the sequel to obtain (counter)examples. Remark 2.3.27 Let K be not spherically complete. A much shorter way (but using the spherical completion K ∨ of Section 1.2) to obtain a two-dimensional space without orthogonal base is the following.
2.4 The absence of Hilbert space
37
∨ Take × λ ∈ K , λ = 0. Let us prove that λ is not orthogonal to K. Since K = |K| we may assume |λ| = 1. As the residue class fields of K and K ∨ are isomorphic there is a µ ∈ K such that |λ − µ.1| < 1, and we are done. Hence no two-dimensional subspace of K ∨ containing K has an orthogonal base.
One could ask if perhaps quotients of spaces with an orthogonal base have an orthogonal base. Thanks to 2.3.25 the answer is positive if K is spherically complete. However, for any non-spherically complete scalar field K we have a counterexample. It suffices to take E := Kν2 in the following. Theorem 2.3.28 Every Banach space E of countable type with solid norm is a quotient of c0 . Proof. Let 0 < t1 < t2 < · · · , limm tm = 1. Let m ∈ N. By 2.3.7 E has a tm orthogonal base {amn : n ∈ M}, where M = N if E is infinite-dimensional, otherwise M = {1, . . . , dim E}. By solidity of the norm we may assume tm ≤ amn ≤ 1 for all n ∈ M. Now let σ be a bijection N−→N × M, and define T : c0 −→E by (λ1 , λ2 , . . .) −→
∞
λn aσ (n) .
n=1
Clearly T is well-defined, linear and T ≤ 1. To see that T makes E into a quotient of c0 (by Ker T ), let z ∈ E, ε > 0; we produce an x ∈ c0 with T (x) = z and x∞ ≤ (1 + ε) z. Choose m ∈ N be such that tm ≥ (1 + ε)−1/2 . Then z= ∞ λ a , λ ∈ K. Denoting the unit vectors of c0 by e1 , e2 , . . ., set n=1 n mn n x := ∞ n=1 λn eσ −1 ((m,n)) . Then clearly T (x) = z and z ≥ tm max λn amn ≥ tm2 max |λn | = tm2 x∞ . n∈N
n∈N
Hence, x∞ ≤ tm−2 z ≤ (1 + ε) z.
2.4 The absence of Hilbert space In Section 2.2 we have studied “norm” orthogonality. In this section we follow the more classical path of deriving orthogonality from an inner product. Unfortunately this approach will not lead to spaces over K deserving the name “Hilbert space” (2.4.5). Because Hilbert space plays a dominant role in classical Functional Analysis, it is worth the trouble to check in detail what goes wrong in the non-Archimedean setting.
38
Normed spaces
In this section we assume that we have an isometrical map λ → λ∗ in K that is either the identity or a field automorphism of order 2. Then K H := {λ ∈ K : λ = λ∗ } is a closed subfield. Definition 2.4.1 Let E be a vector space. An inner product is a map assigning to every ordered pair (x, y) ∈ E × E an element < x, y > of K such that: (i) < x, x > = 0 whenever x = 0 (definiteness), (ii) < x, y > = < y, x >∗ for all x, y ∈ E (antisymmetry), (iii) x → < x, y > is linear for each y ∈ E. Note “Positivity” has no meaning in K, so the classical condition of positive definiteness has been replaced by (i). This may seem rather arbitrary, but it is not. In fact, if we assume the axioms (i), (ii), (iii) in the complex case (reading ∗ as complex conjugation) then an easy exercise shows that either < , > or − < , > is positive definite. With this in mind the appearance of the absolute value signs in the definition of the associated norm x −→ x := |< x, x >| (x ∈ E) (see 2.4.2) becomes quite natural. For a subset X of E we set X⊥ := {y ∈ E : < y, x > = 0 for all x ∈ X}. Clearly for subspaces D of E we have D ∩ D⊥ = {0}. If x1 , x2 , . . . is a linearly independent sequence of vectors then the usual Gram-Schmidt procedure < xn , ei > < x2 , e1 > e1 , . . . , en := xn − ei , . . . < e1 , e1 > < e i , ei > i=1 n−1
e1 := x1 , e2 := x2 −
leads to a sequence e1 , e2 , . . . that is “form orthogonal”, i.e., < en , em > = 0 whenever n = m, and for which [e1 , . . . , en ] = [x1 , . . . , xn ] for each n. The next theorem looks promising. Theorem 2.4.2 Let E be a vector space with inner product < , >. Suppose that |2| = 1 (i.e., the characteristic of the residue class field is = 2). Then for all x, y ∈ E we have the following: (i) |< x, y >|2 ≤ |< x, x > < y, y >| (Cauchy–Schwarz inequality). (ii) . is a norm on E. (iii) If < x, y > = 0 then x + y = max(x, y) (form orthogonality implies norm orthogonality).
2.4 The absence of Hilbert space
39
Proof. We first prove < x, y > = 0 =⇒ |< x + y, x + y >| ≥ |< y, y >| .
(2.4)
To this end we may suppose x = 0, y = 0. Put µ := < x, x > < y, y >−1 . Then µ ∈ K H . We have to show that |1 + µ| ≥ 1. Suppose not. Then |1 + µ| < 1 and |µ| = 1. Define a sequence λ1 , λ2 , . . . ∈ K H by λ1 := µ, λn+1 := λn + 12 (λ2n + µ) for n ≥ 1. Inductively one proves |λn | ≤ 1, |1 + λn | ≤ |1 + µ| for all n, |λn+1 − λn | ≤ |1 + µ| |λn − λn−1 | for all n ≥ 2. It follows that λn+1 − λn → 0, so λ1 , λ2 , . . . converges to a λ ∈ K H . Then λ = limn λn+1 = limn (λn + 12 (λ2n + µ)) = λ + 12 (λ2 + µ), so λ2 + µ = 0. But on the other hand 0 = < x + λ y, x + λ y > = < x, x > +λ2 < y, y > = < y, y > (µ + λ2 ) = 0, a contradiction, proving (2.4). To prove (i) we may assume x = 0, y = 0. Write y = z + u, where z = y− < y, x > < x, x >−1 x, and u = < y, x > < x, x >−1 x. Then < z, u > = 0, so by (2.4) we have |< z + u, z + u >| ≥ |< u, u >| yielding (i) after substitution. For (ii) we only need to check the strong triangle inequality. Now x + y2 = |< x + y, x + y >| ≤ max(|< x, x >| , |< x, y >| , |< y, x >| , |< y, y >|). By (i) this is ≤ max(x2 , x y, y2 ) = max(x, y)2 , and we have (ii). Finally, to prove (iii), let < x, y > = 0. From (2.4) we obtain x + y2 ≥ y2 . By symmetry x + y ≥ max(x, y). Then use (ii) to arrive at (iii). Corollary 2.4.3 < , > is continuous with respect to the associated norm. Proof. Just observe that by 2.4.2(i) we have |< x, y >| ≤ x y for all x, y ∈ E. The next two “experiments” may have already crossed the reader’s mind: 1. Let K := Qp (p = 2). For x := (λ1 , λ2 , . . .) ∈ c0 and y := (µ1 , µ2 , . . .) ∈ c0 , set < x, y > :=
∞
λn µn .
n=1
of Qp is the (As Q is dense in Qp the only continuous field automorphism 1/2 n is summable (−X) identity.) The formal series (1 − X)1/2 = ∞ n=0 n 1/2 n 2 ∈ Q and α = 1 − p (for details (−p) for X = p, so α := ∞ p n=0 n see [195], Section 47). Now set y := (λ1 , . . . , λp , 0, 0, . . .), where λi = 1
40
Normed spaces
if 1 ≤ i ≤ p − 1, and λp = α. Then < y, y > = 0, so < , > has isotrope vectors and therefore is not an inner product. 2 2 2. Let 2 := {(λ1 , λ2 , . . .) ∈ K N : ∞ n=1 |λn | < ∞}. Then is a vector space but (λ1 , λ2 , . . .) −→ (
∞
|λn |2 )1/2
n=1
is an A-norm (see 2.1.2) that does not satisfy the strong triangle inequality and therefore is not associated to any inner product. Now we consider a true inner product in infinite-dimensional space. Example 2.4.4 Let K be such that (∗) λ21 + · · · + λ2n = max(|λ1 |2 , . . . , |λn |2 ) for all λ1 , . . . , λn ∈ K, n ∈ N. Then obviously the formula < x, y > :=
∞
λn µ n
(x = (λ1 , λ2 , . . .), y = (µ1 , µ2 , . . .))
n=1
an inner product on c0 (where λ∗ = λ for all λ ∈ K) with |< x, x >| = defines ∞ λ2 = maxn∈N |λn |2 = x2 . n=1
n
∞
To see that there exists a K with property (*), let K := R((X)) be the field of formal Laurent series in X over R (see Chapter 1 of [193] for details) with the valuation | . | given by |0| := 0 and for f = n∈Z an Xn = 0, an ∈ R, |f | := 2−j ,
where j := min{n : an = 0}. Then K is a complete non-Archimedean valued field and since a sum of squares in R is 0 only if all summands are, K has property (*). Now let us call a vector space E with an inner product Hilbert-like if E is a Banach space for the associated norm and such that for each closed subspace D of E we have D + D ⊥ = E. Here is the announced negative result. Theorem 2.4.5 Let |2| = 1. Then there do not exist infinite-dimensional Hilbert-like spaces over K. Proof. Let E be an infinite-dimensional Hilbert-like space; we derive a contradiction. The Gram–Schmidt process described earlier yields the existence of a sequence e1 , e2 , . . . of non-zero vectors that are form orthogonal. By suitable scalar multiplication we may assume that |ρ| ≤ en ≤ 1 for all n, where
2.5 Examples of Banach spaces
41
ρ ∈ K, 0 < |ρ| < 1. We may, after the observation that closed subspaces of Hilbert-like spaces are Hilbert-like, therefore assume that [e1 , e2 , . . .] is dense in E. Now by 2.4.2(iii) e1 , e2 , . . . is an orthogonal sequence in the sense of the norm (2.2) and by 2.3.6 is an orthogonal base of E. Hence every x ∈ E has a unique expansion x = ∞ n=1 λn en , where λn ∈ K, λn en → 0, i.e., λn → 0. Let ∞ ∞ D := λn en ∈ E : λn = 0 . n=1
n=1
Then D is a closed subspace, D = E. Let y ∈ D ⊥ ; we prove that y = 0 arriving at the desired contradiction. In fact, let y have expansion ∞ n=1 µn en . For each m, n ∈ N we have em − en ∈ D, so that µm < em , em > = < y, em > = < y, en >= µn < en , en >. But, since limn µn = 0 and n → < en , en > is bounded, we have limn µn < en , en > = 0, implying µn = 0 for all n. Hence y = 0. Remarks 2.4.6 (a) The restriction that |2| = 1 made above is not necessary. See [97], Remark 35. (b) Finite-dimensional Hilbert-like spaces are less interesting from an analytic point of view as any finite-dimensional space with an inner product is Hilbert-like. It depends on algebraic properties of K whether or not such inner products on K n exist.
2.5 Examples of Banach spaces Before starting we need one more technicality on summation of more than countably many vectors. Let E be a normed space, let I be a set, and let for each i ∈ I an element xi ∈ E be given. We say that the family (xi )i∈I is summable with sum x ∈ E if for every ε > 0 there is a finite set J0 ⊂ I such that, for all finite J with J0 ⊂ J ⊂ I , we have x − i∈J xi < ε. We then write x = i∈I xi . The proofs of the following statements are straightforward and left to reader. Theorem 2.5.1 Let E be a normed space. Let (xi )i∈I be a family of elements of E. Then we have the following: (i) For I = N summability as defined above coincides with the one of Section 2.1.
42
Normed spaces
(ii) (xi )i∈I has at most one sum. If it has one then limi xi = 0 i.e., for every ε > 0 the set {i ∈ I : xi ≥ ε} is finite. Conversely, if E is a Banach space and limi xi = 0 then (xi )i∈I is summable. (iii) If (xi )i∈I is summable then there is a countable set J := {i1 , i2 , . . .} ⊂ I such that xi = 0 if i ∈ I \ J , and i∈I xi = ∞ n=1 xin . With the above machinery it is not hard to extend the notion of t-orthogonal base to this more general situation and extend the Perturbation Lemma 2.3.16 accordingly. We will not bore the reader with the details.
2.5.1 The space c0 (I)
For a set I let c0 (I ) := i∈I Ki , where Ki = K for all i ∈ I . In other words, c0 (I ) is the set of all (λi )i∈I ∈ K I for which limi λi = 0. It is a Banach space under pointwise operations and (solid) norm . ∞ given by (λi )i∈I −→ max |λi | . i∈I
For I = {1, . . . , n}, where n ∈ N, c0 (I ) is nothing but K n introduced before 2.1.15; the space c0 (N) has been called c0 earlier. For each i ∈ I we have the “ith unit vector” ei ∈ c0 (I ), given by ei := ξ{i} . The linear hull of {ei : i ∈ I } is denoted by c00 (I ); instead of c00 (N) we write c00 . Clearly the (ei )i∈I form an orthonormal base of c0 (I ) in the sense just suggested. Obviously every Banach space with an orthonormal base is isometrically isomorphic to c0 (I ) for some I . Also, every Banach space with a t-orthogonal base for certain t ∈ (0, 1], is linearly homeomorphic to some c0 (I ). We have the following generalizations of 2.3.6 and 2.3.19 respectively. Theorem 2.5.2 Let t ∈ (0, 1], let (ei )i∈I be a t-orthogonal system in a normed space E. If [ei : i ∈ I ] is dense in E then (ei )i∈I is a t-orthogonal base of E. Proof. In the proof of 2.3.6, replace c0 by c0 (I ).
Theorem 2.5.3 Let E be a normed space with an orthogonal base. Then each finite-dimensional subspace has an orthogonal complement. Proof. For one-dimensional subspaces the proof is a simple adaptation of the one given for 2.3.19. Now use 2.3.20. As an application of 2.5.2 we have the following. Theorem 2.5.4 Let E be a Banach space with a solid norm over a discretely valued field K. Then E is isometrically isomorphic to c0 (I ) for some I . Each
2.5 Examples of Banach spaces
43
maximal orthogonal system in E is an orthogonal base. Every closed subspace of E has an orthogonal complement. Proof. We first prove the second assertion. Let {ei : i ∈ I } be a maximal orthogonal system in E, let D := [ei : i ∈ I ]. By 2.5.2 it suffices to show that D = E. Suppose x ∈ E, x ∈ D; we derive a contradiction. Let d1 , d2 , . . . ∈ D be such that x − d1 ≥ x − d2 ≥ · · · , limn x − dn = dist (x, D) > 0. By solidity, n → x − dn is a decreasing sequence in |K|, not converging to 0. Hence the sequence becomes stationary, i.e., there is a d0 ∈ D with x − d0 = dist (x, D). But then x − d0 ⊥ D, conflicting maximality. Now the first assertion follows easily by using scalar multiplications and solidity. To finish the proof, let D be a closed subspace of E. By the first part D has an orthogonal base (ei )i∈I , which can be extended to a maximal orthogonal system in E, (ej )j ∈J with J ⊃ I . Then clearly [ej : j ∈ J \ I ] is an orthogonal complement of D. Remark 2.5.5 The conclusion of the theorem does not hold in case K has a dense valuation, as we will see in 8.2.2. The spaces c0 (I ) are “generic” in the following sense. Compare with 2.3.28. Theorem 2.5.6 Every Banach space with a solid norm is a quotient of c0 (I ) for some I . Proof. Let E be a Banach space with solid norm. Let I be a set with the same cardinality as the unit ball BE , let σ : I −→BE be a bijection. Define a map T : c0 (I )−→E by T λi ei := λi σ (i). i∈I
i∈I
(Here the ei are the unit vectors of c0 (I ).) Clearly T is well-defined (by completeness of E), linear, surjective, and T ≤ 1. To show the crucial property, let y ∈ E, y = 0, let ε > 0; we produce an x ∈ c0 (I ) with T (x) = y and x∞ ≤ (1 + ε) y. By solidity of the norm there is a λ ∈ K such that (1 +ε)−1 ≤ λ y ≤ 1. Let x := λ−1 eσ −1 (λ y) . Then T (x) = y and x∞ = −1 λ ≤ (1 + ε) y. Remark 2.5.7 In a similar way we obtain that every normed space with a solid norm is a quotient of some c00 (I ). Theorem 2.5.8 c0 (I ) is of countable type if and only if I is countable.
44
Normed spaces
Proof. Direct consequence of 2.3.18.
Theorem 2.5.9 Let D ⊂ c0 (I ) be a non-zero subspace of countable type. Then we have the following: (i) D has an orthonormal base. (ii) If D is closed then it is complemented. In fact, for every ε > 0 there is a continuous projection P of E onto D with P ≤ 1 + ε. If D is finitedimensional it is orthocomplemented. Proof. First observe that for J ⊂ I we have a natural embedding c0 (J ) ⊂ c0 (I ) and a natural projection PJ of c0 (I ) onto c0 (J ). We first prove that there exists a countable J ⊂ I such that D ⊂ c0 (J ). In fact, let d1 , d2 , . . . ∈ D be such that [d1 , d2 , . . .] is dense in D. Each dn has an expansion i∈Jn λi ei , where Jn ⊂ I is countable. Let J := n∈N Jn . Then J is countable and all dn are in c0 (J ), hence D ⊂ c0 (J ). Now (i) follows from 2.3.22. For (ii), by 2.3.13 there is a continuous surjective projection Q : c0 (J )−→D with Q ≤ 1 + ε. Now take P := Q ◦ PJ . If D is finite-dimensional we can take ε = 0 in the above by 2.3.19 and 2.3.20. Remark 2.5.10 For a discussion on the conclusions of 2.5.9 for arbitrary D, see the chapter notes.
2.5.2 The space ∞ (I)
For a set I let ∞ (I ) := bi∈I Ki , where Ki = K for all i ∈ I . In other words, ∞ (I ) is the set of all bounded maps I −→K. It is a Banach space under pointwise operations and (solid) norm . ∞ given by (λi )i∈I −→ sup |λi | , i∈I
containing c0 (I ) as a closed subspace. For I = {1, . . . , n}, where n ∈ N, ∞ (I ) = c0 (I ) = K n . For ∞ (N) we usually write ∞ . In the Archimedean world the dual space of c0 is isometrically isomorphic to 1 . In our case, however, c0 is isometrically isomorphic to ∞ , as we will see below. For each x = (λi )i∈I ∈ c0 (I ) and y = (µi )i∈I ∈ ∞ (I ), the formula λi µi B(x, y) := i∈I ∞
defines a bilinear form B : c0 (I ) × (I )−→K.
2.5 Examples of Banach spaces
45
Theorem 2.5.11 The map y → B(., y) is an isometrical isomorphism ∞ (I )−→c0 (I ) . Proof. Writing fy = B(., y) we see that for each y = (µi )i∈I ∈ ∞ (I ) the map fy is in c0 (I ) and since fy (x) = |B(x, y)| ≤ x∞ y∞ (x ∈ c0 (I )) we have fy ≤ y∞ . Applying fy to the unit vectors ei of c0 (I ) we see fy (ei ) = |µi | = |µi | ei ∞ , so that fy ≥ |µi | for each i, i.e., fy ≥ y∞ . Thus, y → fy is isometrical. To show surjectivity, let g ∈ c0 (I ) . Then z := (g(ei ))i∈I ∈ ∞ (I ) since |g(ei )| ≤ g ei ∞ = g for all i. To see that fz = g, let x := (λi )i∈I = i∈I λi ei ∈ c0 (I ). Then, by linearity and continu ity, fz (x) = i∈I λi g(ei ) = g( i∈I λi ei ) = g(x). In the rest of the book we will identify ∞ (I ) and c0 (I ) by using the above isometrical isomorphism. Remark 2.5.12 For the dual of ∞ see 5.5.5 and 5.5.6. The following theorem is a “dual” to 2.3.28. Theorem 2.5.13 Any normed space E of countable type with a solid norm can linearly and isometrically be embedded into ∞ . Proof. We may assume that E is infinite-dimensional. Let 0 < t1 < t2 < · · · , limm tm = 1. By 2.3.7, for each m ∈ N, E has a tm -orthogonal base {emn : n ∈ N} such that (solidity) tm−1 ≤ emn ≤ tm−2 for each n. For x ∈ E, ∞ let n=1 λmn emn be its expansion with respect to {emn : n ∈ N}. Define T : E−→ ∞ (N × N) by T (x) := (λmn )m,n∈N . Then, for each m, tm2 x ≤ tm2 max |λmn | emn ≤ max |λmn | ≤ tm max |λmn | emn ≤ x, n∈N
n∈N
n∈N
so that, by taking the supremum over m, T (x) = x, i.e., T is an isometry. Now the conclusion follows after the observation that ∞ (N × N) is isometri cally isomorphic to ∞ . Remark 2.5.14 The dual version of 2.5.6 “every normed space with a solid norm can linearly and isometrically be embedded into ∞ (I ) for some I ” is not true. We will clarify the situation in 4.4.9. Next we prove the following theorem. Theorem 2.5.15 ∞ is not of countable type.
46
Normed spaces
Proof. As Q is countable it suffices to show that ∞ (Q) is not of countable type. By 2.3.18 it is enough to construct an uncountable orthonormal system in ∞ (Q). For each α ∈ R, let fα ∈ ∞ (Q) be defined via the formula 0 if x ∈ Q, x ≤ α fα (x) := 1 if x ∈ Q, x > α. Clearly fα ∞ = 1 for all α. To prove that {fα : α ∈ R} is orthonormal, choose α1 < · · · < αn in R and λ1 , . . . , λn in K. By selecting n x1 ∈ Q ∩ (α1 , α2), x2 ∈ Q ∩ (α 2 , α3 ), . . ., xn ∈ Q ∩ (αn , ∞) we obtain i=1 λi fαi (xj ) = λ1 + · · · + λj for each j , from which
n i=1
λi fαi ∞ ≥ max λ1 + · · · + λj = max |λi | = max λi fαi ∞ . 1≤j ≤n
1≤i≤n
1≤i≤n
Remark 2.5.16 From 2.5.4 it follows that if the valuation of K is discrete then c0 is orthocomplemented in ∞ (8.1.11). On the other hand, we will show in 8.2.1 that when K is densely valued there is not even a continuous linear surjection ∞ −→c0 . We will need the following generalizations in the sequel. Let I be a set, let s : I −→(0, ∞). Let ∞ (I, s) be the subspace of all (λi )i∈I ∈ K I for which i → |λi | s(i) is bounded, with the norm (λi )i∈I −→ sup |λi | s(i). i∈I
Then ∞ (I, s) is a Banach space. Its norm is solid if and only if the range of s lies in |K|. If s(i) = 1 for all i then ∞ (I, s) = ∞ (I ). In the same spirit we can define c0 (I, s) as the subspace of ∞ (I, s) consisting of those (λi )i∈I for which limi |λi | s(i) = 0. ∞ (I, s) is linearly homeomorphic to ∞ (I ). In fact, let ρ ∈ K, 0 < |ρ| < 1. For each i ∈ I choose µi ∈ K with |ρ| s(i) ≤ |µi | ≤ s(i). Then ∞ (I, s)−→ ∞ (I ) given by (λi )i∈I −→ (λi µi )i∈I does the job. In the same vein, c0 (I, s) is linearly homeomorphic to c0 (I ).
2.5.3 Banach spaces of continuous functions For a topological space X, let C(X−→K) be the vector space of all continuous functions X−→K. If no confusion is to be expected we write C(X) for
2.5 Examples of Banach spaces
47
C(X−→K). In the sequel we shall study connections between properties of C(X−→K) and certain subspaces on one hand, and topological properties of X on the other. In this context it is not satisfactory to have two different topologies on one set X leading to the same space of continuous functions. To overcome we can require that the topology on X is the weakest one making all f ∈ C(X−→K) continuous. This condition can be viewed as the non-Archimedean counterpart of complete regularity (see e.g. [52], p. 39). Theorem 2.5.17 The following statements on a topological space X are equivalent: (α) X has the weakest topology making all f ∈ C(X−→K) continuous. (β) X is zero-dimensional. Proof. Since K is zero-dimensional it is clear that (α) implies (β). Now suppose (β) holds. Let τ be the original topology on X, let τ be a topology on X making all f ∈ C(X−→K) continuous. Then, for any τ -clopen subset A of X, ξA is τ -continuous, so A is τ -clopen. Hence, τ ≤ τ , and we have (α). It is also reasonable to ask that the continuous functions on X separate the points of X. Theorem 2.5.18 The following statements on a zero-dimensional topological space X are equivalent: (α) The continuous functions X−→K separate the points of X. (β) X is Hausdorff. Proof. Only (α) =⇒ (β) needs a proof. Let x, y ∈ X, x = y. By (α) there is an f ∈ C(X−→K) with f (x) = f (y). Then U := {z ∈ X : |f (z) − f (x)| < |f (x) − f (y)|} is clopen, contains x, not y, and X \ U is a neighbourhood of y. So X is Hausdorff. Remark 2.5.19 Observe that both properties (β) above do not depend on K. From now on in Subsection 2.5.3, X is a non-empty zero-dimensional Hausdorff topological space. Definition 2.5.20 Let (X) be the collection of all clopen subsets of X. A (continuous) function f : X−→K is locally constant if for each x ∈ X there exists a neighbourhood of x on which f is constant. A step function is a continuous function X−→K with only finitely many values.
48
Normed spaces
Let BC(X−→K) (BC(X)) be the subspace of C(X−→K) consisting of all bounded continuous functions. For f ∈ BC(X), set f ∞ := sup{|f (x)| : x ∈ X}. Let P C(X−→K) (P C(X)) be the space of all f ∈ C(X−→K) for which f (X) is compact (i.e., f (X) is precompact). Finally, let C0 (X−→K)) (C0 (X)) be the space of all continuous functions f : X−→K “vanishing at infinity”, i.e., such that for each ε > 0 the set {x ∈ X : |f (x)| ≥ ε} is compact. From now on in Subsection 2.5.3 we will equip BC(X) and its subspaces with the (solid) norm . ∞ . Theorem 2.5.21 (X) is a ring of subsets covering X. A function f : X−→K is locally constant if and only if there exists a partition of X into clopen sets on each of which f is constant. The locally constant functions form a subspace of C(X). For each f ∈ C(X) and each ε > 0 there is a locally constant g : X−→K with |f (x) − g(x)| < ε for all x ∈ X. BC(X) is a closed subspace of ∞ (X), hence is a Banach space. The bounded locally constant functions form a dense subspace of BC(X). Each step function is locally constant. P C(X) is a closed subspace of BC(X). The step functions form a dense subspace of P C(X). C0 (X) is a closed subspace of P C(X). The functions in C(X) having compact support form a dense subspace of C0 (X). If X has the discrete topology then C0 (X) = c0 (X), BC(X) = ∞ (X). Proof. Everything is straightforward except maybe for the density statements. For f ∈ C(X) and ε > 0 the assignment “x ∼ y if |f (x) − f (y)| < ε” is an equivalence relation and the classes form a partition {Ui : i ∈ I } of X into clopen sets, which is finite if f ∈ P C(X) since by precompactness, f (X) is covered by finitely many open disks in K of radius ε. Choose ui ∈ Ui for each i and set g(x) := f (ui ) if x ∈ Ui . Obviously g is locally constant (a step function if f ∈ P C(X)) and |f (x) − g(x)| < ε for each x ∈ X. Now assume that f ∈ C0 (X). Let ε > 0. Then U := {x ∈ X : |f (x)| ≥ ε} is clopen and compact. Hence f ξU has compact support and f − f ξU ∞ ≤ ε. C(X) for compact X Clearly if X is compact then C(X) = BC(X) = P C(X) = C0 (X). We now prove that C(X) has an orthonormal base. Theorem 2.5.22 Let X be compact. Then C(X) has an orthonormal base. More precisely, let U be a maximal collection of clopen sets for which {ξU : U ∈ U} is orthonormal. Then {ξU : U ∈ U} is an orthonormal base of C(X).
2.5 Examples of Banach spaces
49
Proof. Let K1 be a closed subfield of K with non-trivial discrete valuation (1.2.9). Then {ξU : U ∈ U} is also orthonormal in C(X−→K1 ); we first prove it to be a maximal orthonormal system in C(X−→K1 ). Let D be the K1 linear span of {ξU : U ∈ U}. We must prove for f ∈ C(X−→K1 ), f = 0 that dist (f, D) < f ∞ . First, let f := ξV , where V ∈ (X). By assumption there are U1 , . . . , Un ∈ U and λ1 , . . . , λn ∈ K such that, for all x ∈ X, n λi ξUi (x) < 1. (2.5) ξV (x) − i=1
Now consider the K1 -linear span S of 1, λ1 , . . . , λn . By 2.3.21 and 2.3.25 there is a surjective K1 -linear projection P : S−→K1 with |P (α)| ≤ |α| for all α ∈ S. Applying P to (2.5) results into n P (λi ) ξUi (x) < 1 (x ∈ X), ξV (x) − i=1
so that dist (ξV , D) < 1 = ξV ∞ . Now let f ∈ C(X−→K1 ) be arbitrary, f = 0. There is a step function g ∈ C(X−→K1 ) with f − g∞ < f ∞ (2.5.21). Write g := ni=1 µi ξVi , where V1 , . . . , Vn is a finite clopen partition of X and µ1 , . . . , µn ∈ K1 , not all 0. By the above there are di ∈ D such that ξVi − di ∞ < 1 for i ∈ {1, . . . , n}. Then g − ni=1 µi di ∞ < g∞ = f ∞ and f − ni=1 µi di ∞ ≤ max(f − n g∞ , g − i=1 µi di ∞ ) < f ∞ . Thus, {ξU : U ∈ U} is a maximal orthonormal set in C(X−→K1 ). From 2.5.4 it follows that {ξU : U ∈ U} is an orthonormal base of C(X−→K1 ). be the K-linear span of {ξU : U ∈ U}. Then ξV ∈ D ⊂ D Finally, let D It follows for each V ∈ (X). Hence all K-valued step functions are in D. Now 2.5.2 shows that {ξU : U ∈ U} is an from 2.5.21 that C(X−→K) = D. orthonormal base of C(X−→K). As an application we have the zero-dimensional version of the Tietze–Urysohn Extension Lemma. Corollary 2.5.23 Let Y be a compact subset of X. Then every f ∈ C(Y ) can be extended to an f ∈ P C(X) such that f ∞ = f ∞ . Even more, there is a linear isometry T : C(Y )−→P C(X) such that T (f )|Y = f for all f ∈ C(Y ). Proof. First we prove that for each U ⊂ Y , U clopen in Y , there exists a clopen V ⊂ X with V ∩ Y = U . In fact, there is an open W ⊂ X with W ∩ Y = U . By zero-dimensionality, for each x ∈ U we can find a clopen Wx ⊂ X with x ⊂ Wx ⊂ W . These Wx cover U and by compactness there is a finite subcover Wx1 , . . . , Wxn . Set V := 1≤i≤n Wxi . Then V is clopen in X and
50
Normed spaces
V ∩ Y = U . Now, to prove the corollary, let (Ui )i∈I be a collection of clopens in Y such that (ξUi )i∈I is an orthonormal base of C(Y ). For each i choose a clopen Vi ⊂ X with Vi ∩ Y = Ui . Then the map ξUi → ξVi can uniquely be extended to a continuous linear map T : C(Y )−→P C(X), which satisfies the requirements. Next we determine for which compact X the space C(X) is of countable type. Theorem 2.5.24 Let X be compact. Then C(X) is of countable type if and only if X is ultrametrizable. Proof. Let C(X) be of countable type. Then there is a sequence f1 , f2 , . . . , with fn ∞ = 1 for all n, whose linear hull is dense in C(X). The formula d(x, y) := max |fn (x) − fn (y)| 2−n n∈N
(x, y ∈ X)
defines an ultrametric on X (since the fn separate the points we have d(x, y) = 0 =⇒x = y), which induces a Hausdorff topology ς on X. Calling the initial topology on X τ , we prove that the identity (X, τ )−→(X, ς) is continuous (then by compactness we have τ = ς , hence X is ultrametrizable). Let (xi )i τ be a net in X, xi −→ x, for some x ∈ X. Let ε > 0. Then 2−n < ε for n > N. Using the fact that fn (xi ) → fn (x) for n ∈ {1, . . . , N } we see that for large i, ς |fn (xi ) − fn (x)| < ε for n ∈ {1, . . . , N }. But then d(xi , x) < ε. So xi −→ x, and we are done. Conversely, let X be ultrametrizable. Let d be an ultrametric defining the topology. Choose r1 > r2 > · · · , limn rn = 0. Let B be the collection of all balls of the form {x ∈ X : d(x, a) ≤ rn }, where a ∈ X, n ∈ N. Then by compactness and the mercury drop behaviour (see Section 1.1) B is countable. Let D := [ξB : B ∈ B]. We prove that D is dense in C(X). To this end it suffices to show that ξU ∈ D for each clopen U ⊂ X (then all step functions are in D and, by 2.5.21, D = C(X)). In fact, the members of B that lie in U cover U . By compactness there is a finite subcover. Again by the mercury drop behaviour there is a further subcover that is a partition of U . It follows that ξU is a finite sum of ξB , B ∈ B, and we are done. For the next result we need the following lemma. Lemma 2.5.25 Let A1 , A2 , . . . , An be subsets of some set I . Suppose A1 ⊂ A2 ∪ · · · ∪ An , A2 ⊂ A3 ∪ · · · ∪ An , . . . , An−1 ⊂ An . Then ξA1 , . . . , ξAn are orthonormal in ∞ (I ). Proof. Let i ∈ {1, . . . , n − 1}. According to 2.2.7 it suffices to show that dist (ξAi , [ξAi+1 , . . . , ξAn ]) = 1. By assumption there is an a ∈ Ai a ∈
2.5 Examples of Banach spaces
51
Ai+1 ∪ · · · ∪ An . Then for every f ∈ [ξAi+1 , . . . , ξAn ] we have f (a) = 0, so that ξAi − f ∞ ≥ ξAi (a) − f (a) = 1. Remark 2.5.26 The natural converse of the above lemma is not true. Let I = N. Suppose the characteristic of k is not 2. Choose A1 := {2, 3}, A2 := {1, 3}, A3 := {1, 2}. Then A1 , A2 , A3 do not satisfy the conditions about inclusions, even after changing the order. To show orthonormality, let λ1 ξA1 + λ2 ξA2 + λ3 ξA3 ∞ < 1, where max1≤i≤3 |λi | = 1. Applying the canonical map λ → λ of BK onto k (see Section 1.2) we find λ1 ξ A1 (n) + λ2 ξ A2 (n) + λ3 ξ A3 (n) = 0 for all n, where now ξ indicates k-valued characteristic functions. Substituting n = 1, 2, 3 respectively we find λ2 + λ3 = λ1 + λ3 = λ1 + λ2 = 0 leading to λ1 = λ2 = λ3 := ν and 2 ν = 0. As the characteristic of k is not 2 we have ν = 0, so |λi | < 1 for each i ∈ {1, 2, 3}, a contradiction, showing orthonormality. If the characteristic of k equals 2 then, with the same methods, A1 := {2, 3, 4}, A2 := {1, 3, 4}, A3 := {1, 2, 4}, A4 := {1, 2, 3} will do the job. This example shows that orthogonality of characteristic functions of sets is not independent of K. Theorem 2.5.27 Let X be a compact ultrametric space. Then C(X) has an orthonormal base consisting of characteristic functions of balls. Even more, each maximal system of balls whose characteristic functions are linearly independent is an orthonormal base of C(X). Proof. Let S be a maximal collection of balls such that {ξB : B ∈ S} is linearly independent. Then the characteristic function of each ball is in [ξB : B ∈ S], hence every step function is in [ξB : B ∈ S]. So [ξB : B ∈ S] is dense in C(X) (2.5.21). By 2.5.2 it remains to be shown that S is an orthonormal set. Take distinct B1 , . . . , Bk ∈ S such that diam B1 ≥ diam B2 ≥ · · · ≥ diam Bk . If B1 ⊂ 1
52
Normed spaces
With the natural operations and the norm . defined by (ii) the measures on X form a Banach space, called M(X). Next we are going to integrate continuous functions with respect to a measure µ as follows. First, let f : X−→K be a step function. Let U1 , . . . , Un be a finite clopen partition of X such that f is constant, say λi ∈ K, on each Ui . Then f = ni=1 λi ξUi and we set n f dµ := λi µ(Ui ). X
i=1
By considering refinements one shows that the right-hand side does not depend on the clopen partition chosen such that f is constant on its members. A similar procedure yields linearity of f → X f dµ. Since n f dµ = λ µ(U ) i i ≤ max |λi | µ = f ∞ µ, 1≤i≤n X
i=1
we have that f → X f dµ is a continuous linear map, with norm ≤ µ, on the space of the step functions. By 2.5.21 it has a unique continuous linear extension to C(X), again denoted f → X f dµ. µ ∈ M(X) the map ϕµ : f → Theorem 2.5.29 Let X be compact. For each f dµ defined above is an element of C(X) whose norm equals µ. X Proof. It remains to be shown that µ ≤ ϕµ . But this follows from |µ(U )| = ϕµ (ξU ) ≤ ϕµ for each U ∈ (X). We now prove that for compact X every element of C(X) can be represented as an integral with respect to a measure. This is the counterpart of the classical Riesz Representation Theorem, but less deep and much easier to prove. Theorem 2.5.30 (Riesz Representation Theorem) Let X be compact. Then for every ϕ ∈ C(X) there is exactly one measure µ on X such that ϕ(f ) = X f dµ for all f ∈ C(X). More precisely, the map µ → ϕµ (µ ∈ M(X)) is an isometrical isomorphism M(X)−→C(X) . Proof. Direct verification yields linearity. So, by 2.5.29, only surjectivity remains to be proved. Let ϕ ∈ C(X) . Then µ(U ) := ϕ(ξU ) (U ∈ (X)) defines a measure µ for which ϕµ = ϕ. Remark 2.5.31 In Subsection 7.2.2 we will continue studying C(X) in the locally convex setting.
2.5 Examples of Banach spaces
53
The space C0 (X) of continuous functions vanishing at infinity Firstly, we find out when C0 (X) has “enough” elements. Theorem 2.5.32 The following are equivalent: (α) For each a ∈ X there is an f ∈ C0 (X) with f (a) = 0. (β) (β) X is locally compact. Proof. (α) =⇒ (β). Let a ∈ X, let f ∈ C0 (X), f (a) = 0. Then Ua := {x ∈ X : |f (x) − f (a)| < |f (a)|} is a clopen neighbourhood of a, contained in {x ∈ X : |f (x)| = |f (a)|} which set lies in a compact one. Hence, Ua is also compact. So each point of X has a compact neighbourhood, i.e., X is locally compact. (β) =⇒ (α). Let a ∈ X. By assumption a has a compact neighbourhood V . By zero-dimensionality there is a clopen U with a ∈ U ⊂ V . Then U is compact, open and ξU ∈ C0 (X); also ξU (a) = 1 = 0. Remark 2.5.33 The condition that C0 (X) separates the points of X is not enough to guarantee local compactness. In fact, define on X := R a topology as follows. A set U ⊂ X is called open if either 0 ∈ U or X \ U is countable. This makes X into a Hausdorff zero-dimensional space such that X \ {0} is discrete, and compact subsets of X are finite. For each a, b ∈ X, a = b, a = 0 the function ξ{a} is in C0 (X) and separates a and b. But neighbourhoods of 0 are infinite, hence not compact, i.e., X is not locally compact. (This example was kindly pointed out to us by J. Araujo.) Theorem 2.5.34 Let X be locally compact. Then C0 (X) has an orthonormal base consisting of characteristic functions of open compact sets. Proof. Let us prove that the linear hull of {ξU : U ⊂ X open compact} is dense in C0 (X). For that, let ε > 0 and let f ∈ C0 (X). As in the proof of 2.5.21 define an equivalence relation on X by “x ∼ y if |f (x) − f (y)| < ε”. Then the classes form a finite partition of X consisting of clopen sets U1 , . . . , Un . Take ui ∈ Ui and let J := {i ∈ {1, . . . , n} : |f (ui )| ≥ ε}. We may assume J = ∅. For each i ∈ J , the set Ui is contained in {x ∈ X : |f (x)| = |f (ui )|} which lies in a compact set, so Ui is compact. Also, for g := i∈J f (ui ) ξUi we have f − g∞ ≤ ε. From this point the proof of 2.5.22 applies with only obvious modifications. Before characterizing when C0 (X) is of countable type it is useful to have some topological considerations (that we also will apply later on).
54
Normed spaces
Lemma 2.5.35 Let X be locally compact. Then the following are equivalent: (α) X is σ -compact and ultrametrizable. (β) X is σ -compact and every compact subset of X is ultrametrizable. (γ ) X is ultrametrizable and separable. Proof. (α) =⇒ (β) is trivial. Next we prove (β) =⇒ (γ ). Let Y1 , Y2 , . . . be compact sets covering X. By local compactness we may assume that the Yn are open. Then U1 := Y1 , Un := Yn \ i 1) form a partition of X into open compact sets. Choose, for each n, an ultrametric dn on Un , dn < 1, yielding the topology on Un and define, for x, y ∈ X, dn (x, y) if x, y ∈ Un for some n d(x, y) := 1 otherwise. One checks immediately that d is an ultrametric on X inducing the topology. Hence X is ultrametrizable. To show separability observe that each Un is separable ([52], 4.1.18), so we can choose a countable set Sn ⊂ Un that is dense in Un . Then n∈N Sn is countable and dense in n∈N Un = X. Finally, we treat (γ ) =⇒ (α). By 1.1.3 X has a partition consisting of compact balls {Bi : i ∈ I }. Let S be a countable dense subset of X. Then S must meet every Bi , so that I is countable and we obtain σ -compactness. Theorem 2.5.36 Let X be locally compact. Then the following are equivalent: (α) C0 (X) is of countable type. (β) X is σ -compact and ultrametrizable. (γ ) X is ultrametrizable and separable. Proof. It suffices to prove that (α) is equivalent to (β) of 2.5.35. First assume that C0 (X) is of countable type. Let f1 , f2 , . . . ∈ C0 (X) be such that [f1 , f2 , . . .] is dense in C0 (X). For each m, n ∈ N, 1 Un,m := x ∈ X : |fn (x)| ≥ m is open and compact. For each a ∈ X there is an f ∈ C0 (X) with f (a) = 0, so fn (a) = 0 for some n. This shows that n,m∈N Un,m = X and we have σ compactness. Now let Y ⊂ X be compact. To show ultrametrizability of Y we may assume by local compactness that Y is open. Then we have the standard linear isometrical embedding C(Y )−→C0 (X), so C(Y ) is of countable type (2.3.14), hence Y is ultrametrizable by 2.5.24. Conversely, assume (β) of 2.5.35. There are compact sets U1 , U2 , . . . covering X; without loss suppose that the Un are open and U1 ⊂ U2 ⊂ · · · . By assumption and 2.5.24 each C(Un ) is of countable type, hence so is
2.5 Examples of Banach spaces
55
{f ∈ C0 (X) : supp f ⊂ Un for some n}, and this last space is dense in C0 (X) (2.5.21). Then (α) follows. P C(X) and BC(X) We first construct a compactification of X as follows. Recall that X is zerodimensional and Hausdorff. For each x ∈ X the formula ζx (U ) := ξU (x), U ∈ (X) defines an element ζx ∈ {0, 1}(X) . The latter space, with the product topology, is compact by the Tychonov Theorem ([52], 3.2.4), and the map ζX : X−→{0, 1}(X) , x → ζx is a homeomorphism of X onto ζX (X). The closure Xζ of ζX (X) in the compact space {0, 1}(X) , more precisely, the pair (ζX , X ζ ), is called the Banaschewski compactification of X. Xζ is compact, zero-dimensional, Hausdorff and ζX (X) is dense in X ζ . In the sequel we identify X with its image ζX (X); we use this in 2.5.41. If Y is a second zero-dimensional Hausdorff topological space with Banaschewski compactification (ζY , Y ζ ) and σ : X−→Y is a continuous map, then there is a unique continuous map σ ζ : Xζ −→Y ζ making the diagram X
σ
ζX
Xζ
/Y
σζ
ζY
/ Yζ
commute. Thus, the Banaschewski compactification is the zero-dimensional ˘ analogue of the Stone–Cech compactification (see e.g. [52], Section 3.6). Now, in particular, let f ∈ P C(X). Then f (X) is compact and zeroζ dimensional, so f (X) can be identified with f (X) . So there is a unique continuous f ζ : Xζ −→K making the diagram XA AA AA A ζX AA
f
Xζ
/K }> } }} }} f ζ } }
commutative. The map f → f ζ is easily seen to be linear and isometrical; we also have (f g)ζ = f ζ g ζ for all f, g ∈ P C(X). Thus, we have proved: Theorem 2.5.37 The map f → f ζ of above is an isometrical ring isomorphism of P C(X) onto C(Xζ ).
56
Normed spaces
As a direct consequence of this theorem and 2.5.22 we obtain: Corollary 2.5.38 P C(X) has an orthonormal base consisting of characteristic functions of clopen sets. Remark 2.5.39 For the question whether BC(X) has an orthogonal base, see [193], 5.25. It is easy to see when BC(X) and P C(X) are of countable type. Theorem 2.5.40 The following are equivalent: (α) BC(X) is of countable type. (β) P C(X) is of countable type. (γ ) X is compact and ultrametrizable. For the proof we use a lemma on the Banaschewski compactification. Lemma 2.5.41 If X ζ is ultrametrizable then X is compact. Proof. We show that X = Xζ . Suppose there exists an a ∈ X ζ , a ∈ X. There is a sequence x1 , x2 , . . . in X such that d(x1 , a) > d(x2 , a) > · · · , limn d(xn , a) = 0, where d is an ultrametric on Xζ yielding the topology. Let U0 := {x ∈ X : d(x, a) > d(x1 , a)} and for n ≥ 1 set Un := {x ∈ X : d(xn+1 , a) < d(x, a) ≤ d(xn , a)}. Then U0 , U1 , . . . form a clopen partition of X. Define f : X−→K by 0 if x ∈ Un , n is odd f (x) := 1 if x ∈ Un , n is even. Then f ∈ P C(X), but limx→a f (x) does not exist and f cannot be extended to a continuous function on X ζ , a contradiction. Proof of 2.5.40. The implication (α) =⇒ (β) is a consequence of 2.3.14, and (γ ) =⇒ (α) follows from 2.5.24. We prove (β) =⇒ (γ ). From (β) and 2.5.37 we have that C(Xζ ) is of countable type. Again by 2.5.24, X ζ is ultrametrizable so, by the above lemma, X = X ζ is compact and ultrametrizable.
2.5.4 Valued field extensions If L is a complete valued field extension of K, i.e., L is a complete valued field containing K as a subfield and the valuation of K is the restriction of the valuation of L, then L is in a natural way a Banach space over K. This observation generates a new class of examples of Banach spaces.
2.5 Examples of Banach spaces
57
For a ∈ L, let K(a) be the smallest subfield of L containing K and a. Below we shall study, under the assumption that K is algebraically closed, the K-Banach space K(a) and answer the natural question whether K(a) is of countable type (2.5.44). As a by-product we will construct a continuous linear map with only trivial closed invariant subspaces (2.5.48). Our main goal is to prove the following. Theorem 2.5.42 Let K be algebraically closed with residue class field k. Let L be a complete valued field extension of K, and let a ∈ L \ K. Then the K-Banach space K(a) has, for each t ∈ (0, 1), a t-orthogonal base. More specifically, we have the following: (i) If dist (a, K) is not attained then K(a) is of countable type but has no orthogonal base. (ii) If dist (a, K) is attained, but not in |K| then K(a) is of countable type, has an orthogonal, but no orthonormal base. (iii) If dist (a, K) is attained and in |K| then K(a) has an orthonormal base of cardinality k. Remark 2.5.43 Note that, by 2.3.25, case (i) only can happen if K is not spherically complete. Corollary 2.5.44 K(a) is not of countable type if and only if k is uncountable and dist (a, K) is attained and in |K|. Remark 2.5.45 To see that this case really occurs, choose K such that k is uncountable, let K(X) be the field of rational functions with coefficients in K with the valuation defined by λ0 + λ1 X + · · · + λn X n max0≤i≤n |λi | , µ + µ X + · · · + µ Xm := max 0 1 m 0≤j ≤m µj where λi , µj are in K, not all µj equal to 0, and let L be the completion of (K(X), | . |), and choose a := X. Problem Study K (a) in the spirit of 2.5.42 for non-algebraically closed K . The proof of 2.5.42 runs in several steps. Notice that by 2.3.7 we only need to prove (i), (ii) and (iii). Until 2.5.48 we assume that K , k, L, a are as in 2.5.42.
58
Normed spaces
Lemma 2.5.46 Let λ1 , . . . , λn and µ1 , . . . , µn be elements of L such that |λi − µi | < |µi | for each i ∈ {1, . . . , n}. Then n n n µi < µi . λi − i=1
i=1
i=1
Proof. Follows directly by observing that µλii − 1 < 1 for each i ∈ {1, . . . , n} and that {λ ∈ L : |λ − 1| < 1} is a multiplicative group. Proof of 2.5.42(i). First we show that K(a) is of countable type. For that we prove that the ring K[a] := [1, a, a 2 , . . .] is dense in K(a). (a) For every b ∈ K[a], b = 0 there is a µ ∈ K such that |b − µ| < |µ|. To see this, let b = λ0 + λ1 a + · · · + λn a n ; we may suppose n ≥ 1, λ0 , λ1 , . . . , λn ∈ K, λn = 0. By algebraic closedness there exist ω1 , . . . , ωn ∈ K such that b = λn (a − ω1 ) · · · (a − ωn ). Since dist (a, K) = dist (a − ωi , K) is not attained there are µ1 , . . . , µn ∈ K such that |a − ωi − µi | < |µi | for each i ∈ {1, . . . , n}. By 2.5.46 we have |b − µ| < |µ|, where µ := λn µ1 · · · µn . (b) For each b ∈ K[a], b = 0 we have b−1 ∈ K[a]. In fact, by (a) there is a µ ∈ K such that |b − µ| < |µ|. Then µ−1 b − 1 < 1, so that µ b−1 = −1 b)n ∈ K[a]. (1 − (1 − µ−1 b))−1 = ∞ n=0 (1 − µ (c) Conclusion. From (b) it follows that K(a) ⊂ K[a]. This, together with the obvious inclusion K[a] ⊂ K(a) leads to K[a] = K(a). Finally we prove that K(a) has no orthogonal base. From the assumption we obtain, via 2.3.21, that [1, a] has no orthogonal base and by 2.3.22 neither has K(a) (note that by 2.3.18 any orthogonal base of K(a) must be countable). Proof of 2.5.42(ii). Let λ0 ∈ K be such that |a − λ0 | = dist (a, K). Then K(a − λ0 ) = K(a) and dist (a − λ0 , K) = dist (a, K), so we may replace a by a − λ0 ; in other words, we may assume that |a| ∈ |K|. It suffices to show that {a n : n ∈ Z} is an orthogonal base of K(a). First observe that |a|n ∈ |K| for n ∈ N. Indeed, if |a|n = |λ| for some n ∈ N and λ ∈ K then, by algebraic closedness, there is a µ ∈ K with µn = λ, so that |a| = |µ| ∈ |K|, a contradiction. Next we prove orthogonality of {a n : n ∈ Z}. Let x :=
m i=s
λi a i ,
2.5 Examples of Banach spaces
59
wherei λs ,. . . , λj m ∈ K, not all 0. From what we have just proved it follows that λi a = λj a for all i, j ∈ {s, . . . , m} unless i = j or λi = λj = 0. Then |x| = maxs≤i≤m λi a i and orthogonality follows. We proceed to show that x −1 ∈ [a n : n ∈ Z], where x is as above. There is a unique j ∈ {s, . . . , m} with |x| = λj a j . Then λi a i = 1 + v, (λj a j )−1 x = 1 + (λj a j )−1 i=j
where v ∈ [a n : n ∈ Z], |v| < 1. Thus (λj a j ) x −1 =
∞
(−v)n ∈ [a n : n ∈ Z],
n=0
implying x −1 ∈ [a n : n ∈ Z]. Now continuity of the inverse map shows that [a n : n ∈ Z] is a field, hence must be equal to K(a). By 2.3.6 we obtain that {a n : n ∈ Z} is an orthogonal base of K(a). The proof of 2.5.42(iii) is somewhat more involved. Lemma 2.5.47 Let a ⊥ K, |a| = 1. Then for each polynomial P = λ0 + λ1 X + · · · + λn Xn ∈ K[X] and µ ∈ BK we have |P (µ)| ≤ max |λi | ≤ |P (a)| . 0≤i≤n
Proof. Only the second inequality needs a proof. We may assume λn = 0. By algebraic closedness there are ω1 , . . . , ωn ∈ K such that P = λn (X − ω1 ) · · · (X − ωn ) and by assumption we have |a − ωi | ≥ |a| = 1 for all i, so that |P (a)| ≥ |λn |. By the same token we obtain λ0 + λ1 a + · · · + λn−1 a n−1 ≥ |λn−1 |, i.e., |λn−1 | ≤ |P (a) − λn a n | ≤ max(|P (a)| , |λn |) = |P (a)|, and we can proceed inductively. Proof of 2.5.42(iii). Let λ0 ∈ K with |a − λ0 | = dist (a, K) ∈ |K|. Then K(a − λ0 ) = K(a) and dist (a − λ0 , K) = dist (a, K), so we may assume that a ⊥ K and |a| = 1. Let σ : k−→BK be such that σ (u) = u for all u ∈ k, where the bar indicates the canonical map BK −→k. Now let S := {a s : s ∈ N ∪ {0}} ∪ {(a − µ)−m : µ ∈ σ (k), m ∈ N}. S is a subset of K(a) and, since k is infinite, we have S = k. We now establish (a)–(d) below which, together with 2.5.2, show that S is an orthonormal base of K(a): (a) S is an orthonormal system. (b) [S] is a subring of K(a).
60
Normed spaces
(c) For each β ∈ K, (a − β)−1 ∈ [S]. (d) K(a) ⊂ [S]. Proof of (a). Clearly each member of S has length 1. Take a linear combination :=
s
ξr a r +
n m
λij (a − µi )−j
i=1 j =1
r=0
(s ∈ N ∪ {0}, m, n ∈ N, ξr , λij ∈ K, µi ∈ σ (k)). For orthonormality of S it suffices to show, assuming || < 1, that all |ξr | and λij are < 1. Via (downward) induction on n we only prove that all |ξr | and all |λin | are < 1 (r ∈ {0, . . . , s}, i ∈ {1, . . . , m}). To obtain polynomials we multiply by L(a) := (a − µ1 )n · · · (a − µm )n , which does not change the absolute value as |L(a)| = 1 and the assumption || < 1 turns into |V1 (a) + V2 (a)| < 1,
(2.6)
where V1 , V2 ∈ K[X]. In fact, for x ∈ L, s ξr x r ) L(x), V1 (x) := ( r=0
V2 (x) :=
n m
λij Lij (x),
i=1 j =1
where Lij (x) := (x − µi )n−j
(x − µl )n . l=i
Let r ∈ {0, . . . , s}. If ξr = 0 the degree of V1 is ≥ m n, whereas V2 has degree < m n. Thus, ξr is a coefficient of the polynomial V1 + V2 , so that by 2.5.47 we have |ξr | ≤ |V1 (a) + V2 (a)| < 1. So all |ξr | are < 1 and |V1 (a)| < 1, hence (2.6) reduces to |V2 (a)| < 1. Choose q ∈ {1, . . . , m}. Then since Lij (µq ) = 1 if q = i, j = n 0 otherwise we find by 2.5.47 1 > |V2 (a)| ≥ V2 (µq ) = λqn , so that |λ1n |, . . . , |λmn | are all < 1.
2.5 Examples of Banach spaces
61
Proof of (b). It suffices to show that S .S ⊂ [S]. For µ ∈ σ (k) and m ∈ N the identity a (a − µ)−m = (a − µ)1−m + µ (a − µ)−m shows that a S ⊂ [S]. Then a 2 S = a a S ⊂ a [S] = [a S] ⊂ [S], and so on proving that a r S ⊂ [S] for each r ∈ N ∪ {0}. It remains to be shown that (a − µ1 )−m1 (a − µ2 )−m2 ∈ [S] for m1 , m2 ≥ 1, µ1 , µ2 ∈ σ (k). If µ1 = µ2 this is clear, so suppose µ1 = µ2 . We use induction with respect to n := m1 + m2 . If n = 2 (then m1 = m2 = 1) the formula (a − µ1 )−1 (a − µ2 )−1 =
1 ((a − µ1 )−1 − (a − µ2 )−1 ) µ1 − µ2
(2.7)
does the job. For the step n − 1 → n observe that we have, using (2.7), (a − µ1 )−m1 (a − µ2 )−m2 1 = ((a − µ1 )−1 − (a − µ2 )−1 ) (a − µ1 )−m1 +1 (a − µ2 )−m2 +1 , µ1 − µ2 which is a linear combination of the elements (a − µ1 )−m1 (a − µ2 )−m2 +1 and (a − µ1 )−m1 +1 (a − µ2 )−m2 , which are by the induction hypothesis in [S]. −1 Proof of (c). If |β| > 1 we have (a − β)−1 = −β −1 ∞ a)n ∈ [S], so n=0 (β let |β| ≤ 1. Then there is a µ ∈ σ (k) with |β − µ| < 1 and β − µ −1 −1 −1 −2 1− (a − β) − (a − µ) = (β − µ) (a − µ) a−µ ∞ = (β − µ) (a − µ)−2 (β − µ)n (a − µ)−n ∈ [S]. n=0
Proof of (d). Every element of K(a) can be written as P (a) Q(a)−1 for some polynomials P , Q ∈ K[X], Q(a) = 0. By algebraic closedness we can decompose Q into linear factors, whose inverses are in [S] by (c). Then, since [S] is a ring by (b), P (a) Q(a)−1 ∈ [S], which finishes the proof. As an application we will construct an example of a continuous linear map on c0 without non-trivial closed invariant subspaces. Theorem 2.5.48 Let K be algebraically closed and not spherically complete (e.g. K = Cp ). Then there is a T ∈ L(c0 ) such that for each closed subspace D with T (D) ⊂ D it follows that D = {0} or D = c0 . Proof. Let L ⊃ K be the spherical completion of K, let a ∈ L \ K. Then dist (a, K) is not attained, since L is an immediate extension of K. So we
62
Normed spaces
are in case (i) of 2.5.42 showing that K(a) is of countable type (and infinitedimensional as K is algebraically closed), hence linearly homeomorphic to c0 (2.3.9), so it suffices to define a continuous linear map T : K(a)−→K(a) with the required properties. In fact, let T (x) := a x (x ∈ K(a)), let D = {0} be a closed invariant subspace. For d ∈ D, d = 0 we have d, a d, a 2 d, . . . ∈ D, so K[a] d = [1, a, a 2 , . . .] d ⊂ D. Now in the proof of 2.5.42(i) we found that K[a] is dense in K(a). Hence K(a) d ⊂ D. But K(a) is a field. So K(a) d = K(a), and we are done. The above proof reveals the following interesting fact. Theorem 2.5.49 Let K be algebraically closed and not spherically complete. Then on c0 there exists an equivalent norm . with c0 = |K| such that: (i) no two non-zero vectors are . -orthogonal, (ii) there is a multiplication on c0 making (c0 , . ) into a valued field. Proof. From the proof of 2.5.48 it follows that K(a) is linearly homeomorphic to c0 and that K(a) is a subfield of the spherical completion of K. Let . be the valuation on K(a). Now, if λ, µ ∈ K(a), λ ⊥ µ with respect to . and λ, µ = 0 then λ µ−1 = 0, λ µ−1 ⊥ K, which is not possible since K(a) is an immediate extension of K. Remark 2.5.50 The conclusion of 2.5.48 is true for any field K, as was recently ´ proved by Sliwa in [222].
2.5.5 Spaces of power series Throughout Subsections 2.5.5 and 2.5.6 K is algebraically closed (so its valuation is dense). By a disk we mean either K or a ball in K . Let B be a disk, f : B−→K, a ∈ B, and suppose f has a power series expan sion about a, i.e., there exist λ0 , λ1 , . . . ∈ K such that f (x) = ∞ n=0 λn (x − n a)n for all x ∈ B. Now let b ∈ B. By writing (x − a) = (x − b + b − a)n = n n i n−i and some elementary calculus one concludes that i=0 i (x − b) (b − a) n there are µ0 , µ1 , . . . ∈ K such that f (x) = ∞ n=0 µn (x − b) for all x ∈ B (for the full proof see [195], 25.1). Thus, if f has a power series expansion about some point of B then it has one about any point of B. Definition 2.5.51 For a disk B let P S(B) be the set of all f : B−→K that can be developed into a power series about some (any) point of B. The elements of P S(K) are called entire functions. Direct verification shows that P S(B) is a vector space, even a K-algebra with respect to pointwise multiplication.
2.5 Examples of Banach spaces
63
For the properties of P S(B) it makes a lot of difference whether B is “fenced” or not. Definition 2.5.52 A disk B is called fenced if it has the form B(a, r), where a ∈ K, r ∈ K × . Let us introduce some notations. Let ∅ = Y ⊂ X ⊂ K, let f : X−→K. We write f Y := sup{ |f (y)| : y ∈ Y } (admitting the value ∞). Sometimes we write f r (f − r ) instead of f B(0,r) ( f B(0,r − ) ). Finally, we shall denote the function K−→K, x → x, and its restrictions to non-empty subsets, by X. Theorem 2.5.53 Let B be the fenced disk B(a, r), where a ∈ K, r ∈ K × . Then every f ∈ P S(B) is bounded and f B(a,r) = max{|f (x)| : x ∈ B(a, r)} = f B(a,r − ) . ∞ If f (x) = n=0 λn (x − a)n is an expansion of f then limn |λn | r n = 0 and f B(a,r) = max |λn | r n . n
Proof. Choose µ ∈ K with |µ| = r. The affine transformation σ : x → a + µ x sends BK onto B, hence f → f ◦ σ sends P S(B) onto P S(BK ). Using this map the proof is reduced to the case where a = 0, r = 1. n By taking x = 1 in the expansion f (x) = ∞ n=0 λn x we see that limn λn = n 0. Since also |f (x)| ≤ maxn |λn x | ≤ maxn |λn | for all x ∈ BK we have that f is bounded and f 1 ≤ maxn |λn |. We prove that there is an x ∈ BK with |f (x)| = maxn |λn |. To this end we may assume maxn |λn | = 1. Let |λn | < 1 for n > N . From the assumption |f (x)| < 1 for all x ∈ BK we obtain N n n=0 λn x = 0 for all x ∈ k (for the meaning of the bar and k, see Section 1.2). Then a non-trivial polynomial has all the elements of k as zeros. As k is infinite this is impossible. × , r < 1}. By what we just have Finally, f − 1 = sup{f r : r ∈ K proved this equals supr<1 maxn |λn | r n = supn supr<1 |λn | r n = supn |λn | = f 1 . This finishes the proof. As a consequence we obtain that for any disk B and f ∈ P S(B) its coefficients in the expansion about any point of B are uniquely determined. Also, we derive the following. Corollary 2.5.54 Let B = B(a, r), where a ∈ K, r ∈ K × . For f ∈ P S(B), n let f (x) = ∞ n=0 λn (x − a) be its expansion. Then the map f → (λ0 , λ1 , . . .)
64
Normed spaces
is an isometrical isomorphism of P S(B) (equipped with the norm . B ) onto c0 (N ∪ {0}, s), where s(n) = r n , n ∈ N ∪ {0}. Corollary 2.5.55 For each fenced disk B the space P S(B) is isometrically isomorphic to c0 , hence of countable type. Now we study the case of non-fenced disks. Theorem 2.5.56 For every non-fenced disk B there exist unbounded functions in P S(B). Proof. Without loss, assume 0 ∈ B. The function X is in P S(K) and unbounded, so we restrict ourselves to the case B = B(0, r − ) for some r > 0. By density of the valuation we can find λn ∈ K such that 2n n ≤ |λn | ≤ n rn r
(n ∈ {0, 1, . . .}).
Because |λn x n | ≤ 2n (|x| /r)n we have limn λn x n = 0 for all x ∈ B, so n f (x) := ∞ n=0 λn x is defined on B and f ∈ P S(B). To show that f is unbounded, consider f B = sup{f v : v ∈ K × , v < r} = sup max |λn | v n v
(for the second equality apply 2.5.53).
Definition 2.5.57 For a disk B let BP S(B) be the space of all bounded functions in P S(B). Theorem 2.5.58 Let B = B(a, r − ), where a ∈ K, r > 0. For f ∈ BP S(B), n let f (x) = ∞ n=0 λn (x − a) be its expansion. Then the map f → (λ0 , λ1 , . . .) is an isometrical isomorphism of BP S(B) (equipped with the norm . B ) onto ∞ (N ∪ {0}, s), where s(n) = r n , n ∈ N ∪ {0}. Proof. We may assume a = 0. Then, by 2.5.53, f B = sup{f v : v < r, v ∈ K × } = sup max |λn | v n = sup |λn | r n , v
n
n
and the statement follows.
Corollary 2.5.59 For every non-fenced bounded disk B the space BP S(B) is linearly homeomorphic to ∞ and hence not of countable type. It remains to determine BP S(K). This is in fact the Liouville Theorem.
2.5 Examples of Banach spaces
65
Theorem 2.5.60 BP S(K) contains only the constants, i.e., a bounded entire function is constant. n Proof. Let f be entire with expansion f (x) = ∞ n=0 λn x . Let |f (x)| ≤ M for all x ∈ K (M > 0). Then, for each r > 0 and n ≥ 1, M ≥ f r ≥ |λn | r n . By letting r → ∞ we find λn = 0 for each n ≥ 1. Remark 2.5.61 In 3.7.25 we will meet another way how to deal with unboundedness of functions in P S(B(0, r − )), namely by equipping the space with the family of norms { . s : s < r}. In a sort of dual way we can also consider for B(0, r), functions that are in P S(B(0, s)) for some s > r and take s>r {f |B(0, r) : f ∈ P S(B(0, s))}. This is a subspace of P S(B(0, r)), the space of the “overconvergent power series”. See Subsection 3.7.2.
2.5.6 Analytic elements To arrive at a useful definition of analytic function on sets that are not disks we cannot simply take over the principle of analytic continuation from complex theory, because of the mercury drop behaviour of disks. Also, local analyticity is not an option since, for example, a non-empty open subset of K decomposes into disjoint disks, on each of which we can define an arbitrary power series function, so that there is no relation between the behaviour of the function in one neighbourhood and its behaviour elsewhere. To overcome this difficulty Krasner, [145], has proposed the following, see also [53]. Definition 2.5.62 Let A be a non-empty subset of K. Let R(A) be the space of all rational functions that can be defined on A (i.e., that have no poles in A). A function f : A−→K is called an analytic element on A if there exist f1 , f2 , . . . ∈ R(A) such that limn fn = f uniformly. The analytic elements on A form a vector space called H (A). If f, g ∈ H (A) are bounded then f g ∈ H (A) and f gA ≤ f A gA . Theorem 2.5.63 Let A ⊂ K be closed and bounded. Then each f ∈ R(A), hence each f ∈ H (A), is bounded. Proof. By algebraic closedness we may assume that f has the form γ
(X − λ1 )(X − λ2 ) · · · (X − λn ) (X − µ1 ) · · · (X − µm )
66
Normed spaces
for some γ , λ1 , . . . , λn ∈ K, µ1 , . . . , µm ∈ K \ A, n, m ∈ N. For each i ∈ {1, . . . , m} we have 1 1 = sup : x ∈ A = inf{|x − µi | : x ∈ A}−1 X − µ |x − µi | i A = dist (µi , A)−1 . Further, X − λj A ≤ max(M, λj ) for each j ∈ {1, . . . , n}, where M := sup{|x| : x ∈ A}. Thus, we get dist (µi , A)−1 . f A ≤ |γ | max(M, |λ1 | , . . . , |λn |) 1≤i≤m
Corollary 2.5.64 For closed bounded A ⊂ K the space H (A), equipped with the norm . A , is a Banach space, and also a K-algebra with respect to pointwise multiplication. Remark 2.5.65 It is easy to see that H (K) is the set of all polynomials in K and therefore H (K) = P S(K). The uniform topology is the discrete one and so H (K) is not a normed space. At this point it is natural to ask whether H (A) = BP S(A), where A is a bounded disk. Again, the answers are different according to whether A is fenced or not. Theorem 2.5.66 For any bounded disk A we have H (A) ⊂ BP S(A). Proof. We may assume 0 ∈ A. We show that rational functions are in P S(A) (then they are in BP S(A), by 2.5.63). Since R(A) and P S(A) are K-algebras it suffices to show that f ∈ P S(A) for all f ∈ R(A) from a set that generates R(A) as K-algebra viz. {1, X} ∪ {(X − µ)−1 : µ ∈ K \ A}. This is done by showing that (X − µ)−1 ∈ P S(A), where µ ∈ K \ A. In fact, |µ| > |x| for all x ∈ A, so ∞ 1 Xn −1 −1 = −µ ∈ P S(A). = X−µ µn µ(1 − X ) µ n=0
Next we look into the question of equality. Theorem 2.5.67 Let A = B(a, r), where a ∈ K, r > 0. Then f : A−→K n is in H (A) if and only if f has an expansion x → ∞ n=0 λn (x − a) with n limn |λn | r = 0.
2.5 Examples of Banach spaces
67
Proof. We may assume a = 0. Clearly if f has an expansion as required then f is the uniform limit on A of polynomials, hence f ∈ H (A). To prove the converse it suffices to show the statement for an f of the form (X − µ)−1 , where µ ∈ K \ A, i.e., |µ| > r. For x ∈ A we have |x/µ| < 1, so ∞ 1 −1 −1 µ−n x n , = x = −µ x−µ µ(1 − µ ) n=0
and clearly µ−n r n tends to 0, which completes the proof.
Corollary 2.5.68 Let A = B(a, r), where a ∈ K, r > 0. Then H (A) is of countable type. In fact, H (A) c0 (N ∪ {0}, s), where s(n) = r n for all n ∈ N ∪ {0}. Also, we have the following: (i) If A is fenced then H (A) = BP S(A) = P S(A). (ii) If A is not fenced then H (A) is strictly contained in BP S(A). n Proof. Let f = ∞ n=0 λn (X − a) ∈ H (A). By either 2.5.53 or 2.5.58 we have n f A = supn |λn | r , which together with 2.5.67 show that H (A) c0 (N ∪ {0}, s). Next we prove (i). By 2.5.66, it suffices to see that P S(A) ⊂ H (A). Let f ∈ P S(A). Applying 2.5.53, f is an uniform limit of polynomials, so f ∈ R(A) = H (A). Finally (ii) follows from 2.5.59. We now consider the case A = B(a, r − ) with r ∈ K × . Theorem 2.5.69 Let A = B(a, r − ), where a ∈ K, r ∈ K × . Then H (A) has an orthonormal base of cardinality k, where k is the residue class field of K. In particular, H (A) is of countable type if and only if the residue class field of K is countable. Proof. With the same reasoning as in 2.5.53 the proof is reduced to the case A = BK− . Let L be the completion of (K(X), | . |) as in 2.5.45. The assignment X → X defines a unique linear ring homomorphism : R(BK− )−→K(X). To prove that is also an isometry, first let f be a polynomial function N − n − n=0 λn X ∈ R(BK ). Then by 2.5.58 we have f BK = maxn |λn | = |(f )|. f − Now consider an element g ∈ R(BK ), where f, g are polynomial functions and g has the form (X − µ1 ) · · · (X − µm ) with |µi | ≥ 1. Then |g| is the constant |µ1 · · · µm | on BK− , hence f f BK− f . = = g − gBK− g BK
68
Normed spaces
By continuity extends to a linear isometry : H (BK− )−→L. Like in the proof of 2.5.42(iii), let σ : k−→BK be such that σ (u) = u for all u ∈ k. By using one obtains easily, following the same arguments as in 2.5.42(iii), that {Xs : s ∈ N ∪ {0}} ∪ {(X − µ)−m : µ ∈ σ (k × ), m ∈ N} is an orthonormal base of H (BK− ) (notice that here µ ∈ σ (k × ) instead of µ ∈ σ (k)). Corollary 2.5.70 Let the residue class field of K be countable. Let A ⊂ K be a bounded disk. Then, A is fenced if and only if H (A) = BP S(A). Proof. If A = B(a, r) with a ∈ K, r > 0, the statement follows from 2.5.68. If A = B(a, r − ) with r ∈ |K|, then by 2.5.69 we have H (A) = c0 (I ) where I = k, so H (A) c0 and BP S(A) ∞ (2.5.58). We see that H (A) = BP S(A). Remark 2.5.71 In 8.2.2 we will prove that ∞ does not have a base. By using this fact in the above proof we see that in 2.5.70 we may drop the countability condition. If K happens to be separable (which includes the important case K = Cp ) we can say more. Theorem 2.5.72 Let K be separable. Then, for each closed bounded set A, H (A) is separable (hence of countable type). Proof. Let S be a countable dense subset of K, S × a countable dense subset of K × , and T a countable dense subset of K\A. For each n, m ∈ {0, 1, . . .} consider the set λ0 (X − λ1 ) · · · (X − λn ) : λ0 , λ1 , . . . , λn ∈ S, Wn,m := µ0 (X − µ1 ) · · · (X − µm ) µ0 ∈ S × , µ1 , . . . , µm ∈ T . Wn,m is countable, hence so is W := n.m Wn,m . The map K−→R(A), λ → (X − λ) is continuous. To show that also K\A−→R(A), µ → (X − µ)−1 is continuous, let µ, β ∈ K \A be such that |µ − β| < dist (µ, A) = dist (β, A). Then, (X − µ)−1 − (X − β)−1 A = |µ − β| (X − µ)−1 (X − β)−1 A ≤ |µ − β| (X − µ)−1 A (X − β)−1 A = |µ − β| dist(µ, A)−1 dist(β, A)−1 = |µ − β| dist (µ, A)−2 , and continuity follows.
2.5 Examples of Banach spaces
69
Thus, (λ0 , λ1 , . . . , λn ) × (µ0 ) × (µ1 , . . . , µm ) −→
λ0 (X − λ1 ) · · · (X − λn ) µ0 (X − µ1 ) · · · (X − µm )
is a continuous surjection K n+1 × K × × (K \ A)m −→ Rn,m (A) f := ∈ R(A) : degree f = n, degree g = m . g Now S n+1 × S × × T m is dense in K n+1 × K × × (K \ A)m , so by continuity Wn,m is dense in Rn,m (A). Hence, W is dense in n,m Rn,m (A) = R(A), and we are done. Problem For non-separable K , characterize those closed and bounded A for which H( A) is of countable type. Remark 2.5.73 We leave it as an exercise for the reader to show that for the annulus A := {λ ∈ K : 0 < r1 ≤ |λ| ≤ r2 }, H (A) consists of all functions of the form x → n∈Z λn x n , where limn |λn | r2n = limn |λ−n | r1−n = 0. One can show that, indeed, if f ∈ H (A), f = 0 in some non-empty open subset of A then f = 0. However, this fails if we take for A the “less connected looking” set {λ ∈ K : |λ| ≤
1 } ∪ {λ ∈ K : 2 ≤ |λ| ≤ 3}. 2
In fact, the functions fn := (1 − Xn )−1 are in R(A), limn fn = 1 uniformly on the disk and limn fn = 0 uniformly on the annulus. So H (A) contains a nontrivial characteristic function! An even more dramatic example is furnished by compact A (e.g. A := Zp , K := Cp ). By the Weierstrass Theorem (1.2.17) every f ∈ C(A) can be uniformly approximated on A by polynomials, so we have H (A) = C(A): elements of H (A) may not even be differentiable! In order to avoid such pathologies one has restricted the theory to a class of subsets of K having properties resembling connectedness. We refer the interested reader to [53].
2.5.7 C n -functions Throughout this subsection X is a non-empty subset of K , without isolated points.
70
Normed spaces
We start with a brief introduction. Like in the classical case we say that a function f : X−→K is differentiable at a ∈ X if f (a) := limx→a (f (x) − f (a))/(x − a) exists. As usual, f (a) is called the derivative of f at a. If f is differentiable at all points of X it is called differentiable (on X); the function f : X−→K is called the derivative of f . For n ≥ 2 we define inductively the n-th derivative f (n) of f as the derivative of f (n−1) , when this derivative exists. Also, f (0) := f . The well-known rules for differentiation of sums, products, quotients and compositions of differentiable functions apply. Rational functions without poles in X are differentiable. Locally constant functions are differentiable with derivative 0. Differentiable functions are continuous. The classical approach to define C 1 -functions has disadvantages in the ultrametric context (See [195] for more objections.) Example 2.5.74 Let X be compact. Then the space {f : X−→K : f is differentiable and f is continuous} is not complete with respect to the norm f → max(f ∞ , f ∞ ). Proof. There exist (2.5.21) locally constant functions f1 , f2 , . . . on X such that limn fn (x) = x uniformly in x ∈ X. The sequence f1 , f2 , . . . is Cauchy but not convergent for the given norm as 0 = limn fn (x) = 1 for all x ∈ X. Thus, we make the requirements for a function to be C 1 somewhat stronger. Definition 2.5.75 A function f : X−→K is called continuously differentiable (sometimes called strictly differentiable), or a C 1 -function, if the difference quotient 1 f : (x, y) −→
f (x) − f (y) x−y
(x, y ∈ X, x = y)
can be extended to a continuous function 1 f : X2 −→K. The collection of all C 1 -functions on X is denoted by C 1 (X−→K). (If no confusion is to be expected we write C 1 (X) for C 1 (X−→K).) Remarks 2.5.76 (a) Clearly a C 1 -function f is continuous. Since X has no isolated points the continuous extension 1 f is unique. We have f (a) = 1 f (a, a) (a ∈ X), so f ∈ C 1 (X) implies continuity of f . The converse is not true (see [195], Remark 1 following 27.1). (b) We will see in 2.5.84 that for compact X the space C 1 (X) is a Banach space with the norm f −→ max(f ∞ , 1 f ∞ ).
2.5 Examples of Banach spaces
71
By considering second-order difference quotients f (x)−f (y) x−y
−
f (x)−f (z) x−z
y−z we can define C 2 -functions, etc. We proceed formally as follows. Definition 2.5.77 For n ∈ N set n X := {(x1 , . . . , xn ) ∈ Xn : if i = j then xi = xj }. For f : X−→K define its n-th difference quotient n f : n+1 X−→K inductively by 0 f := f and, for (x1 , . . . , xn+1 ) ∈ n+1 X, n f (x1 , . . . , xn+1 ) :=
n−1 f (x1 , x3 , . . . , xn+1 ) − n−1 f (x2 , x3 , . . . , xn+1 ) . x1 − x2
Of course some computational machinery is needed. Theorem 2.5.78 (Rules for n ) Let f, g : X−→K and let λ, µ ∈ K, n ∈ {0, 1, . . .}. Then we have the following rules: (I) For (x, y, z, x1 , . . . , xn−1 ) ∈ n+2 X, (x − y) n f (x, y, x1 , . . . , xn−1 ) + (y − z) n f (y, z, x1 , . . . , xn−1 ) = (x − z) n f (x, z, x1 , . . . , xn−1 ). (II) n f is a symmetric function of n + 1 variables. (III) For (x1 , . . . , xn+1 , a1 , . . . , an+1 ) ∈ 2n+2 X, n f (x1 , . . . , xn+1 ) − n f (a1 , . . . , an+1 ) =
n+1 (xi − ai ) n+1 f (a1 , . . . , ai , xi , . . . , xn+1 ). i=1
(IV) n (λ f + µ g) = λ n f + µ n g. (V) For (x1 , . . . , xn+1 ) ∈ n+1 X, n (f g)(x1 , . . . , xn+1 ) n k f (x1 , . . . , xk+1 ) n−k g(xk+1 , . . . , xn+1 ). = k=0
(VI) For (x1 , . . . , xn+1 ) ∈ n+1 X, n f (x1 , . . . , xn+1 ) =
n+1 (xi − xj )−1 f (xi ). i=1 j =i
72
Normed spaces
(VII) If f (x) = 0 for all x ∈ X then for g =
1 , f
(x1 , . . . , xn+1 ) ∈ n+1 X,
n g(x1 , . . . , xn+1 ) n k f (x1 , . . . , xk+1 ) n−k g(xk+1 , · · · , xn+1 ). = −f (x1 )−1 k=1
(VIII) If f is locally constant then n f = 0 in a neighbourhood of the set {(x1 , . . . , xn+1 ) ∈ X n+1 : x1 = · · · = xn+1 }. (IX) n+1 f = 0 if and only if f is a polynomial function of degree ≤ n. (X) For each r > 0 and k ∈ N ∪ {0}, k−n if k ≥ n n (Xk )(x1 , . . . , xn+1 ) ≤ r 0 if k < n, for all (x1 , . . . , xn+1 ) ∈ n+1 X for which |xi | ≤ r, i ∈ {1, . . . , n + 1}. (XI) If 0 ∈ X and f (x) = x1 for all x ∈ X then, for (x1 , . . . , xn+1 ) ∈ n+1 X, n f (x1 , . . . , xn+1 ) = (−1)n
n+1
xi−1 .
i=1
Proof. Straightforward.
Definition 2.5.79 Let f : X−→K, n ∈ {0, 1, . . .}. We say that f ∈ C n (X−→K) (or f ∈ C n (X)) if n f can (uniquely) be extended to a continuous function n f : Xn+1 −→K. The map x → Dn f (x) := n f (x, x, . . . , x) is called the n-th Hasse derivative of f . Further, let C ∞ (X−→K) (C ∞ (X)) := n C n (X−→K). From rule III we conclude that f ∈ C n+1 (X) implies f ∈ C n (X). Hence C 0 (X) = C(X) ⊃ C 1 (X) ⊃ C 2 (X) ⊃ · · · ⊃ C ∞ (X). Simple continuity arguments show that rules I, II, IV, V, VII, VIII, IX, X remain valid for functions f, g ∈ C n (X), where k is replaced by k and k X by Xk for all occurring k. It follows that C n (X) is a vector space (IV), closed under products (V) and that locally constant and polynomial functions are in C ∞ (X) (VIII and IV). By VII, if f ∈ C n (X) and f is nowhere 0 then f1 ∈ C n (X). Thus, rational functions without poles in X are in C ∞ (X). We also have a Taylor formula. Theorem 2.5.80 Let f ∈ C n (X). Then for all x, y ∈ X, f (x) = f (y) + (x − y) D1 f (y) + · · · + (x − y)n−1 Dn−1 f (y) + (x − y)n n f (x, y, y, . . . , y).
2.5 Examples of Banach spaces
73
Proof. Directly by induction; for the step n − 1 → n use the identity n−1 f (x, y, y, . . . , y) − Dn−1 f (y) = (x − y) n f (x, y, y, . . . , y). We also have the following, see [195], 29.5 for its proof.
Corollary 2.5.81 Let f ∈ C n (X). Then f is n times differentiable and f (m) = m! Dm f for 0 ≤ m ≤ n. Next we define the Banach spaces of C n -functions. Definition 2.5.82 For n ∈ {0, 1, . . .}, let BC n (X−→K) (BC n (X)) be the space of all f ∈ C n (X−→K) such that f, 1 f, . . . , n f are bounded, with the norm f −→ f n := max(f ∞ , 1 f ∞ , . . . , n f ∞ ). Remark 2.5.83 Observe that boundedness of n+1 f implies, by rule III of 2.5.78, that n f is uniformly continuous, and so f is a C n -function. Thus, if all n f are bounded then f is a C ∞ -function. Clearly if X is compact then BC n (X) = C n (X) for each n. Theorem 2.5.84 For every n ∈ {0, 1, . . .}, (BC n (X), . n ) is a Banach space. If X is compact then C n (X) is isometrically isomorphic to c0 , hence of countable type. Proof. The map T : f → (f, 1 f, . . . , n f ) is a linear isometry of BC n (X) into the product 1≤k≤n+1 BC(X k ), and a straightforward check shows that the image of T is closed in the (complete) product space. If X is compact T maps into 1≤k≤n+1 C(Xk ). Now each Xk is ultrametrizable, so by 2.5.24 C(X k ) is of countable type, and by 2.3.18 and 2.5.22, C(X k ) has a countable orthonormal base. Hence so has the product space and its closed subspace T (C n (X)) (2.3.22). Therefore, C n (X) has a countable orthonormal base. Since X is infinite C n (X) cannot be finite-dimensional, and the theorem follows. The following provides a natural converse of 2.5.84. Theorem 2.5.85 Let n ∈ {0, 1, . . .}. Suppose BC n (X) is of countable type. Then X is compact. For the proof it is convenient to extend the norm . n of 2.5.82 to any f : X−→K, as follows.
74
Normed spaces For n ∈ {0, 1, . . .} set, allowing the value ∞, n f ∞ := sup{|n f (v)| : v ∈ n+1 X} f n := max{i f ∞ : 0 ≤ i ≤ n}.
(For n = 0 we will write f ∞ rather than 0 f ∞ .) In addition, we introduce another quantity by |f (x) − f (y)| : x, y ∈ X, x = y . nf := sup |x − y|n Let Xn be the collection of all subsets of X containing precisely n + 1 elements. ˜ nf : By symmetry of n f (rule II of 2.5.78) it induces naturally a function Xn −→K via the formula ˜ n f (S) = n f (x1 , . . . , xn+1 )
(S := {x1 , . . . , xn+1 } ∈ Xn ).
˜ n f ∞ := sup{|n f (S)| : S ∈ Xn } we obviously have n f ∞ = Setting ˜ n f ∞ . For a finite subset S ⊂ X having at least two points, we define its diameter dS by max{|x − y| : x, y ∈ S}. Then 0 < dS < ∞. Lemma 2.5.86 Let n ≥ 2, Sn ∈ Xn . Then there exists an Sn−1 ∈ Xn−1 such that Sn−1 ⊂ Sn and ˜ n f (Sn ) ≤ d −1 ˜ n−1 f (Sn−1 ) . Sn Proof. Let x, y ∈ Sn be such that |x − y| = dSn . Then writing Sn = {x, y, x1 , . . . , xn−1 } we obtain ˜ n f (Sn ) = |n f (x, y, x1 , . . . , xn−1 )| = |x − y|−1 |n−1 f (x, x1 , . . . , xn−1 ) − n−1 f (y, x1 , . . . , xn−1 )| ≤ dS−1 max (|n−1 f (x, x1 , . . . , xn−1 )| , |n−1 f (y, x1 , . . . , xn−1 )|) n −1 ˜ = dS n−1 f (Sn−1 ) , n
where Sn−1 ∈ Xn−1 is either {x, x1 , . . . , xn−1 } or {y, x1 , . . . , xn−1 }.
Lemma 2.5.87 Let n ≥ 1. Then n f ∞ ≤n f . Proof. For n = 1 the formula (even with an equality sign) holds trivially, so let n ≥ 2 and Sn ∈ Xn . By using 2.5.86 repeatedly we arrive at sets Sn ⊃ Sn−1 ⊃ · · · ⊃ S1 , where Si ∈ Xi for i ∈ {1, . . . , n}, for which ˜ 1 f (S1 ) . ˜ n f (Sn ) ≤ dS−1 · · · dS−1 (2.8) n 2
2.5 Examples of Banach spaces
75
≤ Now let S1 := {x, y}. From |x − y| = dS1 ≤ dS2 ≤ · · · ≤ dSn we obtain dS−1 i −1 |x − y| for i ∈ {2, . . . , n} so that (2.8) yields the further estimate ˜ n f (Sn ) ≤ |x − y|n−1 |1 f (x, y)| = |x − y|−n |f (x) − f (y)| ≤n f , ˜ n f ∞ ≤n f . and n f ∞ =
Corollary 2.5.88 For all n ≥ 0 f n ≤ max(f ∞ , nf ). Proof. We have to prove that i f ∞ ≤ max(f ∞ , nf ) for all i ∈ {0, 1, . . . , n}. To this end we may assume that i ≥ 1. Let x, y ∈ X, x = y. If |x − y| ≥ 1 then |x − y|−i |f (x) − f (y)| ≤ |f (x) − f (y)| ≤ f ∞ , whereas, if |x − y| < 1, we have |x − y|−i |f (x) − f (y)| ≤ |x − y|−n |f (x) − f (y)| ≤n f . We see that i f ≤ max(f ∞ , nf ), and by 2.5.87 we find i f ∞ ≤ max(f ∞ , nf ). For locally constant f we have equality. Theorem 2.5.89 Let f : X−→K be locally constant. Then for n ∈ {0, 1, . . .} we have f n = max(f ∞ , nf ). Proof. By 2.5.88 and the fact that f ∞ ≤ f n we only need to prove that nf ≤ f n . By the Taylor Formula (2.5.80) and the fact that Di f = 0 for all i ≥ 1 we get f (x) = f (y) + (x − y)n n f (x, y, y, . . . , y)
(x, y ∈ X),
so that for x = y |f (x) − f (y)| = n f (x, y, y, . . . , y) ≤ n f ∞ ≤ f n , n |x − y| which proves the theorem.
The next step will be the following weak version of 2.5.85. Lemma 2.5.90 Let BC n (X) be of countable type. Then X is precompact (i.e., the closure of X in K is compact). Proof. The case n = 0 is trivial. Suppose X is not precompact. Then, for some r > 0, the balls in X of radius r form an infinite covering of X, say (Bi )i∈I . Choose ai ∈ Bi for each i ∈ I . Let D be the space of all bounded functions X−→K that are constant on each Bi . We claim that D ⊂ BC n (X) and that D, equipped with the induced topology, is linearly homeomorphic to ∞ (I ). (Then
76
Normed spaces
we have a contradiction since by 2.5.15 ∞ (I ) is not of countable type, proving the lemma.) Clearly D ⊂ C n (X) (in fact, D ⊂ C ∞ (X)). Further, if f ∈ D, x, y ∈ X, (y) x = y we have f (x)−f = 0 if x, y ∈ Bi for some i ∈ I . Whereas if x ∈ Bi , (x−y)n y ∈ Bj for i = j then |x − y| ≥ r and |f (x) − f (y)| ≤ f ∞ = sup{|f (ai )| : i ∈ I }. So we find nf
= sup x=y
|f (x) − f (y)| ≤ r −n f ∞ , |x − y|n
implying by 2.5.89 that f ∈ BC n (X) and that . ∞ is equivalent to . n on D. Then it is clear that f → (f (ai ))i∈I is a surjective linear homeomorphism D−→ ∞ (I ), which finishes the proof. Proof of 2.5.85. Again the case n = 0 is trivial. Suppose X is not compact; we derive a contradiction. By 2.5.90, X is precompact, so X is not closed in K, let a ∈ X \ X. By compactness of X the set {|x − a| : x ∈ X} is discrete with 0 as an accumulation point, say {r1 , r2 , . . .}, where r1 > r2 > · · · and limm rm = 0. For m ∈ N, let Rm := {x ∈ X : |x − a| = rm }. Then R1 , R2 , . . . is an infinite clopen covering of X. Choose am ∈ Rm for each m. Let D be the space of all f ∈ BC n (X) that are constant on each Rm and for which limm f (am ) = 0. Let λ1 , λ2 , . . . ∈ K be such that |λm | = rm−n for each m. As ∞ is not of countable type (2.5.15), we are done once we can prove that T
f −→ (λ1 f (a1 ), λ2 f (a2 ), . . .) is a linear homeomorphism of D onto ∞ . First, we are going to see that for, f ∈ D, sup m
|f (am )| |f (am )| ≤ f n ≤ max(r1n , 1) sup rmn rmn m
(which shows that T maps D homeomorphically into ∞ ). To prove the first m )| ≤ f n . We may suppose f (am ) = 0 inequality, let m ∈ N; we show that |f (a rmn f (aj ) < |f (am )|, so that so, since lim j f (aj ) = 0, there is a j > m for which |f (am )| = f (am ) − f (aj ). Also, am − aj = max(|am − a| , aj − a ) = |f (a )−f (a )| m )| |am − a| = rm . Thus, we obtain |f (a = am −a nj , which, by 2.5.89, is rmn | m j| ≤ f n . For the second inequality observe that, for f ∈ D, |f (am )| rmn |f (ak )| |f (am ) − f (ak )| ≤ sup max , . nf = sup rkn rmn rkn rkn m>k m>k
2.5 Examples of Banach spaces
rmn ≤ 1 so that the previous expression is ≤ rkn |f (am )| supm r n . Further, m
Now
f ∞ = sup m
77
supm>k max
|f (am )| |f (ak )| , rn rmn k
≤
|f (am )| n |f (am )| n rm ≤ sup r1 . n rm rmn m
Hence, by using 2.5.89, f n ≤ max(r1n , 1) sup m
|f (am )| , rmn
and we obtain the desired second inequality. To finish the proof it has only to be shown that T is surjective, i.e., we have to show that if (µ1 , µ2 , . . .) is a bounded sequence in K then the function f that has the value µλmm on each Rm , lies in D. Clearly f ∈ C ∞ (X), hence it is in C n (X). Also, limm f (am ) = limm µλmm = 0 n as (µ1 , µ2 , . . .) is bounded and λ−1 m = rm → 0. It remains to see that n f ∈ BC (X), i.e., that f n < ∞. Now f is clearly bounded, so by 2.5.89 it suffices to prove that nf is bounded. Let x, y ∈ X, x = y. We may suppose x ∈ Rm , y ∈ Rk with m > k. Then |x − y|n = rkn and |f (x) − f (y)| ≤ max(|f (ak )| , |f (am )|). So we get |f (ak )| |f (am )| rmn |f (x) − f (y)| ≤ max , |x − y|n rkn rmn rkn µm |f (am )| ≤ sup = sup λm = sup |µm | < ∞. n rm λm m m m We conclude this section by showing that, for a disk B, P S(B) can be characterized within C ∞ (B). Theorem 2.5.91 Let K be algebraically closed. Let B = B(0, r) for some r ∈ K × . Then P S(B) ⊂ C ∞ (B). In fact, if f : B−→K, then f ∈ P S(B) if and only if limn r n n f ∞ = 0. Proof. Suppose limn r n n f ∞ = 0. Then all n f are bounded functions, hence f ∈ C ∞ (B) (2.5.83), and we have the Taylor formula f (x) = f (0) + D1 f (0) x + · · · + Dn−1 f (0) x n−1 + n f (x, 0, 0, . . . , 0) x n (2.9)
78
Normed spaces
for n ∈ N, x ∈ B. Now n f (x, 0, 0, . . . , 0) x n ≤ r n n f ∞ → 0, so (2.9) yields f (x) =
∞
Dn f (0) x n
(x ∈ B),
n=0
from which f ∈ P S(B). m Conversely, let f ∈ P S(B) with expansion f (x) = ∞ m=0 λm x (x ∈ B). By using the product rule V we can prove inductively that n (Xm )∞ ≤ r m−n if n ≤ m and n (Xm ) = 0 if n > m. So λm n (Xm )∞ ≤ r n max |λm | r m−n = max |λm | r m , r n n f ∞ = r n m≥n
m≥n
m≥n
and by 2.5.53 we have limn maxm≥n |λm | r m = limn |λn | r n = 0.
In the same vein we have the next result, the proof of which is left to the reader. Theorem 2.5.92 Let K be algebraically closed. Let B = B(0, r − ) for some r > 0. Then BP S(B) ⊂ C ∞ (B). In fact, if f : B−→K, then f ∈ BP S(B) if and only if n → r n n f ∞ is bounded.
2.6 Notes Most of the basic theory of this chapter (except Section 2.4 and Subsections 2.5.4–2.5.7) can be found in [193], to which book we refer also for deeper study of Banach spaces. The non-existence of infinite-dimensional Hilbert spaces (Section 2.4) has been known for quite some time, but as analytic proofs were hard to find in the literature, we have presented the details here. Of course, despite of this, it can still be useful to study continuous bilinear or Hermitian forms on non-Archimedean normed spaces, see e.g. [7], [9], [19], [27], [42], [43], [44], [109], [138]. Surprisingly, if we allow the scalar field to have a more general so-called Krull valuation (see the notes to Chapter 1), Hilbert-like spaces appear! In fact, it was Keller who constructed in 1980, [136], an infinite-dimensional space E over a Krull valued field, having an inner product < , > in the spirit of 2.4.1, satisfying the Cauchy–Schwarz inequality and such that for each subspace D of E we have D = D ⊥⊥ ⇐⇒ D ⊕ D ⊥ = E.
(2.10)
2.6 Notes
79
The map x → |< x, x >| (x ∈ E) behaves like the square of a norm and induces a topology on E in the usual way. For a subspace D of E we have D is closed ⇐⇒ D = D ⊥⊥ .
(2.11)
Form (2.10) and (2.11) we may conclude that Keller’s space E really deserves to be called “Hilbert space”. It generated new interest in Functional Analysis over Krull valued fields, see e.g. [166]. Returning to 2.5.9, it was proved in (i) that every non-zero subspace D of c0 (I ), D of countable type, has an orthonormal base. However, one can even prove that each non-zero subspace of c0 (I ) has an orthonormal base. For the (difficult!) proof, see [193], 5.9. Part (ii) of 2.5.9 holds for arbitrary closed D if K is discretely valued (2.5.4). On the other hand, if the valuation of K is dense, (ii) may fail. In fact, by 2.5.6 there is a set I and a closed subspace D of c0 (I ) such that ∞ c0 (I )/D. In 8.2.2 we will prove that ∞ does not have a base. Suppose D has a complement D1 . Then ∞ is linearly homeomorphic to D1 by 2.1.17. Again, thanks to [193], 5.9, D1 has a base, hence also ∞ has one, a contradiction. Thus, D is not complemented in c0 (I ). The orthonormal bases of C(X) for compact X we constructed in 2.5.22 consist of characteristic functions; let us mention an important example of a base consisting of polynomials, the so-called Mahler base for C(Zp ) (K ⊃ Qp ). It is given by e0 , e1 , . . . , where x x(x − 1) · · · (x − n + 1) (n ∈ N ∪ {0}). en (x) = := n! n It is proved in [190] and [195] that it is, indeed, an orthonormal base of C(Zp ), useful for number theoretically oriented problems. The classical Banach–Stone Theorem, see e.g. [40], VI.2.1, states that if X, Y are compact Hausdorff spaces and T : C(X)−→C(Y ) is a surjective isometry, then T is a so-called Banach–Stone map, i.e., there is a homeomorphism h : Y −→X and a function g ∈ C(Y ) with |g(y)| = 1 for all y ∈ Y , such that T (f )(y) = g(y) f (h(y)) f or all f ∈ C(X), y ∈ Y (here C(X) and C(Y ) denote the sup-normed Banach spaces of real – or complex – valued functions on X and Y respectively). The non-Archimedean version of this theorem does not hold. In fact, let X be as in Subsection 2.5.3. In 1987, Beckenstein and Narici proved, [23], that if X is not rigid (i.e., the identity is not the only homeomorphism of X onto X), there are surjective isometries C(X)−→C(X) that are not Banach–Stone maps. In 1990, Araujo and Mart´ınez-Maurica, [16], extended this result to any X with more than one point, see also [10]. This fact has given rise to an interesting theory about properties and characterizations of the Banach–Stone maps in
80
Normed spaces
order to obtain certain weaker versions of the Banach–Stone Theorem in the non-Archimedean case. The above authors are the main ones responsible for the development of this theory, of which one can find a survey, up to 1997, in [11]. For later results, see e.g. [12], [13], [14], [15], [24], [25], [26]. The Banach spaces of continuous functions considered in Subsection 2.5.3 are ones of the most important examples of non-Archimedean Banach algebras. The definition of these algebras is the natural translation of the classical one, but the theory about them presents several deviations from its Archimedean counterpart. To avoid to make this chapter longer we have omitted the study of Banach algebras. For details and references on the subject we refer to [22], [54] and [193]. The Banach space theory of field extensions (Subsection 2.5.4) is new as far as we know. It is not necessary for the theory of locally convex spaces, yet we found it enough illustrative to include in this chapter. There has been quite some activity around building models in theoretical physics, where the base field is not R or C but a non-Archimedean valued field, see [47] [137], [138], [139], [140], [228], [229], for an impression. With this in mind it is natural to consider the commutation relation AB − BA = I
(2.12)
for operators A, B (where I is the identity), which plays a central role in quantum mechanics. It is well-known that, for bounded operators A, B on a non-zero Banach space over R or C, (2.12) does not hold. It is quite remarkable that in the non-Archimedean context (2.12) may have bounded solutions! In fact, let A, B : c0 −→c0 be given by A : (λ1 , λ2 , . . .) −→ (λ2 , λ3 , . . .) B : (λ1 , λ2 , . . .) −→ (0, λ1 , 2 λ2 , . . .). One checks immediately that AB − BA = I and that A ≤ 1, B ≤ 1. This example was discovered independently in [8] and [143].
3 Locally convex spaces
In this chapter we develop the basics of the main subject of this book, i.e., the theory of locally convex spaces over K. The reader will notice that Sections 3.1−3.6 contain some material that looks familiar to a classical analyst. However, we felt it convenient to give full proofs; it reveals which classical proofs can be translated and what modifications need to be made. In Section 3.1 we do not immediately consider topologies on our spaces, but introduce seminorms for which we require the strong triangle inequality, and convex sets in an algebraic way. Typical non-Archimedean features here are the solidity of a seminorm (3.1.1) and edged sets (3.1.5, 3.1.13). We prove in 3.1.11 and 3.1.14 that a convex set and a point outside it can be separated by a seminorm (implying that, contrary to the classical situation, convex sets in K n are closed, 3.4.22(i), 3.4.24). Section 3.2 is a preparation for Chapter 8 and reading of it may be postponed until that chapter is tackled. In Section 3.3 we define locally convex spaces in two equivalent ways, one by means of seminorms (3.3.7) and one that requires a neighbourhood base at 0 that consists of convex sets (3.3.16). In Section 3.4 we consider subspaces (3.4.3), quotients (3.4.6), products (3.4.9), locally convex direct sums (3.4.15), and projective (3.4.29) and inductive (3.4.32) limits of locally convex spaces. We show that every Hausdorff locally convex space can be embedded in a product of Banach spaces (3.4.10), which we use to construct completions, and prove some hereditary properties for completeness. The strongest locally convex topology is discussed in 3.4.22. Section 3.5 contains familiar-looking results on metrizable and Fr´echet spaces, including the Open Mapping Theorem 3.5.10. Bounded sets appear in Section 3.6; we then introduce quasicompleteness and sequential completeness in 3.6.7.
81
82
Locally convex spaces
At this point the theory acquires a more non-Archimedean flavour. In Section 3.7 we present various examples of locally convex spaces, thereby considering the question under what conditions they are normable, metrizable, (quasi)complete respectively. In Subsection 3.7.1 we study subspaces of C(X) equipped with a “W -topology”, where X is a non-empty zerodimensional Hausdorff topological space and W is a collection of “weight functions” (3.7.12). By varying W we obtain the topologies of pointwise convergence (3.7.1), of uniform convergence on compact sets (3.7.3), and the strict topology (3.7.14). Spaces of analytic functions with a natural locally convex topology appear in Subsection 3.7.2, among which are the space of “overconvergent power series” on a disk, the space of germs of analytic functions, and the space of rigid analytic functions (3.7.27−3.7.33). For a nonempty subset X of K without isolated points we study in Subsection 3.7.3 various spaces of C n , respectively C ∞ -functions on X; again W -topologies appear. In Section 3.8 we return to the main theory and treat compactoidity. By “convexifying” the notion of precompactness we arrive at the concept of compactoid set, which is useful for all (not only locally compact) K (3.8.1). We then can prove an Ascoli Theorem (3.8.2) and a Riesz Theorem (3.8.6) in terms of compactoid sets, show basic properties (3.8.4), and describe compactoids in products (3.8.14) and in direct sums (3.8.17). It is natural to expect that complete convex compactoids will take over the role played by the compact convex sets in classical Functional Analysis. However, this turns out to be partially true; without restrictions on K we have the following “compact like hereditary properties” only for metrizable compactoids. (Improvements can be obtained if K is spherically complete; this is the subject of Chapter 6.) If A is a complete metrizable absolutely convex compactoid and T is a continuous linear map then {λ T (A) : λ ∈ K, |λ| > 1} is complete (3.8.29(i)), but T (A) need not be (3.8.31(i)). In the same vein, if λ ∈ K, |λ| > 1, y1 , y2 , . . . ∈ T (A), yn → 0 then there is a sequence x1 , x2 , . . . in λ A tending to 0 such that T (xn ) = yn for each n (3.8.35), but the conclusion fails if λ = 1 (3.8.36). In any case, it follows that for every Hausdorff locally convex topology τ1 , weaker than the initial one τ , we have τ = τ1 on A (3.8.38). The aim of Section 3.9 is to derive a characterization of compactoidity (3.9.16) in terms of “orthogonality” (a notion that is a natural extension of “orthogonality”, 2.2.11, in the normed case). It says that any bounded subset X of a locally convex space is a compactoid if and only if each “orthogonal” sequence in X tends to 0. The technical Section 3.10 gives another characterization for compactoids in normed spaces, which will be needed in Chapter 8.
3.1 Seminorms and convexity
83
3.1 Seminorms and convexity In this section we set up an algebraic preparation for the sequel. Recall that vector spaces are over K. Definition 3.1.1 A seminorm on a vector space E is a map p : E−→[0, ∞) such that (i) p(x + y) ≤ max(p(x), p(y)), (ii) p(λ x) = |λ| p(x), for all x, y ∈ E, λ ∈ K. The seminorm is called solid if p(E) ⊂ |K| (see 2.1.10). If the valuation of K is dense every seminorm p is solid; if the valuation of K is discrete then p is solid if and only if p(E) ⊂ |K|. For a seminorm p we have p(0) = 0 but p(x) is allowed to be 0 for non-zero x. Ker p := {x ∈ E : p(x) = 0} is a subspace of E. Each norm is a seminorm that vanishes only at 0. A typical example of a seminorm is the function f −→ max{|f (y)| : y ∈ Y }
(f ∈ C(X)),
where X is a zero-dimensional non-compact Hausdorff space and Y ⊂ X is compact. Definition 3.1.2 Let p, q be seminorms on a vector space E. For x ∈ E set (p ∨ q)(x) := max(p(x), q(x)) (p ∧ q)(x) := inf{max(p(y), q(z)) : y, z ∈ E, x = y + z}. One verifies easily that p ∨ q and p ∧ q are seminorms, that p ∨ q is the smallest seminorm that is ≥ p and ≥ q, and that p ∧ q is the largest seminorm that is ≤ p and ≤ q. Thus, in a natural way, the set of all seminorms on E is a lattice. If p, q are solid then so are p ∨ q and p ∧ q. Our second object of study in this section is absolute convexity. Definition 3.1.3 A subset A of a vector space E is called absolutely convex if it is a BK -submodule of E; in other words, if 0 ∈ A and λ x + µ y ∈ A for all λ, µ ∈ BK , x, y ∈ A. Clearly the intersection of any non-empty collection of absolutely convex sets in E is absolutely convex. Linear subspaces are absolutely convex.
84
Locally convex spaces
Definition 3.1.4 Let X be a subset of a vector space E. Its absolutely convex hull, aco X, is the intersection of all absolutely convex sets containing X. If E is a topological vector space we write aco X instead of aco X. We have aco ∅ = {0}, and if X = ∅, aco X = {λ1 x1 + · · · + λn xn : n ∈ N, λ1 , . . . , λn ∈ BK , x1 , . . . , xn ∈ X}. The union of a nested collection of absolutely convex sets is absolutely convex. The image and inverse image of an absolutely convex set under a linear map are absolutely convex. Finite sums of absolutely convex sets are absolutely convex. The absolutely convex subsets of K are {0}, K, B(0, r), B(0, r − ), where r ∈ (0, ∞). The fact that for a seminorm p on E and r > 0 the p-balls {x ∈ E : p(x) ≤ r} and {x ∈ E : p(x) < r} are absolutely convex reveals a connection between seminorms and absolutely convex sets. We need some styling to shape it into a 1 − 1 correspondence. Definition 3.1.5 For an absolutely convex subset A of a vector space we define the edged hull Ae of A by Ae := {λ A : λ ∈ K, |λ| ≤ r}. r>1
In other words, A = A if the valuation of K is discrete and Ae = {λ A : λ ∈ K, |λ| > 1} if the valuation of K is dense. A is called edged if A = Ae . Mainly for later use we list the following facts, leaving the easy proofs to the reader. e
Theorem 3.1.6 Let A, B be absolutely convex subsets of a vector space. Then we have the following: (i) (ii) (iii) (iv) (v)
Ae is absolutely convex. Aee = Ae . (A ∩ B)e = Ae ∩ B e . (A + B)e ⊃ Ae + B e . (A + B)e = (Ae + B e )e = (Ae + B)e .
Remarks 3.1.7 (a) For an example where the inclusion in (iv) is strict, see 3.8.32. (b) As for the behaviour of edged sets under linear maps T : E−→F (E, F vector spaces) we have the following obvious facts. If A ⊂ E, B ⊂ F are absolutely convex then T −1 (B e ) = T −1 (B)e and T (Ae ) ⊂ T (A)e .
3.1 Seminorms and convexity
85
This last inclusion is not always an equality (however, see 6.2.3). In fact, let K have dense valuation. Let A := Bc0 and let T : c0 −→K, (λ1 , λ2 , . . .) → ∞ e n=1 λn µn , where 0 < |µ1 | < |µ2 | < . . . , limn |µn | = 1. Then T (A ) = − e T (A) = BK = BK = T (A) . In K all balls of the form B(0, r) (r > 0) are edged. If there is a ball B about 0 − not having × this form thene the valuation of K is dense and B = B(0, r ), where r ∈ K . In this case B = B(0, r). For any seminorm p on a vector space E and r > 0 the p-ball {x ∈ E : p(x) ≤ r} is edged. We need one more notion, which will occur frequently in the sequel. Definition 3.1.8 An absolutely convex subset A of a vector space E is called absorbing if for every x ∈ E there is a λ ∈ K such that x ∈ λ A, i.e., if E= {λ A : λ ∈ K} = [A]. Note that if A, B ⊂ E are absorbing then so are A ∩ B, A + B and (A + B)e . Now we are able to describe the announced 1 − 1 correspondence. Theorem 3.1.9 Let E a vector space. Then we have the following: (i) For each seminorm p on E its “closed unit ball” Ap := {x ∈ E : p(x) ≤ 1} is absolutely convex, absorbing and edged. (ii) For each absorbing absolutely convex set A ⊂ E its associated “Minkowski function” or “gauge” x −→ pA (x) := inf{|λ| : λ ∈ K, x ∈ λ A}
(x ∈ E)
is a solid seminorm on E. (iii) The map A → pA is a 1 − 1 correspondence between the absorbing edged subsets of E and the solid seminorms on E. Its inverse is p → Ap . Proof. Direct verification yields (i) and (ii); we now prove (iii). If the valuation of K is discrete and pA (x) > 0 the infimum in (ii) is a minimum, so that for each absorbing absolutely convex A ⊂ E A = {x ∈ E : pA (x) ≤ 1} whereas, in case the valuation of K is dense, {x ∈ E : pA (x) < 1} ⊂ A ⊂ {x ∈ E : pA (x) ≤ 1} implying Ae = {x ∈ E : pA (x) ≤ 1}.
86
Locally convex spaces
It follows that A → pA is injective. To prove surjectivity, let p be a solid seminorm on E and set A := {x ∈ E : p(x) ≤ 1}. Then, for each x ∈ E, pA (x) = inf{|λ| : λ ∈ K, x ∈ λ A} = inf{|λ| : λ ∈ K, p(x) ≤ |λ|}, which equals p(x) since p is solid. Thus, p = pA and we are done. The following obvious rules connect the lattice structure of the set of solid seminorms and the family of (edged) absolutely convex sets. Theorem 3.1.10 Let A, B be absorbing absolutely convex subsets of a vector space E. Then pA∩B = pA ∨ pB and pA+B = pA ∧ pB = p(A+B)e . As a further justification for choosing 3.1.3 for absolute convexity, we will show that every absolutely convex set is the intersection of balls of the form {x : p(x) < 1}, where p runs through some collection of (solid) seminorms, and also, similarly, that each edged set is the intersection of balls of the form {x : p(x) ≤ 1}. Theorem 3.1.11 Let A be an absolutely convex subset of a vector space E, let x ∈ E, x ∈ A. Then we have the following: (i) There is a seminorm p on E with p(E) ⊂ |K| such that p(y) < 1 for each y ∈ A and p(x) = 1. (ii) If, in addition, A is edged then p can be chosen such that p(y) ≤ 1 for each y ∈ A and p(x) > 1. Proof. (i). By using Zorn’s Lemma we obtain the existence of an absolutely convex subset U of E that is maximal with respect to the properties A ⊂ U and x ∈ U . Then BK− x + U is absolutely convex, contains U , and x ∈ BK− x + U (if x ∈ λ x + U for some λ ∈ BK− then (1 − λ)−1 ∈ BK and x ∈ (1 − λ)−1 U , so that x ∈ U , a contradiction). So, by maximality, BK− x ⊂ U.
(3.1)
Now let y ∈ E, y = 0. To prove that some non-zero multiple of y lies in U we may assume Ky + U U . Hence x ∈ Ky + U , i.e., x = λ y + u for some λ ∈ K × , u ∈ U . Choose ρ ∈ K, 0 < |ρ| < 1 . We see that ρ λ y = ρ x − ρ u ∈ U by (3.1). Thus, U is absorbing. Let pU be the Minkowski function associated to U . Then, since {z ∈ E : pU (z) < 1} ⊂ U ⊂ {z ∈ E : pU (z) ≤ 1}, and by (3.1), we have pU (λ x) ≤ 1 for all λ ∈ BK− .
(3.2)
3.1 Seminorms and convexity
87
To continue the proof of (i), we first assume that the valuation of K is discrete. Then A is edged and clearly pU (E) ⊂ |K|. Further, U = {z ∈ E : pU (z) ≤ 1} and since x ∈ U we have pU (x) > 1. Also, by (3.2) pU (x) = |ρ|−1 , with ρ a uniformizing element. Then take p := |ρ| pU . Observe also that the seminorm pU satisfies the requirements of (ii). Next assume that K is densely valued. Then it follows from (3.2) that pU (x) ≤ 1. But pU (x) < 1 would imply x ∈ U , a contradiction. So pU (x) = 1. Also, U = {z ∈ E : pU (z) < 1}. In fact, suppose pU (u) = 1 for some u ∈ U . Then Ku + U is an absolutely convex set that properly contains U . By maximality of U , x ∈ Ku + U . There is a λ ∈ K for which x − λ u ∈ U . Since x ∈ U we must have |λ| > 1. As pU (x − λ u) ≤ 1 and pU (λ u) = |λ| > 1 we arrive at pU (x) = pU (λ u) > 1, which is a contradiction. To finish the proof of (i) for the densely valued case we only have to see that pU (E) ⊂ |K| (then p := pU satisfies the requirements). Take z ∈ E, pU (z) = 0. With the same reasoning as before we conclude that the set Kz + U must contain x. Thus x = λ z + u for some λ ∈ K × , u ∈ U . So pU (x − λ z) = pU (u) < 1 = pU (x), which implies that pU (x) = pU (λ z) = 1. Hence, pU (z) = |λ|−1 ∈ |K|. Next we prove (ii). If the valuation of K is discrete the result has already been obtained in the proof of (i). Now suppose that the valuation of K is dense. Since x ∈ A = Ae there is a λ ∈ K with |λ| > 1 such that x ∈ λ A. Applying (i), we find a seminorm q on E with q(E) ⊂ |K| such that q(λ A) < 1 and q(x) = 1. Then p := |λ| q satisfies the conditions required in (ii). Absolutely convex sets always contain 0. We now define the general nonArchimedean version of convexity. Definition 3.1.12 A subset C of a vector space E is called convex if it is either empty or an additive coset of an absolutely convex set, i.e., of the form x + A, where x ∈ E, A ⊂ E absolutely convex. Note that a convex set is absolutely convex if and only if it contains 0. If A is absolutely convex, x, y ∈ E and x + A = y + A then x − y ∈ A ⊂ Ae , so x + Ae = y + Ae . This makes the following notion meaningful.
88
Locally convex spaces
Definition 3.1.13 Let C be a convex subset of a vector space E. If C = ∅, set C e := ∅. Otherwise, C = x + A where x ∈ E, A ⊂ E absolutely convex. Then set C e := x + Ae . C is called edged if C = C e . The following is an immediate consequence of 3.1.11. Corollary 3.1.14 Let C be a convex subset of a vector space E, let x ∈ C. Then there is a collection P of (solid) seminorms on E such that C= {y ∈ E : p(y − x) < 1}. p∈P
If, moreover, C is edged we can select P in such a way that C= {y ∈ E : p(y − x) ≤ 1}. p∈P
A more direct way of defining convexity, resembling the classical definition is presented in the following (see also (3.4)). Theorem 3.1.15 Let C be a subset of a vector space E. Then C is convex if and only if x, y, z ∈ C, λ, µ, ν ∈ BK , λ + µ + ν = 1 =⇒ λ x + µ y + ν z ∈ C. (3.3) Proof. Let C be convex. Then (3.3) holds if C = ∅, so assume C = a + A, where a ∈ E and A ⊂ E is absolutely convex. To get (3.3) write x = a + v1 , y = a + v2 , z = a + v3 , where v1 , v2 , v3 ∈ A. Then λ x + µ y + ν z = λ (a + v1 ) + µ (a + v2 ) + ν (a + v3 ) = a + λ v1 + µ v2 + ν v3 ∈ a + A, which proves (3.3). Conversely, suppose (3.3) holds and assume C = ∅. Choose a ∈ C, set A := −a + C; we prove that A is absolutely convex. In fact, 0 ∈ A and for x = −a + c1 , y = −a + c2 , where c1 , c2 ∈ C and λ, µ ∈ BK we have λ x + µ y = −(λ + µ) a + λ c1 + µ c2 = −a + (1 − λ − µ) a + λ c1 + µ c2 ∈ −a + C = A, and we are done. The intersection of any collection of convex subsets of E is convex, which enables us to define the following. Definition 3.1.16 Let X be a subset of a vector space E. Its convex hull, co X, is the intersection of all convex sets containing X. If E is a topological vector space we write co X instead of co X.
3.1 Seminorms and convexity
89
It is easily checked that co X= λ1 x1 + · · · + λn xn : n ∈ N, λ1 , . . . , λn ∈ BK , x1 , . . . , xn ∈ X,
n
λi = 1 .
i=1
The union of a nested collection of convex sets is convex. The image and inverse image of a convex set under a linear map are convex. Finite sums of convex sets are convex, linear manifolds are convex. The convex sets of K are ∅, singleton sets, balls, K. With the classical definition of convexity in mind one may wonder whether the version of (3.3) involving only two points, x, y ∈ C, λ, µ ∈ BK , λ + µ = 1 =⇒ λ x + µ y ∈ C,
(3.4)
implies convexity of C. This question may not be so important but the answer is rather peculiar. Theorem 3.1.17 The following are equivalent: (α) For each vector space E and subset C ⊂ E, (3.4) implies convexity of C. (β) The residue class field k of K has at least three elements. Proof. (α) =⇒ (β). Suppose k = 2; we produce a non-convex set C ⊂ K 2 satisfying (3.4). In fact, let C := B(0, 1− ) ∪ B(e1 , 1− ) ∪ B(e2 , 1− ), where the balls are with respect to the canonical maximum norm on K 2 and e1 , e2 are the unit vectors. One checks readily that the union of any two of these three balls is convex, so (3.4) holds. But 0, e1 , e2 ∈ C, (−1) 0 + e1 + e2 = e1 + e2 ∈ C, so C is not convex. (β) =⇒ (α). Let k ≥ 3 and suppose C ⊂ E satisfies (3.4). To prove convexity we may assume (translates of C also satisfy (3.4)) that 0 ∈ C. Let x, y ∈ C, λ, µ ∈ BK ; we show λ x + µ y ∈ C. First, notice that for each α ∈ BK we have α x = α x + (1 − α).0 ∈ C, similarly α y ∈ C. By assumption k has an element different from 0 or 1, so there is a β ∈ BK such that |β| = |1 − β| = 1. Then λ β −1 x and µ (1 − β)−1 y are in C and by (3.4) also λ x + µ y = β (λ β −1 x) + (1 − β) (µ (1 − β)−1 y) ∈ C.
90
Locally convex spaces
3.2 Absolutely convex sets of countable type This section will be needed in Chapter 8, see 8.6.5. An absolutely convex subset A of a K-vector space is called c-countably generated if there exists a countable set X ⊂ A such that A = aco X. Lemma 3.2.1 One-dimensional absolutely convex sets are c-countably generated. Proof. Let A be a one-dimensional absolutely convex set. We may assume A ⊂ K. We distinguish three cases: (i) A = BK (0, r) where r ∈ |K|. Then A = aco {λ}, with λ ∈ K, |λ| = r. (ii) A is bounded but not of the form (i). Then the valuation of K is dense and A = BK (0, r − ) for some r > 0. Let λ1 , λ2 , . . . ∈ K, |λ1 | < |λ2 | < · · · , limn |λn | = r. It is easily seen that A = aco {λ1 , λ2 , . . .}. (iii) A = K. Let λ1 , λ2 , . . . ∈ K, limn |λn | = ∞. Then A = aco {λ1 , λ2 , . . .}. Lemma 3.2.2 Finite-dimensional absolutely convex sets are c-countably generated. Proof. Let E be a finite-dimensional K-vector space, let A ⊂ E be absolutely convex. We will proceed by induction with respect to n := dim E. The case n = 1 is covered by 3.2.1. For the induction step n − 1 → n, let dim E = n. We may assume A = {0}; let x ∈ A, x = 0, let π : E−→E/Kx be the canonical map. Then π(A) is absolutely convex and by the induction hypothesis there is a countable set X1 ⊂ A such that π(A) = π (aco X1 ). By 3.2.1 there is a countable set X2 ⊂ Kx ∩ A such that Kx ∩ A = aco X2 . One verifies directly that then A = aco (X1 ∪ X2 ). Now we extend 3.2.2. Theorem 3.2.3 Let E a K-vector space of countable dimension. Then every absolutely convex subset of E is c-countably generated. Proof. Let D1 ⊂ D2 ⊂ · · · be subspaces of E such that dim Dn = n for each n and n∈N Dn = E. Let A ⊂ E be absolutely convex. Then, for each n, Dn ∩ A = aco Xn for some countable Xn ⊂ Dn ∩ A (by 3.2.2). Now from A = n∈N Dn ∩ A it then follows that A = aco ( n∈N Xn ) and we are done. The topological version of the above result for normed spaces of countable type is covered by the following.
3.3 Definition of a locally convex space
91
Theorem 3.2.4 Let E be a normed space of countable type. Then, for each absolutely convex set A ⊂ E there is a countable X ⊂ A such that A ⊂ aco X. For the proof we introduce the following notion. Let B ⊂ A ⊂ E, where E is a normed space. Let ε > 0. We say that B is ε-dense in A if for each x ∈ A there is a y ∈ B such that x − y < ε. Lemma 3.2.5 Let A be an absolutely convex subset of a normed space E of countable type. Let ε > 0. Then there exists a countable set X ⊂ A such that aco X is ε-dense in A. Proof. We may assume that E is infinite-dimensional. Let D be a subspace of countable dimension that is dense in E. Let Aε := A + B(0, ε− ). Then Aε is absolutely convex and open so that D ∩ Aε is dense in Aε . By 3.2.3, D ∩ Aε = aco Y for some countable Y . For each y ∈ Y , choose a y ∈ A such that y − y < ε, and let X := {y : y ∈ Y }. Then X is countable and X ⊂ A. To show that aco X is ε-dense in A, let x ∈ A. There is an x1 ∈ D ∩ Aε such that x − x1 < ε (since D ∩ Aε is dense in Aε ). x1 has the form ni=1 λi yi where n ∈ N, λi ∈ BK , yi ∈ Y . Put x2 :=
n
λi yi .
i=1
Then x2 ∈ aco X and x2 − x ≤ max(x2 − x1 , x1 − x) = max(
n
λi (yi − yi ), x1 − x)
i=1
≤ max( max yi − yi , x1 − x) < ε 1≤i≤n
and we are done.
Proof of 3.2.4. Let A ⊂ E be absolutely convex. For each n ∈ N we can, by 3.2.5, find a countable Xn ⊂ A such that aco Xn is n1 -dense in A. Then obviously, by taking X := n∈N Xn we have that aco X is dense in A and X is countable.
3.3 Definition of a locally convex space Recall that a topological vector space (over K) is a vector space E together with a topology τ such that the vector operations are continuous.
92
Locally convex spaces
Definition 3.3.1 Let E be a vector space, let p be a seminorm on E. (i) A subset U of E is called p-open if for each x ∈ U there is an r > 0 such that {y ∈ E : p(y − x) < r} ⊂ U . The collection of all p-open sets is called the p-topology. (ii) Let πp : E−→E/Ker p be the natural map, write Ep := E/Ker p. The assignment πp (x) −→ p(x)
(x ∈ E)
defines a norm on Ep which we denote by p. The following two theorems are classical. Theorem 3.3.2 Let p be a seminorm on a vector space E. Then the p-topology makes E into a topological vector space. The sets {x ∈ E : p(x) < r}, where r > 0, form a neighbourhood base of 0 for the p-topology and p is continuous. The p-topology is Hausdorff if and only if p is a norm. In general, Ker p is the closure of {0} in the p-topology. Theorem 3.3.3 Let p, q be seminorms on a vector space E. Then the following are equivalent: (α) (β) (γ ) (δ)
q is p-continuous. The q-topology is weaker than the p-topology. There is a constant C > 0 such that q ≤ C p. Ker p ⊂ Ker q and the natural map Ep −→Eq given by πp (x) → πq (x) (x ∈ E) is a continuous linear map of the normed space (Ep , p) to the normed space (Eq , q).
Definition 3.3.4 Two seminorms p, q on a vector space are called equivalent if the p-topology and the q-topology coincide. Clearly, p, q are equivalent if and only if there exist positive constants c, C such that c p ≤ q ≤ C p (compare with 2.1.7). Lemma 3.3.5 Every seminorm is equivalent to a solid seminorm. Proof. If the valuation of K is dense every seminorm is solid, so there is nothing to prove. If the valuation of K is discrete and p is a seminorm on a vector space E, as in the proof of 2.1.9, we set q(x) := max{|λ| : λ ∈ K, |λ| ≤ p(x)}
(x ∈ E).
One checks easily that q is a seminorm on E with q(x) ∈ |K| for all x ∈ E and that |ρ| p ≤ q ≤ p, where ρ is a uniformizing element.
3.3 Definition of a locally convex space
93
In the sequel we will be interested in the topology induced by seminorms rather than in the seminorms themselves. Then, by the above lemma, it will cause no harm to restrict ourselves to solid seminorms only. In doing so we will avoid needless technical difficulties. From now on in this book (semi)norms are assumed to be solid. The proof of the following theorem is basically classical and left to the reader. Theorem 3.3.6 Let P be a collection of seminorms on a vector space E. For a topology τ on E the following are equivalent: (α) τ is the weakest topology on E making all p ∈ P continuous. (β) τ is the union of all p-topologies where p ∈ P. (γ ) A subset U ⊂ E is τ -open if and only if for each x ∈ U there exist p1 , . . . , pn ∈ P and r > 0 such that {y ∈ E : max pi (y − x) < r} ⊂ U. 1≤i≤n
Definition 3.3.7 A topology τ on a vector space E is called a locally convex topology if there exists a collection P of seminorms that induces τ , or generates τ , i.e., such that (α)–(γ ) of the above theorem hold. The pair (E, τ ) is called a locally convex space (over K). Frequently we will write E instead of (E, τ ). Now let (E, τ ) be a locally convex space with a generating family P of seminorms. The set of all τ -continuous seminorms may be strictly bigger than P. But for a τ -continuous seminorm q, the set U := {x ∈ E : q(x) ≤ 1} is a τ -zero neighbourhood. So there are p1 , . . . , pn ∈ P and r > 0 such that {x ∈ E : max1≤i≤n pi (x) < r} ⊂ U . It follows easily that q ≤ r −1 max1≤i≤n pi (recall that seminorms are solid!). This observation leads to the following. Definition 3.3.8 A collection P of seminorms on a vector space E is called saturated if: (i) p, q ∈ P implies p ∨ q ∈ P, (ii) p ∈ P, c ∈ |K| implies c p ∈ P, (iii) If p ∈ P, if q is a seminorm, q ≤ p then q ∈ P. The next theorem can be proved in a straightforward manner. Theorem 3.3.9 For any collection P of seminorms on a vector space E the smallest saturated collection P ∼ that contains P exists. It is the set of all seminorms q on E for which q ≤ C max(p1 , . . . , pn ) for certain C > 0,
94
Locally convex spaces
p1 , . . . , pn ∈ P. Let τ be the locally convex topology on E induced by P. Then P ∼ is the largest collection of seminorms inducing τ ; it is the collection of all τ -continuous seminorms. The map assigning to a locally convex topology the collection of its continuous seminorms, is a 1 − 1 correspondence between all locally convex topologies on E and all saturated sets of seminorms on E. Of some importance is also the notion “base of continuous seminorms”. Definition 3.3.10 A collection P of continuous seminorms on a locally convex space E is called a base of continuous seminorms if for every continuous seminorm p there exist a q ∈ P and a C > 0 such that p ≤ C q. Let P be any collection of seminorms on a vector space E inducing a locally convex topology τ . Then the set P := {max(p1 , . . . , pn ) : n ∈ N, p1 , . . . , pn ∈ P} is a base of τ -continuous seminorms, and the sets {x ∈ E : p(x) < r}, where p ∈ P , r > 0 form a τ -neighbourhood base at 0. We now will establish an alternative definition of local convexity that at the same time explains the terminology (3.3.16). To this end we derive some facts on convexity and seminorms on arbitrary topological vector spaces. Theorem 3.3.11 Let E be a topological vector space. Let C ⊂ E be convex. Then we have the following: (i) The closure C of C is convex. (ii) The interior int C of C is convex. Much more than that, if int C = ∅ then C is clopen. (iii) C e ⊂ (C)e . (iv) C e is closed if and only if C ⊂ C e . Proof. By using translations it is enough to prove the statements for absolutely convex C. (i). Let x, y ∈ C, λ, µ ∈ BK . There exist nets (xi )i , (yi )i in C converging to x, resp. y. By continuity of vector operations we have λ x + µ y = limi (λ xi + µ yi ) ∈ C. (ii). Assume int C = ∅. Let U be an open non-empty subset of C, choose x ∈ C. By absolute convexity x + U ⊂ C and, since E is a topological vector space, x + U is open. This proves that C is open. Hence, all its cosets are open and so is {x + C : x ∈ E \ C}, which equals E \ C because C is an additive group. We conclude that C is closed. (iii). By (i), C is absolutely convex, so (C)e is defined, and clearly C e ⊂ (C)e . Since (C)e is closed we have C e ⊂ (C)e .
3.3 Definition of a locally convex space
95
(iv). If C e is closed then from C ⊂ C e we obtain C ⊂ C e . Conversely, if C ⊂ C e then (C)e ⊂ C e and by (iii) C e ⊂ C e . Remark 3.3.12 Let the valuation of K be dense. There exist non-closed absolutely convex sets A such that Ae is closed. In fact, let E := c0 and choose λ1 , λ2 , . . . ∈ K with limn |λn | = ∞. Set A := {(µ1 , µ2 , . . .) ∈ c0 : sup |λn µn | < 1}. n∈N
Then A = {(µ1 , µ2 , . . .) ∈ c0 : supn∈N |λn µn | ≤ 1}, so it is a closed subset of c0 . However, A is not closed. To see this, choose µ1 , µ2 , . . . ∈ K such that |λ1 µ1 | < |λ2 µ2 | < · · · , limn |λn µn | = 1. Then x := (µ1 , µ2 , . . .) ∈ A but x = limn (µ1 , . . . , µn , 0, 0, . . .) ∈ A. e
e Problem Does there exist an absolutely convex set A with Ae = A ? Equivalently, does there exist an absolutely convex edged set B such that B is not edged? Lemma 3.3.13 Let E be a topological vector space. For a seminorm p on E the following assertions are equivalent: (α) (β) (γ ) (δ)
p is continuous. p is continuous at 0. For each r > 0 the set {x ∈ E : p(x) < r} is open. {x ∈ E : p(x) < 1} is open.
Proof. The implications (α) =⇒ (β) =⇒ (γ ) =⇒ (δ) are evident. To prove (δ) =⇒ (α), let x ∈ E, r > 0. We produce a neighbourhood V of x such that |p(v) − p(x)| < r for all v ∈ V . To this end, set U := {y ∈ E : p(y) < 1}, choose λ ∈ K, 0 < |λ| < r. Then, since vector operations are continuous, V := x + λ U is open. Now let v = x + λ u ∈ V , where u ∈ U . Then |p(v) − p(x)| ≤ p(v − x) = p(λ u) = |λ| p(u) < |λ| < r. Corollary 3.3.14 For a continuous seminorm p on a topological vector space E the sets {x ∈ E : p(x) ≤ r} and {x ∈ E : p(x) < r} (r > 0) are clopen. Proof. Use the lemma and 3.3.11(ii).
Theorem 3.3.15 Let E be a topological vector space. Then we have the following: (i) Every zero neighbourhood is absorbing. (ii) If A ⊂ E is absolutely convex and absorbing then pA is continuous if and only if A is a zero neighbourhood.
96
Locally convex spaces
Proof. Continuity of K−→E, λ → λ x at 0 for each x ∈ E implies (i). To prove (ii) let A ⊂ E be absolutely convex and absorbing. If pA is continuous then, by 3.3.13, BA := {x ∈ E : pA (x) < 1} is a zero neighbourhood, hence so is A. Conversely, suppose A is a zero neighbourhood. Since BA contains a multiple of A, it follows from 3.3.11(ii) that BA is open. Thus, pA is continuous, again by 3.3.13. Now we arrive at the desired characterization. Corollary 3.3.16 A topological vector space (E, τ ) is locally convex if and only if it has a base (of zero neighbourhoods) consisting of (absolutely) convex sets. Proof. We only need to prove the “if”. So let the τ -open absolutely convex sets form a base B of zero neighbourhoods. Let P be the collection of all τ continuous seminorms on E and let τ be the locally convex topology induced by P. By construction τ ≤ τ . Also, using 3.3.15 we obtain that for each U ∈ B its Minkowski function pU is in P and so U is a τ -zero neighbourhood. Hence τ ≤ τ . Corollary 3.3.17 Let E be a locally convex space. The map U → pU is a 1 − 1 correspondence between the absolutely convex edged zero neighbourhoods of E and the continuous seminorms on E.
Proof. 3.1.9(iii) and 3.3.15.
Any normed space is, of course, a locally convex space with respect to the norm topology. Conversely, a locally convex space is called normable if its topology is induced by a single norm. Examples of typically non-normable spaces will be treated in Section 3.7. There exist topological vector spaces that are not locally convex; it is not difficult to find somewhat pathological examples in the spirit of classical analysis, see [41], [110]. However, the space below may be more illustrative to a classical analyst. Note 2 is not locally convex. 2 Let 2 be the set of all sequences (λ1 , λ2 , . . .) ∈ K N for which ∞ n=1 |λn | < ∞. 2 It is easily seen that is a vector space under coordinatewise operations and that ∞ |λn |2 x = (λ1 , λ2 , . . .) −→ N(x) := n=1
3.4 Basic facts and constructions
97
defines an A-norm (see 2.1.2) on 2 . This A-norm N induces a topology τ on 2 in the usual way making 2 into a topological vector space. We now show that τ is not locally convex. Suppose it was. Then the N -unit ball contains an absolutely convex zero neighbourhood U and, in its turn, U contains an N -ball about 0. Thus, there exists a ρ ∈ K, 0 < |ρ| < 1 such that {x ∈ 2 : N(x) ≤ |ρ|} ⊂ U ⊂ {x ∈ 2 : N(x) ≤ 1}. Apparently, the vectors x1 := (ρ, 0, 0, . . .), x2 = (0, ρ, 0, . . .), . . . are in U and by absolute convexity x1 + · · · + xn ∈ U for each n ∈ N. But N (x1 + · · · + √ xn ) = |ρ| n conflicting the N-boundedness of U . Remark 3.3.18 A similar procedure works for p , where p ∈ R, 1 ≤ p < ∞.
3.4 Basic facts and constructions Definition 3.4.1 Let E, F be locally convex spaces. The collection of all continuous linear maps E−→F form in a natural way a vector space denoted by L(E, F ). We write L(E) := L(E, E), E := L(E, K). E is called the dual space (or simply dual) of E. By E ∼ F we mean that there is a linear homeomorphism of E onto F and then we say that E is isomorphic to F . An embedding E−→F is a linear homeomorphism of E onto the image. Theorem 3.4.2 Let E, F be locally convex spaces. Let P be a collection of seminorms on F generating its topology. For a linear map T : E−→F the following are equivalent: (α) T ∈ L(E, F ). (β) T is continuous at 0. (γ ) For every q ∈ P there is a continuous seminorm p on E such that q(T (x)) ≤ p(x) for all x ∈ E. (δ) For every q ∈ P the function q ◦ T is a continuous seminorm on E. Proof. Straightforward.
We now consider subspaces and quotients of locally convex spaces. When talking about subspaces of locally convex spaces we shall, unless explicitly stated otherwise, assume that their topology is the inherited one. It is induced by the restrictions of all continuous seminorms. It is useful to know that this way one obtains all continuous seminorms on the subspace.
98
Locally convex spaces
Theorem 3.4.3 Let D be a subspace of a locally convex space E. Then every continuous seminorm on D can be extended to a continuous seminorm on E. Proof. Let q be a continuous seminorm on D. The family {p|D : p is a continuous seminorm on E} generates the topology on D and is closed with respect to the forming of finite maxima and multiplication by numbers in |K|, so it is a base of continuous seminorms and there is a continuous seminorm q1 on E such that q ≤ q1 on D. The formula p(x) := inf{max(q(d), q1 (x − d)) : d ∈ D} defines a seminorm p on E for which p ≤ q1 (so p is continuous) and p = q on D. We now look at quotients. Definition 3.4.4 Let p be a seminorm on a vector space E, let D be a subspace of E, let π : E−→E/D be the canonical map. Then the formula pπ (π (x)) := inf{p(x − d) : d ∈ D} defines a seminorm pπ on E/D called the quotient seminorm of p on E/D. Theorem 3.4.5 Let (E, τ ) be a locally convex space, let D ⊂ E be a subspace, let π : E−→E/D be the canonical map. For a topology ν on E/D the following are equivalent: (α) For every collection P of seminorms on E generating τ , ν is the locally convex topology on E/D generated by {pπ : p ∈ P}. (β) ν is generated by the family of all seminorms q on E/D such that q ◦ π is τ -continuous. (γ ) ν is the locally convex topology on E/D having {π(U ) : U is an absolutely convex τ -zero neighbourhood in E} as a neighbourhood base of 0. (δ) ν is the strongest (locally convex) topology on E/D making π continuous. (ε) π : (E, τ )−→(E/D, ν) is continuous and open. Proof. Classical and straightforward.
Definition 3.4.6 (Quotients of locally convex spaces) The topology ν described above will be denoted by τπ and will be referred to as the quotient topology on E/D. Henceforth, unless explicitly stated otherwise, we will assume that E/D is equipped with the quotient topology.
3.4 Basic facts and constructions
99
We now investigate under which circumstances E/D is Hausdorff. First an obvious remark. Theorem 3.4.7 A locally convex space E is Hausdorff if and only if for each non-zero x ∈ E there is a continuous seminorm p on E such that p(x) = 0. Theorem 3.4.8 Let D be a subspace of a locally convex space E. Then E/D is Hausdorff if and only if D is closed. Proof. If x ∈ D then, with π : E−→E/D the canonical map, pπ (π (x)) = 0 for all continuous seminorms p on E, hence q(π(x)) = 0 for all continuous seminorms q on E/D. Thus, if E/D is Hausdorff then π (x) = 0, i.e., x ∈ D and it follows that D is closed. Conversely, let D be closed. Let z ∈ E/D, z = 0. There is an x ∈ E with π(x) = z. Then x ∈ D, so there is a continuous seminorm p on E and an r > 0 such that {y ∈ E : p(x − y) < r} ∩ D = ∅. Then p(x − d) ≥ r for all d ∈ D, hence pπ (z) = pπ (π (x)) = 0. We see that E/D is Hausdorff. Next we consider the forming of products. Definition 3.4.9 (Products of locally convex spaces) Let I be an index set and let, for each i ∈ I , a locally convex space Ei be given. Then by the product {Ei : i ∈ I } we mean the space i∈I Ei equipped with the product topology. For this product we use again the same notation i∈I Ei . If Ei = E for each i we also write E I instead of i∈I Ei . If I = {1, . . . , n} for some n ∈ N we often write E1 × · · · × En instead of i∈I Ei . It is not hard to see that i∈I Ei is locally convex and its topology is induced by the seminorms (xi )i∈I −→ pj (xj ), where j runs through I and where pj runs through the collection of all con tinuous seminorms on Ej . Also notice that i∈I Ei is Hausdorff if and only if each Ei is Hausdorff. Products occur in the following representation theorem. Theorem 3.4.10 Every Hausdorff locally convex space can linearly and homeomorphically be embedded into a product of Banach spaces. Proof. Let E be a Hausdorff locally convex space and let P be a collection of seminorms on E defining the topology. For each p ∈ P consider πp
jp
E −→ Ep −→ Ep∧
100
Locally convex spaces
(see 3.3.1), where jp is the inclusion of Ep into its completion Ep∧ . Define T : E−→ p∈P Ep∧ by T (x) := (jp (πp (x)))p∈P . The Hausdorff property implies that the linear map T is injective. For a net (xi )i in E we have limi T (xi ) = 0 if and only if limi jp (πp (xi )) = 0 for each p ∈ P, i.e., limi πp (xi ) = 0 for each p ∈ P, i.e., limi p(πp (xi )) = 0 for each p ∈ P, i.e., limi p(xi ) = 0 for each p ∈ P, i.e., limi xi = 0, which proves that T is a homeomorphism. Products can be employed when constructing completions (3.4.13). Definition 3.4.11 Let E be a locally convex space. A net (xi )i in E is called Cauchy net if for each zero neighbourhood U in E there exists an i0 such that for i, j ≥ i0 we have xi − xj ∈ U or, equivalently, if limi,j p(xi − xj ) = 0 for all continuous seminorms p on E. A subset X of a Hausdorff locally convex space is called complete if each Cauchy net in X converges to a limit that lies in X. A completion of a Hausdorff locally convex space E is a complete locally convex space E∧ together with a linear homeomorphism i : E−→E ∧ such that i(E) is dense in E ∧ . Completions are unique in the sense that if (j, E ∼ ) is another completion of E then there exists a unique bijective linear homeomorphism T : E ∧ −→E ∼ making the diagram i / E∧ EB BB z z BB zz B zz T j BB z }z E∼
commute. Also, it is not difficult to see that the notions of completeness and completion coincide with the metric ones in the normed case. Lemma 3.4.12 Let {Ei : i ∈ I } be a collection of Hausdorff locally convex spaces. Then i∈I Ei is complete if and only if each Ei is complete. Proof. Left to the reader.
Theorem 3.4.13 Each Hausdorff locally convex space E has a completion. Proof. From 3.4.10 it follows that there is a linear homeomorphism T of E into a product of Banach spaces which is complete by the above lemma. Then also T (E) is complete and the pair (T , T (E)) is a completion of E.
3.4 Basic facts and constructions
101
In view of this theorem and the uniqueness property we may from now on speak about “the” completion of a Hausdorff locally convex space E. We will denote it by E ∧ and often will think of the map i : E−→E ∧ as an inclusion. The following generalization of 2.1.4 has a straightforward proof (and has been used already in the uniqueness proof!); we quote it for reference. Theorem 3.4.14 Let E, F be Hausdorff locally convex spaces, let T ∈ L(E, F ). Then T extends uniquely to a T ∧ ∈ L(E ∧ , F ∧ ). Next we turn to direct sums. First, let us observe that the “coordinate maps” Ei −→Ej (j ∈ I ), πj : i∈I
given by (xi )i∈I −→ xj , where Ei are locally convex spaces, are continuous. Even more, the topology on i∈I Ei is the weakest one making all the coordinate maps continuous. In the next definition we consider a “dual” situation. Definition 3.4.15 (Locally convex direct sums) Let I an index set and let, for each i ∈ I , a locally convex space Ei be given. Then, by the locally convex alg direct sum of {Ei : i ∈ I } we mean the algebraic direct sum E := i∈I Ei , equipped with the so-called locally convex direct sum topology: this is the strongest locally convex topology such that all natural injections φj : Ej −→E (j ∈ I ) are continuous. We denote this locally convex direct sum by i∈I Ei . If Ei = E for each i we also write E (I ) instead of i∈I Ei . A seminorm p on i∈I Ei is continuous if and only if p ◦ φj is continuous for each j ∈ I . The coordinate maps πj : i∈I Ei −→Ej are continuous and πj ◦ φj is the identity on Ej whereas πj ◦ φi = 0 for i ∈ I , i = j . It follows easily that i∈I Ei is Hausdorff if and only if each Ei is Hausdorff. The study of locally convex direct sums is somewhat more involved than the one of products. A useful tool will be the following notion that will occur at several other places in this book as well. Definition 3.4.16 Let τ1 ≤ τ2 be locally convex topologies on a vector space E. We say that τ1 is closely related to τ2 if there exists a τ2 -neighbourhood base of 0 consisting of τ1 -closed absolutely convex sets. Lemma 3.4.17 Let τ1 ≤ τ2 be closely related locally convex topologies on a vector space E. Let (xi )i be a Cauchy net in (E, τ2 ) that converges to an x ∈ E with respect to τ1 . Then (xi )i converges to x with respect to τ2 .
102
Locally convex spaces
Proof. Let U be a τ2 -neighbourhood of 0. Without loss, assume U is τ1 -closed. There exists an i0 ∈ I such that for i, j ∈ I , i, j ≥ i0 xi − xj ∈ U. Thus, τ1 -limi (xi − xj ) = x − xj ∈ U , because U is τ1 -closed. Hence x − xj ∈ U for j ≥ i0 , which proves the theorem. We now return to the locally convex direct sums. Let I be an index set, let, for each i ∈ I , Ei be a locally convex space. In 3.4.18−3.4.20 we will write E := i∈I Ei . For each x ∈ E we have x= (φi ◦ πi )(x) i∈I
(only finitely many summands are non-zero). Theorem 3.4.18 The family of all seminorms of the form maxi∈I pi ◦ πi , where, for each i, pi is a continuous seminorm on Ei , is a base of continuous seminorms on E. Proof. For each x ∈ E there are only finitely many i ∈ I for which πi (x) = 0, so the expression maxi∈I pi ◦ πi makes sense and defines a seminorm p on E. Let j ∈ I . Then p ◦ φj = maxi∈I pi ◦ πi ◦ φj = pj ◦ πj ◦ φj = pj , so p is continuous. Now let q be an arbitrary continuous seminorm on E. Then for each x ∈ E q(x) = q (φi ◦ πi )(x) ≤ max(q ◦ φi )(πi (x)). i∈I
i∈I
So q is dominated by a seminorm of the chosen collection, and we are done. Corollary 3.4.19 The topology on E of coordinatewise convergence (i.e., the restriction to E of the product topology) is closely related to the locally convex direct sum topology on E. Proof. Let P be the base of continuous seminorms on E constructed above. For each p = maxi∈I pi ◦ πi ∈ P and r > 0, U := {x ∈ E : p(x) ≤ r} = i∈I {x ∈ E : (pi ◦ πi )(x) ≤ r} is an intersection of sets that are closed with respect to the product topology. We now use these observations to prove the following. Theorem 3.4.20 The locally convex direct sum of a collection of complete (Hausdorff) locally convex spaces is complete.
3.4 Basic facts and constructions
103
Proof. We use the notations as before. Let (x γ )γ be a Cauchy net in E. Then, for each i ∈ I , γ → πi (x γ ) is a Cauchy net in Ei . By completeness it converges to an element xi ∈ Ei . It suffices to prove that M := {i ∈ I : xi = 0} is finite. (Then we can define x := i∈I φi (xi ) ∈ E and (x γ )γ converges coordinatewise to x and we use 3.4.17 and 3.4.19 to conclude that (x γ )γ converges to x in the locally convex direct sum topology.) To prove finiteness of M, choose for each i ∈ M a continuous seminorm pi on Ei for which pi (xi ) = 1, and choose pi := 0 if i ∈ I \ M. Then p := maxi∈I pi ◦ πi is a continuous seminorm on E. There is a γ0 ∈ such that for γ , γ ≥ γ0 we have p(x γ − x γ ) ≤ 1/2. Hence pi (πi (x γ ) − πi (x γ0 )) ≤
1 2
(i ∈ M, γ ≥ γ0 ).
By convergence of γ → πi (x γ ) to xi we get pi (xi − πi (x γ0 )) ≤
1 2
(i ∈ M).
Since pi (xi ) = 1 we obtain pi (πi (x γ0 )) = 1
(i ∈ M).
But {i ∈ I : πi (x γ0 ) = 0} is finite. It follows that M must be finite.
Remark 3.4.21 The converse of the above theorem is also true, i.e., if {Ei : i ∈ I } is a collection of Hausdorff locally convex spaces then completeness of of each Ei . (In fact, for each i ∈ I , φi (Ei ) is a i∈I Ei implies completeness closed subspace of i∈I Ei and φi is a homeomorphism.) A special locally convex direct sum is worth mentioning; it is useful for constructing (counter) examples. Theorem 3.4.22 (The strongest locally convex topology) Let E be a vector space equipped with the strongest locally convex topology (i.e., the locally convex topology induced by all seminorms on E). Then E has the following properties: (i) Every convex subset of E is closed. (ii) Every linear map of E to any locally convex space F is continuous. (iii) Every subspace and every quotient carry also the strongest locally convex topology.
104
Locally convex spaces
(iv) Let (ei )i∈I be an algebraic base of E. Then the map (λi )i∈I −→ λi ei i∈I
is a linear surjective homeomorphism K (I ) −→E. (v) E is complete. (vi) Every convergent sequence lies in a finite-dimensional subspace. (vii) If E is infinite-dimensional then E is not metrizable (see 3.5.1). Proof. Statement (i) follows from 3.1.14 and 3.3.14. Also, (ii), (iii) are straightforward. The map defined in (iv) is a linear bijection. By definition of the locally convex direct sum the space K (I ) has the strongest locally convex topology which proves (iv), and (v) follows from (iv) and the previous theorem. We proceed to prove (vi). Let x1 , x2 , . . . be a convergent sequence and suppose [x1 , x2 , . . .] is infinite-dimensional. Then we could find a subsequence y1 , y2 , . . . of linearly independent vectors. The formula ∞ λi yi := max |λ2n | p i=1
n∈N
defines a (continuous) seminorm on [y1 , y2 , . . .] and can be extended to a seminorm q on E (3.4.3). But the sequence q(y1 ), q(y2 ), . . . does not converge, a contradiction. Finally, we prove (vii). Let x1 , x2 , . . . be linearly independent elements of E. Set Dn := [x1 , . . . , xn ]. By (i) and (v) D := n∈N Dn is complete, and the union of countably many closed subsets with empty interior. By the Baire Category Theorem D cannot be metrizable. Remark 3.4.23 Almost everything of the above is classical except for (i), which is typically non-Archimedean. In 2.1.14(iii) we have seen that finite-dimensional spaces have only one norm topology. We now prove that this topology is also unique in the locally convex setting. Theorem 3.4.24 Let E be a finite-dimensional vector space. Then the strongest locally convex topology on E is the unique Hausdorff locally convex topology. Proof. It is easily seen that, with respect to the norm topology on E, each seminorm is continuous, so the norm topology equals the strongest locally convex topology. To prove uniqueness we proceed by induction on n := dim E. For n = 1 the conclusion is obvious. For the induction step, let τ be a Hausdorff
3.4 Basic facts and constructions
105
locally convex topology on an n-dimensional space E. Choose x ∈ E, x = 0 and a τ -continuous seminorm p with p(x) = 0 (3.4.7). Then dim Ker p < n, so by the induction hypothesis there is a τ -continuous norm on Ker p that can, by 3.4.3, be extended to a τ -continuous seminorm q on E. Then p ∨ q is easily seen to be a norm on E. Thus, E has a τ -continuous norm, so that τ is equal to the strongest locally convex topology. Next we give some consequences of the above results. Corollary 3.4.25 Let E be a finite-dimensional Hausdorff locally convex space. Then, for any locally convex space F , every linear map of E to F is continuous. Proof. Apply 3.4.22(ii) and 3.4.24.
We obtain the following generalization of 2.1.13. Corollary 3.4.26 Let E, F be locally convex spaces. Then every linear map of E to F whose kernel is closed and finite-codimensional is continuous. In particular, if f ∈ E ∗ then f is continuous if and only if Ker f is closed. Proof. Let T : E−→F be linear and suppose that Ker T is closed and finitecodimensional. Let π : E−→E/Ker T be the (continuous) quotient map and let S : E/Ker T −→F , π (x) → T (x). By assumption and 3.4.8, E/Ker T is finitedimensional and Hausdorff. Applying 3.4.25 we obtain that S is continuous, hence so is T = S ◦ π. By using 3.4.25 we also have the following result on complementation of subspaces. Observe that the notions of continuous projection, complemented subspace and complement given in 2.2.5 and in the comments thereafter carry over to the locally convex setting. Corollary 3.4.27 Every closed finite-codimensional subspace of a locally convex space E is complemented. Proof. Let D be a closed finite-codimensional subspace of E and let π : E−→E/D be the quotient map. From Algebra we know that there exists a linear map ϕ : E/D−→E such that π ◦ ϕ equals the identity on E/D. Then I − ϕ ◦ π is easily seen to be a projection onto D. Now to prove continuity it suffices to show that ϕ is continuous. This follows from 3.4.25, because E/D is Hausdorff and finite-dimensional. The reason why complementation is fundamental lies in the following fact.
106
Locally convex spaces
Theorem 3.4.28 Let D be a complemented subspace of a locally convex space E. Then for any complement D1 of D, the space D × D1 is isomorphic to E through the map (d, d1 ) → d + d1 . Proof. Let h : D × D1 −→E, (d, d1 ) → d + d1 . Clearly h is linear and bijective. Also, addition in E is continuous, hence so is h. To prove continuity of h−1 we have to show that the maps d + d1 → d and d + d1 → d1 are continuous. But it is clear, since for any continuous projection P with Im P = D and Ker P = D1 , we have d = P (d + d1 ) and d1 = (I − P )(d + d1 ). Closely related to products and direct sums are the projective and inductive limits. They can be defined in a very general way (see [144], Section 19) but in this book we need only the following “countable” version. Definition 3.4.29 A projective system is a sequence (En , πn )n∈N where, for each n, En is a locally convex space, and where πn ∈ L(En+1 , En ): π2
π1
· · · · −→E3 −→ E2 −→ E1 . In case each πn is injective we will interpret them as inclusions and call (En , πn )n∈N a projective sequence. The projective limit of the projective system (En , πn )n∈N , denoted by lim(En , πn ), or simply by lim En , is the subspace of all (x1 , x2 , . . .) ∈ n∈N En ←− ←− such that πn (xn+1 ) = xn for all n. Note that lim En is a closed subspace of n∈N En . By 3.4.12 we obtain that the ←− projective limit of complete spaces is complete. The projective limit has the following Functorial Property. Let (Fn , ρn )n∈N be a second projective system and let, for each n ∈ N, Tn ∈ L(En , Fn ) be such that the diagram En+1 Tn+1
πn
Tn
Fn+1
/ En
ρn
/ Fn
commutes. Then the natural linear map T : n∈N En −→ n∈N Fn induced by Tn is continuous and maps lim En into lim Fn . ←−
←−
By taking in the above Fn = En∧ , ρn := πn∧ (3.4.14), Tn : En −→En∧ the canonical map, we easily derive the following.
3.4 Basic facts and constructions
107
Theorem 3.4.30 Let (En , πn )n∈N be a projective system of Hausdorff locally convex spaces En . Then lim En is also Hausdorff and (lim En )∧ is naturally isomorphic to lim En∧ .
←−
←−
←−
For projective sequences we have a much simpler interpretation of the projective limits. Theorem 3.4.31 Let (E1 , τ1 ), (E2 , τ2 ), . . . be locally convex spaces such that E1 ⊃ E2 ⊃ · · · and τn |En+1 ≤ τn+1 for each n. Let E := n∈N En be equipped with the union τ of all τn |E (n ∈ N). Then the map (E, τ )−→ lim En given by ←−
x −→ (x, x, x, . . .) is a linear surjective homeomorphism.
Proof. Straightforward.
In other words, the projective limit of a projective sequence (En , πn )n∈N is the space E := n∈N En equipped with the topology induced by n∈N {p|E : p is a continuous seminorm on En }. It is the weakest (locally convex) topology on E for which all inclusions E−→En are continuous. In a similar way we will introduce inductive limits. Definition 3.4.32 An inductive system is a sequence (En , in )n∈N where, for each n, En is a locally convex space, and where in ∈ L(En , En+1 ): i1
i2
E1 −→ E2 −→ E3 −→ · · · · In case each in is injective we will interpret them as inclusions and call (En , in )n∈N an inductive sequence. The inductive limit of the inductive system (En , in )n∈N , denoted by lim(En , in ), or simply by lim En , is the quotient space ( n∈N En )/D, where −→ −→ D is the subspace generated by all elements of the form (x1 , −i1 (x1 ), 0, 0, . . .) (x1 ∈ E1 ), (0, x2 , −i2 (x2 ), 0, 0, . . .) (x2 ∈ E2 ), . . . . The above spaces E1 , E2 , . . . are often called informally the “steps”. It is not difficult to see that inductive limits have functorial properties similar to the ones of projective limits. We leave formulation and details to the reader. Remark 3.4.33 The reader may expect here a statement concerning completeness of inductive limits in the spirit of 3.4.30. But it will turn out later (11.2.5, 11.4.10(a)) that this is a delicate matter. The same goes for completeness of quotients. There is even no guarantee that inductive limits of Hausdorff spaces are Hausdorff (see 11.2.2).
108
Locally convex spaces
In many cases we will have to deal with inductive sequences. For these we have, like in the case of projective sequences, a simple description of its inductive limits as follows. Theorem 3.4.34 Let (E1 , τ1 ), (E2 , τ2 ), . . . be locally convex spaces such that E1 ⊂ E2 ⊂ · · · and τn+1 |En ≤ τn for each n. Let E := n∈N En be equipped with the strongest locally convex topology τ for which the inclusions (En , τn )−→(E, τ ) are continuous. For each m, let um be the canonical map Em −→
En −→ lim En . −→
n∈N
Then um+1 |Em = um for all m, so the um define a map u, u
(E, τ ) −→ lim En −→
which is a linear surjective homeomorphism. Proof. Direct verification.
In other words, we can view the inductive limit of an inductive sequence (En , in )n∈N as the space E := n∈N En equipped with the topology induced by n∈N {p : p seminorm on E, p|En is continuous on En }. It is the strongest locally convex topology on E for which all inclusions En −→E are continuous. Remark 3.4.35 We will encounter inductive limits in this book several times. Chapter 11 is devoted to this subject.
3.5 Metrizable and Fr´echet spaces Definition 3.5.1 A locally convex space is called metrizable if there exists a metric inducing the topology. A complete metrizable locally convex space is called a Fr´echet space. A metric d on a vector space E is called invariant if d(x + z, y + z) = d(x, y) for all x, y, z ∈ E. Theorem 3.5.2 For a locally convex space E the following are equivalent: (α) E is metrizable. (β) E is Hausdorff. There is a countable base of (absolutely convex) zero neighbourhoods. (γ ) E is Hausdorff. There is a countable collection of seminorms generating the topology. (δ) There is an invariant ultrametric on E inducing the topology.
3.5 Metrizable and Fr´echet spaces
109
Proof. (α) =⇒ (β). Let d be a metric on E inducing the topology. The sets {x ∈ E : d(x, 0) < n1 } (n ∈ N) form a countable base of neighbourhoods of 0. By local convexity we have a countable base of absolutely convex zero neighbourhoods. (β) =⇒ (γ ). Let {Un : n ∈ N} be a countable base of absolutely convex zero neighbourhoods. Then, for each n, pn := pUn is continuous (3.3.15). We claim that p1 , p2 , . . . generate the topology. In fact, let p be a continuous seminorm. Then there is an m such that x ∈ Um implies p(x) < 1. Now pm (x) < 1 implies x ∈ Um and hence p(x) < 1. It follows that p ≤ pm . (γ ) =⇒ (δ). Let {p1 , p2 , . . .} be a countable set of seminorms inducing the topology. The formula d(x, y) := max min(pn (x − y), 2−n ) n∈N
(x, y ∈ E)
defines an invariant ultrametric on E. One verifies directly that a net (xi )i in E converges to x ∈ E if and only if limi d(x, xi ) = 0. (δ) =⇒ (α). Trivial. Remark 3.5.3 For a metrizable locally convex space E, a subset is closed if and only if it is sequentially closed, and E is complete if and only if each Cauchy sequence converges. If d is an invariant ultrametric inducing the topology ((δ) above) then a sequence x1 , x2 , . . . in E is Cauchy if and only if limn d(xn , xn+1 ) = 0. Corollary 3.5.4 Let E be a metrizable locally convex space. Then: (i) there is an increasing sequence p1 ≤ p2 ≤ · · · of seminorms forming a base of continuous seminorms, (ii) there is a decreasing sequence U1 ⊃ U2 ⊃ · · · of absolutely convex sets forming a neighbourhood base of 0. Proof. By the previous theorem there is a countable collection {q1 , q2 , . . .} of seminorms generating the topology. Then (i) is established by taking pn := max(q1 , . . . , qn ), and by defining Un := {x ∈ E : pn (x) ≤ n1 } we arrive at (ii). Clearly (closed) subspaces of metrizable (Fr´echet) spaces are metrizable (Fr´echet). Theorem 3.5.5 Countable products and projective limits of metrizable locally convex spaces are metrizable. The quotient of a metrizable locally convex space by a closed subspace is metrizable.
110
Locally convex spaces
Proof. Let E1 , E2 , . . . be metrizable locally convex spaces. Thanks to 3.5.2 there is, for each n, an (invariant) ultrametric dn on En inducing the topology of En . We may assume dn ≤ 1. Now, for x = (xn )n∈N , y = (yn )n∈N in n∈N En , set d(x, y) := maxn∈N 2−n dn (xn , yn ). It is easily seen that d is an ultrametric inducing the product topology. Thus, n∈N En is metrizable, hence so are projective limits (3.4.29). Now let D be a closed subspace of a metrizable locally convex space E, let π : E−→E/D be the canonical map, let P be a countable collection of seminorms on E inducing the topology (3.5.2). Then by 3.4.5 the countable set {pπ : p ∈ P} induces the quotient topology. Also, by 3.4.8 E/D is Hausdorff. Remark 3.5.6 From 3.4.22(vii) we see that the space K (N) is not metrizable. So countable direct sums of metrizable spaces need not be metrizable. The same goes for inductive limits, as we will show in 11.2.8. Corollary 3.5.7 Countable products and projective limits of Fr´echet spaces are Fr´echet. Proof. Combine 3.5.5 with 3.4.12 and 3.4.30.
The completeness of quotients is somewhat more involved. We need the following lemma. Lemma 3.5.8 Let D be a subspace of a metrizable locally convex space E, let π : E−→E/D be the canonical map. Then, if y1 , y2 , . . . is a sequence in E/D converging to 0, there is a sequence x1 , x2 , . . . in E, converging to 0, such that π(xn ) = yn for each n. Proof. By 3.5.4(ii) there are absolutely convex U1 ⊃ U2 ⊃ · · · forming a neighbourhood base of 0 in E. Then (3.4.5) π(U1 ), π (U2 ), . . . is a neighbourhood base of 0 in E/D. There are m1 < m2 < · · · such that for each k m ≥ mk =⇒ ym ∈ π (Uk ). Now let n ∈ N. If n < m1 choose an arbitrary xn ∈ E with π (xn ) = yn . If n ≥ m1 there is a unique k such that mk ≤ n < mk+1 . Then yn ∈ π (Uk ), so we can find an xn ∈ Uk such that π(xn ) = yn . Clearly, limn xn = 0. Theorem 3.5.9 Let D be a closed subspace of a Fr´echet space E. Then E/D is Fr´echet. Proof. Since E/D is metrizable (3.5.5) we can use Cauchy sequences to prove completeness. Let again π : E−→E/D be the canonical map. Let y1 , y2 , . . .
3.5 Metrizable and Fr´echet spaces
111
be a Cauchy sequence in E/D. Then y1 , y2 − y1 , y3 − y2 , . . . tends to 0, so by the lemma above there are x1 , x2 , . . . in E, tending to 0, such that π(x1 ) = y1 , π(xn ) = yn − yn−1 for n ≥ 2. Since E is Fr´echet, x1 , x2 , . . . is summable, let ∞ x := ∞ n=1 xn . Then π (x) = y1 + n=2 (yn − yn−1 ) = limm ym . We see that y1 , y2 , . . . converges to π (x). We now prove the familiar Open Mapping Theorem. Theorem 3.5.10 (Open Mapping Theorem for Fr´echet spaces) Let E, F be Fr´echet spaces and let T ∈ L(E, F ) be surjective. Then T is an open mapping. Proof. (Not materially different from the proof of 2.1.17.) Let U ⊂ E be absolutely convex, open. We first prove that T (U ) is open. In fact, let λ1 , λ2 , . . . ∈ K × , limn |λn | = ∞. Then, since U is absorbing (3.3.15(i)), E = n∈N λn U , so F = n∈N λn T (U ). By completeness, metrizability and the Baire Category Theorem, there is an n such that int (λn T (U )) = ∅, so by 3.3.11(ii) λn T (U ), hence T (U ), is open. Next we show that T (U ) itself is open. There are absolutely convex U := U1 ⊃ U2 ⊃ · · · forming a neighbourhood base of 0 in E. By the first part of the proof T (U1 ) ⊃ T (U2 ) ⊃ · · · are clopen, hence form a neighbourhood base of 0 in F . Let us prove T (U1 ) ⊂ T (U ) (then, by 3.3.11(ii), T (U ) is open). For that, let y ∈ T (U1 ). The set y − T (U1 ) meets T (U2 ), so there is an x1 ∈ U1 such that y − T (x1 ) ∈ T (U2 ). By the same token there is an x2 ∈ U2 such that y − T (x1 ) − T (x2 ) ∈ T (U3 ), etc. Inductively, we arrive at a sequence x1 , x2 , . . . , where xn ∈ Un ⊂ U and y − T (x1 + · · · + xn ) ∈ T (Un ) for each n, so limn T (x1 + · · · + xn ) = y. Now limn xn = 0, so by complete ness of E, x := ∞ n=1 xn exists and lies in U because U is closed (again by 3.3.11(ii)). We see that y = T (x) ∈ T (U ). Remark 3.5.11 Like in the Banach case (2.1.19) we can derive a Closed Graph Theorem. We leave the details to the reader. This theorem will be extended to a larger class of spaces in 11.1.10. For a generalization of the Uniform Boundedness Principle 2.1.20 and the Banach–Steinhaus Theorem 2.1.21 we refer to 7.1.8. We have one more, peculiar, consequence. Corollary 3.5.12 Let E, F be Fr´echet spaces, let T ∈ L(E, F ) be such that codim T (E) < ∞. Then T (E) is closed. Proof. We may assume that T is injective (3.5.9). Let D be an algebraic complement of T (E). D is a Fr´echet space equipped with the unique Hausdorff
112
Locally convex spaces
locally convex topology (3.4.24). The map u : E × D−→F given by u : (x, d) −→ T (x) + d
(x ∈ E, d ∈ D)
is a continuous linear bijection between the Fr´echet spaces E × D and F , so it is a homeomorphism by 3.5.10. Thus, T (E) = u(E × {0}) is closed.
3.6 Bounded sets Boundedness is defined just like in the classical case. Definition 3.6.1 A subset X of a locally convex space E is called bounded (in E) if it is absorbed by every zero neighbourhood, i.e., if for every zero neighbourhood U there is a λ ∈ K such that X ⊂ λ U . Accordingly, a sequence x1 , x2 , . . . in E is called bounded if {x1 , x2 , . . .} is bounded. Clearly a subset X of a locally convex space E is bounded in E if and only if it is bounded in [X], which enables us to speak about boundedness without referring to the embedding space. A subset X of E is bounded if and only if each continuous seminorm (equivalently, each seminorm of a collection generating the topology) is bounded on X, showing that, in case of a normed space E, boundedness coincides with norm boundedness. Theorem 3.6.2 A Hausdorff locally convex space is normable if and only if it has a bounded zero neighbourhood. Proof. We prove that a Hausdorff locally convex space E with a bounded zero neighbourhood U is normable. In fact, the Minkowski function pU is continuous (3.3.15). Let p be a continuous seminorm on E. Then by boundedness of U there is a λ ∈ K such that p(x) ≤ |λ| for x ∈ U . This implies p ≤ |λ| pU . So {pU } generates the topology and, since E is Hausdorff, pU is a norm. We leave verification of the next theorem to the reader. Theorem 3.6.3 Let E be a locally convex space. Then we have the following: (i) Subsets, finite unions and sums, (absolutely) convex hulls, closures, continuous linear images of bounded sets in E are bounded. (ii) If C ⊂ E is a convex bounded set then so is C e . (iii) (Pre)compact subsets of E are bounded. (iv) X ⊂ E is bounded if and only if each countable subset of X is bounded.
3.6 Bounded sets
113
Theorem 3.6.4 Let I be an index set and let, for each i ∈ I , a locally convex space Ei be given. Then we have the following (where, as in Section 3.4, the πi are the coordinate maps): (i) A subset X of i∈I Ei is bounded if and only if each πi (X) is bounded. (ii) A subset X of i∈I Ei is bounded if and only if πi (X) is bounded in Ei for each i and πi (X) ⊂ {0} for all but finitely many i. Proof. (i). We only need to prove the “if” part; the “only if” follows from (i) of the above theorem. So let πi (X) be bounded in Ei for each i. Now P := {pi ◦ πi : i ∈ I , pi is a continuous seminorm on Ei } generates the product topology on i∈I Ei and each member of P is bounded on X. Thus, X is bounded. (ii). Suppose X is bounded. Then, again by (i) of the above theorem, πi (X) is bounded in Ei , for each i. If we would have mutually distinct i1 , i2 , . . . ∈ I and x1 , x2 , . . . ∈ X with πin (xn ) ∈ {0} for all n, choose λ1 , λ2 , . . . ∈ K such that limn |λn | = ∞ and continuous seminorms pin on Ein with pin (πin (xn )) = |λn |. For i ∈ I \ {i1 , i2 , . . .}, choose pi := 0. Then, by 3.4.18, maxi∈I pi ◦ πi is a continuous seminorm on i∈I Ei , not bounded on X, a contradiction. Conversely, let J ⊂ I be a finite set such that πi (X) ⊂ {0} for i ∈ I \ J . Then (with φi as in 3.4.15) X ⊂ i∈J φi (πi (X)) + i∈I \J φi (πi (X)). Ei
E
Now, for i ∈ I \ J we have πi (X) ⊂ {0} , so that φi (πi (X)) ⊂ {0} , hence E i∈I \J φi (πi (X)) ⊂ {0} is bounded. Also, i∈J φi (πi (X)) is bounded and then so is X (3.6.3(i)). Corollary 3.6.5 A subset X of the projective limit of a projective system (En , πn )n∈N of locally convex spaces is bounded if and only if each πn (X) is bounded. Remarks 3.6.6 (a) Let E be a vector space equipped with the strongest locally convex topology. Applying 3.4.22(iv) and 3.6.4(ii) we obtain that bounded subsets of E are finite-dimensional. (b) The characterization of bounded sets in inductive limits lim En in terms of −→ the steps En is a delicate matter, see Chapter 11. (c) In 9.8.2(i) we will construct a Fr´echet space E, a closed subspace D ⊂ E and a bounded set Y ⊂ E/D which is not the image under the quotient map E−→E/D of any bounded subset of E. Definition 3.6.7 A Hausdorff locally convex space E is called quasicomplete if every closed bounded subset of E is complete, or equivalently, if every bounded
114
Locally convex spaces
Cauchy net in E is convergent. Also, E is called sequentially complete if every Cauchy sequence in E is convergent. Clearly every complete space is quasicomplete and every quasicomplete space is sequentially complete (note that every Cauchy sequence is bounded). These three notions coincide when E is metrizable. For examples of sequentially complete spaces that are not quasicomplete and of quasicomplete spaces that are not complete, see 3.7.10 and 5.4.7 respectively.
3.7 Examples of locally convex spaces 3.7.1 Spaces of continuous functions In 2.5.17–2.5.40 we considered examples of Banach spaces of continuous functions. In the same spirit we will study now spaces of continuous functions whose natural topologies are locally convex but, in general, not normable. Throughout Subsection 3.7.1 we assume that X is a non-empty zerodimensional Hausdorff topological space. Recall that C(X) is the space of all continuous functions X−→K . Notation For a non-empty subset Y ⊂ X and f : X−→K we set (admitting the value ∞) pY (f ) := sup{|f (x)| : x ∈ Y }. For convenience we put p∅ (f ) := 0. Notice that pY (f ) < ∞ if Y is compact, f ∈ C(X). We first study the topologies of simple convergence (3.7.1) and compact convergence (3.7.3) on C(X). Definition 3.7.1 The topology of simple (or, pointwise) convergence, τs , on C(X) is the topology generated by the seminorms p{x} , where x ∈ X. Thus, the seminorms pY , where Y runs through the class of finite subsets of X, form a base of τs -continuous seminorms. A net (fi )i in C(X) converges to f ∈ C(X) in τs if and only if fi → f pointwise, i.e., limi fi (x) = f (x) for each x ∈ X. Clearly, τs is Hausdorff. Theorem 3.7.2 (i) (C(X), τs ) is normable if and only if X is finite. (ii) (C(X), τs ) is metrizable if and only if X is countable. (iii) (C(X), τs ) is (quasi)complete if and only if X is discrete.
3.7 Examples of locally convex spaces
115
(iv) (C(X), τs ) is sequentially complete if and only if the intersection of countably many clopen sets in X is again clopen. Proof. (i). Suppose (C(X), τs ) is normable. Then there is a finite set Y ⊂ X such that pY is a norm generating the topology. If Y = X, let x ∈ X, x ∈ Y . There is a clopen U containing x, but U ∩ Y = ∅. Then ξU = 0 but pY (ξU ) = 0, a contradiction. So X = Y is finite. The converse is obvious. (ii). Suppose (C(X), τs ) is metrizable. Then (3.5.2) τs is induced by pY1 , pY2 , . . . , where Y1 , Y2 , . . . are finite sets. Without loss, assume Y1 ⊂ Y2 ⊂ · · · . Let x ∈ X. Then p{x} ≤ C pYn for some C > 0 and n ∈ N. By the same argument as in (i) we find x ∈ Yn . Hence X = n∈N Yn is countable. Conversely, if X is countable from the natural embedding (C(X), τs )−→K X and 3.5.5 we obtain metrizability of (C(X), τs ). (iii). Suppose (C(X), τs ) is quasicomplete. Let x ∈ X. Then {ξU : U ⊂ X clopen, x ∈ U } forms in a natural way a bounded Cauchy net in τs . So it converges and its limit has to be ξ{x} . Thus, {x} is clopen, and X is discrete. Conversely, if X is discrete then (C(X), τs ) = K X with the product topology, which is complete by 3.4.12. (iv). Suppose (C(X), τs ) is sequentially complete. Let U1 , U2 , . . . ⊂ X be clopen, let U := n∈N Un . To prove that U is clopen we may assume U1 ⊃ U2 ⊃ · · · . The sequence of characteristic functions ξU1 , ξU2 , . . . converges pointwise to ξU . So ξU ∈ C(X), i.e., U is clopen. Conversely, assume that the intersection of countably many clopen sets in X is clopen. Let f1 , f2 , . . . ∈ C(X) be a τs -Cauchy sequence in C(X), i.e., f (x) := limn fn (x) exists for every x ∈ X. To prove sequential completeness we have to show that f ∈ C(X). Let x ∈ X, ε > 0. Let us see that U := {y ∈ X : |f (y) − f (x)| < ε} is open. For each n ∈ N, consider the clopen set Un := {y ∈ X : |fn (y) − fn (x)| < ε}. Then U = m∈N Vm , where V1 := n≥1 Un , V2 := n≥2 Un , . . . are clopen in X. Hence U is open. Next we turn to compact convergence. Definition 3.7.3 The topology of uniform convergence on compact sets, or the compact open topology, τc , on C(X) is the topology generated by the seminorms pY , where Y ⊂ X, Y compact. Thus, the seminorms pY , where Y runs through the class of compact subsets of X, form a base of τc -continuous seminorms. Since singleton sets are compact we have τs ≤ τc , so τc is Hausdorff. A net (fi )i in C(X) converges to f ∈ C(X)
116
Locally convex spaces
in τc if and only if limi fi (x) = f (x) uniformly on x ∈ Y , for each compact Y ⊂ X. For the characterizations of 3.7.9 we need some facts and notions on settheoretic topology. Definition 3.7.4 A fundamental sequence of compact sets in X is a sequence Y1 , Y2 , . . . of compact sets in X such that for each compact Y ⊂ X there is an n for which Y ⊂ Yn . X is called hemicompact if X possesses a fundamental sequence of compact sets. Remarks 3.7.5 (a) If Y1 , Y2 , . . . is a fundamental sequence of compact sets in X then so is Y1 , Y1 ∪ Y2 , Y1 ∪ Y2 ∪ Y3 , . . . . (b) There is no relation between hemicompactness and local compactness. In fact, an uncountable discrete space is locally compact but not hemicompact. As for the converse, let X := c00 be over Qp with the strongest locally convex topology. To prove that X is hemicompact consider, for m, n ∈ N, Ym,n := p−m {(λ1 , . . . , λn , 0, 0, . . .) : λ1 , . . . , λn ∈ Zp }. Every compact subset of X is bounded, so (3.6.6(a)) is finite-dimensional, and hence it is contained in some Ym,n . In the same way, if U were a compact neighbourhood of 0 in X then U is finite-dimensional, which conflicts with the fact that U is absorbing (3.3.15(i)). Therefore, X is not locally compact. (c) Clearly every hemicompact space is σ -compact, but the converse does not hold. To see this, consider Q with the usual topology inherited from R. The clopen subsets {x ∈ Q : a < x < b}, where a, b ∈ R \ Q, a < b form a base of the topology, so Q is zero-dimensional (even ultrametrizable, [193], p. 39). By countability Q is σ -compact. To prove that Q is not hemicompact, let Y1 ⊂ Y2 ⊂ · · · be compact sets in Q. Let n ∈ N. Then Yn cannot contain [− n1 , n1 ] ∩ Q (otherwise, by completeness it would contain irrational numbers), so we can find an an ∈ Q, an ∈ Yn , |an | ≤ n1 . The set Y := {0, a1 , a2 , . . .} is compact but Y ⊂ Yn for no n. (d) It is easily seen that if X is both σ -compact and locally compact then X is hemicompact. In the next theorem, notice that (α) is a property of the space X whereas in the formulation of (β) the field K is involved.
3.7 Examples of locally convex spaces
117
Theorem 3.7.6 The following statements on X are equivalent: (α) A subset U ⊂ X is clopen if and only if U ∩ Y is clopen in Y for each compact Y ⊂ X. (β) A function f : X−→K is continuous if and only if its restriction to each compact set is continuous. Proof. (α) =⇒ (β). Let f : X−→K be such that the restriction of f to each compact set is continuous. To prove continuity of f , let S ⊂ K be clopen. For each compact Y ⊂ X, f −1 (S) ∩ Y = (f |Y )−1 (S) is clopen in Y so, by (α), f −1 (S) is clopen, and f is continuous. Conversely, assume (β) and let U ⊂ X be such that U ∩ Y is clopen in Y for each compact Y . Then ξU |Y is continuous for each compact Y ⊂ X, so by (β) ξU is continuous, i.e., U is clopen. Definition 3.7.7 We say that X is a k0 -space if it satisfies (α) or (β) of the preceding theorem. Theorem 3.7.8 Every metrizable or locally compact X is a k0 -space. Proof. We only prove (β) of 3.7.6 for metrizable X. Let f : X−→K be such that f |Y is continuous for each compact Y ⊂ X. Let x1 , x2 , . . . ∈ X, limn xn = x ∈ X. Then {x, x1 , x2 , . . .} is compact, so by assumption limn f (xn ) = f (x). Thus, f is sequentially continuous, hence continuous by metrizability. Now we arrive at the desired characterizations. Theorem 3.7.9 (i) (C(X), τc ) is normable if and only if X is compact. (ii) (C(X), τc ) is metrizable if and only if X is hemicompact. (iii) (C(X), τc ) is (quasi)complete if and only if X is a k0 -space. Proof. (i). Suppose (C(X), τc ) is normable. The same reasoning as in the proof of 3.7.2(i), but replacing “finite” by “compact” leads to compactness of X. The converse is obvious. (ii). Let (C(X), τc ) be metrizable. Then the topology τc is induced by countably many seminorms (3.5.2); we may assume that they have the form pY1 , pY2 , . . . , where Y1 ⊂ Y2 ⊂ · · · are compact. Now let Y ⊂ X be compact. Then pY ≤ C pYn for some C > 0 and n ∈ N. Suppose Y ⊂ Yn ; we derive a contradiction. Choose y ∈ Y , y ∈ Yn , y has a clopen neighbourhood U that does not meet Yn . Then 1 = pY (ξU ) ≤ C pYn (ξU ) = 0, a contradiction. Hence, Y1 , Y2 , . . . is a fundamental sequence of compact sets. Conversely, if X is hemicompact, let Y1 ⊂ Y2 ⊂ · · · be a fundamental sequence of compact sets. It can be seen almost immediately that pY1 , pY2 , . . . generate the topology τc and metrizability follows.
118
Locally convex spaces
(iii). Suppose (C(X), τc ) is quasicomplete. Let U ⊂ X be such that U ∩ Y is clopen in Y for each compact Y ⊂ X; we prove that U is clopen. For each compact Y ⊂ X the function ξU |Y is continuous, so by 2.5.23 there is an fY ∈ BC(X) with fY ∞ ≤ 1 such that fY |Y = ξU |Y . Now {fY : Y compact, Y ⊂ X} forms in a natural way a bounded Cauchy net in τc and by assumption it converges to some f ∈ C(X). But limY fY = ξU pointwise, so ξU = f is continuous, i.e., U is clopen. To prove the converse, let (fi )i be a Cauchy net in (C(X), τc ). Then there is an f : X−→K such that limi fi = f uniformly on compact subsets. Apparently, f |Y is continuous for each compact Y . By assumption f is continuous. Hence, (C(X), τc ) is complete. We do not know of a characterization of sequential completeness of (C(X), τc ). However, we have the following. Example 3.7.10 There is an X such that both (C(X), τs ) and (C(X), τc ) are sequentially complete but not quasicomplete. Proof. Take the space X of 2.5.33. If U1 , U2 , . . . are open in X then so is n∈N Un . (If 0 ∈ Un for some n then 0 ∈ n∈N Un , so n∈N Un is open. If 0 ∈ Un for all n then X \ Un is countable for all n, hence so is the set X \ ( n∈N Un ) = n∈N (X \ Un ), and then n∈N Un is open.) Thus, from 3.7.2(iv), we obtain that (C(X), τs ) is sequentially complete. Nevertheless, as X is not discrete, (C(X), τs ) is not quasicomplete by 3.7.2(iii). As for the compact open topology, since the compact subsets of X are finite, we have τs = τc , and the result follows. We now will define a family of topologies having τs and τc as particular cases. Definition 3.7.11 For f, φ : X−→K we set, admitting the value ∞, pφ (f ) := sup{|f (x) φ(x)| : x ∈ X}. Let W be a non-empty family of (so-called) weight functions X−→K. Let BW (X) := {f : X−→K : pφ (f ) < ∞ for each φ ∈ W }, and BCW (X) := BW (X) ∩ C(X). It is easy to see that BW (X) is a linear space under pointwise operations and that pφ is a (solid!) seminorm on BW (X) for each φ ∈ W . Definition 3.7.12 The W -topology τW on BW (X) (BCW (X)) is the locally convex topology generated by the seminorms {pφ : φ ∈ W }.
3.7 Examples of locally convex spaces
119
Let W be as above. Set W := {φ : X−→K : there are φ1 , . . . , φn ∈ W and C > 0 such that |φ| ≤ C max(|φ1 | , . . . , |φn |)}. Then BW (X) = BW (X) and τW = τW . It is also clear that τW is Hausdorff if and only if for each x ∈ X there is a φ ∈ W such that φ(x) = 0. From now on we assume that τW is Hausdorff. Lemma 3.7.13 (BW (X), τW ) is complete. Proof. Let (fi )i be a Cauchy net in (BW (X), τW ). Let x ∈ X, choose ϕ ∈ W with ϕ(x) = 0. Then from |g(x)| ≤ |ϕ(x)|−1 pϕ (g)
(g ∈ BW (X))
it follows that f (x) := limi fi (x) exists. Let φ ∈ W . Then there is an i0 and M > 0 such that pφ (fi ) ≤ M for i ≥ i0 . From |fi (x)| |φ(x)| ≤ M
(x ∈ X, i ≥ i0 )
it then follows that |f (x)| |φ(x)| ≤ M
(x ∈ X)
or pφ (f ) < ∞, i.e., f ∈ BW (X). Now the topology of pointwise convergence on BW (X) is closely related to τW , so by 3.4.17 we have limi fi = f in the topology τW . It is easy to see that (BCW (X), τW ) = (C(X), τs ) if W is the collection of all φ : X−→K with finite support. If we choose W := {φ : X−→K : φ bounded, φ has compact support} then (BCW (X), τW ) = (C(X), τc ). Below we discuss two other choices for W . Definition 3.7.14 (The strict topology) A function φ : X−→K is said to vanish at infinity if for each ε > 0 the set {x ∈ X : |φ(x)| ≥ ε} is contained in a compact set (compare with 2.5.20). Let W0 be the collection of all bounded functions φ : X−→K that vanish at infinity. The topology τW0 on BW0 (X) is called the strict topology, usually denoted by β0 . Clearly each bounded function X−→K is in BW0 (X). Also the converse holds. Lemma 3.7.15 Each f ∈ BW0 (X) is bounded. Proof. Suppose f ∈ BW0 (X) is unbounded; we derive a contradiction. There are x1 , x2 , . . . ∈ X such that |f (x1 )| < |f (x2 )| < · · · , limn |f (xn )| = ∞. There
120
Locally convex spaces
√ are λ1 , λ2 , . . . ∈ K such that n → |λn | |f (xn )| is bounded and bounded away from zero. Define φ : X−→K by λn if n ∈ N, x = xn φ(x) := 0 if x ∈ X \ {x1 , x2 , . . .}. Then, since limn λn = 0 we have φ ∈ W0 , so f φ is bounded, which is in conflict with lim |f (xn ) φ(xn )| = lim(|λn | |f (xn )|) |f (xn )| = ∞. n
n
Corollary 3.7.16 (BCW0 (X), τW0 ) = (BC(X), β0 ). We now study the strict topology β0 in the spirit of 3.7.2 and 3.7.9. Theorem 3.7.17 The following are equivalent: (α) (BC(X), β0 ) is normable. (β) (BC(X), β0 ) is metrizable. (γ ) X is compact. Proof. We only need to prove (β) =⇒ (γ ). By 3.5.2 there are φ1 , φ2 , . . . ∈ W0 such that pφ1 , pφ2 , . . . generate β0 . Without loss, assume |φ1 | ≤ |φ2 | ≤ · · · . Suppose X is not compact; we derive a contradiction. Choose λ1 , λ2 , . . . ∈ K such that 1 > |λ1 | > |λ2 | > · · · , limn λn = 0. For n ∈ N set Yn := {x ∈ X : |φn (x)| ≥ |λn |2 }. Then each Yn is compact, Y1 ⊂ Y2 ⊂ · · · . Since X \ Y1 , X \ Y2 , . . . are infinite we can find x1 , x2 , . . . ∈ X such that x1 ∈ Y1 , xn+1 ∈ Yn+1 ∪ {x1 , . . . , xn } for each n. Choose clopen sets Un for which xn ∈ Un , Un ∩ Yn = ∅ for all n. Set λn if n ∈ N, x = xn φ(x) := 0 if x ∈ X \ {x1 , x2 , . . .}. Then φ ∈ W0 , so there is a constant C > 0 and a k ∈ N for which pφ ≤ C pφk .
(3.5)
For all n we have pφ (ξUn ) = sup{|φ(x)| : x ∈ Un } ≥ |φ(xn )| = |λn |, whereas, for n ≥ k, pφk (ξUn ) = sup{|φk (x)| : x ∈ Un } ≤ sup{|φk (x)| : x ∈ Yn } ≤ sup{|φn (x)| : x ∈ Yn } ≤ |λn |2 . So (3.5) entails that |λn | ≤ C |λn |2 for n ≥ k, an impossibility since λn → 0. Theorem 3.7.18 (BC(X), β0 ) is (quasi)complete if and only if X is a k0 -space.
3.7 Examples of locally convex spaces
121
Proof. From quasicompleteness of (BC(X), β0 ) we can deduce that X is a k0 -space with essentially the same proof as in 3.7.9(iii). Conversely, let X be a k0 -space. By 3.7.13 completeness of (BC(X), β0 ) follows as soon as we prove that BC(X) is a closed subspace of (BW0 (X), τW0 ). For that, let (fi )i be a net in BC(X) converging to some f in (BW0 (X), τW0 ). Then f is bounded by 3.7.15. On the other hand, the compact open topology on BW0 (X) is weaker than β0 , so limi fi = f with respect to τc and f ∈ C(X) by 3.7.9(iii). We see that f ∈ BC(X), and we are done. We now introduce a second choice for W . Definition 3.7.19 Let Wc be the set of all functions X−→K that are bounded on compact sets. Further, denote by Cc (X) the space of all continuous functions X−→K with compact support. Clearly Cc (X) ⊂ BCWc (X). For metrizable spaces we prove the converse. Theorem 3.7.20 Let X be metrizable. Then each f ∈ BWc (X) is bounded and has compact support. In particular, Cc (X) = BCWc (X). Proof. Since φ := 1 belongs to Wc we have that f = f φ is bounded. Now let Z := {x ∈ X : f (x) = 0}. Suppose Z is not compact; we derive a contradiction. There is a sequence x1 , x2 , . . . in Z without convergent subsequences. Letting d be a metric inducing the topology on X we can choose y1 , y2 , . . . ∈ Z such that d(xn , yn ) < n1 for each n. Then y1 , y2 , . . . does not have convergent subsequences. Without loss, assume yn = ym whenever n = m. Choose λ1 , λ2 , . . . ∈ K such that |λn | → ∞ and define φ : X−→K by λn f (yn )−1 if n ∈ N, x = yn φ(x) := 0 if x ∈ X \ {y1 , y2 , . . .}. Therefore f φ is unbounded, so to arrive at a contradiction it suffices to show that φ ∈ Wc . Let Y ⊂ X be compact. If Y ∩ {y1 , y2 , . . .} were infinite then y1 , y2 , . . . would have a convergent subsequence, so Y ∩ {y1 , y2 , . . .} is finite, showing that φ takes on Y only finitely many non-zero values and it follows that φ is bounded on Y . Apart from τWc , the space Cc (X) has a natural topology of its own. Definition 3.7.21 For each compact Y ⊂ X, let GY := {f ∈ C(X) : supp f ⊂ Y }. The inductive topology τi on Cc (X) is the strongest locally convex topology for which all the inclusions (GY , . ∞ )−→Cc (X) (Y ⊂ X, Y compact) are continuous.
122
Locally convex spaces
Thus, a seminorm p on Cc (X) is τi -continuous if and only if for each compact Y ⊂ X there is a CY ≥ 0 such that p(f ) ≤ CY f ∞ for all f ∈ Cc (X) with support in Y . Clearly every τWc -continuous seminorm is τi -continuous. For locally compact X we now prove the converse. Theorem 3.7.22 Let X be locally compact. Then on Cc (X) the topologies τi and τWc coincide. Proof. Let p be a τi -continuous seminorm; we shall prove that there is a φ ∈ Wc such that p(f ) ≤ pφ (f ) for all f ∈ Cc (X). To this end, for each open compact U ⊂ X, we set CU := min{C ≥ 0 : p(f ) ≤ C f ∞ for all f ∈ Cc (X) with supp f ⊂ U }. Trivially, if V ⊂ U are open compact, CV ≤ CU , and we can define ϕ : X−→[0, ∞) by ϕ(x) := inf{CU : U open compact, x ∈ U }. For each open compact U one verifies ϕ(x) ≤ CU for all x ∈ U , so that ϕ is bounded on (open) compact sets. Next we prove that for f ∈ Cc (X), p(f ) ≤ sup{|f (x)| ϕ(x) : x ∈ X}.
(3.6)
There is an open compact U ⊂ X such that supp f ⊂ U . Let ε > 0. Each x ∈ U has an open compact neighbourhood Vx ⊂ U such that ϕ(x) ≥ CVx − ε, |f (y) − f (x)| < ε for y ∈ Vx .
(3.7)
By compactness there are x1 , . . . , xn ∈ U such that Vx1 , . . . , Vxn cover U . Setting S1 := Vx1 , Si := Vxi \ Vxj (i ∈ {2, . . . , n}) j
we obtain an open compact partition S1 , . . . , Sn of U . For each i ∈ {1, . . . , n} we obtain, using the fact that supp f ξSi ⊂ Si ⊂ Vxi and (3.7), p(f ξSi ) ≤ CVxi f ξSi ∞ ≤ CVxi f ξVxi ∞ ≤ (ϕ(xi ) + ε) (|f (xi )| + ε), so that for f = ni=1 f ξSi we obtain p(f ) ≤ max p(f ξSi ) ≤ max (ϕ(xi ) + ε) (|f (xi )| + ε) 1≤i≤n
1≤i≤n
≤ sup{|f (x)| ϕ(x) : x ∈ X} + ε f ∞ + ε sup{ϕ(x) : x ∈ U } + ε2
3.7 Examples of locally convex spaces
123
and, since this holds for each ε > 0, (3.6) follows. Finally, let ρ ∈ K, 0 < |ρ| < 1. For each r ∈ [0, ∞) choose a λ(r) ∈ K such that r < |λ(r)| ≤ r |ρ|−1 . Then φ := λ ◦ ϕ is a map X−→K, bounded on compact sets and p(f ) ≤ sup{|f (x)| |φ(x)| : x ∈ X} (f ∈ Cc (X)), which completes the proof. Theorem 3.7.23 Let X be locally compact and metrizable. Then (Cc (X), τi ) = (BCWc (X), τWc ) is complete, and the following are equivalent: (α) (Cc (X), τi ) is normable. (β) (Cc (X), τi ) is metrizable. (γ ) X is compact. Proof. The equality (Cc (X), τi ) = (BCWc (X), τWc ) follows from 3.7.20 and 3.7.22. Now we prove completeness. By 3.7.13 we have that (BWc (X), τWc ) is complete. If (fi )i is a net in BCWc (X) converging to some f ∈ BWc (X) then since φ := 1 is a member of Wc , fi → f uniformly, so that f is continuous. It follows that BCWc (X), being a closed subspace of BWc (X), is complete. To prove the equivalences it suffices to consider only (β) =⇒ (γ ). Suppose (Cc (X), τi ) = (Cc (X), τWc ) is metrizable. By 3.5.2 there exist φ1 , φ2 , . . . ∈ Wc such that the seminorms pφ1 , pφ2 , . . . induce τWc on Cc (X). Without loss, assume |φ1 | ≤ |φ2 | ≤ · · · . Now suppose X is not compact; we derive a contradiction. By metrizability of X there exists a sequence x1 , x2 , . . . in X, with xn = xm whenever n = m, without convergent subsequences. Hence, by local compactness we can construct open compact sets U1 , U2 , . . . mutually disjoint, such that xn ∈ Un for every n. Set Mn := sup{|φn (x)| : x ∈ Un }, and choose λn ∈ K with |λn | > n Mn for each n. Define φ : X−→K by φ(x) :=
λn 0
if n ∈ N, x = xn if x ∈ X \ {x1 , x2 , . . .}.
Then φ ∈ Wc (with the same trick as in 3.7.20), so there are a C > 0 and a k ∈ N such that pφ ≤ C pφk on Cc (X). Applied to ξUn for n ≥ k we find n Mn < |λn | = |φ(xn )| ≤ pφ (ξUn ) ≤ C pφk (ξUn ) = C sup{|φk (x)| : x ∈ Un } ≤ C sup{|φn (x)| : x ∈ Un } = C Mn . It follows that n < C for n ≥ k, an absurdity.
Remark 3.7.24 We do not know of interesting results in the spirit of 3.7.20– 3.7.23 for more general X.
124
Locally convex spaces
3.7.2 Spaces of analytic functions Throughout Subsection 3.7.2 we assume that K is algebraically closed, so the valuation of K is dense. Recall (2.5.56) that for every disk of the type B(0, r − ), where r ∈ (0, ∞), there are unbounded functions in P SB(0, r − ). But P SB(0, r − ) has a natural locally convex topology as follows. Definition 3.7.25 For r ∈ (0, ∞], let A(r) be the space P SB(0, r − ) of all functions f : B(0, r − )−→K that can be expanded into a power series, equipped with the locally convex topology induced by the norms f −→ f s := max{|f (x)| : |x| ≤ s}, where 0 < s < r. By viewing for 0 < s1 < s2 < r the restriction map BP S(B(0, s2 ))−→BP S(B(0, s1 )) (which is a continuous linear injection) as an inclusion we can write BP S(B(0, s)). A(r) = 0<s
The map f −→ (λ0 , λ1 , . . .)
(f (x) =
∞
λn x n , |x| < r)
n=0
sends A(r) isomorphically onto the space {(λ0 , λ1 , . . .) ∈ K N∪{0} : limn |λn | s n = 0 for each 0 < s < r} = {(λ0 , λ1 , . . .) ∈ K N∪{0} : n → |λn | s n is bounded for each 0 < s < r} equipped with the locally convex topology induced by the norms given by (λ0 , λ1 , . . .)s := max |λn | s n , n∈N∪{0}
where 0 < s < r. (Notice that these norms . s are solid, see 2.5.53 and 2.5.58.) Observe that A(∞) is the space of entire functions. By choosing 0 < s1 < s2 < . . . , limn sn = r we have the projective sequence · · · · −→BP S(B(0, s2 ))−→BP S(B(0, s1 ))
3.7 Examples of locally convex spaces
125
and it is easily verified that A(r) = lim BP S(B(0, sn )), so we arrive at the ←− following theorem. Theorem 3.7.26 For each r ∈ (0, ∞] the space A(r) is complete, metrizable, not normable. Proof. By 3.5.7 A(r) is Fr´echet. If it were normable there would be an s ∈ (0, r) such that . s is equivalent to . t for each t ∈ [s, r). But it is easy to see that this is not the case. By a “dual” approach we arrive at the following. Definition 3.7.27 For r ∈ [0, ∞), let A† (r) := s>r BP S(B(0, s)), equipped with the strongest locally convex topology making all inclusions BP S(B(0, s))−→A† (r) continuous. By choosing ∞ > s1 > s2 > · · · , limn sn = r we therefore have (see the comments after 3.4.34) A† (r) = lim BP S(B(0, sn )). −→
Similarly as for A(r) there is an interpretation of A† (r) as the space {(λ0 , λ1 , . . .) ∈ K N∪{0} : n → |λn | s n is bounded for some s > r} = {(λ0 , λ1 , . . .) ∈ K N∪{0} : limn |λn | s n = 0 for some s > r}. If r > 0, A† (r) can be viewed as the space of all f ∈ BP S(B(0, r)) whose power series converges on some disk with radius > r, and therefore A† (r) is sometimes called the space of overconvergent power series on B(0, r). If r = 0 then A† (r) can be considered as the collection of all functions that can be expanded into a power series on some disk about 0, modulo the equivalence relation ≡ given by f ≡ g if f, g coincide on some disk about 0. A† (0) is sometimes called the space of germs of analytic functions at 0. Remark 3.7.28 Both A(r) and A† (r) are examples of a so-called sequence space, i.e., a locally convex space that is algebraically isomorphic to a subspace of K N . We will return to A(r) and A† (r) within the framework of systematic study of sequence spaces in Chapter 9. In particular we will see that A† (r) is complete (9.7.5(ii)) but non-metrizable (9.7.7(a)). A further study of A† (r) will appear in Chapter 11. A third way of defining locally convex spaces related to analytic functions is the following. Recall (2.5.64) that for closed, bounded A ⊂ K the space H (A) of analytic elements is a Banach space, but that in general the uniform topology on H (A) is awkward, even may not be a vector topology (2.5.65). This leads
126
Locally convex spaces
to the following more natural approach. Recall (2.5.62) that R(A) is the space of rational functions A−→K (having no poles in A). Definition 3.7.29 Let A ⊂ K. We say that f : A−→K is a rigid analytic function if there exists a net (fi )i in R(A) such that limi fi = f uniformly on all complete bounded subsets of A. With the topology induced by the seminorms f −→ f B := sup{|f (x)| : x ∈ B}, where B runs through the collection of all complete bounded subsets of A, the space O(A) of all rigid analytic functions on A is a locally convex space. A standard argument shows that O(A) is complete and that O(A) = H (A) as soon as A is closed and bounded. Notice that O(A) = A(r) in case A = B(0, r − ), where 0 < r < ∞, but O(K) = A(∞). Turning now to metrizability we introduce the following natural concept. Definition 3.7.30 Let A ⊂ K. A sequence Y1 ⊂ Y2 ⊂ · · · of subsets of A is called a fundamental sequence of complete bounded subsets of A if each Yn is complete and bounded and if for each complete bounded Y ⊂ A we have Y ⊂ Yn for some n. Theorem 3.7.31 If A ⊂ K has a fundamental sequence of complete bounded subsets then O(A) is a Fr´echet space. Proof. It is almost obvious that the norms . Yn , where Y1 , Y2 , . . . is a fundamental sequence of complete bounded sets, generate the topology. Then apply 3.5.2. Clearly closed subsets of K have a fundamental sequence of complete bounded sets. We even have the following. Theorem 3.7.32 Let A := B \ X, where B, X ⊂ K are closed, and such that bounded closed subsets of X are compact. Then A has a fundamental sequence of complete bounded sets. Proof. We may assume X = ∅. Set Yn := {x ∈ B : |x| ≤ n, dist (x, X) ≥ n1 }. Then each Yn is a bounded, complete subset of A; let Y ⊂ A be complete and bounded. If Y ⊂ Yn for no n then, by boundedness of Y , for large n there is yn ∈ Y with dist (yn , X) < n1 , so there are xn ∈ X such that limn (yn − xn ) = 0. By boundedness of Y the sequence x1 , x2 , . . . is bounded and by assumption {x1 , x2 , . . .} is compact, so there is a subsequence xn1 , xn2 , . . . converging to x ∈ X. But then yn1 , yn2 , . . . also converges to x and so x ∈ Y by completeness. Hence X ∩ Y = ∅, a contradiction.
3.7 Examples of locally convex spaces
127
Example 3.7.33 The Fr´echet space O(Cp \ Qp ) (where K = Cp ) is called the space of rigid analytic functions on the “upper half plane” Cp \ Qp of Cp , see [210], I.5.D.
3.7.3 Spaces of differentiable functions In the remaining part of Section 3.7 X is a non-empty subset of K without isolated points. We will use the terminology of Subsection 2.5.7. For a non-empty subset Y of X, n ∈ N ∪ {0}, f ∈ C n (X) we set, admitting the value ∞, pYn (f ) := max i f Y , 0≤i≤n
where
i f Y := sup{i f (t) : t ∈ Y i+1 }.
If also g ∈ C n (X) then pYn (f + g) ≤ max(pYn (f ), pYn (g)) and pYn (f g) ≤ pYn (f ) pYn (g) (where 0.∞ = 0). This last formula is a direct consequence of rule V of 2.5.78. We need the following lemma. Lemma 3.7.34 Let Y1 ⊂ Y2 be non-empty subsets of X. Then for each f ∈ C n (X), n ∈ {0, 1, . . .}, pYn1 (f ) ≤ pYn2 (f ). If, in addition, Y2 \ Y1 has no isolated points and d := dist (Y1 , Y2 \ Y1 ) > 0 we have for each f ∈ C n (X) that is 0 on Y2 \ Y1 and n ∈ {0, 1, . . .}, pYn2 (f ) ≤ d n pYn1 (f ), where d := max(1, d1 ). Proof. Only the second statement needs a proof, which we shall carry out by induction on n. The case n = 0 is obvious. For the induction step n − 1 → n first observe that pYn2 (f ) = max(n f Y2 , pYn−1 (f )), and by the 2 n−1 n−1 n n (f ) ≤ d p (f ) ≤ d p (f ). It therefore sufinduction hypothesis, pYn−1 Y1 Y1 2 fices to prove that for (x1 , . . . , xn+1 ) ∈ Y2n+1 n f (x1 , . . . , xn+1 ) ≤ d n pn (f ). (3.8) Y1 Now (3.8) is true if all x1 , . . . , xn+1 are in Y1 , and also if all x1 , . . . , xn+1 are in Y2 \ Y1 (n f (x1 , . . . , xn+1 ) = 0 if (x1 , . . . , xn+1 ) ∈ n+1 (Y2 \ Y1 ), so by
128
Locally convex spaces
density of n+1 (Y2 \ Y1 ) in (Y2 \ Y1 )n+1 and continuity we have n f = 0 on (Y2 \ Y1 )n+1 ). For the remaining case we may, by symmetry of n f (2.5.78,II), assume that x1 ∈ Y2 \ Y1 , x2 ∈ Y1 . Then |x1 − x2 | ≥ d , so |x1 − x2 |−1 ≤ d1 ≤ d and n f (x1 , . . . , xn+1 ) f (x , x , . . . , x ) − f (x , x , . . . , x ) 1 3 n+1 n−1 2 3 n+1 n−1 = x1 − x2 (f ) ≤ d d n−1 pYn−1 (f ) ≤ d n pYn1 (f ), ≤ d n−1 f Y2 ≤ d pYn−1 2 1 and the proof is complete.
In a special case we have a more precise estimate. Lemma 3.7.35 Let B ⊂ X and suppose 0 < dist (B, X \ B) < 1. Then, for each n ∈ {0, 1, . . .}, n (ξB ) = n (ξB )X = dist (B, X \ B)−n . pX
Proof. It suffices to prove the second equality. B and X \ B are clopen, so they have no isolated points. From the previous lemma we obtain n (ξB )X ≤ n (ξB ) ≤ dist (B, X \ B)−n pBn (ξB ) = dist (B, X \ B)−n . Conversely, since B pX is clopen in X we have ξB ∈ C ∞ (X) and by using the Taylor formula 2.5.80 for x ∈ B, y ∈ X \ B we arrive at n ξB (x, x, . . . , x, y) = |ξB (x) − ξB (y)| = |x − y|−n , |x − y|n showing that n (ξB )X ≥ sup{|x − y|−n : x ∈ B, y ∈ X \ B} = dist (B, X \ B)−n . For f ∈ C n (X) and non-empty compact Y the continuous functions f, 1 f, . . . , n f are bounded on Y, Y 2 , . . . , Y n+1 respectively, so pYn (f ) < ∞. This leads to a Hausdorff locally convex topology on C n (X), which for n = 0 coincides with the topology τc on C(X) = C 0 (X) (3.7.3). Definition 3.7.36 Let n ∈ {0, 1, . . .}. The locally convex topology on C n (X) generated by the seminorms {pYn : ∅ = Y ⊂ X, Y compact} is denoted τcn . It is called the topology of uniform convergence on compact sets of difference quotients of order 0, 1, . . . , n. On C ∞ (X) we define the topology τc∞ of uniform convergence on compact sets of all difference quotients to be the union of all τcn , n ∈ {0, 1, . . .}.
3.7 Examples of locally convex spaces
129
Indeed, it is almost obvious to verify that a net (fi )i in C n (X) (C ∞ (X)) converges to f ∈ C n (X) (C ∞ (X)) with respect to τcn (τc∞ ) if and only if k fi converges, uniformly on compact subsets of X k+1 , to k f for each k ∈ {0, 1, . . . , n} (k ∈ {0, 1, . . .}). If X is compact, n ∈ {0, 1, . . .} the topology τcn on C n (X) = BC n (X) can n be described by the single norm pX (which is the norm . n of 2.5.82); the n norms {pX : n ∈ {0, 1, . . .}} induce the metrizable topology τc∞ . In general we have the following results. Compare with 3.7.9. Theorem 3.7.37 The spaces (C n (X), τcn ) (n ∈ {0, 1, . . .}) and (C ∞ (X), τc∞ ) are complete. Proof. Let n ∈ {0, 1, . . .} and let (fi )i be a Cauchy net in (C n (X), τcn ). For each k ∈ {1, . . . , n + 1} we define a function hk : Xk −→K by hk := limi k−1 fi , uniformly on compact subsets of X k . By metrizability and 3.7.6, 3.7.8 the functions hk are continuous. By taking pointwise limits we have for (x1 , . . . , xn+1 ) ∈ n+1 X: hn+1 (x1 , . . . , xn+1 ) = n h1 (x1 , . . . , xn+1 ). So, by definition of a C n -function, h1 ∈ C n (X). Hence, (fi )i converges to h1 in τcn . The statement for (C ∞ (X), τc∞ ) is now trivial. Theorem 3.7.38 Let n ∈ {0, 1, . . .}. Then (C n (X), τcn ) is normable if and only if X is compact. Proof. We prove that normability of (C n (X), τcn ) implies compactness of X. There exists a non-empty compact Y ⊂ X such that pYn is a norm generating the topology. If Y = X, let U be a clopen subset of X such that Y ⊂ U X. Then 0 = ξX\U ∈ C ∞ (X) but pYn (ξX\U ) = 0, a contradiction. Theorem 3.7.39 (C ∞ (X), τc∞ ) is not normable. Proof. Suppose (C ∞ (X), τc∞ ) is normable; we derive a contradiction. There are an n ∈ N and a non-empty compact Y ⊂ X such that τc∞ is generated by the norm pYn . As in the previous proof we may conclude that Y = X is compact and therefore we have n (f ) n+1 f X ≤ C pX
(f ∈ C ∞ (X))
(3.9)
for some C > 0. Let B be a ball in X such that 0 < dist (B, X \ B) < 1. Then from 3.7.35 and (3.9) for f = ξB we deduce dist (B, X \ B)−n−1 ≤ C dist (B, X \ B)−n ,
130
Locally convex spaces
implying dist (B, X \ B) ≥ C −1 . But X has no isolated points, so we can choose B such that dist (B, X \ B) is small. Contradiction. Before characterizing metrizability of (C n (X), τcn ) we prove first a topological fact. Lemma 3.7.40 An ultrametric space is hemicompact if and only if it is locally compact and separable. Proof. The “if” part is covered by 2.5.35(γ ) =⇒ (α) and 3.7.5(d). To prove the converse, let Z be an ultrametric hemicompact space, let Y1 ⊂ Y2 ⊂ · · · be a fundamental sequence of compact subsets of Z. Suppose there is an x ∈ Z without compact neighbourhood; we derive a contradiction. In fact, for n ∈ N, B(x, n1 ) ⊂ Yn (otherwise B(x, n1 ) would be compact), hence there exists an xn ∈ B(x, n1 ) \ Yn . Then xn → x, so {x, x1 , x2 , . . .} is compact but is contained in no Yn , contradiction. Thus, Z is locally compact. Separability now follows from 2.5.35(α) =⇒ (γ ). Theorem 3.7.41 Let n ∈ {0, 1, . . .}. Then the following are equivalent: (α) (β) (γ ) (δ)
(C n (X), τcn ) is metrizable. (C ∞ (X), τc∞ ) is metrizable. X is hemicompact. X is locally compact and separable.
Proof. By 3.7.40 we only have to concentrate on (α), (β) and (γ ). (γ ) =⇒ (α). The spaces X, X2 , . . . , Xn+1 are hemicompact, so by 3.7.9(ii) the spaces (C(X k ), τc ), k ∈ {1, . . . , n + 1}, are metrizable and so is E := k 1≤k≤n+1 (C(X ), τc ) (3.5.5). Now the map f → (f, 1 f, . . . , n f ) sends n n (C (X), τc ) linearly and homeomorphically into E and metrizability follows. (γ ) =⇒ (β). By the above, (γ ) implies (α) for each n ∈ {0, 1, . . .}. Now apply 3.5.2 to arrive at (β). To prove (α) =⇒ (γ ) and (β) =⇒ (γ ), let F be either (C n (X), τcn ) or ∞ (C (X), τc∞ ) and suppose that F is metrizable. By 3.5.2 there exist compact Y1 , Y2 , . . . ⊂ X and m1 , m2 , . . . ∈ {0, 1, . . .} such that {pYmkk : k ∈ N} induce the topology. Without loss, assume Y1 ⊂ Y2 ⊂ · · · and m1 ≤ m2 ≤ · · · . Now let Y ⊂ X be compact. Then pY0 ≤ C pYmkk for some C > 0 and k ∈ N. If Y ⊂ Yk , let x ∈ Y , x ∈ Yk and let B a ball in X about x not meeting Yk . Then ξB ∈ F and 1 = |ξB (x)| ≤ pY0 (ξB ) ≤ C pYmkk (ξB ) = 0, a contradiction.
3.7 Examples of locally convex spaces
131
In the spirit of 3.7.1 one can also think of introducing a C n -version of pointwise convergence as follows. Definition 3.7.42 Let n ∈ {0, 1, . . .}. The locally convex topology on C n (X) defined by the seminorms pYn , where Y runs through the collection of all nonempty finite subsets of X, is called τsn . On C ∞ (X) we define the topology τs∞ as the union of all τsn |C ∞ (X). Clearly τs0 coincides with τs introduced in 3.7.1. There is an easier way to describe τsn in terms of Hasse derivatives (see 2.5.79). Theorem 3.7.43 Let n ∈ {0, 1, . . .}. Then on C n (X) the seminorms f → |Dk f (x)| (k ∈ {0, 1, . . . , n}, x ∈ X) generate the topology τsn . Proof. Let Y ⊂ X be finite, Y = ∅. It suffices to prove that there is a constant C > 0 such that pYn (f ) ≤ C max{|Dk f (y)| : 0 ≤ k ≤ n, y ∈ Y }
(3.10)
for all f ∈ C n (X). This is obvious if Y is a singleton set (we can choose C := 1), so assume Y ≥ 2. We now proceed by induction on n. The case n = 0 is trivial. For the step n − 1 → n we use an idea, similar to the one of the proof of 3.7.34. In fact, let d := min{y − y : y, y ∈ Y, y = y } and put d := max(1, d1 ). We will prove (3.10) with C := d n . By the induction hypothesis, it suffices to show that n f Y ≤ d n max{|Dk f (y)| : 0 ≤ k ≤ n, y ∈ Y }.
(3.11)
Let x1 , . . . , xn+1 ∈ Y . If they are not all equal we may suppose by symmetry that x1 = x2 . Then n f (x1 , . . . , xn+1 ) f (x , x , . . . , x ) − f (x , x , . . . , x ) n−1 1 3 n+1 n−1 2 3 n+1 = ≤ d n−1 f Y , x1 − x2 which is, again by the induction hypothesis, ≤ d d n−1 max{|Dk f (y)| : 0 ≤ k ≤ n − 1, y ∈ Y } ≤ d n max{|Dk f (y)| : 0 ≤ k ≤ n, y ∈ Y }. If all x1 , . . . , xn+1 are equal we have n f (x1 , . . . , xn+1 ) = |Dn f (x1 )| , which is obviously smaller than or equal to the right-hand side of (3.11).
132
Locally convex spaces
Remark 3.7.44 It follows from the above that a net (fi )i in C n (X) is Cauchy (resp. converges to f ∈ C n (X)) in τsn if and only if (Dk fi )i is pointwise Cauchy (resp. Dk fi → Dk f pointwise) for all k ∈ {0, 1, . . . , n}. The proof of the next characterization is in the same vein as the one of 3.7.41. Theorem 3.7.45 (i) The spaces (C n (X), τsn ) (n ∈ {0, 1, . . .}) and (C ∞ (X), τs∞ ) are neither normable nor (sequentially) complete. (ii) Let n ∈ {0, 1, . . .}. Then the following are equivalent: (α) (C n (X), τsn ) is metrizable. (β) (C ∞ (X), τs∞ ) is metrizable. (γ ) X is countable. Proof. (i). Suppose, for some n, (C n (X), τsn ) or (C ∞ (X), τs∞ ) is normable. Then there is a non-empty finite set Y ⊂ X and an m such that the norm pYm generates the topology. Since X has no isolated points we have Y= X, so there is a non-empty clopen set U ⊂ X that does not meet Y . Then ξU = 0 but pYm (ξU ) = 0, a contradiction. To prove non-sequential completeness, let x ∈ X. Consider the sequence i → ξB(x, 1 ) . For each y ∈ X and k ∈ {0, 1, . . .}, i lim Dk ξB(x, 1 ) (y) − Dk ξB(x, 1 ) (y) = 0, i
i+1
i
so that by 3.7.44 the sequence is Cauchy. But it converges pointwise to ξ{x} and this function is not even continuous, so the above sequence does not converge in τsn or τs∞ . (ii). If X is countable then the collections f −→ |Dk f (x)|
(k ∈ {0, 1, . . . , n}, x ∈ X)
f −→ |Dk f (x)|
(k ∈ {0, 1, . . .}, x ∈ X)
and
are countable, so by 3.5.2 and 3.7.43, (C n (X), τsn ) and (C ∞ (X), τs∞ ) are metrizable, which proves (γ ) =⇒ (α) and (γ ) =⇒ (β). To prove (α) =⇒ (γ ) and (β) =⇒ (γ ), let F be either (C n (X), τsn ) or ∞ (C (X), τs∞ ) and suppose that F is metrizable. By 3.5.2 there exist finite sets ∅ = Y1 ⊂ Y2 ⊂ . . . and m1 , m2 , . . . ∈ {0, 1, . . .} with m1 ≤ m2 ≤ . . . such 0 ≤ C pYmkk for that {pYmkk : k ∈ N} induce the topology. Now let x ∈ X. Then p{x} some C > 0 and k ∈ N. Suppose x ∈ Yk , let B be a ball in X about x not meeting Yk . Then ξB ∈ F and 0 1 = |ξB (x)| = p{x} (ξB ) ≤ C pYmkk (ξB ) = 0, a contradiction. Hence X = k∈N Yk is countable.
3.7 Examples of locally convex spaces
133
In 2.5.82 and 2.5.84 we considered the Banach spaces (BC n (X), . n ). Now we look at the “locally convex intersection”. Definition 3.7.46 Let BC ∞ (X) be the space n∈N∪{0} BC n (X) equipped with the locally convex topology defined by the family of norms { . n : n ∈ {0, 1, . . .}}. Theorem 3.7.47 BC ∞ (X) is a Fr´echet space. Proof. Metrizability follows from 3.5.2. Also, from completeness of each BC n (X) it is easily seen that BC ∞ (X) is complete. Next we study weighted topologies on spaces of differentiable functions in the spirit of 3.7.12. To be able to define these topologies properly we will assume that our weight functions are in C ∞ (X). To obtain interesting results we will require that X is locally compact. Definition 3.7.48 Let X ⊂ K be locally compact. Let W be a family of functions in C ∞ (X), and suppose for each x ∈ X there is a locally constant φ ∈ W with φ(x) = 0.
(3.12)
n For n ∈ {0, 1, . . .}, let BCW (X) be the space of all f ∈ C n (X) for which n n (X) is the locally pX (f φ) < ∞ for each φ ∈ W . The W -topology τWn on BCW convex topology induced by the seminorms n f −→ f nφ := pX (f φ)
n (f ∈ BCW (X)),
∞ where φ runs through W . The W -topology τW∞ on BCW (X) := n n BC (X) is the union of all τ , n ∈ {0, 1, . . .}. n∈N∪{0} W W Obviously the W -topologies are Hausdorff.
From now until Section 3.8 we will assume that X is locally compact and that W ⊂ C ∞ (X) satisfies (3.12). The next lemma express the fact that τcn and τc∞ are – in some sense – minimal among the W -topologies. n Lemma 3.7.49 For each n ∈ {0, 1, . . .} τWn is stronger than τcn |BCW (X), and ∞ ∞ ∞ τW is stronger than τc |BCW (X). For
W := {f : X−→K : f is locally constant, f has compact support} n ∞ (X), τWn ) = (C n (X), τcn ) and (BCW (X), τW∞ ) = (C ∞ (X), τc∞ ). we have (BCW
134
Locally convex spaces
Proof. Let n ∈ {0, 1, . . .}. Consider := {U ⊂ X : U open compact, pUn is τWn -continuous}. Clearly clopen subsets of elements of are in . We next prove that covers X. Let x ∈ X. By assumption there is a locally constant φ ∈ W with φ(x) = 0. Let U be an open compact neighbourhood of x on which φ is constant. Then n (X) we have for f ∈ BCW n pX (f φ) ≥ pUn (f φ) = |φ(x)| pUn (f ),
showing that U ∈ . Now let Y ⊂ X be compact. To prove that pYn is τWn continuous, let U1 , . . . , Um be a finite covering of Y by members of ; we may assume the Ui to be disjoint. It suffices to show that pYn ≤ C max1≤i≤m pUn i for some C > 0. To this end, let B := U2 ∪ · · · ∪ Um . Then, using 3.7.34, for f ∈ C n (X) pYn (f ) ≤ pUn 1 ∪B (f ) = pUn 1 ∪B (f ξU1 + f ξB ) ≤ max(pUn 1 ∪B (f ξU1 ), pUn 1 ∪B (f ξB )) ≤ max(d n pUn 1 (f ), d n pBn (f )), where d := max(1, dist (B, U1 )−1 ). Now by using the decomposition B = U2 ∪ U3 ∪ · · · ∪ Um we can derive in the same way that ˜ n max(p n (f ), pn ˜ pBn (f ) ≤ (d) U2 U3 ∪...∪Um (f )), where d := max(1, dist (U2 , U3 ∪ −1 · · · ∪ Um ) ), and so on. After finitely many steps we arrive at the desired inequality pYn (f ) ≤ C max pUn i (f ) 1≤i≤m
is τWn -continuous. That τc∞ ≤ τW∞ is now for some C > 0, showing that obvious. Now choose W as indicated. We only need to prove that τWn ≤ τcn for n ∈ {0, 1, . . .}. So let φ ∈ W ; we prove that . nφ is τcn -continuous. Write φ = m i=1 λi ξUi , where λ1 , . . .