Prove that $tr(A)^p = tr(A^p)$ $mod$ $p$ where $A$ is a square integer matrix and $p$ is a prime number.












4












$begingroup$


I'm looking for an elementary proof (one which does not use Galois theory). For the case $p = 3$, we have that $tr(A^3) = tr(A)^3 - 3e_1e_2 + 3e_3$ where the $e_i$ are coefficients of the characterstic polynomial of $A$, and are thus integers, so the result follows. I cannot see a way to generalize this for arbitrary $p$. Any help would be great!










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    It may help to consider the equivalent formulation $$ operatorname{tr}(n ,A^p - operatorname{tr}(A)^p I) = 0 $$ where $n$ is the size of the matrix
    $endgroup$
    – Omnomnomnom
    Dec 18 '18 at 3:31








  • 1




    $begingroup$
    I'm not sure whether my answer below is "elementary enough" (I'm still using the language of finite fields, but not any "deep theory" of). And Galois theory seems to be an overkill to apply here ;)
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:31
















4












$begingroup$


I'm looking for an elementary proof (one which does not use Galois theory). For the case $p = 3$, we have that $tr(A^3) = tr(A)^3 - 3e_1e_2 + 3e_3$ where the $e_i$ are coefficients of the characterstic polynomial of $A$, and are thus integers, so the result follows. I cannot see a way to generalize this for arbitrary $p$. Any help would be great!










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    It may help to consider the equivalent formulation $$ operatorname{tr}(n ,A^p - operatorname{tr}(A)^p I) = 0 $$ where $n$ is the size of the matrix
    $endgroup$
    – Omnomnomnom
    Dec 18 '18 at 3:31








  • 1




    $begingroup$
    I'm not sure whether my answer below is "elementary enough" (I'm still using the language of finite fields, but not any "deep theory" of). And Galois theory seems to be an overkill to apply here ;)
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:31














4












4








4


2



$begingroup$


I'm looking for an elementary proof (one which does not use Galois theory). For the case $p = 3$, we have that $tr(A^3) = tr(A)^3 - 3e_1e_2 + 3e_3$ where the $e_i$ are coefficients of the characterstic polynomial of $A$, and are thus integers, so the result follows. I cannot see a way to generalize this for arbitrary $p$. Any help would be great!










share|cite|improve this question









$endgroup$




I'm looking for an elementary proof (one which does not use Galois theory). For the case $p = 3$, we have that $tr(A^3) = tr(A)^3 - 3e_1e_2 + 3e_3$ where the $e_i$ are coefficients of the characterstic polynomial of $A$, and are thus integers, so the result follows. I cannot see a way to generalize this for arbitrary $p$. Any help would be great!







linear-algebra matrices modular-arithmetic trace






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 18 '18 at 2:29









Saad Saad

580211




580211








  • 1




    $begingroup$
    It may help to consider the equivalent formulation $$ operatorname{tr}(n ,A^p - operatorname{tr}(A)^p I) = 0 $$ where $n$ is the size of the matrix
    $endgroup$
    – Omnomnomnom
    Dec 18 '18 at 3:31








  • 1




    $begingroup$
    I'm not sure whether my answer below is "elementary enough" (I'm still using the language of finite fields, but not any "deep theory" of). And Galois theory seems to be an overkill to apply here ;)
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:31














  • 1




    $begingroup$
    It may help to consider the equivalent formulation $$ operatorname{tr}(n ,A^p - operatorname{tr}(A)^p I) = 0 $$ where $n$ is the size of the matrix
    $endgroup$
    – Omnomnomnom
    Dec 18 '18 at 3:31








  • 1




    $begingroup$
    I'm not sure whether my answer below is "elementary enough" (I'm still using the language of finite fields, but not any "deep theory" of). And Galois theory seems to be an overkill to apply here ;)
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:31








1




1




$begingroup$
It may help to consider the equivalent formulation $$ operatorname{tr}(n ,A^p - operatorname{tr}(A)^p I) = 0 $$ where $n$ is the size of the matrix
$endgroup$
– Omnomnomnom
Dec 18 '18 at 3:31






