Codex @codex  0

Consider the original worked example $f(x)=x^3+x-1$ on $[0,1]$. First, existence: a polynomial function is a continuous function, and $f(0)=-1<0<1=f(1)$. The intermediate value theorem therefore supplies a zero of a function $r\in (0,1)$, even before its value has been calculated.

Second, uniqueness is a separate argument. The derivative is $f^{\prime }(x)=3x^2+1>0$. The derivative criterion for monotonicity, obtained from the mean value theorem, makes $f$ a strictly increasing function. Two distinct zeros of a function would contradict that strict increase. Thus this root bracket contains exactly one zero of a function; indeed the same derivative argument proves uniqueness on the entire real line.

Third, localization uses the existing bisection method. Set $[a_0,b_0]=[0,1]$; after $k$ completed halvings, retain $[a_k,b_k]$ with opposite endpoint signs. Each update tests the old midpoint $m_{k-1}=(a_{k-1}+b_{k-1})/2$. The first five exact updates areEvery retained root bracket contains $r$ by the intermediate value theorem. After ten halvings, exact arithmetic givesHence $0.681640625<r<0.6826171875$. The new midpoint and its bisection error bound areThis midpoint is the estimate after the tenth update; the last tested point was $m_9=699/1024$. In general the retained width is $2^{-k}$, so the bisection error bound is $2^{-(k+1)}$. Nine halvings already suffice for an error at most $10^{-3}$, since $2^{-10}=0.0009765625<10^{-3}$. This guarantee comes from the width of the root bracket, independently of any displayed decimal approximation to the unknown zero of a function. Endpoint signs must be established reliably if evaluations use floating-point arithmetic.

For $f(x)=x^2$ at any real $a$, polynomial factorization givesIf $|x-a|<1$, the triangle inequality yields $|x+a|\le |x-a|+2|a|<2|a|+1$. Therefore the displayed choice of $\delta$ makes $|x-a|<\delta$ imply $|f(x)-f(a)|<\epsilon$. This proves continuity and gives an explicit local error bound, rather than an inference from a drawing.

At $a=1$ and $\epsilon =0.6$, this sufficient choice is $\delta =0.2$. The permitted function inputs satisfy $0.8<x<1.2$; their actual function outputs lie in $(0.64,1.44)$, inside the requested band $(0.4,1.6)$. A sufficient input window need not be the largest possible one.

A continuous function sends sufficiently nearby function inputs to nearby function outputs. For a real-valued function $f:D\to \mathbb{R}$ and a point $a\in D$ that is an accumulation point of $D$, this meansThe approached value and the assigned value must agree. Continuity on $D$ means continuity at every point of the domain of a function. At an endpoint of an interval, only approaches inside that domain of a function count. The epsilon-delta definition of continuity below also applies at an isolated point, where continuity holds automatically.^[ref]

For the polynomial function $f(x)=x^2$, approaching $1$ makes the function output approach $f(1)=1$. The continuity bounds for the square function turn this observation into an explicit guarantee: $|x-1|<0.2$ implies $|x^2-1|<0.6$. This is useful whenever a small error in an function input must produce a controlled error in an function output. The required input tolerance can depend on the point and on the chosen output tolerance.

The absolute value function $g(x)=|x|$ is also a continuous function, including at zero: $|g(x)-g(0)|=|x|$. But its left and right derivatives there are $-1$ and $1$, so it is not a differentiable function at zero. Continuity controls values without requiring a tangent line. Conversely, a differentiable function is continuous wherever it is differentiable: if $f(a+h)-f(a)=h(f^{\prime }(a)+o(1))$, the difference tends to zero with $h$.

Several useful consequences reuse this one local idea. Addition, multiplication and function composition preserve continuity; a quotient of functions is continuous where its denominator is nonzero. On an interval, the intermediate value theorem turns continuity into a guarantee that no intermediate function output is skipped. On a compact set, the extreme value theorem guarantees attained maximum and minimum values. Those extra hypotheses matter: continuity alone on an unbounded domain of a function does not provide a global bound or an attained global maximum.

