Mathematical Foundations

V.6 · Statistics

Which direction has the greatest observed spread?

Edit actual weighted pairs and inspect their exact covariance matrix, principal variances and descriptive ellipse, including singular and repeated-eigenvalue cases.

Turn centered products into a spread ellipse

Actual pairs: (-3, -1), weight 1; (-1, 0), weight 1; (0, 1), weight 1; (1, 2), weight 1; (3, 3), weight 1. The ellipse aligns with the covariance principal directions. Covariance is symmetric and positive semidefinite by its exact centered-product construction. This one-standard-deviation shape is not a confidence region.

Select a pair, drag its handle or use arrow keys. Numeric x and y inputs edit the same observation. Shift makes a larger keyboard step.

Covariance matrix: [4, 2.8; 2.8, 2]

Weights normalize by their positive total. Point size indicates weight; a zero-weight observation contributes no covariance. The ellipse is a descriptive spread shape, with radii √λ; it has no automatic coverage claim.

Actual pairs: (-3, -1), weight 1; (-1, 0), weight 1; (0, 1), weight 1; (1, 2), weight 1; (3, 3), weight 1. The ellipse aligns with the covariance principal directions. Covariance is symmetric and positive semidefinite by its exact centered-product construction. This one-standard-deviation shape is not a confidence region.

Marginal x variance
4
Marginal y variance
2
Off-diagonal covariance
2.8
Covariance determinant
0.16
Largest eigenvalue
5.973214
Smallest eigenvalue
0.026786
Principal-axis orientation (radians)
0.613886

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

from −8 to 8, up to 2 decimal places

from −8 to 8, up to 2 decimal places

from 0 to 9, whole numbers only

The ellipse aligns with the covariance principal directions. Covariance is symmetric and positive semidefinite by its exact centered-product construction. This one-standard-deviation shape is not a confidence region.

Σ=[42.82.82]\Sigma=\begin{bmatrix}4&2.8\\2.8&2\end{bmatrix}
Σ=∑ipi(xi−μ)(xi−μ)T\Sigma=\sum_i p_i(x_i-\mu)(x_i-\mu)^{\mathsf T}

Read and center actual observations

Observed center = (0, 1).

μ=∑ipixi\mu=\sum_i p_i x_i

Edit actual weighted pairs and inspect their exact covariance matrix, principal variances and descriptive ellipse, including singular and repeated-eigenvalue cases.

Intuition

A point cloud can spread differently in different directions. Separate x and y variances describe the margins; covariance records whether centered coordinate changes tend to share a sign. An ellipse summarizes second moments without replacing the observed points.

Definition

Weights wi≥0w_i\geq0 have positive total W and normalized weights pi=wi/Wp_i=w_i/W. For column-vector observations zi=(xi,yi)Tz_i=(x_i,y_i)^{\mathsf T}, define μ=∑ipizi\mu=\sum_i p_i z_i and Σ=∑ipi(zi−μ)(zi−μ)T\Sigma=\sum_i p_i(z_i-\mu)(z_i-\mu)^{\mathsf T}. This is descriptive population covariance of the weighted empirical distribution, not an automatically unbiased sample-covariance formula.

Mechanics

Select and move observed pairs through pointer, keyboard or numeric inputs. Edit a nonnegative integer weight; zero excludes that point from the statistical sum. The inspector exposes both marginal variances, their shared off-diagonal covariance, determinant and eigenvalues. The ellipse radii are square roots of eigenvalues, with a center at the weighted mean.

Derivation

For any vector u, uTΣu=∑ipi[uT(zi−μ)]2≥0u^{\mathsf T}\Sigma u=\sum_i p_i[u^{\mathsf T}(z_i-\mu)]^2\geq0. Thus Σ is symmetric positive semidefinite. In two dimensions this entails nonnegative marginal variances and determinant. Its orthonormal eigenvectors identify uncorrelated principal coordinates; eigenvalues measure spread along them.

Worked examples

The canonical equally weighted pairs have mean (0,1). Their covariance is [414/514/52]\begin{bmatrix}4&14/5\\14/5&2\end{bmatrix} with determinant 4/254/25. For diagonal covariance diag⁡(4,1)\operatorname{diag}(4,1), the coordinate axes are principal directions and ellipse radii are 2 and 1. For equal diagonal entries and zero covariance, the shape is a circle with no unique orientation.

Worked example: Turn centered products into a spread ellipse

Actual pairs: (-3, -1), weight 1; (-1, 0), weight 1; (0, 1), weight 1; (1, 2), weight 1; (3, 3), weight 1. The ellipse aligns with the covariance principal directions. Covariance is symmetric and positive semidefinite by its exact centered-product construction. This one-standard-deviation shape is not a confidence region.

Select a pair, drag its handle or use arrow keys. Numeric x and y inputs edit the same observation. Shift makes a larger keyboard step.

Covariance matrix: [4, 2.8; 2.8, 2]

Weights normalize by their positive total. Point size indicates weight; a zero-weight observation contributes no covariance. The ellipse is a descriptive spread shape, with radii √λ; it has no automatic coverage claim.

