Explaining my counter-example that a group is not abelian inductively

  • Thread starter Thread starter lus1450
  • Start date Start date
  • Tags Tags
    Group
lus1450
Messages
40
Reaction score
1

Homework Statement


Show that for any field F, for n\ge2, the group GL_{n}(F) is not abelian.


Homework Equations



The Attempt at a Solution


I have found a counter example for all such n. First, for n=2, consider the matrices: A = \left( \begin{array}{ccc}<br /> 1 &amp; 1\\<br /> 1 &amp; 1 \end{array} \right) and B = \left( \begin{array}{ccc}<br /> 0 &amp; 0\\<br /> 1 &amp; 0 \end{array} \right), since all fields contain 0,1. By computing, we find that AB \ne BA, and so the group is not abelian. To generalize for any n, if we have A&#039; = A \oplus I_{n-2} and B&#039; = B \oplus I_{n-2}, then A&#039;B&#039; \ne B&#039;A&#039;, since the "upper left" 2 \times 2 block matrix of A&#039;B&#039; is just AB, then there are 1s on the diagonal and 0s everywhere else. It's the same for B&#039;A&#039;, except the upper block is BA instead, and so of course the two matrices don't commute. However, I'm having a trouble wording that rigorously. I'm positive my explanation was not rigorous enough, so I was thinking of doing induction, but I'm not sure about how to proceed with that. Would expressing the product in summation notation be the way to go, or is it intuitive enough that my counterexample is enough to show the groups aren't commutative? Thanks for the advice.
 
Physics news on Phys.org
Don't the matrices have to be invertible? I don't think A is valid.
 
ArcanaNoir said:
Don't the matrices have to be invertible? I don't think A is valid.
Yes, they do. B also is not valid.

The outlined approach is valid given a pair of valid 2x2 matrices as the starting point.
 
Indeed, I apologize. Before, I had a working example where the matrices were actually invertible, but it turned out to not work for a certain field (as pointed out somewhere else), so I hastily pieced together different matrices before posting. In my tiredness, I guess I just ignored the very definition of the general linear group when formulating them. And thank you for the verification of the method outlined, and thanks also for reassuring I should double check myself before I appear ignorant of definitions.
 
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