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
AI Thread Summary
The discussion centers on the application of the law of iterated expectation in a probability derivation involving expected values of random variables. The key equation discussed is E(X_n | X_{n-1}) = X_{n-1} + f, leading to E(X_n) = E(X_{n-1}) + f. Participants clarify that taking the expected value of both sides allows the use of the law of iterated expectation, resulting in E[E(X_n | X_{n-1})] = E[X_n]. The confusion expressed by the original poster highlights the complexity of understanding these concepts, particularly in the context of calculating the expected number of flips for achieving n consecutive heads. Overall, the thread emphasizes the importance of the law of iterated expectation in deriving expected values in probability.
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!
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top