Let (X, µ) be a measure space. As in Chapter 3, we say a measurable function f belongs to L 1 (X, µ) provided

Size: px
Start display at page:

Download "Let (X, µ) be a measure space. As in Chapter 3, we say a measurable function f belongs to L 1 (X, µ) provided"

Transcription

1 Chapter 4 L p Spaces Let (, µ) be a measure space. As in Chapter 3, we say a measurable function f belongs to L 1 (, µ) provided (4.1) f L 1 = f(x) dµ(x) <. Elements of L 1 (, µ) consist of equivalence classes of elements of L 1 (, µ), where we say (4.2) f f f(x) = f(x) for µ-almost every x. With a slight abuse of notation, we denote by f both a measurable function in L 1 (, µ) and its equivalence class in L 1 (, µ). Also we say f, defined only almost everywhere on, belongs to L 1 (, µ), if there exists f L 1 (, µ), equal µ-almost everywhere to f. The quantity f L 1 defined by (4.1) is called the L 1 norm of f. In general, a normed linear space is a vector space equipped with a positive function v having the properties (4.3) av = a v, for v V, a C (or R), v + w v + w, v > 0, unless v = 0. The second of these conditions is called the triangle inequality. Given a norm on V, setting d(u, v) = u v defines a distance function on V, making it a metric space. It is easy to see that L 1 (, µ) is a vector space and that f L 1 satisfies the first two conditions in (4.3). However, f L 1 = 0 if and only if f = 0 41

2 42 4. L p Spaces almost everywhere. (Recall Exercise 4 of Chapter 3.) That is the reason we define L 1 (, µ) to consist of equivalence classes defined by (4.2), so L 1 (, µ) becomes a normed linear space. Generally speaking, a sequence (v j ) in a normed linear space is said to be a Cauchy sequence if v j v k 0 as j, k. If every Cauchy sequence has a limit in V, then V is said to be complete; a complete normed linear space is called a Banach space. Theorem 4.1. L 1 (, µ) is a Banach space. The proof of completeness of L 1 (, µ) makes use of the following two lemmas, which are essentially restatements of the Monotone Convergence Theorem and the Dominated Convergence Theorem, respectively. Lemma 4.2. If f j L 1 (, µ), 0 f 1 (x) f 2 (x), and f j L 1 C <, then lim f j (x) = f(x), with f L 1 (, µ) and f j f L 1 0 as j j. Proof. We know that f M + (). The Monotone Convergence Theorem implies f j dµ f dµ. Thus f dµ C. Since f j f L 1 = f dµ fj dµ in this case, the lemma follows. Lemma 4.3. If f j L 1 (, µ), lim f j (x) = f(x) µ-a.e., and if there is an F L 1 (, µ) such that f j (x) F (x) µ-a.e., for all j, then f L 1 (, µ), and f j f L 1 0. Proof. Apply the Dominated Convergence Theorem to g j = f j f 0 a.e. Note that g j 2F. To show L 1 (, µ) is complete, suppose (f n ) is Cauchy in L 1. Passing to a subsequence, we can assume f n+1 f n L 1 2 n. Consider the infinite series (4.4) f 1 (x) + [ fn+1 (x) f n (x) ]. n=1 Now the partial sums are dominated by (4.5) f 1 (x) + m f n+1 (x) f n (x) = f 1 (x) + G m (x), n=1 and since 0 G 1 G 2 and G m L 1 2 n 1, we deduce from Lemma 4.2 that G m G µ-a.e. and in L 1 -norm. Hence the infinite series

