Hypothesis Testing Framework

A pharmaceutical company has a new drug. Does it actually lower blood pressure more than a placebo? Or could the observed improvement be explained by chance? This is the central question of hypothesis testing. It is one of the two great pillars of statistical inference, alongside estimation. Confidence Intervals: Concept and Construction asks "what is the value of this parameter." Hypothesis testing instead asks a sharper, binary question. Is this specific claim about the parameter consistent with the data? Or should we reject it? The framework matters because science, medicine, engineering, and law all run on decisions made under uncertainty. Hypothesis testing is the formal machine that turns "the data look suggestive" into a decision procedure. That procedure has quantified error rates. It forces the analyst to commit, in advance, to what would count as evidence against a claim. It also requires stating honestly how often such a procedure would be wrong, even when used correctly. This discipline — deciding the rule before seeing the outcome — is what separates statistical inference from post-hoc storytelling. The big picture is a courtroom analogy formalized with probability. There is a default position, the null hypothesis. It is presumed true until the data provide sufficiently strong evidence against it. This is exactly as a defendant is presumed innocent. There is a competing claim, the alternative hypothesis, which the data must convince us to prefer. A test statistic condenses the sample into one number. A rejection region specifies which values of that number count as "sufficiently strong evidence." The two ways the procedure can err are quantified and traded off against each other. These are convicting the innocent (Type I error) and acquitting the guilty (Type II error). This article builds the full architecture. It covers the formal definitions of hypotheses, test statistics, and rejection regions. It explains the precise meanings of significance level and power. It presents the fundamental theorem connecting rejection regions to error probabilities. It also includes two complete worked examples with numerically distinct, asymmetric inputs. It closes by pointing toward the machinery that makes this framework operational in practice. That machinery includes The Neyman-Pearson Lemma, p-values, and the standard named tests.

Key takeaways
  • A hypothesis test decides between a null hypothesis H0H_0 and an alternative H1H_1 using sample data and a fixed decision rule.
  • A test statistic TT is a function of the data; a rejection region CC is the set of TT-values that lead to rejecting H0H_0.
  • Type I error (rejecting a true H0H_0) has probability α\alpha, the significance level; Type II error (failing to reject a false H0H_0) has probability β\beta.
  • Power is 1−β1-\beta, the probability of correctly rejecting a false H0H_0; it depends on the true parameter value, sample size, and α\alpha.
  • Tests are built by fixing α\alpha first, then choosing the rejection region to maximize power — this ordering is not optional.
  • Every conclusion is conditional on the model assumptions (distribution, independence, sample size) used to derive the sampling distribution of TT.
  • Key idea: a hypothesis test is a pre-committed decision rule whose two error rates are explicitly quantified and traded off, never a post-hoc judgment about "significance."

Where this lives today

Hypothesis testing is the backbone of experimental science: clinical trials use it to decide whether a treatment effect is real, with regulatory agencies mandating pre-registered α\alpha levels (commonly 0.05 or 0.025 one-sided) precisely to prevent the data-dependent rejection-region abuse illustrated in the counterexample above. In physics, discovery claims (such as the Higgs boson) are framed as hypothesis tests against a "no new physics" null, but with an extremely stringent significance threshold (the "5-sigma" convention) reflecting the cost of false discovery in a field with many simultaneous searches. In engineering and manufacturing, statistical process control charts are built from repeated hypothesis tests that flag when a process mean or variance has shifted out of specification, directly extending the mechanics of Example 1. In machine learning and A/B testing, the same architecture (null: no difference between algorithm variants; test statistic: a standardized difference in conversion rates; rejection region: extreme values) governs decisions about which website design or model to deploy, though at internet scale the framework's dependence on pre-registered rejection regions is often violated by "peeking" at results early, an error structurally identical to the counterexample. In cryptography and statistical hypothesis-testing-based intrusion detection, the same null/alternative structure with controlled false-alarm (α\alpha) and missed-detection (β\beta) rates underlies anomaly detection systems. The theoretical core developed here — size, power, and the tradeoff between them — sets up directly for The Neyman-Pearson Lemma (optimal tests), the theory of p-values and significance (a continuous-valued summary of the evidence against H0H_0), and the standard named procedures gathered under Standard Tests: t, Chi-Squared, and F.

Ask the tutor: How does the choice between a one-sided and two-sided alternative change the critical value and power of a test for the same data?

