Prove that a group with $3$ elements is cyclic?












1












$begingroup$



Prove that a group with $3$ elements is cyclic.




I tried the case where $G={e,a,b}
$
and I kept trying multiplication
and finally I found that
$a^2$ must equal to $b$ and $b^2$ must equal to $a$.
Then $a^3=e$.



Are there any other methods
?
I have another question :




Prove that a group with $4$ elements may or may not be cyclic.







group-theory cyclic-groups







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Another method is to use the Lagrange's Theorem. Using Lagrange Theorem, you can prove that any group of prime order is cyclic.
    $endgroup$
    – Thomas Shelby
    Jan 3 at 17:23










  • $begingroup$
    I think that it doesn't take a lot of work to prove that any group of order $4$ (note that I omitted the word “finite”; are you aware of some infinite group of order $4$?) may by cyclic or not.
    $endgroup$
    – José Carlos Santos
    Jan 3 at 17:31












  • $begingroup$
    I recommend to read my answer here math.stackexchange.com/questions/1570641/…. A similar method works for a group of 4 elements.
    $endgroup$
    – Nicky Hekster
    Jan 3 at 17:52






  • 1




    $begingroup$
    @ThomasShelby: you mean Cauchy's theorem, right? Lagrange's theorem only gives $o(g)mid o(G)$, while Cauchy's theorem ensures $o(G)=pLongrightarrowexists g:o(g)=p$.
    $endgroup$
    – Jack D'Aurizio
    Jan 3 at 20:27






  • 1




    $begingroup$
    @ThomasShelby: all right, I get it. Since the identity is unique and $o(g)mid o(G)$, in a group with prime order all the elements except the identity are generators, fine.
    $endgroup$
    – Jack D'Aurizio
    Jan 4 at 1:22
















1












$begingroup$



Prove that a group with $3$ elements is cyclic.




I tried the case where $G={e,a,b}
$
and I kept trying multiplication
and finally I found that
$a^2$ must equal to $b$ and $b^2$ must equal to $a$.
Then $a^3=e$.



Are there any other methods
?
I have another question :




Prove that a group with $4$ elements may or may not be cyclic.







group-theory cyclic-groups







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Another method is to use the Lagrange's Theorem. Using Lagrange Theorem, you can prove that any group of prime order is cyclic.
    $endgroup$
    – Thomas Shelby
    Jan 3 at 17:23










  • $begingroup$
    I think that it doesn't take a lot of work to prove that any group of order $4$ (note that I omitted the word “finite”; are you aware of some infinite group of order $4$?) may by cyclic or not.
    $endgroup$
    – José Carlos Santos
    Jan 3 at 17:31












  • $begingroup$
    I recommend to read my answer here math.stackexchange.com/questions/1570641/…. A similar method works for a group of 4 elements.
    $endgroup$
    – Nicky Hekster
    Jan 3 at 17:52






  • 1




    $begingroup$
    @ThomasShelby: you mean Cauchy's theorem, right? Lagrange's theorem only gives $o(g)mid o(G)$, while Cauchy's theorem ensures $o(G)=pLongrightarrowexists g:o(g)=p$.
    $endgroup$
    – Jack D'Aurizio
    Jan 3 at 20:27






  • 1




    $begingroup$
    @ThomasShelby: all right, I get it. Since the identity is unique and $o(g)mid o(G)$, in a group with prime order all the elements except the identity are generators, fine.
    $endgroup$
    – Jack D'Aurizio
    Jan 4 at 1:22














1












1








1





$begingroup$



Prove that a group with $3$ elements is cyclic.




I tried the case where $G={e,a,b}
$
and I kept trying multiplication
and finally I found that
$a^2$ must equal to $b$ and $b^2$ must equal to $a$.
Then $a^3=e$.



Are there any other methods
?
I have another question :




Prove that a group with $4$ elements may or may not be cyclic.







group-theory cyclic-groups







share|cite|improve this question











$endgroup$





Prove that a group with $3$ elements is cyclic.




I tried the case where $G={e,a,b}
$
and I kept trying multiplication
and finally I found that
$a^2$ must equal to $b$ and $b^2$ must equal to $a$.
Then $a^3=e$.



