Basic Prerequisites: Probability & Measure Theory (distributions, expectation, conditional expectation) and Multivariable Calculus & Optimization (Taylor expansions, maximization). (these are the folder-level prerequisites for pages 02–06; page 01 states its own, smaller, entry requirements)


1. Intuition & Practical Objective

Every number a quant reports is an estimate of something unobservable, and every decision (trade, hedge, size a position) is a test whose error rate is a choice. Statistics is the discipline that turns “the sample mean was 8%” into “8% ± 2%, and I would see a number this large by chance % of the time.” Without it, a backtest is a story; with it, a backtest is an inference with a stated failure probability.

Its claim is sharp: an estimator is a random variable with a distribution, and inference is the study of that distribution. The three primitives are (i) point estimation - how to build and compare estimators (MLE, method of moments) via bias, variance, MSE and the Cramér–Rao bound; (ii) sampling distributions - the Laws of Large Numbers and the Central Limit Theorem that make the sampling distribution of a statistic calculable, and hence the standard error ; (iii) interval estimation and hypothesis testing - pivots, confidence intervals, size/power, p-values, and the multiplicity corrections that make “the best of strategies” an honest statement.

This folder is the topic-folder for that toolbox, and it is the statistical backbone of backtesting and model validation: a Sharpe ratio is a -statistic, a strategy search is a multiple-testing problem, and a model-selection score like AIC is a penalised likelihood.

This page is a hub: it (a) gives the fast estimator/test lookup below (job #1), and (b) routes you to six sub-pages from raw intuition through point estimation, the CLT, intervals & testing, bias–variance & validation, and the bootstrap/asymptotic extensions.

The one-sentence essence. “An estimator is a random variable, the CLT fixes its sampling distribution and hence the standard error , and inference is just claiming coverage (intervals) or error rates (tests) about that distribution - with multiplicity controlled when you look at many estimates at once.”


2. Mathematical Ground Truth & Derivations

Quick-Reference Lookup (job #1). All formulas below are transcribed from Casella & Berger (2002) Ch 7–9 (primary), cross-checked against ESL Ch 2, 7–8 and Glasserman Ch 1; the numbers in the check column were re-executed and reproduced exactly by the scripts in §3 and on the sub-pages.

Notation: parameter, an estimator (a random variable), , , log-likelihood, , standard normal CDF.

Point estimators and their quality (C&B Ch 7):

QuantityFormulaReferenceVerified check
MSE decomposition, bias Eq 7.3.1MSE(S²)=3.546 vs MSE(σ̂²_MLE)=3.037, n=10 (matches theory 2σ⁴/(n−1)=3.556, (2n−1)σ⁴/n²=3.040)
MLE (exponential rate)§7.2.2 vs CRLB
MLE (normal)§7.2.2biased; smaller MSE than
Method of momentsequate to , solve§7.2.1shifted-exp shift (true 3.0)
Cramér–Rao lower boundThm 7.3.1exp rate attains it ()
MLE asymptotic variance (observed info)Eq 7.4.1odds-ratio vs
Delta method; multivariate: Eq 7.4.5odds-ratio check above
Asymptotic normality of MLE (regular models, support free of )§7.4.1-

Sampling distributions, LLN & CLT (Glasserman §1.1; C&B Ch 5):

ResultStatementVerified check
LLN (SLLN) a.s.running mean of Exp(1): 1.108→1.0105→0.9968
CLT (Lindeberg–Lévy); standard error sd(mean)=0.3167 vs ; halving error costs 4× data
Rate, independent of dimension (why Monte Carlo wins in high dim)(D) : 0.133()→0.037()→0.010()
Sample variancemean (theory 11), Var (theory 22)
Student- (normal data)$P(

Intervals, tests and multiplicity (C&B Ch 8–9):

ObjectFormulaReferenceVerified check
Pivot with distribution independent of Def 9.2.1 is a pivot
-confidence intervalEx 9.2.395% coverage: Normal 0.9504, Exponential 0.9123
Approx. CI (CLT)§9.4.2-
Neyman–Pearsonmost powerful level- test of simple vs simple rejects where likelihood ratio Thm 8.3.1-
Size / powersize ; power , §8.3.1Bonferroni keeps FWER : 0.0483
p-valuesmallest at which the sample is rejected (data-dependent)§8.3.3-
Wilks (LRT), Thm 8.4.1Poisson mean LRT: mean 0.9941 (χ²₁ mean 1), 95th pct 3.861 vs 3.842
Multiple testingBonferroni ; FDR (Benjamini–Hochberg) controls -20 nulls: P(≥1 raw )=0.647 (theory 0.642)
Model selectionAIC (ESL ); BIC ESL 7.29/7.35; Tsay 2.16AIC/BIC both pick degree 1

3. Computational Implementation - MSE, Cramér–Rao and the CLT in one script

Standard library only. Verifies the MSE decomposition, that the exponential-rate MLE attains the Cramér–Rao bound, and the standard error.


4. Failure Modes & First-Principles Breakdowns

Hub signposts - the folder’s failure-mode analysis lives on the sub-pages. In one line each:

  1. Estimating a ratio/nonlinear function and trusting the plug-in variance. When is non-monotone the delta method can report (near-)zero variance - the MLE of gives at (C&B §7.4.1). Non-monotone transforms break the approximation.
  2. Using the CLT when the sample is too small or too skewed. -intervals on Exponential(1) data under-cover (0.912 not 0.950); the CLT error is .
  3. Testing many hypotheses and reporting the winner. With true nulls, P(at least one ) ; with strategies the best spurious - “significant” at is guaranteed noise. Correct with Bonferroni/FDR or a Reality-Check bootstrap.
  4. Validating on data you already used. Selecting features/models on the full sample then cross-validating leaks information: the ESL screening example reports CV error 3% against a true 50% (ESL §7.10.2). Screening must happen inside each fold.
  5. Confusing bias with error. An unbiased estimator need not be closest (MSE = Var + Bias²); the biased beats unbiased on MSE.

5. References

  • Casella, G. & Berger, R. L.: Statistical Inference (2nd ed., 2002)
  • Hastie, Tibshirani & Friedman: Elements of Statistical Learning (2nd ed., 2009)
  • Glasserman, P.: Monte Carlo Methods in Financial Engineering (2004)
  • Tsay, R. S.: Analysis of Financial Time Series (3rd ed., 2010)
  • Efron, B. & Tibshirani, R.: An Introduction to the Bootstrap (1993)

6. Connected Graph Bridges

Beginner: start at 01 · Practitioner: start at 05