Simplicity of P SL n (F ) for n > 2

Similar documents
Linear Algebra II. 2 Matrices. Notes 2 21st October Matrix algebra

Review of linear algebra

6 Orthogonal groups. O 2m 1 q. q 2i 1 q 2i. 1 i 1. 1 q 2i 2. O 2m q. q m m 1. 1 q 2i 1 i 1. 1 q 2i. i 1. 2 q 1 q i 1 q i 1. m 1.

Chapter 2 Notes, Linear Algebra 5e Lay

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Chapter 1: Systems of Linear Equations

ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS

Definition 2.3. We define addition and multiplication of matrices as follows.

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

4. Linear transformations as a vector space 17

Calculating determinants for larger matrices

Lecture Summaries for Linear Algebra M51A

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

Review of Linear Algebra

Linear Equations in Linear Algebra

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

Topic 1: Matrix diagonalization

INTRODUCTION TO LIE ALGEBRAS. LECTURE 2.

1 Last time: least-squares problems

Linear equations in linear algebra

EXERCISE SHEET 2 WITH SOLUTIONS

Online Exercises for Linear Algebra XM511

MAT 445/ INTRODUCTION TO REPRESENTATION THEORY

Notes on the matrix exponential

CS 246 Review of Linear Algebra 01/17/19

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

Chapter 5. Eigenvalues and Eigenvectors

LECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]

REPRESENTATION THEORY WEEK 5. B : V V k

Evaluating Determinants by Row Reduction

MATH 235. Final ANSWERS May 5, 2015

A = 3 B = A 1 1 matrix is the same as a number or scalar, 3 = [3].

LECTURES 14/15: LINEAR INDEPENDENCE AND BASES

A VERY BRIEF LINEAR ALGEBRA REVIEW for MAP 5485 Introduction to Mathematical Biophysics Fall 2010

