Exercise Solutions to Real Analysis

Size: px
Start display at page:

Download "Exercise Solutions to Real Analysis"

Transcription

1 xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there s nothng to prove (take O = R). Suppose now that ɛ > 0 s gven m A <. By defnton, we have, { } m A = nf l(a n, b n ) : A n N (a n, b n ) n N So, by approxmaton for nfma, we know that there exst (a n, b n ) R such that A n N (a n, b n ) l(a n, b n ) m A + ɛ n N So take O = n N (a n, b n ). Then O s open, A O by subaddtvty we have: m O n N l(a n, b n ) m A + ɛ xersze 2. Suppose A, B R m A = 0, then m (A B) = m B Soluton 2. We have from subaddtvty, The result follows. m B m (A B) m A + m B = 0 + m B = m B xersze 3. If A s measurable then, for every ɛ > 0, there s an open set O contanng A such that m(o \ A) < ɛ Soluton 3. Suppose that ɛ > 0 s gven. Then we know by problem 1 that there s an open set O contanng A such that m O < m A + ɛ. In partcular, snce A s measurable O s open (hence also measurable) we may replace m wth m: mo ma < ɛ. On the other h, by measurablty of A the denttes O \ A = O A c, O A = A we get: m(o) = m(a O) + m(a c O) = m(a) + m(o \ A) So ɛ > m(o) m(a) = m(o \ A) xersze 4. If A s measurable then, for every ɛ > 0, there s a closed set C contaned n A such that m(a \ C) < ɛ 1

2 Soluton 4. Snce A s measurable, so s A c. So, gven ɛ > 0, there s O open, contanng A c, such that m(o \ A c ) < ɛ. But then O c s closed s contaned n A. Further, A \ O c = A O = O \ A c. So m(a \ O c ) = m(o \ A c ) < ɛ. xersze 5. Show that f s any measurable set, then ν ν ν + ν ν () Soluton 5. Let A, B be the Hahn decomposton, A postve B negatve. ν + () = ν(a ) 0 ν () = ν(b ) 0. Snce A B are dsjont, we have ν() = ν + () ν () It follows mmedately that ν ν ν + Now, ν = ν + ν ν + + ν = ν + + ν = ν (), snce ν + ν are postve. xersze 6. Show that f ν 1 ν 2 are any two fnte sgned measures, then so s αν 1 + βν 2, where α β are real numbers. Show that αν = α ν ν 1 + ν 2 nu 1 + ν 2 Soluton 6. Set, for convenence, µ = αν 1 +βν 2. It s clear that µ( ) = 0. Further, snce ν 1 ν 2 are fnte measures, µ never admts + or. Now, suppose that {A } s a collecton of dsjont sets. Then we have: µ ( =1A ) = αν 1 ( =1A ) + βν 2 ( =1A ) Now, snce ν 1 ν 2 are sgned measures, ether γν j (A ) =1 converges absolutely, or dverges properly (wth j = 1, 2, γ = α, β respectvely). Now, sum of absolutely convergent seres s agan absolutely convergent. Further, f one s properly dvergent, then so s the sum. In both cases, the sum of the seres can be taken term-by-term. Hence we have: µ( =1A ) = αν 1 (A ) + βν 2 (A ) = (αν 1 (A ) + βν 2 (A )) = µ(a ) =1 =1 Fntude of µ s mmedate by trangle nequalty for real numbers (snce both ν 1 ν 2 are fnte). Now, f ν s or, equalty holds for every nonzero α: αν = α ν. On the other h, snce ν s a fnte real number, we clearly have αν = α ν. Now, assumng that ν 1 + ν 2 s never of the form, f ν 1 + ν 2 =, then clearly ether ν 1 = ± or ν 2 = ±. In ether case, equalty holds: ν 1 + ν 2 = ν 1 + ν 2. If, however, ν 1 + ν 2 s fnte, then both ν 1 ν 2 are fnte. So by trangle nequalty for real numbers we get ν 1 + ν 2 ν 1 + ν 2 =1 =1

