Question

Show that if a square matrix K over Zp ( p prime) is involutory ( or...

Show that if a square matrix K over Zp ( p prime) is involutory ( or self-inverse), then det K=+-1

(An nxn matrix K is called involutory if K is invertible and K-1 = K)

from Applied algebra

show details

Homework Answers

Answer #1

Note that Zp where p is prime is a field

As involutary matrix A is defined as

A = A-1

i.e. A2 = I

Thus characterstic polynomial is given by x2 -1 = (x + 1)(x-1)

Minimal polynomial can be (x+1) or (x-1) or (x+1)(x-1)

If mimimal polynomial is

a) x + 1

i.e. matrix A must satisfy it

A + I = 0

A = -I

thus, det(A) = det(-I) = -1

b) If minimal polynomial is x -1

then,    Matrix A satisfies it

A - I = 0

A = I

det(A) = det(I) = 1

c) Minimal polynomial is (x-1)(x+1)

Implies that eigen values are a mix of +1 or -1

We know det A = product of all eigen values = 1m(-1)n

if n is even the det is +1 and if n is odd then   -1

thus det A = +-1

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Show that a square matrix P over the integers has an inverse with integer entries if...
Show that a square matrix P over the integers has an inverse with integer entries if and only if P is unimodular, that is, the determinant of P is ±1.
1). Show that if AB = I (where I is the identity matrix) then A is...
1). Show that if AB = I (where I is the identity matrix) then A is non-singular and B is non-singular (both A and B are nxn matrices) 2). Given that det(A) = 3 and det(B) = 2, Evaluate (numerical answer) each of the following or state that it’s not possible to determine the value. a) det(A^2) b) det(A’) (transpose determinant) c) det(A+B) d) det(A^-1) (inverse determinant)
(1) A square matrix with entries aj,k , j, k = 1, ..., n, is called...
(1) A square matrix with entries aj,k , j, k = 1, ..., n, is called diagonal if aj,k = 0 whenever j is not equal to k. Show that the product of two diagonal n × n-matrices is again diagonal.
If p = 2k − 1 is prime, show that k is an odd integer or...
If p = 2k − 1 is prime, show that k is an odd integer or k = 2. Hint: Use the difference of squares 22m − 1 = (2m − 1)(2m + 1).
Let p be prime. Show that the equation x^2 is congruent to 1(mod p) has just...
Let p be prime. Show that the equation x^2 is congruent to 1(mod p) has just two solutions in Zp (the set of integers). We cannot use groups.
Let A be a square matrix with an inverse A-1. Show that if Ab = 0...
Let A be a square matrix with an inverse A-1. Show that if Ab = 0 then b must be the zero vector.
Prove that for a square n ×n matrix A, Ax = b (1) has one and...
Prove that for a square n ×n matrix A, Ax = b (1) has one and only one solution if and only if A is invertible; i.e., that there exists a matrix n ×n matrix B such that AB = I = B A. NOTE 01: The statement or theorem is of the form P iff Q, where P is the statement “Equation (1) has a unique solution” and Q is the statement “The matrix A is invertible”. This means...
If G is a group of order (p^k)s where p is a prime number such that...
If G is a group of order (p^k)s where p is a prime number such that (p,s)=1, then show that each subgroup of order p^i ; i= 1,2...(k-1) is a normal subgroup of atleast one subgroup of order p^(i+1)
Let p be a prime and let a be a primitive root modulo p. Show that...
Let p be a prime and let a be a primitive root modulo p. Show that if gcd (k, p-1) = 1, then b≡ak (mod p) is also a primitive root modulo p.
Let p(x) be an irreducible polynomial of degree n over a finite field K. Show that...
Let p(x) be an irreducible polynomial of degree n over a finite field K. Show that its Galois group over K is cyclic of order n and then show how the Galois group of x3 − 1 over Q is cyclic of order 2.