Writing a set of functions
$begingroup$
Let
$A$ be a countable set of subsets of $mathbb{R}$
$f:A rightarrow mathbb{Z}$ be a bijection
$O= {x_k:mathbb{R}rightarrow mathbb{R} mid kin [1,dots, K]subset mathbb{Z}}$, for some $K$ and some given functions $x_k$.
I want to define a set $R$ which contain functions $g:mathbb{Z}rightarrow mathbb{Z}, g(n)= i$ if $x(n) in f^{-1}(i)$, where $xin O$.
I believe that I can write the set $R$ like this
$$
R = left{g:mathbb{Z} rightarrow mathbb{Z}, g(n)= i text{ if } x(n)in f^{-1}(i) mid xin Oright}.
$$
but I'm also considering to write the set like this
$$
R = left{n in mathbb{Z} mapsto i in mathbb{Z} text{ if } x(n)in f^{-1}(i) mid xin O right},
$$
avoiding the introduction of the symbol $g$. Are these ways of writing understandable? Do you have any other suggestions?
functions elementary-set-theory article-writing
$endgroup$
add a comment |
$begingroup$
Let
$A$ be a countable set of subsets of $mathbb{R}$
$f:A rightarrow mathbb{Z}$ be a bijection
$O= {x_k:mathbb{R}rightarrow mathbb{R} mid kin [1,dots, K]subset mathbb{Z}}$, for some $K$ and some given functions $x_k$.
I want to define a set $R$ which contain functions $g:mathbb{Z}rightarrow mathbb{Z}, g(n)= i$ if $x(n) in f^{-1}(i)$, where $xin O$.
I believe that I can write the set $R$ like this
$$
R = left{g:mathbb{Z} rightarrow mathbb{Z}, g(n)= i text{ if } x(n)in f^{-1}(i) mid xin Oright}.
$$
but I'm also considering to write the set like this
$$
R = left{n in mathbb{Z} mapsto i in mathbb{Z} text{ if } x(n)in f^{-1}(i) mid xin O right},
$$
avoiding the introduction of the symbol $g$. Are these ways of writing understandable? Do you have any other suggestions?
functions elementary-set-theory article-writing
$endgroup$
add a comment |
$begingroup$
Let
$A$ be a countable set of subsets of $mathbb{R}$
$f:A rightarrow mathbb{Z}$ be a bijection
$O= {x_k:mathbb{R}rightarrow mathbb{R} mid kin [1,dots, K]subset mathbb{Z}}$, for some $K$ and some given functions $x_k$.
I want to define a set $R$ which contain functions $g:mathbb{Z}rightarrow mathbb{Z}, g(n)= i$ if $x(n) in f^{-1}(i)$, where $xin O$.
I believe that I can write the set $R$ like this
$$
R = left{g:mathbb{Z} rightarrow mathbb{Z}, g(n)= i text{ if } x(n)in f^{-1}(i) mid xin Oright}.
$$
but I'm also considering to write the set like this
$$
R = left{n in mathbb{Z} mapsto i in mathbb{Z} text{ if } x(n)in f^{-1}(i) mid xin O right},
$$
avoiding the introduction of the symbol $g$. Are these ways of writing understandable? Do you have any other suggestions?
functions elementary-set-theory article-writing
$endgroup$
Let
$A$ be a countable set of subsets of $mathbb{R}$
$f:A rightarrow mathbb{Z}$ be a bijection
$O= {x_k:mathbb{R}rightarrow mathbb{R} mid kin [1,dots, K]subset mathbb{Z}}$, for some $K$ and some given functions $x_k$.
I want to define a set $R$ which contain functions $g:mathbb{Z}rightarrow mathbb{Z}, g(n)= i$ if $x(n) in f^{-1}(i)$, where $xin O$.
I believe that I can write the set $R$ like this
$$
R = left{g:mathbb{Z} rightarrow mathbb{Z}, g(n)= i text{ if } x(n)in f^{-1}(i) mid xin Oright}.
$$
but I'm also considering to write the set like this
$$
R = left{n in mathbb{Z} mapsto i in mathbb{Z} text{ if } x(n)in f^{-1}(i) mid xin O right},
$$
avoiding the introduction of the symbol $g$. Are these ways of writing understandable? Do you have any other suggestions?
functions elementary-set-theory article-writing
functions elementary-set-theory article-writing
edited Dec 5 '18 at 12:37
Andrés E. Caicedo
65k8158246
65k8158246
asked Dec 5 '18 at 8:36
AngelosAngelos
788
788
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Formally, a set is written in the form ${x :|: P(x) }$ with $P(x)$ describing the properties of a set $x$ to be contained in the set in question. Of course, this is relaxed a bit in practice (for example writing ${x in mathbb{R} :|: x^2 geq 2}$ instead of ${x :|: x in mathbb{R} text{ and } x^2 geq 2}$ or even ${x^2 :|: x in mathbb{R}}$ instead of ${y :|: text{ there exists } x in mathbb{R} text{ such that } y = x^2}$ ), but in general, the properties your elements have to satisfy should still all come after the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: ...}$.
Your description of $R$ is not completely clear, there are two possible in
terpretations coming to my mind:
a) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then $x(n) in f^{-1}(i)$.
b) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ we have $x(n) in f^{-1}(g(n))$.
a) We have $g in R$ if for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then there exists $x in O$ such that we have $x(n) in f^{-1}(i)$.
b) We have $g in R$ if for all $n in mathbb{Z}$ there exists $x in O$ such that we have $x(n) in f^{-1}(g(n))$.
(the descriptions 1 a) and b) describe the same set as do 2 a) and 2 b), the a) parts are more in the flavor you used in your question, whereas the b) parts are a bit shorter)
If one of these two adequately describes what you want, then you can just take the part of the sentence beginning after if and write the part behind the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: text{ there exists } x in O ...}$.
$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%2f3026814%2fwriting-a-set-of-functions%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$
Formally, a set is written in the form ${x :|: P(x) }$ with $P(x)$ describing the properties of a set $x$ to be contained in the set in question. Of course, this is relaxed a bit in practice (for example writing ${x in mathbb{R} :|: x^2 geq 2}$ instead of ${x :|: x in mathbb{R} text{ and } x^2 geq 2}$ or even ${x^2 :|: x in mathbb{R}}$ instead of ${y :|: text{ there exists } x in mathbb{R} text{ such that } y = x^2}$ ), but in general, the properties your elements have to satisfy should still all come after the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: ...}$.
Your description of $R$ is not completely clear, there are two possible in
terpretations coming to my mind:
a) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then $x(n) in f^{-1}(i)$.
b) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ we have $x(n) in f^{-1}(g(n))$.
a) We have $g in R$ if for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then there exists $x in O$ such that we have $x(n) in f^{-1}(i)$.
b) We have $g in R$ if for all $n in mathbb{Z}$ there exists $x in O$ such that we have $x(n) in f^{-1}(g(n))$.
(the descriptions 1 a) and b) describe the same set as do 2 a) and 2 b), the a) parts are more in the flavor you used in your question, whereas the b) parts are a bit shorter)
If one of these two adequately describes what you want, then you can just take the part of the sentence beginning after if and write the part behind the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: text{ there exists } x in O ...}$.
$endgroup$
add a comment |
$begingroup$
Formally, a set is written in the form ${x :|: P(x) }$ with $P(x)$ describing the properties of a set $x$ to be contained in the set in question. Of course, this is relaxed a bit in practice (for example writing ${x in mathbb{R} :|: x^2 geq 2}$ instead of ${x :|: x in mathbb{R} text{ and } x^2 geq 2}$ or even ${x^2 :|: x in mathbb{R}}$ instead of ${y :|: text{ there exists } x in mathbb{R} text{ such that } y = x^2}$ ), but in general, the properties your elements have to satisfy should still all come after the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: ...}$.
Your description of $R$ is not completely clear, there are two possible in
terpretations coming to my mind:
a) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then $x(n) in f^{-1}(i)$.
b) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ we have $x(n) in f^{-1}(g(n))$.
a) We have $g in R$ if for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then there exists $x in O$ such that we have $x(n) in f^{-1}(i)$.
b) We have $g in R$ if for all $n in mathbb{Z}$ there exists $x in O$ such that we have $x(n) in f^{-1}(g(n))$.
(the descriptions 1 a) and b) describe the same set as do 2 a) and 2 b), the a) parts are more in the flavor you used in your question, whereas the b) parts are a bit shorter)
If one of these two adequately describes what you want, then you can just take the part of the sentence beginning after if and write the part behind the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: text{ there exists } x in O ...}$.
$endgroup$
add a comment |
$begingroup$
Formally, a set is written in the form ${x :|: P(x) }$ with $P(x)$ describing the properties of a set $x$ to be contained in the set in question. Of course, this is relaxed a bit in practice (for example writing ${x in mathbb{R} :|: x^2 geq 2}$ instead of ${x :|: x in mathbb{R} text{ and } x^2 geq 2}$ or even ${x^2 :|: x in mathbb{R}}$ instead of ${y :|: text{ there exists } x in mathbb{R} text{ such that } y = x^2}$ ), but in general, the properties your elements have to satisfy should still all come after the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: ...}$.
Your description of $R$ is not completely clear, there are two possible in
terpretations coming to my mind:
a) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then $x(n) in f^{-1}(i)$.
b) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ we have $x(n) in f^{-1}(g(n))$.
a) We have $g in R$ if for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then there exists $x in O$ such that we have $x(n) in f^{-1}(i)$.
b) We have $g in R$ if for all $n in mathbb{Z}$ there exists $x in O$ such that we have $x(n) in f^{-1}(g(n))$.
(the descriptions 1 a) and b) describe the same set as do 2 a) and 2 b), the a) parts are more in the flavor you used in your question, whereas the b) parts are a bit shorter)
If one of these two adequately describes what you want, then you can just take the part of the sentence beginning after if and write the part behind the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: text{ there exists } x in O ...}$.
$endgroup$
Formally, a set is written in the form ${x :|: P(x) }$ with $P(x)$ describing the properties of a set $x$ to be contained in the set in question. Of course, this is relaxed a bit in practice (for example writing ${x in mathbb{R} :|: x^2 geq 2}$ instead of ${x :|: x in mathbb{R} text{ and } x^2 geq 2}$ or even ${x^2 :|: x in mathbb{R}}$ instead of ${y :|: text{ there exists } x in mathbb{R} text{ such that } y = x^2}$ ), but in general, the properties your elements have to satisfy should still all come after the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: ...}$.
Your description of $R$ is not completely clear, there are two possible in
terpretations coming to my mind:
a) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then $x(n) in f^{-1}(i)$.
b) We have $g in R$ if there exists $x in O$ such that for all $n in mathbb{Z}$ we have $x(n) in f^{-1}(g(n))$.
a) We have $g in R$ if for all $n in mathbb{Z}$ and $i in mathbb{Z}$ if we have $g(n) = i$, then there exists $x in O$ such that we have $x(n) in f^{-1}(i)$.
b) We have $g in R$ if for all $n in mathbb{Z}$ there exists $x in O$ such that we have $x(n) in f^{-1}(g(n))$.
(the descriptions 1 a) and b) describe the same set as do 2 a) and 2 b), the a) parts are more in the flavor you used in your question, whereas the b) parts are a bit shorter)
If one of these two adequately describes what you want, then you can just take the part of the sentence beginning after if and write the part behind the bar, i.e. $R = {g : mathbb{Z} to mathbb{Z} :|: text{ there exists } x in O ...}$.
answered Dec 5 '18 at 9:23
Matthias KlupschMatthias Klupsch
6,1591227
6,1591227
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%2f3026814%2fwriting-a-set-of-functions%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