Solve Idempotent Matrix Inequality: n≥p-1 | Artin's Algebra

  • Thread starter Thread starter Dunkle
  • Start date Start date
  • Tags Tags
    Matrix
Dunkle
Messages
54
Reaction score
0

Homework Statement



This is from Chapter 11 of Artin's Algebra:

Let p be a prime, and let A (not the identity) be an nxn integer matrix such that A^{p}=I. Prove that n \geq p-1.

Homework Equations



This is in the factorization chapter, and the section is called Explicit Factorization of Polynomials.

The Attempt at a Solution



I don't even know where to begin. I'm guessing I need to somehow get a polynomial equation, but like I said, I don't really know where to start. Any help would be greatly appreciated!
 
Last edited:
Physics news on Phys.org
haven't got there yet, but hopefully these help you get started

clearly A is invertible as A^(p-1) = A^-1

also note that
A^(p+1) - A = A(A^p - I ) = 0
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top