p-Values
▶︎ Watch it animatedinteractive step-through · ~3 min · optional ⚙︎ Open the appletp-Value Lab · five numbers this sample produces, and only one of them is the p-valueThe p-value is the probability, computed assuming the null hypothesis is true, of getting a statistic at least as extreme as the observed one in the direction the alternative specifies. Mechanically it is a tail area of the null sampling distribution: for $H_0: p = 0.40$, $n = 250$, and $\hat{p} = 0.352$, the null standard deviation is $\sqrt{\frac{0.40(0.60)}{250}} \approx 0.0310$, $z \approx -1.55$, and the left-tail area is about 0.061. A one-sided alternative counts one tail, a two-sided alternative counts both and so doubles the value to about 0.121 for the same data.
Every standard misreading is the definition with its conditional clause removed. A p-value of 0.061 becomes a 6.1% chance the null is true, or a 93.9% chance the alternative is, or the probability that the results are due to chance, though the calculation already assumes chance alone. It becomes the probability of exactly this sample, though the definition says at least as extreme. The repair is the same each time: state the assumed value of $p$, the direction, and the sample size, as in if $p$ really were 0.40, about 6% of samples of 250 would give 0.352 or lower.
The work
3 ways in · any order
Lesson
p-Values
›
Defines the p-value with its assuming-the-null clause intact, computes it as a tail area of the null sampling distribution, shows how one-sided and two-sided alternatives change which area counts, and takes apart the four readings that drop the condition.
Diagnostic
10-item topic check
›
Ten items on p-values: the probability the null is true, the probability the results are due to chance, exact-sample probabilities, and one-sided areas reported for two-sided questions. Take it cold to find your habit, or after the lesson to check it is gone.
Targeted Practice
Drill a single misconception
›
Pick one of the failure modes you missed and drill it on its own. The round is adaptive: two correct in a row clears it for now and moves you to the next. Two in a row is a checkpoint, not proof: if the error resurfaces later, the misconception comes back.