Prove that there exists a finite subset {$b_1,b_2,…,b_n$} of B such that for all x $in$ K there exists i...
up vote
-1
down vote
favorite
Let K be a compact metric space. Let B be a dense subset of K. Fix an arbitrary real positive number $delta$. Prove that there exists a finite subset {$b_1,b_2,...,b_n$} of B such that for all x $in$ K there exists i $leq$ n such that $d(x,b_i)<delta$.
This is what I'm thinking for my proof:
Let $K$ be a compact metric space. Let ${B_{delta}(b_i)}_{b_i in B}$ be an open cover of $K$. Thus, by definition, $k subseteq bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. Let $x in K$, then $x in bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. So $x in B_{delta}(b_i)$ for some $i leq n$. Hence for all $x in K$ there exists $i leq n$ such that $d(x,b_i)<delta$.
But I don't make use of the fact that B is a dense subset?
real-analysis
add a comment |
up vote
-1
down vote
favorite
Let K be a compact metric space. Let B be a dense subset of K. Fix an arbitrary real positive number $delta$. Prove that there exists a finite subset {$b_1,b_2,...,b_n$} of B such that for all x $in$ K there exists i $leq$ n such that $d(x,b_i)<delta$.
This is what I'm thinking for my proof:
Let $K$ be a compact metric space. Let ${B_{delta}(b_i)}_{b_i in B}$ be an open cover of $K$. Thus, by definition, $k subseteq bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. Let $x in K$, then $x in bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. So $x in B_{delta}(b_i)$ for some $i leq n$. Hence for all $x in K$ there exists $i leq n$ such that $d(x,b_i)<delta$.
But I don't make use of the fact that B is a dense subset?
real-analysis
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
Let K be a compact metric space. Let B be a dense subset of K. Fix an arbitrary real positive number $delta$. Prove that there exists a finite subset {$b_1,b_2,...,b_n$} of B such that for all x $in$ K there exists i $leq$ n such that $d(x,b_i)<delta$.
This is what I'm thinking for my proof:
Let $K$ be a compact metric space. Let ${B_{delta}(b_i)}_{b_i in B}$ be an open cover of $K$. Thus, by definition, $k subseteq bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. Let $x in K$, then $x in bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. So $x in B_{delta}(b_i)$ for some $i leq n$. Hence for all $x in K$ there exists $i leq n$ such that $d(x,b_i)<delta$.
But I don't make use of the fact that B is a dense subset?
real-analysis
Let K be a compact metric space. Let B be a dense subset of K. Fix an arbitrary real positive number $delta$. Prove that there exists a finite subset {$b_1,b_2,...,b_n$} of B such that for all x $in$ K there exists i $leq$ n such that $d(x,b_i)<delta$.
This is what I'm thinking for my proof:
Let $K$ be a compact metric space. Let ${B_{delta}(b_i)}_{b_i in B}$ be an open cover of $K$. Thus, by definition, $k subseteq bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. Let $x in K$, then $x in bigcuplimits_{i=1}^{n} B_{delta}(b_i)$. So $x in B_{delta}(b_i)$ for some $i leq n$. Hence for all $x in K$ there exists $i leq n$ such that $d(x,b_i)<delta$.
But I don't make use of the fact that B is a dense subset?
real-analysis
real-analysis
edited Dec 7 at 19:40
asked Dec 4 at 1:05
big_math_boy
11
11
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
Hint: Take the union of all $B(b, delta)$, balls of radius $delta$ centered at $b$. This is an open cover of $K$ (why?) and therefore, only finitely many balls cover K.
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',
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%2f3024969%2fprove-that-there-exists-a-finite-subset-b-1-b-2-b-n-of-b-such-that-for-a%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
Hint: Take the union of all $B(b, delta)$, balls of radius $delta$ centered at $b$. This is an open cover of $K$ (why?) and therefore, only finitely many balls cover K.
add a comment |
up vote
0
down vote
Hint: Take the union of all $B(b, delta)$, balls of radius $delta$ centered at $b$. This is an open cover of $K$ (why?) and therefore, only finitely many balls cover K.
add a comment |
up vote
0
down vote
up vote
0
down vote
Hint: Take the union of all $B(b, delta)$, balls of radius $delta$ centered at $b$. This is an open cover of $K$ (why?) and therefore, only finitely many balls cover K.
Hint: Take the union of all $B(b, delta)$, balls of radius $delta$ centered at $b$. This is an open cover of $K$ (why?) and therefore, only finitely many balls cover K.
answered Dec 4 at 1:09
Yunus Syed
1,117218
1,117218
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3024969%2fprove-that-there-exists-a-finite-subset-b-1-b-2-b-n-of-b-such-that-for-a%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