Do homomorphisms preserve subgroups?
$begingroup$
Let $(A, cdot), (B, ast)$ be groups, and $phi: A mapsto B$ a homomorphism. Then:
$$ S leq A Rightarrow phi(S) leq B $$
I think this must be a false statement, because there is no guarantee that $textrm{Ker}(phi) subset S$. Yet, I have written the following proof for this statement:
begin{align*}
&quad; S leq A \
&{text{definition of subgroup}} \
&Leftrightarrow forall s, t in S mid s cdot t in S ;wedge; s^{-1} in S \
&{text{definition of set inclusion}} \
&Leftrightarrow forall s, t in S mid (exists u in S mid s cdot t = u) ;wedge; (exists v in S mid v = s^{-1}) \
&{text{(problematic step?) $phi$ is well-defined, so $x = y Rightarrow phi(x) = phi(y)$}} \
&Rightarrow forall phi(s), phi(t) in phi(S) mid (exists phi(u) in phi(S) mid phi(s cdot t) = phi(u)) ;wedge; (exists phi(v) in phi(S) mid phi(v) = phi(s^{-1})) \
&{text{definition of set inclusion}} \
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s cdot t) in phi(S) ;wedge; phi(s^{-1}) in phi(S) \
&{text{$phi$ is a homomorphism, thus preserves the product, and inverse}}\
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s) ast phi(t) in phi(S) ;wedge; {phi(s)}^{-1} in phi(S) \
&{text{definition of subgroup}} \
&Leftrightarrow phi(S) leq B
end{align*}
I think the (weakest) correct statement should be:
$$ textrm{Ker}(phi) subset S ;wedge; S leq A Rightarrow phi(S) leq B $$
Is this the case? If yes, how can I correct my proof to capture this issue? If not, why not?
group-theory proof-verification proof-explanation
$endgroup$
|
show 3 more comments
$begingroup$
Let $(A, cdot), (B, ast)$ be groups, and $phi: A mapsto B$ a homomorphism. Then:
$$ S leq A Rightarrow phi(S) leq B $$
I think this must be a false statement, because there is no guarantee that $textrm{Ker}(phi) subset S$. Yet, I have written the following proof for this statement:
begin{align*}
&quad; S leq A \
&{text{definition of subgroup}} \
&Leftrightarrow forall s, t in S mid s cdot t in S ;wedge; s^{-1} in S \
&{text{definition of set inclusion}} \
&Leftrightarrow forall s, t in S mid (exists u in S mid s cdot t = u) ;wedge; (exists v in S mid v = s^{-1}) \
&{text{(problematic step?) $phi$ is well-defined, so $x = y Rightarrow phi(x) = phi(y)$}} \
&Rightarrow forall phi(s), phi(t) in phi(S) mid (exists phi(u) in phi(S) mid phi(s cdot t) = phi(u)) ;wedge; (exists phi(v) in phi(S) mid phi(v) = phi(s^{-1})) \
&{text{definition of set inclusion}} \
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s cdot t) in phi(S) ;wedge; phi(s^{-1}) in phi(S) \
&{text{$phi$ is a homomorphism, thus preserves the product, and inverse}}\
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s) ast phi(t) in phi(S) ;wedge; {phi(s)}^{-1} in phi(S) \
&{text{definition of subgroup}} \
&Leftrightarrow phi(S) leq B
end{align*}
I think the (weakest) correct statement should be:
$$ textrm{Ker}(phi) subset S ;wedge; S leq A Rightarrow phi(S) leq B $$
Is this the case? If yes, how can I correct my proof to capture this issue? If not, why not?
group-theory proof-verification proof-explanation
$endgroup$
2
$begingroup$
But it is not a false statement.
$endgroup$
– Tobias Kildetoft
Dec 2 '18 at 21:36
$begingroup$
Your condition in the end will guarantee something strictly better, namely that $S = phi^{-1}(phi(S))$.
$endgroup$
– Jef L
Dec 2 '18 at 21:37
$begingroup$
@TobiasKildetoft So I must be misunderstanding something! Shouldn't we also need the guarantee that $textrm{Ker}(phi) subset S$? There might be subgroups of $A$ which do not contain $textrm{Ker}{phi}$?
$endgroup$
– user89
Dec 2 '18 at 21:56
2
$begingroup$
Why do you think that $phi(S)$ being a subgroup of $B$ hinges on whether $mbox{Ker}(phi)subset S$? Suppose that $phi(s)=1$ for all $sin S$. Then $phi(S)={1}$ is definitely a subgroup of $B$.
$endgroup$
– Scounged
Dec 2 '18 at 22:33
1
$begingroup$
@user89 Note that homomorphisms always map the identity to the identity due to the property $phi(st)=phi(s)phi(t)$, so the kernel of $phi$ is never empty. And since $S$ is a subgroup it will definitely contain the identity element.
$endgroup$
– Scounged
Dec 2 '18 at 22:46
|
show 3 more comments
$begingroup$
Let $(A, cdot), (B, ast)$ be groups, and $phi: A mapsto B$ a homomorphism. Then:
$$ S leq A Rightarrow phi(S) leq B $$
I think this must be a false statement, because there is no guarantee that $textrm{Ker}(phi) subset S$. Yet, I have written the following proof for this statement:
begin{align*}
&quad; S leq A \
&{text{definition of subgroup}} \
&Leftrightarrow forall s, t in S mid s cdot t in S ;wedge; s^{-1} in S \
&{text{definition of set inclusion}} \
&Leftrightarrow forall s, t in S mid (exists u in S mid s cdot t = u) ;wedge; (exists v in S mid v = s^{-1}) \
&{text{(problematic step?) $phi$ is well-defined, so $x = y Rightarrow phi(x) = phi(y)$}} \
&Rightarrow forall phi(s), phi(t) in phi(S) mid (exists phi(u) in phi(S) mid phi(s cdot t) = phi(u)) ;wedge; (exists phi(v) in phi(S) mid phi(v) = phi(s^{-1})) \
&{text{definition of set inclusion}} \
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s cdot t) in phi(S) ;wedge; phi(s^{-1}) in phi(S) \
&{text{$phi$ is a homomorphism, thus preserves the product, and inverse}}\
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s) ast phi(t) in phi(S) ;wedge; {phi(s)}^{-1} in phi(S) \
&{text{definition of subgroup}} \
&Leftrightarrow phi(S) leq B
end{align*}
I think the (weakest) correct statement should be:
$$ textrm{Ker}(phi) subset S ;wedge; S leq A Rightarrow phi(S) leq B $$
Is this the case? If yes, how can I correct my proof to capture this issue? If not, why not?
group-theory proof-verification proof-explanation
$endgroup$
Let $(A, cdot), (B, ast)$ be groups, and $phi: A mapsto B$ a homomorphism. Then:
$$ S leq A Rightarrow phi(S) leq B $$
I think this must be a false statement, because there is no guarantee that $textrm{Ker}(phi) subset S$. Yet, I have written the following proof for this statement:
begin{align*}
&quad; S leq A \
&{text{definition of subgroup}} \
&Leftrightarrow forall s, t in S mid s cdot t in S ;wedge; s^{-1} in S \
&{text{definition of set inclusion}} \
&Leftrightarrow forall s, t in S mid (exists u in S mid s cdot t = u) ;wedge; (exists v in S mid v = s^{-1}) \
&{text{(problematic step?) $phi$ is well-defined, so $x = y Rightarrow phi(x) = phi(y)$}} \
&Rightarrow forall phi(s), phi(t) in phi(S) mid (exists phi(u) in phi(S) mid phi(s cdot t) = phi(u)) ;wedge; (exists phi(v) in phi(S) mid phi(v) = phi(s^{-1})) \
&{text{definition of set inclusion}} \
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s cdot t) in phi(S) ;wedge; phi(s^{-1}) in phi(S) \
&{text{$phi$ is a homomorphism, thus preserves the product, and inverse}}\
&Leftrightarrow forall phi(s), phi(t) in phi(S) midphi(s) ast phi(t) in phi(S) ;wedge; {phi(s)}^{-1} in phi(S) \
&{text{definition of subgroup}} \
&Leftrightarrow phi(S) leq B
end{align*}
I think the (weakest) correct statement should be:
$$ textrm{Ker}(phi) subset S ;wedge; S leq A Rightarrow phi(S) leq B $$
Is this the case? If yes, how can I correct my proof to capture this issue? If not, why not?
group-theory proof-verification proof-explanation
group-theory proof-verification proof-explanation
edited Dec 2 '18 at 22:09
user89
asked Dec 2 '18 at 21:32
user89user89
6031647
6031647
2
$begingroup$
But it is not a false statement.
$endgroup$
– Tobias Kildetoft
Dec 2 '18 at 21:36
$begingroup$
Your condition in the end will guarantee something strictly better, namely that $S = phi^{-1}(phi(S))$.
$endgroup$
– Jef L
Dec 2 '18 at 21:37
$begingroup$
@TobiasKildetoft So I must be misunderstanding something! Shouldn't we also need the guarantee that $textrm{Ker}(phi) subset S$? There might be subgroups of $A$ which do not contain $textrm{Ker}{phi}$?
$endgroup$
– user89
Dec 2 '18 at 21:56
2
$begingroup$
Why do you think that $phi(S)$ being a subgroup of $B$ hinges on whether $mbox{Ker}(phi)subset S$? Suppose that $phi(s)=1$ for all $sin S$. Then $phi(S)={1}$ is definitely a subgroup of $B$.
$endgroup$
– Scounged
Dec 2 '18 at 22:33
1
$begingroup$
@user89 Note that homomorphisms always map the identity to the identity due to the property $phi(st)=phi(s)phi(t)$, so the kernel of $phi$ is never empty. And since $S$ is a subgroup it will definitely contain the identity element.
$endgroup$
– Scounged
Dec 2 '18 at 22:46
|
show 3 more comments
2
$begingroup$
But it is not a false statement.
$endgroup$
– Tobias Kildetoft
Dec 2 '18 at 21:36
$begingroup$
Your condition in the end will guarantee something strictly better, namely that $S = phi^{-1}(phi(S))$.
$endgroup$
– Jef L
Dec 2 '18 at 21:37
$begingroup$
@TobiasKildetoft So I must be misunderstanding something! Shouldn't we also need the guarantee that $textrm{Ker}(phi) subset S$? There might be subgroups of $A$ which do not contain $textrm{Ker}{phi}$?
$endgroup$
– user89
Dec 2 '18 at 21:56
2
$begingroup$
Why do you think that $phi(S)$ being a subgroup of $B$ hinges on whether $mbox{Ker}(phi)subset S$? Suppose that $phi(s)=1$ for all $sin S$. Then $phi(S)={1}$ is definitely a subgroup of $B$.
$endgroup$
– Scounged
Dec 2 '18 at 22:33
1
$begingroup$
@user89 Note that homomorphisms always map the identity to the identity due to the property $phi(st)=phi(s)phi(t)$, so the kernel of $phi$ is never empty. And since $S$ is a subgroup it will definitely contain the identity element.
$endgroup$
– Scounged
Dec 2 '18 at 22:46
2
2
$begingroup$
But it is not a false statement.
$endgroup$
– Tobias Kildetoft
Dec 2 '18 at 21:36
$begingroup$
But it is not a false statement.
$endgroup$
– Tobias Kildetoft
Dec 2 '18 at 21:36
$begingroup$
Your condition in the end will guarantee something strictly better, namely that $S = phi^{-1}(phi(S))$.
$endgroup$
– Jef L
Dec 2 '18 at 21:37
$begingroup$
Your condition in the end will guarantee something strictly better, namely that $S = phi^{-1}(phi(S))$.
$endgroup$
– Jef L
Dec 2 '18 at 21:37
$begingroup$
@TobiasKildetoft So I must be misunderstanding something! Shouldn't we also need the guarantee that $textrm{Ker}(phi) subset S$? There might be subgroups of $A$ which do not contain $textrm{Ker}{phi}$?
$endgroup$
– user89
Dec 2 '18 at 21:56
$begingroup$
@TobiasKildetoft So I must be misunderstanding something! Shouldn't we also need the guarantee that $textrm{Ker}(phi) subset S$? There might be subgroups of $A$ which do not contain $textrm{Ker}{phi}$?
$endgroup$
– user89
Dec 2 '18 at 21:56
2
2
$begingroup$
Why do you think that $phi(S)$ being a subgroup of $B$ hinges on whether $mbox{Ker}(phi)subset S$? Suppose that $phi(s)=1$ for all $sin S$. Then $phi(S)={1}$ is definitely a subgroup of $B$.
$endgroup$
– Scounged
Dec 2 '18 at 22:33
$begingroup$
Why do you think that $phi(S)$ being a subgroup of $B$ hinges on whether $mbox{Ker}(phi)subset S$? Suppose that $phi(s)=1$ for all $sin S$. Then $phi(S)={1}$ is definitely a subgroup of $B$.
$endgroup$
– Scounged
Dec 2 '18 at 22:33
1
1
$begingroup$
@user89 Note that homomorphisms always map the identity to the identity due to the property $phi(st)=phi(s)phi(t)$, so the kernel of $phi$ is never empty. And since $S$ is a subgroup it will definitely contain the identity element.
$endgroup$
– Scounged
Dec 2 '18 at 22:46
$begingroup$
@user89 Note that homomorphisms always map the identity to the identity due to the property $phi(st)=phi(s)phi(t)$, so the kernel of $phi$ is never empty. And since $S$ is a subgroup it will definitely contain the identity element.
$endgroup$
– Scounged
Dec 2 '18 at 22:46
|
show 3 more comments
0
active
oldest
votes
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%2f3023228%2fdo-homomorphisms-preserve-subgroups%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3023228%2fdo-homomorphisms-preserve-subgroups%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$
But it is not a false statement.
$endgroup$
– Tobias Kildetoft
Dec 2 '18 at 21:36
$begingroup$
Your condition in the end will guarantee something strictly better, namely that $S = phi^{-1}(phi(S))$.
$endgroup$
– Jef L
Dec 2 '18 at 21:37
$begingroup$
@TobiasKildetoft So I must be misunderstanding something! Shouldn't we also need the guarantee that $textrm{Ker}(phi) subset S$? There might be subgroups of $A$ which do not contain $textrm{Ker}{phi}$?
$endgroup$
– user89
Dec 2 '18 at 21:56
2
$begingroup$
Why do you think that $phi(S)$ being a subgroup of $B$ hinges on whether $mbox{Ker}(phi)subset S$? Suppose that $phi(s)=1$ for all $sin S$. Then $phi(S)={1}$ is definitely a subgroup of $B$.
$endgroup$
– Scounged
Dec 2 '18 at 22:33
1
$begingroup$
@user89 Note that homomorphisms always map the identity to the identity due to the property $phi(st)=phi(s)phi(t)$, so the kernel of $phi$ is never empty. And since $S$ is a subgroup it will definitely contain the identity element.
$endgroup$
– Scounged
Dec 2 '18 at 22:46