From Approximation to Extension
Suppose \(A\) is a closed subset of a normal space \(X\), and \(f:A\to\mathbb{R}\) is bounded and continuous. A useful way to construct an extension is to approximate \(f\) on \(A\) by a continuous function on all of \(X\), then approximate the remaining error, and repeat. If each new error is a fixed fraction of the previous one, the continuous functions produced at the successive stages form a geometrically controlled series.
Here, normal means that \(X\) is \(T_1\) and any two disjoint closed subsets of \(X\) have disjoint open neighborhoods. We use the bounded approximation lemma from the earlier material on Tietze extension. We state its quantitative form explicitly, since the constants determine the convergence argument.
The lemma controls two different quantities: the size of each new function on the whole space, and the error it leaves on \(A\). The error factor \(2/3\) is less than \(1\), so repeated applications make the residuals tend uniformly to zero. Meanwhile the bounds \(L/3\) on the terms make their sum converge.
The Geometric-Series Construction
Proof. If \(A=\varnothing\), take \(F=0\). If \(A\ne\varnothing\) and \(M=0\), then \(|f(a)|\leq 0\) implies \(f(a)=0\) for every \(a\in A\), so again \(F=0\) works. Assume now \(A\ne\varnothing\) and \(M>0\). Put \(q=2/3\), and start with the residual \(r_0=f\), which satisfies \(|r_0(a)|\leq M\).
We define continuous functions \(g_n:X\to\mathbb{R}\) and residuals \(r_n:A\to\mathbb{R}\) successively. If \(r_n\) is continuous and \(|r_n(a)|\leq Mq^n\) on \(A\), apply the bounded approximation lemma with \(L=Mq^n\). It gives \(g_n\) with
Define \(r_{n+1}=r_n-g_n|_A\). This is continuous on \(A\), and the displayed estimate gives \(|r_{n+1}(a)|\leq Mq^{n+1}\). Since this bound holds for \(r_0\) and the construction preserves it at every step, it holds for all \(n\geq 0\).
Consider the partial sums \(S_N=\sum_{n=0}^{N}g_n\). For integers \(m>N\) and every \(x\in X\), the triangle inequality and the bounds on the terms give
For the last inequality, the infinite geometric tail is \(\sum_{n=N+1}^{\infty}q^n=q^{N+1}/(1-q)=3q^{N+1}\), because \(q=2/3\). As \(Mq^{N+1}\to 0\), the partial sums are uniformly Cauchy on \(X\). For each \(x\), \((S_N(x))\) is therefore a Cauchy sequence of real numbers and has a limit. Define \(F(x)=\lim_{N\to\infty}S_N(x)\). The same tail bound, passed to the limit in \(m\), gives \(|F(x)-S_N(x)|\leq Mq^{N+1}\) for every \(x\). Thus \(S_N\to F\) uniformly on \(X\).
Each \(S_N\) is continuous because it is a finite sum of continuous functions. To verify continuity of \(F\), fix \(x_0\in X\) and \(\varepsilon>0\). Choose \(N\) so that \(|F(x)-S_N(x)|<\varepsilon/3\) for every \(x\in X\). By continuity of \(S_N\) at \(x_0\), there is an open neighborhood \(U\) of \(x_0\) such that \(|S_N(x)-S_N(x_0)|<\varepsilon/3\) for \(x\in U\). For each such \(x\),
Therefore \(F\) is continuous. Finally, the definition of the residuals gives \(f-S_N|_A=r_{N+1}\). Hence, for every \(a\in A\),
Since \(S_N(a)\to F(a)\), it follows that \(F(a)=f(a)\). Thus \(F|_A=f\), as required. \(\square\)
Following the Construction in Examples
Worked Example: Extending One Prescribed Value
Let \(X=\mathbb{R}\) with its standard topology, \(A=\{0\}\), and \(f(0)=1\). Define \(\psi(x)=\max(1-|x|,0)\). This is continuous, takes values between \(0\) and \(1\), and has \(\psi(0)=1\). The following explicit terms illustrate the geometric-series method:
At each step, \(|g_n(x)|\leq \frac{1}{3}(2/3)^n\), and at the prescribed point \(g_n(0)=\frac{1}{3}(2/3)^n\). After the first term, the residual at \(0\) is \(1-1/3=2/3\). After the second, it is \(2/3-2/9=4/9=(2/3)^2\). In general, the partial sum through \(n=N\) is
Indeed, multiplying the finite geometric sum by \(1-2/3=1/3\) gives \(1-(2/3)^{N+1}\). At \(x=0\), the residual is exactly \((2/3)^{N+1}\), which tends to zero. The series therefore sums to \(\psi\), a continuous extension of \(f\). Check: \(\psi(0)=\max(1-0,0)=1=f(0)\).
Worked Example: Two Prescribed Values
Again use the standard topology on \(X=\mathbb{R}\). Let \(A=\{-1,1\}\), with \(f(-1)=1\) and \(f(1)=-1\). Define \(\psi_-(x)=\max(1-|x+1|,0)\) and \(\psi_+(x)=\max(1-|x-1|,0)\), and put \(\phi=\psi_- -\psi_+\). Both tents are continuous. Their nonzero regions do not overlap: \(\psi_-(x)>0\) requires \(-2<x<0\), while \(\psi_+(x)>0\) requires \(0<x<2\). Thus \(|\phi(x)|\leq 1\) everywhere. Also \(\phi(-1)=1\) and \(\phi(1)=-1\).
For \(M=1\), take \(g_n=(1/3)(2/3)^n\phi\). On \(A\), the first term has values \(1/3\) and \(-1/3\), leaving residual values \(2/3\) and \(-2/3\). After \(N+1\) terms, the partial sum is \((1-(2/3)^{N+1})\phi\), so the residual values are \((2/3)^{N+1}\) at \(-1\) and \(-(2/3)^{N+1}\) at \(1\). Both tend to zero. The sum is \(\phi\), which extends \(f\). Check: substituting \(x=-1\) gives \(\phi(-1)=1\), and substituting \(x=1\) gives \(\phi(1)=-1\), exactly the two prescribed values.
Worked Example: Extending a Function on an Interval
Let \(X=\mathbb{R}\), \(A=[-1,1]\), and \(f(x)=x/2\) for \(x\in A\). This is continuous and satisfies \(|f(x)|\leq 1/2\), so take \(M=1/2\). Define a continuous function on \(X\) by
The formulas agree at the joining points: at \(-1\), both give \(-1/2\), and at \(1\), both give \(1/2\). Thus \(\Phi\) is continuous, and \(|\Phi(x)|\leq 1/2\). Choose the geometric terms \(g_n=(1/3)(2/3)^n\Phi\). The first three coefficients are \(1/3\), \(2/9\), and \(4/27\). Their sum is \(9/27+6/27+4/27=19/27\), so the partial sum through \(n=2\) is \((19/27)\Phi\), leaving residual \((8/27)\Phi\). At \(x=1\), for example, the partial sum is \((19/27)(1/2)=19/54\) and the residual is \((8/27)(1/2)=4/27\); their sum is \(19/54+8/54=1/2=f(1)\).
In general the partial sum through \(N\) is \((1-(2/3)^{N+1})\Phi\), and its residual on \(A\) is \((2/3)^{N+1}\Phi\), whose absolute value is at most \((1/2)(2/3)^{N+1}\). The terms therefore sum uniformly to \(\Phi\), and on \(A\) the sum is \(x/2\). Check: for \(-1\leq x\leq 1\), the middle formula gives \(\Phi(x)=x/2=f(x)\).
Why the Geometric Bounds Matter
The construction works because a single bound controls every point of \(A\) at every stage. The residual estimate is uniform: \(|r_n(a)|\leq M(2/3)^n\) for all \(a\in A\). It follows both that the series of functions converges uniformly on \(X\) and that its sum agrees with \(f\) uniformly on \(A\). These are separate uses of geometric decay: one controls the tails of the series on \(X\), and the other controls the error on the subset.
Common pitfall. Do not confuse the error ratio \(2/3\) with the term bound \(1/3\). When \(M=3\), the successive uniform bounds on the terms are \(1\), \(2/3\), \(4/9\), and so on. Their total bound is \(1/(1-2/3)=3\), not \(1/(1-1/3)\). The latter incorrectly treats \(1/3\) as the ratio between successive terms. The factor \(1/3\) is the initial term-size factor; the ratio is \(2/3\).
Another error is to assert continuity from pointwise convergence alone. For example, on \([0,1]\) with the subspace topology from \(\mathbb{R}\), each function \(u_n(x)=x^n\) is continuous. Its pointwise limit is \(0\) for \(0\leq x<1\) and \(1\) at \(x=1\), which is not continuous. The extension construction avoids this failure by proving a single tail bound valid at every \(x\in X\), and hence uniform convergence.
Check Your Understanding
Use the residual bounds and the uniform convergence argument to answer the following.
- If the initial bound is \(M=6\), what bound does the approximation lemma give for the first term, and what bound does it give for the first residual?
- For general \(M>0\), verify that the tail bound after the partial sum \(S_N\) is \(M(2/3)^{N+1}\).
- Why does the proof treat \(M=0\) separately?
- On \(A=\{0\}\subseteq\mathbb{R}\), use the tent function \(\psi(x)=\max(1-|x|,0)\) to write the first two terms extending \(f(0)=2\), taking \(M=2\).
- Explain why uniform convergence is used both to prove continuity of the sum and to verify that the sum restricts to \(f\).