Math 2.0

General topology Proof

Proof that a continuous real function on a compact set attains its bounds

Builds on Continuous image of a compact set is compactHeine–Borel theoremEuclidean metricBounded setCompleteness axiomExistence of the infimumSupremumInfimumClosed setMetric topology

Proof

We show that the image f(K)f(K) contains its supremum and its infimum.

  1. Let S=f(K)⊆ℝS = f(K) \subseteq \R. Since KK is nonempty, SS is nonempty.
  2. The continuous image of a compact set is compact. So SS is compact in ℝ\R.
  3. Give ℝ\R the Euclidean metric d(s,t)=∣s−t∣d(s, t) = \abs{s - t}. By the Heine–Borel theorem with n=1n = 1, the set SS is closed and bounded.
  4. By step 3 there is a real MM with ∣s−t∣≤M\abs{s - t} \le M for all s,t∈Ss, t \in S. Fix t0∈St_0 \in S. Then t0−M≤s≤t0+Mt_0 - M \le s \le t_0 + M for each s∈Ss \in S.
  5. So SS is bounded above and below. By the completeness axiom, SS has a supremum β\beta. By the existence of the infimum, SS has an infimum α\alpha.
  6. Suppose β∉S\beta \notin S. Then β\beta lies in ℝ∖S\R \setminus S, which is open because SS is closed.
  7. By the definition of the metric topology, there is ε>0\varepsilon > 0 with (β−ε,β+ε)∩S=∅(\beta - \varepsilon, \beta + \varepsilon) \cap S = \varnothing.
  8. Let s∈Ss \in S. Then s≤βs \le \beta, and s∉(β−ε,β]s \notin (\beta - \varepsilon, \beta] by step 7. So s≤β−εs \le \beta - \varepsilon.
  9. Thus β−ε\beta - \varepsilon is an upper bound of SS that is smaller than β\beta. This contradicts the definition of the supremum. Hence β∈S\beta \in S.
  10. In the same way, suppose α∉S\alpha \notin S. Then some ε>0\varepsilon > 0 gives (α−ε,α+ε)∩S=∅(\alpha - \varepsilon, \alpha + \varepsilon) \cap S = \varnothing.
  11. Each s∈Ss \in S has s≥αs \ge \alpha and s∉[α,α+ε)s \notin [\alpha, \alpha + \varepsilon), so s≥α+εs \ge \alpha + \varepsilon. Then α+ε\alpha + \varepsilon is a lower bound larger than α\alpha, a contradiction. Hence α∈S\alpha \in S.
  12. By steps 9 and 11, there are a,b∈Ka, b \in K with f(a)=αf(a) = \alpha and f(b)=βf(b) = \beta.
  13. For each x∈Kx \in K, f(x)∈Sf(x) \in S, so α≤f(x)≤β\alpha \le f(x) \le \beta. That is, f(a)≤f(x)≤f(b)f(a) \le f(x) \le f(b) for all x∈Kx \in K.

Idea

Compactness passes from KK to the image f(K)f(K), and a compact subset of ℝ\R is closed and bounded. A bounded set has a supremum and an infimum. Because the set is closed, these two numbers cannot sit outside it, so they are values of ff.

Reading path

