Assignment 12. O = O ij O kj = O kj O ij. δ ik = O ij

Similar documents
Group Theory. PHYS Southern Illinois University. November 15, PHYS Southern Illinois University Group Theory November 15, / 7

Quantum Computing Lecture 2. Review of Linear Algebra

Lecture 10: A (Brief) Introduction to Group Theory (See Chapter 3.13 in Boas, 3rd Edition)

CLASSICAL GROUPS DAVID VOGAN

Assignment 11 (C + C ) = (C + C ) = (C + C) i(c C ) ] = i(c C) (AB) = (AB) = B A = BA 0 = [A, B] = [A, B] = (AB BA) = (AB) AB

Introduction to Group Theory

5 Irreducible representations

GROUP THEORY PRIMER. New terms: so(2n), so(2n+1), symplectic algebra sp(2n)

. =. 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

Linear Algebra Review

Assignment 10. Arfken Show that Stirling s formula is an asymptotic expansion. The remainder term is. B 2n 2n(2n 1) x1 2n.

CS 246 Review of Linear Algebra 01/17/19

Matrices. Chapter Definitions and Notations

MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)

Elementary maths for GMT

Quantum Field Theory III

GROUP THEORY PRIMER. D(g 1 g 2 ) = D(g 1 )D(g 2 ), g 1, g 2 G. and, as a consequence, (2) (3)

Math 320, spring 2011 before the first midterm

Math 240 Calculus III

Basic Concepts of Group Theory

22m:033 Notes: 3.1 Introduction to Determinants

Assignment 3. A tutorial on the applications of discrete groups.

1 g 1,gg 2 xg 1. 2 g 1,...,gg n xg 1. n g 1 } = {gxg 1,gg 1 x(gg 1 ) 1,gg 2 x(gg 2 ) 1,...,gg n x(gg n ) 1 } = {x,g 1 xg 1. 2,...

Lecture 7: Vectors and Matrices II Introduction to Matrices (See Sections, 3.3, 3.6, 3.7 and 3.9 in Boas)

MATRICES. a m,1 a m,n A =

A group G is a set of discrete elements a, b, x alongwith a group operator 1, which we will denote by, with the following properties:

CHAPTER 6. Representations of compact groups

Symmetries, Groups, and Conservation Laws

Mathematical Methods wk 2: Linear Operators

Review of Linear Algebra

Physics 129B, Winter 2010 Problem Set 4 Solution

I = i 0,

Linear Algebra (Review) Volker Tresp 2018

Matrices BUSINESS MATHEMATICS

Elementary Row Operations on Matrices

STAT200C: Review of Linear Algebra

Groups. Chapter 1. If ab = ba for all a, b G we call the group commutative.

Topic 15 Notes Jeremy Orloff

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

Continuous symmetries and conserved currents

Matrix Algebra & Elementary Matrices

Diagonalization by a unitary similarity transformation

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

1 Determinants. 1.1 Determinant

Intrinsic products and factorizations of matrices

CP3 REVISION LECTURES VECTORS AND MATRICES Lecture 1. Prof. N. Harnew University of Oxford TT 2013

Linear Algebra: Matrix Eigenvalue Problems

Topics in Representation Theory: Roots and Weights

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

Determinants - Uniqueness and Properties

Problems in Linear Algebra and Representation Theory

arxiv:math-ph/ v1 31 May 2000

DIHEDRAL GROUPS II KEITH CONRAD

Solutions to Example Sheet 1

LIE ALGEBRAS AND LIE BRACKETS OF LIE GROUPS MATRIX GROUPS QIZHEN HE

Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.

Phys 201. Matrices and Determinants

Examples of Groups

Symmetric and anti symmetric matrices

Chapter XI Novanion rings

Chapter 2. Linear Algebra. rather simple and learning them will eventually allow us to explain the strange results of

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

Introduction to Groups

Unitary rotations. October 28, 2014

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MAT 445/ INTRODUCTION TO REPRESENTATION THEORY

Math 306 Topics in Algebra, Spring 2013 Homework 7 Solutions

INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS

Linear Algebra. Min Yan

Clifford Algebras and Spin Groups

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

Matrices and Determinants

October 25, 2013 INNER PRODUCT SPACES

Groups. s t or s t or even st rather than f(s,t).

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

1 Matrices and vector spaces

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

MATHEMATICS 217 NOTES

ICS 6N Computational Linear Algebra Matrix Algebra

LECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI. 1. Maximal Tori

n n matrices The system of m linear equations in n variables x 1, x 2,..., x n can be written as a matrix equation by Ax = b, or in full

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

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Fundamentals of Engineering Analysis (650163)

G1110 & 852G1 Numerical Linear Algebra

Matrix Representation

Representations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III

Linear Equations and Matrix

c 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0

The Singular Value Decomposition

Elementary Linear Algebra

Functional determinants

(Ref: Schensted Part II) If we have an arbitrary tensor with k indices W i 1,,i k. we can act on it 1 2 k with a permutation P = = w ia,i b,,i l

18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).