3 4. L p Spaces 43 (4.4) is convergent a.e., to a limit f(x), and via Lemma 4.3 we deduce that f n f in L 1 -norm. This proves completeness. Continuing with a description of L p spaces, we define L (, µ) to consist of bounded measurable functions, L (, µ) to consist of equivalence classes of such functions, via (4.2), and we define f L to be the smallest sup of f f. It is easy to show that L (, µ) is a Banach space. For p (1, ), we define L p (, µ) to consist of measurable functions f such that [ ] 1/p (4.6) f(x) p dµ(x) is finite. L p (, µ) consists of equivalence classes, via (4.2), and the L p -norm f L p is given by (4.6). This time it takes a little work to verify the triangle inequality. That this holds is the content of Minkowski s inequality: (4.7) f + g L p f L p + g L p. One neat way to establish this is by the following characterization of the L p -norm. Suppose p and q are related by (4.8) 1 p + 1 q = 1. We claim that, if f L p (, µ), (4.9) f L p = sup{ fh L 1 : h L q (, µ), h L q = 1}. We can apply (4.9) to f + g, which belongs to L p (, µ) if f and g do, since f + g p 2 p( f p + g p). Given this, (4.7) follows easily from the inequality (f + g)h L 1 fh L 1 + gh L 1. The identity (4.9) can be regarded as two inequalities. The part can be proved by choosing h(x) to be an appropriate multiple C f(x) p 1. We leave this as an exercise. The converse inequality,, is a consequence of Hölder s inequality: (4.10) f(x)g(x) dµ(x) f L p g L q, 1 p + 1 q = 1. Hölder s inequality can be proved via the following inequality for positive numbers: (4.11) ab ap p + bq q for a, b > 0,

4 44 4. L p Spaces assuming that p (1, ) and (4.8) holds. a, b > 0, 1/p + 1/q = 1, In fact, we claim that, given (4.12) ϕ(t) = ap p tp + bq q t q = inf ϕ(t) = ab, t>0 which implies (4.11) since the right side of (4.11) is ϕ(1). As for (4.12), note that ϕ(t) as t 0 and as t, and the unique critical point occurs for a p t p = b q t q, i.e., for t = b 1/p /a 1/q, giving the desired conclusion. (4.13) Applying (4.11) to the integrand in (4.10) gives f(x)g(x) dµ(x) 1 p f p L p + 1 q g q L q. This looks weaker than (4.10), but now replace f by tf and g by t 1 g, so that the left side of (4.13) is dominated by (4.14) t p p f p L p + 1 qt q g q L q, for all t > 0. Another application of (4.12) then gives Hölder s inequality. Consequently (4.6) defines a norm on L p (, µ). Completeness follows as in the p = 1 case discussed above. In detail, given (f n ) Cauchy in L p (, µ), we can pass to the case f n+1 f n L p 2 n and define G m as in (4.5). We have G m L p 1, and hence (via the Monotone Convergence Theorem) deduce that G m G, µ-a.e., and in L p -norm. Hence the series (4.4) converges, µ-a.e., to a limit f(x). Since f f m+1 G G m, we have by the Dominated Convergence Theorem that f f m+1 p dµ (G G m ) p dµ 0, as m. Hence L p (, µ) is complete. To summarize, we have Theorem 4.4. For p [1, ), L p (, µ), with norm given by (4.6), is a Banach space. It is frequently useful to show that a certain linear subspace L of a Banach space V is dense. We give an important case of this here; C() denotes the space of continuous functions on. Proposition 4.5. If µ is a finite Borel measure on a compact metric space, then C() is dense in L p (, µ) for each p [1, ).

5 4. L p Spaces 45 Proof. First, let K be any compact subset of. The functions (4.15) f K,n (x) = [ 1 + n dist(x, K) ] 1 C() are all 1 and decrease monotonically to the characteristic function χ K equal to 1 on K, 0 on \ K. The Monotone Convergence Theorem gives f K,n χ K in L p (, µ) for 1 p <. Now let A be any measurable set. Any Borel measure on a compact metric space is regular, i.e., (4.16) µ(a) = sup{µ(k) : K A, K compact}. In case = I = [a, b] and µ = m is Lebesgue measure, this follows from (2.20) together with the consequence of Theorem 2.11, that all Borel sets in I are Lebesgue measurable. The general case follows from results that will be established in the next chapter; see (5.60). Thus there exists an increasing sequence K j of compact subsets of A such that µ(a \ j K j) = 0. Again, the Monotone Convergence Theorem implies χ Kj χ A in L p (, µ) for 1 p <. Thus all simple functions on are in the closure of C() in L p (, µ) for p [1, ). Construction of L p (, µ) directly shows that each f L p (, µ) is a norm limit of simple functions, so the result is proved. Using a cut-off, we can easily deduce the following. Let C 00 (R) denote the space of continuous functions on R with compact support. Corollary 4.6. For 1 p <, the space C 00 (R) is dense in L p (R). The case L 2 (, µ) is special. In addition to the L 2 -norm, there is an inner product, defined by (4.17) (f, g) L 2 = f(x)g(x) dµ(x). This makes L 2 (, µ) into a Hilbert space. It is worthwhile to consider the general notion of Hilbert space in some detail. We devote the next few pages to this and then return to the specific consideration of L 2 (, µ). Generally, a Hilbert space H is a complete inner product space. That is to say, first the space H is a linear space provided with an inner product, denoted (u, v), for u and v in H, satisfying the following defining conditions: (4.18) (au 1 + u 2, v) = a(u 1, v) + (u 2, v), (u, v) = (v, u), (u, u) > 0 unless u = 0.

