Automorphism in $U(16)$.
Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
Here $U(16)$ is set of integers less than 16 that are coprime to it.
We have to prove that mapping $f:xto x^3$ is an automorphism.
Here I am not able to prove that $f$ is onto. Is there a general method for providing proof for surjectivness. I seem to be encountering this a lot.
abstract-algebra automorphism-group
add a comment |Â
up vote
3
down vote
favorite
Here $U(16)$ is set of integers less than 16 that are coprime to it.
We have to prove that mapping $f:xto x^3$ is an automorphism.
Here I am not able to prove that $f$ is onto. Is there a general method for providing proof for surjectivness. I seem to be encountering this a lot.
abstract-algebra automorphism-group
2
you can either follow the hint of Aaron or, in this simple case, just create a value map...that takes about 2 minutes.
â Thomas
Sep 8 at 9:02
Yes I did that. But I can't do it very well if it is $xto x^9$. It is not a very good method.
â Piyush Divyanakar
Sep 8 at 9:05
add a comment |Â
up vote
3
down vote
favorite
up vote
3
down vote
favorite
Here $U(16)$ is set of integers less than 16 that are coprime to it.
We have to prove that mapping $f:xto x^3$ is an automorphism.
Here I am not able to prove that $f$ is onto. Is there a general method for providing proof for surjectivness. I seem to be encountering this a lot.
abstract-algebra automorphism-group
Here $U(16)$ is set of integers less than 16 that are coprime to it.
We have to prove that mapping $f:xto x^3$ is an automorphism.
Here I am not able to prove that $f$ is onto. Is there a general method for providing proof for surjectivness. I seem to be encountering this a lot.
abstract-algebra automorphism-group
abstract-algebra automorphism-group
edited Sep 8 at 18:32
Xander Henderson
13.3k83250
13.3k83250
asked Sep 8 at 8:52
Piyush Divyanakar
3,315222
3,315222
2
you can either follow the hint of Aaron or, in this simple case, just create a value map...that takes about 2 minutes.
â Thomas
Sep 8 at 9:02
Yes I did that. But I can't do it very well if it is $xto x^9$. It is not a very good method.
â Piyush Divyanakar
Sep 8 at 9:05
add a comment |Â
2
you can either follow the hint of Aaron or, in this simple case, just create a value map...that takes about 2 minutes.
â Thomas
Sep 8 at 9:02
Yes I did that. But I can't do it very well if it is $xto x^9$. It is not a very good method.
â Piyush Divyanakar
Sep 8 at 9:05
2
2
you can either follow the hint of Aaron or, in this simple case, just create a value map...that takes about 2 minutes.
â Thomas
Sep 8 at 9:02
you can either follow the hint of Aaron or, in this simple case, just create a value map...that takes about 2 minutes.
â Thomas
Sep 8 at 9:02
Yes I did that. But I can't do it very well if it is $xto x^9$. It is not a very good method.
â Piyush Divyanakar
Sep 8 at 9:05
Yes I did that. But I can't do it very well if it is $xto x^9$. It is not a very good method.
â Piyush Divyanakar
Sep 8 at 9:05
add a comment |Â
4 Answers
4
active
oldest
votes
up vote
7
down vote
accepted
Hint: A map from a finite set to itself is onto if and only if it is injective, so you can try to show that the kernel of the map is trivial. What are the solutions in $U_16$ of $x^3=1$?
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
1
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
add a comment |Â
up vote
3
down vote
The map $x mapsto x^3$ is surjective because $x=x^9=(x^3)^3$.
The first equality comes $x^8=1$, since $U(16)$ has order $8$.
Therefore, $x mapsto x^3$ is a bijection, since $U(16)$ is finite.
add a comment |Â
up vote
2
down vote
The other answers are very good general ways to proceed. However, your $U(16)$ only contains eight elements. How hard is it to cube eight numbers and reduce them modulo $16$? (That is, never forget that direct computation also works and can be much faster than thinking about structure.)
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
add a comment |Â
up vote
1
down vote
actually, in $U(16)$, $x longmapsto x^3$ is the reciprocal function to $x longmapsto x^3$ because $(x^3)^3=x^9=x^8.x=1.x=x$ . As it is bijective, it is an automorphism.
In the general case, in $U(n)$, if $p$ is coprime with $varphi(n)$, where $varphi(n)$ is the order of $U(n)$, then $x longmapsto x^p$ is an automorphism, thanks to :
1) Bezout's identity : $ exists (u,v);u>0 / p.u+varphi(n).v=1$.
2) Euler's theorem, stating that : $forall x in U(n), x^varphi(n)=1$
3) Then, $x^p.u+v.varphi(n)=x$, so $x^p.u . (x^varphi(n))^v=x$, so $x^p.u=x$
Then $x longmapsto x^u$ is the reciprocal of $x longmapsto x^p$.
add a comment |Â
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
7
down vote
accepted
Hint: A map from a finite set to itself is onto if and only if it is injective, so you can try to show that the kernel of the map is trivial. What are the solutions in $U_16$ of $x^3=1$?
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
1
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
add a comment |Â
up vote
7
down vote
accepted
Hint: A map from a finite set to itself is onto if and only if it is injective, so you can try to show that the kernel of the map is trivial. What are the solutions in $U_16$ of $x^3=1$?
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
1
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
add a comment |Â
up vote
7
down vote
accepted
up vote
7
down vote
accepted
Hint: A map from a finite set to itself is onto if and only if it is injective, so you can try to show that the kernel of the map is trivial. What are the solutions in $U_16$ of $x^3=1$?
Hint: A map from a finite set to itself is onto if and only if it is injective, so you can try to show that the kernel of the map is trivial. What are the solutions in $U_16$ of $x^3=1$?
answered Sep 8 at 9:00
Aaron
15.4k22552
15.4k22552
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
1
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
add a comment |Â
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
1
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
So I have shown that function is injective. So that directly implies it is surjective. But this is only true for set to itself right.
â Piyush Divyanakar
Sep 8 at 9:04
1
1
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
@PiyushDivyanakar This is true for maps between sets of the same (finite) size.
â Aaron
Sep 8 at 9:06
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
Ok that makes sense. Thanks a lot
â Piyush Divyanakar
Sep 8 at 9:07
add a comment |Â
up vote
3
down vote
The map $x mapsto x^3$ is surjective because $x=x^9=(x^3)^3$.
The first equality comes $x^8=1$, since $U(16)$ has order $8$.
Therefore, $x mapsto x^3$ is a bijection, since $U(16)$ is finite.
add a comment |Â
up vote
3
down vote
The map $x mapsto x^3$ is surjective because $x=x^9=(x^3)^3$.
The first equality comes $x^8=1$, since $U(16)$ has order $8$.
Therefore, $x mapsto x^3$ is a bijection, since $U(16)$ is finite.
add a comment |Â
up vote
3
down vote
up vote
3
down vote
The map $x mapsto x^3$ is surjective because $x=x^9=(x^3)^3$.
The first equality comes $x^8=1$, since $U(16)$ has order $8$.
Therefore, $x mapsto x^3$ is a bijection, since $U(16)$ is finite.
The map $x mapsto x^3$ is surjective because $x=x^9=(x^3)^3$.
The first equality comes $x^8=1$, since $U(16)$ has order $8$.
Therefore, $x mapsto x^3$ is a bijection, since $U(16)$ is finite.
answered Sep 8 at 13:35
lhf
157k9161373
157k9161373
add a comment |Â
add a comment |Â
up vote
2
down vote
The other answers are very good general ways to proceed. However, your $U(16)$ only contains eight elements. How hard is it to cube eight numbers and reduce them modulo $16$? (That is, never forget that direct computation also works and can be much faster than thinking about structure.)
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
add a comment |Â
up vote
2
down vote
The other answers are very good general ways to proceed. However, your $U(16)$ only contains eight elements. How hard is it to cube eight numbers and reduce them modulo $16$? (That is, never forget that direct computation also works and can be much faster than thinking about structure.)
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
add a comment |Â
up vote
2
down vote
up vote
2
down vote
The other answers are very good general ways to proceed. However, your $U(16)$ only contains eight elements. How hard is it to cube eight numbers and reduce them modulo $16$? (That is, never forget that direct computation also works and can be much faster than thinking about structure.)
The other answers are very good general ways to proceed. However, your $U(16)$ only contains eight elements. How hard is it to cube eight numbers and reduce them modulo $16$? (That is, never forget that direct computation also works and can be much faster than thinking about structure.)
answered Sep 8 at 14:33
Eric Towers
30.7k22264
30.7k22264
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
add a comment |Â
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
I know. That's how I had done it before the answer was posted. But knowing the proper technique helped me solve a few other problems and also a few proofs. So imo it is still better to know the proper argument.
â Piyush Divyanakar
Sep 8 at 14:53
add a comment |Â
up vote
1
down vote
actually, in $U(16)$, $x longmapsto x^3$ is the reciprocal function to $x longmapsto x^3$ because $(x^3)^3=x^9=x^8.x=1.x=x$ . As it is bijective, it is an automorphism.
In the general case, in $U(n)$, if $p$ is coprime with $varphi(n)$, where $varphi(n)$ is the order of $U(n)$, then $x longmapsto x^p$ is an automorphism, thanks to :
1) Bezout's identity : $ exists (u,v);u>0 / p.u+varphi(n).v=1$.
2) Euler's theorem, stating that : $forall x in U(n), x^varphi(n)=1$
3) Then, $x^p.u+v.varphi(n)=x$, so $x^p.u . (x^varphi(n))^v=x$, so $x^p.u=x$
Then $x longmapsto x^u$ is the reciprocal of $x longmapsto x^p$.
add a comment |Â
up vote
1
down vote
actually, in $U(16)$, $x longmapsto x^3$ is the reciprocal function to $x longmapsto x^3$ because $(x^3)^3=x^9=x^8.x=1.x=x$ . As it is bijective, it is an automorphism.
In the general case, in $U(n)$, if $p$ is coprime with $varphi(n)$, where $varphi(n)$ is the order of $U(n)$, then $x longmapsto x^p$ is an automorphism, thanks to :
1) Bezout's identity : $ exists (u,v);u>0 / p.u+varphi(n).v=1$.
2) Euler's theorem, stating that : $forall x in U(n), x^varphi(n)=1$
3) Then, $x^p.u+v.varphi(n)=x$, so $x^p.u . (x^varphi(n))^v=x$, so $x^p.u=x$
Then $x longmapsto x^u$ is the reciprocal of $x longmapsto x^p$.
add a comment |Â
up vote
1
down vote
up vote
1
down vote
actually, in $U(16)$, $x longmapsto x^3$ is the reciprocal function to $x longmapsto x^3$ because $(x^3)^3=x^9=x^8.x=1.x=x$ . As it is bijective, it is an automorphism.
In the general case, in $U(n)$, if $p$ is coprime with $varphi(n)$, where $varphi(n)$ is the order of $U(n)$, then $x longmapsto x^p$ is an automorphism, thanks to :
1) Bezout's identity : $ exists (u,v);u>0 / p.u+varphi(n).v=1$.
2) Euler's theorem, stating that : $forall x in U(n), x^varphi(n)=1$
3) Then, $x^p.u+v.varphi(n)=x$, so $x^p.u . (x^varphi(n))^v=x$, so $x^p.u=x$
Then $x longmapsto x^u$ is the reciprocal of $x longmapsto x^p$.
actually, in $U(16)$, $x longmapsto x^3$ is the reciprocal function to $x longmapsto x^3$ because $(x^3)^3=x^9=x^8.x=1.x=x$ . As it is bijective, it is an automorphism.
In the general case, in $U(n)$, if $p$ is coprime with $varphi(n)$, where $varphi(n)$ is the order of $U(n)$, then $x longmapsto x^p$ is an automorphism, thanks to :
1) Bezout's identity : $ exists (u,v);u>0 / p.u+varphi(n).v=1$.
2) Euler's theorem, stating that : $forall x in U(n), x^varphi(n)=1$
3) Then, $x^p.u+v.varphi(n)=x$, so $x^p.u . (x^varphi(n))^v=x$, so $x^p.u=x$
Then $x longmapsto x^u$ is the reciprocal of $x longmapsto x^p$.
edited Sep 10 at 9:50
answered Sep 8 at 17:29
Nigulf
112
112
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%2f2909432%2fautomorphism-in-u16%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
2
you can either follow the hint of Aaron or, in this simple case, just create a value map...that takes about 2 minutes.
â Thomas
Sep 8 at 9:02
Yes I did that. But I can't do it very well if it is $xto x^9$. It is not a very good method.
â Piyush Divyanakar
Sep 8 at 9:05