Open and closed subgroups of continous functions with max metric
$begingroup$
Looking at the metric space C[-1,1] with the max metric.
Show that only one of the following subgroups is open.
How many of them are closed?
$A = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0);, f(x)<0 ,,, forall x in [0,1]}$
$B = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0];, f(x)<0 ,,, forall x in (0,1]}$
$C = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0);, f(x) leq 0 ,,, forall x in [0,1]}$
$D = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0];, f(x) leq 0 ,,, forall x in (0,1]}$
I think $A,B$ are not closed because the sequence $f_n(x)=-frac{1}{n}$ when $nrightarrow infty$ will converge to $f(x)=0$, which is not in either of them.
I still have no idea as for $C,D$ being closed or not, and which of the subgroups is open.
Thanks.
metric-spaces
$endgroup$
|
show 3 more comments
$begingroup$
Looking at the metric space C[-1,1] with the max metric.
Show that only one of the following subgroups is open.
How many of them are closed?
$A = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0);, f(x)<0 ,,, forall x in [0,1]}$
$B = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0];, f(x)<0 ,,, forall x in (0,1]}$
$C = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0);, f(x) leq 0 ,,, forall x in [0,1]}$
$D = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0];, f(x) leq 0 ,,, forall x in (0,1]}$
I think $A,B$ are not closed because the sequence $f_n(x)=-frac{1}{n}$ when $nrightarrow infty$ will converge to $f(x)=0$, which is not in either of them.
I still have no idea as for $C,D$ being closed or not, and which of the subgroups is open.
Thanks.
metric-spaces
$endgroup$
1
$begingroup$
Hint: Consider functions with $f(0) = 0$.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 2:18
$begingroup$
Thanks! I can see how this helps with groups being open / not open. But I'm still now sure about C,D being closed or not
$endgroup$
– shahaf finder
Dec 8 '18 at 16:41
1
$begingroup$
if $y_n to y$ and for all $n, y_n le 1$. Is it possible that $y > 1$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 18:43
1
$begingroup$
Let $f_n to f$ with $f_n in C$ for all $n$. What can you prove about $f$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:19
1
$begingroup$
In this case $C[-1,1]$ is first-countable, so identifying limit points by sequences is sufficient. But it is not necessary for this argument. I just used sequences as an example to get you thinking about it. You could use more general limits, or turn the argument around and show that every function not in $C$ (resp. $D$) has a neighborhood that misses it.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:35
|
show 3 more comments
$begingroup$
Looking at the metric space C[-1,1] with the max metric.
Show that only one of the following subgroups is open.
How many of them are closed?
$A = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0);, f(x)<0 ,,, forall x in [0,1]}$
$B = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0];, f(x)<0 ,,, forall x in (0,1]}$
$C = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0);, f(x) leq 0 ,,, forall x in [0,1]}$
$D = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0];, f(x) leq 0 ,,, forall x in (0,1]}$
I think $A,B$ are not closed because the sequence $f_n(x)=-frac{1}{n}$ when $nrightarrow infty$ will converge to $f(x)=0$, which is not in either of them.
I still have no idea as for $C,D$ being closed or not, and which of the subgroups is open.
Thanks.
metric-spaces
$endgroup$
Looking at the metric space C[-1,1] with the max metric.
Show that only one of the following subgroups is open.
How many of them are closed?
$A = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0);, f(x)<0 ,,, forall x in [0,1]}$
$B = {f in C[-1,1] : f(x)<1 ,,,forall x in [-1,0];, f(x)<0 ,,, forall x in (0,1]}$
$C = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0);, f(x) leq 0 ,,, forall x in [0,1]}$
$D = {f in C[-1,1] : f(x) leq 1 ,,,forall x in [-1,0];, f(x) leq 0 ,,, forall x in (0,1]}$
I think $A,B$ are not closed because the sequence $f_n(x)=-frac{1}{n}$ when $nrightarrow infty$ will converge to $f(x)=0$, which is not in either of them.
I still have no idea as for $C,D$ being closed or not, and which of the subgroups is open.
Thanks.
metric-spaces
metric-spaces
edited Dec 7 '18 at 15:47
shahaf finder
asked Dec 7 '18 at 15:29
shahaf findershahaf finder
262
262
1
$begingroup$
Hint: Consider functions with $f(0) = 0$.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 2:18
$begingroup$
Thanks! I can see how this helps with groups being open / not open. But I'm still now sure about C,D being closed or not
$endgroup$
– shahaf finder
Dec 8 '18 at 16:41
1
$begingroup$
if $y_n to y$ and for all $n, y_n le 1$. Is it possible that $y > 1$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 18:43
1
$begingroup$
Let $f_n to f$ with $f_n in C$ for all $n$. What can you prove about $f$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:19
1
$begingroup$
In this case $C[-1,1]$ is first-countable, so identifying limit points by sequences is sufficient. But it is not necessary for this argument. I just used sequences as an example to get you thinking about it. You could use more general limits, or turn the argument around and show that every function not in $C$ (resp. $D$) has a neighborhood that misses it.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:35
|
show 3 more comments
1
$begingroup$
Hint: Consider functions with $f(0) = 0$.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 2:18
$begingroup$
Thanks! I can see how this helps with groups being open / not open. But I'm still now sure about C,D being closed or not
$endgroup$
– shahaf finder
Dec 8 '18 at 16:41
1
$begingroup$
if $y_n to y$ and for all $n, y_n le 1$. Is it possible that $y > 1$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 18:43
1
$begingroup$
Let $f_n to f$ with $f_n in C$ for all $n$. What can you prove about $f$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:19
1
$begingroup$
In this case $C[-1,1]$ is first-countable, so identifying limit points by sequences is sufficient. But it is not necessary for this argument. I just used sequences as an example to get you thinking about it. You could use more general limits, or turn the argument around and show that every function not in $C$ (resp. $D$) has a neighborhood that misses it.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:35
1
1
$begingroup$
Hint: Consider functions with $f(0) = 0$.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 2:18
$begingroup$
Hint: Consider functions with $f(0) = 0$.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 2:18
$begingroup$
Thanks! I can see how this helps with groups being open / not open. But I'm still now sure about C,D being closed or not
$endgroup$
– shahaf finder
Dec 8 '18 at 16:41
$begingroup$
Thanks! I can see how this helps with groups being open / not open. But I'm still now sure about C,D being closed or not
$endgroup$
– shahaf finder
Dec 8 '18 at 16:41
1
1
$begingroup$
if $y_n to y$ and for all $n, y_n le 1$. Is it possible that $y > 1$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 18:43
$begingroup$
if $y_n to y$ and for all $n, y_n le 1$. Is it possible that $y > 1$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 18:43
1
1
$begingroup$
Let $f_n to f$ with $f_n in C$ for all $n$. What can you prove about $f$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:19
$begingroup$
Let $f_n to f$ with $f_n in C$ for all $n$. What can you prove about $f$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:19
1
1
$begingroup$
In this case $C[-1,1]$ is first-countable, so identifying limit points by sequences is sufficient. But it is not necessary for this argument. I just used sequences as an example to get you thinking about it. You could use more general limits, or turn the argument around and show that every function not in $C$ (resp. $D$) has a neighborhood that misses it.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:35
$begingroup$
In this case $C[-1,1]$ is first-countable, so identifying limit points by sequences is sufficient. But it is not necessary for this argument. I just used sequences as an example to get you thinking about it. You could use more general limits, or turn the argument around and show that every function not in $C$ (resp. $D$) has a neighborhood that misses it.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:35
|
show 3 more comments
0
active
oldest
votes
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%2f3030010%2fopen-and-closed-subgroups-of-continous-functions-with-max-metric%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3030010%2fopen-and-closed-subgroups-of-continous-functions-with-max-metric%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
$begingroup$
Hint: Consider functions with $f(0) = 0$.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 2:18
$begingroup$
Thanks! I can see how this helps with groups being open / not open. But I'm still now sure about C,D being closed or not
$endgroup$
– shahaf finder
Dec 8 '18 at 16:41
1
$begingroup$
if $y_n to y$ and for all $n, y_n le 1$. Is it possible that $y > 1$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 18:43
1
$begingroup$
Let $f_n to f$ with $f_n in C$ for all $n$. What can you prove about $f$?
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:19
1
$begingroup$
In this case $C[-1,1]$ is first-countable, so identifying limit points by sequences is sufficient. But it is not necessary for this argument. I just used sequences as an example to get you thinking about it. You could use more general limits, or turn the argument around and show that every function not in $C$ (resp. $D$) has a neighborhood that misses it.
$endgroup$
– Paul Sinclair
Dec 8 '18 at 19:35