3 (of course, above when we speak about the numerc value of ν 1 ν 2, we essentally mean ν 1, ν 2 for a rom measurable set ). xersze 7. We defne ntegraton wth respectt to a sgned measure ν by defnng fdν = fdν + fdν If f M, fdν M ν () Moreover, there s a measurable functon f wth f 1 such that fdν = ν () Soluton 7. Note, that snce ν s a sgned measure, t does not admt both +. In ths case the ntegral f well-defned, snce there doesn t exst a set wth ν + = ν =. So, f f M, fdν = fdν + fdν fdν + + fdν Now, snce ν + ν are both postve measures, the ntegrals wth respect to those measures are defned n the usual sense. Hence all the stard theorems apply. Thus: fdν + + fdν f dν + + f dν M(ν + + ν ) = M ν () Now, let A B be the Hahn decomposton. Defne f(x) = A B. Then we have: fdν = fdν + fdν = A dν + + B dν = Also, t s clear that f 1. ν + (A ) + ν (B ) = ν () xersze 8. (a) Show that the Radon-Nkodym Theorem for a fnte measure µ mples the theorem for a σ-fnte measure µ. (b) Show the unqueness of the functon f n the Radon-Nkodym Theorem. Soluton 8. (a) Suppose that the theorem holds for fnte measures. Suppose now that µ s a σ-fnte measure on. Wrte = of µ-fnte, dsjont sets. Then we know that there exst functons f on such that ν = f for every measurable subset of. Now, defne f = f. Clearly f s nonnegatve measurable. Now, let be a µ-measurable subset of. Let =. form a famly of dsjont measurable sets =. Further, ν = ν = f

4 Snce each f s nonnegatve, f = f = Unqueness of such f s forced by ts exstence (see (b) below). (b) We ll use the decomposton from (a). Observe that each f s unque (a.e. [µ]) on each, for suppose that g s another famly of functons wth f = g But then (f g ) = 0 forcng f = g a.e. on. So, by unqueness of each f on, we conclude that f s also unque (a.e.). xersze 9. Radon-Nkodym dervatves. Let µ, ν, λ be σ-fnte. Show that the Radon-Nkodym dervatve [dν/] has the followng propertes: f (a) If ν µ f s a nonnegatve measurable functon, then [ ] dν fdν = f. (b) (c) If ν µ λ, then (d) If ν µ µ ν, then [ Soluton 9. Let g = [ ] d(ν1 + dν 2 ) = dν ]. [ ] dν = dλ [ ] dν = [ dν [ ] dν1 + ] [ ]. dλ [ ] 1. dν [ ] dν2. Snce fdν = fdν + fdν by defnton, t wll suffce to prove the asserton for fdν + fdν By symmetry snce ν + ν n fact both are postve measures, t wll suffce to prove the asserton only for, say, ν +. The other case wll follow smlarly. Set

5 η = ν +. Suppose that φ s a nonnegatve smple functon φ(x) = a such that φ f. We have: φdη = a η = a g = φg And by defnton we have φg = φg + φg Takng the supremum over all such φ observng that µ + µ, both are fnte, φg s measurable, nonnegatve φg f, we obtan: ( ) sup φg = sup φg + φg = sup φg + sup φg = fg fg + = fg (b) Ths s straghtforward. We have, for every measurable, [ ] [ ] ([ ] dν1 dν2 dν1 (ν 1 + ν 2 ) = + = + So by unqueness, [ ] d(ν1 + dν 2 ) = [ ] dν1 + [ ] dν2. [ dν2 ]) (c) Ths one s also straghtforward: Observe that for each measurable, [ ] dν ν = But by part (a) we have: So by unqueness we obtan: [ ] dν = [ ] dν = dλ [ dν [ dν ] [ ] dλ dλ ] [ ]. dλ (d) Well, snce µ ν, for each measurable we have [ ] µ = dν dν By part (a) we get [ ] [ ] [ ] dν dν = dν dν Snce µ µ from defnton of the ntegral, µ = 1

