Math 2.0

General topology Proof

Proof of the Tietze extension theorem by successive approximation

Builds on Normal spaceUrysohn's lemmaContinuous map of topological spacesRestriction of a functionClosed setSubspace topologyTopological spaceOpen sets of a metric spaceOpen balls are openContinuity via closed setsInclusion of a subspace is continuousComposition of continuous maps is continuousReverse triangle inequalityQuotient of continuous functions is continuousEpsilon-delta definition of continuitySum of a finite geometric seriesCompleteness of the real numbersLimits preserve non-strict inequalities

Proof

We first treat bounded ff by a series of Urysohn functions, then reduce the general case to it.

  1. Notation: XX is a normal space, A⊆XA \subseteq X is closed, and AA has the subspace topology. "Continuous" means continuous as a map of topological spaces.
  2. Criterion (C). Let ZZ be a topological space and h ⁣:Z→ℝh \colon Z \to \mathbb{R}. Then hh is continuous if and only if for each z0∈Zz_0 \in Z and ε>0\varepsilon > 0 there is an open W∋z0W \ni z_0 with ∣h(z)−h(z0)∣<ε|h(z) - h(z_0)| < \varepsilon for all z∈Wz \in W.
  3. Proof of (C). If hh is continuous, take W=h−1((h(z0)−ε,h(z0)+ε))W = h^{-1}((h(z_0) - \varepsilon, h(z_0) + \varepsilon)), the preimage of an open ball.
  4. Conversely, let V⊆ℝV \subseteq \mathbb{R} be open and z0∈h−1(V)z_0 \in h^{-1}(V). By the ball criterion, some (h(z0)−ε,h(z0)+ε)(h(z_0) - \varepsilon, h(z_0) + \varepsilon) lies in VV. The set WW for this ε\varepsilon lies in h−1(V)h^{-1}(V).
  5. So h−1(V)h^{-1}(V) is a union of open sets, hence open by the axioms of a topology.
  6. By (C), if g,h ⁣:Z→ℝg, h \colon Z \to \mathbb{R} are continuous, then g+hg + h and g−hg - h are continuous. Given ε\varepsilon, intersect the two sets WW for ε/2\varepsilon / 2.
  7. The restriction to AA of a continuous g ⁣:X→ℝg \colon X \to \mathbb{R} is continuous. It is g∘ιg \circ \iota with ι\iota the inclusion, and compositions are continuous.
  8. If B⊆AB \subseteq A is closed in AA, then BB is closed in XX. Indeed A∖B=A∩UA \setminus B = A \cap U with UU open in XX, so X∖B=(X∖A)∪UX \setminus B = (X \setminus A) \cup U is open.
  9. Lemma. Let r>0r > 0 and let h ⁣:A→ℝh \colon A \to \mathbb{R} be continuous with ∣h∣≤r|h| \le r on AA. Then there is a continuous g ⁣:X→[−r/3,r/3]g \colon X \to [-r/3, r/3] with ∣h−g∣≤2r/3|h - g| \le 2r/3 on AA.
  10. Proof of the lemma. Let B=h−1([−r,−r/3])B = h^{-1}([-r, -r/3]) and D=h−1([r/3,r])D = h^{-1}([r/3, r]). They are closed in AA by continuity via closed sets, so closed in XX by step 8. They are disjoint.
  11. By Urysohn's lemma there is a continuous u ⁣:X→[0,1]u \colon X \to [0, 1] with u=0u = 0 on BB and u=1u = 1 on DD. Let g=(r/3)(2u−1)g = (r/3)(2u - 1), which is continuous by (C) and takes values in [−r/3,r/3][-r/3, r/3].
  12. On BB: g=−r/3g = -r/3 and h∈[−r,−r/3]h \in [-r, -r/3], so ∣h−g∣≤2r/3|h - g| \le 2r/3. On DD: g=r/3g = r/3 and h∈[r/3,r]h \in [r/3, r], so ∣h−g∣≤2r/3|h - g| \le 2r/3.
  13. On A∖(B∪D)A \setminus (B \cup D): ∣h∣<r/3|h| < r/3 and ∣g∣≤r/3|g| \le r/3, so ∣h−g∣<2r/3|h - g| < 2r/3. This proves the lemma.
  14. Bounded case. Let ∣f∣≤M|f| \le M on AA. If M=0M = 0, then f=0f = 0 and F=0F = 0 works. Let M>0M > 0.
  15. We build continuous g0,g1,… ⁣:X→ℝg_0, g_1, \ldots \colon X \to \mathbb{R} with ∣gn∣≤M3(23)n|g_n| \le \tfrac{M}{3}(\tfrac{2}{3})^n on XX and ∣f−sn∣≤M(23)n+1|f - s_n| \le M(\tfrac{2}{3})^{n+1} on AA. Here sn=g0+⋯+gns_n = g_0 + \cdots + g_n.
  16. The lemma with h=fh = f and r=Mr = M gives g0g_0. Given g0,…,gng_0, \ldots, g_n, the function f−sn∣Af - s_n|_A is continuous on AA by steps 6 and 7. Apply the lemma to it with r=M(23)n+1r = M(\tfrac{2}{3})^{n+1} to get gn+1g_{n+1}.
  17. Then ∣gn+1∣≤M3(23)n+1|g_{n+1}| \le \tfrac{M}{3}(\tfrac{2}{3})^{n+1}, and ∣f−sn+1∣=∣(f−sn)−gn+1∣≤M(23)n+2|f - s_{n+1}| = |(f - s_n) - g_{n+1}| \le M(\tfrac{2}{3})^{n+2} on AA.
  18. Fix x∈Xx \in X. For m>nm > n, ∣sm(x)−sn(x)∣≤∑k=n+1mM3(23)k<M(23)n+1|s_m(x) - s_n(x)| \le \sum_{k = n+1}^{m} \tfrac{M}{3}(\tfrac{2}{3})^k < M(\tfrac{2}{3})^{n+1}, by the finite geometric sum. So (sn(x))(s_n(x)) is Cauchy, and it has a limit F(x)F(x) by the completeness of the real numbers.
  19. Letting m→∞m \to \infty and using that limits preserve non-strict inequalities gives ∣F(x)−sn(x)∣≤M(23)n+1|F(x) - s_n(x)| \le M(\tfrac{2}{3})^{n+1} for all x∈Xx \in X and all nn.
  20. Also ∣sn(x)∣≤∑k=0nM3(23)k<M|s_n(x)| \le \sum_{k=0}^{n} \tfrac{M}{3}(\tfrac{2}{3})^k < M, so ∣F(x)∣≤M|F(x)| \le M for all x∈Xx \in X.
  21. For a∈Aa \in A, ∣f(a)−F(a)∣≤∣f(a)−sn(a)∣+∣sn(a)−F(a)∣≤2M(23)n+1|f(a) - F(a)| \le |f(a) - s_n(a)| + |s_n(a) - F(a)| \le 2M(\tfrac{2}{3})^{n+1} for each nn. So F(a)=f(a)F(a) = f(a), and FF restricts to ff.
  22. FF is continuous. Let x0∈Xx_0 \in X and ε>0\varepsilon > 0. Choose nn with M(23)n+1<ε/3M(\tfrac{2}{3})^{n+1} < \varepsilon / 3. Each sns_n is continuous by step 6, so (C) gives an open W∋x0W \ni x_0 with ∣sn(x)−sn(x0)∣<ε/3|s_n(x) - s_n(x_0)| < \varepsilon / 3 on WW.
  23. For x∈Wx \in W, step 19 gives ∣F(x)−F(x0)∣≤∣F(x)−sn(x)∣+∣sn(x)−sn(x0)∣+∣sn(x0)−F(x0)∣<ε|F(x) - F(x_0)| \le |F(x) - s_n(x)| + |s_n(x) - s_n(x_0)| + |s_n(x_0) - F(x_0)| < \varepsilon. By (C), FF is continuous. This proves the bounded part of the theorem.
  24. General case. Let φ ⁣:ℝ→(−1,1)\varphi \colon \mathbb{R} \to (-1, 1), φ(t)=t/(1+∣t∣)\varphi(t) = t / (1 + |t|), and ψ ⁣:(−1,1)→ℝ\psi \colon (-1, 1) \to \mathbb{R}, ψ(s)=s/(1−∣s∣)\psi(s) = s / (1 - |s|).
  25. The map t↦∣t∣t \mapsto |t| is continuous, since ∣∣t∣−∣t0∣∣≤∣t−t0∣||t| - |t_0|| \le |t - t_0| by the reverse triangle inequality. So φ\varphi and ψ\psi are continuous, as quotients with nonzero denominators.
  26. For t∈ℝt \in \mathbb{R}, 1−∣φ(t)∣=1/(1+∣t∣)1 - |\varphi(t)| = 1/(1 + |t|), so ψ(φ(t))=t\psi(\varphi(t)) = t. For s∈(−1,1)s \in (-1, 1), 1+∣ψ(s)∣=1/(1−∣s∣)1 + |\psi(s)| = 1/(1 - |s|), so φ(ψ(s))=s\varphi(\psi(s)) = s.
  27. The map φ∘f ⁣:A→ℝ\varphi \circ f \colon A \to \mathbb{R} is continuous, by (C) and the epsilon-delta continuity of φ\varphi. It satisfies ∣φ∘f∣<1|\varphi \circ f| < 1 on AA.
  28. The bounded case with M=1M = 1 gives a continuous G ⁣:X→[−1,1]G \colon X \to [-1, 1] with G=φ∘fG = \varphi \circ f on AA.
  29. Let E=G−1({−1,1})E = G^{-1}(\{-1, 1\}). It is closed in XX by continuity via closed sets. It is disjoint from AA, because ∣G∣<1|G| < 1 on AA.
  30. By Urysohn's lemma there is a continuous v ⁣:X→[0,1]v \colon X \to [0, 1] with v=0v = 0 on EE and v=1v = 1 on AA. Let H=vGH = vG.
  31. HH is continuous. For xx near x0x_0, ∣H(x)−H(x0)∣≤∣v(x)∣∣G(x)−G(x0)∣+∣G(x0)∣∣v(x)−v(x0)∣≤∣G(x)−G(x0)∣+∣v(x)−v(x0)∣|H(x) - H(x_0)| \le |v(x)||G(x) - G(x_0)| + |G(x_0)||v(x) - v(x_0)| \le |G(x) - G(x_0)| + |v(x) - v(x_0)|. Apply (C) to GG and vv.
  32. ∣H∣<1|H| < 1 on XX. On EE, H=0H = 0. Off EE, ∣G∣<1|G| < 1 and 0≤v≤10 \le v \le 1, so ∣H∣≤∣G∣<1|H| \le |G| < 1.
  33. Let F=ψ∘H ⁣:X→ℝF = \psi \circ H \colon X \to \mathbb{R}. It is continuous by (C) and the epsilon-delta continuity of ψ\psi at H(x0)H(x_0).
  34. For a∈Aa \in A, v(a)=1v(a) = 1, so H(a)=G(a)=φ(f(a))H(a) = G(a) = \varphi(f(a)), and F(a)=ψ(φ(f(a)))=f(a)F(a) = \psi(\varphi(f(a))) = f(a) by step 26.
  35. So FF is a continuous map X→ℝX \to \mathbb{R} whose restriction to AA is ff. With the bounded case, this proves both parts.

