Understanding explicit bijection between two sets
$begingroup$
I'm having a lot difficulty understanding the concept of explicit bijection and how to show an explicit bijection between two sets. My professor rushed through the topic during class and now I'm trying some practice problems and I'm so lost :(
How do I go about showing an explicit bijection? For example, (0,1) and [4,8)? What difference does ( and [ make?
Thanks so much.
functions discrete-mathematics
$endgroup$
add a comment |
$begingroup$
I'm having a lot difficulty understanding the concept of explicit bijection and how to show an explicit bijection between two sets. My professor rushed through the topic during class and now I'm trying some practice problems and I'm so lost :(
How do I go about showing an explicit bijection? For example, (0,1) and [4,8)? What difference does ( and [ make?
Thanks so much.
functions discrete-mathematics
$endgroup$
$begingroup$
The ( and [ mean that you cannot use for example $f(x)=4x+4$ as that will not send any $x in (0,1)$ to $4 in [4,8)$
$endgroup$
– Henry
Oct 12 '15 at 23:23
$begingroup$
$(0, 1) = {x : 0 < x < 1}$ and $[4, 8) = {x : 4 le x < 8}$; parenthesis are with points that aren't included (note the strict inequalities) while brackets are for points that are included. See interval notation
$endgroup$
– pjs36
Oct 12 '15 at 23:27
add a comment |
$begingroup$
I'm having a lot difficulty understanding the concept of explicit bijection and how to show an explicit bijection between two sets. My professor rushed through the topic during class and now I'm trying some practice problems and I'm so lost :(
How do I go about showing an explicit bijection? For example, (0,1) and [4,8)? What difference does ( and [ make?
Thanks so much.
functions discrete-mathematics
$endgroup$
I'm having a lot difficulty understanding the concept of explicit bijection and how to show an explicit bijection between two sets. My professor rushed through the topic during class and now I'm trying some practice problems and I'm so lost :(
How do I go about showing an explicit bijection? For example, (0,1) and [4,8)? What difference does ( and [ make?
Thanks so much.
functions discrete-mathematics
functions discrete-mathematics
edited Jan 10 at 22:01
Ethan Bolker
42.6k549113
42.6k549113
asked Oct 12 '15 at 23:20
CandiceCandice
162
162
$begingroup$
The ( and [ mean that you cannot use for example $f(x)=4x+4$ as that will not send any $x in (0,1)$ to $4 in [4,8)$
$endgroup$
– Henry
Oct 12 '15 at 23:23
$begingroup$
$(0, 1) = {x : 0 < x < 1}$ and $[4, 8) = {x : 4 le x < 8}$; parenthesis are with points that aren't included (note the strict inequalities) while brackets are for points that are included. See interval notation
$endgroup$
– pjs36
Oct 12 '15 at 23:27
add a comment |
$begingroup$
The ( and [ mean that you cannot use for example $f(x)=4x+4$ as that will not send any $x in (0,1)$ to $4 in [4,8)$
$endgroup$
– Henry
Oct 12 '15 at 23:23
$begingroup$
$(0, 1) = {x : 0 < x < 1}$ and $[4, 8) = {x : 4 le x < 8}$; parenthesis are with points that aren't included (note the strict inequalities) while brackets are for points that are included. See interval notation
$endgroup$
– pjs36
Oct 12 '15 at 23:27
$begingroup$
The ( and [ mean that you cannot use for example $f(x)=4x+4$ as that will not send any $x in (0,1)$ to $4 in [4,8)$
$endgroup$
– Henry
Oct 12 '15 at 23:23
$begingroup$
The ( and [ mean that you cannot use for example $f(x)=4x+4$ as that will not send any $x in (0,1)$ to $4 in [4,8)$
$endgroup$
– Henry
Oct 12 '15 at 23:23
$begingroup$
$(0, 1) = {x : 0 < x < 1}$ and $[4, 8) = {x : 4 le x < 8}$; parenthesis are with points that aren't included (note the strict inequalities) while brackets are for points that are included. See interval notation
$endgroup$
– pjs36
Oct 12 '15 at 23:27
$begingroup$
$(0, 1) = {x : 0 < x < 1}$ and $[4, 8) = {x : 4 le x < 8}$; parenthesis are with points that aren't included (note the strict inequalities) while brackets are for points that are included. See interval notation
$endgroup$
– pjs36
Oct 12 '15 at 23:27
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The main difference that [ makes is, it complicates the example ;)
First, an uncomplicated example: here's a bijection $(0,1) to (4,8):
$$ x mapsto 4 + 4x$$
This first maps $x in (0,1)$ to $4x in (0,4)$ – that itself is a bijection – and then (via another bijection) translates $(0,4)$ to $(4,8)$.
You can biject any two open, closed, open-closed, or closed-open intervals in a similar way, with a simple linear function.
If $f colon A to B$ and $g colon B to C$ are bijections, then $g circ f colon A to C$ is a bijection. To show that a bijection exists from $(0,1) to [4,8)$, you only need to show that there is one from $(4,8)$ to $[4,8)$.
It's harder to specify a bijection from $(4,8)$ to $[4,8)$. Certainly it can't be order-preserving. It's best in this case to settle for its mere existence: the union of an infinite set $S$ with a finite set $F$ is an infinite set of the same size, which means: there exists a bijection $S to S cup F$.
$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%2f1477252%2funderstanding-explicit-bijection-between-two-sets%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$
The main difference that [ makes is, it complicates the example ;)
First, an uncomplicated example: here's a bijection $(0,1) to (4,8):
$$ x mapsto 4 + 4x$$
This first maps $x in (0,1)$ to $4x in (0,4)$ – that itself is a bijection – and then (via another bijection) translates $(0,4)$ to $(4,8)$.
You can biject any two open, closed, open-closed, or closed-open intervals in a similar way, with a simple linear function.
If $f colon A to B$ and $g colon B to C$ are bijections, then $g circ f colon A to C$ is a bijection. To show that a bijection exists from $(0,1) to [4,8)$, you only need to show that there is one from $(4,8)$ to $[4,8)$.
It's harder to specify a bijection from $(4,8)$ to $[4,8)$. Certainly it can't be order-preserving. It's best in this case to settle for its mere existence: the union of an infinite set $S$ with a finite set $F$ is an infinite set of the same size, which means: there exists a bijection $S to S cup F$.
$endgroup$
add a comment |
$begingroup$
The main difference that [ makes is, it complicates the example ;)
First, an uncomplicated example: here's a bijection $(0,1) to (4,8):
$$ x mapsto 4 + 4x$$
This first maps $x in (0,1)$ to $4x in (0,4)$ – that itself is a bijection – and then (via another bijection) translates $(0,4)$ to $(4,8)$.
You can biject any two open, closed, open-closed, or closed-open intervals in a similar way, with a simple linear function.
If $f colon A to B$ and $g colon B to C$ are bijections, then $g circ f colon A to C$ is a bijection. To show that a bijection exists from $(0,1) to [4,8)$, you only need to show that there is one from $(4,8)$ to $[4,8)$.
It's harder to specify a bijection from $(4,8)$ to $[4,8)$. Certainly it can't be order-preserving. It's best in this case to settle for its mere existence: the union of an infinite set $S$ with a finite set $F$ is an infinite set of the same size, which means: there exists a bijection $S to S cup F$.
$endgroup$
add a comment |
$begingroup$
The main difference that [ makes is, it complicates the example ;)
First, an uncomplicated example: here's a bijection $(0,1) to (4,8):
$$ x mapsto 4 + 4x$$
This first maps $x in (0,1)$ to $4x in (0,4)$ – that itself is a bijection – and then (via another bijection) translates $(0,4)$ to $(4,8)$.
You can biject any two open, closed, open-closed, or closed-open intervals in a similar way, with a simple linear function.
If $f colon A to B$ and $g colon B to C$ are bijections, then $g circ f colon A to C$ is a bijection. To show that a bijection exists from $(0,1) to [4,8)$, you only need to show that there is one from $(4,8)$ to $[4,8)$.
It's harder to specify a bijection from $(4,8)$ to $[4,8)$. Certainly it can't be order-preserving. It's best in this case to settle for its mere existence: the union of an infinite set $S$ with a finite set $F$ is an infinite set of the same size, which means: there exists a bijection $S to S cup F$.
$endgroup$
The main difference that [ makes is, it complicates the example ;)
First, an uncomplicated example: here's a bijection $(0,1) to (4,8):
$$ x mapsto 4 + 4x$$
This first maps $x in (0,1)$ to $4x in (0,4)$ – that itself is a bijection – and then (via another bijection) translates $(0,4)$ to $(4,8)$.
You can biject any two open, closed, open-closed, or closed-open intervals in a similar way, with a simple linear function.
If $f colon A to B$ and $g colon B to C$ are bijections, then $g circ f colon A to C$ is a bijection. To show that a bijection exists from $(0,1) to [4,8)$, you only need to show that there is one from $(4,8)$ to $[4,8)$.
It's harder to specify a bijection from $(4,8)$ to $[4,8)$. Certainly it can't be order-preserving. It's best in this case to settle for its mere existence: the union of an infinite set $S$ with a finite set $F$ is an infinite set of the same size, which means: there exists a bijection $S to S cup F$.
answered Oct 12 '15 at 23:46
BrianOBrianO
14.3k1822
14.3k1822
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%2f1477252%2funderstanding-explicit-bijection-between-two-sets%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

$begingroup$
The ( and [ mean that you cannot use for example $f(x)=4x+4$ as that will not send any $x in (0,1)$ to $4 in [4,8)$
$endgroup$
– Henry
Oct 12 '15 at 23:23
$begingroup$
$(0, 1) = {x : 0 < x < 1}$ and $[4, 8) = {x : 4 le x < 8}$; parenthesis are with points that aren't included (note the strict inequalities) while brackets are for points that are included. See interval notation
$endgroup$
– pjs36
Oct 12 '15 at 23:27