# REAL AND COMPLEX ANALYSIS

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed to

2 CHAPTER ONE ABSTRACT INTEGRATION 1 Does there exist an infinite σ-algebra which has only countable many members? Solution: No. Suppose M be a σ-algebra on which has countably infinite members. For each x define B x = x M M M. Since M has countable members, so the intersection is over countable members or less, and so B x belongs M, since M is closed under countable intersection. Define N = {B x x }. So N M. Also we claim if A, B N, with A B, then A B =. Suppose A B, then some x A and same x B, but that would mean A = B = x M M M. Hence N is a collection of disjoint subsets of. Now if cardinality of N is finite say n N, then it would imply cardinality of M is 2 n, which is not the case. So cardinality of N should be at least ℵ 0. If cardinality of N = ℵ 0, then cardinality of M = 2 ℵ 0 = ℵ 1, which is not possible as M has countable many members. Also if cardinality of N ℵ 1, so is the cardinality of M, which again is not possible. So there does not exist an infinite σ-algebra having countable many members. 2 Prove an analogue of Theorem 1.8 for n functions. Solution: Analogous Theorem would be: Let u 1, u 2,..., u n be real-valued measurable functions on a measurable space, let Φ be a continuous map from R n into topological space Y, and define h(x) = Φ(u 1 (x), u 2 (x),..., u n (x)) for x. Then h : Y is measurable. Proof: Define f : R n such that f(x) = (u 1 (x), u 2 (x),..., u n (x)). So 1

3 h = Φ f. So using Theorem 1.7, we only need to show f is a measurable function. Consider a cube Q in R n. Q = I 1 I 2 I n, where I i are the intervals in R. So f 1 (Q) = u 1 1 (I 1 ) u 1 2 (I 2 ) u 1 n (I n ) Since each u i is measurable, so f 1 (Q) is measurable for all cubes Q R n. But every open set V in R n is a countable union of such cubes, i.e V = i=1q i, therefore f 1 (V ) = f 1 ( Q i ) = f 1 (Q i ) i=1 Since countable union of measurable sets is measurable, so f 1 (V ) is measurable. Hence f is measurable. i=1 3 Prove that if f is a real function on a measurable space such that {x : f(x) r} is a measurable for every rational r, then f is measurable. Solution: Let M denotes the σ-algebra of measurable sets in. Let Ω be the collections of all E [, ] such that f 1 (E) M. So for all rationals r, [r, ] Ω. Let α R; we will show (α, ] Ω; hence from Theorem 1.12(c) conclude that f is measurable. Since rationals are dense in R, therefore there exists a sequence of rationals {r i } such that r i > α and r i α. Also (α, ] = 1 [r i, ]. Each [r i, ] Ω and Ω is a σ-algebra (Theorem 1.12(a)) and hence closed under countable union; therefore (α, ] Ω. And so from Theorem 1.12(c), we conclude f is measurable. 4 Let {a n } and {b n } be sequences in [, ], prove the following assertions: (a) (b) lim sup x ( a n ) = lim inf a n. lim sup (a n + b n ) lim sup a n + lim sup b n provided none of the sums is of the form. (c) If a n b n for all n, then lim sup a n lim sup b n. 2

4 Show by an example that the strict inequality can hold in (b). Solution: (a) We have for all n N, sup { a i } = inf {a i} i n i n taking limit n, we have desired equality. (b) Again for all n N, we have {a i + b i } sup{a i } + sup{b i } sup i n i n Taking limit n, we have desired inequality. (c) Since a n b n for all n, so for all n we have inf {a i} inf {b i} i n i n Taking limit n, we have desired inequality. For strict inequality in (b), consider a n = ( 1) n and b n = ( 1) n+1. i n 5 (a) Suppose f : [, ] and g : [, ] are measurable. Prove that the sets {x : f(x) < g(x)}, {x : f(x) = g(x)} are measurable. Solution: Given f, g are measurable, therefore from 1.9(c) we conclude g f is also measurable. But then {x f(x) < g(x)} = (g f) 1 (0, ] is a measurable set by Theorem 1.12(c). Also {x f(x) = g(x)} = (g f) 1 (0) = (g f) 1 ( ( 1 n, 1 n ) = (g f) 1 ( 1 n, 1 n )) Since each (g f) 1 ( 1 n, 1 n) is measurable, so is their countable intersection. Hence {x f(x) = g(x)} is measurable. (b) Prove that the set of points at which a sequence of measurable real-valued functions converges (to a finite limit) is measurable. Solution: Let f i be the sequence of real-measurable functions. Let A denotes 3

5 the set of points at which f i converges to a finite limit. But then A = n=1 m=1 i,j m {x f i (x) f j (x) < 1 n } = n=1 m=1 i,j m ( (f i f j ) 1 1 n, 1 ) n Since for each i, j, f i f j is measurable, so (f i f j ) 1 ( 1 n, 1 n) is measurable too for all n. Also countable union and intersection of measurable sets is measurable, we conclude A is measurable. 6 Let be an uncountable set, let M be the collection of all sets E such that either E or E c is at most countable, and define µ(e) = 0 in the first case and µ(e) = 1 in the second. Prove that M is a σ-algebra in and that µ is a measure on M. Describe the corresponding measurable functions and their integrals. Solution: M is a σ-algebra in : M, since c = is countable. Similarly M. Next if A M, then either A or A c is countable, that is either (A c ) c is countable or A c is countable; showing A c M. So M is closed under complement. Finally, we show M is closed under countable union. Suppose A i M for i N, we will show A i also belongs to M. If all A i are countable, so is their countable union, so A i M. But when all A i are not countable means at least one say A j is uncountable. Then A c j is countable. Also ( A i ) c A c j, showing ( A i ) c is countable. So A i M. Hence M is closed under countable union. µ is a measure on M: Since µ takes values 0 and 1, therefore µ(a) [0, ] for all A M. Next we show µ is countable additive. Let A i for i N are disjoint measurable sets. Define A = A i. We will show µ(a) = µ(a i ). If all A i are countable, so is A; therefore µ(a i ) = 0 for all i and µ(a) = 0; and the equation µ(a) = µ(a i ) holds good. But when all A i are not countable means at least one say A j is uncountable. Since A j M, therefore A c j is countable. Also Since all A i are disjoint, so for i j, A i A c j. So µ(a i ) = 0 for i j. Also µ(a j ) = µ(a) = 1 since both are uncountable. Hence µ(a) = µ(a i ). Characterization of measurable functions and their integrals: Assume functions are real valued. First we isolate two class of measurable functions 4

