Cdf of a discrete random variable and convergence of distributions

Artusartos
Messages
236
Reaction score
0
In the page that I attached, it says "...while at the continuity points x of F_x (i.e., x \not= 0), lim F_{X_n}(x) = F_X(x)." But we know that the graph of F_X(x) is a straight line y=0, with only x=0 at y=1, right? But then all the points to the right of zero should not be equal to the limit of F_{X_n}(x), right? Because F_X(x) is always zero at those points, but F_X(x) is 1? So how do I make sense of that?

Thanks in advance
 

Attachments

  • 295(1).jpg
    295(1).jpg
    25.4 KB · Views: 431
Last edited:
Physics news on Phys.org
Artusartos said:
But we know that the graph of F_X(x) is a straight line y=0, with only x=0 at y=1, right?

No, I think F_X(x) is the cumulative distribution, not a density function.
 
Stephen Tashi said:
No, I think F_X(x) is the cumulative distribution, not a density function.

Oh, ok...

But it's still confusing. What if n=4 (for example)? Then F_{X_n} = 1 if x \geq 1/4, and F_{X_n}=0, when x < 1/4, right? So for any x between 0 and 1/4, the limit at those points is 0, but the limit of F_X at those points is 1...so the limits are not equal, are they?
 
Artusartos said:
So for any x between 0 and 1/4, the limit at those points is 0,

What limit are you talking about? Something like lim_{x \rightarrow 1/8} F_{X_4}(x) ? I see nothing in the discussion in the book that dealt with that sort of limit. The limits under consideration involve n \rightarrow \infty.
 
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