DefinitionHypothesis test

Let X1,…,XnX_1,\dots,X_n be a random sample from a distribution FθF_\theta indexed by an unknown parameter θ∈Θ\theta \in \Theta. A statistical hypothesis is a statement that restricts θ\theta to a subset of Θ\Theta. A hypothesis test consists of: 1. A null hypothesis H0:θ∈Θ0H_0: \theta \in \Theta_0 and an alternative hypothesis H1:θ∈Θ1H_1: \theta \in \Theta_1, where Θ0\Theta_0 and Θ1\Theta_1 partition Θ\Theta (disjoint, and typically exhaustive: Θ0∪Θ1=Θ\Theta_0 \cup \Theta_1 = \Theta). 2. A test statistic T=T(X1,…,Xn)T = T(X_1,\dots,X_n), a real-valued function of the data whose sampling distribution under H0H_0 is known (exactly or asymptotically). 3. A rejection region (critical region) C⊆RC \subseteq \mathbb{R}, a fixed subset of the range of TT, chosen in advance. The decision rule is:

reject H0 if T(X1,…,Xn)∈C,do not reject H0 otherwise.\text{reject } H_0 \text{ if } T(X_1,\dots,X_n) \in C, \qquad \text{do not reject } H_0 \text{ otherwise.}

A hypothesis H0:θ=θ0H_0: \theta = \theta_0 (a single point) is called simple; a hypothesis H0:θ∈Θ0H_0: \theta \in \Theta_0 with ∣Θ0∣>1|\Theta_0|>1 is called composite. The power function of the test is

π(θ)=Pθ(T∈C),θ∈Θ,\pi(\theta) = P_\theta(T \in C), \qquad \theta \in \Theta,

the probability of rejecting H0H_0 when the true parameter is θ\theta. For θ∈Θ0\theta \in \Theta_0, π(θ)\pi(\theta) is the Type I error probability at that θ\theta; for θ∈Θ1\theta \in \Theta_1, π(θ)\pi(\theta) is the power of the test at θ\theta, and 1−π(θ)1 - \pi(\theta) is the Type II error probability at that θ\theta. The size (or significance level) of the test is

α=sup⁡θ∈Θ0π(θ).\alpha = \sup_{\theta \in \Theta_0} \pi(\theta).

Intuition

Think of the test statistic as a dial with a needle, and the rejection region as a red zone marked on the dial before any data are collected. Once the data arrive, the needle moves to a single position; if it lands in the red zone, we reject H0H_0. The two hypotheses are not symmetric: H0H_0 is the default, and the burden of proof is on the data to push the needle into the red zone. This asymmetry is deliberate — it mirrors the presumption of innocence, and it means the test is designed to control the more serious error (wrongly abandoning the default) at a fixed, small rate α\alpha, even before considering how well it detects real effects. Power is the answer to "if H1H_1 is actually true, and specifically true at some value θ\theta, how likely is the needle to land in the red zone?" This depends on how far θ\theta is from Θ0\Theta_0: values of θ\theta deep inside H1H_1's territory are easy to detect (high power), while values just barely inside H1H_1 are nearly indistinguishable from H0H_0 (power near α\alpha). Enlarging the rejection region increases power but also increases α\alpha — the two error types are locked in a seesaw, and sample size is the lever that lets you push both down simultaneously.

Figure
Rejection region for a one-sided z-test at level α = 0.05, testing H₀: μ = 0 vs H₁: μ > 0
z 0 1.645 3 reject H₀ (area = α = 0.05) sampling distribution of Z under H₀ critical value z₀.₀₅ = 1.645
TheoremFundamental error–tradeoff and Neyman–Pearson–style construction

Let TT be a test statistic with a fully known distribution under a simple null H0:θ=θ0H_0: \theta = \theta_0, and let Cα={t:t≥cα}C_\alpha = \{t : t \ge c_\alpha\} be a rejection region defined by a critical value cαc_\alpha chosen so that

Pθ0(T≥cα)=α.P_{\theta_0}(T \ge c_\alpha) = \alpha.

