Basilio is once again late to a date with Kitri. Kitri is not surprised, but she has not been able to model Basilio's late time with any known distribution. She knows, though, that Basilio is late on average . With such little information, can Kitri find an upper bound that is better than for the probability Basilio arriving later than half an hour?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes Kitri can, using Markov's inequality: P ( τ ≥ 3 0 ) ≤ 3 0 E ( τ ) = 3 0 1 5 = 2 1 < 1 . So, the answer we seek is Yes .
Here's a rough sketch of the proof. Assuming that τ is a random variable and that μ τ = E ( τ ) is finite. Let the indicator variable I be I = I ( τ ≥ 3 0 ) so that I = 1 if τ ≥ 3 0 and I = 0 if not. This implies two things: (i) τ ≥ τ ⋅ I ≥ 3 0 ⋅ I and (ii) P ( τ ≥ 3 0 ) = E ( I ) . Therefore, E ( τ ) ≥ E ( 3 0 ⋅ I ) = 3 0 ⋅ E ( I ) = 3 0 ⋅ P ( τ ≥ 3 0 ) . But this is simply saying P ( τ ≥ 3 0 ) ≤ 3 0 E ( τ ) = 3 0 1 5 = 2 1 < 1 .