6 for each measurable, by the unqueness of the Rodon-Nykodm dervatve we obtan [ ] [ ] dν 1 = dν a.e. Hence a.e. [ ] = dν [ ] 1 dν xersze 10. (a) Show that f ν s a sgned measure such that ν µ ν µ, then ν = 0. (b) Show that f ν 1 ν 2 are sgular wth respect to µ, then so s αν 1 + βν 2. (c) Show that f ν 1 ν 2 are absolutely contnuous wth respect to µ, so s αν 1 + βν 2. (d) Prove the ungueness asserton n the Lebesgue decomposton. Soluton 10. (a) Let = A B such that νa = µb = 0. Then clearly ν s zero for every subset of A, snce ν µ s taken to mean ν µ. That s to say, ν A = µ B = 0. Further, snce ν µ for each subset of C of B, µc = 0, we observe that νc = 0. Hence, f s any measurable subset of, wrtng = (A ) (B B), we conclude that nu = 0. (b) There exst decompostons A 1, B 1 A 2, B 2, A, B dsjont, such that = A B ν A = µb = 0. Let = A 1 A 2. Then c = A c 1 A c 2,, c for a decomposton of wth ν 1 = ν 2 = 0 µ c = 0. Hence, (c 1 ν 1 + c 2 ν 2 ) = µ c = 0 (c) Let be a µ-measurable subset of such that µ = 0. Then by hypothess ν 1 = ν 2 = 0. Hence (αν 1 + βν 2 ) = αν 1 + βν 2 = 0. (d) Suppose, by the Lebesgue decomposton, ν = ν 0 + ν 1 ν = ν 0 + ν 1. Then clearly 0 = (ν 0 ν 0 ) + (ν 1 ν 1 ). Observe that by parts (b) (c), (ν 0 ν 0 ) µ (ν 1 ν 1 ) µ. Hence there exsts a decomposton A, B such that (ν 1 ν 1 )A = µb = 0. So for each subset of B, by absolute contnuty, (ν 0 ν 0 ) = 0. Hence (ν 1 ν 1 ) = 0, so that ν 1 = ν 1. On the other h, for each subset of A, (ν 1 ν 1 ) = 0, so that (ν 0 ν 0 ) = 0, hence ν 0 = ν 0. Ths shows unqueness of ν 0 ν 1. xersze 11. Use the followng example to show that the hypothess n the Radon- Nkodym Theorem that µ s σ-fnte cannot be omtted. Let = [0, 1], B the class of Lebesgue measurable subsets of, take ν to be Lebesgue measure µ to be the countng measure on B. Then ν s fnte absolutely contnuous wth respect to µ, but there s no functon f such that ν = f for all B. At what pont does the proof of Theorem 23 break down for ths example? Soluton 11. Suppose that f s any nonnegatve µ-measurable functons on [0, 1]. Now, gven [0, 1], we see mmedately that f = α R + (the extended postve real numbers) where α s zero f f s zero (but ths s a pathologcal case whch we exclude mmedately); otherwse:

7 () α s fnte provded that s a fnte set f s bounded. But f s a fnte set, ν = 0, forcng f to be dentcally zero on every fnte subset of [0, 1], hence on [0, 1]. We already excluded ths case. () α s nfnte, then s nfnte or s fnte but f s not bounded on t. In the former case, ν s stll fnte, n the latter case, ν s zero. We see that Radon-Nykodm fals n ths case. Well, observe that the theorem s frst proved for µ fnte, then extended to the σ-fnte case. However, the extenson s vald only when can be decomposed nto a countable collecton of µ-fnte sets (see problem 4). However, [0, 1] cannot be decomposed nto a countable collecton of µ-fnte sets. In a sense, by soluton to problem 4, the extenson wll break down snce an uncountable sum s always properly dvergent (not to menton that we don t know how to take an ntegral of an uncountable sum, or to nterchange the ntegral the lmt n ths case). xersze 12. (a) Let L 1 (, m) be the metrc space wth dstance d(f, g) = tan 1 f g dm Defne convergence n measure as before. Prove that convergence n measure concdes wth convergence n ths metrc space. (b) do the same for f g d(f, g) = 1 + f g dm ( prove that t s a metrc, too). xtra: Show that ether one of these metrc spaces s complete. Soluton 12. (a) In general, convergence n measure only mples convergence of a subsequence a.e. But n ths case, we show that f f n f 0, then d(f n, f) 0. Observe frst that f φ(x) = x tan 1 (x), then φ (x) = x. Hence φ (x) > 0 2 for all x. Thus φ(x) s strctly ncreasng. Further, φ(0) = 0. Ths shows that φ(x) 0 for all x, hence x tan 1 (x) for all x. Usng ths, we have: d(f n, f) = tan 1 f n f dm f n f dm = f n f Thus, snce f n f 0, we must have d(f n, f) 0. f g 1+ f g (b) If we set d(f, g) = dm, only the trangle nequalty requres attenton (the other two propertes of a metrc are obvous). Set φ(x) = x 1+x. Then φ 1 (x) = (1+x) whch s clearly everywhere (on the nonnegatve axs) postve. 2 Hence φ s an ncreasng functon. So, φ( a + b ) φ( a + b ) = a + b a 1+ a + b 1+ b 1+ a + b = φ( a ) + φ( b ). Substtutng f g for a g h for b, we get φ( f h ) φ( f g ) + φ( g h ). Therefore, φ( f h )dm φ( f g )+φ( g h )dm = φ( f g )dm+ φ( g h )dm

