2.II.19C

Statistics | Part IB, 2007

State and prove the Neyman-Pearson lemma.

Suppose that XX is a random variable drawn from the probability density function

f(xθ)=12xθ1ex/Γ(θ),<x<f(x \mid \theta)=\frac{1}{2}|x|^{\theta-1} e^{-|x|} / \Gamma(\theta), \quad-\infty<x<\infty

where Γ(θ)=0yθ1eydy\Gamma(\theta)=\int_{0}^{\infty} y^{\theta-1} e^{-y} d y and θ1\theta \geqslant 1 is unknown. Find the most powerful test of size α\alpha, 0<α<10<\alpha<1, of the hypothesis H0:θ=1H_{0}: \theta=1 against the alternative H1:θ=2H_{1}: \theta=2. Express the power of the test as a function of α\alpha.

Is your test uniformly most powerful for testing H0:θ=1H_{0}: \theta=1 against H1:θ>1?H_{1}: \theta>1 ? Explain your answer carefully.

Typos? Please submit corrections to this page on GitHub.