6 denoted by F and F, defines as: F = {f f is measurable & f 1 ([, α]) is countable for all α R} F = {f f is measurable & f 1 ([α, ]) is countable for all α R} Next we characterize the reaming measurable functions. Since f / F or F, therefore f 1 ([α, ]) is uncountable for some α R. Therefore α f defined as sup{α f 1 ([α, ]) is countable} exists. So if β > α f, then f 1 ([β, ]) is countable. Also if β < α f, then f 1 ([, β]) = f 1 ((β, ]). Since f 1 ((β, ]) is uncountable and belongs to M, therefore f 1 ((β, ]) is countable. And so f 1 (α f ) is uncountable. Also f 1 (α f ) M, therefore f 1 (γ) is countable for all γ α f. Thus if f is a measurable function then either f F orf, or there exists α f R such that f 1 (α f ) is uncountable while f 1 (β) is countable for all β α f. Once we have characterization, integrals are easy to describe: if f F f dµ = if f F else α f 7 Suppose f n : [0, ] is measurable for n = 1, 2, 3,..., f 1 f 2 f 3 0, f n (x) f(x) as n, for every x, and f 1 L 1 (µ). Prove that then f n dµ = f dµ lim and show that this conclusion does not follow if the condition f 1 L 1 (µ) is omitted. Solution: Take g = f 1 in the Theorem 1.34 to conclude lim f n dµ = f dµ For showing f 1 L 1 (µ) is a necessary condition for the conclusion, take = R and f n = χ [n, ). So we have f(x) = 0 for all x, and therefore f dµ = 0. While f n dµ = for all n. 5

7 8 Put f n = χ E if n is odd, f n = 1 χ E if n is even. What is the relevance of this example to Fatou s lemma? Solution: With the described sequence of f n, strict inequality occurs in Fatou s Lemma (1.28). We have ( ) lim inf f n dµ = 0 While lim inf assuming µ() µ(e). f n dµ = min(µ(e), µ() µ(e)) 0, 9 Suppose µ is a positive measure on, f : [0, ] is measurable, f dµ = c, where 0 < c <, and α is a constant. Prove that lim n log[1 + (f/n) α ] dµ = if 0 < α < 1, c if α = 1, 0 if 1 < α <. Hint: If α 1, prove that the integrands is dominated are dominated by αf. If α < 1, Fatou s lemma can be applied. Solution: As given in the hint, we consider two cases for α: Case when 0 < α < 1: Define φ n (x) = n log(1 + (f(x)/n) α ). Since φ n : [0, ], therefore Fatou s lemma is applicable. So Also (lim inf lim n log(1 + (f(x)/n)α ) = lim φ n) dµ lim inf Since α < 1 and f dµ <, therefore φ n dµ 1 αf(x) α 1+(f(x)/n) α n α+1 1 = n 2 lim n log(1 + (f(x)/n)α ) = a.e x αn1 α f(x)α 1 + (f(x)/n) α 6

8 And hence (lim inf φ n ) dµ =. Therefore lim φ n dµ lim inf φ n dµ = Case when α 1: We claim φ n (x) is dominated by αf(x). For a.e. x and α 1, we need to show n log(1 + (f(x)/n) α ) αf(x) for all n ( ( ) α ) f(x) i.e. log 1 + α f(x) n n Define g(λ) = log(1 + λ α ) αλ for λ 0. So if g(λ) 0 for α 1 and λ 0, then (1) follows by taking λ = f(x)/n. So we need show g(λ) 0 for α 1 and λ 0. Computing derivative of g, we have g (λ) = α(1 + λα λ α 1 ) 1 + λ α When 0 λ 1, we have 1 λ α 1 0; while when λ > 1, we have λ α λ α 1 > 0. Thus g (λ) 0. Also g(0) = 0, therefore g(λ) 0 for all λ 0 and α 1. And so for α 1 we have log(1 + (f(x)/n) α ) αf(x) for all n and a.e x. Since αf(x) L 1 (µ), DCT(Theorem 1.34) is applicable. Thus lim n log(1 + (f/n) α ) dµ = lim (n log(1 + (f/n)α )) dµ When α = 1, lim (n log(1 + (f/n) α )) = f(x) (calculating the same as calculated for the case α < 1). And when α > 1, we have lim (n log(1 + (f/n) α )) = 0. And hence lim n log(1 + (f/n) α ) dµ = if 0 < α < 1, c if α = 1, 0 if 1 < α <. (1) 10 Suppose µ() <, {f n } is a sequence of bounded complex measurable functions on, and f n f uniformly on. Prove that f n dµ = f dµ, lim n= 7

