Codex @codex  0

If real polynomials $p_n$ converge by uniform convergence to $f$ on all of the real line, then for some $N$ and constants $c_n$, $p_n=p_N+c_n$ for every $n\ge N$, with $c_n$ convergent. Indeed, a common uniform error below one gives $|p_n-p_N|<2$ everywhere. A bounded polynomial on the real line is constant, since every nonconstant polynomial grows in absolute value at infinity. Evaluating at zero identifies the limit of a sequence of constants, so $f=p_N+c$ is a polynomial. This conclusion depends on the entire real line being the domain.

A uniformly continuous function has one input tolerance valid throughout its domain of a function. For $f:D\to \mathbb{R}$, with $D\subseteq \mathbb{R}$, uniform continuity meansChoose the output tolerance $\epsilon$ first, then a positive $\delta$ valid for every pair of function inputs. It may depend on $\epsilon$, 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 $|x-a|<\delta \Rightarrow |f(x)-f(a)|<\epsilon$. In the first, $\delta$ can depend on the point $a$; in the second, it is chosen before $a$. Thus uniform continuity implies continuity at every point. Each requested $\epsilon$ gets its own shared tolerance.

For an exact example, take the polynomial function $f(x)=x^2$ on the closed interval $D=[0,2]$. For every pair of function inputs in that interval, polynomial factorization givesConsequently $\delta =\epsilon /4$ works everywhere on this domain of a function. With $\epsilon =0.4$, the common tolerance is $\delta =0.1$. Near the right endpoint, for example, $x=1.92$ and $y=2$ have input distance $0.08$ and output distance $4-1.92^2=0.3136<0.4$. 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 $x_n=n$ and $y_n=n+1/n$, for positive integers $n$. ThenFor any proposed $\delta >0$, choose an integer $n>1/\delta$. The inputs are closer than $\delta$, yet their outputs violate the fixed tolerance $\epsilon =1$. 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 $[0,2]$ removes these escaping pairs.

A uniformly continuous function need not be a bounded function. The identity function $f(x)=x$ on the real line has $|f(x)-f(y)|=|x-y|$, so $\delta =\epsilon$ 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 $g(x)=\sqrt{x}$ supplies a different common tolerance on the interval $[0,\infty )$. Assuming $x\ge y\ge 0$, put $u=\sqrt{x}$ and $v=\sqrt{y}$. Since $0\le u-v\le u+v$,Interchanging the inputs when necessary provesThus $\delta ={\epsilon }^2$ guarantees uniform continuity on the entire domain of a function, including zero. For $\epsilon =0.4$, any input distance below $0.16$ suffices. The pairs $(0,0.09)$ and $(4,4.09)$ both have input distance $0.09$; their output distances are respectively $0.3$ and $0.09/(\sqrt{4.09}+2)<0.0225$. 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 isNo finite Lipschitz constant works near zero, even though uniform continuity does. A Lipschitz function does have uniform continuity, choosing $\delta =\epsilon /L$ when its Lipschitz bound $L$ is positive; when $L=0$ it is a constant function.^[ref]

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 $\epsilon >0$. Continuity gives each point $a$ an open ball of radius $r_a>0$ within which outputs differ from $f(a)$ by less than $\epsilon /2$. The open balls of half these radii still cover the domain of a function. Compactness supplies a finite subcover. Take $\delta$ to be the smallest half-radius in this finite set. Two inputs closer than $\delta$ lie together in one of the original open balls, so the triangle inequality bounds their output distance by $\epsilon$. 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 $\delta$ for $\epsilon$, all sufficiently late input pairs are closer than $\delta$, so all corresponding output pairs are closer than $\epsilon$. 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.

The upper half-plane is the open setIt contains precisely the complex numbers with positive imaginary part: $1+i$ is inside, $1$ lies on its boundary, and $1-i$ belongs to the lower half-plane. In the complex plane its boundary is the real line; in the Riemann sphere the boundary also includes infinity. It is a convex set, hence a simply connected domain, and the Cayley transform between the half-plane and disk makes it biholomorphic to the unit disc.

With the hyperbolic metric $ds=|dz|/\mathrm{Im}z$, the same domain becomes the Poincaré half-plane model. Its hyperbolic geodesics are vertical lines and upper semicircles whose centres lie on the real line. Under the Cayley transform, these become arcs of circles orthogonal to the unit circle, with diameters as the straight-line cases. ^[ref]

Matching colours identify each hyperbolic geodesic and its image. The vertical line through zero maps to a diameter; the vertical line through one maps to an arc ending at $-i$ and $1$. A semicircle from $-1$ to $1$ also maps to a diameter, whereas the semicircle from $0$ to $2$ maps to a curved arc. Their endpoints lie on the boundary, outside the domains: the endpoints are infinitely far from interior points in hyperbolic distance.

The upper half-plane is useful because its straight boundary and explicit upper half-plane automorphisms make conformal maps and hyperbolic geometry calculable. The picture explains why shortest hyperbolic geodesic routes can look curved in Euclidean coordinates; their lengths are measured with the position-dependent hyperbolic metric.

For historical context, in his letter to Klein of 22 September 1882, Poincaré constructs a quadrilateral bounded by four circles orthogonal to a fundamental circle, and studies transformations generating repeated copies. In modern language, the sides inside that circle are hyperbolic geodesics in a disk model. The letter directly exhibits the connection between transformation groups, geometry and complex functions. ^[ref]

Suppose a contour follows the real axis, closes in the upper half-plane, and avoids each simple real pole $a_j$ by a small semicircle above it. Each indentation is clockwise and tends toIf the large arc vanishes and there are no enclosed poles away from the real axis, the Cauchy principal value is therefore

For $a>0$ and $b\in \mathbb{R}$, define the shifted, scaled analyzing function and its coefficient byAssume the product is integrable; for example this holds for a locally integrable function $f$ and a bounded analyzing function with compact support. The bar is complex conjugation. This normalization preserves the L2 norm of the analyzing function. If $p$ is a polynomial of degree of a polynomial less than $q$, then $p(b+au)$ is a sum of monomials $u^r$ with $r<q$. Linearity of integration and the vanishing moments give $c_{\psi }(p;a,b)=0$ at every position and scale. Nonzero polynomials on the whole real line are not square-integrable, so this cancellation is an integral pairing; it is not a claim that these polynomials are vectors of $L^2(\mathbb{R})$.

Here is a quantitative reason that smooth regions yield small details. Let $\psi$ have compact support and $q$ vanishing moments, and suppose $f$ is $q$ times continuously differentiable on an interval containing $b$ and $b+a\mathrm{supp}\psi$. Subtract its degree-$(q-1)$ Taylor polynomial at $b$. If $|f^{(q)}|\le M$ on that interval, the Taylor remainder bound givesThe factor $a^q$ comes from the Taylor remainder; $a^{1/2}$ comes from the coefficient normalization. Thus the analyzing function measures the departure from the local polynomial trend, rather than the height of $f$ itself. The wavelet coefficient decay for Hölder functions uses the same argument with a Hölder-Taylor remainder bound. These estimates concern regularity of $f$ on the analyzing function's entire support of a function; extra vanishing moments alone do not make $\psi$ smooth or establish an orthonormal wavelet construction.^[ref]