Alphabeta Math
Pipeline-generated
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

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

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A randomized threshold attains every test size

Statement

Let Q be a Borel probability measure on R and let 0<α<1. There are c+,c−∈R and γ+,γ−∈[0,1] such that Q((c+,∞))+γ+Q({c+})=α,Q((−∞,c−))+γ−Q({c−})=α.

Facts & Assumptions

Given: A Borel probability measure Q on R and 0<α<1.

[F1]

A measure is countably additive on pairwise disjoint measurable sequences. (Measures on sigma-algebras)

[F2]

Q(R)=1 and Q is a measure. (Probability measures and probability spaces)

[F3]

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)

[F4]

The Borel sigma-algebra is generated by the open sets. (The Borel sigma-algebra of a topological space)

Proof

1.1givenF1algebra

If En↑E, write D0=E0 and Dn=En∖En−1 for n≥1; these sets are disjoint with union E, so [F1] gives Q(E)=∑nQ(Dn)=lim⁡nQ(En). If En↓E and Q(E0)<∞, apply continuity from below to E0∖En↑E0∖E and subtract from Q(E0). Thus Q is continuous from below and above.

2.1givenF2F3step 1.1choosealgebra

Set S(t)=Q((t,∞)) and C={t:S(t)≤α}. By step 1.1, S(n)→0 and S(−n)→1, so C is nonempty and bounded below; it is upward closed. Let c+=inf⁡C by [F3]. For t>c+ there is s∈C with s<t, hence S(t)≤α; for t<c+, S(t)>α. Continuity from below and above gives Q((c+,∞))≤α≤Q([c+,∞)). If d=Q({c+})>0, set γ+=(α−Q((c+,∞)))/d∈[0,1]; if d=0, the inequalities force Q((c+,∞))=α, so take γ+=0.

3.1step 2.1F1F2F4constructalgebra∎

Define Q−(B)=Q({x:−x∈B}). Continuity of reflection and [F4] show every Borel B has Borel preimage; [F1]–[F2] then make Q− a Borel probability. Apply step 2.1 to Q−, obtaining c′ and γ−. With c−=−c′, Q−((c′,∞))=Q((−∞,c−)) and Q−({c′})=Q({c−}), 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Families with a monotone likelihood ratio

Definition

Assume AC. Let E=((X,A),Θ,(Pθ)θ∈Θ) be a statistical experiment with Θ⊆R, dominated by a fixed sigma-finite positive measure μ. Let T:(X,A)→(R,B(R)) be a statistic. Choose the simultaneous finite-valued nonnegative density representatives pθ=dPθ/dμ from Likelihood densities.

For θ1<θ2, define the extended likelihood ratio on Uθ1,θ2={x:pθ1(x)+pθ2(x)>0} by Rθ2,θ1(x)={pθ2(x)/pθ1(x),pθ1(x)>0,+∞,pθ1(x)=0<pθ2(x). The family has a monotone likelihood ratio (MLR) in T when, for each ordered pair θ1<θ2, there is a nondecreasing Borel function rθ2,θ1:R→[0,+∞] such that Rθ2,θ1(x)=rθ2,θ1(T(x)) for μ-almost every x∈Uθ1,θ2. 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; T need not be sufficient.

Remarks

Because the ratio is nondecreasing in T, increasing the parameter favors larger values of T. The convention R=+∞ where the lower-parameter density vanishes records any alternative-only mass and keeps the direction of the upper-tail rule explicit.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

MLR orders the power of randomized thresholds

Statement

Assume AC and let a dominated one-parameter experiment have MLR in the real statistic T. For c∈R and γ∈[0,1], put ϕc,γ+=1{T>c}+γ1{T=c},ϕc,γ−=1{T<c}+γ1{T=c}. Then for every θ1<θ2, Eθ1ϕc,γ+≤Eθ2ϕc,γ+,Eθ1ϕc,γ−≥Eθ2ϕc,γ−.

Facts & Assumptions

Given: AC, a dominated experiment with MLR in T, real c, γ∈[0,1], and θ1<θ2.

[F1]

For θ1<θ2, there is a nondecreasing Borel function r such that r(T)=pθ2/pθ1 μ-almost everywhere where pθ1>0, and r(T)=+∞ μ-almost everywhere where pθ1=0<pθ2. (Families with a monotone likelihood ratio)

[F2]

If p is a nonnegative measurable density, then integrating against p dμ equals integrating the product against μ: ∫g d(p dμ)=∫gp dμ for nonnegative measurable g. (Integrating against a density agrees with integrating the product)

[F3]

Pθ1 and Pθ2 are probability measures, so each has mass one. (Probability measures and probability spaces)

[F4]

A Borel function composed with the measurable statistic T is measurable; hence the MLR ratio function r(T) can be integrated. (Composition with a Borel measurable outer map preserves measurability)

[A1]

AC supplies the simultaneous likelihood-density versions used in [F1]. (The Axiom of Choice)

Proof

1.1givenA1F1F4choose

Choose simultaneous densities p1=pθ1 and p2=pθ2 using AC [A1], let r be their nondecreasing Borel MLR function, and put A={p1>0} and S={p1=0<p2} with s=Pθ2(S). Let N be the union of the μ-null exceptional sets in [F1]. For x∈S∖N and y∈A∖N, r(T(x))=+∞ while r(T(y))=p2(y)/p1(y)<+∞; monotonicity therefore gives T(y)<T(x). The two laws give N measure zero, Pθ1(A)=1, and Pθ2(S)=s. Since ϕc,γ+ is nondecreasing in T and ϕc,γ− is nonincreasing in T, this support order gives Eθ2[ϕc,γ+1S]≥sEθ1ϕc,γ+,Eθ2[ϕc,γ−1S]≤sEθ1ϕc,γ−. By [F4], r(T) is measurable.

2.1givenF1F2F3step 1.1

Partition X into B−={T<c}, B0={T=c}, and B+={T>c}. Put aj=Pθ1(Bj) and bj=Pθ2(Bj∩A). On A, [F1] gives p2=r(T)p1 μ-almost everywhere, so [F2] yields bj=∫Bj∩Ap2 dμ=∫Bj∩Ar(T)p1 dμ=∫Bj∩Ar(T) dPθ1. The measurability of r(T) was established in step 1.1. Also [F3] and step 1.1 give ∑jbj=1−s and Pθ1(A)=1, hence Pθ1(Bj∩A)=aj. For each block with aj>0, set rj=bj/aj. Monotonicity [F1] orders r(T) values across every pair of occupied blocks, so their Pθ1-averages satisfy ri≤rj whenever i<j.

3.1step 1.1step 2.1algebra

For ordered block values g−≤g0≤g+, omitting zero-mass blocks, expansion gives ∑jajrjgj−(∑jajrj)(∑jajgj)=∑i<jaiaj(rj−ri)(gj−gi)≥0. Step 2.1 gives ∑jaj=1 and ∑jajrj=1−s. For the upper threshold g=(0,γ,1), this identity makes Eθ2[ϕc,γ+1A]≥(1−s)Eθ1ϕc,γ+. Step 1.1 gives Eθ2[ϕc,γ+1S]≥sEθ1ϕc,γ+, and Pθ2(X∖(A∪S))=0. Adding these bounds proves Eθ2ϕc,γ+≥Eθ1ϕc,γ+.

4.1step 1.1step 2.1step 3.1algebra∎

The lower threshold g=(1,γ,0) is nonincreasing, so the covariance identity in step 3.1 is nonpositive and gives Eθ2[ϕc,γ−1A]≤(1−s)Eθ1ϕc,γ−. Step 1.1 gives Eθ2[ϕc,γ−1S]≤sEθ1ϕc,γ−; the remaining set has Pθ2 measure zero. Adding these bounds proves Eθ2ϕc,γ−≤Eθ1ϕc,γ−.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The Karlin–Rubin theorem for one-sided tests

Statement

Assume AC. Let E=((X,A),Θ,(Pθ)) have MLR in a real statistic T, let θ0∈Θ, and let 0<α<1. A randomized test is a binary-action probability kernel as in Randomized tests; write ψ(x)=K(x,{1}) for its measurable rejection function. For nonempty, disjoint null and alternative sets, power, size, and level have the conventions in Test size and power: βψ(θ)=Eθψ, size sup⁡θ∈Θ0βψ(θ), 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 c+,γ+ and c−,γ− such that Pθ0(T>c+)+γ+Pθ0(T=c+)=α,Pθ0(T<c−)+γ−Pθ0(T=c−)=α. Such choices exist by A randomized threshold attains every test size. Then ϕ+=1{T>c+}+γ+1{T=c+} defines a UMP randomized test of level α for H0:θ≤θ0 against H1:θ>θ0, and ϕ−=1{T<c−}+γ−1{T=c−} defines a UMP randomized test of level α for H0:θ≥θ0 against H1:θ<θ0. All hypotheses are intersected with Θ.

Facts & Assumptions

Given: AC, a dominated experiment with Θ⊆R and MLR in T, θ0∈Θ, and 0<α<1.

[F1]

For every θ1<θ2, there is a nondecreasing Borel function q:R→[0,+∞] such that q(T) equals the extended likelihood ratio pθ2/pθ1 μ-almost everywhere on the union of the density supports, with ratio +∞ where pθ1=0<pθ2. The exceptional null set may depend on the parameter pair. (Families with a monotone likelihood ratio)

[F2]

For a real-valued statistic under any probability law and 0<α<1, an upper or lower threshold with boundary randomization can be chosen to have rejection probability exactly α. (A randomized threshold attains every test size)

[F3]

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)

