Proving Non-Empty Compact Sets in n-Dimensional Space

  • Thread starter trap
  • Start date
In summary, if C_{1}, C_{2}, C_{3} are non-empty compact sets in \text R^n such that C_{k+1}\subset C_{k} for all k=1,2,3,..., then the set C = I_{k=1}^{\infty}C_{k} is also non-empty. The problem involves an infinite number of sets and their complements, but using the "Finite Intersection Property" may help prove this. One approach is to use open covers and finite sub-covers to show that each C_{n} has a finite sub-cover, thus proving the existence of a finite sub-cover for C.
  • #1
trap
53
0
Any help will be very gracious.

If [tex]\text C_{1} , C_{2} , C_{3}[/tex] are all non empty compact sets in [tex]\text R^n[/tex] such that [tex]\text C_{k+1} \subset C_{k} [/tex] for all k=1,2,3,..., then the set [tex]\text C = I_{k=1}^{\infty}C_{k} [/tex] is also non-empty.
 
Physics news on Phys.org
  • #2
The basic problem is that there are an infinite number of [itex]C_n[/itex] involved. You should already know how to deal with unions of infinite numbers of open sets. So try looking at the complements of [itex]C_n[/itex].

Carl
 
Last edited:
  • #3
The complement of a closed set is open and of course all compact sets are closed. But it is crucial that these sets be compact and don't see how looking at their complements will include that.

If you were allowed to use the "Finite Intersection Propery"- If the intersection of any finite subset of a collection of compact sets is non-empty, then the intersection of all of them is non-empty- this would be trivial. However, I suspect that the whole point of this is to prove a relatively simple version of that.

Try this: Let {Uα} be an open cover for C1. Then, since every Cn is a subset of C1, it is also an open cover for Cn. Since each Cn is a compact, there exist a finite sub-cover.
...
 

1. How do you define a non-empty compact set in n-dimensional space?

A non-empty compact set in n-dimensional space is a set of points that is both closed and bounded. This means that the set contains all of its limit points and can be enclosed within a finite distance.

2. What is the importance of proving non-empty compact sets in n-dimensional space?

Proving non-empty compact sets in n-dimensional space is important in many areas of mathematics and science, as it allows for the study of properties and behaviors of functions and sets within a defined and finite space. It also helps in making predictions and solving problems in various fields such as physics, engineering, and economics.

3. What are some common methods for proving non-empty compact sets in n-dimensional space?

Some common methods for proving non-empty compact sets in n-dimensional space include the Heine-Borel theorem, Bolzano-Weierstrass theorem, and sequential compactness. These methods involve showing that the set is both closed and bounded, or that it contains all of its limit points.

4. Can a non-empty compact set in n-dimensional space be unbounded?

No, a non-empty compact set in n-dimensional space cannot be unbounded. This is because the definition of a compact set includes the condition of boundedness, meaning that the set must be enclosed within a finite distance.

5. How does the dimension of the space affect the proof of a non-empty compact set?

The dimension of the space does not affect the proof of a non-empty compact set, as the definition and properties of compact sets are the same in any number of dimensions. However, the methods used for proving compactness may vary depending on the dimension of the space.

Similar threads

  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Calculus and Beyond Homework Help
Replies
12
Views
1K
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
502
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
478
  • Calculus and Beyond Homework Help
Replies
2
Views
274
  • Advanced Physics Homework Help
Replies
10
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
Replies
2
Views
138
Back
Top