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.
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.
Update a mean and sum of squared deviations one value at a time. Proves the result equals the full-data calculation.
Evaluate a whole Chebyshev series by running a recurrence backwards. Checked for any finite number of coefficients.
Remove one nuisance variable before regression. Proves the same coefficient and an exact loss decomposition.
Improve an approximate inverse by squaring its error. Proves exact formulas after any number of steps.
A square-root update with a cubed error ratio. Includes exact formulas for every iterate.
Find a square root without evaluating a derivative. Proves a safe bracket and a quadratic error bound.
Bound the product of a weighted average and a weighted reciprocal average. Includes an equality example.
How far can one observation sit from its own sample mean? Proves the sharp squared-deviation bound.
Bound covariance using only the ranges of two lists. Allows arbitrary nonnegative normalized weights.
Three coefficient inequalities put every root of a quadratic inside the unit disk. Handles complex and repeated roots.
Cancel a finite set of known error powers. An exact result for geometrically refined grids.
Solve one equation at a time. Proves exactly how each projection changes the error, including relaxed steps.
Update one nonnegative variable at a time. Each step minimizes its coordinate; every finite sweep preserves feasibility and never increases the objective.
A matrix update that keeps positive curvature. Proves symmetry, the secant relation, and strict positive definiteness.
Fit a new secant equation while changing the matrix as little as possible. Proves an exact distance decomposition and uniqueness.
Proves that Aitken’s three-sample transform accelerates convergence under an error-ratio condition, with exact error formulas.
Five samples recover the target exactly from two geometric error modes. The proof also identifies every singular case in the local model.
Try to list every infinite sequence of zeros and ones. A small diagonal trick always finds one you missed.
An unusual rule about “if … then” becomes a short proof, with its classical assumption made explicit.
Grouped by subject for now. Distances don’t measure similarity; this isn’t t-SNE yet.