Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Neyman–Pearson lemma with singular alternative mass

Statement

Let E=((X,A),{0,1},(P0,P1)) be the two-law experiment with simple null P0 and simple alternative P1. Assume both laws are dominated by a common sigma-finite measure μ and assume the Axiom of Choice, so finite nonnegative density representatives p0,p1 are supplied by Likelihood densities. For every α∈[0,1], let φα∗ be the likelihood-ratio test with boundary randomization from Likelihood-ratio tests with boundary randomization. Then every randomized test φ satisfying EP0[φ(X)]≤α also satisfies EP1[φ(X)]≤EP1[φα∗(X)]. No absolute-continuity assumption P1≪P0 is imposed; the test rejects on {p0=0<p1}.

Facts & Assumptions

Given: The two-law experiment, a common sigma-finite dominator μ, the Axiom of Choice, α∈[0,1], and a randomized test φ of size at most α under P0.

[A1]

The Axiom of Choice: AC is assumed only for selecting the finite nonnegative density representatives in [F2].

[F1]

Dominated statistical experiments: μ is sigma-finite and Pi≪μ for i=0,1.

[F2]

Likelihood densities: under AC, Pi has a finite-valued nonnegative measurable density representative pi with Pi(A)=∫Api dμ.

[F3]

Randomized tests: a randomized-test function is measurable and takes values in [0,1]; its value is the conditional rejection probability.

[F4]

Test size and power: the competitor has EP0φ≤α and its power under P1 is EP1φ.

[F5]

Likelihood-ratio tests with boundary randomization and The likelihood-ratio rule is a measurable test of exact size: the candidate is a measurable randomized test with exact size α; for α>0 it rejects on {p0=0<p1} and above the cutoff c, and uses probability γ at R=c; for α=0 it rejects on {p0=0<p1}.

[F6]

The measure with density f relative to μ and Integrating against a density agrees with integrating the product: for nonnegative measurable g, EPig=∫gpi dμ.

[F7]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous for nonnegative scalars.

[F9]

Measures on sigma-algebras: countable unions of pairwise disjoint measurable sets have measure equal to the sum of their measures.

[F12]

Measures are monotone: a measurable subset of a null set has measure zero.

[F13]

Sigma-algebras: measurable sets are closed under complements and countable unions, hence under finite set differences.

[F14]

The well-ordering principle: every nonempty subset of the natural numbers has a least member.

[F15]

Bounded signed integrals obey the density formula: for a bounded measurable real D, EPiD=∫Dpi dμ.

[F16]

For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε: for each positive real a, there is a positive integer n with 1/n<a.

Proof

technique · direct
1.1A1F1F2F3F5F6F8F10given

First suppose α>0, so the cutoff c in [F5] is finite. Put D=φα∗−φ. Then D is measurable and ∣D∣≤1. By [F2] and [F6], ∫pi dμ=Pi(X)=1, so ∣Dpi∣≤pi makes Dpi integrable for i=0,1. Since c is finite, D(p1−cp0) is also integrable.

2.1F2F3F5F10step 1.1

On {p0=0}, if p1>0 then [F5] gives φα∗=1, so D(p1−cp0)≥0; if p1=0, the product is zero. On {p0>0}, write R=p1/p0. If R>c, then φα∗=1 and both D and p1−cp0 are nonnegative. If R<c, then φα∗=0 and both are nonpositive. If R=c, the second factor is zero. Thus D(p1−cp0)≥0 everywhere.

2.2F8F15step 1.1algebra

The signed density identity [F15] and linearity [F8] give ∫D(p1−cp0) dμ=(EP1φα∗−EP1φ)−c(EP0φα∗−EP0φ).

3.1F4F5F7step 2.2step 2.1algebra

By monotonicity of the nonnegative integral, the integral in step 2.2 is nonnegative. Hence EP1φα∗−EP1φ≥c(EP0φα∗−EP0φ). The candidate has null rejection probability α by [F5], while the competitor has null rejection probability at most α by [F4]. Since c≥0, the right-hand side is nonnegative, proving the desired power inequality for α>0.

4.1F1F2F3F5F6F7F9F10F11F12F13F14F16givenconstructalgebra∎

Now suppose α=0. Then EP0φ=0, so [F6] gives ∫φp0 dμ=0. For positive integers n,m, set Bn,m={φ≥1/n}∩{p0≥1/m}. On this set, φp0≥1/(nm); [F7] and [F11] therefore give 0≥∫Bn,mφp0 dμ≥μ(Bn,m)/(nm). Thus μ(Bn,m)=0, and absolute continuity [F1] gives P1(Bn,m)=0. For each positive-integer pair (n,m) put Cn,m={φ≥1/n}∩{p0≥1/m}, enumerate these pairs by increasing n+m and then by increasing n, and write the resulting sequence of sets as (Ck)k≥0. If φ(x)>0 and p0(x)>0, [F16] supplies positive integers n,m with 1/n<φ(x) and 1/m<p0(x), so x∈⋃kCk. Conversely every Ck is contained in {φ>0, p0>0}; hence this union is exactly that set. Put D0=C0 and Dk=Ck∖⋃j<kCj for k≥1. The Dk are measurable by [F13], pairwise disjoint, and each Dk⊆Ck, so the preceding null-set calculation and [F12] give P1(Dk)=0. Their union equals ⋃kCk: if x lies in that union, the nonempty set of indices k with x∈Ck has a least member by [F14], which puts x in the corresponding Dk. Countable additivity [F9] makes the union P1-null. On its complement, φ=0 wherever p0>0; where p0=0<p1, [F5] gives φ0∗=1, and the remaining set {p0=p1=0} has P1 measure zero because p1=0 there and [F2], [F6] give P1(A)=∫Ap1 dμ. Therefore φ≤φ0∗ P1-almost everywhere, and monotonicity of expectation proves the power inequality at α=0.

Depends on

Used by

Dependency tree · two levels

85 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources