of the set A. Note that the cross-section A ω :={t R + : (t,ω) A} is empty when ω/ π A. It would be impossible to have (ψ(ω), ω) A for such an ω.

Similar documents
Martingales, standard filtrations, and stopping times

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

NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

3 Hausdorff and Connected Spaces

2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.

Thus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a

Abstract Measure Theory

Final. due May 8, 2012

Problem Set 2: Solutions Math 201A: Fall 2016

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

arxiv: v1 [math.fa] 14 Jul 2018

Contents. Index... 15

Chapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries

Lebesgue Measure on R n

Measures and Measure Spaces

Introduction to Topology

CHAPTER 7. Connectedness

This chapter contains a very bare summary of some basic facts from topology.

REVIEW OF ESSENTIAL MATH 346 TOPICS

Reminder Notes for the Course on Measures on Topological Spaces

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

Lebesgue Measure. Dung Le 1

The Caratheodory Construction of Measures

3 COUNTABILITY AND CONNECTEDNESS AXIOMS

Course 212: Academic Year Section 1: Metric Spaces

Indeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )

Lebesgue Measure on R n

4 Countability axioms

2 Topology of a Metric Space

B 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.

Metric Spaces and Topology

01. Review of metric spaces and point-set topology. 1. Euclidean spaces

Measurable Choice Functions

Some Background Material

G δ ideals of compact sets

Max-min (σ-)additive representation of monotone measures

Maths 212: Homework Solutions

Math General Topology Fall 2012 Homework 8 Solutions

4th Preparation Sheet - Solutions

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

Construction of a general measure structure

F 1 =. Setting F 1 = F i0 we have that. j=1 F i j

MH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then

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

s P = f(ξ n )(x i x i 1 ). i=1

2. The Concept of Convergence: Ultrafilters and Nets

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

JORDAN CONTENT. J(P, A) = {m(i k ); I k an interval of P contained in int(a)} J(P, A) = {m(i k ); I k an interval of P intersecting cl(a)}.

Chapter 2 Metric Spaces

5 Set Operations, Functions, and Counting

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

Wiener Measure and Brownian Motion

Measures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.

(2) E M = E C = X\E M

S. Mrówka introduced a topological space ψ whose underlying set is the. natural numbers together with an infinite maximal almost disjoint family(madf)

Filters in Analysis and Topology

Doléans measures. Appendix C. C.1 Introduction

Integration on Measure Spaces

+ = x. ± if x > 0. if x < 0, x

Math 117: Topology of the Real Numbers

Introduction to Dynamical Systems

A LITTLE REAL ANALYSIS AND TOPOLOGY

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

Solutions to Tutorial 8 (Week 9)

HW 4 SOLUTIONS. , x + x x 1 ) 2

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

CHAPTER I THE RIESZ REPRESENTATION THEOREM

INTRODUCTION TO TOPOLOGY, MATH 141, PRACTICE PROBLEMS

The Lebesgue Integral

DRAFT MAA6616 COURSE NOTES FALL 2015

Notes on Ordered Sets

Empirical Processes: General Weak Convergence Theory

If X is a compact space and K X is a closed subset, then K is

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

MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6

Measure and Category. Marianna Csörnyei. ucahmcs

THEOREMS, ETC., FOR MATH 515

Analysis III Theorems, Propositions & Lemmas... Oh My!

MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1

Measures. Chapter Some prerequisites. 1.2 Introduction

Math 426 Homework 4 Due 3 November 2017

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)

Topological properties

Do stochastic processes exist?

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

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

The Space of Maximal Ideals in an Almost Distributive Lattice

1 Preliminaries on locally compact spaces and Radon measure

Math212a1411 Lebesgue measure.

Set, functions and Euclidean space. Seungjin Han

Dynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor)

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

Metric Spaces Math 413 Honors Project

Spaces of continuous functions

Part III. 10 Topological Space Basics. Topological Spaces

Introduction to Hausdorff Measure and Dimension

Appendix B Convex analysis

Math212a1413 The Lebesgue integral.

U e = E (U\E) e E e + U\E e. (1.6)

Sets, Functions and Metric Spaces

Transcription:

AN-1 Analytic sets For a discrete-time process {X n } adapted to a filtration {F n : n N}, the prime example of a stopping time is τ = inf{n N : X n B}, the first time the process enters some Borel set B. For a continuous-time process {X t } adapted to a filtration {F t : t R + }, it is less obvious whether the analogously defined random variable τ = inf{t : X t B} is a stopping time. (Also it is not necessarily true that X τ is a point of B.) The most satisfactory resolution of the underlying measure-theoretic problem requires some theory about analytic sets. What follows is adapted from Dellacherie & Meyer (1978, Chapter III, paras 1 33, 44 45). The following key result will be proved in this handout. <1> Theorem. Let A be a B(R + ) F-measurable subset of R + and let (, F, P) be a complete probability space. Then: (i) The projection π A := {ω : (t,ω) A for some t in R + } belongs to F. (ii) There exists an F-measurable random variable ψ : R + { } such that ψ(ω) < and (ψ(ω), ω) A for almost all ω in the projection π A, and ψ(ω) = for ω/ π A. Remark. The map ψ in (ii) is called a measurable cross-section of the set A. Note that the cross-section A ω :={t R + : (t,ω) A} is empty when ω/ π A. It would be impossible to have (ψ(ω), ω) A for such an ω. The proofs will exploit the properties of the collection of analytic subsets of [0, ]. As you will see, the analytic sets have properties analogous to those of sigma-fields stability under the formation of countable unions and intersections. They are not necessarily stable under complements, but they do have an extra stability property for projections that is not shared by measurable sets. The Theorem is made possible by the fact that the product-measurable subsets of R + are all analytic. 1. Notation A collection D of subsets of a set X with D is called a paving on X. A paving that is closed under the formation of unions of countable subcollections is said to be a c-paving. For example, the set D σ of all unions of countable subcollections of D is a c-paving. Similarly, the set D δ of all intersections of countable subcollections of D is a c-paving. Note that D σδ := (D σ ) δ is a c-paving but it need not be stable under c. Let T be a compact metric space equipped with the paving K(T ) of compact subsets and its Borel sigma-field B(T ), which is generated by K(T ). Remark. In fact, K(T ) is also the class of closed subsets of the compact T. For Theorem <1>, the appropriate space will be T = [0, ]. The sets in B(R + ) F can be identified with sets in B(T ) F. The compactness of T will be needed to derive good properties for the projection map π : T. An important role will be played by the f -paving K(T ) F := {K F : K K(T ), F F} on T and by the paving R that consists of all finite unions of sets from K(T ) F. That is, R is the f -closure of K(T ) F. Note (Problem [1]) that R is a

AN-2 ( f, f )-paving on T. Also, if R = i K i F i then, assuming we have discarded any terms for which K i =, ( ) π (R) = i π Ki F i = i F i F. Remark. If E and F are sigma-fields, note the distinction between E F ={E F : E E, F F} and E F := σ(e F). also works for any Hausdorff topological space 2. Why compact sets are needed Many of the measurability difficulties regarding projections stem from the fact that they do not ( preserve ) set-theoretic operations ( ) in the way that inverse images do: π i A i = i π A i but π i A i i π A i. Compactness of cross-sections will allow us to strengthen the last inclusion to an equality. <2> Lemma. [Finite intersection property] Suppose K 0 is a collection of compact subsets of a metric space X for which each finite subcollection has a nonempty intersection. Then K 0. Proof. Arbitrarily choose a K 0 from K 0.If K 0 were empty then the sets {K c : K K 0 } would be an open cover of K 0. Extract a finite subcover i=1 m K i c. Then m i=0 K i =, a contradiction. <3> Corollary. Suppose {A i : i N} is a decreasing sequence of subsets of T for which( each ω-cross-section ) K i (ω) := {t T : (t,ω) A i } is compact. Then π i N A i = i N π A i. Proof. Suppose ω i N π A i. Then {K i (ω) : i N} is a decreasing sequence of compact, nonempty (because ω π A i ) subsets of T. The finite intersection property of compact sets ensures that ( there) is a t in i N K i (ω). The point (t,ω) belongs to i N A i and ω π i A i. Remark. For our applications, we will be dealing only with sequences, but the argument also works for more general collections of sets with compact cross-sections. <4> Corollary. If B = i N R i with R i R then π B = i N π R i F. Proof. Note that the cross-section of each R-set is a finite union of compact sets, which is compact. Without loss of generality, we may assume that R 1 R 2... Invoke Corollary <3>. 3. Measurability of some projections For which B B(T ) F is it true that π (B) F? From Corollary <4>, we know that it is true if B belongs to R δ. The following properties of outer measures (see Problem [2]) will allow us to extend this nice behavior to sets in R σδ : (i) If A 1 A 2 then P (A 1 ) P (A 2 ) (ii) If {A i : i N} is an increasing sequence then P ( ) A ( ) i P i N A i. (iii) If {F i : i N} F is a decreasing sequence then P ( ) F i = PFi P ( ) i N F i = P ( ) i N F i. For each subset D of T define (D) := P π D, the outer measure of the projection of D onto. IfD i D then π D i π D.IfR i R and

