Hypothesis Testing and Significance
Every claim in experimental physics eventually reduces to one uncomfortable question: could the data have looked like this by chance alone? Hypothesis testing turns that question into a number. You write down a null hypothesis — the boring default, "nothing new here, only known background" — and an alternative , "there is a signal". You choose a test statistic , a single number squeezed from the data whose behaviour under you can compute exactly. If the observed falls deep in the tail of what predicts, the data are surprising and you reject . The whole edifice controls one thing you never see directly: the rate at which you fool yourself. The significance level is the probability, fixed in advance, of rejecting a true — a Type I error, a false alarm. Its partner is the probability of missing a real effect (Type II), and , the power, is the number an experimenter loses sleep over. There is no free lunch: tighten the cut to suppress false alarms and you miss more real signals. The art — the theorem at the centre of this article — is to squeeze maximum power out of a fixed false-alarm budget. That theorem is the Neyman–Pearson lemma, and its answer is startlingly clean: rank every outcome by its likelihood ratio and reject those favours most. From that one idea flow the -test, the -test, Pearson's , Wilks' theorem, and the convention for when a particle counts as discovered. Threaded through all of it is the misconception that has done more damage than any other in quantitative science: the -value is not the probability that is true.
- Hypothesis testing is a decision rule: posit a null and alternative , compute a test statistic, and reject when it lands in a pre-chosen critical region.
- The significance level is the fixed probability of a Type I error (rejecting a true ); the power correctly rejects a false . Shrinking one tail trades against the other.
- The -value is the tail probability under of a statistic at least as extreme as observed; reject when . It is uniform on the unit interval under — and emphatically not .
- The Neyman–Pearson lemma proves the likelihood ratio gives the most powerful test at fixed for a simple null against a simple alternative.
- For Gaussian data this collapses to the -, - and -tests; Wilks' theorem makes asymptotically , the workhorse of profile-likelihood testing.
- Key idea: fix the false-positive rate α in advance, then among all tests with that rate choose the one with greatest power; the Neyman–Pearson lemma shows the optimal decision boundary is a contour of constant likelihood ratio Λ(x) = ℒ(x|H₀)/ℒ(x|H₁).
Fix the false-positive rate in advance, then among all tests with that rate choose the one with greatest power; the Neyman–Pearson lemma shows the optimal decision boundary is a contour of constant likelihood ratio .
Where this lives today
The convention is where this machinery becomes headline physics. When ATLAS and CMS announced the Higgs boson in July 2012, the number that mattered was a local -value at (): each tested = "background only" against = "background plus a resonance" using whose distribution Wilks' theorem supplies. The stringency defends against the look-elsewhere effect — scanning many mass bins inflates the chance that some bin fluctuates high, so the local must be corrected to a global one first. The same framework governs the LIGO–Virgo gravitational-wave detections, neutrino oscillations, and the muon anomaly at Fermilab, whose – tension with theory is exactly a -test of a measured against a predicted number. Meanwhile the replication crisis in biomedical and social science — driven by -hacking, underpowered studies, and precisely the -value misreading this article warns against — has pushed proposals to lower defaults to . The century-old Fisher–Neyman argument is, remarkably, still live.
The physical picture
Picture a coin you suspect is loaded. Under it is fair, ; flip it times and the head-count clusters near with a known binomial spread. A count far out in the tail would be a freak event for a fair coin, so it is evidence against fairness. The significance level is the line you draw before flipping: "declare the coin loaded only if the result is so extreme it would happen by chance less than of the time." Every physics test is this coin dressed up: a known null distribution, a cut in its tail, a decision. The sharper picture is two overlapping bell curves — the statistic under and under — with the critical region a single cut on the axis. The area past the cut is ; the area before the cut is , the signal you miss. Slide the cut right and shrinks while grows — both are small only when the curves are far apart, which is what more data buys.
A -value is a ruler for surprise, uniform on the unit interval under : means a fair world would produce data this extreme only one time in a hundred. Small says the data sit in the tail of the null's prediction — but it speaks only about compatibility with , never its truth, which needs a prior. Particle physics pushes the ruler to an extreme: a discovery needs the statistic five standard deviations out, a one-sided tail of , about one in 3.5 million.
Power is what experimenters actually care about: if the effect is real, how likely am I to catch it? A test with airtight but tiny power wastes data — a null result then tells you almost nothing, because you never had the sensitivity to see the signal. Designing an experiment is choosing the sample size and statistic so the power at the smallest interesting signal is respectable, conventionally .
The core equations
The starting point is the pair of error rates. A test partitions the sample space into acceptance and rejection (critical) regions; the two ways to be wrong live on opposite hypotheses and are computed under different distributions — this asymmetry is the whole game.
where: — test statistic, a function of the data ; — critical (rejection) region in the sample space of ; — significance level, the Type I (false-positive) error probability; — Type II (false-negative) error probability; — power. Reading: is chosen by fiat before data; then follows from the alternative and the sample size. The -value repackages the observed statistic as a probability, comparable across tests: it is the smallest at which the data would already be rejected.
where: — observed value of the statistic; — tail probability under of statistics at least as extreme as observed. Reading: a symmetric two-sided test doubles the tail, ; crucially is conditioned on , not a probability of . The likelihood ratio is the quantity the Neyman–Pearson lemma singles out as optimal — it compares how well the two hypotheses explain the same data, the decision boundary being a level set of the ratio.
where: — likelihood of the data under ; — likelihood-ratio statistic; — threshold fixed so . Reading: small means explains the data far better, so small is the natural rejection region. For Gaussian data with known variance, the likelihood ratio for a mean collapses to a linear cut on the sample mean — the -statistic, whose null distribution is standard normal.
where: — sample mean of observations; — mean hypothesised by ; — known population standard deviation; — sample size. Reading: the denominator is the standard error, so measures the discrepancy in units of how well you know the mean. When is unknown and estimated from the same small sample, the extra uncertainty fattens the tails: the statistic follows Student's , not the normal.
where: — sample standard deviation with the unbiased (Bessel) denominator; — follows under . Reading: for the is nearly normal; for its critical value swells noticeably above . For binned or categorical data, Pearson's statistic sums squared standardised residuals over bins and is asymptotically -distributed.
where: — observed count in bin ; — count expected under ; — number of bins. Reading: each term is ; degrees of freedom after the normalisation constraint and fitted parameters. The likelihood ratio generalises to composite hypotheses through the profile likelihood ratio, whose asymptotic distribution Wilks' theorem supplies — letting physicists read a significance straight off a fit.
where: — parameter subspace fixed by ; — the full parameter space; — number of constraints (codimension of ). Reading: the suprema profile out nuisance parameters, and the ratio never exceeds 1, so . For the significance in is , and the discovery conventions read straight off the normal tail: ("evidence"), (discovery, one-sided).
The goal is to prove that, for a simple null against a simple alternative , no test of size is more powerful than the one whose rejection region is a level set of the likelihood ratio. We propose the likelihood-ratio region , take any competitor of size at most , and show the difference in their powers can never be negative. Write and .
Step 1. Define the candidate region as everything the alternative favours by at least a factor : , with tuned so . Its power is the alternative mass captured, . Why: this is exactly the "reject where " rule of equation (3), with carrying the size constraint.
Step 2. Let be any region with . The power difference ; the shared part cancels, leaving the symmetric difference . Why: only the points where the two tests disagree can change the power.
Step 3. On every point has by construction; on every point lies outside , so . Substituting, . Why: lower-bounding on the region we add and upper-bounding it on the region we remove can only decrease the expression, so the inequality points the right way.
Step 4. Re-adding the cancelled overlap turns the bracket back into full sizes: . Since and , this is , so . Why: the competitor's size constraint is exactly what makes the bracket non-negative — spending the full budget optimally beats every alternative allocation. *Why this matters concretely: for two Gaussians with equal variance and means , the criterion reduces algebraically to , recovering the one-sided z-test of the next derivation.*
Go deeper · Derivation B · 1 minThe z-test as the most powerful test of a Gaussian mean
The goal is to run the Neyman–Pearson recipe on independent normal observations with known variance , testing against , and show the optimal region is a simple cut on the sample mean whose calibration gives the familiar critical values. Because that region does not depend on the specific , the same test is optimal against every at once — uniformly most powerful. Start from .
Step 1. Form the ratio ; the normalisation prefactors cancel. Why: only the exponent carries the data, so the whole test lives in one quadratic-difference term.
Step 2. Expand: , in which the pieces cancel and only a term linear in survives. Why: linearity in the data is what makes the boundary a straight cut rather than a curved region.
Step 3. Collect the sum: , which since is strictly increasing in , hence in . So " small" is identical to " large", and the rejection region is . Why: this monotone-likelihood-ratio property makes a single cut optimal, and since dropped out of the inequality's direction the same cut is optimal for all — a uniformly most powerful test.
Step 4. Calibrate to size . Under , , so standardises to , i.e. reject when . For one-sided, ; two-sided uses . Why: this is where the abstract threshold becomes a tabulated number — the standard-normal quantile every -test quotes. *As a consistency check: the critical values and correspond exactly to and from the standard normal CDF.*
Go deeper · Derivation C · 1 minWilks' theorem and the minus-two-log-lambda statistic
The goal is to see why the profile likelihood ratio becomes as the sample grows — the result that converts a fit into a significance without simulating the null. The mechanism is a quadratic (Laplace) expansion of the log-likelihood about its maximum plus the asymptotic normality of the MLE, which together turn a difference of log-likelihoods into a sum of squared standard normals. Let be the unconstrained MLE, the MLE constrained to the -codimensional null surface , and .
Step 1. Taylor-expand about : , the linear term vanishing at the maximum, with the observed Fisher information. Why: near a smooth maximum the log-likelihood is a paraboloid, and the curvature is exactly the metric that standardises coordinate differences.
Step 2. Evaluate at the constrained maximum: . Why: the statistic is just the "distance" from the unconstrained to the constrained estimate in the Fisher metric.
Step 3. Invoke the MLE asymptotics ( the per-observation information). Under the displacement projects onto the constrained directions as a centred Gaussian whose Fisher-metric covariance is the identity — independent standard normals. Why: the metric whitens the Gaussian, so the quadratic form becomes an unweighted sum of squares.
Step 4. Therefore . One compares the observed to quantiles, and for the significance in is . Why: a whitened quadratic form in normals is a — the bridge from a likelihood fit to a tabulated tail probability. *As a consistency check: for , the values give significances respectively, since , in agreement with the quantiles.*
Limiting cases
The standard tests are not separate inventions but special cases of the likelihood-ratio idea, selected by what is known and how the statistic is distributed:
| Case | Result | Meaning |
|---|---|---|
| Known variance, Gaussian mean | The -test; two-sided rejection when (). | |
| Unknown variance, small | Student's -test; estimating fattens the tails. Recovers as . | |
| Binned counts / goodness of fit | Pearson's test; fitted parameters cut the d.o.f. Large rejects the model. | |
| Composite null, large | Wilks' theorem; constrained parameters — the basis of profile-likelihood significance. |
Worked examples
1 · A measurement versus theory (confidence builder)
A precision experiment measures a quantity over runs, reporting a mean in instrument units. Theory predicts , and the apparatus has a known per-run scatter . Is the measurement in tension with theory at the 5% level?
Step 1. Form the standard error of the mean: — how well 25 runs pin down the mean.
Step 2. Compute the -statistic: — the measurement sits two standard errors above the prediction.
Step 3. Convert to a two-sided -value (theory could err either way, so both tails count): . Since , you reject at — but only barely; is "interesting, keep watching", not "discovery". Z = 2.0, two-sided p = 0.046, reject at 5% but far below the 5σ discovery bar.
2 · Goodness of fit of a die
A die is rolled times to test fairness. The six faces come up . Under each face is expected times. Is the die consistent with fairness?
Step 1. Compute Pearson's statistic with : the squared residuals are (summing to 42), so .
Step 2. Degrees of freedom: bins, one constraint (counts sum to 60), no fitted parameters, so .
Step 3. Compare to : the 5% critical value is , and , so you fail to reject (). The reduced confirms an unremarkable fit. χ² = 4.2 on 5 d.o.f., p ≈ 0.52: no evidence the die is loaded.
3 · Sizing an experiment for a target power
You plan a one-sided test of against at . The smallest interesting shift is . How many samples are needed for power ?
Step 1. The design equation sets the cut standard errors above and simultaneously below : , so .
Step 2. Insert the quantiles and , and the standardised effect : . Round up to be safe: .
Step 3. Check the delivered power at : the signal sits standard errors above ; subtracting the cut leaves of margin, and as required. n = 35 samples deliver 90% power to detect a 0.5σ shift at α = 0.05.
Physics of the portrait
Hypothesis testing has no single inventor; it is a two-decade argument among a handful of statisticians that hardened into the frequentist framework physics still runs on.
Origins · 1 minJerzy Neyman and how this was discovered
Jerzy Neyman, born in the Russian Empire and trained in Kharkiv and Warsaw, carried the rigour of measure-theoretic probability into a field that in the 1920s was still a bag of recipes. The decisive collaboration began in 1926 with Egon Pearson — son of Karl Pearson, who had invented the goodness-of-fit test in 1900. Between 1928 and 1933 the two built testing as a decision problem: they named the two error types, defined power, and proved the lemma that bears their names — the likelihood ratio gives the most powerful test at fixed size. This broke sharply with Ronald Fisher, whose significance tests and -values (systematised in his 1925 Statistical Methods for Research Workers) framed testing as evidence against a null, with no explicit alternative and no power. The Fisher–Neyman feud was bitter and lifelong, yet the working physicist uses an unspoken hybrid: Fisher's -values and Neyman–Pearson's error rates in the same breath. Neyman also built confidence intervals (1937) as the dual of testing and, after emigrating, founded the Berkeley statistics department. The remaining threads came from William Gosset — "Student", the Guinness brewer who derived the -distribution in 1908 — and Samuel Wilks, whose 1938 theorem made asymptotically and handed particle physics its significance calculator. A quarrel over the meaning of evidence became the quiet arithmetic behind every discovery claim.
Going further
Texts. Cowan, Statistical Data Analysis (Oxford, 1998), the physicist's standard · Stone & Goldbart, Mathematics for Physics (Cambridge, 2009), statistics chapter · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed. · Riley, Hobson & Bence, Mathematical Methods for Physics and Engineering, 3rd ed., Ch. 31 · Kendall & Stuart, The Advanced Theory of Statistics, Vol. 2, for the full proofs · James, Statistical Methods in Experimental Physics, 2nd ed. Key numerical anchors: the standard-normal quantiles , , ; the discovery-ladder tails and . Worked-example results: ; die on (); sample-size design , delivering power .
Builds on: Random Variables and Probability Distributions · Cumulative Distribution Functions · Gaussian (Normal) Distribution · Central Limit Theorem · Conditional Probability and Bayes' Theorem. Leads to: Maximum Likelihood Estimation · Confidence Intervals · Bayesian Inference.
Ask the tutor: Ask me why the same can reject a theory in one experiment yet leave it standing in another — the hidden lever is power, and I will show you how to compute it.
Is a smaller p-value stronger evidence against H₀?
Broadly yes, but with caveats. Under the -value is uniform on the unit interval, so a of is genuinely harder to produce by chance than a of . But measures only incompatibility with , not the probability of : a tiny can come from a huge sample detecting a physically trivial effect, or from an unmodelled systematic masquerading as signal. And -values do not combine by averaging or multiplying — pooling results properly means combining likelihoods. Read as a calibrated surprise index, always paired with an effect size and the test's power.
When do I use a t-test instead of a z-test?
Use the -test only when the population standard deviation is genuinely known — from a prior calibration, say — and the sample mean is Gaussian. Use the -test when you must estimate the scatter from the same data via . Replacing the fixed by the random injects extra uncertainty, which Student's absorbs with heavier tails, so its critical values are larger for small : at the two-sided 5% value is versus the normal's . By they agree to a couple of percent, and for large samples the distinction is cosmetic.
What is the difference between a one-sided and a two-sided test?
It is a statement about the alternative. A one-sided test asks "is the mean greater than ?" and puts the whole budget in one tail; a two-sided test asks "is the mean different, either way?" and splits into two tails of . So the two-sided critical value is larger ( versus at ) and the two-sided -value is double the one-sided tail. Choose one-sided only when a deviation the other way would be meaningless — and choose it before seeing data, since switching post hoc silently doubles your true false-alarm rate.
Why exactly 5σ for a discovery — isn't that overkill?
It is deliberately conservative. First, the look-elsewhere effect: scanning hundreds of mass bins gives many chances to fluctuate, so a local bump somewhere is almost expected and the global significance is far weaker. Second, systematics are hard to model in the deep tails, where the Gaussian conversion can itself drift, so a wide margin buys robustness. Third, the field's history is littered with – "signals" that evaporated. The bar is a sociological choice about acceptable false-discovery rates, not a law of nature; lower-stakes fields legitimately use or .
Can I prove H₀ true by failing to reject it?
No — the single most common logical slip in applied testing. Failing to reject means only that the data are not surprising under ; it cannot distinguish " is true" from "my test had no power". A study with a few noisy samples fails to reject almost any null, not because the null is right but because it was blind. The honest reading depends on power: 95% power to detect the smallest interesting effect and still nothing is real support for ; 20% power is simply uninformative. This is why serious null claims are reported as upper limits or confidence intervals — they quantify what effect sizes have been excluded.
How are hypothesis tests and confidence intervals related?
They are two views of one computation — a duality Neyman built deliberately. A two-sided level- test of rejects exactly those lying outside the confidence interval for . So the interval is the set of null values the data would not reject: "reject every more than standard errors from " is identical to "the 95% interval is ". This is why physicists increasingly quote an interval or upper limit rather than a bare -value: it carries the same decision plus the effect size and its uncertainty.