9 and show that the hypothesis µ() < cannot be omitted. Solution: Let ɛ > 0. Since f n f uniformly, therefore there exists n 0 N such that f n (x) f(x) < ɛ n n 0 Therefore f(x) < f n0 (x) + ɛ. Also f n (x) < f(x) + ɛ. Combining both equations, we get f n (x) < f n0 + 2ɛ n n 0 Define g(x) = max( f 1 (x),, f n0 1(x), f n0 (x) + 2ɛ), then f n (x) g(x) for all n. Also g is bounded. Since µ() <, therefore g L 1 (µ). Now apply DCT(Theorem 1.34) to get lim f n dµ = f dµ To show µ() < is a necessary condition, consider = R with usual measure µ, and f n (x) = 1. We have lim n f n dµ =, while f dµ = 0, since f = 0. f uniformly is also a necessary condi- REMARK : The condition f n tion. 11 Show that A = n=1 k=n in Theorem 1.41, and hence prove the theorem without any reference to integration. Solution: A is defined as the collections of all x which lie in infinitely many E k. Thus x A x k=n E k n N; and so A = n=1 k=n Now let ɛ > 0. Since k=1 µ(e k) <, therefore there exists n 0 N such E k E k 8

10 that k=n 0 µ(e k ) < ɛ. And µ(a) = µ( Make ɛ 0 to conclude µ(a) = 0. n=1 k=n E k ) µ( E k ) k=n 0 µ(e k ) k=n 0 < ɛ 12 Suppose f L 1 (µ). Prove that to each ɛ > 0 there exists a δ > 0 such that f dµ < ɛ whenever µ(e) < δ. E Solution: Let (, M, µ) be the measure space. Suppose the statement is not true. Therefore there exists a ɛ > 0 such that there exists no δ > 0 such that f dµ < ɛ whenever µ(e) < δ. That means for each δ > 0, E there exists a E δ M such that µ(e δ ) < δ, while E δ f dµ > ɛ. By taking δ = 1/2 n, where n N, we construct a sequence of measurable sets {E 1/2 n}, such that µ(e 1/2 n) < 1/2 n for all n and E 1/2 f dµ > ɛ. n Now define A k = n=k E 1/2 n and A = k=1 A k. We have A 1 A 2 A 3, and µ(a 1 ) = µ( n=1 E 1/2 n) n=1 µ(e 1/2 n) < n=1 1/2n <. Therefore from Theorem 1.19(e), we conclude µ(a k ) µ(a). Next define φ : M [0, ] such that φ(e) = f dµ. Clearly, by Theorem 1.29, φ is a measure on M. Therefore, again by Theorem 1.19(e), we E have φ(a k ) φ(a). Since A = k=1 n=k E 1/2n, therefore from previous Exercise, we get µ(a) = 0. Therefore φ(a) = f dµ = 0. While A φ(a k ) = φ( E 1/2 n) φ(e 1/2 k) = f dµ > ɛ n=k E 1/2 k Therefore φ(a k ) φ(a), a contradiction. Hence the result. 9

11 13 Show that proposition 1.24(c) is also true when c =. Solution: We have to show cf dµ = c f dµ, when c = and f 0 We consider two cases: when f dµ = 0 and f dµ > 0. When f dµ = 0, we have from Theorem 1.39(a), f = 0 a.e., therefore, cf = 0 a.e.. And hence cf dµ = 0 = c f dµ While when f dµ > 0, there exist a ɛ > 0 and a measurable set E, such that µ(e) > 0 and f(x) > ɛ whenever x E; because otherwise f(x) < ɛ a.e. for all ɛ > 0; making ɛ 0, we get f(x) = 0 a.e. and hence f dµ = 0, which is not the case. But then cf dµ cf dµ > ɛ c dµ = E E Also c f dµ = Hence the proposition is true for c = too. 10

12 CHAPTER TWO POSITIVE BOREL MEASURES 1 Let {f n } be s sequence of real nonnegative functions on R 1, consider the following four statements: (a) If f 1 and f 2 are upper semicontinuous, then f 1 + f 2 is upper semicontinuous. (b) If f 1 and f 2 are lower semicontinuous, then f 1 + f 2 is upper semicontinuous. (c) If each f n is upper semicontinuous, then 1 f n is upper semicontinuous. (c) If each f n is lower semicontinuous, then 1 f n is lower semicontinuous. Show that three of these are true and that one is false. What happens if the word nonnegative is omitted? Is the truth of the statements affected if R 1 is replaced by a general topological space? Solution: (a) For α R 1, we have {x (f 1 + f 2 )(x) < α} = r Q ({x f 1 (x) < r} {x f 2 (x) < α r}) And since f 1 and f 2 are upper semicontinuous; and countable union of open sets is open, therefore we conclude {x (f 1 + f 2 )(x) < α} is an open set for all α R. Hence f 1 + f 2 is upper semicontinuous. (b) Again for α R 1, we have {x (f 1 + f 2 )(x) > α} = r Q ({x f 1 (x) > r} {x f 2 (x) > α r}) 11