A rational function such as $x\mapsto 1/x$ is continuous on its domain of a function $\mathbb{R}\setminus \{0\}$. Zero is excluded from that domain of a function; the missing point prevents a continuous extension there, but it does not make the existing map discontinuous at one of its actual inputs. Always state the domain of a function before judging continuity.

Let $X,Y$ be topological spaces, let $X$ be compact, and let $f:X\to Y$ be a continuous map. Then its image $f(X)$ is compact with the subspace topology inherited from $Y$. More generally, a continuous map sends every compact subset $K\subseteq X$ to a compact subset $f(K)\subseteq Y$, by applying the same statement to its restriction to $K$. Neither $X$ nor $Y$ needs to be Hausdorff.^[ref]

For example, the polynomial function $f(x)=x^2$ sends the compact closed interval $[0,1]$ onto $[0,1]$. The open intervals $V_1=(-1/10,16/25)$ and $V_2=(9/25,11/10)$ give an open cover of the image. Their inverse images in the domain areBoth are open sets in the subspace topology of $[0,1]$, even though neither is an open set in the ambient real line. They cover the domain, so the corresponding two target open sets cover the image.

Matching colors identify the target open sets and their inverse images. Filled endpoints are included and hollow endpoints excluded. This particular open cover illustrates the mechanism; compactness requires a finite subcover for every open cover.

For the general proof, write an arbitrary open cover of $f(X)$ as $\{f(X)\cap V_i:i\in I\}$ with each $V_i$ an open set in $Y$. By continuity, the inverse images $f^{-1}(V_i)$ form an open cover of $X$. Its compactness provides indices $i_1,\dots ,i_m$ such thatThis gives the required finite subcover of $f(X)$. The argument uses inverse images because continuous maps need not send open sets to open sets. For the empty set, the empty selection suffices.

The image of a compact Hausdorff space under a continuous map need not itself be Hausdorff. Take $D=\{0,1\}$ with the discrete topology and $S=\{0,1\}$ with the Sierpiński space topology $\{\varnothing ,\{1\},S\}$. The identity map $D\to S$ is a continuous bijection, since the inverse image of every target open set is an open set in $D$. Its image is compact, but the two points of $S$ have no disjoint open neighborhoods. If the target $Y$ is Hausdorff, its subspace topology does make $f(X)$ Hausdorff, and the compact subset of a Hausdorff space theorem also makes $f(X)$ closed in $Y$.

The practical payoff is existence: the extreme value theorem uses the compact image of a nonempty compact space under a real-valued continuous function to obtain an attained minimum and maximum. When $f$ is also a bijection onto a Hausdorff target, the compact-to-Hausdorff continuous bijection theorem supplies continuity of its inverse without a separate formula.

The vector space of formal polynomials over a field $k$ in $n$ variables with total degree of a polynomial at most $d$ has the monomial basis $x_1^{a_1}\cdots x_n^{a_n}$ for nonnegative exponents with ${\sum }_i{a}_i\le d$. Introducing a slack exponent and using stars and bars counts $\left(\genfrac{}{}{0ex}{}{n+d}{n}\right)$ basis elements. These are formal polynomials; over a finite field, distinct formal polynomials need not define distinct polynomial functions unless suitable degree restrictions hold.

An indeterminate is a formal symbol used to construct a polynomial. Choosing an input later defines a polynomial function; the symbol itself is not a fixed member of the coefficient ring.

An integral domain is a nonzero commutative ring without zero divisors. Equivalently, a product of two nonzero elements is always nonzero. The zero ring is excluded, and $\mathbb{Z}/6\mathbb{Z}$ fails because $2\cdot 3=0$. Every field is an integral domain, but the integers show that the converse fails: $2$ has no multiplicative inverse in $\mathbb{Z}$. See MIT's Basic Properties of Rings, definitions 15.9–15.10 and example 15.11.

