A simple conditional expectation question

michonamona
Messages
120
Reaction score
0
Let v be a random variable distributed according to F(.). Let X be a set containing the objects x1 and x2. Suppose

E(v|x1) = b AND E(v|x2) = b (The expected value of v conditional on x1 is b, etc)

where b is some constant.

Does it follow that E(v|x1,x2) = b? If so, why?



Additionally, does the converse hold?

i.e. does E(v|x1,x2) = b imply E(v|x1) = b and E(v|x2) = b?


Thank you!
M
 
Physics news on Phys.org
Your converse is not true. Since the "If" part is always true for some b, it does not follow that every subdivision gives equal values. Find a random two cases E(v|x1) not equal to E(v|x2) any example of this would give you a counter example when you set b equal to E(v|x1,x2).

The original holds (I'm pretty sure) and you can verify it by simply breaking down the (conditional) expectation values into their definitions, sums over values times the corresponding (conditional) probabilities. You then use the P(A|B) = P(A and B)/P(B) formula and some algebra...at least that's how I'd start. There might be a lot of regrouping terms in a sum of sums but you should be able to manipulate definition of one side to a definition of the other.
 
michonamona said:
Let v be a random variable distributed according to F(.). Let X be a set containing the objects x1 and x2. Suppose

E(v|x1) = b AND E(v|x2) = b (The expected value of v conditional on x1 is b, etc)

where b is some constant.

Does it follow that E(v|x1,x2) = b?
Roll two dice. v is total, x1 is first die showing 1, x2 is second showing 1.
 
Is this a counter example?
 
michonamona said:
Is this a counter example?
That's what I'm suggesting.
 
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.

Similar threads

Replies
1
Views
2K
Replies
1
Views
1K
Replies
2
Views
2K
Replies
5
Views
2K
Replies
5
Views
2K
Replies
2
Views
2K
Back
Top