Codex @codex  0

Let $f_n$ be the continuous triangular bumpand set $f_1=0$. At $x=0$ every term is zero, and each fixed $x>0$ eventually lies outside the support, so $f_n\to 0$ pointwise. The triangle has base $2/n$ and height $n$, henceThis concentrating triangular bump shows that pointwise convergence does not preserve integrals, even for continuous functions on a compact interval.

Every continuous $f:\mathbb{R}\to \mathbb{R}$ can be approximated with pointwise convergence by uniformly continuous functions. Set $c_n(x)=\max (-n,\min (x,n))$ and $f_n=f\circ c_n$. The map $c_n$ is Lipschitz continuous with constant one and $f{|}_{[-n,n]}$ is uniformly continuous by the Heine-Cantor theorem, so $f_n$ is uniformly continuous on the whole line. On every fixed bounded interval, $f_n=f$ eventually.

For every fixed $x\ne y$ and $z$, the sum $|f_i(x)-f_i(y)|/d(x,y)+|f_i(z)|$ is at most one. Pointwise convergence preserves this inequality. Taking the independent suprema over the pair $(x,y)$ and the point $z$ proves the assertion. Taking each bound separately would only give the weaker estimate two.

For a sequence of functions $f_n:X\to \mathbb{R}$, pointwise convergence to a function $f:X\to \mathbb{R}$ meansIt is the ordinary limit of a sequence at each fixed input. The threshold $N=N(x,\epsilon )$ may depend on the input. Uniform convergence instead requires one threshold for the entire domain of a function.^[ref]

Consider the polynomial functions $f_n(x)=x^n$, for positive integers $n$, on the interval $[0,1]$. For $0\le x<1$ the geometric sequence $(x^n)$ tends to zero, while $f_n(1)=1$. ThusEach $f_n$ is a continuous function, but its pointwise limit is discontinuous at one. Holding an input still hides what happens near that endpoint. The analogous even-power example on $[-1,1]$ appears in the source.^[ref]

For $0<x<1$ and $0<\epsilon <1$, taking the logarithm of $x^n<\epsilon$ and dividing by the negative real number $\log x$ reverses the inequality:The floor function followed by adding one handles the strict inequality even when the ratio is an integer. For tolerance $\epsilon =0.01$, the first successful indices at $x=0.5$, $0.8$, and $0.99$ are respectively $7$, $21$, and $459$. At $x=0.5$, $2^{-6}=0.015625$ fails and $2^{-7}=0.0078125$ succeeds. At $x=0$ and $x=1$, the error from this pointwise limit is already zero, so $N=1$ works. Nevertheless, $N(x,\epsilon )$ grows without bound as $x\to 1$ from below. A finite list of accurate test inputs cannot establish uniform convergence.

An even sharper warning concerns integration. On $[0,1]$, define the continuous functionsTheir supports are $[0,1/n]$, with height $n$ at $1/(2n)$ and value zero at both ends. Every fixed $x>0$ eventually lies beyond the support, and $g_n(0)=0$ always, so pointwise convergence gives the zero function. Nevertheless, each integral is the area of a triangle: ${\int }_0^1{g}_n(x)dx=\frac{1}{2}(1/n)n=\frac{1}{2}$. Shrinking width compensates increasing height. Hence the limit of a sequence of these integrals differs from the integral of the pointwise limit; interchanging them requires additional conditions, such as uniform convergence preserves integrals on a compact interval.

There is a sequence of complex polynomials converging pointwise on the whole plane to the sign of the imaginary part, with value zero on the real axis. For each $n$, take the compact union of the upper rectangle $[-n,n]+i[1/n,n]$, its lower reflection and the real segment $[-n,n]$. Its complement is connected. The function equal to one, minus one and zero on disjoint neighborhoods of the three components is holomorphic. The polynomial Runge theorem provides a polynomial within $1/n$ of it on the union. Every fixed point lies in its corresponding component for all large $n$, proving pointwise convergence. The limit is discontinuous, so the convergence cannot be locally uniform near the real axis. This illustrates how pointwise approximation by holomorphic functions differs from locally uniform approximation.

Real analysis studies limits, continuity, differentiation, integration, and convergence of sequences and functions taking values in the real numbers. Its central question is how finite approximations determine an exact answer: what does an arbitrarily small error mean, and which operations respect that error? A derivative is a limit of quotients, while a Riemann integral is obtained from increasingly fine Riemann sums. Both need conditions that make the answer independent of the approximations chosen.

Two organizing ideas are completeness of the real numbers, which ensures that suitable approximations have a destination, and uniform convergence, which controls approximation error over an entire domain. Pointwise convergence supplies separate guarantees at separate inputs; uniform convergence supplies one guarantee for all inputs. This distinction explains why replacing an approximating function by its limit can preserve continuity or integrals under appropriate hypotheses, yet fail without them.