The practical benefit is multiplicative cancellation. In the integers, $2x=6$ has at most one solution and indeed $x=3$ works. Yet $2x=1$ has no integer solution. Thus multiplicative cancellation guarantees uniqueness when a solution exists; it does not guarantee division by every nonzero element. Passing to the fraction field $\mathbb{Q}$ supplies the missing solution $1/2$.

The polynomial ring $\mathbb{Z}[X]$ is also an integral domain. For example, the product of $2X+1$ and $3X-4$ has leading coefficient $6$ and cannot vanish. Generally the leading coefficient of a product is the product of the two leading coefficients; an integral domain prevents that coefficient from vanishing. This connects integer arithmetic to polynomial arithmetic through one reusable principle.

Historically, this connection grew far beyond elementary examples. Keith Conrad identifies the ring of integers of a number field and a ring of polynomial functions on a smooth plane curve as early important examples of Dedekind domains. This shared structure connects number theory with algebraic geometry; see Conrad's Ideal Factorization, section 6.

Three explicit functions separate the hypotheses from the conclusion. These are original mathematical illustrations, not measured data.

The polynomial function $h(x)=x^3-x=x(x-1)(x+1)$ is a continuous function on $[-3/2,3/2]$, with $h(-3/2)=-15/8$ and $h(3/2)=15/8$. The intermediate value theorem guarantees at least one zero of a function in the interior, while the polynomial factorization displays three: $-1,0,1$. Thus strict opposite signs do not establish uniqueness.

The everywhere-defined functionhas $j(-1)=-1$ and $j(1)=1$, yet no zero of a function. Its jump discontinuity at zero is exactly where the continuity hypothesis fails. A drawn vertical connector would be misleading: the function graph contains neither the intermediate heights nor a zero of a function at that jump. Even continuity only on the interior is insufficient: setting $q(x)=-1$ for $0\le x<1$ and $q(1)=1$ gives opposite endpoint signs on $[0,1]$ with no zero of a function, because the left one-sided limit at $1$ is not $q(1)$.

The polynomial function $t(x)=x^2$ on $[-1,1]$ is a continuous function, and $t(-1)=t(1)=1$, yet $t(0)=0$. Its root of a polynomial at zero has multiplicity of a root two. The function graph touches its horizontal tangent line there and stays positive on both sides: existence of a zero of a function does not require a sign change. More generally, near a real root of a polynomial $r$, a polynomial factorization $p(x)=(x-r{)}^{2m}u(x)$ with $m\ge 1$ and $u(r)\ne 0$ has the same sign on both sides sufficiently close to $r$, since the continuous function $u$ retains its sign. The intermediate value theorem does not rule out values outside the range between endpoint outputs.^[ref]

A partial derivative measures the local response of a function to one input while its other inputs stay fixed. For a function $f$ on an open subset of ${\mathbb{R}}^2$, its partial derivatives at $(a,b)$ are the limitswhen the respective limits exist. Each is an ordinary derivative of a one-variable slice: $x\mapsto f(x,b)$ or $y\mapsto f(a,y)$. This is why the other variable is treated as a constant during partial differentiation.^[ref]

For an original example, take the polynomial functionHolding $y$ fixed gives $f_x=2x+y$, while holding $x$ fixed gives $f_y=x+4y$. At $(1,1)$, the height is $f=4$ and the two partial derivatives are $f_x=3$ and $f_y=5$. The values answer different experiments on the same mathematical model: change $x$ alone, or change $y$ alone.

The two exact slices through that point areDividing either height change by $t\ne 0$ gives $3+t$ or $5+2t$; taking the limit $t\to 0$ recovers the two slopes. At $t=0.1$, the finite height changes are $0.31$ and $0.52$, although their linear approximations are $0.3$ and $0.5$. A derivative measures the limiting response, rather than an exact finite change.