Are there any other methods
?
I have another question :




Prove that a group with $4$ elements may or may not be cyclic.







group-theory cyclic-groups




group-theory cyclic-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 3 at 17:36









Thomas Shelby

3,7492525




3,7492525










asked Jan 3 at 17:16









El MoudenEl Mouden

11810




11810








  • 1




    $begingroup$
    Another method is to use the Lagrange's Theorem. Using Lagrange Theorem, you can prove that any group of prime order is cyclic.
    $endgroup$
    – Thomas Shelby
    Jan 3 at 17:23










  • $begingroup$
    I think that it doesn't take a lot of work to prove that any group of order $4$ (note that I omitted the word “finite”; are you aware of some infinite group of order $4$?) may by cyclic or not.
    $endgroup$
    – José Carlos Santos
    Jan 3 at 17:31












  • $begingroup$
    I recommend to read my answer here math.stackexchange.com/questions/1570641/…. A similar method works for a group of 4 elements.
    $endgroup$
    – Nicky Hekster
    Jan 3 at 17:52






  • 1




    $begingroup$
    @ThomasShelby: you mean Cauchy's theorem, right? Lagrange's theorem only gives $o(g)mid o(G)$, while Cauchy's theorem ensures $o(G)=pLongrightarrowexists g:o(g)=p$.
    $endgroup$
    – Jack D'Aurizio
    Jan 3 at 20:27






  • 1




    $begingroup$
    @ThomasShelby: all right, I get it. Since the identity is unique and $o(g)mid o(G)$, in a group with prime order all the elements except the identity are generators, fine.
    $endgroup$
    – Jack D'Aurizio
    Jan 4 at 1:22














  • 1




    $begingroup$
    Another method is to use the Lagrange's Theorem. Using Lagrange Theorem, you can prove that any group of prime order is cyclic.
    $endgroup$
    – Thomas Shelby
    Jan 3 at 17:23










  • $begingroup$
    I think that it doesn't take a lot of work to prove that any group of order $4$ (note that I omitted the word “finite”; are you aware of some infinite group of order $4$?) may by cyclic or not.
    $endgroup$
    – José Carlos Santos
    Jan 3 at 17:31












  • $begingroup$
    I recommend to read my answer here math.stackexchange.com/questions/1570641/…. A similar method works for a group of 4 elements.
    $endgroup$
    – Nicky Hekster
    Jan 3 at 17:52






  • 1




    $begingroup$
    @ThomasShelby: you mean Cauchy's theorem, right? Lagrange's theorem only gives $o(g)mid o(G)$, while Cauchy's theorem ensures $o(G)=pLongrightarrowexists g:o(g)=p$.
    $endgroup$
    – Jack D'Aurizio
    Jan 3 at 20:27






  • 1




    $begingroup$
    @ThomasShelby: all right, I get it. Since the identity is unique and $o(g)mid o(G)$, in a group with prime order all the elements except the identity are generators, fine.
    $endgroup$
    – Jack D'Aurizio
    Jan 4 at 1:22








1




1




$begingroup$
Another method is to use the Lagrange's Theorem. Using Lagrange Theorem, you can prove that any group of prime order is cyclic.
$endgroup$
– Thomas Shelby
Jan 3 at 17:23




$begingroup$
Another method is to use the Lagrange's Theorem. Using Lagrange Theorem, you can prove that any group of prime order is cyclic.
$endgroup$
– Thomas Shelby
Jan 3 at 17:23












$begingroup$
I think that it doesn't take a lot of work to prove that any group of order $4$ (note that I omitted the word “finite”; are you aware of some infinite group of order $4$?) may by cyclic or not.
$endgroup$
– José Carlos Santos
Jan 3 at 17:31






$begingroup$
I think that it doesn't take a lot of work to prove that any group of order $4$ (note that I omitted the word “finite”; are you aware of some infinite group of order $4$?) may by cyclic or not.
$endgroup$
– José Carlos Santos
Jan 3 at 17:31














$begingroup$
I recommend to read my answer here math.stackexchange.com/questions/1570641/…. A similar method works for a group of 4 elements.
$endgroup$
– Nicky Hekster
Jan 3 at 17:52