6 46 4. L p Spaces To such an inner product there is assigned a norm, denoted by (4.19) u = (u, u). To establish that the triangle inequality holds for u + v, we can expand u + v 2 = (u + v, u + v) and deduce that this is [ u + v ] 2, as a consequence of Cauchy s inequality: (4.20) (u, v) u v, a result that can be proved as follows. The fact that (u v, u v) 0 implies 2 Re (u, v) u 2 + v 2 ; replacing u by e iθ u with e iθ chosen so that e iθ (u, v) is real and positive, we get (4.21) (u, v) 1 2 u v 2. Now in (4.21) we can replace u by tu and v by t 1 v to get (4.22) (u, v) t 2 u t v 2. Minimizing over t gives (4.20). This establishes Cauchy s inequality, so we can deduce the triangle inequality. Thus (4.19) defines a norm on H. Note the parallel between this argument and the proof of (4.7), via (4.10). The completeness hypothesis on H is that, with this norm, H is a Banach space. The nice properties of Hilbert spaces arise from their similarity with familiar Euclidean space, so a great deal of geometrical intuition is available. For example, we say u and v are orthogonal and write u v, provided (u, v) = 0. Note that the Pythagorean Theorem holds on a general Hilbert space: (4.23) u v = u + v 2 = u 2 + v 2. This follows directly from expanding (u + v, u + v). Another useful identity is the following, called the parallelogram law, valid for all u, v H : (4.24) u + v 2 + u v 2 = 2 u v 2. This also follows directly by expanding (u+v, u+v)+(u v, u v), observing some cancellations. One important application of this simple identity is to the following existence result. Let K be any closed, convex subset of H. Convexity implies x, y K (x + y)/2 K. Given x H, we define the distance from x to K to be (4.25) d(x, K) = inf { x y : y K}.

7 4. L p Spaces 47 Proposition 4.7. If K H is a nonempty, closed, convex set in a Hilbert space H and if x H, then there is a unique z K such that d(x, K) = x z. Proof. We can pick y n K such that x y n d = d(x, K). It will suffice to show that (y n ) must be a Cauchy sequence. Use (4.24) with u = y m x, v = x y n, to get y m y n 2 = 2 y n x y m x 2 4 x 1 2 (y n + y m ) 2. Since K is convex, (y n + y m )/2 K, so x (y n + y m )/2 d. Therefore which implies convergence. lim sup y n y m 2 2d 2 + 2d 2 4d 2 0, m,n In particular, this result applies when K is a closed linear subspace of H. In this case, for x H, denote by P K x the point in K closest to x. We have (4.26) x = P K x + (x P K x). We claim that x P K x belongs to the closed linear space K, called the orthogonal complement of K, defined by (4.27) K = {u H : (u, v) = 0 for all v K}. Indeed, take any v K. Then (t) = x P K x + tv 2 = x P K x 2 + 2t Re (x P K x, v) + t 2 v 2 is minimal at t = 0, so (0) = 0, i.e., Re (x P K x, v) = 0, for all v K. Replacing v by iv shows that (x P K x, v) also has vanishing imaginary part for any v K, so our claim is established. The decomposition (4.26) gives (4.28) x = x 1 + x 2, x 1 K, x 2 K, with x 1 = P K x, x 2 = x P K x. Clearly such a decomposition is unique. This implies that H is an orthogonal direct sum of K and K ; we write (4.29) H = K K.

