How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
UMP Tests
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tests, Neyman–Pearson and Valid P-values
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
This page defines monotone likelihood ratio for a scalar statistic and proves the randomized one-sided Karlin–Rubin result. Boundary randomization gives an exact level when the statistic has atoms. The upper-tail rule applies when larger parameter values increase the likelihood ratio in the statistic; the lower-tail rule applies to the reversed hypotheses. The theorem uses MLR in the likelihood of the full data and does not require the statistic to be sufficient. A separate normal-location result shows why the one-sided conclusion does not extend to every two-sided alternative.
3 · Logical flowchart
4 · Definitions, theorems and proofs
A randomized threshold attains every test size
Statement
Let be a Borel probability measure on and let . There are and such that
Facts & Assumptions
Given: A Borel probability measure on and .
A measure is countably additive on pairwise disjoint measurable sequences. (Measures on sigma-algebras)
and is a measure. (Probability measures and probability spaces)
Every nonempty real set bounded below has an infimum, and an infimum is its greatest lower bound. (Greatest lower bound (infimum), Every nonempty set bounded below has an infimum)
The Borel sigma-algebra is generated by the open sets. (The Borel sigma-algebra of a topological space)
Proof
If , write and for ; these sets are disjoint with union , so [F1] gives . If and , apply continuity from below to and subtract from . Thus is continuous from below and above.
Set and . By step 1.1, and , so is nonempty and bounded below; it is upward closed. Let by [F3]. For there is with , hence ; for , . Continuity from below and above gives . If , set ; if , the inequalities force , so take .
Define . Continuity of reflection and [F4] show every Borel has Borel preimage; [F1]–[F2] then make a Borel probability. Apply step 2.1 to , obtaining and . With , and , which gives the lower-tail equality.
Remarks
The value randomizes only at the boundary atom. If there is no atom at the selected threshold, the tail already has probability exactly and the boundary value is immaterial.
Families with a monotone likelihood ratio
Definition
Assume AC. Let be a statistical experiment with , dominated by a fixed sigma-finite positive measure . Let be a statistic. Choose the simultaneous finite-valued nonnegative density representatives from Likelihood densities.
For , define the extended likelihood ratio on by The family has a monotone likelihood ratio (MLR) in when, for each ordered pair , there is a nondecreasing Borel function such that for -almost every . The set where both densities vanish is irrelevant. No common exceptional null set for all parameter pairs is asserted. This definition concerns the likelihood ratio of the full data; need not be sufficient.
Remarks
Because the ratio is nondecreasing in , increasing the parameter favors larger values of . The convention where the lower-parameter density vanishes records any alternative-only mass and keeps the direction of the upper-tail rule explicit.
MLR orders the power of randomized thresholds
Statement
Assume AC and let a dominated one-parameter experiment have MLR in the real statistic . For and , put Then for every ,
Facts & Assumptions
Given: AC, a dominated experiment with MLR in , real , , and .
For , there is a nondecreasing Borel function such that -almost everywhere where , and -almost everywhere where . (Families with a monotone likelihood ratio)
If is a nonnegative measurable density, then integrating against equals integrating the product against : for nonnegative measurable . (Integrating against a density agrees with integrating the product)
and are probability measures, so each has mass one. (Probability measures and probability spaces)
A Borel function composed with the measurable statistic is measurable; hence the MLR ratio function can be integrated. (Composition with a Borel measurable outer map preserves measurability)
AC supplies the simultaneous likelihood-density versions used in [F1]. (The Axiom of Choice)
Proof
Choose simultaneous densities and using AC [A1], let be their nondecreasing Borel MLR function, and put and with . Let be the union of the -null exceptional sets in [F1]. For and , while ; monotonicity therefore gives . The two laws give measure zero, , and . Since is nondecreasing in and is nonincreasing in , this support order gives By [F4], is measurable.
Partition into , , and . Put and . On , [F1] gives -almost everywhere, so [F2] yields . The measurability of was established in step 1.1. Also [F3] and step 1.1 give and , hence . For each block with , set . Monotonicity [F1] orders values across every pair of occupied blocks, so their -averages satisfy whenever .
For ordered block values , omitting zero-mass blocks, expansion gives . Step 2.1 gives and . For the upper threshold , this identity makes . Step 1.1 gives , and . Adding these bounds proves .
The lower threshold is nonincreasing, so the covariance identity in step 3.1 is nonpositive and gives . Step 1.1 gives ; the remaining set has measure zero. Adding these bounds proves .
The Karlin–Rubin theorem for one-sided tests
Statement
Assume AC. Let have MLR in a real statistic , let , and let . A randomized test is a binary-action probability kernel as in Randomized tests; write for its measurable rejection function. For nonempty, disjoint null and alternative sets, power, size, and level have the conventions in Test size and power: , size , and level when the size is at most . Here a level- test is uniformly most powerful (UMP) when it has at least as large a power as every other level- test at every parameter in the alternative set; if an alternative set is empty, define level by the same null-supremum formula and the pointwise UMP comparison is vacuous.
Choose and such that Such choices exist by A randomized threshold attains every test size. Then defines a UMP randomized test of level for against , and defines a UMP randomized test of level for against . All hypotheses are intersected with .
Facts & Assumptions
Given: AC, a dominated experiment with and MLR in , , and .
For every , there is a nondecreasing Borel function such that equals the extended likelihood ratio -almost everywhere on the union of the density supports, with ratio where . The exceptional null set may depend on the parameter pair. (Families with a monotone likelihood ratio)
For a real-valued statistic under any probability law and , an upper or lower threshold with boundary randomization can be chosen to have rejection probability exactly . (A randomized threshold attains every test size)
Under MLR, the rejection probability of an upper randomized threshold is nondecreasing in , while that of a lower randomized threshold is nonincreasing. (MLR orders the power of randomized thresholds)
A randomized test has a measurable rejection-probability function . (Randomized tests)
A density defines the measure , and for nonnegative measurable one has . (Likelihood densities, The measure with density relative to , Integrating against a density agrees with integrating the product)
Integrability is , the nonnegative integral is monotone, and the Lebesgue integral is linear on . (Integrable real and complex functions, and their integrals, Monotonicity and nonnegative homogeneity of the nonnegative integral, The Lebesgue integral is linear on )
For each parameter the chosen likelihood density is a finite-valued nonnegative representative of its Radon–Nikodym class. (Likelihood densities)
For nonempty disjoint null and alternative sets, the power is , size is the supremum of power on the null, and level means size at most . (Test size and power)
Sums, scalar multiples, and products of measurable extended-real functions are measurable whenever the pointwise operations are defined. (Arithmetic and lattice operations preserve measurability whenever they are defined)
A probability kernel assigns a probability measure to each and has a measurable event-evaluation function for each action event . (Measure kernel and probability kernel)
AC permits the simultaneous choice of likelihood-density representatives in Likelihood densities, as required by the MLR definition (The Axiom of Choice).
Proof
By [F2], choose and so both threshold functions have expectation under . Since is measurable, their threshold events and functions are measurable; disjointness of each pair of threshold events and give . For each sign, define for . The two weights are nonnegative and sum to one, and the formula is countably additive because each point belongs to at most one event in a disjoint sequence; thus is a probability measure. Each event evaluation is one of , hence measurable by [F9]. Thus [F10] gives probability kernels, which are randomized tests by [F4], with the stated functions. Select the finite-valued density representatives used below as in [F7] and [A1].
By [F3], for , and for . Each null contains , so its supremum size is at most ; by [F8] and the empty-alternative convention in the statement, both candidates have level for their stated nulls.
Fix with densities , let be their Borel MLR function, and let be its pairwise -null exceptional set from [F1]. By [F5], and . Put . The value is finite: if , there is a point of this boundary outside with and finite ; otherwise gives such a point above the threshold and monotonicity forces . On , is nonnegative above , nonpositive below it, and zero at . On , ; finite and monotonicity force , where . Where both densities vanish, . By [F9], the products and differences are measurable, so every competing test satisfies -almost everywhere.
The measurable product in step 2.2 is integrable because and each integrate to one. Apply [F5] to the positive and negative parts of ; linearity [F6] then gives . For a level- competitor, [F8] and step 1.1 give , while ; thus . Since was arbitrary, is UMP for the upper alternative.
Reparameterize by and put . For , let represent as in [F1]. Define for , , and . The function is Borel and nondecreasing, since reflection and both reverse order. Outside the original pairwise exceptional set on the union of supports, it represents , including points where either density is zero; where both vanish no ratio is required. Thus the reflected family has MLR in . Apply the upper-tail result of steps 1.1–3.1 at with cutoff and boundary probability , calibrated by step 1.1. The resulting UMP test is exactly for the original lower alternative.
A two-sided normal alternative need not have a UMP test
Statement
Assume AC. Let have law on , with , and test the simple null against the two-sided alternative . A randomized test is a binary-action probability kernel as in Randomized tests; write for its measurable rejection function. Level and power use Test size and power. Here UMP means maximizing power at each alternative among level- tests. For every , no such test maximizes power at both alternative values.
Facts & Assumptions
Given: AC and .
AC states that every family of nonempty sets has a choice function. (The Axiom of Choice)
has density , and is the law of under . (Standard normal and normal laws)
Translation preserves Lebesgue measurability and Lebesgue measure. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)
A measurable self-map that preserves the measure on every measurable set preserves integrals of nonnegative measurable functions. (Measure-preserving transformations and systems, Integral invariance under measure-preserving maps)
The measure with density is , and integration against it is integration of the product against . (The measure with density relative to , Integrating against a density agrees with integrating the product)
Countable choice selects from every sequence of nonempty sets; under that principle every singleton in is Lebesgue null. (The Axiom of Countable Choice (), A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in )
Under countable choice, a nondegenerate interval has its positive length as Lebesgue measure. (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
Integrability is , the nonnegative integral is monotone, and the Lebesgue integral is linear on . (Integrable real and complex functions, and their integrals, Monotonicity and nonnegative homogeneity of the nonnegative integral, The Lebesgue integral is linear on )
A randomized test is a binary-action probability kernel; its test function is a measurable rejection-probability function with values in . (Randomized tests)
For any probability law and , an upper or lower threshold with boundary randomization can attain rejection probability . (A randomized threshold attains every test size)
For a nonempty simple null and alternative, power is rejection probability at each parameter and level means null rejection probability at most . (Test size and power)
A nonnegative measurable function has integral zero exactly when it vanishes almost everywhere. (A nonnegative measurable function has integral exactly when it vanishes almost everywhere)
Sums, products, and scalar multiples of measurable functions are measurable whenever the pointwise operations are defined. (Arithmetic and lattice operations preserve measurability whenever they are defined)
The Borel sigma-algebra on contains every open ray, so the threshold indicators are measurable. (The Borel sigma-algebra of a topological space)
A probability kernel assigns a probability measure to each observation and has measurable event-evaluation functions. (Measure kernel and probability kernel)
Proof
Write and . The translation is measurable and preserves Lebesgue measure by [F2]–[F3]; [F1] makes the push-forward of under . For each Borel , is continuous, so its product with the measurable indicator is measurable by [F12]; integral invariance gives , so is a positive density for every .
AC [A1] applied to any sequence of nonempty sets supplies a choice function on its values and hence a sequence choice, so [F5] shows every singleton is -null. By step 1.1 and [F4], for every real . Applying [F9] under gives finite with , since the boundary masses vanish. The threshold indicators are measurable by [F13]. For , define . The two weights are nonnegative and sum to one, and the formula is countably additive because each point belongs to at most one event in a disjoint sequence; each event evaluation is measurable by [F12]–[F13]. Thus [F14] gives probability kernels with test functions , which are randomized tests by [F8] and have level by [F10].
Step 1.1 gives , strictly increasing, and , strictly decreasing. Put . For any level- test , : above both factors are nonnegative, below it both are nonpositive, and at the second vanishes. [F12] makes this product measurable; since and each density integrates to one, [F7] makes it integrable. Apply [F4] to the positive and negative parts of , then [F7] gives . By [F10] and step 2.1, , so . If equality holds, the two nonnegative terms in vanish. [F11] makes the integrand zero -almost everywhere; strict monotonicity then forces off almost everywhere, and step 2.1 gives . Since has density , equality forces -almost surely, so is most powerful against , uniquely up to -almost-sure equality of rejection functions.
Put . For , and ; for both are nonpositive, and at the density difference is zero. By [F12] the product is measurable; it is nonnegative and integrable by [F7]. Apply [F4] to the positive and negative parts of , then [F7] gives . By [F10] and step 2.1, , so . If equality holds, both nonnegative terms in the sum vanish; [F11] makes the integrand zero -almost everywhere, and strict decrease of forces off almost everywhere. Step 2.1 gives , and its density then gives equality -almost surely, proving uniqueness up to -almost-sure equality of rejection functions against .
If a UMP test existed, its optimality at and step 3.1 would force -almost surely, while its optimality at and step 3.2 would force -almost surely. Choose ; positivity and continuity of give a nondegenerate interval above both cutoffs on which is bounded below by a positive constant. By [F6] and the countable choice in step 2.1, that interval has positive Lebesgue and hence positive measure by [F4] and [F7], but and there, contradicting the two almost-sure equalities. Therefore no UMP level- test exists.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jun Shao, Stat 610 Mathematical Statistics, Lecture 11, Theorem 8.3.17, PDF pp. 9–10
- George Deligiannidis, Foundations of Statistical Inference, Theorem 13.5, PDF p. 78
- George Deligiannidis, Foundations of Statistical Inference, Definition 13.4 and Theorem 13.5, PDF pp. 77–78
- Jun Shao, Stat 610 Mathematical Statistics, Lecture 11, Definition 8.3.16, PDF pp. 6–7
- Karl B. Gregory, STAT 713 Lecture 11, slides 9–12, annotated PDF pp. 13–22
- Jun Shao, Stat 610 Mathematical Statistics, Lecture 11, Lemma B and Theorem 8.3.17, PDF pp. 8–10
- George Deligiannidis, Foundations of Statistical Inference, Theorem 13.5 and proof, PDF pp. 77–78
- Jun Shao, Stat 610 Mathematical Statistics, Lecture 11, Theorem 8.3.17 and proof, PDF pp. 8–10
- Karl B. Gregory, STAT 713 Lecture 11, Karlin–Rubin theorem and examples, annotated PDF pp. 13–22
- George Deligiannidis, Foundations of Statistical Inference, Neyman–Pearson Theorem 13.2 and UMP discussion, PDF pp. 77–78
- Karl B. Gregory, STAT 713 Lecture 11, Neyman–Pearson lemma and proof annotations, annotated PDF pp. 6–9