Math 2.0

Real functions Proof

Proof that continuous functions on a closed bounded interval are uniformly continuous

Builds on Uniform continuity on a setContinuous functionEpsilon-delta definition of continuityBolzano–Weierstrass theoremSubsequenceLimits preserve non-strict inequalitiesEpsilon-N definition of the limit of a sequenceThere is a natural number n with 1/n below any positive epsilonTriangle inequality

Proof

We argue by contradiction.

  1. Suppose that ff is not uniformly continuous on [a,b][a, b]. Then there is ε>0\varepsilon > 0 with the following property. For each δ>0\delta > 0 there are x,y∈[a,b]x, y \in [a, b] with ∣x−y∣<δ\abs{x - y} < \delta and ∣f(x)−f(y)∣≥ε\abs{f(x) - f(y)} \ge \varepsilon.
  2. For each n∈ℕn \in \N, apply step 1 with δ=1n+1\delta = \frac{1}{n+1}. This gives xn,yn∈[a,b]x_n, y_n \in [a, b] with ∣xn−yn∣<1n+1\abs{x_n - y_n} < \frac{1}{n+1} and ∣f(xn)−f(yn)∣≥ε\abs{f(x_n) - f(y_n)} \ge \varepsilon.
  3. The sequence (xn)(x_n) lies in [a,b][a, b], so it is bounded. By the Bolzano–Weierstrass theorem, a subsequence (xnk)(x_{n_k}) converges to some real cc.
  4. Since a≤xnk≤ba \le x_{n_k} \le b for all kk, limits preserve non-strict inequalities gives a≤c≤ba \le c \le b.
  5. The indices satisfy n0<n1<⋯n_0 < n_1 < \cdots, so induction gives nk≥kn_k \ge k. Hence ∣xnk−ynk∣<1nk+1≤1k+1\abs{x_{n_k} - y_{n_k}} < \frac{1}{n_k+1} \le \frac{1}{k+1}.
  6. The function ff is continuous at cc. By the epsilon-delta form of continuity, there is δ>0\delta > 0 with ∣f(x)−f(c)∣<ε2\abs{f(x) - f(c)} < \frac{\varepsilon}{2} for all x∈[a,b]x \in [a, b] with ∣x−c∣<δ\abs{x - c} < \delta.
  7. By the epsilon-N form of limits, there is K1K_1 with ∣xnk−c∣<δ2\abs{x_{n_k} - c} < \frac{\delta}{2} for all k≥K1k \ge K_1. By this lemma, there is K2≥1K_2 \ge 1 with 1K2<δ2\frac{1}{K_2} < \frac{\delta}{2}.
  8. Let k=max⁡(K1,K2)k = \max(K_1, K_2). Step 5 gives ∣xnk−ynk∣<1k+1<1K2<δ2\abs{x_{n_k} - y_{n_k}} < \frac{1}{k+1} < \frac{1}{K_2} < \frac{\delta}{2}. By the triangle inequality and steps 5 and 7, ∣ynk−c∣≤∣ynk−xnk∣+∣xnk−c∣<δ2+δ2=δ\abs{y_{n_k} - c} \le \abs{y_{n_k} - x_{n_k}} + \abs{x_{n_k} - c} < \frac{\delta}{2} + \frac{\delta}{2} = \delta.
  9. Also ∣xnk−c∣<δ\abs{x_{n_k} - c} < \delta. So step 6 gives ∣f(xnk)−f(c)∣<ε2\abs{f(x_{n_k}) - f(c)} < \frac{\varepsilon}{2} and ∣f(ynk)−f(c)∣<ε2\abs{f(y_{n_k}) - f(c)} < \frac{\varepsilon}{2}.
  10. By the triangle inequality, ∣f(xnk)−f(ynk)∣<ε\abs{f(x_{n_k}) - f(y_{n_k})} < \varepsilon. This contradicts step 2.
  11. So the assumption of step 1 is false, and ff is uniformly continuous on [a,b][a, b].

Idea

