Mathematical Foundations

V.2 · Statistics

What does the area of a deviation square measure?

Connect squared distances to two variance conventions, then compare them with the median and unscaled median absolute deviation.

Square deviations; compare robust spread

Ordered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

Select an observation below. Drag its handle or use Left/Right arrows; Shift takes a larger step. Numeric entry accepts two decimal places.

Ordered: 1, 2, 2, 3, 7

Single mode: 2.

Counts of actual observations
Counts of actual observationsOrdered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.31: approximately 12: approximately 23: approximately 17: approximately 1048

Observed values · counts · dashed marker is the observed mean

Observation 1: deviation = −2
Squared distance = 4
Observation 2: deviation = −1
Squared distance = 1
Observation 3: deviation = −1
Squared distance = 1
Observation 4: deviation = 0
Squared distance = 0
Observation 5: deviation = 4
Squared distance = 16

Ordered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

Observed mean
3
Observed median
2
Population variance of these observations
4.4
Usual sample variance
5.5
Population standard deviation
√110/52.097618…
Median absolute deviation (unscaled)
1

= exact finite-data/model quantity · ≈ binary64 approximation; empirical results describe this run

from −20 to 20, up to 2 decimal places

Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

xˉ=15∑ixi=3\bar x=\frac{1}{5}\sum_i x_i=3
vn=∑i(xi−xˉ)2n=4.4v_n=\frac{\sum_i(x_i-\bar x)^2}{n}=4.4
s2=∑i(xi−xˉ)2n−1=5.5s^2=\frac{\sum_i(x_i-\bar x)^2}{n-1}=5.5

Order actual observations

Ordered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

n=5n=5

Connect squared distances to two variance conventions, then compare them with the median and unscaled median absolute deviation.

Intuition

Two datasets can share a center and have very different spreads. The mean-centered deviation measures signed displacement; summing deviations gives zero and loses spread. Squaring keeps all distances nonnegative, and the square pictures make large deviations visibly influential.

Definition

Population variance of these finite observations is vn=n−1∑i(xi−xˉ)2v_n=n^{-1}\sum_i(x_i-\bar x)^2. Usual sample variance is s2=(n−1)−1∑i(xi−xˉ)2s^2=(n-1)^{-1}\sum_i(x_i-\bar x)^2 for n>1n>1. Their standard deviations are the nonnegative square roots. The unscaled median absolute deviation is MAD⁡=median⁡i∣xi−m∣\operatorname{MAD}=\operatorname{median}_i|x_i-m|, where mm is the observed median.

Mechanics

Move or select observed values. Every square area is proportional to its displayed squared deviation; all squares share a scale within the dataset. The histogram, inspector and immutable replay use the same observations. The one-observation preset deliberately makes the usual sample variance undefined.

Derivation

Expansion yields ∑i(xi−xˉ)2=∑ixi2−nxˉ2\sum_i(x_i-\bar x)^2=\sum_i x_i^2-n\bar x^2. For iid data with finite population variance σ2\sigma^2, E[∑i(Xi−Xˉ)2]=(n−1)σ2E[\sum_i(X_i-\bar X)^2]=(n-1)\sigma^2. Division by n−1n-1 makes s2s^2 unbiased for that model; it does not imply that ss is an unbiased estimator of σ\sigma.

Worked examples

For [1,2,3][1,2,3], mean 2 gives deviations [−1,0,1][-1,0,1] and squared sum 2. Thus vn=2/3v_n=2/3 and s2=1s^2=1. For [1,2,2,3,20][1,2,2,3,20], median 2 gives absolute distances [1,0,0,1,18][1,0,0,1,18], whose median is 1. The variance reacts strongly to 20; MAD remains 1.

Worked example: Square deviations; compare robust spread

Ordered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

Select an observation below. Drag its handle or use Left/Right arrows; Shift takes a larger step. Numeric entry accepts two decimal places.

Ordered: 1, 2, 2, 3, 7

Single mode: 2.

Counts of actual observations
Counts of actual observationsOrdered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.31: approximately 12: approximately 23: approximately 17: approximately 1048

Observed values · counts · dashed marker is the observed mean

Observation 1: deviation = −2
Squared distance = 4
Observation 2: deviation = −1
Squared distance = 1
Observation 3: deviation = −1
Squared distance = 1
Observation 4: deviation = 0
Squared distance = 0
Observation 5: deviation = 4
Squared distance = 16

Ordered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

Observed mean
3
Observed median
2
Population variance of these observations
4.4
Usual sample variance
5.5
Population standard deviation
√110/52.097618…
Median absolute deviation (unscaled)
1

= exact finite-data/model quantity · ≈ binary64 approximation; empirical results describe this run

from −20 to 20, up to 2 decimal places

Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

