Papalocal
Loading…
Papalocal · Things
Work

Neyman–Pearson lemma

Neyman–Pearson lemma is an approach in statistical testing.

All 3 facts, and where they come from

Facts

3 facts · 0 confirmed by two sources · 0 cited · 3 from one source

What it is
theorem One source
Named after
Jerzy Neyman One source
Egon Pearson One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2458983137
Described as
approach in statistical testing
What it is
theorem
Named after
Jerzy Neyman; Egon Pearson
Wikipedias with a page
13

Wikidata item Q1375989 (wikidata.org/wiki/Q1375989), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1359620561

In statistics, the Neyman–Pearson lemma describes the existence and uniqueness of the likelihood ratio as a uniformly most powerful test in certain contexts. It was introduced by Jerzy Neyman and Egon Pearson in a paper in 1933. The Neyman–Pearson lemma is part of the Neyman–Pearson theory of statistical testing, which introduced concepts such as errors of the second kind, power function, and inductive behavior. The previous Fisherian theory of significance testing postulated only one hypothesis. By introducing a competing hypothesis, the Neyman–Pearsonian flavor of statistical testing allows investigating the two types of errors. The trivial cases where one always rejects or fails to reject the null hypothesis are of little interest but it does prove that one must not relinquish control over one type of error while calibrating the other. Neyman and Pearson accordingly proceeded to restrict their attention to the class of all α level tests while subsequently minimizing type II error, traditionally denoted by β. Their seminal 1933 paper, which includes the Neyman–Pearson lemma showed not only the existence of tests with the most power that retain a prespecified level of type I error (α), but also provided a way to construct such tests. The Karlin-Rubin theorem extended the Neyman–Pearson lemma to settings involving composite hypotheses with monotone likelihood ratios.

From the Wikipedia article “Neyman–Pearson lemma” (en.wikipedia.org/wiki/Neyman–Pearson_lemma), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 2

Known for it