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.
Test size and power
Definition
Let be a statistical experiment (Statistical experiments). Let be nonempty disjoint subsets of , called the null and alternative hypotheses. A hypothesis is simple when it is a singleton and composite when it has at least two elements.
For a randomized test with test function (Randomized tests), its power function is Its size is and it has level when this supremum is at most . The expectations exist and lie in because and each is a probability measure (Probability measures and probability spaces, Expectation of a nonnegative or integrable random variable). The supremum exists because is nonempty, the values lie in . Here 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 establishes their least-upper-bound property (Complete ordered field (least-upper-bound property)).
For the binary action , where means reject, the zero-one error loss is when and , or when and , and is otherwise. The decision-rule risk from Loss functions and risk integrates this loss against the action kernel and data law. For each fixed , its section on the binary action space is measurable. The risk identities proved in Binary zero-one loss risks are the testing error probabilities show that risk equals on and on . Thus size is the worst null error risk, and power is the rejection probability under each alternative parameter.
Remarks
The supremum need not be attained. No measurability structure on or on the subsets is required; the definition uses only the individual laws and the pointwise supremum.
Depends on
- Statistical experiments
- Randomized tests
- Loss functions and risk
- Binary zero-one loss risks are the testing error probabilities
- Expectation of a nonnegative or integrable random variable
- Probability measures and probability spaces
- 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
- Exact selective tests and confidence sets from the pivot Corollary
- The one-sample Hotelling F test has exact size alpha Corollary
- A measurable [0,1]-valued statistic need not be a valid p-value Counterexample
- Finite power-oracle queries cannot universally certify no feasible sample size Counterexample
- Canonical group-sequential alpha-spending design Definition
- Conditional tests given a statistic Definition
- Critical, detection, and quantification levels Definition
- Finite type-II testing function with explicit orientation Definition
- Likelihood-ratio tests with boundary randomization Definition
- Power and sample-size planning specifications Definition
- A binary Neyman–Pearson boundary randomization Example
- A continuous likelihood-ratio test Example
- A randomized UMP test for a binomial model Example
- Binomial upper confidence limit by lower-tail test inversion Example
- Fisher's exact test from two Bernoulli samples Example
- Opposed most powerful tests for two normal alternatives Example
- Randomize at a discrete likelihood-ratio boundary Example
- The likelihood-ratio rule is a measurable test of exact size Lemma
- Both tails determine power for the known-variance two-sided normal z-test Proposition
- A two-sided normal alternative need not have a UMP test Theorem
- Conditional level implies unconditional level Theorem
- Coverage from test inversion Theorem
- Exact finite-group permutation p-values and tests Theorem
- Exact limits in the known-blank equal-variance normal model Theorem
- Exact power and least sample size for a known-variance normal z-test Theorem
- Exact t and partial F inference in full-rank Gaussian regression Theorem
- Group-sequential boundaries exist uniquely and spend alpha exactly Theorem
- Neyman–Pearson lemma with singular alternative mass Theorem
- The Karlin–Rubin theorem for one-sided tests Theorem
- Valid p-values yield level tests for nonempty disjoint alternatives Theorem
- Validity of identity-corrected random-permutation Monte Carlo p-values Theorem
Dependency tree · two levels
40 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
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, Chapter 13, §§13.1.1–13.1.2, PDF pp. 76–77 (standard reference, not scraped)
- Karl B. Gregory, USC STAT 713 Lecture 10: Tests of Hypotheses, Size, Power, and p-values, PDF pp. 2–7 (standard reference, not scraped)