xˉ=15∑ixi=3\bar x=\frac{1}{5}\sum_i x_i=3
vn=∑i(xi−xˉ)2n=4.4v_n=\frac{\sum_i(x_i-\bar x)^2}{n}=4.4
s2=∑i(xi−xˉ)2n−1=5.5s^2=\frac{\sum_i(x_i-\bar x)^2}{n-1}=5.5

Order actual observations

Ordered observed values: 1, 2, 2, 3, 7. Single mode: 2. Squared deviations total 22. Divide by n for population variance, by n−1 for usual sample variance. Median absolute deviation (MAD) = 1.

n=5n=5

Replay the worked mathematical steps using the same canonical state and actual derived quantities.

Executable reference code

Run both files. The pedagogical program exposes the arithmetic; the NumPy companion uses array operations. Literal assertions check the worked example rather than testing a simulation against a desired statistical outcome.

code/python/statistics_spread.py
"""Runnable spread reference; exact mechanics / NumPy companion."""
from fractions import Fraction as F
from statistics import median
x=list(map(F,[1,2,3]))
mean=sum(x)/len(x)
squared_sum=sum((v-mean)**2 for v in x)
variance=squared_sum/len(x)
sample=squared_sum/(len(x)-1) if len(x)>1 else None
mad=median([abs(v-median(x)) for v in x])
assert (variance,sample,mad)==(F(2,3),F(1),F(1))
print(variance,sample,mad)
code/python/statistics_spread_numpy.py
"""Runnable spread reference; exact mechanics / NumPy companion."""
import numpy as np
x=np.array([1.,2.,3.])
variance=x.var(ddof=0)
sample=x.var(ddof=1) if len(x)>1 else None
mad=np.median(np.abs(x-np.median(x)))
assert np.isclose(variance,2/3) and sample==1 and mad==1
print(variance,sample,mad)

Explore

Move the extreme observation while keeping the middle values fixed. Predict which center and spread will change. Add the same constant to every value; then multiply all observations by two. Variances scale by four, standard deviations and MAD by two.

Common mistakes and counterexamples

A small MAD need not mean every observation is close to the median: a minority of extreme points can coexist with a small central spread. MAD can be zero in a nonconstant discrete dataset when enough values coincide. Robust means resistant to some contamination, not immune to every change.

Numerical considerations

All supported centered sums and rational variance identities are exact. Square roots and drawing coordinates use binary64; exact root forms are displayed when supported. Raw second-moment subtraction is dangerous for large nearly equal floating values; the teaching model centers exact fractions and bounds inputs. Unscaled MAD is not automatically a Gaussian standard-deviation estimate.

Engineering and ML connections

Feature scaling and uncertainty estimates need a stated spread convention. Standard deviation measures squared-error scale, while median/MAD can help diagnose contaminated measurements. The factor 1.4826 sometimes applied to MAD assumes a normal calibration; this explorer deliberately uses the unscaled descriptive quantity.

Exercises

Predict, calculate and explain before checking the corrective feedback. Each solution states the relevant rule and its conditions.

calculation

Two denominators

For [1,2,3], give population variance and usual sample variance.

calculation

Robust spread

For [1,2,2,3,20], give the median and unscaled MAD.

calculation

Centering identity

For [1,2,3], give Σx² and n times the squared mean.

explanation

Singleton

What are the two variance policies for [4]?

Choose one answer

explanation

Scale and shift

Adding 10 to each observation changes which quantity?

Choose one answer

Summary and checkpoints

Identify which denominator is appropriate, calculate a squared sum, explain the singleton exception and compare ordinary with robust summaries. Units matter: variance has squared units; standard deviation and MAD return to the observation units.

The map of the book

97 of 97 chapters written · eight Parts

demo Foundation demo Try the live vector example Open as a page

Part I

Mathematical Language

The notation and mental objects everything else uses.

9 of 9 chapters written

  1. I.1 Scalars, quantities, units, powers and roots available
  2. I.2 Coordinates and points available
  3. I.3 Vectors: components, magnitude, and direction reference chapter available
  4. I.4 Algebraic expressions, equations and inequalities available
  5. I.5 Functions as input → transformation → output available
  6. I.6 Essential function families available
  7. I.7 Sets, intervals, and relations available
  8. I.8 Indexed quantities and summation available
  9. I.9 The notation map for ML available

Part II

Linear Algebra

Matrices as transformations: the strongest foundation in the book.

