How many matrices of order 2 over the domain of Gaussian integers ( ) satisfy
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.
We want ( − 1 0 0 − 1 ) = A 2 = ( 5 b a c ) 2 = ( 2 5 + a b b ( 5 + c ) a ( 5 + c ) c 2 + a b ) so we must have c 2 = 2 5 , a b = − 2 6 and a ( 5 + c ) = b ( 5 + c ) = 0 .
If c = 5 we would see that a = b = 0 , and so the equations are inconsistent. Thus it follows that c = − 5 , and so the only other condition required is a b = − 2 6 . Thus the number of matrices of the desired form is simply equal to the number of divisors of − 2 6 in Z [ i ] . Now 2 6 = ( 1 + i ) ( 1 − i ) ( 2 + 3 i ) ( 2 − 3 i ) = i ( 1 − i ) 2 ( 2 + 3 i ) ( 2 − 3 i ) is a factorization of 2 6 into distinct irreducibles and units of Z [ i ] . Thus the most general form of a is a = u ( 1 − i ) p ( 2 + 3 i ) q ( 2 − 3 i ) r where u ∈ Z [ i ] is a unit and p , q , r are integers with 0 ≤ p ≤ 2 , 0 ≤ q , r ≤ 1 . Since there are 4 units in Z [ i ] (namely 1 , − 1 , i , − i ), we deduce that there are 4 × 3 × 2 × 2 = 4 8 divisors of − 2 6 , and hence 4 8 matrices.