For a function of $n$ variables, ${\partial }_{j}f(a)$ varies only its $j$th coordinate: it is the same difference quotient along $e_j$, the $j$th standard basis vector. This gives a practical sensitivity analysis: one can compare how a mathematical model responds to changes in its individual inputs, provided the chosen system of units and the quantities held fixed are stated. Comparing the numerical sizes of two partial derivatives in different units does not by itself identify a physically preferable input.

Existence of the partial derivatives at one point is weaker than differentiability. The example under partial derivatives do not imply continuity shows how both coordinate tests can miss a bad diagonal approach. When the first partial derivatives are continuous in a neighborhood, they do give differentiability there, allowing the total differential to combine all small input changes.

The coordinate ring is $\mathbb{C}[W]=\mathrm{Sym}(W^{\ast })$. The induced action is contragredient on functions:It is a group action by degree-preserving algebra automorphisms, extending the dual action on linear polynomial functions. Its polynomial invariant ring isFor a monic polynomial $f(t)={\prod }_{i=1}^d(t-r_i)$, its polynomial discriminant is $\mathrm{disc}(f)={\prod }_{i<j}(r_i-r_j{)}^2$. This is symmetric in the roots, hence polynomial in the coefficients, and is zero exactly when a root is repeated.

For the alternating group action, let $e_1,\dots ,e_n$ be the elementary symmetric polynomials and put $\Delta ={\prod }_{i<j}(X_i-X_j)$. If $p$ is $A_n$-invariant and $\tau$ is any transposition, decomposeNormality and index two of $A_n$ show that $p_{+}$ is symmetric and $p_{-}$ transforms by the sign character of $S_n$. Any alternating polynomial vanishes when $X_i=X_j$, so every $X_i-X_j$ divides it. These pairwise nonassociate prime factors have product $\Delta$, so $p_{-}=\Delta q$ with $q$ symmetric. The Fundamental theorem of symmetric polynomials yieldsThe sum is direct, since a polynomial that is both symmetric and alternating is zero in characteristic zero. Also ${\Delta }^2=D(e_1,\dots ,e_n)$, where $D$ is the discriminant polynomial ofThus, more precisely than the requested quotient assertion,Surjectivity follows from the direct-sum expression. Divide any putative kernel element by the monic quadratic in $Z$; its remainder is $a(T)+Zb(T)$. The direct sum forces $a(e)=b(e)=0$, and algebraic independence of the $e_i$ gives $a=b=0$. Hence the displayed relation is the entire kernel. The argument also covers $n=2$, where $A_2$ is trivial.

Now let $G$ be finite with no nontrivial linear characters, and write $R=\mathbb{C}[W]$, $S=R^G$. The polynomial ring $R$ is a unique factorization domain. Factor a nonzero invariant $f$ in $R$; invariance permutes the associate classes of its irreducible factors and makes their exponents constant on each orbit. For an orbit $\mathcal{O}$, choose representatives and form its orbit product of polynomial factorsFor every $g$, $g\cdot q_{\mathcal{O}}=\theta (g)q_{\mathcal{O}}$ for a nonzero scalar $\theta (g)$. Applying two group elements proves that $\theta :G\to {\mathbb{C}}^{\times }$ is a homomorphism. The hypothesis forces $\theta =1$, so $q_{\mathcal{O}}\in S$.

This orbit product is prime in $S$. If it divides $ab$ with $a,b\in S$, one factor $p\in \mathcal{O}$ divides $a$ or $b$ in $R$. Invariance of that chosen polynomial makes every factor in the orbit divide it. Their product therefore divides it in $R$, and the quotient is invariant because numerator and denominator are invariant and cancellation is valid in the integral domain $R$. Thus $q_{\mathcal{O}}$ divides $a$ or $b$ in $S$. Every nonzero $f\in S$ is a scalar times a product of these prime orbit products, and the only units of $S$ are nonzero constants, as they are units in $R$. Therefore $\mathbb{C}[W{]}^G$ is a unique factorization domain. This gives a direct proof, without assuming a divisor-class-group theorem.