AN-3 R i B then π R i F and π R i π B F. The properties for P carry over to analogous properties for : (i) If D 1 D 2 then (D 1 ) (D 2 ) (ii) If {D i : i N} is an increasing sequence then ( ) D ( ) i i N D i. (iii) If {R i : i N} R is a decreasing sequence then ( ) R i ( ) i N R i. With just these properties, we can show that π behaves well on a much larger collection of sets than R. <5> Lemma. If A R σδ then (B) = sup{ (B) : B R δ }. Consequently, the set π A belongs to F. Proof. Write A as i N D i with D i = j N R ij R σ.asris f -stable, we may assume that R ij is increasing in j for each fixed i. Suppose (A) >M for some constant M. Invoke (ii) for the sequence {AR 1 j }, which increases to AD 1 = A, to find an index j 1 for which the set R 1 := R 1 j1 has ( ) AR 1 > M. The sequence {AR 1 R 2 j } increases to AR 1 D 2 = AR 1. Again by (ii), there exists an index j 2 for which the set R 2 = R 2 j2 has (AR 1 R 2 )>M. And so on. In this way we construct sets R i in R for which (R 1 R 2...R n ) (AR 1 R 2...R n )>M for every n. The set B M := i N R i belongs to R δ ; it is a subset of i N D i = A; and, by (iii), (B) M. By Corollary <4>, the set B M projects to a set F M := π B M in F and hence PF M = B M. The set π A is inner regular, in the sense that P π A = A = sup{pf : π A F F} It follows (Problem [2]) that the set π A belongs to F. The properties shared by P and are so useful that they are given a name. <6> Definition. Suppose S is a paving on a set S. A function defined for all subsets of S and taking values in [, ] is said to be a Choquet S-capacity if it satisfies the following three properties. (i) If D 1 D 2 then (D 1 ) (D 2 ) (ii) If {D i : i N} is an increasing sequence then ( ) ( ) D i i N D i. (iii) If {S i : i N} S is a decreasing sequence then ( ) ( ) S i i N S i. The outer measure P is a Choquet F-capacity defined for the subsets of. Moreover, if is any Choquet F-capacity defined for the subsets of then (D) := (π D) is a Choquet R-capacity defined for the subsets of T. The argument from Lemma <5> essentially shows that if A R σδ then (B) = sup{ (B) : B R δ } for every such, whether defined via P or not. 4. Analytic sets The paving of S-analytic sets can be defined for any paving S on a set S. For our purposes, the most important case will be S = T with S = R.

AN-4 <7> Definition. Suppose S is a paving on a set S. A subset A of S is said to be S-analytic if there exists a compact metric space E and a subset D in ( K(E) S ) σδ for which A = π S D. Write A(S) for the set of all S-analytic subsets of S. Remark. Note that R σδ = (K(T ) F) σδ. The σ takes care of the f operation needed to generate R from K(T ) F. The R-analytic sets are also called K(T ) F-analytic sets. In fact, it is possible to find a single E that defines all the S-analytic subsets, but that possibility is not important for my purposes. What is important is the fact that A(S) is a ( c, c)-paving: see Problem [3]. When E is another compact metric space, Tychonoff s theorem (see Dudley 1989, Section 2.2, for example) ensures not only that the product space E T is a compact metric space but also that K(E) K(T ) K(E T ). Lemma <5>, applied to T := E T instead of T and with R the f -closure of K(E T ) F, implies that <8> π D F for each D in R σδ. Here π projects E T onto. We also have Rσδ ( K(E) K(T ) F ) σδ = ( K(E) R ) σδ where R is the f -closure of K(T ) F, as in Section 3. As a special case of property <8> we have <9> π D F for each D in ( K(E) R ) σδ. Write π as a composition of projection π π T, where π T projects E T onto T. AsE ranges over all compact metric spaces and D ranges over all the ( K(E) R ) σδ sets, the projections A := π T D range over all R-analytic subsets of T. Property <9> is equivalent to the assertion <10> π A F for all A A(R). In fact, the method used to prove Lemma <5> together with an analogue of the argument just outlined establishes an approximation theorem for analytic sets and general Choquet capacities. <11> Theorem. Suppose S is a ( f, f )-paving on a set S and Let is a Choquet S-capacity on S. Then (A) = sup{ (B) : A B S δ }. for each A in A(S). To prove assertion (i) of Theorem <1>, we have only to check that B(T ) F A(R) for the special case where T = [0, ]. By Problem [3], A(R) is a ( c, c)- paving. It follows easily that H := {H B(T ) F : H A(R) and H c A(R) } is a sigma-field on T. Each K F with K K(T ) and F F belongs to H because K(T ) F R A(R) and (K F) c = ( K F c) + ( K c ) K c = i N {t : d(t, K ) 1/i} K(T ) σ It follows that H = σ(k(t ) F) = B(T ) F and B(T ) F A(R).

