Polynomially approximable resolvent point Created 2026-10-03 Updated 2026-10-06
For a closed set , a point is a polynomially approximable resolvent point when is a uniform limit on of complex polynomials.
Uniform Cauchy criterion 2026-10-25
A sequence of functions has a uniform limit if and only if, for every , there is such that for every and every . Necessity follows from the triangle inequality. For sufficiency, completeness of the real numbers first gives a pointwise limit . Letting in the bound with tolerance gives uniformly in . The same proof works for a complete metric space as codomain; completeness is essential.
Uniform closure of a function algebra Created 2026-10-14 Updated 2026-11-05
For an algebra on a compact Hausdorff space , with or , its uniform closure consists of the uniform limits of sequences from . It is a closed algebra in the supremum norm, since uniformly convergent sequences are uniformly bounded andFor a real algebra containing the constants and separating points, the Stone-Weierstrass theorem makes this closure all of . For a complex algebra, closure under complex conjugation is additionally sufficient; separation and constants alone are not enough.[ref]
Basic Analysis: Introduction to Real Analysis, Volume II by Jiří Lebl. section11.7, Theorem11.7.16, complex Stone–Weierstrass
For example, complex polynomials in on the closed unit disk contain constants and separate points, but their uniform closure is the disk algebra, not all continuous functions on that disk. They cannot approximate uniformly: uniform limits of these holomorphic functions are holomorphic in the interior, while is not.
Uniform convergence Created 2026-09-24 Updated 2026-10-14
A sequence of functions converges uniformly to , where is a metric space with metric , precisely whenFor real numbers, use the absolute value . Compare the universal quantification and existential quantification:The decisive change is whether can depend on . Uniform convergence implies pointwise convergence.[ref]
6.1 Pointwise and uniform convergence. Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl, §6.1.2, Definition 6.1.6 and Proposition 6.1.7
For functions taking values in real numbers on a nonempty domain of a function, the supremum error is , allowing . Then uniform convergence is equivalent to . The supremum need not be a maximum: pointwise strict bounds below only give , so use tolerance when proving this equivalence. This single error bound controls every possible input, including one chosen after seeing the index.
For and its pointwise limit on , the error is zero at one but approaches one as from below. Consequentlyfor every positive integer . This supremum is never attained: below one the error is , and at one it is zero. Deleting the endpoint leaves the same supremum error on . To disprove uniform convergence directly, choose : for any proposed , take and . The error equals , violating the strict tolerance. Thus a moving input defeats every proposed common threshold.
On the smaller interval , for a fixed , the pointwise limit is zero andFor and , the exact first successful common threshold isThe logarithm and floor function turn an infinite approximation statement into a finite stopping rule. At , fails tolerance , while succeeds. At and , the ratio is exactly three: is necessary because equality is insufficient. For , every error is zero. The domain of a function determines whether one threshold can certify every input.
For another explicit stopping rule, let on . Its uniform limit is zero and its supremum error is . For every , works, using the ceiling function. Unlike on , it controls even the endpoint.
The practical beauty of uniform convergence is that one quantitative bound can survive further operations: the uniform limit theorem preserves continuity, and uniform convergence preserves integrals on a compact interval controls accumulated error. Differentiation needs additional hypotheses, such as uniform derivative convergence with an anchored value. These results distinguish an approximation that looks accurate at selected inputs from one that justifies replacing a whole function in a calculation.
If Riemann integrable functions converge by uniform convergence to , then is Riemann integrable andThis concerns one fixed compact interval, with finite length.[ref]
Here is a proof outline that also establishes Riemann integrability of the uniform limit. Assume , and put and . One bounded and finite show that is a bounded function. For any partition of an interval , its upper Darboux sum and lower Darboux sum satisfyGiven , choose with , then a partition of an interval with . The displayed gap is below , proving Riemann integrability. Finally, and monotonicity of the Riemann integral give the stated error estimate. When , every integral is zero.
For the polynomial functions on , direct integration and the uniform bound giveAt , the exact integral is approximately , while the general error bound is approximately . The bound certifies the result without an exact antiderivative. On , these same integrals still tend to zero, although there is no uniform convergence: sufficient conditions need not be necessary. On an unbounded interval, even uniform convergence can fail to control total area, as uniformly vanishing functions can retain a nonzero integral shows.
Uniform convergence alone also fails to preserve derivatives: converges uniformly to zero on , while . The small amplitude does not control the slopes of the sine oscillations.
Uniform derivative convergence with an anchored value Created 2026-10-07 Updated 2026-10-14
Let be continuously differentiable functions on an interval . If by uniform convergence on and at one fixed , then converge locally uniformly to a continuously differentiable function with . If is bounded, the convergence is uniform on all of .[ref]
6.2 Interchange of limits. Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl, §6.2.3, Theorem 6.2.10 and the unbounded-interval observation following its proof
The anchor fixes the additive constant that a derivative cannot see. By the fundamental theorem of calculus, defineThe uniform limit theorem makes a continuous function, so the fundamental theorem of calculus gives . The displayed estimate proves uniform convergence wherever has a common finite bound, and therefore proves locally uniform convergence on any interval.
For example, on take . Its derivative is , with supremum error from , and . The reconstructed uniform limit is ; the exact supremum error is , equal to the bound above. Without an anchor, the constant functions have zero derivatives but no finite pointwise limit. On the real line, has convergent anchored values and uniformly convergent derivatives, but its supremum error from zero is infinite. The bounded-distance condition has a real role.
Uniform limit Created 2026-09-24 Updated 2026-11-05
A function is the uniform limit of a sequence of functions whenEquivalently the supremum error tends to zero. The same index works for all inputs, including inputs chosen differently for each . A uniform limit of continuous functions is continuous, by approximating both endpoint values with one common approximant.
For on , , the zero function is a uniform limit because the supremum error is . On , the pointwise limit instead equals zero below one and one at one. Its supremum error remains one for every , so there is no uniform limit there. The open supremum below the endpoint need not be attained to obstruct uniform convergence.
Uniform limit theorem Created 2026-09-29 Updated 2026-10-14
A uniform limit of continuous functions is a continuous function. No compactness assumption on the domain of a function is required.[ref]
For a proof, fix an input and tolerance . Uniform convergence supplies one with . Its continuity at supplies with for allowed inputs satisfying . The triangle inequality givesOne approximating function controls both endpoints of this estimate. Under pointwise convergence, selecting an index for supplies no common control at nearby . This explains why the polynomial functions can have a discontinuous pointwise limit on .
