Existence of sup/inf in compact sets

  • Thread starter Thread starter dancergirlie
  • Start date Start date
  • Tags Tags
    Compact Sets
Click For Summary
SUMMARY

The discussion confirms that if a set K is compact in R, then both the supremum (supK) and infimum (infK) exist and are elements of K. The proof relies on the properties of compact sets, specifically that they are bounded and closed. Utilizing the axiom of completeness, it is established that the existence of supK and infK follows from K being bounded above and below. Additionally, the limit points of K, which include supK and infK, are shown to be contained in K due to its closed nature.

PREREQUISITES
  • Understanding of compact sets in real analysis
  • Familiarity with the concepts of supremum and infimum
  • Knowledge of limit points and their definitions
  • Basic understanding of the axiom of completeness in real numbers
NEXT STEPS
  • Study the properties of compact sets in metric spaces
  • Learn about the definitions and properties of limit points
  • Explore the implications of the axiom of completeness in real analysis
  • Review proofs involving supremum and infimum in closed sets
USEFUL FOR

Mathematics students, particularly those studying real analysis, and educators looking to deepen their understanding of compactness, limit points, and the completeness of real numbers.

dancergirlie
Messages
194
Reaction score
0

Homework Statement



Show if K contained in R is compact, then supK and inf K both exist and are elements of K.

Homework Equations





The Attempt at a Solution



Ok we proved a theorem stating that if K is compact that means it is bounded and closed.

So if K is bounded that means that for every element k in K there exists an M in R so that,
|k|<M
which is equiv to:
-M<k<M
meaning for all k in K
k>-M and k<M and therefore K is bounded above AND below.
According to the axiom of completeness, that means that the supK and the infK exists.

Alright, this is where I get stuck, I know that the supK and infK are the limit points of K, and since we know that K is closed, they would be contained in K, but I don't know how to show that supK and infK are the limit points. Any help would be great!
 
Physics news on Phys.org
Ok, first of all, if K is finite, then it doesn't have a limit point; however, it's trivial to prove the theorem for this.

Let s be the sup. Then by definition every open ball centered at s contains a point in K. Can you construct a sequence of points in K converging to s from this?
 
so could I just say as epsilon approaches zero the epsilon-neighborhood (ball) around s gets smaller and smaller and thus s is a limit point of K, and since K is closed, it contains s? Then i can make a similar argument for the infK?
 
I think you have the right idea and just need that final step in order to make it precise. To do that, however, requires that you know exactly what definitions you are using for each concept. What definition are you using for the limit point?
 
well we have one definition and one theorem for the limit points. The first is x is a limit point of A if every epsilon neighborhood Ve(x) intersects the set A in some point other than x. The theorem states a point x is a limit point of A if and only if x=lim(a_n) for some sequence (a_n) contained in A satisfying a_n is unequal to x for all n.

Couldn't I just use the definition of the supremum and say that since supK is the LEAST upper bound, that would mean for any epsilon greater than zero, s-epsilon is an element in K (because then if it wasn't then s-epsilon would be the supremum). Which would mean that every epsilon neighborhood Ve(s) intersects the set K in some point other than s, which would make s a limit point of K. And since K is closed, s would be contained in K.
 
Yes. That's the reason I asked you about your definition of limit point. If that's what you're using, then you can just simply say that.
 
thanks so much for the help!
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 43 ·
2
Replies
43
Views
5K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
7K
  • · Replies 10 ·
Replies
10
Views
2K