8 48 4. L p Spaces From this it is clear that (4.30) ( K ) = K, that (4.31) x P K x = P K x, and that P K and P K are linear maps on H. We call P K the orthogonal projection of H on K. Note that P K x is uniquely characterized by the condition (4.32) P K x K, (P K x, v) = (x, v) for all v K. We remark that if K is a linear subspace of H that is not closed, then K coincides with K, and (4.30) becomes ( K ) = K. Using the orthogonal projection discussed above, we can establish the following result. Proposition 4.8. If H is a Hilbert space and ϕ : H C is a continuous linear map, there exists a unique f H such that (4.33) ϕ(u) = (u, f) for all u H. Proof. Consider K = Ker ϕ = {u H : ϕ(u) = 0}, a closed linear subspace of H. If K = H, ϕ = 0 and we can take f = 0. Otherwise, K 0; select a nonzero x 0 K, such that ϕ(x 0 ) = 1. We claim K is one dimensional in this case. Indeed, given any y K, y ϕ(y)x 0 is annihilated by ϕ, so it belongs to K as well as to K, so it is zero. The result is now easily proved by setting f = ax 0 with a C chosen so that (4.33) works for u = x 0, namely a(x 0, x 0 ) = 1, i.e., a = x 0 2. We note that the correspondence ϕ f gives a conjugate linear isomorphism (4.34) H H, where H denotes the space of all continuous linear maps ϕ : H C. Recall that our interest in Hilbert spaces arises from our interest in L 2 (, µ). Let us record the content of Proposition 4.8 in that case.

9 4. L p Spaces 49 Corollary 4.9. If ϕ : L 2 (, µ) C is a continuous linear map, there exists a unique f L 2 (, µ) such that (4.35) ϕ(u) = u(x)f(x) dµ(x), u L 2 (, µ). We can use orthogonal projection operators to construct an orthonormal basis of a Hilbert space H. Let us assume H is separable, i.e., H has a countable dense subset S = {v j : j 1}. See the exercises for results on separability. In such a case, pick a countable subset {w j : j 1} of S such that each w k is linearly independent of {w j : j < k} and such that the linear span of {w j } is dense in H. Let L k = span {w j : 1 j k}. We define an orthonormal set {u j : j 1} inductively, as follows. Set u 1 = w 1 / w 1. Suppose you have {u j : 1 j k}, an orthonormal basis of L k. Then set (4.36) u k+1 = w k+1 P k w k+1 w k+1 P k w k+1, where P k is the orthogonal projection onto L k. One does not need the construction involving Proposition 4.7 to get P k here. We can simply set (4.37) P k f = k (f, u j )u j. j=1 The set {u j : j 1} so constructed is orthonormal, i.e., (u k, u l ) = δ kl. Also its linear span is dense in H, since the linear span coincides with that of {w j : j 1}. We claim that, for each f H, P k f f as k. To see this, note that (4.38) f 2 = P k f 2 + f P k f 2 P k f 2 = k (f, u j ) 2. We also see that, if n k, then P n f P k f 2 = k<j n (f, u j) 2, and hence that (P k f) is a Cauchy sequence in H, for each f. We claim that the limit is equal to f, hence that j=1 (4.39) f = j (f, u j )u j. Indeed, we now know that the right side of (4.39) defines an element of H; call it g. Then, f g has inner product 0 with each u j, hence with all

