Can we find $V_n$ in such a way that $bigcaplimits_{n=1}^{infty} V_n$ is countable?
$begingroup$
If $V_n$ is open, dense subset of $mathbb R$ for each $nin mathbb N$ then by Baire's Category theorem we know that $displaystyle cap_{n=1}^{infty} V_n$ is dense in $mathbb R$.
My question is that : Can we find $V_n$ in such a way that $displaystyle bigcap_{n=1}^{infty} V_n$ is countable set?
Any help is appreciated. Thank you.
real-analysis baire-category
$endgroup$
add a comment |
$begingroup$
If $V_n$ is open, dense subset of $mathbb R$ for each $nin mathbb N$ then by Baire's Category theorem we know that $displaystyle cap_{n=1}^{infty} V_n$ is dense in $mathbb R$.
My question is that : Can we find $V_n$ in such a way that $displaystyle bigcap_{n=1}^{infty} V_n$ is countable set?
Any help is appreciated. Thank you.
real-analysis baire-category
$endgroup$
add a comment |
$begingroup$
If $V_n$ is open, dense subset of $mathbb R$ for each $nin mathbb N$ then by Baire's Category theorem we know that $displaystyle cap_{n=1}^{infty} V_n$ is dense in $mathbb R$.
My question is that : Can we find $V_n$ in such a way that $displaystyle bigcap_{n=1}^{infty} V_n$ is countable set?
Any help is appreciated. Thank you.
real-analysis baire-category
$endgroup$
If $V_n$ is open, dense subset of $mathbb R$ for each $nin mathbb N$ then by Baire's Category theorem we know that $displaystyle cap_{n=1}^{infty} V_n$ is dense in $mathbb R$.
My question is that : Can we find $V_n$ in such a way that $displaystyle bigcap_{n=1}^{infty} V_n$ is countable set?
Any help is appreciated. Thank you.
real-analysis baire-category
real-analysis baire-category
edited Dec 29 '18 at 9:59
Martin Sleziak
44.7k9117272
44.7k9117272
asked Dec 20 '18 at 13:00
nurun neshanurun nesha
1,0222623
1,0222623
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
No, we cannot. Suppose otherwise. Then $bigcap_{ninmathbb N}V_n={r_1,r_2,r_3,ldots}$. Now, let $W_n=V_nsetminus{r_n}$. Then $W_n$ is also an open dense subset of $mathbb R$. But now $bigcap_{ninmathbb N}W_n=emptyset$, which is impossible, by Baire's theorem.
$endgroup$
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
add a comment |
$begingroup$
No. If $S = int_{n=1}^infty V_n$ were countable, you could make it empty by intersecting with another countable sequence of dense open sets (the complements of each member of $S$), and thereby violate Baire.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3047508%2fcan-we-find-v-n-in-such-a-way-that-bigcap-limits-n-1-infty-v-n-is-coun%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
No, we cannot. Suppose otherwise. Then $bigcap_{ninmathbb N}V_n={r_1,r_2,r_3,ldots}$. Now, let $W_n=V_nsetminus{r_n}$. Then $W_n$ is also an open dense subset of $mathbb R$. But now $bigcap_{ninmathbb N}W_n=emptyset$, which is impossible, by Baire's theorem.
$endgroup$
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
add a comment |
$begingroup$
No, we cannot. Suppose otherwise. Then $bigcap_{ninmathbb N}V_n={r_1,r_2,r_3,ldots}$. Now, let $W_n=V_nsetminus{r_n}$. Then $W_n$ is also an open dense subset of $mathbb R$. But now $bigcap_{ninmathbb N}W_n=emptyset$, which is impossible, by Baire's theorem.
$endgroup$
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
add a comment |
$begingroup$
No, we cannot. Suppose otherwise. Then $bigcap_{ninmathbb N}V_n={r_1,r_2,r_3,ldots}$. Now, let $W_n=V_nsetminus{r_n}$. Then $W_n$ is also an open dense subset of $mathbb R$. But now $bigcap_{ninmathbb N}W_n=emptyset$, which is impossible, by Baire's theorem.
$endgroup$
No, we cannot. Suppose otherwise. Then $bigcap_{ninmathbb N}V_n={r_1,r_2,r_3,ldots}$. Now, let $W_n=V_nsetminus{r_n}$. Then $W_n$ is also an open dense subset of $mathbb R$. But now $bigcap_{ninmathbb N}W_n=emptyset$, which is impossible, by Baire's theorem.
edited Dec 20 '18 at 13:21
answered Dec 20 '18 at 13:07
José Carlos SantosJosé Carlos Santos
157k22126227
157k22126227
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
add a comment |
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
We could also take $W_n=V_n setminus {r_n}$.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:12
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
@nurunnesha You are right. That's even simpler. Do you mind if I edit my answer so that it uses your idea?
$endgroup$
– José Carlos Santos
Dec 20 '18 at 13:13
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
$begingroup$
Yeah, sure edit your answer.
$endgroup$
– nurun nesha
Dec 20 '18 at 13:16
add a comment |
$begingroup$
No. If $S = int_{n=1}^infty V_n$ were countable, you could make it empty by intersecting with another countable sequence of dense open sets (the complements of each member of $S$), and thereby violate Baire.
$endgroup$
add a comment |
$begingroup$
No. If $S = int_{n=1}^infty V_n$ were countable, you could make it empty by intersecting with another countable sequence of dense open sets (the complements of each member of $S$), and thereby violate Baire.
$endgroup$
add a comment |
$begingroup$
No. If $S = int_{n=1}^infty V_n$ were countable, you could make it empty by intersecting with another countable sequence of dense open sets (the complements of each member of $S$), and thereby violate Baire.
$endgroup$
No. If $S = int_{n=1}^infty V_n$ were countable, you could make it empty by intersecting with another countable sequence of dense open sets (the complements of each member of $S$), and thereby violate Baire.
answered Dec 20 '18 at 13:06
Robert IsraelRobert Israel
321k23210463
321k23210463
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3047508%2fcan-we-find-v-n-in-such-a-way-that-bigcap-limits-n-1-infty-v-n-is-coun%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown