Question

prove following P(x < X ≤ y) = F(y) − F(x) P(X = x) = F(x)...

prove following

P(x < X ≤ y) = F(y) − F(x)

P(X = x) = F(x) − F(x−) where F(x−) = limy↑x F(y);

P(X = x) = F(x+) − F(x−).

Homework Answers

Answer #1

If X be a random variable with probability function P(x) and its distribution function is defined as

F(x)= P(X x)

now 1 P( x<X y) =P(Yy) - P(Xx) = F(y)- F( x) for every x<y

2. F(x) - F( x - ) = P(x-y < X x) since P( Xx) - P(X x- ) = F(x) -F( x- )

3. F(x+ ) - F( x-) = p(x-y < X x+y ) since P( X x+) - P( X x- ) = F(x+) - F(x-)

and P (x- < X < x+ ) = F(x+ ) - F(x-) -- P(X=x) since P(x<X <y) =F(y)- F(x) -- P(X=x)

Hence F( x + ) - F( x -) = P( X=x)

Hence the proof

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove the following : (∃x)(F(x)⋀(G(x)⋁(H(x)))→(∃x)(∃y)(F(x)⋀(G(y)⋁H(y)))
Prove the following : (∃x)(F(x)⋀(G(x)⋁(H(x)))→(∃x)(∃y)(F(x)⋀(G(y)⋁H(y)))
Please prove the following theorem: Suppose (X,p) and (Y,b) are metric spaces, X is compact, and...
Please prove the following theorem: Suppose (X,p) and (Y,b) are metric spaces, X is compact, and f:X→Y is continuous. Then f is uniformly continuous.
o prove that if p(x) ∈ F[x], and a ∈ F, then p(a) = 0 if...
o prove that if p(x) ∈ F[x], and a ∈ F, then p(a) = 0 if and only if x − a divides p(x).
8.4: Let f : X → Y and g : Y→ Z be maps. Prove that...
8.4: Let f : X → Y and g : Y→ Z be maps. Prove that if composition g o f is surjective then g is surjective. 8.5: Let f : X → Y and g : Y→ Z be bijections. Prove that if composition g o f is bijective then f is bijective. 8.6: Let f : X → Y and g : Y→ Z be maps. Prove that if composition g o f is bijective then f is...
Prove that if f: X → Y is a continuous function and C ⊂ Y is...
Prove that if f: X → Y is a continuous function and C ⊂ Y is closed that the preimage of C, f^-1(C), is closed in X.
Find a model for each of the following wffs: A:∀x (p(x, f(x)) → p(x, y))
Find a model for each of the following wffs: A:∀x (p(x, f(x)) → p(x, y))
Prove that the function f(x,y) is differentiable at (0,0) by using epsilon-delta method. (1) f(x,y) =...
Prove that the function f(x,y) is differentiable at (0,0) by using epsilon-delta method. (1) f(x,y) = x+y+xy (2) f(x,y) = sin(xy)
Assume that X and Y are finite sets. Prove the following statement: If there is a...
Assume that X and Y are finite sets. Prove the following statement: If there is a bijection f:X→Y then|X|=|Y|. Hint: Show that if f : X → Y is a surjection then |X| ≥ |Y| and if f : X → Y is an injection then |X| ≤ |Y |.
1. Prove p∧q=q∧p 2. Prove[((∀x)P(x))∧((∀x)Q(x))]→[(∀x)(P(x)∧Q(x))]. Remember to be strict in your treatment of quantifiers .3. Prove...
1. Prove p∧q=q∧p 2. Prove[((∀x)P(x))∧((∀x)Q(x))]→[(∀x)(P(x)∧Q(x))]. Remember to be strict in your treatment of quantifiers .3. Prove R∪(S∩T) = (R∪S)∩(R∪T). 4.Consider the relation R={(x,y)∈R×R||x−y|≤1} on Z. Show that this relation is reflexive and symmetric but not transitive.
Which of the following strings P is a Python program. (b) P = “def f(x): x...
Which of the following strings P is a Python program. (b) P = “def f(x): x = 'am I a Python program?'” (d) P = “def f(x,y,z): return y” (e) P = “def f(x): return y” For each of the following Python programs P and input strings I, give the output P(I), (f) P = “def f(x): return str(len(x+x+'x'))”, I = “GAGAT” (g) P = “def f(x): return str(len(x))”, I=P (h) P = “def f(x): return str(1/int(x))”, I = “0”