Mixing
Order of an element and $mathbb{Z_n}$
$begingroup$
Consider the group $mathbb{Z_8}^*$. This group contains only the following elements, 1,3,5,7. It was suggested to me that this group is not cyclic because there does not exist an element in the set with order 4.
I do not see how I can prove that for an element g in $mathbb{Z_n}^*$ the integer n in $g^n$ gives me the number of elements in the set that is generated by g.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
abstract-algebra group-theory proof-writing
edited Feb 2 at 20:07
Shaun
10.5k113687
asked Feb 2 at 18:27
GeometricalGeometrical
133
$endgroup$
add a comment |
$begingroup$
Consider the group $mathbb{Z_8}^*$. This group contains only the following elements, 1,3,5,7. It was suggested to me that this group is not cyclic because there does not exist an element in the set with order 4.
I do not see how I can prove that for an element g in $mathbb{Z_n}^*$ the integer n in $g^n$ gives me the number of elements in the set that is generated by g.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
abstract-algebra group-theory proof-writing
edited Feb 2 at 20:07
Shaun
10.5k113687
asked Feb 2 at 18:27
GeometricalGeometrical
133
$endgroup$
1
$begingroup$
Are you asking only if the order of a cyclic group equals the order of its generator, or something further? That surely has been asked in the past so it will end up being a duplicate question (always search first before asking).
$endgroup$
– Bill Dubuque
Feb 2 at 18:42
1
$begingroup$
Well, you know $|Z_8^*|=4$ because you can count the elements. 1-> one, 3-> two, 5-> three, 7-> four. There are four of them. So if $Z_8^*$ is cyclic then there is a $g$ so that ${g, g^2, g^3, g^4, g^5,.........} = {1,3,5,7}$. Since ${1,3,5,7}$ has four different elements then ${g,g^2,g^3,g^4,g^5....}$ must have four differen elements. So ${g,g^2,g^3,g^4,g^5....} = {g,g^2,g^3,1}$ and $g^4 = 1$ and $g^2 ne g$ and $g^2 ne 1$. and $g^3 ne 1$. and $g^3 ne g^2$. And it's just a matter of testing all the elements. There is no such element.
$endgroup$
– fleablood
Feb 2 at 19:22
add a comment |
$begingroup$
Consider the group $mathbb{Z_8}^*$. This group contains only the following elements, 1,3,5,7. It was suggested to me that this group is not cyclic because there does not exist an element in the set with order 4.
I do not see how I can prove that for an element g in $mathbb{Z_n}^*$ the integer n in $g^n$ gives me the number of elements in the set that is generated by g.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
abstract-algebra group-theory proof-writing
edited Feb 2 at 20:07
Shaun
10.5k113687
asked Feb 2 at 18:27
GeometricalGeometrical
133
$endgroup$
Consider the group $mathbb{Z_8}^*$. This group contains only the following elements, 1,3,5,7. It was suggested to me that this group is not cyclic because there does not exist an element in the set with order 4.
I do not see how I can prove that for an element g in $mathbb{Z_n}^*$ the integer n in $g^n$ gives me the number of elements in the set that is generated by g.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
abstract-algebra group-theory proof-writing
abstract-algebra group-theory proof-writing
edited Feb 2 at 20:07
Shaun
10.5k113687
asked Feb 2 at 18:27
GeometricalGeometrical
133
edited Feb 2 at 20:07
Shaun
10.5k113687
asked Feb 2 at 18:27
GeometricalGeometrical
133
edited Feb 2 at 20:07
Shaun
10.5k113687
edited Feb 2 at 20:07
Shaun
10.5k113687
edited Feb 2 at 20:07
Shaun
10.5k113687
10.5k113687
asked Feb 2 at 18:27
GeometricalGeometrical
133
asked Feb 2 at 18:27
GeometricalGeometrical
133
asked Feb 2 at 18:27
GeometricalGeometrical
133
133
1
$begingroup$
Are you asking only if the order of a cyclic group equals the order of its generator, or something further? That surely has been asked in the past so it will end up being a duplicate question (always search first before asking).
$endgroup$
– Bill Dubuque
Feb 2 at 18:42
1
$begingroup$
Well, you know $|Z_8^*|=4$ because you can count the elements. 1-> one, 3-> two, 5-> three, 7-> four. There are four of them. So if $Z_8^*$ is cyclic then there is a $g$ so that ${g, g^2, g^3, g^4, g^5,.........} = {1,3,5,7}$. Since ${1,3,5,7}$ has four different elements then ${g,g^2,g^3,g^4,g^5....}$ must have four differen elements. So ${g,g^2,g^3,g^4,g^5....} = {g,g^2,g^3,1}$ and $g^4 = 1$ and $g^2 ne g$ and $g^2 ne 1$. and $g^3 ne 1$. and $g^3 ne g^2$. And it's just a matter of testing all the elements. There is no such element.
$endgroup$
– fleablood
Feb 2 at 19:22
add a comment |
1
$begingroup$
Are you asking only if the order of a cyclic group equals the order of its generator, or something further? That surely has been asked in the past so it will end up being a duplicate question (always search first before asking).
$endgroup$
– Bill Dubuque
Feb 2 at 18:42
1
$begingroup$
Well, you know $|Z_8^*|=4$ because you can count the elements. 1-> one, 3-> two, 5-> three, 7-> four. There are four of them. So if $Z_8^*$ is cyclic then there is a $g$ so that ${g, g^2, g^3, g^4, g^5,.........} = {1,3,5,7}$. Since ${1,3,5,7}$ has four different elements then ${g,g^2,g^3,g^4,g^5....}$ must have four differen elements. So ${g,g^2,g^3,g^4,g^5....} = {g,g^2,g^3,1}$ and $g^4 = 1$ and $g^2 ne g$ and $g^2 ne 1$. and $g^3 ne 1$. and $g^3 ne g^2$. And it's just a matter of testing all the elements. There is no such element.
$endgroup$
– fleablood
Feb 2 at 19:22
1
1
$begingroup$
Are you asking only if the order of a cyclic group equals the order of its generator, or something further? That surely has been asked in the past so it will end up being a duplicate question (always search first before asking).
$endgroup$
– Bill Dubuque
Feb 2 at 18:42
$begingroup$
Are you asking only if the order of a cyclic group equals the order of its generator, or something further? That surely has been asked in the past so it will end up being a duplicate question (always search first before asking).
$endgroup$
– Bill Dubuque
Feb 2 at 18:42
1
1
$begingroup$
Well, you know $|Z_8^*|=4$ because you can count the elements. 1-> one, 3-> two, 5-> three, 7-> four. There are four of them. So if $Z_8^*$ is cyclic then there is a $g$ so that ${g, g^2, g^3, g^4, g^5,.........} = {1,3,5,7}$. Since ${1,3,5,7}$ has four different elements then ${g,g^2,g^3,g^4,g^5....}$ must have four differen elements. So ${g,g^2,g^3,g^4,g^5....} = {g,g^2,g^3,1}$ and $g^4 = 1$ and $g^2 ne g$ and $g^2 ne 1$. and $g^3 ne 1$. and $g^3 ne g^2$. And it's just a matter of testing all the elements. There is no such element.
$endgroup$
– fleablood
Feb 2 at 19:22
$begingroup$
Well, you know $|Z_8^*|=4$ because you can count the elements. 1-> one, 3-> two, 5-> three, 7-> four. There are four of them. So if $Z_8^*$ is cyclic then there is a $g$ so that ${g, g^2, g^3, g^4, g^5,.........} = {1,3,5,7}$. Since ${1,3,5,7}$ has four different elements then ${g,g^2,g^3,g^4,g^5....}$ must have four differen elements. So ${g,g^2,g^3,g^4,g^5....} = {g,g^2,g^3,1}$ and $g^4 = 1$ and $g^2 ne g$ and $g^2 ne 1$. and $g^3 ne 1$. and $g^3 ne g^2$. And it's just a matter of testing all the elements. There is no such element.
$endgroup$
– fleablood
Feb 2 at 19:22
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
By Lagrange's Theorem we know that for any group $G$ with $left| G right| = n$ we have $g^n = 1$ for any $g in G$. If the group $G$ is cyclic then there must be an element $g$ such that $g$ has order $n$ (by definition of cyclicity). So if you check that no element has order $4$ for $mathbb{Z}_8^*$ then the group is not cyclic. Does this help?
answered Feb 2 at 18:49
NaoNao
374217
$endgroup$
add a comment |
$begingroup$
I think what you are asking is if $gin G$ and $g^k = 1$ and that $k$ is the smallest positive integer, $k$ so that $g^k =e$ (i.e. the definition $|g| = k$) then $|<g>| = k$.
Pf: $<g> = {g, g^2, g^3,......., g^l,.....}$
If $m > k$ then $g^m = g^{k + (m-l)} = g^k*g^{m-1} = e*g^{m-1} = g^{m-l}$ so $g^m$ is not distinct and $<g>$ will have at most $k$ elements.
And $<g> = {g, g^2, g^3, ....., g^{k-1}, g^k=e}$.
Now suppose those elements are not distinct, that is, suppose $g^i = g^j$ but $0 < i < j < k$.
The $g^i = g^j$
$g^i*(g^{-1})^i = g^j*(g^{-1})^i$
$e = g^{j-i}$.
But $0 < j-i < k$ and that contradicts that $k$ was the smallest such positive integer where $g^k = e$.
So $<g> = {g, g^2, .... ,g^{k-1}, 1}$ and $|<g>| = k$.
...
That was probably already proven in your class and is buried somewhere in your notes. You definitely used that when you proved Lagrange Theorem.
==== old answer =====
Just do it.
If $mathbb Z_8^*$ is cyclic there is a $gin mathbb Z_8^*$ so that ${g,g^2,g^3,g^4} = {1,3,5,7}$
${1,1^2, 1^3, 1^4} = {1,1,1,1} = {1} ne {1,3,5,7}$
${3, 3^2, 3^3, 3^4} = {3,1,3,1} = {1,3} ne {1,3,5,7}$
${5, 5^3, 5^3, 5^4} = {5,1,5,1} = {1,5} ne {1,3,5,7}$
${7,7^2, 7^3, 7^4} = {7,1,7,1} = {1,7}ne {1,3,5,7}$
So there is no such $g$ so it isn't cyclic.
I do not see how I can prove that for an element g in Zn∗ the integer n in gn gives me the number of elements in the set that is generated by g.
Assuming $n$ is the same as the index i $mathbb Z_n$ then $g^n =1$. This is a direct consequence of Lagrange theorem: If $G$ is a finite group of order $n$, then $|g|=$ divides $|G| = n$. And so $g^n = (g^k)^{frac nk} = 1^{frac nk} = 1$.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
Well that's obvious.
If $|g| = k$ then BY DEFINITION $g^k = 1$ and $g^{i; 0<i < k} ne 1$ so $g, g^2,g^3, g^4, ......, g^k =1$ will be the element in $<g>$ and if you count them there are $k$ of them.
Okay, we have to prove then $g^i ne g^j$ if $0 le i < j < k$ but that's clear: If $g^i = g^j$ then $g^i*(g^{-1})^i = g^j*(g^{-1})^i$ so $1 = g^{j-i}$ but $0 < j-i < k$. But that contradicts $|g| = k$.
answered Feb 2 at 19:06
fleabloodfleablood
1
$endgroup$
add a comment |
Your Answer
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%2f3097610%2forder-of-an-element-and-mathbbz-n%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$
By Lagrange's Theorem we know that for any group $G$ with $left| G right| = n$ we have $g^n = 1$ for any $g in G$. If the group $G$ is cyclic then there must be an element $g$ such that $g$ has order $n$ (by definition of cyclicity). So if you check that no element has order $4$ for $mathbb{Z}_8^*$ then the group is not cyclic. Does this help?
answered Feb 2 at 18:49
NaoNao
374217
$endgroup$
add a comment |
$begingroup$
By Lagrange's Theorem we know that for any group $G$ with $left| G right| = n$ we have $g^n = 1$ for any $g in G$. If the group $G$ is cyclic then there must be an element $g$ such that $g$ has order $n$ (by definition of cyclicity). So if you check that no element has order $4$ for $mathbb{Z}_8^*$ then the group is not cyclic. Does this help?
answered Feb 2 at 18:49
NaoNao
374217
$endgroup$
add a comment |
$begingroup$
By Lagrange's Theorem we know that for any group $G$ with $left| G right| = n$ we have $g^n = 1$ for any $g in G$. If the group $G$ is cyclic then there must be an element $g$ such that $g$ has order $n$ (by definition of cyclicity). So if you check that no element has order $4$ for $mathbb{Z}_8^*$ then the group is not cyclic. Does this help?
answered Feb 2 at 18:49
NaoNao
374217
$endgroup$
By Lagrange's Theorem we know that for any group $G$ with $left| G right| = n$ we have $g^n = 1$ for any $g in G$. If the group $G$ is cyclic then there must be an element $g$ such that $g$ has order $n$ (by definition of cyclicity). So if you check that no element has order $4$ for $mathbb{Z}_8^*$ then the group is not cyclic. Does this help?
answered Feb 2 at 18:49
NaoNao
374217
answered Feb 2 at 18:49
NaoNao
374217
answered Feb 2 at 18:49
NaoNao
374217
answered Feb 2 at 18:49
NaoNao
374217
374217
add a comment |
add a comment |
$begingroup$
I think what you are asking is if $gin G$ and $g^k = 1$ and that $k$ is the smallest positive integer, $k$ so that $g^k =e$ (i.e. the definition $|g| = k$) then $|<g>| = k$.
Pf: $<g> = {g, g^2, g^3,......., g^l,.....}$
If $m > k$ then $g^m = g^{k + (m-l)} = g^k*g^{m-1} = e*g^{m-1} = g^{m-l}$ so $g^m$ is not distinct and $<g>$ will have at most $k$ elements.
And $<g> = {g, g^2, g^3, ....., g^{k-1}, g^k=e}$.
Now suppose those elements are not distinct, that is, suppose $g^i = g^j$ but $0 < i < j < k$.
The $g^i = g^j$
$g^i*(g^{-1})^i = g^j*(g^{-1})^i$
$e = g^{j-i}$.
But $0 < j-i < k$ and that contradicts that $k$ was the smallest such positive integer where $g^k = e$.
So $<g> = {g, g^2, .... ,g^{k-1}, 1}$ and $|<g>| = k$.
...
That was probably already proven in your class and is buried somewhere in your notes. You definitely used that when you proved Lagrange Theorem.
==== old answer =====
Just do it.
If $mathbb Z_8^*$ is cyclic there is a $gin mathbb Z_8^*$ so that ${g,g^2,g^3,g^4} = {1,3,5,7}$
${1,1^2, 1^3, 1^4} = {1,1,1,1} = {1} ne {1,3,5,7}$
${3, 3^2, 3^3, 3^4} = {3,1,3,1} = {1,3} ne {1,3,5,7}$
${5, 5^3, 5^3, 5^4} = {5,1,5,1} = {1,5} ne {1,3,5,7}$
${7,7^2, 7^3, 7^4} = {7,1,7,1} = {1,7}ne {1,3,5,7}$
So there is no such $g$ so it isn't cyclic.
I do not see how I can prove that for an element g in Zn∗ the integer n in gn gives me the number of elements in the set that is generated by g.
Assuming $n$ is the same as the index i $mathbb Z_n$ then $g^n =1$. This is a direct consequence of Lagrange theorem: If $G$ is a finite group of order $n$, then $|g|=$ divides $|G| = n$. And so $g^n = (g^k)^{frac nk} = 1^{frac nk} = 1$.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
Well that's obvious.
If $|g| = k$ then BY DEFINITION $g^k = 1$ and $g^{i; 0<i < k} ne 1$ so $g, g^2,g^3, g^4, ......, g^k =1$ will be the element in $<g>$ and if you count them there are $k$ of them.
Okay, we have to prove then $g^i ne g^j$ if $0 le i < j < k$ but that's clear: If $g^i = g^j$ then $g^i*(g^{-1})^i = g^j*(g^{-1})^i$ so $1 = g^{j-i}$ but $0 < j-i < k$. But that contradicts $|g| = k$.
answered Feb 2 at 19:06
fleabloodfleablood
1
$endgroup$
add a comment |
$begingroup$
I think what you are asking is if $gin G$ and $g^k = 1$ and that $k$ is the smallest positive integer, $k$ so that $g^k =e$ (i.e. the definition $|g| = k$) then $|<g>| = k$.
Pf: $<g> = {g, g^2, g^3,......., g^l,.....}$
If $m > k$ then $g^m = g^{k + (m-l)} = g^k*g^{m-1} = e*g^{m-1} = g^{m-l}$ so $g^m$ is not distinct and $<g>$ will have at most $k$ elements.
And $<g> = {g, g^2, g^3, ....., g^{k-1}, g^k=e}$.
Now suppose those elements are not distinct, that is, suppose $g^i = g^j$ but $0 < i < j < k$.
The $g^i = g^j$
$g^i*(g^{-1})^i = g^j*(g^{-1})^i$
$e = g^{j-i}$.
But $0 < j-i < k$ and that contradicts that $k$ was the smallest such positive integer where $g^k = e$.
So $<g> = {g, g^2, .... ,g^{k-1}, 1}$ and $|<g>| = k$.
...
That was probably already proven in your class and is buried somewhere in your notes. You definitely used that when you proved Lagrange Theorem.
==== old answer =====
Just do it.
If $mathbb Z_8^*$ is cyclic there is a $gin mathbb Z_8^*$ so that ${g,g^2,g^3,g^4} = {1,3,5,7}$
${1,1^2, 1^3, 1^4} = {1,1,1,1} = {1} ne {1,3,5,7}$
${3, 3^2, 3^3, 3^4} = {3,1,3,1} = {1,3} ne {1,3,5,7}$
${5, 5^3, 5^3, 5^4} = {5,1,5,1} = {1,5} ne {1,3,5,7}$
${7,7^2, 7^3, 7^4} = {7,1,7,1} = {1,7}ne {1,3,5,7}$
So there is no such $g$ so it isn't cyclic.
I do not see how I can prove that for an element g in Zn∗ the integer n in gn gives me the number of elements in the set that is generated by g.
Assuming $n$ is the same as the index i $mathbb Z_n$ then $g^n =1$. This is a direct consequence of Lagrange theorem: If $G$ is a finite group of order $n$, then $|g|=$ divides $|G| = n$. And so $g^n = (g^k)^{frac nk} = 1^{frac nk} = 1$.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
Well that's obvious.
If $|g| = k$ then BY DEFINITION $g^k = 1$ and $g^{i; 0<i < k} ne 1$ so $g, g^2,g^3, g^4, ......, g^k =1$ will be the element in $<g>$ and if you count them there are $k$ of them.
Okay, we have to prove then $g^i ne g^j$ if $0 le i < j < k$ but that's clear: If $g^i = g^j$ then $g^i*(g^{-1})^i = g^j*(g^{-1})^i$ so $1 = g^{j-i}$ but $0 < j-i < k$. But that contradicts $|g| = k$.
answered Feb 2 at 19:06
fleabloodfleablood
1
$endgroup$
add a comment |
$begingroup$
I think what you are asking is if $gin G$ and $g^k = 1$ and that $k$ is the smallest positive integer, $k$ so that $g^k =e$ (i.e. the definition $|g| = k$) then $|<g>| = k$.
Pf: $<g> = {g, g^2, g^3,......., g^l,.....}$
If $m > k$ then $g^m = g^{k + (m-l)} = g^k*g^{m-1} = e*g^{m-1} = g^{m-l}$ so $g^m$ is not distinct and $<g>$ will have at most $k$ elements.
And $<g> = {g, g^2, g^3, ....., g^{k-1}, g^k=e}$.
Now suppose those elements are not distinct, that is, suppose $g^i = g^j$ but $0 < i < j < k$.
The $g^i = g^j$
$g^i*(g^{-1})^i = g^j*(g^{-1})^i$
$e = g^{j-i}$.
But $0 < j-i < k$ and that contradicts that $k$ was the smallest such positive integer where $g^k = e$.
So $<g> = {g, g^2, .... ,g^{k-1}, 1}$ and $|<g>| = k$.
...
That was probably already proven in your class and is buried somewhere in your notes. You definitely used that when you proved Lagrange Theorem.
==== old answer =====
Just do it.
If $mathbb Z_8^*$ is cyclic there is a $gin mathbb Z_8^*$ so that ${g,g^2,g^3,g^4} = {1,3,5,7}$
${1,1^2, 1^3, 1^4} = {1,1,1,1} = {1} ne {1,3,5,7}$
${3, 3^2, 3^3, 3^4} = {3,1,3,1} = {1,3} ne {1,3,5,7}$
${5, 5^3, 5^3, 5^4} = {5,1,5,1} = {1,5} ne {1,3,5,7}$
${7,7^2, 7^3, 7^4} = {7,1,7,1} = {1,7}ne {1,3,5,7}$
So there is no such $g$ so it isn't cyclic.
I do not see how I can prove that for an element g in Zn∗ the integer n in gn gives me the number of elements in the set that is generated by g.
Assuming $n$ is the same as the index i $mathbb Z_n$ then $g^n =1$. This is a direct consequence of Lagrange theorem: If $G$ is a finite group of order $n$, then $|g|=$ divides $|G| = n$. And so $g^n = (g^k)^{frac nk} = 1^{frac nk} = 1$.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
Well that's obvious.
If $|g| = k$ then BY DEFINITION $g^k = 1$ and $g^{i; 0<i < k} ne 1$ so $g, g^2,g^3, g^4, ......, g^k =1$ will be the element in $<g>$ and if you count them there are $k$ of them.
Okay, we have to prove then $g^i ne g^j$ if $0 le i < j < k$ but that's clear: If $g^i = g^j$ then $g^i*(g^{-1})^i = g^j*(g^{-1})^i$ so $1 = g^{j-i}$ but $0 < j-i < k$. But that contradicts $|g| = k$.
answered Feb 2 at 19:06
fleabloodfleablood
1
$endgroup$
I think what you are asking is if $gin G$ and $g^k = 1$ and that $k$ is the smallest positive integer, $k$ so that $g^k =e$ (i.e. the definition $|g| = k$) then $|<g>| = k$.
Pf: $<g> = {g, g^2, g^3,......., g^l,.....}$
If $m > k$ then $g^m = g^{k + (m-l)} = g^k*g^{m-1} = e*g^{m-1} = g^{m-l}$ so $g^m$ is not distinct and $<g>$ will have at most $k$ elements.
And $<g> = {g, g^2, g^3, ....., g^{k-1}, g^k=e}$.
Now suppose those elements are not distinct, that is, suppose $g^i = g^j$ but $0 < i < j < k$.
The $g^i = g^j$
$g^i*(g^{-1})^i = g^j*(g^{-1})^i$
$e = g^{j-i}$.
But $0 < j-i < k$ and that contradicts that $k$ was the smallest such positive integer where $g^k = e$.
So $<g> = {g, g^2, .... ,g^{k-1}, 1}$ and $|<g>| = k$.
...
That was probably already proven in your class and is buried somewhere in your notes. You definitely used that when you proved Lagrange Theorem.
==== old answer =====
Just do it.
If $mathbb Z_8^*$ is cyclic there is a $gin mathbb Z_8^*$ so that ${g,g^2,g^3,g^4} = {1,3,5,7}$
${1,1^2, 1^3, 1^4} = {1,1,1,1} = {1} ne {1,3,5,7}$
${3, 3^2, 3^3, 3^4} = {3,1,3,1} = {1,3} ne {1,3,5,7}$
${5, 5^3, 5^3, 5^4} = {5,1,5,1} = {1,5} ne {1,3,5,7}$
${7,7^2, 7^3, 7^4} = {7,1,7,1} = {1,7}ne {1,3,5,7}$
So there is no such $g$ so it isn't cyclic.
I do not see how I can prove that for an element g in Zn∗ the integer n in gn gives me the number of elements in the set that is generated by g.
Assuming $n$ is the same as the index i $mathbb Z_n$ then $g^n =1$. This is a direct consequence of Lagrange theorem: If $G$ is a finite group of order $n$, then $|g|=$ divides $|G| = n$. And so $g^n = (g^k)^{frac nk} = 1^{frac nk} = 1$.
My thoughts on this are as follows: I believe that it may be the case that the order of an element in a group g tells me the number of elements in the generator of g, because G is closed and the order is the smallest positive integer n that gives the identity.
Well that's obvious.
If $|g| = k$ then BY DEFINITION $g^k = 1$ and $g^{i; 0<i < k} ne 1$ so $g, g^2,g^3, g^4, ......, g^k =1$ will be the element in $<g>$ and if you count them there are $k$ of them.
Okay, we have to prove then $g^i ne g^j$ if $0 le i < j < k$ but that's clear: If $g^i = g^j$ then $g^i*(g^{-1})^i = g^j*(g^{-1})^i$ so $1 = g^{j-i}$ but $0 < j-i < k$. But that contradicts $|g| = k$.
answered Feb 2 at 19:06
fleabloodfleablood
1
edited Feb 2 at 19:16
answered Feb 2 at 19:06
fleabloodfleablood
1
answered Feb 2 at 19:06
fleabloodfleablood
1
answered Feb 2 at 19:06
fleabloodfleablood
1
1
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%2f3097610%2forder-of-an-element-and-mathbbz-n%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
1
$begingroup$
Are you asking only if the order of a cyclic group equals the order of its generator, or something further? That surely has been asked in the past so it will end up being a duplicate question (always search first before asking).
$endgroup$
– Bill Dubuque
Feb 2 at 18:42
1
$begingroup$
Well, you know $|Z_8^*|=4$ because you can count the elements. 1-> one, 3-> two, 5-> three, 7-> four. There are four of them. So if $Z_8^*$ is cyclic then there is a $g$ so that ${g, g^2, g^3, g^4, g^5,.........} = {1,3,5,7}$. Since ${1,3,5,7}$ has four different elements then ${g,g^2,g^3,g^4,g^5....}$ must have four differen elements. So ${g,g^2,g^3,g^4,g^5....} = {g,g^2,g^3,1}$ and $g^4 = 1$ and $g^2 ne g$ and $g^2 ne 1$. and $g^3 ne 1$. and $g^3 ne g^2$. And it's just a matter of testing all the elements. There is no such element.
$endgroup$
– fleablood
Feb 2 at 19:22