$begingroup$
I recommend to read my answer here math.stackexchange.com/questions/1570641/…. A similar method works for a group of 4 elements.
$endgroup$
– Nicky Hekster
Jan 3 at 17:52




1




1




$begingroup$
@ThomasShelby: you mean Cauchy's theorem, right? Lagrange's theorem only gives $o(g)mid o(G)$, while Cauchy's theorem ensures $o(G)=pLongrightarrowexists g:o(g)=p$.
$endgroup$
– Jack D'Aurizio
Jan 3 at 20:27




$begingroup$
@ThomasShelby: you mean Cauchy's theorem, right? Lagrange's theorem only gives $o(g)mid o(G)$, while Cauchy's theorem ensures $o(G)=pLongrightarrowexists g:o(g)=p$.
$endgroup$
– Jack D'Aurizio
Jan 3 at 20:27




1




1




$begingroup$
@ThomasShelby: all right, I get it. Since the identity is unique and $o(g)mid o(G)$, in a group with prime order all the elements except the identity are generators, fine.
$endgroup$
– Jack D'Aurizio
Jan 4 at 1:22




$begingroup$
@ThomasShelby: all right, I get it. Since the identity is unique and $o(g)mid o(G)$, in a group with prime order all the elements except the identity are generators, fine.
$endgroup$
– Jack D'Aurizio
Jan 4 at 1:22










2 Answers
2






active

oldest

votes


















1












$begingroup$

According to Lagrange's theorem, a group with 3 elements can have only the trivial subgroups. Because 3 is prime only 1 and 3 divide it. So, only possible subgroups are ${e}$ with one element and $G$ with three. For $x in G$ that is not $e$ a group generated with this element,
$<x>$ must be whole $G$. So $G$ is cyclic.



A group with 4 elements can have untrivial subgroups as 4 isn't prime. For instance $mathbb{Z_4} = {0, 1, 2, 3}$ with $+$ is cyclic. It is generated with the element $1$. But group $mathbb{Z_2} times mathbb{Z_2} = {(0, 0), (1, 0), (0, 1), (1, 1)}$ with $+$ defined as $(a, b) + (a', b') = (a + a', b + b')$ is not cyclic.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
    $endgroup$
    – El Mouden
    Jan 8 at 12:23










  • $begingroup$
    We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
    $endgroup$
    – Coupeau
    Jan 9 at 17:49





















3












$begingroup$

Instead of “keeping multiplying” it's easier to fill the Cayley diagram: in every row and column every element must appear.



begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & \
b & b & \
end{array}
In the slot corresponding to $a^2$ you cannot put $e$, because otherwise the slot for $ab$ would contain $b$. Hence $a^2=b$
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b\
b & b & \
end{array}
and now the diagram has a unique completion
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b & e \
b & b & e & a\
end{array}
Then $a^3=a^2a=ba=e$.



You can try your hand with a four element group and see that the diagram admits different completions.



begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & \
b & b & \
c & c &
end{array}
In the slot for $a^2$ we can put any of $e$, $b$ or $c$. Let's try with $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e\
b & b & \
c & c &
end{array}
Then we are forced to put in the following
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c\
c & c & b
end{array}
For $b^2$ we can have either $e$ or $c$. Let's try $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e\
c & c & b &
end{array}
Now we can complete:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e & a\
c & c & b & a & e
end{array}
It would be very tedious to verify that this diagram indeed produces a group. It does and is the product of two cyclic groups of order two; it is also the subgroup of $S_4$ given by ${id,(12)(34),(13)(24),(14)(23)}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I need another proof, without using the Cayley diagram
    $endgroup$
    – El Mouden
    Jan 8 at 12:25












  • $begingroup$
    @ElMouden Then using Lagrange's theorem is what you need.
    $endgroup$
    – egreg
    Jan 8 at 12:59










  • $begingroup$
    Oh Thanks Finally i did it
    $endgroup$
    – El Mouden
    Jan 9 at 14:07











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060789%2fprove-that-a-group-with-3-elements-is-cyclic%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









1












$begingroup$