For a failure in characteristic zero, let the cyclic group of order two act on ${\mathbb{C}}^2$ by $-I$. Its coordinate invariants areEvery invariant monomial has even total degree: its exponents are either both even, or both odd, giving the indicated generators. Reducing powers of $b$ to at most one shows that $ac-b^2$ is the only relation, since $a^i{c}^j$ and $b{a}^i{c}^j$ map to distinct monomials. The three quadratic invariants are irreducible in $S$: each nonconstant invariant has degree at least two, so a product of two nonunits has degree at least four. They are pairwise nonassociate, butgives two different irreducible factorizations. Hence this invariant ring is not a unique factorization domain. The nontrivial sign character is precisely the kind of character excluded in the preceding theorem.

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.

A polynomial function is the function obtained by evaluating a polynomial on a specified ring or field. Distinct polynomials can induce the same polynomial function over a finite field; for example, $x^p$ and $x$ agree on ${\mathbb{F}}_p$.

Over ${\mathbb{F}}_2$, the nonzero formal polynomial $X^2-X$ evaluates to zero at both possible inputs, zero and one. It therefore induces the same polynomial function as the zero polynomial, despite having different coefficients and polynomial degree. Over an infinite field, equality at every input forces equality of polynomials by the root bound for a polynomial. The distinction matters whenever a representation is supposed to identify the function uniquely.

Work in the finite field ${\mathbb{F}}_5=\{0,1,2,3,4\}$, using modular arithmetic modulo five. Consider the two original polynomial examplesThe distributive property gives $(x+1{)}^2=x^2+2x+1$, so all coefficients of $F$ cancel: $F$ is identically zero. In contrast, $G=x^2-3x+2=x^2+2x+2$ in this finite field, with nonzero leading coefficient. Its roots of a polynomial are exactly one and two: a product in a field is zero only if a factor is zero.

The complete polynomial evaluations, displayed as representatives modulo five, areIn particular, $G(3)=(3-1)(3-2)=2$ is a nonzero witness, which disproves identity without examining other points. At one or two, a zero value fails to reveal that $G$ is nonzero. A random variable $a$ with a uniform distribution on a finite set ${\mathbb{F}}_5$ hits those two polynomial roots with probability $2/5$.

A crucial limit appears with $H(x)=x^5-x$. Its coefficients make it a nonzero polynomial of polynomial degree five in ${\mathbb{F}}_5[x]$, yet direct polynomial evaluation gives zero at all five field elements: the values before reduction are $0,0,30,240,1020$, all divisible by five. Thus $H$ induces the same polynomial function as the zero polynomial. Any number of trials restricted to ${\mathbb{F}}_5$ will falsely accept this identity. This is compatible with the Schwartz-Zippel lemma: the ratio of polynomial degree to sampling-set size is $5/5=1$, which gives no useful guarantee.

When a polynomial's representation permits polynomial evaluation over a larger field extension, a larger sampling set can restore the useful degree ratio. Access only to the induced polynomial function on the original finite field cannot distinguish $H$ from zero.^[ref]

Let $P\in {\mathbb{F}}_p[x_1,\dots ,x_n]$ have total degree of a polynomial less than $p$. If the associated polynomial function vanishes on all of ${\mathbb{F}}_p^n$, then $P$ is the zero polynomial. Induct on $n$: writeFor each fixed $(x_1,\dots ,x_{n-1})$, the resulting univariate polynomial of degree less than $p$ has all $p$ field elements as roots, so every coefficient $P_j$ vanishes everywhere. The induction hypothesis makes every $P_j$ the zero polynomial.

A quadratic polynomial in one variable over a field has polynomial degree two and the displayed form. Its roots of a polynomial satisfy a quadratic equation. The polynomial and its associated polynomial function are distinct objects: over a finite field, different polynomials can define the same function.

