COMPLEX MEASURES Absolute Continuity and Representation Theorems

Total Page:16

File Type:pdf, Size:1020Kb

COMPLEX MEASURES Absolute Continuity and Representation Theorems COMPLEX MEASURES Absolute Continuity and Representation Theorems Lakhdar Meziani Introduction Let (X; ; ) be a measure space and let f : X C be a complex - integrable function.F Let us consider the set function !given by: (A) = f d; A ( ) A 2 F Such set function has the followingR properties: (1) ( additivity): For any sequence (An) of pairwise disjoint sets An in F we have An = (An) [n n (2) (absolute continuity):P Let A with (A) = 0 then (A) = 0, because 2 F f:IA = 0 a:e, we say that is absolutely continuous with respect to . This relation will be denoted by + (3). If f is real valued let us write f = f f then + (A) = A f d = A f d A f d so we have (A) = 1 (A) 2 (A), with + 1 (A) = f d and 2 (A) = f d positive and additive. R A R R A In this chapter we consider complex valued additive set functions R R : C and we will show successively: (a)F !is of bounded variation: more precisely there is a positive …nite measure on such that (E) (E), E j j F is called the total variationj ofj: j j 8 2 F j j + (b) if is real valued then it can be written as = + where ; are …nite positive measures. This is called the Jordan decomposition. (c) has the integral form ( ) for some complex -integrable function f provided for some …nite positive measure : This is the Radon-Nicodym Theorem. 1. Complex Measures property De…nition 1.1 Let (X; ) be a measurable space and : C a complex set function. F F ! We say that is a complex measure if for every sequence (An) of pairwise disjoint sets in we have An = (An) : F [n n Remark (1) Let zn = M be a convergent P series of real or complex numbers. n We say that the seriesP is unconditionally convergent to M if for any permuta- tion (i.e bijection) : N N, the series z(n) converges to M. For real ! n or complex numbers series unconditional convergenceP is equivalent to absolute convergence by Riemann series theorem. 1 (2) Let : N N be a permutation of N then An = A(n) = A and the ! [n [n sets A(n) are pairwise disjoint so (A) = (An) = A(n) , since n n is arbitrary this implies that the series (APn) is unconditionallyP convergent n and then absolutely convergent. P (3) If is a complex measure on (X; ) then one can write = Re ()+i Im (), where it is easy to see that Re () andF Im () are real additive set functions on (X; ). This simple observation leads to the following de…nition: F De…nition 1.2 Let (X; ) be a measurable space and : R a real set function. F F ! We say that is a real measure if for every sequence (An) of pairwise disjoint sets in we have An = (An) : F [n n Let : N N be a permutation P of N then An = A(n) = A and the ! [n [n sets A(n) are pairwise disjoint so (A) = (An) = A(n) , since n n is arbitrary this implies that the series (APn) is unconditionallyP convergent n and then absolutely convergent (see RemarkP (1)) 2. Total variation of a complex measure Let be a complex measure on (X; ) Among all positive measures on (X;F ) satisfying (E) (E), E , there one andF only one called the Total variation ofj andj given by8 the2 following F theorem: Theorem 2.1 If is a complex measure on (X; ) let us de…ne the positive set function : [0F; ] by: j j F ! 1 E , (E) = sup (En) ; (En) partition of E in 2 F j j j j F n the supremum being takenP over all partitions (En) of E in : Then: is a positive bounded measure on (X; ) satisfying F j j (E) (E), E F moreover is thej smallestj j j positive8 bounded2 F measure with this property. Proof. Letj jE be a set in F If (En) is a sequence of pairwise disjoint sets in we have to prove that: F En = (En) j j [n n j j let us put E= PEn and take a partition (Am) of E in then we have: [n F (Am En)n 1 is a partition of Am \ (Am En)m 1 is a partition of En \ so (Am) = (Am En) (Am En) ; m 1 and then j j \ j \ j 8 n n (Am) P (Am E n) P= (Am En) m j j m n j \ j n m j \ j P PP PP 2 but we have from the de…nition of (Am En) (En) n 1 j j m j \ j j j 8 therefore we deduce that (Am) P (En) inequality valid for every m j j n j j P P partition(Am) of E and implies (E) (En) by the de…nition of (E) : j j n j j j j P It remains to prove that (En) (E), to do this we use characteristic n j j j j property of the supremum: for each n 1 let an > 0 be any real number P such that an < (En), then from the de…nition of (En) there is a partition j j j j (Amn)m 1 of En with an < (Amn) , but we have E = : :En = :Amn m j j [n mn[ and an < (Amn) .P Since (Amn)m;n 1 is a partition of E we deduce n n m j j that P (PAmnP ) (E) and so an < (E), but this is true for all n m j j j j n j j an > P0 satisfyingP an < (En) thisP implies that (En) (E) : The n n j j n j j j j proof of the boundednessP P of is left to the reader. P j j Theorem 2.2 If is a complex measure on (X; ) F For any increasing or decreasing sequence (An) in we have F limAn = lim (An) n n wherelimAnstands for An in the increasing case n [n and for An in the decreasing one. \n Proof. use the additivity of and the fact that (E) < , E . j j 1 8 2 F Theorem 2.3 Let M (X; ) be the family of all complex measures on (X; ) F F let ; be in M (X; ) and let C, then de…ne: + ; :; F , by the following2 recipe ( + )(E) = (E)k +k (E), ( :)(E) = : (E) , E = (X) 2 F k k j j Then M (X; ) is a vector space on C, and is a norm on M (X; ) Moreover M F(X; ), endowed with the normk k , is a Banach space.F F k k Proof. see any standard book on measure theory for a classical proof.e.g.[R F ] 3 3. Hahn-Jordan Decomposition of a Real Measure Theorem 3.1 Jordan Decomposition of a Real Measure Let (X; ) be a measurable space and : R a real measure (De…nition 1.2) F F ! + Let us de…ne the set functions ; as follows: for each E + (E) = sup (F ): F ;F E 2 F f 2 F g (E) = inf (F ): F ;F E + f 2 F g Then ; are positive bounded measures on (X; ) satisfying: F + 1 1 (i) = ( + )(ii) = ( ) 2 j j 2 j j + (iii) = (Jordan Decomposition) + (iv) = + Proof j j First it is enough to prove that + is a positive bounded measure on (X; ) + F because = ( ) : From the de…nition of the total variation of we can see that for E F ;F E::::: (F ) (F ) (F ) (E) (X) <2 F so we8 deduce2 F that + is positive j bounded;j j j j j j j 1 it remains to prove that + is additive Let (En) be pairwise disjoint sets in ; we have to prove: + + F En = (En) [n n + + Since n 1 P(En) < , we have from the de…nition of : 8 1 + let > 0 then for each n 1, Fn En such that (En) < (Fn) 9 2n + summing over n we get (En) < (Fn) = Fn n n [n P + P + + but Fn En = Fn En ; therefore (En) < En [n [n ) [n [n n [n + + since > 0 is arbitrary, we obtain (En) EPn after making 0: n [n ! On the other hand let F En:::FP , then F = (En F ) and [n 2 F [n \ + (F ) = (En F ) (En) because En F En n \ n \ P P + + since F En::is arbitrary in , we deduce that En (En) [n F [n n so + is a positive measure on (X; ) : P F We have (i) = (ii) (iii) and (iv) = (ii) + (iii) + it is enough to prove (i) because (ii) follows with = ( ) then we get (iii) with (ii) (i) and (iv) with (ii) + (iii) : 1 So let us prove (i) that is + = ( + ): 2 j j …x > 0 then from the de…nition of the total variation j j there is a partition (En) of E in such that ( ) (E) < (En) : F j j n j j P 4 Let us put L = l : (El) 0 and K = k : (Ek) < 0 , we get: f g f g (En) = (El) (Ek) n j j L K nowP de…ne F = PEl and GP= Ek, so by the additivity of we deduce [L K[ (F ) = (El) and (G) = (Ek), then (En) = (F ) (G) L K n j j therefore weP obtain from the inequalityP ( ) that P (2 ) (E) < (En) = (F ) (G) j j n j j but since E = F G weP have (3 ) (E) = [(F ) + (G) adding (2 ) + (3 ) we get: (E) + (E) < 2 (F ) thej de…nitionj of +implies (F ) + (E), because F E 1 …nally ( (E) + (E) ) < + (E) with nothing depending on apart ; 2 j j 1 making 0 we get ( (E) + (E)) + (E) : ! 2 j j This inequality cannot be strict: 1 indeed suppose that we have ( (E) + (E)) < + (E), this would imply 2 j j 1 the existence of an F in with F E and ( (E) + (E)) < (F ) < + (E) F 2 j j 1 but the set function ( (E) + (E)) is a positive measure on (X; ) ; 2 j j F 1 1 since F E we should have ( (F ) + (F )) ( (E) + (E)) 2 j j 2 j j 1 1 since (F ) (F ), we have (F ) = ( (F ) + (F )) ( (F ) + (F )) j j 2 2 j j 1 ( (E) + (E)) < (F ) which is absurd 2 j j 1 so we deduce that ( (E) + (E)) = + (E) : 2 j j Remark.
Recommended publications
  • Complex Measures 1 11
    Tutorial 11: Complex Measures 1 11. Complex Measures In the following, (Ω, F) denotes an arbitrary measurable space. Definition 90 Let (an)n≥1 be a sequence of complex numbers. We a say that ( n)n≥1 has the permutation property if and only if, for ∗ ∗ +∞ 1 all bijections σ : N → N ,theseries k=1 aσ(k) converges in C Exercise 1. Let (an)n≥1 be a sequence of complex numbers. 1. Show that if (an)n≥1 has the permutation property, then the same is true of (Re(an))n≥1 and (Im(an))n≥1. +∞ 2. Suppose an ∈ R for all n ≥ 1. Show that if k=1 ak converges: +∞ +∞ +∞ + − |ak| =+∞⇒ ak = ak =+∞ k=1 k=1 k=1 1which excludes ±∞ as limit. www.probability.net Tutorial 11: Complex Measures 2 Exercise 2. Let (an)n≥1 be a sequence in R, such that the series +∞ +∞ k=1 ak converges, and k=1 |ak| =+∞.LetA>0. We define: + − N = {k ≥ 1:ak ≥ 0} ,N = {k ≥ 1:ak < 0} 1. Show that N + and N − are infinite. 2. Let φ+ : N∗ → N + and φ− : N∗ → N − be two bijections. Show the existence of k1 ≥ 1 such that: k1 aφ+(k) ≥ A k=1 3. Show the existence of an increasing sequence (kp)p≥1 such that: kp aφ+(k) ≥ A k=kp−1+1 www.probability.net Tutorial 11: Complex Measures 3 for all p ≥ 1, where k0 =0. 4. Consider the permutation σ : N∗ → N∗ defined informally by: φ− ,φ+ ,...,φ+ k ,φ− ,φ+ k ,...,φ+ k ,..
    [Show full text]
  • Appendix A. Measure and Integration
    Appendix A. Measure and integration We suppose the reader is familiar with the basic facts concerning set theory and integration as they are presented in the introductory course of analysis. In this appendix, we review them briefly, and add some more which we shall need in the text. Basic references for proofs and a detailed exposition are, e.g., [[ H a l 1 ]] , [[ J a r 1 , 2 ]] , [[ K F 1 , 2 ]] , [[ L i L ]] , [[ R u 1 ]] , or any other textbook on analysis you might prefer. A.1 Sets, mappings, relations A set is a collection of objects called elements. The symbol card X denotes the cardi- nality of the set X. The subset M consisting of the elements of X which satisfy the conditions P1(x),...,Pn(x) is usually written as M = { x ∈ X : P1(x),...,Pn(x) }.A set whose elements are certain sets is called a system or family of these sets; the family of all subsystems of a given X is denoted as 2X . The operations of union, intersection, and set difference are introduced in the standard way; the first two of these are commutative, associative, and mutually distributive. In a { } system Mα of any cardinality, the de Morgan relations , X \ Mα = (X \ Mα)and X \ Mα = (X \ Mα), α α α α are valid. Another elementary property is the following: for any family {Mn} ,whichis { } at most countable, there is a disjoint family Nn of the same cardinality such that ⊂ \ ∪ \ Nn Mn and n Nn = n Mn.Theset(M N) (N M) is called the symmetric difference of the sets M,N and denoted as M #N.
    [Show full text]
  • Radon Measures
    MAT 533, SPRING 2021, Stony Brook University REAL ANALYSIS II FOLLAND'S REAL ANALYSIS: CHAPTER 7 RADON MEASURES Christopher Bishop 1. Chapter 7: Radon Measures Chapter 7: Radon Measures 7.1 Positive linear functionals on Cc(X) 7.2 Regularity and approximation theorems 7.3 The dual of C0(X) 7.4* Products of Radon measures 7.5 Notes and References Chapter 7.1: Positive linear functionals X = locally compact Hausdorff space (LCH space) . Cc(X) = continuous functionals with compact support. Defn: A linear functional I on C0(X) is positive if I(f) ≥ 0 whenever f ≥ 0, Example: I(f) = f(x0) (point evaluation) Example: I(f) = R fdµ, where µ gives every compact set finite measure. We will show these are only examples. Prop. 7.1; If I is a positive linear functional on Cc(X), for each compact K ⊂ X there is a constant CK such that jI(f)j ≤ CLkfku for all f 2 Cc(X) such that supp(f) ⊂ K. Proof. It suffices to consider real-valued I. Given a compact K, choose φ 2 Cc(X; [0; 1]) such that φ = 1 on K (Urysohn's lemma). Then if supp(f) ⊂ K, jfj ≤ kfkuφ, or kfkφ − f > 0;; kfkφ + f > 0; so kfkuI(φ) − I)f) ≥ 0; kfkuI(φ) + I)f) ≥ 0: Thus jI(f)j ≤ I(φ)kfku: Defn: let µ be a Borel measure on X and E a Borel subset of X. µ is called outer regular on E if µ(E) = inffµ(U): U ⊃ E; U open g; and is inner regular on E if µ(E) = supfµ(K): K ⊂ E; K open g: Defn: if µ is outer and inner regular on all Borel sets, then it is called regular.
    [Show full text]
  • 5.2 Complex Borel Measures on R
    MATH 245A (17F) (L) M. Bonk / (TA) A. Wu Real Analysis Contents 1 Measure Theory 3 1.1 σ-algebras . .3 1.2 Measures . .4 1.3 Construction of non-trivial measures . .5 1.4 Lebesgue measure . 10 1.5 Measurable functions . 14 2 Integration 17 2.1 Integration of simple non-negative functions . 17 2.2 Integration of non-negative functions . 17 2.3 Integration of real and complex valued functions . 19 2.4 Lp-spaces . 20 2.5 Relation to Riemann integration . 22 2.6 Modes of convergence . 23 2.7 Product measures . 25 2.8 Polar coordinates . 28 2.9 The transformation formula . 31 3 Signed and Complex Measures 35 3.1 Signed measures . 35 3.2 The Radon-Nikodym theorem . 37 3.3 Complex measures . 40 4 More on Lp Spaces 43 4.1 Bounded linear maps and dual spaces . 43 4.2 The dual of Lp ....................................... 45 4.3 The Hardy-Littlewood maximal functions . 47 5 Differentiability 51 5.1 Lebesgue points . 51 5.2 Complex Borel measures on R ............................... 54 5.3 The fundamental theorem of calculus . 58 6 Functional Analysis 61 6.1 Locally compact Hausdorff spaces . 61 6.2 Weak topologies . 62 6.3 Some theorems in functional analysis . 65 6.4 Hilbert spaces . 67 1 CONTENTS MATH 245A (17F) 7 Fourier Analysis 73 7.1 Trigonometric series . 73 7.2 Fourier series . 74 7.3 The Dirichlet kernel . 75 7.4 Continuous functions and pointwise convergence properties . 77 7.5 Convolutions . 78 7.6 Convolutions and differentiation . 78 7.7 Translation operators .
    [Show full text]
  • Chapter 5 Decomposition of Measures
    1 CHAPTER 5 DECOMPOSITION OF MEASURES Introduction In this section a version of the fundamental theorem of calculus for Lebesgue integrals will be proved. Moreover, the concept of di¤erentiating a measure with respect to another measure will be developped. A very important result in this chapter is the so called Radon-Nikodym Theorem. 5:1: Complex Measures Let (X; ) be a measurable space. Recall that if An X; n N+, and M 2 Ai Aj = if i = j, the sequence (An)n N+ is called a disjoint denumerable \ 6 2 collection. The collection is called a measurable partition of A if A = 1 An [n=1 and An for every n N+: A complex2 M function 2on is called a complex measure if M (A) = n1=1(An) for every A and measurable partition (An)n1=1 of A: Note that () = 0 if is a complex2 M measure. A complex measure is said to be a real measure if it is a real function. The reader should note that a positive measure need not be a real measure since in…nity is not a real number. If is a complex measure = Re +iIm , where Re =Re and Im =Im are real measures. If (X; ; ) is a positive measure and f L1() it follows that M 2 (A) = fd; A 2 M ZA is a real measure and we write d = fd. 2 A function : [ ; ] is called a signed measure measure if M! 1 1 (a) : ] ; ] or : [ ; [ (b) (M!) = 0 1 1 M! 1 1 and (c) for every A and measurable partition (An)1 of A; 2 M n=1 (A) = n1=1(An) where the latter sum converges absolutely if (A) R: 2 Here = and + x = if x R: The sum of a positive measure1 1 and a1 real measure1 and the di¤erence1 of2 a real measure and a positive measure are examples of signed measures and it can be proved that there are no other signed measures (see Folland [F ]).
    [Show full text]
  • Math 641 Lecture #26 ¶6.18,6.19 Complex Measures and Integration the Dual of C0(X)
    Math 641 Lecture #26 ¶6.18,6.19 Complex Measures and Integration Definition (6.18). Let µ be a complex measure on a σ-algebra M in X. There is (by Theorem 6.12) a meaurable function h such that |h| = 1 and dµ = hd|µ| [actually, h is a L1(|µ|) function that depends on µ]. The integral of a measurable function f on X with respect to µ is Z Z f dµ = fh d|µ|. X X A special case of this is Z Z Z χE dµ = χEh d|µ| = h d|µ| = µ(E), X X E Z which justifies setting µ(E) = dµ for all E ∈ M. E The Dual of C0(X) Definition. Let M(X) be the collection of all regular complex Borel measures on a LCH space X, and equip M(X) with the total variation norm, kµk = |µ|(X). [RECALL: a regular complex Borel measure is a complex measure µ on BX such that |µ| is regular.] Proposition. M(X) is a Banach space. Proof. Homework Problem Ch.6 #3. Problem. Each µ ∈ M(X) defines a linear functional Iµ : C0(X) → C by Z Iµ(f) = f dµ, X where (for the unique measurable h correpsonding to µ) Z Z Z |Iµ(f)| = fdµ = fh d|µ| ≤ |fh| d|µ| X X X Z ≤ kfku 1 d|µ| ≤ kfku |µ|(X). X ∗ Hence kIµk ≤ kµk < ∞, so that Iµ ∈ C0(X) . ∗ Does C0(X) = {Iµ : µ ∈ M(X)}? ∗ Define a map I : M(X) → C0(X) by I : µ → Iµ.
    [Show full text]
  • REAL ANALYSIS Rudi Weikard
    REAL ANALYSIS Lecture notes for MA 645/646 2018/2019 Rudi Weikard 1.0 0.8 0.6 0.4 0.2 0.0 0.0 0.2 0.4 0.6 0.8 1.0 Version of July 26, 2018 Contents Preface iii Chapter 1. Abstract Integration1 1.1. Integration of non-negative functions1 1.2. Integration of complex functions4 1.3. Convex functions and Jensen's inequality5 1.4. Lp-spaces6 1.5. Exercises8 Chapter 2. Measures9 2.1. Types of measures9 2.2. Construction of measures 10 2.3. Lebesgue measure on Rn 11 2.4. Comparison of the Riemann and the Lebesgue integral 13 2.5. Complex measures and their total variation 14 2.6. Absolute continuity and mutually singular measures 15 2.7. Exercises 16 Chapter 3. Integration on Product Spaces 19 3.1. Product measure spaces 19 3.2. Fubini's theorem 20 3.3. Exercises 21 Chapter 4. The Lebesgue-Radon-Nikodym theorem 23 4.1. The Lebesgue-Radon-Nikodym theorem 23 4.2. Integration with respect to a complex measure 25 Chapter 5. Radon Functionals on Locally Compact Hausdorff Spaces 27 5.1. Preliminaries 27 5.2. Approximation by continuous functions 27 5.3. Riesz's representation theorem 28 5.4. Exercises 31 Chapter 6. Differentiation 33 6.1. Derivatives of measures 33 6.2. Exercises 34 Chapter 7. Functions of Bounded Variation and Lebesgue-Stieltjes Measures 35 7.1. Functions of bounded variation 35 7.2. Lebesgue-Stieltjes measures 36 7.3. Absolutely continuous functions 39 i ii CONTENTS 7.4.
    [Show full text]
  • Measure Theory
    Measure Theory Andrew Kobin Spring 2016 Contents Contents Contents 0 Introduction 1 0.1 The Discrete Sum . .2 0.2 Metric Spaces . .8 0.3 Partial Orders . .9 1 Measure Theory 11 1.1 σ-Algebras . 12 1.2 Measures . 18 1.3 Borel Measures . 27 1.4 Measurable Functions . 31 2 Integration Theory 37 2.1 Lebesgue Integration . 37 2.2 Properties of Integration . 43 2.3 Types of Convergence . 48 2.4 Product Measures . 52 2.5 Lebesgue Integration on Rn ........................... 54 3 Signed Measures and Differentiation 56 3.1 Signed Measures . 56 3.2 Lebesgue-Radon-Nikodym Theorem . 60 3.3 Complex Measures . 65 3.4 Complex Lebesgue Integration . 68 3.5 Functions of Bounded Variation . 71 4 Function Spaces 76 4.1 Banach Spaces . 76 4.2 Hilbert Spaces . 82 4.3 Lp Spaces . 92 i 0 Introduction 0 Introduction These notes are taken from a graduate real analysis course taught by Dr. Tai Melcher at the University of Virginia in Spring 2016. The companion text for the course is Folland's Real Analysis: Modern Techniques and Their Applications, 2nd ed. The main topics covered are: A review of some concepts in set theory Measure theory Integration theory Differentiation Some functional analysis, including normed linear spaces The theory of Lp spaces By far the most fundamental subject in real analysis is measure theory. In a general sense, measure theory gives us a way of extending the concrete notions of length, area, volume, etc. and also of extending the theory of Riemann integration from calculus. Recall that the Riemann integral of a real-valued function
    [Show full text]
  • Linear Functional Analysis
    Linear Functional Analysis Joan Cerdà Graduate Studies in Mathematics Volume 116 American Mathematical Society Real Sociedad Matemática Española http://dx.doi.org/10.1090/gsm/116 Linear Functional Analysis Linear Functional Analysis Joan Cerdà Graduate Studies in Mathematics Volume 116 American Mathematical Society Providence, Rhode Island Real Sociedad Matemática Española Madrid, Spain Editorial Board of Graduate Studies in Mathematics David Cox (Chair) Rafe Mazzeo Martin Scharlemann Gigliola Staffilani Editorial Committee of the Real Sociedad Matem´atica Espa˜nola Guillermo P. Curbera, Director Luis Al´ıas Alberto Elduque Emilio Carrizosa Rosa Mar´ıa Mir´o Bernardo Cascales Pablo Pedregal Javier Duoandikoetxea Juan Soler 2010 Mathematics Subject Classification. Primary 46–01; Secondary 46Axx, 46Bxx, 46Exx, 46Fxx, 46Jxx, 47B15. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-116 Library of Congress Cataloging-in-Publication Data Cerd`a, Joan, 1942– Linear functional analysis / Joan Cerd`a. p. cm. — (Graduate studies in mathematics ; v. 116) Includes bibliographical references and index. ISBN 978-0-8218-5115-9 (alk. paper) 1. Functional analysis. I. Title. QA321.C47 2010 515.7—dc22 2010006449 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294 USA.
    [Show full text]
  • ANSWERS I All of the Problems Are from Chapter 3 of the Text
    Problem Set Problem Set #1 Math 5322, Fall 2001 March 4, 2002 ANSWERS i All of the problems are from Chapter 3 of the text. Problem 1. [Problem 2, page 88] If ν is a signed measure, E is ν-null iff |ν|(E) = 0. Also, if ν and µ are signed measures, ν ⊥ µ iff |ν| ⊥ µ iff ν+ ⊥ µ and ν− ⊥ µ Answer: For the first part of the problem, let X = P ∪ N be a Hahn decomposition of X with respect to ν. Thus, we have ν+(E) = ν(E ∩ P ) ν−(E) = −ν(E ∩ N) |ν| = ν+ + ν− Assume that E is ν-null. This means that for all measurable F ⊆ E, ν(F ) = 0. But then E ∩ P ⊆ E, so ν+(E) = 0 and E ∩ N ⊆ E, so ν−(E) = 0. Then we have |ν|(E) = ν+(E) + ν−(E) = 0 Conversely, suppose that |ν|(E) = 0. Let F ⊆ E be measurable. Then 0 ≤ ν+(F ) + ν−(F ) = |ν|(F ) ≤ |ν|(E) = 0, so ν+(F ) = 0 and ν−(F ) = 0. But then ν(F ) = ν+(F ) − ν−(F ) = 0. Thus, we can conclude that E is ν-null. For the second part of the problem, we want to show that the following conditions are equivalent. (1) ν ⊥ µ (2) ν+ ⊥ µ and ν− ⊥ µ (3) |ν| ⊥ µ Let’s first show that (1) =⇒ (2). Since ν ⊥ µ, we can decompose X into a disjoint union of measurable sets A and B so that A is µ-null and B is ν-null. We can also find an Hahn decomposition X = P ∪N with respect to ν, as above.
    [Show full text]
  • Chapters 13-14
    REAL ANALYSIS LECTURE NOTES 261 13. Complex Measures, Radon-Nikodym Theorem and the Dual of Lp Definition 13.1. A signed measure ν on a measurable space (X, ) is a function M ν : R such that M → (1) Either ν( ) ( , ] or ν( ) [ , ). M ⊂ −∞ ∞ M ⊂ −∞ ∞ (2) ν is countably additive, this is to say if E = ∞ Ej with Ej , then j=1 ∈ M ∞ 31 ν(E)= ν(Ej). ` j=1 (3) ν( )=0P. ∅ If there exists Xn such that ν(Xn) < and X = ∞ Xn, then ν is said ∈ M | | ∞ ∪n=1 to be σ — finite and if ν( ) R then ν is said to be a finite signed measure. M ⊂ Similarly, a countably additive set function ν : C such that ν( )=0is called a complex measure. M → ∅ A finite signed measure is clearly a complex measure. Example 13.2. Suppose that µ+ and µ are two positive measures on such − M that either µ+(X) < or µ (X) < , then ν = µ+ µ is a signed measure. If ∞ − ∞ − − both µ+(X) and µ (X) are finite then ν is a finite signed measure. − Example 13.3. Suppose that g : X R is measurable and either g+dµ or → E g−dµ < , then E ∞ R R (13.1) ν(A)= gdµ A ∀ ∈ M ZA defines a signed measure. This is actually a special case of the last example with µ (A) g±dµ. Notice that the measure µ in this example have the property ± ≡ A ± that they are concentrated on disjoint sets, namely µ+ “lives” on g>0 and µ “lives” onR the set g<0 .
    [Show full text]
  • Discrete Probabilistic and Algebraic Dynamics: a Stochastic Commutative
    Discrete probabilistic and algebraic dynamics: a stochastic commutative Gelfand-Naimark Theorem Arthur J. Parzygnat Abstract We introduce a category of stochastic maps (certain Markov kernels) on compact Haus- dorff spaces, construct a stochastic analogue of the Gelfand spectrum functor, and prove a stochastic version of the commutative Gelfand-Naimark Theorem. This relates concepts from algebra and operator theory to concepts from topology and probability theory. For completeness, we review stochastic matrices, their relationship to positive maps on commu- tative C∗-algebras, and the Gelfand-Naimark Theorem. No knowledge of probability theory nor C∗-algebras is assumed and several examples are drawn from physics. Contents 1 An algebraic perspective on probability theory 2 1.1 Brief background and motivation ............................ 2 1.2 Overview of results .................................... 3 2 Positive maps and stochastic matrices 5 2.1 Introduction ........................................ 5 2.2 Some categories for finite probability theory ...................... 6 2.3 C∗-algebras and states .................................. 11 2.4 Two types of morphisms of C∗-algebras ......................... 14 2.5 From probability theory to algebra ........................... 16 arXiv:1708.00091v2 [math.FA] 4 Oct 2017 2.6 From algebra to probability theory ........................... 18 2.7 Some quantum mechanics ................................ 20 3 An equivalence between spaces and algebraic structures 23 3.1 From spaces to algebras ................................
    [Show full text]