Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Finite type-II testing function with explicit orientation

Definition

Let P,Q be probability vectors on a finite nonempty alphabet X (Finite probability vectors). They define finite probability spaces with outcome weights px and qx, respectively (Finite probability spaces, outcome weights, events, and event probabilities). For h:X→R, write EPh:=∑xpxh(x) and EQh:=∑xqxh(x); these are the finite expectations (Expectation of a real random variable on a finite probability space). Test the simple null H0:P against the simple alternative H1:Q. A randomized test is a function ϕ:X→[0,1], where ϕ(x) is the probability of rejecting H0 after observing x; thus 1−ϕ(x) is the probability of accepting H0 (Randomized tests). Its type-I error is ∑xpxϕ(x), and its type-II error is ∑xqx(1−ϕ(x)) (Test size and power).

For ϵ∈[0,1], define the oriented type-II testing function βϵ(P,Q):=inf⁡ϕ:X→[0,1]∑xpxϕ(x)≤ϵ∑xqx(1−ϕ(x)). Here the first argument is the null law and the second is the alternative law; ϵ bounds rejection under the first law, while the objective is acceptance of the null under the second. The feasible set is nonempty because ϕ=0 is allowed, and every objective value lies in [0,1]. Thus the set of objective values is nonempty and bounded below in R, so it has a real infimum: The real numbers identifies R with the Cauchy-sequence reals, The reals form a totally ordered field gives their ordered-field structure, and The Cauchy-sequence reals have the least-upper-bound property gives their least-upper-bound property. Complete ordered field (least-upper-bound property) gives the equivalent infimum property. Since the set also lies in [0,1], that infimum lies in [0,1]. In the Neyman–Pearson-region convention that constrains null acceptance below by γ, this is the lower boundary value at γ=1−ϵ.

Remarks

The symbol βϵ(P,Q) here is the infimum type-II error. It is not the power function Eθ[ϕ] from Test size and power; under Q, it minimizes one minus that power.

Depends on

Used by

Dependency tree · two levels

35 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