8 So d(f, h) d(f, g) + d(g, h). Now, observe agan that f n f d(f n, f). Ths s obvous. Now usng the argument from part (a), we see that convergence n measure mples convergence n the metrc d. We show now completeness wth respect to the measure d(f, g) = f g 1+ f g. Suppose that f n s a Cauchy sequence. Set f = lmf n. Now, gven ɛ > 0, we know that there exsts N such that for all n, m N, we have d(f n, f m ) < ɛ/2. So, f n f m dm < ɛ/2 1 + f n f m But then, by Fatou s lemma, we get: f n f 1 + f n f dm = f n f m lm m 1 + f n f m dm lm m f n f m dm ɛ/2 < ɛ 1 + f n f m for all n N. Ths shows that d(f n, f) < ɛ for all n N. Hence f n converges to f. Further, snce f = lmf n, each f n s n L 1 (, m), we know that f s also n L 1 (, m). Ths establshes the result. xersze 13. Let ν : B R (no nfntes allowed!) be a sgned measure. Prove that sup A B ν(a) <, nf A B ν(a) >. Soluton 13. Suppose that for each natural m > 0 there exsts a measurable set A m wth ν(a m ) > m. Now, set B 1 = A 1 B n>1 = A n \ (A 1 A n 1 ). Clearly B form a collecton of dsjont sets, n fact, A n = n k=1 B k. Ths shows that, m < ν(a m ) = ν( m k=1b k ) Therefore, m < ν(b k ) = ν( k=1b k ) = k=1a k k=1 for all natural m > 0. Hence ν( k=1 A k) =. But ths cannot be by hypothess! Now, gven that ν s a measure, by problem 2, we see that ν s also a measure. Further, snce ν does not admt ±, nether does ν. Now apply the above result to ν. We see that sup A B ν(a) <. Hence nf A B ν(a) >. xersze 14. Prove that there exst A 1 A 2 so that ν(a 1 ) = sup A B ν(a) ν(a 2 ) = nf A B ν(a). Soluton 14. Frst of all, observe that snce ν( ) = 0, the nfmum s at most 0 the supremum s at least 0. Well, set S = sup A B ν(a) I = nf A B ν(a). If S =, then for each natural m > 0 there s a measurable A m wth ν(a m ) > m. Now apply the constructon n the frst part of problem 9 above to obtan a set A wth ν(a) =. Smlarly, f I =, then consder ν, whose supremum s. Apply the argument above to get a set A such that ν(a) =. Then ν(a) =. Suppose now that S, I are fnte real numbers. Then by approxmaton for the

9 suprema, for each natural n > 0, there exsts A n such that S 1/n ν(a n ) S. Consder B as n the frst part of problem 9. Set A = k=1 B k. Then clearly (see frst part of problem 9) ν(a) S 1/n for all n. But then ν(a) S. So ν(a) = S. Now consder ν apply the constructon above to get a set A such that ν(a) = I ( I s the supremum n ths case). But then ν(a) = I. xersze 15. xtend the Radon-Nkodym Theorem to the case of sgned measures. Soluton 15. xersze 16. Complex Measures. (a) Show that eacy complex measure ν may be expressed as ν = µ 1 µ 2 +µ 3 +µ 4, where µ are fnte measures. (b) Show that for each complex measure ν there s a measure µ a complexvalued measurable functon φ wth φ = 1 such that for each set n B, ν = φ Soluton 16. Lemma 0.1. Let (, B, µ) be a fnte measure space g an ntegrable functon such that for some constant M, gφ M φ p for all smple functons φ. Then g L q. xersze 17. Prove Lemma 0.1. Soluton 17. xersze 18. Show that Lemma 0.1 remans true f we only assume µ to be σ-fnte. Soluton 18. Lemma 0.2. Let n be a sequence of dsjont measurable sets, for each n let f n be a functon n L p (1 p < ) that vanshes outsde n. Set f = n=1 f n. Then f L p f only f f n p <. In ths case f = f n n L p ; that s, f f p 0 xersze 19. Prove Lemma 0.2 Soluton 19. =1 f p = f n p xersze 20. For g L q, let F be the lnear functonal on L p defned by F (f) = fg Show that F = g q. n=1

10 Soluton 20. xersze 21. Let µ be the countng measure on a countable set. Show that L p (µ) = l p. Soluton 21. xersze 22. Let µ 1, µ 2 be defned on the σ-algebra of Lebesgue measurable subsets of R by µ 1 (A) = n A 1 2 µ n 2 (A) = n A 1/n. Here n s taken to run through the natural numbers. xhbt a Hahn decomposton for 3µ 1 µ 2. Soluton 22. We show frst that µ 1 µ 2 are measures, µ 1 fnte µ 2 σ-fnte, whch wll establsh that 3µ 1 µ 2 s a sgned, σ-fnte measure. Well, notce that snce n runs over the set of natural numbers, we may restrct our attenton only to subsets A of (0, ). Clearly both are zero on the empty set. σ-addtvty follows from defnton of nfnte seres the fact that all terms are postve. Further, snce µ 1 (0, ) s smply a geometrc seres, t s fnte. Settng (0, ) = n [n 1, n], we see that µ 2 s σ-fnte. Now, observe that for all n 4, 3/2 n < 1/n. Conversely, for all n < 4, 3/2 n > 1/n. Hence we see that for every subset of of (0, 4), 3µ 1 () µ 2 () 0. On the other h, for every subset of [4, ), 3µ 1 () µ 2 () 0. Therefore we have the followng Hahn decomposton: A = (0, 4) B = [4, ). xersze 23. Fnd the Lebesgue decomposton for µ 1 w.r.t. µ 2 for µ 2 w.r.t. µ 1. Fnd correspondng Radon-Nkodym dervatves for the a.c. parts. Soluton 23. Set ν 0 = µ 1 ν 1 = 0. Let A = N B = (0, ) \ N. Then clearly ν 1 µ 2, snce ν 1 (A) = µ 2 (B) = 0. Now, f µ 2 () = 0, then N =. But n ths case µ 1 () = 0. Hence we see that ν 0 = µ 1 µ 2. Hence hour Lebesgue decomposton of µ 1 w.r.t. µ 2 s: µ 1 = ν 0 + ν 1 Repeat the process as above: set ν 0 = µ 2 ν 1 = 0. Then the Lebesgue decomposton of µ 2 w.r.t. µ 1 s µ 2 = ν 0 + ν 1 Snce µ 1 s the absolutely contnuous part of the Lebesgue decomposton w.r.t. µ 2, vce versa, we must fnd the Rodon-Nkodym dervatves f, g, such that: µ 1 () = f 2 Well, defne Then we have: f 2 = k=1 µ 2 () = f(x) = (k 1,k] k=1 g 1 k 2 k (k 1,k] f 2 = k=1 k 2 k µ 2( (k 1, k])

