DOCSLIB.ORG

Math 22 – Linear Algebra and Its Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Math 22 – Linear Algebra and Its Applications Math 22 – Linear Algebra and its applications - Lecture 20 - Instructor: Bjoern Muetzel GENERAL INFORMATION ▪ Office hours: Tu 1-3 pm, Th, Sun 2-4 pm in KH 229 Tutorial: Tu, Th, Sun 7-9 pm in KH 105 Come tomorrow to practice for the exam. ▪ Homework 6: due today at 4 pm outside KH 008. Please divide into the parts A, C and D. Exercise 1 b) is optional. ▪ Midterm 2: Friday Nov 1 at 4 pm in Carpenter 013 - Topics: Chapter 2.1 – 4.7 (included) - about 8-9 questions - Practice exam 2 solutions available 6 Orthogonality and Least Squares 6.1 INNER PRODUCT, LENGTH, AND ORTHOGONALITY Summary: If u and v are vectors in ℝ푛 then the inner product uTv = u∙v allows us to measure angles, lengths and distances. u v 휃 GEOMETRIC INTERPRETATION Inner product in ℝퟐ 2 1 Given two vectors u = and 푣 = how can we measure the length 1 −1 of these vectors and the angle between them? INNER PRODUCT ▪ If u and v are vectors in ℝ푛, then we can regard u and v as 푛 × 1 matrices. The transpose uT is a 1 × 푛 matrix, and the matrix product uTv is a 1 × 1 matrix, which we write as a real number without brackets. 푢1 푣1 푢2 푣2 푛 ▪ Definition: If 푢 = ⋮ and 푣 = ⋮ are vectors in ℝ , then 푢푛 푣푛 the inner product or dot product of u and v is 푣1 푇 푣2 푢 푣 = 푢 ∙ 푣 = [푢1, 푢2, … , 푢푛] ⋮ = 푢1푣1 + 푢2푣2 + ⋯ + 푢푛푣푛. 푣푛 ▪ Theorem 1: Let u, v, and w be vectors in ℝ푛, and let c in ℝ be a scalar. Then a. 푢 ∙ 푣 = 푣 ∙ 푢 b. 푢 + 푣 ∙ 푤 = 푢 ∙ 푤 + 푣 ∙ 푤 c. 푐푢 ∙ 푣 = 푐 푢 ∙ 푣 = 푢 ∙ (푐푣) d. 푢 ∙ 푢 ≥ 0, and 푢 ∙ 푢 = 0 if and only if 푢 = 0. ▪ Consequence: (Linearity) (푐1푢1+…+푐푝푢푝) ∙ 푤 = 푐1 푢1 ∙ 푤 + ⋯ + 푐푝 푢푝 ∙ 푤 . Proof: 1.) a. and d. can be easily checked. 2. ) b. and c. are true as the dot product is a matrix multiplication which is linear. By a. it is linear from “both sides”. 3.) The consequence follows from b. and c. LENGTH 푛 ▪ If v is in ℝ , with entries v1, …, vn, then the square root of 푣 ∙ 푣 is well-defined as 푣 ∙ 푣 ≥ 0. We define: ▪ Definition: The length (or norm) 푣 of v is the nonnegative real number defined by 2 2 2 2 푣 = 푣 ∙ 푣 = 푣1 + 푣2 + ⋯ + 푣푛 , hence 푣 = 푣 ∙ 푣. Example: Length in ℝ2 푎 푣 = 푏 Definition: A vector 푣 in ℝ푛, that has length 푣 = 푣 ∙ 푣 = 1 is called a unit vector. Note: If a vector 푣 in ℝ푛 is multiplied by a scalar c in ℝ, then 푐푣 = 푐푣 ∙ 푐푣 = 푐2(푣 ∙ 푣) = 푐 ∙ 푣 . 푣 푣 푢 = 푣 Definition: If we divide a vector 푣 ≠ 0 by its length 푣 then we ퟏ obtain a unit vector 풖 = ∙ 풗 . The process of creating 푢 from 푣 is 풗 called normalizing 푣, and we say that 풖 is in the same direction as 풗. LENGTH 1 ▪ Example: Let 푣 = 2 be a vector in ℝ3. 2 1.) Calculate 푣 . 2.) Find a unit vector 푢 in the same direction as 푣. What is 푢 2 ? 3.) Draw a coordinate system with 푣, 푢 and the unit sphere 푆 = {푥 in ℝ3, 푥 = 1} in ℝ3. ANGLE Definition: Let 푢 and 푣 be vectors in ℝ푛. Then the angle 휽 = ∡ 풖, 풗 between 푢 and 푣 is given by 푢∙푣 푢∙푣 cos θ = or θ = 푎푟푐푐표푠 . 푢 푣 푢 푣 3 −2 Example: For 푢 = and 푣 = , compute cos(∡ 푢, 푣 ). Estimate 4 2 the angle ∡ 푢, 푣 with a calculator and with a sketch of 푢 and 푣 in ℝ2. Does the angle change if we normalize 푢 and 푣 ? DISTANCE Definition: For 푢 and 푣 in ℝ푛, the distance between 풖 and 풗, written as dist(푢,푣), is the length of the vector 푢-v. That is, dist 푢, 푣 = 푢 − 푣 Example: Distance in ℝ2 5 3 Example: Compute the distance between 푢 = and 푣 = . 1 2 Check your calculation with a sketch of 푢 and 푣 in ℝ2. ORTHOGONALITY ▪ Note: Two nonzero vectors 푢 and 푣 in ℝ푛 are perpendicular, i.e. 휋 ∡ 푢, 푣 = or cos ∡ 푢, 푣 = 0 if and only if 푢 ∙ 푣 = 0. 2 ▪ Definition: Two vectors 푢 and 푣 in ℝ푛 are orthogonal to each other if 풖 ∙ 풗 = ퟎ . Example: The zero vector 0 is orthogonal to every vector in ℝ푛. ▪ Theorem 2: Two vectors 푢 and 푣 in ℝ푛 are orthogonal if and only if 푢 + 푣 2 = 푢 2 + 푣 2. Proof: Definition: (Orthogonal Complements) 1.) If a vector z is orthogonal to every vector in a subspace W of ℝ푛, then z is said to be orthogonal to W. 2.) The set of all vectors z that are orthogonal to W is called the orthogonal complement of W and is denoted by 푊⊥. 푊⊥ is read as “W perpendicular” or simply “W perp”. Note: 1.) A vector x is in 푊⊥ if and only if x is orthogonal to every vector in a set that spans W. 2.) 푊⊥ is a subspace of ℝ푛. Proof: Idea: Use linearity of the inner product for 1.). Then check the subspace criteria for 2.) See HW 7. ORTHOGONALITY Theorem 3: Let A be an 푚 × 푛 matrix. The orthogonal complement of the row space of A is the null space of A, and the orthogonal complement of the column space of A is the null space of AT: 푅표푤 퐴 ⊥ = 푁푢푙 퐴 and 퐶표푙 퐴 ⊥ = 푁푢푙 퐴푇 . Proof: See HW 7 How can we find the orthogonal complement 푾⊥ of a subspace W? 푛 Note: Given a subspace W= Span{푎1, 푎2,…, 푎푚} in ℝ . Let A be the 푛 × 푚 matrix A = [푎1,푎2,…, 푎푚] . Theorem 3 states that 푊⊥ = 퐶표푙 퐴 ⊥ = 푁푢푙 퐴푇. 3 3 Example: Let W = Span{ 4 , −1 }. 1 0 Find 푊⊥, then sketch W and 푊⊥ in ℝ3. Hint: Use Theorem 3. Slide 6.1- 18.
Load more

