Appendix a Complements to Topology and Measure Theory
Total Page:16
File Type:pdf, Size:1020Kb
Appendix A Complements to Topology and Measure Theory We review here the facts about topology and measure theory that are used in the main body. Those that are covered in every graduate course on integration are stated without proof. Some facts that might be considered as going beyond the very basics are proved, or at least a reference is given. The presentation is not linear – the two indexes will help the reader navigate. A.1 Notations and Conventions Convention A.1.1 The reals are denoted by R, the complex numbers by C, the rationals by Q. Rd is punctured d-space Rd 0 . ∗ \{ } A real number a will be called positive if a 0, and R denotes the set ≥ + of positive reals. Similarly, a real-valued function f is positive if f(x) 0 ≥ for all points x in its domain dom(f). If we want to emphasize that f is strictly positive: f(x) > 0 x dom(f), we shall say so. It is clear what ∀ ∈ the words “negative” and “strictly negative” mean. If is a collection F of functions, then will denote the positive functions in , etc. Note F+ F that a positive function may be zero on a large set, in fact, everywhere. The statements “b exceeds a,” “b is bigger than a,” and “a is less than b” all mean “a b;” modified by the word “strictly” they mean “a<b.” ≤ A.1.2 The Extended Real Line R is the real line augmented by the two symbols and = + : −∞ ∞ ∞ R = R + . {−∞} ∪ ∪{ ∞} We adopt the usual conventions concerning the arithmetic and order structure of the extended reals R: < r < + r R ; = + ; −∞ ∞ ∀ ∈ |±∞| ∞ r = , r = r R ; − ∞ ∧ −∞ ∞ ∨ ∞ ∀ ∈ + r = , + + r = + r R ; −∞ −∞ ∞ ∞ ∀ ∈ for r > 0, for p > 0, ±∞ ±∞ r = 0 for r =0, p = 1 for p =0, · ±∞ ±∞ for r < 0; 0 for p < 0. ∓∞ 363 364 App. A Complements to Topology and Measure Theory The symbols and 0/0 are not defined; there is no way to do this ∞−∞ without confounding the order or the previous conventions. A function whose values may include is often called a numerical ±∞ function. The extended reals R form a complete metric space under the arctan metric ρ(r, s) def= arctan(r) arctan(s) , r,s R . − ∈ Here arctan( ) def= π/2. R is compact in the topology τ of ρ. The ±∞ ± natural injection R ֒ R is a homeomorphism ; that is to say, τ agrees on → R with the usual topology. a b (a b) is the larger (smaller) of a and b. If f,g are numerical ∨ ∧ functions, then f g (f g ) denote the pointwise maximum (minimum) of ∨ ∧ f,g . When a set S R is unbounded above we write sup S = , and ⊂ ∞ inf S = when it is not bounded below. It is convenient to define the −∞ infimum of the empty set to be + and to write sup = . ∅ ∞ ∅ −∞ A.1.3 Different length measurements of vectors and sequences come in handy in different places. For 0 < p < the ℓp-length of x = (x1,...,xn) Rn ∞ ∈ or of a sequence (x1,x2,...) is written variously as def ν p 1/p def η x = x p = x , while z = z = sup η z | |p k kℓ ν | | | |∞ k kℓ∞ | | denotes the ℓ∞-lengthP of a d-tuple z = (z1, z2,...,zd) or a sequence z =(z0, z1,...). The vector space of all scalar sequences is a Fr´echet space (which see) under the topology of pointwise convergence and is denoted by ℓ0 . The sequences x having x < form a Banach space under , | |p ∞ | |p 1 p < , which is denoted by ℓp . For 0 <p<q we have ≤ ∞ z z ; and z d1/(q−p) z (A.1.1) | |q ≤| |p | |p ≤ ·| |q on sequences z of finite length d. stands not only for the ordinary absolute | | value on R or C but for any of the norms on Rn when p [0, ] need | |p ∈ ∞ not be displayed. Next some notation and conventions concerning sets and functions, which will simplify the typography considerably: Notation A.1.4 (Knuth [57]) A statement enclosed in rectangular brackets denotes the set of points where it is true. For instance, the symbol [f = 1] is short for x dom(f): f(x)=1 . Similarly, [f >r] is the set of points x { ∈ } where f(x) >r, [f ] is the set of points where the sequence (f ) fails to n 6→ n converge, etc. Convention A.1.5 (Knuth [57]) Occasionally we shall use the same name or symbol for a set A and its indicator function: A is also the function that returns 1 when its argument lies in A, 0 otherwise. For instance, [f >r] denotes not only the set of points where f strictly exceeds r but also the function that returns 1 where f >r and 0 elsewhere. A.1 Notations and Conventions 365 Remark A.1.6 The indicator function of A is written 1A by most math- ematicians, ıA , χA , or IA or even 1A by others, and A by a select few. k There is a considerable typographical advantage in writing it as A: [Tn <r] [a,b] or U n are rather easier on the eye than 1[T k<r] or 1 [a,b] , S ≥ n U ≥n respectively. When functions z are written s z , as is common in stochas-S 7→ s ˆ ˜ tic analysis, the indicator of the interval (a,b] has under this convention at s the value (a,b]s rather than 1(a,b]s . In deference to prevailing custom we shall use this swell convention only sparingly, however, and write 1A when possible. We do invite the aficionado of the 1A-notation to compare how much eye strain and verbiage is saved on the occasions when we employ Knuth’s nifty convention. The function A The function A The set A Figure A.14 A set and its indicator function have the same name Exercise A.1.7 Here is a little practice to get used to Knuth’s convention: (i) Let f be an idempotent function: f 2 = f . Then f = [f =1]=[f = 0]. (ii) 6 Let (fn) be a sequence of functions. Then the sequence ([fn ] fn) converges 2 def→ · everywhere. (iii) (0, 1](x) x dx = 1/3. (iv) For fn(x) = sin(nx) compute · c [fn ]. (v) Let A1, A2,... be sets. Then A = 1 A1 , An = sup An = An , 6→ R 1 − n n n n An = infn An = n An . (vi) Every real-valued function is the pointwise limit of the simple step functions S W T V 4n −n −n −n fn = k2 [k2 f < (k + 1)2 ] . n · ≤ k=X−4 (vii) The sets in an algebra of functions form an algebra of sets. (viii) A family of idempotent functions is a σ-algebra if and only if it is closed under f 1 f and under finite infima and countable suprema. (ix) Let f : X Y be a map7→ − and S Y . Then f −1(S)= S f X . → ⊂ ◦ ⊂ 366 App. A Complements to Topology and Measure Theory A.2 Topological Miscellanea The Theorem of Stone–Weierstraß All measures appearing in nature owe their σ-additivity to the following very simple result or some variant of it; it is also used in the proof of theorem A.2.2. Lemma A.2.1 (Dini’s Theorem) Let B be a topological space and Φ a collection of positive continuous functions on B that vanish at infinity. 1 Assume Φ is decreasingly directed 2,3 and the pointwise infimum of Φ is zero. Then Φ 0 uniformly; that is to say, for every ǫ > 0 there is a ψ Φ with → ∈ ψ(x) ǫ for all x B and therefore φ ǫ uniformly for all φ Φ with ≤ ∈ ≤ ∈ φ ψ . ≤ Proof. The sets [φ ǫ], φ Φ, are compact and have void intersection. ≥ ∈ There are finitely many of them, say [φ ǫ], i =1,...,n, whose intersection i ≥ is void (exercise A.2.12). There exists a ψ Φ smaller than 3 φ φ . ∈ 1 ∧···∧ n If φ Φ is smaller than ψ , then φ = φ < ǫ everywhere on B . ∈ | | Consider a vector space of real-valued functions on some set B . It is E an algebra if with any two functions φ, ψ it contains their pointwise product φψ . For this it suffices that it contain with any function φ its square φ2 . Indeed, by polarization then φψ = 1/2 (φ + ψ)2 φ2 ψ2 . is − − ∈E E a vector lattice if with any two functions φ, ψ it contains their pointwise maximum φ ψ and their pointwise minimum φ ψ . For this it suffices ∨ ∧ that it contain with any function φ its absolute value φ . Indeed, φ ψ = | | ∨ 1/2 φ ψ +(φ + ψ) , and φ ψ =(φ + ψ) (φ ψ). is closed under | − | ∧ − ∨ E chopping if with any function φ it contains the chopped function φ 1. It ∧ then contains f q = q(f/q 1) for any strictly positive scalar q . A lattice ∧ ∧ algebra is a vector space of functions that is both an algebra and a lattice under pointwise operations. Theorem A.2.2 (Stone–Weierstraß) Let be an algebra or a vector lattice E closed under chopping, of bounded real-valued functions on some set B . We denote by Z the set x B : φ(x)= 0 φ of common zeroes { ∈ ∀ ∈ E} of , and identify a function of in the obvious fashion with its restriction E def E to B0 = B Z . \ (i) The uniform closure of is both an algebra and a vector lattice E E closed under chopping.