Old papers → Lean

I’m taking small results from old math papers, explaining them, and writing proofs that Lean can check. The source and assumptions are included. Work in progress.

Papers (19)

1962

Welford’s streaming variance

Update a mean and sum of squared deviations one value at a time. Proves the result equals the full-data calculation.

B. P. Welford · Statistics · Lean checked

.lean ↓
1955

Clenshaw’s backward summation

Evaluate a whole Chebyshev series by running a recurrence backwards. Checked for any finite number of coefficients.

Charles William Clenshaw · Numerical analysis · Lean checked

.lean ↓
1933

Frisch–Waugh residualization

Remove one nuisance variable before regression. Proves the same coefficient and an exact loss decomposition.

Ragnar Frisch and Frederick V. Waugh · Statistics · Lean checked

.lean ↓
1933

Schulz’s inverse iteration

Improve an approximate inverse by squaring its error. Proves exact formulas after any number of steps.

Günther Schulz · Linear algebra · Lean checked

.lean ↓
1968

Samuelson’s outlier bound

How far can one observation sit from its own sample mean? Proves the sharp squared-deviation bound.

Paul A. Samuelson · Statistics · Lean checked

.lean ↓
1962

Jury’s quadratic stability test

Three coefficient inequalities put every root of a quadratic inside the unit disk. Handles complex and repeated roots.

Eliahu I. Jury · Control theory · Lean checked

.lean ↓
1911

Richardson’s extrapolation

Cancel a finite set of known error powers. An exact result for geometrically refined grids.

Lewis Fry Richardson · Numerical analysis · Lean checked

.lean ↓
1937

Kaczmarz’s row projections

Solve one equation at a time. Proves exactly how each projection changes the error, including relaxed steps.

Stefan Kaczmarz · Linear algebra · Lean checked

.lean ↓
1957

Hildreth’s quadratic procedure

Update one nonnegative variable at a time. Each step minimizes its coordinate; every finite sweep preserves feasibility and never increases the objective.

Clifford Hildreth · Optimization · Lean checked

.lean ↓
1963

Fletcher–Powell’s DFP update

A matrix update that keeps positive curvature. Proves symmetry, the secant relation, and strict positive definiteness.

Roger Fletcher and Michael J. D. Powell · Optimization · Lean checked

.lean ↓
1965

Broyden’s least-change update

Fit a new secant equation while changing the matrix as little as possible. Proves an exact distance decomposition and uniqueness.

Charles George Broyden · Optimization · Lean checked

.lean ↓
1926

Aitken’s Δ² acceleration

Proves that Aitken’s three-sample transform accelerates convergence under an error-ratio condition, with exact error formulas.

Alexander Craig Aitken · Numerical analysis · Lean checked

.lean ↓
1955

Shanks’s two-mode transformation

Five samples recover the target exactly from two geometric error modes. The proof also identifies every singular case in the local model.

Daniel Shanks · Numerical analysis · Lean checked

.lean ↓
1891

Cantor’s diagonal argument

Try to list every infinite sequence of zeros and ones. A small diagonal trick always finds one you missed.

Georg Cantor · Set theory · Lean checked

.lean ↓
1885

Peirce’s law

An unusual rule about “if … then” becomes a short proof, with its classical assumption made explicit.

Charles Sanders Peirce · Logic · Lean checked

.lean ↓

Paper map

Grouped by subject for now. Distances don’t measure similarity; this isn’t t-SNE yet.