Which sets are âclompactâ?
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
This is an exercise taken verbatim from Abbott's Understanding Analysis:
LetâÂÂs call a set clompact if it has the property that every
closed cover (i.e., a cover consisting of closed sets) admits a finite subcover.
Describe all of the clompact subsets of $mathbf R$.
I am unable to fully resolve the problem. So far, I have been able to see that singleton sets are always clompact, because the single element must be in at least one set belonging to the closed cover, and that one set is a sufficient finite subcover. The null set is also clompact for obvious reasons. I know that every non-singleton interval (regardless of if they are open, closed, or half-open) is not clompact. As an example, the closed cover
$$ 0cupbigcup_1^inftyleft[frac1n+1,frac1nright] $$
for $[0,1]$ does not have a finite subcover. Similar constructions of closed covers show that $[a,b]$, $(a,b]$, $[b,a)$ and $(a,b)$ are not clompact as well. In addition, $mathbf R$ itself and any unbounded interval is also not clompact.
Is anyone able to help in solving this problem? Any assistance is appreciated.
real-analysis analysis
add a comment |Â
up vote
1
down vote
favorite
This is an exercise taken verbatim from Abbott's Understanding Analysis:
LetâÂÂs call a set clompact if it has the property that every
closed cover (i.e., a cover consisting of closed sets) admits a finite subcover.
Describe all of the clompact subsets of $mathbf R$.
I am unable to fully resolve the problem. So far, I have been able to see that singleton sets are always clompact, because the single element must be in at least one set belonging to the closed cover, and that one set is a sufficient finite subcover. The null set is also clompact for obvious reasons. I know that every non-singleton interval (regardless of if they are open, closed, or half-open) is not clompact. As an example, the closed cover
$$ 0cupbigcup_1^inftyleft[frac1n+1,frac1nright] $$
for $[0,1]$ does not have a finite subcover. Similar constructions of closed covers show that $[a,b]$, $(a,b]$, $[b,a)$ and $(a,b)$ are not clompact as well. In addition, $mathbf R$ itself and any unbounded interval is also not clompact.
Is anyone able to help in solving this problem? Any assistance is appreciated.
real-analysis analysis
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
This is an exercise taken verbatim from Abbott's Understanding Analysis:
LetâÂÂs call a set clompact if it has the property that every
closed cover (i.e., a cover consisting of closed sets) admits a finite subcover.
Describe all of the clompact subsets of $mathbf R$.
I am unable to fully resolve the problem. So far, I have been able to see that singleton sets are always clompact, because the single element must be in at least one set belonging to the closed cover, and that one set is a sufficient finite subcover. The null set is also clompact for obvious reasons. I know that every non-singleton interval (regardless of if they are open, closed, or half-open) is not clompact. As an example, the closed cover
$$ 0cupbigcup_1^inftyleft[frac1n+1,frac1nright] $$
for $[0,1]$ does not have a finite subcover. Similar constructions of closed covers show that $[a,b]$, $(a,b]$, $[b,a)$ and $(a,b)$ are not clompact as well. In addition, $mathbf R$ itself and any unbounded interval is also not clompact.
Is anyone able to help in solving this problem? Any assistance is appreciated.
real-analysis analysis
This is an exercise taken verbatim from Abbott's Understanding Analysis:
LetâÂÂs call a set clompact if it has the property that every
closed cover (i.e., a cover consisting of closed sets) admits a finite subcover.
Describe all of the clompact subsets of $mathbf R$.
I am unable to fully resolve the problem. So far, I have been able to see that singleton sets are always clompact, because the single element must be in at least one set belonging to the closed cover, and that one set is a sufficient finite subcover. The null set is also clompact for obvious reasons. I know that every non-singleton interval (regardless of if they are open, closed, or half-open) is not clompact. As an example, the closed cover
$$ 0cupbigcup_1^inftyleft[frac1n+1,frac1nright] $$
for $[0,1]$ does not have a finite subcover. Similar constructions of closed covers show that $[a,b]$, $(a,b]$, $[b,a)$ and $(a,b)$ are not clompact as well. In addition, $mathbf R$ itself and any unbounded interval is also not clompact.
Is anyone able to help in solving this problem? Any assistance is appreciated.
real-analysis analysis
real-analysis analysis
asked 2 hours ago
YiFan
1,2181210
1,2181210
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
6
down vote
accepted
Hint: Singletons are closed, so if $Ksubsetmathbb R$, then $x:xin K$ is a closed cover of $K$.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
6
down vote
accepted
Hint: Singletons are closed, so if $Ksubsetmathbb R$, then $x:xin K$ is a closed cover of $K$.
add a comment |Â
up vote
6
down vote
accepted
Hint: Singletons are closed, so if $Ksubsetmathbb R$, then $x:xin K$ is a closed cover of $K$.
add a comment |Â
up vote
6
down vote
accepted
up vote
6
down vote
accepted
Hint: Singletons are closed, so if $Ksubsetmathbb R$, then $x:xin K$ is a closed cover of $K$.
Hint: Singletons are closed, so if $Ksubsetmathbb R$, then $x:xin K$ is a closed cover of $K$.
answered 2 hours ago
Aweygan
12.7k21441
12.7k21441
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2989359%2fwhich-sets-are-clompact%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password