Assume TT has a continuous distribution under θ0\theta_0 (so such a cαc_\alpha exists and is unique), and assume the family {T under θ}\{T \text{ under } \theta\} is stochastically increasing in θ\theta: for θ′>θ\theta' > \theta, TT under θ′\theta' stochastically dominates TT under θ\theta, i.e. Pθ′(T≥t)≥Pθ(T≥t)P_{\theta'}(T \ge t) \ge P_\theta(T \ge t) for every tt. Then: 1. The test with rejection region CαC_\alpha has size exactly α\alpha: sup⁡θ≤θ0π(θ)=α\sup_{\theta \le \theta_0} \pi(\theta) = \alpha when H1:θ>θ0H_1: \theta > \theta_0. 2. The power function π(θ)=Pθ(T≥cα)\pi(\theta) = P_\theta(T \ge c_\alpha) is non-decreasing in θ\theta. 3. For fixed α\alpha, increasing the sample size nn (holding the family and true θ\theta fixed, with TT a consistent, asymptotically normal statistic) drives π(θ)→1\pi(\theta) \to 1 for every fixed θ≠θ0\theta \ne \theta_0 in Θ1\Theta_1; that is, β=1−π(θ)→0\beta = 1-\pi(\theta) \to 0. 4. Among all tests of the simple-vs-simple problem H0:θ=θ0H_0:\theta=\theta_0 vs H1:θ=θ1H_1:\theta=\theta_1 (θ1>θ0\theta_1 > \theta_0) with size at most α\alpha, no test based on any statistic can have strictly greater power at θ1\theta_1 than the likelihood-ratio test, stated here without proof as the content of The Neyman-Pearson Lemma.

Proof

Part 1 (size). By construction Pθ0(T≥cα)=αP_{\theta_0}(T \ge c_\alpha) = \alpha, so π(θ0)=α\pi(\theta_0) = \alpha. For any θ<θ0\theta < \theta_0, stochastic monotonicity gives Pθ(T≥cα)≤Pθ0(T≥cα)=αP_\theta(T \ge c_\alpha) \le P_{\theta_0}(T \ge c_\alpha) = \alpha, so π(θ)≤α\pi(\theta) \le \alpha for all θ∈Θ0={θ≤θ0}\theta \in \Theta_0 = \{\theta \le \theta_0\} under the one-sided composite null formulation, with equality attained at θ0\theta_0. Hence sup⁡θ∈Θ0π(θ)=α\sup_{\theta\in\Theta_0}\pi(\theta) = \alpha, proving the test has size exactly α\alpha.

Part 2 (monotone power). Fix θ<θ′\theta < \theta'. Stochastic dominance means precisely that Pθ′(T≥t)≥Pθ(T≥t)P_{\theta'}(T \ge t) \ge P_\theta(T \ge t) for all tt; applying this at t=cαt = c_\alpha gives π(θ′)=Pθ′(T≥cα)≥Pθ(T≥cα)=π(θ)\pi(\theta') = P_{\theta'}(T\ge c_\alpha) \ge P_\theta(T \ge c_\alpha) = \pi(\theta). Since θ<θ′\theta<\theta' were arbitrary, π\pi is non-decreasing.

Part 3 (power to one as n→∞n\to\infty). Suppose T=TnT = T_n is built from a sample of size nn and is asymptotically normal: under any fixed θ\theta,

Tn−μ(θ)σ(θ)/n→dN(0,1),\frac{T_n - \mu(\theta)}{\sigma(\theta)/\sqrt n} \xrightarrow{d} N(0,1),

with μ\mu strictly increasing in θ\theta and σ(θ)>0\sigma(\theta) > 0 bounded on compact sets (this holds, for instance, for the sample mean by the Central Limit Theorem, with μ(θ)=θ\mu(\theta)=\theta). The critical value satisfies cα=μ(θ0)+zασ(θ0)/nc_\alpha = \mu(\theta_0) + z_\alpha \sigma(\theta_0)/\sqrt n where zαz_\alpha is the upper-α\alpha standard normal quantile (this uses the continuity assumed for TT under θ0\theta_0, ensuring α\alpha is attained exactly). Fix θ1>θ0\theta_1 > \theta_0 in Θ1\Theta_1. Then

π(θ1)=Pθ1(Tn≥cα)=P ⁣(Tn−μ(θ1)σ(θ1)/n≥cα−μ(θ1)σ(θ1)/n).\pi(\theta_1) = P_{\theta_1}(T_n \ge c_\alpha) = P\!\left(\frac{T_n - \mu(\theta_1)}{\sigma(\theta_1)/\sqrt n} \ge \frac{c_\alpha - \mu(\theta_1)}{\sigma(\theta_1)/\sqrt n}\right).

