Prove $f[A] subseteq f[B] Rightarrow A ⊆ B$, given f is injective.
$begingroup$
I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:
(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)
Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.
discrete-mathematics proof-verification elementary-set-theory
$endgroup$
add a comment |
$begingroup$
I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:
(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)
Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.
discrete-mathematics proof-verification elementary-set-theory
$endgroup$
$begingroup$
You should write the question properly. What's $f,A,B$?
$endgroup$
– Yanko
Jan 4 at 16:31
1
$begingroup$
How do you conclude that $ain B$? That's where you should use injectivity
$endgroup$
– Exodd
Jan 4 at 16:33
1
$begingroup$
The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
$endgroup$
– Michael Burr
Jan 4 at 16:40
add a comment |
$begingroup$
I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:
(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)
Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.
discrete-mathematics proof-verification elementary-set-theory
$endgroup$
I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:
(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)
Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.
discrete-mathematics proof-verification elementary-set-theory
discrete-mathematics proof-verification elementary-set-theory
edited Jan 4 at 16:40
Foobaz John
22.7k41452
22.7k41452
asked Jan 4 at 16:29
Julia KimJulia Kim
174
174
$begingroup$
You should write the question properly. What's $f,A,B$?
$endgroup$
– Yanko
Jan 4 at 16:31
1
$begingroup$
How do you conclude that $ain B$? That's where you should use injectivity
$endgroup$
– Exodd
Jan 4 at 16:33
1
$begingroup$
The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
$endgroup$
– Michael Burr
Jan 4 at 16:40
add a comment |
$begingroup$
You should write the question properly. What's $f,A,B$?
$endgroup$
– Yanko
Jan 4 at 16:31
1
$begingroup$
How do you conclude that $ain B$? That's where you should use injectivity
$endgroup$
– Exodd
Jan 4 at 16:33
1
$begingroup$
The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
$endgroup$
– Michael Burr
Jan 4 at 16:40
$begingroup$
You should write the question properly. What's $f,A,B$?
$endgroup$
– Yanko
Jan 4 at 16:31
$begingroup$
You should write the question properly. What's $f,A,B$?
$endgroup$
– Yanko
Jan 4 at 16:31
1
1
$begingroup$
How do you conclude that $ain B$? That's where you should use injectivity
$endgroup$
– Exodd
Jan 4 at 16:33
$begingroup$
How do you conclude that $ain B$? That's where you should use injectivity
$endgroup$
– Exodd
Jan 4 at 16:33
1
1
$begingroup$
The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
$endgroup$
– Michael Burr
Jan 4 at 16:40
$begingroup$
The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
$endgroup$
– Michael Burr
Jan 4 at 16:40
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.
$endgroup$
add a comment |
$begingroup$
Attempt:
Assume $B subset A$ ($B$ proper subset of $A$).
($A$ $B not = emptyset$)
There exists an $a in A$ $B.$
$f(a) in f(A$ $B) subset f(A)$, i.e.
$f(a) in f(A)$;
since $f$ is injective: $f(a) not in f(B)$,
contradicts the assumption $f(A)subset f(B).$
$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%2f3061803%2fprove-fa-subseteq-fb-rightarrow-a-%25e2%258a%2586-b-given-f-is-injective%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.
$endgroup$
add a comment |
$begingroup$
Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.
$endgroup$
add a comment |
$begingroup$
Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.
$endgroup$
Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.
answered Jan 4 at 16:39
Foobaz JohnFoobaz John
22.7k41452
22.7k41452
add a comment |
add a comment |
$begingroup$
Attempt:
Assume $B subset A$ ($B$ proper subset of $A$).
($A$ $B not = emptyset$)
There exists an $a in A$ $B.$
$f(a) in f(A$ $B) subset f(A)$, i.e.
$f(a) in f(A)$;
since $f$ is injective: $f(a) not in f(B)$,
contradicts the assumption $f(A)subset f(B).$
$endgroup$
add a comment |
$begingroup$
Attempt:
Assume $B subset A$ ($B$ proper subset of $A$).
($A$ $B not = emptyset$)
There exists an $a in A$ $B.$
$f(a) in f(A$ $B) subset f(A)$, i.e.
$f(a) in f(A)$;
since $f$ is injective: $f(a) not in f(B)$,
contradicts the assumption $f(A)subset f(B).$
$endgroup$
add a comment |
$begingroup$
Attempt:
Assume $B subset A$ ($B$ proper subset of $A$).
($A$ $B not = emptyset$)
There exists an $a in A$ $B.$
$f(a) in f(A$ $B) subset f(A)$, i.e.
$f(a) in f(A)$;
since $f$ is injective: $f(a) not in f(B)$,
contradicts the assumption $f(A)subset f(B).$
$endgroup$
Attempt:
Assume $B subset A$ ($B$ proper subset of $A$).
($A$ $B not = emptyset$)
There exists an $a in A$ $B.$
$f(a) in f(A$ $B) subset f(A)$, i.e.
$f(a) in f(A)$;
since $f$ is injective: $f(a) not in f(B)$,
contradicts the assumption $f(A)subset f(B).$
answered Jan 4 at 18:51
Peter SzilasPeter Szilas
11.5k2822
11.5k2822
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%2f3061803%2fprove-fa-subseteq-fb-rightarrow-a-%25e2%258a%2586-b-given-f-is-injective%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$
You should write the question properly. What's $f,A,B$?
$endgroup$
– Yanko
Jan 4 at 16:31
1
$begingroup$
How do you conclude that $ain B$? That's where you should use injectivity
$endgroup$
– Exodd
Jan 4 at 16:33
1
$begingroup$
The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
$endgroup$
– Michael Burr
Jan 4 at 16:40