Math 2.0

statement lemma

Neyman–Pearson lemma

Statement

Consider a hypothesis test of the simple null hypothesis H0 ⁣:θ=θ0H_0 \colon \theta = \theta_0 against the simple alternative H1 ⁣:θ=θ1H_1 \colon \theta = \theta_1. Let L(θ∣x)L(\theta \mid x) be the likelihood of the data xx. For η>0\eta > 0, let the test reject H0H_0 when Λ(x)=L(θ0∣x)L(θ1∣x)≤η,\Lambda(x) = \frac{L(\theta_0 \mid x)}{L(\theta_1 \mid x)} \le \eta, and let α=Pθ0(Λ(X)≤η)\alpha = P_{\theta_0}(\Lambda(X) \le \eta) be its size. Then this likelihood-ratio test is a most powerful test of size α\alpha. Each other test with size at most α\alpha has at most the same power at θ1\theta_1.

Remarks

Consider all tests with a probability of a type I error at most α\alpha. Among them, the likelihood-ratio test has the smallest probability of a type II error. For a discrete law, an exact size α\alpha can need a randomized test on the boundary Λ(x)=η\Lambda(x) = \eta. Example: for an i.i.d. N(μ,1)\mathcal{N}(\mu, 1) sample and μ1>μ0\mu_1 > \mu_0, the test rejects H0H_0 when xˉ\bar{x} is large.

History

Jerzy Neyman and Egon Pearson introduced the lemma in a paper in 1933.

Explanations

L1 human

To choose between two exact hypotheses, the best test compares how well each hypothesis explains the data. If the alternative explains the data much better than the null hypothesis, reject the null hypothesis. No other test with the same false-alarm rate finds more true effects.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Neyman–Pearson_lemma, Statement