This page assumes nothing. We build every letter, every squiggle, every function name used in the parent note from the ground up, in an order where each idea needs only the ones before it.
Imagine you measure something that wobbles — the height of a person, the roll of a die, the noise in a sensor. You can't predict one measurement, but if you take thousands and stack them into a bar chart (a histogram), a shape appears. That shape is stable even though each measurement is not.
Walk-through of the figure above: the pale blue bars are a histogram of 4000 simulated measurements — the horizontal axis is the measured value, the vertical axis is how often each range occurred. Notice the bars are jagged, yet the orange curve laid over them traces a clean, symmetric hump. That orange curve is the stable shape the raw randomness is hiding: individual bars flicker if you re-sample, but the hump barely moves.
A specific value we actually observed is written with a small letterx. So X is the die; x is the "4" you rolled.
If we take infinitely many measurements and make the bars infinitely thin, the jagged histogram smooths into a continuous curve. (From here on we assume X is continuous — the smooth-curve picture.)
Walk-through of the figure above: the left panel shows the smooth orange PDF; the vertical red stick at x=1 measures the curve's height there — that height is f(1). The right panel is the same curve, but now the blue region from far-left up to x=1 is shaded — that area is F(1). Same curve, two different questions: left asks "how tall here?", right asks "how much area so far?".
The symbol dx just means "a tiny width." Height times tiny width = tiny area = tiny probability. This "area = probability" idea is the engine of everything next.
See Normal Distribution for the specific bell-shaped f(x) the parent uses most.
Note P(a≤X≤b)=F(b)−F(a): the slab area is "area up to b" minus "area up to a."
The link between f and F: PDF is the steepness of the CDF. Where the bell is tall, area piles up fast, so F rises steeply. That "rate of climb" is what the derivative symbol dxdF means — see §7.
Sometimes you don't have a value and want its area; you have an areap and want the value.
The little −1 means "undo": F turns a value into an area; F−1 turns an area back into a value. For a continuous distribution whose F climbs smoothly, they cancel cleanly: F−1(F(x))=x.
Walk-through of the figure above: two bells share the same center. The tall narrow blue curve has a smallσ (values cluster tightly); the short wide orange curve has a largeσ (values scatter). The dashed grey line marks μ (the balance point), identical for both, and the small horizontal blue arrow shows one σ step out from center — the ruler that σ provides.
The hat symbol as in μ^ means "an estimate from data" (a guess), while plain μ is the true (usually unknown) value. stats.norm.fit returns hatted estimates — see Maximum Likelihood Estimation.
So PDF and CDF are two views of one object: PDF = slope of CDF, CDF = running total of PDF. (This derivative bridge is another reason PDF/CDF live in the continuous world — a staircase CDF has no slope at its jumps.)
Read more on interpreting this correctly in p-values and Significance. The mismatch-measuring cousin of the normal, the Chi-square Distribution, powers the die-fairness test.
Walk-through of the figure above: the orange curve is the distribution of the test statistic assuming H0 is true. The vertical red line marks the value you actually observed. The red-shaded tail to its right is the p-value — the chance pure luck under H0 would push the statistic this far out or further. A thin red tail means "luck can barely reach here," which is why a small p-value makes you doubt H0.