Idea

Urysohn's lemma lets us approximate a bounded function on AA by a function on all of XX, with an error two thirds as large. Repeating this on the errors gives a geometric series of functions that converges uniformly to an extension. For unbounded ff, squeeze ℝ\mathbb{R} into (−1,1)(-1, 1), extend, and use Urysohn again to keep the extension away from ±1\pm 1.

Reading path

To understand this page from the ground up, read these 174 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof that open sets are the sets that are neighbourhoods of all their points, Proof of the commutativity of addition by induction, Proof of the epsilon-delta form of continuity, Proof of the sum of a finite geometric series, Proof of De Morgan's laws for sets, Proof of De Morgan's laws by truth tables, Proof that there is a natural number n with 1/n below any positive epsilon, Proof that a union of open sets of a metric space is open, Proof of the reverse triangle inequality, Proof that an intersection of closed sets of a metric space is closed, Proof of the limit of a quotient of sequences, Proof of Urysohn's lemma by dyadic open sets, Proof that the inclusion of a subspace is continuous, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of continuity via closed sets, Proof of the double negation law by a truth table, Proof of strong induction from ordinary induction, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof that the closure is the smallest closed superset, Proof that a quotient of continuous functions is continuous, Proof that the composition of continuous maps is continuous, Proof of the description of the open sets of a metric space, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof of the existence of the infimum by negation, Proof that limits preserve non-strict inequalities, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof that continuity is equivalent to sequential continuity, Proof that open balls are open, Proof that the closure is closed, Proof that a set is open if and only if its complement is closed.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Element definition
  4. Integers object
  5. Limit point of a set definition
  6. Mathematical induction concept
  7. Natural numbers object
  8. Ordered field definition
  9. Peano axioms concept
  10. Proposition concept
  11. Rational numbers object
  12. Real numbers object
  13. Sequence definition
  14. Set bounded above definition
  15. Set definition
  16. Ring of integers statement
  17. Limit of a function definition
  18. Archimedean ordered field definition
  19. Successor function definition
  20. Conjunction definition
  21. Disjunction definition
  22. Implication definition
  23. Negation definition
  24. Predicate definition
  25. The reals form a field statement
  26. Real sequence definition
  27. Subsequence definition
  28. Infimum definition
  29. Supremum definition
  30. Empty set object
  31. Family of sets definition
  32. Ordered pair definition
  33. Continuity at a point definition
  34. Intersection definition
  35. Union definition
  36. Addition of natural numbers definition
  37. The rationals form a field statement
  38. Biconditional definition
  39. The successor function is injective statement
  40. Zero is not a successor statement
  41. Truth table concept
  42. Modus ponens concept
  43. Existential quantifier definition
  44. Universal quantifier definition
  45. Bounded sequence definition
  46. Cauchy sequence definition
  47. Geometric sequence definition
  48. Limit of a sequence definition
  49. Monotone sequence definition
  50. Completeness axiom statement
  51. Cartesian product definition
  52. Continuous function definition
  53. Proof of the commutativity of addition by induction proof
  54. Subset definition
  55. Axiom of extensionality statement
  56. Order on the natural numbers definition
  57. Intersection of a family of sets definition
  58. Union of a family of sets definition
  59. The rationals form an ordered field statement
  60. Propositional logic concept
  61. Mathematical proof concept
  62. Uniqueness quantifier definition
  63. Proof of the sum of a finite geometric series proof
  64. Convergent sequence definition
  65. Sequential continuity definition
  66. Binary relation definition
  67. Universal set definition
  68. Topological space definition
  69. Order on the reals definition
  70. Commutativity of addition statement
  71. Proof of strong induction from ordinary induction proof
  72. Tautology definition
  73. Sum of a finite geometric series statement
  74. Antisymmetric relation definition
  75. Reflexive relation definition
  76. Transitive relation definition
  77. Complement definition
  78. Interval definition
  79. Subspace topology definition
  80. Strong induction statement
  81. Function definition
  82. Logical equivalence definition
  83. Preorder definition
  84. Proof of the epsilon-delta form of continuity proof
  85. Preimage of a set definition
  86. Proof of the well-ordering principle from strong induction proof
  87. Restriction of a function definition
  88. Metric space definition
  89. Function composition definition
  90. Proof of De Morgan's laws by truth tables proof
  91. Proof of the double negation law by a truth table proof
  92. Partial order definition
  93. Epsilon-delta definition of continuity statement
  94. Well-ordering principle statement
  95. Open ball definition
  96. Triangle inequality for a metric statement
  97. De Morgan's laws statement
  98. Double negation law statement
  99. Total order definition
  100. Metric topology definition
  101. Proof of De Morgan's laws for sets proof
  102. Proof by contradiction concept
  103. Proof that every sequence has a monotone subsequence, by peaks proof
  104. Open set definition
  105. De Morgan's laws for sets statement
  106. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  107. Every sequence has a monotone subsequence statement
  108. Continuous map of topological spaces definition
  109. Closed set definition
  110. Proof of the description of the open sets of a metric space proof
  111. Proof that open sets are the sets that are neighbourhoods of all their points proof
  112. The reals form an ordered field statement
  113. Normal space definition
  114. Proof that a set is open if and only if its complement is closed proof
  115. Proof that the composition of continuous maps is continuous proof
  116. Open sets of a metric space statement
  117. Proof that the inclusion of a subspace is continuous proof
  118. Closure definition
  119. Open sets characterised by neighbourhoods statement
  120. Absolute value definition
  121. Proof of the approximation property of the supremum proof
  122. Proof of the existence of the infimum by negation proof
  123. Complement of an open set is closed statement
  124. Composition of continuous maps is continuous statement
  125. Inclusion of a subspace is continuous statement
  126. Proof that the closure is closed proof
  127. Proof that a union of open sets of a metric space is open proof
  128. Proof that open balls are open proof
  129. Proof of the triangle inequality for real numbers proof
  130. Proof that the absolute value is multiplicative proof
  131. Proof of the epsilon-N definition of the limit of a sequence proof
  132. Approximation property of the supremum statement
  133. Existence of the infimum statement
  134. Proof of continuity via closed sets proof
  135. Open balls are open statement
  136. Union of open sets is open statement
  137. Triangle inequality statement
  138. Absolute value is multiplicative statement
  139. Proof that the reals are Archimedean from the completeness axiom proof
  140. Epsilon-N definition of the limit of a sequence statement
  141. Continuity via closed sets statement
  142. Proof that an intersection of closed sets of a metric space is closed proof
  143. Proof of the reverse triangle inequality proof
  144. Proof that limits preserve non-strict inequalities proof
  145. The reals are Archimedean statement
  146. Proof that convergent sequences are bounded proof
  147. Proof of the monotone convergence theorem for sequences proof
  148. Intersection of closed sets is closed statement
  149. Reverse triangle inequality statement
  150. Floor function definition
  151. Proof that there is a natural number n with 1/n below any positive epsilon proof
  152. Limits preserve non-strict inequalities statement
  153. Convergent sequences are bounded statement
  154. Monotone convergence theorem for sequences statement
  155. Closure is closed statement
  156. There is a natural number n with 1/n below any positive epsilon statement
  157. Proof of the limit of a product of sequences proof
  158. Proof that a decreasing sequence bounded below converges proof
  159. Proof that the closure is the smallest closed superset proof
  160. Decreasing sequence bounded below converges statement
  161. Proof that continuity is equivalent to sequential continuity proof
  162. Limit of a product of sequences statement
  163. Closure is the smallest closed superset statement
  164. Proof of the limit of a quotient of sequences proof
  165. Continuity is equivalent to sequential continuity statement
  166. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  167. Proof of Urysohn's lemma by dyadic open sets proof
  168. Limit of a quotient of sequences statement
  169. Bolzano–Weierstrass theorem statement
  170. Urysohn's lemma statement
  171. Proof that a quotient of continuous functions is continuous proof
  172. Completeness of the real numbers statement
  173. Quotient of continuous functions is continuous statement
  174. Proof of the Tietze extension theorem by successive approximation proof

Where this leads

2 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Tietze_Extension_Theorem
About this page
TagARWDDB0ZJ5
URIm2://ARWDDB0ZJ5
Kindproof
WritingW0 stub
MSC54C20
ProvesTietze extension theorem
UsesNormal space, Urysohn's lemma, Continuous map of topological spaces, Restriction of a function, Closed set, Subspace topology, Topological space, Open sets of a metric space, Open balls are open, Continuity via closed sets, Inclusion of a subspace is continuous, Composition of continuous maps is continuous, Reverse triangle inequality, Quotient of continuous functions is continuous, Epsilon-delta definition of continuity, Sum of a finite geometric series, Completeness of the real numbers, Limits preserve non-strict inequalities
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.