10 50 4. L p Spaces elements of the linear span of {u j }, hence with all elements of the closure, i.e., with all elements of H, so f g = 0. In the case H = L 2 (I, m), with I = [ π, π] and m = dx/2π, an orthonormal basis is given by (4.40) e k (x) = e ikx, k Z. See the exercises for a proof of this. In such a case, (4.39) is the expansion of a function in a Fourier series. We use Corollary 4.9 to prove an important result known as the Radon- Nikodym Theorem. Let µ and ν be two finite measures on (, F). Let (4.41) α = µ + 2ν, ω = 2µ + ν. On the Hilbert space H = L 2 (, α), consider the linear functional ϕ : H C given by (4.42) ϕ(f) = f(x) dω(x). Note that ϕ(f) 2 f dα 2 α() f L 2 (,α). By Corollary 4.9, there exists g L 2 (, α) such that, for any f L 2 (, α) = L 2 (, µ) L 2 (, ν), (4.43) f(x) dω(x) = f(x)g(x) dα(x). In particular, this holds for any bounded measurable f. Note that this identity is equivalent to (4.44) f(2g 1) dν = f(2 g) dµ, for all f L 2 (, α). If we let f be the characteristic function of S 1l = {x : g(x) < 1/2 1/l} or of S 2l = {x : g(x) > 2 + 1/l}, we see that µ(s jl ) = ν(s jl ) = 0. As a consequence, we can arrange that 1/2 g(x) 2, for all x. We also see that Z = {x : g(x) = 1/2} must have µ-measure zero. (Similarly, {x : g(x) = 2} has ν-measure zero.) Also, (4.44) holds for all f M + (), by the Monotone Convergence Theorem. We say that ν is absolutely continuous with respect to µ and write ν << µ, provided (4.45) µ(s) = 0 = ν(s) = 0.

11 4. L p Spaces 51 In such a case, we see that Z = {x : g(x) = 1/2} has ν-measure zero. Given F M + (), we can set (4.46) f(x) = F (x) 2g(x) 1, and apply (4.44) to get (4.47) F (x) dν(x) = 2 g(x) h(x) = 2g(x) 1 F (x)h(x) dµ(x) for all positive measurable F. Note that taking F = 1 gives h L 1 (, µ). The result we have just obtained is known as the Radon-Nikodym Theorem. We record a formal statement. Theorem Let µ and ν be two finite measures on (, F). If ν is absolutely continuous with respect to µ, then (4.47) holds for some nonnegative h L 1 (, µ) and every positive measurable F. We mention that (4.47) also holds for every bounded measurable F. If we do not assume that ν << µ, we can still consider (4.48) h(x) = 2 g(x) 2g(x) 1 if g(x) 1 2, 0 if g(x) = 1 2, and we have (4.49) F dν = F h dµ Y Y for any positive measurable F, where (4.50) Y = \ Z = { x : g(x) 1 }. 2 Recall that µ( \ Y ) = 0. We can define the measure λ on (, F) by (4.51) λ(e) = ν(y E). Then we have (4.52) F dλ = F h dµ

12 52 4. L p Spaces for all positive measurable F. Write (4.53) ρ(e) = ν(e \ Y ) = ν(e Z), so (4.54) ν = λ + ρ. Now the measure λ is supported on Y, i.e., λ( \ Y ) = 0. Similarly, ρ is supported on Z. Thus λ and ρ have disjoint supports. Generally, two measures with disjoint supports are said to be mutually singular. When two measures λ and ρ are mutually singular, we write λ ρ. We have the following result, known as the Lebesgue decomposition of ν with respect to µ. Theorem If µ and ν are finite measures on (, F), then we can write (4.55) ν = λ + ρ, λ << µ, ρ µ. This decomposition is unique. Proof. The measures λ and ρ are given by (4.51) and (4.52). The fact that λ << µ is contained in (4.52). As we have noted, µ( \ Y ) = 0, so µ is supported on Y, which is disjoint from Z, on which ρ is supported; hence ρ µ. If also λ and ρ are measures such that ν = λ + ρ, λ << µ, ρ µ, we have Z F such that ρ is supported on Z and µ( Z) = 0. Now µ(z Z) = 0, so λ(z Z) = 0 and λ(z Z) = 0, and, for E M, This gives uniqueness. λ(e) = λ(e \ Z) = ν ( E \ (Z Z) ), λ(e) = λ(e \ Z) = ν ( E \ (Z Z) ). We say a measure µ on (, F) is σ-finite if we can write as a countable union j 1 j where j F and µ( j ) <. A paradigm case is Lebesgue measure on = R. There are routine extensions of Theorems to the case where µ and ν are σ-finite measures, which we leave to the reader. Exercises 1. Let V and W be normed linear spaces. Suppose we have linear transformations (4.56) T j : V W, T j v W C v V,

