Periodicity Created 2026-10-25 Updated 2026-11-05
Periodicity is invariance of a function under a nonzero shift . Its domain of a function must be preserved by the shift and its inverse, and at every allowed function input. On the real line, both and have period .
For an angular coordinate on a full circle, single-valuedness requires -periodicity. For nonzero real , the functions and are -periodic precisely when is an integer: the phase must change by an integer multiple of . The zero-frequency case instead gives constant functions. Their Fourier series supply angular modes for the harmonic expansion on a disk.
On a bounded connected Lipschitz domain ,
for every . If this failed, the Rellich-Kondrachov compactness theorem would produce a normalized strong limit with zero gradient, hence a constant function; continuity of the Sobolev trace theorem would force that constant to vanish, contradicting its unit norm.
Quadrature rule Created 2026-09-24 Updated 2026-10-14
A quadrature rule approximates an integral by a finite weighted sum of sampled function values:
The quadrature nodes specify where to sample, and the quadrature weights specify how much each sample contributes. The density specifies the target integral, whereas the discrete quadrature weights belong to the approximation. Ordinary numerical integration has . Gaussian quadrature and the midpoint quadrature rule choose interior quadrature nodes; the trapezoidal rule includes endpoints.[ref]
For ordinary numerical integration, exactness on the constant function requires ; exactness on additionally requires . These two checks make the quadrature rule exact for every affine function. For example, both the midpoint quadrature rule and trapezoidal rule give for . Testing progressively higher polynomial degrees defines the degree of precision of a quadrature rule. Exactness describes a class of integrands, rather than promising exact results for every function.
Composite midpoint quadrature rules and composite trapezoidal rules apply a simple quadrature rule on every panel of a partition of an interval. This buys accuracy by shrinking the panels while keeping the elementary formula fixed. For continuous functions sampled exactly, their quadrature errors tend to zero as the largest panel width tends to zero. The familiar second-order bounds require stronger assumptions about derivatives. The signed approximation error used here is ; some sources define quadrature error with the opposite sign, so the convention must accompany any formula.
Rolle theorem Created 2026-09-24 Updated 2026-10-14
Rolle's theorem is the equal-endpoint case of the mean value theorem. Let and let the real-valued function be continuous on the closed interval and differentiable on the open interval . If , there exists with . Geometrically, a tangent line somewhere in the interior is horizontal, like the secant line joining the endpoints. [ref]
For the polynomial on , both endpoint values are zero and the derivative is . Thus , where , and the horizontal tangent line is . The horizontal secant line is : equal endpoint values do not force the interior tangent line to pass through those endpoints.
The absolute value function on exposes the importance of differentiability. It is continuous and , so the secant line has slope zero. However,
and the derivative does not exist at zero because the one-sided derivatives disagree. Every existing derivative in the interior is nonzero. The corner fails a hypothesis of both Rolle's theorem and the mean value theorem, so neither conclusion is guaranteed.
For a short proof, the extreme value theorem supplies a greatest and a least value on . If is a constant function, every interior point works. Otherwise at least one of these values differs from the common endpoint value, so it is attained at an interior extremum. At an interior local maximum or local minimum, differentiability forces the derivative to be zero: the difference quotients from the two sides have opposite weak signs and the same limit.
This turns repeated values into information about derivatives. Two distinct roots of a polynomial force a root of its derivative between them; iterating this idea gives the Rolle root count with multiplicities. More generally, a differentiable function with nonzero derivative throughout a real interval cannot repeat a value there, hence is injective. The beauty is that knowing only two equal values guarantees an exact local feature somewhere between them.
Self-map 2026-10-14
A self-map is a function whose domain of a function and codomain are the same set. It need not be a bijection: a constant function on a two-element set is a self-map that merges its inputs. Self-maps can always be composed with one another, and all self-maps of a specified set form its full transformation monoid.
Simpson's rule Created 2026-10-14 Updated 2026-10-18
Simpson's rule approximates a definite integral by integrating the quadratic polynomial obtained by polynomial interpolation at two endpoints and their midpoint. For an interval with , write and . The three quadrature nodes are , and the quadrature rule is
Thus its quadrature weights are . Their sum is , as required for exactness on constant functions. This is the three-node Newton-Cotes closed quadrature; its degree of precision of a quadrature rule is three, even though the interpolating polynomial has polynomial degree at most two.[ref]
For an original worked example, take the cubic polynomial on the interval . Here and , so the function evaluations give
Simpson's rule gives
An antiderivative supplies an independent exact definite integral:
The quadratic polynomial through the same quadrature nodes is . It differs from between the quadrature nodes, but its definite integral agrees exactly. The picture shows why: the signed polynomial interpolation error has two lobes with opposite integrals.
Figure 1.
An original cubic and its quadratic interpolant have the same integral because the two interpolation-error lobes have signed integrals plus and minus 81 over 64
. Details.
Three function evaluations therefore capture more information about an integral than about the whole function. When an antiderivative is unavailable, composite Simpson's rule repeats this inexpensive local construction over a partition of an interval. For a sufficiently smooth function, halving the node spacing reduces its truncation error by approximately a factor of sixteen.
Uniformly continuous function Created 2026-09-24 Updated 2026-10-18
A uniformly continuous function has one input tolerance valid throughout its domain of a function. For , with , uniform continuity means
Choose the output tolerance first, then a positive valid for every pair of function inputs. It may depend on , the function and its domain of a function, but not on the pair’s location. The absolute values measure input and output distance.[ref]
Compare the quantifier order with the epsilon-delta definition of continuity:
Both lines end with . In the first, can depend on the point ; in the second, it is chosen before . Thus uniform continuity implies continuity at every point. Each requested gets its own shared tolerance.
For an exact example, take the polynomial function on the closed interval . For every pair of function inputs in that interval, polynomial factorization gives
Consequently works everywhere on this domain of a function. With , the common tolerance is . Near the right endpoint, for example, and have input distance and output distance . The bound is sufficient; it does not claim the largest admissible input window at each point.
On the whole real line, the same polynomial function is a continuous function but fails uniform continuity. Take the sequences and , for positive integers . Then
For any proposed , choose an integer . The inputs are closer than , yet their outputs violate the fixed tolerance . The sequences need not themselves have a finite limit: their mutual distance is what tends to zero. This is the obstruction captured by the sequential criterion for uniform continuity. Restricting the domain of a function to removes these escaping pairs.
Figure 1.
The square function: local input windows shrink, but a bounded interval admits one shared tolerance
. The left panel computes sufficient windows from the continuity bounds for the square function; shrinking these particular windows alone does not prove failure of uniform continuity. The middle panel displays the exact bound on the interval . The right panel gives the decisive sequence pairs on the real line. All plotted values are calculated from the displayed formulas. Details.
A uniformly continuous function need not be a bounded function. The identity function on the real line has , so always works, although its image of a function is the unbounded real line. Uniform continuity controls changes between nearby inputs, not the overall size of outputs. Likewise, an unbounded domain of a function does not by itself prevent uniform continuity.
The square root supplies a different common tolerance on the interval . Assuming , put and . Since ,
Interchanging the inputs when necessary proves
Thus guarantees uniform continuity on the entire domain of a function, including zero. For , any input distance below suffices. The pairs and both have input distance ; their output distances are respectively and . The common guarantee accommodates quite different local sensitivities.
This Hölder continuity bound allows a curved tolerance rule. It is weaker than a Lipschitz bound: at zero the output change divided by the input change is
No finite Lipschitz constant works near zero, even though uniform continuity does. A Lipschitz function does have uniform continuity, choosing when its Lipschitz bound is positive; when it is a constant function.[ref]
Figure 2.
Square-root input changes share an output tolerance even though amplification near zero is unbounded
. At left, the exact output changes for base points stay inside whenever and . The right panel computes the amplification for inputs : it grows without bound as decreases. These are calculated function graphs, with no experimental measurements. Details.
For general metric spaces, replace the absolute values by the respective distance functions. The Heine-Cantor theorem gives an existence guarantee: every continuous function on a compact metric space is uniformly continuous. In particular, continuity on a finite closed interval provides a common tolerance, even when no simple formula for it is known.[ref]
For a short proof outline, fix . Continuity gives each point an open ball of radius within which outputs differ from by less than . The open balls of half these radii still cover the domain of a function. Compactness supplies a finite subcover. Take to be the smallest half-radius in this finite set. Two inputs closer than lie together in one of the original open balls, so the triangle inequality bounds their output distance by . The beautiful step is that the compact set turns local choices into finitely many choices, whose minimum stays positive.
A shared tolerance also makes uniformly continuous functions preserve Cauchy sequences: after choosing for , all sufficiently late input pairs are closer than , so all corresponding output pairs are closer than . Unlike a convergent sequence argument, this does not require an input limit inside the domain of a function. It is why uniform continuity is useful for extending a function toward missing endpoints and for the decay argument below.
Weierstrass approximation theorem Created 2026-09-24 Updated 2026-10-14
Every continuous real-valued function on a compact interval can be approximated by polynomials with arbitrarily small error everywhere on the interval. More precisely, if and is continuous, then for every there is a polynomial with
The error is measured in the supremum norm, so one approximation works at every point. The degenerate interval needs only a constant function. A change of variable reduces the nondegenerate case to .[ref]
This is useful because a polynomial is described by finitely many coefficients and can be evaluated with addition and multiplication. Its surprise is that the target need not be differentiable: the sharp corner of an absolute value function can be approximated by smooth polynomials. The Bernstein approximation of a corner below makes this visible. Approximating values, however, does not by itself approximate derivatives; Weierstrass approximation does not preserve derivatives gives a counterexample.
Weighted inner product Created 2026-10-05 Updated 2026-10-14
For a positive weight , the weighted inner product of functions is . It is the usual inner product in the L2 space for the measure . A Sturm-Liouville eigenfunction expansion uses this weight to make its eigenfunctions orthogonal.
The weight specifies how different locations contribute to a squared error: . More weight makes an error in that region more costly. The weighted Euclidean inner product makes the same choice for a finite list of coordinates.
For an explicit real-function example on , let and approximate by a constant function. The orthogonal projection onto a finite-dimensional subspace spanned by the function gives
The best unweighted constant is . Giving greater weight to larger moves the best constant upward, so a weighting choice changes the approximation even though the allowed family of functions is unchanged.
Wirtinger inequality Created 2026-09-24 Updated 2026-11-05
For an absolutely continuous function on with square-integrable derivative, , and , the endpoint form of Wirtinger's inequality is
Expanding in the sine eigenfunctions of the Dirichlet Laplacian proves the bound: every squared frequency is at least . Equality holds precisely for a multiple of . This identifies the optimal constant, rather than merely supplying some bound. Without the endpoint condition, a nonzero constant function would violate the inequality.