To understand this page from the ground up, read these 128 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 Lebesgue number lemma by a finite cover of balls, Proof of the Heine–Borel theorem by sequential compactness, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that compact subsets of a metric space are bounded, Proof that compactness and sequential compactness agree in metric spaces, Proof that subsequences of a convergent sequence converge to the same limit, Proof of strong induction from ordinary induction, Proof that a continuous image of a compact set is compact, Proof that compact subsets of a Hausdorff space are closed, Proof of the description of the open sets of a metric space, Proof of the epsilon-N definition of the limit of a sequence, Proof that compactness of a subset can be tested with open sets of the ambient space, Proof of the existence of the infimum by negation, Proof that closed sets contain their limits, Proof that metric spaces are Hausdorff, 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 of the monotone convergence theorem for sequences, Proof that open balls are open.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Element definition
  4. Euclidean metric example
  5. Extended real number line object
  6. Integers object
  7. Mathematical induction concept
  8. Natural numbers object
  9. Ordered field definition
  10. Peano axioms concept
  11. Proposition concept
  12. Rational numbers object
  13. Real numbers object
  14. Sequence definition
  15. Set bounded above definition
  16. Set definition
  17. Ring of integers statement
  18. Successor function definition
  19. Conjunction definition
  20. Disjunction definition
  21. Implication definition
  22. Predicate definition
  23. The reals form a field statement
  24. Real sequence definition
  25. Subsequence definition
  26. Infimum definition
  27. Supremum definition
  28. Empty set object
  29. Family of sets definition
  30. Ordered pair definition
  31. Intersection definition
  32. Union definition
  33. Addition of natural numbers definition
  34. The successor function is injective statement
  35. Zero is not a successor statement
  36. Existential quantifier definition
  37. The rationals form a field statement
  38. Universal quantifier definition
  39. Bounded sequence definition
  40. Limit of a sequence definition
  41. Monotone sequence definition
  42. Completeness axiom statement
  43. Cartesian product definition
  44. Subset definition
  45. Proof of the commutativity of addition by induction proof
  46. Union of a family of sets definition
  47. Order on the natural numbers definition
  48. The rationals form an ordered field statement
  49. Uniqueness quantifier definition
  50. Convergent sequence definition
  51. Binary relation definition
  52. Universal set definition
  53. Topological space definition
  54. Order on the reals definition
  55. Commutativity of addition statement
  56. Proof of strong induction from ordinary induction proof
  57. Antisymmetric relation definition
  58. Reflexive relation definition
  59. Transitive relation definition
  60. Complement definition
  61. Sequential compactness definition
  62. Subspace topology definition
  63. Function definition
  64. Strong induction statement
  65. Preorder definition
  66. Image of a set definition
  67. Preimage of a set definition
  68. Proof of the well-ordering principle from strong induction proof
  69. Metric space definition
  70. Partial order definition
  71. Closed ball definition
  72. Convergence of a sequence in a metric space definition
  73. Open ball definition
  74. Triangle inequality for a metric statement
  75. Well-ordering principle statement
  76. Diameter of a set definition
  77. Total order definition
  78. Bounded set definition
  79. Metric topology definition
  80. Proof that every sequence has a monotone subsequence, by peaks proof
  81. Open set definition
  82. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  83. Every sequence has a monotone subsequence statement
  84. Hausdorff space definition
  85. Continuous map of topological spaces definition
  86. Open cover definition
  87. Closed set definition
  88. Proof of the description of the open sets of a metric space proof
  89. The reals form an ordered field statement
  90. Compact space definition
  91. Open sets of a metric space statement
  92. Absolute value definition
  93. Proof of the approximation property of the supremum proof
  94. Proof of the existence of the infimum by negation proof
  95. Compact set definition
  96. Proof that closed sets contain their limits proof
  97. Proof that open balls are open proof
  98. Proof of the epsilon-N definition of the limit of a sequence proof
  99. Approximation property of the supremum statement
  100. Existence of the infimum statement
  101. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  102. Closed sets contain their limits statement
  103. Open balls are open statement
  104. Epsilon-N definition of the limit of a sequence statement
  105. Compactness via open covers statement
  106. Proof that metric spaces are Hausdorff proof
  107. Proof of the Lebesgue number lemma by a finite cover of balls proof
  108. Proof that subsequences of a convergent sequence converge to the same limit proof
  109. Proof of the monotone convergence theorem for sequences proof
  110. Proof that a continuous image of a compact set is compact proof
  111. Proof that compact subsets of a Hausdorff space are closed proof
  112. Metric spaces are Hausdorff statement
  113. Proof that compact subsets of a metric space are bounded proof
  114. Lebesgue number lemma statement
  115. Proof that compactness and sequential compactness agree in metric spaces proof
  116. Subsequences of a convergent sequence converge to the same limit statement
  117. Monotone convergence theorem for sequences statement
  118. Continuous image of a compact set is compact statement
  119. Compact subsets of a Hausdorff space are closed statement
  120. Compact subsets of a metric space are bounded statement
  121. Compactness and sequential compactness agree in metric spaces statement
  122. Proof that a decreasing sequence bounded below converges proof
  123. Decreasing sequence bounded below converges statement
  124. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  125. Bolzano–Weierstrass theorem statement
  126. Proof of the Heine–Borel theorem by sequential compactness proof
  127. Heine–Borel theorem statement
  128. Proof that a continuous real function on a compact set attains its bounds proof

Where this leads

685 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Extreme_value_theorem, Generalization to metric and topological spaces
About this page
TagRKQWD3FMKV
URIm2://RKQWD3FMKV
Kindproof
WritingW0 stub
MSC54C30
ProvesContinuous real function on a compact set attains its bounds
UsesContinuous image of a compact set is compact, Heine–Borel theorem, Euclidean metric, Bounded set, Completeness axiom, Existence of the infimum, Supremum, Infimum, Closed set, Metric topology
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.