AN-5 5. Existence of measurable cross-sections The general Theorem <11> is exactly what we need to prove part (ii) of Theorem <1>. Once again identify A with an R-analytic subset of T, where T = [0, ]. The result is trivial if α 1 := Pπ A = 0, so assume α 1 > 0. Invoke Theorem <11> for the R-capacity defined by (D) = P (π D). Find a subset with A B 1 R δ and P ( ) π B 1 = (B 1 ) α 1 /2. Define ψ 1 (ω) := inf{t R + : (t,ω) B 1 }. Because the set B 1 has compact cross-sections, the infimum is actually achieved for each ω in π B 1.Forω/ π B 1 the infimum equals. Define A 2 :={(t,ω) A : ω/ π B 1 }=A ( T (π B 1 ) c) Note that A 2 A(R) and α 2 := Pπ A 2 α 1 /2. Without loss of generality suppose α 2 > 0. Find a subset with A 2 B 2 R δ and P ( ) π B 2 = (B 2 ) α 2 /2. Define ψ 2 (ω) as the first hitting time on B 2. π Ω A B 1 B 2 π Ω A 2 And so on. The sets {π B i : i N} are disjoint, with F := i N π B i a If α subset of π A. By construction α i 0, which ensures that P ( (π A)\F ) i = 0 for some i, the construction requires only finitely = 0. many steps. Define ψ := inf i N ψ i.onbwe have (ψ(ω), ω) A. A T 6. Problems D&M Theorem 3.8 [1] Suppose S is a paving (on a set S), which is f -stable. Let S f consists of the set of all unions of finite collections of sets from S. Show that S f is a ( f, f )-paving. Hint: Show that ( i S i ) ( j T j ) = i, j (S i T j ). [2] The outer measure of a set A is defined as PA := inf{pf : A F F}. (i) Show that the infimum is achieved, that is, there exists an F F for which A F and P A = PF. Hint: Consider the intersection of a sequence of sets for which PF n P A. (ii) Suppose {D n : n N} is an increasing sequence of sets (not necessarily F-measurable) with union D. Show that P D n P D. Hint: Find sets with D i F i F and P D i = PF i. Show that i n F i F D and PF sup i N P D i. (iii) Suppose D is a subset of for which P D = sup{pf 0 : D F 0 F}. Show that D belongs to the P-completion of F (or to F itself if F is P-complete). Hint: Find sets F and F i in F for which F i D F and PF i P D = PF. Show that F\ ( ) i N F i has zero P-measure. [3] Suppose {A α : α N} A(S). Show that α A a A(S) and α A a A(S), by the following steps. Recall that there exist compact metric spaces {E α : α N}, each equipped with its paving K α of compact subsets, and sets D α ( K α S ) σδ for which A α = π S D α.

AN-6 (i) Define E := α N E α and E β = α N\{β} E α. Show that E is a compact metric space. (ii) Define D := D α E α. Show that D α ( K(E) S ) and that σδ A α = π S D α, where π S denotes the projection map from E S to S. ( ) (iii) Show that α A α = π S α D α and α D α ( K(E) S ) σδ. (iv) Without loss of generality suppose the E α spaces are disjoint otherwise replace E α by {α} E α. Define H = α N E α and E := H { }. Without loss of generality suppose the metric d α on E α is bounded by 2 α. Define { dα (x, y) if x, y E α d(x, y) = d(y, x) := 2 α + 2 β if x E α, y E β with α β 2 α if y = and x E α Show that E is a compact metric space under d. (v) Suppose D α = i N B αi with B αi (K α S) σ. Show that α D α = i α B α,i. Hint: Consider the intersection with E α S. (vi) Deduce that α D α (K(E ) S) σδ. (vii) Conclude that α A α = π S α D α A(S). References Dellacherie, C. & Meyer, P. A. (1978), Probabilities and Potential, North- Holland, Amsterdam. (First of three volumes). Dudley, R. M. (1989), Real Analysis and Probability, Wadsworth, Belmont, Calif.