Sporadic and related groups. Lecture 11 Matrices over finite fields J 4
|
|
- Trevor Hart
- 5 years ago
- Views:
Transcription
1 Sporadic and related groups. Lecture 11 Matrices over finite fields J 4
2 Original aim of the meat-axe. Find the (degrees of the) 13 irreducible representations of M 24 mod 2. Gordon James found 12 of them theoretically in his PhD thesis (~1972) Next step - work directly with matrices. Tensor representations to make bigger ones Chop the result up into irreducibles. The 13 th degree is 1242 (~1977)
3 The algorithms are not new. Most of them are just linear algebra programs. Add. C = A + B Tensor. C = A [X] B Transpose. B = A' Invert. B = A -1 Multiply. C = A x B Nullspace. Find B such that B.A = 0
4 Two slightly more specialized programs Split given (two) generators and a vector, make a basis for the smallest subspace invariant under the generators and containing that vector. Then go on to compute the action of the generators on that subspace and on the quotient. Standard Basis. Spin up one vector in a canonical way.
5 These are all easy. When I went to Montreal in 1982, I took these 8 programs on punched cards. They only worked mod primes. I think they totalled about 200 lines of FORTRAN for all eight of them! These programs are not rocket science!
6 Better performance versions For the main research work, the 1981 FORTRAN version would have been too slow and used too much memory. For the previous five years we had worked in IBM 370 assembler, mainly mod 2. Now we work in c, with occasional pentium assembler. Larger fields are no problem either.
7 Multiply All the main algorithms work with rows, suitably packed in memory. Mod 2 we put each entry in a single bit. For other small primes there are various fascinating tricks, but as the prime rises it basically becomes more and more competitive to use the computer s Add instruction. Scalar multiplication is less important we can multiply each row by all scalars before we start if the field is small. This also generalizes to grease - computing certain rows in advance.
8 Grease When multiplying large matrices over small fields, A = B x C say, choose a dimension d (e.g. 3), and group the rows of C into sets of 3 rows. Make all the vectors in the space spanned by each group of rows. This reduces the number of scalar multiplications to zero, and the number of adds by a factor of d.
9 Grease codes There is actually a coding-theory problem here which seems untouched. Find a good set of vectors to make in a space such that every vector in the space is the sum of, say, three of them. The Golay co-code from M 24 is very good for this purpose.
10 Semi echelon form The first entry in every row is 1, and below it is all zeros The rows are obviously linearly independent. A vector that is in the space is readily expressed as a linear combination of these rows A new row is readily appended after cleaning out the Pivots
11 Row Nullspace We input the matrix A and set B = identity. Do identical row operations to A and B to put A into semi-echelon form. For every zero row of A that is made, output the corresponding row of B.
12 Grease can be used in Gaussian Elimination also It does make it quite complicated and hard to implement, so I will not describe it in detail here Just to say that you have chunks of rows that you put into full echelon form (zeros above the pivots also). This is work-in-progress.
13 Tensor Product [X] 7 8 = ( A [X] B ) x (C [X] D) = (A x C) [X] (B x D) Given two representations of G, tensoring them gives another representation.
14 Split (1 of 2) First get a semi-echelon form basis X for the invariant subspace by starting with the X as the single input vector, repeatedly multiply rows of X by the generators, reducing the result using X and appending if the end product is non-zero. This is usually called spinning up the vector.
15 Split (2 of 2) Then multiply the rows of X again by the generators, and express the result in terms of the basis for X, thereby computing the rows of the action of the generators on the subspace. Then compute the action on the quotient by completing the echelon form to a nonsingular matrix (adding rows all zero except for a 1 in a non-pivot column).
16 Null-vectors are good candidates for Split. Given two generators A and B for a (reducible) representation. Compute the nullspace of (A+B+AB). Take a vector of this (if there is one) and use split to see if it lies in an invariant subspace. It is quite likely that it does! If that doesn t work, try a null vector of A+B+AB+ABA, or BA+ABA+BBABA or...
17 Why is a null-vector good If there is an invariant subspace, that means that there is a basis so that the matrices look like. X * But a random element of the group 0 Y algebra (such as A+B+AB) gives X a random matrix. Over a small field, a random matrix often has a single null-vector. If so, from all the (not very many) null-vectors of the whole matrix, one of them lies in the invariant susbpace. Hence, over a small field, it will soon work.
18 Mod 2 It is possible to compute the nullity of a large random matrix mod 2. For large dimension the result is Non-singular 26% Nullity 1 52% Nullity 2 or more 22% Hence mod 2 it is very easy indeed to find elements of the group algebra with null-vectors in an invariant subspace if there is one.
19 Norton s Irreducibility Test Suppose you have a representation and find an element of the group algebra of nullity 1. Suppose the null vector is not in an invariant subspace. Suppose further that the null-vector of the transpose of the group algebra element is not in an invariant subspace of the transposed generators Then the representation is irreducible.
20 Equivalent representations Two representation ρ(g) and σ(g) of G are equivalent iff there is a matrix X such that X -1.ρ(g).X = σ(g) for all g in G. Can we find X? Yes we can. Find an element of the group algebra of nullity 1 and let v ρ and v σ be its null vectors in the two representations.
21 Standard basis. The single null vector v (e.g. of A+B+AB) is a standard vector. We can then form a matrix whose rows are images of v in some canonical way. We use v, v.a, v.b, v.aa, v.ab etc. in that order provded they are linearly independent (if they are not, we discard them). The result conjugates the representation into a standard basis.
22 Finding X We find Y and Z that conjuagate ρ(g) and σ(g) into standard basis. And then set X = Y.Z -1 If anything works, that will.
23 Building groups Given a subgroup H in a representation thought to be a restriction from G. Look at a subgroup K of H whose normalizer in G is bigger. Make (using standard basis) all the matrices that normalize K in the required way and look to see if you have generated G by H and this new matrix. Keep one that works and chuck the rest.
24 Bilinear forms Problem - Given an irreducible representation that is self-dual, find the bilinear form. Solution put the representation into a standard basis, transpose and invert the generators and find the matrix that conjugates that back (using standard basis) The resulting matrix is the bilinear form.
25 Original Objective number 2 In those days (1977) J 4 had been conjectured, but not proven, to exist. It might have a representation of degree 112 mod 2. We therefore set about making matrices. Start with 111 representation of U 3 (11) mod 2 (made by pratting about with 3x3 matrices over GF(121), acting on 1332 projective vectors, and chopping up the 1332 x 1332 matrices mod 2).
26 from 111 to 112 for U3(11) We actually made for U3(11). Then transpose inverse gives us Standard base puts the 110 in the same basis. Then had to guess the 1x1 matrix - only two possibilities for each generator, so we tried all four cases.
27 From U3(11) to J 4 Find a subgroup in U 3 (11) Extend to a subgroup x2S 4 This is done by using standard base to conjugate generators of into other generators of the same There were quite a few possible cases to try. 48, if I remember correctly.
28 First time none of them worked This was because we had tried to make the D 12 subgroup of L 2 (11) instead of the A 4 which we needed - all in the automorphism group 11 2.(5x2.L 2 (11)).2 of I'm sure you can see that this incredibly error-prone!
29 Second time it worked And we had generators in 112 dimensions for a group that looked a lot like J 4. Half way there! Now we just needed to prove it.
30 1978 Problem. We have 112 x 112 matrices mod 2 that in fact generate J 4. We wish to prove it... to recognize the group generated as J 4. And hence prove that J 4 exists. How can we do anything?
31 What can we do? We can multiply two matrices. We can find the order of a matrix As we later realized, we can find the characteristic polynomial of a matrix, which helps with recognizing conjugacy classes. Not much!
32 Involutions An involution is just an element of order two. They are important because two involutions generate a dihedral group. If t 1 and t 2 are both involutions, and the order of t 1 t 2 is n, then <t 1,t 2 > is order 2.n - the symmetry group of the n-ogon.
33 First find an involution t. This is easy in J 4. Half the elements have even order. So suppose we find an element X of order 22, say... Then its 11 th power is an involution. t = X 11 (There are groups, like L 2 (2 n ) where almost all elements have odd order)
34 Find the centralizer of t Conjugate t to make other involutions t' = (y -1.t.y) What is the order of t.t'? If it is even 2.m, then (t.t') m is an involution in the centre of <t,t'> so in particular commutes with t. We can collect elements commuting with t
35 Bray Trick Much later, John Bray noticed that even if t'.t=y -1.t.y.t has odd order 2m+1, we still have something that commutes with t... namely (y -1.t.y.t) m.y -1 since (y -1.t.y.t) m.y -1.t. y.t.(y -1.t.y.t) m = 1 (y -1.t.y.t) m.y -1. t = (t.y -1.t.y) m.t.y -1 = t.(y -1.t.y.t) m.y -1
36 Bray's trick is better When you find the product of two conjugate involutions being of odd order, the resulting centralizing element is evenly distributed - it is essentially a random element of the centralizer. This is better than the even case, where it can sometimes be hard to finish off the centralizer.
37 Anyway - to summarize You can find the centralizer of an involution. But you haven't proved that it is the whole centralizer, so we can't use this to prove that J 4 exists. Now what?
38 Need to prove G is not O 112 (2) We can find the matrix that conjugates our group to the transpose-inverse. And hence find the fixed quadratic form. Hence we know that G - the group generated by the matrices, is contained in O 112 (2). We need to show that G is smaller than this.
39 This part was done 4 times One method was to find an invariant subspace in the exterior square (action on quadratic polynomials modulo symmetric ones) = 6216 =
40 Method 1 We then define a relationship on pairs of vectors in 112 if their wedge is in the 4995 subspace. And define J 4 to be the stabilizer of the relationship. We already have a lot of matrices And showed that this is all of them.
41 Other 4995 method S. P. Norton managed to show more theoretically, using the 4995 result, that the group generated was J 4. This was the first published proof.
42 Other methods Conway described an alphabettheoretical way of showing that a certain set of matrices was closed under multiplication by generators. He used double coset decomposition, and then aimed to find the necessary proofs that various words of one form also had an expression in another.
43 Yet other methods Conway's idea was modified in David Benson's PhD thesis to a method of showing that the generators preserved a certain set of vectors in the 112 space. Other proofs of existence have since been found.
44 Recognition Over the last dozen years or so, there has been a growing project to recognize an arbitrary matrix group over a finite field. Given a bunch of matrices, name the group that they generate. Uses classification!
45 This is a large project. Aim... to put into GAP and Magma enough code and data, so that if a user enters a bunch of matrices over a finite field, the computer can answer questions about it... composition factors, Sylow subgroups, conjugacy classes etc. etc. etc. I can only hope to give you the flavour.
46 Aschbacher's theorem Given a bunch of generators over a finite field, the group must fall into at least one of about nine classes Reducible Reducible if you extend the field Field is too big Tensor product Monomial... etc. etc. etc.
47 Last case An almost simple group in a representation that is irreducible, in the correct field, not a tensor product etc. etc. etc. These are the groups you need to be able to recognize individually. The ATLAS project continues. We need to collect more and more data about these groups
48 Initial Analysis Any finite group has the following structure A maximal normal solvable subgroup. On top of which comes the direct product of some non-abelian simple groups On top of which come some automorphisms of some of these groups And then a permutation group.
49 Simple group recognition. The heart of this procedure is to recognize the simple groups in the second layer. We don't just want their names though... we want to find the standard generators. Then we can use the encyclopedia to find things we want.
50 Encyclopaedia? QMUL Atlas website... Getting into GAP and Magma Lots and lots of information Permutations, matrices, recognizers, class-list finders, etc. etc. etc.
51 Example - M 22 Standard generators of M 22 are a, b where a has order 2, b is in class 4A, ab has order 11 and ababb has order Find any element of order 8. Its square is a 4Aelement, y say, and its fourth power is a 2A-element, x say [Probability of success on each attempt is 1/8] 2. Find a conjugate a of x and a conjugate b of y such that ab has order 11 and ababb has order 11. [Probability of success on each attempt is 64/1155 (approx. 1/18)]
52 Example - M 22 M22 = a, b a 2 = b 4 = (ab) 11 = (ab 2 ) 5 = [a,bab] 3 = (ababab 1 ) 5 = 1 (on the standard generators)
53 Straight Line program for A 7 mu mu mu mu pwr mu iv 8 9 mu mu
54 Hence, if you give me M 22 In any way you like, I'll do the black box to find standard generators, then test the presentation. Now I just have to find the original generators in my nice M 22. This part of the problem can also be dealt with by knowing the nice M 22 very well.
55 Presentation for J 4 We can now recognize J 4 by standard generators and a presentation too. J 4 = x, y, t x 2 = y 3 = (xy) 23 = [x, y] 12 = [x, yxy] 5 = (xyxyxy 1 ) 3 (xyxy 1 xy 1 ) 3 = (xy(xyxy 1 ) 3 ) 4 = t 2 = [t, x] = [t, yxy(xy 1 ) 2 (xy) 3 ] = (yt yxy 1xyxy 1x ) 3 = ((yxyxyxy) 3 tt (xy)3y(xy)6y ) 2 = 1
Sporadic and related groups. Lecture 15 Matrix representations of sporadic groups.
Sporadic and related groups. Lecture 15 Matrix representations of sporadic groups. Section 1 fields of characteristic zero Several of the sporadic groups were contstructed as matrix groups in characteristic
More informationMITOCW ocw f99-lec09_300k
MITOCW ocw-18.06-f99-lec09_300k OK, this is linear algebra lecture nine. And this is a key lecture, this is where we get these ideas of linear independence, when a bunch of vectors are independent -- or
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationMITOCW ocw f99-lec05_300k
MITOCW ocw-18.06-f99-lec05_300k This is lecture five in linear algebra. And, it will complete this chapter of the book. So the last section of this chapter is two point seven that talks about permutations,
More informationLECTURES 14/15: LINEAR INDEPENDENCE AND BASES
LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors
More informationComputer construction of the Monster
Computer construction of the Monster Stephen Linton (Department of Computer Science, University of St. Andrews) Richard Parker (UK Online Ltd, Shepton Mallet) Peter Walsh and Robert Wilson (School of Mathematics
More informationMITOCW ocw f99-lec01_300k
MITOCW ocw-18.06-f99-lec01_300k Hi. This is the first lecture in MIT's course 18.06, linear algebra, and I'm Gilbert Strang. The text for the course is this book, Introduction to Linear Algebra. And the
More informationComputational Approaches to Finding Irreducible Representations
Computational Approaches to Finding Irreducible Representations Joseph Thomas Research Advisor: Klaus Lux May 16, 2008 Introduction Among the various branches of algebra, linear algebra has the distinctions
More informationCombinatorial Method in the Coset Enumeration. of Symmetrically Generated Groups II: Monomial Modular Representations
International Journal of Algebra, Vol. 1, 2007, no. 11, 505-518 Combinatorial Method in the Coset Enumeration of Symmetrically Generated Groups II: Monomial Modular Representations Mohamed Sayed Department
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationMon Feb Matrix algebra and matrix inverses. Announcements: Warm-up Exercise:
Math 2270-004 Week 5 notes We will not necessarily finish the material from a given day's notes on that day We may also add or subtract some material as the week progresses, but these notes represent an
More informationGalois Theory Overview/Example Part 1: Extension Fields. Overview:
Galois Theory Overview/Example Part 1: Extension Fields I ll start by outlining very generally the way Galois theory works. Then, I will work through an example that will illustrate the Fundamental Theorem
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationEXAM 2 REVIEW DAVID SEAL
EXAM 2 REVIEW DAVID SEAL 3. Linear Systems and Matrices 3.2. Matrices and Gaussian Elimination. At this point in the course, you all have had plenty of practice with Gaussian Elimination. Be able to row
More informationBASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C =
CHAPTER I BASIC NOTIONS (a) 8666 and 8833 (b) a =6,a =4 will work in the first case, but there are no possible such weightings to produce the second case, since Student and Student 3 have to end up with
More information18.06 Problem Set 3 Due Wednesday, 27 February 2008 at 4 pm in
8.6 Problem Set 3 Due Wednesday, 27 February 28 at 4 pm in 2-6. Problem : Do problem 7 from section 2.7 (pg. 5) in the book. Solution (2+3+3+2 points) a) False. One example is when A = [ ] 2. 3 4 b) False.
More informationMITOCW ocw f99-lec17_300k
MITOCW ocw-18.06-f99-lec17_300k OK, here's the last lecture in the chapter on orthogonality. So we met orthogonal vectors, two vectors, we met orthogonal subspaces, like the row space and null space. Now
More informationLinear Algebra. Chapter Linear Equations
Chapter 3 Linear Algebra Dixit algorizmi. Or, So said al-khwarizmi, being the opening words of a 12 th century Latin translation of a work on arithmetic by al-khwarizmi (ca. 78 84). 3.1 Linear Equations
More information1 Last time: inverses
MATH Linear algebra (Fall 8) Lecture 8 Last time: inverses The following all mean the same thing for a function f : X Y : f is invertible f is one-to-one and onto 3 For each b Y there is exactly one a
More informationREVIEW FOR EXAM II. The exam covers sections , the part of 3.7 on Markov chains, and
REVIEW FOR EXAM II The exam covers sections 3.4 3.6, the part of 3.7 on Markov chains, and 4.1 4.3. 1. The LU factorization: An n n matrix A has an LU factorization if A = LU, where L is lower triangular
More informationVector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture
Week9 Vector Spaces 9. Opening Remarks 9.. Solvable or not solvable, that s the question Consider the picture (,) (,) p(χ) = γ + γ χ + γ χ (, ) depicting three points in R and a quadratic polynomial (polynomial
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationProblems for M 10/12:
Math 30, Lesieutre Problem set #8 October, 05 Problems for M 0/: 4.3.3 Determine whether these vectors are a basis for R 3 by checking whether the vectors span R 3, and whether the vectors are linearly
More information18.06 Problem Set 3 Solution Due Wednesday, 25 February 2009 at 4 pm in Total: 160 points.
8.6 Problem Set 3 Solution Due Wednesday, 25 February 29 at 4 pm in 2-6. Total: 6 points. Problem : Consider the matrix A = 2 4 2 6 3 4 2 7 (a) Reduce A to echelon form U, find a special solution for each
More informationTHERE IS NO Sz(8) IN THE MONSTER
THERE IS NO Sz(8) IN THE MONSTER ROBERT A. WILSON Abstract. As a contribution to an eventual solution of the problem of the determination of the maximal subgroups of the Monster we show that there is no
More information1 GSW Sets of Systems
1 Often, we have to solve a whole series of sets of simultaneous equations of the form y Ax, all of which have the same matrix A, but each of which has a different known vector y, and a different unknown
More information14: Hunting the Nullspace. Lecture
Math 2270 - Lecture 14: Hunting the Nullspace Dylan Zwick Fall 2012 This is the second of two lectures covering the nulispace of a matrix A. In this lecture we move on from the what of a nulispace, and
More informationON THE ORDERS OF AUTOMORPHISM GROUPS OF FINITE GROUPS
Submitted exclusively to the London Mathematical Society DOI: 0./S0000000000000000 ON THE ORDERS OF AUTOMORPHISM GROUPS OF FINITE GROUPS JOHN N. BRAY and ROBERT A. WILSON Abstract In the Kourovka Notebook,
More informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More information. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
More informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More information1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?
. Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in
More informationMath Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!
Math 5- Computation Test September 6 th, 6 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge! Name: Answer Key: Making Math Great Again Be sure to show your work!. (8 points) Consider the following
More informationUmbral groups. Robert A. Wilson. LMS EPSRC Durham Symposium, 4th August 2015
Umbral groups Robert A. Wilson LMS EPSRC Durham Symposium, 4th August 2015 1 Introduction Background When I was first asked to give a talk about umbral groups, I declined, on the grounds that I did not
More informationMonomial modular representations and symmetric generation of the Harada Norton group
Monomial modular representations and symmetric generation of the Harada Norton group John N. Bray and Robert T. Curtis, School of Mathematics and Statistics, University of Birmingham, Edgbaston, Birmingham
More information12x + 18y = 30? ax + by = m
Math 2201, Further Linear Algebra: a practical summary. February, 2009 There are just a few themes that were covered in the course. I. Algebra of integers and polynomials. II. Structure theory of one endomorphism.
More informationProblem 1.1. Classify all groups of order 385 up to isomorphism.
Math 504: Modern Algebra, Fall Quarter 2017 Jarod Alper Midterm Solutions Problem 1.1. Classify all groups of order 385 up to isomorphism. Solution: Let G be a group of order 385. Factor 385 as 385 = 5
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More informationLinear Algebra for Beginners Open Doors to Great Careers. Richard Han
Linear Algebra for Beginners Open Doors to Great Careers Richard Han Copyright 2018 Richard Han All rights reserved. CONTENTS PREFACE... 7 1 - INTRODUCTION... 8 2 SOLVING SYSTEMS OF LINEAR EQUATIONS...
More informationTHE 7-MODULAR DECOMPOSITION MATRICES OF THE SPORADIC O NAN GROUP
THE 7-MODULAR DECOMPOSITION MATRICES OF THE SPORADIC O NAN GROUP ANNE HENKE, GERHARD HISS, AND JÜRGEN MÜLLER Abstract. The determination of the modular character tables of the sporadic O Nan group, its
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationMITOCW ocw f99-lec23_300k
MITOCW ocw-18.06-f99-lec23_300k -- and lift-off on differential equations. So, this section is about how to solve a system of first order, first derivative, constant coefficient linear equations. And if
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationIES Parque Lineal - 2º ESO
UNIT5. ALGEBRA Contenido 1. Algebraic expressions.... 1 Worksheet: algebraic expressions.... 2 2. Monomials.... 3 Worksheet: monomials.... 5 3. Polynomials... 6 Worksheet: polynomials... 9 4. Factorising....
More information6 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.
6 Orthogonal groups We now turn to the orthogonal groups. These are more difficult, for two related reasons. First, it is not always true that the group of isometries with determinant 1 is equal to its
More information18.06SC Final Exam Solutions
18.06SC Final Exam Solutions 1 (4+7=11 pts.) Suppose A is 3 by 4, and Ax = 0 has exactly 2 special solutions: 1 2 x 1 = 1 and x 2 = 1 1 0 0 1 (a) Remembering that A is 3 by 4, find its row reduced echelon
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationAn Atlas of Sporadic Group Representations
An Atlas of Sporadic Group Representations Robert A. Wilson revised version; final version published 1998 in LMS Lecture Notes 249 Introduction The Atlas of Finite Groups [5] was originally conceived by
More information[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationLinear Algebra, Summer 2011, pt. 3
Linear Algebra, Summer 011, pt. 3 September 0, 011 Contents 1 Orthogonality. 1 1.1 The length of a vector....................... 1. Orthogonal vectors......................... 3 1.3 Orthogonal Subspaces.......................
More informationInstructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.
Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.. Recall that P 3 denotes the vector space of polynomials of degree less
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationChapter 4 & 5: Vector Spaces & Linear Transformations
Chapter 4 & 5: Vector Spaces & Linear Transformations Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapters 4 & 5 1 / 40 Objective The purpose of Chapter 4 is to think
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date May 9, 29 2 Contents 1 Motivation for the course 5 2 Euclidean n dimensional Space 7 2.1 Definition of n Dimensional Euclidean Space...........
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationMATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT
MATHEMATICS COMPREHENSIVE EXAM: IN-CLASS COMPONENT The following is the list of questions for the oral exam. At the same time, these questions represent all topics for the written exam. The procedure for
More informationAnswer Key for Exam #2
. Use elimination on an augmented matrix: Answer Key for Exam # 4 4 8 4 4 4 The fourth column has no pivot, so x 4 is a free variable. The corresponding system is x + x 4 =, x =, x x 4 = which we solve
More informationDot Products, Transposes, and Orthogonal Projections
Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +
More informationNumerical Methods I Solving Square Linear Systems: GEM and LU factorization
Numerical Methods I Solving Square Linear Systems: GEM and LU factorization Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 18th,
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More informationLinear Algebra, Summer 2011, pt. 2
Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................
More informationThe Outer Automorphism of S 6
Meena Jagadeesan 1 Karthik Karnik 2 Mentor: Akhil Mathew 1 Phillips Exeter Academy 2 Massachusetts Academy of Math and Science PRIMES Conference, May 2016 What is a Group? A group G is a set of elements
More informationPRACTICE PROBLEMS (TEST I).
6 Calculus III for CS Spring PRACTICE PROBLEMS (TEST I). MATERIAL: Chapter from Salas-Hille-Etgen, Sections,, 3, 4, 5, 6 from the [Notes:Th], Chapters,, 3, 4 from [Demko] (most of it is covered in more
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationLecture 4: Orbits. Rajat Mittal. IIT Kanpur
Lecture 4: Orbits Rajat Mittal IIT Kanpur In the beginning of the course we asked a question. How many different necklaces can we form using 2 black beads and 10 white beads? In the question, the numbers
More informationModern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture - 05 Groups: Structure Theorem So, today we continue our discussion forward.
More informationMATH 310, REVIEW SHEET 2
MATH 310, REVIEW SHEET 2 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,
More informationLinear Algebra Primer
Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................
More informationProblem 4 (Wed Jan 29) Let G be a finite abelian group. Prove that the following are equivalent
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Problem 1 (Fri Jan 24) (a) Find an integer x such that x = 6 mod 10 and x = 15 mod 21 and 0 x 210. (b) Find the smallest positive integer
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationMATH 304 Linear Algebra Lecture 20: Review for Test 1.
MATH 304 Linear Algebra Lecture 20: Review for Test 1. Topics for Test 1 Part I: Elementary linear algebra (Leon 1.1 1.4, 2.1 2.2) Systems of linear equations: elementary operations, Gaussian elimination,
More informationMODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain.
MODEL ANSWERS TO HWK #7 1. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above by c on the left, we get 0
More informationMA441: Algebraic Structures I. Lecture 26
MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order
More informationREPRESENTATIONS OF U(N) CLASSIFICATION BY HIGHEST WEIGHTS NOTES FOR MATH 261, FALL 2001
9 REPRESENTATIONS OF U(N) CLASSIFICATION BY HIGHEST WEIGHTS NOTES FOR MATH 261, FALL 21 ALLEN KNUTSON 1 WEIGHT DIAGRAMS OF -REPRESENTATIONS Let be an -dimensional torus, ie a group isomorphic to The we
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationGEOMETRY OF MATRICES x 1
GEOMETRY OF MATRICES. SPACES OF VECTORS.. Definition of R n. The space R n consists of all column vectors with n components. The components are real numbers... Representation of Vectors in R n.... R. The
More informationMTH 362: Advanced Engineering Mathematics
MTH 362: Advanced Engineering Mathematics Lecture 5 Jonathan A. Chávez Casillas 1 1 University of Rhode Island Department of Mathematics September 26, 2017 1 Linear Independence and Dependence of Vectors
More informationCurtis Heberle MTH 189 Final Paper 12/14/2010. Algebraic Groups
Algebraic Groups Curtis Heberle MTH 189 Final Paper 12/14/2010 The primary objects of study in algebraic geometry are varieties. Having become acquainted with these objects, it is interesting to consider
More informationEigenvalues and eigenvectors
Roberto s Notes on Linear Algebra Chapter 0: Eigenvalues and diagonalization Section Eigenvalues and eigenvectors What you need to know already: Basic properties of linear transformations. Linear systems
More informationMath 215 HW #9 Solutions
Math 5 HW #9 Solutions. Problem 4.4.. If A is a 5 by 5 matrix with all a ij, then det A. Volumes or the big formula or pivots should give some upper bound on the determinant. Answer: Let v i be the ith
More informationSolution Set 3, Fall '12
Solution Set 3, 86 Fall '2 Do Problem 5 from 32 [ 3 5 Solution (a) A = Only one elimination step is needed to produce the 2 6 echelon form The pivot is the in row, column, and the entry to eliminate is
More informationExam 2 Solutions. (a) Is W closed under addition? Why or why not? W is not closed under addition. For example,
Exam 2 Solutions. Let V be the set of pairs of real numbers (x, y). Define the following operations on V : (x, y) (x, y ) = (x + x, xx + yy ) r (x, y) = (rx, y) Check if V together with and satisfy properties
More information1 Classifying Unitary Representations: A 1
Lie Theory Through Examples John Baez Lecture 4 1 Classifying Unitary Representations: A 1 Last time we saw how to classify unitary representations of a torus T using its weight lattice L : the dual of
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More information10. 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.
10. Rank-nullity Definition 10.1. 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. The nullity ν(a) of A is the dimension of the kernel. The
More informationLecture 6. Numerical methods. Approximation of functions
Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationLecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)
Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Travis Schedler Tue, Oct 18, 2011 (version: Tue, Oct 18, 6:00 PM) Goals (2) Solving systems of equations
More information