13 4. L p Spaces 53 with C independent of j. (We say {T j } is uniformly bounded.) Suppose also T : V W satisfies this bound. Let L be a dense subspace of V. Then show that (4.57) T j v T v, v L = T j v T v, v V. 2. Define (4.58) τ s : L p (R) L p (R), τ s f(x) = f(x s). Show that, for p [1, ), (4.59) f L p (R) = τ s f f in L p -norm, as s 0. Hint. Apply Exercise 1, with V = W = L p (R), L = C 00 (R), as in Corollary 4.6. Note that τ s f L p = f L p. One says a metric space is separable if it has a countable dense subset. 3. If I = [a, b] R and a α < β b, define ϕ αβ (x) = dist ( x, I \ [α, β] ). Show that the linear span over Q of {ϕ αβ : α, β Q I} is dense in C(I), and deduce that C(I) is separable. From the denseness and continuity of the inclusion ι : C(I) L p (I), prove that L p (I) is separable, for 1 p <. Then prove that L p (R) is separable, for 1 p <. 4. Let be a compact metric space; has a countable dense subset {z j : j 1}. Given 0 < ρ < (diam )/2, set ψ jρ (x) = dist ( x, \ B ρ (z j ) ). Show that the algebra generated by {ψ j,ρ : j Z +, ρ Q + } and 1 is dense in C() and deduce that C() is separable. Conclude, from Proposition 4.5, that L p (, µ) is separable, for p [1, ), if µ is a finite measure on the σ-algebra of Borel sets in. 5. Let {u j : j 1} be a countable orthonormal set in a Hilbert space H. Show that (4.60) (f, u j )u j = P V f, j=1

14 54 4. L p Spaces where V is the closure of the linear span of {u j }. The Stone-Weierstrass Theorem states that, if is a compact Hausdorff space and A an algebra of functions in C R () (the space of real-valued continuous functions on ), such that 1 A, and if A has the property of separating points, i.e., for any two distinct p, q, there exists f A such that f(p) f(q), then A is dense in C R (). If A is an algebra in C C () with these properties, plus the property that f A f A, then A is dense in C C (). A proof is given in Appendix A. 6. Use the Stone-Weierstrass Theorem to show that, if e k (x) = e ikx, as in (4.40), then the linear span E of {e k : k Z} is dense in C(S 1 ), where S 1 = R/2πZ; hence E is dense in L p (S 1, dx/2π), for p [1, ). Hence {e k : k Z} is an orthonormal basis of L 2 (S 1, dx/2π). 7. For f, u C0 (R), the space of smooth functions with compact support in R, set (4.61) K f u(x) = f u(x) = f(y)u(x y) dy. Show that, for 1 p <, K f has a unique bounded extension: (4.62) K f : L p (R) L p (R), K f u L p f L 1 u L p. The operation in (4.61) is called convolution. Hint. For f, u C0 (R), if f is supported in [a, b], show that n f u(x) = lim n b a n j=0 ( j ( f n b + 1 j ) ) a τ j u(x), n where τ j u(x) = u(x jb/n (1 j/n)a). Use the triangle inequality (4.7) to estimate norms. 8. Show that there is a unique extension from f C 0 (R) to f L1 (R) of K f u, with (4.62) continuing to hold, giving a continuous linear map K : L 1 (R) L(L p (R)). 9. Let f j be a sequence of nonnegative functions in L 1 (R) such that (4.63) f j dx = 1, supp f j {x R : x < 1/j}. Show that, for 1 p <, (4.64) u L p (R) = f j u u in L p norm, as j.