$begingroup$
It may help to consider the equivalent formulation $$ operatorname{tr}(n ,A^p - operatorname{tr}(A)^p I) = 0 $$ where $n$ is the size of the matrix
$endgroup$
– Omnomnomnom
Dec 18 '18 at 3:31






1




1




$begingroup$
I'm not sure whether my answer below is "elementary enough" (I'm still using the language of finite fields, but not any "deep theory" of). And Galois theory seems to be an overkill to apply here ;)
$endgroup$
– metamorphy
Dec 18 '18 at 6:31




$begingroup$
I'm not sure whether my answer below is "elementary enough" (I'm still using the language of finite fields, but not any "deep theory" of). And Galois theory seems to be an overkill to apply here ;)
$endgroup$
– metamorphy
Dec 18 '18 at 6:31










1 Answer
1






active

oldest

votes


















4












$begingroup$

If $A,B$ are commuting square matrices over $mathbb{F}_p=mathbb{Z}/pmathbb{Z}$ of the same size, then
$$(A+B)^p=A^p+B^p$$
(the binomial formula is valid here, and $pmidbinom{p}{k}$ for $0<k<p$). (The same holds for $A,B$ over $mathbb{F}_p[lambda]$, for the same reason.) It follows, for a matrix $A$ over $mathbb{F}_p$, denoting by $chi_A(lambda)=det(lambda I-A)$ its characteristic polynomial, that $(lambda I-A)^p=lambda^p I-A^p$ and therefore $chi_{A^p}(lambda^p)=big(chi_A(lambda)big)^p$. But $big(f(x)big)^p=f(x^p)$ for any polynomial $finmathbb{F}_p[x]$ (this is usually proven by induction on the degree of $f$ using the same "binomial argument" as above, and the fact that $a^p=a$ for any $ainmathbb{F}_p$).



Thus actually we have $chi_{A^p}(lambda^p)=chi_A(lambda^p)$, i.e. just $color{blue}{chi_{A^p}equivchi_A}$. As a corollary (comparing the coefficients), we get $operatorname{tr}(A^p)=operatorname{tr}(A)$, and we're done (again by $a^p=a$ for any $ainmathbb{F}_p$).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Could you explain why the line about the characteristic polynomials being equal?
    $endgroup$
    – Saad
    Dec 18 '18 at 6:47










  • $begingroup$
    I meant the equality between characteristic polynomials right after "and therefore ..."
    $endgroup$
    – Saad
    Dec 18 '18 at 6:53






  • 1




    $begingroup$
    Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:55












  • $begingroup$
    Sorry, just saw that. It's clear now, thanks!
    $endgroup$
    – Saad
    Dec 18 '18 at 6:56










  • $begingroup$
    @reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 8:01













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%2f3044716%2fprove-that-trap-trap-mod-p-where-a-is-a-square-integer-matrix-an%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









4












$begingroup$

If $A,B$ are commuting square matrices over $mathbb{F}_p=mathbb{Z}/pmathbb{Z}$ of the same size, then
$$(A+B)^p=A^p+B^p$$
(the binomial formula is valid here, and $pmidbinom{p}{k}$ for $0<k<p$). (The same holds for $A,B$ over $mathbb{F}_p[lambda]$, for the same reason.) It follows, for a matrix $A$ over $mathbb{F}_p$, denoting by $chi_A(lambda)=det(lambda I-A)$ its characteristic polynomial, that $(lambda I-A)^p=lambda^p I-A^p$ and therefore $chi_{A^p}(lambda^p)=big(chi_A(lambda)big)^p$. But $big(f(x)big)^p=f(x^p)$ for any polynomial $finmathbb{F}_p[x]$ (this is usually proven by induction on the degree of $f$ using the same "binomial argument" as above, and the fact that $a^p=a$ for any $ainmathbb{F}_p$).



