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 be probability vectors on a finite nonempty alphabet (Finite probability vectors). They define finite probability spaces with outcome weights and , respectively (Finite probability spaces, outcome weights, events, and event probabilities). For , write and ; these are the finite expectations (Expectation of a real random variable on a finite probability space). Test the simple null against the simple alternative . A randomized test is a function , where is the probability of rejecting after observing ; thus is the probability of accepting (Randomized tests). Its type-I error is , and its type-II error is (Test size and power).
For , define the oriented type-II testing function 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 is allowed, and every objective value lies in . Thus the set of objective values is nonempty and bounded below in , so it has a real infimum: The real numbers identifies 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 , that infimum lies in . In the Neyman–Pearson-region convention that constrains null acceptance below by , this is the lower boundary value at .
Remarks
The symbol here is the infimum type-II error. It is not the power function from Test size and power; under , it minimizes one minus that power.
Depends on
- Finite probability vectors
- Finite probability spaces, outcome weights, events, and event probabilities
- Randomized tests
- Test size and power
- Expectation of a real random variable on a finite probability space
- Complete ordered field (least-upper-bound property)
- The real numbers
- The reals form a totally ordered field
- The Cauchy-sequence reals have the least-upper-bound property
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
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, Chapter 14, §14.1, Definition 14.1 (standard reference, not scraped)
- George Deligiannidis, Foundations of Statistical Inference, §13.1.1, Definition 13.1 (standard reference, not scraped)