Compactness of {0} union {2^-m + 2^-n}

  • Thread starter Thread starter buzzmath
  • Start date Start date
  • Tags Tags
    Union
Click For Summary
SUMMARY

The set {0} union {2^-m + 2^-n} is compact, as it is closed and bounded. The proof involves demonstrating that the set is bounded below by 0 and contains its lower bound, which is 0. Additionally, the set can be covered by open sets, such as (-2, 2^-m + 2^-n + 2), allowing for a finite subcover that includes all points in the set. Thus, the compactness is established through these properties.

PREREQUISITES
  • Understanding of compactness in topology
  • Familiarity with open and closed sets
  • Knowledge of integer sequences and their limits
  • Basic principles of set theory
NEXT STEPS
  • Study the definition and properties of compact sets in topology
  • Learn about open covers and finite subcovers
  • Explore the concept of boundedness in mathematical analysis
  • Investigate the implications of sequences converging to limits
USEFUL FOR

Mathematicians, students of topology, and anyone interested in understanding the properties of compact sets and their applications in analysis.

buzzmath
Messages
108
Reaction score
0
I'm trying to show that this set is compact {0} union {2^-m + 2^-n} where n,m are integers and m is less than n

I'm thinking that since it's bounded below by 0 and the set contains it's bound that if I can show that it's closed and bounded above that will be a proof but I'm not really sure how i would do that
or
Say there's an collection of open sets who's union is (-2, 2^-m + 2^-n + 2) that since that's an open cover then and you can have a finite subcover of something like (-1, 2^-m + 2^-n +1) that'll still contain the set therefore the set is compact.

I don't know if either of those are correct or if I'm heading in the right direction. Can anyone help?
 
Physics news on Phys.org
Zero is in the set, so any cover of the set must cover zero. Can you show that all but a finite number of points in the set are covered by this cover on {0}?
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
3K
Replies
12
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
556
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K