choose the coorect option $1)$ $K$ is uncountable $2)$ $K$ is finite.
$begingroup$
Let $Ksubset mathbb{C}$ be a bounded set. Let $H(mathbb{C})$ denote the set of all entire functions and let $C(K)$ denote the set of all continuous functions on $K$. Consider the restriction map $r:H(mathbb{C})rightarrow C(K)$ by $r(f)=f|_K.$ Then $r$ is injective if
then choose the coorect option
$1)$ $K$ is uncountable
$2)$ $K$ is finite.
My attempt : $K$ must be finite because $K$ is bounded as we know that bounded set are generally countable set so , option $1)$ is false
Is its True ?
Any hints/solution will be appreciated
thanks u
complex-analysis
$endgroup$
add a comment |
$begingroup$
Let $Ksubset mathbb{C}$ be a bounded set. Let $H(mathbb{C})$ denote the set of all entire functions and let $C(K)$ denote the set of all continuous functions on $K$. Consider the restriction map $r:H(mathbb{C})rightarrow C(K)$ by $r(f)=f|_K.$ Then $r$ is injective if
then choose the coorect option
$1)$ $K$ is uncountable
$2)$ $K$ is finite.
My attempt : $K$ must be finite because $K$ is bounded as we know that bounded set are generally countable set so , option $1)$ is false
Is its True ?
Any hints/solution will be appreciated
thanks u
complex-analysis
$endgroup$
2
$begingroup$
Why are bounded sets countable?
$endgroup$
– anomaly
Dec 1 '18 at 22:39
$begingroup$
bounded set is finite so it can be countable @anomaly
$endgroup$
– jasmine
Dec 1 '18 at 22:40
1
$begingroup$
No, a bounded set is not necessarily finite.
$endgroup$
– anomaly
Dec 1 '18 at 23:32
add a comment |
$begingroup$
Let $Ksubset mathbb{C}$ be a bounded set. Let $H(mathbb{C})$ denote the set of all entire functions and let $C(K)$ denote the set of all continuous functions on $K$. Consider the restriction map $r:H(mathbb{C})rightarrow C(K)$ by $r(f)=f|_K.$ Then $r$ is injective if
then choose the coorect option
$1)$ $K$ is uncountable
$2)$ $K$ is finite.
My attempt : $K$ must be finite because $K$ is bounded as we know that bounded set are generally countable set so , option $1)$ is false
Is its True ?
Any hints/solution will be appreciated
thanks u
complex-analysis
$endgroup$
Let $Ksubset mathbb{C}$ be a bounded set. Let $H(mathbb{C})$ denote the set of all entire functions and let $C(K)$ denote the set of all continuous functions on $K$. Consider the restriction map $r:H(mathbb{C})rightarrow C(K)$ by $r(f)=f|_K.$ Then $r$ is injective if
then choose the coorect option
$1)$ $K$ is uncountable
$2)$ $K$ is finite.
My attempt : $K$ must be finite because $K$ is bounded as we know that bounded set are generally countable set so , option $1)$ is false
Is its True ?
Any hints/solution will be appreciated
thanks u
complex-analysis
complex-analysis
asked Dec 1 '18 at 22:37
jasminejasmine
1,689416
1,689416
2
$begingroup$
Why are bounded sets countable?
$endgroup$
– anomaly
Dec 1 '18 at 22:39
$begingroup$
bounded set is finite so it can be countable @anomaly
$endgroup$
– jasmine
Dec 1 '18 at 22:40
1
$begingroup$
No, a bounded set is not necessarily finite.
$endgroup$
– anomaly
Dec 1 '18 at 23:32
add a comment |
2
$begingroup$
Why are bounded sets countable?
$endgroup$
– anomaly
Dec 1 '18 at 22:39
$begingroup$
bounded set is finite so it can be countable @anomaly
$endgroup$
– jasmine
Dec 1 '18 at 22:40
1
$begingroup$
No, a bounded set is not necessarily finite.
$endgroup$
– anomaly
Dec 1 '18 at 23:32
2
2
$begingroup$
Why are bounded sets countable?
$endgroup$
– anomaly
Dec 1 '18 at 22:39
$begingroup$
Why are bounded sets countable?
$endgroup$
– anomaly
Dec 1 '18 at 22:39
$begingroup$
bounded set is finite so it can be countable @anomaly
$endgroup$
– jasmine
Dec 1 '18 at 22:40
$begingroup$
bounded set is finite so it can be countable @anomaly
$endgroup$
– jasmine
Dec 1 '18 at 22:40
1
1
$begingroup$
No, a bounded set is not necessarily finite.
$endgroup$
– anomaly
Dec 1 '18 at 23:32
$begingroup$
No, a bounded set is not necessarily finite.
$endgroup$
– anomaly
Dec 1 '18 at 23:32
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
HINT
First, why your attempt is wrong. $K$ could be infinite and uncountable, take the set of real numbers $[0, 1]$ for example.
Because it's asking if $r$ is injective, you could take a look at the cardinality of the sets $H(mathbb{C})$ and $C(K)$.
$endgroup$
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
1
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
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%2f3021933%2fchoose-the-coorect-option-1-k-is-uncountable-2-k-is-finite%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
$begingroup$
HINT
First, why your attempt is wrong. $K$ could be infinite and uncountable, take the set of real numbers $[0, 1]$ for example.
Because it's asking if $r$ is injective, you could take a look at the cardinality of the sets $H(mathbb{C})$ and $C(K)$.
$endgroup$
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
1
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
add a comment |
$begingroup$
HINT
First, why your attempt is wrong. $K$ could be infinite and uncountable, take the set of real numbers $[0, 1]$ for example.
Because it's asking if $r$ is injective, you could take a look at the cardinality of the sets $H(mathbb{C})$ and $C(K)$.
$endgroup$
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
1
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
add a comment |
$begingroup$
HINT
First, why your attempt is wrong. $K$ could be infinite and uncountable, take the set of real numbers $[0, 1]$ for example.
Because it's asking if $r$ is injective, you could take a look at the cardinality of the sets $H(mathbb{C})$ and $C(K)$.
$endgroup$
HINT
First, why your attempt is wrong. $K$ could be infinite and uncountable, take the set of real numbers $[0, 1]$ for example.
Because it's asking if $r$ is injective, you could take a look at the cardinality of the sets $H(mathbb{C})$ and $C(K)$.
edited Dec 1 '18 at 23:32
anomaly
17.5k42664
17.5k42664
answered Dec 1 '18 at 23:13
EvanHeheheEvanHehehe
1247
1247
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
1
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
add a comment |
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
1
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
$begingroup$
can u give me the example of $H( mathbb{C})$ ?
$endgroup$
– jasmine
Dec 1 '18 at 23:22
1
1
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
$begingroup$
I don't actually know how you would calculate the cardinality of $H(mathbb{C})$, but we can safely say it's infinite. (1) If $K$ is uncountable, $C(K)$ would be infinite. (2) If $K$ is finite, $C(K)$ would be finite as well since it's just the set of all permutations of $K$. Obviously if $C(K)$ is finite $r$ is definitely not an injection, so choose (1)
$endgroup$
– EvanHehehe
Dec 2 '18 at 0:12
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%2f3021933%2fchoose-the-coorect-option-1-k-is-uncountable-2-k-is-finite%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
2
$begingroup$
Why are bounded sets countable?
$endgroup$
– anomaly
Dec 1 '18 at 22:39
$begingroup$
bounded set is finite so it can be countable @anomaly
$endgroup$
– jasmine
Dec 1 '18 at 22:40
1
$begingroup$
No, a bounded set is not necessarily finite.
$endgroup$
– anomaly
Dec 1 '18 at 23:32