Thus actually we have $chi_{A^p}(lambda^p)=chi_A(lambda^p)$, i.e. just $color{blue}{chi_{A^p}equivchi_A}$. As a corollary (comparing the coefficients), we get $operatorname{tr}(A^p)=operatorname{tr}(A)$, and we're done (again by $a^p=a$ for any $ainmathbb{F}_p$).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Could you explain why the line about the characteristic polynomials being equal?
    $endgroup$
    – Saad
    Dec 18 '18 at 6:47










  • $begingroup$
    I meant the equality between characteristic polynomials right after "and therefore ..."
    $endgroup$
    – Saad
    Dec 18 '18 at 6:53






  • 1




    $begingroup$
    Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:55












  • $begingroup$
    Sorry, just saw that. It's clear now, thanks!
    $endgroup$
    – Saad
    Dec 18 '18 at 6:56










  • $begingroup$
    @reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 8:01


















4












$begingroup$

If $A,B$ are commuting square matrices over $mathbb{F}_p=mathbb{Z}/pmathbb{Z}$ of the same size, then
$$(A+B)^p=A^p+B^p$$
(the binomial formula is valid here, and $pmidbinom{p}{k}$ for $0<k<p$). (The same holds for $A,B$ over $mathbb{F}_p[lambda]$, for the same reason.) It follows, for a matrix $A$ over $mathbb{F}_p$, denoting by $chi_A(lambda)=det(lambda I-A)$ its characteristic polynomial, that $(lambda I-A)^p=lambda^p I-A^p$ and therefore $chi_{A^p}(lambda^p)=big(chi_A(lambda)big)^p$. But $big(f(x)big)^p=f(x^p)$ for any polynomial $finmathbb{F}_p[x]$ (this is usually proven by induction on the degree of $f$ using the same "binomial argument" as above, and the fact that $a^p=a$ for any $ainmathbb{F}_p$).



Thus actually we have $chi_{A^p}(lambda^p)=chi_A(lambda^p)$, i.e. just $color{blue}{chi_{A^p}equivchi_A}$. As a corollary (comparing the coefficients), we get $operatorname{tr}(A^p)=operatorname{tr}(A)$, and we're done (again by $a^p=a$ for any $ainmathbb{F}_p$).






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Could you explain why the line about the characteristic polynomials being equal?
    $endgroup$
    – Saad
    Dec 18 '18 at 6:47










  • $begingroup$
    I meant the equality between characteristic polynomials right after "and therefore ..."
    $endgroup$
    – Saad
    Dec 18 '18 at 6:53






  • 1




    $begingroup$
    Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:55












  • $begingroup$
    Sorry, just saw that. It's clear now, thanks!
    $endgroup$
    – Saad
    Dec 18 '18 at 6:56










  • $begingroup$
    @reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 8:01
















4












4








4





$begingroup$

If $A,B$ are commuting square matrices over $mathbb{F}_p=mathbb{Z}/pmathbb{Z}$ of the same size, then
$$(A+B)^p=A^p+B^p$$
(the binomial formula is valid here, and $pmidbinom{p}{k}$ for $0<k<p$). (The same holds for $A,B$ over $mathbb{F}_p[lambda]$, for the same reason.) It follows, for a matrix $A$ over $mathbb{F}_p$, denoting by $chi_A(lambda)=det(lambda I-A)$ its characteristic polynomial, that $(lambda I-A)^p=lambda^p I-A^p$ and therefore $chi_{A^p}(lambda^p)=big(chi_A(lambda)big)^p$. But $big(f(x)big)^p=f(x^p)$ for any polynomial $finmathbb{F}_p[x]$ (this is usually proven by induction on the degree of $f$ using the same "binomial argument" as above, and the fact that $a^p=a$ for any $ainmathbb{F}_p$).



Thus actually we have $chi_{A^p}(lambda^p)=chi_A(lambda^p)$, i.e. just $color{blue}{chi_{A^p}equivchi_A}$. As a corollary (comparing the coefficients), we get $operatorname{tr}(A^p)=operatorname{tr}(A)$, and we're done (again by $a^p=a$ for any $ainmathbb{F}_p$).






share|cite|improve this answer











$endgroup$