Solving a system by back-substitution, checking consistency of a system (no rows of the form

Elementary maths for GMT

Quantum Computing Lecture 2. Review of Linear Algebra

Johns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

CS 143 Linear Algebra Review

MATH 583A REVIEW SESSION #1

1 Matrices and Systems of Linear Equations

10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns.

Math 240 Calculus III

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

1 Last time: inverses

Math113: Linear Algebra. Beifang Chen

1.1 Limits and Continuity. Precise definition of a limit and limit laws. Squeeze Theorem. Intermediate Value Theorem. Extreme Value Theorem.

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

x y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2

3 Matrix Algebra. 3.1 Operations on matrices

2.1 Matrices. 3 5 Solve for the variables in the following matrix equation.

JORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5

Chapter 2: Linear Independence and Bases

LIE ALGEBRAS: LECTURE 7 11 May 2010

Math 4377/6308 Advanced Linear Algebra

Algebra I Fall 2007

Matrices. In this chapter: matrices, determinants. inverse matrix

Eigenvalues and Eigenvectors

Lecture notes: Applied linear algebra Part 1. Version 2

The Jordan Canonical Form

Matrix Algebra 2.1 MATRIX OPERATIONS Pearson Education, Inc.

Announcements Wednesday, November 01

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form:

Lec 2: Mathematical Economics

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

Econ Slides from Lecture 7

GENERATING SETS KEITH CONRAD

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction

Topics in linear algebra

No books, notes, any calculator, or electronic devices are allowed on this exam. Show all of your steps in each answer to receive a full credit.

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

Background on Chevalley Groups Constructed from a Root System

ISOMETRIES OF R n KEITH CONRAD

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

Eigenvalues, Eigenvectors. Eigenvalues and eigenvector will be fundamentally related to the nature of the solutions of state space systems.

Differential Topology Solution Set #3

Representations and Linear Actions

Matrices. Chapter Definitions and Notations

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS

Practical Linear Algebra: A Geometry Toolbox

1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by

(1) for all (2) for all and all

Linear Equations in Linear Algebra

Vector Spaces. Addition : R n R n R n Scalar multiplication : R R n R n.

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

Study Guide for Linear Algebra Exam 2

INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS

Final Examination 201-NYC-05 - Linear Algebra I December 8 th, and b = 4. Find the value(s) of a for which the equation Ax = b

1 Matrices and Systems of Linear Equations. a 1n a 2n

Elementary Linear Algebra

G1110 & 852G1 Numerical Linear Algebra

Linear Algebra Primer

L(C G (x) 0 ) c g (x). Proof. Recall C G (x) = {g G xgx 1 = g} and c g (x) = {X g Ad xx = X}. In general, it is obvious that

Math 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.

Counting Matrices Over a Finite Field With All Eigenvalues in the Field

SUPPLEMENT ON THE SYMMETRIC GROUP

Transcription:

Simplicity of P SL n (F ) for n > 2 Kavi Duvvoori October 2015 A Outline To show the simplicity of P SL n (F ) (for n > 3), we will consider a class of linear maps called transvections, or shear mappings - linear maps that fix some hyperplane, and move points in some fixed direction parallel to that hyperplane an amount proportional to their distance from it. Transvections turn out to both generate SL n (F ) and be transitive under conjugation. We will then be able to show that any normal subgroup not contained in the center of SL n (F ) must contain some non-trivial transvection, and hence all of SL n (F ). It follows from that that SL n (F )/Z(SL n (F )) is a simple group. We will take advantage of the fact that in sufficient dimensions a hyperplane has at least two linearly independent vectors, and this is why we require n > 2. It might also be possible to see these facts in terms of matrix representations of these mappings, but the proof repeatedly considers transvections over varying bases, so it is much more convenient to consider these transvections geometrically. B i Transvections Definition A linear transformation T GL n (F ) is a transvection if it is of the form T x = x + λ(x)u for some non-zero functional λ and some vector u Ker(λ). Recall that a non-zero functional, as a map from an n-dimensional vector space to a 1-dimensional vector space, has as its kernel an (n 1)-dimensional subspace of F n, some hyperplane: define H λ = Ker(λ). If you like that sort of thing, these maps have a geometric interpretation: they are linear maps that fix a 1

hyperplane, and map all other vectors in a fixed direction parallel to it, an amount proportional to their distance from the hyperplane. Let T λ,u, for u Ker(λ) be the the transvection where T λ,u x x+λ(x)+u. Then, if u, v H λ, T λ,u T λ,v (x) = x + λ(x)v + λ(x + λ(x)v)u = x + λ(x)v + λ(x)u = x + λ(x)(u + v) = T λ,u+v (x), since u, v Ker(λ). Also, this implies that T 1 λ,u x = x λ(x)u = T λ, ux. C Proposition 1: Transvections Generate SL n (F ) First, we will sketch a proof for the fact from linear algebra that elementary matrices generate SL n (F ): the elementary matrix E ij (c) with i j is the matrix consisting of 1s on the diagonal, a c in the ijth position, and 0s everywhere else. Note that multiplication by E ij is equivalent to the row operation of adding c times the jth row to the ith row. Now, suppose S SL n (F ). Then, some row has non-zero first entry. Adding a suitable multiple to the first row, we can make the first entry of the first row equal to 1. If the first row is the only non-zero row, it can be added to the second row, and after a suitable multiple of the second row (which now has non-zero first entry), subtracted from the first row. Subtracting suitable multiples of the first row from all the other rows, we can then make all the other rows first entry 0. Similarly, some row now has non-zero second entry. Adding a suitable multiple, we can make the second entry in the second row 1. Given this, we can make the second entry of all the other rows 0, by subtracting suitable multiples of the second. Note that this keeps the first entries fixed. As long as there is some lower row, it is possible to make the appropriate entry 1, even if the matrix is diagonal. Continuing this process, we can attain a diagonal matrix. Since det(s) = 1, the final entry must also be 1, and this matrix must be the identity. Thus, S can be constructed from the identity by a series of row operations, and equivalently, can be written as a product of elementary matrices. Now, we just have to notice that any elementary matrix represents a transvection: given the elementary matrix E ij (c), let λ be the functional mapping all basis vectors other than e j to 0, and e j to c. Then, E ij (x) = x + λ(x)e i = T λ,ei 2

D Proposition 2: For n 3, the non-identity transvections form a single conjugacy class of SL n (F ) Let T λ,u be an arbitrary transvection and A an arbitrary element of SL n (F ). Then, AT A 1 (x) = AT (A 1 x) = A(A 1 x + λ(a 1 x)u) = x + λ(a 1 x)au = T λ,u where λ = λ A 1 and u = Au. Since A is an automorphism, λ A 1 is a linear functional, and Au 0. Thus, the non-identity transvections are closed under conjugation. Now, let T = T λ,u and T = T λ,u be any two distinct non-trivial transvections. Then there are some z, z F n with T z = T z = 1. Now, we can extend u to a basis for H λ and u to a basis for H λ. With z and z respectively, these yield two different bases for f n. Since n 3, H λ contains some vector v independent from u and H λ v from u. Then, there is some change of basis matrix A between these two bases, with Au = u, AH λ = AH λ and Az = z. Scaling appropriately, we can have Av = cv so that det(a) = 1. Then, AT A 1 x = x + λ(a 1 x)au. Since Au = u, A fixes H, and Az = z λ(a 1 x) = λ (x), then AT A 1 x = x + λ (x)u = T x. Thus, the non-trivial transvections are transitive. E Corollary 1: For n 3, if A SL n (F ), AGA 1 G and G contains a transvection, then SL n (F ) G By proposition 2, conjugates of the given transvection yield all transvections, and by proposition 1 the transvections generate SL n (F ), hence G contains SL n (F ). F Lemma 3: Z(SL n (F )) consists of the subgroup of scalar multiplications Note that for M SL n (F ) to be contained in the center Z(SL n (F )), it must commute with all matrices of the form 1 ij, i.e. matrices with a 1 in the ith row and jth column and 0s everywhere else. Hence, M must have a zero on all non-diagonal entries, and the same value along the the diagonal - it must represent multiplication by some scalar. Scalar multiplication commutes with any element of GL n (F ), hence Z(SL n (F )) consists of scalar multiplications. 3

G Lemma 4: For n 3,, if A SL n (F ), AGA 1 G and G Z(SL n (F )), then G contains a nonidentity transvection We just want to show G contains a transvection. Since G is not contained in the center, there is some A G where A moves a line, i.e. u F n where Au = v and v is not a scalar multiple of u. Recall that AT λ,u A 1 x = x + λ(a 1 x)au = x + λ(a 1 x)v T λ,u since v and u are linearly independent. Thus, B = AT λ,u A 1 T 1 I. Bx = AT A 1 T 1 x = AT A 1 (x λ(x)u) = x λ(x)u + λ (x λ(x)u)v = x λ(x)u + λ (x). Thus, Bx x is contained in the plane (u, v). Then, let H be some hyperplane containing u and v - then BH H so BH = H and Bx x H. Since A 1 G, T λ,u A 1 T 1 λ,u, as a conjugate of an SL n(f ) invariant subgroup, is in G, so B = A(T λ,u A 1 T 1 λ,u ) G. i Case 1: All transvections on H commute with B. Consider any w H. BT w x = Bx + λ(x)bw and T w Bx = Bx + λ(bx)w = Bx + λ(x)w. Then, since BT w = T w B, Bw = w. Thus, B fixes H. Since Bx x H, B is then a transvection. ii Case 2: Some transvection T w does not commute with B Let C = BT w B 1 Tw 1. Then, since B and T w do not commute, C I. Now, since BH = H = B 1 H, we have that BT w B 1 and Tw 1 both are transvections with hyperplane H, so their product, C, is also a transvection. Finally, C is the product of B and a conjugate of B 1, which by SL n (F ) invariance is in G, so C G. H Corollary 2: For n 3,, if A SL n (F ), AGA 1 G and G Z(SL n (F )), then SL n (F ) G Immediate from Lemma 4 and Lemma 3. 4

I Proposition 3: For n 3, P SL n (F ) is simple Let G P Sl n (F ) be some non-trivial normal subgroup. Then, if φ : SL n (F ) SL n (F )/Z(SL n (F )) = P SL n (F ) is the quotient map, φ 1 (G) = G is a normal subgroup of SL n (F ). Since G is non-trivial, G Z(SL n (F )). Then, by Lemma 5, SL n (F ) G, so G = P SL n (F ). J Source: Adapted from Lang, S. (1993). Algebra 3rd-edition. Pg. 541-545 5