According to Lagrange's theorem, a group with 3 elements can have only the trivial subgroups. Because 3 is prime only 1 and 3 divide it. So, only possible subgroups are ${e}$ with one element and $G$ with three. For $x in G$ that is not $e$ a group generated with this element,
$<x>$ must be whole $G$. So $G$ is cyclic.



A group with 4 elements can have untrivial subgroups as 4 isn't prime. For instance $mathbb{Z_4} = {0, 1, 2, 3}$ with $+$ is cyclic. It is generated with the element $1$. But group $mathbb{Z_2} times mathbb{Z_2} = {(0, 0), (1, 0), (0, 1), (1, 1)}$ with $+$ defined as $(a, b) + (a', b') = (a + a', b + b')$ is not cyclic.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
    $endgroup$
    – El Mouden
    Jan 8 at 12:23










  • $begingroup$
    We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
    $endgroup$
    – Coupeau
    Jan 9 at 17:49


















1












$begingroup$

According to Lagrange's theorem, a group with 3 elements can have only the trivial subgroups. Because 3 is prime only 1 and 3 divide it. So, only possible subgroups are ${e}$ with one element and $G$ with three. For $x in G$ that is not $e$ a group generated with this element,
$<x>$ must be whole $G$. So $G$ is cyclic.



A group with 4 elements can have untrivial subgroups as 4 isn't prime. For instance $mathbb{Z_4} = {0, 1, 2, 3}$ with $+$ is cyclic. It is generated with the element $1$. But group $mathbb{Z_2} times mathbb{Z_2} = {(0, 0), (1, 0), (0, 1), (1, 1)}$ with $+$ defined as $(a, b) + (a', b') = (a + a', b + b')$ is not cyclic.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
    $endgroup$
    – El Mouden
    Jan 8 at 12:23










  • $begingroup$
    We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
    $endgroup$
    – Coupeau
    Jan 9 at 17:49
















1












1








1





$begingroup$

According to Lagrange's theorem, a group with 3 elements can have only the trivial subgroups. Because 3 is prime only 1 and 3 divide it. So, only possible subgroups are ${e}$ with one element and $G$ with three. For $x in G$ that is not $e$ a group generated with this element,
$<x>$ must be whole $G$. So $G$ is cyclic.



A group with 4 elements can have untrivial subgroups as 4 isn't prime. For instance $mathbb{Z_4} = {0, 1, 2, 3}$ with $+$ is cyclic. It is generated with the element $1$. But group $mathbb{Z_2} times mathbb{Z_2} = {(0, 0), (1, 0), (0, 1), (1, 1)}$ with $+$ defined as $(a, b) + (a', b') = (a + a', b + b')$ is not cyclic.






share|cite|improve this answer









$endgroup$



According to Lagrange's theorem, a group with 3 elements can have only the trivial subgroups. Because 3 is prime only 1 and 3 divide it. So, only possible subgroups are ${e}$ with one element and $G$ with three. For $x in G$ that is not $e$ a group generated with this element,
$<x>$ must be whole $G$. So $G$ is cyclic.



A group with 4 elements can have untrivial subgroups as 4 isn't prime. For instance $mathbb{Z_4} = {0, 1, 2, 3}$ with $+$ is cyclic. It is generated with the element $1$. But group $mathbb{Z_2} times mathbb{Z_2} = {(0, 0), (1, 0), (0, 1), (1, 1)}$ with $+$ defined as $(a, b) + (a', b') = (a + a', b + b')$ is not cyclic.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 3 at 18:13









CoupeauCoupeau

1296




1296












  • $begingroup$
    can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
    $endgroup$
    – El Mouden
    Jan 8 at 12:23










  • $begingroup$
    We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
    $endgroup$
    – Coupeau
    Jan 9 at 17:49




















  • $begingroup$
    can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
    $endgroup$
    – El Mouden
    Jan 8 at 12:23










  • $begingroup$
    We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
    $endgroup$
    – Coupeau
    Jan 9 at 17:49


















$begingroup$
can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
$endgroup$
– El Mouden
Jan 8 at 12:23




$begingroup$
can you explaine in more terms " For x∈G that is not e a group generated with this element, <x> must be whole G. So G is cyclic."
$endgroup$
– El Mouden
Jan 8 at 12:23












