Problem 20.3 If $R$ is a nonnegative random variable, then Markov’s Theorem gives an upper bound on $Pr[R \geq x]$ for any real number $x \gt Ex[R]$. If b is a lower bound on R, then Markov’s Theorem can also be applied to $R - b$ to obtain a possibly different bound on $Pr[R \geq x]$.
a) Show that if $b > 0$, applying Markov’s Theorem to $R - b$ gives a smaller upper bound on $Pr[R \geq x]$ than simply applying Markov’s Theorem directly to R.
b) What value of $b > 0$ in part (a) gives the best bound?
This question is from Mathematics for Computer Science text book (MIT text for discrete math course). I would like to receive some help with this problem and if possible to send any resources to check if my solution is right or not. I am using the textbook but the problem is that I don't have a way to verify my solutions.
For part a:
$$\mathbb P (R - b \geq t) \leq \frac{\mathbb E R - b}{t} \leq \frac{\mathbb E R}{t}$$
where the second inequality follows when $b \geq 0$
For part b:
The RHS of the inequality given is linear in $b$ and thus is maximized at the constraint: $ X-b \geq 0$ with probability $1$. So the best value of $b$ is the largest lower bound of $X$ also known at the essential infimum of $X$.