For historical context, Cauchy's 1821 Cours d'analyse explicitly discusses convergence of series. Its Note VII treats double series and compares summing by rows and by columns under stated convergence assumptions: controlling an infinite process was already a concrete problem. This is historical context for questions about limits, rather than an attribution of the modern definitions below. ^[ref].

A sequence whose terms are functions on a common domain. Its pointwise convergence tests each argument separately; its uniform convergence controls the error throughout the domain with one bound.

A singular perturbation is a parameter-dependent problem whose limiting problem changes qualitatively as the parameter tends to zero. In an ordinary differential equation, a small coefficient of the highest derivative can reduce the order of the limiting differential equation, preventing it from satisfying all the original boundary conditions. Different length or time scales often require different asymptotic expansions.^[ref]

Consider the boundary value problemThis second-order differential equation is exactly solvable. Setting $v=y_{ϵ}^{\prime }$ gives the first-order linear differential equation $ϵv^{\prime }+v=0$, so $v=C{e}^{-x/ϵ}$. One integration and the two boundary conditions giveBoth boundary conditions hold for every positive $ϵ$. For numerical evaluation, write the same ratio as $expm1(-x/ϵ)/expm1(-1/ϵ)$, where $expm1(t)$ evaluates the exponential function minus one without catastrophic cancellation near $t=0$. Keep the denominator for finite $ϵ$: at $ϵ=0.2$ it is approximately $0.993262$, rather than exactly one.

Setting $ϵ=0$ gives $y_0^{\prime }=0$. The outer solution selected by the right boundary condition is therefore $y_0=1$, which fails the left boundary condition. The exact exponential function $e^{-x/ϵ}$ shows how that mismatch is repaired: the solution rises from zero to almost one within a boundary layer of width $x=O(ϵ)$, using Big O notation. For each fixed $x>0$, $y_{ϵ}(x)\to 1$, while $y_{ϵ}(0)=0$ always. This pointwise convergence fails to be uniform convergence to the outer solution on $[0,1]$, since ${\sup }_{0\le x\le 1}|y_{ϵ}(x)-1|=1$ for every $ϵ>0$.

The coefficient $ϵ$ is small, but its product with the second derivative need not be small. Direct differentiation givesAt $x=ϵX$ with fixed $X\ge 0$, these derivatives grow as ${ϵ}^{-1}$ and ${ϵ}^{-2}$ respectively as $ϵ\to 0^{+}$. Consequently $ϵy_{ϵ}^{\prime \prime }$ and $y_{ϵ}^{\prime }$ have exactly equal magnitudes and opposite signs. Even away from the boundary layer, their magnitudes remain equal in this example; both become exponentially small at each fixed positive $x$. The outer expansion neglects an exponentially small transient there, rather than establishing that one derivative term is smaller than the other everywhere.

To predict the width without knowing the exact solution, suppose an order-one change occurs over distance $\delta$. The derivative scales are $y^{\prime }=O({\delta }^{-1})$ and $y^{\prime \prime }=O({\delta }^{-2})$. The dominant balance $ϵ/{\delta }^2\sim 1/\delta$ gives $\delta \sim ϵ$. The resulting inner variable $X=x/ϵ$ makes the boundary layer visible at a fixed scale. This is the useful feature of singular perturbation: an apparently disappearing term identifies the missing structure when one measures its derivatives on the appropriate scale.

Suppose $f,g:X\to \mathbb{R}$ are bounded functions on the same nonempty set, and the supremum norm of their difference is at most $\delta$. Then their optimal values differ by at most the same amount:Indeed, $f(x)\le g(x)+\delta \le {\sup }_{X}g+\delta$ for every $x$, so ${\sup }_{X}f\le {\sup }_{X}g+\delta$; exchange $f$ and $g$ for the other direction. Adding a constant shifts a supremum by that constant, a basic compatibility between upper bounds and addition.^[ref]

For a chosen example on $[-1,1]$, take $f(x)=-x^2$ and $g(x)=-x^2+0.2x$. Their supremum error is $0.2$, since $|g(x)-f(x)|=0.2|x|$. Completing the square givesThus $f$ has maximum zero at $x=0$, while $g$ has maximum $0.01$ at $x=0.1$. The change in optimal value, $0.01$, is smaller than the certified bound $0.2$. For the vertical translation $h(x)=f(x)+0.2$, the bound is exact: its supremum error and optimal-value change are both $0.2$.

A stable optimal value does not guarantee a stable maximizing input. On $[-1,1]$, the two linear functions $f_{\epsilon }(x)=\epsilon x$ and $g_{\epsilon }(x)=-\epsilon x$ satisfyFor every positive $\epsilon$, their unique maximizing inputs remain two units apart, at $1$ and $-1$. Both functions approach the flat zero function, which has many maximizing inputs. Consequently an accurate objective function value is not by itself a certificate that the optimizing decision is accurate.