19 of 19 chapters written

  1. II.1 Vector addition and subtraction available
  2. II.2 Scalar multiplication and vector scaling available
  3. II.3 Norms, magnitude, and normalization available
  4. II.4 Dot product, angle, and orthogonality available
  5. II.5 Projection and distance to a direction available
  6. II.6 Linear combinations and span available
  7. II.7 Linear independence, basis, and coordinates available
  8. II.8 Matrices as linear transformations available
  9. II.9 Matrix × vector available
  10. II.10 Matrix × matrix as composition available
  11. II.11 Transpose and orthogonality available
  12. II.12 Determinant: orientation and area/volume scaling available
  13. II.13 Linear systems as intersecting constraints available
  14. II.14 Gaussian elimination and row operations available
  15. II.15 Rank and invertibility available
  16. II.16 Inverse matrices available
  17. II.17 Eigenvalues and eigenvectors available
  18. II.18 Orthogonal bases and least-squares geometry available
  19. II.19 Singular Value Decomposition available

Part III

Calculus

Change, local approximation, and sensitivity made visible.

15 of 15 chapters written

  1. III.1 Limits through approach available
  2. III.2 Continuity and local behavior available
  3. III.3 Derivative as secant → tangent available
  4. III.4 Derivative as rate of change and local linear model available
  5. III.5 Derivative rules available
  6. III.6 Chain rule available
  7. III.7 Multivariable functions and partial derivatives available
  8. III.8 Gradient and directional derivatives available
  9. III.9 Jacobian available
  10. III.10 Computational graphs and automatic differentiation available
  11. III.11 Hessian and curvature available
  12. III.12 Integrals as accumulation available
  13. III.13 Fundamental derivative/integral connection available
  14. III.14 Numerical differentiation available
  15. III.15 Numerical integration available

Part IV

Probability

Uncertainty through sample spaces, evidence, and repetition.

16 of 16 chapters written

  1. IV.1 Random experiments, outcomes, and sample spaces available
  2. IV.2 Events and probability mass available
  3. IV.3 Counting and finite probability where needed available
  4. IV.4 Conditional probability as restricted sample space available
  5. IV.5 Independence available
  6. IV.6 Bayes' theorem as probability-mass update available
  7. IV.7 Random variables available
  8. IV.8 PMF, PDF, and CDF available
  9. IV.9 Bernoulli and Binomial distributions available
  10. IV.10 Uniform and Gaussian distributions available
  11. IV.11 Expectation available
  12. IV.12 Variance and standard deviation available
  13. IV.13 Joint, marginal, and conditional distributions available
  14. IV.14 Covariance and correlation available
  15. IV.15 Law of Large Numbers available
  16. IV.16 Central Limit Theorem available

Part V

Statistics

From observed data to estimates, intervals, and likelihood.

10 of 10 chapters written

  1. V.1 Data summaries: mean, median, mode available
  2. V.2 Spread: variance, standard deviation, robust interpretation available
  3. V.3 Population, sample, and sampling variability available
  4. V.4 Estimators and estimation available
  5. V.5 Confidence intervals through repeated sampling available
  6. V.6 Covariance matrices and multivariate spread available
  7. V.7 Regression fundamentals available
  8. V.8 Likelihood available
  9. V.9 Maximum Likelihood Estimation available
  10. V.10 Maximum A Posteriori estimation available

Part VI

Optimization

Learning as repeated parameter updates governed by an objective.

10 of 10 chapters written

  1. VI.1 Objective functions and optimization landscapes available
  2. VI.2 Local vs global optima and stationary points available
  3. VI.3 Convexity available
  4. VI.4 Gradient descent flagship chapter available
  5. VI.5 Learning rate and convergence behavior available
  6. VI.6 Momentum available
  7. VI.7 Stochastic and mini-batch gradient descent available
  8. VI.8 Adam intuition available
  9. VI.9 Constraints and projected/penalized intuition available
  10. VI.10 Numerical stopping and optimization diagnostics available

Part VII

Information Theory

Logarithms, entropy, and the loss behind token prediction.

8 of 8 chapters written

  1. VII.1 Logarithms and log probabilities in computation available
  2. VII.2 Self-information available
  3. VII.3 Entropy available
  4. VII.4 Cross entropy and negative log-likelihood available
  5. VII.5 KL divergence available
  6. VII.6 Logits and softmax available
  7. VII.7 Numerical stability: log-sum-exp and stable softmax available
  8. VII.8 From token logits to language-model loss available

Part VIII

Numerical Computing

Why equivalent expressions behave differently on real machines.

10 of 10 chapters written

  1. VIII.1 Floating-point representation available
  2. VIII.2 Rounding and representation error available
  3. VIII.3 Error propagation and conditioning available
  4. VIII.4 Catastrophic cancellation available
  5. VIII.5 Overflow and underflow available
  6. VIII.6 Stable algorithms available
  7. VIII.7 Numerical linear algebra realities available
  8. VIII.8 Sparse matrices and sparse structure available
  9. VIII.9 Vectorized computation available
  10. VIII.10 Reproducibility, random seeds, and nondeterminism available