Proof by contradiction for one to one relation
$begingroup$
Prove the following statement by contradiction:
Let $f:A to B$. Then $f^{−1}:Range(f) to A$ implies $f$ is one-to-one.
I can deduce why the statement must be true but i am having trouble using a proof by contradiction.
My proof so far assumes that $f$ is not one to one and $f^{−1}:Range(f) to A$,
Which implies that the inverse function in not a function, which is a contradiction.
FSOC assume that $f:A to B$ is not 1 to 1 and $f^{-1}:Ran(f) to A$
$therefore exists y in B | y=f(a_1 )=f(a_2 )$,where $a_1 neq a_2$
$therefore exists a_1$ and $exists a_2 in Dom(f)$ where $a_1 neq a_2 | f(a_1 )=f(a_2 )=y_1$
$(therefore f^{-1} (Ran(f))$ is not a function because it does not pass the vertical line test.#)
Is this proof acceptable?
discrete-mathematics proof-writing
$endgroup$
add a comment |
$begingroup$
Prove the following statement by contradiction:
Let $f:A to B$. Then $f^{−1}:Range(f) to A$ implies $f$ is one-to-one.
I can deduce why the statement must be true but i am having trouble using a proof by contradiction.
My proof so far assumes that $f$ is not one to one and $f^{−1}:Range(f) to A$,
Which implies that the inverse function in not a function, which is a contradiction.
FSOC assume that $f:A to B$ is not 1 to 1 and $f^{-1}:Ran(f) to A$
$therefore exists y in B | y=f(a_1 )=f(a_2 )$,where $a_1 neq a_2$
$therefore exists a_1$ and $exists a_2 in Dom(f)$ where $a_1 neq a_2 | f(a_1 )=f(a_2 )=y_1$
$(therefore f^{-1} (Ran(f))$ is not a function because it does not pass the vertical line test.#)
Is this proof acceptable?
discrete-mathematics proof-writing
$endgroup$
add a comment |
$begingroup$
Prove the following statement by contradiction:
Let $f:A to B$. Then $f^{−1}:Range(f) to A$ implies $f$ is one-to-one.
I can deduce why the statement must be true but i am having trouble using a proof by contradiction.
My proof so far assumes that $f$ is not one to one and $f^{−1}:Range(f) to A$,
Which implies that the inverse function in not a function, which is a contradiction.
FSOC assume that $f:A to B$ is not 1 to 1 and $f^{-1}:Ran(f) to A$
$therefore exists y in B | y=f(a_1 )=f(a_2 )$,where $a_1 neq a_2$
$therefore exists a_1$ and $exists a_2 in Dom(f)$ where $a_1 neq a_2 | f(a_1 )=f(a_2 )=y_1$
$(therefore f^{-1} (Ran(f))$ is not a function because it does not pass the vertical line test.#)
Is this proof acceptable?
discrete-mathematics proof-writing
$endgroup$
Prove the following statement by contradiction:
Let $f:A to B$. Then $f^{−1}:Range(f) to A$ implies $f$ is one-to-one.
I can deduce why the statement must be true but i am having trouble using a proof by contradiction.
My proof so far assumes that $f$ is not one to one and $f^{−1}:Range(f) to A$,
Which implies that the inverse function in not a function, which is a contradiction.
FSOC assume that $f:A to B$ is not 1 to 1 and $f^{-1}:Ran(f) to A$
$therefore exists y in B | y=f(a_1 )=f(a_2 )$,where $a_1 neq a_2$
$therefore exists a_1$ and $exists a_2 in Dom(f)$ where $a_1 neq a_2 | f(a_1 )=f(a_2 )=y_1$
$(therefore f^{-1} (Ran(f))$ is not a function because it does not pass the vertical line test.#)
Is this proof acceptable?
discrete-mathematics proof-writing
discrete-mathematics proof-writing
edited Nov 28 '18 at 6:35
platty
3,370320
3,370320
asked Nov 28 '18 at 6:30
Kedar YadavKedar Yadav
42
42
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, it is acceptable. Note that from your second point, it follows that $exists y in Range(f)$ such that $ f^{-1}(y) = a_{1} = a_{2}$, which contradicts the fact that $f^{-1}$ is a function.
$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%2f3016812%2fproof-by-contradiction-for-one-to-one-relation%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$
Yes, it is acceptable. Note that from your second point, it follows that $exists y in Range(f)$ such that $ f^{-1}(y) = a_{1} = a_{2}$, which contradicts the fact that $f^{-1}$ is a function.
$endgroup$
add a comment |
$begingroup$
Yes, it is acceptable. Note that from your second point, it follows that $exists y in Range(f)$ such that $ f^{-1}(y) = a_{1} = a_{2}$, which contradicts the fact that $f^{-1}$ is a function.
$endgroup$
add a comment |
$begingroup$
Yes, it is acceptable. Note that from your second point, it follows that $exists y in Range(f)$ such that $ f^{-1}(y) = a_{1} = a_{2}$, which contradicts the fact that $f^{-1}$ is a function.
$endgroup$
Yes, it is acceptable. Note that from your second point, it follows that $exists y in Range(f)$ such that $ f^{-1}(y) = a_{1} = a_{2}$, which contradicts the fact that $f^{-1}$ is a function.
answered Nov 28 '18 at 6:46
user1430user1430
507
507
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%2f3016812%2fproof-by-contradiction-for-one-to-one-relation%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