11 Observe that µ 2 ( (k 1, k]) = 0 f (k 1, k] = 1/k otherwse. In whch case, from above we obtan: { k 0 f (k 1, k] = 2 k µ 2( (k 1, k]) = 1/2 k otherwse Hence, Smlarly, settng one obtans xersze 24. Let µ 2 () = g(x) = k=1 µ 1 () = f 2 2 k k (k 1,k] g 1 1 µ 1 () = 1 + x 2 dx + 5δ 1 + 2δ π µ 2 () = dx + πδ 1 + 2δ e [0,1] Fnd the Lebesgue decomposton for µ 1 w.r.t. µ 2 for µ 2 w.r.t. µ 1. Fnd correspondng Radon-Nkodym dervatves for the a.c. parts. Soluton 24. Set ν 0 () = [0,1] dx + πδ 1 ν 1 () = 2δ e Set also A = R\{e} B = {e}. Observe that A B = R ν 1 (A) = µ 1 (B) = 0. So ν 1 µ 1. Further, suppose that µ 1 () = 0. Then we see that x 2 dx = 0 1, π /. But ths means that m() = 0 (where m s the Lebesgue measure) πδ 1 () = 0. Hence ν 0 () = 0, showng that ν 1 µ 1. It s clear that µ 2 = ν 0 + ν 1. For the other case, take ν 0 () = [0,1] x 2 dx + 5δ 1() 1 ν 1 () = [0,1] 1 + x 2 dx + 2δ π() c It s easy to see that µ 1 = ν 0 + ν 1 that ν 0 µ 2. Now, take A = [0, 1] {e} B = A c. Then we observe that ν 1 (A) = µ 2 (B) = 0, so that ν 1 µ 2. Ths gves the Lebesgue decomposton.

12 Now we fnd the Rodon-Nkodym dervatves n each case. So we must fnd measurable f, g such that: ν 0 () = f 1 ν 0 () = To ths end the followng result wll be useful. g 2 Proposton 0.3. Suppose that µ 1, µ 2,..., µ n are postve measures on a measure space (B, ) a 1, a 2,..., a n are nonnegatve constants. Suppose further that f s a µ 1 -measurable, nonnegatve functon. Then () If λ = a 1 µ 1 + a 2 µ 2 + a n µ n, g s a λ-measurable functons, then gdλ = a 1 g 1 + a 2 g a n g n () If ν() = f 1 g s a ν-measurable functon, then gdν = gf Proof. The second asserton () was proved as part of a prevous homework (p. 268 #22(b)). The frst asserton () follows easly by frst consderng g to be a smple functons, n whch case the result holds. Then extendng the result by the Monotone Convergence Theorem, by consderng a sequence φ n of smple functons that ncrease to g. Now take f = (1 + x 2 ) [0,1) + π 5 {1} g = x 2 [0,1) + 5 π {1} Then by Proposton 0.3, t follows that ν 0 () = g 1 ν 0 () = f 2 xersze 25. Show that the product of two sem-rngs s a sem-rng, but the product of two rngs s not necessarly a rng. Soluton 25. xersze 26. Assume that s a sequence of dsjont measurable sets =. Then for any set A we have µ (A ) = µ (A )

13 Soluton 26. Ths s true when n = 1. Suppose the result holds for some n. Consder n + 1 measurable, dsjont sets 1,... n, n+1. Now we have, by measurablty of n+1 the fact that all are dsjont: µ (A [ n+1 ] ) = µ (A [ n+1 ] n+1 ) + µ (A [ n+1 ] n+1 ) = µ (A [ n ]) + µ (A n+1 ) And by nducton hypothess from above we obtan: µ (A [ n+1 ] n n+1 ) = µ (A ) + µ (A n+1 ) = µ (A ) Now, After takng the lmt we obtan Hence µ (A ) µ (A [ n ]) = µ (A ) µ (A ) = µ (A ) µ (A ) n µ (A ) xersze 27. Let A be a collecton of sets whch s closed under fnte unons fnte ntersectons; an algebra of sets, for example. (a) Show that A σ s closed under countable unons fnte ntersectons. (b) Show that each set A σδ s the ntersecton of a decreasng sequence of sets n A σ. Soluton 27. (a) Suppose that A s a countable unon of sets n A σ. Then by defnton each A s n turn a countable unon of sets n A, say A = j Bj. But then [ A = j Bj ] s a countable unon of sets Bj, hence s n A,j N σ. Suppose that A 1, A 2,..., A n s a fnte sequence of sets n A σ. Then agan, each s n turn a countable unon of sets from A, say A = Bj. Now we have: [ A = j Bj] [ = j=1 n Bj ] Now, snce A s by hypothess closed under fnte ntersectons, n B j s n A. Hence above we end up wth a countable unon of sets from A, whch s n A σ. Ths completes the proof. (b) Suppose that B A σδ. But then B s a countable ntersecton of sets A n A σ. Let B 1 = A 1 for n 2, B n = n A. Then by part (a), B A σ for each B = j B j wth B n+1 B n. Ths completes the proof.

14 xersze 28. Let µ be a fnte measure on an algebra A, µ the nduced outer measure. Show that a set s measurable f only f for each ɛ > 0 there s a set A A σ, A, such that µ ( \ A) < ɛ. Soluton 28. By A δ we underst the collecton of all countable ntersectons of sets from A. Proposton 0.4. If µ s a fnte measure A, B are µ-measurable sets wth B A, then µ (A \ B) = µ (A) µ (B). Proof. Gven that A, B are measurable, µ (A) = µ (A B) + µ (A B c ). Snce B A, we have µ (A) = µ (B) + µ (A \ B) = µ (A \ B) = µ (A) µ (B). ( = ) Snce s measurable, so s c. By approxmaton for the nfmum, there exsts a cover of c of sets A n A such that (set A = n A n ) ( ) µ ( c ) + ɛ > n Snce c A, we know that A c. Further, A c = [ n A n ] c = n A c A δ µ(a n ) µ (A) Now, by Proposton 0.4, µ () = µ () µ ( c ) µ (A c ) = µ () µ (A), where s our total space. In addton from ( ) above we get: µ (A) µ ( c ) < ɛ hence µ () µ () + µ (A) µ ( c ) < ɛ Hence µ () µ (A c ) < ɛ And agan from Proposton 1, snce certanly A c s measurable, we get µ ( \ A c ) = µ () µ (A c ) < ɛ Ths completes the proof n one drecton. ( =) Suppose that gven, for all ɛ > 0 there exsts A A δ such that µ ( \ A) < ɛ For convenence let us set C = \ A. Now, for any set B we have: µ ( ) + µ (B c ) µ (B ) + µ (B A c ) snce A mples c A c. Further, µ (B ) + µ (B A c ) = µ ([B ] [B C]) + µ (B A c ) µ (B ) + µ (B C) + µ (B A c ) µ ([B ]) + ɛ + µ (B A c ) Snce A s measurable, we have so we obtan from above µ (B) = µ (B A) + µ (B A c ) µ ( ) + µ (B c ) µ (B) + ɛ Nether the left nor the rght h sde depends on ɛ. Hence µ ( ) + µ (B c ) µ (B)

15 From whch we deduce that s measurable. Ths completes the proof n the other drecton.

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Math 702 Midterm Exam Solutions

Math 702 Midterm Exam Solutions Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

More information

MAT 578 Functional Analysis

MAT 578 Functional Analysis MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these

More information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness. 20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

ALGEBRA HW 7 CLAY SHONKWILER

ALGEBRA HW 7 CLAY SHONKWILER ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (Spring 2009) Prelim 3 - Solutions Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Week 2. This week, we covered operations on sets and cardinality.

Week 2. This week, we covered operations on sets and cardinality. Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from

More information

Integration and Expectation

Integration and Expectation Chapter 9 Integraton and Expectaton fter Lebesgue s nvestgatons, the analogy between the measure of a set and the probablty of an event, as well as between the ntegral of a functon and the mathematcal

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

find (x): given element x, return the canonical element of the set containing x;

find (x): given element x, return the canonical element of the set containing x; COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1 MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Expected Value and Variance

Expected Value and Variance MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or

More information

Introductory Cardinality Theory Alan Kaylor Cline

Introductory Cardinality Theory Alan Kaylor Cline Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte

More information

Lecture 7: Gluing prevarieties; products

Lecture 7: Gluing prevarieties; products Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth

More information

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets 5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS

THERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg

More information

Review of metric spaces. 1. Metric spaces, continuous maps, completeness

Review of metric spaces. 1. Metric spaces, continuous maps, completeness (March 14, 2014) Revew of metrc spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [Ths document s http://www.math.umn.edu/ garrett/m/mfms/notes 2013-14/12a metrc spaces.pdf] We

More information

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010 Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n

More information

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.

THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. IAN KIMING We shall prove the followng result from [2]: Theorem 1. (Bllng-Mahler, 1940, cf. [2]) An ellptc curve defned over Q does not have a

More information

On the set of natural numbers

On the set of natural numbers On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers

More information

An Explicit Construction of an Expander Family (Margulis-Gaber-Galil)

An Explicit Construction of an Expander Family (Margulis-Gaber-Galil) An Explct Constructon of an Expander Famly Marguls-Gaber-Gall) Orr Paradse July 4th 08 Prepared for a Theorst's Toolkt, a course taught by Irt Dnur at the Wezmann Insttute of Scence. The purpose of these

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Differential Polynomials

Differential Polynomials JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets 11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Problem Solving in Math (Math 43900) Fall 2013

Problem Solving in Math (Math 43900) Fall 2013 Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:

More information

DIEGO AVERNA. A point x 2 X is said to be weakly Pareto-optimal for the function f provided

DIEGO AVERNA. A point x 2 X is said to be weakly Pareto-optimal for the function f provided WEAKLY PARETO-OPTIMAL ALTERNATIVES FOR A VECTOR MAXIMIZATION PROBLEM: EXISTENCE AND CONNECTEDNESS DIEGO AVERNA Let X be a non-empty set and f =f 1 ::: f k ):X! R k a functon. A pont x 2 X s sad to be weakly

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

Ali Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen

Ali Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen Journal of athematcs and Statstcs 7 (): 4448, 0 ISSN 5493644 00 Scence Publcatons odules n σ[] wth Chan Condtons on Small Submodules Al Omer Alattass Department of athematcs, Faculty of Scence, Hadramout

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

FUNCTIONAL ANALYSIS DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR

FUNCTIONAL ANALYSIS DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR FUNCTIONAL ANALYSIS DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR Contents 1. About 1 2. Syllabus 1 References 1 2.1. Orgn 2 3. Abstract space 2 4. Metrc Space 2 5. Sem-Metrc 6 6. Separable

More information

Random Variables. STA 205 Week 3

Random Variables. STA 205 Week 3 Random Varables Let Ω be any set, F any Sgma Feld on Ω, and P any probablty measure defned for each element of F; such a trple (Ω, F, P) s called a probablty space. Let R denote the real numbers (, ) and

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Lecture Note 3. Eshelby s Inclusion II

Lecture Note 3. Eshelby s Inclusion II ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte

More information

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet s Theorem In Arithmetic Progressions Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

DECOUPLING THEORY HW2

DECOUPLING THEORY HW2 8.8 DECOUPLIG THEORY HW2 DOGHAO WAG DATE:OCT. 3 207 Problem We shall start by reformulatng the problem. Denote by δ S n the delta functon that s evenly dstrbuted at the n ) dmensonal unt sphere. As a temporal

