This page assumes nothing. Every squiggle in the parent note — E, μ, σ2, Xˉn, ∑, 1A, P — is built here, from a picture, before you are allowed to use it. Read top to bottom; each block earns the next.
Plain words. A random variable is just a number you don't know yet because it depends on the outcome of some random experiment. Roll a die → the number on top is a random variable. Throw a dart at a square → whether it lands in a circle (yes/no, written 1/0) is a random variable.
The picture. Think of a machine with a lever. Pull the lever and out drops a number. You can't predict which — but you can predict the pattern if you pull many times.
Why the topic needs it. Everything Monte Carlo estimates (π, an integral) gets rewritten as "the typical value that drops out of some machine." We call the letter for that value X (or g(X) when we feed X through a function g first).
Two special machines appear constantly in the parent note.
The picture. The indicator is a light switch tied to a rule. Land inside the region → light ON (1). Land outside → light OFF (0). Its average is exactly the fraction of time the light is on — which is a probability. That single fact is the engine behind estimating π.
Now the crucial distinction that the whole subject turns on.
The picture. Imagine the histogram of a million pulls. It has a balance point — the spot where a ruler under it would perfectly balance. That balance point is μ=E[X].
Why squared? We square the distance X−μ so that being below the mean (negative gap) and above it (positive gap) both count as spread instead of cancelling. Deep dive: Variance and Covariance.
The picture. Small σ2 = a tall thin pile hugging μ (consistent machine). Large σ2 = a wide flat pile (erratic machine). This "width" is exactly what shrinks as you average more samples — the secret of why Monte Carlo works.
The picture.n identical machines, each pulled once by a different blindfolded person in a different room. Same design (identical), no communication (independent).
Why the topic needs it.Identical gives every Xi the same μ so their average targets μ. Independent is what lets variance simply add (§4). Break independence — use correlated samples — and the clean σ2/n formula collapses. See Chebyshev's Inequality for the bound that turns this spread into a guarantee.
The picture. Draw a narrow band of half-width ε around the horizontal line μ. As n climbs, the wobbling path of Xˉn dives into that band and (almost) never leaves. A stronger version of this promise is the Strong Law of Large Numbers.
Once variance of the sample mean is σg2/n (§4), its standard deviation is the square root:
SE=nσg2=nσg.
Why the ? Variance is in squared units (§4); to get a spread in the same units as the answer you take the square root, which drags the n under a root too. That is the origin of the famous "1/n": to shrink error 10× you need n to grow 100×. The precise shape of the error's bell curve — and hence confidence intervals — comes from the Central Limit Theorem.