13 Therefore lower semicontinuity of f 1 and f 2 implies f 1 +f 2 is also lower semicontinuous. (c) It may not be true in general. We give a counterexample. Define f n = χ [ 1 n+1, 1 ]. So each f n is upper semicontinuous (2.8(b)). Also f = f n = χ (0,1], n which is not a upper semicontinuous function. (d) Define s k = k n=1 f n. We have for α R, {s k > α} = ({f 1 > r 1 } {f 2 > r 2 } {f k > α r k 1 }) r 1,r 2,,r k 1 Q Each f n being lower semicontinuous implies s k is lower semicontinuous for all k. But then 2.8(c) implies sup k s k is also lower semicontinuous. Since s k (x) is increasing for all x, we have sup k s k = lim k s k = n=1 f n. Hence n=1 f n is lower semicontinuous. If the word nonnegative is omitted: Clearly (a) and (b) remain unchanged. Also the counterexample of (c) is still valid as a counterexample. But in (d), now sup k s k may not be equal to lim k s k. We provide a concrete counterexample. Define { χ( 1,1) if n = 1, f n = χ [ 1 n+1, 1 n ] if n 2 Easy to check that each f n is lower semicontinuous and that 1 f n = χ ( 1,0] + χ (0.5,1) ; which obviously is not lower semicontinuous. If R 1 is replaced by general topological space: Domain of f n is incidental, all we used in proving (a)-(d) are the two facts that rationals are dense in the range of f n ; and supremum of lower semicontinuous functions is lower semicontinuus. So as long as f n are real-valued functions, results will remain the same. 2 Let f be an arbitrary complex function on R 1, and define φ(x, δ) = sup{ f(s) f(t) : s, t (x δ, x + δ)}, 12

14 φ(x) = inf{φ(x, δ) : δ > 0}. Prove that φ is upper semicontinuous, that f is continuous at a fixed point x is and only if φ(x) = 0, and hence that the set of points of continuity of an arbitrary complex function is G δ. Formulate and prove an analogous statement for general topological spaces in place of R 1. Solution: φ is upper semicontinuous: First note that φ(x, δ 1 ) φ(x, δ 2 ) whenever δ 1 < δ 2. Therefore φ(x) = inf{φ(x, δ) δ > 0} = lim δ 0 φ(x, δ) For α R 1, consider {x φ(x) < α} = V α (say). We need to show V α is open for all α R 1, for proving φ is upper semicontinuous. If V α =, then clearly it is an open set. If V α, then let some x 0 V α. Therefore φ(x 0 ) < α. But φ(x 0 ) = lim δ 0 φ(x 0, δ). Therefore, there exist a δ 0 > 0, such that φ(x 0, δ 0 ) < α. Now consider the open ball B around x 0 of radius δ 0 /2, i.e B = (x 0 δ 0 /2, x 0 + δ 0 /2). If y B, then φ(y) φ(y, δ 0 /2) = sup{ f(s) f(t) s, t (y δ 0 /2, y + δ 0 /2)} sup{ f(s) f(t) s, t (x 0 δ 0, x 0 + δ 0 )} = φ(x 0, δ 0 ) < α Therefore y V α for all y B, implying V α is open in R 1. Hence φ is upper semicontinuous. f is continuous at x iff φ(x) = 0: First Suppose f is continuous at x. Therefore, for ɛ > 0, there exists δ 0 > 0, such that f(x) f(y) < ɛ/2 whenever x y < δ 0. But then sup{ f(s) f(t) s, t (x δ 0, x + δ 0 ) < ɛ}, i.e. φ(x, δ 0 ) < ɛ. And therefore φ(x) φ(x, δ 0 ) < ɛ. Make ɛ 0 to conclude φ(x) = 0. Conversely, suppose φ(x) = 0. Therefore lim δ 0 φ(x, δ) = 0. Therefore for ɛ > 0, there exists δ 0, such that φ(x, δ 0 ) < ɛ. But that means sup{ f(s) f(y) s, y (x δ 0, x + δ 0 )} < ɛ. Take s = x, to get f(x) f(y) < ɛ, whenever y (x δ 0, x + δ 0 ), that is f is continuous at x. 13

15 Set of points of continuity is G δ : Since f is continuous at x if and only if φ(x) = 0, therefore the set of points of continuity of f is {x φ(x) = 0}. But {x φ(x) = 0} = n=1 { x φ(x) < 1 } n Also since φ is upper semicontinuous, therefore each {x φ(x) < 1 } is an n open set. Hence {x φ(x) = 0} is a G δ. Formulation for general topological spaces: 3 Let be a metric space, with metric ρ. For any nonempty E, define ρ E (x) = inf{ρ(x, y) : y E}. Show that ρ E is a uniformly continuous function on. If A and B are disjoint nonempty closed subsets of, examine the relevance of the function f(x) = to Urysohn s lemma. Solution: For x, y, we have ρ E (x) ρ A (x) + ρ B (x) ρ E (x) ρ(x, e) for all e E ρ(x, y) + ρ(y, e) for all e E ρ E (x) ρ(x, y) ρ(y, e) for all e E Therefore, ρ E (x) ρ(x, y) ρ E (y) or ρ E (x) ρ E (y) ρ(x, y) Changing x with y, we get ρ E (x) ρ E (y) ρ(x, y). So for ɛ > 0, we chose δ = ɛ, and have ρ E (x) ρ E (y) ρ(x, y) < δ = ɛ, whenever ρ(x, y) < δ. Hence ρ E is uniformly continuous. For A, B disjoint nonempty closed sets of, and f(x) = ρ E (x) ρ A (x) + ρ B (x) 14

16 we have f(a) = 0 for all a A; and f(b) = 1 for all b B. So for given K compact and V open set containing K, take A = V c and B = K, to get the desired function K f V in Urysohn s lemma (2.12). 4 Examine the proof of the Reisz theorem and prove the following two statements: (a) If E 1 V 1 and E 2 V 2, where V 1 and V 2 are disjoint open sets, then µ(e 1 E 2 ) = µ(e 1 ) + µ(e 2 ), even if E 1 and E 2 are not in M. (b) If E M F, then E = N K 1 K 2, where K i is a disjoint countable collection of compact sets and µ(n) = 0. Solution: (a) 15

17 CHAPTER FOUR ELEMENTARY HILBERT SPACE THEORY 1 If M is a closed subspace of H, prove that M = (M ). Is there a similar true statement for subspaces M which are not necessarily closed? SOLUTION: We first show M (M ). Since x M x M x (M ). Hence M (M ). Next we will show (M ) M. Since M is a closed subspace of H, therefore H = M M (Theorem 4.11). So if x (M ), then x = y + z for some y M and z M. Consider z = x y. Since x (M ) and y M (M ) ; combining with the fact that (M ) is a subspace, we get x y = z (M ). But that would mean z M. Also we started with z M. Together it implies z = 0. Therefore x = y M. And so (M ) M. So for closed subspace M, we have M = (M ). Next suppose M is a subspace which may not be closed. So we have M = ( M ). We further simplify the expression by showing M = M. If x M, then it would imply x M, therefore M M. For reverse inclusion, consider x M, we will show x M. Let m M, therefore there exists a sequence {m i } in M such that m i m. Since x M, therefore x, m i = 0 for all i. Continuity of inner product (Theorem 4.6) would imply x, m = 0 too. Therefore x, m = 0 for all m M. So x M. Hence for any subspace M, we have M = (M ). 16

18 2 Let {x n n = 1, 2, 3, } be a linearly independent set of vectors in H. Show that the following construction yields an orthonormal set {u n } such that {x 1,, x N } and {u 1,, u N } have the same span for all N. Put u 1 = x 1 / x 1. Having u 1,, u n 1 define n 1 v n = x n x n, u i u i, u n = v n / v n. i=1 SOLUTION: We need to show {u 1,, u n } is orthonormal and the span of {u 1,, u n } is equal to the span of {x 1,, x n } for all n N. We show it by induction on n. For n = 1, we have {u 1 } othonormal set and also span(u 1 ) = span(x 1 ). Therefore the result is true for n = 1. Suppose the result is true for n = N 1, that is {u 1,, u N 1 } is an orthonormal set and span(u 1,, u N 1 ) = span(x 1,, x N 1 ). We need to show {u 1,, u N } is an orthonormal set and span(u 1,, u N ) = span(x 1,, x N ). To show {u 1,, u N } is orthonormal, it will suffice to show u N, u i = 0 for i = 1 to N 1, as {u 1,, u N 1 } is already orthonormal. Also u N, u i = 1 v N v N, u i = 1 N 1 v N x N x N, u j u j, u i j=1 = x N, u i x N, u i u i, u i = 0 Hence {u 1,, u N } is orthonormal. Next we have x span(x 1,, x N 1, x N ) x span(u 1,, u N 1, x N ) x span(u 1,, u N 1, v N ) x span(u 1,, u N 1, u N ) 17

19 So the result is true of n = N. Hence the result is true for all n N 3 Show that L p (T ) is separable if 1 p <, but that L (T ) is not separable. SOLUTION: L p (T ) for 1 p < : Let P (T ) denotes the subspace of trigonometric polynomials in L p (T ). Easy to check P (T ) is separable using the fact that Q + iq is countable and dense in C. Also one can show that P (T ) is dense in C(T ) with respect to p norm using the argument given in 4.24 (or using Fejèr theorem). Also C(T ) is dense in L p (T ) (Theorem 3.14). So P (T ) is separable and dense in L p (T ), implying L p (T ) is separable too. L (T ): Since L (T ) can be identified as L ([0, 2π]), we will show L ([0, 2π]) is not separable. Consider S = {f L ([0, 2π]) f = χ [0,r] for 0 < r < 2π} So S is an uncountable subset of L ([0, 2π]). Also if f, g S with f g, then f g = 1. Suppose L ([0, 2π]) is separable. Therefore there exists a countable dense set, say M in L ([0, 2π]). But then m M B 0.4 (m) must contain L ([0, 2π]), where B 0.4 (m) denotes an open ball of radius 0.4 around m. Since each B 0.4 (m) contains at most one element of S, therefore m M B 0.4 (m) contains at most countable elements of S. S being uncountable, so S is not a subset of m M B 0.4 (m), a contradiction. Therefore L ([0, 2π]) is not separable. 4 Show that H is separable if and only if H contains a maximal orthonormal system which is at most countable. SOLUTION: First suppose H is separable, then by Exercise 2, H has at most countable maximal orthonormal set. Conversely, suppose H is a Hilbert space with countable maximal orthonormal set E. Therefore E = {u 1, u 2, } for some u i H. Define S = { finite α i u i α i Q + iq & u i E} 18

20 Clearly S has countable elements. So if we show S = H, we are done. Let x H, therefore x = i=1 α iu i, with i=1 α i 2 = x 2. Let some ɛ > 0, therefore there exists n N such that i=n+1 α i 2 < ɛ 2 /4. Define x = n i=1 α iu i. Therefore x x 2 = i=n+1 α i 2 < ɛ 2 /4. Also define y = n i=1 β iu i where β i Q+iQ such that x y 2 = n i=1 α i β i 2 < ɛ 2 /4; such construction is possible since Q + iq is dense in C. So y S, and x y = x x + x y x x + x y < ɛ/2 + ɛ/2 = ɛ. Therefore S is dense in H. Same proof will work is H has finite maximal orthonormal system. Hence H is separable. REMARKS: Another way of showing that in a Hilbert space separability implies that space has at most countable orthonormal system, is through contradiction. Suppose E be the uncountable maximal orthonormal system. If u 1, u 2 E, then u 1 u 2 2 = u u 2 2 = 2. Therefore the collection {B(u, 0.5) u E} is uncountable. Also each element of this collection is disjoint; showing that H cannot have a countable dense subset, hence not separable, a contradiction. 5 If M = {x Lx = 0}, where L is a continuous linear functional on H, prove that M is vector space of dimension 1 (unless M = H). SOLUTION: If M = H, then L = 0, therefore we assume L H. Its easy to check that M is a closed subspace of H. Also using Theorem 4.12 (Riesz representation theorem), we have L(x) = x, x 0 for some x 0 H with x 0 0, since we have assumed L 0. So we have M = {x H x, x 0 = 0} M = x 0 M = (x 0 ) M = Span{x 0 } (Using Exercise 1) Therefore M is vector space of dimension 1. 6 Let {u n }(n = 1, 2, 3... ) be an orthonormal set in H. Show that this gives an example of closed and bounded set which is not compact. Let Q be the 19

21 set of all x H of the form ( x = c n u n where c n 1 ). n 1 Prove that Q is compact. (Q is called the Hilbert cube.) More generally, let {δ n } be a sequence of positive numbers, and let S be the set of all x H of the form x = c n u n (where c n δ n ). Prove that S is compact if and only if 1 δ2 n <. Prove that H is not locally compact. SOLUTION: 1 7 Suppose {a n } is a sequence of positive numbers such that a n b n < whenever b n 0 and b 2 n <. Prove that a 2 n <. SOLUTION: One way is follow the suggestion, but we will give an alternate method using Banach-Steinhaus theorem (Theorem 5.8). For n N, define Λ n : l 2 (R) R such that Λ n (x) = n i=1 a ix i, where x = (x 1, x 2, ). Λ n is linear for all n, is easy to check. For x l 2 (R), we have n Λ n (x) = a i x i i=1 n a i x i i=1 a i x i < i=1 since b i 2 < and hypothesis says whenever b i 2 < implies a i b i <. Therefore Λ n (x) is bounded for all n. And this is true for all x l 2 (R) too. Also Baire s Category theorem (see Section 5.7) implies l 2 (R) is of second category, since l 2 (R) is complete. Invoking Banach-Steinhaus theorem 20

22 on collection {Λ n }, we get Λ n < M for some M > 0. Also we have n i=1 Λ n = sup a ix i x 0 ( i=1 x i 2 ) 1/2 n i=1 a2 i ( n (By taking x = (a 1,, a n, 0, 0, )) i=1 a2 i )1/2 n = ( a 2 i ) 1/2 i=1 So we have n a 2 i Λ n 2 < M 2 i=1 Taking n, we get i=1 a2 i < M 2 < n N 8 If H 1 and H 2 are two Hilbert spaces, prove that one of them is isomorphic to a subspace of the other. (Note that every closed subspace of a Hilbert space is a Hilbert space.) SOLUTION: 9 If A [0, 2π] and A is measurable, prove that lim A cos nx dx = lim sin nx dx = 0. A SOLUTION: We know that {u n n Z} is maximal orthomormal set for L 2 (T), where u n (x) = e inx. Now consider χ A, characteristic function of A. Since u n, χ A 2 = χ A 2 = m(a) < n= Therefore lim n u n, χ A = 0. So we have un + u n un u n lim, χ A = lim, χ A = 0 2 2i 21

23 which is nothing but lim A cos nx dx = lim sin nx dx = 0. A 10 Let n 1 < n 2 < n 3 be positive integers, and let E be the set of all x [0, 2π] at which {sin n k x} converges. Prove that m(e) = 0. SOLUTION: 11 Find a nonempty closed set in L 2 (T) that contains no element of smallest norm. SOLUTION: Let E = { ( n) un n N}. E is closed since for a, b E, we have a b > 2, hence no limit point. Also inf a E a = 1 but is not achieved by any element of E. 12 The constants c k in Sec were shown to be such that k 1 c k is bounded. Estimate the relevant integral more precisely and show that 0 < lim k k 1/2 c k <. SOLUTION: 13 Suppose f is a continuous function on R 1, with period 1. Prove that lim N 1 N N f(nα) = n=1 for every irrational real number α. 1 0 f(t) dt SOLUTION: Note that this problem is famous Wiel Equidistribution theorem. As the Hint goes, we first check the equality for {e 2πikx } where k Z. 22

24 When k = 0, we have f(x) = 1. So we have 1 N N n=1 f(nα) = 1 for all N. Therefore lim N 1 N N f(nα) = 1 = n=1 1 0 f(t) dt When k 0, we have e 2πikα 1, since α is an irrational. So we have 1 N f(nα) = 1 e 2πikα (1 e 2πiNkα ) 0 as N N N (1 e 2πikα ) n=1 Also 1 f(t) dt = 0 since k 0. Hence the identity holds for the collection 0 {e 2πikx } k Z. If the identity holds for f and g then it also holds for af + bg, where a, b C; and hence the identity holds for all trigonometric polynomials. Let ɛ > 0, and f be a continuous function of period 1. Theorem 4.25 implies that there will exists a trigonometric polynomial p such that f p < ɛ/3. Also for large N, we have 1 N 1 p(nα) p(t) dt N < ɛ/3 And therefore 1 N f(nα) N Hence lim N 14 1 N n=1 N f(nα) = n=1 SOLUTION: 1 0 n= f(t) dt 1 N f(nα) p(nα) N n=1 1 N 1 + p(nα) p(t) dt N + n=1 1 0 p(t) f(t) dt ɛ/3 + ɛ/3 + ɛ/3 = ɛ f(t) dt for all continuous functions of period

25 CHAPTER NINE FOURIER TRANSFORMS 1 Suppose f L 1, f > 0. Prove that ˆf(y) < ˆf(0) for every y 0. Solution: We have ˆf(y) = 1 f(x)e ixy dx 2π 1 f(x) dx 2π = 1 f(x) dx = ˆf(0) 2π For strict inequality, suppose ˆf(y) = ˆf(0) for some y 0. So 1 f(x)e ixy dx = 1 f(x) dx 2π 2π that is comparing real part, we get f(x)(e ixy 1) dx = 0 f(x)(cos(xy) 1) dx = 0 Therefore, cos(xy) = 1 ae, which is only possible if y = 0, a contradiction. Hence the strict inequality. 1 Compute the Fourier transform of the characteristic function of an interval. For n = 1, 2, 3, let g n be the characteristic function of [ n, n], let h be the 24

26 characteristic function of [ 1, 1], and compute g n h explicitly. (The graph is piecewise linear.) Show that g n h is the Fourier transform of a function f n L 1 ; except for a multiplicative constant, f n (x) = sin(x) sin(nx) x 2 Show that f n 1 and conclude that the mapping f ˆf maps L 1 into a proper subset of C 0. Show, however, that the range of this mapping is dense in C 0. Solution: 25

### ABSTRACT INTEGRATION CHAPTER ONE

CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed

### THEOREMS, ETC., FOR MATH 515

THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every

### 3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable

### 2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

### Real Analysis Notes. Thomas Goller

Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................

### (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define

Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that

### x 0 + f(x), exist as extended real numbers. Show that f is upper semicontinuous This shows ( ɛ, ɛ) B α. Thus

Homework 3 Solutions, Real Analysis I, Fall, 2010. (9) Let f : (, ) [, ] be a function whose restriction to (, 0) (0, ) is continuous. Assume the one-sided limits p = lim x 0 f(x), q = lim x 0 + f(x) exist

### Problem Set 2: Solutions Math 201A: Fall 2016

Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that

### Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

### Real Analysis Problems

Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.

### Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

### REVIEW OF ESSENTIAL MATH 346 TOPICS

REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations

### g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

### Real Analysis, 2nd Edition, G.B.Folland Elements of Functional Analysis

Real Analysis, 2nd Edition, G.B.Folland Chapter 5 Elements of Functional Analysis Yung-Hsiang Huang 5.1 Normed Vector Spaces 1. Note for any x, y X and a, b K, x+y x + y and by ax b y x + b a x. 2. It

### 1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,

### l(y j ) = 0 for all y j (1)

Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that

### Analysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t

Analysis Comprehensive Exam Questions Fall 2. Let f L 2 (, ) be given. (a) Prove that ( x 2 f(t) dt) 2 x x t f(t) 2 dt. (b) Given part (a), prove that F L 2 (, ) 2 f L 2 (, ), where F(x) = x (a) Using

### MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

### Integration on Measure Spaces

Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of

### Real and Complex Analysis, 3rd Edition, W.Rudin Elementary Hilbert Space Theory

Real and Complex Analysis, 3rd Edition, W.Rudin Chapter 4 Elementary Hilbert Space Theory Yung-Hsiang Huang. It s easy to see M (M ) and the latter is a closed subspace of H. Given F be a closed subspace

### MATH MEASURE THEORY AND FOURIER ANALYSIS. Contents

MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure

### MATHS 730 FC Lecture Notes March 5, Introduction

1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists

### Math 209B Homework 2

Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact

### 3 COUNTABILITY AND CONNECTEDNESS AXIOMS

3 COUNTABILITY AND CONNECTEDNESS AXIOMS Definition 3.1 Let X be a topological space. A subset D of X is dense in X iff D = X. X is separable iff it contains a countable dense subset. X satisfies the first

### MATH 202B - Problem Set 5

MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there

### CHAPTER I THE RIESZ REPRESENTATION THEOREM

CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals

### Problem set 1, Real Analysis I, Spring, 2015.

Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n

### Most Continuous Functions are Nowhere Differentiable

Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we

### Your first day at work MATH 806 (Fall 2015)

Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies

### ANALYSIS WORKSHEET II: METRIC SPACES

ANALYSIS WORKSHEET II: METRIC SPACES Definition 1. A metric space (X, d) is a space X of objects (called points), together with a distance function or metric d : X X [0, ), which associates to each pair

### CHAPTER V DUAL SPACES

CHAPTER V DUAL SPACES DEFINITION Let (X, T ) be a (real) locally convex topological vector space. By the dual space X, or (X, T ), of X we mean the set of all continuous linear functionals on X. By the

### Functional Analysis I

Functional Analysis I Course Notes by Stefan Richter Transcribed and Annotated by Gregory Zitelli Polar Decomposition Definition. An operator W B(H) is called a partial isometry if W x = X for all x (ker

### In N we can do addition, but in order to do subtraction we need to extend N to the integers

Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend

### van Rooij, Schikhof: A Second Course on Real Functions

vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.

### Introduction and Preliminaries

Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis

### Summary of Real Analysis by Royden

Summary of Real Analysis by Royden Dan Hathaway May 2010 This document is a summary of the theorems and definitions and theorems from Part 1 of the book Real Analysis by Royden. In some areas, such as

### The Heine-Borel and Arzela-Ascoli Theorems

The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them

### van Rooij, Schikhof: A Second Course on Real Functions

vanrooijschikhofproblems.tex December 5, 2017 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/pozn/books/ van Rooij, Schikhof: A Second Course on Real Functions Some notes made when reading [vrs].

### PROBLEMS. (b) (Polarization Identity) Show that in any inner product space

1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization

### 5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

### 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer

### Math212a1413 The Lebesgue integral.

Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the

### Real Analysis Chapter 4 Solutions Jonathan Conder

2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points

### Math 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015

Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)

### MAA6617 COURSE NOTES SPRING 2014

MAA6617 COURSE NOTES SPRING 2014 19. Normed vector spaces Let X be a vector space over a field K (in this course we always have either K = R or K = C). Definition 19.1. A norm on X is a function : X K

### THEOREMS, ETC., FOR MATH 516

THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition

### FUNDAMENTALS OF REAL ANALYSIS by. II.1. Prelude. Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as

FUNDAMENTALS OF REAL ANALYSIS by Doğan Çömez II. MEASURES AND MEASURE SPACES II.1. Prelude Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as b n f(xdx :=

### Analysis Comprehensive Exam Questions Fall 2008

Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)

### 08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms

(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops

### Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................

### HILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define

HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,

### Functional Analysis Exercise Class

Functional Analysis Exercise Class Week 2 November 6 November Deadline to hand in the homeworks: your exercise class on week 9 November 13 November Exercises (1) Let X be the following space of piecewise

### A List of Problems in Real Analysis

A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,

### Chapter 2 Metric Spaces

Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

### Continuity. Chapter 4

Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

### 2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.

University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)

### Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi

### Chapter 3: Baire category and open mapping theorems

MA3421 2016 17 Chapter 3: Baire category and open mapping theorems A number of the major results rely on completeness via the Baire category theorem. 3.1 The Baire category theorem 3.1.1 Definition. A

### Measurable functions are approximately nice, even if look terrible.

Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............

### Maths 212: Homework Solutions

Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

### OPERATOR THEORY ON HILBERT SPACE. Class notes. John Petrovic

OPERATOR THEORY ON HILBERT SPACE Class notes John Petrovic Contents Chapter 1. Hilbert space 1 1.1. Definition and Properties 1 1.2. Orthogonality 3 1.3. Subspaces 7 1.4. Weak topology 9 Chapter 2. Operators

### Analysis III. Exam 1

Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)

