Find the cardinality of a subset of $GL_n( mathbb F_p)$
$begingroup$
Let $m,n in mathbb N$. Let $mathbb F_p$ denote the prime field of characteristic $p$. Consider the set $$ X_m = {A in GL_n( {mathbb F_p}): A^m=1 }$$
Compute the cardinality of $X_m$.
Its clear that $vert X_m vert < infty$ since cardinality of $GL_n( mathbb F_p)$ itself is $(p^n-1)(p^n-p)...(p^n-p^{n-1})$. Moreover, suppose $A in X_m$ then $(x^m-1)$ kills $A$.
First I tried to understand the case when $m=p$. In this case if $A in X_p$ then $(x^p-1)$ kills $A$ and since $x^p-1=(x-1)^p$ hence $(x-1)^n$ also kills $A$. Also, minimal polynomial of $A$ is of the form $(x-1)^k$ for some $k leq p$. Any ideas to proceed further?
linear-algebra matrices finite-groups field-theory
$endgroup$
add a comment |
$begingroup$
Let $m,n in mathbb N$. Let $mathbb F_p$ denote the prime field of characteristic $p$. Consider the set $$ X_m = {A in GL_n( {mathbb F_p}): A^m=1 }$$
Compute the cardinality of $X_m$.
Its clear that $vert X_m vert < infty$ since cardinality of $GL_n( mathbb F_p)$ itself is $(p^n-1)(p^n-p)...(p^n-p^{n-1})$. Moreover, suppose $A in X_m$ then $(x^m-1)$ kills $A$.
First I tried to understand the case when $m=p$. In this case if $A in X_p$ then $(x^p-1)$ kills $A$ and since $x^p-1=(x-1)^p$ hence $(x-1)^n$ also kills $A$. Also, minimal polynomial of $A$ is of the form $(x-1)^k$ for some $k leq p$. Any ideas to proceed further?
linear-algebra matrices finite-groups field-theory
$endgroup$
$begingroup$
This might be of interest: mathoverflow.net/questions/221374/…
$endgroup$
– Calle
Sep 9 '17 at 16:39
$begingroup$
$GL_n$ is in bijection with the set of ordered bases of the vector space $F^n$ (think of the columns as a basis). So maybe try to enumerate/count all bases of $F^n$.
$endgroup$
– Nick
Feb 26 '18 at 20:44
1
$begingroup$
Dear @Nick, what you said is obvious but it does not really help. ( atleast to me) What does the condition that order of $A$ is divisible by $m$ Says in terms of basis ?
$endgroup$
– Arpit Kansal
Mar 9 '18 at 1:30
$begingroup$
For $m$ a large enough power of $p$, $X_m$ is in bijection with the set of nilpotent matrices (via $Nmapsto I_n + N$) , and we can compute this cardinality (it's $p^{n^2-n}$) . I don't have an answer for more general $n$, but seeing that a general answer would yield the cardinality of nilpotent matrices which is not a trivial fact, I think a general answer must be complicated
$endgroup$
– Max
Nov 3 '18 at 20:48
2
$begingroup$
@ArpitKansal For specific $m,n,p$ (also work for $mathbb{F}_q$ for $q=p^r$), list the possible rational canonical forms and compute the size of conjugacy classes. I doubt a "general formula" exist.
$endgroup$
– user10354138
Nov 3 '18 at 21:21
add a comment |
$begingroup$
Let $m,n in mathbb N$. Let $mathbb F_p$ denote the prime field of characteristic $p$. Consider the set $$ X_m = {A in GL_n( {mathbb F_p}): A^m=1 }$$
Compute the cardinality of $X_m$.
Its clear that $vert X_m vert < infty$ since cardinality of $GL_n( mathbb F_p)$ itself is $(p^n-1)(p^n-p)...(p^n-p^{n-1})$. Moreover, suppose $A in X_m$ then $(x^m-1)$ kills $A$.
First I tried to understand the case when $m=p$. In this case if $A in X_p$ then $(x^p-1)$ kills $A$ and since $x^p-1=(x-1)^p$ hence $(x-1)^n$ also kills $A$. Also, minimal polynomial of $A$ is of the form $(x-1)^k$ for some $k leq p$. Any ideas to proceed further?
linear-algebra matrices finite-groups field-theory
$endgroup$
Let $m,n in mathbb N$. Let $mathbb F_p$ denote the prime field of characteristic $p$. Consider the set $$ X_m = {A in GL_n( {mathbb F_p}): A^m=1 }$$
Compute the cardinality of $X_m$.
Its clear that $vert X_m vert < infty$ since cardinality of $GL_n( mathbb F_p)$ itself is $(p^n-1)(p^n-p)...(p^n-p^{n-1})$. Moreover, suppose $A in X_m$ then $(x^m-1)$ kills $A$.
First I tried to understand the case when $m=p$. In this case if $A in X_p$ then $(x^p-1)$ kills $A$ and since $x^p-1=(x-1)^p$ hence $(x-1)^n$ also kills $A$. Also, minimal polynomial of $A$ is of the form $(x-1)^k$ for some $k leq p$. Any ideas to proceed further?
linear-algebra matrices finite-groups field-theory
linear-algebra matrices finite-groups field-theory
edited Jan 30 at 12:21
user549397
1,6611418
1,6611418
asked Feb 11 '16 at 11:07
Arpit KansalArpit Kansal
7,01411135
7,01411135
$begingroup$
This might be of interest: mathoverflow.net/questions/221374/…
$endgroup$
– Calle
Sep 9 '17 at 16:39
$begingroup$
$GL_n$ is in bijection with the set of ordered bases of the vector space $F^n$ (think of the columns as a basis). So maybe try to enumerate/count all bases of $F^n$.
$endgroup$
– Nick
Feb 26 '18 at 20:44
1
$begingroup$
Dear @Nick, what you said is obvious but it does not really help. ( atleast to me) What does the condition that order of $A$ is divisible by $m$ Says in terms of basis ?
$endgroup$
– Arpit Kansal
Mar 9 '18 at 1:30
$begingroup$
For $m$ a large enough power of $p$, $X_m$ is in bijection with the set of nilpotent matrices (via $Nmapsto I_n + N$) , and we can compute this cardinality (it's $p^{n^2-n}$) . I don't have an answer for more general $n$, but seeing that a general answer would yield the cardinality of nilpotent matrices which is not a trivial fact, I think a general answer must be complicated
$endgroup$
– Max
Nov 3 '18 at 20:48
2
$begingroup$
@ArpitKansal For specific $m,n,p$ (also work for $mathbb{F}_q$ for $q=p^r$), list the possible rational canonical forms and compute the size of conjugacy classes. I doubt a "general formula" exist.
$endgroup$
– user10354138
Nov 3 '18 at 21:21
add a comment |
$begingroup$
This might be of interest: mathoverflow.net/questions/221374/…
$endgroup$
– Calle
Sep 9 '17 at 16:39
$begingroup$
$GL_n$ is in bijection with the set of ordered bases of the vector space $F^n$ (think of the columns as a basis). So maybe try to enumerate/count all bases of $F^n$.
$endgroup$
– Nick
Feb 26 '18 at 20:44
1
$begingroup$
Dear @Nick, what you said is obvious but it does not really help. ( atleast to me) What does the condition that order of $A$ is divisible by $m$ Says in terms of basis ?
$endgroup$
– Arpit Kansal
Mar 9 '18 at 1:30
$begingroup$
For $m$ a large enough power of $p$, $X_m$ is in bijection with the set of nilpotent matrices (via $Nmapsto I_n + N$) , and we can compute this cardinality (it's $p^{n^2-n}$) . I don't have an answer for more general $n$, but seeing that a general answer would yield the cardinality of nilpotent matrices which is not a trivial fact, I think a general answer must be complicated
$endgroup$
– Max
Nov 3 '18 at 20:48
2
$begingroup$
@ArpitKansal For specific $m,n,p$ (also work for $mathbb{F}_q$ for $q=p^r$), list the possible rational canonical forms and compute the size of conjugacy classes. I doubt a "general formula" exist.
$endgroup$
– user10354138
Nov 3 '18 at 21:21
$begingroup$
This might be of interest: mathoverflow.net/questions/221374/…
$endgroup$
– Calle
Sep 9 '17 at 16:39
$begingroup$
This might be of interest: mathoverflow.net/questions/221374/…
$endgroup$
– Calle
Sep 9 '17 at 16:39
$begingroup$
$GL_n$ is in bijection with the set of ordered bases of the vector space $F^n$ (think of the columns as a basis). So maybe try to enumerate/count all bases of $F^n$.
$endgroup$
– Nick
Feb 26 '18 at 20:44
$begingroup$
$GL_n$ is in bijection with the set of ordered bases of the vector space $F^n$ (think of the columns as a basis). So maybe try to enumerate/count all bases of $F^n$.
$endgroup$
– Nick
Feb 26 '18 at 20:44
1
1
$begingroup$
Dear @Nick, what you said is obvious but it does not really help. ( atleast to me) What does the condition that order of $A$ is divisible by $m$ Says in terms of basis ?
$endgroup$
– Arpit Kansal
Mar 9 '18 at 1:30
$begingroup$
Dear @Nick, what you said is obvious but it does not really help. ( atleast to me) What does the condition that order of $A$ is divisible by $m$ Says in terms of basis ?
$endgroup$
– Arpit Kansal
Mar 9 '18 at 1:30
$begingroup$
For $m$ a large enough power of $p$, $X_m$ is in bijection with the set of nilpotent matrices (via $Nmapsto I_n + N$) , and we can compute this cardinality (it's $p^{n^2-n}$) . I don't have an answer for more general $n$, but seeing that a general answer would yield the cardinality of nilpotent matrices which is not a trivial fact, I think a general answer must be complicated
$endgroup$
– Max
Nov 3 '18 at 20:48
$begingroup$
For $m$ a large enough power of $p$, $X_m$ is in bijection with the set of nilpotent matrices (via $Nmapsto I_n + N$) , and we can compute this cardinality (it's $p^{n^2-n}$) . I don't have an answer for more general $n$, but seeing that a general answer would yield the cardinality of nilpotent matrices which is not a trivial fact, I think a general answer must be complicated
$endgroup$
– Max
Nov 3 '18 at 20:48
2
2
$begingroup$
@ArpitKansal For specific $m,n,p$ (also work for $mathbb{F}_q$ for $q=p^r$), list the possible rational canonical forms and compute the size of conjugacy classes. I doubt a "general formula" exist.
$endgroup$
– user10354138
Nov 3 '18 at 21:21
$begingroup$
@ArpitKansal For specific $m,n,p$ (also work for $mathbb{F}_q$ for $q=p^r$), list the possible rational canonical forms and compute the size of conjugacy classes. I doubt a "general formula" exist.
$endgroup$
– user10354138
Nov 3 '18 at 21:21
add a comment |
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%2f1650429%2ffind-the-cardinality-of-a-subset-of-gl-n-mathbb-f-p%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%2f1650429%2ffind-the-cardinality-of-a-subset-of-gl-n-mathbb-f-p%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
$begingroup$
This might be of interest: mathoverflow.net/questions/221374/…
$endgroup$
– Calle
Sep 9 '17 at 16:39
$begingroup$
$GL_n$ is in bijection with the set of ordered bases of the vector space $F^n$ (think of the columns as a basis). So maybe try to enumerate/count all bases of $F^n$.
$endgroup$
– Nick
Feb 26 '18 at 20:44
1
$begingroup$
Dear @Nick, what you said is obvious but it does not really help. ( atleast to me) What does the condition that order of $A$ is divisible by $m$ Says in terms of basis ?
$endgroup$
– Arpit Kansal
Mar 9 '18 at 1:30
$begingroup$
For $m$ a large enough power of $p$, $X_m$ is in bijection with the set of nilpotent matrices (via $Nmapsto I_n + N$) , and we can compute this cardinality (it's $p^{n^2-n}$) . I don't have an answer for more general $n$, but seeing that a general answer would yield the cardinality of nilpotent matrices which is not a trivial fact, I think a general answer must be complicated
$endgroup$
– Max
Nov 3 '18 at 20:48
2
$begingroup$
@ArpitKansal For specific $m,n,p$ (also work for $mathbb{F}_q$ for $q=p^r$), list the possible rational canonical forms and compute the size of conjugacy classes. I doubt a "general formula" exist.
$endgroup$
– user10354138
Nov 3 '18 at 21:21