Why are General Linear Groups Non Abelian?

Click For Summary

Homework Help Overview

The problem involves demonstrating that the general linear group defined by n and an arbitrary field F is non-abelian for n > 1. The original poster seeks to understand the nature of non-commuting matrices within this context.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • The original poster considers finding two invertible matrices that do not commute as a method to prove the non-abelian nature of the group but expresses uncertainty about the approach.
  • Some participants discuss the low probability of two matrices commuting and suggest that demonstrating non-commutativity can be achieved by examining specific entries of the matrices.
  • Others mention the significance of the field's characteristics and propose checking specific matrix products to illustrate non-commutativity.

Discussion Status

The discussion is active, with participants providing insights and suggestions on how to approach the problem. There is a focus on exploring specific examples and characteristics of matrices to establish non-commutativity, but no consensus or final solution has been reached.

Contextual Notes

Participants note the importance of the field's characteristics and the limitations of working with specific matrix sizes, particularly in relation to the properties of the general linear group.

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.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
15
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
5
Views
2K