15 4. L p Spaces 55 Derive the same conclusion, upon weakening the second hypothesis in (4.63) to f j dx = β j (ε) 1 as j, ε > 0. x <ε Hint. First verify the conclusion for u C 0 (R). Then use Exercise Given f L 1 (S 1 ), 0 < r < 1, define (4.65) P r f(θ) = Show that n= (4.66) P r f(θ) = p r f(θ) = 1 2π where (4.67) p r (θ) = Show that ˆf(n)r n e inθ 1 2π, ˆf(n) = f(θ)e inθ dθ. 2π 0 n= r n e inθ = 2π 0 p r (θ ϕ)f(ϕ) dϕ, 1 r 2 1 2r cos θ + r 2. (4.68) 1 2π p r (θ) dθ = 1. 2π If f L p (S 1 ), 1 p <, show that (4.69) P r f f, as r 1, in L p -norm. If f C(S 1 ), show that you have uniform convergence in (4.69). This is known as Abel convergence of Fourier series. Hint. Use a variant of the analysis needed for Exercise Show that Exercises provide an alternative proof of the conclusion of Exercise 6, that the linear span of e k (θ) = e ikθ, k Z, is dense in C(S 1 ) and in L p (S 1 ), for 1 p <, and hence that {e k : k Z} is an orthonormal basis of L 2 (S 1, dθ/2π). 13. Suppose (, F, µ) is the completion of (, F, µ). Show that L p (, µ) and L p (, µ) are identical.

16 56 4. L p Spaces Hint. Consult Exercise 6 of Chapter Show that if f L p (, µ) and p [1, ), then, for λ (0, ), (4.70) µ ({ x : f(x) > λ }) λ p f p L p. Deduce that if f k 0 in L p -norm, for some p [1, ), then f k 0 in measure, as defined in Exercise 10 of Chapter 3. Hint. Denote the set being measured in (4.70) by E λ and note that E λ f p dµ λ p µ(e λ ). The inequality (4.70) is called Tchebychev s inequality.

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

Inner product. Definition of inner product

Inner product. Definition of inner product Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra 54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue

More information

DISINTEGRATION OF MEASURES

DISINTEGRATION OF MEASURES DISINTEGRTION OF MESURES BEN HES Definition 1. Let (, M, λ), (, N, µ) be sigma-finite measure spaces and let T : be a measurable map. (T, µ)-disintegration is a collection {λ y } y of measures on M such

More information

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

More information

3. INNER PRODUCT SPACES

3. INNER PRODUCT SPACES . INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

More information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm

1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

More information

MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich

MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites

More information

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

More information

Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

Metric Spaces. Chapter 1

Metric Spaces. Chapter 1 Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

Metric Spaces Joseph Muscat 2003 (Last revised May 2009) 1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

More information

and s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space

and s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

More information

1 Norms and Vector Spaces

1 Norms and Vector Spaces 008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

More information

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE. Contents THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Chapter 5. Banach Spaces

Chapter 5. Banach Spaces 9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

More information

16.3 Fredholm Operators

16.3 Fredholm Operators Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this

More information

Lecture Notes on Measure Theory and Functional Analysis

Lecture Notes on Measure Theory and Functional Analysis Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents

More information

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

α = u v. In other words, Orthogonal Projection

α = u v. In other words, Orthogonal Projection Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

More information

How To Prove The Dirichlet Unit Theorem

How To Prove The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

it is easy to see that α = a

it is easy to see that α = a 21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

More information

Section 4.4 Inner Product Spaces

Section 4.4 Inner Product Spaces Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

More information

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

More information

2.3 Convex Constrained Optimization Problems

2.3 Convex Constrained Optimization Problems 42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

More information

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Let H and J be as in the above lemma. The result of the lemma shows that the integral Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;

More information

0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup

0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup 456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),

More information

Tensor product of vector spaces

Tensor product of vector spaces Tensor product of vector spaces Construction Let V,W be vector spaces over K = R or C. Let F denote the vector space freely generated by the set V W and let N F denote the subspace spanned by the elements

More information

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. We study and characterize the integral multilinear operators on a product of C(K) spaces in terms of the

More information

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

More information

FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples First recall the basic definitions regarding operators. Definition 1.1 (Continuous

More information

Orthogonal Diagonalization of Symmetric Matrices

Orthogonal Diagonalization of Symmetric Matrices MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

More information

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

More information

The Ideal Class Group

The Ideal Class Group Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

More information

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function 17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):