[F4]

A randomized test has a measurable rejection-probability function ψ:X→[0,1]. (Randomized tests)

[F5]

A density pθ defines the measure pθ dμ=Pθ, and for nonnegative measurable g one has Eθg=∫gpθ dμ. (Likelihood densities, The measure with density f relative to μ, Integrating against a density agrees with integrating the product)

[F6]

Integrability is ∫∣f∣<∞, the nonnegative integral is monotone, and the Lebesgue integral is linear on L1. (Integrable real and complex functions, and their integrals, Monotonicity and nonnegative homogeneity of the nonnegative integral, The Lebesgue integral is linear on L1(μ))

[F7]

For each parameter the chosen likelihood density is a finite-valued nonnegative representative of its Radon–Nikodym class. (Likelihood densities)

[F8]

For nonempty disjoint null and alternative sets, the power is Eθψ, size is the supremum of power on the null, and level α means size at most α. (Test size and power)

[F9]

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)

[F10]

A probability kernel assigns a probability measure to each x and has a measurable event-evaluation function x↦K(x,B) for each action event B. (Measure kernel and probability kernel)

[A1]

AC permits the simultaneous choice of likelihood-density representatives in Likelihood densities, as required by the MLR definition (The Axiom of Choice).

Proof

1.1givenF2F4F7F9F10A1chooseconstruct

By [F2], choose c+,γ+ and c−,γ− so both threshold functions have expectation α under Pθ0. Since T is measurable, their threshold events and functions ϕ+,ϕ− are measurable; disjointness of each pair of threshold events and γ±∈[0,1] give 0≤ϕ±≤1. For each sign, define K±(x,B)=ϕ±(x)1{1∈B}+(1−ϕ±(x))1{0∈B} for B⊆{0,1}. 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 K±(x,⋅) is a probability measure. Each event evaluation is one of 0,1,ϕ±,1−ϕ±, 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].

2.1step 1.1F3F8algebra

By [F3], Eθϕ+≤Eθ0ϕ+=α for θ≤θ0, and Eθϕ−≤Eθ0ϕ−=α for θ≥θ0. Each null contains θ0, 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.

2.2givenF1F5F7F9step 1.1