### Some Background Material

Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

### SOLUTIONS TO SOME PROBLEMS

23 FUNCTIONAL ANALYSIS Spring 23 SOLUTIONS TO SOME PROBLEMS Warning:These solutions may contain errors!! PREPARED BY SULEYMAN ULUSOY PROBLEM 1. Prove that a necessary and sufficient condition that the

### Overview of normed linear spaces

20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural

### In N we can do addition, but in order to do subtraction we need to extend N to the integers

Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

### Math 4121 Spring 2012 Weaver. Measure Theory. 1. σ-algebras

Math 4121 Spring 2012 Weaver Measure Theory 1. σ-algebras A measure is a function which gauges the size of subsets of a given set. In general we do not ask that a measure evaluate the size of every subset,

### 3. (a) What is a simple function? What is an integrable function? How is f dµ defined? Define it first

Math 632/6321: Theory of Functions of a Real Variable Sample Preinary Exam Questions 1. Let (, M, µ) be a measure space. (a) Prove that if µ() < and if 1 p < q

### L p Spaces and Convexity

L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function

### d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

### Stone-Čech compactification of Tychonoff spaces

The Stone-Čech compactification of Tychonoff spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 27, 2014 1 Completely regular spaces and Tychonoff spaces A topological

### AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES

AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov

### Continuity. Chapter 4

Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

### Introduction to Real Analysis

Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:

### Part III. 10 Topological Space Basics. Topological Spaces

Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

### Logical Connectives and Quantifiers

Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then

### The Caratheodory Construction of Measures

Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,

### Analysis Qualifying Exam

Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,

### 1 Math 241A-B Homework Problem List for F2015 and W2016

1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let

### Metric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg

Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose

### Continuity of convex functions in normed spaces

Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional

### Exercises from other sources REAL NUMBERS 2,...,

Exercises from other sources REAL NUMBERS 1. Find the supremum and infimum of the following sets: a) {1, b) c) 12, 13, 14, }, { 1 3, 4 9, 13 27, 40 } 81,, { 2, 2 + 2, 2 + 2 + } 2,..., d) {n N : n 2 < 10},

### SPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT

SPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT Abstract. These are the letcure notes prepared for the workshop on Functional Analysis and Operator Algebras to be held at NIT-Karnataka,

### (U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M.

1. Abstract Integration The main reference for this section is Rudin s Real and Complex Analysis. The purpose of developing an abstract theory of integration is to emphasize the difference between the

### Solutions to Tutorial 8 (Week 9)

The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/

### Probability and Measure

Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability

### Honours Analysis III

Honours Analysis III Math 354 Prof. Dmitry Jacobson Notes Taken By: R. Gibson Fall 2010 1 Contents 1 Overview 3 1.1 p-adic Distance............................................ 4 2 Introduction 5 2.1 Normed