If uniform continuity fails, there are pairs of points closer and closer together whose values stay ε\varepsilon apart. The Bolzano–Weierstrass theorem makes both points of these pairs converge to one point cc of the interval. Continuity at cc then forces the values together, which is a contradiction.

Reading path

To understand this page from the ground up, read these 99 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 of the commutativity of addition by induction, Proof of the epsilon-delta form of continuity, Proof that there is a natural number n with 1/n below any positive epsilon, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the double negation law by a truth table, Proof of strong induction from ordinary induction, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, 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 of the monotone convergence theorem for sequences.

  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. Ordered pair definition
  31. Continuity at a point definition
  32. Addition of natural numbers definition
  33. The rationals form a field statement
  34. Biconditional definition
  35. The successor function is injective statement
  36. Zero is not a successor statement
  37. Truth table concept
  38. Modus ponens concept
  39. Universal quantifier definition
  40. Bounded sequence definition
  41. Limit of a sequence definition
  42. Monotone sequence definition
  43. Completeness axiom statement
  44. Cartesian product definition
  45. Continuous function definition
  46. Proof of the commutativity of addition by induction proof
  47. Order on the natural numbers definition
  48. Subset definition
  49. The rationals form an ordered field statement
  50. Propositional logic concept
  51. Mathematical proof concept
  52. Convergent sequence definition
  53. Binary relation definition
  54. Order on the reals definition
  55. Commutativity of addition statement
  56. Proof of strong induction from ordinary induction proof
  57. Tautology definition
  58. Antisymmetric relation definition
  59. Reflexive relation definition
  60. Transitive relation definition
  61. Interval definition
  62. Strong induction statement
  63. Logical equivalence definition
  64. Preorder definition
  65. Proof of the epsilon-delta form of continuity proof
  66. Proof of the well-ordering principle from strong induction proof
  67. Proof of the double negation law by a truth table proof
  68. Partial order definition
  69. Epsilon-delta definition of continuity statement
  70. Well-ordering principle statement
  71. Double negation law statement
  72. Total order definition
  73. Uniform continuity definition
  74. Proof by contradiction concept
  75. Proof that every sequence has a monotone subsequence, by peaks proof
  76. Uniform continuity on a set definition
  77. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  78. Every sequence has a monotone subsequence statement
  79. The reals form an ordered field statement
  80. Absolute value definition
  81. Proof of the approximation property of the supremum proof
  82. Proof of the triangle inequality for real numbers proof
  83. Proof of the epsilon-N definition of the limit of a sequence proof
  84. Approximation property of the supremum statement
  85. Triangle inequality statement
  86. Epsilon-N definition of the limit of a sequence statement
  87. Proof that the reals are Archimedean from the completeness axiom proof
  88. Proof that limits preserve non-strict inequalities proof
  89. The reals are Archimedean statement
  90. Proof of the monotone convergence theorem for sequences proof
  91. Proof that there is a natural number n with 1/n below any positive epsilon proof
  92. Limits preserve non-strict inequalities statement
  93. Monotone convergence theorem for sequences statement
  94. There is a natural number n with 1/n below any positive epsilon statement
  95. Proof that a decreasing sequence bounded below converges proof
  96. Decreasing sequence bounded below converges statement
  97. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  98. Bolzano–Weierstrass theorem statement
  99. Proof that continuous functions on a closed bounded interval are uniformly continuous proof

Where this leads

710 pages build on this one.

Further reading

  1. Web https://www.jirka.org/ra/html/sec_unifcont.html, Theorem 3.4.4
About this page
Tag8ZRGJ9W5QN
URIm2://8ZRGJ9W5QN
Kindproof
WritingW0 stub
MSC26A15
ProvesContinuous functions on a closed bounded interval are uniformly continuous
UsesUniform continuity on a set, Continuous function, Epsilon-delta definition of continuity, Bolzano–Weierstrass theorem, Subsequence, Limits preserve non-strict inequalities, Epsilon-N definition of the limit of a sequence, There is a natural number n with 1/n below any positive epsilon, Triangle inequality
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)

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.