Math 2.0

Real functions Proof

Proof of the boundedness theorem by Bolzano–Weierstrass

Builds on Continuous functionBolzano–Weierstrass theoremBounded sequenceSubsequenceLimits preserve non-strict inequalitiesContinuity is equivalent to sequential continuitySequential continuityConvergent sequences are boundedArchimedean property

Proof

We argue by contradiction.

  1. Let a≤ba \le b and let f ⁣:[a,b]→ℝf \colon [a, b] \to \R be continuous. Suppose that ff is not bounded.
  2. Then for each natural number nn, the number nn is not a bound. So there is xn∈[a,b]x_n \in [a, b] with ∣f(xn)∣>n\abs{f(x_n)} > n.
  3. The sequence (xn)(x_n) satisfies a≤xn≤ba \le x_n \le b, so it is bounded. By the Bolzano–Weierstrass theorem, it has a subsequence (xnk)(x_{n_k}) that converges to some real cc.
  4. Since a≤xnk≤ba \le x_{n_k} \le b for all kk, limits preserve non-strict inequalities, with constant sequences, gives a≤c≤ba \le c \le b.
  5. The function ff is continuous, so it is sequentially continuous by the equivalence. Hence f(xnk)→f(c)f(x_{n_k}) \to f(c).
  6. The convergent sequence (f(xnk))(f(x_{n_k})) is bounded: there is KK with ∣f(xnk)∣≤K\abs{f(x_{n_k})} \le K for all kk.
  7. The indices satisfy n0<n1<⋯n_0 < n_1 < \cdots. By induction on kk, nk≥kn_k \ge k for all kk.
  8. By the Archimedean property, there is a natural number kk with k>Kk > K.
  9. For this kk, steps 2 and 7 give ∣f(xnk)∣>nk≥k>K\abs{f(x_{n_k})} > n_k \ge k > K. This contradicts step 6.
  10. So ff is bounded: there is KK with ∣f(x)∣≤K\abs{f(x)} \le K for all x∈[a,b]x \in [a, b].

Idea

If ff were unbounded, we could pick points where ∣f∣\abs{f} exceeds 1,2,3,…1, 2, 3, \dots. These points have a convergent subsequence, and its limit stays in the closed interval. Continuity at that limit would force the values to converge, hence stay bounded, which they do not.

Reading path

To understand this page from the ground up, read these 104 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 of the Archimedean property in an Archimedean ordered field, 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.

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

Where this leads

1135 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Extreme_value_theorem, Proof of the boundedness theorem
About this page
TagWC9M3CNP02
URIm2://WC9M3CNP02
Kindproof
WritingW0 stub
MSC26A15
ProvesBoundedness theorem
UsesContinuous function, Bolzano–Weierstrass theorem, Bounded sequence, Subsequence, Limits preserve non-strict inequalities, Continuity is equivalent to sequential continuity, Sequential continuity, Convergent sequences are bounded, Archimedean property
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.