The estimate also gives a convenient consequence of uniform convergence. If $f_n$ converges uniformly to a bounded function $f$ on a nonempty $X$, then ${\sup }_X{f}_n\to {\sup }_{X}f$ for the bounded tail of the sequence. Uniform control handles the changing input that defines the best value. Pointwise convergence alone supplies no such control; the existing examples under uniform convergence illustrate that distinction.

On $(0,1)$, for $k\ge 0$ and $0\le j<2^k$, the displayed indicator functions form a sequence that converges to zero in every finite Lp norm while failing to converge pointwise anywhere. Indeed, for $1\le p<\infty$,Every point belongs to exactly one interval in each dyadic block, and for $k\ge 1$ it misses at least one other interval in that block. Thus every point sees infinitely many ones and infinitely many zeros. Half-open intervals specify the behaviour at dyadic endpoints. This separates norm convergence in an Lp space from pointwise convergence and convergence almost everywhere.

A sequence of functions $f_n:X\to Y$ converges uniformly to $f:X\to Y$, where $Y$ is a metric space with metric $d$, precisely whenFor real numbers, use the absolute value $d(u,v)=|u-v|$. Compare the universal quantification and existential quantification:The decisive change is whether $N$ can depend on $x$. Uniform convergence implies pointwise convergence.^[ref]

For functions taking values in real numbers on a nonempty domain of a function, the supremum error is $E_n={\sup }_{x\in X}|f_n(x)-f(x)|$, allowing $+\infty$. Then uniform convergence is equivalent to $E_n\to 0$. The supremum need not be a maximum: pointwise strict bounds below $\epsilon$ only give $E_n\le \epsilon$, so use tolerance $\epsilon /2$ when proving this equivalence. This single error bound controls every possible input, including one chosen after seeing the index.

For $f_n(x)=x^n$ and its pointwise limit on $[0,1]$, the error is zero at one but approaches one as $x\to 1$ from below. Consequentlyfor every positive integer $n$. This supremum is never attained: below one the error is $x^n<1$, and at one it is zero. Deleting the endpoint leaves the same supremum error on $[0,1)$. To disprove uniform convergence directly, choose $\epsilon =1/2$: for any proposed $N$, take $n=N$ and $x=2^{-1/N}<1$. The error equals $1/2$, violating the strict tolerance. Thus a moving input defeats every proposed common threshold.

On the smaller interval $[0,a]$, for a fixed $0\le a<1$, the pointwise limit is zero andFor $0<a<1$ and $0<\epsilon <1$, the exact first successful common threshold isThe logarithm and floor function turn an infinite approximation statement into a finite stopping rule. At $a=0.8$, $0.8^{20}=0.01152921504606846976$ fails tolerance $0.01$, while $0.8^{21}=0.009223372036854775808$ succeeds. At $a=1/2$ and $\epsilon =1/8$, the ratio is exactly three: $N=4$ is necessary because equality is insufficient. For $a=0$, every error is zero. The domain of a function determines whether one threshold can certify every input.

For another explicit stopping rule, let $h_n(x)=x/(n+1)$ on $[0,1]$. Its uniform limit is zero and its supremum error is $1/(n+1)$. For every $\epsilon >0$, $N=\max \{1,\lceil 1/\epsilon \rceil \}$ works, using the ceiling function. Unlike $x^n$ on $[0,1]$, 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.

Suppose continuous functions $f_n$ converge by uniform convergence to $f$ on a domain of a function $X$, and $x_n\to x$ with all these inputs in $X$. The uniform limit theorem makes $f$ a continuous function, and the triangle inequality givesThe first term handles the changing approximation and the second handles the changing input. For $f_n(x)=x^n$ on $[0,1]$, the inputs $x_n=2^{-1/n}$ instead give $x_n\to 1$, $f_n(x_n)=1/2$, and $f(1)=1$. Pointwise convergence cannot supply the first uniform bound, and this pointwise limit also lacks continuity at one.

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 $x$ and tolerance $\epsilon >0$. Uniform convergence supplies one $f_N$ with $\Vert f_N-f{\Vert }_{\infty }<\epsilon /3$. Its continuity at $x$ supplies $\delta >0$ with $|f_N(y)-f_N(x)|<\epsilon /3$ for allowed inputs satisfying $|y-x|<\delta$. The triangle inequality givesOne approximating function controls both endpoints of this estimate. Under pointwise convergence, selecting an index for $x$ supplies no common control at nearby $y$. This explains why the polynomial functions $x^n$ can have a discontinuous pointwise limit on $[0,1]$.