Before you can read the parent note, you must own every symbol it throws at you. We go one symbol at a time. Nothing is used before it is drawn — so on this page the symbols ∑, ∫, pX, fX, and FX appear only after their own section builds them, never before.
Picture a bag. Every marble in the bag is one outcome ω. The whole bag is Ω.
Why do we need this? Because "probability" is meaningless until we agree on the full list of things that could happen. Ω is that list.
Coin flip: Ω={Heads,Tails} — two marbles.
One die: Ω={1,2,3,4,5,6} — six marbles.
A height in cm: Ω= every real number in some range — infinitely many marbles, packed with no gaps. Hold that thought; it is the whole PMF-vs-PDF split.
The dot in P(⋅) is a placeholder — you drop an outcome or an event into the parentheses.
Picture a slider running from 0 (impossible, far left) to 1 (guaranteed, far right). Every event's probability is a mark on that slider.
Rule 2 is the seed of two facts you will meet later: once we have the "add-them-all-up" symbol (Section 6) it becomes the PMF's total-equals-one law, and once we have the "area" symbol (Section 7) it becomes the PDF's total-area-equals-one law. We are not allowed to write those two equations yet — their symbols are not built. We only plant the idea here: everything together weighs 1.
Picture two circles drawn inside the bag that do not overlap.
Why does the parent note keep combining probabilities of separate outcomes? Because separate outcomes are automatically disjoint, so their scores just add up. This single fact powers the dice example (6×361), and its infinite version is what makes the running total over all values behave.
Read X(ω)=x as: "outcome ω is labelled with the number x."
Why bother? Because math works on numbers, not on the word "Heads". X is the translator: "Heads" →1, "Tails" →0. Notice in the figure that two different outcomes can land on the same number — that is exactly why probabilities get combined onto a value.
See 1.3.01-Random-variables-and-distributions for the full story of X.
This is the heart of the whole parent topic. Discrete adds up bar areas; continuous measures areas under a curve. The next two sections build the exact symbols for each.
Now we can finally state Rule 2 of Section 1 in discrete costume: all the masses add to one,
∑xpX(x)=1.
Picture stacking the unit-width bars from the discrete panel; when their areas all pile up they total exactly 1. (This is also where countable additivity from Section 2 earns its keep: the list of values may be infinite, and the infinite sum still lands on 1.)
We need ∫because continuous outcomes cannot be listed one-by-one; there are too many, packed with no gaps. ∑ can't run over them. So we ask a different but analogous question: what is the area?
Look at the figure: we chop the interval [a,b] into thin rectangles of width Δx. Each rectangle's area ≈fX(x)⋅Δx is a little chunk of probability. As Δx shrinks to zero the jagged tops smooth into the curve, and the sum of rectangle areas becomes the exact area ∫abfX(x)dx=P(a≤X≤b).
Now Rule 2 in continuous costume finally has all its symbols: the total area is one,
∫−∞∞fX(x)dx=1.
Picture the rectangles in the last figure getting thinner and thinner until their staircase top hugs the curve perfectly. The limit is that perfect-hug value. This is why the parent's discrete-to-continuous derivation says P(a≤X≤b)=limΔx→0∑fX(xi)Δx=∫abfX(x)dx.
Picture a quantity that keeps shrinking by the same fraction every step — hot coffee cooling, a battery draining. The parent's exponential PDF λe−λx and the Gaussian's exp(−(x−μ)2/2σ2) both ride on this shape: common values are near the peak, extremes fade away exponentially fast.
Each arrow means "you must own the left box before the right box makes sense." Follow them top to bottom and you arrive at the parent topic fully equipped. Downstream, these feed 1.4.02-Maximum-likelihood-estimation, 2.1.05-Softmax-activation, and 3.2.04-Gaussian-processes.
Cover the right side; can you answer before revealing?
What is Ω in plain words?
The sample space — the bag of all possible outcomes of the experiment.
What does P(⋅) return and what are its two rules?
A number in [0,1]; rule 1: 0≤P≤1; rule 2: over the whole sample space it totals 1.
What is countable additivity?
For any list of disjoint events — even infinitely many — the probability of "any of them" equals the sum of their individual probabilities.
What is a random variable X?
A function attaching a real number to each outcome, X(ω)=x.
Difference between capital X and little x?
X is the whole random rule; x is one specific value it may output.
When do you use pX (PMF) vs fX (PDF)?
pX for discrete (isolated values, real probabilities); fX for continuous (packed values, a density).
Are all variables strictly discrete or continuous?
No — mixed variables exist (e.g. a probability lump at 0 plus a smooth density elsewhere); the clean two-box split is the starting map, not the whole territory.
In the discrete bar picture, why does bar height equal the probability?
Only because the bars are drawn with width 1; strictly it is the bar's area (height × width) that is the probability mass.
Why is P(X=c)=0 for a continuous variable?
A single point has zero width, so zero area under the PDF.
What does ∑xpX(x) compute, and what must it equal?
The total probability over all discrete values; it must equal 1.
What does ∫abfX(x)dx compute?
The area under the density between a and b, which equals P(a≤X≤b).
Why can a PDF value exceed 1 but a PMF value cannot?
PDF is density (per-unit-length); only its area is a probability, so heights are unrestricted. PMF values are probabilities themselves, capped at 1.
What is FX(x)?
The cumulative distribution function, FX(x)=P(X≤x) — the running total of probability up to x, rising from 0 to 1.
What does dxdFX(x) give and why?
The density fX(x) — the slope of accumulated probability; steep climb = high density.
What shape does e−λx draw?
Exponential decay: starts at 1, falls fast then flattens toward 0.