Matrix Orders In GL ( n , p ) \text{GL}(n,p)

Algebra Level 5

Consider the set of n n -by- n n matrices whose entries are integers modulo p p , for some prime p p . The matrices in this set with nonzero determinant are invertible, and thus form a group under matrix multiplication; this group is given the name GL ( n , p ) \text{GL}(n,p) , where the "GL" stands for "general linear."

Given a matrix M GL ( n , p ) M \in \text{GL}(n,p) , its order is defined to be the smallest integer k k such that M k = I M^k = I , where I GL ( n , p ) I \in \text{GL}(n,p) denotes the identity matrix. In this problem, you will compute the maximum possible order of a matrix in GL ( n , p ) \text{GL}(n,p) . That is, you will answer the question "What is the largest integer m N m \in \mathbb{N} such that m m is the order of a matrix in GL ( n , p ) ? \text{GL}(n,p)? "


Hint & Proof Sketch:

  • Let A A be a matrix in GL ( n , p ) \text{GL}(n,p) . Consider the vector space V ( A , p ) V(A,p) generated by the powers of A A , with coefficients in the field of p p elements . That is, V ( A , p ) V(A,p) is the vector space (under addition) of linear combinations a 0 + a 1 A + a 2 A 2 + a 3 A 3 + , a_0 + a_1 A + a_2 A^2 + a_3 A^3 + \cdots, where the coefficients a i a_i are integers modulo p p . The Cayley-Hamilton theorem implies V ( A , p ) V(A,p) is finite dimensional; what is the largest possible value of its dimension ( \big( as A A ranges over the group GL ( n , p ) ) ? \text{GL}(n,p)\big)?

  • Suppose dim ( V ( A , p ) ) = k \dim\big(V(A,p)\big) = k . What does this imply about the order of A A in GL ( n , p ) ? \text{GL}(n,p)? To answer this question, note that any power of A A must be in V ( A , p ) V(A,p) , since the exponents in powers of A A can be reduced using the polynomial relation produced by Cayley-Hamilton .

  • Let K K denote the largest possible value of dim ( V ( A , p ) ) \dim\big(V(A,p)\big) when A A ranges over GL ( n , p ) \text{GL}(n,p) . Can you find a matrix B GL ( n , p ) B \in \text{GL}(n,p) whose order is at least K ? K? What does this imply in light of the previous two steps?

As your answer to this problem, submit the maximum possible order of a matrix in GL ( 4 , 5 ) \text{GL}(4,5) , i.e. max A GL ( 4 , 5 ) Order ( A ) . \max_{A \in \text{GL}(4,5)} \text{Order}(A).


The answer is 624.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Otto Bretscher
Apr 14, 2016

Your hints are pretty much giving it away ;)

We will work over the field F p F_p with p p elements throughout.

Since V ( A , p ) V(A,p) is spanned by I n , A , . . , A n 1 I_n,A,..,A^{n-1} , by Cayley-Hamilton, we know that dim F p ( V ( A , p ) ) n \dim_{F_p}(V(A,p))\leq n . Thus V ( A , p ) V(A,p) contains at most p n 1 p^n-1 non-zero matrices.

There must exist two integers 1 a < b p n 1\leq a<b\leq p^n such that A a = A b A^a=A^b , or A b a = I n A^{b-a}=I_n : The order of A A is at most p n 1 p^n-1 .

Consider a multiplicative generator a a of the field with p n p^n elements, and let f ( x ) f(x) be the minimal polynomial of a a over F p F_p , a polynomial of degree n n . Let A A be an n × n n\times n matrix whose characteristic polynomial is f ( x ) f(x) . Since a a is an eigenvalue of A A , the order of A A will be at least p n 1 p^n-1 .

It follows that the maximum possible order of A A is exactly p n 1 p^n-1 , which is 5 4 1 = 624 5^4-1=\boxed{624} in our case.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...