Processing math: 100%

Example Problems on Random Variables

ST779 Homework 5 on Random Variables

1

Let X be a real-valued random variable. Given any ϵ>0, show that there exists and an M>0 and a random variable Y∣≤M and P(XY)<ϵ.

We will proceed using the approximation theorem. That is, define

fn(ω)={2nif f(ω)2n2nif f(ω)<2nk2notherwise.

And fn(ω)f(ω)=X. That is, ω and ε>0 N large enough and nN such that

fn(ω)f(ω)∣<ε.

Then, K large enough such that kK such that

fn(ω)f(ω)∣>ε for finitely many ω.

Then take Y=fK(ω). Notice that this is bounded by M=2K.

2

Let X:[1,1][0,1] be a random variable defined be X(ω)=ω2 for 1ω<0. and X(ω)=ω3 for 0ω1. Let P be the uniform distribution on [1,1], i.e. P(B)=λ(B)/2, B and Borel subset of [1,1] and λ the Lebesgue measure. Find PX([a,b]), where [a,b] is a Borel subset of [0,1] and PX is the induced distribution, i.e., PX(C)=P(X1(C)), C a Borel subset of [0,1].

Our X1(ω) looks like

X1(ω)={ω:X(ω)x}={ω:{ω2x1ω<0ω3x0ω1}={ω:{ωx1/2(x1/2)ω<0ωx1/30ωx1/31}.

Now we can apply out Lebesgue measure to get the induced distribution.

PX([a,b])=P(X1([a,b]))={(b1/2)(a1/2)2ω[b,a]b1/3a1/32ω[a1/3,b1/3]

3

Let Ω be a sample space and A be a σ-field on Ω. Let X be a random variable. Show that the induced σ-field on σX={X1(B):BR} is countably generated.

Recall that R is countably generated by {(r,s):rs;r,sQ}. Now notice that

X1(B)={ω:X(ω)B), BR}.

So take

CX=X1({ω:X(ω)B)BR}).

We can see that CX is countably generated, now we need to show that σCX=σX. Recall that A=σCX. We will proceed with the Good Sets Principle.

G={GσCX:GσX}σCX

(i) CX is a generator for A by defintion. ✅

(ii) Take X1[(r,s)]CX. Since (r,s)R, X1[(r,s)]σX. So, CXG.

(iii) Showing G is a σ-field.

(a) Since ,ΩσX ,OmegaG

(b) Take G1,G2,G. Then G1,G2,σX. Since it is a σ-field, i=1GiσX. Thus i=1GiG.

(c) Take GG then GσX. Then GCσX because σX is a σ-field. Thus, GCG. ✅

So, by the Good Sets Principle σX=σCX.

4

Let a<b be real numbers. Construct a sequence of continuous functions fn:RR such that fn(x)I[a,b](x) as n for all x.

What about intervals (a,b) and (a,b]?

We need a continuous function that converges to 0 outside of [a,b] and converges to 1 inside of [a,b]. We can accomplish this with

fn(x)={en(xa)2x<a1axben(xb)2b<x.

For interval (a,b) we can change the inequalities to

fn(x)={en(xa)2xa1a<x<ben(xb)2bx.

And for interval (a,b]

fn(x)={en(xa)2xa1a<xben(xb)2b<x.

5

Let An, n1, be a sequence of σ-fields on Ω. Show that the {An:n=1,2,} is mutually independent if and only if for all n, An is indpendent of σA1,,An1.

State in terms of random variables, {Xn:n=1,2,} is mutually independent if and only if Xn is independent of {Xk:k=1,2,,n1}, with the connection An=σXn, the σ-field induced by Xn.

Let’s first assume that {An:n=1,2,dots} is mutually independent. We want to show that for CσA1,,An1 is independent of An for arbitrary n. Take AiAi.

P(AnC)=P(AnA1An1)=P(An)P(A1)P(An1)by mutual independence of allAi=P(An)P(A1An1)=P(An)P(C)

Thus, for all n, An is indpendent of σA1,,An1.

Now let’s assume for all n, An is independent of σA1,,An1. In order to show that T={An:n=1,2,} is mutually independent, we need to show that all finite subsets of T are mutually independent. Take an arbitrary, finite set of indices J={j1,,jm}. Without loss of generality, assume that j1<<jm. However, notice that

{Aj1,,Ajm}{A1,Ajm}.

We know that Ajm is independent of σA1,,Ajm1, so {Aj1,,Ajm} are also mutually independent. So we have show that an arbitrary finite subset of T is mutually indepdent, so {An:n=1,2,} is mutually independent.