### consists of two disjoint copies of X n, each scaled down by 1,

Homework 4 Solutions, Real Analysis I, Fall, 200. (4) Let be a topological space and M be a σ-algebra on which contains all Borel sets. Let m, µ be two positive measures on M. Assume there is a constant

### Exercises for Unit VI (Infinite constructions in set theory)

Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize

### 2. Metric Spaces. 2.1 Definitions etc.

2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with

### Measure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond

Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................

### MTH 404: Measure and Integration

MTH 404: Measure and Integration Semester 2, 2012-2013 Dr. Prahlad Vaidyanathan Contents I. Introduction....................................... 3 1. Motivation................................... 3 2. The

### + 2x sin x. f(b i ) f(a i ) < ɛ. i=1. i=1

Appendix To understand weak derivatives and distributional derivatives in the simplest context of functions of a single variable, we describe without proof some results from real analysis (see [7] and

### 4th Preparation Sheet - Solutions

Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space

### Lebesgue Measure. Dung Le 1

Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its

### MATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS

MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K

### MORE ON CONTINUOUS FUNCTIONS AND SETS

Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly

### I teach myself... Hilbert spaces

I teach myself... Hilbert spaces by F.J.Sayas, for MATH 806 November 4, 2015 This document will be growing with the semester. Every in red is for you to justify. Even if we start with the basic definition