What is wrong with this fake proof that subgroup of a cyclic group is cyclic?

Clash Royale CLAN TAG#URR8PPP
up vote
5
down vote
favorite
Let $G$ be a cyclic group generated by $a$ and $H$ its subgroup. This is a proof by contradiction. Assume there is no $r$ in $H$ such that $langle r rangle = H$. If some $s$ in $G$ is not in $H$ then $langle s rangle neq H$. So for all $s$ in $G$, $langle
s rangle neq H$ Thus for all $s$ in $G$ there exists an $hin H$ such that $h notin langle s rangle$. But this is a contradiction with the fact that $a$ generates $G$.
I know this proof is fake, because it does not use the fact that $H$ is a subgroup but I am unable to find the mistake(s).
fake-proofs
add a comment |Â
up vote
5
down vote
favorite
Let $G$ be a cyclic group generated by $a$ and $H$ its subgroup. This is a proof by contradiction. Assume there is no $r$ in $H$ such that $langle r rangle = H$. If some $s$ in $G$ is not in $H$ then $langle s rangle neq H$. So for all $s$ in $G$, $langle
s rangle neq H$ Thus for all $s$ in $G$ there exists an $hin H$ such that $h notin langle s rangle$. But this is a contradiction with the fact that $a$ generates $G$.
I know this proof is fake, because it does not use the fact that $H$ is a subgroup but I am unable to find the mistake(s).
fake-proofs
add a comment |Â
up vote
5
down vote
favorite
up vote
5
down vote
favorite
Let $G$ be a cyclic group generated by $a$ and $H$ its subgroup. This is a proof by contradiction. Assume there is no $r$ in $H$ such that $langle r rangle = H$. If some $s$ in $G$ is not in $H$ then $langle s rangle neq H$. So for all $s$ in $G$, $langle
s rangle neq H$ Thus for all $s$ in $G$ there exists an $hin H$ such that $h notin langle s rangle$. But this is a contradiction with the fact that $a$ generates $G$.
I know this proof is fake, because it does not use the fact that $H$ is a subgroup but I am unable to find the mistake(s).
fake-proofs
Let $G$ be a cyclic group generated by $a$ and $H$ its subgroup. This is a proof by contradiction. Assume there is no $r$ in $H$ such that $langle r rangle = H$. If some $s$ in $G$ is not in $H$ then $langle s rangle neq H$. So for all $s$ in $G$, $langle
s rangle neq H$ Thus for all $s$ in $G$ there exists an $hin H$ such that $h notin langle s rangle$. But this is a contradiction with the fact that $a$ generates $G$.
I know this proof is fake, because it does not use the fact that $H$ is a subgroup but I am unable to find the mistake(s).
fake-proofs
fake-proofs
asked 3 hours ago
Adam
1,4411536
1,4411536
add a comment |Â
add a comment |Â
3 Answers
3
active
oldest
votes
up vote
6
down vote
accepted
You are correct in proving that, for every $xin G$, $langle xranglene H$. But this doesn't imply that, for every $xin G$, there is $hin H$ such that $hnotinlangle xrangle$.
For instance, this is false as soon as $Hne G$ and $x$ is a generator of $G$.
add a comment |Â
up vote
3
down vote
No $sin G$ such that $langle srangle=H$ is clear.
But then you can't follow with for all $sin G$ there's $hin H$ such that $hnotinlangle srangle$ because $H$ could be a subset of $langle srangle$ even though $snotin G$.
Which, incidentally, is what happens if $s$ is a generator of $G$
add a comment |Â
up vote
1
down vote
It is correct that $forall s in G, langle srangle ne H$, but this does not imply $exists h in H, h notin langle srangle$, because $langle srangle$ may be a proper superset of $H$.
add a comment |Â
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
6
down vote
accepted
You are correct in proving that, for every $xin G$, $langle xranglene H$. But this doesn't imply that, for every $xin G$, there is $hin H$ such that $hnotinlangle xrangle$.
For instance, this is false as soon as $Hne G$ and $x$ is a generator of $G$.
add a comment |Â
up vote
6
down vote
accepted
You are correct in proving that, for every $xin G$, $langle xranglene H$. But this doesn't imply that, for every $xin G$, there is $hin H$ such that $hnotinlangle xrangle$.
For instance, this is false as soon as $Hne G$ and $x$ is a generator of $G$.
add a comment |Â
up vote
6
down vote
accepted
up vote
6
down vote
accepted
You are correct in proving that, for every $xin G$, $langle xranglene H$. But this doesn't imply that, for every $xin G$, there is $hin H$ such that $hnotinlangle xrangle$.
For instance, this is false as soon as $Hne G$ and $x$ is a generator of $G$.
You are correct in proving that, for every $xin G$, $langle xranglene H$. But this doesn't imply that, for every $xin G$, there is $hin H$ such that $hnotinlangle xrangle$.
For instance, this is false as soon as $Hne G$ and $x$ is a generator of $G$.
answered 3 hours ago
egreg
170k1283192
170k1283192
add a comment |Â
add a comment |Â
up vote
3
down vote
No $sin G$ such that $langle srangle=H$ is clear.
But then you can't follow with for all $sin G$ there's $hin H$ such that $hnotinlangle srangle$ because $H$ could be a subset of $langle srangle$ even though $snotin G$.
Which, incidentally, is what happens if $s$ is a generator of $G$
add a comment |Â
up vote
3
down vote
No $sin G$ such that $langle srangle=H$ is clear.
But then you can't follow with for all $sin G$ there's $hin H$ such that $hnotinlangle srangle$ because $H$ could be a subset of $langle srangle$ even though $snotin G$.
Which, incidentally, is what happens if $s$ is a generator of $G$
add a comment |Â
up vote
3
down vote
up vote
3
down vote
No $sin G$ such that $langle srangle=H$ is clear.
But then you can't follow with for all $sin G$ there's $hin H$ such that $hnotinlangle srangle$ because $H$ could be a subset of $langle srangle$ even though $snotin G$.
Which, incidentally, is what happens if $s$ is a generator of $G$
No $sin G$ such that $langle srangle=H$ is clear.
But then you can't follow with for all $sin G$ there's $hin H$ such that $hnotinlangle srangle$ because $H$ could be a subset of $langle srangle$ even though $snotin G$.
Which, incidentally, is what happens if $s$ is a generator of $G$
answered 3 hours ago
Andrea Mori
19.2k13465
19.2k13465
add a comment |Â
add a comment |Â
up vote
1
down vote
It is correct that $forall s in G, langle srangle ne H$, but this does not imply $exists h in H, h notin langle srangle$, because $langle srangle$ may be a proper superset of $H$.
add a comment |Â
up vote
1
down vote
It is correct that $forall s in G, langle srangle ne H$, but this does not imply $exists h in H, h notin langle srangle$, because $langle srangle$ may be a proper superset of $H$.
add a comment |Â
up vote
1
down vote
up vote
1
down vote
It is correct that $forall s in G, langle srangle ne H$, but this does not imply $exists h in H, h notin langle srangle$, because $langle srangle$ may be a proper superset of $H$.
It is correct that $forall s in G, langle srangle ne H$, but this does not imply $exists h in H, h notin langle srangle$, because $langle srangle$ may be a proper superset of $H$.
answered 3 hours ago
fkraiem
2,8361510
2,8361510
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2966084%2fwhat-is-wrong-with-this-fake-proof-that-subgroup-of-a-cyclic-group-is-cyclic%23new-answer', 'question_page');
);
Post as a guest
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
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
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