More information

On the Operation A in Analysis Situs. by Kazimierz Kuratowski

On the Operation A in Analysis Situs. by Kazimierz Kuratowski v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor

More information

Polynomials. 1 More properties of polynomials

Polynomials. 1 More properties of polynomials Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a

More information

Every planar graph is 4-colourable a proof without computer

Every planar graph is 4-colourable a proof without computer Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

3 Basic boundary value problems for analytic function in the upper half plane

3 Basic boundary value problems for analytic function in the upper half plane 3 Basc boundary value problems for analytc functon n the upper half plane 3. Posson representaton formulas for the half plane Let f be an analytc functon of z throughout the half plane Imz > 0, contnuous

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples.

42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples. 42. Mon, Dec. 8 Last tme, we were dscussng CW complexes, and we consdered two d erent CW structures on S n. We contnue wth more examples. (2) RP n. Let s start wth RP 2. Recall that one model for ths space

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,

More information

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION

CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION JARED ABLE, DANIEL BRADLEY, ALVIN MOON, AND XINGPING SUN Abstract. We gve an analytc proof for the Hausdorff convergence of the mdpont or derved polygon

More information

Solutions Homework 4 March 5, 2018

Solutions Homework 4 March 5, 2018 1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and

More information

k(k 1)(k 2)(p 2) 6(p d.

k(k 1)(k 2)(p 2) 6(p d. BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

and problem sheet 2

and problem sheet 2 -8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

FORCING COPIES OF ω 1 WITH PFA(S)

FORCING COPIES OF ω 1 WITH PFA(S) FORCING COPIES OF ω 1 WITH PFA(S) ALAN DOW Abstract. We work n the PFA(S)[S] model. We show that a non-compact sequentally compact space of small character wll contan a copy of ω 1. Droppng the character

More information

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-van der Waerden numbers of 3-term arithmetic progressions. Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

THE FUNDAMENTAL THEOREM OF CALCULUS FOR MULTIDIMENSIONAL BANACH SPACE-VALUED HENSTOCK VECTOR INTEGRALS

THE FUNDAMENTAL THEOREM OF CALCULUS FOR MULTIDIMENSIONAL BANACH SPACE-VALUED HENSTOCK VECTOR INTEGRALS Real Analyss Exchange Vol.,, pp. 469 480 Márca Federson, Insttuto de Matemátca e Estatístca, Unversdade de São Paulo, R. do Matão 1010, SP, Brazl, 05315-970. e-mal: marca@me.usp.br THE FUNDAMENTAL THEOREM

More information

Dimensionality Reduction Notes 1

Dimensionality Reduction Notes 1 Dmensonalty Reducton Notes 1 Jelan Nelson mnlek@seas.harvard.edu August 10, 2015 1 Prelmnares Here we collect some notaton and basc lemmas used throughout ths note. Throughout, for a random varable X,

More information