Actual pairs: (-3, -1), weight 1; (-1, 0), weight 1; (0, 1), weight 1; (1, 2), weight 1; (3, 3), weight 1. The ellipse aligns with the covariance principal directions. Covariance is symmetric and positive semidefinite by its exact centered-product construction. This one-standard-deviation shape is not a confidence region.

Marginal x variance
4
Marginal y variance
2
Off-diagonal covariance
2.8
Covariance determinant
0.16
Largest eigenvalue
5.973214
Smallest eigenvalue
0.026786
Principal-axis orientation (radians)
0.613886

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

from −8 to 8, up to 2 decimal places

from −8 to 8, up to 2 decimal places

from 0 to 9, whole numbers only

The ellipse aligns with the covariance principal directions. Covariance is symmetric and positive semidefinite by its exact centered-product construction. This one-standard-deviation shape is not a confidence region.

Σ=[42.82.82]\Sigma=\begin{bmatrix}4&2.8\\2.8&2\end{bmatrix}
Σ=∑ipi(xi−μ)(xi−μ)T\Sigma=\sum_i p_i(x_i-\mu)(x_i-\mu)^{\mathsf T}

Read and center actual observations

Observed center = (0, 1).

μ=∑ipixi\mu=\sum_i p_i x_i

Inspect the actual mathematical steps and replay their immutable states.

Executable reference code

Run the exact mechanics and the NumPy companion. Both use literal assertions on the worked examples; simulations are never conditioned on a favorable coverage or fit outcome.

code/python/statistics_covariance.py
"""Runnable covariance reference, assumptions explicit."""
from fractions import Fraction as F
x=list(map(F,[-3,-1,0,1,3])); y=list(map(F,[-1,0,1,2,3]));weights=[1]*5
total=sum(weights);mx=sum(a*w for a,w in zip(x,weights))/total;my=sum(a*w for a,w in zip(y,weights))/total
vx=sum(w*(a-mx)**2 for a,w in zip(x,weights))/total
vy=sum(w*(b-my)**2 for b,w in zip(y,weights))/total
cov=sum(w*(a-mx)*(b-my) for a,b,w in zip(x,y,weights))/total
det=vx*vy-cov*cov
assert (vx,vy,cov,det)==(F(4),F(2),F(14,5),F(4,25))
assert det>=0
print([[vx,cov],[cov,vy]])
code/python/statistics_covariance_numpy.py
"""Runnable covariance reference, assumptions explicit."""
import numpy as np
x=np.array([[-3,-1],[-1,0],[0,1],[1,2],[3,3]],dtype=float)
centered=x-x.mean(axis=0)
cov=centered.T@centered/len(x)
eigenvalues,eigenvectors=np.linalg.eigh(cov)
assert np.allclose(cov,[[4,2.8],[2.8,2]]) and np.all(eigenvalues>=0)
print(cov,eigenvalues,eigenvectors)

Explore

Try a singular line, zero spread and equal eigenvalues. Change only the selected point’s weight and explain why the weighted center can move. Create negative covariance by moving pairs in opposite coordinate directions. Keep the actual observations in view while interpreting the ellipse.

Common mistakes and counterexamples

A covariance ellipse is not automatically a 95% confidence region or a prediction region. A one-standard-deviation contour has no universal coverage fraction for an arbitrary point cloud. Singular covariance is valid when spread collapses to a line. Equal eigenvalues do not imply an invalid matrix; they mean orientation is not uniquely determined.

Numerical considerations

All weighted means, covariance entries, determinant and rank classifications use exact fractions. The accepted 2×2 spectral model computes binary64 companions and checks eigenvector residuals. Exact determinant decides singularity; a drawing tolerance never changes mathematical rank. Coordinates lie in [−8,8] with at most two decimals; up to 12 observed pairs have weights 0–9 with positive total. The all-zero-weight state is rejected with an explanation.

Engineering and ML connections

PCA rotates centered data toward directions of large variance. The first principal direction is useful as a preview, but interpretation still depends on feature units and scaling. Covariance of meters and milliseconds changes if units change; a large principal variance does not by itself identify a meaningful or causal feature.

Exercises

Calculate from observed data and state the assumptions before interpreting a result. Corrective feedback identifies the corresponding misconception.

calculation

Centered products

For canonical pairs (-3,-1),(-1,0),(0,1),(1,2),(3,3), give descriptive x variance, y variance and covariance.

calculation

PSD invariant

For Σ=[[4,14/5],[14/5,2]], give its determinant.

calculation

Principal radii

For covariance diag(4,1), give the largest and smallest eigenvalues and the two one-standard-deviation ellipse radii.

explanation

Repeated eigenvalues

For covariance diag(1/2,1/2), is the major-axis orientation unique?

Choose one answer

explanation

Singular spread

Every weighted observation equals (2,3). What is its covariance?

Choose one answer

Summary and checkpoints

Construct centered outer products, verify symmetry and PSD, connect eigenvalues with marginal and principal spread, and explain the point, line and circular exceptions. Keep descriptive geometry separate from inferential coverage.

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