If $A,B$ are commuting square matrices over $mathbb{F}_p=mathbb{Z}/pmathbb{Z}$ of the same size, then
$$(A+B)^p=A^p+B^p$$
(the binomial formula is valid here, and $pmidbinom{p}{k}$ for $0<k<p$). (The same holds for $A,B$ over $mathbb{F}_p[lambda]$, for the same reason.) It follows, for a matrix $A$ over $mathbb{F}_p$, denoting by $chi_A(lambda)=det(lambda I-A)$ its characteristic polynomial, that $(lambda I-A)^p=lambda^p I-A^p$ and therefore $chi_{A^p}(lambda^p)=big(chi_A(lambda)big)^p$. But $big(f(x)big)^p=f(x^p)$ for any polynomial $finmathbb{F}_p[x]$ (this is usually proven by induction on the degree of $f$ using the same "binomial argument" as above, and the fact that $a^p=a$ for any $ainmathbb{F}_p$).



Thus actually we have $chi_{A^p}(lambda^p)=chi_A(lambda^p)$, i.e. just $color{blue}{chi_{A^p}equivchi_A}$. As a corollary (comparing the coefficients), we get $operatorname{tr}(A^p)=operatorname{tr}(A)$, and we're done (again by $a^p=a$ for any $ainmathbb{F}_p$).







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 21 '18 at 18:23

























answered Dec 18 '18 at 6:20









metamorphymetamorphy

3,6821621




3,6821621












  • $begingroup$
    Could you explain why the line about the characteristic polynomials being equal?
    $endgroup$
    – Saad
    Dec 18 '18 at 6:47










  • $begingroup$
    I meant the equality between characteristic polynomials right after "and therefore ..."
    $endgroup$
    – Saad
    Dec 18 '18 at 6:53






  • 1




    $begingroup$
    Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:55












  • $begingroup$
    Sorry, just saw that. It's clear now, thanks!
    $endgroup$
    – Saad
    Dec 18 '18 at 6:56










  • $begingroup$
    @reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 8:01




















  • $begingroup$
    Could you explain why the line about the characteristic polynomials being equal?
    $endgroup$
    – Saad
    Dec 18 '18 at 6:47










  • $begingroup$
    I meant the equality between characteristic polynomials right after "and therefore ..."
    $endgroup$
    – Saad
    Dec 18 '18 at 6:53






  • 1




    $begingroup$
    Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 6:55












  • $begingroup$
    Sorry, just saw that. It's clear now, thanks!
    $endgroup$
    – Saad
    Dec 18 '18 at 6:56










  • $begingroup$
    @reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
    $endgroup$
    – metamorphy
    Dec 18 '18 at 8:01


















$begingroup$
Could you explain why the line about the characteristic polynomials being equal?
$endgroup$
– Saad
Dec 18 '18 at 6:47




$begingroup$
Could you explain why the line about the characteristic polynomials being equal?
$endgroup$
– Saad
Dec 18 '18 at 6:47












$begingroup$
I meant the equality between characteristic polynomials right after "and therefore ..."
$endgroup$
– Saad
Dec 18 '18 at 6:53




$begingroup$
I meant the equality between characteristic polynomials right after "and therefore ..."
$endgroup$
– Saad
Dec 18 '18 at 6:53




1




1




$begingroup$
Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
$endgroup$
– metamorphy
Dec 18 '18 at 6:55






$begingroup$
Yes, I've edited this right before. We take $det$ of the both sides of $(lambda I-A)^p=lambda^p I-A^p$.
$endgroup$
– metamorphy
Dec 18 '18 at 6:55














$begingroup$
Sorry, just saw that. It's clear now, thanks!
$endgroup$
– Saad
Dec 18 '18 at 6:56




$begingroup$
Sorry, just saw that. It's clear now, thanks!
$endgroup$
– Saad
Dec 18 '18 at 6:56












$begingroup$
@reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
$endgroup$
– metamorphy
Dec 18 '18 at 8:01






$begingroup$
@reuns: for non-commuting $X,Y$, $(X+Y)^p=X^p+Y^p$ may fail to hold.
$endgroup$
– metamorphy
Dec 18 '18 at 8:01




















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%2f3044716%2fprove-that-trap-trap-mod-p-where-a-is-a-square-integer-matrix-an%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

Måne

Storängen

VLT Carioca