3.2 Real and complex symmetric bilinear forms
|
|
- Jodie Melinda Hancock
- 6 years ago
- Views:
Transcription
1 Then, the adjoint of f is the morphism 3 f + : Q 3 Q 3 ; x 5 0 x As a verification, you can check that 3 0 B = B Real and complex symmetric bilinear forms Throughout the remainder of these notes we will assume that K {R, C}. Throughout this section we will assume that all bilinear forms are symmetric. When we consider symmetric bilinear forms on real or complex vector spaces we obtain some particularly nice results. 60 For a C-vector space V and symmetric bilinear form B Bil C (V ) we will see that there is a basis B V such that [B] B = I dim V. First we introduce the important polarisation identity. Lemma 3.2. (Polarisation identity). Let B Bil K (V ) be a symmetric bilinear form. Then, for any u, v V, we have Proof: Left as an exercise for the reader. B(u, v) = (B(u + v, u + v) B(u, u) B(v, v)). 2 Corollary Let B Bil K (V ) be symmetric and nonzero. Then, there exists some nonzero v V such that B(v, v) 0. Proof: Suppose that the result does not hold: that is, for every v V we have B(v, v) = 0. Then, using the polarisation identity (Lemma 3.2.) we have, for every u, v V, B(u, v) = 2 (B(u + v, u + v, ) B(u, u) B(v, v)) = (0 0 0) = 0. 4 Hence, we must have that B = 0 is the zero bilinear form, which contradicts our assumption on B. Hence, ther must exist some v V such that B(v, v) 0. This seemingly simple result has some profound consequences for nondegenerate complex symmetric bilinear forms. Theorem (Classification of nondegenerate symmetric bilinear forms over C). Let B Bil C (V ) be symmetric and nondegenerate. Then, there exists an ordered basis B V such that [B] B = I dim V. Proof: By Corollary we know that there exists some nonzero v V such that B(v, v ) 0 (we know that B is nonzero since it is nondegenerate). Let E = span C {v } and consider E V. We have E E = {0 V }: indeed, let x E E. Then, x = cv, for some c C. As x E we must have 0 = B(x, v ) = B(cv, v ) = cb(v, v ), so that c = 0 (as B(v, v ) 0). Thus, by Proposition 3..7, we must have V = E E. 60 Actually, all results that hold for C-vector space also hold for K-vector spaces, where K is an algebraically closed field. To say that K is algebraically closed means that the Fundamental Theorem of Algebra holds for K[t]; equivalently, every polynomial f K[t] can be written as a product of linear factors. 93
2 Moreover, B restricts to a nondegenerate symmetric bilinear form on E : indeed, the restriction is B E : E E C ; (u, u ) B(u, u ), and this is a symmetric bilinear form. We need to check that it is nondegenerate. Suppose that w E is such that, for every z E we have B(z, w) = 0. Then, for any v V, we have v = cv + z, z E, c C, so that B(v, w) = B(cv + z, w) = cb(v, w) + B(z, w) = = 0, where we have used the assumption on w and that w E. Hence, using nongeneracy of B on V we see that w = 0 V. Hence, we have that B is also nondegenerate on E. As above, we can now find v 2 E such that B(v 2, v 2 ) 0 and, if we denote E 2 = span C {v 2 }, then E = E 2 E2, where E 2 is the B-complement of E 2 in E. Hence, we have V = E E 2 E2. Proceeding in the manner we obtain V = E E n, where n = dim V, and where E i = span C {v i }. Moreover, by construction we have that B(v i, v j ) = 0, for i j. Define b i = B(vi, v i ) v i; we know that the square root B(v i, v i ) exists (and is nonzero) since we are considering C-scalars. 6 Then, it is easy to see that {, i = j, B(b i, b j ) = 0, i j. Finally, since V = span C {b } span C {b n }, we have that B = (b,..., b n ) is an ordered basis such that [B] B = I n. Corollary Let A GL n (C) be a symmetric matrix (so that A = A t ). Then, there exists P GL n (C) such that P t AP = I n. Proof: This is just Theorem3.2.3 and Proposition 3..8 applied to the bilinear form B A Bil C (C n ). The assumptions on A ensure that B A is symmetric and nondegenerate. Corollary Suppose that X, Y GL n (C) are both symmetric. Then, there is a nondegenerate bilinear form B Bil C (C n ) and bases B, C C n such that X = [B] B, Y = [B] C. 6 This is a consequence of the Fundamental Theorem of Algebra: for any c C we have that has a solution. t 2 c = 0, 94
3 Proof: By the previous Corollary we can find P, Q GL n (C) such that P t XP = I n = Q t YQ = (Q ) t P t XPQ = Y = (PQ ) t XPQ = Y. Now, let B = B X Bil C (C n ), B = S (n) and C = (c,..., c n ), where c i is the i th column of PQ. Then, the above identity states that [B] C = P t B C[B] B P B C = Y. The result follows. The situation is not as simple for an R-vector space V and nondegenerate symmetric bilinear form B Bil R (V ), however we can still obtain a nice classification result. Theorem (Sylvester s law of inertia). Let V be an R-vector space, B Bil R (V ) a nondegenerate symmetric bilinear form. Then, there is an ordered basis B V such that [B] B is a diagonal matrix d d 2 [B] B = where d i {, }. Moreover, if p = the number of s appearing on the diagonal and q = the number of s appearing on the diagonal, then p and q are invariants of B: this means that if C V is any other basis of V such that e e 2 [B] C = en where e j {, }, and p (resp. q ) denotes the number of s (resp. s) on the diagonal. Then, p = p, q = q. Proof: The proof is similar to the proof of Theorem 3.2.3: we determine v,..., v n V such that V = span R {v } span R {v n }, and with B(v i, v j ) = 0, whenever i j. However, we now run into a problem: what if B(v i, v i ) < 0? We can t find a real square root of a negative number so we can t proceed as in the complex case. However, if we define δ i = B(v i, v i ), for every i, then we can obtain a basis B = (b,..., b n ), where we define Then, we see that and [B] B is of the required form. B(b i, b j ) = b i = δ i v i. { 0, i j, ±, i = j, Let us reorder B so that, for i =,..., p, we have B(b i, b i ) > 0. Then, if we denote P = span R {b,..., b p }, and Q = span R {b p+,..., b n }, we have dim P = p, dim Q = q (= n p). 95
4 We see that the restriction of B to P satisfies B(u, u) > 0, for every u P, and that if P P, P P, with P V a subspace, then there is some v P such that B(v, v) 0: indeed, as v / P then we have v = λ b λ p b p + µ b p µ q b n, and some µ j 0. Then, since P P we must have b p+j P and B(b p+j, b p+j ) < 0. Hence, we can see that p is the dimension of the largest subspace U of V for which the restriction of B to U satisfies B(u, u) > 0, for every u U. Similarly, we can define q to be the dimension of the largest subspace U V for which the restriction of B to U satisfies B(u, u ) < 0, for every u U. Therefore, we have defined p and q only in terms of B so that they are invariants of B. Corollary For every symmetric A GL n (R), there exists X GL n (R) such that d X t d 2 AX = with d i {, }. Definition Suppose that B Bil R (V ) is nondegenerate and symmetric and that p, q are as in Theorem Then, we define the signature of B, denoted sig(b), to be the number sig(b) = p q. It is an invariant of B: for any basis B V such that d d 2 [B] B = with d i {, }, the quantity p q is the same Computing the canonical form of a real nondegenerate symmetric bilinear form ([], p.85-9) Suppose that B Bil R (V ) is symmetric and nondegenerate, with V a finite dimensional R-vector space. Suppose that B V is an ordered basis such that d d 2 [B] B = where d i {, }. Such a basis exists by Theorem How do we determine B? Suppose that C V is any ordered basis. Then, we know that P t C B[B] C P C B = [B] B, 96
5 by Proposition Hence, the problem of determining B is equivalent to the problem of determining P C B (since we already know C and we can use P C B to determine B 62 ). Therefore, suppose that A = [a ij ] GL n (R) is symmetric. We want to determine P GL n (R) such that d P t d 2 AP = where d i {, }. Consider the column vector of variables Then, we have x = x. x n. x t Ax = a x a nn x 2 n + 2 i<j a ij x i x j. 63 By performing the completing the square process for each variable x i we will find variables y = q x + q 2 x q n x n, y 2 = q 2 x + q 22 x q 2n x n. y n = q n x + q n2 x q nn x n such that x t Ax = y yp 2 yp yn 2. Then, P = [q ij ] is the matrix we are looking for. Why? The above system of equations corresponds to the matrix equation y = Qx, Q = [q ij ] GL n (R), which we can consider as a change of coordiante transformation P B S (n) from the standard basis S (n) R n to a basis B (we consider x to be the S (n) -coordinate vector of the corresponding element of R n ). Then, we see that (Py) t A(Py) = x t Ax = y yp 2 yp yn 2, where P = Q. As y t P t APy = (Py) t A(Py) = y yp 2 yp yn 2 = y t y, we see that P t AP is of the desired form. Moreover, B is the required basis. It is better to indicate this method through an example. 62 Why? 63 The assignment x x t Ax is called a quadratic form. The study of quadratic forms and their properties is primarily determined by the symmetric bilinear forms defined by A. 97
6 Example Let 0 2 A = so that A is symmetric and invertible. Consider the column vector of variable x as above. Then, we have x t Ax = x 2 + 2x 2 2 x 2 4 2x x 3 + 4x x 4 + 2x 2 x 3 4x 2 x 4. Let s complete the square with respect to x : we have Now we set x 2 + 2x 2 2 x 2 4 2x x 3 + 4x x 4 + 2x 2 x 3 4x 2 x 4 = x 2 2x (x 3 2x 4 ) + (x 3 2x 4 ) 2 (x 3 2x 4 ) 2 + 2x 2 2 x x 2 x 3 4x 2 x 4 = (x (x 3 2x 4 )) 2 + 2x 2 2 x 2 3 5x x 2 x 3 4x 2 x 4 + 4x 3 x 4 y = x x 3 + 2x 4. Then, complete the square with respect to the remaining x 2 terms: we have y 2 + 2x 2 2 x 2 3 5x x 2 x 3 4x 2 x 4 + 4x 3 x 4 = y 2 + 2(x x 2 (x 3 2x 4 ) + 4 (x 3 2x 4 ) 2 ) 2 (x 3 2x 4 ) 2 x 2 3 x 2 4 4x 3 x 4 = y 2 + 2(x (x 3 2x 4 )) x 2 3 7x 2 4 2x 3 x 4 Now we set We obtain y 2 = 2 ( x x 3 x 4 ). x 2 + 2x 2 2 x 2 4 2x x 3 + 4x x 4 + 2x 2 x 3 4x 2 x 4 = y 2 + y x 2 3 7x 2 4 2x 3 x 4. Completing the square with respect to x 3 we obtain y 2 + y x 2 3 7x 2 4 2x 3 x 4 = y 2 + y (x x 3x x 2 4 ) x 2 4 = y 2 + y (x x 4) x 2 4. Then, set So, if we let then we have 3 y 3 = 2 (x x 4),. 7 y 4 = 6 x Q = y = Qx. 98
7 Hence, if we define P = Q, then we have that P t AP =. Hence, we have that p = 3, q = and that if B A Bil R (R 4 ) then 2. Consider the matrix sig(b A ) = 3 = A = which is symmetric and invertible. Consider the column vector of variables x as before. Then, we have x t Ax = x 2 + 2x 2 x 3. Proceeding as before, we complete the square with respect to x 2 (we don t need to complete the square for x ): we have x 2 + 2x 2 x 3 = x (x 2 + x 3 ) 2 2 (x 2 x 3 ) 2 Hence, if we let then we have Furthermore, if we let y = x y 2 = 2 (x 2 + x 3 ) y 3 = 2 (x 2 x 3 ) x t Ax = y 2 + y 2 2 y Q = and defined P = Q, then Hence, p =, q = 2 and P t AP =. sig(b A ) =. 3.3 Euclidean spaces Throughout this section V will be a finite dimensional R-vector space and K = R. Definition Let B Bil R (V ) be a symmetric bilinear form. We say that B is an inner product on V if B satisfies the following property: B(v, v) 0, for every v V, and B(v, v) = 0 v = 0 V. If B Bil K (V ) is an inner product on V then we will write u, v def = B(u, v). 99
Bilinear and quadratic forms
Bilinear and quadratic forms Zdeněk Dvořák April 8, 015 1 Bilinear forms Definition 1. Let V be a vector space over a field F. A function b : V V F is a bilinear form if b(u + v, w) = b(u, w) + b(v, w)
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationAlgebra II. Paulius Drungilas and Jonas Jankauskas
Algebra II Paulius Drungilas and Jonas Jankauskas Contents 1. Quadratic forms 3 What is quadratic form? 3 Change of variables. 3 Equivalence of quadratic forms. 4 Canonical form. 4 Normal form. 7 Positive
More information(VII.B) Bilinear Forms
(VII.B) Bilinear Forms There are two standard generalizations of the dot product on R n to arbitrary vector spaces. The idea is to have a product that takes two vectors to a scalar. Bilinear forms are
More information1.8 Dual Spaces (non-examinable)
2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationx i e i ) + Q(x n e n ) + ( i<n c ij x i x j
Math 210A. Quadratic spaces over R 1. Algebraic preliminaries Let V be a finite free module over a nonzero commutative ring F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v)
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
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 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24, Bilinear forms
MATH 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24,2015 M. J. HOPKINS 1.1. Bilinear forms and matrices. 1. Bilinear forms Definition 1.1. Suppose that F is a field and V is a vector space over F. bilinear
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More information5 Quiver Representations
5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )
More informationimplies that if we fix a basis v of V and let M and M be the associated invertible symmetric matrices computing, and, then M = (L L)M and the
Math 395. Geometric approach to signature For the amusement of the reader who knows a tiny bit about groups (enough to know the meaning of a transitive group action on a set), we now provide an alternative
More informationA PRIMER ON SESQUILINEAR FORMS
A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form
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 informationLinear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6D: 2-planes in R 4 The angle between a vector and a plane The angle between a vector v R n and a subspace V is the
More informationFinal Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson
Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson Name: TA Name and section: NO CALCULATORS, SHOW ALL WORK, NO OTHER PAPERS ON DESK. There is very little actual work to be done on this exam if
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 informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationWOMP 2001: LINEAR ALGEBRA. 1. Vector spaces
WOMP 2001: LINEAR ALGEBRA DAN GROSSMAN Reference Roman, S Advanced Linear Algebra, GTM #135 (Not very good) Let k be a field, eg, R, Q, C, F q, K(t), 1 Vector spaces Definition A vector space over k is
More informationQuadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.
Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric
More informationLINEAR ALGEBRA MICHAEL PENKAVA
LINEAR ALGEBRA MICHAEL PENKAVA 1. Linear Maps Definition 1.1. If V and W are vector spaces over the same field K, then a map λ : V W is called a linear map if it satisfies the two conditions below: (1)
More informationMath 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.
Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses
More information6.4 BASIS AND DIMENSION (Review) DEF 1 Vectors v 1, v 2,, v k in a vector space V are said to form a basis for V if. (a) v 1,, v k span V and
6.4 BASIS AND DIMENSION (Review) DEF 1 Vectors v 1, v 2,, v k in a vector space V are said to form a basis for V if (a) v 1,, v k span V and (b) v 1,, v k are linearly independent. HMHsueh 1 Natural Basis
More informationMath Linear Algebra
Math 220 - Linear Algebra (Summer 208) Solutions to Homework #7 Exercise 6..20 (a) TRUE. u v v u = 0 is equivalent to u v = v u. The latter identity is true due to the commutative property of the inner
More informationMAT 445/ INTRODUCTION TO REPRESENTATION THEORY
MAT 445/1196 - INTRODUCTION TO REPRESENTATION THEORY CHAPTER 1 Representation Theory of Groups - Algebraic Foundations 1.1 Basic definitions, Schur s Lemma 1.2 Tensor products 1.3 Unitary representations
More informationMath 113 Winter 2013 Prof. Church Midterm Solutions
Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis
More informationMATH 167: APPLIED LINEAR ALGEBRA Least-Squares
MATH 167: APPLIED LINEAR ALGEBRA Least-Squares October 30, 2014 Least Squares We do a series of experiments, collecting data. We wish to see patterns!! We expect the output b to be a linear function of
More informationOrthogonal Projection and Least Squares Prof. Philip Pennance 1 -Version: December 12, 2016
Orthogonal Projection and Least Squares Prof. Philip Pennance 1 -Version: December 12, 2016 1. Let V be a vector space. A linear transformation P : V V is called a projection if it is idempotent. That
More informationSupplementary Notes March 23, The subgroup Ω for orthogonal groups
The subgroup Ω for orthogonal groups 18.704 Supplementary Notes March 23, 2005 In the case of the linear group, it is shown in the text that P SL(n, F ) (that is, the group SL(n) of determinant one matrices,
More informationEpilogue: Quivers. Gabriel s Theorem
Epilogue: Quivers Gabriel s Theorem A figure consisting of several points connected by edges is called a graph. More precisely, a graph is a purely combinatorial object, which is considered given, if a
More informationGeneralized eigenspaces
Generalized eigenspaces November 30, 2012 Contents 1 Introduction 1 2 Polynomials 2 3 Calculating the characteristic polynomial 5 4 Projections 7 5 Generalized eigenvalues 10 6 Eigenpolynomials 15 1 Introduction
More informationMath 550 Notes. Chapter 2. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010
Math 550 Notes Chapter 2 Jesse Crawford Department of Mathematics Tarleton State University Fall 2010 (Tarleton State University) Math 550 Chapter 2 Fall 2010 1 / 20 Linear algebra deals with finite dimensional
More informationv = v 1 2 +v 2 2. Two successive applications of this idea give the length of the vector v R 3 :
Length, Angle and the Inner Product The length (or norm) of a vector v R 2 (viewed as connecting the origin to a point (v 1,v 2 )) is easily determined by the Pythagorean Theorem and is denoted v : v =
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam January 23, 2015
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra PhD Preliminary Exam January 23, 2015 Name: Exam Rules: This exam lasts 4 hours and consists of
More informationBILINEAR FORMS KEITH CONRAD
BILINEAR FORMS KEITH CONRAD The geometry of R n is controlled algebraically by the dot product. We will abstract the dot product on R n to a bilinear form on a vector space and study algebraic and geometric
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 information1 Positive definiteness and semidefiniteness
Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +
More information4. Symmetric and Alternating Products We want to introduce some variations on the theme of tensor products.
4. Symmetric and Alternating Products We want to introduce some variations on the theme of tensor products. The idea is that one can require a bilinear map to be either symmetric or alternating. Definition
More informationAlgebra Workshops 10 and 11
Algebra Workshops 1 and 11 Suggestion: For Workshop 1 please do questions 2,3 and 14. For the other questions, it s best to wait till the material is covered in lectures. Bilinear and Quadratic Forms on
More information30 Surfaces and nondegenerate symmetric bilinear forms
80 CHAPTER 3. COHOMOLOGY AND DUALITY This calculation is useful! Corollary 29.4. Let p, q > 0. Any map S p+q S p S q induces the zero map in H p+q ( ). Proof. Let f : S p+q S p S q be such a map. It induces
More informationHomework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.
Math 5327 Fall 2018 Homework 7 1. For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable. 3 1 0 (a) A = 1 2 0 1 1 0 x 3 1 0 Solution: 1 x 2 0
More informationLinear and Bilinear Algebra (2WF04) Jan Draisma
Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 3 The minimal polynomial and nilpotent maps 3.1. Minimal polynomial Throughout this chapter, V is a finite-dimensional vector space of dimension
More informationMath 413/513 Chapter 6 (from Friedberg, Insel, & Spence)
Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector
More informationEXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)
EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily
More informationNumerical Linear Algebra
University of Alabama at Birmingham Department of Mathematics Numerical Linear Algebra Lecture Notes for MA 660 (1997 2014) Dr Nikolai Chernov April 2014 Chapter 0 Review of Linear Algebra 0.1 Matrices
More informationChapter 7: Symmetric Matrices and Quadratic Forms
Chapter 7: Symmetric Matrices and Quadratic Forms (Last Updated: December, 06) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved
More informationEigenvectors. Prop-Defn
Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.
More informationRoots and Coefficients Polynomials Preliminary Maths Extension 1
Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p
More informationMath 344 Lecture # Linear Systems
Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear
More informationLECTURE 16: LIE GROUPS AND THEIR LIE ALGEBRAS. 1. Lie groups
LECTURE 16: LIE GROUPS AND THEIR LIE ALGEBRAS 1. Lie groups A Lie group is a special smooth manifold on which there is a group structure, and moreover, the two structures are compatible. Lie groups are
More informationSYLLABUS. 1 Linear maps and matrices
Dr. K. Bellová Mathematics 2 (10-PHY-BIPMA2) SYLLABUS 1 Linear maps and matrices Operations with linear maps. Prop 1.1.1: 1) sum, scalar multiple, composition of linear maps are linear maps; 2) L(U, V
More informationβ : V V k, (x, y) x yφ
CLASSICAL GROUPS 21 6. Forms and polar spaces In this section V is a vector space over a field k. 6.1. Sesquilinear forms. A sesquilinear form on V is a function β : V V k for which there exists σ Aut(k)
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationMTH5102 Spring 2017 HW Assignment 3: Sec. 1.5, #2(e), 9, 15, 20; Sec. 1.6, #7, 13, 29 The due date for this assignment is 2/01/17.
MTH5102 Spring 2017 HW Assignment 3: Sec. 1.5, #2(e), 9, 15, 20; Sec. 1.6, #7, 13, 29 The due date for this assignment is 2/01/17. Sec. 1.5, #2(e). Determine whether the following sets are linearly dependent
More informationLinear algebra 2. Yoav Zemel. March 1, 2012
Linear algebra 2 Yoav Zemel March 1, 2012 These notes were written by Yoav Zemel. The lecturer, Shmuel Berger, should not be held responsible for any mistake. Any comments are welcome at zamsh7@gmail.com.
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationEXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants
EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. Determinants Ex... Let A = 0 4 4 2 0 and B = 0 3 0. (a) Compute 0 0 0 0 A. (b) Compute det(2a 2 B), det(4a + B), det(2(a 3 B 2 )). 0 t Ex..2. For
More informationHomework 11 Solutions. Math 110, Fall 2013.
Homework 11 Solutions Math 110, Fall 2013 1 a) Suppose that T were self-adjoint Then, the Spectral Theorem tells us that there would exist an orthonormal basis of P 2 (R), (p 1, p 2, p 3 ), consisting
More informationLECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK)
LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK) In this lecture, F is a fixed field. One can assume F = R or C. 1. More about the spanning set 1.1. Let S = { v 1, v n } be n vectors in V, we have defined
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
More informationWe showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true.
Dimension We showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true. Lemma If a vector space V has a basis B containing n vectors, then any set containing more
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationChapter 4 Euclid Space
Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,
More informationLinear and Bilinear Algebra (2WF04) Jan Draisma
Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 10 Symmetric bilinear forms We already know what a bilinear form β on a K-vector space V is: it is a function β : V V K that satisfies β(u + v,
More informationA 2 G 2 A 1 A 1. (3) A double edge pointing from α i to α j if α i, α j are not perpendicular and α i 2 = 2 α j 2
46 MATH 223A NOTES 2011 LIE ALGEBRAS 11. Classification of semisimple Lie algebras I will explain how the Cartan matrix and Dynkin diagrams describe root systems. Then I will go through the classification
More informationLecture 11 The Radical and Semisimple Lie Algebras
18.745 Introduction to Lie Algebras October 14, 2010 Lecture 11 The Radical and Semisimple Lie Algebras Prof. Victor Kac Scribe: Scott Kovach and Qinxuan Pan Exercise 11.1. Let g be a Lie algebra. Then
More informationISOMETRIES AND THE LINEAR ALGEBRA OF QUADRATIC FORMS.
ISOMETRIES AND THE LINEAR ALGEBRA OF QUADRATIC FORMS. Please review basic linear algebra, specifically the notion of spanning, of being linearly independent and of forming a basis as applied to a finite
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 informationThe converse is clear, since
14. The minimal polynomial For an example of a matrix which cannot be diagonalised, consider the matrix ( ) 0 1 A =. 0 0 The characteristic polynomial is λ 2 = 0 so that the only eigenvalue is λ = 0. The
More informationComponents and change of basis
Math 20F Linear Algebra Lecture 16 1 Components and change of basis Slide 1 Review: Isomorphism Review: Components in a basis Unique representation in a basis Change of basis Review: Isomorphism Definition
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 informationLecture 19: Isometries, Positive operators, Polar and singular value decompositions; Unitary matrices and classical groups; Previews (1)
Lecture 19: Isometries, Positive operators, Polar and singular value decompositions; Unitary matrices and classical groups; Previews (1) Travis Schedler Thurs, Nov 18, 2010 (version: Wed, Nov 17, 2:15
More informationDeterminants. Beifang Chen
Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,
More informationNOTES ON BILINEAR FORMS
NOTES ON BILINEAR FORMS PARAMESWARAN SANKARAN These notes are intended as a supplement to the talk given by the author at the IMSc Outreach Programme Enriching Collegiate Education-2015. Symmetric bilinear
More informationMath 24 Spring 2012 Questions (mostly) from the Textbook
Math 24 Spring 2012 Questions (mostly) from the Textbook 1. TRUE OR FALSE? (a) The zero vector space has no basis. (F) (b) Every vector space that is generated by a finite set has a basis. (c) Every vector
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 2.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 2. 2. More examples. Ideals. Direct products. 2.1. More examples. 2.1.1. Let k = R, L = R 3. Define [x, y] = x y the cross-product. Recall that the latter is defined
More informationThe geometry of projective space
Chapter 1 The geometry of projective space 1.1 Projective spaces Definition. A vector subspace of a vector space V is a non-empty subset U V which is closed under addition and scalar multiplication. In
More informationUC Berkeley Summer Undergraduate Research Program 2015 July 9 Lecture
UC Berkeley Summer Undergraduate Research Program 205 July 9 Lecture We will introduce the basic structure and representation theory of the symplectic group Sp(V ). Basics Fix a nondegenerate, alternating
More information4.6 Bases and Dimension
46 Bases and Dimension 281 40 (a) Show that {1,x,x 2,x 3 } is linearly independent on every interval (b) If f k (x) = x k for k = 0, 1,,n, show that {f 0,f 1,,f n } is linearly independent on every interval
More informationSymmetric and self-adjoint matrices
Symmetric and self-adjoint matrices A matrix A in M n (F) is called symmetric if A T = A, ie A ij = A ji for each i, j; and self-adjoint if A = A, ie A ij = A ji or each i, j Note for A in M n (R) that
More informationClassication of Quadratic Forms
Classication of Quadratic Forms Manuel Araújo September 14, 2011 Abstract We present the classication of quadratic forms over the rationals and then describe a partial classication of quadratic forms over
More informationOptimization Theory. Linear Operators and Adjoints
Optimization Theory Linear Operators and Adjoints A transformation T. : X Y y Linear Operators y T( x), x X, yy is the image of x under T The domain of T on which T can be defined : D X The range of T
More informationLinear Algebra Lecture Notes-II
Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered
More informationYelena Yasinnik Notes for Lecture of March 4, 2004
HYPERBOLIC PLANES AND WITT S CANCELLATION THEOREM Yelena Yasinnik Notes for Lecture of March 4, 2004 In this lecture, we will be introduce hyperbolic planes and prove a couple of results
More informationCartan s Criteria. Math 649, Dan Barbasch. February 26
Cartan s Criteria Math 649, 2013 Dan Barbasch February 26 Cartan s Criteria REFERENCES: Humphreys, I.2 and I.3. Definition The Cartan-Killing form of a Lie algebra is the bilinear form B(x, y) := Tr(ad
More informationMath113: Linear Algebra. Beifang Chen
Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary
More informationLECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
LECTURE VII: THE JORDAN CANONICAL FORM MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue
More informationA Field Extension as a Vector Space
Chapter 8 A Field Extension as a Vector Space In this chapter, we take a closer look at a finite extension from the point of view that is a vector space over. It is clear, for instance, that any is a linear
More informationHere each term has degree 2 (the sum of exponents is 2 for all summands). A quadratic form of three variables looks as
Reading [SB], Ch. 16.1-16.3, p. 375-393 1 Quadratic Forms A quadratic function f : R R has the form f(x) = a x. Generalization of this notion to two variables is the quadratic form Q(x 1, x ) = a 11 x
More informationClifford Analysis, Homework 1
Clifford Analysis, Homework 1 November 1, 017 1 Let w v 1... v k, for vectors v j. Show that ŵ is the result of negating the vectors: ŵ ( v 1 )... ( v k ). Show that w is the result of changing the order
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
More informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationTypical Problem: Compute.
Math 2040 Chapter 6 Orhtogonality and Least Squares 6.1 and some of 6.7: Inner Product, Length and Orthogonality. Definition: If x, y R n, then x y = x 1 y 1 +... + x n y n is the dot product of x and
More informationResolution of Singularities I
Resolution of Singularities I The Blow-Up Operation Will Pazner February 12, 2010 1. Set up. k := field of characteristic 0 Defn. Algebraic variety k n X := zeros of f 1,..., f k Pol Defn. Multiplicity
More information