I Understanding the Law of Iterated Expectation in Probability Derivations

  • I
  • Thread starter Thread starter member 428835
  • Start date Start date
  • Tags Tags
    Expectation Law
member 428835
I'm reading a website where they're doing a derivation. Within the derivation they write $$E(X_n | X_{n-1}) = X_{n-1} + f \implies E(X_n) = E(X_{n-1} ) + f$$. Evidently the implication stems from the law of iterated expectation, but I can't see how. If it helps, the question asked is "what is the expected number of flips for a coin to achieve ##n## consecutive heads.
 
Physics news on Phys.org
Could you tell me more detail on the setting ? What are E, X_n and X_n|Xn-1 ?
 
anuttarasammyak said:
Could you tell me more detail on the setting ? What are E, X_n and X_n|Xn-1 ?
Sorry, I realize I didn't explain this well. Rather than retype everything, and since the website is very clear, perhaps the link is easier? It's here. I'm wondering how they applied the law of iterated expectation to arrive from equation 3 to 4.
 
We are given ## E(X_n | X_{n-1}) = X_{n-1} + f ##.
Take the expected value of both sides: ## E \left [ E(X_n | X_{n-1}) \right ] = E \left [ X_{n-1} + f \right ] ##.
From the law of iterated expectation we have ## E \left [ E(X_n | X_{n-1}) \right ] = E \left [ X_n \right ] ##.
 
  • Like
Likes member 428835
pbuk said:
We are given ## E(X_n | X_{n-1}) = X_{n-1} + f ##.
Take the expected value of both sides: ## E \left [ E(X_n | X_{n-1}) \right ] = E \left [ X_{n-1} + f \right ] ##.
From the law of iterated expectation we have ## E \left [ E(X_n | X_{n-1}) \right ] = E \left [ X_n \right ] ##.
Wow, I feel like a moron. Can we just say I was exhausted and that's why I was confused? Sheesh...thanks though!
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top