Fifth post in the series.
Conditional Expectation as best guess of the next result
Think of some random Variable Xn and its σ-algebra Fn (algebra of its level sets)
look at the figure above, each patch represents a “minimal” set in Fn. Xn gives each of those sets constant value. Namely if A is one of the patches then ∀ω∈A∈Fn, Xn(ω)=αA.
Now what is E[Xn|Fn−1]?. Note that Fn−1⊆Fn so lets think of it as -
Look how the new σ-algebra is more coarse, some sets that are minimal here were finer divided in Fn. Xn is not measurable on Fn−1, But E[Xn|Fn−1] is, and E[Xn|Fn−1] gives us the best guess we can make about the out come of Xn. For example If on step n−1, Xn happened to fall on the sets that are minimal on both σ-algebras then we know it cant change on step n but if it hadn’t then we will be able to narrow down possible outcomes of step n but still there will be some uncertainty, our best guess will be the ecpected value of Xn on the possible outcomes in n, which is exactly the conditional expectation. Step n−1 does not provide all the information but it give us the probabilities of our best guesses we will be able to do on step n−1.
Technorati Tags: best guess,Conditional Expectation,ProbabilityWindows Live Tags: best guess,Conditional Expectation,Probability
WordPress Tags: best guess,Conditional Expectation,Probability
1 comment:
thanks for the great intuition!
Post a Comment