A random variable X has the probability density function
f(x) = e⁻ˣ x^λ / λ!; x > 0
where λ is a positive integer. Using Chebyshev’s inequality, show that
P[0 < X < 2(λ + 1)] > λ/(λ + 1)
10 marks · directive: Show
The core of a good answer
X is a gamma variable with E(X) = V(X) = λ + 1; Chebyshev's inequality with deviation λ + 1 = k σ, k = √(λ + 1), gives P[|X − (λ + 1)| < λ + 1] ≥ 1 − 1/(λ + 1) = λ/(λ + 1), and the event is exactly 0 < X < 2(λ + 1); the inequality is strict because X is continuous.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
Two things are needed: the first two moments of X (using the gamma integral ∫₀^∞ e⁻ˣ xⁿ dx = n!) and the right choice of k in Chebyshev's inequality so that the interval μ ± kσ becomes (0, 2(λ + 1)).
Answer outline
Introduction
f is the gamma density with shape λ + 1 and scale 1. Chebyshev: P(|X − μ| < kσ) ≥ 1 − 1/k² for any k > 0.
Step 1: Mean
- E(X) = (1/λ!) ∫₀^∞ e⁻ˣ x^{λ+1} dx = (λ + 1)!/λ! = λ + 1.
Step 2: Variance
- E(X²) = (λ + 2)!/λ! = (λ + 2)(λ + 1).
- V(X) = (λ + 2)(λ + 1) − (λ + 1)² = λ + 1, so σ = √(λ + 1).
Step 3: Apply Chebyshev
- Choose kσ = λ + 1, i.e. k = √(λ + 1), so 1/k² = 1/(λ + 1).
- P[|X − (λ + 1)| < λ + 1] ≥ 1 − 1/(λ + 1) = λ/(λ + 1).
- |X − (λ + 1)| < λ + 1 ⇔ 0 < X < 2(λ + 1).
Step 4: Why the inequality is strict
- Equality in Chebyshev's bound needs all probability on the three points μ − kσ, μ, μ + kσ; a continuous X cannot do that, so P[0 < X < 2(λ + 1)] > λ/(λ + 1).
Step 5: Numerical check (Python)
- λ = 1: exact probability 0.908 against bound 0.5; λ = 2: 0.938 against 0.667; λ = 5: 0.980 against 0.833.
Conclusion
P[0 < X < 2(λ + 1)] > λ/(λ + 1). The exact gamma probabilities computed in Python are well above the bound, which shows Chebyshev is valid but conservative.
Examples and data to cite
- For λ = 1 the bound says at least 50% of the mass lies in (0, 4); the exact gamma probability is about 90.8%.
Facts to remember
- Gamma integral: ∫₀^∞ e⁻ˣ xⁿ dx = Γ(n + 1) = n! for integer n.
- Gamma(shape α, scale 1) has mean α and variance α; here α = λ + 1.
- Chebyshev's inequality: P(|X − μ| ≥ kσ) ≤ 1/k², equivalently P(|X − μ| < kσ) ≥ 1 − 1/k².
- Chebyshev's bound is attained only by a three-point distribution.