Theme

Small cases lie — page 4

Patterns that hold for every example anyone would check by hand, and then stop. The cases within reach are not a sample of the cases.
What the degree-5 sum costs, and what the bound claims. The error of the degree-5 Taylor polynomial of sin x against x, on a logarithmic scale, with Lagrange's bound drawn above it. The bound exceeds the error by a factor of 1.8 at the right-hand end. Analysis

An error with an unknown in it

Taylor's theorem does not say a partial sum is close to anything. It says the error is one more derivative evaluated somewhere nobody can name, and everything the theorem is worth comes from what happens when that somewhere is replaced by the worst case.

11 points, equally spaced. 1/(1 + x²) and the polynomial of degree 10 through 11 of its points, spaced evenly across the interval. The worst error is 2.48e-1, at x = -2.350. Analysis

The points that ruin the fit

A polynomial through eleven points of a gentle curve should be a good approximation to it, and adding more points should make it better. On evenly spaced points it makes it worse, without limit, and the reason is not the polynomial but where the points were put.

Two equilibria, and two tests that disagree. The row chooser's expected payoff from each option against the column chooser's behaviour, for a joint effort worth more than a safe one. The lines cross at 0.750, which is the mixed equilibrium and the boundary between the two basins. Applied

Two equilibria and no way to choose

A game can have two states nobody wants to leave, one paying more than the other, and the definition of an equilibrium has nothing to say about which happens. The two standard tie-breakers disagree, and the one that wins is usually the worse.

A carpet whose two dimensions differ by 0.076. A self-affine carpet built by keeping 5 cells of a 4 by 2 grid and repeating 4 times. Its box dimension is 1.6610 and its Hausdorff dimension 1.5850. Dynamics

A carpet with two dimensions

For every set on this ladder so far the two definitions of dimension agree, and the agreement is a theorem about sets built from copies of themselves scaled equally. Stretch one direction more than the other and the two numbers come apart, by an amount that can be computed exactly.

About the fourth-best, whatever the size of the field. The smallest expected rank achievable by an online rule, against the number of candidates, for 10 sizes. It rises to 3.8516 at 2500 candidates and its limit is 3.8695. Probability

Giving up on the best

The secretary rule treats landing the second-best exactly as badly as landing the worst, which is a strange thing to want. Ask instead for the smallest average rank and the answer is about the fourth-best candidate — whatever the size of the field, and whether it is ten or ten million.

All themes