$begingroup$
We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
$endgroup$
– Coupeau
Jan 9 at 17:49






$begingroup$
We can take any element (that is not the unit $e$) $x in G$ and by multiplying it with itself, we will get every other element of this group. So let $x in G$. $x x$ is another element that must be in the group but is different from $x$ since we said $x$ is not a unit. So, now we have three distinct elements: $e, x, x^2$. We also know, that since our group can only have either one or three elements, $x^2$ can not be the unit. Now we have the whole $G$.
$endgroup$
– Coupeau
Jan 9 at 17:49













3












$begingroup$

Instead of “keeping multiplying” it's easier to fill the Cayley diagram: in every row and column every element must appear.



begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & \
b & b & \
end{array}
In the slot corresponding to $a^2$ you cannot put $e$, because otherwise the slot for $ab$ would contain $b$. Hence $a^2=b$
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b\
b & b & \
end{array}
and now the diagram has a unique completion
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b & e \
b & b & e & a\
end{array}
Then $a^3=a^2a=ba=e$.



You can try your hand with a four element group and see that the diagram admits different completions.



begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & \
b & b & \
c & c &
end{array}
In the slot for $a^2$ we can put any of $e$, $b$ or $c$. Let's try with $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e\
b & b & \
c & c &
end{array}
Then we are forced to put in the following
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c\
c & c & b
end{array}
For $b^2$ we can have either $e$ or $c$. Let's try $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e\
c & c & b &
end{array}
Now we can complete:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e & a\
c & c & b & a & e
end{array}
It would be very tedious to verify that this diagram indeed produces a group. It does and is the product of two cyclic groups of order two; it is also the subgroup of $S_4$ given by ${id,(12)(34),(13)(24),(14)(23)}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I need another proof, without using the Cayley diagram
    $endgroup$
    – El Mouden
    Jan 8 at 12:25












  • $begingroup$
    @ElMouden Then using Lagrange's theorem is what you need.
    $endgroup$
    – egreg
    Jan 8 at 12:59










  • $begingroup$
    Oh Thanks Finally i did it
    $endgroup$
    – El Mouden
    Jan 9 at 14:07
















3












$begingroup$

Instead of “keeping multiplying” it's easier to fill the Cayley diagram: in every row and column every element must appear.



begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & \
b & b & \
end{array}
In the slot corresponding to $a^2$ you cannot put $e$, because otherwise the slot for $ab$ would contain $b$. Hence $a^2=b$
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b\
b & b & \
end{array}
and now the diagram has a unique completion
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b & e \
b & b & e & a\
end{array}
Then $a^3=a^2a=ba=e$.



You can try your hand with a four element group and see that the diagram admits different completions.



begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & \
b & b & \
c & c &
end{array}
In the slot for $a^2$ we can put any of $e$, $b$ or $c$. Let's try with $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e\
b & b & \
c & c &
end{array}
Then we are forced to put in the following
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c\
c & c & b
end{array}
For $b^2$ we can have either $e$ or $c$. Let's try $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e\
c & c & b &
end{array}
Now we can complete:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e & a\
c & c & b & a & e
end{array}
It would be very tedious to verify that this diagram indeed produces a group. It does and is the product of two cyclic groups of order two; it is also the subgroup of $S_4$ given by ${id,(12)(34),(13)(24),(14)(23)}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I need another proof, without using the Cayley diagram
    $endgroup$
    – El Mouden
    Jan 8 at 12:25












  • $begingroup$
    @ElMouden Then using Lagrange's theorem is what you need.
    $endgroup$
    – egreg
    Jan 8 at 12:59










  • $begingroup$
    Oh Thanks Finally i did it
    $endgroup$
    – El Mouden
    Jan 9 at 14:07














3












3








3





$begingroup$

Instead of “keeping multiplying” it's easier to fill the Cayley diagram: in every row and column every element must appear.



begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & \
b & b & \
end{array}
In the slot corresponding to $a^2$ you cannot put $e$, because otherwise the slot for $ab$ would contain $b$. Hence $a^2=b$
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b\
b & b & \
end{array}
and now the diagram has a unique completion
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b & e \
b & b & e & a\
end{array}
Then $a^3=a^2a=ba=e$.



