Peter A. Loeb · Manfred P.H. Wolff Editors
Nonstandard Analysis for the Working Mathematician Second Edition
Nonstandard Analysis for the Working Mathematician
Peter A. Loeb Manfred P.H. Wolff •
Editors
Nonstandard Analysis for the Working Mathematician Second Edition
123
Editors Peter A. Loeb Department of Mathematics University of Illinois Urbana, IL USA
ISBN 978-94-017-7326-3 DOI 10.1007/978-94-017-7327-0
Manfred P.H. Wolff Mathematical Institute University of Tübingen Tübingen Germany
ISBN 978-94-017-7327-0
(eBook)
Library of Congress Control Number: 2015946066 Primary: 03H05, 03H10, 03H15, 11U10, 12L15, 26E35, 28E05, 46S20, 47S20, 54J05 Secondary: 11B05, 11B13, 11B30, 11B75, 46B08, 46B20, 47A10, 47A58, 47D06, 47H09, 47H10, 54D30, 60G51, 60H07, 60J65, 91A06, 91B99 Springer Dordrecht Heidelberg New York London © Springer Science+Business Media Dordrecht 2015 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer Science+Business Media B.V. Dordrecht is part of Springer Science+Business Media (www.springer.com)
Preface
This book is addressed to mathematicians working in analysis, probability, and various applications. The aim is to provide an understandable introduction to the basic theory of nonstandard analysis in Part I, and then illuminate some of the most striking applications. Much of the book, in particular Part I, can be used in a graduate course; problems are posed in those chapters. After Part I, each chapter takes up a different field for the application of nonstandard analysis, beginning with a gentle introduction that even nonexperts can read with profit. The remainder of each chapter is then addressed to experts, showing how to use nonstandard analysis in the search for solutions of open problems and how to obtain rich new structures that produce deep insight into the field under consideration. The applications discussed here are in functional analysis including operator theory, topology applied to compactifications, probability theory including stochastic processes, economics including game theory and financial mathematics, and combinatorial number theory. In all of these areas, the intuitive notion of an infinitely small or infinitely large quantity plays an essential and helpful role in the creative process. For example, Brownian motion is often thought of as a random walk with infinitesimal increments; the spectrum of a selfadjoint operator is viewed as the set of “almost eigenvalues”; an ideal economy consists of an infinite number of agents each having an infinitesimal influence on the economy. Already at the level of calculus, one often views the integral as an infinitely large sum of infinitesimal quantities. Of course, the notion of an infinitesimal quantity has been used in mathematics for over 2200 years. Although it was one of the leading ideas employed during the period of mathematical development from Leibniz and Newton to Cauchy, it eluded rigorous treatment until the work of Abraham Robinson between 1957 and 1966, culminating in 1966 with the publication of his book “Non-standard Analysis”. That work finally established a rigorous foundation for the use of infinitesimals in mathematics. More precisely, Robinson constructed an ordered field extension R of the reals, R, so that all of the sequences, functions and, indeed, relations of real analysis had a unique extension to the equivalent structure built from R, and all statements true for the real structure remained true for the extended objects in the v
vi
Preface
extended structure. This essential property, known as the Transfer Principle, is the pivotal result of Robinson’s nonstandard analysis. With subsequent contributions to this new discipline from many mathematicians in the late 1960s, including a new result in standard functional analysis obtained by Robinson together with A.R. Bernstein, it became clear that nonstandard analysis was much more than a foundation of infinitesimal calculus. It promised to become a powerful tool in all branches of analysis. Then, an important breakthrough was initiated by W.A.J. Luxemburg’s 1969 paper developing nonstandard hulls, and was extended with the work of C.W. Henson and L.C.R. Moore. The prior construction of ultrapowers of the reals begun by E. Hewitt and generalized to ultraproducts of Banach spaces by J.L. Krivine in the mid-1960s had become a powerful tool in functional analysis. Nonstandard functional analysis using nonstandard hulls, discussed here in Manfred Wolff’s Chap. 4, is a far reaching generalization of these applications of ultraproducts. Chapter 4 deals with old and new applications of nonstandard analysis to the theory of Banach spaces and linear operators. In particular it considers the structure theory of Banach spaces, basic operator theory, strongly continuous semigroups of operators, approximation theory of operators and their spectra, and the Fixed Point Property. The early 1970s produced another breakthrough with P.A. Loeb’s construction of a measure space out of a “hyperfinite” discrete analogue of finite probability spaces. The simplest example was based on a coin toss of length H for an infinitely large natural number H. Immediately, Loeb’s general construction was successfully used by R.M. Anderson to formulate Brownian motion exactly as a random walk with infinitesimal increments based on that coin toss. The general procedure to extract a measure space out of some given “internal” one is now called Loeb measure theory. This theory is briefly introduced at the end of Chap. 3, and it is fully explored starting from first principles in Horst Osswald’s Chap. 6. Applications to stochastic processes, including the Itô integral as well as the Malliavin calculus, are further detailed in Chap. 7, while Yeneng Sun’s Chap. 8 contains an application solving the measurability problem that arises when one considers an infinite number of equally weighted independent agents, and more generally, a continuum of independent random variables. Most of the results of Chap. 8 come from Sun’s recent papers and are based on the richness of the Loeb construction applied to product spaces. Successful applications of nonstandard analysis have occurred in many applied areas such as mathematical physics (an example is L. Arkeryd’s research starting in the early 1980s on gas kinetics and the Boltzmann equation) and mathematical economics. Work in the latter area was initiated with the seminal 1975 paper of D.J. Brown and A. Robinson on nonstandard exchange economies. There is a need in economic theory for models of economies with a very large number of equally weighted agents, each of which has only a negligible influence on the economy. Standard models have taken as the set of agents the unit interval [0,1] supplied with Lebesgue measure. A more natural model is the “hyperfinite set” of agents used by Brown and Robinson. Yeneng Sun’s Chap. 9 of this book describes many uses of
Preface
vii
this model when combined with Loeb measure theory; it also shows why Lebesgue spaces must fail for many economic applications. Other applications of nonstandard analysis include the exploitation of compactness using the “S-topology” on the nonstandard extension of a topological space to obtain quite general and intuitive constructions of compactifications; see Chap. 5 by Insall, Loeb and Marciniak. Important and extensive applications of nonstandard analysis to combinatorial number theory are the subject of Jin and Di Nasso’s Chaps. 10 and 11 in this book. For the reader just learning nonstandard analysis, we point again to our Part I that begins with a simple form of nonstandard analysis, suitable for the results of calculus and basic real analysis. The presentation is intended to give the reader a feeling for the fundamental arguments of nonstandard analysis with a minimum use of model theory. The reader who begins with no background in mathematical logic should easily pick up what is needed to continue. Chapter 2 of Part I is devoted to general nonstandard analysis and presents the heart of Robinson’s theory. It is written so that the interested reader learns all that is needed for later applications without being forced to read detailed model theoretic constructions, some of which are postponed to the appendix of the chapter. Part I concludes in Chap. 3 with further applications. The authors have been asked from time to time about the relation between Robinson’s nonstandard analysis and the subject of “internal set theory,” initiated by Edward Nelson in the 1977 Bulletin of the American Mathematical Society. A good recent development of that framework with applications can be found in Nader Vakil’s text cited here in the references to Chap. 2. What is the difference? The Robinson framework adds to the standard mathematical “world” a second “nonstandard” mathematical world. There are no infinitely large integers in the standard world, but they do exist in the nonstandard world. Robinson chose the name “nonstandard analysis” because the nonstandard world is used to analyze the standard one. Internal set theory, on the other hand, works with only the nonstandard world, but recognizes some elements of that world as being “standard”. Important developments in the Robinson framework have taken objects formed in the nonstandard world and adjoined them to the standard world. For example, equivalence classes of “remote points” become compactifying boundary points of standard topological spaces. Quotients of points in the nonstandard extension of Banach spaces become new Banach spaces in the standard world. Measure spaces formed from nonstandard point-sets become rich measure spaces in the standard world. These constructions do not make sense in internal set theory because there is no standard world. In working through the foundations for nonstandard analysis presented in this book, the reader will gain many new and helpful insights into the enterprise of mathematics. Once these foundations are understood, research formulated in the framework of internal set theory can be easily understood with just some translation of terminology. The editors have found, however, that the reverse is not generally true. Therefore, the reader may best be served by starting here at least with Part I, or with a similar introduction to Robinson’s theory.
viii
Preface
The editors would like to thank the contributors to this second edition for their outstanding contributions to this project. We also thank Erik Talvila, who made numerous helpful suggestions for improvements of the first edition. Finally, the editors dedicate this book to one of the founders of nonstandard analysis; he is our mentor, colleague, and friend, W.A.J. (Wim) Luxemburg. Champaign-Urbana, IL, USA Tübingen, Germany February 2015
Peter A. Loeb Manfred P.H. Wolff
Contents
Part I 1
2
An Introduction to Nonstandard Analysis
Simple Nonstandard Analysis and Applications . . . . . . . . . . Peter A. Loeb 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 A Simple Construction of a Nonstandard Number System 1.3 A Simple Language . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 Interpretation of the Language L . . . . . . . . . . . . . . . . . . 1.5 Transfer Principle for R . . . . . . . . . . . . . . . . . . . . . . . 1.6 The Nonstandard Real Numbers . . . . . . . . . . . . . . . . . . 1.7 Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.8 Topology on the Reals . . . . . . . . . . . . . . . . . . . . . . . . 1.9 Limits and Continuity . . . . . . . . . . . . . . . . . . . . . . . . . 1.10 Differentiation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.11 Riemann Integration . . . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . An Introduction to General Nonstandard Analysis . . . Peter A. Loeb 2.1 Superstructures . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 Language for Superstructures . . . . . . . . . . . . . . . 2.3 Interpretation of the Language for Superstructures. 2.4 Monomorphisms and the Transfer Principle . . . . . 2.5 Ultrapower Construction of Superstructures and Monomorphisms . . . . . . . . . . . . . . . . . . . . . 2.6 Special Index Sets Yielding Enlargements . . . . . . 2.7 A Result in Infinite Graph Theory . . . . . . . . . . . 2.8 Internal and External Sets . . . . . . . . . . . . . . . . . 2.9 Saturation . . . . . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
.... . . . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . . . . . .
3
. . . . . . . . . . . .
3 7 11 12 15 18 23 26 28 30 32 35
.........
37
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
37 38 39 41
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
. . . . . .
44 50 52 53 58 78
ix
x
3
Contents
Topology and Measure Theory . . . . . . . . . . . . . . . . . . Peter A. Loeb 3.1 Metric and Topological Spaces . . . . . . . . . . . . . . . 3.2 Continuous Mappings . . . . . . . . . . . . . . . . . . . . . 3.3 Convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.4 More on Topologies . . . . . . . . . . . . . . . . . . . . . . 3.5 Compact Spaces . . . . . . . . . . . . . . . . . . . . . . . . . 3.6 Product Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . 3.7 Relative Topologies . . . . . . . . . . . . . . . . . . . . . . 3.8 Uniform Continuity and Uniform Spaces . . . . . . . . 3.9 Nonstandard Hulls . . . . . . . . . . . . . . . . . . . . . . . 3.10 Compactifications . . . . . . . . . . . . . . . . . . . . . . . . 3.11 The Base and Antibase Operators . . . . . . . . . . . . . 3.12 Measure and Probability Theory . . . . . . . . . . . . . . 3.12.1 The Martingale Convergence Theorem . . . 3.12.2 Representing Measures in Potential Theory References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Part II 4
........ . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
. . . . . . . . . . . . . . .
79
. . . . . . . . . . . . . . .
79 83 83 84 85 88 88 89 92 93 93 97 99 101 103
.....
107
..... .....
107 108
.....
108
.....
114
..... ..... .....
116 119 119
. . . . . . . . . .
119 124 130 133 133 133 135 137 137 137
Functional Analysis
Banach Spaces and Linear Operators . . . . . . . . . . . . . . . . Manfred P.H. Wolff 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2 Basic Nonstandard Analysis of Normed Spaces . . . . . . 4.2.1 Internal Normed Spaces and Their Nonstandard Hull . . . . . . . . . . . . . . . . . . . . . 4.2.2 Standard Continuous and Internal S–continuous Linear Operators . . . . . . . . . . . . . . . . . . . . . . 4.2.3 Special Banach Spaces and Their Nonstandard Hulls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.2.4 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3 Advanced Theory of Banach Spaces . . . . . . . . . . . . . . 4.3.1 A Brief Excursion to Locally Convex Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . 4.3.2 General Banach Spaces . . . . . . . . . . . . . . . . . 4.3.3 Banach Lattices . . . . . . . . . . . . . . . . . . . . . . 4.3.4 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.4 Elementary Theory of Linear Operators . . . . . . . . . . . . 4.4.1 Compact Operators . . . . . . . . . . . . . . . . . . . . 4.4.2 Fredholm Operators . . . . . . . . . . . . . . . . . . . 4.4.3 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.5 Spectral Theory of Operators . . . . . . . . . . . . . . . . . . . 4.5.1 Basic Definitions and Facts . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
Contents
xi
4.5.2 4.5.3
The Spectrum of an S–bounded Internal Operator . . The Spectrum of Compact Operators and the Essential Spectrum . . . . . . . . . . . . . . . . . 4.5.4 Closed Operators and Pseudoresolvents . . . . . . . . . 4.5.5 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.6 Selected Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.6.1 Strongly Continuous Semigroups . . . . . . . . . . . . . 4.6.2 Approximation of Operators and of Their Spectra . . 4.6.3 Super Properties . . . . . . . . . . . . . . . . . . . . . . . . . 4.6.4 The Fixed Point Property . . . . . . . . . . . . . . . . . . . 4.6.5 References to Further Applications of Nonstandard Analysis To operator Theory . . . . . . . . . . . . . . . . 4.6.6 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Part III 5
6
139
. . . . . . . .
. . . . . . . .
141 142 144 145 145 147 152 155
.. .. ..
158 158 159
.......
165
. . . . .
. . . . .
165 167 170 174 176
....
179
. . . . . . . . . .
. . . . . . . . . .
179 182 182 185 186 188 189 190 195 197
....
197
Compactifications
General and End Compactifications. . . . . . . . . . . . . . . . Matt Insall, Peter A. Loeb and Małgorzata Aneta Marciniak 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.2 General Compactifications . . . . . . . . . . . . . . . . . . . 5.3 End Compactifications. . . . . . . . . . . . . . . . . . . . . . 5.4 Product Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Part IV
..
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
Measure and Probability Theory
Measure Theory and Integration . . . . . . . . . . . . . . . . . . . . . Horst Osswald 6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.2 Loeb Measures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.2.1 Loeb Measure Spaces . . . . . . . . . . . . . . . . . . . 6.2.2 Loeb Measures over Gaußian Measures . . . . . . . 6.2.3 Loeb Measurable Functions . . . . . . . . . . . . . . . 6.2.4 Loeb Spaces over the Product of Internal Spaces 6.2.5 The Hyperfinite Time Line T . . . . . . . . . . . . . . 6.2.6 Lebesgue Measure as a Counting Measure . . . . . 6.2.7 Adapted Loeb Spaces . . . . . . . . . . . . . . . . . . . 6.3 Standard Integrability for Internal Measures . . . . . . . . . . 6.3.1 The Definition of S-integrability and Equivalent Conditions . . . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
xii
Contents
6.3.2 6.3.3 6.3.4 6.3.5 6.3.6 6.3.7 6.3.8 6.4 Internal 6.4.1 6.4.2 6.4.3 6.4.4 6.4.5 6.4.6 6.4.7 References. . . 7
lL -integrability and Sl -integrability . . . . . . . . . . . Integrable Functions defined on Nn K ½0; 1½m Standard Part of the Conditional Expectation . . . . Characterization of S-integrability . . . . . . . . . . . . Keisler’s Fubini Theorem . . . . . . . . . . . . . . . . . Hyperfinite Representation of the Tensor Product . On Symmetric Functions . . . . . . . . . . . . . . . . . . and Standard Martingales . . . . . . . . . . . . . . . . . . Stopping Times and Doob’s Upcrossing Result. . . The Maximum Inequality. . . . . . . . . . . . . . . . . . Doob’s Inequality . . . . . . . . . . . . . . . . . . . . . . . The Burkholder Davis Gundy Inequalities . . . . . . S-integrability of Internal Martingales . . . . . . . . . S-continuity of Internal Martingales. . . . . . . . . . . The Standard Part of Internal Martingales . . . . . . ....................................
Stochastic Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Horst Osswald 7.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.2 The Itô Integral for the Brownian Motion . . . . . . . . . . . . 7.2.1 The S-Continuity of the Internal Integral . . . . . . . 7.2.2 The S-Square-Integrability of the Internal Itô Integral. . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.2.3 Adaptedness and Predictability . . . . . . . . . . . . . . 7.2.4 The Standard Itô Integral . . . . . . . . . . . . . . . . . . 7.2.5 Integrability of the Itô Integral . . . . . . . . . . . . . . 7.2.6 The Wiener Measure . . . . . . . . . . . . . . . . . . . . . 7.3 The Iterated Integral . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.3.1 The Definition of the Iterated Integral . . . . . . . . . 7.3.2 On Products of Iterated Integrals. . . . . . . . . . . . . 7.3.3 The Continuity of the Standard Iterated Integral Process . . . . . . . . . . . . . . . . . . . . . . . . 7.3.4 The W CH -Measurability of the Iterated Itô Integral 7.3.5 InM ðf Þ is a Continuous Version of the Standard Part of InM ðFÞ . . . . . . . . . . . . . . . . . . . . . . . . . . 7.3.6 Continuous Versions of Iterated Integral Processes 7.4 Beginning of Malliavin Calculus. . . . . . . . . . . . . . . . . . . 7.4.1 Chaos Decomposition . . . . . . . . . . . . . . . . . . . . 7.4.2 A Lifting Theorem for Functionals in L2W ðCL Þ . . . 7.4.3 Computation of the Kernels . . . . . . . . . . . . . . . . 7.4.4 The Kernels of the Product of Wiener Functionals 7.4.5 The Malliavin Derivative . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
200 205 210 211 213 217 220 222 223 224 224 225 225 226 226 230
...
233
... ... ...
233 237 238
. . . . . . . .
. . . . . . . .
243 245 247 248 250 252 252 256
... ...
259 260
. . . . . . . .
262 263 264 265 270 271 273 276
. . . . . . . .
. . . . . . . .
. . . . . . . .
Contents
xiii
7.4.6 7.4.7 7.4.8 7.4.9 7.4.10
A Commutation Rule for Derivative and Limit . . The Clark-Ocone Formula . . . . . . . . . . . . . . . . A Lifting Theorem for the Derivative . . . . . . . . The Skorokhod Integral . . . . . . . . . . . . . . . . . . Product and Chain Rules for the Malliavin Derivative . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.5 Stochastic Integration for Symmetric Poisson Processes . . 7.5.1 Orthogonal Increments. . . . . . . . . . . . . . . . . . . 7.5.2 From Internal Random Walks to the Standard Poisson Integral . . . . . . . . . . . . . . . . . . . . . . . 7.5.3 Iterated Integrals . . . . . . . . . . . . . . . . . . . . . . . 7.5.4 Multiple Integrals . . . . . . . . . . . . . . . . . . . . . . 7.5.5 The r-Algebra D generated by the Wiener-Lévy Integrals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.6 Malliavin Calculus for Poisson Processes . . . . . . . . . . . . 7.6.1 Chaos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.6.2 Malliavin Derivative . . . . . . . . . . . . . . . . . . . . 7.6.3 Exchange of Derivative and Limit. . . . . . . . . . . 7.6.4 The Clark-Ocone Formula . . . . . . . . . . . . . . . . 7.6.5 The Skorokhod Integral . . . . . . . . . . . . . . . . . . 7.6.6 Smooth Representations. . . . . . . . . . . . . . . . . . 7.6.7 The Product Rule . . . . . . . . . . . . . . . . . . . . . . 7.6.8 The Chain Rule . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
. . . .
. . . .
277 278 280 281
.... .... ....
284 288 288
.... .... ....
290 293 297
. . . . . . . . . . .
. . . . . . . . . . .
298 302 302 305 306 307 309 310 311 315 317
...
321
. . . . . . . . . . . .
321 322 324 326 327 330 332 336 338 340 343 344
New Understanding of Stochastic Independence . . . . . . . . . . . Yeneng Sun 8.1 The General Context . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.2 The Specific Problems. . . . . . . . . . . . . . . . . . . . . . . . . . 8.3 Difficulties in the Classical Framework . . . . . . . . . . . . . . 8.4 The Resolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8.5 Exact Law of Large Numbers. . . . . . . . . . . . . . . . . . . . . 8.6 Converse Law of Large Numbers . . . . . . . . . . . . . . . . . . 8.7 Almost Equivalence of Pairwise and Mutual Independence 8.8 Duality of Independence and Exchangeability. . . . . . . . . . 8.9 Grand Unification of Multiplicative Properties . . . . . . . . . 8.10 Discrete Interpretations . . . . . . . . . . . . . . . . . . . . . . . . . 8.11 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . .
. . . . . . . . . . .
. . . .
. . . . . . . . . . .
. . . . . . . . . . . .
. . . . . . . . . . . .
xiv
Contents
Part V 9
Economics and Nonstandard Analysis
Nonstandard Analysis in Mathematical Economics . . . . . . . . . Yeneng Sun 9.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.2 Distribution and Integration of Correspondences . . . . . . . 9.2.1 Distribution of Correspondences . . . . . . . . . . . . . 9.2.2 Integration of Correspondences . . . . . . . . . . . . . 9.3 Nash Equilibria in Games with Many Players. . . . . . . . . . 9.3.1 General Existence of Nash Equilibria in the Loeb Setting . . . . . . . . . . . . . . . . . . . . . . 9.3.2 Nonexistence of Nash Equilibria in the Lebesgue Setting . . . . . . . . . . . . . . . . . . . 9.4 Nash Equilibria in Finite Games with Incomplete Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.4.1 Nonexistence of Nash Equilibria for Games with Information . . . . . . . . . . . . . . . . . . . . . . . . 9.4.2 Approximate Nash Equilibria for Large Finite Games and Idealizations . . . . . . . . . . . . . . . . . . 9.4.3 General Existence of Nash Equilibria for Games with Information . . . . . . . . . . . . . . . . . . . . . . . . 9.5 Exact Law of Large Numbers and Independent Set-Valued Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9.6 Competitive Equilibria in Random Economies . . . . . . . . . 9.7 General Risk Analysis and Asset Pricing . . . . . . . . . . . . . 9.7.1 General Risk Analysis for Large Markets. . . . . . . 9.7.2 The Equivalence of Exact No Arbitrage and APT Pricing. . . . . . . . . . . . . . . . . . . . . . . . 9.8 Independent Universal Random Matching . . . . . . . . . . . . 9.9 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Part VI
...
349
. . . . .
. . . . .
349 356 356 361 363
...
364
...
365
...
368
...
368
...
370
...
373
. . . .
. . . .
. . . .
375 380 383 383
. . . .
. . . .
. . . .
388 389 392 396
.......
403
. . . . . . .
403 405 407 411 417 419 432
. . . . .
Combinatorial Number Theory
10 Density Problems and Freiman’s Inverse Problems . . . . Renling Jin 10.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.2 Applications to Density Problems . . . . . . . . . . . . . . 10.2.1 Sumset Phenomenon . . . . . . . . . . . . . . . . . 10.2.2 Plünnecke Type of Inequalities for Densities 10.3 Applications to Freiman’s Inverse Problems . . . . . . . 10.3.1 Freiman’s Inverse Problem for Cuts . . . . . . 10.3.2 Freiman’s 3jAj 3 þ b Conjecture . . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
Contents
xv
10.3.3
Freiman’s Inverse Problem for Upper Asymptotic Density. . . . . . . . . . . . . . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 Hypernatural Numbers as Ultrafilters . . . . . . . . . . . . . . Mauro Di Nasso 11.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.2 The u-equivalence. . . . . . . . . . . . . . . . . . . . . . . . . 11.3 Hausdorff S-topologies and Hausdorff Ultrafilters . . . 11.4 Regular and Good Ultrafilters. . . . . . . . . . . . . . . . . 11.5 Ultrafilters Generated by Pairs . . . . . . . . . . . . . . . . 11.6 Hyper-Shifts. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.7 Nonstandard Characterizations in the Space ðbN; Þ . 11.8 Idempotent Ultrafilters . . . . . . . . . . . . . . . . . . . . . . 11.9 Final Remarks and Open Questions. . . . . . . . . . . . . References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
439 440
.......
443
. . . . . . . . . .
. . . . . . . . . .
443 445 450 454 458 462 466 468 471 473
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
475
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
Part I
An Introduction to Nonstandard Analysis
Chapter 1
Simple Nonstandard Analysis and Applications Peter A. Loeb
1.1 Introduction The notion of an infinitesimal number has been used in mathematical arguments since before the time of Archimedes, some 2200 years ago. We understand infinitesimals in terms of a scale set by ordinary numbers. For a positive number to be infinitesimal, it must be greater than 0 and yet smaller than any positive number you might write using a decimal expansion. Infinitesimals played a fundamental role in the development of the calculus, starting in the late 1600s with the work of Newton and Leibniz. They, in particular Leibniz, used infinitesimal numbers to define the derivative and the integral. Even today, the modern definitions of limits, derivatives and integrals can be simplified with the use of infinitesimal numbers. Consider, for example, calculating the total force of water on a dam. If we use infinitesimals, we can calculate the total force by cutting the dam up into horizontal strips of infinitesimal width. In each strip, the pressure changes by only an infinitesimal amount. By taking the pressure at any point in the strip and multiplying by the area of a rectangle that approximates the strip, we will get the actual force on the strip except for an infinitesimal error. The sum of these errors over all of the strips will still be infinitesimal. Therefore, the total force on the dam is the nearest ordinary number to the sum of the approximations we obtain for each strip. Here we come to a question we will answer later: What do we mean by the sum over all of the strips? It is helpful to think in terms of infinitesimals in branches of mathematics beyond calculus. For example, Brownian motion is the random motion of microscopic particles suspended in a liquid or gas. Under a microscope you can clearly see this zig-zag random motion caused by the collision of the particles with molecules in the suspending medium. An important part of mathematical probability is the construction P.A. Loeb (B) Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana, IL 61801, USA e-mail:
[email protected] © Springer Science+Business Media Dordrecht 2015 P.A. Loeb and M.P.H. Wolff (eds.), Nonstandard Analysis for the Working Mathematician, DOI 10.1007/978-94-017-7327-0_1
3
4
P.A. Loeb
of mathematical models for this motion. A very convenient model has each particle performing a random walk with steps of infinitesimal length. That is, one divides time into infinitesimal intervals, and in each interval, the particle moves in a straight line over an infinitesimal distance. At the end of each time interval, the particle chooses at random a new direction for its motion. Many probabilists do not know how to make a mathematically correct version of this construction. Nevertheless, they still think of Brownian motion in these terms. For them, it is a useful fiction, but in this book, we will see how to turn that fiction into rigorous mathematics. Infinitesimals have always been regarded as a useful fiction that facilitates mathematical computation and invention. This fiction has always had its critics. Nevertheless, infinitesimals were used during the 18th and 19th centuries to flesh out what we now call “the Calculus”. Then, in the late 19th century, this theoretical foundation, which seemed unlikely ever to be made clear, was replaced with what is now called the ε-δ method. In the middle of the last century, mathematicians began removing infinitesimals from all mathematics courses. Thus infinitesimals gradually faded from use, persisting only as an intuitive aid to conceptualization by physicists and engineers, and even mathematicians when setting up multiple integrals. In 1960, the mathematical logician Abraham Robinson gave a clear, mathematically correct foundation for the use of infinitesimals in all branches of mathematics. (See [6].) Robinson’s foundation started with a mathematical object such as the real number system or the real number system together with another object such as a topological space or a Hilbert space. For now, we don’t have to worry about what the second object might be. As befit a logician, Robinson set up a formal language to express facts about the mathematical system with which he was working. That system formed what Robinson called a standard model for the theorems expressed in his formal language. One thinks of the standard model as a world that exists in some Platonic sense. The theorems in the language are correct statements about this world. What Robinson showed was that there is another mathematical object, called a nonstandard model, in which there exist positive infinitesimal numbers, and yet all of the theorems in the language are correct statements about this model as well. Informally, what we have are two worlds, the standard and the nonstandard, and the theorems about the first are also correct statements about the second. One uses the nonstandard model to analyze the standard model, and for this reason, Robinson called his method and results “nonstandard analysis.” One way to explain Robinson’s existence result is to invoke a theorem of Gödel. Take a name not used for anything in the standard number system—for example, Bach. To the theorems about the standard number system we add new statements: “Bach is bigger than 1”, “Bach is bigger than 2”, etc. We add one such statement for each natural number. The standard number system is not a model for the collection of theorems augmented by these statements about Bach. It is, however, a model for any finite subset of the augmented collection. To see this, all one has to do is look for the biggest number mentioned in a given finite set of statements and let Bach be the name of a number that is even bigger. Since every finite subset of our augmented collection of statements has a model, namely the ordinary numbers, it follows from a result of Gödel that the entire augmented collection of statements has a model. That
1 Simple Nonstandard Analysis and Applications
5
is, there is a number system extending the standard one in which Bach is the name of an infinite positive number. Bach’s reciprocal, i.e., 1 divided by Bach, is then an infinitesimal number. Another approach to understanding Robinson’s result is to construct a simple number system with infinitesimals using sequences of real numbers. A sequence of positive real numbers tending to zero, such as the sequence 1, 1/2, 1/3, 1/4, . . . , becomes a positive infinitesimal. A sequence of real numbers increasing to infinity, such as the sequence 1, 2, 3, . . . , becomes an infinite nonstandard number. We will say more about this in the next section. For applications, it is usually simpler just to work with the properties of a nonstandard number system, keeping in mind that any theorem for the ordinary numbers is also a theorem, when properly interpreted, for the enlarged number system. What does it mean to say “when properly interpreted”? Briefly, we can’t formally specify what we mean when we say “all” subsets of a given set. Even for the set of natural numbers, the idea of all subsets cannot be formalized. This inability to formalize the notion of “all subsets” means that when interpreting theorems in the nonstandard model, we can cheat. We don’t interpret the word “all” to really mean “all”. We work instead with what are called internal sets, and interpret “all sets” to mean all internal sets. We will postpone the problem of what is meant by “all” and the explanation in terms of internal sets until the next chapter of this book. We will first consider in this chapter a simplified formulation of nonstandard analysis. Experience shows that a simplified formulation is often a necessary beginning for non-logicians who wish to apply this powerful mathematical tool. Our formulation is based on a modification of H.J. Keisler’s 1976 calculus book [3], which uses infinitesimals. Keisler’s approach is based on Robinson’s foundations, and our version of that approach first appeared in the book [2] coauthored with A.E. Hurd. In Keisler’s calculus book, the nonstandard real numbers are an extension, with infinitesimals, of the usual number system. Every function defined for the standard real numbers also works for the enlarged set of numbers. If two finite systems of equalities and inequalities have the same solutions for the real number system, then they have the same solutions for the enlarged number system. These rules, which suffice for the calculus and basic real analysis, will be modified to form the simple introduction to nonstandard analysis presented in this chapter. Of fundamental importance for many of the applications in this chapter and applications later in this book is a generalization of the notion of a finite set. In the standard world, a set is finite if it can be enumerated with natural numbers, finishing with a largest natural number. Once we have extended the real numbers, we will have also extended the set of natural numbers, thus obtaining nonstandard natural numbers that are bigger than any ordinary natural number. Such numbers are called infinite or “unlimited” natural numbers. The number “Bach” mentioned earlier is an example. If a set can be formally enumerated with the standard and nonstandard natural numbers up to an unlimited natural number, then the set is called a hyperfinite set. Hyperfinite sets are infinite sets, but they have all of the formal properties of a finite sets. In particular, since we can sum any finite set of real numbers, the summing
6
P.A. Loeb
function in the nonstandard model also gives an answer for any hyperfinite set. Thus we have a meaning for a sum of infinitesimal numbers used in integration theory. Before we continue with our simple framework for real analysis, here is a brief description of some of the applications of nonstandard analysis that will be considered later in this book. Hyperfinite sets play a central role in such applications to many areas of mathematics beyond the calculus. In probability, for example, it is easy to analyze a finite coin toss; it is much harder to analyze an infinite coin toss. On the other hand, in a nonstandard real number system, where there are unlimited natural numbers, we can choose such a number, again call it Bach, and, at least in our imagination, we can perform a hyperfinite coin toss. That is, we can toss the coin Bach times. Now any particular outcome has probability equal to one divided by two raised to the power Bach. Moreover, this hyperfinite coin tossing space contains all standard infinite coin tosses. The problem is, to make contact with the rest of mathematics, one needs to superimpose on the set of hyperfinite coin tosses a standard probability space structure using standard numbers. In 1975 [4], the author showed how this could be done and developed a measure theory for hyperfinite probability spaces. In 1976 in [1], Robert Anderson used this measure theory for coin tossing spaces to construct a model for Brownian motion and the Itô stochastic integral. In Anderson’s model, the underlying set of elementary outcomes for Brownian motion is a set of random walks with infinitesimal steps. One divides time up into infinitesimal intervals, and at the beginning of each interval tosses a coin. If the toss is a head, one moves to the right; if the toss is a tail, one moves to the left. The step size is the square root of the time change. This is how to make rigorous the probabilist’s intuitive model for Brownian motion. In the last 40 years, the theory of hyperfinite measure spaces has been used to obtain new mathematical results in probability theory and many other areas of mathematics including potential theory, number theory, mathematical physics, and mathematical economics and finance. In mathematical economics, which will be discussed by Yeneng Sun later in this book, a central problem is to study equilibria in economies with a very large number of individuals when each individual has only a negligible influence on the economy. For this, it is quite natural to consider an economy with a hyperfinite number of individuals, each individual having only an infinitesimal influence on the economy. In particular, hyperfinite measure theory and its extension to more general nonstandard measure spaces has been used by Yeneng Sun to finally make rigorous the treatment of a continuum of independent random variables and traders in an economy. The aim of this book is to make Robinson’s discovery and some of the subsequent research available to the working mathematician. As noted, the reader who begins with this chapter of the book should easily pick up what is needed to go on. To accommodate readers with little or no background in mathematical logic, we have begun, as in the first chapter of [2], with a simple construction of a nonstandard number system associated with a very simple system of logic. The simplicity of the system of logic helps to illuminate the way logic is used to obtain mathematical results. It also simplifies the proof of the “transfer principle”, which is the basic property of
1 Simple Nonstandard Analysis and Applications
7
nonstandard number systems. The skills the reader needs for more advanced work are developed through applications of this simple system to calculus and elementary real analysis. In the next chapter of this book, we develop the full theoretical background needed to discuss modern developments and applications.
1.2 A Simple Construction of a Nonstandard Number System First, we extend the real numbers R with an ordered field ∗ R containing infinitesimals. We denote the natural numbers by N and the set of all subsets of N by P(N). We will construct ∗ R from sequences of real numbers. It is well known that sequences of real numbers with pointwise operations do not form a field. For example, let E be the set of even natural numbers, and let O be the set of odd natural numbers. The product of characteristic functions χ E · χ O is identically 0, and should represent 0. To have a field, therefore, one of the sequences χ E or χ O must also represent 0; we may decide which it should be. We will make this decision and all other such decisions in one step using a “free ultrafilter”. Definition 1.2.1 A free ultrafilter in N is a collection U ⊂ P(N) such that (1) (2) (3) (4)
∅∈ / U, A ∈ U & B ∈ U => A ∩ B ∈ U, A⊂N& A∈ / U => N \ A ∈ U, A a finite subset of N => N \ A ∈ U.
Properties 1, 2, and 3 make U an ultrafilter. They imply that any set containing a set in U is also in U. If we replace Property 3 with this weaker property, then, given Property 4, we have just a free filter in N. Ultrafilters are either free or fixed. There is a fixed ultrafilter for each n ∈ N; it is the collection {A ⊂ N : n ∈ A}. A free ultrafilter, on the other hand, contains the filter consisting of all complements of finite subsets of N. An easy application of Zorn’s Lemma shows that such an ultrafilter exists. The fixed ultrafilter consisting of all sets containing the singleton {n} corresponds to unit mass at n. Free ultrafilters on N correspond to 0-1 valued finitely additive measures on P(N). Problem: Show that for any finite partition A1 , . . . , An of N and any ultrafilter U in N, one and only one of the sets Ai is in the ultrafilter U. Answer: Note that if V ∈ U and V = A ∪ B with A ∩ B = ∅, then either A ∈ U or B = V ∩ (N \ A) ∈ U but not both since ∅ ∈ / U. Now, for the Ai s, not more than / U. Either A1 or ∪i>1 Ai is in U. If the latter, one of the Ai s can be in U since ∅ ∈ / U for i < n, then either A2 is in U or ∪i>2 Ai ∈ U. Continuing, we see that if Ai ∈ then An ∈ U.
8
P.A. Loeb
Definition 1.2.2 Given an ultrafilter U, we say a property holds a.e. if it holds on some set U ∈ U. We set a sequence ri ≡ si when ri = si a.e. That is, when {i ∈ N : ri = si } is in U. It is clear that the relation ≡ is an equivalence relation. In particular, if ri ≡ si
and si ≡ ti , then ri ≡ ti , since {i ∈ N : ri = ti } ⊇ {i ∈ N : ri = si } ∩ {i ∈ N : si = ti }. Definition 1.2.3 We will write [< ri >] for the equivalence class containing the sequence ri , and we will use ∗ R to denote the collection of equivalence classes. The set ∗ R is called the set of nonstandard real numbers or hyperreal numbers. Its formation using an ultrafilter is called an ultrapower construction. Returning to the example given at the beginning of this section, we now have either χ E ≡ 0 or χ O ≡ 0. Thus, there is no longer the problem with 0 divisors. We next define the operations + and · together with an order relation < for ∗ R. Definition 1.2.4 Given real sequences < ri > and < si >, we set [< ri >] + [< si >] = [< ri + si >], [< ri >] · [< si >] = [< ri · si >], |[< ri >]| = [< |ri | >] [< ri >] < [< si >] if ri < si a.e. Proposition 1.2.5 The operations + and ·, the mapping |·|, and the ordering < are independent of the choice of representing sequences. Proof The proof is left to the reader. Note that the set of real numbers R (these are also called the standard numbers) is imbedded in the set of nonstandard real numbers ∗ R via map c → [< c >]. For example, 5 is mapped to the equivalence class [< 5 >] containing the constant sequence < 5 >. We write ∗ c for [< c >], but we will later drop the star. We will call ∗ c the extension of c. Similarly, we have an extension for every n-tuple of real numbers c1 , . . . , cn given by ∗ c1 , . . . , ∗ cn . Proposition 1.2.6 The structure (∗ R, +, ·, <) is an ordered field extension of the ordered field (R, +, ·, <). Proof To show, for example, that the trichotomy law holds, we consider r = [< ri >] and s = [< si >]: One of the sets {i ∈ N : ri < si }, {i ∈ N : ri = si }, {i ∈ N : ri > si } is in U. The rest is left to the reader.
1 Simple Nonstandard Analysis and Applications
9
Problem: Show that if r = [ ri ], then |r | = [ |ri | ] is the absolute value of r in the usual sense. Answer: If r ≥ 0, then ri ≥ 0 a.e., so |r | = r = [ ri ] = [ |ri | ]. If r ≤ 0, then ri ≤ 0 a.e., so |r | = −r = [ −ri ] = [ |ri | ]. Problem: Show that if r = [< ri >], s = [< si >], and r < s, then there is a t ∈ ∗ R with r < t < s. Answer: Since ri < si a.e., ri < (ri + si )/2 < si a.e. An element t ∈ ∗ R which works is t = [< (ri + si )/2 >]. Problem: Show that there are infinitely many elements in ∗ R greater than the number ω := [< 1, 2, . . . , n, . . . >]. Answer: For each m ∈ N, mω = [< m, 2m, . . . , mn, . . . >] > ω. Roughly speaking, a property will hold for ∗ R if for any finite set of sequences of real numbers, it holds a.e. on N. To extend this principle to properties involving functions, we extend each real-valued function f defined on R to a function defined on ∗ R; the value of the extended function at [< ri >] is [< f (ri ) >]. Definition 1.2.7 For any r ∈ ∗ R, (1) r is infinite or unlimited (positive or negative) if |r | > n for every standard n ∈ N. (2) r if finite or limited if |r | < n for some standard n ∈ N; (3) r is infinitesimal if |r | < 1/n for every standard n ∈ N. Note that 0 is the only standard infinitesimal. The equivalence class [< 1/i >] is infinitesimal and [< i >] is a positive, unlimited number in ∗ R. We have already extended the functions +, · , | · | and the relation <. These are examples of the ∗-transform of n-ary relations. To say more, we need the following definitions. Definition 1.2.8 An n-ary relation P on a setS is a subset of S n = S × S × · · · × S. 1 n We write a , . . . , a ∈ P or P a 1 , . . . , a n if the n-tuple a 1 , . . . , a n satisfies the relation P. The complement in S of an n-ary relation P is the n -ary relation P = S n \ P. A 1-ary relation in S is just a subset of S. Example 1.2.9 For the 2-ary relation ≤, we may write 5, 7 ∈ ≤ or ≤ 5, 7 , but we usually just write 5 ≤ 7. Instead of writing 5 ∈ N, we may also write N < 5 >. Definition 1.2.10 A function is an n + 1-ary relation such that f of n variables if a 1 , . . . , a n , b ∈ f and a 1 , . . . , a n , c ∈ f , then b = c. We will usually write b = f (a 1 , . . . , a n ) instead of a 1 , . . . , a n , b ∈ f . The domain of f is the set of all 1 a , . . . , a n for which ∃b with a 1 , . . . , a n , b ∈ f . The range of f is the set of all 1 b such that ∃ a , . . . , a n with a 1 , . . . , a n , b ∈ f . Example 1.2.11 The operations + and · are functions of 2 variables. However, we usually write 5 + 7 = 12 instead of 5, 7, 12 ∈ + or +(5, 7) = 12. When using a formal language however, as in the next section, one should remember that 5 + 7 = 12 is shorthand for a more formal statement.
10
P.A. Loeb
Definition 1.2.12 The ∗-transform an n-ary relation P is the relation ∗ P where ∗ of n 1 1 [< ri >], . . . , [< ri >] ∈ P if ri , . . . , rin ∈ P for almost all i. It is a good exercise to show that the ∗-transform of an n-ary relation is welldefined, that is, it is independent of the choice of representatives of the equivalence classes. Note that previous extensions of +, ·, < , | · |, all follow this general pattern. The ∗-transform of equality is true equality in ∗ R, because the elements of ∗ R are the equivalence classes. For a unary relation A, ∗ A ⊃ A in the sense that for each a ∈ A, the equivalence class [< a >] containing the constant sequence < a > is also in ∗ A. In general, we have the following fact. Proposition 1.2.13 If P is an n-ary relation, then ∗ P extends P; i.e., every n -tuple in P is in ∗ P (or rather, the extension of the n-tuple is in ∗ P.) Proof The proof is clear. Example 1.2.14 The extension of the unit interval ∗ [0, 1] contains all nonstandard reals between 0 and 1. If f is a function of n-variables, then ∗ f extends f . Moreover, if D is the domain of f , then ∗ D is the domain of ∗ f . We will also work with the characteristic functions of relations. Given an n-ary relation P, we set χ P (x1 , . . . , xn ) = 1 if x1 , . . . , xn ∈ P and χ P (x1 , . . . , xn ) = / P. An important consequence of the fact that we are working 0 if x1 , . . . , xn ∈ with a free ultrafilter, and not just a free filter, is given by the following result. Proposition 1.2.15 Given an n-ary relation P, the extension of its characteristic function, ∗ χ P , is equal to the characteristic function of ∗ P. That is, ∗ χ P = χ∗ P . This means that ∗ χ P (x1 , . . . , xn ) = 1 if x1 , . . . , xn ∈ ∗ P, and ∗ χ P (x1 , . . . , xn ) = 0 otherwise. Proof We will present the proof for a unary relation P, the general proof is similar. For any sequence ri , the sequence χ P (ri ) is defined and consists of just 0’s and 1’s. The set of natural numbers N is the union of the two disjoint sets {i ∈ N : χ P (ri ) = 1} = {i ∈ N : P ri } and
{i ∈ N : χ P (ri ) = 0} = {i ∈ N : P ri }.
Therefore, either ∗ χ P ([ ri ]) = 0 or ∗ χ P ([ ri ]) = 1 in ∗ R. Here we have used the fact that U is an ultrafilter. It follows that ∗ χ P is a characteristic function on ∗ R. We also see that ∗ χ P ([ ri ]) = 1 if and only if P ri holds a.e., and this is true if and only if ∗ P [ ri ] holds on ∗ R, so ∗ χ P = χ∗ P .
1 Simple Nonstandard Analysis and Applications
11
1.3 A Simple Language Recall that the real numbers R can be constructed as a collection of equivalence classes of Cauchy sequences of rational numbers. One soon forgets the construction, however, and works just with the properties of R. For the same reason, except for proofs of some fundamental properties of ∗ R, it is best to put aside the construction of ∗ R as a collection of equivalence classes of real-valued sequences and work not with the construction, but with the properties of ∗ R. Our simplified formulation of nonstandard analysis in this chapter treats only elements of ∗ R and the n-ary relations on ∗ R. We will distinguish those relations that are functions. In the next chapter, we will expand this simple approach to handle full mathematical structures. For this discussion, we need a formal language for R and another formal language for ∗ R. We construct both as a single language by using the symbol S to stand for either number system. The language we construct in this chapter is restricted so that beginners can concentrate on formal sentences having just two forms. This restriction simplifies the interpretation and proof of the important “transfer principle”. It also helps in learning to exploit the difference between a mathematical object, such as the number system S, and formal statements in the language about such a mathematical object. Our restricted language L is built from the following logical symbols: Connectives: ∧, → (“and”, “implies”). Quantifier: ∀ (“for all”). Parentheses: [, ], {, }, <, >. Variables: x, y, x1 , a, n, etc. We need only a countable number of these. (Only a finite number will actually appear on these pages.) Constants: For each s ∈ S we have a name s. We may have more than one name for s. We have a relation symbol P for each relation, and in particular, a function symbol f for each function. These symbols are called the names of the relations and the functions. We omit the underline for numbers and also for +, ·, <, and for some functions. Remark 1.3.1 We are making a distinction between the name of an object and the object itself. Mathematicians are used to making such distinctions, as for example, distinguishing between numbers and numerals. The number eight, for example, has the names 8, 10, and 1000 with respect to its representation in base 10, 8, and 2, respectively. The number 8 also has the name VIII using Roman numerals. There is also the distinction between a point in n-space and the coordinates of the point in terms of a chosen coordinate system. We now combine all of the logical symbols given above to form a formal language L. Definition 1.3.2 A term is a combination of symbols defined inductively as follows: (i) Each constant and each variable is a term. (ii) If f is a function symbol naming a function of n variables, and τ 1 , . . . , τ n are terms, then f (τ 1 , . . . , τ n ) is a term.
12
P.A. Loeb
A term with no variables is called a constant term. Example 1.3.3 If S denotes the sum function and P the product, we can write S(P(3, x), P(4, y)) for 3x + 4y. Definition 1.3.4 A simple sentence is a string of symbols from the language L taking one of the two following forms: (a) Atomic Sentence: P τ 1 , . . . , τ n , where P is the name of an n-ary relation and τ 1 , . . . , τ n are constant terms, i.e., terms with no variables. (We want to be able to say that an atomic sentence either holds or doesn’t hold.) (b) Compound Sentence: ⎡ (∀x1 ) · · · (∀xn ) ⎣
k
⎤ l − − → → P i τ i −→ Qj σ j ⎦.
i=1
j=1
→ This is an abbreviation for actual formal sentence. The symbol − τ i stands − the k → of terms; i=1 P i τ i stands for k relational statements confor an n i -tuple catenated with ; the only variables involved in the τ s and σ s are x1 , . . . , xn . We say the variables x1 , . . . , xn are bound by the quantifier ∀. Example 1.3.5 We would usually write the atomic sentence = +(3, 4), 7 as 3 + 4 = 7. Example 1.3.6 The Distributive Law can be written with P and S denoting the sum and product functions and R denoting the unary relation of being a real number as follows:
(∀x)(∀y)(∀z) R x ∧ R y ∧ R z → = P(x, S(y, z)), S(P(x, y), P(x, z)) . This is a formal way of writing
(∀x)(∀y)(∀z) R x ∧ R y ∧ R z → x · (y + z) = x · y + x · z .
Note that (∀x)
(∀y) R x →= x, x is a simple sentence, but the string of symbols (∀x) R x → = x, y is not a simple sentence because the variable y is not bound by a quantifier.
1.4 Interpretation of the Language L We interpret the constant terms of our language L in the number system S using the following induction scheme: (1) If a constant symbol s names an element s ∈ S, we interpret it as s. If a constant symbol s does not name an element of S, we say that s is not interpretable in S.
1 Simple Nonstandard Analysis and Applications
13
(2) If τ is the constant term f (τ 1 , . . . , τ n ), then τ is interpretable in S provided i (i) Each of the terms τ i is interpretable in S (naming s ∈ S), and (ii) The n-tuple s 1 , . . . , s n named by τ 1 , . . . , τ n is in the domain of the function f named by the function symbol f . In this case, we interpret the term τ as f (s 1 , . . . , s n ). Otherwise, we say that τ is not interpretable in S.
Example 1.4.1 In R, sin(π/2 + 2π ) is interpretable as 1, but sin(1 + tan(π/2)) is not interpretable. Here, and for the rest of this chapter, we omit the underline for constants, operations, and order relations. Recall that an atomic sentence has the form P τ 1 , . . . , τ n where P is the name of an n-ary relation and τ 1 , . . . , τ n are constant terms, i.e., terms with no variables. We say that such an atomic sentence holds in S or is valid in S if i i (1) Each of the terms in1 S (naming s ∈ S), and 1 τ isninterpretable n (2) The n-tuple s , . . . , s named by τ , . . . , τ is in the relation P named by the relation symbol P. Example 1.4.2 The atomic sentence = tan(π/2), tan(π/2) does not hold in R since tan(π/2) is not interpretable in R. The atomic sentence = +(3, 4), 7 holds in R, but = +(3, 4), 8 does not hold in R.
We say that a Compound Sentence ⎡ (∀x1 ) · · · (∀xn ) ⎣
k
⎤ l − → τ i −→ σ j ⎦, Pi → Qj −
i=1
j=1
holds in S or is valid in S if for each replacement of the variables x1 , . . . , xn with constant symbols → s 1 , . . . , s n , we have the following: If all of the resulting atomic τ i are valid in S, then with statements P i − → the same replacement of the variables, σ j are valid in S. all of the resulting atomic statements Q j − Example 1.4.3 In R, (∀x)[ln(x) = ln(x) → sqrt(x) > 0] is valid, but (∀x)[R x → ln(x) = ln(x)] is not valid. The distributive law can be expressed as follows: (∀x)(∀y)(∀z)[1 = 1 → x · (y + z) = x · y + x · z]. We will often use a double arrow ←→ to abbreviate two separate formal sentences: In the first sentence, the left side of the double implication implies the right, and in the second sentence, the right side implies the left. Similarly, we will write a compound sentence such as ⎡ (∀x1 ) · · · (∀xn ) ⎣
l j=1
⎤ − σ j⎦ Qj →
14
P.A. Loeb
to stand for a compound sentence such as ⎡ (∀x1 ) · · · (∀xn ) ⎣5 = 5 −→
l
⎤ − σ j ⎦, Qj →
j=1
where the left side of the implication is always true. Such a sentence holds or is valid in S if for each replacement of the variables x1 , . . . , xn with constant symbols → σ i are valid in S. s 1 , . . . , s n , all of the resulting atomic statements Q i − We have no formal “not” inour simple language. If τ 1 , . . . , τ n are interpretable in S, then instead of saying P τ 1 , . . . , τ n is not true, we can use the complement P , and say that P τ 1 , . . . , τ n is true. The reader should note, however, that if a 1 term in an atomic sentence P τ , . . . , τ n is not interpretable, then neither the atomic 1 sentence P τ , . . . , τ n nor the atomic sentence P τ 1 , . . . , τ n is true in S. The conjunction “or” is also handled with some difficulty. For example, the Trichotomy Law is handled as follows: (∀x)[R x ∧ x < 0 ∧ x = 0 → x > 0]. We do not have the existential quantifier ∃ in our simple language. This can be worked around using the model itself. If there is always a unique object that exists, then one can use the name of the object. For example, instead of writing (∀x)(∃y)[y + x = 0], we can write (∀x)[−x + x = 0]. Even when there is no unique object that exists, there is always a choice function ψ in the model that picks one of the objects that exists. For example, given any real number, there is always a larger number. If ψ picks one of those larger numbers, then the following sentence holds: (∀x)[R x → ψ(x) > x]. Such a function ψ is called a Skolem function. It picks one of the things that exists whether that thing is unique or not. If φ is the Skolem function that picks the unique multiplicative inverse, then the following sentence holds in R: (∀x)[R x ∧ x = 0 → x · φ(x) = 1]. Informally, one can write (∀x)[R x ∧ x = 0 → ∃(y)[x · y = 1]]. The reader should realize, however, that this is only an abbreviation for the appropriate sentence in our formal language using a Skolem function to pick an element that works to make the statement valid. Example 1.4.4 Let B be the range of a function f of n variables. The fact that B is the range of f is stated by the following two simple sentences taken together:
(∀x1 )(∀x2 ) · · · (∀xn )[ f (x1 , . . . , xn ) = f (x1 , . . . , xn ) → B f (x1 , . . . , xn ) ], (∀y)[B y → f (ψ 1 (y), . . . , ψ n (y)) = y]. In the first sentence, f (x1 , . . . , xn ) = f (x1 , . . . , xn ) is valid if and only if for all choices of values for x1 , . . . , xn , f (x1 , . . . , xn ) is defined. In the second of these sentences, each of the functions ψi picks a particular value of xi that works. Informally, we can write this second sentence as
1 Simple Nonstandard Analysis and Applications
15
(∀y) B y → (∃x1 ) · · · (∃xn ) f (x1 , . . . , xn ) = y . Problem: Write a simple sentence stating that a given nonempty set A ⊆ N has a first element. Answer: Let m be the name of the first element of A. Here, we are using our knowledge about the actual set being described by our formal language. That is, we know all about A, and we know the name of the first element m. A sentence that works is (∀x)[A x → A m ∧ m ≤ x]. We cannot abbreviate with an existential quantifier here, because that would mean there is a Skolem function acting on sets of numbers that produces the number that exists. In this chapter, we are not considering functions acting on sets. Problem: Characterize the fact that A is the domain of a real-valued function f of n variables. Answer:
(∀x1 ) · · · (∀xn ) A x1 , . . . , xn ←→ R f (x1 , . . . , xn ) . Problem: Express with a sentence of L the continuity of a real-valued function f with domain A ⊆ R at a ∈ A. Answer: For this, we must use a positive function δ of one variable. That variable is restricted to the positive real numbers. We assume we know all about this Skolem function δ that works for f and a; in particular, we know its domain. The sentence we want is (∀x)(∀ε) A x ∧ |x − a| < δ(ε) → | f (x) − f (a)| < ε . Again, informally, we can abbreviate the above sentence with the sentence (∀x)(∀ε > 0)(∃δ > 0) A x ∧ |x − a| < δ → | f (x) − f (a)| < ε .
1.5 Transfer Principle for ∗ R We can form two languages L R and L ∗ R from the language L by letting S be R and ∗ R, respectively. We next show how to transform each simple sentence in L into a R simple sentence in L ∗ R . Here are the rules.
16
P.A. Loeb
CONVENTIONS: (1) The name c of c ∈ R also names ∗ c; we identify c and ∗ c. (2) If P names the relation P, ∗ P names ∗ P. In particular, if f names a function f , ∗ f names ∗ f . We leave off ∗ for some relations and functions such as <, +, and ·. THE ∗-TRANSFORM OF TERMS: (1) The transform of a constant or variable is that constant or variable. (2) The ∗-transform of a term f (τ 1 , . . . , τ n ) is ∗ f (∗ τ 1 , . . . ,∗ τ n ). THE ∗-TRANSFORM OF SIMPLE SENTENCES: (1) The ∗-transform of P τ 1 , . . . , τ n is ∗ P ∗ τ 1 , . . . ,∗ τ n . (2) The ∗-transform of ⎡ (∀x1 ) · · · (∀xn ) ⎣
k
i=1
is
⎡ (∀x1 ) · · · (∀xn ) ⎣
k
⎤ l − → τ i −→ σ j⎦ Pi → Qj − j=1
⎤ l → → ∗ ∗ τ i −→ σ j ⎦. P i ∗− Q j ∗−
i=1
j=1
Example 1.5.1 The ∗-transform of sin(x + ln(2 · y)) is ∗ sin(x + ∗ ln(2 · y)); note we do not write ∗ + or ∗ ·. Because we have used restricted languages, we now have an easy proof of the following fundamental result about the nonstandard number system ∗ R constructed from real sequences using a given free ultrafilter U on N. Theorem 1.5.2 (Transfer Principle) The ∗-transform of a simple sentence that is true for R is true for ∗ R. We will say a property is true by transfer if its validity for ∗ R follows from the transfer principle. Remark 1.5.3 It is easy to discuss the validity of the transform of an atomic sentence, since there are no variables, only constants. In determining whether a sentence of the form ⎤ ⎡ k l − − → → (∀x1 ) · · · (∀xn ) ⎣ P i τ i −→ Qj σ j ⎦ i=1
j=1
is valid when transferred, one should keep in mind the following principles: The transform of a constant or variable is that constant or that variable. The constants in the original sentence will all be names of elements of R. First one transforms the
1 Simple Nonstandard Analysis and Applications
17
sentence, and then one replaces the variables with names. Those names are names of elements of ∗ R. That is, names of elements of ∗ R replace the variables in the transformed sentence. Example 1.5.4 The atomic sentence ≥ sin(π ), cos(π ) (written without underlines) is transformed to the atomic sentence ∗ ≥ ∗ sin(π ), ∗ cos(π ) . The transformed sentence holds in ∗ R because the original sentence says that 0 ≥ −1, and since the relation ∗ ≥ and functions ∗ sin and ∗ cos retain their values on elements of R, the transformed sentence says the same thing. Example 1.5.5 Omitting underlines, the compound sentence ≥ π, x −→ ≥ sin(x), 0
(∀x) ≥ x, 0
is transformed to the sentence ∗ ≥ π, x −→ (∀x) ∗ ≥ x, 0
∗
≥
∗
sin(x), 0 .
Suppose we fix an element [ ri ] ∈ ∗ R for which the left side of the implication in the transformed sentence is valid. (This means that when we replace x with the name of [ ri ], the left side holds in ∗ R.) There is an element U in the ultrafilter such that for all i ∈ U , 0 ≤ ri ≤ π , whence, sin(ri ) ≥ 0. Therefore, ∗ sin ([ ri ]) = [ sin(ri ) ] ∗ ≥ 0. It follows that the transformed sentence holds in ∗ R. Proof of the Transfer Principle: Assume is the atomic sentence P τ 1 , . . . , τ n , and holds for R. Then contains only constants naming elements of R. Since the ∗-transforms of functions are extensions of the original functions, all of the terms in ∗ R and τ 1 , . . . , τ n are interpretable have the same interpretation as in R. Since ∗ P extends P, we have τ 1 , . . . , τ n ∈ ∗ P, so ∗ holds for ∗ R. Now assume that is the compound sentence ⎡ (∀x1 ) · · · (∀xn ) ⎣
k
⎤ l − → τ i −→ σ j ⎦. Pi → Qj −
i=1
j=1
Choose n names ρ 1 , . . . , ρ n of elements of ∗R that replace x1 , .. . , xn to make k ∗ → n 1 ∗− ∗ the transformed left-hand side i=1 P i τ i hold in R. Let ri , . . . , ri be n j
sequences of real numbers such that ri is in the equivalence class named by ρ j , 1 ≤ j ≤ n. There is a set U in the free ultrafilter U, such that for all i ∈ U , replacing the variables x1 , . . . , xn with the names ri1 , . . . , rin makes the left-hand → k side i=1 τ i hold in R. Since holds in R, that same replacement makes the Pi − → right-hand side lj=1 Q j − σ j hold in R. Since this is true for each i ∈ U , the right-
hand side holds in ∗ R when the variables x1 , . . . , xn are replaced by ρ 1 , . . . , ρ n . Therefore, ∗ holds for ∗ R.
18
P.A. Loeb
Note that this transfer principle for the restricted languages would be valid if we worked just with the Fréchet filter on N, i.e., the filter of cofinite subset of N. A property that does not follow from this transfer principle is the property that for a relation P and its complement P , (∗ P) = ∗ (P ). For example, we do not know directly from the transfer principle that ∗ = is =. We now give a direct proof of this property using the fact we have already established in Proposition 1.2.15 that for a given n-ary relation P, ∗ χ P = χ∗ P . Recall that the proof of Proposition 1.2.15 used the fact that if a subset A of N is not in the ultrafilter U, then N \ A is in U. Proposition 1.5.6 Let P be an n-ary relation on R. Then (∗ P) = ∗ (P ). Proof For the proof, we transfer the following sentences and keep in mind that ∗ χ P is defined and takes either the value 0 or the value 1 for all inputs. (i) (∀x1 ) · · · (∀xn )[P x1 , . . . , xn ←→ χ P (x1 , . . . , xn ) = 1], (ii) (∀x1 ) · · · (∀xn )[P x1 , . . . , xn ←→ χ P (x1 , . . . , xn ) = 0]. It follows that for any a1 , . . . , an in ∗ R, ∗ P a1 , . . . , an holds if and only if ∗ P a , . . . , a does not P (a1 , . . . , an ) = 1, and this is true if and only if 1 n ∗ hold in R.
∗χ
1.6 The Nonstandard Real Numbers Having established the Transfer Principle, we now begin to use more informal language as an abbreviation of the formal language. We will, for example, drop the underlines from names. The reader should continue to keep in mind the difference between the name of an object and the object itself. We will continue to write R x
and N x to indicate that we are working with sets such as R and N as unary relations. Here is one of the fundamental facts about the nonstandard reals. Theorem 1.6.1 The number system (∗ R, +, ·, <) is an ordered field extension of (R, +, ·, <). Proof Since (R, +, ·, <) forms an ordered field, the result follows by transfer of the appropriate simple sentences. We sketch just some of that proof: Since (∀x)(∀y)[R x ∧ R y → x + y = y + x], we have (∀x)(∀y)[∗ R x ∧ ∗ R y → x + y = y + x]. That is, + is commutative in ∗ R. To establish the existence of a multiplicative inverse, we use the (Skolem) function ψ defined on the nonzero real numbers with ψ(x) = 1/x for each x. Then (∀x)[x = 0 → x · ψ(x) = 1] holds in R. It follows by transfer that, (∀x)[x = 0 → x · ∗ ψ(x) = 1] holds in ∗ R. The extension ∗ ψ of the function ψ continues to give the multiplicative inverse in ∗ R. These sentences using ψ can be abbreviated with the sentence (∀x = 0)(∃y)[x · y = 1]. For the order relation ≤, we have the trichotomy law by transferring the sentence (∀x)[x < 0 ∧ x = 0 → x > 0]. That is, the transfer is the trichotomy law for ∗ R.
1 Simple Nonstandard Analysis and Applications
19
Proposition 1.6.2 If f is a function of n variables on R, then ∗ f is a function of n variables on ∗ R; it is an extension of f with ∗ (dom f ) = dom(∗ f ) and ∗ (range f ) = range(∗ f ). Proof The fact that ∗ f is a function follows either from our convention or transfer of the sentence (∀x1 ) · · · (∀xn )(∀y)(∀z)[ f x1 , . . . , xn , y ∧ f x1 , . . . , xn , z → y = z]. The fact that ∗ (dom f ) = dom(∗ f ) follows by transferring of the sentence (∀x1 ) · · · (∀xn )[dom f x1 , . . . , xn ←→ R f (x1 , . . . , xn ) ]. If B is the range of f , then range(∗ f ) is ∗ B ; this follows by transferring of the sentences (∀x1 )(∀x2 ) · · · (∀xn )[ f (x1 , . . . , xn ) = f (x1 , . . . , xn ) → B f (x1 , . . . , xn ) ], and (∀y)[B y → f (ψ1 (y), . . . , ψn (y)) = y], where the ψi are appropriate Skolem functions. This last sentence can be abbreviated with the sentence (∀y ∈ B)(∃x1 ) · · · (∃xn )[ f (x1 , . . . , xn ) = y]. Proposition 1.6.3 For sets in Rn , (i) ∗ ∅ = ∅. (ii) ∗ (A ∪ B) = ∗ A ∪ ∗ B, ∗ (A ∩ B) = ∗ A ∩ ∗ B, (∗ A) = ∗ (A ). (iii) For Ai , i ∈ I , a family of subsets of Rn , ∪i∈I ∗ Ai ⊆ ∗ (∪i∈I Ai ), and ∩i∈I
∗
Ai ⊇ ∗ (∩i∈I Ai ).
Proof (i) Since χ∅ is identically 0, so is ∗ χ∅ = χ∗∅ . (ii) This can be proved using characteristic functions. For example, χ(A∩B) = χ A · χ B , χ(A∪B) = χ A + χ B − χ A · χ B , χ A = 1 − χ A . Here, we are using the fact that the transform of a characteristic function is a characteristic function. For ∩, one can also transfer the following sentence: (∀x1 ) · · · (∀xn ) [A x1 , . . . , xn ∧ B x1 , . . . , xn ←→ A ∩ B x1 , . . . , xn ] .
20
P.A. Loeb
To show ∗ (A ∪ B) = ∗ A ∪ ∗ B for the case n = 1, transfer the following sentence; the proof for n > 1 is similar: (∀x)[A x → A ∪ B x ], (∀x)[B x → A ∪ B x ], (∀x)[A ∪ B x ∧ A x → B x ]. (iiia) For the case n = 1, given j ∈ I , (∀x)[x ∈ A j → x ∈ ∪i∈I Ai ], so this follows by transfer. What we have written is shorthand for (∀x)[A j x → ∪i∈I Ai x ]. The proof for n > 1 is similar. (iiib) For the case n = 1, we have for each j in I , the sentence (∀x)[∩i∈I Ai x → A j x ], which we transfer. The proof for n > 1 is similar. Recall that for a given ρ ∈ ∗ R, we say that ρ is unlimited or infinite if |ρ| > n for all standard n ∈ N, ρ is limited or finite if |ρ| < n for some standard n ∈ N, and ρ is infinitesimal if |ρ| < 1/n for all standard n ∈ N. The number 0 is the only real infinitesimal. ∗ ∗ Example 1.6.4 Note that ∞ n=1 [−n, n] is the set of finite or limited numbers in R, N n∈ ∞ ∗ −1 , 1 is the set of all while ∗ [−n, n] = ∗ R. On the other hand, ∞ n=1 n=1 n n n∈N n∈N ∞ −1 1 ∗ ∗ infinitesimal numbers in R, while = ∗ {0} = {0}. n=1 n ,n n∈N
Proposition 1.6.5 Let B denote a subset of Rn . Then ∗ B ∩ Rn = B. Proof We give the proof for n = 1. If r is a real number not in B, then the atomic sentence r ∈ / B holds for B and thus for the extension of B. Definition 1.6.6 An n-tuple a1 , . . . , an is standard if each ai ∈ R. Proposition 1.6.7 A number ρ ∈ ∗ R is positive and unlimited if and only if 1/ρ is strictly positive and infinitesimal; ρ ∈ ∗ R is negative and unlimited if and only if 1/ρ is strictly negative and infinitesimal. Proof The preservation of positivity (negativity) under x → 1/x follows by transfer. Moreover, the fact that for all standard natural numbers n, |x| > n iff |1/x| < 1/n follows by transfer of the sentence (∀x)(∀m)[N m ∧ |x| > m ←→ N m ∧ |1/x| < 1/m]. Theorem 1.6.8 The following properties hold for ∗ R: (i) Finite sums, differences, products of limited numbers are limited. (ii) Finite sums, differences, products of infinitesimal numbers are infinitesimal. (iii) The infinitesimal numbers form an ideal in the ring of limited numbers; i.e., the product of a limited and an infinitesimal number is infinitesimal.
1 Simple Nonstandard Analysis and Applications
21
(iv) The limited and the infinitesimal numbers form vector spaces over R. Proof If |ρ| < n, and |τ | < m for n, m ∈ N, then n + m + n · m bounds the absolute values of the sum, difference and product of ρ and τ . Fix ρ and τ infinitesimal, and fix α limited in ∗ R. Given any n ∈ N, |ρ| < 1/(2n) and |τ | < 1/(2n), so |ρ + τ | < 1/n. There is an m ∈ N such that |α| < m. Since |ρ| < 1/(m · n), |α · ρ| < m/(m · n) = 1/n. The rest is left to the reader. Definition 1.6.9 We say that x and y are infinitesimally close or infinitely close if x − y is infinitesimal. Here one writes x y or x ≈ y. We say that x and y are finitely close if x − y is finite or limited. Here we write x ∼ y . (Both and ∼ are equivalence relations.) The equivalence class for containing x is called the monad of x and written m(x). That is, m(x) = {y ∈ ∗ R : y x}. The equivalence class for ∼ containing x is called the galaxy of x and written G(x). Remark 1.6.10 The monad of 0, m(0), is the set of infinitesimals; moreover, for all x ∈ ∗ R, m(x) = x + m(0). Similarly, G(x) = {y ∈ ∗ R : y ∼ x}. The galaxy of 0, G(0) is the set of limited elements of ∗ R. It is also denoted by Fin (∗ R). For each x ∈ ∗ R, G(x) = x + G(0). Proposition 1.6.11 Between any two monads is another monad; between any two galaxies is another galaxy. Proof If x and y are in different monads, then (x +y)/2 is between x and y. Moreover, x+y x−y 2 − y = 2 is not infinitesimal. Similarly, x is not in the monad of (x + y)/2. A similar proof works for galaxies. Remark 1.6.12 We usually center monads at standard real numbers, and speak of the monad of r for r ∈ R. Theorem 1.6.13 Every limited ρ ∈ ∗ R is in the monad of a unique r ∈ R. Proof Fix a limited ρ ∈ ∗ R, and set A := {s ∈ R : s ≤ ρ}. Here, we have used ρ to define an upper bounded subset of ordinary real numbers. Let r be the least upper bound in R of the set A. Assume |r − ρ| is not infinitesimal. Then for some n ∈ N, 1/n ≤ |r − ρ|. In this case, if r < ρ, then r + 1/n is still in A, so r is not the least upper bound of A. On the other hand, if r > ρ, then r − 1/n is an upper bound of A. This again contradicts the definition of r . It follows that, r ρ. If we also have s ∈ R and s ρ, then r − s 0. Since 0 is the only infinitesimal in R, s = r . Definition 1.6.14 If ρ is limited, then the unique real number r with ρ r is called the standard part of ρ. We write r = st(ρ) or r = ◦ ρ. The mapping st : G(0) → R is called the standard part map.
22
P.A. Loeb
The standard part map will be quite important in all later parts of this book. Theorem 1.6.15 The standard part of a sum, difference, product, or quotient of two limited numbers is, respectively, the sum, difference, product or quotient of the standard parts of those numbers, with the exception that a denominator must not be infinitesimal. If ρ ≤ τ , then ◦ ρ ≤ ◦ τ . Proof Fix limited numbers r + ε and s + δ, where r and s are real numbers, and ε and δ are infinitesimal (possibly 0). Then: (r + ε) ± (s + δ) = (r ± s) + (ε ± δ) r ± s, (r + ε) · (s + δ) = (r · s) + (r · δ) + ε · (s + δ) r · s. To establish the rule for quotients, we assume that r > 0, and we note that for some n, m ∈ N, n1 < r 2 − m1 , and of course m1 > |r · ε| 0, so n1 < r 2 + ε · r , whence 1 1 n > r 2 +ε·r > 0. Since r 2 +ε·r is limited, 1 ε 1 − = 2 0. r r +ε r +r ·ε The proof for r < 0 is similar, and the rest follows from the product rule. If (r + ε) ≤ (s + δ) , then r ≤ s + (δ − ε) < s + 1/n for any n ∈ N. It follows that r ≤ s. Corollary 1.6.16 The quotient G(0)/m(0) is isomorphic to the field R. Proof The set m(0) is the kernel of the linear map st taking the vector space (over R) G(0) onto R. Definition 1.6.17 For any subset A of R, we will write ∗ A∞ to denote the set \ G(0).
∗A
Theorem 1.6.18 The only limited elements of ∗ N are the standard natural numbers, so ∗ N∞ = ∗ N \ N. If A is an infinite subset of N, then ∗ A contains arbitrarily large unlimited elements. In particular, ∗ A ∩ ∗ N∞ is not empty. Proof If s ∈ ∗ N and s is limited, then by definition, for some standard n ∈ N, s ≤ n. Now the transfer of the sentence (∀x)[N x ∧ x ≤ n ∧ x = 1 ∧ · · · ∧ x = n − 1 → x = n] forces s to equal a standard natural number between 1 and n. For the second part, if A ⊆ N is infinite, then there is a Skolem function ψ such that (∀n)[N n → ψ(n) ≥ n ∧ A ψ(n) ]. The transfer of this sentence says that there are arbitrarily large elements of ∗ A. Definition 1.6.19 The set ∗ N is called the set of nonstandard natural numbers or hypernatural numbers. The extension of the integers ∗ Z is called the set of nonstandard integers. (It is formed from ∗ N as Z is formed from N.) Remark 1.6.20 We have the following easy to establish facts.
1 Simple Nonstandard Analysis and Applications
23
(1) The ∗-transform of the greatest integer function [·] continues to work in the way described by the sentence (∀x)[R x → Z [x] ∧ [x] ≤ x < [x] + 1]. (2) If A = {a1 , . . . , an } is a finite set in R, then ∗ A = A. This follows by transfer of the sentence (∀x)[A x ∧ x = a1 ∧ · · · ∧ x = an−1 → x = an ]. (3) The real numbers R = (∗ Q ∩ G(0))/m(0). (4) Not every subset of ∗ R, is the extension of a standard one. For example, N cannot be the extension of a finite subset A of N since otherwise, ∗ A = A, but if A is an infinite subset of N, then ∗ A contains unlimited elements. Problem: Show ∗ cos is periodic with period 2π . Answer: Transfer the sentence: (∀x)[R x → cos(x) = cos(x + 2π )]. To show that no smaller positive number is a period, transfer the sentence (∀r ∈ (0, 2π ))(∃x ∈ R)[cos(x + r ) = cos(x)]. This is actually an abbreviation of the following sentence using a Skolem function ψ: (∀r )[χ(0,2π ) (r ) = 1 → cos(ψ(r ) + r ) = cos(ψ(r ))]. Problem: Show that a bound M on the range of a function f remains in effect for ∗f. Answer: Transfer the sentence (∀x)[ f (x) = f (x) → | f (x)| ≤ M]. Problem: Show that the ∗-transform of the set { f > c} is the set {∗ f > c}. Answer: Let A be the set { f > c}. Transfer the sentence (∀x)[A x ←→ f (x) > c].
1.7 Sequences Since a sequence is a function from N into R, it has an extension that maps ∗ N into ∗ R. We write s for the original sequence and ∗ s for its extension. Note that for n n all n ∈ N, ∗ sn = sn . The results in this section are due to Robinson [6].
24
P.A. Loeb
Theorem 1.7.1 A sequence sn has limit L if and only if for all η ∈ ∗ N∞ , ∗ sη L. That is, sn → L iff L = st(∗ sη ) ∀η ∈ ∗ N∞ . Proof Assume sn → L. Given an ε > 0 in R, there is a k ∈ N for which the sentence (∀n)[N n ∧ n ≥ k → |sn − L| < ε] holds for R. It follows by transfer that ∀η ∈ ∗ N∞ , |∗ sη − L| < ε. Since ε is arbitrary in R+ , |∗ sη − L| 0 ∀η ∈ ∗ N∞ . Now assume it is not true that sn → L. Then there is an ε > 0 and a Skolem function ψ : N → N such that the following sentence holds for R: (∀k)[N k → ψ(k) ≥ k ∧ |sψ(k) − L| ≥ ε]. It follows by transfer that there are unlimited η ∈ ∗ N such that |∗ sη − L| ≥ ε. Example 1.7.2 The sequence 1/n : n ∈ N becomes 1/n : n ∈ ∗ N . For each unlimited η, 1/η 0, so 1/n → 0. Theorem 1.7.3 Assume sn → L and tn → M. then (i) sn + tn → L + M, (ii) sn · tn → L · M, (iii) sn /tn → L/M provided M = 0. Proof By assumption, for any unlimited η ∈ ∗ N, ∗ sη L and ∗ tη M, so ∗ sη + ∗ ∗ ∗ ∗ η L + M, sη · tη L · M; moreover, sη / tη L/M provided M = 0.
∗t
Theorem 1.7.4 A sequence sn is bounded if and only if for all η ∈ ∗ N∞ , ∗ sη is limited. Proof If sn is bounded, then there is an M > 0 such that (∀n)[N n → |sn | ≤ M] holds for R. Its transfer shows that ∀η ∈ ∗ N, ∗ sη is limited. If sn is not bounded, then there is a function ψ : N → N such that ∀n ∈ N, ψ(n) ≥ n and sψ(n) ≥ n. By transfer, if η ∈ ∗ N∞ , then λ = ∗ ψ(η) is unlimited and |∗ sλ | ≥ η. Thus, ∗ sλ is unlimited. Problem: Show that a sequence sn is Cauchy if and only if for all η, γ ∈ ∗ N∞ , ∗ η sγ . Answer: Assume sn is Cauchy. Given ε > 0 in R, ∃kε such that
∗s
(∀n)(∀m)[N n ∧ N m ∧ n ≥ kε ∧ m ≥ kε → |sn − sm | < ε]. ∗ By transfer we see that for η, γ ∈ N∞ , sη − sγ < ε. Since ε is arbitrary, sη − sγ 0. Now assume that sn is not Cauchy. Then there is an ε > 0 in R and functions ϕ and ψ from N into N such that
1 Simple Nonstandard Analysis and Applications
25
(∀k)[N k → ϕ(k) ≥ k ∧ ψ(k) ≥ k ∧ sϕ(k) − sψ(k) ≥ ε]. By transfer, ∃η, γ ∈ ∗ N∞ , with ∗ sη − ∗ sγ ≥ ε. Problem: Show that a Cauchy sequence sn must be bounded. Answer: Suppose sn is a sequence that is not bounded. Then for some Skolem function ψ, (∀k)[N k → N ψ(k) ∧ ψ(k) > k ∧ sψ(k) − sk ≥ 1] holds in R. By transfer, if η ∈ ∗ N∞ , then λ = ∗ ψ(η) > η and ∗ sη − ∗ sλ ≥ 1, whence sn is not Cauchy. Problem: Suppose sn → L, tn → M, and sn ≤ tn ∀n. Show that L ≤ M. Answer: Fix η ∈ ∗ N∞ . Note that by transfer ∗ sη ≤ ∗ tη , and take standard parts. Problem: Assume (sn − 1)/(sn + 1) → 0. Show that sn → 1. Answer: For any η ∈ ∗ N∞ , there is an ε 0 such that sη − 1 = εsη + ε. It follows that (1 − ε)sη = 1 + ε, whence sη = (1 + ε)/(1 − ε) 1. Problem: Show that a sequence sn converges if and only if it is Cauchy. Answer: If sn → L, then for unlimited η and γ , ∗ sη L ∗ sγ . If sn is Cauchy, pick η ∈ ∗ N∞ . Since sn is bounded, ∗ sη is limited, so we may let L = st(∗ sη ). Now for any γ ∈ ∗ N∞ , ∗ sγ ∗ sη L. Theorem 1.7.5 A real number L is a limit point of a sequence sn if and only if there is an η ∈ ∗ N∞ with ∗ sη L. Proof Assume that L is a limit point of sn . There is a function ψ : R+ × N → N such that (∀ε)(∀k)[ε > 0 ∧ N k → N ψ(ε, k) ∧ ψ(ε, k) ≥ k ∧ sψ(ε,k) − L < ε]. By transfer, if ε > 0 but ε 0 and η ∈ ∗ N∞ , then λ = ∗ ψ(ε, k) ∈ ∗ N∞ and λ L. Conversely, if L is not a limit point of sn , then ∃ε > 0 and a k ∈ N such that (∀n)[N n ∧ n ≥ k → |sn − L| ≥ ε]
∗s
holds in R. It follows by transfer that for all η ∈ ∗ N∞ , ∗ sη − L ≥ ε. Example 1.7.6 Let sn = (−1)n (1 − 1/n). For any unlimited η, ∗ sη 1 for η even and ∗ sη −1 for η odd. Theorem 1.7.7 (Bolzano-Weierstrass) Every bounded sequence has a limit point. Proof If sn is bounded and η ∈ ∗ N∞ , then ∗ sη is limited. Let L = st(∗ sη ). Now, there is an unlimited element of ∗ N, namely η, such that ∗ sη L.
26
P.A. Loeb
1.8 Topology on the Reals Recall that the monad m(a) of a real number a ∈ R consists of the points infinitesimally close to a in ∗ R. Many of the arguments in this section generalize to 1st countable topological spaces where the monad of a point x is the set m(x) := ∩{∗ V : V a standard open neighborhood of x}. The compactness results of this section generalize to Rn . Theorem 1.8.1 Let A be a subset of R. (i) A is open if and only if for all a ∈ A, m(a) ⊂ ∗ A. (That is, points an infinitesimal distance away from a are still in ∗ A.) (ii) A is closed if and only if for all a ∈ A , m(a) ∩ ∗ A = ∅. Proof Clearly, (ii) follows from (i). If A is open and a ∈ A, then for some δ > 0, (∀x)[R x ∧ |x − a| < δ → A x ] holds for R. If x ∈ ∗ R, and x ∈ m(a), i.e. x a, then |x − a| < δ, so by transfer, x ∈ ∗ A. If A is not open, then ∃a ∈ A and a sequence sn such that
(∀n)[N n → A sn ∧ |sn − a| < 1/n]. By transfer, for η ∈ ∗ N∞ , ∗ sη a and ∗ sη ∈ contained in ∗ A.
∗
A = (∗ A) , whence m(a) is not
Problem: Show that arbitrary unions and finite intersections of open sets are open, and arbitrary intersections and finite unions of closed sets are closed. Answer: If a ∈ A1 ∩ A2 ∩ · · · ∩ An , all open, then m(a) ⊂ ∗ Ai for i = 1, . . . , n, so m(a) ⊂ ∗ A1 ∩ · · · ∩ ∗ An = ∗ (A1 ∩ · · · ∩ An ). The rest is clear. Theorem 1.8.2 A point c is an accumulation point of A ⊆ R if and only if there is an x ∈ ∗ A with x = c but x c. Proof If c is an accumulation point of A, then there is a sequence sn such that (∀n)[N n → A sn ∧ 0 < |sn − c| < 1/n]. For the desired point, let x = ∗ sη for some η ∈ ∗ N∞ . If c is not an accumulation point of A, then ∃ε > 0 in R such that
(∀x)[0 < |x − c| < ε → A x ], so m(c) ∩ (∗ A \ {x}) = ∅. Theorem 1.8.3 The closure A of A ⊆ R is the set {x ∈ R : m(x) ∩ ∗ A = ∅}. Proof If x ∈ A or x ∈ R is an accumulation point of A, then m(x) ∩ ∗ A = ∅. If m(x) ∩ ∗ A = ∅ and x ∈ / A, then x is an accumulation point of A.
1 Simple Nonstandard Analysis and Applications
Remark 1.8.4 The closure A = st
∗
27
A ∩ G(0) .
We next give Robinson’s criterion for compactness. For our elementary setting, we need a standard-analysis result not needed in the general setup of nonstandard analysis. That result generalizes to Rn . We should note that Robinson’s Theorem is also valid for spaces that are not second countable. Proposition 1.8.5 A set A ⊂ R is compact if and only if each covering of A by open intervals with rational end points has a finite subcovering. Proof Fix an arbitrary open covering of A. Given a ∈ A, there is an open U in the covering and an open interval with rational end points (α, β) such that a ∈ (α, β) ⊂ U . This gives a covering of A by intervals with rational end points. If this covering has a finite subcover {(αi , βi ) : 1 ≤ i ≤ n}, thenfor each i, there is a set Ui in the original cover with (αi , βi ) ⊆ Ui . Clearly, A ⊆ 1≤i≤n Ui . The rest is clear. Definition 1.8.6 We say that ρ ∈ ∗ A is near-standard in A if ◦ ρ = st(ρ) ∈ A. Theorem 1.8.7 (Robinson) A set A ⊂ R is compact if and only if for all ρ ∈ ∗ A, there is an a ∈ A with ρ a. That is, every point of ∗ A, is near-standard in A. Proof Assume A is compact but ∃ρ ∈ ∗ A not in the monad of any standard point of A. Then ∀a ∈ A, |ρ − a| is a non-infinitesimal number, so ∃δa > 0 in R such that |ρ − a| ≥ δa . Since A is compact, there is a finite set {a1 , . . . , an } ⊂ A and numbers {δ1 , . . . , δn } ⊂ R+ with δi = δai such that the following sentence holds for R: (∀x)[A x ∧ |x − a1 | ≥ δ1 ∧ · · · ∧ |x − an−1 | ≥ δn−1 → |x − an | < δn ]. By transfer, |ρ − an | < δn , which contradicts the choice of δn = δan . It follows that if A is compact, each ρ ∈ ∗ A is near-standard in A. Now assume there are sequences αn and βn of rational numbers such that for each n, αn < βn , and the open intervals (αn , βn ) form a covering of A with no finite subcovering. For each n ∈ N, let ψ(n) be an element of A not in the first n intervals. Then we have (∀n)(∀k)[N n ∧ N k ∧ k ≤ n ∧ αk < ψ(n) → βk ≤ ψ(n)], (∀n)(∀k)[N n ∧ N k ∧ k ≤ n ∧ βk > ψ(n) → αk ≥ ψ(n)]. / ∗ (αk , βk ) for any standard k ∈ N. Since By transfer, for η ∈ ∗ N∞ , ρ = ∗ ψ(η) ∈ for each a ∈ A, ∃k ∈ N with a ∈ m(a) ⊂ ∗ (αk , βk ), ρ is not in the monad of any standard point of A. Theorem 1.8.8 (Heine-Borel) A set A ⊂ R is compact if and only if it is closed and bounded.
28
P.A. Loeb
Proof Assume A is not closed. Then for some x ∈ A , m(x) ∩ ∗ A = ∅, i.e., m(x) / A, A is not compact. Assume A is contains a point y ∈ ∗ A . Since st(y) = x ∈ not bounded; that is, for each n ∈ N, there is a point φ(n) ∈ A with |φ(n)| ≥ n. Then by transfer, ∗ A contains an unlimited element, which is not in the monad of any standard point. Now assume that A is closed and that A is bounded by a constant M. Then (∀x)[A x → |x| ≤ M] holds in R. Given ρ ∈ ∗ A, |ρ| ≤ M, so ρ has a standard part, call it r . Since m(r ) ∩ ∗ A contains ρ and A is closed, r ∈ A. Remark 1.8.9 All of these notions are easily extended to Rn . For example, we have x1 , . . . , xn y1 , . . . , yn if and only if for all i, xi yi . Problem: Does ◦ x ≤ ◦ y ⇒ x ≤ y? Answer: No. If ε > 0 is infinitesimal, then 0 < ε, while 0 = ◦ ε ≤ ◦ 0 = 0. It is true that ◦ x < ◦ y ⇒ x < y. That is, if ρ = r + ε and τ = t + δ, with r < t in R and ε 0, δ 0, then t − r is not infinitesimal, so ρ = r + ε < τ = t + δ. Problem: Show that if A and B are compact in R, so is A + B. Answer: Given y ∈ ∗ (A + B), ∃α ∈ ∗ A and β ∈ ∗ B such that y = α + β. Since st(α) ∈ A and st(β) ∈ B, st(y) exists and is in A + B.
1.9 Limits and Continuity It is quite natural to treat limits and continuity using infinitesimals. Theorem 1.9.1 Suppose a is an accumulation point of A and f : A −→ R. Then lim x→a f (x) exists and equals L ∈ R if and only if for all x ∈ ∗ A with x a but x = a, ∗ f (x) L; that is, ∗ f [(m(a) ∩ ∗ A) \ {a}] ⊆ m(L). Proof Assume that lim x→a f (x) = L. Fix ε > 0 in R. Then ∃δ > 0 such that (∀x)[A x ∧ 0 < |x − a| < δ → | f (x) − L| < ε] holds for R. By transfer, if x ∈ (m(a) ∩ ∗ A) \ {a}, then | f (x) − L| < ε, and this is true for any ε > 0 in R, whence f (x) L. Now assume that L is not the limit of f (x) as x → a. Then there is an ε > 0 in R and a sequence sn such that (∀n)[N n → A sn ∧ 0 < |sn − a| < 1/n ∧ | f (sn ) − L| ≥ ε] holds in R. By transfer, if η ∈ ∗ N∞ , then ∗ sη ∈ (m(a) ∩ ∗ A) \ {a} but ∈ / m(L).
∗
f (∗ s η )
1 Simple Nonstandard Analysis and Applications
29
Theorem 1.9.2 If lim x→a f (x) = L and lim x→a g(x) = M, then (i) lim x→a ( f + g)(x) = L + M, (ii) lim x→a ( f · g)(x) = L · M, (iii) lim x→a ( f / g)(x) = L/M if M = 0. Proof The result follows by taking standard parts of (m(a) ∩ ∗ A) \ {a}.
∗
f (x) and ∗ g(x) when x ∈
Theorem 1.9.3 If f is defined on A then f is continuous at a ∈ A if and only if for all x ∈ m(a) ∩ ∗ A, ∗ f (x) f (a). That is, if and only if for x = x − a 0, we have y = ∗ f (x) − f (a) 0. Proof The result follows from the previous result for limits. Example 1.9.4 If f (x) = x 2 and x = x − a 0, then y = (a + x)2 − a 2 = 2a · x + x 2 0. Corollary 1.9.5 The sum, product, and quotient of functions continuous at a are continuous at a, provided that for the quotient, the denominator does not vanish at a. Theorem 1.9.6 (Intermediate Value Theorem) If f is continuous on [a, b] and f (a) < d < f (b), then there is a c ∈ (a, b) with f (c) = d. A similar result holds if f (b) < d < f (a). Proof For each n ∈ N, partition [a, b] into steps of length (b − a)/n . There is a first time in going from a partition point a + (k − 1)(b − a)/n to a partition point a + k(b − a)/n that f crosses from below d to a level at or above d. This gives a sequence sn such that b−a (∀n) N n → a ≤ sn < b ∧ f (sn ) < d ∧ d ≤ f sn + . n For η ∈ ∗ N∞ , ∗ sη is limited, and c = st(∗ sη ) ∈ [a, b]. Moreover, since ∗ sη b−a b−a ∗ η + η , c = st( sη + η ). By continuity, f (c) ≤ d and f (c) ≥ d, whence f (c) = d. For the rest, replace f with − f .
∗s
Theorem 1.9.7 (Extreme Value Theorem) If f is continuous on [a, b], then there is a point c ∈ [a, b] with f (c) ≥ f (x) for all x ∈ [a, b]. Proof For each n ∈ N, construct the points xn,k = a + nk · (b − a), 0 ≤ k ≤ n. Choose ψ(n) so that f (xn,ψ(n) ) ≥ f (xn,k ) ∀k with 0 ≤ k ≤ n. Fix η ∈ ∗ N∞ . By transfer, ∗ f (∗ xη,∗ ψ(η) ) ≥ ∗ f (∗ xη,k ) for any k ∈ ∗ Z with 0 ≤ k ≤ η. Moreover, c = st(∗ xη,∗ ψ(η) ) ∈ [a, b]. If d ∈ [a, b], then for the appropriate Skolem function ϕ determined by d we have ∗ ϕ(η) ∈ ∗ Z, 0 ≤ ∗ ϕ(η) ≤ η, and
30
P.A. Loeb
a ≤ ∗ xη,∗ ϕ(η) ≤ d < ∗ xη,∗ ϕ(η) +
b−a . η
Since f is continuous, f (c) ∗ f (∗ xη,∗ ψ(η) ) ≥ ∗ f (∗ xη,∗ ϕ(η) ) f (d). Since f (c) and f (d) are real, f (c) ≥ f (d). Remark 1.9.8 With the general approach to nonstandard analysis that we will present in the next chapter, we would be able to simplify the above proof by using a function that picks the biggest element from any hyperfinite set. Theorem 1.9.9 A function f is uniformly continuous on a set A if and only if for each x and y in ∗ A with x y, ∗ f (x) ∗ f (y). Proof Assume f is uniformly continuous on A. Given ε > 0, ∃δ > 0 so that (∀x)(∀y)[A x ∧ A y ∧ |x − y| < δ → | f (x) − f (y)| < ε]. Thus if x y in ∗ A, then |∗ f (x) −∗ f (y)| < ε. Since ε is arbitrary in R+ , we have f (x) ∗ f (y). Now assume that f is not uniformly continuous on A. Then ∃ε > 0 and a pair of sequences an and bn such that ∗
(∀n)[N n → A an ∧ A bn ∧ |an − bn | < 1/n ∧ | f (an ) − f (bn )| ≥ ε]. By transfer, for η ∈ ∗ N∞ , ∗ aη ∗ bη but ∗ f (∗ aη ) − ∗ f (∗ bη ) ≥ ε. Example 1.9.10 The function f (x) = 1/x is continuous on (0, 1), since for a ∈ (0, 1) and h 0, 1/(a + h) 1/a. However, f is not uniformly continuous on (0, 1) since for η ∈ ∗ N∞ , 1/η 1/2η 0, but ∗ f (1/η) = η and ∗ f (1/2η) = 2η. Theorem 1.9.11 If A ⊂ R is compact and f is continuous on A, then f is uniformly continuous on A. Proof Fix x y in ∗ A. Let a = st(x). Then a = st(y). By continuity, ∗ f (x) f (a) ∗ f (y).
1.10 Differentiation Theorem 1.10.1 Let f be defined on an interval [a, a + δ) (or (a − δ, a]) for some positive δ. Then f has a right-hand (left-hand) derivative at a if for all strictly positive (negative) h 0, (∗ f (a + h) − f (a)) / h is finite and has a standard part independent of h. The right-hand (left-hand) derivative is that standard part.
1 Simple Nonstandard Analysis and Applications
31
Proof This follows immediately from the nonstandard criterion for a limit. As usual, we say that f has a derivative at a if f has both a right-hand and lefthand derivative at a taking the same value, or if a is the end point of the domain of f and f has the appropriate one sided derivative at a. In this case we write f (a) for the derivative of f at a. Theorem 1.10.2 Let f be defined on [a, b]. Then f has a continuous derivative on [a, b] if and only if for every c ∈ [a, b] and for all x, x , y, y ∈ ∗ [a, b] ∩ m(c), with x = y and x = y , we have ∗ f (x ) − ∗ f (y ) ∗ f (x) − ∗ f (y) ∈ G(0). x−y x − y In this case,
∗ f (x) − ∗ f (y) . f (c) = st x−y
Proof If f has a continuous derivative on [a, b] and for c ∈ [a, b] we have x < y in the monad of c, then by the transfer of the mean value theorem, there is a z with ∗ − ∗ f (y) = ∗ f (z). Here a Skolem function gives z as the x < z < y such that f (x)x−y output for the given input x and y. Since f is continuous, ∗ f (z) f (c), and the result follows. Assume now the conditions for difference quotients hold. Fixing c ∈ [a, b] and letting y and y take the value c, we conclude that f (c) exists. Since c is arbitrary, f exists on [a, b]. To show f is continuous, we again pick any c ∈ [a, b] and a point y ∈ m(c) ∩ ∗ [a, b]; we must show that ∗ f (y) f (c). Using an appropriate Skolem function and the Transfer Principle, we see that there are points x y and x c such that f (c)
∗ f (x ) − ∗ f (y) ∗ f (x) − f (c) and ∗ f (y) , so, f (c) ∗ f (y). x −c x − y
Example 1.10.3 If f (x) = x 2 , then for any limited x and non-zero x 0, y = (x + x)2 − x 2 = 2x · x + (x)2 , so y/x = 2x + x 2x. Remark 1.10.4 If f (c) exists for c ∈ [a, b], then when x 0 but x = 0, setting dy = f (c) · x, we have y = ∗ f (c + x) − f (c) = f (c) · x + ε · x = dy + ε · x where ε 0. If x = 0, this formula for y holds for any limited value of ε. In any case, since dy 0, we have y 0.
32
P.A. Loeb
Remark 1.10.5 A corollary of the last theorem is that f is continuous on [a, b] if and only if for every x ∈ ∗ [a, b] (be it standard or nonstandard), if x 0, then y = dy + ε · x where ε 0. The standard rules of differentiation are easily established using infinitesimals. For example, the chain rule has the following proof: If y = f (x) and x = g(t), with c = g(b), then when t 0, we have x 0, so
y = ( f (c) + ε)x = ( f (c) + ε) · (g (b) + δ) · t , where ε 0 and δ 0. If x = 0 but t = 0, then g (b) + δ = 0. Since g (b) is a standard number, g (b) = 0. In any case, it follows that y/t f (c) · g (b).
1.11 Riemann Integration The following treatment of Riemann integration is derived from the treatment in H.J. Keisler’s book [3]. Further developments by this author that allow the results given here to be presented in a standard calculus course without using infinitesimals are outlined in [5]. b Given a continuous function f on [a, b], we let S a ( f, P), S ab ( f, P), and Sab ( f, P) denote the upper, lower, and ordinary Riemann sum for f with respect to a partition P of [a, b]. For an ordinary Riemann sum, we take the evaluation of f at the left endpoint of each interval. We work with partitions of [a, b] that are determined by positive values of x; the partition points in (a, b) are of the form a + k · x for 1 ≤ k ≤ n − 1. For the last interval [xn−1 , b], we have b − xn−1 ≤ x. For each b value of x, we denote the corresponding Riemann sums by S a ( f, x), S ab ( f, x), b and Sa ( f, x), respectively. These functions of a, b, and x can be extended to ∗ R. For a continuous function f on [a, b] and x > 0, let Mi − m i be the difference between the maximum and the minimum of f on the i th partition interval xi−1 , xi . Let E(x) = maxi (Mi −m i ). A property that is equivalent to the uniform continuity of f on [a, b] is the fact that limx→0+ E(x) = 0. This fact allows a simple proof, both standard and nonstandard, that the Riemann integral of f on [a, b] exists. Theorem 1.11.1 Let f be a continuous function on [a, b]. If x is a positive infinb itesimal, then ∗ S a ( f, x) ∗ S ab ( f, x). Proof There are Skolem functions ϕ and ψ that given a positive input x give as output two points ϕ(x) and ψ(x) in [a, b] with |ϕ(x) − ψ(x)| ≤ x and b
S a ( f, x) − S ab ( f, x) ≤ [ f (ψ(x)) − f (ϕ(x))] · (b − a). (To see this, find the first subinterval Ii on which is found the maximum difference Mi −m i between the maximum and the minimum of f on each subinterval; let ψ(x)
1 Simple Nonstandard Analysis and Applications
33
be the point at which the maximum Mi is taken, and let ϕ(x) be the point where the minimum m i is taken in that same subinterval.) Given a positive infinitesimal x, there is a point c ∈ [a, b] such that ∗ ϕ(x) c ∗ ψ(x). Since f is continuous at c, it follows that ∗ b S a ( f, x) − ∗ S ab ( f, x)
≤ [∗ f (∗ ψ(x)) − ∗ f (∗ ϕ(x))] · (b − a) 0.
Corollary 1.11.2 If f is continuous on [a, b], then f is Riemann integrable there, b and for any positive infinitesimal x, a f (x)dx = st[∗ Sab ( f, x)]. b
Proof For any partition P, we always have S ab ( f, P) ≤ Sab ( f, P) ≤ S a ( f, P) . If we assume that the area under the curve exists, then every upper sum is too big and every lower sum is to small. It follows that for x 0, the corresponding upper and lower sums are infinitesimally close to the area, as is the Riemann sum ∗ Sab ( f, x). If we do not assume that the area exists, then one needs the standard fact that for any pair of partitions P1 and P2 with common refinement P, b
b
S ab ( f, P1 ) ≤ S ab ( f, P) ≤ S a ( f, P) ≤ S a ( f, P2 ). Therefore, there is at least one real number that is below every upper sum and above every lower sum. Since for x 0, the upper and lower sums are infinitesimally b close, that number is unique (we denote it by a f (x)dx); it equals st[∗ Sab ( f, x)] for any positive infinitesimal x. We proceed now on a somewhat more informal level that can be justified by the full machinery of the next chapter. x Theorem 1.11.3 If f is continuous on [a, b] and F(x) = a f (t)dt, then for every c in [a, b], F (c) = f (c). Proof Given c ∈ [a, b) and a positive h 0, ∗ F(c
1 + h) − F(c) = h h
c+h
∗
f (t) dt.
c
This value is between the maximum and minimum value of ∗ f (t) on [c, c + h], and so it is infinitesimally close to f (c). A similar proof works for c ∈ (a, b] and a negative h 0. Proposition 1.11.4 Given a partition by x 0 and a corresponding sum of the form S = εi · xi with each εi 0, the sum S 0.
34
P.A. Loeb
Proof Let ε = maxi εi . Then |S| ≤ |εi | · xi ≤ ε · xi = ε · (b − a) 0. Theorem 1.11.5 (Keisler’s Infinite Sum Theorem) Let S be a standard quantity such that for a continuous function f on [a, b] and a partition of ∗ [a, b] by x 0, b S = i Si = i (∗ f (xi ) · xi + εi · xi ) with each εi 0. Then S = a f (x)dx. Proof Since i εi ·xi 0, S i f (xi )·xi are real numbers, they are equal.
b a
f (x)dx. Since S and
b a
f (x)dx
Remark 1.11.6 This is a nonstandard form of a simplified version of Duhamel’s Principle (see [5, 7].) The standard form replaces the infinitesimal condition with the condition that for each x > 0 and each i, |Si − f (xi−1 ) · xi | ≤ E(x) · x where E(x) is a function of x with limit 0 at x = 0. Theorem 1.11.7 (Fundamental Theorem of Calculus) If F has a continuous derivb ative f on [a, b], then a f (x)dx = F(b) − F(a). Proof Let y = F(x). For a partition of ∗ [a, b] by x 0 there are infinitesimals εi such that, F(b) − F(a) = i yi = i dyi + εi · xi i dyi = i ∗ f (xi ) · xi
b
f (x)dx.
a
Example 1.11.8 To compute the total force F of water on the bottom half of a circular window, one must consider that for a partition by horizontal strips, the maximum length l is at the top of the strip while the maximum pressure p is a the bottom. It does not follow, a priori that upper and lower Riemann sums bound the quantity. By continuity, for a partition of the depth by an infinitesimal y, the force Fi on a strip corresponding to the interval [yi , yi + y] equals l(yi ) · p(yi ) · y + εi · y where εi 0. Therefore, F = (l · p)dy. Here is one more application of our simple theory. It is a typical construction using nonstandard partitions yielding a standard continuous object. The proof is due to Robinson. Theorem 1.11.9 (Cauchy-Peano Existence Theorem) Let f be continuous on the b rectangle [x0 −a, x0 +a]×[y0 −b, y0 +b] with | f | ≤ M there. Let c = min(a, M ), 1 and let Ic = [x0 − c, x0 + c]. Then there is a function ∈ C (Ic ) with (x0 ) = y0 and (x) = f (x, (x)) for all x ∈ Ic .
1 Simple Nonstandard Analysis and Applications
35
Proof We will establish the result for I = [x0 , x0 +c]. Given n ∈ N, let xk = x0 + nk c for 0 ≤ k ≤ n. Let n be the polygonal path given by n (x0 ) = y0 , and for 0 ≤ k ≤ n − 1 and xk < x ≤ xk+1 , n (x) = n (xk ) + f (xk , n (xk )) · (x − xk ). Here, we are writing n (x) for (n, x). Now the following holds for R: (∀n)(∀x)(∀z)[N n ∧ I x ∧ I z
→ n (x0 ) = y0 ∧ |n (x) − n (z)| ≤ M · |x − z|]. It follows by transfer that for each n ∈ ∗ N and each x ∈ ∗ I , ∗ n (x) − y0 ≤ M · |x − x0 | ≤ M · c ≤ b. Fix η ∈ ∗ N∞ ; ∗ η is finite valued. For each x ∈ I , set (x) = st(∗ η (x)); we will show that is the desired solution. To show is uniformly continuous, note that for x, z ∈ I, |(x) − (z)| ∗ η (x) −∗ η (z) ≤ M · |x − z| . Moreover, ∀x ∈ ∗ I , ∗
(x) (st(x)) ∗ η (st(x)) ∗ η (x);
that is, ∗ is uniformly infinitesimally close to ∗ η . Now given x ∈ I , there is a k ∈ ∗ N with 0 ≤ k ≤ η − 1 and a corresponding xk with xk ≤ x ≤ xk+1 so that for x = c/η, k−1 ∗ η (xk ) = y0 + i=0 f (xi ,∗ η (xi )) · x x k−1 ∗ y0 + i=0 f (xi ,∗ (xi )) · x y0 + f (t, (t))dt.
(x)
∗
x0
Therefore, has a continuous derivative with (x) = f (x, (x)) for all x ∈ I .
References 1. R.M. Anderson, A non-standard representation for Brownian motion and Itô integration. Isr. J. Math. 25, 15–46 (1976) 2. A.E. Hurd, P.A. Loeb, An Introduction to Nonstandard Real Analysis (Academic Press, Orlando, 1985) 3. H.J. Keisler, Elementary Calculus, An Infinitesimal Approach, 1st edn. 1976, 2nd edn. 1986 (Prindle, Weber & Smith, Boston, 1976)
36
P.A. Loeb
4. P.A. Loeb, Conversion from nonstandard to standard measure spaces and applications in probability theory. Trans. Am. Math. Soc. 211, 113–122 (1975) 5. P.A. Loeb, A lost theorem of calculus. Math. Intell. 24, 15–18 (2002) 6. A. Robinson, Non-Standard Analysis (North-Holland, Amsterdam, 1966) 7. A.E. Taylor, Advanced Calculus (Ginn & Company, Boston, 1955)
Chapter 2
An Introduction to General Nonstandard Analysis Peter A. Loeb
2.1 Superstructures In this chapter, we develop the general framework of nonstandard analysis and the necessary logic for the transfer principle. We will begin each section with a brief summary for readers who want to postpone the technical details until a later reading. The summary will note any important definitions and results of the section that the reader should know before going on. For example, Definition 2.1.1 describing a superstructure and Remark 2.1.3 are important in this section. A reader who wants quickly to get to later applications may skip Sects. 2.5, 2.7, and 2.9. The reader who has read the first chapter of this book will appreciate that Skolem functions will no longer be needed to replace the existential quantifier. The results obtained in the last chapter using our simple transfer principle will still be valid, since the transfer principle used here extends that simple one. The outline of this chapter is similar to that of Chap. 2 of the author’s book with Albert E. Hurd, [4]. To work with general mathematical analysis, we need to consider sets, sets of sets, etc. All of these are constructed starting with a set of individuals. We think of an individual as an object different from a set. In particular, an individual contains no elements. We build our universe from the set X of individuals using the power set operation P. The set X will always contain the natural numbers N; usually it will contain R. Definition 2.1.1 Fix a set X containing N. Let V0 (X ) = X , and for each n ∈ N, let Vn (X ) = Vn−1 (X ) ∪ P(Vn−1 (X )). The superstructure over X is the set V (X ) = ∪∞ n=0 Vn (X ). Entities in X are said to be of rank 0, and for n ≥ 1, entities in Vn (X ) \ Vn−1 (X ) are said to be of rank n. Example 2.1.2 Individuals are of rank 0. The number 7 and the set {7} are in V1 (X ). The number 7, the set {7}, and the set of all finite subsets of N are in V2 (X ). Note that V1 (X ) ∈ V2 (X ) and V1 (X ) ⊂ V2 (X ). P.A. Loeb (B) Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana, IL 61801, USA e-mail:
[email protected] © Springer Science+Business Media Dordrecht 2015 P.A. Loeb and M.P.H. Wolff (eds.), Nonstandard Analysis for the Working Mathematician, DOI 10.1007/978-94-017-7327-0_2
37
38
P.A. Loeb
Remark 2.1.3 In this chapter’s appendix, written by Horst Osswald, it will be shown that members of the set X of individuals can be coded so that they contain no elements of V (X ). That is if b ∈ X , there is no a with a ∈ b. For example, the equivalence class of Cauchy sequences of rational numbers with limit 7 is in V (X ). It is not, however, the same as the object in X we will call 7. Given a superstructure V (X ) and an entity b in V (X ) we will assume that only entities a in V (X ) can satisfy the relation a ∈ b. If we speak of an element a, with a ∈ b, a will automatically be in V (X ). Definition 2.1.4 An ordered pair a, b is the set {{a}, {a, b}}. Example 2.1.5 The ordered pair 3, π is the set {{3}, {3, π}}. The ordered pair 3, 3 is the set {{3}}. Definition 2.1.6 For n ≥ 1, an ordered n-tuple x1 , . . . , xn of entities x1 , . . . , xn is the set of ordered pairs {1, x1 , . . . , n, xn }. If c1 , . . . , cn are sets, we have c1 × · · · × cn = {x1 , . . . , xn : xi ∈ ci for 1 ≤ i ≤ n}. Moreover, cn = c × · · · × c (n factors). For n ≥ 2, an n-ary relation P on c1 × · · · × cn is a subset of c1 × · · · × cn . We identify a 1-tuple x1 with the corresponding element x1 , so a 1-ary relation on c is a subset of c. Given a relation P as above, there will be a k such that each ci is in Vk (X ). The relation P itself will be in Vk+4 (X ). Functions are relations with the usual restriction. Suppose f is a function of n-variables, i.e., the domain consists of ntuples xi , . . . , xn from c1 × · · · × cn , with each variable in the domain and the range taking values in Vk (X ). Then f is an element of Vk+7 (X ) since a typical element of f is a two tuple of the form x1 , . . . , xn , xn+1 . Lemma 2.1.7 The n-tuple x1 , . . . , xn = y1 , . . . , yn as sets if and only if xi = yi for i = 1, . . . , n. Proof The proof is left to the reader (The only problem is if xi = i).
2.2 Language for Superstructures In this section we describe the construction of formal statements in a formal language L X about a superstructure V (X ). Given X , the language L X for the superstructure V (X ) over X has the following symbols: Connectives: ¬, ∧, ∨, →, ←→ Quantifiers: ∀, ∃ Parentheses: [, ], (, ), <, > Constant Symbols: At least one name for each entity in V (X ). Variable Symbols: A countable number of them will do. Equality Symbol: Denotes equality for elements of X and set equality otherwise. Set membership: ∈. We will not have terms in our language.
2 An Introduction to General Nonstandard Analysis
39
Definition 2.2.1 A formula of L X is built up inductively with the following rules: (a) If x1 , . . . , xn , x, and y are either constants or variables, then the following are formulas called atomic formulas: x ∈ y, x = y; x1 , . . . , xn ∈ y; x1 , . . . , xn = y; x1 , . . . , xn , x ∈ y; x1 , . . . , xn , x = y. (b) If and are formulas, so are ¬, ∧ , ∨ , → , and ←→ . (c) If x is a variable symbol and y is either a variable symbol or a constant symbol and is a formula that does not already contain a formula of the form (∀x ∈ z) or (∃x ∈ z), or (∀y ∈ z) or (∃y ∈ z), then (∀x ∈ y) and (∃x ∈ y) are formulas. Definition 2.2.2 A variable x is bound in a formula if it occurs in and every occurrence takes the form (∀x ∈ z) or (∃x ∈ z). Here, z may be a constant or a variable. A variable occurring in a formula but not bound in is called a free variable in . A sentence in L X is a formula in which all variables are bound.
2.3 Interpretation of the Language for Superstructures In this section we give the rules for interpreting the formal language L X . The rules are as follows: (a) The atomic sentences a ∈ b, a1 , . . . , an ∈ b, a1 , . . . , an , c ∈ b are true or hold in V (X ) if the entities corresponding to the names a, a1 , . . . , an , or, respectively, a1 , . . . , an , c belong to the object named by b. The atomic sentences a = b, a1 , . . . , an = b, a1 , . . . , an , c = b are true or hold in V (X ) if the entities corresponding to the names a, a1 , . . . , an , or, respectively, a1 , . . . , an , c are identical to the object named by b. (b) If and are sentences, then (i) (ii) (iii) (iv) (v)
¬ is true in V (X ) if is not true (does not hold) in V (X ); ∧ is true in V (X ) if both and are true in V (X ); ∨ is true in V (X ) if either or is true in V (X ); → is true if either is not true or is true in V (X ); ←→ is true if and are either both true or both not true in V (X ).
(c) Let = (x) be a formula in which x either does not occur and all variables are bound or x is the only free variable. Given a constant a, we will write (a) for with all occurrences of x replaced by a. Let b be a constant naming a set β ∈ V (X ). (i) (∀x ∈ b) is true in V (X ) if for all entities α ∈ β, (a) is true in V (X ), where a is any constant naming α. (ii) (∃x ∈ b) is true in V (X ) if there is an entity α ∈ β such that (a) is true in V (X ), where a is any constant naming α.
40
P.A. Loeb
Remark 2.3.1 Although we do not have terms in our formal language, we will use xn+1 = f (x1 , . . . , xn ) as shorthand for x1 , . . . , xn , xn+1 ∈ f and y = f (x) as shorthand for x, y ∈ f . Example 2.3.2 The sentence that says that every nonzero real number has a multiplicative inverse has the following form using R to denote the set of real numbers and P to denote the product function: (∀x ∈ R)[¬(x = 0) → (∃y ∈ R)[x, y , 1 ∈ P]]. With our shorthand, this sentence has the form (∀x ∈ R)[¬(x = 0) → (∃y ∈ R)[P(x, y) = 1]]. Using S to denote the sum function, the distributive law has the form (∀x ∈ R)(∀y ∈ R)(∀z ∈ R)(∀α ∈ R)(∀β ∈ R)(∀γ ∈ R)(∀δ ∈ R) [[[S(y, z) = α] ∧ [P(x, α) = β] ∧ [P(x, y) = γ] ∧ [P(x, z) = δ]] → [S(γ, δ) = β]]. Remark 2.3.3 Note that we are missing the composition of terms. We will usually use ordinary mathematical sentences employing terms. One should keep in mind, however, that these are shorthand for more complicated parts of sentences of L X . Example 2.3.4 To say that a function f defined on R is continuous at a, let R + be the symbol used to denote the strictly positive real numbers. Let ρ denote the distance function, i.e., ρ(x, y) = |x − y|, and let I denote strict inequality, i.e., x, y ∈ I iff x < y. With f (a) = b, the sentence (∀ε ∈ R + )(∃δ ∈ R + )(∀x ∈ R)(∀α ∈ R)(∀β ∈ R)(∀γ ∈ R) [[ρ(x, a) = α ∧ α, δ ∈ I ∧ f (x) = β ∧ f (a) = b ∧ ρ(β, b) = γ] → [γ, ε ∈ I ]]. is abbreviated with the sentence (∀ε ∈ R + )(∃δ ∈ R + )(∀x ∈ R)[|x − a| < δ → | f (x) − f (a)| < ε]. Problem: Write sentences in the language for the real numbers expressing the commutative and associative laws for addition. Answer: Let S denote the sum function. The commutative law for addition is expressed by (∀x ∈ R)(∀y ∈ R)(∀α ∈ R)(∀β ∈ R)[[[S(x, y) = α] ∧ [S(y, x) = β]] → [α = β]].
2 An Introduction to General Nonstandard Analysis
41
The associative law for addition is expressed by (∀x ∈ R)(∀y ∈ R)(∀z ∈ R)(∀α ∈ R)(∀β ∈ R)(∀γ ∈ R)(∀δ ∈ R) [[[S(y, z) = α] ∧ [S(x, α) = β] ∧ [S(x, y) = γ] ∧ [S(γ, z) = δ]] → [β = δ]]. Problem: Write a sentence in the language for the real numbers saying that for a given function f , lim x→a∈A f (x) = L. Answer: We use R + to denote the strictly positive real numbers, ρ to denote the distance function, i.e., ρ(x, y) = |x − y|, and I to denote strict inequality, i.e., x, y ∈ I iff x < y. The sentence has the form (∀ε ∈ R + )(∃δ ∈ R + )(∀x ∈ A)(∀α ∈ R)(∀β ∈ R)(∀γ ∈ R) [[¬[x = a] ∧ ρ(x, a) = α ∧ α, δ ∈ I ∧ f (x) = β ∧ ρ(β, L) = γ] → [γ, ε ∈ I ]].
2.4 Monomorphisms and the Transfer Principle Just as in Chap. 1, where we worked with R and ∗ R, we now will work back and forth between X and its nonstandard extension ∗ X . We will in fact work with the superstructures V (X ) and V (∗ X ) using a “∗-mapping ”, which is a one-to-one mapping from V (X ) into, but not onto, V (∗ X ). The abstraction of the basic properties of the mapping ∗ originates with the work of Robinson and Zakon in [10]. For the moment, we write Y for ∗ X . We assume X and Y are two sets of individuals. We associate the superstructure V (X ) and language L X with X and the superstructure V (Y ) and language LY with Y . Each constant symbol in L X names something in V (X ), and there is at least one such symbol for each entity in V (X ). A similar statement is true for Y . We work with a one-to-one map ∗ from V (X ) into V (Y ). For each a ∈ V (X ), we write ∗ a for ∗(a). In this chapter, we will use the same symbol for ∗ a and for its name. The main results and definitions in this section are Definitions 2.4.1 and 2.4.3 along with Remark 2.4.4, Theorem 2.4.5, and Example 2.4.8. Definition 2.4.1 If is a formula in L X , the ∗-transform of , ∗ , is the formula in LY obtained by replacing each constant c in with ∗ c. Example 2.4.2 The ∗-transform of the sentence that says there is a multiplicative inverse in the real numbers is (∀x ∈ ∗ R)[¬(x = ∗ 0) → (∃y ∈ ∗ R)[ x, y , ∗ 1 ∈ ∗ P]]. Definition 2.4.3 (Robinson–Zakon [10]) The injection ∗ from V (X ) into V (Y ) is called a monomorphism if the following conditions hold.
42
P.A. Loeb
(i) (ii) (iii) (iv) (v)
∗ (∅)
= ∅, where ∅ denotes the empty set. If a ∈ X , then ∗ a ∈ Y . If a has rank n, ∗ a has rank n. If a ∈ ∗ Vn (X ) for n ≥ 1 and b ∈ a, then b ∈ ∗ Vn−1 (X ). (Transfer Principle) For each sentence in L X , if holds in V (X ) then ∗ holds in V (Y ).
Remark 2.4.4 It can be shown (the reader is invited to construct the proof) that Properties (i)–(iv) follow from the Transfer Principle, i.e., Property (v). We have listed them here as separate properties to help in understanding the notion of a monomorphism. We use them in the next section to help with the particular monomorphism constructed there. Property (iv) will be interpreted to say, among other things, that elements of “internal sets” are internal. Given Property (ii), we will assume from now on that ∗ a = a for each individual a ∈ X ; in particular, for n ∈ N, ∗ n = n. That is, we will assume that X ⊆ Y . We will write a for both a ∈ X and ∗ a ∈ Y . The Transfer Principle has the following consequence. Theorem 2.4.5 (Downward Transfer Principle) For each sentence in L X , if ∗ holds in V (Y ) then holds in V (X ). Proof If ¬ holds in V (X ), then ∗ (¬) = ¬(∗ ) holds in V (Y ). We sometimes state the transfer principle as follows: holds in V (X ) if and only if ∗ holds in V (Y ). Recall that the domain of a binary relation P is the set of all x for which there is a y with x, y ∈ P. The range of P is the set of all y for which there is an x with x, y ∈ P. Proposition 2.4.6 We have the following properties of the ∗-mapping. (a) Let a, b, a1 , . . . , an be fixed entities in V (X ). Then (i) (ii) (iii) (iv) (v) (vi) (vii)
∗ {a
∗ ∗ 1 , . . . , an } = { a1 , . . . , an }; ∗ a , . . . , a = ∗ a , . . . ,∗ a ; 1 n 1 n a ∈ b iff ∗ a ∈ ∗ b;
a = b iff ∗ a = ∗ b; a ⊆ b iff ∗ a ⊆ ∗ b; n a ) = ∪n ∗ a , ∗ (∩n a ) = ∩n ∗ a ; For n ∈ N, ∗ (∪i=1 i i=1 i i=1 i i=1 i ∗ (a × a × · · · × a ) = ∗ a × ∗ a × · · · × ∗ a . 1 2 n 1 2 n
(b) If P is a relation on a1 × a2 × · · · × an , then ∗ P is a relation on ∗ a1 × ∗ a2 × · · · × ∗ an . Moreover, if n = 2, and a and b are the domain and range of P, then ∗ a and ∗ b are the domain and range of ∗ P . (c) If f is a function from a into b, then ∗ f is a function from ∗ a into ∗ b, such that ∀c ∈ a, ∗ [ f (c)] = ∗ f (∗ c). If f maps a onto b, ∗ f maps ∗ a onto ∗ b. If f is one-to-one (i.e., injective), so is ∗ f .
2 An Introduction to General Nonstandard Analysis
43
Proof of Part a: (i) Let s = {a1 , . . . , an }, and transform the sentence (∀x ∈ s)[x = a1 ∨· · ·∨x = an ]. Also transform sentences a1 ∈ s, . . . , an ∈ s. (ii) ∗
a1 , . . . , an = ∗ {{{1}, {1, a1 }}, . . . , {{n}, {n, an }} = {∗ {{1}, {1, a1 }}, . . . ,∗ {{n}, {n, an }} = {{∗ {1},∗ {1, a1 }}, . . . , {∗ {n},∗ {n, an }} = {{{1}, {1,∗ a1 }}, . . . , {{n}, {n,∗ an }}.
(iii) and (iv) are clear. (v) Transform (∀x ∈ a)[x ∈ b]. (vi) Left to the reader. (vii) We show ∗ (a × b) = ∗ a × ∗ b. Transform (∀z ∈ (a × b))(∃x ∈ a)(∃y ∈ b)[x, y = z] to show that ∗ (a × b) ⊆ ∗ a × ∗ b. Transform (∀x ∈ a)(∀y ∈ b)(∃z ∈ (a × b))[x, y = z] to show ∗ a × ∗ b ⊆ ∗ (a × b). Proof of Part b: To show ∗ P is a relation on ∗ a1 × ∗ a2 × · · · × ∗ an , transform the sentence (∀x ∈ P)(∃x1 ∈ a1 ) . . . (∃xn ∈ an )[x1 , . . . , xn = x]. Thus we know for n = 2 and a and b the domain and range of P, that ∗ a contains the domain of ∗ P and ∗ b contains the range of ∗ P. To show that ∗ a and ∗ b are the domain and range of ∗ P, transform (∀x ∈ a)(∃y ∈ b)[x, y ∈ P] and (∀y ∈ b)(∃x ∈ a)[x, y ∈ P]. Proof of Part c: Let f be a function from a into b. By the transform of (∀x ∈ a)(∀y ∈ b)(∀z ∈ b)[[x, y ∈ f ∧ x, z ∈ f ] → [y = z]] and Part b, ∗ f is a function from ∗ a into ∗ b. If c, d ∈ f , then ∗ c,∗ d ∈ whence ∀c ∈ a, ∗ [ f (c)] = ∗ f (∗ c). The rest is left to the reader.
∗
f,
When a ∈ X , we will, as already noted, associate a with ∗ a. In general however, as the next example shows, we will have to be more careful. For this and the next example, we assume ∗ is a monomorphism between V (R) and V (∗ R). Example 2.4.7 Let I denote the set of closed and bounded intervals in R. Then I ∈ V2 (R). Moreover, the following sentences are true for V (R):
44
P.A. Loeb
(∀x ∈ I)(∃a, b ∈ R)(∀y ∈ R)[a ≤ y ≤ b ←→ y ∈ x] (∀a, b ∈ R)[a ≤ b → [(∃x ∈ I)(∀y ∈ R)[a ≤ y ≤ b ←→ y ∈ x]] Therefore, ∗ I contains the extensions of standard intervals as well as new ones. For example, if ε 0 is positive, then [ε, 2ε] is in ∗ I but it is not the extension of any standard interval. Even for a standard interval [a, b], with a = b, there are points in ∗ [a, b] not in the original interval [a, b]. Thus we can not directly associate [a, b] and ∗ [a, b]. Example 2.4.8 The Downward Transfer Principle can often be used to avoid arguments by contradiction. For example, to show that sn → L if ∀η ∈ ∗ N∞ , ∗ sη L, we note that for a given ε > 0, the ∗-transform of the sentence = (∃k ∈ N)(∀n ∈ N)[n ≥ k → |sn − L| < ε] is true in V (∗ R); just let k ∈ ∗ N∞ . It follows that holds in V (R). Problem: Assume ∗ is a monomorphism between V (R) and V (∗ R), and use downward transfer to show that f is uniformly continuous on A if ∀x ∈ ∗ A, ∀y ∈ ∗ A with x y, we have ∗ f (x) ∗ f (y). Answer: Fix ε > 0. We want to show the truth of the sentence = (∃δ ∈ R+ )(∀x ∈ A)(∀y ∈ A)[|x − y| < δ → | f (x) − f (y)| < ε]. Now ∗ is true for V (∗ R); just take δ 0. Therefore, is true for V (R).
2.5 Ultrapower Construction of Superstructures and Monomorphisms We now fix V (X ), an index set I , and an ultrafilter U in I . From these we will construct a new superstructure V (∗ X ) from V (X ) and a corresponding monomorphism. We may have I = N, we may even have U fixed at some i 0 ∈ I ; i.e., U ∈ U if and only if i 0 ∈ U . If U is fixed in this way, we will see that we get nothing new. In the next section we will see that by assuming additional properties for I and U we obtain a monomorphism with the desired properties for a nonstandard extension. Because an ultrafilter corresponds to a finitely additive measure on the power set of I , with that measure taking only the values 0 and 1, we say a property holds almost everywhere or a.e. if it holds on some U ∈ U. Given S ∈ V (X ), we write S for the set of all maps from I into S. For each such map a, we write ai for a(i). Two maps a and b are equivalent (with respect to U) and we write a = U b if ai = bi a.e. (that is, ai = bi for all i in some U ∈ U.) The relation = U is an equivalence relation. We write U S for the set of equivalence
2 An Introduction to General Nonstandard Analysis
45
classes, and [a] for the equivalence class containing the mapping a. If b ∈ V (X ), we write b for the constant function bi = b. Let V−1 (X ) denote the empty set. The reader should at least note the following two definitions and related remark. Definition 2.5.1 The bounded ultrapower 0U V (X ) of V (X ) is defined by setting 0U V (X ) := ∪∞ n=0 U [Vn (X ) \ Vn−1 (X )]. We denote by e the mapping from V (X ) into 0U V (X ) defined at each b ∈ V (X ) by e(b) = [ b ]. When [a], [b] ∈ 0U V (X ), we write [a] ∈U [b] if ai ∈ bi a.e. Remark 2.5.2 Recall that 5 is the constant function 5 on I , and [ 5 ] is the corresponding equivalence class. While it is true that [ 5 ] ∈U e(N), the relation ∈U is not the set membership relation we want. We need another map “M” so that we can replace e(N) in 0U V (X ) with the set of numbers M(e(N)) = {[r ] ∈ U X : ri ∈ N a.e.} = {[r ] ∈ U X : [r ] ∈U [ N ]}. Similarly, e(P(N)) = [ P(N) ] is the equivalence class formed from the sequence P(N), P(N), . . . , P(N), . . .. This, however, is not a collection of sets of numbers. While it is true that [ N ] ∈U [ P(N) ], this is not the set membership we want. Once we have used the map M at the level 1 to get true sets of numbers, we will then use M to replace [ P(N) ] with a true collection of sets of numbers, M(e(P(N))). In particular, the set ∗ N = M(e(N)), which we will think of as the set of nonstandard natural numbers, will be a member of the collection of sets M(e(P(N))) in the usual sense. Definition 2.5.3 Let ∗ X = U X = U V0 (X ), and let V (∗ X ) be the associated superstructure built on the set of individuals ∗ X . The Mostowski Collapsing Function M is a mapping of 0U V (X ) into V (∗ X ) defined by induction on the level n as follows: (i) For each element [a] ∈ U V0 (X ) = ∗ X , M([a]) = [a]. (ii) Given [b] ∈ U [Vn (X )\Vn−1 (X )], n ≥ 1, we set M([b]) = {M([a]) : [a] ∈ ∪n−1 k=0 U [Vk (X )\Vk−1 (X )] and [a] ∈U [b]}. We finish this section by showing that the map ∗ = M ◦ e : V (X ) → V (∗ X ) is a monomorphism. On first reading, the reader may wish to skip the following technical proofs and go on to the next section. Proposition 2.5.4 We have the following properties for ∗, e, and M: (i) e and M are 1:1 maps, so ∗ = M ◦ e is a 1:1 map of V (X ) into V (∗ X ). (ii) e maps X into ∗ X , and the restriction M|∗ X is the identity map (by definition). (iii) e(X ) = [ X ] (by definition), and M([ X ]) = ∗ X , so ∗(X ) = ∗ X .
46
P.A. Loeb
(iv) If ∅ is the empty set, then for no [a] is it true that [a] ∈U e(∅) = [ ∅ ], so ∗(∅) = M(e(∅)) = ∅. (v) a ∈ b in V (X ) iff e(a) ∈U e(b); [a] ∈U [b] iff M([a]) ∈ M([b]). (vi) For n ≥ 1, e maps Vn (X )\Vn−1 (X ) into U [Vn (X )\Vn−1 (X )] and M maps U [Vn (X )\Vn−1 (X )] into Vn (∗ X )\Vn−1 (∗ X ). It follows that if a has rank n ≥ 0, ∗(a) has rank n. (vii) If M([b]) ∈ ∗(Vn (X )) and M([a]) ∈ M([b]), then M([a]) ∈ ∗(Vn−1 (X )). Proof (i) If a = b, then ∀i ∈ I , a i = bi , so e(a) = [ a ] = [ b ] = e(b). Therefore, e is 1:1. To show M is 1:1, assume [a] = [b]. Since M is the identity map on ∗ X , if either [a] or [b] is in ∗ X , M([a]) = M([b]). Otherwise, ∃U ∈ U such that either ai \bi = ∅ ∀i ∈ U or bi \ai = ∅ ∀i ∈ U ; assume the latter. Then ∃ [c] / M([a]), so such that ci ∈ bi \ai a.e. Therefore, M([c]) ∈ M([b]), but M([c]) ∈ M([a]) = M([b]). Thus M is 1:1. (ii), (iii), (iv), and (v) are clear. (vi) By definition, if [a] ∈ U V0 (X ) = ∗ X , then M([a]) = [a] ∈ V0 (∗ X ) = ∗ X . Fix n ≥ 1, and assume that for each k < n, if [b] ∈ U [Vk (X )\Vk−1 (X )], then M([b]) ∈ Vk (∗ X )\Vk−1 (∗ X ). Given [b] ∈ U [Vn (X )\Vn−1 (X )] and M([a]) ∈ M([b]), we have [a] ∈ ∪n−1 k=0 U [Vk (X )\Vk−1 (X )], so by assumption, M([a]) ∈ Vn−1 (∗ X ). Moreover, ∃[c] such that ∀i ∈ I , ci ∈ Vn−1 (X )\Vn−2 (X ) and ci ∈ bi . Therefore, M([c]) ∈ Vn−1 (∗ X )\Vn−2 (∗ X ), and thus, M([b]) ∈ Vn (∗ X )\Vn−1 (∗ X ). (vii) Assume M([b]) ∈ ∗(Vn (X )) and M([a]) ∈ M([b]), then [b] ∈U e(Vn (X )), and [a] ∈U [b]. Therefore, there is a set U ∈ U such that ∀i ∈ U , ai ∈ bi ∈ Vn (X ). For these same i, ai ∈ Vn−1 (X ), whence [a] ∈U e(Vn−1 (X )), so M([a]) ∈ ∗(Vn−1 (X )). Now, except for the transfer principle, we have shown that ∗ = M◦e is a monomorphism from V (X ) into V (∗ X ). We will write ∗ a for ∗(a). The next proposition is used to establish the transfer principle. Proposition 2.5.5 Let [a], [a 1 ], . . . , [a n ], [b], and [c] be elements of the bounded ultrapower 0U V (X ); here, any or all of these may be of the form e(d) = [ d¯ ]. (i) (ii) (iii) (iv)
M([a]) (= or ∈) M([c]) iff ai (= or ∈) ci a.e. {M([a 1 ]), . . . , M([a n ])} (= or ∈) M([c]) iff {ai1 , . . . , ain } (= or ∈) ci a.e. M([a 1 ]), . . . , M([a n ]) (= or ∈) M([c]) iff ai1 , . . . , ain (= or ∈) ci a.e. M([a 1 ]), . . . , M([a n ]) , M([b]) (= or ∈) M([c]) iff ai1 , . . . , ain , bi (= or ∈) ci a.e.
Proof We will assume that n = 2 for the proof of (ii) and (iii). (i) (for =) Since M is 1:1, M([a]) = M([c]) iff [a] = [c] iff ai = ci a.e. (i) (for ∈) M([a]) ∈ M([c]) iff [a] ∈U [c] iff ai ∈ ci a.e. (ii) (for =) Assume {ai , bi } = ci a.e. Then
2 An Introduction to General Nonstandard Analysis
47
M([c]) = {M([y]) : yi ∈ {ai , bi } a.e.} = {M([y]) : yi = ai a.e.} ∪ {M([y]) : yi = bi a.e.} = {M([a]), M([b])}.
(ii)
(iii)
(iii) (iv)
Conversely, if M([c]) = {M([a]), M([b])}, then ai ∈ ci a.e. and bi ∈ ci a.e. If di ∈ ci a.e. then either di = ai a.e. or di = bi a.e.; that is, ci has only two points a.e. Therefore, ci = {ai , bi } a.e. (for ∈) Choose representatives for [a] and [b], and let di = {ai , bi } ∀i ∈ I . Then M([d]) = {M([a]), M([b])}. Therefore, {ai , bi } ∈ ci a.e. iff di ∈ ci a.e. iff M([d]) ∈ M([c]) iff {M([a]), M([b])} ∈ M([c]). (for =) Choose representatives for [a] and [b], and ∀i ∈ I , let di = {{1}, {1, ai }} and ei = {{2}, {2, bi }}. By Part ii, M([d]) = {{M([ 1 ]}, {M([ 1 ]), M([a])}} = {{1}, {1, M([a])}} since M([ 1 ]) = 1. A similar result holds for M([e]). Again by Part (ii), ai , bi = ci a.e. iff {di , ei } = ci a.e. iff {M([d]), M([e])} = M([c]) iff M([a]), M([b]) = M([c]). (for ∈) This is the same as ((ii) ∈) with { } replaced with . Apply (iii) to di , bi and M([d]), M([b]), where di = ai1 , . . . , ain a.e., so M([d]) = M([a 1 ]), . . . , M([a n ]) .
Notation. If (x1 , . . . , xn ) is a formula with variables x1 , . . . , xn , either free in or not appearing in and c1 , . . . , cn are constants, then (c1 , . . . , cn ) is with each xi appearing in replaced by ci . To establish the transfer principle for ∗, we need a theorem of Ł˘os (pronounced “Wash”). Theorem 2.5.6 (Ł˘os) Let (x1 , . . . , xn ) be a formula in the language L X with x1 , . . . , xn a set of variables containing all of the free variables in . Fix [a 1 ], . . . , [a n ] in 0U V (X ). Then ∗ (M([a 1 ]), . . . , M([a n ])) holds in V (∗ X ) iff (ai1 , . . . , ain ) holds in V (X ) for almost all i ∈ I . Remark 2.5.7 Note that the previous proposition has established the result for atomic formulas. For example, if (x, y) is the formula x ∈ y, then M([a]) ∈ M([c]) iff ai ∈ ci a.e. If (x) is the formula x ∈ N , then M([a]) ∈ ∗ N = M([ N ]) iff ai ∈ N a.e. If (x1 , . . . , xn , y) is the formula {x1 , . . . , xn , 5, A} ∈ y, where A is a standard set, then we have {M([a 1 ]), . . . , M([a n ]), M([ 5 ]), M([ A ])} ∈ M([c]) iff {ai1 , . . . , ain , 5, A} ∈ ci a.e. Proof of Ł˘os’ Theorem. The proof is by an induction argument similar to the induction used in the construction of formulas. Remember, we are establishing an equivalence; i.e., one sentence holds for V (∗ X ) iff related sentences indexed by i ∈ I hold a.e. for V (X ). (1) The previous proposition has established the equivalence for atomic formulas. (2) Assume the equivalence has been established for the formulas (x1 , . . . , xn ) and (x1 , . . . , xn ). Given this assumption, we establish the equivalence for ¬, and
48
P.A. Loeb
∧ . This will also establish the equivalence for ∨ = ¬(¬ ∧ ¬), → = ¬ ∨ , and ←→ = [ → ] ∧ [ → ]. For ¬, we have ∗
(¬)(M([a 1 ]), . . . , M([a n ])) = ¬(∗ )(M([a 1 ]), . . . , M([a n ])).
/ U iff {i ∈ The latter is true in V (∗ X ) iff {i ∈ I : (ai1 , . . . , ain ) holds} ∈ I : ¬(ai1 , . . . , ain ) holds} ∈ U since U is an ultrafilter. (Note we need an equivalence here, not just a.e. → ∗ .) For ∧ , note that the following are equivalent: ∗ ( ∧ )(M([a 1 ]), . . . , M([a n ])) ∗
(M([a 1 ]), . . . , M([a n ])) ∧ ∗ (M([a 1 ]), . . . , M([a n ]))
{i : (ai1 , . . . , ain ) holds} ∈ U and {i : (ai1 , . . . , ain ) holds} ∈ U {i : (ai1 , . . . , ain ) holds} ∩ {i : (ai1 , . . . , ain ) holds} ∈ U {i : ( ∧ )(ai1 , . . . , ain ) holds} ∈ U. We have used the fact that a superset of a set in U is in U. (3) Assume we have the equivalence for (x1 , . . . , xn , z, y), and d is a constant and z a variable that either does not appear in or is free in . We will establish the result for (∃y ∈ d) and (∃y ∈ z). This will give the result since (∀y ∈ d) = ¬(∃y ∈ d)¬ and (∀y ∈ z) = ¬(∃y ∈ z)¬. For (∃y ∈ z), we must fix [a 1 ], . . . , [a n ], [c] ∈ 0U V (X ) and then show that (∃y ∈ M([c]))∗ (M([a 1 ]), . . . , M([a n ]), M([c]), y) holds in V (∗ X ) if and only if (∃y ∈ ci )(ai1 , . . . , ain , ci , y) holds in V (X ) for almost all i ∈ I . (The proof of (∃y ∈ d) is a special case of this where we replace M([c]) with M([ d ]) and ci with d; i.e., the constant sequence d replaces c.) Assume that (∃y ∈ M([c]))∗ (M([a 1 ]), . . . , M([a n ]), M([c]), y) holds in V (∗ X ). Then there is an M([a]) such that [(M([a]) ∈ M([c])] ∧ [∗ (M([a 1 ]), . . . , M([a n ]), M([c]), M([a]))] holds in V (∗ X ), so {i ∈ I : (ai ∈ ci ) ∧ (ai1 , . . . , ain , ci , ai ) holds} ∈ U. Therefore, the larger set {i ∈ I : (∃y ∈ ci )(ai1 , . . . , ain , ci , y) holds} ∈ U.
2 An Introduction to General Nonstandard Analysis
49
To show the converse, assume there is a set U0 ∈ U such that U0 = {i ∈ I : (∃y ∈ ci )(ai1 , . . . , ain , ci , y)}. For each i ∈ I , pick an element ai ∈ ci , but make the choice so that for all i ∈ U0 , (ai1 , . . . , ain , ci , ai ) holds. There is a U1 ∈ U such that for some n ∈ N and all i ∈ U1 , ai ∈ Vn (X ) − Vn−1 (X ). Choose any α ∈ Vn (X )\Vn−1 (X ) and / U1 . Then for this sequence a = ai : i ∈ I , replace ai with α for i ∈ {i ∈ I : (ai ∈ ci ) ∧ (ai1 , . . . , ain , ci , ai ) holds} ⊇ U0 ∩ U1 ∈ U. Therefore, [(M([a]) ∈ M([c])] ∧ [∗ (M([a 1 ]), . . . , M([a n ]), M([c]), M([a]))] holds in V (∗ X ). If follows that (∃y ∈ M([c]))∗ (M([a 1 ]), . . . , M([a n ]), M([c]), y) holds in V (∗ X ). (4) The theorem now follows by induction. Theorem 2.5.8 The map ∗ : V (X ) → V (∗ X ) defined by ∗ = M ◦ e is a monomorphism. Proof It only remains to show that if is a sentence in L X that is true for V (X ), then is true for V (∗ X ). Since is a sentence, has no free variables, only constants and bound variables. Since is true for all i ∈ I , ∗ is true for V (∗ X ).
∗
Problem: Recall that given [a], [b] ∈ 0U V (X ), we write [a] ∈U [b] if ai ∈ bi a.e. Show that this relation is well-defined, that is, that it is independent of the choice of representative from [a] and [b]. Answer: Assume ai and ai represent [a] and bi and bi represent [b]. Also assume there is a set U ∈ U such that ∀i ∈ U ai ∈ bi . We know that there are sets V and W ai , while for all i ∈ W we have bi = bi . in U such that for all i ∈ V we have ai = bi . Now U ∩ V ∩ W is in U, and for all i in this set, ai ∈ Problem: Given a mapping a from I into Vn (X ), show that for some k ≤ n, ai ∈ Vk (X )\Vk−1 (X ) a.e. Answer: For each k ≤ n, let Ik = {i ∈ I : ai ∈ Vk (X )\Vk−1 (X )}. Then I is the disjoint finite union of the sets Ik , 1 ≤ k ≤ n, so one and only one of the sets Ik is in U.
50
P.A. Loeb
2.6 Special Index Sets Yielding Enlargements We have shown how to construct a monomorphism ∗ using a superstructure V (X ), an index set I , and an ultrafilter U. To get more, however, we need additional assumptions. The construction of an enlargement starting with the material after Example 2.6.5 and ending with Theorem 2.6.7 can be omitted on first reading. First we note that if U is not free, then U is fixed at some i 0 ∈ I ; i.e., the singleton set {i 0 } ∈ U. In this case, every sequence a is equivalent to the constant sequence a i0 since ai = ai0 a.e. Therefore, ∗ X = X and we get nothing new. We assume from now on that the ultrafilter U is free; i.e., for every i ∈ I , the set {i} ∈ / U. Definition 2.6.1 All entities in V (X ) and entities in V (∗ X ) of the form ∗ b for b ∈ V (X ) are called standard. Example 2.6.2 The sets [0, 1] and ∗ [0, 1] are standard entities even though ∗ [0, 1] contains nonstandard numbers. Note that in interpreting a sentence ∗ , the only entities α that arise are related by a finite ∈ chain to a standard entity ∗ b. Such an entity α is of the form M([a]). There are, however, entities in V (∗ X ) that are not of this form. An example is the set N. We will show that if Ai is a sequence of sets such that for each j ∈ N, the equivalence class containing the constant sequence j is in Ai for all i in some element of the ultrafilter, then the equivalence class [Ai ] contains unlimited natural numbers. We now consider “hyperfinite” sets; these are extremely important for the applications of nonstandard analysis. Definition 2.6.3 For each A ∈ V (X )\X , let P F (A) denote the finite subsets of ∗ A. The collection of hyperfinite or ∗-finite sets in V (∗ X ) is ∪∞ n=0 P F (Vn (X )) = ∗ ∪{ P F (A) : A ∈ V (X )\X }. Definition 2.6.4 Given a superstructure V (X ) and a monomorphism ∗, we say that V (∗ X ) is an enlargement of V (X ) if for each set A ∈ V (X ) there is a set B ∈ ∗ P (A) such that for every a ∈ A, ∗ a ∈ B, i.e., B contains all of the standard F entities in ∗ A. It follows from the transfer principle that if A is not a finite set, then there are elements of ∗ A that are not in B. Example 2.6.5 For η ∈ ∗ N∞ , the “initial segment” {1, 2, . . . , η} is a hyperfinite set; it contains N. Fix V (X ). We now construct an index set J and an ultrafilter U on J such that the corresponding superstructure V (∗ X ) is an enlargement of V (X ). Since X is an infinite set (containing N), it will follow that ∗ X = X . Let J be the collection of all nonempty finite sets belonging to V (X ). Note that each element of J is in Vn (X ) for some n. For each a ∈ J , let Ja = {b ∈ J : a ⊆ b}. Let F be the collection of all subsets of J such that for each A ∈ F there is an a ∈ J with Ja ⊆ A. Proposition 2.6.6 The collection F is a free filter on J .
2 An Introduction to General Nonstandard Analysis
51
Proof For each A ∈ F there is an a ∈ J with a ∈ Ja ⊆ A, so A = ∅. Given A and B in F and a, b ∈ J , with Ja ⊆ A and Jb ⊆ B, Ja ∩ Jb = Ja∪b ⊆ A ∩ B, and any subset of J containing a set in F is in F. Therefore, F is a filter. To show F is free, fix a ∈ J and find some b ∈ J with a ∩ b = ∅. Then Jb itself is in F, and the set a is not in Jb . Now use Zorn’s Lemma to obtain a free ultrafilter U on J such that U ⊃ F. Note that for each a ∈ J , Ja ∈ U. Theorem 2.6.7 If V (∗ X ) is constructed from V (X ) using J and U, then it is an enlargement of V (X ). Proof Let A be a nonempty set belonging to V (X ). Choose an a0 ∈ A. Define a map : J → P F (A) by setting a = (a ∩ A) ∪ {a0 } for each a ∈ J . Since A ∈ Vm (X ) for some m ∈ N, there is an n ∈ N and a set U0 ∈ U such that a has rank n for all / U0 . Let B = M([]). a ∈ U0 . Choose any a1 ∈ U0 , and replace a with a1 for a ∈ Then B ∈ ∗ P F (A) since ∀a ∈ J , a ∈ P F (A). Fix c ∈ A. We must show that ∗ c ∈ B. Since the singleton {c} is a finite subset of A, J {c} ∈ U, so c ∈ a for all a ∈ J{c} ∩ U0 , that is, a.e. Therefore, ∗ c ∈ B. Definition 2.6.8 A binary relation P is concurrent or finitely satisfiable on a set A contained in its domain if for each n ∈ N and each finite set {x1 , . . . , xn } ⊆ A there is a y in the range of P such that xi , y ∈ P for 1 ≤ i ≤ n. A relation P is concurrent if it is concurrent on all of its domain. Example 2.6.9 The relations ≤ in N and ⊆ in P F (N) are concurrent relations. Concurrent relations are of interest because of the following property. Theorem 2.6.10 Given X and a monomorphism ∗, the following are equivalent: (i) V (∗ X ) is an enlargement of V (X ). (ii) Given any concurrent relation P ∈ V (X ), there is an element c in the range of ∗ P such that ∗ a, c ∈ ∗ P for every a in the domain of P. Proof (i→ii) Let A be the domain of P, and let B ⊆ ∗ A be a hyperfinite set containing for each a ∈ A. By transfer of the concurrency condition for P, there is a c in the range of ∗ P such that b, c ∈ ∗ P for each b ∈ B, in particular, ∗ a, c ∈ P for each a ∈ A. (ii→i) Fix a set A ∈ V (X ). Since ⊆ in P F (A) is a concurrent relation, there is a hyperfinite set B that contains the extension of every standard finite subset of A. In particular, ∀a ∈ A, ∗ {a} = {∗ a} ⊂ B, so ∗ a ∈ B. ∗a
Corollary 2.6.11 If A is an infinite set in V (X ) and V (∗ X ) is an enlargement, then there is a nonstandard b ∈ ∗ A.
52
P.A. Loeb
Proof The relation = is concurrent in A. Remark 2.6.12 The results of the last chapter are valid for an enlargement of a superstructure V (X ) when X contains R. Problem: Assume {Oα : α ∈ A} is an open covering of S ⊆ R with no finite subcovering. Show that there is a point b ∈ ∗ S such that b is not in the monad of any x ∈ S. Answer: The relation P such that Oα , y ∈ P if y ∈ S\Oα is concurrent, so ∃b ∈ ∗ S such that b ∈ ∗ S\∗ Oα ∀α ∈ A. If x ∈ S, then x ∈ Oα for some α, and so / m(x) for any x ∈ S. m(x) ⊆ ∗ Oα . It follows that b ∈ Problem: Let A be a collection of sets with A ∈ V (X ). Assume A has the finite intersection property. That is, the intersection of any finite number of elements of A is not empty. Suppose that V (∗ X ) is an enlargement. Show that the intersection ∗ monad μ(A) := a∈A a is not empty. Answer: Take B ⊆ a hyperfinite ∗ a. b ⊆ b∈B a∈A
∗A
with ∗ a ∈ B for each a ∈ A. Then ∃y ∈
2.7 A Result in Infinite Graph Theory As an application of the existence of an enlargement, we give an easy proof of a result of de Bruijn and Erd˝os [3]. Definition 2.7.1 A graph (A, E) consists of a set A of “vertices” and a binary, symmetric relation E on A × A. If x, y ∈ E, we say that x and y are connected by an edge. The graph (A, E) is k-colorable if there is a map f : A → {1, . . . , k} (the set of k colors) such that if a, b ∈ E, then f (a) = f (b). If B ⊆ A and E|B is the restriction of the relation E to B × B, then (B, E|B) is called a subgraph of A. The cardinality of a graph (A, E) is that of the set A. Theorem 2.7.2 (de Bruijn and Erd˝os) If each finite subgraph of an infinite graph is k-colorable, then the graph itself is k-colorable. Proof Let (A, E) be the infinite graph, and let F denote the set of all finite subsets of A. The following sentence, given here in shorthand, holds for the original superstructure (∀F ∈ F)(∃g : F → {1, . . . , k})(∀x, y ∈ F)[x, y ∈ E → g(x) = g(y)]. Let B be a hyperfinite subset of ∗ A such that ∀a ∈ A, ∗ a ∈ B. Then B ∈ ∗ F, so ∃g : B → {1, . . . , k} such that ∀x, y ∈ B, if x, y ∈ ∗ E, then g(x) = g(y). In particular, ∀ a, b ∈ A, if a, b ∈ E, then ∗ a,∗ b ∈ ∗ E, so g(∗ a) = g(∗ b). Let f denote the restriction of g to A; that is, f (a) = g(∗ a). Then f is a k-coloring of A.
2 An Introduction to General Nonstandard Analysis
53
2.8 Internal and External Sets In this section we make the important distinction between internal and external objects in V (∗ X ). We also establish some additional properties that will be used in applications of nonstandard analysis. The reader may wish to skip over the proofs of Theorems 2.8.4 and 2.8.11 on first reading. Definition 2.8.1 An entity a in V (∗ X ) is called internal if for some standard set b ∈ V (X ), a ∈ ∗ b. All other entities in V (∗ X ) are called external. This means that the internal entities are the elements of standard entities. Of course, if b ∈ V (X ), then b ∈ Vn+1 (X ) for some n, so if a ∈ ∗ b, then a ∈ ∗ Vn (X ). Thus internal entities are elements of ∗ Vn (X ) for some n. On the other hand, suppose that b is internal but not a standard entity, and that a ∈ b. Then b ∈ ∗ Vn+1 (X ) for some n, so by transfer of the sentence (∀y ∈ Vn+1 (X ))(∀x ∈ y)[x ∈ Vn (X )], it follows that a ∈ ∗ Vn (X ), whence a is internal. In interpreting the transfer ∗ of a sentence , only constants naming standard objects are used, so only internal entities come up in the interpretation. If a ∈ ∗ b, then we can obtain information about a by transferring sentences of the form (∀x ∈ b)[· · · ]. If a is external, however, then the transfer principle does not yield information in this way about a. Example 2.8.2 To show that the set N is external in V (∗ X ), let us suppose the contrary, which means that N ∈ ∗ P(N). Then the set ∗ N\N = ∗ N∞ is also internal by transfer of the sentence (∀A ∈ P(N))[N\ A ∈ P(N)]. It follows by transfer of the sentence (∀A ∈ P(N))[A = ∅ → (∃m ∈ A)(∀k ∈ A)[m ≤ k]], that there is a first element m in ∗ N∞ . In this case, m − 1 is the last element of N, which is impossible. This contradiction is a proof that N is external. For applications of the Transfer Principle, it is clearly important to know when an entity in V (∗ X ) is internal. We have already given the proof for the following criterion. ∗ Theorem 2.8.3 The set of internal elements of V (∗ X ) is the set ∪∞ n=0 Vn (X ).
This result is not much help in determining when a set is internal. The next result is considerably more useful. Recall that L∗ X is the language for V (∗ X ). A formula in L∗ X is called standard if all of the constants are names of standard entities; it is called internal if all of the constants are names of internal entities.
54
P.A. Loeb
Theorem 2.8.4 (Keisler’s Internal Definition Principle) Let (x) be an internal formula in L∗ X for which x is the only free variable. Let A be an internal set. Then the set {a ∈ A : (a) holds in V (∗ X )} is internal. Proof Let c1 , . . . , cn be the constants in (x); denote by (c1 , . . . , cn , x). Fix k ∈ N so that A, c1 , . . . , cn are all in ∗ Vk (X ). The sentence in L X (∀x1 , . . . , xn , y ∈ Vk (X ))(∃z ∈ Vk+1 (X ))(∀x ∈ Vk (X )) [x ∈ z ←→ [x ∈ y ∧ (x1 , . . . , xn , x)]] holds in V (X ). Its transfer says that {a ∈ A : (a) holds} ∈ ∗ Vk+1 (X ). Theorem 2.8.5 If A and B are internal, so are A ∪ B, A ∩ B, A\B, A × B. Proof For ∪, assume that A, B ∈ ∗ Vn+1 (X ) and transfer (∀W, Y ∈ Vn+1 (X ))(∃Z ∈ Vn+1 (X ))(∀x ∈ Vn (X )) [x ∈ Z ←→ x ∈ W ∨ x ∈ Y ]. For ∩, replace ∨ with ∧. For \ replace x ∈ W ∨ x ∈ Y with x ∈ W ∧ x ∈ / Y . The proof for × is left to the reader. We have already shown that N and ∗ N∞ are external. As a consequence, we have the following result, where Z denotes the integers. Theorem 2.8.6 In an enlargement of a structure V (X ) with R ⊆ X , the sets N, ∗ N , R, Z, ∗ Z , ∗ R , m(0) are all external. ∞ ∞ ∞ Proof It follows from the fact that N and ∗ N∞ are external that Z and ∗ Z∞ are also external. Since Z = R∩ ∗ Z, R is external. Since ∗ N∞ = ∗ R∞ ∩ ∗ N, ∗ R∞ is external. Since for x = 0, x ∈ m(0) iff 1/x ∈ ∗ R∞ , m(0) is external. Remark 2.8.7 One should not think that external entities are “bad” in any sense. They are just not the subject of the transfer principle. A review of the last chapter shows the utility of such external objects as m(0), ∗ N∞ , and the standard part map. Problem: Recall that P F denotes the finite power set operation. Show that in general, P F (∗ A) ⊆ ∗ P F (A), but ∗ P(A) ⊆ P(∗ A). Answer: A truly finite subset of ∗ A is internal, so it is in ∗ P F (A). If, for example, the set has three elements, then the following sentence is true by transfer (∀x ∈ ∗ A)(∀y ∈ ∗ A)(∀z ∈ ∗ A)(∃w ∈ ∗ P F (A))[{x, y, z} = w]. Thus P F (∗ A) ⊆ ∗ P F (A). Not every hyperfinite set is finite, so the inclusion does not go the other way. If S ∈ ∗ P(A), then by the transfer principle, ∀s ∈ S, s ∈ ∗ A,
2 An Introduction to General Nonstandard Analysis
55
so S ∈ P(∗ A). Since external subsets of ∗ A are not in ∗ P(A), we can only say that ∗ P(A) ⊆ P(∗ A). Problem: It was shown in the last chapter that (∗ R, ∗ +, ∗ ·, ∗ <) forms an ordered field extension of the real number system. Use the transfer principle to show that it is complete with respect to internal sets. That is, if an internal set has an upper bound in ∗ R, it has a least upper bound in ∗ R. Problem: Use the transfer principle to show the following about the ordered field (∗ R, ∗ +, ∗ ·, ∗ <): (1) Each internal non empty set B ⊆ ∗ N has a smallest element with respect to ∗ <. (2) (Internal Transfinite Induction) For each internal B ⊆ ∗ N, the following implication holds: 1 ∈ B and ∀x(x ∈ B → x + 1 ∈ B) → B = ∗ N. Here is an additional property of monomorphisms that allows one to use the transfer principle for certain internal sets. Definition 2.8.8 A monomorphism ∗ is comprehensive if for any sets C, D in V (X ) and any map h : C −→ ∗ D, there is an internal map H : ∗ C −→ ∗ D such that H (∗ a) = h(a) for each a ∈ C. A monomorphism ∗ is called denumerably comprehensive if it is comprehensive with the restriction that C must be a countable set in V (X ). Proposition 2.8.9 A monomorphism ∗ is denumerably comprehensive if and only if any ordinary sequence {An : n ∈ N} from an internal, but not necessarily standard, set S can be extended to an internal sequence {An : n ∈ ∗ N} in S. Proof Suppose ∗ is a denumerably comprehensive monomorphism. Let C = N, and let {An : n ∈ N} be an ordinary sequence of elements taken from an internal set S. Recall that each An must then be internal. For some k, we have S ∈ ∗ Vk (X ), so there is an internal sequence {An : n ∈ ∗ N} that extends the original sequence and takes / S}, there must be a values in ∗ Vk (X ). If we consider the internal set {n ∈ ∗ N: An ∈ first element n 0 , which must be unlimited. By setting An = An 0 −1 for all n ≥ n 0 , we may assume that An ∈ S for all n ∈ ∗ N. For the converse, we note that if C is countably infinite, then there is an enumeration {cn : n ∈ N} of C. That enumeration has a nonstandard extension {cn : n ∈ ∗ N}. The composition cn → n → An , n ∈ ∗ N, gives the desired extension of the mapping cn → n → An , n ∈ N. Remark 2.8.10 Starting with [5] and then [1], the property of denumerable comprehensiveness has played a central role in the application of nonstandard analysis to measure theory. The next result applies in particular to the enlargement defined in Theorem 2.6.7. Theorem 2.8.11 Monomorphisms constructed using ultrapowers are comprehensive.
56
P.A. Loeb
Proof Let U be an ultrapower with index set I . Fix sets C, D in V (X ) and a map h : C → ∗ D. For each element M([b]) ∈ ∗ D, let S(M([b])) be a representative element of the equivalence class [b]. We may assume that S(M([b]))(i) ∈ D ∀i ∈ I . Now for each i ∈ I , let ki be the mapping from C into D given by ki = {a, S(h(a))(i) : a ∈ C} . There is an n ∈ N and a set U in the ultrafilter such that ∀i ∈ U , ki has rank n. / U . Let [k] denote the equivalence Pick some i 0 ∈ U , and let ki = ki0 for i ∈ class containing k. For each i ∈ I , ki is a function from C into D, so H = M([k]) is an internal function from ∗ C into ∗ D. We need only show that H (∗ α) = h(α) for all α ∈ C. Fix α ∈ C and recall that ∗ α = M([ α ]) and h(α) is an element M([b]) ∈ ∗ D. By definition, H (∗ α) = M([c]), where ci = ki (αi ) = S(h(αi ))(i) = S(h(α))(i) = bi a.e., so H (∗ α) = h(α). Here is an important principle for the applications of nonstandard analysis. It uses the externality of R and N in V (∗ X ) to obtain information about internal subsets of ∗ R. Theorem 2.8.12 (Spillover Principle) Let A be an internal subset of ∗ R. (i) If A contains all standard natural numbers, then A contains all elements of ∗ N less than some unlimited natural number. (ii) If A contains all unlimited natural numbers, then A contains all elements of ∗ N greater than some standard natural number. (iii) If A contains the positive infinitesimals, then A contains all elements of ∗ R+ smaller than some standard positive real number. (iv) Assume that for each unlimited natural number H there exists an unlimited natural number K < H such that K ∈ A. Then A contains a standard natural number. Proof (i) Since A is internal, we cannot have A = N. If ∗ N\A is not empty, it has a first element, which must be unlimited. (ii) Here, ∗ N\A is bounded above by an unlimited integer, so it has a least upper bound M, which must be limited. Let n be the first integer strictly bigger than M. It follows that A contains all elements of ∗ N greater than n. (iii) Let B be the set {n ∈ ∗ N : ∀x with 0 < x < 1/n , x ∈ A}. Then B is internal and contains ∗ N∞ , so it contains some finite m. (iv) Since the set A ∩ ∗ N is internal and non-empty, it contains a smallest element k, which must, by assumption, be limited. Here is a very useful corollary of the Spillover Principle. Abraham Robinson said he wanted this principle written on his tombstone, but it isn’t.
2 An Introduction to General Nonstandard Analysis
57
Theorem 2.8.13 (Robinson’s Sequential Lemma) Let sn : n ∈ ∗ N be an internal sequence in ∗ R such that sn 0 for all n ∈ N. Then for some η ∈ ∗ N∞ , sn 0 for all n ≤ η. Proof Let A = {n ∈ ∗ N : |sn | < 1/n}. Then A is internal and contains N, so it contains all elements of ∗ N smaller than some unlimited η. Therefore, sn 0 for all unlimited n ≤ η, and we already know that sn 0 for all limited n. Remark 2.8.14 This fact does not go the other way: sn = 1/n is infinitesimal for all unlimited n, but it is not infinitesimal for any limited n. Robinson used his lemma in [8] to verify his construction of Banach limits. That construction, given below, has been extended to vector valued sequences by the author and Horst Osswald in [6]. Definition 2.8.15 Let ∞ denote the set of standard bounded real-valued sequences. A linear map L : ∞ → R is called a Banach limit if for each σ ∈ ∞ , L(σ) is a value between the lim inf σ and the lim sup σ and L(σ) = L(T (σ)) where T (σ)(n) = σ(n + 1). Robinson’s nonstandard construction of a Banach limit picks η ∈ ∗ N∞ and sets L η (σ) = st
η 1 ∗ σ(n) . η n=1
η
Here, n=1 is the nonstandard extension, evaluated at η, of the usual summation operator that sums a sequence from 1 to k. Theorem 2.8.16 For any η ∈ ∗ N∞ , L η is a Banach Limit. Proof The map L η is clearly linear. The sum of any finite set of limited numbers divided an unlimited integer is infinitesimal. Moreover, given any ε > 0, a bounded sequence, after a finite number of terms, takes values between its lim inf −ε and its lim sup +ε. Therefore, for all limited m ∈ N, η η 1 1 ∗ σ(n) − η η−m n=1
n=m+1
∗ σ(n)
η η m 1 1 1 ∗ ∗ ∗ ≤ σ(n) − σ(n) + σ(n) η η−m η−m n=1
n=1
η m 1 ∗ σ(n) 0. η − m η n=1
n=1
58
P.A. Loeb
It follows that for any σ ∈ ∞ and any ε > 0, lim inf(σ)−ε ≤ L η (σ) ≤ lim sup(σ)+ ε, whence the inequality is true ε = 0. It is clear that shifting a bounded sequence
with η σ to the left by 1 changes η1 n=1 ∗ σ(n) by only an infinitesimal amount, and thus does not change the value of L η (σ).
2.9 Saturation We will need one more general property of monomorphisms when dealing with mathematical objects such as Banach spaces and topological spaces. It is a useful “compactness” property. Fix an uncountable cardinal number κ. Let us say that a set A is κ-small if its cardinal number satisfies the inequality card(A) < κ. Recall that a binary relation P is concurrent or finitely satisfiable on a set A contained in its domain if for each n ∈ N and each finite set {x1 , . . . , xn } ⊆ A there is a y in the range of P such that xi , y ∈ P for 1 ≤ i ≤ n. Definition 2.9.1 A nonstandard superstructure V (∗ X ) is κ -saturated if for each internal binary relation P ∈ V (∗ X ) and each κ-small subset A (internal or external) of the domain of P such that P is concurrent on A there is an element b in the range of P such that a, b ∈ P for each a ∈ A. For κ-saturation, the cardinal number κ should be determined by V (X ); it must not depend on objects in V (∗ X ), because these can change depending on the monomorphism. It is sufficient, therefore, to fix κ as the first cardinal number larger than the cardinality of the original superstructure V (X ). One then says that V (∗ X ) is polysaturated. Horst Osswald presents a construction of polysaturated models in the appendix, i.e., the next section, of this chapter. A construction of saturated models can also be found in Stroyan and Luxemburg’s book [12]. Theorem 2.9.2 Suppose the nonstandard superstructure V (∗ X ) is κ-saturated and A is a set in V (X ) such that card(A) < κ. Then there is a hyperfinite set B such that for each a ∈ A, ∗ a ∈ B. If D is a set in V (X ) and h : A −→ ∗ D, then there is an internal map H : ∗ A −→ ∗ D such that H (∗ a) = h(a) for each a ∈ A. In particular, if V (∗ X ) is polysaturated, then it is concurrent and an enlargement. Proof The binary relation P such that for each c ∈ ∗ A and each hyperfinite subset B of ∗ A, c, B ∈ P if and only if c ∈ B is concurrent on the set {∗a : a ∈ A}. The binary relation Q on the set of internal mappings with domain contained in ∗ A and range contained in ∗ D such that g, g ∈ Q if and only if g is an extension of g is concurrent on the following set of mappings with singleton domains: {∗a −→ h(a) : a ∈ A}. An internal map G extending all of these maps can be further extended by mapping any c ∈ ∗ A outside the domain of G to a fixed element of ∗ D. Remark 2.9.3 In applications, one often starts with a topological space (X, T ) and works with just a κ-saturated enlargement, where κ > card(T ).
2 An Introduction to General Nonstandard Analysis
59
Theorem 2.9.4 A nonstandard superstructure V (∗ X ) is κ-saturated if and only if for each internal set C and every (internal or external) κ-small collection B consisting of internal subsets of C such that B has the finite intersection property, there is an a ∈ ∩ {B : B ∈ B}. Proof Assume first that V (∗ X ) is κ-saturated, that B ⊆ ∗ P(C) is κ-small, and that B has the finite intersection property. Then the relation P := {B, a | a ∈ B ∈ ∗ P(C)} is internal and concurrent on B ⊆ domain(P). By the assumption, there exists an a such that B, a ∈ P for each B ∈ B. Now assume that P is an internal relation, and that P is concurrent on a κ-small set A ⊆ domain(P). For each a ∈ A set Sa := {b | a, b ∈ P} . Then B := {Sa | a ∈ A} isκ-small and has the finite intersection property. By the assumption, there is a b ∈ B. It follows that a, b ∈ P for each a ∈ A. Theorem 2.9.5 For V (∗ X ), ℵ1 -saturation is equivalent to being denumerably comprehensive. Proof First, assume that V (∗ X ) is at least ℵ1 -saturated. Fix an internal set S, and let an : n ∈ N be an ordinary sequence of elements from S. We must show that this sequence can be extended to an internal sequence an : n ∈ ∗ N in S. For each n ∈ N, Let Bn be the collection of internal maps F from ∗ N into S such that ∀i ≤ n, F(i) = ai . Then Bn is internal. Moreover, B := {Bn | n ∈ N} is κ-small and has ∗ the finite intersection property. Therefore, there exists an internal F : N → S with F ∈ B, whence F(n) = an for each n ∈ N. The proof of the converse is left to the reader. In the following we assume V (∗ X ) be κ-saturated, where κ ≥ ℵ1 . Proposition 2.9.6 If A is an infinite but κ-small set, then A is external. Proof Assume that A is internal. Then {a, b | a, b ∈ A and a = b} is internal and concurrent on A. Therefore, there exists an element b ∈ A such that a = b for all a ∈ A. Proposition 2.9.7 Let κ > card(V (X )) and let A be a set in V (X ). Let ∗ [A] := {∗ a : a ∈ A}. Then ∗ [A] ⊆ ∗ A and ∗ [A] = ∗ A if and only if A is infinite. Proof If a ∈ A, then by transfer, ∗ a ∈ ∗ A. Thus, ∗ [A] ⊆ ∗ A. Suppose A is infinite. Since ∗ [A] is infinite and κ-small, by the previous result, ∗ [A] is external. Since ∗ A is internal, ∗ [A] = ∗ A. On the other hand, if A is finite, say A = {a1 , . . . , ak } , then, ∗
A=
∗
a1 , . . . , ∗ ak = ∗ [A].
Part (i) of the next result shows that each κ-small internal cover of an internal set A contains a finite subcover of A; Part ii implies that the standard part of an internal finitely additive measure on an internal algebra is always σ-additive:
60
P.A. Loeb
Proposition 2.9.8 Fix an internal set C. (i) If A ⊆ C is internal and B is a κ -small subset of ∗ P(C) such that A ⊆ B. Then there exist finitely many B1 , . . . , Bk ∈ B with A ⊆ B1 ∪ · · · ∪ Bk . (ii) If (Ak )k∈N is a strictly or strictly decreasing sequence of internal increasing subsets of C, then k∈N Ak and k∈N Ak are external. Proof (i) Assume that the assertion fails. Then the internal relation R := {B, a | a ∗ X ) be κ-saturated, A ∈A, a ∈ / B ∈ ∗ P(C)} is concurrent on B. Since V ( B. (ii) Assume that B := k∈N Ak is internal. Since N is κ-small, by (i), there exists an m ∈ N such that B ⊆ A1 ∪ · · · ∪ Am = Am Am+1 ⊆ B, which is a contradiction. The rest follows from DeMorgan’s Law and the fact that the complement of an external set is external. Corollary 2.9.9 The sets N, ∗ N∞ , ∗ R∞ , m(0) are external. Proof We have seen that N is external. This also follows from the fact that N is a κ-small set. It now follows that ∗ N∞ = k∈N {m ∈ ∗ N | k < m} is external. With a similar proof, it follows that ∗ R∞ and m(0) are external. Problem: Assume V (∗ X ) is ℵ1 -saturated. Also assume that A is an internal set such that N ∩ A is infinite. Show that for each unlimited natural number M there exists an unlimited natural number K with K ≤ M and K ∈ A. Answer: Fix an unlimited M ∈ ∗ N. For each n ∈ N, let
bn := k ∈ ∗ N | n ≤ k ≤ M and k ∈ A . The bn ’s have the finite intersection property, so there is a K ∈ bn . It follows that K ∈ ∗ N∞ ∩ A and K ≤ M. We conclude this section by listing the numbers of the major tools needed for applications. They are the following: Part (v) of 2.4.3, 2.4.5, 2.6.4, 2.8.4, 2.8.8, 2.8.9, 2.8.12, 2.9.1. For further background, there is the initiating work of [9] and then [7]. Also we note the text of Vakil [13], that employs a weaker form of nonstandard analysis discussed in this book’s preface.
Appendix: Nonstandard Models Horst Osswald Mathematisches Institut der Universität München Theresienstr. 39, D–80333 München, Germany e-mail:
[email protected] As promised in Sect. 2.9, we shall now show that for each superstructure V of cardinality κ there exists a κ+ -saturated superstructure W and a monomorphism ∗ from V into W . (κ+ is the smallest cardinality greater than κ.) By the way, in model theory a monomorphism is often called an elementary embedding.
2 An Introduction to General Nonstandard Analysis
61
The proof is elementary. This means that the ambitious existence of countably incomplete κ+ good ultrafilter is not used as for example in the proof of Theorem 6.1.8 in the book of Chang and Keisler [2]. The idea of the proof is similar to the proof in algebra that each field k has an algebraically closed extension K . In the algebraic proof one has to find roots of polynomials; here we have to find elements in the intersection of families of internal sets. Roughly speaking, in algebra one constructs a suitable transfinite increasing chain (kα )α<γ of fields kα with k0 = k such that, if α is a successor ordinal, then kα contains exactly one root of each irreducible polynomial over kα−1 . If α is a limit number, then kα is the union of the preceding fields. The union of all the kα provides an algebraically closed extension of k. Here we construct a transfinite elementary chain; in the successor step we apply the compactness theorem, which says that for each superstructure and each family of internal sets in the superstructure having the finite intersection property there exists a superstructure—with the same formal properties—in which the intersection of the whole family is non-empty. In the limit case we take the so called elementary limit of the preceding structures. In brief, we are going to prove the following Theorem 2.9.10 Fix a superstructure V (X ) over X of cardinality κ. There exists a superstructure V (Y ) over a set Y such that the following two principles hold: (T) (The Transfer Principle) There exists a monomorphism ∗ from V (X ) into V (Y ) with Y = ∗ X . (PS) (Polysaturation) V (∗ X ) is κ+ -saturated. The proof of this theorem, essentially adopted from the first edition of this book, slightly modifies Sacks [11] corresponding proof for first order logic.
Models In order to work with long chains of superstructures and monomorphisms between them, it is convenient to consider only the internal part of a superstructure, which we will call a model. Let N0 denote the nonnegative integers. A sequence V := (Vn )n∈N0 is called a weak model if V0 = ∅ and Vn ⊂ P(V0 ∪ · · · ∪ Vn−1 ) for each n ≥ 1. The entities in V0 are called the individuals in V , the entities in Vn with n ≥ 1 are called the sets in V . Since individuals and sets must be treated differently in the proof of Theorem 2.9.10, we think of an individual as an object different from a set, in particular, it is different from the empty set. Moreover, since we are not interested in the elements of an individual, we assume that individuals do not contain any elements. Because of the extensionality axiom, “global” individuals don’t exist in Zermelo-Fraenkel (ZF)set theory. In many books on poly-saturated models the existence of such “global” individuals is presupposed. Here we suggest to use “local” individuals instead. Local
62
P.A. Loeb
individuals are individuals relative to the model according to equations (M 1) and (M 2) below. These local individuals are sufficient to lay the foundation for the theory of poly-saturated models and they exist in ZF-set theory. A weak model V = (Vn )n∈N0 is called a model if (M 1) V0 ∩ 1≤n Vn = ∅, which means that individuals in a model are different from sets within the model. (M 2) b ∩ n∈N0 Vn = ∅ for each b ∈ V0 , which means that individuals in a model are empty relative to the model. A model V := (Vn )n∈N0 is called a standard model if Vn = P(V0 ∪ · · · ∪ Vn−1 ) for each n ≥ 1. Recall that, if V := (Vn )n∈N0 is a standard model and X := V0 , then V (X ) = n∈N0 Vn has been called a superstructure over X . If V is a standard model, by induction it is easy to see that Vn (X ) = X ∪ Vn for each n ∈ N0 , where Vn (X ) is defined in 2.2.1 letting V0 (X ) := X and Vn+1 (X ) := Vn (X ) ∪ P(Vn (X )). This shows that Vn (X ) results from Vn by adding the set X of individuals – if V is a standard model. Let S := (Sn )n∈N0 be a sequence of sets. We use the following notation: S<∞ :=
Sn and S≤n := S0 ∪ · · · ∪ Sn .
n∈N0
From Weak Models to Models As was promised in Remark 2.1.3, we will now show that the individuals of a weak model V can be renamed in such a way that V becomes a model. Let us call a (weak) model V := (Vn )n∈N0 a (weak) model over X if V0 = X . Proposition 2.9.11 For each set Y = ∅ there exists a bijection c from Y onto X such that each weak model over X is already a model over X . Proof Set
:= {{b} | b ∈ Y } . Y
) = card(Y ). Define by induction: Then card(Y , Yn+1 := P(Yn ), Y∞ := Y0 := Y
n∈N0
and X := {{{{y} , Y∞ }} | y ∈ Y } .
Yn ,
2 An Introduction to General Nonstandard Analysis
63
Now define c(y) := {{{y} , Y∞ }} and rename the elements y of Y by c(y) ∈ X . Notice that ∪ X. (1) Y∞ is an infinite set, card(a) = 1 and card({a, Y∞ }) = 2 for each a ∈ Y It follows that onto X . Moreover, (2) the function i : a → {{a, Y∞ }} defines a bijection from Y Y0 = Y ∈ / X . Since ∅ ∈ Yn for each n ≥ 1, Yn ∈ / X for each n ∈ N ∪ {∞} . Let V := (Vn )n∈N0 be a weak model over X . By induction over n ∈ N0 , we see / Vk for each n ∈ N0 and each k ∈ {0, . . . , n} . It follows that that Yn ∈ / Vk for each k ∈ N0 . (3) Y∞ ∈ Now we prove that V is a model over X : (4) We first show that X ∩ n≥1 Vn = ∅ : . Then {a, Y∞ } ∈ Vi for Assume that k ≥ 1 and {{a, Y∞ }} ∈ Vk for some a ∈ Y / X = V0 . Therefore, there exists a j < i with some i < k. By (1), {a, Y∞ } ∈ Y∞ ∈ V j , contradicting (3). (5) Finally, we prove that b ∩ n∈N0 Vn = ∅ for each b ∈ X : Fix b = {{a, Y∞ }} ∈ X . Assume that there exist n ∈ N0 and x ∈ Vn with x ∈ b. / X = V0 , thus, n ≥ 1. It follows that there exists Then x = {a, Y∞ }. By (1), x ∈ a k < n with Y∞ ∈ Vk , contradicting (3). It depends on the theory we have in mind, which objects we take either as individuals or as sets. If we are not interested in the shape of elements of a mathematical entity, then this entity can be chosen as an individual. For example, in arbitrary Banach spaces the elements may be individuals, but in the Lebesgue L p -spaces the elements are functions, thus sets. In general, the real numbers should be individuals, but if we want to study real numbers as equivalence classes of Cauchy-sequences of rationals, then real numbers become sets and now the rationals may be chosen to be individuals. Languages for Models Monomorphisms between superstructures are stronger than the usual injective homomorphisms or homeomorphic embeddings. A monomorphism not only preserves the algebraic or topological structure, it preserves every mathematical property. In order to make the phrase “mathematical property” precise, we need a mathematical language strong enough to formalize every mathematical statement. The introduction of this language and its interpretation is similar to the approach at the beginning of this chapter. However, to keep this section self-contained, we repeat the necessary basic facts in a form suitable for the proof of our main result. Given a model V := (Vn )n∈N0 , the alphabet of the language LV has the following symbols: Logical symbols: ∨, ¬, ∃, =, ∈. Variables: A countable number of them will do. Parameters: The elements of V<∞ are the parameters in LV . Auxiliary symbols: Parentheses “( ”,“ )”, point “·” and comma “,”.
64
P.A. Loeb
We assume that all these symbols are pairwise distinct. A sentence in LV is built up inductively from these rules: (a) If a, b ∈ V<∞ , then (a ∈ b) and (a = b) are sentences in LV . Remark 2.9.12 It should be mentioned that in the sentence a ∈ b the term a may be a set, in particular, a is an n-tuple of elements in V<∞ (see Part (4) of Proposition 2.9.14). See also the proof of Part (10) in that proposition. It would follow that b is an n -placed relation. (b) If A and B are sentences in LV , then (A ∨ B) and (¬A) are sentences in LV . (c) Let A be a sentence in LV and let a, b be parameters in LV . If x is a variable, not occurring in A, then (∃x ∈ a Ab (x)) is a sentence in LV . Here Ab (x) is the string of signs of the alphabet of LV that results from A by replacing each b, where b occurs in A, with x. (d) The set of sentences of LV is the smallest set having the properties (a), (b) and (c). A formula in LV results from a sentence in LV by replacing some parameter with a variable x, not occurring in the sentence. We then say that x is free in the formula. We shall write A(x), to indicate that x is free in the formula A. As usual,we use the following abbreviations: (A → B) for ((¬A) ∨ B), (A ∧ B) for (¬((¬A) ∨ (¬B))), (A ↔ B) for ((A → B) ∧ (B → A)), (∀x ∈ a Ab (x)) for (¬(∃x ∈ a(¬Ab (x)))). In order to save parentheses we agree that ¬, ∃, ∀ bind stronger than ∧, ∧ binds stronger than ∨, ∨ binds stronger than →, and → binds stronger than ↔ . The relation “binds stronger” is transitive. Moreover, we will use the following shorthand ∃x1 , . . . , xk ∈ a A for ∃x1 ∈ a . . . ∃xk ∈ a A, ∀x1 , . . . , xk ∈ a A for ∀x1 ∈ a . . . ∀xk ∈ a A.
Interpretation of the Language Fix a model V := (Vn )n∈N0 . Here is the truth predicate for sentences in LV : (a) Fix a, b ∈ V<∞ . (i) The sentence a = b is true in V if a = b in the sense of common set theory. (ii) The sentence a ∈ b is true in V if a ∈ b in the sense of common set theory. By the definition of models, a ∈ b can never become true in V if b is an individual of V . (b) Let A, B be sentences of LV . (i) ¬A is true in V if A is not true in V . (ii) A ∨ B is true in V if A is true in V or B is true in V .
2 An Introduction to General Nonstandard Analysis
65
(iii) ∃x ∈ a A(x) is true in V if there exists a c ∈ a such that A(x)(c) is true in V . Here the sentence A(x)(c) results from the formula A(x) by replacing x with c. Following a common practice in model theory, we will write V |= A to denote that A is true in V . We conclude this section with a remark concerning individuals. Remark 2.9.13 Recall that if ∅ is a set in the model V , then a is an individual in V iff a = ∅ and V |= ¬∃x(x ∈ a). (Here ∃x(x ∈ a) is a shorthand for the cumbersome formula ∃x ∈ a(x ∈ a).) In particular, when we assume that the positive integers are individuals in V , we mean they are coded so that they never appear as sets in the model.
Models Closed Under Definition We will now study models having nice closure properties: A model V := (Vn )n∈N0 is called closed under definition if for each formula A(x) in LV and each n ∈ N0
a ∈ V≤n | V |= A(x)(a) ∈ Vn+1 . Proposition 2.9.14 Suppose that V is closed under definition and the positive integers are individuals in V , coded according to Proposition 2.9.11. Fix n ≥ 1. Then (1) (2) (3) (4) (5) (6) (7) (8) (9) (10)
V1 ⊆ · · · ⊆ Vn ⊆ . . . , thus V≤n = V0 ∪ Vn . If F is a finite subset of V≤n−1 , then F ∈ Vn . If a, b ∈ V≤n−1 , then a, b := {{a, b} , {b}} ∈ Vn+1 . Fix a1 , . . . , ak ∈ V≤n−1 . Then (a1 , . . . , an ) := {1, a1 , . . . , k, ak } ∈ Vn+2 . Fix a1 , . . . , ak ∈ Vn . Then a1 ∪ · · · ∪ ak ∈ Vn and a1 ∩ · · · ∩ ak ∈ Vn . If a, b ∈ Vn , then a\b ∈ Vn . ∅ ∈ Vn . V≤n−1 ∈ Vn . Vn−1 ∈ Vn . Fix a1 , . . . , ak ∈ Vn . Then a1 × · · · × ak = {(α1 , . . . , αk ) | α1 ∈ a1 ∧ · · · ∧ αk ∈ ak } ∈ Vn+3 .
Proof (1) Let c ∈ Vn . Then
c = a ∈ V≤n | V |= a ∈ c = a ∈ V≤n | V |= (x ∈ c) (a) ∈ Vn+1 . (2) Let F = {a1 , . . . , ak }. Then
66
P.A. Loeb
F = a ∈ V≤n−1 | V |= a = a1 ∨ · · · ∨ a = ak ∈ Vn . (3) and (4) These follow from (2). (5) Since a1 , . . . , ak ⊆ V≤n−1 ,
a1 ∪ · · · ∪ ak = a ∈ V≤n−1 | V |= a ∈ a1 ∨ · · · ∨ a ∈ ak ∈ Vn . The proof for “∩” is similar. (6) The proof of (6) is similar to the proof of (5). (7) This is true, because
∅ = a ∈ V≤n−1 | V |= ¬a = a ∈ Vn .
(8) V≤n−1 = a ∈ V≤n−1 | V |= a = a ∈ Vn . (9) By (8), V0 = V≤0 ∈ V1 . Let n > 1. Then, by (1), (6) and (8), Vn−1 = V≤n−1 \V0 ∈ Vn . (10) Using (4), we obtain:
a1 × · · · × ak = a ∈ V≤n+2 | V |= ∃x1 ∈ a1 . . . ∃xk ∈ ak (a = (x1 , . . . , xk )) ∈ Vn+3 ,
where we have used the following abbreviations: a = (x1 , . . . , xk ) for ∀x ∈ V≤n+1 (x ∈ a ↔ x = 1, x1 ∨ · · · ∨ x = k, xk ) , x = i, xi for ∀z ∈ V≤n (z ∈ x ↔ z = {i, xi } ∨ z = {xi }), z = {i, xi } for ∀y ∈ V≤n−1 (y ∈ z ↔ y = i ∨ y = xi ), z = {xi } for ∀y ∈ V≤n−1 (y ∈ z ↔ y = xi ). Elementary Embeddings Fix a model V = (Vn )n∈N0 closed under definition and a second model W = (Wn )n∈N0 . Suppose ∗ is a mapping from V<∞ into W<∞ , and recall that, if A is a sentence (formula) in LV , then the ∗-transform of A, ∗ A, is the sentence (formula) in LW obtained by replacing each parameter a in A by ∗ (a). We will write ∗ a instead of ∗(a). A mapping ∗ : V<∞ → W<∞ is called an elementary embedding from V into W if (E 1) and (E 2) are true: (E 1) For each n ∈ N0 , ∗ Vn = Wn . It follows that Wn ∈ W<∞ . (E 2) (Transfer Principle) For each sentence A in LV V |= A ⇔ W |= ∗ A. Proposition 2.9.15 Let ∗ be an elementary embedding from V into W and assume that the positive integers are individuals in V , coded according to Proposition 2.9.11. We obtain for each n ∈ N0 :
2 An Introduction to General Nonstandard Analysis
67
(1) The restriction ∗ Vn maps Vn into Wn , and Wn is a set in W . (2) The map ∗ is injective and a homomorphism, that is, for a, b ∈ V<∞ , a ∈ b ⇔ ∗ a ∈ ∗ b. (3) ∗(V≤n ) = W≤n ∈ Wn+1 . (4) W is closed under definition. (5) Let A(x) be a formula in LV . Then ∗
a ∈ V≤n | V |= A(x)(a) = b ∈ W≤n | W |= ∗ (A(x)) (b) .
(6) If {a1 , . . . , ak } is a finite subset of V<∞ , then ∗ {a1 , . . . , ak } = {∗ a1 , . . . , ∗ ak } , in particular, ∗ ∅ = ∅. It follows that ∗ (a1 , . . . , ak ) = (∗ a1 , . . . , ∗ ak ) for all a1 , . . . , ak ∈ V<∞ . (7) Let a1 , . . . , ak , a be sets in V . Let f be a set in V and a mapping from a1 × · · · × ak into a. Then ∗ f is a mapping from ∗ a1 × · · · × ∗ ak into ∗ a such that for all (b1 , . . . , bk ) ∈ a1 × · · · × ak , ∗
( f (b1 , . . . , bk )) = ∗ f (∗ b1 , . . . , ∗ bk )).
If, in addition, f is surjective onto a or injective or bijective, then ∗ f is surjective onto ∗ a, injective or bijective, respectively. Proof (1) Since V is closed under definition, Vn ∈ Vn+1 and Vn = ∅ for all n ∈ N0 . Let a ∈ Vn . Since V |= a ∈ Vn , W |= ∗ a ∈ Wn . Therefore, Wn is a set in W and ∗ a ∈ Wn . (2) Let a, b ∈ V<∞ . Then a = (∈) b ⇔ V |= a = (∈) b ⇔ W |= ∗ a = (∈) ∗ b ⇔ ∗ a = (∈) ∗ b. (3) If n = 0, the result follows from (E 1). Let n ≥ 1. Set A := ∀x ∈ V≤n (x ∈ V0 ∨ x ∈ Vn ) ∧ ∀x ∈ V0 (x ∈ V≤n ) ∧ ∀x ∈ Vn (x ∈ V≤n ). Since A is true in V , ∗ A is true in W . It follows that ∗ V≤n = W0 ∪ Wn . Since ∀x ∈ Vk (x ∈ Vk+1 ) is true in V for each k ≥ 1 and therefore the ∗ -image of this sentence is true in W for all k ≥ 1, by (E 1), W≤n = W0 ∪ Wn . (4) Let A(x) be a formula in LW . There is an m ∈ N0 such that the parameters b1 , . . . , bk occurring in A(x) belong to W≤m . Since V is closed under definition, V |= ∀x1 , . . . , xk ∈ V≤m ∃z ∈ Vn+1 ∀x ∈ V≤n (x ∈ z ↔ A(x, x1 , . . . , xk ))) where A(x, x1 , . . . , xk ) results from A(x) by replacing bi with xi , i = 1, . . . , k. We may assume that x1 , . . . , xk do not occur in A(x) and are pairwise different. Since ∗ V≤n = W≤n and ∗ Vn = Wn , we obtain the fact that
68
P.A. Loeb
W |= ∀x1 , . . . , xk ∈ W≤m ∃z ∈ Wn+1 ∀x ∈ W≤n (x ∈ z ↔ A(x, x1 , . . . , xk )). It follows that for b1 , . . . , bk there is a B ∈ Wn+1 such that for a ∈ W≤n , a ∈ B iff W |= A(x)(a). Therefore, B = a ∈ W≤n | W |= A(x)(a) . (5) Define B := a ∈ V≤n | V |= A(x)(a) . Then B ∈ Vn+1 and V |= ∀x ∈ V≤n (x ∈ B ↔ A(x)). Since W |= ∀x ∈ W≤n (x ∈ ∗ B ↔ ∗ A(x)) and ∗ B ∈ Wn+1 , we obtain ∗
B = b ∈ W≤n | W |= ∗ A(x)(b) .
(6) Let {a1 , . . . , ak } ⊆ V≤n . Then, by (1), {∗ a1 , . . . , ∗ ak } ⊆ W≤n and, by (5), ∗
{a1 , . . . , ak } = ∗ a ∈ V≤n | V |= a = a1 ∨ · · · ∨ a = ak =
b ∈ W≤n | W |= b = ∗ a1 ∨ · · · ∨ b = ∗ ak = ∗ a1 , . . . , ∗ ak .
Moreover, we obtain for each n ≥ 1, ∗
∅ = ∗ a ∈ V≤n−1 | V |= ¬a = a = b ∈ W≤n−1 | W |= ¬b = b = ∅.
(7) We identify the k-placed functions f with the 2-placed relations, where the second argument is uniquely determined by the first argument, which is a ktuple. Therefore, if f is a k-placed function, we can use xk+1 = f (x1 , . . . , xk ) as a shorthand for ((x1 , . . . , xk ) , xk+1 ) ∈ f. We may assume that there exists an n ≥ 1 such that a1 , . . . , ak , a, f ∈ Vn . Then V |= A1 ∧ A2 ∧ A3 , where A1 := ∀x1 ∈ a1 . . . ∀xk ∈ ak ∃y ∈ a(((x1 , . . . , xk ) , y) ∈ f ). A2 := ∀x1 , . . . , xk , y ∈ V≤n (((x1 , . . . , xk ), y) ∈ f → x1 ∈ a1 ∧· · ·∧xk ∈ ak ∧y ∈ a). A3 := ∀x1 , . . . , xk , y, y ∈ V≤n (((x1 , . . . , xk ), y) ∈ f ∧ (x1 , . . . , xk ), y ∈ f → y = y ).
A1 means that domain( f ) ⊇ a1 × · · · × ak ; A2 means that range( f ) ⊆ a and domain( f ) ⊆ a1 × · · · × ak ; A3 means that f is a function. Since V |= A1 ∧ A2 ∧ A3 and therefore W |= ∗ A1 ∧ ∗ A2 ∧ ∗ A3 , we see that ∗ f is a mapping from ∗ a × · · · × ∗ a into ∗ a. Assume that f (b , . . . , b ) 1 k 1 k = b. Then ((b1 , . . . , bk ), b) ∈ f and ((∗ b1 , . . . , ∗ bk ), ∗ b) ∈ ∗ f. Therefore, ∗ f (∗ b , . . . , ∗ b ) = ∗ b = ∗ ( f (b , . . . , b )). The other parts of assertion (7) can 1 k 1 k be proved in a similar way. ∗a
Since ∗ is injective, we may identify each individual a in V with the individual in W .
2 An Introduction to General Nonstandard Analysis
69
Saturated Models Let us call a non-empty family B of sets deep if B has the finite intersection property, which means that the intersection of all finitely many sets in B is nonempty. Let γ be an uncountable cardinal. A model V = (Vn )n∈N0 , which is closed under definition, is called γ-saturated if for each n ≥ 1
B = ∅ for each deep B ⊆ Vn with card(B) < γ.
It follows that the internal sets in a γ-saturated model can be treated as though they were γ-compact (see Sect. 2.9).
From Pre-models to Models In order to deal with ultrapowers and limits of elementary chains under the same roof, we introduce the notion “pre-model”: A triple ((Pn )n∈N0 , ∼, E) is called a pre-model if the following conditions are true: (PM 1) P0 = ∅ and P0 ∩ n≥1 Pn = ∅. (PM 2) ∼ is an equivalence relation on P<∞ such that for all a, b ∈ P<∞ with a ∼ b and all n ∈ N0 : a ∈ Pn ⇒ b ∈ Pn . (PM 3) The relation E is a subset of P<∞ × P1≤ such that for a, a , b, b ∈ P<∞ with a ∼ a and b ∼ b: a E b ⇒ a E b . (PM 4) Transitivity. If n ≥ 1 and a ∈ Pn , then b E a ⇒ b ∈ P≤n−1 . (PM 5) Extensionality. Fix a, b ∈ P1≤ . Then a ∼ b if (cEa ⇔ cEb) for all c ∈ P<∞ . Later on we shall be concerned with two important examples of pre-models. Fix a pre-model P = ((Pn )n∈N0 , ∼, E). Using the Mostowski Collapsing Function (see Definition 2.5.3), we define inductively on n ∈ N0 sets Vn and their elements a n such that (Vn ) becomes a model generated by P. a 0 := {b ∈ P0 | b ∼ a}. According to Proposition 2.9.11, we For each a ∈ P0 set 0 to a 0 such that the function a 0 → a 0 defines a bijection between can rename each a
0
0 a | a ∈ P0 and a | a ∈ P0 , and such that each weak model over V0 := {a 0 | a ∈ P0 } is a model over V0 .
70
P.A. Loeb
Now let n ≥ 1 and assume that a k is already defined for each k < n and each a ∈ Pk . Moreover, assume that Vk := {a k | a ∈ Pk } for each k < n. If a ∈ Pn , set a n := {ck | k < n, c ∈ Pk and c E a}. and Vn := {a n | a ∈ Pn }. Since P0 = ∅, we have V0 = ∅. Since for n ≥ 1, a n ⊂ V≤n−1 , we see that Vn ⊂ P(V≤n−1 ). It follows that V := (Vn )n∈N0 is a model over V0 . We say that the model V is generated by ((Pn )n∈N0 , ∼, E). Proposition 2.9.16 Fix n, m ∈ N0 and a ∈ Pn and b ∈ Pm . Then m
a n = b ⇔ a ∼ b. Proof We prove this result by induction on μm,n := max {n, m}. 0 a0 = b0 ⇔ a ∼ b. For the Let μm,n = 0. Then, by the definition of a 0 , a 0 = b ⇔ induction step let μm,n > 0. m Assume that a n = b . Since V0 ∩ V1≤ = ∅, we have 1 ≤ n, m. Suppose that c E a m holds. By (PM 4), there exists an i < n with c ∈ Pi . It follows that ci ∈ a n = b . j Therefore, there exists j < m and an element d ∈ P j with d E b and d = ci . Since μi, j < μm,n , by the induction hypothesis, d ∼ c. From (PM 3) it follows that c E b holds. Therefore, c E a implies c E b and vice versa. By (PM 5), a ∼ b. Now assume that a ∼ b. Since m > 0 or n > 0, by (PM 1) and (PM 2), 1 ≤ m, n. m In order to show that a n = b , let ci ∈ a n with i < n, c ∈ Pi and c E a. By (PM 3), m c E b. By (PM 4), there exists a j < m with c ∈ P j . It follows that c j ∈ b . Since m m μi, j < μm,n , by the induction hypothesis, ci = c j ∈ b . This proves that a n ⊆ b . m The proof of a n ⊇ b is similar. In view of the previous proposition, we may define for each a ∈ P<∞ , a := a n if a ∈ Pn . We obtain the following Corollary 2.9.17 Fix a, b ∈ P<∞ . Then (1) a = b ⇔ a ∼ b. (2) a ∈ b ⇔ a E b. Proof We only need to prove (2). Assume that a ∈ b. Since V is a model, b is a set in V. Therefore, there exist i ∈ N0 and a ∈ Pi with a E b and a = a. By (1), a ∼ a. By (PM 3), a E b. Now assume that a E b. Since b ∈ Pn for some n ≥ 1, by (PM 4), there exists an i < n with a ∈ Pi . By the definition of b, a ∈ b.
2 An Introduction to General Nonstandard Analysis
71
Ultrapowers The aim of this section is the proof of the compactness theorem. We assume that the reader is familiar with filters and ultrafilters (see Sect. 1.2). First we will construct a pre-model generating the ultrapower of a model V : Fix a non-empty set I , an ultrafilter D on I and a model V = (Vn )n∈N0 , which is closed under definition. We shall use the following abbreviations. If (ai )i∈I is an I -sequence, then we will write (ai ) instead of (ai )i∈I . If F(i) is an assertion about elements i of I , then we shall write F(i) a.e. instead of {i ∈ I | F(i)} ∈ D. For each n ∈ N0 set Fn := {(ai ) | ai ∈ Vn a.e.}. On F<∞ =
n∈N0
Fn we define a relation ∼ by setting (ai ) ∼ (bi ) :⇔ ai = bi a.e.
and we define a relation E ⊆ F<∞ × F1≤ by setting, (ai ) E (bi ) :⇔ ai ∈ bi a.e. Using the ultrafilter properties one can easily prove the following Lemma 2.9.18 The triple (Fn )n∈N0 , ∼, E is a pre-model. The model generated by ((Fn )n∈N0 , ∼, E) is called the D-ultrapower of V and is denoted by D (V ). Now we shall show that the D-ultrapower of V has the same formal properties as V . Let A be a (sentence) formula in L D (V ) . By (Ai )i∈I we denote one of the I -sequences of sentences (formulas) in LV that result from A by replacing each i )i∈I is another result, then A i = Ai a.e. parameter (ai ) in A by ai . Notice that, if ( A Theorem 2.9.19 (Theorem of Ł˘os) Fix a sentence A in L D (V ) . Then, D (V ) |= A ⇔ V |= Ai a.e. Proof By induction over the definition of the sentences in L D (V ) . (1) (a) Let A be the sentence ((ai ) ∈ (bi )). Then D (V ) |= (ai ) ∈ (bi ) ⇔ (ai ) ∈ (bi ) ⇔ ai ∈ bi a.e. ⇔ V |= Ai a.e. (b) If A = ((ai ) = (bi )), then the proof is similar to the proof under (a). (2) (a) Let A = B ∨ C be a formula of L D (V ) . Assume that the assertion is true for B and C.
72
P.A. Loeb
Suppose that D (V ) |= A. Then D (V ) |= B or D (V ) |= C. By the induction hypothesis, V |= B i a.e. or V |= C i a.e. Therefore, V |= B i ∨ C i a.e. The result follows, since Ai equals B i ∨ C i a.e. Suppose that V |= B i ∨ C i a.e. Since D is an ultrafilter, V |= B i a.e. or V |= C i a.e. By the induction hypothesis, D (V ) |= B or D (V ) |= C, thus, D (V ) |= B ∨ C. (b) Let A = ¬B. Assume that
D (V ) |= A, thus, D (V ) B. By the
induction hypothesis, / D. Since D is an ultrafilter V B i ∈ D, thus, V |= ¬B i V |= B i ∈ a.e.
/ D, V B i ∈ / D. The induction Assume that V |= ¬B i a.e. Since ∅ ∈ hypothesis implies D (V ) |= ¬B. (c) Let A = ∃x ∈ (ai )B(x). If D (V ) |= A, then there is a (bi ) ∈ (ai ) with D (V ) |= B(x)((bi )). By the induction hypothesis, V |= B(x)i (bi ) a.e. Since bi ∈ ai a.e., V |= Ai a.e.
Suppose that V |= Ai a.e., that is, Y := i ∈ I | V |= ∃x ∈ ai (B(x)i ) ∈ D. We choose an I -sequence (bi ) with V |= bi ∈ ai ∧ B(x)i (bi ) for each / Y . Since V |= B(x)i (bi ) a.e., by the induction i ∈ Y and set bi = ∅ if i ∈ hypothesis, D (V ) |= B(x)((bi )). Since bi ∈ ai a.e., (bi ) ∈ (ai ). It follows that D (V ) |= A. An important consequence of Ł˘os’ theorem is the existence of an elementary embedding from V into the ultrapower D (V ) of V. For each b ∈ V<∞ let (b) be the constant I -sequence (bi ) with bi = b for each i ∈ I . The mapping ∗ : V<∞ → D (V )<∞ is defined by setting ∗
b := (b).
Corollary 2.9.20 The function ∗ is an elementary embedding from V into D (V ). Proof We have to check the properties (E 1) and (E 2). (E 1) Since Vn ∈ Vn+1 , (Vn ) ∈ Fn+1 , thus ∗ Vn = (Vn ) ∈ D (V )<∞ . By Corollary 2.9.17 (2), and since Vn is a set in V , we obtain (ai ) ∈ (Vn ) ⇔ (ai ) E (Vn ) ⇔ (ai ) ∈ D (V )n . This proves that ∗ Vn = D (V )n . (E 2) Let A be a sentence in LV . Then ∗ A is a sentence in L D (V ) and (∗ A)i = A a.e. By the theorem of Ł˘os, we obtain V |= A ⇔ V |= (∗ A)i a.e. ⇔ D (V ) |= ∗ A. Recall from Proposition 2.9.15 (4) that the model D (V ) is closed under definition. Using the ultrapower construction given above, we can prove the Compactness Theorem. The proof is the same as in first order model theory (see [2]).
2 An Introduction to General Nonstandard Analysis
73
Proposition 2.9.21 (The Compactness Theorem) Let V = (Vn )n∈N0 be a model which is closed under definition, let n ≥ 1 and let B be a deep subset of Vn . Then ∗ there exists a model W = (Wn )n∈N0 and ∗an elementary ∗ embedding from V into ∗ W , such that [B] = ∅. (Notice that [B] = { A | A ∈ B}.) Proof We may assume that B is closed under finite intersections. Let I be the set of finite non-empty subsetsof B. Since B is deep, for each i ∈ I there exists an ai ∈ V≤n−1 such that ai ∈ i ∈ B. For each set A ∈ B define := {i ∈ I | ai ∈ A} ⊂ I, A and
| A ∈ B} ⊆ P (I ) . G := { A
for each A ∈ B. Since B = ∅, G = ∅. Now let Then ∅ ∈ / G, because {A} ∈ A ∩ A, B ∈ B. Then A ∩ B ∈ G and it is easy to see that A ∩B ⊂ A B. It follows that F(G) := {B ⊆ I | ∃C ∈ G(C ⊆ B)} is a filter. Fix an ultrafilter D ⊇ F(G) on I . Let D (V ) be the D-ultrapower of V and let ∗ : V<∞ → D (V )<∞ be the elementary embedding introduced previously. Since ai ∈ V≤n−1 and D is an ultrafilter, (ai ) ∈ F≤n−1 , thus (ai ) ∈ D (V )≤n−1 . In order to show that (ai ) ∈ ∗ [B], fix A ∈ B. Then ∈ G ⊂ F(G) ⊂ D. {i ∈ I | V ai ∈ A} = {i ∈ I | ai ∈ A} = A By the theorem of Ł˘os, D (V ) (ai ) ∈ (A) = ∗ A.
Elementary Chains and Their Elementary Limits Here we extend the notions “elementary chain” and “elementary limit” to our notion of a model. Let λ be an ordinal number different from 0 and let (V α )α<λ be a λα of models V α = (Vn )n∈N0 , which are closed under definition. Then the pair sequence (V α )α<λ , (∗αβ )α≤β<λ is called an elementary chain if for each α ≤ β ≤ γ < λ (EC 1) ∗αβ is an elementary embedding from V α into V β . α . (EC 2) ∗αα (a) = a for each a ∈ V<∞ (EC 3) ∗βγ ◦ ∗αβ = ∗αγ . Starting from an elementary chain C we define a pre-model such that the generatedαmodel becomes theelementary limit of C. To this end fix an elementary chain (V )α<λ , (∗αβ )α≤β<λ . We define for each n ∈ N0 , Pn := {(a, α) | α < λ and a ∈ Vnα }. Two elements (a, α), (b, β) ∈ P<∞ = n∈N0 Pn are called equivalent if there exists a γ < λ with α, β ≤ γ such that ∗αγ (a) = ∗βγ (b), in which case we shall write (a, α) ∼ (b, β).
74
P.A. Loeb
For (a, α) ∈ P<∞ and (b, β) ∈ P1≤ we set (a, α) E (b, β) if there exists a γ < λ with α, β ≤ γ such that ∗αγ (a) ∈ ∗βγ (b). The simple proof of the next result is left to the reader : Lemma 2.9.22 ((Pn )n∈N0 , ∼, E) is a pre-model. The model, generated by the pre-model ((Pn )n∈N0 , ∼, E), is called the elementary limit of the elementary chain ((V α )α<λ , (∗αβ )α≤β<λ ) and is denoted by V λ = (Vnλ )n∈N0 . We shall now collect some immediate consequences of the construction of the elementary limit (see Corollary 2.9.17 (1) and (2)). Proposition 2.9.23 Fix an elementary chain ((V α )α<λ , (∗αβ )α≤β<λ ) and let V λ be its elementary limit. Fix n ∈ N0 . Then (1) Vnλ = {(a, α) | (a, α) ∈ Pn } = {(a, α) | α < λ and a ∈ Vnα }. α ,b ∈ Vβ . Fix α, β < λ, a ∈ V<∞ <∞ (2) (a, α) = (b, β) iff there is a γ with α, β ≤ γ < λ and ∗αγ (a) = ∗βγ (b). It follows that (a, α) = (∗αβ (a), β) if α ≤ β < λ. (3) (a, α) ∈ (b, β) iff there is a γ < λ with α, β ≤ γ and ∗αγ (a) ∈ ∗βγ (b). β
(4) (Vnα , α) = (Vn , β), because for each γ with α, β ≤ γ < λ ∗αγ (Vnα ) = Vnγ = ∗βγ (Vnβ ). Definition 2.9.24 Fix an elementary chain ((V α )α<λ , (∗αβ )α≤β<λ ) and its elemenα → V λ by setting tary limit V λ . For each α ≤ λ define a mapping ∗αλ : V<∞ <∞ ∗αλ (a) := (a, α) for α < λ and ∗λλ (a, α) := (a, α). Proposition 2.9.25 Fix α < λ. Then ∗αλ is an elementary embedding from V α into V λ . It follows that, ((V α )α<λ+1 , (∗αβ )α≤β<λ+1 ) is an elementary chain. Proof To prove (E 1), fix n ∈ N0 . We have to show that Vnλ = ∗αλ (Vnα ) : β “⊆” Fix x ∈ Vnλ . Then there exist β < λ and b ∈ Vn with x = (b, β). By (3) and (4), β
x = (b, β) ∈ (Vn , β) = (Vnα , α) = ∗αλ Vnα . “⊇” Fix x ∈ ∗αλ (Vnα ) = (Vnα , α). Since Vnα is a set in V α , Vnα , α is a set in V λ . β 2.9.17 Therefore, there αexist β < λ and b ∈ V<∞ with x = (b, β). By Corollary γ (2), (b, β) E Vn , α , thus there exists a γ ≥ α, β with ∗βγ (b) ∈ ∗αγ (Vnα ) = Vn . We obtain x = (b, β) = (∗βγ (b), γ) ∈ Vnλ .
2 An Introduction to General Nonstandard Analysis
75
This proves (E 1). To prove (E 2), we will prove by induction on the definition of the sentences A in α<λ LV α that if A is in LV α then V α |= A ⇔ V λ |=
∗αλ
A.
(1) (a) Let A = (a ∈ b). Then V α |= A ⇔ a ∈ b ⇔ (a, α) E (b, α) ⇔ (a, α) ∈ (b, α) ⇔ ∗αλ (a) ∈ ∗αλ (b) ⇔ V λ |= ∗αλ A. The second “⇐ ” of the previous computation can be seen as follows: If (a, α) E (b, α), then ∗αγ (a) ∈ ∗αγ (b) for some γ ≥ α, thus a ∈ b. (b) If A = (a = b), then the proof is similar to the proof of (1) (a). (2) If A = (B ∨ C) or A = ¬B, then the assertion follows immediately from the induction hypothesis. Let A = ∃x ∈ a B(x). Assume that V α |= A. Thenthere is a b ∈ a with V α |= B(x)(b). By the induction hypothesis, V λ |= ∗αλ B(x) (b, α) . Since (b, α) ∈ (a, α), V λ |= ∗αλ A. Assume that V λ |= ∗αλ A. Then V λ |= ∗αλ B(x) (b, δ) for some (b, δ) ∈ (a, α). δ), Vλ |= ∗γλ (∗αγ B(x) ∗δγ (b) ). Set γ := max{α, δ}. Since (∗δγ (b), γ) = (b, By the induction hypothesis, V γ |= ∗αγ B(x) ∗δγ (b) . Since ∗δγ (b) ∈ ∗αγ (a), we obtain the fact that V γ |= ∃x ∈ ∗αγ (a) ∗αγ B(x), that is, V γ |= ∗αγ ∃x ∈ a B(x). Since α , we obtain V α |= ∃x ∈ a B(x). the parameters of ∃x ∈ a B(x) belong to V<∞
Existence of Polysaturated Nonstandard Models In order to finish the proof of Theorem 2.9.10, we need one more lemma. Lemma 2.9.26 Fix a model W := (Wn )n∈N0 that is closed under definition. Then there exist a model U and an elementary embedding ∗ from W into U such that for each n ≥ 1 and each deep B ⊆ Wn , ∗ [B] = ∅. Proof There exists a cardinal number θ and a listing (Bα )α<θ of all deep subsets Bα ⊆ Wn for some n ≥ 1. By transfinite recursion, we define an elementary chain ((W α )α<θ , (∗αβ )α≤β<θ ) in the following way: Set W 0 := W, ∗00 := identity W<∞ .
76
P.A. Loeb
Assume that λ < θ and that W α , ∗αβ are already defined for each α ≤ β < λ such that the following conditions (1, λ) and (2, λ) hold: (1, λ) ((W α )α<λ , (∗αβ )α≤β<λ ) is an elementary chain, (2, λ)
∗0α
Bβ = ∅ for each β < α < λ.
In order to construct W λ and ∗αλ for each α < λ, we have to consider two cases: Case 1: λ = γ + 1 is a successor ordinal. Since Bγ is deep and ∗0γ is an elementary embedding from W 0 into W γ , ∗0γ Bγ λ is deep. By the compactness theorem, there exist a model W and an elementary ∗γλ ◦∗0γ γ λ Bγ = ∅. We now define for embedding ∗γλ from W into W , such that each α ≤ γ: λ . ∗αλ := ∗γλ ◦ ∗αγ and ∗λλ := identity W<∞ Notice that (1, λ + 1) and (2, λ + 1) are true. Case 2: λ is a limit ordinal. Let W λ be the elementary limit of ((W α )α<λ , (∗αβ )α≤β<λ ). For each α < λ, the elementary embedding ∗αλ from W α into W λ is defined in Definition 2.9.24. Set λ . Notice that (1, λ + 1) and (2, λ + 1) are true. ∗λλ := identity W<∞ We thus obtain an elementary chain ((W λ )λ<θ , (∗αλ )α≤λ<θ ). Let U := W θ be its 2.9.25, ∗ is an elementary embedding elementary limit. Set ∗ := ∗0θ . By Proposition from W into U. It is easy to check that ∗ [B] = ∅ if B is a deep subset of Wn with n ≥ 1. Now we are able to finish the proof of Theorem 2.9.10: fix a superstructure V (X ) of cardinality κ. Let V = (Vn )n∈N0 be the standard model over X . Then V (X ) = V<∞ . Let κ+ be the smallest cardinal number greater than κ. Then κ+ is a regular cardinal, that is, for each ρ < κ+ and each ρ-sequence (αβ )β<ρ in κ+ , supβ<ρ αβ < κ+ . By transfinite recursion, we construct again an elementary chain ((V α )α<κ+ , (∗αβ )α≤β<κ+ ): Set V 0 := V and ∗00 := identity V<∞ . Fix an ordinal λ strictly between 0 and κ+ and assume that there already exists an elementary chain ((V α )α<λ , (∗αβ )α≤β<λ ) such that for α, β < λ, α < β, n ≥ 1 and each deep B ⊆ Vnα , We now define V λ and ∗αλ for each α ≤ λ: First assume that λ = γ + 1 is a successor ordinal.
∗αβ
[B] = ∅
(♦λ)
2 An Introduction to General Nonstandard Analysis
77
Then, by Lemma 2.9.26, there exists a model V λ and an elementary embedding γ ∗γλ from V γ into V λ , such that for each n ≥ 1 and each deep B ⊆ Vn , ∗γλ [B] = ∅. For each α < λ set λ . ∗αλ := ∗γλ ◦ ∗αγ and ∗λλ := identity V<∞
Note that ((V α )α<λ+1 , (∗αβ )α≤β<λ+1 ) is an elementary chain such that ♦ (λ + 1) is true. Now assume that λ is a limit number. Let V λ be the elementary limit of ((V α )α<λ , (∗αβ )α≤β<λ ). For α ≤ λ let ∗αλ be the elementary embedding from V α into V λ , defined in Definition 2.9.24. Notice that ((V α )α<λ+1 , (∗αβ )α≤β<λ+1 ) is an elementary chain and ♦ (λ + 1) is true. + Let W := V κ be the elementary limit of ((V α )α<κ+ , (∗αβ )α≤β<κ+ ). Set ∗ := ∗0κ+ Then ∗ is an elementary embedding from V into W . To prove that W is κ+ -saturated, fix n ≥ 1 and a deep set B ⊆ Wn with card(B) < κ+ . Since κ+ is a regular cardinal, there exists a δ < κ+ such that B ⊆ (b, β) | β < δ and b ∈ Vnβ . Set B :=
∗βδ (b)
β | β < δ, b ∈ Vn and (b, β) ∈ B . Notice that
B
∗δκ+ [B ]
= B
((V α )
is deep. From the construction of and that α<κ+ , (∗αβ )α≤β<κ+ ) it follows that ∗δ(δ+1) B = ∅. Since ∗(δ+1)κ+ is an elementary embedding from V δ+1 into + V κ = W, by (EC 3),
B=
∗δκ+
∗ (δ+1)κ+ ◦ ∗δ(δ+1) B = ∅. B =
Now set Y := W0 . Then Y = ∗ V0 = ∗ X , and V (Y ) is a superstructure over Y with W<∞ ⊆ V (Y ). Finally, we will prove that the internal entities in V (Y ) coincide with the elements in W<∞ : Let B ∈ V (Y ) be internal. Then there exists an A ∈ V (X )\X = V1≤ with B ∈ ∗ A. Since ∗ A ∈ W1≤ , we obtain the fact that B ∈ W<∞ . Now assume that B ∈ W<∞ . Then B ∈ Wn = ∗ Vn for some n ∈ N0 . This proves that B is internal. We end this appendix with an important application of Theorem 2.9.10. Theorem 2.9.27 Fix an internal set A in V (∗ X ), a set I in V (X ) and a mapping f : I → A. Then there exists an internal mapping F : ∗ I → A with f (i) = F(∗ i) for all i ∈ I . Since the mapping ∗ is injective, we may identify i ∈ I with ∗ i ∈ ∗ I , thus F is an internal extension of f . Proof If I is standard finite, then f is internal, thus f is its own internal extension (see Proposition 2.9.14 Part (2)). Therefore, we may assume that I is infinite, thus A = ∅. Let E (I ) denote the set of all finite subsets of I . For all E ∈ E (I ) define, B E := F :
∗
I → A | F is internal and ∀i ∈ E f (i) = F(∗ i) .
78
P.A. Loeb
Note that B E is internal for each E ∈ E (I ) and that there exists an internal F : ∗ I → A such that f (i) = F(∗ i) for all i ∈ E. Therefore, {B | E ∈ E (I )} has the E finite intersection property. Since its cardinality is smaller than κ+ , there exists an F ∈ B E for all E ∈ E (I ). This F is an internal extension of f .
References 1. R.M. Anderson, A non-standard representation for Brownian motion and Itô integration. Isr. J. Math. 25, 15–46 (1976) 2. C.C. Chang, H.J. Keisler, Model Theory (North-Holland, Amsterdam, 1973) 3. N.G. de Bruijn, P. Erd˝os, A color problem for infinite graphs and a problem in the theory of relations. Proc. Kon. Nederl. Akad. v. Wetensch. Ser. A 54, 371–373 (1951) 4. A.E. Hurd, P.A. Loeb, An Introduction to Nonstandard Real Analysis (Academic Press, Orlando, 1985) 5. P.A. Loeb, Conversion from nonstandard to standard measure spaces and applications in probability theory. Trans. Am. Math. Soc. 211, 113–122 (1975) 6. P.A. Loeb, H. Osswald, Nonstandard integration theory in topological vector lattices. Monatshefte fur Math. 124, 53–82 (1997) 7. W.A.J. Luxemburg, A general theory of monads, in Applications of Model Theory to Algebra, Analysis, and Probability, ed. by W.A.J. Luxemburg (Holt, Rinehart, and Winston, New York, 1969) 8. A. Robinson, On generalized limits and linear functionals. Pac. J. Math. 14, 269–283 (1964) 9. A. Robinson, Non-standard Analysis (North-Holland, Amsterdam, 1966) 10. A. Robinson, E. Zakon, A set-theoretical characterization of enlargements, in Applications of Model Theory to Algebra, Analysis, and Probability, ed. by W.A.J. Luxemburg (Holt, Rinehart, and Winston, New York, 1969) 11. J. Sacks, Saturated Model Theory (Benjamin W.A., Reading, 1972) 12. K. Stroyan, W.A.J. Luxemburg, Introduction to the Theory of Infinitesimals (Academic Press, New York, 1976) 13. N. Vakil, Real Analysis Through Modern Infinitesimals (Cambridge University Press, Cambridge, 2011)
Chapter 3
Topology and Measure Theory Peter A. Loeb
3.1 Metric and Topological Spaces We begin this chapter by showing that nonstandard analysis simplifies many of the ideas in the study of metric and topological spaces. Most of the initial results on topology can be found in Robinson’s book [34]. After some introductory material, we will present a few more recent applications of nonstandard analysis to topology. The chapter concludes with a quick introduction to the applications of nonstandard analysis in measure and probability theory. For this purpose, we assume the reader is familiar with the Carathéodory Extension Theorem. A full introduction to this rich theory, starting from first principles, is given in Horst Osswald’s chapters in this book. We will use the phrase “in a nonstandard extension” to mean a superstructure that is a nonstandard extension of the standard structure containing the initial spaces with which we are working. We will assume that it is at least an enlargement. The standard structure will contain the real numbers. We will write ∗ N∞ for ∗ N\N. The property that our nonstandard model is an enlargement means that for any standard set A in the standard superstructure, there is a hyperfinite set F with {∗ a : a ∈ A} ⊆ F ⊆ ∗ A. We will often use another principle that is valid for a denumerably comprensive or ℵ1 -saturated nonstandard model; in particular, it is valid for an ultrapower model: Any ordinary sequence (i.e., with index set N) in an internal set S is the initial segment of an internal sequence with index set ∗ N taking values in S. With metrics and topologies, one generalizes the notion of “closeness” available in the real and complex number systems. One generalization is provided by metric spaces (X, ρ). Recall that a metric ρ on the set X is a nonnegative real valued function on X × X satisfying the following: For all x, y, z in X , ρ(x, x) = 0, ρ(x, y) = ρ(y, x), ρ(x, z) ≤ ρ(x, y) + ρ(y, z), and if ρ(x, y) = 0, then x = y. If we do not have the P.A. Loeb (B) Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana, IL 61801, USA e-mail:
[email protected] © Springer Science+Business Media Dordrecht 2015 P.A. Loeb and M.P.H. Wolff (eds.), Nonstandard Analysis for the Working Mathematician, DOI 10.1007/978-94-017-7327-0_3
79
80
P.A. Loeb
last property, that is, if we may have ρ(x, y) = 0, for x = y, then ρ is called a semimetric. If X is a vector space, the metric on X is often given by a norm. Recall that this is, a nonnegative function x −→ x on X such that for every scalar α, αx = |α| x (whence 0 = 0 + 0 = 2 0 = 0), x + y ≤ x + y, and x > 0 if x = 0. If the last property does not hold, that is, if we may have an x = 0 for which x = 0, then we use the term seminorm. A norm on a vector space X produces a metric given by ρ(x, y) = x − y for all x, y in X . If the norm is only a seminorm, the corresponding metric is then a semimetric. Of course, a seminorm becomes a norm on the space of equivalence classes where x is equivalent to y when x − y = 0. The resulting norm is well-defined since |x − y| ≤ x − y. Example 3.1.1 An important seminorm in integration theory is given by the mapping f −→ | f | on the space of integrable functions. It is used, for example to define L 1 spaces. In the case of a unit mass at a point x ∈ X , the integrable functions are the real-valued functions on X and the seminorm is given by f −→ | f (x)|. As x ranges over X , this seminorm produces the topology of pointwise convergence. An important seminorm defined on the space of continuous real-valued or complexvalued functions on a topological space (X, T ) replaces a single point with a compact set K and maps f to max x∈K | f (x)|. As K ranges over the set of compact subsets of X , this seminorm produces the topology of uniform convergence on compact subsets of X . For the rest of this section we will speak of a metric space, leaving for the reader the generalization to semimetric spaces. In a metric space, an open ball with center x and radius r > 0, is denoted by B(x, r ) := {y ∈ X : ρ(x, y) < r }. Notice that for points y, the larger the number of balls centered at x that also contain y, the closer y is to x. In a nonstandard extension of a metric space, we define the monad of a point x ∈ X by setting monad(x) = μ(x) :=
∗
B(x, r ) = y ∈ ∗ X :
∗
ρ(x, y) 0 ,
where the intersection is over all positive standard values of r . We use this monad in the same way we use monads on the real line. For example, a standard set O is called open if for each x ∈ O, μ(x) ⊂ ∗ O. There are settings where a metric will not capture the notion we want; we need a topological space. We can talk about topological spaces using a base at each point in essentially the same way that we talk about metric spaces using balls. Definition 3.1.2 Fix a nonempty set X . A neighborhood filter base at a point x ∈ X is a nonempty collection Bx of nonempty subsets of X such that ∀U, V ∈ Bx , ∃W ∈ Bx such that x ∈ W ⊆ U ∩ V.
3 Topology and Measure Theory
81
A subset O of X is an open set with respect to the collection {Bx : x ∈ X } if for each x ∈ O there is a U ∈ Bx with x ∈ U ⊆ O. If the elements of Bx are open sets, then the collection Bx is called an open base at x. We will assume in what follows that X and a neighborhood filter base Bx at each point x ∈ X are given. Notice that in general, we do not require that elements of Bx are open sets. Nevertheless, we still have the following result. Theorem 3.1.3 The open subsets of X form a topology on X . That is, they include X itself and the empty set, and they are stable with respect to the operations of taking finite intersections and arbitrary unions. Problem: Prove Theorem 3.1.3. Example 3.1.4 An example of a base not given by balls in a metric space is the base at points for the topology of pointwise convergence of real-valued functions on an uncountable set X . Here, each point is a function f , and an element of the base specifies a finite number of points x1 , . . . , xn in X and an ε > 0. A function g is in the open base set given by these parameters if for 1 ≤ i ≤ n, |g(xi ) − f (xi )| < ε. To see that the condition for a neighborhood filter base is met, simply take two such sets for a given f , take the union of the two sets of points in X and the smaller of the two ε’s. This gives an open base set contained in the two initial ones. Definition 3.1.5 Given x ∈ X , the monad of x is monad(x) = μ(x) :=
∗
U.
U ∈Bx
As with balls in a metric space, we will indicate that y ∈ μ(x) by writing y x. The near-standard points of ∗ X are the points in the monad of some standard point of X. Remark 3.1.6 Since any finite intersection of elements of Bx contains another element of Bx , there is a W ∈ ∗ Bx with W ⊂ μ(x). In a metric space, one would take a ball of infinitesimal radius. Example 3.1.7 For pointwise convergence on [0, 1], the monad of a real-valued function f consists of all internal ∗ R-valued functions g on ∗ [0, 1] such that at each standard x, g(x) f (x). Proposition 3.1.8 A set O ⊆ X is open if and only if for each x ∈ O, μ(x) ⊆ ∗ O. Proof First we note that for each U ∈ Bx , μ(x) ⊂ ∗ U . On the other hand, if μ(x) ⊆ ∗ O, then ∃W ∈ ∗ Bx with W ⊆ μ(x) ⊆ ∗ O, and so “∃W ∈ Bx with W ⊆ O” must also be true for the standard superstructure by downward transfer.
82
P.A. Loeb
Problem: Show that the elements of the neighborhood filter base for pointwise convergence of real-valued functions on [0, 1] are open sets. Answer: Let the basic open set U ∈ B f be given by a finite number of points r1 , . . . , rn in the interval [0, 1] and an ε > 0. That is, g ∈ U if for 1 ≤ i ≤ n, |g(ri ) − f (ri )| < ε. Given such a g, find δ > 0 such that for each i, |g(ri ) − f (ri )|+ δ < ε. The basic open set V ∈ Bg determined by r1 , . . . , rn and δ is contained in U . Problem: Let T be the collection of all open sets in X . Use monads to show that T has the following properties: (i) The space X and the empty set ∅ are open. (ii) Finite intersections and arbitrary unions of open sets are open. Answer: If x ∈ X , then μ(x) ⊂ ∗ X , and there is no x ∈ ∅. Part ii follows from that fact that for a finite collection of sets O1 , . . . , On , we have ∗ O1 ∩ · · · ∩ ∗ On = ∗ (O ∩ · · · ∩ O ), and for an arbitrary collection of sets O , the nonstandard exten1 n α sion of each member, ∗ Oα , is contained in the nonstandard extension of the union of the members. Different bases, such as open balls or open rectangles in the plane, give rise to the same topology just as they can give rise to the same monads of standard points. Given a topology T , one can define a maximal base and the monad for the topology at each x ∈ X by setting Bx = {U ∈ T : x ∈ U }, μ(x) =
∗
U.
U ∈T x∈U
Fix an open base Bx at each x ∈ X . Given A ⊆ X , and x ∈ X , we say that x is a point of closure of A if for each U ∈ Bx , U ∩ A = ∅, or what is the same thing, ¯ μ(x) ∩ ∗ A = ∅. We write A¯ for the set of points of closure of A. Clearly, A ⊆ A. ¯ A set A is called closed if A = A. It is easy to establish the following result; the proofs are left as an exercise. Proposition 3.1.9 A set A is closed if and only if its complement X \A is open. Proposition 3.1.10 The set X and the empty set ∅ are closed. Moreover, finite unions and arbitrary intersections of closed sets are closed. Recall that If D ⊆ X and D¯ = X , then we say that D is a dense subset of X . If X contains a countable dense subset, we say that X is separable. For example, the rational numbers are dense in R. Definition 3.1.11 The interior of a set E is the set of all x for which there is a set U ∈ Bx with U ⊆ E. Equivalently, it is the set of all x such that μ(x) ⊆ ∗ E. We write E ◦ for the interior.
3 Topology and Measure Theory
83
3.2 Continuous Mappings Now assume that (X, S) and (Y, T ) are two topological spaces. Definition 3.2.1 A function f from X into Y is continuous at x ∈ X if for each V ∈ T with f (x) ∈ V , there is a U ∈ S with x ∈ U such that f [U ] ⊆ V . Equivalently, we want ∗
f [monadS (x)] ⊆ monadT [ f (x)],
that is, z x ⇒ ∗ f (z) f (x). We say that f is continuous or continuous on X if it is continuous at each x ∈ X . Problem: Show these standard and nonstandard conditions are equivalent. Answer: If f is continuous at x then μ(x) maps into ∗ V for each open V ∈ B f (x) , so μ(x) maps into μ( f (x)). If the converse holds, then for any V ∈ B f (x) , there is a W ∈ ∗ Bx with W ⊆ μ(x), and W maps into ∗ V , so downward transfer gives the desired result. Theorem 3.2.2 A function f from X into Y is continuous on X if and only if for each open set O contained in Y , f −1 [O] is open in X . A function f from A ⊆ X into Y is continuous at each point of A if and only if for each V ∈ T , there is a U ∈ S such that f −1 [V ] ∩ A = U ∩ A. Proof Exercise Recall that if there is a one-to-one map from (X, S) onto (Y, T ) which is continuous and its inverse is continuous, then we say these two spaces are topologically equivalent or homeomorphic.
3.3 Convergence Assume we are given a topological space X and an open base Bx at each x ∈ X . (For a metric space, the open base at x is the set of open balls centered at x.) Recall that a sequence xn converges to a point x ∈ X if it is eventually in each U ∈ Bx . That is, there is an m ∈ N such that for all n ≥ m, xn ∈ U . Proposition 3.3.1 A sequence xn converges to a point x ∈ X if and only if for every H ∈ ∗ N∞ , x H x. Proof Exercise. Recall that a point x is a cluster point of a sequence xn if the sequence xn is frequently in every U ∈ Bx . That is, for every m ∈ N, there is an n ≥ m with xn ∈ U .
84
P.A. Loeb
Proposition 3.3.2 A point x is a cluster point of a sequence xn if and only if there is an H ∈ ∗ N∞ with x H x. Proof Exercise. A generalization of sequential convergence, used even in such simple settings as Riemann integration theory, replaces the natural numbers with a directed set. A directed set D is a set supplied with a transitive relation such that for each a and b in D, a a, b b, and there is a c ∈ D with a c and b c. Partitions play the role of the directed set in Riemann integration theory. The generalization of a sequence is given by a net. This is a function xa from a directed set into a given topological space X . It converges to x ∈ X if for all U ∈ Bx , there is a c ∈ D such that for all a c, xa ∈ U . That is, the net is eventually in U . A point x is a cluster point of a net xa if for each U ∈ Bx and each c ∈ D, there is an a c with xa ∈ U . That is, the net is frequently in U . The notion of a “subnet” is fairly complicated (see [23]). Problem: Show that if D is a standard directed set, then there is a c ∈ ∗ D with ∗ a c for each standard a ∈ D. Answer: Imbed the set {∗ a : a ∈ D} in a hyperfinite subset of ∗ D. Problem: Give the nonstandard criterion for a net to converge and for a point to be a cluster point of a net. Answer: The conditions are similar to the conditions for sequences.
3.4 More on Topologies One often has two topologies, T1 and T2 , where every set open for the first is open for the second; i.e., T1 ⊆ T2 . We say T1 is weaker or coarser than T2 and T2 is stronger or finer than T1 . It is clear that the weaker the topology, i.e., the fewer open sets there are, the larger the monads will be. The collection consisting of just X and the empty set is the weakest possible topology on X . The full power set of X is the strongest possible topology, and this contains any given collection of sets. It follows that any collection C of subsets of X generates a topology, namely, the intersection of all topologies containing the collection. This is the weakest topology containing C. We also have the notion of a base for a topology rather than a base at each point. A base B for a topology is a collection of open sets such that for each open set O and each x ∈ O, there is a U ∈ B with x ∈ U ⊆ O. Given a base, it is easy to see that a set is open if and only if it is a union of sets from the base. It is also easy to see that B is a base if and only if for each x ∈ X , {U ∈ B : x ∈ U } is an open base at x. This open base at x may not be the one you would choose. For example, the disks in the plane with rational centers and rational radii form a base, but some points are no longer centers of balls in this base.
3 Topology and Measure Theory
85
There are two topologies on the nonstandard extension ∗ X of a topological space that are important in the literature. The first, called the Q-topology by Robinson, has a base consisting of the sets in ∗ T . That is, each internal open set is open in this topology, but in general, there are external sets that are also open in this topology. The second important topology, called the S-topology by Robinson, has base B = {∗ U : U ∈ T }. Notice that if x is standard and y ∈ μ(x), then every S-open set that contains x also contains y. Thus, in general, the S-topology is not “Hausdorff.” Recall that a topological space is called a Hausdorff space if distinct points are contained is disjoint open sets, or what is the same thing, distinct standard points have disjoint monads. A topological space is said to satisfy the first axiom of countability if each point has a countable base Bx . A topological space is said to satisfy the second axiom of countability if there is a countable base for the topology. In a metric space, balls of radii 1/n form a base at each point. There may, however be no countable base for the topology. In Euclidean n-space, balls with rational centers and rational radii form a countable base for the topology. For a Hausdorff space, we have the important standard part map st : ns(∗ X ) −→ X defined as follows: For each x ∈ X and each y ∈ μ(x), set st(y) = ◦ y = x. Even for a non-Hausdorff space, we can define the standard part of a set B ⊆ ∗ X , by setting st(B) := {x ∈ X : μ(x) ∩ B = ∅}. Theorem 3.4.1 (Luxemburg [30]) Assume that card(T ) < κ and we are working with a κ-saturated enlargement. Then for each internal set B ⊆ ∗ X , st(B) is closed. Proof Assume that z ∈ X is a point of closure of st(B); we must show that z ∈ st(B), i.e., μ(z) ∩ B = ∅. Given U ∈ T with z ∈ U , ∃x ∈ U ∩ st(B). Since x ∈ st(B), ∃y ∈ μ(x) ∩ B ⊆ ∗ U ∩ B. Since ∗ U ∩ B = ∅ for each open U containing z, it follows from saturation that μ(z) ∩ B = ∅. Note that for the last proof, one can use just ℵ1 -saturation if there is a countable base Bx at each point x ∈ X .
3.5 Compact Spaces Recall that an open covering of a set A ⊆ X is a collection of open sets in X such that each point of A is in at least one of the open sets. A subset A ⊆ X is called compact if every open cover has a finite subcover. Of course, A may be all of X . By DeMorgan’s law, X is compact if and only if every family of closed sets with the finite intersection property (this means that every finite subset has a nonempty intersection) itself has a nonempty intersection. The nonstandard extension of a finite set {a1 , . . . , an } is just the equivalent finite set {∗ a1 , . . . , ∗ an }. Compactness generalizes finiteness. Robinson’s criterion for
86
P.A. Loeb
compactness makes this clear. One does not have just the nonstandard extension of the original points in a nonstandard extension, but one does not get very far from the original points. Theorem 3.5.1 (Robinson [34]) A set A ⊆ X is compact if and only if for each y ∈ ∗ A, there is an x ∈ A with y ∈ μ(x). In particular, X is compact if every point of ∗ X is nearstandard. Proof Assume A is compact but there is a y ∈ ∗ A not in the monad of any x ∈ / ∗ Ox . The family A. Then each x ∈ A is contained in an open set Ox with y ∈ {Ox : x ∈ A} covers A and therefore has a finite subcover {O1 , . . . , On }. Now n O , ∗ A ⊆ ∪n ∗ O . Since y ∈ / ∗ Oi , for 1 ≤ i ≤ n, y ∈ / ∗ A. This since A ⊆ ∪i=1 i i i=1 ∗ contradiction shows that if X is compact, then every point of X is nearstandard. Now assume that A is not compact, i.e., there is a collection U = {Oδ : δ ∈ D} of open sets such that no finite subcollection covers A. Let B be a hyperfinite collection / V for in ∗ U with ∗ Oδ ∈ B for each δ ∈ D. Then there is a y ∈ ∗ A such that y ∈ each V ∈ B. This point y is not in the monad of any point in A since for each x ∈ A, / ∗ Oδ , whence y ∈ / μ(x). there is an δ with x ∈ Oδ but y ∈ Recall that a set in a metric space is bounded if it is contained in a ball B(a, R) about some point of the space. Theorem 3.5.2 (Heine-Borel) A compact subset A of a metric space is closed and bounded. A closed and bounded subset of Rn is compact. Proof Exercise. Recall that a topological space (X, T ) is called regular if for each x ∈ X , the singleton set {x} is closed, and for each closed set C with x ∈ / C, there are disjoint open sets U and V with x ∈ U and C ⊆ V . That is, singleton sets are closed, and for each x and open U containing x there is an open set W with x ∈ W ⊆ W ⊆ U . Theorem 3.5.3 (Luxemburg [30]) Assume that we are working in a κ-saturated enlargement, and let (X, T ) be a regular space with card(T ) < κ. If B is an internal set of nearstandard points in ∗ X , then st(B) is compact. Proof By Theorem 3.4.1, C := st(B) is closed in X . Let {Fα } be a collection of closed subsets of C such that every finite subcollection has a nonempty intersection. For n F, each finite subcollection Fα1 , . . . , Fαn there is a b ∈ B with x := st(b) ∈ ∩i=1 i whence, if U is an open subset of X with U ∩ Fi = ∅ for i = 1, . . . , n, then b ∈ / ∗U , since otherwise x ∈ U . By saturation, there is a b0 ∈ B such that for each finite subcollection of the family {Fα } and each open set U whose closure misses each set in that finite subcollection, b0 ∈ / ∗ U . Fix x ∈ X with b0 ∈ μ(x). We then have x ∈ Fα for each α since if there is an α with x ∈ / Fα , then there is an open neighborhood U / ∗ U . But this is contradicts the assumption that of x with U ∩ Fα = ∅, whence b0 ∈ b0 ∈ μ(x).
3 Topology and Measure Theory
87
Problem: Complete the following alternative proof of Theorem 3.5.3: Let C := st(B), and fix y ∈ ∗ C. If U is a standard open set with y ∈ ∗ U , then since ∗ U ∩ ∗ C = ∅, U ∩C = ∅. If x ∈ U ∩C, then by the definition of C, ∃b ∈ B with b ∈ μ(x) ⊂ ∗ U . Thus, for each standard open U with y ∈ ∗ U , there is a b ∈ B ∩ ∗ U . By saturation, ∃b0 ∈ B with b0 ∈ B ∩ ∗ U for each standard open U such that y ∈ ∗ U . Fix x ∈ C with b0 ∈ μ(x). You must show that y ∈ μ(x). Answer: If y ∈ / μ(x), then there is an open set V with x ∈ V and y ∈ / ∗ V ; by regularity there is an open set U with x ∈ U ⊆ U ⊆ V . It follows that x ∈ U and y ∈ X \ ∗ U , whence, b0 ∈ ∗ U but b0 ∈ X \∗ U . This is a contradiction. Theorem 3.5.4 If K ⊆ X is compact and f : K −→ Y is continuous at each point of K , then the image f [K ] is compact in Y . Proof Exercise. Corollary 3.5.5 A real-valued function continuous on a compact set K achieves a maximum and a minimum value at points of K . Suppose that (X, T ) is a topological space and B is a base for the topology. It is easy to see that X is compact if any covering by sets from B has a finite subcovering. Theorem 3.5.6 Let X be a topological space. If X is compact then every sequence in X has a cluster point. The converse holds if X satisfies the second axiom of countability, that is, if X has a countable base for the topology. Proof Suppose xn is a sequence in X , and X is compact. Then for any H ∈ ∗ N∞ , if x H ∈ μ(x), x is a cluster point of the sequence. For the converse, if X has a countable base, one needs only show that every decreasing sequence of closed sets has a nonempty intersection. Choosing a point in each of the closed sets produces a sequence; any cluster point is in the intersection of the sequence of closed sets. Recall that the S-topology is the topology on ∗ X with base {∗ U : U ∈ T }. Salbany and Todorov [35] have shown that the following fact is important when discussing compactifications. Theorem 3.5.7 The S-topology makes ∗ X compact. Proof Exercise. Problem: The setting of this problem is the d-dimensional normed vector space Rd supplied with a norm that is not necessarily the Euclidean norm. Let B(0, 2) denote the closed ball of radius 2 about the origin 0 in Rd . Let K (s) denote the maximum number of points one can “pack” into B(0, 2) when one point is at 0 and the distance between pairs of distinct points is at least s. It is known, for example, that for the Euclidean norm in the plane R2 , K (1) = 19 (see [5, 32]). Prove or disprove the following conjecture: For any δ > 0 in R, K (1 − δ) ≥ K (1) + 1. (The result turned out to be crucial in work on the Besicovitch Covering Theorem in [15].)
88
P.A. Loeb
Answer: Consider what happens when δ 0. Problem: The “mushroom space” is an example of a nonregular space where things “go wrong”. Here, X is the unit square {(x, y) : 0 ≤ x ≤ 1, 0 ≤ y ≤ 1}. The topology is generated by Euclidean neighborhoods except for points (x, 0). Here a typical neighborhood consists of (x, 0) together with the set {(ζ, y) : (x −ζ)2 + y 2 < r 2 , y > 0} for some r > 0. The restriction of this topology to the set L = {(x, 0) : 0 ≤ x ≤ 1} is the discrete topology, i.e., every subset is open. The point (1/2, 0) cannot be separated from its closed complement {(x, 0) : x = 1/2, 0 ≤ x ≤ 1} in L. Let B be the set {(ζ, ε) : ζ ∈ ∗ [0, 1]}, where ε is a positive infinitesimal. Show that B provides a counter example to Theorem 3.5.3.
3.6 Product Spaces The topology of pointwise convergence on [0, 1] can be generalized as follows. Instead of [0, 1], we take an arbitrary index set I. Instead of associating the real line with each α ∈ I, we let X α be a topological space. For the development here, we assume that there is some set S in our standard superstructure containing all of these topological spaces X α . That is, there is an upper bound to the level at which they occur in the superstructure. Now the point set α∈I X α is the set of all functions f on I with f (α) ∈ X α for each α ∈ I. The monad of such an element f consists of all internal g ∈ ∗ α∈I X α with g(α) f (α) for each standard α ∈ I. Such a g is a mapping on ∗ I with g(β) ∈ X β for each β ∈ ∗ I, but the values of g at nonstandard indices are not relevant in determining whether g is in the monad of f . The space α∈I X α is called a product space, and the topology is called the product topology. Theorem 3.6.1 The product of Hausdorff spaces is Hausdorff. Proof Exercise. The nonstandard proof of the following important theorem is considerably simpler than standard proofs in the literature. Theorem 3.6.2 (Tychonoff) The product of compact spaces is compact. Proof If X = α∈I X α and g ∈ ∗ X , then for each standard α ∈ I, there is an xα ∈ X α with g(α) xα . (The xα ’s are unique if the spaces X α are Hausdorff.) The element f ∈ X with f (α) = xα for each α ∈ I is in X and g ∈ μ( f ).
3.7 Relative Topologies Let X be a space with a topology, and let A be a subset of X . Recall that one can restrict the topology on X to A by calling a subset of A open if it is the intersection of A with an open subset of X . Thus, if Bx is a base of open sets for the original
3 Topology and Measure Theory
89
topology and x ∈ A, the collection {U ∩ A : U ∈ Bx } is a base at x for the restricted topology. If X is a metric space, the restriction of the metric to pairs of points in A gives the appropriate metric on A. In all of this, one just ignores points outside of A. One does have to recall that an open subset of A in the restricted topology, e.g., A itself, may not be open in all of X . One also speaks of the relative topology on A. Problem: Describe the relatively open subsets of A in terms of monads for the topology on X .
3.8 Uniform Continuity and Uniform Spaces So far we have discussed ways to determine closeness to any given point of a space. If the space is supplied with a norm, a metric, or even a family of semimetrics, then we can consider in a “uniform way” closeness for all pairs of points in the space. We start with a simple extension of results that have already been established for the real line. Theorem 3.8.1 A map f from a set A contained in a metric space (X, d) into a metric space (Y, ρ) is uniformly continuous on A if and only if for all x, y ∈ ∗ A, with x y, ∗ f (x) ∗ f (y). Proof Assume x y ⇒ ∗ f (x) ∗ f (y). Pick ε > 0 in R. Then the sentence (∃δ ∈ R+ )(∀x, y ∈ A)[d(x, y) < δ ⇒ ρ( f (x), f (y)) < ε] holds for the nonstandard extension of the structure and therefore for the original structure. The converse proof is similar to the proof for R. Theorem 3.8.2 A continuous map f from a compact set A contained in a metric space (X, d) into a metric space (Y, ρ) is uniformly continuous on A. Proof Assume x y in ∗ A. Let z = st x = st y. Since A is compact, z ∈ A, and so f (x) f (z) ∗ f (y).
∗
To amplify the notion of uniform closeness, we now turn to the topic of uniform spaces. The rest of this section is compiled from a draft by Manfred Wolff. Let P be a set of semimetrics on a nonempty set X . For each ρ ∈ P and for every ε > 0 set Bε,ρ = {(x, y) ∈ X × X : ρ(x, y) < ε}. The collection of finite intersections of these sets form the base of a filter U = U(P) on X × X . That is, given ρ ∈ P and ε > 0, since ρ(x, x) = 0, Bε,ρ = ∅. Moreover, the family of finite intersections of the sets Bε,ρ is, by definition, stable under the operation of taking finite intersection. The collection U(P) is the collection of supersets of sets in the filter base.
90
P.A. Loeb
Given any filter U on X × X , for each U ∈ U, we will write U −1 for the set {(y, x) ∈ X × X : (x, y) ∈ U }, and we will write U ◦ W for the set {(x, z) ∈ X × X : ∃y ∈ X with (x, y) ∈ W and (y, z) ∈ U }. We let denote the diagonal {(x, x) : x ∈ X }. Different sets of semimetrics may define the same filter U(P). The following definition characterizes the filter. Definition 3.8.3 Let U be a filter on X × X satisfying the following properties: (a) U ∈ U ⇒ ⊆ U. (b) U ∈ U ⇒ U −1 ∈ U. (c) U ∈ U ⇒ ∃V ∈ U with V ◦ V −1 ⊆ U. Then U is called a uniformity, and the pair (X, U) is called a uniform space. Problem: Let P be a set of semimetrics on a nonempty set X . Show that the filter U(P) is a uniformity. Remark 3.8.4 It can be shown, that to every uniformity V there is a set P of semimetrics such that V = V(P). The monad of a filter is the intersection of the nonstandard extensions of sets in a generating filter base. For U = U(P), the monad μU = {(x, y) ∈
∗
X × ∗ X : ∗ ρ(x, y) 0 for all standard ρ ∈ P}.
The monad μU is an equivalence relation on ∗ X . That is, for each x, y, z in ∗ X and each standard ρ ∈ P, ∗ ρ(x, x) = 0, ∗ ρ(x, y) 0 ⇒ ∗ ρ(y, x) 0, and ∗ ρ(x, y) 0 and ∗ ρ(y, z) 0 ⇒ ∗ ρ(x, z) 0. Problem: Let X be a nonempty set, and let W be a filter on X × X . Recall that the monad of W is the set {(x, y) ∈ ∗ X × ∗ X : ∀ W ∈ W, (x, y) ∈ ∗ W }. Show that W is a uniformity if and only if its monad is an equivalence relation on ∗ X . With every uniformity U on X there is an associated a topology TU . That is, for each x ∈ X , the neighborhood filter base consists of the sets Bx,U = {y ∈ X : (x, y) ∈ U }, with one such set for each U ∈ U. The corresponding monad μ (x) at x is {y ∈
∗
X : (x, y) ∈ ∗ U for all standard U ∈ U}.
If U = U(P), then μ (x) = {y ∈
∗
X : ∗ ρ(x, y) 0 for all standard ρ ∈ P}.
For the rest of this section, we will assume that U = U(P) and topological considerations refer to TU . The proof of the following result is left to the reader.
3 Topology and Measure Theory
Proposition 3.8.5 The topology TU is Hausdorff if and only if
91
U ∈U
U = .
Example 3.8.6 The seminorms described in Example 3.1.1 are, of course, seminorms that produce a uniformity and a corresponding topology. Particular examples are the topology for pointwise convergence and the topology for uniform convergence on compact sets on a space of continuous functions. Problem: For every continuous function f on the unit interval [0, 1] define the semimetric ρ f (x, y) = | f (x) − f (y)|. Show that this set of semimetrics defines the same uniformity as the single metric d(x, y) = |x − y|. Let f be a mapping from a set X into a set Y . We will write f × f for the mapping X × X → Y × Y , where f × f (u, v) = ( f (u), f (v)). Definition 3.8.7 Let (X, U) and (Y, V) be two uniform spaces. A mapping f : X −→ Y is called uniformly continuous if for every V ∈ V there exist U ∈ U with f × f (U ) ⊆ V . Problem: Show that f is uniformly continuous if and only if ∗ f × ∗ f (μU ) ⊆ μV , i.e., if and only if ∗ f (x) ∗ f (y) whenever x y. Problem: Show that a uniformly continuous mapping is continuous for the corresponding topologies. Problem: Let (X, T ) be a compact topological space, and let C(X ) be the space of continuous real-valued functions on X . (1) For every f ∈ C(X ), Let ρ f (x, y) = | f (x) − f (y)|. Show that the set P = {ρ f : f ∈ C(X )} induces a uniformity U that in turn induces the given topology. (2) Let V be an arbitrary uniformity on X inducing the given topology T . Let (Y, W) be another uniform space. Show that every continuous mapping f : (X, V) −→ (Y, W) is uniformly continuous. Hint: Recall the proof of Theorem 3.8.2. (3) Let V be an arbitrary uniformity on X inducing the given topology. Then V = U of part (1). Hint: consider the identity I on X , and apply (2) in both directions, that is, to I and to I −1 . We will write UT for this unique uniformity. Definition 3.8.8 Let (X, U) be a uniform space. (a) A filter C on X is called a Cauchy filter if to every U ∈ U there exists a C ∈ C such that C × C ⊆ U . (b) Let A be an upwards directed set and (xα )α∈A be a net in X . The net is called a Cauchy net if the filter of sections of the net is a Cauchy filter. Problem: Prove the following assertions: (a) C is a Cauchy filter if and only if for all x, y in the monad μC of C x y holds. (b) (xα )α∈A is a Cauchy net if and only if xα xβ for all α, β that are infinitely large, that is greater than every standard α ∈ A. (c) Every convergent filter is a Cauchyfilter.
92
P.A. Loeb
(d) If C is a Cauchy filter in (X, U) and if f is a uniformly continuous mapping from (X, U) to another uniform space (Y, V), then the filter f (C) is a Cauchy filter in (Y, V). (e) Let (X, T ) be a compact Hausdorff space, equipped with its unique uniformity UT . Show that every Cauchy filter is convergent. Definition 3.8.9 A uniform space (X, U) is called complete if every Cauchy filter is convergent. Remark 3.8.10 To every uniform space (X, U) there exist another uniform space (Y, V) that is complete, and an injective uniformly continuous mapping f from (X, U) onto a dense subset of Y . The space (Y, V) is uniquely determined up to obvious isomorphisms and is called the completion of (X, U). A construction of the completion via nonstandard analysis may be found in [16].
3.9 Nonstandard Hulls If one takes the finite (i.e., limited) nonstandard rational numbers modulo the infinitesimal ones, i.e., [∗ Q ∩ Fin(∗ R)]/[∗ Q ∩ μ(0)], one obtains the real numbers R. A similar construction, applied to infinite dimensional spaces, produces spaces that are new. These are the subject of this section. The development of these new spaces was initiated first by W.A.J. Luxemburg [30] and then C.W. Henson and L.C. Moore [18]. Throughout this section, we will assume we are working with an ℵ1 -saturated enlargement of our standard structure. We let (X, ρ) be a metric space. The set Fin(∗ X ) consists of the finite, that is, limited elements of ∗ X . These are the elements y ∈ ∗ X for which ∗ ρ(y, x) is limited for some, and therefore every x ∈ X . The relation is an equivalence relation on Fin(∗ X ). Let Xˆ denote the set of equivalence classes {μ(x) : x ∈ Fin(∗ X )}. Here, of course, μ(x) = {y ∈ ∗ X : y x}. Note that x need not be a standard point. The space Xˆ forms a metric space when supplied with the metric ρ, ˆ where ρ(μ(x), ˆ μ(y)) = st(∗ ρ(x, y)). It is easy to see that ρˆ is well defined and a metric. For example, ρ(μ(x), ˆ μ(y)) = 0 iff x y iff μ(x) = μ(y). Definition 3.9.1 The space ( Xˆ , ρ) ˆ is called the nonstandard hull of (X, ρ). Theorem 3.9.2 If follows from ℵ1 -saturation that ( Xˆ , ρ) ˆ is complete. Proof Let μ(ai ), i ∈ N be a Cauchy sequence in Xˆ , and pick a sequence ai : i ∈ N of representatives. For each k ∈ N, ∃n(k) so that if i ≥ n(k) and j ≥ n(k), ∗ then ρ(μ(a ˆ i ), μ(a j )) < 1/k, whence ρ(ai , a j ) < 1/k. We may assume that n(k + 1) > n(k) for all k. Now use ℵ1 -saturation to extend the sequence ai : i ∈ N to an internal sequence ai : i ∈ ∗ N. It follows from the Spillover Principle that for each k ∈ N, one may pick an infinite integer η(k) such that for n(k) ≤ i ≤ η(k) and n(k) ≤ j ≤ η(k), ∗ ρ(ai , a j ) < 1/k. We may assume the η(k) are decreasing. Extend the sequence {η(k) : k ∈ N} to ∗ N. Again, by spillover, there is an infinite
3 Topology and Measure Theory
93
integer γ with n(k) ≤ γ ≤ η(k) for all k ∈ N. It follows that for all k ∈ N and all standard i ≥ n(k), ∗ ρ(ai , aγ ) < 1/k, whence μ(ai ) → μ(aγ ). The mapping x → μ(∗ x) is clearly an isometry (a distance preserving map which must, therefore, be one-to-one) of (X, ρ) into ( Xˆ , ρ). ˆ If we start with a Banach space (X, · ), the resulting standard Banach space Xˆ , built from ∗ X is called the = st(∗ x). This nonstandard hull of X . Here, ˆ· is defined by setting μ(x) construction is equivalent to the “Banach Space Ultrapower” construction, but one has the internal structure to help in the development. In general, there are new elements in Xˆ . For example, if X = 2 , then the function on ∗ N that is 1 at some fixed η ∈ ∗ N∞ and 0 elsewhere has norm 1, but it is not in the monad of any standard sequence. If X = 1 , then the function that is 1/η on {n ∈ ∗ N : 1 ≤ n ≤ η} and 0 elsewhere has norm 1 and is not in the monad of any standard sequence.
3.10 Compactifications A treatment of general compactifications, employing the treatment in [19], will be given in the chapter of this book by Matt Insall, Małgorzata Marciniak, and the author of this chapter. It uses the ideas of Salbany and Todorov [35], though related ideas have been in the nonstandard analysis literature since the initial work of Robinson [33]. The basic construction fixes a regular topological space (X, T ), and lets ∗ X have the S-topology, i.e., the topology generated by the base consisting of extensions of standard open sets. The S-topology makes ∗ X into a compact space. Using equivalence classes of remote points to form the additional points for the compactification, one obtains a large class of compactifications including end-compactifications and ˇ the Stone-Cech compactification. The space need only be regular for the construction to work.
3.11 The Base and Antibase Operators In this section, we discuss a part of joint work of the author with Jürgen Bliedtner of Frankfurt University [8]. The section deals with base operators and the topologies these operators generate. Applications in [8] not discussed here include upper and lower densities, approximate continuity, and a new construction for liftings of bounded measurable functions in the sense of [20]. We work with a set X and an algebra A of subsets of X ; we may have A = P(X ). Given set mappings s and t : A → P(X ), we write s t if for each A ∈ A, s(A) ⊆ t (A). For this section, we fix a nonstandard enlargement of a structure containing X and the real numbers. The two important operators we consider have very simple definitions, where we use A to denote the complement of a set A.
94
P.A. Loeb
Definition 3.11.1 A base operator, or just a base, on an algebra A of subsets of X is a mapping b : A → P(X ) such that b(∅) = ∅, b(X ) = X, and ∀A, B ∈ A, b(A ∪ B) = b(A) ∪ b(B). We will call e an antibase operator, or just an antibase, on A if e : A → P(X ) has the property that e(∅) = ∅, e(X ) = X, and ∀A, B ∈ A, e(A ∩ B) = e(A) ∩ e(B). The antibase e constructed from a base b by setting e(A) = (b(A)) is called the antibase associated with b. We have a similar definition for the base associated with an antibase. For each base operator b, there is a corresponding topology, the b -topology, which we will discuss below (before and in Proposition 3.11.10). Problem: Show that a base b and antibase e are increasing set mappings, and if associated, e b. Example 3.11.2 An example of an antibase is the mapping e on Rn that sends each Lebesgue measurable set A to its points of density with respect to ball differentiation using Lebesgue measure λ. That is, x ∈ e(A) iff λ (A ∩ B(x, r )) = 1. r →0+ λ (B(x, r )) lim
The associated topology is the density topology. Example 3.11.3 A base operator b : P(X ) → P(X ) occurs in potential theory when X is an open domain in Rn or a more general potential theoretic setup. For any set A ⊆ X , the base b(A) is defined by setting b(A) := {x ∈ X : A is not thin at x} . The complement of the Lebesgue spine, for example, is thin at its point. The associated topology is the fine topology. This is the coarsest topology refining the usual one so that finite superharmonic functions are continuous. Definition 3.11.4 We call any mapping E : X → P(∗ X )\ {∅} a base generating function. We write E x for the nonempty (possibly external) set that is the image of x. The operators b and e on P(X ) given by b(A) := x ∈ X : E x ∩ ∗ A = ∅ and e(A) := x ∈ X : E x ⊆ ∗ A are called the base and antibase on P(X ) generated by E. Example 3.11.5 A simple example of a base generating function is obtained by starting with a topological space (X, T ) and letting E x be the monad of x for each
3 Topology and Measure Theory
95
x ∈ X . In this case, e(A) is the interior of A and b(A) is the closure of A for each A ⊆ X. Remark 3.11.6 Given a base generating function, it is easy to check that b and e are in fact a base and antibase associated with each other on the algebra P(X ). As we now show, every base and antibase on an algebra A can be obtained from a base generating function. This gives an automatic and easy extension of these operators to the full power set of X . Theorem 3.11.7 Fix an algebra A of subsets of X together with a base operator b and the corresponding antibase operator e on A. For each x ∈ X , we set E x :=
∗
A : A ∈ A, x ∈ e (A) .
The mapping E is a base generating function on X , and the corresponding base and antibase generated by E on the full power set of X are extensions of b and e. Proof If x ∈ e(A) and e(B), then x ∈ e(A ∩ B), so A ∩ B = ∅. It follows that E x = ∅. If x ∈ e(A), then by definition, E x ⊆ ∗ A. If E x ⊆ ∗ A, then there is an internal set B ∈ ∗ A with B ⊆ E x and x ∈ ∗ e(B) ⊆ ∗ e(A), whence x ∈ e(A). It follows that for each A ∈ A, e(A) = {x ∈ X : E x ⊆ ∗ A}. Moreover, for each A ∈ A, x ∈ b(A) ⇔ x ∈ / e(A) ⇔ E x ∩ ∗ A = ∅. Remark 3.11.8 If the antibase e is originally defined on A using a base generating function F, then for each x ∈ X , Fx ⊆ E x . The theorem shows that both F and E generate the same base b and antibase e on A. We will call E the base generating function associated with b and e on A. Example 3.11.9 For the example of measure differentiation, for each x ∈ X , the set E x is the intersection of all sets ∗ A such that x is a point of density of A. This is a subset of the monad of x. Given a base generating function E, we can extend the operators b and e to bounded real-valued functions f by setting b E ( f )(x) := sup st ∗ f (z) : z ∈ E x , e E ( f )(x) := inf st ∗ f (z) : z ∈ E x . In a potential theoretic setting, B. Fuglede [14], modifying a result of Doob, found the following way to extend the base operator b to nonnegative bounded functions: b( f )(x) = sup {t ≥ 0 : x ∈ b ({ f ≥ t})} . Problem: Show that for each set A ⊆ X , 1b(A) = b E (1 A ) and 1e(A) = e E (1 A ).
96
P.A. Loeb
We now fix an algebra A of subsets of X together with a base operator b and the associated antibase operator e on A. We let E be the associated base generating function. We also let b and e denote the extensions of b and e to the full power set of X . The b-topology, described in [29], is given by the following characterization: A set O ⊆ X is open in the b-topology iff O ⊆ e(O). Equivalently, a set F ⊆ X is closed in the b-topology iff b(F) ⊆ F. It is easy to see that this definition does in fact produce a topology on X . Proposition 3.11.10 A set O ⊆ X is open in the b-topology iff for each x ∈ O, E x ⊆ ∗ O. Proof Assume O is open in the b-topology. If x ∈ O, then x ∈ e(O), so E x ⊆ ∗ O. Conversely, assume that for each y ∈ O, E y ⊆ ∗ O. Then for any given x ∈ O, there is an internal set B ∈ ∗ A with B ⊆ E x ⊆ ∗ O and x ∈ ∗ e(B) ⊆ ∗ e(O). It follows that x ∈ e(O). This shows that O ⊆ e(O), i.e., O is open in the b-topology. A base operator b is called strong on A if b(b(A)) ⊆ b(A) ∀A ∈ A, or equivalently, e(e(A)) ⊇ e(A) ∀A ∈ A. For measure differentiation, topology, and potential theory, the base operators described above are strong. Theorem 3.11.11 Assume that b is a strong base operator on A. Then for each x ∈ X , the monad of x in the b-topology is E x ∪ {x}. Proof Fix x ∈ X . By Proposition 3.11.10, E x ∪ {x} =
∗
∗ A ∪ {x} : A ∈ A, x ∈ e(A) ⊆ O : O open, x ∈ O .
We must show that if b is strong, the above set containment can be replaced with equality. Given A ∈ A with x ∈ e (A), the set A ∩ e(A) is an open subset of A since e (A ∩ e(A)) = e(A) ∩ e(e(A)) = e(A) ⊇ A ∩ e(A). Moreover, as we have shown, e (A ∩ e(A)) = e(A), so x ∈ e (A ∩ e(A)). It follows that E x ⊆ ∗ (A ∩ e(A)), whence (A ∩ e(A)) ∪ {x} is an open neighborhood of x. With additional structure, the base and antibase operators are called upper and lower densities, and the b-topology is called an abstract density topology (see Sect. 6E of [29]). See [8] for applications of nonstandard analysis in this setting. Our observations as applied to the density monad generalize results in Proposition IV.4 and its preceding remark that were established by Wattenberg for measure differentiation using intervals on [0, 1] in [40]. In [12], Eifrig used a rapid ultrafilter and a mapping x → Bx , where Bx is an internal subset of our set E x , in a paper establishing a lifting for measurable sets. The existence of a rapid ultrafilter can be shown using the Continuum Hypothesis or Martin’s Axiom. In [8], The author and Jürgen Bliedtner used the mapping x → E x together with basic nonstandard analysis to establish the existence of a strong lifting for the space of bounded measurable functions on a measure space such that the measure is finite.
3 Topology and Measure Theory
97
3.12 Measure and Probability Theory For the rest of this chapter, we assume familiarity with standard measure theory. We give a quick overview of the original construction from [24] of standard measure spaces on nonstandard models (now called “Loeb spaces”). A full introduction to this theory, starting from first principles, is given in Horst Osswald’s chapters in this book. We will use his notation for the measure spaces considered here. The principal device used in nonstandard measure theory is ℵ1 -saturation. We will always assume that we are working with an ℵ1 -saturated enlargement of a standard structure containing the real numbers R. We include two applications from the literature not discussed in other chapters of this book. The first is a special case of an approach by the author and J. Bliedtner in [7] to the martingale convergence theorem; the second deals with a construction of representing measures in potential theory initiated in [25] and [26]. Working in an ℵ1 -saturated enlargement, we can construct a hyperfinite set as the set of elementary outcomes in a conceptual experiment in the “nonstandard world”. For coin tossing, for example, can be the set of internal sequences of −1’s and 1’s of length η ∈ ∗ N∞ . Given such a hyperfinite , we can let C consist of all internal subsets of . The collection C is an internal σ-algebra, but it is also an algebra in the ordinary sense. Suppose P is an internal probability measure on (, C). For the coin tossing experiment, for example, each internal set A with internal cardinality |A|, would be given the probability P(A) = |A|/2η in ∗ [0, 1]. In the general case, on (, C) with values in the we can form a finitely additive real-valued measure P real interval [0, 1] by setting P(A) = st(P(A)). The question is, “Can we extend P to a countably additive measure on σ(C), i.e., the σ-algebra generated by C?” This is the question we consider next. We start with an arbitrary internal measure space (, C, μ). The internal measure μ does not have to take only limited values; it may even take the value +∞. When is a hyperfinite set, however, one usually sets C equal to the collection of all internal subsets of , and μ is usually an internal probability measure. In general, C is an internal σ-algebra as well as an algebra in the usual sense in . Let μ be the finitely additive, extended real-valued measure on (, C) defined at each A ∈ C by setting μ(A) = +∞ otherwise. Let μ(A) = st(μ(A)) when μ(A) is limited, and setting σ(C) denote the σ-algebra in the ordinary sense generated by C. The collection σ(C) is, in general, an external collection of subsets of . We can extend μ to a measure μ L defined on the measure completion L μ (C) of σ(C), and thus obtain a standard measure space (, L μ (C), μ L ) on , by using the Carathéodory Extension Theorem. To apply this technique, we first note that when a sequence Ai : i ∈ N, indexed by the ordinary natural numbers, consists of pairwise disjoint elements of C and the union A is also in C then A is actually a finite union since all but a finite number of the Ai ’s are empty. This follows from Proposition 2.9.8 i, but here is the simple proof: Using ℵ1 -saturation, we extend the sequence Ai : i ∈ N to an internal sequence Ai : i ∈ ∗ N; the set {m ∈ ∗ N : A ⊆ ∪1≤i≤m Ai }
98
P.A. Loeb
is internal and contains ∗N∞ , so it must contain some standard natural number since ∗N ∞ is external.
μ(Ai ) . By the Carathéodory Extension TheIt now follows that μ(A) = i∈N orem, the finitely additive measure μ has a σ-additive extension μ L defined on the completion L μ (C) of the σ-algebra σ(C). Moreover, if μ() is limited, this extension is unique. Ward Henson [17] has shown that the extension is still unique if the internal measure μ is just ∗ R-valued, and his proof also works if μ takes the value +∞. For the rest of this chapter, we shall assume that μ() is limited. Now (, L μ (C), μ L ) is an ordinary finite measure space formed on the internal set . Fix E in L μ (C). It is well known that for any ε > 0 in R, there are sets A ∈ Cδ and B ∈ Cσ with A ⊆ E ⊆ B such that μ L (B\A) < ε. By saturation, we may assume that A and B are actually sets in C. To see this, suppose that An : n ∈ N is a decreasing sequence in C with limit A. We may extend the sequence to an internal decreasing sequence indexed by ∗N, and choose an unlimited integer γ such that μ L (Aγ ) = limn∈N μ L (An ). A similar proof works for B. We leave it as an exercise to show that by saturation there is a set C ∈ C such that the symmetric difference E C is a null set in L μ (C). These set approximation properties characterize L μ (C) and have had many important applications. They have also been used in the literature to define L μ (C). Given an ∗R-valued function f on , we set ◦ f (x) = st( f (x)) if f (x) is limited in ∗R. We set ◦ f (x) = +∞ if f (x) is positive and unlimited in ∗R, and we set ◦ f (x) = −∞ if f (x) is negative and unlimited in ∗R. It follows from the set approximation properties that a function g : X → R ∪ {+∞, −∞} is measurable with respect to L μ (C) if and only if there is an internally C-measurable function f such that ◦ f = g μ -a.e. The function f is called a lifting of g. If such an f takes only limited L values, then g is integrable, and by the set approximation properties ◦
f dμ =
◦
f dμ L =
g dμ L .
(3.1)
It follows from the definition of the standard integral that Eq. (3.1) also holds when
[| f | − (| f | ∧ η)] dμ 0 ∀η ∈ ∗N∞
(3.2)
Condition 3.2 is a simple expression of the condition called S-integrability in the literature (see [2] and Chap. 6 of this book). If we know, on the other hand, that g is integrable, then it is easy to see that for a sufficiently small η ∈ ∗N∞ , replacing f with the function f · χ{| f |≤η} gives an S-integrable lifting of g. That is, with this replacement, the internal integral of f is limited and Eq. (3.1) holds. Suppose ∗ X is the nonstandard extension of a compact Hausdorff space X and μ is a limited-valued, internal measure on the internal Baire sets C in ∗ X . Then for each Borel set B ⊆ X , the set
3 Topology and Measure Theory
99
B˜ = ∪{monad(y) : y ∈ B} ˜ for is in L μ (C). A Borel measure ν on X can be defined by setting ν(B) = μ L ( B) each Borel set B ⊆ X . The measure ν restricted to the Baire sets is the standard part of the internal measure μ with respect to the weak ∗ topology on Baire measures. By Robinson’s criterion for convergence and clustering given in Sect. 3.3, this correspondence between ν and μ yields a nonstandard approach to the weak convergence of measures (see [3, 27]). In particular, one can obtain Lebesgue measure on an interval [a, b] as follows: Start with internal counting measure on the left endpoints of a hyperfinite interval partition of ∗ [a, b], all intervals having the same size, and note that this is the measure used to produce internal Riemann sums; the standard part of the internal measure is Lebesgue measure. (Also see [2].) When used in probability theory, the above general construction allows one to tackle problems of continuous parameter stochastic processes using the combinatorial tools available for discrete parameter processes. Examples are the author’s construction of Poisson processes in [24] and Anderson’s [2] representation of Brownian Motion and the Itô integral discussed in Chap. 7 of this book. As demonstrated by the work of Keisler [22], Fajardo and Keisler [13], Sun [36, 37], and others, these measure spaces have special closure properties not shared by even Lebesgue measure spaces. The above construction has yielded new standard-analysis results by many researchers in areas such as probability theory, potential theory, number theory, mathematical economics and mathematical physics. Here are six examples: Keisler’s [21] new existence theorem for stochastic differential equations, Perkins’ [31] award winning research (Rollo Davidson Prize in Probability Theory) on the theory of local time, Arkeryd’s [4] results on gas kinetics, Cutland and Ng’s work [10] on the Wiener sphere and Wiener measure discussed in Horst Osswald’s chapters in this book, Renling Jin’s work on number theory discussed in his chapter in this book, and Sun’s work in probability and economics discussed in his contribution to this book. We also note that Fields medalist Terence Tao has used Loeb measures in his recent multifaceted work [6, 38, 39]. We finish this chapter with two other applications from the literature.
3.12.1 The Martingale Convergence Theorem Our first application is a special case of the approach to the martingale convergence theorem by J. Bliedtner and the author in [7]. We start with a standard probability space (, E, P) and an increasing sequence of σ-algebras En : n ∈ N with E = σ(∪n∈N En ). We let Sn and S denote, respectively, the collections of all finite signed measures on (, En ) and (, E). We will use the notation ν|En for the restriction to En of a measure ν defined on a larger σ-algebra. Recall that an L 1 -bounded martingale h n : n ∈ N is a sequence of functions on such that for each n ∈ N,
100
P.A. Loeb
(i) h n is En -measurable, (ii) μn ∈ Sn where ∀A ∈ En , μn (A) := A h n d P, (iii) ∀m > n, μm |En = μn . (iv) supn A |h n | d P < +∞. The general technique established in [7] yields an easy proof of the following convergence theorem of Andersen and Jessen [1]. Theorem 3.12.1 (Andersen-Jessen) Fix μ ∈ S. For each n ∈ N , let μn = μ|En , and let h n be the Radon-Nikodym derivative of the nonsingular part of μ with respect to P and En . Then the L 1 -bounded martingale h n : n ∈ N converges P-almost everywhere to the Radon-Nikodym derivative of the nonsingular part of μ with respect to P. That is, dμn dμ (ω) = lim h n (ω) = lim (ω) n n dP dP for P-almost every ω ∈ . For the proof, see Theorem 3.2 of [7]. Not all martingales are generated by a measure, but nonstandard measure theory provides a way to use Andersen and Jessen’s result to establish Doob’s [11] convergence theorem for L 1 -bounded martingales. Fix an L 1 -bounded martingale h n : n ∈ N. We let (∗ , B∞ , PL ) denote the standard, complete probability space formed from the internal space (∗ , ∗E, ∗P) using the construction discussed above. Similarly, for each n ∈ ∗N, we let (∗ , Bn , νn ) denote the standard space formed from (∗ , ∗En , ∗μn ). Fix an index η ∈ ∗N∞ . The σ-algebra B = σ(∪n∈N Bn ) generated by the collection {Bn : n ∈ N} is a subset of Bη . That is, for each n ∈ N, Bn ⊆ B ⊆ Bη ⊆ B∞ . Let ν = νη |B. Given n ∈ N, we have νn = ν|Bn since for each A in the generating algebra ∗En , νn (A) = ◦ (∗μn (A)) = ◦ (∗μη (A)) = ν(A). Moreover, for each A ∈ ∗En , ◦ ∗
νn (A) = ( μn (A)) =
◦
∗
∗
◦ ∗
hn d P =
A
( h n ) d PL
A
since lim
m→∞
[|h n | − (|h n | ∧ m)] d P = 0.
That is, ∗h n is an S-integrable lifting of ◦ (∗h n ). Since the extension of νn from ∗En to PL , and the Radon-Nikodym derivative dνn /d PL = ◦ (∗h n ). By Bn is unique, νn the Andersen-Jessen Theorem, ◦ (∗h n ) → dν/d PL PL -a.e. on ∗ . The reader can now show using Egoroff’s theorem that the original sequence h n converges P-a.e.
3 Topology and Measure Theory
101
on (alternatively, see Proposition 3.4 in [7]). We remark that the limit is a function f such that ◦ (∗ f ) = dν/d PL on ∗ \U , where U is a set of PL -measure 0 in B∞ .
3.12.2 Representing Measures in Potential Theory For our second example, we work with harmonic functions on the unit disk in the complex plane C. Let Dr denote the open disk {z ∈ C : |z| < r }, and let D = D1 . Let Cr be the circle {z ∈ C : |z| = r }, and let C = C1 . All measures we consider will be Borel measures. Let P(z, x) be the Poisson Kernel (|z|2 − |x|2 )/|z − x|2 , and let x0 denote the origin. The space H1 consisting of all positive harmonic functions on D taking the value 1 at x0 is convex and compact with respect to the topology of uniform convergence on compact subsets of D, i.e., the ucc topology. It is well known that every continuous function on C has a harmonic extension on D and that not every harmonic function on D is obtained in this way. On the other hand, by the Riesz-Herglotz theorem there is for each h ∈ H1 a probability measure νh on C such that P(z, ·) νh (dz). h= C
The mapping z → P(z, ·) from C into H1 (with the ucc topology) is a homeomorphism. We may think of νh as a measure either on C or on the collection of harmonic functions {P(z, ·) : z ∈ C}. The latter point of view is that of Martin boundary theory and Choquet theory. The simplest realization of Choquet theory deals with a triangle. Each point inside and on a triangle is represented by a unique affine weight on the extreme points of the triangle, i.e., on the vertices. For the compact, convex set H1 , the extreme points are the functions {P(z, ·) : z ∈ C} , and each h ∈ H1 is represented by a unique probability measure νh on this set. While the usual construction of νh is simple for the disk, it does not generalize without going to an ideal boundary. The measure theory discussed above does yield a generalizable construction of νh by extracting a measure from the function h that would otherwise be lost at the boundary of D. We give a brief description of that construction. More details can be found in the original work [25, 26] from which this example is taken. First, we recall that for each circle Cr and each point x ∈ Dr , there is by the Riesz Representation Theorem a Borel measure μrx , called a harmonic measure, that gives the value at x of the harmonic extension of any continuous function on Cr . Moreover, normalized Lebesgue measure on Cr is the harmonic measure μrx0 with respect to the origin x0 . Given h ∈ H1 , the measures h · μrx0 , 0 < r < 1, are probability measures, and νh is the weak∗ limit as the radius r tends to 1. This construction of νh does not work for more general domains and potential theories, but the following modification is valid in these more general settings. Fix h ∈ H1 . For each r < 1, let {Ari } form an interval partition of Cr , and choose yir ∈ Ari . Let δ yir denote unit mass at the point yir . The net of measures
102
P.A. Loeb
h(yir )μrx0 (Ari ) · δ yir converges in the weak∗ topology to the measure νh on C. The direction for this net is given by letting r tend to 1 and refining the partitions {Ari }. To see that νh is in fact the weak∗ limit of this net, note that the integral of any continuous function f with respect to one of these measures with support in Cr is a Riemann sum approximation to the integral of f with respect to the measure h · μrx0 . Instead of a finite combination of measures concentrated on the points of D, we want a combination of point masses on the function space [0, +∞] D . Given r and a partition {Ari } of Cr , the function x → μrx (Ari ) is a harmonic function on Dr . It is the solution of the Dirichlet problem for the function that is 1 on Ari and 0 on the rest of Cr . When we divide by μrx0 (Ari ), the new function is equal to 1 at the origin x0 . Let δir be unit mass on the function that is equal to μrx (Ari )/μrx0 (Ari ) in Dr and is identically 0 on and outside Cr ; the point mass δir is a measure on the function space [0, +∞] D supplied with the product topology. (The restriction of the product topology is the ucc topology on the set of
positive harmonic functions on Dr taking the value 1 at x0 .) Again, the measures i h(yir )μrx0 (Ari ) · δir have νh as a weak ∗ limit as r approaches 1 and the partitions {Ari } are refined. The limit measure is on the set {P(z, ·) : z ∈ C} ⊂ H1 ⊂ [0, +∞] D . i
This construction of νh continues to work in quite general potential theoretic settings (see [26, 28]), and it does not use the Martin boundary. The proof that this construction works was obtained in [26] by interpreting the construction in [25] of νh as a limit result in the sense of [3, 27]. The construction of νh in [25] was the first application after coin tossing of the general measure theory we have described above. In [25], the measurability of the standard part map was used to replace the standardizations of internal measures with standard measures on the standard compact set H1 . Here, specialized to the case of the disk D, is that construction of νh . We start with a circle Cr ⊂ ∗D with r 1, and an interval partition {Ari } so fine that every standard harmonic function has infinitesimal variation on each set Ari . Suppressing the superscript r , we have
∗
h(y) dμx (y)
∀x ∈ D, h(x) = Cr
∗
h(yi )μx0 (Ai )
i
μx (Ai ) . μx0 (Ai )
The family of weights ∗h(yi )μx0 (Ai ) is made into an ordinary probability measure μh using the general measure theory described above. The measure μh is supported by the set of nonstandard harmonic functions μx (Ai )/μx0 (Ai ). This is a set of positive, internal harmonic functions on Dr , with each function taking the value 1 at x0 . The mapping S on this set of functions given by the formula S(g)(x) = ◦ (g(x)) ∀x ∈ D is the standard part mapping with respect to H1 supplied with the ucc topology. The measurability of S, established for this special case in [25] and generalized
3 Topology and Measure Theory
103
in [3, 27], allows one to project the measure μh onto H1 . The process preserves affine combinations of harmonic functions and yields representing measures, so by a corollary of a result by Cartier, Fell, and Meyer (see [25]), the final measure is the unique representing measure νh on the extreme points {P(z, ·) : z ∈ C} of H1 .
References 1. E.S. Andersen, B. Jessen, Some limit theorems on set-functions. Danske Vid. Selsk. Mat.-Fys. Medd. 25(5), 1–8 (1948) 2. R.M. Anderson, A nonstandard representation of Brownian motion and Itô integration. Isr. J. Math. 25, 15–46 (1976) 3. R.M. Anderson, S. Rashid, A nonstandard characterization of weak convergence. Proc. Am. Math. Soc. 69, 327–332 (1978) 4. L. Arkeryd, Loeb solutions of the Boltzmann equation. Arch. Ration. Mech. Anal. 86, 85–97 (1984) 5. P.T. Bateman, P. Erd˝os, Geometrical extrema suggested by a lemma of Besicovitch. Am. Math. Mon. 58, 306–314 (1951) 6. V. Bergelson, T. Tao, Multiple recurrence in quasirandom groups. Geom. Funct. Anal. 24, 1–48 (2014) 7. J. Bliedtner, P.A. Loeb, A reduction technique for limit theorems in analysis and probability theory. Arkiv för Matematik 30(1), 25–43 (1992) 8. J. Bliedtner, P.A. Loeb, The optimal differentiation basis and liftings of L ∞ . Trans. Am. Math. Soc. 352, 4693–4710 (2000) 9. C. Constantinescu, A. Cornea, Ideale Ränder Riemannscher Flächen (Springer, Berlin, 1963) 10. N.J. Cutland, S.-A. Ng, The Wiener sphere and Wiener measure. Ann. Probab. 21(1), 1–13 (1993) 11. J.L. Doob, Stochastic Processes (Wiley, New York, 1953) 12. B. Eifrig, Ein Nicht-Standard-Beweis für die Existenz eines Liftings, in Measure Theory Oberwolfach 1975, ed. by A. Bellow. Lecture Notes in Mathematics, vol. 541 (Springer, Berlin, 1976), pp. 133–135 13. S. Fajardo, H.J. Keisler, Existence theorems in probability theory. Adv. Math. 118, 134–175 (1996) 14. B. Fuglede, Remarks on fine continuity and the base operation in potential theory. Math. Ann. 210, 207–212 (1974) 15. Z. F˝uredi, P.A. Loeb, On the best constant for the Besicovitch covering theorem. Proc. Am. Math. Soc. 121(4), 1063–1073 (1994) 16. C.W. Henson, The nonstandard hulls of a uniform space. Pac. J. Math. 43, 115–137 (1972) 17. C.W. Henson, Unbounded Loeb measures. Proc. Am. Math. Soc. 74, 143–150 (1979) 18. C.W. Henson, L.C. Moore, Nonstandard analysis and the theory of Banach spaces, in Nonstandard Analysis: Recent Developments. Springer Lecture Notes in Mathematics, vol. 383 (Springer, Berlin, 1983) 19. M. Insall, P.A. Loeb, M. Marciniak, End compactifications and general compactifications. J. Log. Anal. 6(7), 1–16 (2014) 20. A. Ionescu-Tulcea, C. Ionescu-Tulcea, Topics in the Theory of Lifting (Springer, Berlin, 1969) 21. H.J. Keisler, An infinitesimal approach to stochastic analysis. Mem. Am. Math. Soc. 48, 297 (1984) 22. H.J. Keisler, Infinitesimals in probability theory, in Nonstandard Analysis and Its Applications, ed. by N.J. Cutland (Cambridge Press, Cambridge, 1988), pp. 106–139 23. J.L. Kelley, General Topology (Van Nostrand, New York, 1955)
104
P.A. Loeb
24. P.A. Loeb, Conversion from nonstandard to standard measure spaces and applications in probability theory. Trans. Am. Math. Soc. 211, 113–122 (1975) 25. P.A. Loeb, Applications of nonstandard analysis to ideal boundaries in potential theory. Isr. J. Math. 25, 154–187 (1976) 26. P.A. Loeb, A generalization of the Riesz-Herglotz theorem on representing measures. Proc. Am. Math. Soc. 71(1), 65–68 (1978) 27. P.A. Loeb, Weak limits of measures and the standard part map. Proc. Am. Math. Soc. 77(1), 128–135 (1979) 28. P.A. Loeb, A construction of representing measures for elliptic and parabolic differential equations. Math. Ann. 260, 51–56 (1982) 29. J. Lukeš, J. Malý, L. Zajíˇcek, Fine Topological Methods in Real Analysis and Potential Theory. Lecture Notes in Mathematics, vol. 1189 (Springer, Berlin, 1986) 30. W.A.J. Luxemburg, A general theory of monads, in Applications of Model Theory to Algebra, Analysis, and Probability, ed. by W.A.J. Luxemburg (Holt, Rinehart, and Winston, New York, 1969) 31. E.A. Perkins, A global intrinsic characterization of Brownian local time. Ann. Probab. 9, 800– 817 (1981) 32. E.F. Reifenberg, A problem on circles. Math. Gaz. 32, 290–292 (1948) 33. A. Robinson, Compactification of groups and rings and nonstandard analysis. J. Symb. Log. 34, 576–588 (1969) 34. A. Robinson, Non-standard Analysis (North-Holland, Amsterdam, 1966) 35. S. Salbany, T. Todorov, Nonstandard analysis in topology: nonstandard and standard compactifications. J. Symb. Log. 65, 1836–1840 (2000) 36. Y.N. Sun, Integration of correspondences on Loeb spaces. Trans. Am. Math. Soc. 349, 129–153 (1997) 37. Y.N. Sun, A theory of hyperfinite processes: the complete removal of individual uncertainty via exact LLN. J. Math. Econ. 29, 419–503 (1998) 38. T. Tao, T. Ziegler, The inverse Conjecture for the Gowers norm over finite fields in low characteristic. Ann. Comb. 16, 121–188 (2012) 39. T. Tao, Hilbert’s Fifth Problem and Related Topics. Graduate Studies in Mathematics, vol. 153 (American Mathematical Society, Providence, 2014) 40. F. Wattenberg, Nonstandard measure theory: avoiding pathological sets. Trans. Am. Math. Soc. 250, 357–368 (1979)
Part II
Functional Analysis
Chapter 4
Banach Spaces and Linear Operators Manfred P.H. Wolff
4.1 Introduction In this chapter we deal with old and new applications of nonstandard analysis to the theory of Banach spaces and linear operators. In particular we consider the structure theory of Banach spaces, basic operator theory, strongly continuous semigroups of operators, approximation theory of operators and their spectra, and the Fixed Point Property. To include in this chapter interesting examples of nonstandard functional analysis we must assume that the reader is familiar with the basics of Banach spaces and operator theory. Non-experts in these field can, however, profit from this chapter by looking at the elementary applications with which we begin every section. Moreover we refer to the book [45] for those, who want to learn functional analysis and simultaneously nonstandard analysis. Nonstandard functional analysis is comparable to the theory of ultraproducts of Banach spaces and operators. More precisely, in a broad sense an ultraproduct of different Banach spaces corresponds to the nonstandard hull of an internal Banach space. However, the reader should notice that nonstandard analysis enables us to prove important properties of nonstandard hulls easily with the use of the Transfer Principle, which is not available within the frame work of the theory of ultraproducts. Moreover, the structure of internal Banach spaces and internal operators is much richer than that of ultraproducts, and helps to make the proofs for nonstandard hulls quite easy. The application of nonstandard analysis to functional analysis has three different aspects: First, it helps to find and prove new standard theorems and to solve standard problems. Secondly, it establishes a deep analysis of the nonstandard hulls of given standard objects and their relations to those objects. Thirdly, it is a development of its own interest. M.P.H. Wolff (B) Mathematisches Institut der Universität Tübingen, Auf der Morgenstelle 10, 72076 Tübingen, Germany e-mail:
[email protected] © Springer Science+Business Media Dordrecht 2015 P.A. Loeb and M.P.H. Wolff (eds.), Nonstandard Analysis for the Working Mathematician, DOI 10.1007/978-94-017-7327-0_4
107
108
M.P.H. Wolff
For the basics of nonstandard analysis we refer to Chap. 2 and for the basics of topology to Chap. 3.
4.2 Basic Nonstandard Analysis of Normed Spaces 4.2.1 Internal Normed Spaces and Their Nonstandard Hull In the following let V (X ) = n≥0 Vn (X ) be the full superstructure over an appropriate infinite set X containing C and containing in addition the normed linear spaces we want to consider. We always use nonstandard extensions V (∗ X ) of V (X ) which are κ-saturated for some κ > card(V (X )) (see Definition 2.9.1 and the following remark). Such enlargements are called polysaturated. Moreover we always consider vector spaces over K = C unless explicitly stated otherwise. Let F be a subset of Vn (X ) for some n ≥ 1 and assume that all F ∈ F are normed linear spaces (Banach spaces, resp.). Then every G ∈ ∗ F is an internal element (see Definition 2.8.1). The Transfer Principle (Definition 2.4.3v) implies that such a G is a (nonstandard) normed linear space (Banach space, resp.). More precisely, this means that G is an internal vector space over ∗ K, equipped with an internal function · : G → ∗ R satisfying the usual axioms of a norm. When all F ∈ F are Banach spaces then G is complete in the following sense: If (xn )n∈∗ N is an internal Cauchy sequence then there exists z ∈ G such that for every ε > 0 in ∗ R there exists n(ε) ∈ ∗ N with z − xn < ε for all n ∈ ∗ N, n ≥ n(ε). However, we do not make use of this notion of convergence in the sequel. If E is an internal normed linear space in V (∗ X ) then we consider its finite part Fin(E) = {x ∈ E : x ∈ Fin(∗ R)} where Fin(∗ R) = {t ∈ ∗ R : t is nearstandard} is the finite part in ∗ R (see Sect. 1.6). Fin(E) is obviously an external vector space over K and E 0 = {x ∈ E : x 0} is a subspace. By x y iff x − y ∈ E 0 (iff x − y 0) there is defined an equivalence relation on the whole space E which is compatible with the external linear operations on E viewed as a vector space over is called the nonstandard hull of E. By K. The quotient space Fin(E)/E 0 = E q( x ) := ◦ x there is uniquely defined a norm on E. The following proposition is an immediate application of Theorem 3.9.2. Proposition 4.2.1 The nonstandard hull is always complete with respect to q. Remark 4.2.2 Let E be a standard normed linear space of our superstructure. Then by abuse of our previous definition we often denote the nonstandard hull ∗ E of the and call it the nonstandard hull of E if no confusion can internal space ∗ E by E arise. Moreover in this case we denote the set E 0 by μ· (0) or simply μ(0), whenever the context allows this simplification. This notation is consistent with that in the first three chapters, since μ(0) is nothing but the monad of 0 with respect to the norm topology.
4 Branch Spaces and Linear Operators
109
From now on we shall write x in place of q( x ), hoping that no confusion will be generated thereby. (defined by x → If F is a standard normed space then by F → Fin(∗ F) → F ∗ x → ∗ in a canonical manner. So F x) the space F is isometrically embedded into F . Its closure F then is the completion can and will be identified with a subspace of F = F since the unit ball of F is of F. Note that if F is finite dimensional then F compact; cf. Corollary 4.2.11. The following relations between ∗ E and ∗ E are indispensable in nonstandard functional analysis: Proposition 4.2.3 Let E be a standard normed space. (i) Let x ∈ ∗ E be arbitrary. x ∈ Fin(E) if and only if for all ξ ∈ Fin(E ) < x, ξ >∈ Fin(K) holds. (ii) Let ξ ∈ ∗ E be arbitrary. ξ ∈ Fin(E ) if and only if for all x ∈ Fin(E) < x, ξ >∈ Fin(K) holds. (iii) x ∈ ∗ E is nearstandard if and only if there exists y ∈ E (standard) with < x, ξ > < ∗ y, ξ > for all ξ ∈ Fin(E ). (iv) ξ ∈ ∗ E is nearstandard if and only if there exists ψ ∈ E (standard) with < x, ξ > < x, ∗ ψ > for all x ∈ Fin(E). Proof (i) If x ∈ Fin(E), then there exists a standard r such that x ≤ r . If ξ ∈ Fin(E ) then there exists a standard s such that ξ ≤ s. By the Transfer Principle we get | < x, ξ > | ≤ sr. If x is not in Fin(E), then x = r ≈ ∞. The formula x = sup{| < x, ξ > | : ξ ≤ 1} and the Transfer Principle imply that for ε > 0 there exists ξ ∈ ∗ B(E ) (B(E ) d enotes the dual unit ball) such that r − ε ≤ | < x, ξ > | ≤ r . The assertion follows. The remainder of the proof is left as an exercise. Problem 4.2.4 Prove the remainder of the proposition. Hint: use the formulas x = sup{| < x, ξ > | : ξ ≤ 1}, and so on, and the Transfer Principle. As a further basic lemma we will prove an assertion on the ∗ —linear independence of vectors. Lemma 4.2.5 Let E be an internal Banach space and let y1 , . . . , yn be linear inde Then y1 , . . . , yn are internally linear independent in E. pendent in E. Proof Suppose on the contrary that n1 αk yk = 0 where at least one of the α j is not 0. Set β := max(|α 1 |, . . . , |αn |). (Notice that this number exists by the Transfer Principle.) Then n1 γk yk = 0 where γk := αk /β are of absolute value less than or equal to 1 and at least one of them is of absolute value 1. But then n1 ◦ γk yk = 0, a contradiction. Now let E be an internal normed space and A ⊂ E an internal set = ∅. Then by the Transfer Principle we can define the distance of an element y to A by d(y, A) = inf{y − x : x ∈ A} and we conclude
110
M.P.H. Wolff
(i) d(y, A) = 0 iff y ∈ A¯ (the internal closure of A in E), (ii) For every ε > 0 (ε 0 is allowed) there exists z ∈ A such that d(y, A) ≤ y − z < d(y, A) + ε. The proof of the next proposition is taken from standard functional analysis. However its consequence Corollary 4.2.7 for the nonstandard hull of an internal Banach space is interesting in itself since it does not hold for arbitrary closed subspaces of the nonstandard hull. Proposition 4.2.6 (F. Riesz) Let H be a closed internal subspace of the internal normed space E, and assume H = E. Then to every y ∈ E\H there exists x in the internal span of H and y such that x = 1 and d(x, H ) 1. y Proof y ∈ E\H implies y = z ∈ / H , hence 1 ≥ α := d(z, H ) = 0. Choose η 0, η > 0 arbitrarily. Then there exists u ∈ H satisfying α ≤ z−u < α(1+η). z−u has the desired properties. For if v ∈ H , then But then x = z−u
x − v =
1 1 α z − u − z − uv ≥ ≥ , z − u z − u 1+η ∈H
whence 1 ≥ d(x, H ) ≥
1 1+η
1.
Corollary 4.2.7 Let F be an internal subspace of the internal Banach space E. ˆ Fˆ there exists an element xˆ of norm 1 in the linear hull of yˆ Then to every yˆ ∈ E\ ˆ ˆ = 1. and F such that d(x, ˆ F)
Problem 4.2.8 (1) Work out the proof of the corollary. (2) Prove the following standard theorem: Let E be a (standard) normed linear space and let F be a finite dimensional subspace. Then to every y ∈ / F there exists an x of norm 1 in the linear hull of y and F such that d(x, F) = 1. The standard version of the foregoing proposition is an immediate consequence of the Transfer Principle: Corollary 4.2.9 (standard) Let F be a standard normed linear space and let H be a closed linear subspace. Then to every (standard) ε with 0 < ε < 1 and to every y ∈ F\H there exists x in the linear hull of H and y such that x = 1 and d(x, H ) > ε. The next proposition characterizes the internal normed linear spaces of standard finite dimension over ∗ C. is locally Proposition 4.2.10 Let E be an internal normed linear space. Then E ∗ n compact iff E is internally linear isomorphic to C for some standard n.
4 Branch Spaces and Linear Operators
111
Proof Assume first of all that E is not internally linear isomorphic to ∗ Cn for any standard n. By induction on n we construct a sequence (yn ) such that yn = 1, d(yn , Hn−1 ) > 1/2 where Hn−1 is the internal vector space spanned by y1 , . . . , yn−1 . The construction is possible by Proposition 4.2.1, and by assumption, it does not stop. cannot be locally compact. yn ≥ 21 for m = n, and thus E It follows that ym − Now assume that E is internally linear isomorphic to ∗ Cn for some standard n. ≤ n. Proposition 4.2.6 implies that dim( E) = n. Hence E By Lemma 4.2.5 dim( E) is norm isomorphic to Cn equipped with an appropriate norm, which is known to be locally compact. Corollary 4.2.11 Let E be a standard Banach space. Then E is finite dimensional = E. if and only if E Problem 4.2.12 Work out the proof. We need the following fact about the cardinality of hyperfinite sets. Lemma 4.2.13 Let M be a hyperfinite set of internal cardinality N ∈ ∗ N\N. Then M is (externally) not countable. Proof By transfer, there exists an internal bijection f , say, from M onto P := {k/N : 0 ≤ k ≤ N −1} ⊂ ∗ [0, 1] where [0, 1] denotes the unit interval of R. Also by transfer, the mapping g : ∗ ]0, 1] → P defined by g(x) = max{k/N ∈ P : k/N ≤ x} is internal. Its restriction to the external subset [0, 1] is obviously injective, and the assertion follows. Corollary 4.2.14 Let E be an internal normed linear space. If E has internal dimen∼ is nonseparable. sion n in the standard natural numbers N, then E = Cn ; otherwise E Proof The first part of our assertion follows directly from Proposition 4.2.10. If E does not have internal dimension n ∈ N, then there exists an infinitely large N ∈ ∗ N with dim(E) ≥ N . By induction on n and transfer, we construct an internal sequence (yn ) of normalized vectors satisfying d(yn , ym ) > 21 for m = n, m, n ≤ N . But yn − ym ≥ 1/2 holds then M := { yn : n ≤ N } is contained in the unit sphere and for all n = m, m, n ≤ N . By Lemma 4.2.13 M is not countable. Remark 4.2.15 The counterpart in the theory of ultraproducts says that an ultraproduct of a family (E k ) of normed linear spaces is of dimension n iff almost all E k are of that dimension. If it is infinite dimensional then it is inseparable. Before we present some examples we want to show how to construct points that are not nearstandard: Lemma 4.2.16 Let E be a standard normed vector space and let (xn )n be a bounded sequence of E satisfying xm − xn ≥ α > 0 for all m = n. If N ∞ then x N is not nearstandard, i.e. a remote point.
112
M.P.H. Wolff
Proof Assume that x N is nearstandard to y ∈ E, i.e. x N − y 0. Let n ∈ N be arbitrary. Then the formula ∃k > n(xk − y < 1/n) holds in the nonstandard extension hence in the standard world by the Downward Transfer Principle. So we get a subsequence (xkn )n with xkm − xkn < 2/n, a contradiction to our hypothesis. We now give some examples. Example 4.2.17 Let E = = {x ∈ CN : xn = 0 for all n ≥ n(x)} be the vector space of all C-valued sequences with only finitely many coordinates = 0. (1) Set ∞ = , equipped with the supremum norm x = sup{|xn | : n ∈ N}. We denote by en the sequence (δk,n )k∈N where δk,n is the Kronecker symbol. Let now E n be the subspace spanned by {e1 , . . . , en } . Then E n = {x : x = nk=1 xk ·ek }. By the Transfer Principle we obtain internal hyperfinite dimensional subspaces E N of ∗ E for each hyperfinite integer N . The sequence u, defined by u(n) = N k=1 ek is an internal element of E N of norm 1. (a) Take f ∈ l ∞ (N) and set f˜ = ∗ f · u. Then f˜ is in E N , and the mapping U : l ∞ (N) f → f˜ ∈
EN ⊂ ∞ is a linear isometric embedding of l ∞ (N) into ∞ . (b) Let E = C([0, 1] be the space of all complex valued continuous functions on the unit interval, and let n ∈ N be arbitrary. Consider the finite partition { nk : 0 ≤ k ≤ n} and set fn =
f
k n
0
k≤n k>n
Then f n ∈ . The transfer principle gives an element f N ∈ E N . The mapping ∞ , given by f → fˆN , U : C([0, 1]) →
EN ⊂ ∞ . In the same manner is a linear isometric embedding of C([0, 1]) into ∞ for every separable one can construct an isometry from C(X ) into compact space X . (2) Now for 1 ≤ p < ∞ we consider the norm ( denoting this space by p .
∞
|xk | p )1/ p = x p on ,
k=1
(a) Similarly to the case studied above we embed the classical space l p (N) into
p by EN ⊂ U : l P (N) →
E N , f → ∗ f · u. U is again an isometry.
4 Branch Spaces and Linear Operators
113
(b) Let λ be the Lebesgue measure on the unit interval [0, 1]. For f ∈ C([0, 1]) set 1 k f nk k ≤ n = n 1/ p fn 0 k>n n Again we obtain a linear isometric embedding of L p ([0, 1]) by p , f → fN U : C[[0, 1]) → and continuous extension to L p ([0, 1]). Problem 4.2.18 Prove that U in the last part of the example is indeed an isometry. It is typical that a given standard Banach space like the examples above can be embedded into the nonstandard hull of a hyperfinite dimensional space. In order to establish this phenomenon in full generality we need a lemma on the domination of internal upwards directed families. Notice that we always assume that our extension V (∗ X ) is polysaturated. Lemma 4.2.19 Let A ⊂ D ∈ Vn (∗ X ) be a partially ordered upwards directed family of internal objects and assume that the cardinality κ(A) is strictly less than the cardinality of our standard superstructure V (X ). Then there exists an element A ∈ D satisfying B ≤ A for all B ∈ A. Proof The binary relation P = {(A, B) : A ≤ B, A, B ∈ D} is concurrent on A by assumption. Because card(A) < card(V (X )) the assertion follows from our assumption that ∗ V (X ) is polysaturated. (See the beginning of this section as well as Sect. 2.9 and the remarks that follow.) The following result enables us to consider standard normed linear spaces as (external) subspaces of hyperfinite dimensional internal Banach spaces. Theorem 4.2.20 Let E be an arbitrary (standard) vector space of our superstructure. Then there exists an internal hyperfinite dimensional subspace F of ∗ E, such that E is externally contained in F in the sense that ∗ x ∈ F for all x ∈ E. Proof Let A be the set of all finite dimensional linear subspaces of E. Then A is upwards directed by inclusion and contained in ∗ A. Thus the assertion follows from Lemma 4.2.19. Remark 4.2.21 The corresponding result in the theory of ultraproducts says that every ultrapower Eˆ of a normed space E contains an ultraproduct of finite dimensional subspaces of E that in turn contains an isomorphic copy of E. The interested reader may wish to construct a proof of this assertion.
114
M.P.H. Wolff
4.2.2 Standard Continuous and Internal S–continuous Linear Operators The characterization of the continuity of a linear operator from one normed space E to another one F is well known. The transfer of this characterization is of less use than the following notion: Let E, F be internal normed linear spaces. An internal map f : D ⊂ E → F is called S–continuous at x ∈ D if for all y ∈ D with y x we have f (y) f (x). The map f is called uniformly S–continuous if u v implies f (u) f (v) for all u, v ∈ D. Internal linear maps that are S–continuous at 0 are very nice as the following proposition shows. Proposition 4.2.22 Let E, F be internal normed linear spaces and let T be an internal linear map from E to F. The following assertions are equivalent: (i) (ii) (iii) (iv) (v)
T is (uniformly) S–continuous. T is S–continuous at 0, which means x 0 implies T x 0. T (Fin(E)) ⊂ Fin(F). There exists a standard real number M such that T x ≤ Mx for all x ∈ E. T := sup{T x : x = 1} ∈ Fin(K ).
Notice that the supremum of an internal internally bounded subset of ∗ R always exists by the Transfer Principle. Proof (v) and (iv) are obviously equivalent. x−y (v) → (i): Let x y but x = y. Then T x − T y = x − y · T x−y ≤ x − y · T 0. (ii) →(iv): Let Bε denote the Ball with radius ε. The set A := {n ∈ ∗ N : T (B1/n ) ⊂ B1 } contains all N ≈ ∞ and is internal. Hence it contains a standard n by the Spillover Principle (Theorem 2.8.12). It follows T (B1 ) ⊂ Bn . (iv) → (iii): This is obvious. (iii) → (iv): T (B1 ) ⊂ Fin(E) = n∈N Bn and T (B1 ) being internal imply that T (B1 ) ⊂ Bn for some standard n by Proposition 2.9.7. The rest is obvious. The number T is called the operator norm. Corollary 4.2.23 Let T : E → F be an internal S–continuous linear map. Then by : ( T x→T x ) := (T x) there is uniquely defined a bounded linear operator from E ◦ to F, called the nonstandard hull of T . Its norm is given by T = T . Problem 4.2.24 Work out the proof. is consistent with the definition of the Remark 4.2.25 Notice that the definition of T is nothing but nonstandard hull of an internal normed space. That is, the graph of T the nonstandard hull of the graph of T . Now let E, F be standard Banach spaces (in V (X )), and denote by L(E, F) the Banach space of all bounded linear operators from E to F, equipped with the operator norm T = sup{T x : x = 1}.
4 Branch Spaces and Linear Operators
115
Corollary 4.2.26 Let T be a bounded linear operator from E to F. Then ∗ T is an T as above. S–continuous linear operator from ∗ E to ∗ F, and so we can construct ∗ ∗ ∗ F) ⊂ The map L(E, F) T → T → T (=: T ) is a linear isometry into L(E, L( E, F). This embedding also satisfies (ST ) = S T for T ∈ L(E, F), S ∈ L(F, G). Proof Obvious. Remark 4.2.27 (i) If in Corollary 4.2.23 we set F = ∗ C, and if moreover we replace the internal space E considered there by the space ∗ E , where E denotes a standard Banach space, then we get an isometric embedding of the nonstandard of the dual space E of E into the dual space ( E) of the nonstandard hull E (see Sect. 4.3 below). of E. In general, however, ( E) E hull E Notice, that the norm on E, E , respectively, are the operator norms, because E can be identified with a subspace of L(E , K), and E = L(E, K) by definition. (ii) In this context we recall the definition of an adjoint operator: Let T : E → F be a continuous linear operator. Then T : F → E , defined by T ξ = ξ ◦ T is E called the adjoint operator. It is continuous with equal norm. Since ( E) in general we have also (T ) = T in such a case. Next we characterize the invertibility of internal operators: Proposition 4.2.28 Let S be an internal, S–bounded operator from the internal Banach space E into the internal Banach space F. The following assertions are equivalent: (i) S is bijective (ii) S is bijective and S −1 is finite. If one of these conditions is satisfied then S −1 = ◦ S −1 . Proof (i) ⇒ (ii): Since (i) holds S x ≥ δ > 0 for all x of norm 1 and δ = S −1 −1 . Obviously, Sx > δ/2 for all x of norm 1. Suppose S is not onto. By the open mapping theorem (and the Transfer Principle) S(E) is (internally) closed. If S(E) = F then by 4.2.6 there exists y such that y = 1 and = by the definition of d(y, S(E)) 1. But then y∈ / S(E) S( E) S (cf. Corollary 4.2.23). This contradiction implies that S is bijective and S −1 ≤ 2/δ. (ii) ⇒ (i) as well as the additional assertion are obvious. Finally we give a characterization of standard operators with closed range. To this end we restrict ourselves to Banach spaces. Let E, F be (standard) Banach spaces and let T : E → F be a continuous linear map. Set γ(T ) = inf{T (x) : d(x, ker(T )) = 1}. The open mapping theorem tells us that γ(T ) > 0 holds if and only if the range of T is closed (consider the induced mapping from E/ ker(T ) onto the range of T ). We ∗T ) = ∗ ). ker(T ) ⊂ ker(T point out that we always have ker(
116
M.P.H. Wolff
Problem 4.2.29 Prove this assertion. Proposition 4.2.30 Let E and F be Banach spaces and let T : E → F be a continuous linear mapping. The following assertions are equivalent: (i) The range T (E) is not closed. ). ker(T ) = ker(T (ii) ∗ (iii) There exists a remote point x of norm 1 with 0 = ∗ T x 0. Proof (i) → (ii): If the range is not closed then γ(T ) = 0 by the preceding paragraph. By the Transfer Principle there exists x ∈ ∗ E such that ∗ d(x,∗ ker(T )) = 1 and ∗ T (x) 0, hence xˆ ∈ / ∗ ker(T ) but Tˆ (x) ˆ = 0. ∗ (ii) → (iii): By Proposition 4.2.6 there exists xˆ ∈ ker(T )\ ker(T ) satisfying d(x, ˆ ∗ ker(T )) = 1. For x ∈ xˆ we have x ≥ 1 as well as 0 = ∗ T x 0. If x would be near standard there would exist a standard element y satisfying T y = 0, a contradiction to d(x, ∗ ker(T )) 1. (iii) → (i): If T (E) would be closed then γ(T ) > 0, a contradiction to x ˆ = 1 and 0 = ∗ T x 0.
4.2.3 Special Banach Spaces and Their Nonstandard Hulls Our first assertion says in particular that the nonstandard hull of every standard Hilbert space is a Hilbert space. is a Hilbert space. Proposition 4.2.31 If H is an internal Hilbert space then H Proof If H is an internal Hilbert space, then the parallelogram law x + y2 + x − , proving the y2 = 2(x2 + y2 ) holds for H . But this law then also holds in H assertion. The corresponding scalar product is given by (x| ˆ yˆ ) = ◦ (x|y). Example 4.2.32 Let H = 2 (N) and consider the orthonormal basis given by en = (δk,n )k where δk,n denotes the Kronecker symbol. Then the set ∗ {en : n ∈ N} is an internal orthonormal basis in ∗ 2 (N) but {eˆn : n ∈ ∗ N} is not an orthonormal basis in Hˆ , although it is obviously an orthonormal system. To show this take an 2 arbitrary (standard) continuous N ∗ function g√on the unit interval [0, 1] with L -norm 1 and consider f = k=1 g(k/N ) ek / N where N denotes an infinitely large integer. (Cf. also Example 4.2.36 (1)). We recall the following characterization of complex Banach lattices from [41]: Let E be a Banach space over C and assume that there is an idempotent function | · | : E → E satisfying the following equations: 1. |αx| = |α| |x| for α ∈ C, where |α| is the usual absolute value in C, 2. | |x| + |y| − |x + y| | = |x| + |y| − |x + y|,
4 Branch Spaces and Linear Operators
117
3. | |x| − |y| | = |x| − |y| ⇒ y ≤ x, 4. E is the linear hull of {|x| : x ∈ E}. Then (E, |·|) is the unique complexification of the real Banach lattice E R = E + − E + , where E + = {x ∈ E : |x| = x} and the function | · | is the complex extension of the real absolute value |x| := sup(x, −x) where x is in E R and sup denotes the supremum in E R . In particular |x + i y| = sup{x cos θ + y sin θ : θ ∈ [0, 2π]} and |x + i y| = x + i y holds (for Banach lattices see [40, 57]). For x ∈ E R we set x + = (|x| + x)/2 as well as x − = (|x| − x)/2, and we obtain x + = sup(x, 0), x − = − inf(x, 0) as in the case of concrete Banach lattices of functions on a set Y . The way we have introduced Banach lattices enables us to show easily the following result by use of the Transfer Principle: Proposition 4.2.33 If E is an internal Banach lattice with absolute value | · | then is a Banach lattice with absolute value | E x | := |x|. Corollary 4.2.34 Let E be a standard Banach lattice. Then the embedding J of E satisfies |J (x)| = J (|x|), so E can be viewed as a Banach sublattice of E. into E Let us recall some further basic notions from the theory of Banach lattices. The infimum of two elements x and y of the real Banach lattice E is denoted by inf(x, y). A linear operator T from one Banach lattice E to another one F is called positive if |T x| ≤ T |x| holds for all x ∈ E. The operator T is called a lattice homomorphism if |T x| = T |x| holds for all x. Our next concrete examples are based on two wellknown theorems, due to S. Kakutani, H. Bohnenblust, resp., for special cases and generalized further by others, see [34], p. 135. Theorem 4.2.35 (standard) Let (E, | · |) be a complex Banach lattice. (i) Assume that there exists 1 ≤ p < ∞ such that f + g p = f p + g p for all f, g ∈ E with inf(| f |, |g|) = 0. Then there exists an appropriate measure space (X, , μ) and an isometric lattice isomorphism from E onto L p (X, , μ). (ii) Assume that (a) sup(| f |, |g|) = sup( f , g) and (b) | f | ≤ f · u for some u > 0. Then there exists a compact space K and a lattice isomorphism from E onto the space C(K ) of all complex valued continuous functions on K . Example 4.2.36 (1) Let (X, , μ) be an arbitrary measure space and 1 ≤ p < ∞. ˜ μ), ˜ μ) Then E = L p (X, , μ) is a Banach lattice and ∗ E = L p ( X˜ , , ˜ where ( X˜ , , ˜ is an appropriate measure space. Proof F := ∗ E is a Banach lattice by Proposition 4.2.33. Let x and y be arbitrary with inf(| x |, | y|) = 0. Then the fact that z := inf(|x|, |y|) 0 follows from Proposition 4.2.33. Now set u := |x| − z and v := |y| − z. Then inf(u, v) = 0, hence u p + v p = u + v p holds by transfer and by the fact that such a formula holds in E. Apply now the quotient mapping from Fin(∗ E) onto ∗ E to this formula and use (i) of the foregoing Theorem.
118
M.P.H. Wolff
p (N) = In particular for X = N and μ is counting measure we obtain l ˜ μ). ˜ This space contains a sublattice isomorphic to L p ([0, 1]). For a proof L p ( X˜ , , cf. the Example 4.2.17 (2) Let K be compact and let E = C(K ) be the Banach lattice of all continuous complex valued functions on E. Then equipped with the usual absolute value E is a complex Banach lattice with the following two additional properties: (a) sup(| f |, |g|) = sup( f , g) and (b) | f | ≤ f · u for some u > 0. Property (b) says that u is a strong order unit. Now there exists another compact = C( K˜ ). space K˜ such that E E satisfy (a) and (b) and also The proof is based on the fact that ∗ E and hence ∗ on Theorem 4.2.35, (ii). In [22] K˜ is identified with a compactification of ∗ K . A Banach algebra A is a Banach space over K equipped with an associative and distributive multiplication such that α(x y) = (αx)y = x(αy) holds for all x, y ∈ A and α ∈ K and moreover one has x y ≤ x y for all x, y ∈ A. If there exists a unit then A is called unital. If there exists an antilinear involution x → x ∗ of norm ≤ 1, then A is called an involutive Algebra. If the involution satisfies x2 = x ∗ x then A is called a C ∗ –algebra. Now let A be an internal Banach algebra in V (∗ X ). Then the mapping (x, y) → x y is obviously S–continuous from Fin(A)×Fin(A) into Fin(A). But then the following result is not hard to show:
of an internal Banach algebra A is a Proposition 4.2.37 The nonstandard hull A is unital iff A is unital and A is commutative if A is. Banach algebra. Moreover, A is involutive, a C ∗ –algebra, resp., if A is involutive, a C ∗ –algebra, resp. Finally, A Applying Proposition 4.2.28 to an internal Banach algebra A with unit e we obtain the following result: Proposition 4.2.38 ([5], Theorem 1) Let x ∈ Fin(A) be arbitrary. xˆ is invertible if and only if x is invertible and x −1 is in Fin(A). Proof Consider the linear map L x : a → xa. Let A be a (standard) Banach algebra with unit e and let Inv(A) be the set of invertible elements. We consider the problem how to characterize those algebras for which Inv(A) is dense in A. The algebra of all analytic functions on the disc {z ∈ C : |z| < 1} which have a continuous extension to the unit circle fails to have this property. We call xˆ ∈ Aˆ generalized invertible, if there exists y x such that y ˆ be the set of all generalized invertible elements. is invertible in ∗ A. Let GInv( A) Proposition 4.2.39 ([5], Proposition 5) Let A be a (standard) Banach algebra with ˆ if and only if A = Inv(A). unit e. Then Aˆ = GInv(( A)) Proof Let a ∈ Inv(A) be arbitrary. Then there exists a sequence (an )n∈N of invertible elements an converging to a. As a convergent sequence it is bounded. But then a N =a ˆ for every N ≈ ∞. as well as a N ∈ GInv( A)
4 Branch Spaces and Linear Operators
119
ˆ be true. Let a ∈ A be arbitrary. Then to ∗ a there Conversely let Aˆ = GInv(( A) ∗ exists y ∈ Inv( A) satisfying y ∗ a. Thus for every standard n the following assertion is true in V (∗ X ) hence in V (X ): ∃[y ∈ Inv(A) : a − y < 1/n], thus a ∈ Inv(A).
4.2.4 Notes Section 4.1 contains results that are needed in every advanced nonstandard functional analysis course (see e.g. [11, 36, 61]). More recent introductions are to be found in e.g. [28]. Proposition 4.2.6 is a reformulation of Riesz’ result and its standard proof (see e.g. [81], III.2) within the frame work of nonstandard analysis. Proposition 4.2.10 holds also for topological vector spaces. An extensive study of examples like the ones presented in 4.2.17 is to be found in [23]. Theorem 4.2.20 is nothing but a special application of saturation, and Proposition 4.2.22 is orientated to standard facts. The consequences serve as basic facts in all advanced applications. Example 4.2.36 are also known within the frame work of ultraproducts of Banach spaces and trace back to results of Dacunha–Castelle and Krivine in the late 1960s (see e.g. [10]). For a comprehensive representation of these and other results see [19]. Corresponding results within the framework of nonstandard analysis may be found in [23]. Ultraproducts of Banach algebras seem to have been considered already in the late 1950s (see [53]) and came up again in 1970 in a conference on nonstandard analysis. In fact Janssen seems to be the first one who has applied such a construction to C ∗ – algebras (see [30]) (almost identical results where proved apparently independent of [30] by Hinokuma and Ozawa [27]). Only a little later Connes (see e.g. [8]) and others used ultrapower techniques to obtain, for example, the classification of W ∗ –algebras of type III.
4.3 Advanced Theory of Banach Spaces 4.3.1 A Brief Excursion to Locally Convex Vector Spaces Introduction As is generally known a seminorm p on the vector space E over K is a positive real valued function on E satisfying (i) p(x +y) ≤ p(x)+ p(y) and (ii) p(α x) = |α| p(x) for all x, y ∈ E, and α ∈ K, respectively. Note that p(x) = 0 for x = 0 is not required in general.
120
M.P.H. Wolff
A set P of seminorms on E is called separating if to every x = 0 in E there exists p ∈ P with p(x) = 0. A separating set P of seminorms defines a uniformity U (see Sect. 3.8) where U is generated by finite intersections of sets of the form U ( p, ε) = {(x, y) ∈ E × E : p(x − y) < ε}. The monad of the uniformity U is μU = {(x, y) ∈ ∗ E × ∗ E : ∗ p(x − y) 0 for all standard p ∈ P}. The monad of the neighborhood filter U(0) of 0 is given by μU (0) = {x ∈ ∗ E : ∗ p(x) 0 for all standard p ∈ P}. This monad is an external vector space over K. The neighborhood filter of an element x ∈ E is given by the monad μU (x) = {y : ∗ p(y − x) 0 for all standard p ∈ P} = x + U(0). Since P is separating the topology TP induced by the uniformity U is Hausdorff. It is called a locally convex topology and the space E equipped with this topology is called locally convex vector space , because a subbase of the neighborhood filter of 0 is given by the convex sets B( p, ε) = {x : p(x) < ε}. Obviously normed spaces are special locally convex spaces. let P be a separating set of seminorms. For each finite set A ∈ P set p A (x) = sup p∈A p(x). Then the set { p A : A ⊂ P finite} is directed upwards and defines the same uniformity, and a fortiori the same topology as the set P. Sometimes it is very useful to use this set of seminorms in place of the original one. For example the sets B( p A , ε) form not only a subbase but even a base of the neighborhood filter of 0. The next proposition is basic and easy to prove with the aid of monads: Proposition 4.3.1 Let T be the topology generated by a set of seminorms as above. Then the mappings + : E × E → E, (x, y) → x + y, · : K × E → E, (α, x) → αx are continuous. Problem 4.3.2 Prove these two assertions. Example 4.3.3 (i) Let (E, · ) be a normed space. It is obviously itself a locally convex space (see above). Now for each ξ ∈ E (E the dual of E, i.e. the space of continuous linear functionals on E) consider the seminorm pξ (x) = | < x, ξ > |. The topology on E induced by this set { pξ : ξ ∈ E } of seminorms is called the weak topology σ(E, E ) on E. Its monad of 0 is given by μσ(E,E ) = {x ∈ ∗ E :< x, ξ > 0 for all standard ξ ∈ E }.
4 Branch Spaces and Linear Operators
121
(ii) Likewise for each x ∈ E one may consider the seminorm px on E , given by px (ξ) = | < x, ξ > |. The topology on E induced by this set { px : x ∈ E} of seminorms is called the weak* topology σ(E , E) on E . Its monad of 0 is given by μσ(E ,E) = {ξ ∈ ∗ E :< x, ξ > 0 for all standard x ∈ E}. (iii) Replacing in (i) E by the dual (E ) = E of E (i.e. the second dual of E) and taking the same set { pξ : ξ ∈ E } of seminorms, each pξ now applied to elements of E we obtain the weak topology σ(E , E ). Identifying E with its isometric image in E σ(E, E ) turns out to be the subspace topology induced by σ(E , E ). (iv) Let E, F be normed spaces. For x ∈ E define the seminorm qx on L(E, F) by qx (T ) = T (x). The set {qx : x ∈ E} defines the strong operator topology, also called the topology of pointwise convergence. The monad of 0 is given by μstop (0) = {T ∈ ∗ L(E, F) : T x 0 for all standard x ∈ E}. For F = K one obtains the weak topology on E. (v) For x ∈ E and ξ in E consider the seminorm on L(E, F) defined by px,ξ (T ) = | < T (x), ξ > |. The set of these seminorms defines the weak operator topology. The monad of 0 is given by μwop (0) = {T ∈ ∗ L(E, F) :< T x, ξ > 0 for all standard x ∈ E, ξ ∈ F }. (vi) Let E, F be vector spaces over K, and let b : E × F be a bilinear form such that to each x ∈ E, x = 0, there exists y ∈ F with b(x, y) = 0 and similarly for each 0 = y ∈ F there exists x ∈ E such that b(x, y) = 0. We call such a bilinear form separating. Then for each y ∈ F p y (x) = |b(x, y)| defines a seminorm on E and the set { p y : y ∈ F} is separating and defines a topology Tb on E. Interchanging the roles of E and F we obtain a corresponding topology Tb on F by the same bilinear form. Examples (i), (ii), and (iii) are special cases of these topologies. The bilinearity of b implies the following equation for every x0 in E, y0 in F, respectively. μb (x0 ) = {x ∈ ∗ E : b(x0 − x, y) 0 for all standard y ∈ F}. μb (y0 ) = {y ∈ ∗ F : b(x, y0 − y) 0 for all standard x ∈ E}.
(4.1) (4.2)
Problem 4.3.4 Prove these equations. Example 4.3.5 In analogy to the construction of the nonstandard hull of normed spaces we define at first the set Fin(E) of finite elements of ∗ E by Fin(E) = {x ∈ ∗ E : p(x) ∈ Fin(R+ ) for all (standard) p ∈ P}. Whenever the set P should be considered explicitly we write FinP (E). The set Fin(E) characterizes the topology in a simple manner, as we shall see below.
122
M.P.H. Wolff
Lemma 4.3.6 (a) x ∈ μ(0) and λ ∈ Fin(K) implies λx ∈ μ(0). (b) x ∈ Fin(E) and λ 0 implies λx ∈ μ(0). (c) For every x ∈ μ(0) there exists an infinitely large N ∈ ∗ N with N x ∈ Fin(E). Proof The first two assertions are simple consequences of the calculation with seminnorms and infinitesimals. (c) We use the set { p A : A ⊂ P finite} (see above). Let x ∈ μ(0) be arbitrary. For each nonvoid finite subset A ⊂ P we define the internal set C(A) := {n ∈ ∗ N : n ≥ |A|, p A (x) ≤ n1 }. It contains the external set N since p A (x) 0 by hypothesis. ∗ The family {C(A) : A ∈ P finite} is directed downwards. Since our model V ( X ) is polysaturated this implies that A C(A) = ∅. Let N be in that intersection. Then N ≈ ∞ and p(x) ≤ N1 for every standard p. Thus p(N x) = N p(x) ≤ 1 for all p ∈ P. Now let P and Q be two sets of seminorms generating the topologies TP , TQ , respectively. In the next theorem we show that Fin(E) is uniquely determined by the topology: Theorem 4.3.7 (C.W. Henson, L.R. Moore [21]) Let P, Q be two sets of seminorms on E. Then the following assertions are equivalent: (i) TP is coarser than TQ , more formally: TP ⊂ TQ . (ii) μQ (0) ⊂ μP (0). (iii) FinQ (E) ⊂ FinP (E). Proof Obviously (i) ⇔ (ii). (ii) ⇒ (iii): Assume that (iii) does not hold. Then there exists x ∈ FinQ and some x x is in μQ (0) but p( p(x) ) = 1, p ∈ P such that p(x) ≈ ∞. By Lemma 4.3.6 (a) p(x) a contradiction. (iii) ⇒ (ii): Let x ∈ μQ (0) be arbitrary. Then by Lemma 4.3.6 (c) there exists N ≈ ∞ such that N x ∈ FinQ (E) ⊂ FinP (E), but then x = 1/N · N x ∈ μP (0) by Lemma 4.3.6 (b). Corollary 4.3.8 TP = TQ if and only if FinP (E) = FinQ (E). Corollary 4.3.9 Let (E, TP ) and (F, TQ ) be two locally convex spaces and T : E → F be a linear mapping. The following assertions are equivalent: (i) T is continuous for the corresponding topologies. (ii) ∗ T (μP (0)) ⊂ μQ (0). (iii) ∗ T (Fin(E)) ⊂ Fin(F). Problem 4.3.10 Prove the corollary. Hint: Adapt the proof of the theorem and use Sect. 3.2. Corollary 4.3.11 Let E be a normed linear space. Then Fin· (E) = Finσ(E,E ) (E) holds if and only if dim(E) < ∞
4 Branch Spaces and Linear Operators
123
Proof If dim(E) ∈ N then the asserted implication is obvious. Now assume that Fin· (E) = Finσ(E,E ) (E) holds. Then μσ(E,E ) (0) = μ· (0) by the theorem. Let B be the unit Ball with respect to the norm. Then μσ(E,E ) (0) ⊂ ∗ B. Since the former set is external there exists a standard finite set A = {ξ1 , . . . , ξm } and a standard ε > 0 such that B A,ε := {x ∈ E : p A (x) < ε} satisfies ∗ B A,ε ⊂ ∗ B. This implies B A,ε ⊂ B. If dim(E) = ∞ there exists a standard x = 0 in {y ∈ E :< y, ξ j >= 0, j = 1, . . . , m} hence p A (x) = 0 = p A (N x) for every N ≈ ∞. Thus N x ∈ ∗ B A,ε which in turn implies N x ≤ 1 which is impossible. Corollary 4.3.12 Let E, F be normed spaces. Every norm-continuous linear map T : E → F is weakly continuous, that means continuous for the topologies σ(E, E ) and σ(F, F ). Problem 4.3.13 Prove this corollary. Hint: See Sect. 3.2 and use the adjoint mapping. As before we consider a separating set P of seminorms and the topology defined by P. μ(0) is a subspace of the K -vector space Fin(E), and the associated congruence relation is nothing else than the equivalence relation defined by the uniformity generated by P, namely x ≡μ(0) y iff x − y ∈ μ(0), iff p(x − y) 0 for all p ∈ P. = Fin(E)/μ(0) is called the nonstandard hull of E. Every The quotient space E by p( seminorm p gives rise to a seminorm pˆ on E ˆ x) ˆ = ◦ p(x) (the standard part of p(x) which is well defined by what is discussed above). The set of seminorms gained in this way is obviously again separating. x → ∗x is a topological embedding. In fact p( ˆ ∗x) = p(x) The mapping E → E, holds for all p ∈ P. So we can E consider as a subspace of E. is complete (see [21]). Since we use polysaturated models only in our setting E Let (E, F) be a pair of vector spaces equipped with a separating bilinear form b (see Example 4.3.3, vi). Since b is separating, we can E identify with a subspace of the algebraic dual F ∗ of F: Let x ∈ E be arbitrary. ϕx : F → K is given by ϕx (ξ) = b(x, ξ). The mapping x → ϕx is the embedding. Now we can write < x, ξ > in place of b(x, ξ), and the uniformity defined by b will be denoted by σ(E, F) in accordance with the special case where E is a normed space and F = E is its dual (see Example 4.3.3, (i) and (ii)). Let H be a finite dimensional subspace of F. Then the mapping E x → φx : H → K, φx (ξ) =< x, ξ > is surjective onto the algebraic dual H ∗ of H . This simple fact is the key to the proof of the following theorem: onto the algebraic Theorem 4.3.14 There exists a topological isomorphism T of E dual F ∗ of F, equipped with the topology σ(F ∗ , F), the restriction T | E of which to E is the canonical embedding of E into F ∗ .
124
M.P.H. Wolff
Proof Let S : Fin(E) → F ∗ given by S(x)(ξ) = ◦ < x, ξ > (the standard part of < x, ξ >). S is K -linear with kernel μσ(E,F) (0). The induced mapping is our desired T . We only have to prove that it is suron Fin(E)/μσ(E,F) (0) = E jective. By Theorem 4.2.20 there exists a hyperfinite dimensional subspace H of ∗ F containing F externally. Let φ ∈ F ∗ be arbitrary (standard). Then the Transfer Principle applied to the considerations in the preceding paragraph yields that there exists x ∈ ∗ E such that ∗ φ| H = φx | H . Since F ⊂ H , it follows that x ∈ Fin(E) as well as Sx = φ = T (x). ˆ The remainder is obvious.
Theorem of Banach-Alaoglu Let E denote a normed space, and E its dual space of all continuous linear functionals on E equipped with the dual norm (cf. p. 121). In the following we denote Fin· (E) simply by Fin(E). The proof of the next theorem of Banach and Alaoglu is a typical example of applications of nonstandard analysis to functional analysis: Theorem 4.3.15 (Banach–Alaoglu) Let E be a (standard) normed space. Then the unit ball of the dual space E is compact for the weak topology. Proof Let B be the unit ball of E , and let ξ ∈ ∗ B be arbitrary. ξ ≤ 1 implies that x, ξ is nearstandard for all x ∈ Fin(∗ E), and in particular for all x standard. Then η, defined by x, η = ◦ (x, ξ) for all standard x, is a standard linear form, bounded by 1 on the unit ball of E. But by definition if x ∈ E is standard then x, η x, ξ , so ξ η with respect to the weak topology (see Example 4.3.3 (ii) and the second of the Eq. 4.1), and the theorem follows from Theorem 3.5.1.
4.3.2 General Banach Spaces Due to lack of space we only can give very few results. We refer the interested reader to [23], which in our opinion is the best reference to nonstandard analysis and Banach spaces (operator theory is not treated there).
On the Structure of the Nonstandard Hull Let E be a standard Banach space over K . In order to prove the main theorem on the we recall the fundamental standard theorem of local reflexivity due structure of E to J. Lindenstrauss and H.P. Rosenthal [35]. A relatively simple proof may be found in [38]. Theorem 4.3.16 (Principle of Local Reflexivity) Let E be a Banach space. For each finite-dimensional subspace F of E , each finite-dimensional subspace G of E , and each ε > 0 there exists an injective linear map T : F → E such that
4 Branch Spaces and Linear Operators
125
(i) T ≤ 1 + ε and T −1 ≤ 1 + ε. (ii) T x = x if x ∈ F ∩ E. (iii) < T x, ξ >=< x, ξ > for all x ∈ F and ξ ∈ G. We derive the following basic proposition from this principle: the nonstandard hull of the Banach space E . Then there Proposition 4.3.17 Let E satisfying exists an isometric embedding R from E into E, (see (i) Rx = x for all x ∈ E, where E is identified with its canonical image in E p. xxx). (ii) < Rx, ξ >=< x, ξ > for all x ∈ E , and ξ ∈ E , identified with its canonical . image in E Proof By Theorem 4.2.20 there exist hyperfinite dimensional subspaces F ⊂ ∗ E , and G ⊂ ∗ E , containing (externally) the spaces E , E , respectively. Let ε > 0 be infinitesimal. Applying the Transfer Principle to the Principle of Local Reflexivity we obtain an internal linear mapping T : F → G satisfying (i)—(iii) of this principle. We obtain in particular T x = x for all x ∈ E, moreover < T x, ξ >=< x, ξ > for all x ∈ E and ξ ∈ E . Finally T , T −1 1. Thus the mapping Tˆ : Fˆ → Eˆ is an isometry, and R := Tˆ | E has the desired properties. Remark 4.3.18 Note that the mapping R is not unique, except E being reflexive. The weak topology σ(E, E ) of a Banach space E is coarser than the norm topology. By Theorem 4.3.7 we have μ· (0) ⊂ μσ(E,E ) (0) and Fin· (E) ⊂ Finσ(E,E ) (E). We set μσ,b (0) = μσ(E,E ) (0) ∩ Fin· (E) and Eˇ = μ σ,b (0) = μσ,b (0)/μ· (0). Note that if x ∈ Fin(E) and ξ ∈ Fin(E ) then < x, ξ > ∈ Fin(K ). This fact As before we identify E, allows us to prove the following structure theorem on E. , respectively. Moreover we use the embedding E E , with its canonical image in E, of Proposition 4.3.17. R from E into E ˇ i.e. is the topological direct sum of R(E ) and E, Theorem 4.3.19 E ˇ = R(E ) ⊕ E. E
(4.3)
Proof Let S : Fin(E) → E be given by S(x)(ξ) = ◦ < x, ξ > (◦ denotes the standard part) for every ξ ∈ E . Obviously S(x) = S(y) holds whenever x −y 0. → E be the induced mapping. It is linear and contractive. Since Q ◦ R Let Q : E is the identity of E , Q is surjective. Since ker(S) = μσ,b (0), the kernel of Q is ˇ So R Q is a projection onto R(E ) and (I − R Q) maps E onto nothing else than E. ˇ ker(R Q) = E. of a As a first application we obtain a decomposition of the nonstandard hull T standard operator T . For different Banach spaces E and F we denote the linear maps of the theorem above by R E , Q E , and so on.
126
M.P.H. Wolff
Proposition 4.3.20 Let T be a bounded linear mapping from the Banach space E has the decomposition T = R F T Q E ⊕ Tˇ where T into another one F. Then T ˇ in matrix denotes the biadjoint of T , mapping E into F , and Tˇ maps Eˇ into F; form: R F T Q E 0 . T = 0 Tˇ If in particular E is reflexive, then = T
T 0 0 Tˇ
.
Proof T is weakly continuous by Corollary 4.3.12, hence ∗ T (μσ(E,E ) (0)) ⊂ μσ(F,F ) (0). Moreover ∗ T (Fin(E)) ⊂ Fin(F), since T is norm-continuous. Both ˇ ⊂ F. ˇ ( E) facts together imply T Now let xˆ = R E (x ) ∈ R( E ) and η ∈ F be arbitrary. It is easy to prove that < T x, ˆ η >=< x, ˆ T η > holds since η is standard. So we obtain (R E (x )), η > = < R E (x ), T (η) >
= < T (x ), η > = < R F (T (x )), η > . R E , in particular T R E (E ) ⊂ R F (F ), hence T R E Q E ( E) This implies R F T = T ⊂ R F Q F ( F). If E is reflexive then R E , R F , respectively are nothing else than the canonical embeddings into the corresponding nonstandard hulls.
Basic Geometry of Banach Spaces Let us start by recalling some notions of the structure theory of Banach spaces: The Banach space F is λ–embeddable into the Banach space E if there exists an isomorphism T of F into E such that x ≤ T x ≤ λx for all x ∈ F. The space F is finitely λ–representable in E if to every ε > 0 and to each finitedimensional subspace G of F there exists an isomorphism T : G → E such that (1 − ε) x ≤ T x ≤ (λ + ε)x for all x ∈ G. If λ = 1 then we say also that F is representable (finitely representable, resp.) in E in place of 1–embeddable (finitely 1–representable, resp.). Our first theorem illuminates this latter notion. Theorem 4.3.21 ([23], Theorem 3.2) Let E be an internal Banach space and let F iff F be a standard Banach space in V (X ). Then F is finitely λ –representable in E is λ–embeddable in E.
4 Branch Spaces and Linear Operators
127
Let G be the collection of Proof (I) Assume that F is finitely λ–representable in E. finite-dimensional subspaces G in F and set εG = 1/ dim(G). To each G ∈ G satisfying (1 − εG /2)x ≤ VG (x) ≤ there exists a linear map VG : G → E (λ + εG /2)x. Let {y1 , · · · , yn } be a base of G of vectors of norm 1, and pick x j ∈ E such that xj = VG (y j ) as well as (1 − εG ) ≤ x j ≤ (λ + εG ). By WG (y j ) = x j and internal linear extension there is defined an internal linear G = VG . mapping WG from ∗ G into E satisfying W Hence, (1 − εG ) ≤ WG (x) ≤ (λ + εG ) holds for all x of norm 1.
(4.4)
(II) Let be the binary relation on ∗ G defined by (G, H ) ∈ iff G ⊂ H and there exists an internal linear mapping W : H → E satisfying inequality (4.4). The relation is concurrent on G and ∗ V (X ) is polysaturated. Hence there exists an H ∈ ∗ G and W : H → E satisfying the relation (4.4) (see Sect. 2.9) such that every finite-dimensional standard G is contained in H , in particular F is an | F is the desired λ–embedding. (Notice external subspace of H . Now T = W ∗ that dim (H ) ∈ N \N , hence ε H 0.) Our next theorem shows a close connection between the standard Banach space ˆ E and its nonstandard hull E. Theorem 4.3.22 Let E be a (standard) Banach space of the full superstructure is finitely 1–represented in E. V (X ). Then E Remark 4.3.23 Notice that in general Eˆ ∈ / V (X ). of dimension n. Then by a standard result there Proof Let F be a subspace of E exists an isometry J from F onto C n =: V , equipped with an appropriate norm. Notice that V is in V (X ), as follows immediately from our hypothesis that C is contained in V (X ). Let {e1 , . . . , en } be a basis of normalized vectors of V and set yk = J −1 (ek ). Then there exist x1 , . . . , xn in ∗ E with yk = xk for each k. By Lemma 4.2.5, B := {x1 , . . . , xn } is internally linearly independent. Denote by H the ∗ -linear ∗ E. Then by the Transfer Principle the linear map W , defined hull of {x1 , . . . , xn } in n ∗ by W ( 1 αk ek ) = n1 αk xk is internal. Moreover it satisfies W (x) x for = J −1 is an isometry. Let ε > 0 be an arbitrary standard all finite x ∈ V since W real number. Then taking S = W we see that ∃S ∀x ∈ ∗ V [x = 1 ⇒ (1 − ε) ≤ S(x) ≤ (1 + ε)] holds in ∗ V (X ) and hence by the Downward Transfer Principle also in V (X ). For such an S the map T := S ◦ J is the desired one. This theorem enables us to give an easy characterization of λ–finitely embeddability.
128
M.P.H. Wolff
Proposition 4.3.24 Let E, F be standard Banach spaces of our full superstructure V (X ). The following assertions are equivalent: (i) F is finitely λ–representable in E. (ii) F is finitely λ–representable in E. (iii) F is λ–embeddable into E. Proof (i) =⇒ (ii): Obvious by Remark 4.2.2 infra. (ii) =⇒ (iii) follows from Theorem 4.3.21 applied to the particular internal space ∗ E. (iii) =⇒ (i) follow from Theorem 4.3.22 above. Recall that a Banach space E is called superreflexive if F finitely representable in E implies F is reflexive. In order to apply our results within this context we have to recall results of R.C. James on reflexive Banach spaces. The equivalent assertion (iv) below goes back to Dunford and Schwartz [13]. Theorem 4.3.25 (R.C. James [29]) For a Banach space E the following assertions are equivalent: (i) (ii) (iii)
E is reflexive. Every separable subspace of E is reflexive. For linear functional y in E there exists x in E such that x = 1 and every x, y = y . (iv) There exists a closed subspace F such that F as well as E/F are reflexive.
Eˆ is in general not an element of our superstructure V (X ). However, in order to ˆ We apply the preceding theorem to Eˆ we have to consider separable subspaces of E. therefore prove first the following technical but helpful lemma. Lemma 4.3.26 Let V (X ) be the full superstructure over an appropriate infinite set X containing C. Then to every separable Banach space E there exists an isometric copy H , say, in V (X ). Notice that with a little more effort this assertion can be generalized to Banach spaces of density character κ strictly less than the cardinality of V (X ). Proof Because E is separable there exists a countable subset {xn : n ∈ N} that is dense in the unit ball of E. By the Hahn–Banach–Theorem this set separates points on E . Because the dual unit ball B of E is weak∗ compact by Theorem 4.3.15 it follows that : B η → (η) = (xn , η)n∈N ∈ [0, 1]N is a homeomorphism onto a closed subset Y of [0, 1]N . This latter space is in V (X ) because C ∈ V (X ). Hence Y ∈ V (X ). But then the Banach space C(Y ) of all
4 Branch Spaces and Linear Operators
129
continuous functions on Y as well as all subspaces of it are elements of V (X ). The map T : E x → T x =< x, −1 (·) > is a linear isometric embedding of E onto a subspace H of C(Y ). Now we are able to characterize superreflexivity. Theorem 4.3.27 For a Banach space E the following assertions are equivalent: (i) (ii) (iii) (iv)
E is superreflexive. is reflexive. E E is superreflexive. (E ) = ( E)
By Theorem 4.3.25 we may Proof (i) ⇒ (iii): Let F be finitely representable in E. assume without loss of generality that F is separable, hence in our superstructure V (X ) by Lemma 4.3.26. Then F is finitely representable in E as follows from 4.3.22, so F is reflexive. (iii) ⇒ (ii): Obvious. (ii) ⇒ (i): If F is finitely representable in E and separable then F is embeddable into by Proposition 4.3.24, since we can assume that F is in V (X ) by Lemma 4.3.26. E But then F is reflexive and (i) follows. is a proper closed subspace of ( E) . Since E is reflexive (ii) ⇒ (iv): Suppose that E . But by the Hahn– there exists x ∈ E, x = 1 and x , y = 0 for all y ∈ E Banach Theorem and the Principle applied to some x , there exists a Transfer x ∈ x, z , a contradiction. z ∈ Fin(E ) satisfying x, z = 1 and z 1, hence 1 = (iv) ⇒ (ii): Let Then x = y for some y ∈ ∗ (E ). But x ∈ ( E) = E be arbitrary. ∗ y = sup{| x, y | : x = 1, x ∈ E}. Hence by the Transfer Principle applied to 0 < ε 0, there exists an x ∈ ∗ E with x = 1 such that y − ε < | x, y | ≤ y . This gives x , x | ≤ x , x = ◦ (y ) = ◦ (| x, y |) = | which means Theorem 4.3.25 (iii) is satisfied and the assertion follows. Using assertion (iv) of this result we obtain the easy proof of Rakov (see [19]) of the following theorem of Enflo, Lindenstrauss, and Pisier. Corollary 4.3.28 Let E be a Banach space and let F be a closed subspace of E. If F and the quotient space E/F are superreflexive then E is superreflexive. Proof Since the quotient mapping Q : E → E/F is open we get easily E/F ∼ = E/ F. So by the Theorem, F as well as E/ F are reflexive. But by Theorem 4.3.25 is reflexive, and the theorem gives the desired result. (iv) E
130
M.P.H. Wolff
4.3.3 Banach Lattices There is a theory of finitely λ–representable Banach lattices similar to the theory for Banach spaces sketched so far. Let us denote by c0 the space of sequences x = (xn )n∈N ⊂ C with lim xn = 0, x = sup(|xn |) (see Example 4.2.17 (i)). With |x| = (|xn |)n∈N it becomes a Banach lattice. Its dual space can be identified with l 1 (N) = l 1 = {x ∈ CN : |xk | =: x1 < ∞}, which is also a Banach lattice under the canonical order. are lattice homomorphisms Obviously the nonstandard extension ∗ T as well as T whenever T has this property. In full correspondence with Sect. 4.3.2, we define the Banach lattice F to be finitely λ–lattice representable in the Banach lattice E, if for each finite–dimensional vector sublattice G ⊂ F and each ε > 0 there exists a lattice isomorphism T from G into F with (1 − ε)x ≤ T x ≤ (λ + ε)x for all x ∈ G. We give one example of the usefulness of this concept. Theorem 4.3.29 Let E be a Banach lattice. Then the following assertions are equivalent: (i) E is supereflexive. (ii) Neither c0 nor l 1 are finitely 1–lattice representable in E. (iii) Neither c0 nor l 1 are 1–lattice embeddable in E. Proof First of all one may prove (ii) ⇔ (iii) generalizing Proposition 4.3.24 to the case of finitely lattice representable spaces. Then a famous result of Meyer–Nieberg (and others, see [57], Theorem II.5.11) says that the Banach lattice F is reflexive iff neither c0 nor l 1 are lattice embeddable in F. Theorem 4.3.27 now yields the result. Examples are spaces L p (1 < p < ∞) and many other Banach function spaces. In order to analyze the structure of the nonstandard hull of an internal Banach lattice we need one more notion: The norm on the Banach lattice E is order continuous if lim xα = 0 holds for every downwards directed net (xα ) of positive elements with inf xα = 0. The following theorem due to Henson and Moore (see [23], Theorem 4.9) characterizes those nonstandard hulls having order continuous norm. In order to prove it we need the following technical lemma: Lemma 4.3.30 let E be a Banach lattice and let ( x )n∈N be a normalized sequence satisfying inf( of positive elements in E xm , xn ) = 0 for m = n. Then there exists an internal hyperfinite sequence (yn )n≤N of normalized positive vectors yn satisfying inf(ym , yn ) = 0 for m = n as well as yn = xn for all (standard) n. Proof By induction on n we select a sequence (yn ) ⊂ ∗ E such that 0 < yn , yn = yn = xn : 1, inf(yn , ym ) = 0 and For n = 1 choose x1 ∈ x1 .Then x1 = |x1 | 1 Since x1 > 0 x1 |x1 | holds. We set y1 = |x1 |/|x1 |.
4 Branch Spaces and Linear Operators
131
Suppose, {y1 , · · · , yn } are already selected as desired. Let xn+1 in xn+1 be arbi− z= xn+1 since xn+1 0 (cf. the argument for trary. Set z = |xn+1 |/xn+1 . Then y1 ) and z = 1. Let u = z − inf(z, nk=1 yk ). Then u = z − inf z,
n k=1
xk
xn+1 ), = xn+1 − inf
n
xk
= xn+1 ,
k=1
whence inf(z, nk=1 yk ) 0. Obviously inf(u, yk ) = 0, so yn+1 = u/u is the desired element. Since V (X ) is polysaturated it is comprehensive, hence the sequence (yn )n∈N possesses an internal extension (yn )n∈∗ N where yn = 1 and 0 ≤ yn (see Theorem 2.9.5). The internal set A := {n : inf(yk , y ) = 0 for k, ≤ n} contains N and hence an infinite integer N . Corollary 4.3.31 Let E be a Banach lattice. Then c0 is finitely 1-lattice representable in E if and only if l ∞ (N) is 1-lattice representable in the nonstandard hull E. Proof In analogy to Proposition 4.3.24 we obtain that c0 is finitely 1-lattice repre Let en = (δk,n )k∈N be the nth sentable in E iff c0 is 1-lattice representable in E. basis vector in c0 (δk,n denotes the Kronecker symbol) and let T denote the isomet Then we apply the lemma to the sequence (T en )n∈N ric lattice isomorphism into E. and obtain the internal sequence (yn )n≤N . Let f ∈ l ∞ (N) be arbitrary. Then set N ∗ f (n)yn . The mapping f → f˜ is the desired embedding, cf. Example f˜ = k=1 4.2.17, 1. The main and surprising assertion in the following theorem is that whenever the nonstandard hull is Dedekind complete its norm is order continuous, a conclusion which is far from being true in general. be the nonstandard hull Theorem 4.3.32 (C.W. Henson–L.R. Moore, [23]) Let E of an internal Banach lattice E. The following assertions are equivalent: has order-continuous norm. (i) E is Dedekind-complete, i.e., every order-bounded subset has a least upper (ii) E bound. (iii) c0 is not 1-lattice representable in E. (iv) c0 is not 1-finitely lattice representable in E. (v) l ∞ (N) is not 1-lattice representable in E. Proof By the preceding corollary and the analog of Proposition 4.3.24 (iii), (iv), and (v) are equivalent. Moreover (v) is equivalent to (i) by [40], Corollary 2.4.3. The implication (i) ⇒ (ii) is also well known (see e.g. [40], Theorem 2.4.2). So it remains to prove (ii) ⇒ (iii):
132
M.P.H. Wolff
and let T : c0 → E be (ii) ⇒ (iii): Assume that c0 is 1-lattice representable in E such an embedding. Let en = (δk,n ) be as in the proof of the preceding corollary. It was shown there that there exists a hyperfinite sequence (yn )n≤N as described in N that lemma, in particular yn = T (en ) holds. Then p = k=1 yk has norm 1. p . Assume The set B = {T (en ) : n ∈ N } is bounded above by that sup(B) exists. s = sup(B). Since s ≥ nk=1 T (ek ), we have Then there is an s > 0 in∗ E with (s − nk=1 yk )− 0, hence n(s − nk=1 yk )− ≤ 1 for all standard n. Therefore by the Spillover Principle, Theorem 2.8.11 (i) there exists N2 ≤ N infinitely large N2 N2 such that N2 (s − k=1 yk )− ≤ 1, hence (s − k=1 yk )− 0. This implies s ≥ N2 n ∧ ( k=1 yk ) ≥ k=1 T (ek ) for all standard n. But then (s − y N2 )∧ ≥ nk=1 T (ek ) s − y N2 < s, a contradiction. and (s − y N2 )∧ = One consequence of this theorem is that ∞ (N)∧ is no longer a dual Banach lattice since such Banach lattices are Dedekind-complete, and because as an AM– space with unit ∞ (N)∧ is isometrically and lattice isomorphic to some space C(K ) of all continuous functions on a compact space K (see Theorem 4.2.35), its norm is not order continuous. The space ∞ (N) is a von Neumann algebra, which means it is isomorphic to a weakly closed subalgebra of the algebra L(H ) of all bounded operators on an appropriate Hilbert space H . In fact ∞ (N) can be identified with the algebra of multiplication by functions on 2 (N), and as such ∞ (N) is weakly closed. A von Neumann algebra A is Dedekind-complete with respect to the order S ≤ T if S and T are selfadjoint and (T − S) = U ∗ U for an appropriate U ∈ A. A reasoning similar to that one in the proof of (ii) ⇒ (iii) in the above theorem shows that the nonstandard hull of a von Neumann algebra is never a von Neumann algebra. A C ∗ –algebra A is a von Neumann algebra iff it is a dual space. By a famous theorem of Sakai ([56], Corollary 1.13.3) the predual is unique up to isometric isomorphisms. A surprising and very important result of Groh [18] says that the nonstandard hull of the predual of a von Neumann algebra is again the predual of another von Neumann algebra. This result is still relevant, see [3]. Given some knowledge of the theory of von Neumann algebras, the proof is astonishingly not too hard. Theorem 4.3.33 Let M be a von Neumann algebra with predual M∗ . Then the ∗ is again the predual of a von Neumann algebra. nonstandard hull M Proof The predual M∗ is an M–module by the following left and right actions of M on M∗ : For all x ∈ M as well as for all ϕ ∈ M∗ the linear forms y → ϕ(x y) and y → ϕ(yx) are in M∗ . By the Transfer Principle for all x ∈ ∗ M as well as for all ϕ ∈ ∗ M∗ the linear forms y → ϕ(x y) and y → ϕ(yx) are in ∗ M∗ . But this in turn as well as for all ϕˆ ∈ implies that for all xˆ ∈ M M∗ the linear forms yˆ → ϕ (xˆ yˆ ) M∗ can obviously be identified with a closed and yˆ → ϕ ( yˆ x) ˆ are in M∗ . Moreover Since M is σ(M , M ) dense in M the (the dual space of M). subspace of M proposition follows by [64], Theorem III.2.7.
4 Branch Spaces and Linear Operators
133
4.3.4 Notes All results of Sect. 3.1 are taken from [21] and almost all results of Sect. 3.2 are taken from [23]. These two papers are fundamental and pioneering contributions to nonstandard functional analysis. The proof of the theorem of Banach–Alaoglu is due to W.A.J. Luxemburg [36]. Corresponding results within the framework of ultraproducts may be found in [19] where one also will find further references to the history of the results. C.W. Henson (see [23]) has developed a special logical language that allows one to express problems concerning relations which can be approximately satisfied. Together with nonstandard analysis this gives new and deep insight into various properties of special Banach spaces and their nonstandard hulls. We recommend in particular the papers [20, 23]. Recent development is reported in [24]. Another aspect—the combination of Loeb measure theory with functional analysis—also gives interesting new results. For example, a Banach space in which a ball is contained in the range of some countably additive measure is superreflexive (see [62]). A third aspect is the use of nonstandard analysis for infinite constructions, e.g., infinite tensor products of C -algebras. This interesting field has applications in quantum physics, see [27, 30, 72, 75].
4.4 Elementary Theory of Linear Operators 4.4.1 Compact Operators Let E be a standard Banach space (always in V (X )). By Theorem 3.5.1 a subset K of E is relatively compact iff ∗ K ⊂ E + μ(0) = ns(∗ E) where ns(∗ E) denotes the set of all nearstandard points in ∗ E. We have already considered internal S–continuous operators in Proposition 4.2.22 (operator always means linear mapping). The simplest ones are those of standard finite rank. Let T be such an operator. Then dim(T (E)) = n standard, and its nonstandard n hull (see 4.2.23) is of the same rank as T (notice that T is of the form T = k=1 ϕk ⊗ x k ). Another class of simple operators is the class of compact operators. Let E, F be standard Banach spaces. The linear operator T from E to F is compact iff T maps bounded sets onto norm relatively compact sets. We denote the unit ball of a Banach space by B(0, 1). Proposition 4.4.1 Let E, F be (standard) Banach spaces, and let T : E → F be a linear operator. The following assertions are equivalent: (i) T is compact. (ii) ∗ T (∗ B(0, 1)) ⊂ ns(∗ F) (the set of nearstandard points).
134
M.P.H. Wolff
maps E into F (identified with a subset of F). (iii) T is compact. (iv) T Proof (i) ⇔ (ii) ⇔ (iii) as well as (iv) ⇒ (i) are obvious (use Theorem 3.5.1). (i) ⇒ (iv): Let ε > 0 be given. Then there exists a finite set M with d(T (B(0, 1), M) < ε . By transfer (remember ∗ M = M since M is finite) we obtain ∗ d(∗ T ∗ (B(0, 1), B(0, ( M) < ε, hence d(T 1), M) < ε. Since ε > 0 was arbitrary, T B(0, 1)) is precompact. Concerning uniform convergence we have the following useful lemma: Lemma 4.4.2 Let E, F be standard Banach spaces, and let (Tα )α∈A be a net of bounded linear operators from E to F. Moreover, let T also be a bounded operator from E to F. The following assertions are equivalent. (i) (Tα ) → T uniformly. (ii) For all x ∈ Fin(∗ E) and all infinitely large α ∈ ∗ A\A we have Tα x x. uniformly. α ) → T (iii) (T Proof (i) ⇒ (iii) follows directly from Corollary 4.2.26. (i) ⇒ (ii): By transfer Tα x − ∗ T x < ε for all normalized x, all α infinitely large and each standard ε > 0. So (ii) follows. (ii) ⇒ (i): Let ε > 0 standard be fixed, and choose α0 infinitely large. Then this α0 satisfies the formula ∃α ∀β ∀x [x = 1 and β ≥ α implies Tβ x − T x < ε]. The Downward Transfer Principle yields the assertion. Recall that the Banach space E has the bounded approximation property if the identity I is the limit in the strong operator topology of a norm bounded net of operators of finite rank. Almost all classical Banach spaces have this property, but the algebra L(H) of all bounded operators on a separable Hilbert space H fails to have this property (a result due to Szankowski). Proposition 4.4.3 Let E, F be arbitrary Banach spaces. (i) The uniform limit T of a sequence (Tn ) of compact operators is compact. (ii) If F possesses the bounded approximation property then every compact operator T is the uniform limit of operators of finite rank. n map E into F and (T n ) converges uniformly to T by Lemma 4.4.2. Proof (i) All T ( E) ⊂ F, and T is compact by Proposition 4.4.1. So T (ii) Let (Pα )α∈A be a norm bounded net of operators of finite rank converging strongly to the identity I on F. Then Tα = Pα T is of finite rank for all α ∈ A. If α ∈ ∗ A\A is infinitely large and x ∈ Fin(∗ E) then T x is nearstandard, and
4 Branch Spaces and Linear Operators
135
if y = ◦ T x is its standard part then Pα y y. But since Pα is S–bounded by hypothesis we obtain Pα T x Pα y y T x. Since x ∈ Fin(∗ E) and α infinitely large are arbitrary, the assertion follows by Lemma 4.4.2. Now we give an easy proof of the theorem of Schauder asserting that the adjoint or dual operator of a compact operator is also compact. Theorem 4.4.4 (Schauder) The operator T from E to F is compact iff its adjoint T is compact. Proof Let T be compact, and let ϕ ∈ ∗ (F ) satisfy ϕ ≤ 1. Then by Theorem 4.3.15 its standard part ψ, say, with respect to the weak∗ –topology exists, is given by < x, ψ >< x, ϕ > for all standard x, and satisfies ψ ≤ 1. We show that ∗ T (ϕ) is norm-nearstandard to ∗ (T ψ): Let y ∈ Fin(∗ E) be arbitrary. Then < y, ∗ (T ∗ T y, ψ > ∗T y
< ∗ T y, ϕ >=< y, ∗ (T )ϕ > .
nearstandard
Proposition 4.2.3 (iv) yields the assertion. Conversely if T is compact so is T by the first part of our proof. But T = T | E , where E is identified with its canonical image in E .
4.4.2 Fredholm Operators We adhere to the notions introduced in the preceding section. Let E, F be standard Banach spaces and denote the space of compact operators where from E to F by K(E, F). For T ∈ L(E, F) consider the operator Q F ◦ T ˜ ) Q F denotes the quotient mapping from F onto F = F/F. Its kernel ker(Q F ◦ T contains E, hence there is a unique operator T : E → F. The mapping T → T is = 0 iff T ∈ K(E, F). Therefore, easily seen to be linear and continuous. Moreover T we obtain the following proposition. induces an isometric linear representation of Proposition 4.4.5 The map T → T F). If in addition E = F then this the Calkin space L(E, F)/K(E, F) into L( E, ˜ representation is multiplicative from the Calkin algebra L(E)/K(E) into L( E). An operator T ∈ L(E, F) is called a Fredholm operator if dim(ker T ) + dim(F/T (F)) < ∞. A well-known standard argument shows that a Fredholm operator T has closed range. More precisely E = ker(T ) ⊕ E 1 and F = T (F) ⊕ F2 are topological decompositions and T1 = T | E 1 is bijective from E 1 onto T (F). Set
136
M.P.H. Wolff
S : F → E by S(y) = T1−1 (y) for y ∈ T (F) and S(z) = 0 for z ∈ F2 . Then S satisfies T ST = T . This in turn gives the following version of Atkinson’s Theorem: Theorem 4.4.6 Let T be an element of L(E, F). The following assertions are equivalent: (i) (ii) (iii)
T is Fredholm. is bijective. T T + K(E, F) is invertible in L(E, F)/K(E, F).
Proof We use the notations of the paragraph preceding the theorem. = N and F 2 = F2 (see (i) ⇒ (ii): ker(T ) = N and F2 are finite dimensional, hence N = T ( F) ⊕ F2 , = N ⊕ Corollary 4.2.10). This gives the decomposition E E 1 and F = T1 is invertible with inverse S where S is as in the paragraph preceding the so T theorem. is not injective. (ii) ⇒ (i): If dim(ker(T )) = ∞ then ker T \E = ∅, hence T Moreover T (E) is closed by Proposition 4.2.30. Finally, assume that dim(F/T (E)) = ∞. By Theorem 4.2.20 there exists a hyperfinite dimensional subspace H of ∗ F containing F as an external subspace. Set G = T (E). By transfer the ∗ –linear hull L of H and ∗ G is internally closed and L/∗ G is hyperfinite dimensional, in particular L = ∗ F. Thus by Proposition 4.2.6 is bijective there exists y ∈ ∗ F\L of norm 1 satisfying d(y, L) ≥ 1/2). Since T ∗ ∗ g+z = y F/F = G/F. So there exists g ∈ G, g finite, and z ∈ F such that hence y g + z ∈ L, a contradiction to d(y, L) ≥ 1/2. (i) ⇒ (iii): Let S be as in the paragraph preceding the theorem. (i) implies (ii), is invertible in L( E, F). But then S˜ = T −1 follows, hence (iii) holds. i.e. T (iii) ⇒ (ii) follows from Proposition 4.4.5. The index of a Fredholm operator T is defined to be ind(T ) = dim(ker(T )) − dim(F/T (F)) = dim(ker(T )) − dim(ker(T )). Obviously ind(I ) = ind(I + A) = 0 for all A of finite rank. Moreover ind(T ) = 0 for all bijective T . The famous multiplication formula ind(ST ) = ind(S) + ind(T ) can be proved completely by methods from pure linear algebra (see e.g. [42], Theorem 1.4.8). The following theorem is an immediate consequence of Theorem 4.4.6. Theorem 4.4.7 The set F(E, F) of all Fredholm operators from E to F is open in L(E, F), and the index is continuous on F(E, F). Proof By Theorem 4.4.6, F(E, F) is the inverse image (with respect to the quotient mapping) of the set of invertible elements in L(E, F)/K(E, F), which is known to be open. Let now T have index 0. Then E = ker(T )⊕E 1 , F = T (E)⊕F2 as previously introduced. Also, ind(T ) = 0 implies dim(ker(T )) = dim(F2 ) , hence there exists a (necessarily continuous) linear bijection V¯ : ker(T ) → F2 . Set V (x) = V¯ (P x) where P is the projection onto ker(T ) with kernel E 1 . Then T + V is invertible. Now
4 Branch Spaces and Linear Operators
137
let R ∈ ∗ F(E, F) satisfy R ∗ T . Thus, R + ∗ V ∗ (T + V ), whence R + ∗ V is invertible. Now R = (R + ∗ V )−1 (I − (R + ∗ V )−1∗ V ), hence ∗
ind(R) = ∗ ind((R+ ∗ V )(I −(R+ ∗ V )−1∗ V )) = 0+ ∗ ind(I −(R+ ∗ V )−1∗ V ) = 0,
since (R + ∗ V )−1∗ V is of finite rank. Therefore, ind−1 ({0}) is open in F(E, F). Since ind is a homomorphism into Z, the assertion follows. Corollary 4.4.8 If K is a compact operator and z = 0 in K then ind(zT − K ) = ind(T ) holds. Proof The index is constant on the path t → zT − t K (0 ≤ t ≤ 1).
4.4.3 Notes The nonstandard analysis of compact operators was initiated by A. Robinson and A.R. Bernstein [6] who solved the invariant subspace problem for polynomially compact operators. The easy proof of Theorem 4.4.4 is taken from [54], cf. also [37]. As was pointed out above the first treatment of the theory of Fredholm operators by means of Fréchet products was given by Sadovskii [55]. Section 4.4.2 is to some extent within the spirit of that paper. These ideas came up again, apparently independent of [55], in [7, 9]. For the nonstandard analysis of semi-Fredholm operators see [63, 76].
4.5 Spectral Theory of Operators 4.5.1 Basic Definitions and Facts Let E be a Banach space and let T be a bounded linear operator on E. The resolvent set is ρ(T ) = {z ∈ C : (z − T ) is bijective} , and on ρ(T ) the resolvent R(z, T ) is defined by R(z, T ) = (z − T )−1 . Notice that R(z, T ) is continuous by the closed graph theorem. Moreover, ρ(T ) is open, and R(·, T ) is holomorphic satisfying the famous resolvent equation R(z, T ) − R(y, T ) = (y − z)R(z, T )R(y, T ).
(4.5)
The complement of ρ(T ) is called the spectrum σ(T ). It is compact since for |z| > T the Neumann series T n z −(n+1 ) converges to R(z, T ). This also implies the fact that lim|z|→∞ R(z, T ) = 0. Moreover, r (T ) = sup{|z| : z ∈ σ(T )} is called the spectral radius of T . As a consequence of Liouville’s theorem the spectrum is never empty.
138
M.P.H. Wolff
Now z is called an eigenvalue if ker(z − T ) = {0}. The space ker(z − T ) is the space of eigenvectors corresponding to z. The set σ p (T ) of all eigenvalues of T is called the point spectrum of T . A value z is an approximate eigenvalue if inf{(z − T )x : x = 1} = 0. The set of all approximate eigenvalues forms the approximate point spectrum σa (T ) of T . It is closed in σ(T ). A point z ∈ σ(T ) is called a Riesz point of T if it is a pole of R(z, T ) for which 1 R(v, T )dv is of finite rank. A Riesz point z is always the residue Q = 2πi |v−z|=δ
isolated in the spectrum of T , and moreover it is an eigenvalue with an eigenspace of dimension equal to the rank of the residuum. A very useful notion was introduced by L. Trefethen [65]: For ε > 0 we define ρε (T ) = {z ∈ ρ(T ) : R(z, T ) < 1ε }. The set σε (T ) = C\ρε (T ) forms the so–called ε–pseudospectrum. It has started to play an important role in modern numerical analysis. The formula for the Neumann series (see above) produces for |z| > T the 1 inequality R(z, T ) ≤ |z|−T . It follows that for every ε > 0, the set {z : |z| > T + ε} is contained in ρε (T ). Notice that if T is a normal operator on a Hilbert space H, the equality R(z, T ) = 1/d(z, σ(T )) holds for all z ∈ ρ(T ), whence σε (T ) is easily determined. Tn ˆ at infinity is the series ∞ The Laurent series of R(λ, T ) A§ n=0 λn+1 , the radius of convergence of it is given by r (T ) = lim supn T n 1/n . Therefore r (T ) = sup{|λ| : λ ∈ σ(T )}. It is called the spectral radius of T . The following formula is well known: Proposition 4.5.1 r (T ) = lim T n 1/n . n
Proof We shall use the formula ST ≤ ST at various places. Let s := inf n T n 1/n . Then for ε > 0 there exists k ∈ N such that s ≤ T k 1/k < s + ε/2. Let N ≈ ∞ be arbitrary. Then there exists a unique q ≤ k − 1 and P ≈ ∞ such that N = Pk + q. We obtain T N ≤ T k P · T q = (T k 1/k )k P · T q < (s + ε/2)k P · T q . Taking the Nth root we obtain 1
T N 1/N ≤ (s + ε/2) 1+q/k P · T q/N < s + ε, because q/N , q/k P 0. Since N ≈ ∞ was arbitrary we have lim supn T n 1/n < (s + ε) from which the assertion follows as ε > 0 was arbitrary.
4 Branch Spaces and Linear Operators
139
4.5.2 The Spectrum of an S–bounded Internal Operator Let E denote an internal Banach space, and let T be an internally bounded operator on E, i.e. T ∈ L(E). By transfer we may define all the notions above also for T ; ) in the case that T is we want to investigate the connection between σ(T ) and σ(T S-bounded (see Sect. 4.4.2). To this end we introduce the external sets ρb (T ) = {z ∈ ρ(T ) : R(z, T ) finite} and ρ∞ (T ) = {z ∈ ρ(T ) : R(z, T ) infinitely large}. By assumption the operator norm of T is finite. In the following we denote the standard part map on Fin∗ C by z → ◦ z. denote the nonstandard hull on E of the S–bounded internal Theorem 4.5.2 Let T operator T on E. Then the following assertions hold: ) = {◦ z : inf{(z − T )x : x = 1} 0}, and σa (T ) consists only of (i) σa (T eigenvalues. ) = {◦ z : z ∈ ρb (T )}. (ii) ρ(T ) ⊂ {◦ z : z ∈ σε (T )} ⊂ (iii) Fix 0 < ε < ε with both numbers standard. Then σε (T )}. σε ( T Proof (i) (I) Assume that inf{(z − T )x : x = 1} =: α 0. Then by transfer, for 0 < η 0 there exists an x of norm 1 satisfying (z − T )x ≤ α + η. x = ◦ z x. But then T (II) Assume now that α − T )x : x = 1} 0.
:= inf{(z x > ◦ α/2 for all x with x = 1, which implies by Then ◦ z − T ). definition that ◦ z ∈ / σa (T (ii) This follows from Lemma 4.2.28. ) by Lemma 4.2.28, (iii) (I) Let z ∈ σε (T ) be arbitrary. If z ∈ σ(T ) then ◦ z ∈ σ(T ). Therefore, assume z ∈ ρ(T ). Then (z − T )−1 ≥ 1 hence ◦ z ∈ σε (T ε )−1 ≥ 1 , since ε is standard, so {◦ z : and Lemma 4.2.28 gives (◦ z − T ε ). z ∈ σε (T )| ⊂ σε (T / σε (T ), (II) Assume that z is standard and z ∈ / {◦ v : v ∈ σε (T )}. Then z ∈ 1 1 −1 ) ≤ < . Since ε is standard, Lemma 4.2.28 yields hence (z − T ε ε the assertion. ) but equality does not hold in Remark 4.5.3 Obviously {◦ z : z ∈ σa (T )} ⊂ σa (T general. For example, let N ∈ ∗ N\N be arbitrary and consider the internal operator T given on C N by k≥2 e T (ek ) = k−1 0 k=1 ((en ) denotes the canonical basis). If one takes the usual scalar product norm on C N then T is a partial isometry, in particular bounded by 1. On the other hand T ) = {z ∈ C : |z| ≤ 1} since T is internally nilpotent hence σ(T ) = {0}. But σa (T
N induces the shift on the invariant subspace of the Hilbert space C spanned by the vectors { ek : k = r [N /2], r ∈ N}, where [N /2] is the greatest integer less than N /2.
140
M.P.H. Wolff
. In Corollary 4.5.4 (i) If z ∈ σ(T ) and |z| = r (T ) then ◦ z is an eigenvalue of T ) ≥◦ r (T ). particular r (T (ii) Let T be a standard bounded operator on the standard Banach space E. Then T ); (a) σ(T ) = σ(∗ (b) σa (T ) = σ p (∗ T ); (c) σε (T ) = σε (∗ T ). Proof (i) If z ∈ σ(T ) and |z| = r (T ), then R(v, T ) is unbounded near z (i.e. for |v| > r (T ) and v z) since otherwise z would not be a singularity of R(·, T ). So there exists a v z with v ∈ ρ∞ (T ), and the assertion follows. Problem 4.5.5 Prove assertion (ii). Hint: Use the foregoing theorem as well as Corollary 4.2.26. ) >◦ r (T ) may happen is shown by the operator constructed in Remark That r (T 4.5.3. Let T be a bounded linear internal operator on the internal Banach space E. A point z ∈ ∗ C is called an S–Riesz point if it is a Riesz point with residue of standard finite rank. As before by B(z, r ) we denote the set B(z, r ) = {v ∈ C : |v − z| < r }. We have the following theorem: Theorem 4.5.6 Let T be an S–bounded operator on the internal Banach space E. with residue of rank r . Then there exists Moreover, let z ∈ C be a Riesz point of T ∗ a standard δ such that the set σ(T ) ∩ B(z, δ) is not empty and consists of at most r S–Riesz points z 1 , . . . , z k with z j z and kj=1 rank(z j ) = r , where rank(z j ) denotes the rank of the residue of z j . )\{z}}/2 . Set η = δ/2. Consider the Proof (I) Let δ = inf{|z − v| : v ∈ σ(T )−1 : v ∈ K } annulus K = {v ∈ C : η ≤ |v − z| ≤ δ}. If a = sup{(v − T ∗ and M = 2a then K ⊂ ρ1/M (T ). To see this, assume the contrary. Then there ), a contradiction to the choice exists a v ∈ ∗ K ∩ σ1/M (T ). Hence ◦ v ∈ σ1/M (T of M. 1 R(v, T )dv (II) By the Transfer Principle the spectral projection q Q = 2πi exists and Q < δM is finite. )dv = Res(R(z, T )). = 1 R(v, T Claim: Q 2πi
|v−z|=δ
|v−z|=δ
) = R(v, Proof of the claim: By Lemma 4.2.28 R(v, T T ) for all v ∈ K . ) the resolvent equation (see Eq. 4.5) yields Moreover, since K ⊂ ρ1/M (T R(v, T ) − R(w, T ) ≤ |v − w|M 2 ; in particular R(., T ) is uniformly S– continuous on ∗ K . Hence, the Riemann sums Rm =
m−1 1 δ R(z + δ exp(2πik/m), T ) exp(2πik/m) 2π i m k=0
4 Branch Spaces and Linear Operators
141
m → satisfy Rm Q for all infinitely large m. On the other hand R 1 )dv. This proves the claim. R(v, T 2πi |v−z|=δ
E) = r < ∞. But Proposition 4.2.10 then implies dim Q(E) = r , (III) Now dim Q( and the assertion follows by the Transfer Principle applied to T | Q(E) .
4.5.3 The Spectrum of Compact Operators and the Essential Spectrum The spectral theory of compact operators is completely described in the following theorem. It is classical material. Theorem 4.5.7 Let T be a standard compact linear operator on the Banach space E. Then its spectrum σ(T ) is at most countable and each z = 0 in σ(T ) is isolated and an eigenvalue with finite dimensional eigenspace. Proof By Corollary 4.4.8 for all λ = 0 λI − T is a Fredholm operator and the index ind(λI − T ) vanishes, since ind(λ(I ) = 0. Thus if 0 = λ ∈ σ(T ) then λ is an eigenvalue and the corresponding eigenspace E λ is finite dimensional. Now let λ = 0 be an eigenvalue of T . Assume that λ is not isolated and let (λn )n be a sequence in σ(T ) converging to λ where λn = λm for n = m . Without loss of generality assume inf(λn ) =: η > 0. Each λn is an eigenvalue. Let xn be a normalized eigenvector corresponding to λn . Then {xn : n ∈ N} is linear independent. Let Mn be the linear hull of {x1 , . . . , xn }. Then obviously T (Mn ) ⊂ Mn . Moreover for y ∈ Mn+1 \Mn T y − λn+1 y ∈ Mn holds. For y = βxn+1 + u with u ∈ Mn , hence T y = λn+1 βxn+1 + T u where T u ∈ Mn . Set y1 = x1 . By Corollary 4.2.9 to every n ≥ 2 there exists yn ∈ Mn of norm 1 satisfying d(yn , Mn−1 ) > 1/2. Let n, p ∈ N be arbitrary. Then T yn+ p − T yn = T yn+ p − λn+ p yn+ p + λn+ p yn+ p − T yn = λn+ p yn+ p − v, where v ∈ Mn+ p−1 . Hence T yn+ p − T yn ≥ λn+ p d(yn+ p , Mn+ p−1 ≥ η/2. By Lemma 4.2.16 T y N is a remote point for every N ≈ ∞ . This contradicts Proposition 4.4.1, since T is compact.
Definition 4.5.8 Let T be a bounded linear operator on the Banach space E. Then the essential spectrum σess (T ) is the set of λ ∈ C such that λI − T is not a Fredholm operator.
142
M.P.H. Wolff
In order to avoid trivial cases let E be infinite dimensional. If T is compact then σess (T ) = {0} by Theorem 4.5.7. Moreover λ ∈ σess (T ) iff λ ∈ σ(T˜ ). Here T˜ is the equivalence class of T in the Calkin algebra. Theorem 4.4.6 now gives the following result: Proposition 4.5.9 Let T be a bounded linear operator on the infinite dimensional Banach space E. Then σess (T ) = ∅ and ress (T ) := sup{|λ| : λ ∈ σess (T )} ≤ r (T ). ˜ and Problem 4.5.10 (a) Prove the proposition. Hint: Consider the operator T˜ on E, use Theorem 4.4.6 as well as T ≥ T˜ and the formula for the spectral radius, see Proposition 4.5.1. (b) Let T be a bounded linear operator on E, such that T n is compact for some n ∈ N. Show that Theorem 4.5.7 holds also in this case. Hint: Use Proposition 4.5.1 for T˜ .
4.5.4 Closed Operators and Pseudoresolvents The nonstandard hull of a closed operator Let (A, D(A)) be a closed densely defined operator on the Banach space E. More precisely D(A) is a dense subspace and the graph G(A) = {(x, Ax) : x ∈ D(A)} is closed in E × E. Its resolvent set ρ(A) is defined as ρ(A) = {λ ∈ C : (λ − A) is bijective onto E}. If λ ∈ ρ(A), then (λ − A)−1 =: R(λ, A) is continuous by the closed graph theorem. Now, ρ(A) is open (but it might be empty). As in the case of a bounded operator the resolvent R(., A) : ρ(A) λ → R(λ, A) is holomorphic and satisfies the resolvent equation (see Eq. (4.5)). The complement of ρ(A) is the spectrum σ(A). The point spectrum σ p (A), the approximate point spectrum σa (A), and the ε–pseudospectrum σε (A) are defined as previously (see p. xxx). because In general it is quite difficult to define the nonstandard hull of A in E is no longer the graph of a mapping in E. To solve the problem we recapitulate G(A) the notion of a pseudoresolvent introduced by E. Hille (see [81], VIII.4): Let D ⊂ C be not empty and R : D → L(E) be a function satisfying the resolvent equation R(u) − R(v) = (v − u)R(u)R(v). Then all operators R(u) have a common null space denoted by N (R) and a common range, denoted by R(E). Moreover R(u)R(v) = R(v)R(u) holds for all u, v, ∈ D. Theorem 4.5.11 (standard, see [81], p. 21) (i) Let R : D → L(E) be a pseudoresolvent and assume that there exists a sequence (λn ) ⊂ D with lim |λn | = ∞ such that (λn R(λn )) is bounded. Then R(E) = {x ∈ E : lim λn R(λn )x = x} and N (R) ∩ R(E) = {0}.
4 Branch Spaces and Linear Operators
143
(ii) A pseudoresolvent is the resolvent of a closed densely defined linear operator A iff N (R) = {0}. Then R(E) is the domain of definition of A and A = u I − R(u)−1 . In the following let us assume that (A, D(A)) is closed, densely defined and that ρ(A) = ∅. Moreover let us assume that there is a sequence (λn ) ⊂ ρ(A) such that lim |λn | = ∞ and (λn R(λn , A)) is bounded. These hypotheses are satisfied for A selfadjoint in a Hilbert space or for A the generator of a strongly continuous semigroup, for in the latter case u R(u, A) converges strongly to the identity for u → ∞ (for details see the next section). Now by the Transfer Principle ρ(A) n ))n is A) =: R(λ) for which (λn R(λ λ → R(λ, defines a pseudoresolvent on E bounded. R = R( E). The space E R is invariant under R(u) for Therefore, we define E is injective with dense range D( A) := R(u)( E ). We now set all u and R(u)| R R E −1 A = u I − ( R(u)| ER ) , and call this the nonstandard hull of the closed operator (A, D(A)). R = E and Remark 4.5.12 If A has compact resolvent then by Proposition 4.4.1, E A = A.
General spectral theory of pseudoresolvents In order to avoid the above special assumptions on the resolvent of A and still retain the power of nonstandard hulls, the singular set of a pseudoresolvent R was introduced in [52], following an idea of E. Hille [26]. This singular set coincides with the spectrum of the closed operator A if R(λ) = (λ − A)−1 . It enables one to avoid the construction of the nonstandard hull of a closed operator. Let R : D → L(E) be a pseudoresolvent and fix λ0 ∈ D. Then set Dmax = {λ ∈ C : λ = λ0 or (λ0 − λ)−1 ∈ ρ(R(λ0 ))}, and define Rmax on Dmax by Rmax (λ) = R(λ0 )(I − (λ0 − λ)R(λ0 ))−1 . The singular set sing(R) is defined to be the complement of Dmax in C. The connection with the spectrum of bounded operators is given by the two formulas σ(R(λ))\{0} = {(λ − μ)−1 : μ ∈ sing(R)}, sing(R) = {λ − 1/μ : μ ∈ σ(R(λ))\{0}}.
(4.6) (4.7)
144
M.P.H. Wolff
In complete analogy to the spectral theory of bounded operators we introduce the point spectrum as well as the approximate point spectrum of the pseudoresolvent as follows: sing p (R) = {α ∈ C : ∃x[x = 1 and (λ − α)R(λ)x = x]}, singa (R) = {α ∈ C : inf{((λ − α)R(λ) − I )x : x = 1} = 0}.
(4.8) (4.9)
The resolvent equation (4.5) shows that this definition is independent of the particular λ. Now fix some λ ∈ Dmax . An easy calculation shows that sing p (R) = {λ − 1/μ : μ ∈ σ p (R(λ))\{0}}, singa (R) = {λ − 1/μ : μ ∈ σa (R(λ))\{0}}.
(4.10)
Moreover, if R(λ) = (λ − A)−1 for some closed operator A then sing p (R) = σ p (A) and singa (R) = σa (A). The nonstandard hull of a (standard) pseudoresolvent is obviously a pseudoresolvent. More precisely the following proposition holds: Proposition 4.5.13 ([52], Proposition 2.1) Let R : D → L(E) be a pseudoresolvent. The following assertions hold: is a pseudo-resolvent with R(λ) = R(λ). : D → L( E), λ → R(λ) R and sing(R) = sing( R). Dmax (R) = Dmax ( R) and then the orders of the poles are λ0 ∈ C is a pole of R iff it is a pole of R equal. In particular sing(R) ∩ ∂ Dmax ⊂ sing p ( R). (iv) singa (R) = sing p ( R).
(i) (ii) (iii)
Proof (i) follows by a careful application of the Transfer Principle. (ii) follows from Eq. 4.3 by an application of the Transfer Principle to the fixed operator R(λ). For (iii) and (iv) use Eq. (4.10) and apply Corollary 4.5.4 (ii) to the fixed operator R(λ). As a corollary we obtain Corollary 4.5.14 Let A be a closed densely defined operator on E. Let there exist an unbounded sequence (λn ) in ρ(A) such that (λn R(λn , A))n is bounded. Then the following assertions hold: (i) σ(A) = σ( A). (ii) σa (A) = σ p ( A).
4.5.5 Notes The spectral theory of internal S–bounded operators as presented here is due to the author (cf. also [51, 77]). Corollary 4.5.4 is partly new. Part (ii) (a) and (b) of it
4 Branch Spaces and Linear Operators
145
however are very well–known and trace back (within the frame work of Fréchet– products) to Quigley (see [53]). These facts were rediscovered by Berberian [4], Lotz (cf. [57] V.1), and others and have been used extensively since then. Theorem 4.5.6 is new. The corresponding result within the frame work of ultraproducts may be found in [51]. Section 4.5.3 is well–known. The proofs seem to be new, though they are based on the standard ones (cf. [81], for a nonstandard treatment see also [54]). Section 4.5.4 is new. The corresponding treatment of closed operators within the theory of ultraproducts is due to Krupa [33]. The use of pseudo-resolvents in the spectral theory of closed operators goes back to Hille (see [26]). Its present form is taken from [52] where it is developed within the theory of ultraproducts.
4.6 Selected Applications 4.6.1 Strongly Continuous Semigroups A typical example of the preceding notions is the generator (A, D(A)) of a bounded strongly continuous semigroup T = (Tt )t≥0 of operators Tt on E. Let us recall this notion in a little more detail: T is called a strongly continuous semigroup if Ts+t = Ts Tt for all s, t ≥ 0 and if also for all x ∈ E lim Tt x = x holds. In this t→0
case, its generator (A, D(A)) is defined by x ∈ D(A) iff Ax := lim 1t (Tt x − x) t→0
exists. The semigroup property implies that t → Tt x is norm continuous for every x ∈ E. Moreover x ∈ D(A) ⇒ Tt x ∈ D(A) and (Tt x) = ATt x = Tt Ax. (For details on strongly continuous semigroups see e.g. [48].) In what follows the hypothesis that T be bounded is not severely restrictive since in the general case there exists an M > 0 such that t → exp(−Mt)Tt is strongly continuous and bounded as well. ∞ Since T is bounded by R(z)(x) := e−t z Tt x dt, there is a bounded linear oper0
ator defined for z ∈ C with Re(z) > 0. This turns out to be a pseudoresolvent with lim u R(u)x = x u→∞
(as is easily seen, cf. part (II) of the proof of the next theorem). Therefore, we can apply Theorem 4.5.11. Since the kernel N (R) = {0}, by the formula above, R(·) is the resolvent of the closed densely defined operator B = u − (R(u))−1 (which is independent of u > 0). The easily proved formula Tt R(u)x = e R(u)x − e ut
ut 0
t
e−us Ts xds
(4.11)
146
M.P.H. Wolff
shows first of all that the map t → Tt R(u) is continuous with respect to the operator norm, and secondly that (Tt R(u)x) t=0 = u R(u)x − x = A R(u)x holds, whence B = A. It follows that (A, D(A)) satisfies our assumptions that were made in the previous section in order to construct A. can If (A, D(A)) is the generator of a bounded strongly continuous semigroup, A be characterized in a manner different than that given in the previous section. We adhere to the notions and notations given there. Theorem 4.6.1 (cf. [73]) Let (A, D(A)) be the generator of a bounded strongly continuous semigroup T = (Tt )t≥0 . Then the following assertions hold: t | R = { x : t → ∗ Tt x is S-continuous}. Moreover, the restriction t → T (i) E ER is a strongly continuous semigroup with generator A. = { R : ∃x ∈ x [x ∈ ∗ D(A), ∗ Ax is finite, and t → ∗ Tt ∗ Ax is (ii) D( A) x ∈ E S-continuous]}. . Proof (i) Let H = {x ∈ Fin(E) : t → ∗ Tt x is S-continuous} and set G = H Denote the bound of (Tt ) by M. Let u > 0 be given. (I) Since t → Tt R(u, A) is continuous with respect to the operator norm, so is t → ∗ Tt ∗ R(u, A). So t → ∗ Tt ∗ R(u, A)y is S–continuous (cf. Lemma ⊂ G, which in turn implies 4.4.2) for every y ∈ Fin(∗ E), hence R(u, A)( E) that E R ⊂ G. (II) Conversely, let t → ∗ Tt x be S–continuous. For each standard ε > 0 there exists a standard δ such that ∗ Tt x − x < ε for all t ∈ ∗ R with 0 ≤ t < δ. ∞ Because 0 u exp(−ut)dt = 1, we have by the Transfer Principle u ∗ R(u, A)x − x = u
∞
exp(−ut)(∗ Tt x − x)dt
0 δ
exp(−ut)∗ Tt x − x ∞ u exp(−ut)dt +(M + 1)
≤u
0
δ
≤ ε + (M + 1) exp(−uδ)). R . Thus, This estimate shows that limu→∞ u R(u, A)xˆ = x, ˆ whence xˆ ∈ E R holds. That t → T t | is a strongly continuous semigroup is G ⊂ E ER obvious. The rest of (i) follows from the formula 4.11 above applied to this semigroup. = R(u)( R ) for some u > 0. By (i) ⇒ x = (ii) By definition D( A) E x ∈ D( A) ∗ R(u, A)y for some y ∈ H . But then ∗ Ax = ∗ Ax − ux + ux = ux − y is finite and in H .
4 Branch Spaces and Linear Operators
147
Conversely, assume that x ∈ ∗ D(A), and that x as well as ∗ Ax = y are in H . Then a short calculation shows that x = ∗ R(u, A)(ux − y). Since ux − y ∈ H , = E R by (i). we obtain xˆ = R(u, A)(u xˆ − yˆ ), where (u xˆ − yˆ ) ∈ H The space on which (Tˆt ) is strongly continuous might be strictly larger than Eˆ R as the following example shows. Example 4.6.2 (cf. [73]) Let E be the space 2 (Z), and consider the group action Tt ( f )(k) = exp(itk) f (k) for t ∈ R. It is easily seen that R(z, A) is compact, whence R = E. On the other hand for every ε > 0 and {t1 , . . . tn } there exists a we have E k ∈ Z such that sup{| exp(it j k) − 1| : j ≤ n} < ε (see [25], Theorem 26.14). Take a hyperfinite set M ⊂ ∗ R containing all of R and choose ε 0 and k ∈ ∗ Z such that sup{| exp(itk) − 1| : t ∈ M} < ε. Set f = ek = (δk,l )l∈∗ Z . Then Tˆt ( fˆ) = fˆ holds, but t → ∗ Tt ( f ) is not S–continuous, since for t = π/k 0 ∗ Tt ( f ) = − f . Corollary 4.6.3 Let T = (Tt )t≥0 be a bounded strongly continuous semigroup on the (standard) Banach space E. The following assertions are equivalent: (i) T is uniformly continuous, i.e. the map t → Tt is continuous from R+ into L(E) , equipped with the operator norm. (ii) For all x ∈ Fin(∗ E) the map ∗ R+ t → ∗ Tt (x) is S–continuous. (iii) The generator A is bounded. Proof (i) ⇒ (ii). Obvious. R = E, so R(λ, (ii) ⇒ (iii): By Theorem 4.6.1 E A) is a topological isomorphism. −1 ˆ But then A = λI − R(λ, A) is bounded. (iii) ⇒ (i). Since A is bounded and closed, it is everywhere defined. This implies that R(λ, A) is bijective, and since t → Tt R(λ, A) is continuous with respect to the operator norm, the assertion follows.
4.6.2 Approximation of Operators and of Their Spectra General Theory Another field for which nonstandard functional analysis works well is approximation theory. We give some examples concerning the approximation of spectra (for another application in this field see [51]). To this end we recall the definition of the distance from the bounded set A to the set B in C given by d(A, B) = supa∈A (inf{|b − a| : b ∈ B}). In the following assume that a sequence (Sn )n∈N approximates in a vague sense the not necessarily continuous but at least densely defined and closed operator A. We shall look for the possible convergence of parts of the spectrum of Sn to some part of the spectrum of A. If Sn is defined on the Banach space E and T is a bounded operator such that lim T − Sn = 0 then it is not hard to prove that lim d(σ(Sn ), σ(T )) = 0
148
M.P.H. Wolff
holds. But we point out that lim sup d(σ(T ), σ(Sn )) = 0 may happen (see [32], p. 210). A slightly weaker form of the assertion turns out to hold in a much more general setting, as we now show. First of all let us recall the notion of discrete convergence from approximation theory (cf. [47]): Let E and Fn be Banach spaces. Let E 1 be a dense subspace of E and for each n let Pn : E 1 → Fn be an arbitrary linear operator. The quadruple (E, E 1 , (Fn ), (Pn )) is called an approximation scheme if lim Pn un = u holds for all u ∈ E 1 . Notice that in contrast to [47] we do not require the Pn to be continuous. The mappings Pn are so to say asymptotically isometric and this is enough for applications. A sequence (u n )n with u n ∈ Fn converges discretely to u ∈ E 1 if lim u n − Pn un = 0. In that case we write u = d − limn u n . Let E 0 ⊂ E 1 be another dense subspace of E and let A : E 0 → E 1 be a linear operator. A sequence (Sn )n of linear operators Sn on Fn approximates A discretely on E 0 if loosely spoken d − limn Sn Pn u“ = Au holds for all u ∈ E 0 . More precisely this means lim Sn Pn u − Pn Aun = 0 for all u ∈ E 0 .
n→∞
(4.12)
We denote this approximation by A = d − lim Sn . Strong convergence of a sequence of bounded operators is a special case of this notion. In fact set E = E 1 = Fn , and Pn = I for all n. In order to clear up these notions of discrete approximation, we prove the following lemma: Lemma 4.6.4 Let (E, E 1 , (Fn ), (Pn )) be a fixed approximation scheme. Then the following assertions hold: (i) For N ∈ ∗ N\N the operator P N | E 1 =: P˜N is well–defined and embeds E 1 isometrically into FN . Its unique extension to an isometry from E into F N will ˜ also be denoted by PN . (ii) Let (A, D(A)) be a densely defined operator in E and let D(A) ⊂ E 1 satisfy A(D(A)) ⊂ E 1 . Assume that (Sn )n approximates A| D(A) discretely and moreover assume that (Sn Pn x)n is bounded for every x ∈ D(A). Let N be as above. Then P˜N A| D(A) = S N P˜N | D(A) . Proof (i) If u is in E 1 then PN u N u by hypothesis. Hence (i) follows. (ii) Since (Sn )n is bounded S N is S–continuous. The remainder follows from Eq. 4.12. Example (1) Let Fn = Cn with the scalar product norm (x1 , . . . , xn )2n = n 4.6.5 2 2 1 |x j | /n. Let E = L ([0, 1]), E 1 = { f ∈ E : f continuous, f (0) = f (1)}, and E 0 = { f ∈ E 1 : f ∈ E 1 }. Set A f = f and Pn : E 1 → Fn , f →
k f . n 0≤k≤n−1
4 Branch Spaces and Linear Operators
149
Define Sn = n(Tn − In ) where In is the identity on Fn and Tn is the shift given by xk+1 1 ≤ k ≤ n − 1 Tn (x)k = . Then A = d − lim Sn . Notice that (Sn )n k=n x1 is not bounded, as is easily seen. (2) Let E = l 2 (N) be the usual Hilbert space and let T be the shift given by (T f )(k) = f (k + 1). Then σ(T ) = σa (T ) = {z ∈ C : |z| ≤ 1}. Set Fn = E, Pn = I and f (k + 1) k ≤ n − 1 (Sn f )(k) = 0 otherwise. Then (Sn ) converges strongly to T . Notice that σ(Sn ) = {0} , so the spectra do not converge in any reasonable sense. (3) Let S be the adjoint T ∗ of T . Then σa (S) = T = {z ∈ C : |z| = 1}. Set Fn = Cn , equipped with the usual scalar product norm, take Pn f = ( f (1), . . . , f (n)) and Sn (x1 , . . . , xn ) = (xn , x1 , . . . , xn−1 ). Obviously (Sn ) converges discretely to S. In this case not even the ε–pseudospectrum of Sn behaves well. In fact, we have lim supn d(σ(S), σε (Sn )) = 1 − ε. In the following, let (A, D(A)) be a fixed closed densely defined operator on the Banach space E. A subspace E 0 ⊂ D(A) is a core of A if the closure of A| E 0 equals A. If E 0 is a core of A and λ ∈ σa (A) then there exists a sequence (xn )n of normalized elements in E 0 such that limn (λ − A)xn = 0 holds. Theorem 4.6.6 ([78]) Let (E, E 1 , (Fn ), (Pn )) be a fixed approximation scheme. Let (Sn ) be a sequence of bounded operators on Fn which discretely approximates the operator A on the core E 0 ⊂ E 1 of A. Then for every ε > 0 we have σa (A) ⊂
σε (Sk )
n∈N k≥n
Proof Let ε > 0 (standard) be given and let λ ∈ σa (A) be arbitrary. Because E 0 is a core of A there exists x ∈ E 0 of norm 1 such that (λ − A)x < ε/2. By hypothesis for all N ∞ and for all y ∈ E 1 we have PN y y, which implies in particular PN x 1 as well as PN (λ − A)x (λ − A)x < ε/2. Moreover, PN (λ − A)x (λ − S N )PN x by hypothesis, whence (λ − S N )PN x < ε/2, which in turn implies that λ ∈ σε (S N ). Let A = {n ∈ N : ∀k ≥ n[(λ − Sk )Pk x < ε/2]}. By what is proved so far ∗ A contains ∗ N\N. The assertion now follows from the Spillover Principle (Theorem 2.8.12 (ii)) and the Downward Transfer Principle. The next corollary holds in particular if all Fn are Hilbert spaces and if moreover all operators Sn are normal. Corollary 4.6.7 Assume that in addition to the hypotheses of the theorem, we have R(λ, Sn ) ≤ 1/d(λ, σ(Sn )) for each n ∈ N and all λ ∈ ρ(Sn ). Then for every compact subset K ⊂ C
150
M.P.H. Wolff
lim d(σa (A) ∩ K , σ(Sn )) = 0.
n→∞
Proof Let λ ∈ ∗ (σa (A) ∩ K ) be arbitrary and let ε > 0 be a standard real number. Because K is compact the standard part ◦ λ =: z exists and is in σa (A) since this set is closed. By the theorem there exists n(ε, z) such that R(z, Sn ) ≥ 2/ε holds for all n ≥ n(ε, z). By hypothesis this implies that d(z, σ(Sn )) ≤ ε/2 for all these n. The Transfer Principle implies that d(λ, σ(S N )) d(z, σ(S N )) < ε for all N ∞, and the assertion follows. The proofs of the next two corollaries are obvious. Corollary 4.6.8 If all Fn are Hilbert spaces and all Sn are unitary operators, then σa (A) ⊂ {z ∈ C : |z| = 1}. Corollary 4.6.9 If E and Fn are Hilbert spaces and A as well as all Sn are normal, then limn→∞ d(σ(A) ∩ K , σ(Sn )) = 0 for every compact subset K of C. : Consider the first Example in 4.6.5. Sn is normal and σ(Sn ) = { exp(2iπk/n)−1 1/n k = 1, . . . , n}. It follows that {2iπk : k ∈ Z} = σ(A) (a fact to be proved much more easily directly).
Compact Operators In case of approximation of compact operators a much better estimate for the spectrum is possible. In this section we follow [79]. Let (E, E 1 , (Fn ), (Pn )) be a fixed discrete approximation scheme. Definition 4.6.10 A sequence (xn ) ∈ Fn is called discretely compact (dcompact for short) if for every ε > 0 there exists a finite set Y (ε) ⊂ E 1 depending on ε such that lim sup d(xn , Pn (Y (ε))) < ε. n
A subset X ⊂ Fn is called uniformly d-compact if for every ε > 0 there exists a finite set Y (ε) ⊂ E 1 such that lim sup d(xn , Pn (Y (ε))) < ε n
holds for all (xn ) ∈ X . Remark 4.6.11 There are various similar notions in the literature, see e.g. [2, 16], which turn out to be less general than ours. For a discussion see [79], pp. 227–228. The characterization of d-compactness by nonstandard analysis reads as follows:
4 Branch Spaces and Linear Operators
151
Proposition 4.6.12 A sequence (xn )n ∈ Fn is discretely compact if and only if to every N ≈ ∞ there exists x ∈ E such that P˜N x = x N. Proof Let x be discretely compact and let N ≈ ∞. To r ∈ N there exist a finite set Yr with lim supn d(xn , Pn (Yr )) < 2−r , in particular d(x N , PN (∗ Yr )) < 2−r . Choose yr ∈ Yr satisfying d(x N , PN yr ) < 2−r . Since PN is almost an isometry the sequence (y)r is a Cauchy sequence in E 1 hence convergent to some x ∈ E. It follows that y N = P˜N x. Conversely assume that (xn )n is not discretely compact. Then there exists ε > 0 and to every finite Y ⊂ E 1 as well as to every m ∈ N there exists n ≥ m such that d(xn , Pn (Y )) > ε. Now take a hyperfinite Y ⊂ ∗ E 1 with E 1 ⊂ Y (externally). Let M ≈ ∞. Then there exists N ≥ M with d(x N , PN (Y )) > ε. In particular for y ∈ E 1 it follows x N − y > ε, so there is no standard x with P˜N x = x N. The characterization of uniform compactness is a little more cumbersome and will not be needed in the sequel. Let us consider again Example 1 in 4.6.5, but now choose ⎛
1 1⎜ ⎜1 An = ⎜ . n ⎝ .. 1
⎞ 0 0 ··· 0 1 0 ··· 0⎟ ⎟ ⎟. .. ⎠ . 1 1 ··· 1
x The sequence (An Pn f )n converges discretely to the Volterra operator f → (x → 0 f (u)du). The next proposition shows that the set {(An Pn f )n : f = 1} is uniformly d-compact. Proposition 4.6.13 Let the linear operator A : E 1 → E 1 be approximated by the sequence (An ) of operators An : Fn → Fn . Then A is compact if and only if the set X = {(An Pn x)n : x = 1} is uniformly d-compact. Proof Let A be compact, and let ε > 0 be given. Then there exists a finite set Y with d(A(B0, 1), Y ) < ε/2, where B(0, 1) denotes the unit ball in E 1 . Let N ≈ ∞ be arbitrary. Then for all (standard) x of norm 1 we have PN Ax A N PN x as well as d(PN Ax, PN Y ) < ε/2, hence d(A N PN x, PN (Y )) < ε, which implies that X is uniformly d-compact. Conversely let X be uniformly d-compact. Then to ε > 0 there exists a finite set Y ⊂ E 1 with lim supn d(An Pn x, Pn (Y )) < ε/2 for all x ∈ E 1 of norm 1. Let N ≈ ∞ be arbitrary. Then for each x of norm 1 we have d(A N PN x, PN (Y )) < ε/2 as well as PN Ax A N PN x. Since PN is almost an isometry we obtain d(Ax, Y ) < ε for all x of norm 1, and the assertion follows. Now we describe the approximation of the spectrum of A, whenever A is compact. Let the compact operator A be discretely approximated by (An ) We define D = {z ∈ C : ∃(xn )n , xn n = 1 for all n, (xn )n d-compact and lim inf (z − An )xn n = 0}. n
152
M.P.H. Wolff
Theorem 4.6.14 Let (An )n be a uniformly bounded sequence of operators An on Fn that approximates discretely the compact operator A. Then D ⊂ σ(A) ⊂ D ∪ {0}. Proof To z ∈ D there exists a normalized d-compact sequence (xn )n satisfying lim inf n (z − An )xn n = 0. Therefor there exists N ≈ ∞ with A N x N zx N .Since (xn )n is d-compact there exists a (standard) y ∈ E with x N = P˜N y. So we obtain A N P˜N y =
A N x P˜N Ay =
N = zx N = z P˜N y. It follows z ∈ σ(A), since P˜N is an isometry. Conversely let 0 = z ∈ σ(A) be arbitrary and let y be a normalized eigenvector. Then the sequence (xn )n given by xn = Pn y = 1z Pn Ay is d-compact by Proposition 4.6.13. Moreover for N ≈ ∞ we get A N x N = A N PN y PN Ay = z PN y = zx N , which implies even limn (z − An )xn n = 0. More results are gained by refining the notion of discrete convergence, see [78].
4.6.3 Super Properties Roughly spoken a property concerning subsets of a given Banach space or concerning operators is called a super property if the corresponding object in the nonstandard hull has this property. We know already the notion of superreflexivity. Moreover compactness of an operator is also a super property (see Proposition 4.4.1). We turn now towards two other notions which are super properties. Recall that an operator T ∈ L(E) is called uniformly stable if {T n : n ∈ N } is relatively compact with respect to the operator norm. It is called stable if the orbits o(T, x) := {T n x : n ∈ N } are relatively norm compact for every x ∈ E. Definition 4.6.15 Let E be a Banach space and let T be an operator whose powers are uniformly bounded (supn T n < ∞). (i) T is called superstable if Tˆ is stable on E. (ii) T is called superergodic if Tˆ is mean ergodic. Recall first of all that in Banach spaces precompactness and relative compactness are equivalent notions, and furthermore that a sequence (u n )n in a Banach space F, say, is precompact if ∀ε > 0∃L ∈ N∀n ∈ N [d(u n , {u 1 , . . . , u L }) < ε] .
(4.13)
4 Branch Spaces and Linear Operators
153
This formula is better known than the following equivalent one: $ % ∀ε > 0∀ϕ ∈ NN ∃L ∈ N d(u ϕ(L) , {u 1 , . . . , u L }) < ε .
(4.14)
Let B E be the closed unit ball of the Banach space E. Let ε > 0 be arbitrary and let ϕ ∈ NN be a given sequence. Then for m, k ∈ N and k ≤ m we define Aε,ϕ (m, k) = {x ∈ B E : T ϕ(m) x − T k x < ε}. Set Aε,ϕ (m) =
k
Aε,ϕ (m, k) = {x ∈ B E : d(T ϕ(m) x, {T x, T 2 x, . . . , T m x}) < ε}.
1
With the aid of the two equivalent formulas 4.13 and 4.14 it is not too hard to prove the following two statements: (i) T is uniformly stable iff for all ε > 0 and all sequences ϕ there exists m ∈ N and k ≤ m such that B E = Aε,ϕ (m, k). (ii) T is stable iff for all ε > 0 and all sequences ϕ B E = m∈N Aε,ϕ (m). With this in mind we give now a characterization of superstable operators, which is independent of the nonstandard hull. Theorem 4.6.16 The following assertions are equivalent: (i) T is superstable. (ii) Tˆ is superstable. (iii) For all ε > 0 and all ϕ ∈ NN there exist an L ∈ N such that BE =
L
Aε,ϕ (m).
1
Remark 4.6.17 Condition (iii) and the discussions above show the position of the notion of super stability within the other notions of stability. Proof (i) → (iii): By definition Tˆ is stable. Using formula 4.14 we obtain & ' ˆ {Tˆ x, ˆ . . . , Tˆ m x}) ˆ <ε . ∀ε > 0∀ϕ ∈ NN ∀xˆ ∈ B Eˆ ∃m ∈ N d(Tˆ ϕ(m) x, We fix ε and ϕ. Then we can “lift” the remainder of the formula and get ∀x ∈ ∗ B(E)∃st m ∈ N
&
∗
' d(∗ T ϕ(m) x, {∗ T x, . . . , ∗ T m x}) < ε ,
where ∃st means “there exists a standard”. But this letter formula is equivalent to ∃st
fin
M ⊂ N∀x ∈ ∗ B(E)∃m ∈ M
&
∗
' d(∗ T ϕ(m) x, {∗ T x, . . . , ∗ T m x}) < ε ,
154
M.P.H. Wolff
(see Nelson’s algorithm [44]) where ∃st fin M means “there exists a standard finite set M”. Now by the transfer Principle this latter formula holds in our standard model (obviously without the exponent “standard”). Now set L = max(M). then the following formula holds: & ' ∃L ∈ N∀x ∈ ∗ B(E)∃m ≤ L d(T ϕ(m) x, {T x , . . . , T m x}) < ε , which is equivalent to (iii). Aη,ϕ (m) ⊂ (iii) → (i): Let ε, ϕ be given. Then (iii) holds also for η = ε/2. Moreover ∗ ˆ E ˆ ˆ Aε,ϕ (m), where the upper index means the set formed in E for T . The transfer principle yields L(η) L(η) ˆ E ∗ Aη,ϕ (m) ⊂ Aε,ϕ (m), B Eˆ = 1
1
which implies that Tˆ is stable by the paragraph preceding the theorem. So T is superstable. Eˆ (m) (see the proof of (i) → ˆ = 1L Aε,ϕ (i) → (ii): (i) implies (iii), which gives B( E) (iii). But this in turn yields (ii) because of (iii) → (i). The remainder is obvious. The importance of super stability is underlined by the following theorem: Theorem 4.6.18 ([49]) (i) If T is superstable then {z ∈ σ(T ) : |z| = 1} =: σ1 (T ) is at most countable. (ii) If σ1 (T ) is at most countable and E is superreflexive then T is superstable. For the proof we refer to [49]. In a similar manner we can characterize superergodicity (see [80]). First of all, since every power bounded operator T on a reflexive Banach space E is necessarily ergodic because the unit ball is weakly compact we obtain that every power bounded operator T on a superreflexive Banach space E is superergodic, because the nonstandard hull Eˆ of E is reflexive by Theorem 4.3.27. So the notion makes only sense in non superreflexive spaces. 1 n
Let T be a power bounded operator on the Banach space E. We set Mn (T ) = n−1 k T . Moreover for every ε > 0 and for every sequence ϕ ∈ N N set 0 Bε,ϕ (m) = {x ∈ B E : d(Mϕ(m) x, {M1 x, . . . Mm x}) < ε}.
Similarly to our proof of Theorem 4.6.18 we obtain the following proposition:
4 Branch Spaces and Linear Operators
155
Proposition 4.6.19 Let T be a power bounded operator on the Banach space E. The following assertions are equivalent: (i) (ii) (iii)
T is superergodic. ˆ Tˆ is superergodic on E. For every ε > 0 and ϕ ∈ NN there exists L ∈ N such that B E = 1L Bε,ϕ (m).
M. Yahdi [80] has shown by examples that the notion of superergodicity lies strictly between that one of ergodicity and uniform ergodicity. Finally let us point out that analogous results can be gained also for strongly continuous semigroups, see [49].
4.6.4 The Fixed Point Property Due to lack of space we can only give a brief glimpse into this field. Almost since the beginning of its development ultraproduct methods were used heavily (see [31, 39, 60]). To our knowledge the only paper where nonstandard analysis is used is that by A. Wi´snicki [71]. We give a short rapport of the paper [69] which gives an interesting insight into the theory. In the following let T be a self mapping on the the bounded closed convex subset C of the Banach space E. It is called nonexpansive if T (x) − T (y) ≤ 1 for all x, y ∈ C. It is called a contraction as usual if it is Lipschitz continuous with Lipschitz constant L(T ) < 1. The subset C is said to have the fixed point property if every nonexpansive map on it has a fixed point. A Banach space E has the fixed point property or FFP for short, if every closed bounded convex subset has this property. In [39] B. Maurey used the ultraproduct technique to prove the fixed point property for every reflexive subspace of L 1 ([0, 1]). We start with the following lemma: Lemma 4.6.20 Let C be a bounded closed convex subset of the Banach space E, and let T : C → C be nonexpansive. Then there exists a sequence (xn )n with lim n T (xn ) − xn = 0. Such a sequence is called an approximate fixed point sequence . Proof Fix a point x0 and for every n ∈ N consider the contraction Tn (x) = n1 x0 + (1 − n1 )T (x). Let xn be its unique fixed point. Then (xn )n is the desired sequence. . We need still another notion of the geometry of Banach spaces: a closed subset A is called metrically convex if to every two points x, y ∈ A there exists z ∈ A such that x − y = x − z + z − y.
156
M.P.H. Wolff
In the following we consider the nonstandard hull Cˆ ⊂ Eˆ as well as the nonstandard hull Tˆ of T . Obviously Cˆ is bounded, closed, and convex, if C possesses these properties. Moreover Tˆ is nonexpansive if T is so. Note that on account of the lemma above Tˆ has always fixed points. The next theorem is due to B. Maurey [39]. It is essential in this field: Theorem 4.6.21 (B. Maurey) The set Fi x(Tˆ ) of fixed points of Tˆ has the metric fixed point property. Proof Let a, ˆ bˆ be two different fixed points of Tˆ . Choose a ∈ a, ˆ b ∈ bˆ arbitrarily and set a − b = λ, as well as a − T (a) = ξ1 , b − T (b) = ξ2 . ξ3 := ξ1 + ξ2 is infinitesimal, hence by Robinson’s Sequential Lemma (Theorem 2.8.13), applied to the sequence (sn ) = (n 2 ξ3 )n there exists N ≈ ∞ such that N 2 ξ3 < 1. We set η = 1/N and D = {z ∈ ∗ C : a − z, b − z ≤ λ2 + η}. D is intern by Keisler’s Internal Definition Principle (Theorem 2.8.4) and it is internally closed. Claim: x0 := (a + b)/2 ∈ D, so D = ∅. Proof : a − x0 = 21 a − b = λ2 = b − x0 . Claim: The map S : D → ∗ C, given by S(z) = η2 (a + b) + (1 − η)T (z), maps D into itself. Proof : We have η a − S(z) = (1 − η)(a − T (a)) + (1 − η)(T (a) − T (z)) + (a − b). 2 Using T (a) − T (z) ≤ a − z ≤ λ/2 + η, since z ∈ D, we obtain η λ +η + λ 2 2 λ = (1 − η)ξ1 + (1 − η)η + . 2
a − S(z) ≤ (1 − η)ξ1 + (1 − η)
But ξ1 < 1/N 2 = η 2 hence (1 − η)(ξ1 + η) < η(1 − η)(1 + η) = η(1 − η 2 ) which implies a − S(z) ≤ λ/2 + η. Similarly one proves the other inequality, and the claim follows. Applying the Transfer Principle to the contraction S we get a unique fixed point x of S. Then x ∈ D and xˆ is a fixed point of Tˆ satisfying ◦
ˆ ≤ aˆ − x ˆ ≤ ◦ λ. λ = aˆ − b ˆ + xˆ − b ≤◦ λ/2
≤◦ λ/2
Definition 4.6.22 A Banach space E has property (Sm ) if for every metrically convex set A of the unit sphere S(E) with diam(A) ≤ 1 there exists ξ ∈ E such that ξ is strictly positive on A.
4 Branch Spaces and Linear Operators
157
In [69] it is proved that a Banach space which is uniformly noncreasy (UNC for short) possesses property (Sm ). This class of Banach spaces contains the uniformly convex as well as the uniformly smooth spaces. An UNC-Banach space is superreflexive and its nonstandard hull is also UNC. So in particular it possesses property (Sm ). Therefore the following result is important: Theorem 4.6.23 (A. Wisnicki [69]) Let E be a superreflexive Banach space and assume that its nonstandard hull possesses (Sm ). Then E has FFP. In order to prove the theorem we have to recall some facts of the general fixed point theory: Let E do not have FFP. Then there exists a closed convex set K with more than one point and a nonexpansive mapping T on it without fixed points with the following properties: (i) conv(T (K )) = K . (ii) K is diametral, i.e. diam(K ) = sup y x − y for all x ∈ K . (iii) Every approximative fixed point sequence (xn )n satisfies limn xn − x = diam(K ) for all x ∈ K . By rescaling and shifting one can assume that 0 ∈ K , moreover that diam(K ) = 1 and finally that whenever K is weakly relatively compact there exists an approximate fixed point sequence converging weakly to 0. Now let Eˆ be the nonstandard hull in a polysaturated extension (see Sect. 2.9) of the standard world. Then using (iii) we can prove the following facts: (a) diam(Fi x(Tˆ )) = diam( Kˆ ) = diam(K ). (b) Kˆ , and Fi x(Tˆ ) are diametral and xˆ ∈ Fi x(Tˆ ) implies x ˆ = diam(K ). We now can use all that we have discussed above to prove Wi´snicki’s theorem. Proof Assume that E does not possess the FFP. Then there exists a closed convex subset K , say, and a nonexpansive mapping T on it without fixed points and with the properties listed above. Let (xn )n be an approximate fixed point sequence of T . Without loss of generality we may assume that (xn )n converges weakly to 0 (notice that all bounded closed subsets are weakly compact since E is reflexive). Moreover we can also assume diam(K ) = 1. Hence Fix(Tˆ ) is a subset of the unit sphere which is metrically convex by Theorem 4.6.21. Since Eˆ possesses (Sm ) there exists ˆ which is strictly positive on Fix(Tˆ ). an element η ∈ ( E) By Theorem 4.3.27 η = ξˆ for an element ξ ∈ Fin(E ). Because of Theorem 4.3.15 ξ is weakly nearstandard to a standard ϕ ∈ E . Then < x N , ϕ > 0 for all N ≈ ∞. Applying Robinson’s Sequential Lemma (Theorem 2.8.13) to the sequence (sn )n given by sn :=< xn , ξ − ϕ > (notice that sn 0 for all standard n) we obtain N ≈ ∞ such that < x N , ϕ > − < x N , ξ >=< x N , ξ − ϕ > 0, hence 0 < x N , ξ > because 0 < x N , ϕ >. But this implies x N ∈ Fi x(Tˆ ) as well as ˆ < x N , ξ >= 0, a contradiction.
158
M.P.H. Wolff
Remark 4.6.24 As discussed already above, this theorem implies that all UNC Banach spaces possess FFP, a result due to S. Prus [46].
4.6.5 References to Further Applications of Nonstandard Analysis To operator Theory (1) There is an easy generalization of the notion of compact operators based on containing E, and let T | F be Proposition 4.4.1: Let F be a closed subspace of E the class of continuous operators T such that T ( E) ⊂ F. The problem is how to characterize these operators in standard terms. A fruitful application was given in [58], where E is considered to be a Banach lattice and F is the closed ideal of generated by E. This application generalized considerably earlier results on E operators on atomic Banach lattices. This research is continued by V. G. Troitsky, see [66] in a very interesting manner. (2) Let E be an ordered Banach space, and let (Tt ) be a semigroup of positive operators. Assume that (Tt ) dominates asymptotically another semigroup (St ). More precisely this means that limt→∞ d(Tt x − St x, E + ) = 0 holds for all x in the positive cone E + of E. Which properties of (Tt ) are shared by (St )? Examples are stability, asymptotic almost periodicity and spectral properties (at least if additional assumptions are made concerning the underlying space E). For some important results see e.g. [14, 50–52]. (3) There are also some sophisticated applications to semigroups of operators on C ∗ –algebras and its applications to the mathematical theory of many particle systems, see e.g. [68, 72, 75].
4.6.6 Notes The first one who used Fréchet products in the context of spectral theory of strongly continuous semigroups seems to have been R. Derndinger [12]. Since then ultrapower techniques were used quite frequently (see e.g. [43]). For more recent results see the papers mentioned in the previous subsection. The research on the connection between discrete convergence of operators and the convergence of spectra in this generality is due to the author [77, 78]. More concrete results have been obtained in the context of approximation of pseudo– differential operators by Gordon et al. [2]. For another application of nonstandard analysis to approximation theory see [74]. There is a far going generalization of discrete convergence due to B. Silbermann and his school, see e.g. [59]. Nonstandard analysis however is not applied there up to now though it seems very promising. An extensive nonstandard analytical treatment of concrete closed operators, e.g. of differential operators, is to be found in [1].
4 Branch Spaces and Linear Operators
159
Acknowledgments I would like to thank Prof. C. W. Henson, University of Illinois at ChampaignUrbana who gave me the important reference to the work of D. Dacunha-Castelles and J. L. Krivine, and who read very carefully an earlier version of Sects. 4.1 and 4.2; Prof. E. Gordon, University of Nishni Novgorod and now Eastern Illinois University, with whom I discussed his own approach to the theory of discrete approximation; Dr. H. Ploss, University at Vienna, for many helpful discussions on the theory of strongly continuous semigroups, some of which prevented me from unsightly errors; and Prof. Dr. Eduard Emel’yanov from the Middle East Technical University at Ankara who carefully read the final version of the first edition eliminating some more misprints and errors.
References 1. S. Albeverio, J.E. Fenstad, R. Høegh-Krohn, T. Lindstrøm, Nonstandard Methods in Stochastic Analysis and Mathematical Physics (Academic Press, Orlando, 1986) 2. S. Albeverio, E. Gordon, A. Khrennikov, Finite dimensional approximations of operators in the spaces of functions on locally compact abelian groups. Acta Appl. Math. 64, 33–73 (2000) 3. H. Ando, U. Haagerup, Ultraproducts of von Neumann algebras. J. Funct. Anal. 266, 6842–6913 (2014) 4. S.K. Berberian, Approximate proper vectors. Proc. Am. Math. Soc. 13, 111–114 (1962) 5. S. Baratella, S.A. Ng, Some properties of nonstandard hulls of Banach algebras. Bull. Belg. Math. Soc. Simon Stevin 18, 31–38 (2011) 6. A.R. Bernstein, A. Robinson, Solution of an invariant subspace problem of K.T. Mith and P.R. Halmos. Pac. J. Math. 16, 421–431 (1966) 7. S. Buoni, R. Harte, A.W. Wickstead, Upper and lower Fredholm spectra I. Proc. Am. Math. Soc. 66, 309–314 (1977) 8. A. Connes, Noncommutative Geometry (Academic Press, New York, 1994) 9. J.J.M. Chadwick, A.W. Wickstead, A quotient of ultrapowers of Banach spaces and semiFredholm operators. Bull. Lond. Math. Soc. 9, 321–325 (1977) 10. D. Dacunha-Castelle, J.L. Krivine, Application des ultraproducts a l’etude des espaces et des algebres de Banach. Studia Math. 41, 315–334 (1995) 11. M. Davis, Applied Nonstandard Analysis (Wiley, New York, 1977) 12. R. Derndinger, Über das Spektrum positiver Generatoren. Math. Z. 172, 281–293 (1980) 13. N. Dunford, J. Schwartz, Linear Operators Part I (Interscience Publishers, New York, 1958) 14. E.Y. Emel’yanov, U. Kohler, F. Räbiger, M.P.H. Wolff, Stability and almost periodicity of asymptotically dominated semigroups of positive operators. Proc. Am. Math. Soc. 129, 2633–2642 (2001) 15. P. Enflo, J. Lindenstrauss, G. Pisier, On the “three space problem”. Math. Scand. 36, 199–210 (1975) 16. E.I. Gordon, A.G. Kusraev, S.S. Kutadeladze, Infinitesimal Analysis (Kluver Academic Publisher, Dordrecht, 2002) 17. G. Greiner, Zur Perron-Frobenius Theorie stark stetiger Halbgruppen. Math. Z. 177, 401–423 (1981) 18. U. Groh, Uniformly ergodic theorems for identity preserving Schwarz maps on W -algebras. J. Oper. Theory 11, 395–402 (1984) 19. S. Heinrich, Ultraproducts in Banach space theory. J. Reine Angew. Math. 313, 72–104 (1980) 20. S. Heinrich, C.W. Henson, L.C. Moore, A note on elementary equivalence of C(K ) spaces. J. Symb. Log. 52, 368–373 (1987) 21. C.W. Henson, L.C. Moore, The nonstandard theory of topological vector spaces. Trans. Am. Math. Soc. 172, 405–435 (1972) 22. C.W. Henson, Nonstandard hulls of Banach spaces. Isr. J. Math. 25, 108–144 (1976) 23. C.W. Henson, L.C. Moore, Nonstandard Analysis and the theory of Banach spaces, in Nonstandard Analysis—Recent Developments, ed. by A.E. Hurd (Springer, Berlin, 1983), pp. 27–112
160
M.P.H. Wolff
24. C.W. Henson, J. Iovino, Ultraproducts in analysis, in Analysisand Logic, ed. by C. Finet (e.) et al. Report on three minicourses given at the international conference "Analyse et logique" Mons, Belgium, 25-29 August, Cambridge University Press, London Mathematical Society Lecture Notes Series , vol. 262 (2002), pp. 1-110 25. E. Hewitt, K.H. Ross, Abstract Harmonic Analysis I (Springer, Berlin, 1963) 26. E. Hille, R.S. Phillips, Functional Analysis and Semi-groups, vol. 31 (American Mathematical Society Colloquium Publications, Providence, 1957) 27. T. Hinokuma, M. Ozawa, Conversion from nonstandard matrix algebras to standard factors of type I I1 . Ill. Math. J. 37, 1–13 (1993) 28. A.E. Hurd, P.A. Loeb, An Introduction to Nonstandard Real Analysis (Academic Press, Orlando, 1985) 29. R.C. James, Characterizations of reflexivity. Studia Math. 23, 205–216 (1963/64) 30. G. Janssen, Restricted ultraproducts of finite von Neumann algebras, in Contributions to NonStandard Analysis. Studies in Logic and the Foundations of Mathematics, vol. 69. ed. by W.A.J. Luxemburg, A. Robinson (North Holland, Amsterdam, 1972), pp. 101–114 31. M.A. Khamsi, B. Sims, Ultra-methods in metric fixed point theory, in Handbook of Metric Fixed Point Theory, ed. by W. Kirk, B. Sims (Kluwer Academic Publishers, Dordrecht, 2001), pp. 177–199 32. T. Kato, Perturbation Theory of Operators (Springer, Berlin, 1976) 33. A. Krupa, On various generalizations of the notion of an F-power to the case of unbounded operators. Bull. Pol. Acad. Sci. Math. 38, 159–166 (1990) 34. H.E. Lacey, The Isometric Theory of Classical Banach Spaces (Springer, New York, 1974) 35. J. Lindenstrauss, H. Rosenthal, The L p spaces. Isr. J. Math. 7, 325–349 (1969) 36. W.A.J. Luxemburg, A general theory of monads, in Applications of Model Theory to Algebra, Analysis and Probability, ed. by W.A.J. Luxemburg (Holt, Rinehart and Winston, New York, 1969), pp. 18–86 37. W.A.J. Luxemburg, Near–standard compact internal linear operators, in: Developments in nonstandard mathematics, eds. by N. J. Cutland et al. Pitman Res. Notes Math. Ser. vol. 336 (London, 1995) pp. 91–98 38. A. Martínez-Abejón, An elementary proof of the principle of local reflexivity. Proc. Am. Math. Soc. 127, 1397–1398 (1999) 39. B. Maurey, Points fixes des contractions de certains faiblement compact de L 1 . Seminaire d’analyses fonctionelle 1980–81 (Ecole Polytechnique, Palaiseau, 1981) 40. P. Meyer-Nieberg, Banach Lattices (Springer, New York, 1991) 41. G. Mittelmeyer, M.P.H. Wolff, Über den Absolutbetrag auf komplexen Vektorverbänden. Math. Z. 137, 87–92 (1974) 42. G.J. Murphy, C ∗ -Algebras and Operator Theory (Academic Press, Boston, 1990) 43. R. Nagel (ed.), One–Parameter Semigroups of Positive Operators. Lecture Notes in Mathematics vol. 1184 (Springer, Berlin, 1986) 44. E. Nelson, Internal set theory: a new approach to nonstandard analysis. Bull. Am. Math. Soc. 83, 1165–1198 (1977) 45. Siu-Ah Ng, Nonstandard methods in Functional Analysis. Lecture and Notes (World Scientific, Singapore, 2010) 46. S. Prus, Banach spaces which are uniformly noncreasy, in Proceedings of 2nd World Congress of Nonlinear Analysis (Athens 1996). Nonlinear Anal. 30, 2317–2324 (1997) 47. H.J. Reinhardt, Analysis of Approximation Methods for Differential and Integral Equations (Springer, Berlin, 1985) 48. A. Pazy, Semigroups of Linear Operators and Applications to Partial Differential Equations (Springer, Berlin, 1983) 49. F. Räbiger, M.P.H. Wolff, Superstable semigroups of operators. Indag. Math., N.S. 6, 481–494 (1995) 50. F. Räbiger, M.P.H. Wolff, Spectral and asymptotic properties of dominated operators. J. Aust. Math. Soc. (Series A) 63, 16–31 (1997)
4 Branch Spaces and Linear Operators
161
51. F. Räbiger, M.P.H. Wolff, On the approximation of positive operators and the behaviours of the spectra of the approximants. Integral Equ. Oper. Theory 28, 72–86 (1997) 52. F. Räbiger, M.P.H. Wolff, Spectral and asymptotic properties of resolvent-dominated operators. J. Aust. Math. Soc. 68, 181–201 (2000) 53. C.E. Rickart, General Theory of Banach Algebras (Van Nostrand, Princeton, 1960) 54. A. Robert, Functional analysis and NSA, in Developments in Nonstandard Mathematics, Pitman Research Notes in Mathematics Series, vol. 336, ed. by N.J. Cutland, et al. (Springer, London, 1995), pp. 73–90 55. B.N. Sadovskii, Limit-compact and condensing operators. Uspehi Math. Nauk 27, 81–146 (1972) 56. S. Sakai, C ∗ -Algebras (Springer, Berlin, 1971) 57. H.H. Schaefer, Banach Lattices and Positive Operators (Springer, Berlin, 1974) 58. A. Schepp, M.P.H. Wolff, Semicompact operators. Indag. Math. New Ser. 1, 115–125 (1990) 59. M. Seidel, B. Silbermann, Banach algebras of operator sequences. Op. Matrices 6, 385–432 (2012) 60. B. Sims, “Ultra”-techniques in Banach Space Theory. Queen’s Papers in Pure and Applied Mathematics , vol. 60 (Queen’s University, Kingston, 1982) 61. K.D. Stroyan, W.A.J. Luxemburg, Introduction to the Theory of Infinitesimals (Academic Press, New York, 1976) 62. Yeneng Sun, A Banach space in which a ball is contained in the range of some countable additive measure is superreflexive. Canad. Math. Bull. 33, 45–49 (1990) 63. D.G. Tacon, Generalized semi-fredholm transformations. J. Aust. Math. Soc. Ser. A 34, 60–70 (1983) 64. M. Takesaki, Theory of Operator Algebras (Springer, Berlin, 1978) 65. L.N. Trefethen, Pseudospectra of matrices, in: Numerical Analysis, Proceedings of the 14th Dundee Conference 1991 ed. by D.F. Griffiths, Pitman (London, 1993) pp. 234–264 66. V.G. Troitsky, Measures of noncompactness of operators on Banach lattices. Positivity 8, 165– 178 (2004) 67. G. Vainikko, Funktionalanalysis der Diskretisierungsmethoden (Teubner, Leipzig, 1976) 68. R. Werner, M.P.H. Wolff, Classical mechanics as quantum mechanics with infinitesimal . Phys. Lett. Ser. A 202, 155–159 (1995) 69. A. Wi´snicki, Towards the fixed point property for superreflexive spaces. Bull. Aust. Math. Soc. 64, 435–444 (2001) 70. A. Wi´snicki, On the structure of fixed point sets of nonexpansive mappings, in: Proceedings of the 3rd Polish Symposium on Nonlinear Analysis. Lecture Note in Nonlinear Analysis vol. 3, (2002), pp. 169-174 71. A. Wi´snicki, The super fixed point property for asymptotically nonexpansive mappings. Fundam. Math. 217, 265–277 (2012) 72. M.P.H. Wolff, R. Honegger, On the algebra of fluctuation operators of a quantum meanfield system. Quantum Probab. Relat. Top. IX, 401–410 (1994) 73. M.P.H. Wolff, Spectral theory of group representations and their nonstandard hull. Isr. J. Math. 48, 205–224 (1984) 74. M.P.H. Wolff, An application of spectral calculus to the problem of saturation in approximation theory. Note di Matematica XII, 291–300 (1992) 75. M.P.H. Wolff, A nonstandard analysis approach to the theory of quantum meanfield systems, in Advances in Analysis, Probability and Mathematical Physics—Contributions of Nonstandard Analysis, ed. by S. Albeverio, W.A.J. Luxemburg, M.P.H. Wolff (Kluwer Academic Publisher, Dordrecht, 1995), pp. 228–246 76. M.P.H Wolff, An introduction to nonstandard functional analysis, in: Proceedings of Nonstandard Analysis–Theory and Applications eds. by L.O. Arkeryd, N.J. Cutland C.W. Henson (Kluwer Academic Publisher, Dordrecht, 1997), pp. 121–151 77. M.P.H. Wolff, On the approximation of operators and the convergence of the spectra of the approximants. Op. Theory: Adv. Appl. 13, 279–283 (1998)
162
M.P.H. Wolff
78. M.P.H. Wolff, Discrete approximation of unbounded operators and the convergence of the spectra of the approximants. J. Approx. Theory 113, 229–244 (2001) 79. M.P.H Wolff, Discrete approximation of compact operators and approximation of their spectra, in: Nonstandard Methods and Applications in Mathematics, Lecture Notes in Logic vol. 25 (206) eds. by N.J. Cutland, Mauri Di Nasso, David A. Ross (A.K. Peters Ltd., Wellesley) pp. 224–231 80. M. Yahdi, Super-ergodic operators. Proc. Am. Math. Soc. 134, 2613–2620 (2006) 81. K. Yosida, Functional Analysis, 2nd edn. (Springer, Berlin, 1968)
Part III
Compactifications
Chapter 5
General and End Compactifications Matt Insall, Peter A. Loeb and Małgorzata Aneta Marciniak
5.1 Introduction Here we follow the work in [7], where nonstandard analysis [9, 12, 15] is used to extend and simplify previous works in the literature on compactifications. Recall that the monad of a standard point x is the intersection of all nonstandard extensions of standard open neighborhoods of x. Points in the monad of some standard point are called nearstandard; a remote point is any point in the nonstandard extension of the space that is not nearstandard. A space has at least one remote point if and only if it is not compact. A central theme of this chapter is the following: A compactification of a regular space is produced by any equivalence relation on the set of remote points. The new points of the resulting compactification are the equivalence classes of remote points. This yields a compact space containing the original point set as a dense subset. The relative topology on that dense subset is in some cases, however, weaker than the original topology. Compactifications constructed in the literature often employ a
M. Insall (B) Department of Mathematics and Statistics, Missouri University of Science and Technology, 400 W. 12th St., Rolla, MO 65409-0020, USA e-mail: [email protected] P.A. Loeb Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana, IL 61801, USA e-mail: [email protected] M.A. Marciniak Department of Mathematics, Engineering and Computer Science, LaGuardia Community College, CUNY, 31-10 Thomson Avenue, Long Island City, NY 11101, USA e-mail: [email protected] © Springer Science+Business Media Dordrecht 2015 P.A. Loeb and M.P.H. Wolff (eds.), Nonstandard Analysis for the Working Mathematician, DOI 10.1007/978-94-017-7327-0_5
165
166
M. Insall et al.
continuous map from the original space into a compact space. Forming a compactification by attaching appropriate points is incisive; it allows a better understanding of the relationship between the original space and the set of compactifying points. For example, given a family of bounded real-valued functions on the original space, as was considered by the second author in [10], one can call two remote points equivalent if the nonstandard extension of each of the functions in the family has infinitesimal variation on the two point set. This leads to compactifications such as ˇ the Stone-Cech compactification, requiring only regularity, not complete regularity, of the original space. A continuum, i.e., a compact, connected, metrizable space, arises as a compactification in many natural situations. One approach to such compactifications is the theory of topological ends (see [3]). Using nonstandard analysis, we illuminate that theory and extend it. Simple examples of end compactifications are the two point compactification of the real line and the one point compactification of the complex plane. The notion of topological ends was introduced by Freudenthal in [3] to formalize the intuitive notion of a “hole” in a noncompact space. Freudenthal used sequences of connected open sets having nonempty compact boundary with empty intersection of the sets in the sequence. That approach was recently extended by the third author in [11] and then by the first and third author in [8] using nested nets of open sets with the same properties. The work in [7] on which this chapter is based shows that the special assumptions of these previous papers can be eliminated, so that our results apply to all regular, connected and locally connected topological spaces. Moreover, the definition presented here extends the notion of ends in those works in the sense that some spaces with intuitive “holes” fail to have ends (in the senses of the older works) at the locations of the “holes”, but with the newer definition given here (from [7]) they have ends there and only there.1 Among other results from [7] is the fact that a product space with two or more noncompact factors has only one end. Again, a simple example is the complex plane. Literature [5, 6] shows varied uses of ends and various methods of producing end compactifications. For example, Halin (see [5]) introduced graph-theoretical ends using equivalence classes of rays at infinity. Those ends are, in general, distinct from Freudenthal’s ends. Other literature, described in [7], includes work of Diestel [1] and Goldbring [4] as well as work that foreshadows [7] such as that of Salbany and Todorov [15, 16], and of course Robinson [13].
1 One
might consider applying nonstandard methods to the notion of ends presented in [8], leading one to use enlargements of directed sets and nets. The first author looked at this briefly with Mr. Tom Cuchta, but preliminary investigations suggest that the resulting theory is essentially equivalent—at greater complexity cost—with the work in [7].
5 General and End Compactifications
167
5.2 General Compactifications Let (Z , T ) be a topological space. We assume that Z is regular, by which we mean that for each p ∈ Z , the singleton set { p} is a closed set, and for each open neighborhood U of p there is an open neighborhood V ⊆ U of p whose closure, V , is contained in U . We also assume that Z is noncompact. If there is a compact subset K 0 of our original space such that the interior of K 0 is not regular, then we assume that Z is the complement of the interior of K 0 . We now fix a κ-saturated nonstandard extension of (Z , T ), where κ is greater than the cardinality of the topology T . Recall that compact subsets of Z are closed in Z . Since we are not requiring that Z be a metric space, all reference to monads means topological monads, rather than metric monads. That is, for a point p ∈ Z , the monad of p consists of those points in ∗ Z that are in the nonstandard extension of every standard open neighborhood of p. In case the topology is determined by a metric, the metric monads and topological monads of standard points coincide, but this makes the notion of “remote point” require some care because one can define monads of nonstandard points as well, and these monads may be different for the metric case and the topological case. Definition 5.2.1 Given x ∈∗ Z , x is remote if x is not in the topological monad of any standard point of Z . Equivalently, x is remote if and only if it is not nearstandard. Note that remote points need not be “far away” from standard points. For example, if a single standard point p is removed from the complex plane, the remaining points of the monad of p are then remote points in the nonstandard extension of the resulting space. Let there be given an equivalence relation, ∼, on the set of remote points of ∗ Z . We often refer to the relationship x ∼ y between two remote points x and y by saying that x and y are equivalent. In general, equivalence classes are external. In the following definition, the point set Z is the set in the standard model. Definition 5.2.2 A point of Z will be called an s-point. An equivalence class of remote points under the given equivalence relation ∼ will be called an r-point; it will be denoted by [x]∼ (where x is some representative of the equivalence class.) Let Y be the point set consisting of all s-points and r-points topologized as follows: 1. The nonstandard extension of Z , ∗ Z , is supplied with the S-topology. 2. The mapping ϕ : ∗ Z → Y is given by ϕ(x) =
stx [x]∼
if x is nearstandard, if x is remote.
3. The neighborhood filter base B(y) at a point y of Y is given as follows: B(y) =
{ϕ (∗ U ) : U ∈ T , y = [x]∼ ⊆ ∗ U } {ϕ (∗ U ) : U ∈ T , z ∈ U }
if y = [x]∼ is an r-point, if y = z is an s-point.
168
M. Insall et al.
In [7] it is shown that the above is a valid topologization of the set Y . That is, a set O ⊆ Y is declared “open” if it contains a member of the filter base of each of its points, or equivalently, provided that O=
ϕ ∗ U : ϕ ∗ U ∈ B( p), ϕ ∗ U ⊆ O . p∈O
Here is the relevant proposition with the proof left to the reader (or see [7]): Proposition 5.2.3 The collection B( p) at a point p ∈ Y is in fact a filter base. We let TY denote the topology on Y , i.e., the collection of open sets, generated by the neighborhood filter bases. Note that the members of the neighborhood filter bases are not in general open sets. To make use of the topology TY , it is necessary to make certain observations about the topological properties of the space (Y, TY ). Proposition 5.2.4 Let A ⊆ Z be nonempty. Then any s-point that is the standard part of a point in ∗ A is a point of the T -closure of A. Any s-point in the T -closure of A is also a point of the TY -closure of A. In fact, ϕ (∗ A) is a subset of the TY -closure of A. Proof That standard parts of points of ∗ A are points of the T -closure of A is clear. Assume that x ∈ Z is a point in the T -closure of A. Any TY open set W that contains x also contains a set ϕ (∗ U ) for which U ∈ T includes the point x. Consequently, some point z is in U ∩ A. Since z ∈ ϕ (∗ U ) ∩ A ⊆ W ∩ A, x is in the TY -closure of A. Thus any s-point in ϕ (∗ A) is in the TY -closure of A. If p is an r-point in ϕ (∗ A), let W ∈ TY contain p. There is a V ∈ T with the equivalence class corresponding to p contained in ∗ V and ϕ (∗ V ) ⊆ W . Because p ∈ ϕ (∗ A), ∗ A includes some remote point y in the equivalence class p = [y]∼ , and hence ϕ(y) = p. By the choice of V , y ∈ ∗ V . Since ∗ V ∩ ∗ A = ∅, downward transfer yields that V ∩ A includes some point x, whence x is in A and also in ϕ (∗ V ) ⊆ W . Thus every point in ϕ (∗ A) is a point of the TY -closure of A. There is a simple example in [7] of a space Z with an equivalence relation on the remote points and an open set U for which the TY -closure includes an r-point not in ϕ (∗ U ). The next result, taken from [7], is essentially the fact that the space Y we have constructed is a compactification of the original space Z . The proof relies upon a result of Salbany and Todorov [15], noted in Chap. 3 of this book, that ∗ Z , with the S-topology, is a compact space. Theorem 5.2.5 The map ϕ is a continuous surjection from ∗ Z onto Y , whence, Y is compact. Moreover, the point set Z is dense in Y supplied with the TY -topology. In general, the T -topology on Z is stronger than the relative TY -topology on Z . Definition 5.2.6 Let A ⊆ ∗ Z . Then A is not equivalence class splitting if for each remote point y ∈ A, we have [y]∼ ⊆ A.
5 General and End Compactifications
169
As indicated in [7] the following central result follows immediately from the regularity of (Z , T ) and the definition of members of TY . Theorem 5.2.7 Let O ⊆ Z be open, and let A O ⊆ ∗ O be a set of remote points that is not equivalence class splitting. Assume that: 1. To each x ∈ O corresponds a Vx ∈ T with x ∈ Vx such that the T -closure of Vx is contained in O and the remote points in ∗ Vx are contained in A O . 2. For every a ∈ A O , there is a T -open set Va such that the T -closure of Va is contained in O, every remote point in ∗ Va is in A O , and the equivalence class of a, [a]∼ , is contained in ∗ Va . Let W = x∈O ϕ (∗ Vx ) ∪ a∈A O ϕ (∗ Va ). Then 1. W ∈ TY , 2. W ∩ Z = O, 3. x ∈ O ⇒ x ∈ W ⊆ ϕ (∗ O) ∈ B(x), and 4. p = ϕ (a), a ∈ A O ⇒ p ∈ W ⊆ ϕ (∗ O) ∈ B( p). If the above hold for all open subsets of Z , then the T -topology on Z is actually the relative TY -topology on Z . The following two corollaries are taken from [7]. The easy proofs are left to the reader. Corollary 5.2.8 Assume that O ∈ T has the property that for each x ∈ O there is -closure of Vx is contained in O and ∗ Vx is not a Vx ∈ T with x ∈ Vx such that the T equivalence class splitting. Set W = x∈O ϕ (∗ Vx ). Then W ∈ TY and W ∩ Z = O. If each O ∈ T satisfies the above assumption, then the T -topology on Z equals the relative TY -topology on Z . Corollary 5.2.9 If T is a locally compact topology on Z , then the T -topology on Z equals the relative TY -topology on Z . Local connectivity of the space (Y, TY ) is at times an important consideration in what follows. In particular, we have the following result using the above notation. Corollary 5.2.10 If O ⊆ Z is an open and connected set, and if each of the sets Vx , x ∈ O, is connected, then W is connected. Proof Any set containing a connected set S and contained in the closure of S is connected. Therefore, the result follows from Proposition 5.2.4. As noted in [7], the last corollary could also be proved using the following connectivity result. Proposition 5.2.11 The nonstandard extension of any connected open subset of Z is also connected, in the S-topology.
170
M. Insall et al.
In [10], the second author of this chapter described methods of imbedding a Hausdorff space into a compact space so that each function in a given family of continuous functions on the original space has a continuous extension to the compactification, and the family of extensions separates the points of the “remainder”, i.e., the set of new points in the compact space. The following theorem from [7] describes how our approach here, using nonstandard methods and equivalence relations on the remote points, relates to that earlier work. The proof of this theorem, as presented in [7] is very straightforward in our setting. Moreover, applying this theorem to the class of all bounded, continuous, realˇ valued functions on a regular space Z gives an extension of the Stone-Cech compactification construction to include regular non-completely regular spaces, so that it is not necessary to imbed Z in a product space to obtain the compactification. As it is remarked in [7], application of this construction to R. Arens’ example of a regular but not completely regular space (see [2], p. 154), produces an example where the T -topology is stronger than the relative TY-topology. Theorem 5.2.12 Let Q be a collection of bounded, continuous, real-valued functions on Z , and call two remote points x and y of the enlargement ∗ Z equivalent provided that for each f ∈ Q, ∗ f (x) −∗ f (y) is infinitesimal. Let Y be the compactification for this equivalence relation. For each r-point p in Y , and each f ∈ Q, set f ( p) equal to the standard part of ∗ f (x) for all x in the equivalence class corresponding to p. Then f : Y → R is a continuous extension of f . Moreover the set of extensions of members of Q separates the r-points of Y .
5.3 End Compactifications The title of this section is not a political slogan. We work with a noncompact topological space (Z , T ) that is regular, connected and locally connected. If there is a compact subset K 0 of our original space such that, on the interior of K 0 , regularity or local connectivity fails, then we assume that Z is the complement of the interior of K 0 . Recall that any component W of the complement of a compact set is an open set because any x ∈ W has a connected open neighborhood that is contained in W . Let κ be a fixed cardinal number that is greater than the cardinality of the topology T . Throughout this and the next section, we will work in a κ-saturated nonstandard extension of (Z , T ). Let us say that a set A ⊆ ∗ Z is remote provided that each of its points is a remote point in ∗ Z . Definition 5.3.1 We say that two remote points x, y in ∗ Z are equivalent, and we write x ∼ y if there is a remote, internally connected set A with x ∈ A and y ∈ A. The following is an easy observation, following from the fact that the union of two connected sets containing a common point is connected.
5 General and End Compactifications
171
Proposition 5.3.2 The relation ∼ is an equivalence relation in the set of remote points. In general, the equivalence classes under this equivalence relation are external. The following definition is our incisive revision of the notions of ends that have been previously considered by Freudenthal in [3], and by the first and third authors of the present chapter of this book in [8]. It is this notion, easily available and highly intuitive only in the nonstandard setting, that provides such a natural expansion of the results of those previous works on end compactifications. Definition 5.3.3 We call the equivalence class containing a remote point x ∈ ∗ Z the end of Z represented by x. We apply here the results of the previous section on general compactifications. In particular, we employ the notion of a not equivalence class splitting subset of ∗ Z . Definition 5.3.4 We call the compactification corresponding to the equivalence relation, ∼, of this section the end compactification of Z . We call an open set O ∈ T non end-splitting, or just NES if ∗ O is not equivalence class splitting with respect to the equivalence classes forming ends.
Example 5.3.5 Let Z = 0, 13 ∪ 23 , 1 × [0, 1] in the real plane, and let T be the subspace topology on Z . As explained in [7], it follows that 1. Z has a unique end, e 2. e is the set of all points in the nonstandard extension of the square with positive but infinitesimal second coordinate and horizontal coordinate between 13 and 23 but not in the monad of either. 3. The standard points (1/3, 0) and (2/3, 0) in Z cannot be separated from each other by disjoint open neighborhoods in Y . 4. The standard points (1/3, 0) and (2/3, 0) in Z cannot be separated from e by disjoint open neighborhoods in Y . 5. The topology T is strictly stronger than the relative TY topology on Z . 6. the net method of [8] does not work to define the end in Z . Recall that a regular space is locally compact if and only if each of its compact subsets is contained in an open set for which the closure is compact. This standard fact is employed in the essentially standard proof of the following result (see [7]). Theorem 5.3.6 Let K be a compact subset of Z contained in an open set W ⊆ Z with compact closure W . Then all but a finite number of components of Z K are contained in the compact set W . It follows that if Z is locally compact, then the complement of any compact subset of Z has only a finite number of components with nonstandard extension containing remote points. The following example involves a connected and locally connected space that is not locally compact.
172
M. Insall et al.
Example 5.3.7 Let Z = {0} ∪
In ,
n∈N
where for each natural number n, In = (0, 1n ] is a homeomorphic copy of the halfopen interval (0, 1]. We take as a base for the neighborhood system of each p ∈ In the usual open base inherited from the real line. A typical element of the base for the neighborhood system of 0 is given by a standard positive ε < 1; it is the set Oε := {0} ∪
{x ∈ In : x < ε} .
n∈N
For each H ∈ ∗ NN, the non-infinitesimal points in I H form an end. These are the only ends. The monad of 0 is given by μ(0) = {0} ∪
{x ∈ In : x 0} .
n∈∗ N
The nonstandard extension of any standard open neighborhood U of 0 in Z has nonempty intersection with every end, so to form a member of B(0), ϕ (∗ U ) must contain the nonstandard interval I H for every unlimited H ∈ ∗ N, and thus In for all n ≥ m U for some m U ∈ N. Therefore, the end compactification of Z is not Hausdorff, but a Hausdorff quotient is obtainable by mapping every end to 0. Note that the number of ends in the compactification depends on the cardinality of ∗ N in the selected nonstandard extension. We give the statement and proof of this next proposition much as it is given in [7] for open sets. We formulate it more generally, but of course it still holds for open sets. The result demonstrates that Robinson’s nonstandard criterion for compactness can be ostensibly weakened for boundaries. Proposition 5.3.8 Suppose A ⊆ Z and that p∈ ∗ ∂ A is in the monad of some standard point x ∈ Z . Then actually, x ∈ ∂ A. It follows that the boundary ∂ A of a nonempty subset A of Z is compact if and only if every point α∈ ∗ ∂ A is in the monad of some standard point of Z . Proof Under the conditions of the proposition, let U be any standard open neighborhood of x; then p∈ ∗ U . Since p∈ ∗ ∂ A, the open set ∗ U contains points both inside and outside ∗ A, so by downward transfer, U contains points both inside and outside A. It follows that x ∈ ∂ A, whence p is nearstandard in ∗ ∂ A. Therefore, if all points of ∗ ∂ A are in monads of standard points of Z , then they are in monads of standard points of ∂ A, so ∂ A is compact. The converse clearly holds. Connectedness and, in particular, components play a significant role in investigations relating ends to compactifications. We state without proof the following result
5 General and End Compactifications
173
about non end-splitting components, leaving the proof to the reader, or the reader may refer to [7]. Proposition 5.3.9 Any connected component of the complement of a compact set is non end-splitting. The assumption of local compactness simplifies the study of ends, so the following proposition is useful. Proposition 5.3.10 If Z is locally compact, and if x and y are non-equivalent remote points in ∗ Z , then there is a compact set K ⊆ Z such that x and y are in the nonstandard extensions of different components of Z \ K . Proof To assume the contrary, suppose that for every compact set K , x and y are in the nonstandard extension of the same component of Z \ K . Using local compactness and saturation, it follows that there is a nonstandard compact set C containing all near-standard points such that x and y are in the same component of ∗ Z \ C, so that y ∼ x. Since Z is connected, the only nonempty subset of Z with empty boundary is Z . Clearly, Z is not end-splitting. In general, we have the following result for non-trivial open subsets of Z . We refer the reader to [7] for the proof of this result. Theorem 5.3.11 A nonempty open set has a compact boundary if and only if it is non end-splitting. In [8], the first and third authors defined ends of topological spaces in terms of nets of open sets ordered by reverse inclusion (i.e., V ≥ U iff V ⊆ U ). The sets forming the net each have nonempty boundary and have empty intersection of the closures. For any such net, each member U contains an open subset with compact boundary. That is, each such net is refined by some net of nonempty open sets, each having compact boundary. Corollary 5.3.12 Let {Uα }α∈ be a net of nonempty open subsets of Z with compact boundary directed by downward inclusion and having empty intersection of the ∗ U , the end represented by x is contained closures. For any remote point, x, in α α∈ in α∈ ∗ Uα . Proposition 5.3.13 Under the assumptions of the above corollary, let x and y be remote points in α∈ ∗ Uα . Then y is in the end represented by x. Therefore this end is the same as the end determined by the method of [8] using the net {Uα }α∈ . Proof Because of saturation, x and y are in some common internally connected open set V ⊂ α∈ ∗ Uα . If z ∈ Z (i.e., if z is a standard point of ∗ Z ), then for some index α, z ∈ Z \ U α . Consequently, no point of V is in the monad of z. That is, no point of V is nearstandard. Thus, x and y are equivalent, and determine the same end.
174
M. Insall et al.
The above corollary and proposition, both from [7], illuminate the relationship between the approach in [8] and the one here using nonstandard methods. In particular, if for any such net, each member U contains an open subset with compact boundary (as is assumed in [8]), then the ends obtained in [8] and our ends defined using nonstandard methods, are in a natural one-to-one correspondence. Example 5.3.5 demonstrates a case for which the assumption of [8] is not satisfied but nonstandard ends still can be used. Here is an example with an infinite number of “ends that are near”. Example 5.3.14 Let C denote the complex plane, topologized with the usual topology, let Q denote the set of rational numbers on the real-axis, and let I be the open real interval (0, 1). Set Z = C \ (Q ∩ I ). The space Z is not locally compact, and the nonstandard rational numbers strictly between 0 and 1 are not included in ∗ Z . Nonstandard methods sharpen the analysis in [8] of the space Z . As is true for the complex plane itself, nonstandard points outside the extension of every standard bounded set are remote and form a single end. This can be proved, for example, using our next section since C is topologically the product of two copies of the real line. Now if γ is an irrational number between 0 and 1, then points of ∗ C that have not been removed in the monad of γ are mapped by ϕ onto γ. Points in ∗ C in the monad of a removed rational number q ∈ (0, 1) are remote and form a single end. Open discs in Z that are symmetric about the real axis and intersect that axis in a set with irrational minimum and maximum values are NES. The resulting end compactification is homeomorphic with the extended complex plane, i.e., the Riemann Sphere.
5.4 Product Spaces Direct products of sets play a significant role in much of mathematics. For example, they are involved in defining the notion of an algebra, and hence in the study of topological algebras, including but not limited to, the classical structures of analysis, such as topological groups, topological rings, topological vector spaces, and such. Here we describe some connections of our previous sections to products of topological spaces and the compactifications of such product spaces. For each α in some indexing set I, let X α be a given topological space, and consider the corresponding space X α supplied with the product topology. Recall α∈I
that the projection mapping defined from such a product space onto a factor of that space is an open mapping, meaning that it takes any open subset of the product onto an open subset of that factor. X α , let pα denote the projection of p onto X α . That is, For any point p in α∈I
p = ( pα )α∈I . Let st (I) denote the collection of all standard indices in ∗ I. For each α ∈ st (I), let μα ( pα ) be the monad of pα in X a . The monad of p in the product space is the product
5 General and End Compactifications
175
μα ( pa ) ×
X α.
α∈∗ Ist(I )
α∈st(I )
It is not difficult to see then that a point p in the nonstandard extension of a product is remote if and only if there exists some α ∈ st (I) such that pα is remote. To apply our results on ends, we now assume that each X α is connected and locally connected. X α is connected if and Proposition 5.4.1 Fix β ∈ I and A ⊆ X β . Then A × α =β
only if A is a connected subset of X β . Proof Let U and V be a pair of nonempty open sets in the product space that form a disconnection of A × X α . Note that the projection of U and of V onto X β α =β
and each X α must be nonempty, and U ∪ V covers A ×
X α . For each α = β,
α =β
the projections of U and of V onto X α have a nonempty intersection since X α is connected. Moreover, the projections on X β form a disconnection of A. The desired result follows. Theorem 5.4.2 Assume that at least two spaces in the family X α , α ∈ I, are nonX α has exactly one end. compact. Then the product space α∈I
Proof We reproduce the proof given in [7]. Given a remote point pβ in ∗ X β where β ∈ st (I), the product pβ × ∗ X α is internally connected and contains no α =β
nearstandard point. Similarly, given a remote point pγ in ∗ X γ where γ ∈ st (I) and γ = β, the product pγ × ∗ X α is internally connected and contains no α =γ
nearstandard point. These two connected sets have points in common, namely those with projection pβ in ∗ X β and projection pγ in ∗ X γ . Therefore, in terms of the equivalence relation for ends, all points of pβ × ∗ X α are equivalent to all
points of pγ ×
∗
α =γ
α =β
X α . Moreover, as noted above, a point is remote in ∗
if and only if the projection pβ is remote for at least one β ∈ st (I).
Xα
α∈I
Now let p be any point in the nonstandard extension of the product, and assume that exactly one index, β, corresponds to a noncompact factor of the product space in question. Then p is remote if and only if pβ is remote. Also, it is plain to see that an internal set in the nonstandard extension of the product is (internally) connected and contains no nearstandard points if and only if its projection onto ∗ X β shares that property. Consequently, we have
176
M. Insall et al.
Theorem 5.4.3 Suppose in the above setting X α is compact for each α = β and X β is not compact. Then the number of ends for X α is the number of ends for X β . α∈I
Remark 5.4.4 Work that remains in our research on compactifications includes applications to pre-topologies (see [14]), to box products and proximity spaces, and to compactifications of topological algebras.
References 1. R. Diestel, D. Kühn, Graph-theoretical versus topological ends of graphs. J. Comb. Theory Ser. B 87, 197–206 (2003) 2. J. Dugundji, Topology (Allyn and Bacon Inc. Boston, 1966) 3. H. Freudenthal, Uber die Enden topologischer Räume und Gruppen. Math. Z. 33, 692–713 (1931) 4. I. Goldbring, Ends of groups: a nonstandard perspective. J. Log. Anal. 3(7), 1–28 (2011) 5. R. Halin, Über unendliche Wege in Graphen. Math. Ann. 157, 125–137 (1964) 6. H. Hopf, Enden offener Räume unendliche diskontinuierliche Gruppen. Comment. Math. Helv. 16, 81–100 (1943/4) 7. M. Insall, P.A. Loeb, M.A. Marciniak, End compactifications and general compactifications. J. Log. Anal. 6(7), 1–16 (2014). doi:10.4115/jla.2014.6.7 8. M. Insall, M.A. Marciniak, Nets defining ends of topological spaces. Top. Proc. 40, 1–11 (2012) 9. H.J. Keisler, An infinitesimal approach to stochastic analysis. Mem. Am. Math. Soc. 48, 297 (1984) 10. P.A. Loeb, Compactifications of Hausdorff spaces. Proc. Am. Math. Soc. 22, 627–634 (1969) 11. M.A. Marciniak, Holomorphic extensions in smooth toric surfaces. J. Geom. Anal. 22, 911–933 (2012) 12. A. Robinson, Non-standard Analysis (North-Holland, Amsterdam, 1966) 13. A. Robinson, Compactification of groups and rings and nonstandard analysis. J. Symb. Log. 34, 576–588 (1969) 14. J. Šlapal, A Digital pretopology and one of its quotients. Top. Proc. 39, 13–15 (2012) 15. S. Salbany, T. Todorov, Nonstandard analysis in topology: nonstandard and standard compactifications. J. Symb. Log. 65, 1836–1840 (2000) 16. S. Salbany, T. Todorov, Lecture Notes: Nonstandard Analysis in Topology, arXiv:1107.3323
Part IV
Measure and Probability Theory
Chapter 6
Measure Theory and Integration Horst Osswald
6.1 Introduction Loeb measures have been applied in various fields of real analysis. In his fundamental paper [15] Peter Loeb has given the first applications to probability theory. Also developed at that time (and published later in [16]) was an application constructing representing measures in potential theory. (See Sect. 3.12.2.) Fix an unlimited positive integer H and put T := H1 , H2 , . . . , H . This set T is infinite, but ∗ finite, and can be interpreted as a “time line”, which is closely related to the continuous time line [0, ∞[, because each real number between 0 and ∞ is infinitely close to some t ∈ T . The sample space ∗ RT of our probability spaces is also fixed, where ∗ RT is the internal set of all internal H 2 -tuples of elements in ∗ R. We also fix an internal stochastic process B : ∗ RT × T → ∗ R, defined by B (X, t) := s∈T, s≤t X s . However, in case of the infinite-dimensional Brownian motion, ∗ R is replaced by a hyperfinite-dimensional Euclidean space. The value B(X, t) can be understood as the profit (or loss) at time t during the game X ∈ ∗ RT . This profit or loss depends on the special probability measure we have to choose on the sample space ∗ RT . Let us start with Peter Loeb’s construction of Poisson processes from a hyperfinite model of tossing an extremely manipulated coin. Fix a standard β > 0. Let l 1 be the internal Borel probability measure on ∗ R, concentrated on {0, 1}, where l 1 ({0}) = 1 − Hβ and l 1 ({1}) = Hβ . Let l be the internal H 2 -fold product of l 1 on ∗ RT . Note that for each X ∈ {0, 1}T
β l ({X }) = 1 − H
m H 2 −m β · , H
H. Osswald (B) Mathematisches Institut der Universität München, Theresienstr. 39, 80333 Munich, Germany e-mail: [email protected] © Springer Science+Business Media Dordrecht 2015 P.A. Loeb and M.P.H. Wolff (eds.), Nonstandard Analysis for the Working Mathematician, DOI 10.1007/978-94-017-7327-0_6
179
180
H. Osswald
where m is the number of zeros occurring in X . Using that (X, t) → s≤t X s − El 1 x is an l-square integrable martingale, we will see that for l L -almost all X ∈ ∗ RT and all r ∈ [0, ∞[ Bl (X, r ) := olim ◦ B(X, s),
(+)
s↓r
is well defined. Here limo s↓r denotes the right hand limit at r . Moreover, Loeb has shown that Bl is a Poisson process of rate β. We will see that Bl is a càdlàg process, which means that it is right continuous and has left hand limits l L -almost surely. The next convincing example of the usefulness of Loeb measures is Bob Anderson’s [2] construction of Brownian motion from a hyperfinite model of tossing an unbiased coin now. Let a 1 be the internal Borel probability measure on ∗ R, concentrated on − √1 , √1 , setting H
H
a1
1 √ H
=
1 = a1 2
1 −√ H
.
Let a be the H 2 -fold product of a 1 on ∗ RT . Then for all X ∈ a ({X }) :=
√1 , − √1 H H
T
1 . 2 ( 2 H )
Anderson has shown that for a L -almost all X ∈ ∗ RT and all limited t ∈ T , Ba : ∗ RT × [0, ∞[→ R, (X, ◦ t) →
◦
B(X, t)
(++)
is well defined and continuous. Moreover, he has proved that Ba is the onedimensional Brownian motion. In view of this result, the process B is not only a model for tossing an unbiased coin, but B also describes a random walk; that is the motion of a particle moving along the real axis in √1 steps with the probability of a left—or a right step being H
equal to 21 . Of course, we could have defined Ba using the equation under (+). Then Ba , defined by (++), were a continuous version of Ba , defined by (+). The internal process B is a Brownian motion for the internal measure a with an infinitesimal error, see Exercise 11.5 in [21]. Cutland [6] has used a measure C on ∗ RT for which B is a correct internal Brownian motion, see Proposition 11.2.1 in [21]: let C be the internal H 2 -fold product of the internal centered Gaußian measure C 1 on ∗ R of variance H1 , i.e.,
C (A) := 1
e A
− H2 x 2
dx
H . 2π
6 Measure Theory and Integration
181
Cutland has shown that the process BC := Ba is C L -a.s. well defined, continuous and the one-dimensional Brownian motion. Here is the difference between BC and Ba , BC is well defined C L -a.s., while Ba is well defined a L -a.s. However, both processes are the Brownian motion. Similar results hold for arbitrary one-dimensional Lévy processes. Let L and be two possibly very different Lévy processes. It is shown in Chap. 15 of [21] that there exist internal Borel probability measures m 1 , μ1 on ∗ R such that L can be identified with Bm and with Bμ . Here m and μ are again the H 2 -fold internal products of m 1 , μ1 , respectively, and Bm and Bμ are given by equation (+). Then Bm is well defined m L -almost surely and Bμ is well defined μ L -almost surely, where m L and μ L are the Loeb probability measures over m and μ. Note that the processes Bm and Bμ are standard parts almost surely of the same internal process B; almost surely with respect to possibly very different measures. The processes Bμ and can be identified and, of course, Bm and L, because they satisfy the same Lévy triplet. Lévy triplets characterize Lévy processes via the Lévy Khintchine formula, the Fourier transformation of Lévy processes. Lévy triplets for one-dimensional Lévy processes are of the form (a, C, ρ) where a, C ∈ R with C ≥ 0 and ρ is a Borel measure on R, the so-called Lévy measure. It is in general infinite and can be obtained from a suitable Loeb measure on ∗ R. While the Lebesgue measure is infinite in the neighborhood of infinite, the Lévy measure is infinite in the neighborhood of zero, if the Lévy measure itself is infinite. In case of Brownian motion the Lévy triplet is (a, C, ρ) = (0, 1, A → 0), in case of the Poisson process of rate β (a, C, ρ) = (β, 0, A −→ β · 1 A (1)). Each Lévy triplet can be satisfied by a process B◦ , defined under (+), where ◦ is the internal product on ∗ RT of a certain internal probability measure ◦1 on ∗ R. For details see the work of Lindstrøm [14] or [21], Chap. 15. In Sect. 6.2.6 we will see that Lebesgue measure on [0, ∞[ is equivalent to a Loeb counting measure on T . All the preceding expositions are striking examples of the usefulness of Loeb measures. In Chap. 7 Malliavin calculus will be studied for the infinite-dimensional Brownian motion, extending Cutland’s [6] and Cutland and Ng’s [7] results for the onedimensional case, following [21]. We also study Malliavin calculus for symmetric Poisson processes, which are, from a certain point of view, more subtle than the non-symmetric Poisson processes. In the following fix a superstructure V of cardinality κ such that at least the real numbers are individuals and a monomorphism ∗ from V into a κ+ saturated nonstandard model W . Given a measure μ, we will say that a property holds μ-a.e. (almost everywhere) if it holds outside a set of μ-measure 0. If μ is a probability measure, we shall write μ-a.s. (almost surely) instead of μ-a.e.
182
H. Osswald
6.2 Loeb Measures Loeb spaces (, L μ (C), μ L ) are—in general—finite σ-additive complete measure spaces in the usual standard sense. They enjoy the following properties. The σ-algebra L μ (C) is generated by an internal algebra C. By saturation, this algebra is rich enough to guarantee that each element of L μ (C) is equivalent to an element of C (see (+) below). Moreover, the σ-additive measure μ L on L μ (C) is infinitely close to an internal measure μ defined on the generating set C (see (++) below). In particular, if C is ∗ finite, then μ L may be infinitely close to a counting measure μ. In Sect. 6.2.6 we will see that, for instance, the Lebesgue measure on [0, ∞[n is σ-isomorphic to a now infinite Loeb measure on a ∗ finite set. Therefore, the Lebesgue measure can be treated in a certain sense as though it were a counting measure.
6.2.1 Loeb Measure Spaces Let be an internal nonempty set in W and let C be an internal algebra on . Recall that W is a nonstandard model, introduced at the beginning of Sect. 2.10. By internal induction, one can show that for each k ∈ ∗ N and each internal k-tuple (A1 , . . . , Ak ) in C, A1 ∪ · · · ∪ Ak ∈ C and A1 ∩ · · · ∩ Ak ∈ C. Assume that μ is an internal finitely additive measure defined on C with values in ∗ [0, S] for some S ∈ R. Again by internal induction, μ(A1 ∪ · · · ∪ Ak ) = μ(A1 ) + · · · + μ(Ak ) for each k ∈ ∗ N and each internal k-tuple (A1 , . . . , Ak ) in C such that Ai ∩ A j = ∅ for i = j. Moreover, the set function ◦
μ : C A → ◦ (μ(A))
is a finitely additive measure on the algebra C with values in [0, S]. From Proposition 2.9.7 (1) it follows that ◦ μ is even σ-additive on the algebra C. By Caratheodory’s extension theorem, ◦ μ can be extended to a measure on the σ-algebra σ(C) generated by C, that is, σ(C) is the intersection of all σ-algebras on containing the elements of C. The completion of this measure is called the Loeb measure associated with μ. We shall now present a more informative construction of Loeb measures, combining both methods in the articles of Loeb [15, 17]: An arbitrary, possibly external, subset N ⊆ is called a μ L -nullset, if μouter (N ) := inf
◦
μ(A) | A ∈ C, N ⊆ A = 0.
Set Nμ L := {N ⊆ | N is a μ L -nullset} .
6 Measure Theory and Integration
183
Lemma 6.2.1 (a) Each subset of a μ L -nullset is a μ L -nullset. (b) The set of μ L -nullsets is closed under countable unions. Proof (a) is obvious. To prove (b), assume that N1 , . . . , Nk , . . . ∈ Nμ L . In order to show that k∈N Nk ∈ Nμ L , fix an ε ∈ R+ . For each k ∈ N there exists an Ak ∈ C with Nk ⊆ Ak and ◦ μ(Ak ) < 2εk , thus μ(Ak ) < 2εk . Set Bk := A1 ∪ · · · ∪ Ak . Then μ(Bk ) < ε. Now we apply Theorem 2.10.18. Let (Bk )k∈ ∗ N be an internal extension of (Bk )k∈N with μ(Bk ) < ε for all k ∈ ∗ N. By the Spillover Principle, there exists K ∈ ∗ N with Bk ⊆ Bk+1 and μ(Bk ) < ε for all k ≤ K . an unlimited Since k∈N Nk ⊆ k∈N Ak ⊆ B K and μ(B K ) < ε, we conclude that k∈N Nk is a μ L -nullset. In the following we will use the techniques in the proof of Lemma 6.2.1 over and over again. Then we will often simply write: by saturation … If B ⊆ and A ∈ C, then A is called a μ L -approximation of B if the symmetric difference AB := (A \ B) ∪ (B \ A) of A and B is a μ L -nullset. We define L μ (C) := {B ⊆ | B has a μ L -approximation A ∈ C} ,
(+)
μ L (B) := ◦ μ(A) if A is a μ L -approximation of B.
(++)
Theorem 6.2.2 (Loeb [15]) (1) (2) (3) (4) (5)
μ L is well defined, that is, μ L does not depend on the chosen μ L -approximation. L μ (C) is a σ-algebra with C ⊆ L μ (C). μ L : L μ (C) → [0, S] is σ-additive. L μ (C) is complete. A subset B ⊆ belongs to L μ (C) iff for each ε ∈ R+ there exist A, A ∈ C such that A ⊆ B ⊆ A and μ(A \A) < ε.
Proof (1) Assume that A and A are μL -approximations of B ⊆ . Then AA ∈ Nμ L , because AA ⊆ (AB) ∪ BA ∈ Nμ L . Since AA ∈ C, wehave μ(AA ) 0. Since A is the disjoint union of A \ A) and (A \ A \ A , we have μ(A) μ(A \ A) + μ(A) − μ(A \ A ) = μ(A ). Therefore, μ(A) μ(A ), thus, ◦ μ(A) = ◦ μ(A ). (2) Since each A ∈ C is a μ L -approximation of A, we obtain C ⊆ L μ (C). We will now show that L μ (C) is a σ-algebra. Since ∈ C, ∈ L μ (C). Fix B, B ∈ L μ (C) with μ L -approximations A, A ∈ C of B, B , respectively. Then A\A is a μ L -approximation of B\B and A ∩ A is a μ L -approximation of B ∩ B , because of the lemma and because
A \ A B \ B ∪ A ∩ A B ∩ B ⊆ (AB) ∪ (A B ) ∈ Nμ L .
184
H. Osswald
Fix a sequence (Bk )k∈N in L μ (C) such that Bi ∩ B j = ∅ for i = j, and for each Bk fix a μ L -approximation Ak . We may assume that Ai ∩ A j = ∅ for i = j, because if Ck is a μ L -approximation of Bk , k ∈ N, then Ck \(C1 ∪ · · · ∪ Ck−1 ) is a μ L -approximation of Bk . The latter is the case, because (recall that the Bi are pairwise disjoint) Bk (Ck \ (C1 ∪ · · · ∪ Ck−1 )) ⊆
k
(Bi Ci ) ∈ Nμ L .
i=1
Since
k i=1
◦ μ(A
i)
= ◦ μ(
k i=1
s :=
Ai ) ≤ ◦ μ() ≤ S for all k ∈ N,
∞
◦
μ(Ak ) ∈ [0, S].
k=1
By 6.2.1), there is an A ∈ C with Ak := saturation (see the proof of Lemma 1 k∈N Ak ⊆ A and μ(A) < s + k for each k ∈ N. It follows that +μ(A) s. Ak , fix ε ∈ R . We may In order to show that A is a μ L -approximation of choose k ∈ N such that s − ◦ μ(Ak ) < ε where Ak := A1 ∪ · · · ∪ Ak . It follows that Ak ⊆ A \ Ak ∈ C and μ(A \ Ak ) s − ◦ μ(Ak ) < ε. A Ak = A \ Moreover, A is a μ L -approximation of Lemma 6.2.1, A
Bk ⊆
Bk :=
k∈N
Bk , because, by
Ak ∈ Nμ L . (Ak Bk ) ∪ A
This proves that Bk ∈ L μ (C). (3) We shall now show that μ L is σ-additive. Choose Bk and Ak , k ∈ N, and A as in the proof of (2). Then μL (
Bk ) = ◦ μ(A) = s =
∞ k=1
◦
μ(Ak ) =
∞
μ L (Bk ).
k=1
(4) Assume that μ L (B) = 0 and N ⊆ B. Fix a μ L -approximation A of B. Then A is also a μ L -approximation of N , because A, AB ∈ Nμ L and N A ⊆ A ∪ (AB). It follows that N ∈ L μ (C). (5) “⇒” Fix B ∈ L μ (C), a μ L -approximation C ∈ C of B, and an ε ∈ R+ . Then there exists a D ∈ C with CB ⊆ D and μ(D) < ε. We now have C \ D ⊆ B ⊆ C ∪ D and μ ((C ∪ D) \ (C \ D)) ≤ μ(D) < ε.
6 Measure Theory and Integration
185
“⇐” Suppose that for each n ∈ N there are An , An ∈ C with An ⊆ B ⊆ An and such that μ(An \An ) < n1 . By saturation, there is an A ∈ C with An ⊆ A ⊆ An for each n ∈ N. Fix ε ∈ R+ and n ∈ N with n1 < ε. Then AB ⊆ An \ An ∈ C and μ(An \ An ) <
1 < ε. n
This proves that A is a μ L -approximation of B, thus, B ∈ L μ (C). Definition 6.2.3 The measure space (, L μ (C), μ L ) is called the Loeb space over (, C, μ). The measure μ L is called the Loeb measure over μ. The interested reader can find information about vector valued Loeb measures and their applications in, for example, [18, 20].
6.2.2 Loeb Measures over Gaußian Measures In this section we present a first example of a Loeb measure and give a useful and intuitive characterization of measurable norms, which build the basic for infinitedimensional Gaußian measures and the Malliavin calculus on abstract Wiener spaces. Fix a separable real Hilbert space (H, ·) inside the standard model V . Let E denote the set of all finite-dimensional subspaces of H. Fix E ∈ E and an orthonormal basis (e1 , . . . , ed ) of E. The centered Gaußian measure γ E of variance 1 is defined on E by setting for all Borel sets B ⊆ E γ E (B) :=
1 √ 2π
d
(x1 ,...,xd )∈Rd |
d
i=1 xi ei ∈B
e
− 21
d
2 i=1 xi
d(x1 , . . . , xd ).
Note that γ E does not depend on the orthonormal basis of E (see Lemma 4.2.1 in [21]). Note that γ assigns to each E ∈ E the Gaußian measure γ E on E of variance 1. By Transfer, ∗ γ assigns to each E ∈ ∗ E the internal Gaußian measure (∗ γ) E on E of variance 1. Orthogonality on H is denoted by ⊥. A norm |·| on H is called Gross measurable (see [9]) if for all n ∈ N there exists an E n ∈ E such that for all E ∈ E with E ⊥ E n 1 1 < . γ E x ∈ E | |x| ≥ n n Proposition 6.2.4 Fix a norm |·| on H. The following statements are equivalent: (a) |·| is Gross measurable. (b) For all E ∈ ∗ E with E ⊥ ∗[H] (which means that E ⊥ ∗ a for all a ∈ H),
186
H. Osswald
∗ E x∈E| γ
L
|x| 0 = 0.
This means that the Gaußian Loeb measure on ∗ finite-dimensional subspaces of ∗ H, orthogonal to ∗ [H], is concentrated on the infinitesimals. Proof “(a) ⇒ (b)” Let |·| be Gross measurable and let E ⊥ with E ∈ ∗ E. ∗[H] E 1 1 ∗ ∗ It suffices to show that for n ∈ N, ( γ) x ∈ E | |x| ≥ n < n . There exists an E n ∈ E such that 1 1 < . ∀F ∈ E, F ⊥ E n γ F x ∈ F | |x| ≥ n n By Transfer, and since E ⊥ ∗ E n , we obtain the desired result. “(b) ⇒ (a)” Assume (a) is not true. Then there exists an n ∈ N such that for all E ∈ E there exists an F ∈ ∗ E, F ⊥ ∗ E with (∗ γ) F x ∈ F | ∗ |x| ≥ n1 ≥ n1 . ∗ E with ∗ E ⊥ F for all E ∈ E and By saturation, there exists an1 F ∈ F 1 ∗ ∗ ( γ) x ∈ F | |x| ≥ n ≥ n . But then F ⊥ ∗[H]. It follows that
∗ F
γ
L
x∈F|
∗
|x| 0 ≥
◦∗ F
γ
x∈F|
∗
|x| ≥
1 n
≥
1 , n
Thus (b) is not true.
6.2.3 Loeb Measurable Functions In this section we will show that L μ (C)-measurable functions are infinitely close to internal C-measurable functions. Fix a separable metric space (M, d) and assume that M is a set in the standard model V. Then the metric d is also a set in V. Recall that a function f : → M is L μ (C)-measurable if f −1 [G] ∈ L μ (C) for each open set G ⊆ M. By transfer, an internal function F : → ∗ M is called C-measurable if F −1 [G] ∈ C for each ∗ open set G ⊆ ∗ M. If F is C-measurable and the range of F is ∗ finite, then F is called C-simple. A C-measurable function F : → ∗ M is called a lifting of f : → M if f (X ) F(X ) for μ L -almost all X ∈ , that is, if F and f are equal up to a nullset and an infinitesimal error. Theorem 6.2.5 (Loeb [15], Anderson [2]) A function f : → M is L μ (C)measurable iff f has a lifting. We even may assume that the lifting has a ∗ finite range. Proof “⇒” Assume that f is L μ (C)-measurable. Fix a countable open base (G n )n∈N of M. Since Bn := f −1 [G n ] ∈ L μ (C), Bn has a μ L -approximation An ∈ C. It ∗ ∗ suffices to find a C-measurable function F : → M (with finite range) such that for all x ∈ \ n∈N An Bn the following implication holds: If f (x) ∈ G n , then
6 Measure Theory and Integration
187
F(x) ∈ ∗ G n , that is, x ∈ f −1 [G n ] = Bn ⇒ F(x) ∈ ∗ G n . Now, if x ∈ / An Bn , then x ∈ Bn iff x ∈ An . Therefore, we try to find an F such that x ∈ An ⇒ F(x) ∈ ∗ G n for each n ∈ N. However, since there may exist i 1 , . . . , i k ∈ N with Ai1 ∩ · · · ∩ Aik = ∅ and ∗ G i1 ∩ · · · ∩ ∗ G ik = ∅, such a function F cannot exist. We are therefore led to consider coarser μ L -approximations An of Bn : By recursion, we define a sequence (An )n∈N in C as follows. Set A1 if G 1 = ∅ (which is equivalent to ∗ G 1 = 0) A1 := ∅ if G 1 = ∅. Then A1 is a μ L -approximation of B1 and A1 = ∅ implies ∗ G 1 = ∅. Assume that k ≥ 1 and A1 , . . . , Ak−1 are already defined so that Ai is a μ L -approximation of Bi and Ai1 ∩ · · · ∩ Aim = ∅ implies ∗ G i1 ∩ · · · ∩ ∗ G im = ∅ for all i 1 , . . . , i m ∈ {1, . . . , k − 1}. Define Ak := Ak \
Ai 1 ∩ · · · ∩ Ai m .
i 1 ,...,i m
Notice that Ak ∈ C and that for all n ∈ N and i 1 , . . . , i n ∈ {1, . . . , k} ∗
G i1 ∩ · · · ∩ ∗ G in = ∅ ⇒ Ai1 ∩ · · · ∩ Ain = ∅.
k−1 Moreover, since Ak Bk ⊆ Ak Bk ∪ i=1 (Ai Bi ) ∈ Nμ L , we conclude that Ak is a μ L -approximation of Bk . In order to apply saturation, we will show that for each n ∈ N there exists a C-simple function F : → ∗ M such that F[Ai ] ∈ ∗ G i for all i = 1, . . . , n. Let (Aσ )σ∈J be the partition of given by (A1 , . . . , An ); here J is the set of all strictly increasing finite tuples σ = (i 1 , . . . , i k ) in {1, . . . , n} and Aσ := Ai1 ∩ · · · ∩ Aik ∩
\ Aj.
j∈{1,...,n}\{i 1 ,...,i k }
If σ = ∅, then Aσ = \(A1 ∪ · · · ∪ An ) . For each σ = (i 1 , . . . , i k ) = ∅ in J such that ∗ G i1 ∩ · · · ∩ ∗ G ik = ∅ choose a bσ ∈ ∗ G i1 ∩ · · · ∩ ∗ G ik and define F(x) := bσ for each x ∈ Aσ . Choose b ∈ M and define F(x) := b if x ∈ \(A0 ∪ · · · ∪ An ). It is clear that F is defined for all x ∈ / A0 ∪ · · · ∪ An . If x ∈ A0 ∪ · · · ∪ An , then there exists a σ = (i 1 , . . . , i k ) = ∅ in J with x ∈ Aσ . Since Ai1 ∩ · · · ∩ Aik = ∅, ∗G ∩ · · · ∩ ∗G ∗ ∗ i1 i k = ∅, thus F : → M is well defined and F[Ai ] ∈ G i for all i = 1, . . . , n. By saturation,there exists a C-simple function F : → ∗ M / with F[Ai ] ∈ ∗ G i for all i ∈ N. We have thus obtained the following: Let x ∈ B and let G be an open set with f (x) ∈ G. Then there exists ∈ N (A ) n n μ L n∈N an n ∈ N such that f (x) ∈ G n ⊆ G; thus x ∈ f −1 [G n ] = Bn , which implies that x ∈ An . It follows that F(x) ∈ ∗ G n ⊆ ∗ G. This proves that F(x) f (x).
188
H. Osswald
“⇐” Suppose now that F is a lifting of f and assume that G is an open set in M. Since M is a separable metric space, there exists a sequence (G n )n∈N of open sets G n such that G = n∈N G n = n∈N G n , where G n is the closed hull of G n . It follows that x ∈ | F(x) ∈ ∗ G n ⊆ {x ∈ | f (x) F(x)} ∈ Nμ L . f −1 [G] n∈N
Since
n∈N
x | F(x) ∈ ∗ G n ∈ L μ (C) and L μ (C) is complete, f −1 [G] ∈ L μ (C).
6.2.4 Loeb Spaces over the Product of Internal Spaces Fix two internal measure spaces (, C, μ) and , C , μ such that μ() and μ ( ) are limited. A set of the form A × A with A ∈ C and A ∈ C is called a measurable rectangle and C ⊗ C denotes the ∗ σ-algebra generated by the internal algebra of all ∗ finite disjoint unions of measurable rectangles. The internal product measure of μ and μ on C ⊗ C is denoted by μ ⊗ μ . Let C ⊗ C be the completion of C ⊗ C with respect to μ ⊗ μ ; the corresponding extension of the measure μ ⊗ μ is also denoted by μ ⊗ μ . Analogous notation shall be used for the standard product. The next result shows that the usual product L μ (C) ⊗ L μ (C ) of the Loeb σ-algebras L μ (C) and L μ (C ) is contained in the Loeb product L μ⊗μ (C⊗ C ). In general, this inclusion is strict (examples have been given by Hoover and Norman). In [23] Yeneng Sun characterizes the Loeb spaces for which the inclusion is strict (see Proposition 8.4.5). In [4] the reader can find concrete examples and it is shown how extremely large the Loeb product space is compared to the product of Loeb spaces. Proposition 6.2.6 (Anderson [2]) If B ∈ L μ (C)⊗L μ (C ), then B ∈ L μ⊗μ (C ⊗ C ) and μ ⊗ μ L (B) = μ L ⊗ μ L (B).
Proof It is easy to see that × N ∈ N(μ⊗μ ) L , N × ∈ N(μ⊗μ ) L whenever N ∈ NμL , N ∈ Nμ L , respectively. Suppose that X ∈ L μ (C) and Y ∈ L μ (C ). By Sect. 6.2.1 (+), there exist U ∈ C and V ∈ C such that U X ∈ Nμ L and V Y ∈ NμL . Since (U × V ) (X × Y ) ⊆ (U X ) × ∪ ( × (V Y )) ∈ N(μ⊗μ ) L , we obtain X × Y ∈ L μ⊗μ (C ⊗ C ) and, μ ⊗ μ L (X × Y ) μ ⊗ μ (U × V ) =
μ(U ) · μ (V ) μ L (X ) · μL (Y ) = μ L ⊗ μL (X × Y ).
6 Measure Theory and Integration
189
It follows that L μ (C) ⊗ L μ (C ) ⊆ L μ⊗μ (C ⊗ C ) and μ ⊗ μ L coincides with μ L ⊗ μL on L μ (C) ⊗ L μ (C ). Finally, let N ⊆ M ∈ L μ (C) ⊗ L μ (C ) with μ L ⊗ μL (M) = 0. We have seen that M ∈ N(μ⊗μ ) L . Since Loeb spaces are complete N ∈ L μ⊗μ (C ⊗ C ) and μ ⊗ μ L (N ) = 0.
6.2.5 The Hyperfinite Time Line T Important examples of Loeb spaces are the hyperfinite ones. Fix a hyperfinite time line T := H1 , H2 , . . . , H where H ∈ ∗ N is unlimited. For technical reasons we choose H := G! where G is unlimited. It follows that each standard positive integer divides H. For each t ∈ T define Tt := H1 , H2 , . . . , t . Notice that [0, 1] = {◦ t | t ∈ T1 }. Fix a standard d ∈ N and define the internal counting measure νtd on ∗ P(Ttd ) by setting νtd (B) := |B| ·
1 Hd
for each internal subset B ⊆ Ttd , where |B| denotes the ∗ finite number of elements d . Since of A. If d = 1, we shall write νt for νtd , and, if t = H , we shall write ν d for ν H we have studied finite Loeb spaces so far, fix a limited t ∈ T . The Loeb space over d (Ttd , ∗ P(Ttd ), νtd ) is denoted by (Ttd , L ν d , νtd L ). By Sect. 6.2.4, L νt ⊆ L ν d , t t d where L νt denotes the d-fold product of the Loeb σ-algebras L νt in the usual sense. Since T d is a ∗ finite set, each internal function F : T d → ∗ R is, by Theorem 2.8.4, ∗ P(T d )-measurable and ν d -integrable, and
Td
Fdν d =
F(t1 , . . . , td )
(t1 ,...,td )∈T d
1 . Hd
Since for d, m ∈ N, ∗ P(T d ) ⊗ ∗ P(T m ) = ∗ P(T d+m ) and ν d ⊗ ν m = ν d+m (here we identify ((x1 , . . . , xn ), (xn+1 , . . . , xn+m )) with (x1 , . . . , xn+m )), we obtain, using Sect. 6.2.4, the following result. Proposition 6.2.7 Fix standard m, d ∈ N and a limited t ∈ T . Then L ν d ⊗ L νtm is t a subset of L ν d+m and for each B ∈ L ν d ⊗ L νtm , t
t
νtd
L
⊗ νtm L (B) = νtd ⊗ νtm (B) = νtd+m (B). L
L
190
H. Osswald
6.2.6 Lebesgue Measure as a Counting Measure In a further application, we shall construct a Loeb counting measure ν d L on the extends the Lebesgue measure λd on hyper-finite set T d , d ∈ N, which strictly d [0, ∞[ . The standard part map st : n∈N Tnd → [0, ∞[d is defined by setting st (t1 , . . . , td ) := (◦ t1 , . . . ,◦ td ). The set
d n∈N Tn
is the limited part of T d . Define for all limited s ∈ T sts : st Tsd
Each mapping f defined on [0, ∞[d can be converted to a mapping f T on the limited part of T d by setting f T (t1 , . . . , td ) := f
◦
t1 , . . . , ◦ td .
Occasionally we shall use the notion “lifting” in a slightly modified way. Fix a separable metric space (M, δ) inside our superstructure V . Let us call an internal d d function F : T d → ∗ M a lifting f : [0, ∞[ → M if F Tt dis a lifting of f Tt of d for all limited t ∈ T , that is, for νt L -almost all (t1 , . . . , td ) ∈ Tt F(t1 , . . . , td ) f
◦
t1 , . . . , ◦ td .
The following result shows the well known close relationship between νnd L and Lebesgue measure λd on [0, n]d (see Albeverio et al. [1] Theorem 2.3.4 and Proposition 2.3.5): The image measure of νnd L by the standard part map stn on Tnd is the Lebesgue measure λd on [0, n]d . Denote by Lebd the set of Lebesguemeasurable sets in Rd . Theorem 6.2.8 Fix standard d, n ∈ N. (a) A subset B ⊂ [0, n]d is Lebesgue measurable iff stn−1 [B] ∈ L νnd , in which case λd (B) = νnd (st −1 [B]). L
(b) A function f : [0, n]d → M is Lebesgue measurable iff f has a lifting F : Tnd → ∗ M. Proof (a) “⇒” By standard measure theory concerning product measures and, since, d by Sect. 6.2.5, νnd L = (νn )dL on L νn , it suffices to show that for each interval I ⊆ [0, n], stn−1 [I ] ∈ L νn and (νn ) L (stn−1 [I ]) = λ(I ). Let a, b, a ≤ b be the end-points of I . Set ]a, b[Tn := {t ∈ Tn | a < t < b} . We will show that ν(]a, b[Tn ) b − a.
6 Measure Theory and Integration
191
For a = b this is obvious. Let a < b. Choose l, m ∈ ∗ N such that and (l+m−1) < b ≤ (l+m) H H . Then ν(]a, b[Tn ) =
(l−1) H
≤a<
l H
m l +m l = − b − a. H H H
In particular, c := {t ∈ Tn | t c} is a (νn ) L -nullset for all c ∈ [0, n]. It follows that a ∪ b = 0. a ∪ b with (νn ) L stn−1 [I ] ]a, b[Tn ⊆ −1 ◦ Therefore, st−1 n [I ] ∈ L νn and (νn ) L (stn [I ]) = νn (]a, b[Tk ) = b − a = λ(I ). −1 Since L νk is complete, st [I ] ∈ L νk and (νn ) L (stn−1 [I ]) = λ(I ). “⇐” Fix B ⊆ [0, n]d with stn−1 [B] ∈ L νnd . Then, setting I := [0, n],
stn−1 [I d \ B] = Tnd \ stn−1 [B] ∈ L νnd . In order to show that B ∈ Leb(I d ), fix a standard ε > 0. By Theorem 6.2.2 (5), there exist internal A , C ⊆ Tnd such that A ⊆ stn−1 [B] and νnd (stn−1 [B] \ A ) < ε, L −1 n C ⊆ stn [I \ B] and νnd (stn−1 [I d \ B] \ C ) < ε. L
Now A := stn [A ] and C := stn [C ] are compact subsets of I n , thus Borel sets in I d . Moreover, A ⊆ B ⊆ I d \C. By “⇒”, we obtain λd ((I d \ C) \ A) = νnd (stn−1 [(I d \ C) \ A]) ≤ L
νnd stn−1 [I d \ B] \ C + νnd stn−1 [B] \ A < 2ε. L
L
Therefore, for each δ > 0 there exists an open set G := I d \C in I d and a closed set A in I d such that A ⊆ B ⊆ G and λd (G\A) < δ, which proves that B ∈ Leb[0, n]d . (b) Fix f : [0, n]d → M. By Part (a), the Lebesgue measurability of f is equivalent to the L νnd -measurability of f ◦ stn . By Theorem 6.2.5, f ◦ stn is L νnd measurable iff f ◦ stn has a lifting, which means that f has a lifting. d d Let us now extend the preceding result to the whole timeline T and [0, ∞[ by converting ν d to a measure ν d L on T d as follows: Denote by L ν d the set of all Loeb measurable B ⊆ T d , which means that B ∩ Tnd ∈ L νnd for all n ∈ N. Define for B ∈ L ν n ν d (B) := lim νnd (B ∩ Tnd ) ∈ [0, ∞] . L
n→∞
L
192
H. Osswald
d Then T d , L ν d , ν d L is an infinite measure space and ν d L (T d \ Tn ) = 0. n∈N However, this measure space is not too infinite, it is σ-finite, which means that ν d L is concentrated on a countable union of sets of ν d L -finite measure. d d The Loeb space T , L ν d , ν L is a strict extension of the Lebesgue space [0, ∞[d , Lebd , λd in the following sense: n Let Ld denote the set of all B ⊆ T d such that there exists a C B ∈ Leb −1 d d d with B ∩ Tn = (stn ) [C B ∩ [0, n] ] for all n ∈ N, augmented by all ν L Obviously, C B is uniquely determined by B. Vice versa, if C B = C B , then nullsets. ν d L (BB ) = 0, because B ∩ Tnd = B ∩ Tnd for all n ∈ N. Here is an example of a subset B ⊆ [0, 1] in L ν1 \L1 . Set B :=
i ∈ T1 | i is even . H
Then B is internal, thus B ∈ L ν1 and (ν1 ) L (B) = ν1 (B) = 21 , because H is even. Assume that there exists a C B ⊆ [0, 1] with B = {t ∈ T1 | ◦ t ∈ C B }. Notice that n C B ⊇ ]0, 1], because for each r ∈ ]0, 1] there exists an n ∈ ∗ N with n−1 H
1 , 2
In summary, we obtain from Theorem 6.2.8: Theorem 6.2.9 The mapping from Ld onto Lebd with B → C B is a measure preserving bijection from Ld onto Lebd , provided that we identify B and B in case B ∩ Tnd = B ∩ Tnd for all n ∈ N. Because of Theorem 6.2.9, and since the standard part ◦ t of t ∈ T d is ν d L -a.e. well defined, we obtain, Corollary 6.2.10 The L p -spaces L p [0, ∞[d , Lebd , λd and L p T d , Ld , ν d L with p ∈ [1, ∞[ can be identified, because the mapping , ι(ϕ)(t) := ϕ(◦ t) ι : L p [0, ∞[d , Lebd , λd → L p T d , Ld , ν d L
is a canonical (basis independent) isometric isomorphism between these spaces. We call ϕ and ι(ϕ) equivalent and identify both functions. In the preceding result we have defined ◦ (t1 , . .. , tn ) := (◦t1 ,. . . ,◦ tn ), well d defined ν L -a.e. It is often easier to work with L p T d , Ld , ν d L rather than to
6 Measure Theory and Integration
193
work with the corresponding Lebesgue space, because T d is a finite set in the sense d of the nonstandard model and ν L is close to a counting measure. Let , L μ (C) , (μ) L be again a finite Loeb space. We define here st : × T d → × [0, ∞[d , (X, t) → (X,◦ t). Note that st is μ ⊗ ν d L -a.e. well defined. The following extension of Theorem 6.2.2 to product spaces is straightforward. See Theorem 6.3.10 below. Proposition 6.2.11 Fix a separable metric space M within the superstructure V . (a) A subset B ⊂ × [0, ∞[d is L μ (C) ⊗ Lebd -measurable iff st −1 [B] ∈ L μ (C) ⊗ L ν d , in which case (μ) L ⊗ λd (B) = μ ⊗ ν n L (st−1 [B]).,
(+)
d ⊗ Lebd -measurable iff f has a (b) A function d f : × [0, ∞[ → M is L μ (C) ∗ d C ⊗ P T -measurable lifting F : × T → ∗ M, i.e., F(X, t) ∗ f (X,◦ t) for μ ⊗ ν d L -almost all (X, t).
Often it is more convenient to work with the domain
T=d := (t1 , . . . , td ) ∈ T d | ti = t j if i = j . instead of T n . Proposition 6.2.12
d ν L (T d \T=d ) = 0.
Proof Fix an n ∈ N. Since Tnd = (n · H )d and T=d = m := n · H , n d · νnd (Tnd \ Tn,d = ) =
(n·H )! (n H −d)! ,
we obtain with
1 d m − m · (m − 1) · . . . · (m − d + 1) = md
m−d +1 m m−1 · · ... · 0, m m m because d is finite. Therefore, νnd L (Tnd \Tnd= ) = 0, thus ν d L (T d \T=d ) = 0. 1−
Therefore, we can assume and we will assume in general that the liftings F : T d → ∗ R of a Lebesgue measurable function have the property / T=d . F(t1 , . . . , td ) = 0 if (t1 , . . . , td ) ∈ We also require the following definition:
T
194
H. Osswald
Here is a second example of an infinite σ-finite Loeb measure, the counting measure c L on N. For each n ∈ N we define a finitely additive internal measure cn setting cn : ∗ P ∗ N → {0, 1, . . . , n} , A → |A ∩ {1, . . . , n}| . Note that A ∈ ∗ P (∗ N) is a (cn ) L -approximation of B ⊆ ∗ N if A = B ∩ {1, . . . , n}, thus each subset, even each external set B ⊆ ∗ N is in L cn (∗ P (∗ N)) for all n ∈ N. Define c L (B) := lim (cn ) L (B) ∈ N0 ∪ {∞} . n→∞
Since ∗ N \ N is a c L -nullset, c L is the usual counting measure on N, denoted simply by c. In probability theory, especially in the Malliavin calculus, symmetric functions are important. A function g defined on a set X d , d ∈ N, is called symmetric if for each permutation σ on {1, . . . , d} and all (x1 , . . . , xd ) ∈ X d : g(x1 , . . . , xd ) = gσ (x1 , . . . , xd ) := g(xσ(1) , . . . , xσ(d) ). Proposition 6.2.13 Fix a separable Banach B within the superstructure V . Let f : [0, ∞[d → B be Lebesgue measurable. Then f is symmetric λd -a.e. iff f has a symmetric lifting. 1 Note further that if f is symmetric λd -a.e. and F is a lifting of f , then d! σ Fσ {1, is a symmetric lifting of f, where σ runs through the permutations of . . . , d}. 1 d -a.e., and, of Moreover, if F is a symmetric lifting of f, then f = d! f λ σ σ 1 course, d! σ f σ is symmetric. Proof Let σ be a permutation of {1, . . . , d}. If A ⊆ T d is internal, we set Aσ := {(t1 , . . . , td ) | (tσ(1) , . . . , tσ(d) ) ∈ A}. Since |Aσ | = |A|, ν d (A) = ν d (Aσ ). Fix a lifting F : T d → ∗ B of f and an n ∈ N. Let F n : F Tnd and f n := f [0, n]d . Then, by Sect. 6.2.1, for each ε ∈ R+ there exists an internal A ⊂ Tnd such that
(t1 , . . . , td ) ∈ Tnd | F n (t1 , . . . , td ) f n ◦ t1 , . . . , ◦ td ⊂ A and νnd (A) < ε. Since (t1 , . . . , td ) | Fσn (t1 , . . . , td ) f σn ◦ t1 , . . . , ◦ td ⊂ Aσ and νnd (A) = νnd (Aσ ), Fσn is a lifting of f σn . Since this is true for all n ∈ N, Fσ is a lifting of f σ .
6 Measure Theory and Integration
195
Let now f be symmetric λd -a.s. Then for ν d L -almost all (t1 , . . . , td ) ∈ T d , 1 1 ◦ Fσ (t1 , . . . , td ) f σ t1 , . . . , ◦ td = f ◦ t1 , . . . , ◦ td . d! σ d! σ 1 This proves that d! σ Fσ is a symmetric lifting of f. For the converse, let F be a symmetric lifting of f . Then we obtain for ν d L almost all (t1 , . . . , td ) ∈ T d ,
fσ
◦
t1 , . . . , ◦ td Fσ (t1 , . . . , td ) = F(t1 , . . . , td ) f ◦ t1 , . . . , ◦ tn .
Therefore, f = f σ λn -a.s.
6.2.7 Adapted Loeb Spaces Adapted Loeb spaces are used to establish martingale theory on Loeb spaces. Fix an internal probability space (, C, μ). An internal filtration on C is an internal H 2 -tuple (Ct )t∈T of internal algebras Ct ⊆ C such that Ct ⊆ Cs for t ≤ s. Then (, C, (Ct )t∈T , μ) is called an internal adapted probability space. Following Keisler’s idea, we construct from the internal filtration (Ct )t∈T on C, a standard filtration (cr )r ∈[0,∞[ on L μ (C); that is, (cr )r ∈[0,∞[ has the properties (1) and (2) below. Moreover, (cr )r ∈[0,∞[ satisfies the so-called Doob-Meyer conditions; that is, (cr )r ∈[0,∞[ has the properties (3) and (4) below. We use the following notation: If X and Y are subsets of L μ (C), then X ∨ Y denotes the σ-subalgebra of L μ (C) generated by X ∪ Y . Lemma 6.2.14 Fix a σ-algebra S ⊆ L μ (C). Then S ∨ Nμ L = B ∈ L μ (C) | ∃A ∈ S(AB ∈ Nμ L ) .
(+)
Proof “⊇” Fix B ∈ L μ (C) such that AB ∈ Nμ L for some A ∈ S. Then B = (A \ (A \ B)) ∪ (B \ A) ∈ S ∨ Nμ L . “⊆” The proof that X := B ∈ L μ (C) | ∃A ∈ S(AB ∈ Nμ L ) is a σ-algebra is similar to the proof of Part (2) of Theorem 6.2.2; instead of saturation use the fact that S is a σ-algebra. Since S ∪ Nμ L ⊆ X , the result follows. Fix an internal filtration (Ct )t∈T on C. For each r ∈ [0, ∞[ set cr :=
t∈T,tr
Ct ∨ Nμ L =
t∈T,tr
L μ (Ct ) ∨ Nμ L .
196
H. Osswald
Theorem 6.2.15 (Keisler [12]) (1) (2) (3) (4)
For each r ∈ [0, ∞[, cr ⊆ L μ (C) is a σ-algebra. ct ⊆ c s for all t < s in [0, ∞[. ct = s>t cs , that is, the filtration (ct )t∈[0,∞[ is right continuous. If N ∈ Nμ L , then N ∈ c0 ; thus N ∈ ct for each r ∈ [0, ∞[.
Proof (1) Fix t ∈ T with t r. Since Ct ⊆ C and L μ (C) is complete, cr ⊆ L μ (C). It is easy to see that cr is an algebra. To prove that it is a σ-algebra, fix a nondecreasing sequence (Bn )n∈N in cr . Using (+) and Sect. 6.2.1, for each n ∈ N there exist a kn ∈ T with kn r and an An ∈ Ckn such that μ L (An Bn ) = 0. For An := A1 ∪ · · · ∪ An we also have μ L (An Bn ) = 0, because B1 ⊆ · · · ⊆ Bm ⊆ . . .. Set s := limn→∞ ◦ μ(A n ). By saturation, there exist a k ∈ T with r k ≥ kn and an A ∈ Ck with n∈N An ⊆ A andμ(A) < s + n1 for each n ∈ N. Therefore, μ(A) s. It follows that μ L (A n∈N An ) = 0. Since A
n∈N
Bn ⊆
A
n∈N
An ∪
(An Bn ),
n∈N
μ L (A n∈N Bn ) = 0, thus, n∈N Bn ∈ ct . (2) This is true, because Ct ⊆ Cs for t < s in T . (3) By (2), ct ⊆ s>t cs . Now let C ∈ cs for all s > t. Then there exists a decreasing sequence (kn )n∈N in T with t < ◦ kn and limn→∞ ◦ kn = t such that for each n ∈ N there is an An ∈ Ckn with μ L (An C) = 0. By saturation, there exist a k ∈ T with r ≤ k ≤ kn and an A ∈ Ck such that μ(AA1 ) < n1 for each n ∈ N, thus μ(AA1 ) 0. Since r k and μ L (AC) ≤ μ L (AA1 ) + μ L (A1 C) = 0, C ∈ cr . (4) It is obvious that each N ∈ Nμ L belongs to c0 . The filtration (cr )t∈[0,∞[ on L μ (C) is called the standard part of the internal filtration (Ct )t∈T on C, and the quadruple (, L μ (C), μ L , (ct )t∈[0,∞[ ) is called the adapted Loeb space over (, C, μ, (Ct )t∈T ). Problems Let μ1 be an internal Borel probability measure on ∗ R and let μ be the H 2 -fold product of μ on the set B of internal Borel sets on ∗ RT . We assume that μ is absolutely continuous with respect to the internal Lebesgue measure λT , that is, λT (B) = 0 implies μ(B) = 0 for each B ∈ B. Define for each t ∈ T
Bt := B × ∗ RT \Tt | B is an internal Borel set in ∗ RTt . Let (br )r ∈[0,∞[ be the standard part of the internal filtration (Bt )t∈T .
6 Measure Theory and Integration
197
Fix r ∈ [0, ∞[. Following Keisler’s idea [12], we define an equivalence relation ∼r on ∗ RT by setting X ∼r Y :⇔ ∀s ∈ T (s r ⇒ (X i )i≤s = (Yi )i≤s ). Now define B ∈ br∼ :⇔ B ∈ L μ (B) and ∀X, Y ∈ ∗ RT (X ∼r Y ⇒ (X ∈ B ⇔ Y ∈ B)). For each subset D ⊆ ∗ RT and each t ∈ T we define D t := πt [D] × ∗ R{s∈T |t<s} . where πt (X s )s∈T := ((X s )s≤t ). Prove that br∼ is a σ-algebra. Prove: If s ≤ t in T , then D s ⊆ D t and D ⊆ D s . Prove: If r ∈ [0, ∞[ and r < ◦ s and D ∈ br∼ , then D = D s . Prove: For each r ∈ [0, ∞[, br = br∼ ∨ Nμ L . Let f : ∗ RT → R be L μT (B)-measurable. Prove that f is br -measurable if f (X ) = f (Y ) for all X, Y ∈ ∗ RT with X ∼r Y. (6) Prove that for each br -measurable f : ∗ RT → R there exists a br∼ -measurable g : ∗ RT → R with f = g μ L -a.s.
(1) (2) (3) (4) (5)
6.3 Standard Integrability for Internal Measures In this paragraph we establish the integration theory on Loeb spaces. Fix an internal measure space (, C, μ) such that μ() is provisionally limited, and fix the corresponding Loeb space (, L μ (C), μ L ). Obviously, if C is a ∗ σ-algebra we have the notion “μ -integrability”, which is nothing more than the usual integrability “copied” from the standard model to the nonstandard model by the Transfer Principle.
6.3.1 The Definition of S-integrability and Equivalent Conditions Fix an internal Banach space B with internal norm |·|. A C-measurable function F : → B (by definition, F is then internal) is called Sμ -integrable if for all unlimited K ∈ ∗ N
|F| dμ 0. {|F|≥K }
198
H. Osswald
For example, if F is C-measurable and limited, i.e., |F| is limited, then F is Sμ -integrable. Fix a standard p ∈ [1, ∞[ and define SL p (μ, B) := F : → B| |F| p is Sμ -integrable . In the case p = 2, we call the elements of SL2 (μ, B) Sμ -square integrable. If B = ∗ R, then we write SL p (μ) instead of SL p (μ,∗ R). Lemma 6.3.1 Assume that F : → ∗ R is C-measurable and F ≥ 0. (a) If F p dμ is limited, then F is limited μ L -a.e. (b) If F p dμ 0, then F 0 μ L -a.e. Proof (a) Since U := {F is unlimited} = n∈N {F ≥ n}, we see that U ∈ L μ (C). Assume that ε := μ L (U ) > 0. Then μ({F ≥ n}) > 2ε for each n ∈ N. By the Spillover Principle, there is an unlimited K ∈ ∗ N with μ({F ≥ K }) > 2ε . We obtain
ε F p dμ ≥ F p dμ > K p · is unlimited, p p 2 {F ≥K } which proves (a). (b) Now assume that F p dμ 0. Then n · F p dμ < n1 for all n ∈ N. By the Spillover Principle, there is an unlimited K ∈ ∗ N such that K · F p dμ < K1 is limited. By (a), K · F is limited μ L -a.e. Since K is unlimited, F 0 μ L -a.e. Proposition 6.3.2 (Anderson [2], Loeb [15]) Let F : → ∗ R+ be C-measurable. The following statements (1),…,(5) are equivalent: (1) F is Sμ -integrable. (2) limn→∞ ◦ {n≤F} Fdμ = 0. (3) For each A ∈ C
is limited in any case, Fdμ 0 if μ(A) 0. A (4)
Fdμ is limited and for each ε
∈ R+ there exists a δ ∈ R+ such that
ε for all A ∈ C with μ(A) < δ. (5) There exists a function g : N → N such that for all n ∈ N
{g(n)≤F}
Fdμ <
A
Fdμ <
1 . n
Proof “(1) ⇒ (2)” Assume that (2) is not true. Then there is an ε ∈ R+ such that n ∈ N | {n≤F} Fdμ ≥ ε is unbounded. By the Spillover Principle, there is a K ∈ ∗ N \ N with {K ≤F} Fdμ ≥ ε, contradicting (1).
6 Measure Theory and Integration
199
“(2) ⇒ (3)” Suppose that (2) is true. Fix a standard ε > 0. Then for some n ∈ N. Then we obtain for all A ∈ C
Fdμ ≤ Fdμ + Fdμ < {n≤F}
A
ε + nμ(A)
{n≤F}
Fdμ < ε
A∩{F
is limited in any case, 2ε if μ(A) 0.
+ Since this result is true for all ε ∈ R , A Fdμ 0 if μ(A) 0. This proves (3). “(3) ⇒ (4)” By (3), Fdμ is limited. Assume that (4) is not true. Then there exists an ε ∈ R+ such that for each n ∈ N there is an An ∈ C with μ(An ) < n1 and An Fdμ ≥ ε. By saturation, there exists an A ∈ C such that μ(A) 0, and A Fdμ ≥ ε, which contradicts (3). “(4) ⇒ (5)” Suppose that (4) is true. Since Fdμ is limited, by the preced≤ F} 0 for each unlimited K ∈ ∗ N. Therefore, and by (4), ing Lemma, μ {K 1 < n for all unlimited K ∈ ∗ N and all n ∈ N. For each n ∈ N set {K ≤F} Fdμ
g(n) := min k ∈ ∗ N | {k≤F} Fdμ < n1 . Since {K ≤F} Fdμ < n1 for all unlimited K ∈ ∗ N, g(n) ∈ N. This proves (5). “(5) ⇒ (1)” By (5), for each n ∈ N and each unlimited K ∈ ∗ N,
{F≥K }
Since n is arbitrary,
Fdμ ≤
{F≥K } Fdμ
{F≥g(n)}
Fdμ <
1 . n
0.
Notice that, since the integral of an Sμ -integrable function is limited, Sμ integrability implies μ-integrability. On the other hand, we note, as an example, that a constant function on having an unlimited value is μ-integrable, but not Sμ -integrable (provided μ() is not infinitesimal). The next result is a simple application of the previous proposition. Corollary 6.3.3 Fix p ∈ [1, ∞[. (α) Fix G, F ∈ SL p (μ, B) and a limited a ∈ ∗ R. Then F + G ∈ SL p (μ, B) and a · F ∈ SL p (μ, B). (β) Fix 1 ≤ q < p and let |F| p dμ be limited. Then F ∈ SLq (μ, B), in particular, SL p (μ, B) ⊆ SLq (μ, B). (γ) A C-measurable function to SL p (μ, B) iff there exists a sequence F belongs p p (G n )n∈N in SL (μ, B) with |F − G n | dμ < n1 for each n ∈ N. 1 |F| p dμ p . By the triangle equality for the internal Proof (α) Define F p := L p -norm · p , we obtain for each A ∈ C 1 A (F + G) p ≤ 1 A F p + 1 A G p
0 if μ(A) 0 is limited.
200
H. Osswald
Since a is limited and therefore |a| p is limited, we obtain
|a F| p dμ = |a| p A
|F| p dμ A
0 if μ(A) 0 is limited.
The assertions now follow from (3). (β) Let |F| p dμ be limited. Then, by Hö lder’s inequality, for each A ∈ C
q· qp
|F| dμ ≤
|F|
q
A
q 1− q p p dμ · 1dμ
A
A
0 if μ(A) 0 is limited.
Now apply again (3). (γ) “⇒” is obvious. “⇐” Suppose that there exists a sequence (G n ) in SL p (μ, B) with |F − G n | p dμ < n1 for each n ∈ N. Since for each A ∈ C, 1 A F p ≤ 1 A (F − G n ) p + 1 A G n p
2 < √ if μ(A) 0 p n is limited,
it follows that F ∈ SL p (μ, B) (again by (3)).
6.3.2 µ L -integrability and Sµ -integrability We use the notation of the preceding section. In this section we will prove slight modifications of the Loeb-Anderson lifting theorem for Bochner integrable functions (see Loeb [15] and Anderson [2] and also [18]). It shows that Bochner integrable functions can be characterized by their S-integrable liftings. We fix a separable Banach space B within the superstructure V with norm |·|. We use the notation in the preceding section. Fix the Loeb space , L μ (C) , μ L over an internal space (, C, μ) where μ() is limited. k αi 1 Ai , where Recall that an L μ (C)-simple function is a function of the form i=1 k ∈ N, (α1 , . . . , αk ) and (A1 , . . . , Ak ) are k-tuples in B and L μ (C), respectively, and 1 Ai is the indicator function of Ai , that is, 1 Ai (x) := 1 if x ∈ Ai , and 1 Ai (x) := 0 if x ∈ / Ai . Internal C-simple functions are defined in a similar way. Define
k i=1
αi 1 Ai dμ L :=
Notice that the integral is well defined.
k i=1
αi μ L (Ai ).
6 Measure Theory and Integration
201
Assume that ( f n )n∈N0 is a sequence of L μ (C)-measurable functions. Then ( f n ) converges to f := f 0 in measure if for each ε ∈ R+ , lim μ L {| f n − f | ≥ ε} = 0.
n→∞
An L μ (C)-measurable function f : → B is called μ L -integrable if there exists a sequence ( f n )n∈N of L μ (C)-simple functions f n such that (I 1) ( f n )n∈N converges to f in measure. (I 2) limn→∞, m→∞ | f n − f m | dμ L = 0. The sequence ( f n )n∈N is called a witness for the integrability of f . (I 2) means that + for each δ ∈ R there is an n 0 ∈ N such that for each n, m ∈ N with n, m ≥ n 0 , | f n − f m | dμ L < δ. If (I 1) and (I 2) are true, we set
Fdμ L := lim
n→∞
f n dμ L .
Notice that Fdμ L is well defined. Set A Fdμ L := 1 A Fdμ L for A ∈ L μ (C). If μ L isa probability measure, then it is a common practice to write Eμ L ( f ) instead of Fdμ L . The index μ L can be omitted if it is clear which measure is meant. Theorem 6.3.4 Fix an L μ (C)-measurable function f : → B and p ∈ [1, ∞[. (a) Then f is Bochner integrable iff f has an Sμ -integrable C-∗ simple lifting F : → ∗ B, in which case
Fdμ L = ◦ Fdμ.
(b) Let F : → ∗ B be a C-measurable lifting of f : → B. Suppose that | f | p is μ L -integrable. Then there exists an unlimited N ∈ ∗ N such that 1{|F|≤N } · F ∈ SL p (μ,∗ B). This function remains a lifting of f . (c) f is Bochner μ L -integrable iff | f | is μ L -integrable. (d) f ∈ L p (μ L , B) iff f has a lifting F ∈ SL p (μ,∗ B), in which case
| f | dμ L = p
◦
|F| p dμ.
Proof (a) “⇒” Choose a witness ( f k )k∈N for the integrability of f with f k = a1 1 B1 + · · · + an 1 Bn . Let Ai ∈ C be a μ-approximation of Bi , i = 1, . . . , n. Then Fk := a1 1 A1 + · · · + an 1 An is a lifting of f k , and Fk dμ B f k dμ L . Since |Fk | is limited, Fk ∈ SL1 (μ,∗ B). Let G : → ∗ B be a C-∗ simple lifting of f according to Theorem 6.2.5. Then there exists a subsequence Fg(m) m∈N of (Fm )m∈N such that for all m ∈ N and all k ≥ g(m)
◦ Fk − Fg(m) dμ < 1 , (+) m
202
H. Osswald
and ◦
1 1 < . μ |Fk − G| ≥ m m
(+)
Let (Fk )k∈ ∗ N be an internal extension of (Fk )k∈ N such that all Fk : → ∗ B are C-∗ simple. By the Spillover Principle, for each m ∈ N there exists an unlimited K m such that for all unlimited K ≤ K m the equations under + become true, when we drop ◦ and replace k by K . There exists an unlimited K ∞ ≤ K m for all m ∈ N. It follows that (+) become true for all m ∈ N if we drop ◦ and replace k with K ∞ . Note that F := FK ∞ is a lifting of f , and by Corollary 6.3.3 (γ), F ∈ SL1 (μ,∗ B). Since
Fk dμ B
f k dμ L →k→∞
Fdμ L ,
we obtain,
Fdμ L − Fdμ ≤
f − f g(k) dμ L +
f g(k) dμ L −
Fg(k) − F dμ, Fg(k) dμ +
which can be made arbitrarily small from the standard point of view. This proves that Fdμ L = ◦ Fdμ. “⇐” The proof is similar to the proof of Lemma 6.1 in [18]. Assume that f has an Sμ -integrable lifting F. Since F f μ L -a.s., by Theorem 6.2.2 (5), there exists a decreasing sequence (An )n∈N in C such that for each n ∈ N, μ(An ) < 1/n and F(x) f (x) for all x ∈ \An . Fix n ∈ N. Since {F(x) : x ∈ \ An } is an internal set of nearstandard points of ∗ B, K n = { f (x) : x ∈ \ An } =
◦
F(x) : x ∈ \ An
is compact. We fix a covering of K n by a finite collection of standard open balls Oi , 1 and center yi . Since {F(x) : x ∈ \ An } ⊂ 1 ≤ i ≤ m, each having radius ri < 2n m ∗ O , we may construct L (C)-simple functions f n as follows: For each x ∈ An i μ i=1 set f n (x) := 0. For each x ∈ / An , set f n (x) := yi if F(x) ∈ ∗ Oi and F(x) ∈ / ∗O ∪ · · · ∪ ∗O 1 i−1 , 1 ≤ i ≤ m. We thus obtain for all x ∈ \An , 1 | f (x) − f n (x)| ≤ f (x) − ◦ F(x) + ◦ F(x) − f n (x) < . n
6 Measure Theory and Integration
203
It follows that 1 1 ≤ μ L (An ) = ◦ μ(An ) ≤ . μL | fn − f | ≥ n n Thus ( f n ) converges to f in measure. Notice that f n is an internal C-measurable function. To show that | f n − f m | dμ L →n,m→∞ 0, fix an ε ∈ R+ . Since F ∈ SL1 (μ), by Proposition 6.3.2 (4), there exists a δ ∈ R+ such that A |F| dμ < ε for each A ∈ C with μ(A) < δ. Choose n 0 ∈ N with n10 < δ. Then we have for each n ∈ N with n ≥ n 0 ,
| f n − F| dμ = | f n − F| dμ + | f n − F| dμ =
\An
An
|F| dμ + An
\An
| f n − F| dμ < ε +
1 μ(), n
because μ(An ) < δ and |F(x) − f n (x)| < n1 for x ∈ / An and f n An = 0. Therefore, for n, m ∈ N with n, m ≥ n 0 we obtain
1 1 ◦ ◦ | f n − f m | dμ L = | f n − f m | dμ ≤ 2ε + μ(), + n m whence, | f n − f m | dμ L →n,m→∞ 0. (b) Set a := | f | p and A := |F| p . Then A is a lifting of a. Since A is therefore limited μ L -a.e., limn→∞ 1{A≤n} a = a μ L -a.e. It follows that
lim
n→∞
a − 1{A≤n} adμ L = 0 and lim 1{A≤n} a − 1{A≤m} adμ L = 0. n,m→∞
Therefore and since lifting of 1{A≤n} a for all n ∈ N, by 1{A≤n} A is an Sμ -integrable (a), limn,m→∞ ◦ 1{A≤n} A − 1{A≤m} Adμ = 0. There exists a strictly monotone increasing function g : N → N such that for all m ∈ N and all n ≥ ∗ g(m) 1{A≤n} A − 1{A≤ ∗ g(m)} Adμ < 1 . m By the Spillover Principle, for each m ∈ N there exists an unlimited Nm such that for all unlimited N ≤ Nm the preceding formula is true, when we replace n by N . ∗ By saturation, there exists an unlimited M ∈ 1N with M ≤ Nm for all m ∈ N. It follows that 1{A≤M} A − 1{A≤g(m)} Adμ < m for all m ∈ N. By Corollary 6.3.3 √ (γ), 1{A≤M} A is Sμ -integrable, thus 1{|F|≤N } F ∈ SL p (μ,∗ B), where N = p M. This function remains a lifting of f , because N is unlimited and f is standard.
20