4 Group representations

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

What is the Matrix? Linear control of finite-dimensional spaces. November 28, 2010

GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)

Problem set 2. Math 212b February 8, 2001 due Feb. 27

Transcription:

Assignment 12 Arfken 4.1.1 Show that the group of n n orthogonal matrices On has nn 1/2 independent parameters. First we need to realize that a general orthogonal matrix, O, has n 2 elements or parameters, not all of which are independent. The condition that it be orthogonal is O O T = 1, or in component notation, δ ik = O ij O T jk = O ij O kj = O kj O ij thus the product of an orthogonal matrix and its transpose must by symmetric. This says that all the equations implied by the above matrix condition are not independent. There are n equations which come from the diagonal terms that must equal 1. However, the off diagonal terms in the upper right corner of the matrix are identical to those off-diagonal terms in the lower left corner of the matrix, so the resulting conditions are identical. The number of these conditions is n 2 n/2 half the total number of matrix elements minus the diagonal terms.* Thus the total number of conditions from the orthogonality conditions are n + n 2 n/2 = n 2 + n/2 and so the total number of independent parameters of a general orthogonal matrix is n 2 n 2 + n/2 = nn 1/2. Arfken 4.1.2 Show that the group of n n unitary matrices Un has n 2 1 independent parameters. As with the previous problem, we must realize that a general n n unitary matrix, U, has 2n 2 parameters since each entry is complex and counts twice. The condition that the matrix be unitary is U U = 1 or δ ik = U ij U jk = U ij U kj = U kj U ij showing that the product of a unitary matrix and its adjoint must be Hermitian. Again, this says that the resulting equations implied in the above matrix condition are not all independent. Being Hermitian, each of the diagonal components of A UU must be real and equal to one. This gives n conditions. The Hermiticity of A UU means that off-diagonal components in the upper right of the matrix are complex conjugates of the off-diagonal components in the lower left of the matrix. Thus these conditions are not independent, but in fact, the same. The number of these conditions is twice that of the real orthogonal case: 2 n 2 n/2. The total number of conditions is now n+n 2 n = n 2 and the total number independent parameters is 2n 2 n 2 = n 2. Of course this seems wrong. However, there is an error in the statement of the problem. The problem ostensibly asks for the parameters describing the group Un, but I am almost certain they intended to ask about SUn, the group of all unitary matrices with determinant equal to one sometimes called unimodular. In this case there is an extra unstated condition, that of det U = 1. With this condition, the number of independent parameters is now n 2 1. * We could also have gotten this number by adding up the number of independent terms in each row of the matrix: 1 + 2 + 3 + + n 1 = 1 n 1n. 2 1

Arfken 4.1.3 Show that the matrix representation of SL2 forms a group. A general element, A, of SL2 will be c d where a, b, c and d are complex and such that ad bc = 1. To show that SL2 is a group, we must assure ourselves that this and like elements satisfy the group axioms with matrix multiplication being our putative group operation. Closure implies that if A 1 and A 2 are elements of the group, their product will be as well: a1 b A 1 A 2 = 1 a2 b 2 c 1 d 1 c 2 d 2 a1 a = 2 + b 1 c 2 a 1 b 2 + b 1 d 2 c 1 a 2 + d 1 b 2 c 1 b 2 + d 1 d 2 which is a complex 2 2 matrix since each of its elements is complex. However, we must check that its determinant is 1. This is most easily done by taking the determinant det A 1 A 2 = det A1 det A 2 = 1 where we have used the fact that since A 1 and A 2 are elements of the group, their individual determinants must be 1. Associativity is shown after some algebra: a1 a A1 A 2 A3 = 2 + b 1 c 2 a 1 b 2 + b 1 d 2 a3 b 3 c 1 a 2 + d 1 b 2 c 1 b 2 + d 1 d 2 c 3 d 3 a1 a = 2 + b 1 c 2 a 3 + a 1 b 2 + b 1 d 2 c 3 a 1 a 2 + b 1 c 2 b 3 + a 1 b 2 + b 1 d 2 d 3 c 1 a 2 + d 1 b 2 a 3 + c 1 b 2 + d 1 d 2 c 3 c 1 a 2 + d 1 b 2 b 3 + c 1 b 2 + d 1 d 2 d 3 and a1 b A 1 A2 A 3 = 1 a2 a 3 + b 2 c 3 a 2 b 3 + b 2 d 3 c 1 d 1 c 2 a 3 + d 2 b 3 c 2 b 3 + d 2 d 3 a1 a = 2 a 3 + b 2 c 3 + b 1 c 2 a 3 + d 2 b 3 a 1 a 2 b 3 + b 2 d 3 + b 1 c 2 b 3 + d 2 d 3 c 1 a 2 a 3 + b 2 c 3 + d 1 c 2 a 3 + d 2 b 3 c 1 a 2 b 3 + b 2 d 3 + d 1 c 2 b 3 + d 2 d 3 which is equal to the first. The inverse is found by recalling from Chapter 3 the inverse for a 2 2 matrix A 1 d b = c a Note that A A 1 = 1 as required and that the elements of A 1 are indeed complex. Finally, det A 1 = det A 1 = 1. However, we have not yet proved a unique inverse. This is done by assuming there is another inverse, B. If that is the case, then in addition to A A 1 = 1, we have A B = 1 such that B is an inverse. Now multiply that last equation by A 1 on the left. We get A 1 A B = A 1, i.e. B = A 1 and A 1 is unique. The identity element of the group is obviously the unit matrix 1 = as can be seen by multiplying this by A and getting A back. But again, we have the question of the unique identity. In a similar argument as before, assume B is another identity element, then A B = A. Multiply 2