Fix θ1>θ0 with densities p0,p1, let q be their Borel MLR function, and let N be its pairwise μ-null exceptional set from [F1]. By [F5], Pθ0(N)=0 and Pθ0(p0>0)=1. Put k=q(c+). The value k is finite: if Pθ0(T=c+)>0, there is a point of this boundary outside N with p0>0 and finite p1; otherwise Pθ0(T>c+)=α>0 gives such a point above the threshold and monotonicity forces q(c+)<∞. On {p0>0}∖N, p1−kp0=p0(q(T)−k) is nonnegative above c+, nonpositive below it, and zero at T=c+. On {p0=0<p1}∖N, q(T)=+∞; finite k and monotonicity force T>c+, where ϕ+=1. Where both densities vanish, p1−kp0=0. By [F9], the products and differences are measurable, so every competing test ψ satisfies (ϕ+−ψ)(p1−kp0)≥0 μ-almost everywhere.

3.1step 1.1step 2.1step 2.2F5F6F8F9algebra

The measurable product in step 2.2 is integrable because ∣ϕ+−ψ∣≤1 and p0,p1 each integrate to one. Apply [F5] to the positive and negative parts of ϕ+−ψ; linearity [F6] then gives Eθ1(ϕ+−ψ)−kEθ0(ϕ+−ψ)=∫(ϕ+−ψ)(p1−kp0) dμ≥0. For a level-α competitor, [F8] and step 1.1 give Eθ0ψ≤α=Eθ0ϕ+, while k≥0; thus Eθ1ϕ+≥Eθ1ψ. Since θ1>θ0 was arbitrary, ϕ+ is UMP for the upper alternative.

4.1F1step 1.1step 3.1constructalgebra∎

Reparameterize by η=−θ and put S=−T. For η1<η2, let q represent p−η1/p−η2 as in [F1]. Define h(u)=1/u for 0<u<+∞, h(0)=+∞, and h(+∞)=0. The function s↦h(q(−s)) is Borel and nondecreasing, since reflection and h both reverse order. Outside the original pairwise exceptional set on the union of supports, it represents p−η2/p−η1, including points where either density is zero; where both vanish no ratio is required. Thus the reflected family has MLR in S. Apply the upper-tail result of steps 1.1–3.1 at η0=−θ0 with cutoff −c− and boundary probability γ−, calibrated by step 1.1. The resulting UMP test is exactly ϕ− for the original lower alternative.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A two-sided normal alternative need not have a UMP test

Statement

Assume AC. Let X have law Pθ=N(θ,1) on R, with θ∈R, and test the simple null H0:θ=0 against the two-sided alternative H1:θ∈{−1,1}. 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 0<α<1, no such test maximizes power at both alternative values.

Facts & Assumptions

Given: AC and 0<α<1.

[A1]

AC states that every family of nonempty sets has a choice function. (The Axiom of Choice)

[F1]

N(0,1) has density φ(x)=e−x2/2/2π, and N(θ,1) is the law of x↦θ+x under N(0,1). (Standard normal and normal laws)

[F2]

Translation preserves Lebesgue measurability and Lebesgue measure. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)

[F3]

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)

[F4]

The measure with density f is (f dλ)(A)=∫Af dλ, and integration against it is integration of the product against λ. (The measure with density f relative to μ, Integrating against a density agrees with integrating the product)

[F5]

Countable choice selects from every sequence of nonempty sets; under that principle every singleton in R is Lebesgue null. (The Axiom of Countable Choice (ACω), A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in Rn)

[F7]

Integrability is ∫∣f∣<∞, the nonnegative integral is monotone, and the Lebesgue integral is linear on L1. (Integrable real and complex functions, and their integrals, Monotonicity and nonnegative homogeneity of the nonnegative integral, The Lebesgue integral is linear on L1(μ))

[F8]

A randomized test is a binary-action probability kernel; its test function is a measurable rejection-probability function with values in [0,1]. (Randomized tests)

[F9]

For any probability law and 0<α<1, an upper or lower threshold with boundary randomization can attain rejection probability α. (A randomized threshold attains every test size)

[F10]

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)

[F11]

A nonnegative measurable function has integral zero exactly when it vanishes almost everywhere. (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere)

[F12]

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)

[F13]

The Borel sigma-algebra on R contains every open ray, so the threshold indicators are measurable. (The Borel sigma-algebra of a topological space)

[F14]

A probability kernel assigns a probability measure to each observation and has measurable event-evaluation functions. (Measure kernel and probability kernel)

Proof

