Chebyshev polynomial
Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.
A solvable chaos of every degree
The logistic map at four is chaotic and, through a change of coordinates, completely solvable: its orbits are cosines of doubling angles. The trick is not a one-off. For every whole number n there is a polynomial of degree n that multiplies angles by n instead of 2, and every one of them is exactly as solvable, has exactly nᵏ points of period k, and preserves the same distribution — and any two of them commute, which almost no two polynomials do.
The error that keeps coming back to its worst
Judge a polynomial by its largest error on an interval and there is exactly one best one of each degree. It is recognised without comparing it to anything else — its error rises to the same largest size, alternately above and below, one more time than there are coefficients.
An ellipse, not a disc
A Taylor series converges on a disc, and the disc's radius is the distance to the nearest singularity. Ask instead how well polynomials can follow a function on an interval, and the answer is an ellipse with the interval's ends as its foci — the largest one the function is smooth inside.
Named alongside it
The objects these essays reach for when they reach for this one.
ApproximationBoundChaosComplex planeConjugacyConvergenceEllipseError analysisExchange algorithmFourier seriesInterpolationInvariant measure