on the left by A 1, the inverse of A, and get A 1 A B = A 1 1 and we get that B = 1 and 1 is the unique identity element. Arfken 4.2.2 Find the general form of a 2 2 unitary, unimodular matrix. A general 2 2 complex matrix can be written as U = c d where a, b, c, and d are complex. That it must be unitary means that we must have U 1 = U, or 1 d b a c = ad bc c d As unimodular simply means the determinant must be one, we can let ad bc = 1 and we have the relations so that In this case, we also must have a 2 + b 2 = 1. Arfken 3.2.7 We have three matrices d = a c = b U = b a, B =, C = 0 1 Their products are A 1, AB = C, AC = B B C, BB = 1, BC = A C B, CB = A, CC = 1 Arfken 4.7.2 Rotations by π, reflections and inversions are represented by A π, m and i respectively. Their combinations multiplications, when including the identity, 1, are governed by the multiplication table 1 A π m i 1 1 A π m i A π A π 1 i m m m i 1 A π i i m A π 1 On comparison with the multiplication table for the vierergruppe in Arfken Table 4.3, we see that they are identical with the replacements A π V 1, m V 2 and i V 3. In consequence, the two groups are the same, i.e. they are isomorphic. Arfken 4.7.5 Explore the vierergruppe. a We have the multiplication table again for the vierergruppe 1 A B C 1 1 A B C A A 1 C B B B C 1 A C C B A 1 3

To find the classes, we need to know the mutually conjugate elements of the group. Note that every element is its own inverse and that the group is Abelian or commutative. For the element A, we have AAA 1 = A BAB 1 = CB = A CAC 1 = BC = A Without doing the others, we note that for this group, if g and X are elements of this group, then gxg 1 = gg 1 X = X and each element is only self-conjugate. Thus there are as many classes as there are group elements, in this case four. Each class has only one element of the group in it. b The character of a class is given by χ{x} = trx. We have χ{1} = 2 χ{a} = 2 χ{b} = 0 χ{c} = 0 Note that two different classes may have the same character in this case, 0. c With regard to subgroups, because each member of the group its own inverse, each member of the group that is not the identity when paired with the identity must form a subgroup. For example, {1, A} forms a subgroup as closure is satisfied, associativity is satisfied, there is an identity element and an inverse. Hence there are three two-element subgroups of the vierergruppe, namely {1, A}, {1, B}, {1, C} Arfken 4.7.6 Explore the 2 2 matrix representation of the cyclic group, C 4. The matrices are given by, B =, C = together with the identity, the unit matrix. The multiplication table is 1 A B C 1 1 A B C A A B C 1 B B C 1 A C C 1 A B This group, as can be seen, is also Abelian. However, only B and the identity is its own inverse. Indeed, A and C are inverses of each other. a Finding mutually conjugate elements of the group, we have AAA 1 = A and A is in a class by itself. Doing this for B, we get BAB 1 = CB = A CAC 1 = 1 A ABA 1 = CC = B BBB 1 = B CBC 1 = A B 4

and B is in a class by itself. For C, we find ACA 1 = 1C = C BCB 1 = AB = C CCC 1 = B C and we round out the set. Thus there are four classes each with one of the group elements. b The character, χx, is χ1 = 2 χa = 0 χb = 2 χc = 0 c In terms of subgroups, in looking at the multiplication table, there are no blocks that would suggest a subgroup. However, we do know that B is its own inverse. Hence there is one subgroup, namely {1, B}. And that s it. We might be tempted to try {1, A, C} but because A 2 = B, for example, that won t work. 5