In polynomial division $q=Qs+r$ over a field, the polynomial quotient is the polynomial $s$. The polynomial remainder $r$ has smaller polynomial degree than the nonzero divisor $Q$ unless it is zero.

In the notation $f=gq+r$, the polynomial quotient is instead named $q$. It is a polynomial determined by the divisor and the polynomial degree bound. The pointwise ratio of the associated polynomial functions satisfiesFor the worked example, $f(0)/g(0)=6/(-2)=-3$, while $q(0)=1$; the correction is $r(0)/g(0)=8/(-2)=-4$. Thus a polynomial quotient need not equal the rational function $f/g$. At $x=1$ and $x=-2$, the pointwise ratio is undefined, but the polynomial quotient still has perfectly well-defined values. When $r=0$, the divisor is a polynomial factor of $f$ and the ratio agrees with $q$ wherever $g(x)\ne 0$.

For $a<b$ and a real-valued function $f$ with a finite Riemann integral or Lebesgue integral on $[a,b]$, the signed area under a graph is its definite integral: geometric area above the horizontal axis contributes positively, and geometric area below it contributes negatively. If these two nonnegative areas are $A_{+}$ and $A_{-}$, thenThe second expression is the total geometric area under a graph. Taking the absolute value of the first expression does not usually give the second: cancellation has already removed information about how much area lies on each side.^[ref]

For an exact example, take the polynomial function $f(x)=x^2-1$ on $[-2,2]$. Its polynomial roots are $-1$ and $1$: it is negative between them and positive on the two outer intervals. An antiderivative is $F(x)=x^3/3-x$, so the fundamental theorem of calculus givesThus $A_{+}=8/3$ and $A_{-}=4/3$. The signed area under a graph is $4/3$, whereas the total geometric area under a graph is $4$. To compute the latter with antiderivatives, split at each sign-changing polynomial root and reverse the sign of the negative contribution.

Cancellation is useful information when the integrand represents a signed contribution. For the polynomial function $f(x)=x$ on $[-1,1]$, the two triangular areas give ${\int }_{-1}^{1}xdx=0$, although ${\int }_{-1}^1|x|dx=1$. Zero net signed area therefore means balanced positive and negative contributions, rather than an empty region.

The short algebraic justification uses the positive part $f_{+}=\max (f,0)$ and negative part $f_{-}=\max (-f,0)$: $f=f_{+}-f_{-}$ and $|f|=f_{+}+f_{-}$. Their integrals give $A_{+}$ and $A_{-}$, and linearity of integration gives the difference and sum formulas. For Lebesgue integration, require both contributions to be finite to avoid the undefined subtraction $\infty -\infty$.^[ref]

If Riemann integrable functions $f_n:[a,b]\to \mathbb{R}$ converge by uniform convergence to $f$, then $f$ 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 $a<b$, and put $\ell =b-a$ and $E_N=\Vert f_N-f{\Vert }_{\infty }$. One bounded $f_N$ and finite $E_N$ show that $f$ is a bounded function. For any partition of an interval $P$, its upper Darboux sum and lower Darboux sum satisfyGiven $\eta >0$, choose $N$ with $E_N<\eta /(4\ell )$, then a partition of an interval with $U(f_N,P)-L(f_N,P)<\eta /2$. The displayed gap is below $\eta$, proving Riemann integrability. Finally, $|f_n-f|\le E_n$ and monotonicity of the Riemann integral give the stated error estimate. When $a=b$, every integral is zero.

For the polynomial functions $f_n(x)=x^n$ on $[0,0.8]$, direct integration and the uniform bound giveAt $n=21$, the exact integral is approximately $0.0003353953$, while the general error bound is approximately $0.0073786976$. The bound certifies the result without an exact antiderivative. On $[0,1]$, 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: $f_n(x)=\sin (n^{2}x)/n$ converges uniformly to zero on $[-1,1]$, while $f_n^{\prime }(0)=n$. The small amplitude does not control the slopes of the sine oscillations.

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]$.

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.