1.2. Homomorphism: SL(2,C) ~ L 0 Let Φ be a map between groups G 1 & G 2, i.e., Φ: G 1 → G 2. Φ is a homomorphism if Example: G 1 = (Z,+), G 2 = C 2, Φ(n)

Slides:



Advertisements
Similar presentations
Ch 7.6: Complex Eigenvalues
Advertisements

10.4 Complex Vector Spaces.
Matrix Representation
Chapter 4 Euclidean Vector Spaces
8.2 Kernel And Range.
3D Geometry for Computer Graphics
Scientific Computing QR Factorization Part 2 – Algorithm to Find Eigenvalues.
The QR iteration for eigenvalues. ... The intention of the algorithm is to perform a sequence of similarity transformations on a real matrix so that the.
Matrix Theory Background
Eigenvalues and Eigenvectors (11/17/04) We know that every linear transformation T fixes the 0 vector (in R n, fixes the origin). But are there other subspaces.
Linear Transformations
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Chapter 5 Orthogonality
6. One-Dimensional Continuous Groups 6.1 The Rotation Group SO(2) 6.2 The Generator of SO(2) 6.3 Irreducible Representations of SO(2) 6.4 Invariant Integration.
Computer Graphics Recitation 5.
Rotation Group.  A metric is used to measure the distance in a space. Euclidean space is delta  An orthogonal transformation preserves the metric. Inverse.
Chapter 6 Eigenvalues.
5.II. Similarity 5.II.1. Definition and Examples
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Chapter 3 Determinants and Matrices
Dirac Notation and Spectral decomposition Michele Mosca.
6 1 Linear Transformations. 6 2 Hopfield Network Questions.
Dirac Notation and Spectral decomposition
Matrices CS485/685 Computer Vision Dr. George Bebis.
5.1 Orthogonality.
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka Virginia de Sa (UCSD) Cogsci 108F Linear.
Orthogonal Matrices and Spectral Representation In Section 4.3 we saw that n  n matrix A was similar to a diagonal matrix if and only if it had n linearly.
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
Eigenvalue Problems Solving linear systems Ax = b is one part of numerical linear algebra, and involves manipulating the rows of a matrix. The second main.
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
REVIEW OF MATHEMATICS. Review of Vectors Analysis GivenMagnitude of vector: Example: Dot product:  is the angle between the two vectors. Example:
Elementary Linear Algebra Anton & Rorres, 9th Edition
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
6 1 Linear Transformations. 6 2 Hopfield Network Questions The network output is repeatedly multiplied by the weight matrix W. What is the effect of this.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Linear algebra: matrix Eigen-value Problems
1 Week 5 Linear operators and the Sturm–Liouville theory 1.Complex differential operators 2.Properties of self-adjoint operators 3.Sturm-Liouville theory.
Domain Range definition: T is a linear transformation, EIGENVECTOR EIGENVALUE.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
§ Linear Operators Christopher Crawford PHY
Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case.
Metrics. Euclidean Geometry  Distance map x, y, z  E nx, y, z  E n d: E n  E n → [0,  )d: E n  E n → [0,  )  Satisfies three properties d ( x,
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.
Signal & Weight Vector Spaces
Linear Algebra Chapter 6 Linear Algebra with Applications -Gareth Williams Br. Joel Baumeyer, F.S.C.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
7 7.2 © 2016 Pearson Education, Ltd. Symmetric Matrices and Quadratic Forms QUADRATIC FORMS.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Characteristic Polynomial Hung-yi Lee. Outline Last lecture: Given eigenvalues, we know how to find eigenvectors or eigenspaces Check eigenvalues This.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
8.2 Kernel And Range.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Matrices and vector spaces
Eigenvalues and Eigenvectors
Matrices and Vectors Review Objective
6-4 Symmetric Matrices By毛.
Christopher Crawford PHY
Chapter 3 Linear Algebra
Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors.
Linear Algebra Lecture 32.
Maths for Signals and Systems Linear Algebra in Engineering Lecture 18, Friday 18th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Physics 319 Classical Mechanics
Eigenvalues and Eigenvectors
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Presentation transcript:

1.2. Homomorphism: SL(2,C) ~ L 0 Let Φ be a map between groups G 1 & G 2, i.e., Φ: G 1 → G 2. Φ is a homomorphism if Example: G 1 = (Z,+), G 2 = C 2, Φ(n) = (-1) n  n  Z. Example: G 1 = (Z,+), G 2 = C k, Φ(n) = exp(2πi n/k)  n  Z. → Multiplication in C k ~ addition modulo k in Z

Let M be the Minkowski space, i.e., R 4 with the Lorentz metric →(c = 1) A Lorentz transformation B preserves the Lorentz metric: The set of all B forms the Lorentz group L. Rewrite x as a 2×2 self-adjoint (Hermitian) matrix: Note: all eigenvalues λ j of a Hermitian matrix must be real.

Pauli matrices The action of a 2×2 matrix A on X is defined as (Hermitian) A  SL(2,C) → → Φ is a homomorphism

Let C be a Lorentz transformation. By definition Let Metric tensor  x x →

Let A  SU(2) → A -1 = A + →A I A + = I Let→ Let C = Φ(A) be the corresponding Lorentz transformation: i.e., C is a spatial rotation → The subspace orthogonal to e 0 is For all → O(3) is the subgroup of L defined by  Φ: SU(2) → O(3) Φ: SL(2,C) → L 0

Example 1 → Φ(U Θ ) is a rotation of angle 2Θ about the x 3 axis. Θ = π corresponds to 2π rotation in 3-space.

Example 2 Φ(V Θ ) = rotation of angle 2α about x 2 -axis

Example 3 Φ(M r ) = Boost along z-axis Set

Every A  SL(2,C) is continuously joined to I by a curve of matrices in SL(2,C) Every matrix is conjugate (similar) to an upper triangular matrix. It is similar to a diagonal matrix if the number of its independent eigenvectors is equal to its dimension. For a 2×2 matrix A If A  SL(2,C), then i.e., Let a t be any continuous curve of non-zero complex numbers with a 0 = 1 and a 1 = a. Likewise for b t with b 0 = 0 and b 1 = b.

A Lorentz transformation C satisfies→ Since elements with detC = -1 cannot be joined continuously to those with detC = +1, the former is outside the range of Φ. A pure boost cannot change the sign of x 0. Elements with detC = +1 form a subgroup L 0 called the proper Lorentz group. A change of the sign of x 0 requires reflection so that detC = -1 → L 0 preserves the forward & backward light cones. To be shown: Φ[ SL(2,C) ] = L 0 Φ[ SU(2) ] = SO(3)

Lemma Every B  L 0 can be written as R 1 & R 2 are spatial rotations. L u z a boost along the z-axis. Proof: Let S be a rotation that aligns x with the z-axis: Letwith → (boost along z ) Φ[ SL(2,C) ] = L 0