You can try your hand with a four element group and see that the diagram admits different completions.



begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & \
b & b & \
c & c &
end{array}
In the slot for $a^2$ we can put any of $e$, $b$ or $c$. Let's try with $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e\
b & b & \
c & c &
end{array}
Then we are forced to put in the following
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c\
c & c & b
end{array}
For $b^2$ we can have either $e$ or $c$. Let's try $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e\
c & c & b &
end{array}
Now we can complete:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e & a\
c & c & b & a & e
end{array}
It would be very tedious to verify that this diagram indeed produces a group. It does and is the product of two cyclic groups of order two; it is also the subgroup of $S_4$ given by ${id,(12)(34),(13)(24),(14)(23)}$.






share|cite|improve this answer











$endgroup$



Instead of “keeping multiplying” it's easier to fill the Cayley diagram: in every row and column every element must appear.



begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & \
b & b & \
end{array}
In the slot corresponding to $a^2$ you cannot put $e$, because otherwise the slot for $ab$ would contain $b$. Hence $a^2=b$
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b\
b & b & \
end{array}
and now the diagram has a unique completion
begin{array}{c|ccc}
& e & a & b \ hline
e & e & a & b \
a & a & b & e \
b & b & e & a\
end{array}
Then $a^3=a^2a=ba=e$.



You can try your hand with a four element group and see that the diagram admits different completions.



begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & \
b & b & \
c & c &
end{array}
In the slot for $a^2$ we can put any of $e$, $b$ or $c$. Let's try with $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e\
b & b & \
c & c &
end{array}
Then we are forced to put in the following
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c\
c & c & b
end{array}
For $b^2$ we can have either $e$ or $c$. Let's try $e$:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e\
c & c & b &
end{array}
Now we can complete:
begin{array}{c|cccc}
& e & a & b & c \ hline
e & e & a & b & c \
a & a & e & c & b \
b & b & c & e & a\
c & c & b & a & e
end{array}
It would be very tedious to verify that this diagram indeed produces a group. It does and is the product of two cyclic groups of order two; it is also the subgroup of $S_4$ given by ${id,(12)(34),(13)(24),(14)(23)}$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 3 at 18:33

























answered Jan 3 at 18:26









egregegreg

183k1486205




183k1486205












  • $begingroup$
    I need another proof, without using the Cayley diagram
    $endgroup$
    – El Mouden
    Jan 8 at 12:25












  • $begingroup$
    @ElMouden Then using Lagrange's theorem is what you need.
    $endgroup$
    – egreg
    Jan 8 at 12:59










  • $begingroup$
    Oh Thanks Finally i did it
    $endgroup$
    – El Mouden
    Jan 9 at 14:07


















  • $begingroup$
    I need another proof, without using the Cayley diagram
    $endgroup$
    – El Mouden
    Jan 8 at 12:25












  • $begingroup$
    @ElMouden Then using Lagrange's theorem is what you need.
    $endgroup$
    – egreg
    Jan 8 at 12:59










  • $begingroup$
    Oh Thanks Finally i did it
    $endgroup$
    – El Mouden
    Jan 9 at 14:07
















$begingroup$
I need another proof, without using the Cayley diagram
$endgroup$
– El Mouden
Jan 8 at 12:25






$begingroup$
I need another proof, without using the Cayley diagram
$endgroup$
– El Mouden
Jan 8 at 12:25














$begingroup$
@ElMouden Then using Lagrange's theorem is what you need.
$endgroup$
– egreg
Jan 8 at 12:59




$begingroup$
@ElMouden Then using Lagrange's theorem is what you need.
$endgroup$
– egreg
Jan 8 at 12:59












$begingroup$
Oh Thanks Finally i did it
$endgroup$
– El Mouden
Jan 9 at 14:07




$begingroup$
Oh Thanks Finally i did it
$endgroup$
– El Mouden
Jan 9 at 14:07


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3060789%2fprove-that-a-group-with-3-elements-is-cyclic%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Quarter-circle Tiles

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
Read more

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Image
0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
Read more