Recommended publications
  • 21. Orthonormal Bases
    21. Orthonormal Bases The canonical/standard basis 011 001 001 B C B C B C B0C B1C B0C e1 = B.C ; e2 = B.C ; : : : ; en = B.C B.C B.C B.C @.A @.A @.A 0 0 1 has many useful properties. • Each of the standard basis vectors has unit length: q p T jjeijj = ei ei = ei ei = 1: • The standard basis vectors are orthogonal (in other words, at right angles or perpendicular). T ei ej = ei ej = 0 when i 6= j This is summarized by ( 1 i = j eT e = δ = ; i j ij 0 i 6= j where δij is the Kronecker delta. Notice that the Kronecker delta gives the entries of the identity matrix. Given column vectors v and w, we have seen that the dot product v w is the same as the matrix multiplication vT w. This is the inner product on n T R . We can also form the outer product vw , which gives a square matrix. 1 The outer product on the standard basis vectors is interesting. Set T Π1 = e1e1 011 B C B0C = B.C 1 0 ::: 0 B.C @.A 0 01 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 0 . T Πn = enen 001 B C B0C = B.C 0 0 ::: 1 B.C @.A 1 00 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 1 In short, Πi is the diagonal square matrix with a 1 in the ith diagonal position and zeros everywhere else.
    [Show full text]
  • What's in a Name? the Matrix As an Introduction to Mathematics
    St. John Fisher College Fisher Digital Publications Mathematical and Computing Sciences Faculty/Staff Publications Mathematical and Computing Sciences 9-2008 What's in a Name? The Matrix as an Introduction to Mathematics Kris H. Green St. John Fisher College, [email protected] Follow this and additional works at: https://fisherpub.sjfc.edu/math_facpub Part of the Mathematics Commons How has open access to Fisher Digital Publications benefited ou?y Publication Information Green, Kris H. (2008). "What's in a Name? The Matrix as an Introduction to Mathematics." Math Horizons 16.1, 18-21. Please note that the Publication Information provides general citation information and may not be appropriate for your discipline. To receive help in creating a citation based on your discipline, please visit http://libguides.sjfc.edu/citations. This document is posted at https://fisherpub.sjfc.edu/math_facpub/12 and is brought to you for free and open access by Fisher Digital Publications at St. John Fisher College. For more information, please contact [email protected]. What's in a Name? The Matrix as an Introduction to Mathematics Abstract In lieu of an abstract, here is the article's first paragraph: In my classes on the nature of scientific thought, I have often used the movie The Matrix to illustrate the nature of evidence and how it shapes the reality we perceive (or think we perceive). As a mathematician, I usually field questions elatedr to the movie whenever the subject of linear algebra arises, since this field is the study of matrices and their properties. So it is natural to ask, why does the movie title reference a mathematical object? Disciplines Mathematics Comments Article copyright 2008 by Math Horizons.
    [Show full text]
  • Multivector Differentiation and Linear Algebra 0.5Cm 17Th Santaló
    Multivector differentiation and Linear Algebra 17th Santalo´ Summer School 2016, Santander Joan Lasenby Signal Processing Group, Engineering Department, Cambridge, UK and Trinity College Cambridge [email protected], www-sigproc.eng.cam.ac.uk/ s jl 23 August 2016 1 / 78 Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. 2 / 78 Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. 3 / 78 Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. 4 / 78 Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... 5 / 78 Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary 6 / 78 We now want to generalise this idea to enable us to find the derivative of F(X), in the A ‘direction’ – where X is a general mixed grade multivector (so F(X) is a general multivector valued function of X). Let us use ∗ to denote taking the scalar part, ie P ∗ Q ≡ hPQi. Then, provided A has same grades as X, it makes sense to define: F(X + tA) − F(X) A ∗ ¶XF(X) = lim t!0 t The Multivector Derivative Recall our definition of the directional derivative in the a direction F(x + ea) − F(x) a·r F(x) = lim e!0 e 7 / 78 Let us use ∗ to denote taking the scalar part, ie P ∗ Q ≡ hPQi.
    [Show full text]
  • Handout 9 More Matrix Properties; the Transpose
    Handout 9 More matrix properties; the transpose Square matrix properties These properties only apply to a square matrix, i.e. n £ n. ² The leading diagonal is the diagonal line consisting of the entries a11, a22, a33, . ann. ² A diagonal matrix has zeros everywhere except the leading diagonal. ² The identity matrix I has zeros o® the leading diagonal, and 1 for each entry on the diagonal. It is a special case of a diagonal matrix, and A I = I A = A for any n £ n matrix A. ² An upper triangular matrix has all its non-zero entries on or above the leading diagonal. ² A lower triangular matrix has all its non-zero entries on or below the leading diagonal. ² A symmetric matrix has the same entries below and above the diagonal: aij = aji for any values of i and j between 1 and n. ² An antisymmetric or skew-symmetric matrix has the opposite entries below and above the diagonal: aij = ¡aji for any values of i and j between 1 and n. This automatically means the digaonal entries must all be zero. Transpose To transpose a matrix, we reect it across the line given by the leading diagonal a11, a22 etc. In general the result is a di®erent shape to the original matrix: a11 a21 a11 a12 a13 > > A = A = 0 a12 a22 1 [A ]ij = A : µ a21 a22 a23 ¶ ji a13 a23 @ A > ² If A is m £ n then A is n £ m. > ² The transpose of a symmetric matrix is itself: A = A (recalling that only square matrices can be symmetric).
    [Show full text]
  • Geometric-Algebra Adaptive Filters Wilder B
    1 Geometric-Algebra Adaptive Filters Wilder B. Lopes∗, Member, IEEE, Cassio G. Lopesy, Senior Member, IEEE Abstract—This paper presents a new class of adaptive filters, namely Geometric-Algebra Adaptive Filters (GAAFs). They are Faces generated by formulating the underlying minimization problem (a deterministic cost function) from the perspective of Geometric Algebra (GA), a comprehensive mathematical language well- Edges suited for the description of geometric transformations. Also, (directed lines) differently from standard adaptive-filtering theory, Geometric Calculus (the extension of GA to differential calculus) allows Fig. 1. A polyhedron (3-dimensional polytope) can be completely described for applying the same derivation techniques regardless of the by the geometric multiplication of its edges (oriented lines, vectors), which type (subalgebra) of the data, i.e., real, complex numbers, generate the faces and hypersurfaces (in the case of a general n-dimensional quaternions, etc. Relying on those characteristics (among others), polytope). a deterministic quadratic cost function is posed, from which the GAAFs are devised, providing a generalization of regular adaptive filters to subalgebras of GA. From the obtained update rule, it is shown how to recover the following least-mean squares perform calculus with hypercomplex quantities, i.e., elements (LMS) adaptive filter variants: real-entries LMS, complex LMS, that generalize complex numbers for higher dimensions [2]– and quaternions LMS. Mean-square analysis and simulations in [10]. a system identification scenario are provided, showing very good agreement for different levels of measurement noise. GA-based AFs were first introduced in [11], [12], where they were successfully employed to estimate the geometric Index Terms—Adaptive filtering, geometric algebra, quater- transformation (rotation and translation) that aligns a pair of nions.
    [Show full text]
  • Determinants Math 122 Calculus III D Joyce, Fall 2012
    Determinants Math 122 Calculus III D Joyce, Fall 2012 What they are. A determinant is a value associated to a square array of numbers, that square array being called a square matrix. For example, here are determinants of a general 2 × 2 matrix and a general 3 × 3 matrix. a b = ad − bc: c d a b c d e f = aei + bfg + cdh − ceg − afh − bdi: g h i The determinant of a matrix A is usually denoted jAj or det (A). You can think of the rows of the determinant as being vectors. For the 3×3 matrix above, the vectors are u = (a; b; c), v = (d; e; f), and w = (g; h; i). Then the determinant is a value associated to n vectors in Rn. There's a general definition for n×n determinants. It's a particular signed sum of products of n entries in the matrix where each product is of one entry in each row and column. The two ways you can choose one entry in each row and column of the 2 × 2 matrix give you the two products ad and bc. There are six ways of chosing one entry in each row and column in a 3 × 3 matrix, and generally, there are n! ways in an n × n matrix. Thus, the determinant of a 4 × 4 matrix is the signed sum of 24, which is 4!, terms. In this general definition, half the terms are taken positively and half negatively. In class, we briefly saw how the signs are determined by permutations.
    [Show full text]
  • Matrices and Tensors
    APPENDIX MATRICES AND TENSORS A.1. INTRODUCTION AND RATIONALE The purpose of this appendix is to present the notation and most of the mathematical tech- niques that are used in the body of the text. The audience is assumed to have been through sev- eral years of college-level mathematics, which included the differential and integral calculus, differential equations, functions of several variables, partial derivatives, and an introduction to linear algebra. Matrices are reviewed briefly, and determinants, vectors, and tensors of order two are described. The application of this linear algebra to material that appears in under- graduate engineering courses on mechanics is illustrated by discussions of concepts like the area and mass moments of inertia, Mohr’s circles, and the vector cross and triple scalar prod- ucts. The notation, as far as possible, will be a matrix notation that is easily entered into exist- ing symbolic computational programs like Maple, Mathematica, Matlab, and Mathcad. The desire to represent the components of three-dimensional fourth-order tensors that appear in anisotropic elasticity as the components of six-dimensional second-order tensors and thus rep- resent these components in matrices of tensor components in six dimensions leads to the non- traditional part of this appendix. This is also one of the nontraditional aspects in the text of the book, but a minor one. This is described in §A.11, along with the rationale for this approach. A.2. DEFINITION OF SQUARE, COLUMN, AND ROW MATRICES An r-by-c matrix, M, is a rectangular array of numbers consisting of r rows and c columns: ¯MM..
    [Show full text]
  • Glossary of Linear Algebra Terms
    INNER PRODUCT SPACES AND THE GRAM-SCHMIDT PROCESS A. HAVENS 1. The Dot Product and Orthogonality 1.1. Review of the Dot Product. We first recall the notion of the dot product, which gives us a familiar example of an inner product structure on the real vector spaces Rn. This product is connected to the Euclidean geometry of Rn, via lengths and angles measured in Rn. Later, we will introduce inner product spaces in general, and use their structure to define general notions of length and angle on other vector spaces. Definition 1.1. The dot product of real n-vectors in the Euclidean vector space Rn is the scalar product · : Rn × Rn ! R given by the rule n n ! n X X X (u; v) = uiei; viei 7! uivi : i=1 i=1 i n Here BS := (e1;:::; en) is the standard basis of R . With respect to our conventions on basis and matrix multiplication, we may also express the dot product as the matrix-vector product 2 3 v1 6 7 t î ó 6 . 7 u v = u1 : : : un 6 . 7 : 4 5 vn It is a good exercise to verify the following proposition. Proposition 1.1. Let u; v; w 2 Rn be any real n-vectors, and s; t 2 R be any scalars. The Euclidean dot product (u; v) 7! u · v satisfies the following properties. (i:) The dot product is symmetric: u · v = v · u. (ii:) The dot product is bilinear: • (su) · v = s(u · v) = u · (sv), • (u + v) · w = u · w + v · w.
    [Show full text]
  • 28. Exterior Powers
    28. Exterior powers 28.1 Desiderata 28.2 Definitions, uniqueness, existence 28.3 Some elementary facts 28.4 Exterior powers Vif of maps 28.5 Exterior powers of free modules 28.6 Determinants revisited 28.7 Minors of matrices 28.8 Uniqueness in the structure theorem 28.9 Cartan's lemma 28.10 Cayley-Hamilton Theorem 28.11 Worked examples While many of the arguments here have analogues for tensor products, it is worthwhile to repeat these arguments with the relevant variations, both for practice, and to be sensitive to the differences. 1. Desiderata Again, we review missing items in our development of linear algebra. We are missing a development of determinants of matrices whose entries may be in commutative rings, rather than fields. We would like an intrinsic definition of determinants of endomorphisms, rather than one that depends upon a choice of coordinates, even if we eventually prove that the determinant is independent of the coordinates. We anticipate that Artin's axiomatization of determinants of matrices should be mirrored in much of what we do here. We want a direct and natural proof of the Cayley-Hamilton theorem. Linear algebra over fields is insufficient, since the introduction of the indeterminate x in the definition of the characteristic polynomial takes us outside the class of vector spaces over fields. We want to give a conceptual proof for the uniqueness part of the structure theorem for finitely-generated modules over principal ideal domains. Multi-linear algebra over fields is surely insufficient for this. 417 418 Exterior powers 2. Definitions, uniqueness, existence Let R be a commutative ring with 1.
    [Show full text]
  • 5 the Dirac Equation and Spinors
    5 The Dirac Equation and Spinors In this section we develop the appropriate wavefunctions for fundamental fermions and bosons. 5.1 Notation Review The three dimension differential operator is : ∂ ∂ ∂ = , , (5.1) ∂x ∂y ∂z We can generalise this to four dimensions ∂µ: 1 ∂ ∂ ∂ ∂ ∂ = , , , (5.2) µ c ∂t ∂x ∂y ∂z 5.2 The Schr¨odinger Equation First consider a classical non-relativistic particle of mass m in a potential U. The energy-momentum relationship is: p2 E = + U (5.3) 2m we can substitute the differential operators: ∂ Eˆ i pˆ i (5.4) → ∂t →− to obtain the non-relativistic Schr¨odinger Equation (with = 1): ∂ψ 1 i = 2 + U ψ (5.5) ∂t −2m For U = 0, the free particle solutions are: iEt ψ(x, t) e− ψ(x) (5.6) ∝ and the probability density ρ and current j are given by: 2 i ρ = ψ(x) j = ψ∗ ψ ψ ψ∗ (5.7) | | −2m − with conservation of probability giving the continuity equation: ∂ρ + j =0, (5.8) ∂t · Or in Covariant notation: µ µ ∂µj = 0 with j =(ρ,j) (5.9) The Schr¨odinger equation is 1st order in ∂/∂t but second order in ∂/∂x. However, as we are going to be dealing with relativistic particles, space and time should be treated equally. 25 5.3 The Klein-Gordon Equation For a relativistic particle the energy-momentum relationship is: p p = p pµ = E2 p 2 = m2 (5.10) · µ − | | Substituting the equation (5.4), leads to the relativistic Klein-Gordon equation: ∂2 + 2 ψ = m2ψ (5.11) −∂t2 The free particle solutions are plane waves: ip x i(Et p x) ψ e− · = e− − · (5.12) ∝ The Klein-Gordon equation successfully describes spin 0 particles in relativistic quan- tum field theory.
    [Show full text]
  • A Some Basic Rules of Tensor Calculus
    A Some Basic Rules of Tensor Calculus The tensor calculus is a powerful tool for the description of the fundamentals in con- tinuum mechanics and the derivation of the governing equations for applied prob- lems. In general, there are two possibilities for the representation of the tensors and the tensorial equations: – the direct (symbolic) notation and – the index (component) notation The direct notation operates with scalars, vectors and tensors as physical objects defined in the three dimensional space. A vector (first rank tensor) a is considered as a directed line segment rather than a triple of numbers (coordinates). A second rank tensor A is any finite sum of ordered vector pairs A = a b + ... +c d. The scalars, vectors and tensors are handled as invariant (independent⊗ from the choice⊗ of the coordinate system) objects. This is the reason for the use of the direct notation in the modern literature of mechanics and rheology, e.g. [29, 32, 49, 123, 131, 199, 246, 313, 334] among others. The index notation deals with components or coordinates of vectors and tensors. For a selected basis, e.g. gi, i = 1, 2, 3 one can write a = aig , A = aibj + ... + cidj g g i i ⊗ j Here the Einstein’s summation convention is used: in one expression the twice re- peated indices are summed up from 1 to 3, e.g. 3 3 k k ik ik a gk ∑ a gk, A bk ∑ A bk ≡ k=1 ≡ k=1 In the above examples k is a so-called dummy index. Within the index notation the basic operations with tensors are defined with respect to their coordinates, e.
    [Show full text]
  • 2 Lecture 1: Spinors, Their Properties and Spinor Prodcuts
    2 Lecture 1: spinors, their properties and spinor prodcuts Consider a theory of a single massless Dirac fermion . The Lagrangian is = ¯ i@ˆ . (2.1) L ⇣ ⌘ The Dirac equation is i@ˆ =0, (2.2) which, in momentum space becomes pUˆ (p)=0, pVˆ (p)=0, (2.3) depending on whether we take positive-energy(particle) or negative-energy (anti-particle) solutions of the Dirac equation. Therefore, in the massless case no di↵erence appears in equations for paprticles and anti-particles. Finding one solution is therefore sufficient. The algebra is simplified if we take γ matrices in Weyl repreentation where µ µ 0 σ γ = µ . (2.4) " σ¯ 0 # and σµ =(1,~σ) andσ ¯µ =(1, ~ ). The Pauli matrices are − 01 0 i 10 σ = ,σ= − ,σ= . (2.5) 1 10 2 i 0 3 0 1 " # " # " − # The matrix γ5 is taken to be 10 γ5 = − . (2.6) " 01# We can use the matrix γ5 to construct projection operators on to upper and lower parts of the four-component spinors U and V . The projection operators are 1 γ 1+γ Pˆ = − 5 , Pˆ = 5 . (2.7) L 2 R 2 Let us write u (p) U(p)= L , (2.8) uR(p) ! where uL(p) and uR(p) are two-component spinors. Since µ 0 pµσ pˆ = µ , (2.9) " pµσ¯ 0(p) # andpU ˆ (p) = 0, the two-component spinors satisfy the following (Weyl) equations µ µ pµσ uR(p)=0,pµσ¯ uL(p)=0. (2.10) –3– Suppose that we have a left handed spinor uL(p) that satisfies the Weyl equation.
    [Show full text]