Prove a subspace is separable
Given a Hilbert space $H$ and let $K$ be a compact set in $H$. Let $X$ be the smallest closed subspace containing $K$. Prove that $X$ is separable.
Compact implies that $K$ is totally bounded. But how to use this prove $X$ is separable? And how to make use of the smallest closed subspace?
functional-analysis
add a comment |
Given a Hilbert space $H$ and let $K$ be a compact set in $H$. Let $X$ be the smallest closed subspace containing $K$. Prove that $X$ is separable.
Compact implies that $K$ is totally bounded. But how to use this prove $X$ is separable? And how to make use of the smallest closed subspace?
functional-analysis
1
Hint: A compact metric space is separable.
– Math1000
Dec 9 at 0:13
@Math1000 So it suffices to prove that $X$ is compact? would you mind explain a bit more how to prove that? It is not so obvious to me.
– whereamI
Dec 9 at 0:59
$X$ won't be compact (it is unbounded). @Math1000 is referring to $K$ being the compact metric space.
– user25959
Dec 9 at 1:18
Reference for the fact that $K$ is separable here: math.stackexchange.com/questions/974233/…
– user25959
Dec 9 at 1:18
add a comment |
Given a Hilbert space $H$ and let $K$ be a compact set in $H$. Let $X$ be the smallest closed subspace containing $K$. Prove that $X$ is separable.
Compact implies that $K$ is totally bounded. But how to use this prove $X$ is separable? And how to make use of the smallest closed subspace?
functional-analysis
Given a Hilbert space $H$ and let $K$ be a compact set in $H$. Let $X$ be the smallest closed subspace containing $K$. Prove that $X$ is separable.
Compact implies that $K$ is totally bounded. But how to use this prove $X$ is separable? And how to make use of the smallest closed subspace?
functional-analysis
functional-analysis
asked Dec 8 at 23:31
whereamI
311114
311114
1
Hint: A compact metric space is separable.
– Math1000
Dec 9 at 0:13
@Math1000 So it suffices to prove that $X$ is compact? would you mind explain a bit more how to prove that? It is not so obvious to me.
– whereamI
Dec 9 at 0:59
$X$ won't be compact (it is unbounded). @Math1000 is referring to $K$ being the compact metric space.
– user25959
Dec 9 at 1:18
Reference for the fact that $K$ is separable here: math.stackexchange.com/questions/974233/…
– user25959
Dec 9 at 1:18
add a comment |
1
Hint: A compact metric space is separable.
– Math1000
Dec 9 at 0:13
@Math1000 So it suffices to prove that $X$ is compact? would you mind explain a bit more how to prove that? It is not so obvious to me.
– whereamI
Dec 9 at 0:59
$X$ won't be compact (it is unbounded). @Math1000 is referring to $K$ being the compact metric space.
– user25959
Dec 9 at 1:18
Reference for the fact that $K$ is separable here: math.stackexchange.com/questions/974233/…
– user25959
Dec 9 at 1:18
1
1
Hint: A compact metric space is separable.
– Math1000
Dec 9 at 0:13
Hint: A compact metric space is separable.
– Math1000
Dec 9 at 0:13
@Math1000 So it suffices to prove that $X$ is compact? would you mind explain a bit more how to prove that? It is not so obvious to me.
– whereamI
Dec 9 at 0:59
@Math1000 So it suffices to prove that $X$ is compact? would you mind explain a bit more how to prove that? It is not so obvious to me.
– whereamI
Dec 9 at 0:59
$X$ won't be compact (it is unbounded). @Math1000 is referring to $K$ being the compact metric space.
– user25959
Dec 9 at 1:18
$X$ won't be compact (it is unbounded). @Math1000 is referring to $K$ being the compact metric space.
– user25959
Dec 9 at 1:18
Reference for the fact that $K$ is separable here: math.stackexchange.com/questions/974233/…
– user25959
Dec 9 at 1:18
Reference for the fact that $K$ is separable here: math.stackexchange.com/questions/974233/…
– user25959
Dec 9 at 1:18
add a comment |
1 Answer
1
active
oldest
votes
Once you have proven the hint in the comments, let $(x_1,x_2,ldots)$ be a countable dense sequence of $K$. Let $Q$ denote the rationals (or if you are working over $mathbb{C}$, the set of complex numbers of the form $p+qi$ for $p,q$ rational). Observe that the set $Qx_1 := {qx_1: qin Q}$ is countable. As is $Qx_1+Qx_2 := {u+v:uin Qx_1, vin Qx_2}$, and more generally, the set $C:=$ finite $Q$-linear combinations of ${x_i}$ is countable (this follows because a countable union of countable sets is countable).
Side claim: $X = $ closure of set of all finite linear combinations of elements of $K$, i.e. $X=overline{{x in H: x=sum_{i=1}^{N} alpha_i k_i text{ for some } Nin mathbb{N},alpha_iin mathbb{F},k_iin K}}$ (this is an easy proof).
Now what remains is to show that $C$ is dense in $X$. You can do this by showing that within $varepsilon/2$ of any $vin X$, there is some $u=$ a finite $mathbb{F}$-linear combination of elements of $K$; and within $varepsilon/2$ of $u$ there is an element $c$ of $C$.
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
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%2f3031803%2fprove-a-subspace-is-separable%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
Once you have proven the hint in the comments, let $(x_1,x_2,ldots)$ be a countable dense sequence of $K$. Let $Q$ denote the rationals (or if you are working over $mathbb{C}$, the set of complex numbers of the form $p+qi$ for $p,q$ rational). Observe that the set $Qx_1 := {qx_1: qin Q}$ is countable. As is $Qx_1+Qx_2 := {u+v:uin Qx_1, vin Qx_2}$, and more generally, the set $C:=$ finite $Q$-linear combinations of ${x_i}$ is countable (this follows because a countable union of countable sets is countable).
Side claim: $X = $ closure of set of all finite linear combinations of elements of $K$, i.e. $X=overline{{x in H: x=sum_{i=1}^{N} alpha_i k_i text{ for some } Nin mathbb{N},alpha_iin mathbb{F},k_iin K}}$ (this is an easy proof).
Now what remains is to show that $C$ is dense in $X$. You can do this by showing that within $varepsilon/2$ of any $vin X$, there is some $u=$ a finite $mathbb{F}$-linear combination of elements of $K$; and within $varepsilon/2$ of $u$ there is an element $c$ of $C$.
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
add a comment |
Once you have proven the hint in the comments, let $(x_1,x_2,ldots)$ be a countable dense sequence of $K$. Let $Q$ denote the rationals (or if you are working over $mathbb{C}$, the set of complex numbers of the form $p+qi$ for $p,q$ rational). Observe that the set $Qx_1 := {qx_1: qin Q}$ is countable. As is $Qx_1+Qx_2 := {u+v:uin Qx_1, vin Qx_2}$, and more generally, the set $C:=$ finite $Q$-linear combinations of ${x_i}$ is countable (this follows because a countable union of countable sets is countable).
Side claim: $X = $ closure of set of all finite linear combinations of elements of $K$, i.e. $X=overline{{x in H: x=sum_{i=1}^{N} alpha_i k_i text{ for some } Nin mathbb{N},alpha_iin mathbb{F},k_iin K}}$ (this is an easy proof).
Now what remains is to show that $C$ is dense in $X$. You can do this by showing that within $varepsilon/2$ of any $vin X$, there is some $u=$ a finite $mathbb{F}$-linear combination of elements of $K$; and within $varepsilon/2$ of $u$ there is an element $c$ of $C$.
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
add a comment |
Once you have proven the hint in the comments, let $(x_1,x_2,ldots)$ be a countable dense sequence of $K$. Let $Q$ denote the rationals (or if you are working over $mathbb{C}$, the set of complex numbers of the form $p+qi$ for $p,q$ rational). Observe that the set $Qx_1 := {qx_1: qin Q}$ is countable. As is $Qx_1+Qx_2 := {u+v:uin Qx_1, vin Qx_2}$, and more generally, the set $C:=$ finite $Q$-linear combinations of ${x_i}$ is countable (this follows because a countable union of countable sets is countable).
Side claim: $X = $ closure of set of all finite linear combinations of elements of $K$, i.e. $X=overline{{x in H: x=sum_{i=1}^{N} alpha_i k_i text{ for some } Nin mathbb{N},alpha_iin mathbb{F},k_iin K}}$ (this is an easy proof).
Now what remains is to show that $C$ is dense in $X$. You can do this by showing that within $varepsilon/2$ of any $vin X$, there is some $u=$ a finite $mathbb{F}$-linear combination of elements of $K$; and within $varepsilon/2$ of $u$ there is an element $c$ of $C$.
Once you have proven the hint in the comments, let $(x_1,x_2,ldots)$ be a countable dense sequence of $K$. Let $Q$ denote the rationals (or if you are working over $mathbb{C}$, the set of complex numbers of the form $p+qi$ for $p,q$ rational). Observe that the set $Qx_1 := {qx_1: qin Q}$ is countable. As is $Qx_1+Qx_2 := {u+v:uin Qx_1, vin Qx_2}$, and more generally, the set $C:=$ finite $Q$-linear combinations of ${x_i}$ is countable (this follows because a countable union of countable sets is countable).
Side claim: $X = $ closure of set of all finite linear combinations of elements of $K$, i.e. $X=overline{{x in H: x=sum_{i=1}^{N} alpha_i k_i text{ for some } Nin mathbb{N},alpha_iin mathbb{F},k_iin K}}$ (this is an easy proof).
Now what remains is to show that $C$ is dense in $X$. You can do this by showing that within $varepsilon/2$ of any $vin X$, there is some $u=$ a finite $mathbb{F}$-linear combination of elements of $K$; and within $varepsilon/2$ of $u$ there is an element $c$ of $C$.
answered Dec 9 at 1:14
user25959
1,563816
1,563816
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
add a comment |
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
Thanks a lot! I forget that the smallest closed subspace can be written as the closure of linear combinations of elements of $K$.
– whereamI
Dec 9 at 1:22
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%2f3031803%2fprove-a-subspace-is-separable%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
1
Hint: A compact metric space is separable.
– Math1000
Dec 9 at 0:13
@Math1000 So it suffices to prove that $X$ is compact? would you mind explain a bit more how to prove that? It is not so obvious to me.
– whereamI
Dec 9 at 0:59
$X$ won't be compact (it is unbounded). @Math1000 is referring to $K$ being the compact metric space.
– user25959
Dec 9 at 1:18
Reference for the fact that $K$ is separable here: math.stackexchange.com/questions/974233/…
– user25959
Dec 9 at 1:18