The right-hand threshold equals

σ(θ0)σ(θ1)zα−n (μ(θ1)−μ(θ0))σ(θ1).\frac{\sigma(\theta_0)}{\sigma(\theta_1)} z_\alpha - \frac{\sqrt n\,(\mu(\theta_1)-\mu(\theta_0))}{\sigma(\theta_1)}.

Since μ(θ1)>μ(θ0)\mu(\theta_1) > \mu(\theta_0), the second term is a strictly negative quantity multiplied by n\sqrt n, so the whole threshold →−∞\to -\infty as n→∞n \to \infty. Because the standard normal distribution function Φ\Phi satisfies 1−Φ(x)→11-\Phi(x) \to 1 as x→−∞x \to -\infty, and the asymptotic normality gives π(θ1)→1−Φ(threshold)\pi(\theta_1) \to 1 - \Phi(\text{threshold}) in the limit (by the Portmanteau theorem applied to convergence in distribution together with the threshold's divergence), we conclude π(θ1)→1\pi(\theta_1) \to 1, i.e. β→0\beta \to 0.

Part 4 is the Neyman–Pearson lemma; its proof requires the theory of likelihood ratios and most-powerful tests and is developed under The Neyman-Pearson Lemma. It is stated here only to show where this framework leads, not proved, since it needs machinery (the Neyman–Pearson fundamental lemma's variational argument) beyond the error-tradeoff facts established in Parts 1–3. This completes the proof of Parts 1–3, each obtained directly from the definitions of size and power and standard properties of stochastic ordering and normal convergence, without invoking any result that itself depends on this theorem. ■\blacksquare

∎

Worked examples

Example 1: One-sample z-test for a mean, one-sided alternative, asymmetric numbers. A quality-control engineer believes a new machine setting increases the mean fill weight of cereal boxes above the nominal target. Historical process variability is well characterized: fill weights are normally distributed with known standard deviation σ=4.2\sigma = 4.2 grams (this is realistic in mature manufacturing lines with long historical records). The target mean is μ0=500\mu_0 = 500 grams. She wants to test

H0:μ=500vsH1:μ>500,H_0: \mu = 500 \quad \text{vs} \quad H_1: \mu > 500,

at significance level α=0.02\alpha = 0.02. She draws n=36n = 36 boxes and observes a sample mean xˉ=501.6\bar x = 501.6 grams. Step 1 — test statistic. Under H0H_0, by the sampling distribution of the mean, Xˉ∼N(μ0,σ2/n)\bar X \sim N(\mu_0, \sigma^2/n) exactly (normal population, known σ\sigma). Standardize:

Z=Xˉ−μ0σ/n∼N(0,1) under H0.Z = \frac{\bar X - \mu_0}{\sigma/\sqrt n} \sim N(0,1) \text{ under } H_0.

Step 2 — rejection region. This is a one-sided upper test; reject for large ZZ. We need cc with P(Z≥c)=0.02P(Z \ge c) = 0.02. From the standard normal table, z0.02=2.054z_{0.02} = 2.054. So C={Z≥2.054}C = \{Z \ge 2.054\}. Step 3 — compute the statistic.

Z=501.6−5004.2/36=1.64.2/6=1.60.7=2.2857…Z = \frac{501.6 - 500}{4.2/\sqrt{36}} = \frac{1.6}{4.2/6} = \frac{1.6}{0.7} = 2.2857\ldots

Step 4 — decision. Since 2.2857>2.0542.2857 > 2.054, ZZ falls in the rejection region: reject H0H_0 at level α=0.02\alpha = 0.02. The data provide statistically significant evidence, at this level, that the true mean fill weight exceeds 500 grams. Step 5 — power at a specific alternative. Suppose the engineer wants to know the power of this test if the machine setting truly shifted the mean to μ1=502\mu_1 = 502 grams. Under μ1\mu_1,

Xˉ∼N(502, 4.22/36)=N(502,0.49),\bar X \sim N(502, \, 4.2^2/36) = N(502, 0.49),

so σXˉ=0.7\sigma_{\bar X} = 0.7. The rejection region in terms of Xˉ\bar X is Xˉ≥μ0+2.054(0.7)=500+1.4378=501.4378\bar X \ge \mu_0 + 2.054(0.7) = 500 + 1.4378 = 501.4378. Power is

π(502)=Pμ1=502(Xˉ≥501.4378)=P ⁣(Z≥501.4378−5020.7)=P(Z≥−0.8031).\pi(502) = P_{\mu_1=502}(\bar X \ge 501.4378) = P\!\left(Z \ge \frac{501.4378 - 502}{0.7}\right) = P(Z \ge -0.8031).

From the normal table, Φ(0.8031)≈0.7890\Phi(0.8031) \approx 0.7890, so π(502)=P(Z≥−0.8031)=Φ(0.8031)≈0.789\pi(502) = P(Z \ge -0.8031) = \Phi(0.8031) \approx 0.789. Thus if the true mean is 502 grams, this test correctly detects the shift about 78.9% of the time; the Type II error rate there is β≈0.211\beta \approx 0.211.

Example 2: Two-sided test with a small sample and unknown variance (previewing the t-test), composite null. An agronomist tests whether a new fertilizer changes (in either direction) the mean yield per plot, historically μ0=48.0\mu_0 = 48.0 bushels/acre. Population variance is unknown. She samples n=9n = 9 plots and observes sample mean xˉ=50.4\bar x = 50.4 and sample standard deviation s=3.6s = 3.6 (using the unbiased estimator with n−1n-1 in the denominator). She sets α=0.05\alpha = 0.05 and tests

H0:μ=48.0vsH1:μ≠48.0.H_0: \mu = 48.0 \quad \text{vs} \quad H_1: \mu \ne 48.0.

Step 1 — test statistic. Because σ\sigma is unknown and nn is small, the exact normal-based ZZ statistic is unavailable; the standardized statistic using ss in place of σ\sigma follows a Student tt distribution with n−1=8n-1 = 8 degrees of freedom under H0H_0 (this fact — the exact distribution of (Xˉ−μ0)/(S/n)(\bar X-\mu_0)/(S/\sqrt n) under normality of the population — is the content of the t-test, used here only as the known sampling distribution required by the general framework):

T=Xˉ−μ0S/n∼t8 under H0.T = \frac{\bar X - \mu_0}{S/\sqrt n} \sim t_{8} \text{ under } H_0.

Step 2 — rejection region. Two-sided test at α=0.05\alpha = 0.05 splits the error equally into both tails: reject if ∣T∣≥t8, 0.025|T| \ge t_{8,\,0.025}. From the tt-table, t8,0.025=2.306t_{8,0.025} = 2.306. So C={∣T∣≥2.306}C = \{|T| \ge 2.306\}. Step 3 — compute the statistic.

T=50.4−48.03.6/9=2.43.6/3=2.41.2=2.0.T = \frac{50.4 - 48.0}{3.6/\sqrt 9} = \frac{2.4}{3.6/3} = \frac{2.4}{1.2} = 2.0.

Step 4 — decision. Since ∣T∣=2.0<2.306|T| = 2.0 < 2.306, TT does not fall in the rejection region: we do not reject H0H_0 at level α=0.05\alpha = 0.05. Despite a seemingly large observed difference (2.4 bushels/acre), the small sample size and moderate variability leave insufficient evidence to conclude the fertilizer changes mean yield. Step 5 — a lesson on error types. This is exactly the situation in which a Type II error is a live risk: if the fertilizer truly raises mean yield by, say, 3 bushels/acre, a sample of only n=9n=9 plots may lack the power to detect it reliably. This is precisely why, in practice, one performs power analysis before collecting data — to choose nn large enough that a scientifically important effect size is detected with high probability, rather than discovering after the fact that the test was underpowered.

CounterexampleDropping "fixed in advance": why the rejection region cannot be chosen after seeing the data

The theorem's guarantees — in particular that the test has size exactly α\alpha — depend critically on the rejection region CC being fixed before the data are observed, so that the probability computation Pθ0(T∈C)=αP_{\theta_0}(T \in C) = \alpha is a genuine pre-experimental probability. Suppose instead an analyst adopts the following illegitimate procedure: collect the data, compute TT, and then choose whichever one-sided rejection region (T≥cT \ge c or T≤−cT \le -c, for the same critical value c=z0.025=1.96c = z_{0.025} = 1.96) happens to contain the observed value, reporting "significant at α=0.025\alpha = 0.025." Concretely, take the setup of Example 1 with H0:μ=500H_0: \mu = 500, σ=4.2\sigma = 4.2, n=36n = 36, so Z∼N(0,1)Z \sim N(0,1) under H0H_0. The analyst's actual rule, described honestly, is: reject H0H_0 whenever ∣Z∣≥1.96|Z| \ge 1.96, but claim it as a one-sided level-0.0250.025 test. Compute the true size of this procedure:

PH0(∣Z∣≥1.96)=P(Z≥1.96)+P(Z≤−1.96)=0.025+0.025=0.05.P_{H_0}(|Z| \ge 1.96) = P(Z\ge 1.96) + P(Z \le -1.96) = 0.025 + 0.025 = 0.05.

The procedure actually rejects a true H0H_0 5% of the time, not 2.5% as claimed — the stated size is wrong by a factor of two, purely because the direction of the rejection region was selected using information from the data (the sign of the observed ZZ) rather than fixed beforehand. The theorem's conclusion that "the test has size exactly α\alpha" fails: the real long-run Type I error rate of this data-dependent procedure is 2α2\alpha, not α\alpha. This is a simple, sharp instance of the general danger of choosing a decision rule after inspecting the data — a version of it also underlies the inflation of Type I error rates under multiple testing and "pp-hacking."

Scope, edge cases & common traps

SituationWhat changesCommon pitfall
Simple H0H_0, simple H1H_1Power function has one value under H1H_1; size and power fully determine the testConfusing "not rejecting H0H_0" with "proving H0H_0 true"
Composite H0H_0 (e.g. μ≤μ0\mu \le \mu_0)Size is a supremum over Θ0\Theta_0, not a single probabilityReporting only π(θ0)\pi(\theta_0) as "the" Type I error rate
One-sided vs two-sided alternativeRejection region is one tail vs split into two tailsChoosing the side of a one-sided test after seeing which direction the data lean
Unknown variance, small nnTest statistic follows tn−1t_{n-1}, not exactly N(0,1)N(0,1)Using the normal table's critical values with small nn and unknown σ\sigma
Large nnBy Theorem Part 3, power →1\to 1 for any fixed true θ≠θ0\theta \ne \theta_0Treating statistical significance at huge nn as automatically practically important
Multiple tests on the same dataOverall Type I error rate compounds across testsRunning many tests and reporting only the "significant" ones (see the counterexample)

The mathematician behind it

Origins · 1 minJerzy Neyman and how this was discovered
JN
Jerzy Neyman
1894–1981 · Statistics, Poland/UK/USA

Neyman, working with Egon Pearson at University College London in the late 1920s and 1930s, transformed hypothesis testing from an intuitive practice of "significance" (as used by Ronald Fisher) into a rigorous decision-theoretic framework with two hypotheses, two types of error, and an optimality theory for choosing rejection regions. Their joint 1933 paper introduced the size–power tradeoff and the lemma that bears their names, which identifies the most powerful test for a fixed size in the simple-versus-simple case. Neyman later emigrated to Berkeley, where he built one of the world's leading statistics departments and contributed foundational work on confidence intervals, survey sampling, and the philosophy of frequentist inference.

History
- 1900: Karl Pearson introduces the chi-squared goodness-of-fit test, an early ancestor of formal hypothesis testing.
- 1925: Ronald Fisher's Statistical Methods for Research Workers popularizes significance testing and the 5% convention.
- 1928: Neyman and Egon Pearson begin their collaboration on the theory of hypothesis testing.
- 1933: Neyman and Pearson publish "On the Problem of the Most Efficient Tests of Statistical Hypotheses," establishing Type I/II errors, power, and the fundamental lemma.
- 1938 onward: Neyman develops the theory further at Berkeley, cementing the null/alternative/rejection-region framework as the standard structure of statistical testing.
What exactly is the difference between the null and alternative hypotheses?

The null hypothesis H0H_0 is the default or status-quo claim, typically a statement of "no effect" or "no difference," and it is what the test is designed to potentially reject. The alternative H1H_1 is the claim the researcher often suspects or hopes to support, and it is only adopted if the data provide sufficiently strong evidence against H0H_0. The asymmetry is structural, not cosmetic: the test's error-rate guarantee (α\alpha) is computed under H0H_0, while power is computed under H1H_1; swapping which hypothesis plays which role changes the entire error-control interpretation of the procedure, even if the mathematical sets Θ0\Theta_0 and Θ1\Theta_1 stay the same.

Why must the significance level α be chosen before looking at the data?

Choosing α\alpha (and hence the rejection region) in advance is what makes the probability statement Pθ0(T∈C)=αP_{\theta_0}(T \in C) = \alpha a valid, pre-experimental guarantee about the long-run behavior of the procedure. If the region or the level is adjusted after seeing the test statistic's value, the actual probability of a false rejection under repeated use of that adjusted procedure is no longer α\alpha, typically larger, as shown explicitly in the counterexample where a data-dependent choice doubled the true Type I error rate. This principle is why pre-registration of statistical analysis plans is required in clinical trials and increasingly encouraged across experimental science.

Is a small p-value or a rejected null proof that the alternative hypothesis is true?

No. A hypothesis test controls the probability of specific decision errors under repeated sampling; it does not compute the probability that any particular hypothesis is true, which would require a prior distribution over hypotheses (a Bayesian framework, not this one). Rejecting H0H_0 at level α\alpha means: under a decision rule that would falsely reject a true H0H_0 at most 100α%100\alpha\% of the time in repeated use, this particular dataset triggered rejection. It is evidence against H0H_0 calibrated by a known false-alarm rate, not a probabilistic certificate on H1H_1.

How is power related to sample size, and why does this matter for study design?

Under the conditions of the theorem's Part 3, for any fixed true alternative θ1≠θ0\theta_1 \ne \theta_0, the power π(θ1)\pi(\theta_1) increases toward 1 as the sample size n→∞n \to \infty, because the sampling distribution of the test statistic under θ1\theta_1 separates further from its distribution under θ0\theta_0. This is why researchers perform a power analysis before data collection: given a minimally important effect size, a desired power (commonly 0.80 or 0.90), and a chosen α\alpha, one can solve for the sample size nn needed so the study is not doomed to a Type II error from being too small, as nearly happened in Example 2.

What is the relationship between hypothesis testing and confidence intervals?

A two-sided level-α\alpha test of H0:θ=θ0H_0: \theta = \theta_0 rejects if and only if θ0\theta_0 falls outside the corresponding (1−α)(1-\alpha)-confidence interval for θ\theta, built from the same test statistic and its sampling distribution as covered in Confidence Intervals: Concept and Construction. This duality means every confidence interval implicitly defines a whole family of hypothesis tests (one for each candidate θ0\theta_0), and every family of size-α\alpha tests, indexed by θ0\theta_0, can be inverted to produce a (1−α)(1-\alpha)-confidence set. The two frameworks answer the same underlying question — how compatible is a parameter value with the data — from complementary angles: estimation (a set of plausible values) versus decision (accept or reject one specific value).

Why can't a rejection region be based on a statistic whose null distribution is unknown?

The entire quantitative content of a hypothesis test — the value of α\alpha, the location of the critical value, the computation of power — rests on knowing (exactly or via a reliable approximation, such as a large-sample normal or tt approximation) the distribution of TT when H0H_0 is true. Without this, the claim "Pθ0(T∈C)=αP_{\theta_0}(T \in C) = \alpha" cannot be verified or even stated, and the procedure reduces to an arbitrary rule with unknown error properties. This is exactly why the derivation of sampling distributions, covered under Sampling Distributions, is a prerequisite: it supplies the null distributions (normal, tt, chi-squared, FF) on which every classical test in Standard Tests: t, Chi-Squared, and F is built.

What is the difference between Type I error, Type II error, and power in plain terms?

Type I error is rejecting a true H0H_0 — a false alarm — and its probability is bounded by α\alpha, fixed by the analyst before data collection. Type II error is failing to reject a false H0H_0 — a missed detection — and its probability β\beta depends on which specific alternative θ1∈Θ1\theta_1 \in \Theta_1 is true, on nn, and on α\alpha. Power is 1−β1-\beta, the probability of correctly detecting that alternative; because α\alpha and β\beta trade off against each other for fixed nn, and both can be driven down simultaneously only by increasing nn, no single number can describe a test's overall error behavior without specifying which alternative and which sample size are in view.

Before this

Where this leads