Why are General Linear Groups Non Abelian?

lola1990
Messages
30
Reaction score
0

Homework Statement


Show that if n>1 and F is an arbitrary field, the general linear group defined by n and F is non-abelian


Homework Equations


A general linear group is the group of invertible matrices with entries from F

A non abelian group is a group where the binary operation isn't commutative


The Attempt at a Solution


I thought that a good way to go about this problem would be to find two general invertible matrices that don't commute. However, I'm having trouble finding them. Is this the right way to go about it? If not, how can I prove this?
 
Physics news on Phys.org
Actually, the probability that two matrices will commute is zero. Take any two
matrices A,B , neither of which is a scalar multiple of the identity, and multiply
them. If they commute, go buy a lottery ticket; you have beaten gigantic odds.

You may even be able to tell that the respective first entries AB1,1 and
BA1,1 are different.
 
When finding your non-commuting matrices, remember that there are only 2 elements guaranteed to be in your field, namely 0 and 1 (with 0 \neq 1), since you could even be working over \mathbb{F}_2. But I think your approach is good, and as Bacle said, you can show 2 matrices are not equal just by finding a single entry that isn't the same.
 
Your right, Spamiam, I had not thought of that. I was just thinking you may do a product of 2x2 matrices , and see how difficult it is for them to commute, by checking a single entry, and trying to determine when/how it can be made to commute.
 
if char(F) is not 2:

[1 1][1 0]...[2 1]
[0 1][1 1] = [1 1],

[1 0][1 1]...[1 1]
[1 1][0 1] = [1 2]

if char(F) = 2:

[1 1][1 0]...[0 1]
[0 1][1 1] = [1 1],

[1 0][1 1]...[1 1]
[1 1][0 1] = [1 0], so in either case we see these two matrices do not commute.

for n > 2, call the first 2x2 matrix above A, the 2nd B (from the top product).

define the following nxn matrices in block form:

[A 0]..[B 0]
[0 I ], [0 I]...it should be clear these are invertible, and do not commute.
 
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...
Back
Top