1.1A1F1F2F3F12given

Write φ(x)=e−x2/2/2π and Pθ=N(θ,1). The translation τθ(x)=x+θ is measurable and preserves Lebesgue measure by [F2]–[F3]; [F1] makes Pθ the push-forward of φ dλ under τθ. For each Borel A, x↦φ(x−θ) is continuous, so its product with the measurable indicator 1A is measurable by [F12]; integral invariance gives Pθ(A)=∫Aφ(x−θ) dλ(x), so pθ(x)=φ(x−θ) is a positive density for every θ.

2.1A1F4F5F8F9F10F12F13F14step 1.1chooseconstruct

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], P0({c})=∫{c}p0 dλ=0 for every real c. Applying [F9] under P0 gives finite c+,c− with P0(X>c+)=P0(X<c−)=α, since the boundary masses vanish. The threshold indicators are measurable by [F13]. For B⊆{0,1}, define K±(x,B)=ϕ±(x)1{1∈B}+(1−ϕ±(x))1{0∈B}. 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].

3.1step 1.1step 2.1F4F5F7F10F11F12algebra

Step 1.1 gives p1(x)/p0(x)=ex−1/2, strictly increasing, and p−1(x)/p0(x)=e−x−1/2, strictly decreasing. Put k+=ec+−1/2>0. For any level-α test ψ, (ϕ+−ψ)(p1−k+p0)≥0: above c+ both factors are nonnegative, below it both are nonpositive, and at c+ the second vanishes. [F12] makes this product measurable; since ∣ϕ+−ψ∣≤1 and each density integrates to one, [F7] makes it integrable. Apply [F4] to the positive and negative parts of ϕ+−ψ, then [F7] gives E1(ϕ+−ψ)−k+E0(ϕ+−ψ)=∫(ϕ+−ψ)(p1−k+p0) dλ≥0. By [F10] and step 2.1, E0ϕ+=α≥E0ψ, so E1ϕ+≥E1ψ. If equality holds, the two nonnegative terms in E1(ϕ+−ψ)=∫(ϕ+−ψ)(p1−k+p0) dλ+k+E0(ϕ+−ψ) vanish. [F11] makes the integrand zero λ-almost everywhere; strict monotonicity then forces ψ=ϕ+ off c+ almost everywhere, and step 2.1 gives P0({c+})=0. Since P0 has density p0, equality forces ψ=ϕ+ P0-almost surely, so ϕ+ is most powerful against θ=1, uniquely up to P0-almost-sure equality of rejection functions.

3.2step 1.1step 2.1F4F5F7F10F11F12algebra

Put k−=e−c−−1/2>0. For x<c−, ϕ−(x)−ψ(x)≥0 and p−1(x)−k−p0(x)>0; for x>c− both are nonpositive, and at c− 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 E−1(ϕ−−ψ)−k−E0(ϕ−−ψ)=∫(ϕ−−ψ)(p−1−k−p0) dλ≥0. By [F10] and step 2.1, E0ϕ−=α≥E0ψ, so E−1ϕ−≥E−1ψ. If equality holds, both nonnegative terms in the sum vanish; [F11] makes the integrand zero λ-almost everywhere, and strict decrease of p−1/p0 forces ψ=ϕ− off c− almost everywhere. Step 2.1 gives P0({c−})=0, and its density then gives equality P0-almost surely, proving uniqueness up to P0-almost-sure equality of rejection functions against θ=−1.

4.1step 2.1step 3.1step 3.2F1F4F5F6F7F10algebra∎

If a UMP test ψ∗ existed, its optimality at θ=1 and step 3.1 would force ψ∗=ϕ+ P0-almost surely, while its optimality at θ=−1 and step 3.2 would force ψ∗=ϕ− P0-almost surely. Choose x0>max⁡(c+,c−); positivity and continuity of p0 give a nondegenerate interval above both cutoffs on which p0 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 P0 measure by [F4] and [F7], but ϕ+=1 and ϕ−=0 there, contradicting the two almost-sure equalities. Therefore no UMP level-α test exists.

5 · Examples, counterexamples and false statements

None yet.

Sources