More information

LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

More information

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

More information

Duality of linear conic problems

Duality of linear conic problems Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

More information

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold: Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

More information

(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties

(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry

More information

Separation Properties for Locally Convex Cones

Separation Properties for Locally Convex Cones Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

More information

GROUPS ACTING ON A SET

GROUPS ACTING ON A SET GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

More information

Finite dimensional C -algebras

Finite dimensional C -algebras Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n

More information

Adaptive Online Gradient Descent

Adaptive Online Gradient Descent Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

More information

ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

More information

2 Fourier Analysis and Analytic Functions

2 Fourier Analysis and Analytic Functions 2 Fourier Analysis and Analytic Functions 2.1 Trigonometric Series One of the most important tools for the investigation of linear systems is Fourier analysis. Let f L 1 be a complex-valued Lebesgue-integrable

More information

Finite dimensional topological vector spaces

Finite dimensional topological vector spaces Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

More information

9 More on differentiation

9 More on differentiation Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......

More information

T ( a i x i ) = a i T (x i ).

T ( a i x i ) = a i T (x i ). Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

More information

Fixed Point Theorems

Fixed Point Theorems Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

More information

Section 1.1. Introduction to R n

Section 1.1. Introduction to R n The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

More information

Convex analysis and profit/cost/support functions

Convex analysis and profit/cost/support functions CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m

More information

Methods for Finding Bases

Methods for Finding Bases Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

More information

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

On the structure of C -algebra generated by a family of partial isometries and multipliers

On the structure of C -algebra generated by a family of partial isometries and multipliers Armenian Journal of Mathematics Volume 7, Number 1, 2015, 50 58 On the structure of C -algebra generated by a family of partial isometries and multipliers A. Yu. Kuznetsova and Ye. V. Patrin Kazan Federal

More information

An optimal transportation problem with import/export taxes on the boundary

An optimal transportation problem with import/export taxes on the boundary An optimal transportation problem with import/export taxes on the boundary Julián Toledo Workshop International sur les Mathématiques et l Environnement Essaouira, November 2012..................... Joint

More information

CHAPTER 1 BASIC TOPOLOGY

CHAPTER 1 BASIC TOPOLOGY CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is

More information

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity

More information

THE DIMENSION OF A CLOSED SUBSET OF R n AND RELATED FUNCTION SPACES

THE DIMENSION OF A CLOSED SUBSET OF R n AND RELATED FUNCTION SPACES THE DIMENSION OF A CLOSED SUBSET OF R n AND RELATED FUNCTION SPACES HANS TRIEBEL and HEIKE WINKELVOSS (Jena) Dedicated to Professor Károly Tandori on his seventieth birthday 1 Introduction Let F be a closed

More information

Extension of measure

Extension of measure 1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.

More information

Orthogonal Projections and Orthonormal Bases

Orthogonal Projections and Orthonormal Bases CS 3, HANDOUT -A, 3 November 04 (adjusted on 7 November 04) Orthogonal Projections and Orthonormal Bases (continuation of Handout 07 of 6 September 04) Definition (Orthogonality, length, unit vectors).

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5. PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

LEARNING OBJECTIVES FOR THIS CHAPTER

LEARNING OBJECTIVES FOR THIS CHAPTER CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

More information

UNIVERSITETET I OSLO

UNIVERSITETET I OSLO NIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: Trial exam Partial differential equations and Sobolev spaces I. Day of examination: November 18. 2009. Examination hours:

More information

On Nicely Smooth Banach Spaces

On Nicely Smooth Banach Spaces E extracta mathematicae Vol. 16, Núm. 1, 27 45 (2001) On Nicely Smooth Banach Spaces Pradipta Bandyopadhyay, Sudeshna Basu Stat-Math Unit, Indian Statistical Institute, 203 B.T. Road, Calcutta 700035,

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

More information

1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES 1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

More information

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

More information

MA106 Linear Algebra lecture notes

MA106 Linear Algebra lecture notes MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector

More information

Lebesgue Measure on R n

Lebesgue Measure on R n 8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that

More information