Problem Set 1 for Stochastic Processes II - M375T by Gerard Brunick, Assignments of Mathematics

Problem set 1 for stochastic processes ii - m375t, taught by gerard brunick. The problem set includes various tasks related to stochastic processes, such as computing integrals of stochastic processes, finding the sigma-algebras of certain random variables, and showing that the intersection of two sigma-fields is a sigma-field.

Typology: Assignments

Pre 2010

Uploaded on 08/30/2009

koofers-user-2ld
koofers-user-2ld 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Course: Stochastic Processes II - M375T Instructor: Gerard Brunick
Problem Set 1.01
1. Let N(t) =
1
[1,)(t) +
1
[2,)(t) +
1
[3,)(t) and compute f(t) = Rt
0s2dN(s).
2. Let Nbe defines as above and let M(t) = N(t)t. Compute g(t) = Rt
0N(s) dM(s).
3. Let Mbe defined as above, and let Θ(t) =
1
(1,)(t) +
1
(2,)(t) +
1
(3,)(t). Compute
h(t) = Rt
0Θ(s) dM(s).
4. Let = {ω1, ω2, ω3, ω4}, and let C={ω1, ω2, ω3},{ω2}. Compute σ(C) explicitly.
5. Let = Rand let C=(−∞,5),[0,10]. Compute σ(C) explicitly.
6. In this problem we let = R2, so a point in is really a pair of numbers which we
will write as (ω1, ω2)Ω. Let X(ω1, ω2) =
1
[0,)(ω1), and let Y(ω1, ω2) =
1
[0,)(ω2).
We let σ(X, Y ) denote the smallest σ-field that contains all sets of the form {Xx}
and {Yy}for constants xand y. Compute σ(X), σ(Y), and σ(X , Y ) explicitly.
7. Let Fand Gbe σ-fields over some set Ω. Show that FGis a σ-field.
8. What is the smallest set that contains an even number and the number 7? Does this
question even make sense? We defined σ(C) to be the smallest σ-field which contains
all the sets in C. Is this object well-defined?
9. Let (Ω,F,P) be a probability space and let Xbe a random variable, so {Xx} F
for any constant x. Show that {xXy} Fand {x < X < y} Ffor any
constants xand y.
Page: 1/1

Partial preview of the text

Download Problem Set 1 for Stochastic Processes II - M375T by Gerard Brunick and more Assignments Mathematics in PDF only on Docsity!

Course: Stochastic Processes II - M375T Instructor: Gerard Brunick

Problem Set 1.

  1. Let N (t) = (^1) [1,∞)(t) + (^1) [2,∞)(t) + (^1) [3,∞)(t) and compute f (t) = ∫^0 t s^2 dN (s).
  2. Let N be defines as above and let M (t) = N (t) − t. Compute g(t) = ∫^0 t N (s) dM (s).
  3. Let M be defined as above, and let Θ(t) = (^1) (1,∞)(t) + (^1) (2,∞)(t) + (^1) (3,∞)(t). Compute h(t) = ∫^0 t Θ(s) dM (s).
  4. Let Ω = {ω 1 , ω 2 , ω 3 , ω 4 }, and let C = {{ω 1 , ω 2 , ω 3 }, {ω 2 }}. Compute σ(C ) explicitly.
  5. Let Ω = R and let C = {(−∞, 5), [0, 10]}. Compute σ(C ) explicitly.
  6. In this problem we let Ω = R^2 , so a point in Ω is really a pair of numbers which we will write as (ω 1 , ω 2 ) ∈ Ω. Let X(ω 1 , ω 2 ) = (^1) [0,∞)(ω 1 ), and let Y (ω 1 , ω 2 ) = (^1) [0,∞)(ω 2 ). We let σ(X, Y ) denote the smallest σ-field that contains all sets of the form {X ≤ x} and {Y ≤ y} for constants x and y. Compute σ(X), σ(Y ), and σ(X, Y ) explicitly.
  7. Let F and G be σ-fields over some set Ω. Show that F ∩ G is a σ-field.
  8. What is the smallest set that contains an even number and the number 7? Does this question even make sense? We defined σ(C ) to be the smallest σ-field which contains all the sets in C. Is this object well-defined?
  9. Let (Ω, F , P) be a probability space and let X be a random variable, so {X ≤ x} ∈ F for any constant x. Show that {x ≤ X ≤ y} ∈ F and {x < X < y} ∈ F for any constants x and y.

Page: 1/