y 2 . = x 1y 1 + x 2 y x + + x n y n 2 7 = 1(2) + 3(7) 5(4) = 3. x x = x x x2 n.
|
|
- Rosamond Campbell
- 5 years ago
- Views:
Transcription
1 6.. Length, Angle, and Orthogonality In this section, we discuss the defintion of length and angle for vectors and define what it means for two vectors to be orthogonal. Then, we see that linear systems are much easier to solve if their set of vectors is orthogonal. We begin by defining the dot product, which has already shown up on defining matrix-vector and matrix-matrix multiplication. Definition 6... The dot product of two vectors x, y R n is given by For example, x y x x y =. y. = x y + x y x + + x n y n x n y n In addition, the dot product has the following properties. Proposition 6... Given x, y, z R n and a scalar c, (i) x y = y x, (ii) x x (iii) x x = if and only if x =, (iv) x (c y) = (c x) y = c( x y), (v) ( x + y) z = x z + y z, (vi) x ( y + z) = x y + x z Proof. Problem. 7 = () + (7) () =. Definition 6... The length of a vector x R n is given by x = x x = x + x + + x n. We leave it to the reader to show that Definition 6.. of length agrees with the notion of length from geometry, Problem. Note that Definition 6.. can also be written as () Here are some properties of the length function. x = x x. Proposition 6... Given any x, y R n and scalar c, (i) x. (ii) x = if and only if x = (iii) c x = c x (iv) x + y + x y = ( x + y ), called the Parallelogram Law. Proof. Problem. In addition, the length and dot product have another important relationship called the Cauchy-Scwarz Inequality, which tells us how big the dot product between two vectors can be in terms of their length. It is quite important in more advanced mathematics and other applications. In addition, the triangle inequality tells us that going from point A directly to point B is always at least as short as going from A to C to B. Various forms of the triangle inequality appear all over mathematics. Theorem 6.. (Cauchy-Schwarz Inequality). For all x, y R n, x y x y.
2 Proof. Problem and 6. Proposition 6..6 (Triangle Inequality). For all x, y R n, Proof. Problem 8. x + y x + y. Definition A vector x R n is a unit vector if x =. The set of all vectors in R n represents the set of all magnitudes and directions, while the set of unit vectors in R n represents the set of directions in R n since magnitude is taken out of the equation by restricting to unit length. Definition The angle between two nonzero vectors x, y R n is given by ( ) x y ( x, y) = cos. x y Again, we should check that Definition 6..8 agrees with the notion of angle from geometry. Consider nonzero x, y R n. Then, x, y and y x form a possibly degenerate triangle in span( x, y). The angle between x and y refers to the angle in this triangle between x and y. That way, ( x, y) π. Note that whether this angle is directed from x to y or x to y counterclockwise depends on x and y. We visualize this within the or dimensional subspace span( x, y) below: y x x ( x, y) y Now, by the Law of Cosines, y x = y + x x y cos( ( x, y)). Using () and properties of the dot product in Proposition 6.., ( y x) ( y x) = y y + x x x y cos( ( x, y)) y y ( x y) + x x = y y + x x x y cos( ( x, y)) ( x y) = x y cos( ( x, y)) cos( ( x, y)) = x y x y ( x, y) = cos ( x y x y Thus, the definition of angle agrees with our geometric definition of angle. We are particularly interested in when nonzero two vectors are orthogonal/perpendicular, which is when their angle is π. We have ( x, y) = π ( ) x y cos = π x y = x y =. x y x y This means the following definition agrees with our geometric notion as well. Definition Two vectors x, y R n are orthogonal, denoted x y, if x y =. The Pythagorean Theorem generalizes to vectors as follows: Proposition 6... If x, y R n are orthogonal, then ). x + y} = x + y
3 We extend the notion of orthogonality to finite lists of vectors by requiring that each pair of vectors in that set be orthogonal. Definition 6... A list ( u,..., u k ) of vectors in R n is orthogonal if each vector is nonzero, and u i u j = for all i j. Also, ( u,..., u k ) is orthonormal if in addition all of the vectors are unit vectors, so { if i = j u i u j = if i j. The canonical example of an orthonormal set is the set of standard basis vectors in R n, ( e,..., e n ). We have { if i = j e i e j = if i j. which we let the reader verify, Problem. Here are some other examples of orthogonal lists of vectors:,,,,,,,,, Even one pair of vectors not being orthogonal forces the whole set to not be orthogonal. For example,,,, is not orthogonal because and are not orthogonal, but every other pair is. Although is orthogonal to every vector, we exclude from orthogonal lists for reasons that will be clear later. Why do we care about orthogonal sets of vectors? They have applications to physics, differential equations, and other areas of advanced mathematics. But for this class, they make linear systems easy to solve, and they will play an important role in constructing orthogonal projections and orthogonal linear maps (Sections 6. and 6.). If a linear system uses an orthogonal set of vectors, we can simply our computations by a lot. It is then an immediate consequence that orthogonal subsets of R n are linearly independent. Proposition 6... Suppose ( u,..., u k ) R n is orthogonal, and x R n. Then, c u + + c k u k = x has at most one solution. Moreover, if it has a solution, that solution is c j = x u j, for all j. u j Proof. Suppose that c,..., c k satisfy c u + + c k u k = x In order to use that ( u,..., u k ) is orthogonal, we have to get the dot products u i u j involved somehow. We can do that simply by taking the dot product of both sides with u j. Then, for all j, using the properties of
4 the dot product and that ( u,..., u k ) is orthogonal, (c u + + c j u j + + c k u k ) u j = x v j (c u ) u j + + (c j u j ) u j + + (c k u k ) u j = x u j c ( u u j ) + + c j ( u j u j ) + + c k ( u k u j ) = x u j c () + + c j ( u j ) + + c k () = x u j c j ( u j ) = x u j c j = x u j u j. We can divide by u j because u j since u j. This is part of why we assumed the vectors were nonzero in definition of orthogonality. Since we started with an arbitrary solution and found only possibility, this is the only solution if there is one. Corollary 6... Any orthogonal list of vectors in R n is linearly independent. Proof. Let ( u,..., u k ) R n be orthogonal. By Proposition 6.., the linear system c u + + c k u k =. has at most one solution, which can only be the trivial solution. Hence, ( u,..., u k ) is linearly independent. Example 6... Solve the following linear systems. (a) (b) Solutions: x + x + x = 6, x + x + x =. (a) Notice that,, is orthogonal. By Proposition 6.., if (a) has a solution, it is c = =, c = =, c = = 7 Note we do not know that this is a solution yet. This is just the only possible solution if there is one. So, let us check if it is: + 7 = 6. Yes, it is a solution. Thus, c =, c =, c = 7 is the only solution to (a).
5 (b) Notice that,, is orthogonal. By Proposition 6.., if (b) has a solution, it is c = = =, c = = = 6, c = = = Again, all we know is that this is the only solution if there is one. So, let us check if it is: = / / / 7/ No, it is not. Thus, (b) has no solution. Exercises:. Determine if the following lists are orthogonal. (a) ([ ], [ ]) (b) ([ ], [ ]) (c),, (d),, 7 8. Add vectors to the following sets to make orthogonal bases for R n, with the appropriate n, if possible. If it is not possible, why not? (a) ([ ]) (b), (c), (d),
6 6 (e). Solve the following linear systems using Proposition 6... (a) x [ ] [ ] [ 7 + x = ] (b) (c) (d) (e) x x x x + x = 7 + x = x + x + x + x 7 = = Problems:. () Prove the properties of the dot product in Proposition () Use the Pythagorean Theorem to show that Definition 6.. agrees with the notion of length from geometry.. () Prove the properties of length in Proposition 6... ( ) u. () Show that if ( u,..., u k ) is orthogonal, then u,..., u k u k is orthonormal.. () Show that ( e,..., e n ) is orthonormal list in R n. 6. () Show that for any y R n, T : R n R given by T ( x) = x y is a linear map, and that any linear map T : R n R is of this form. 7. (+) Show that any linear map T : R n R m is of the form x u T ( x) =. x u m for some u,..., u m R n. 8. () Suppose that ( u,..., u k ) and ( v,..., v m ) satisfy u i v j for all i and j. Show that any linear combination of ( u,..., u k ) is orthogonal to any linear combination of ( v,..., v k ).
7 9. () Suppose that ( u,..., u k ) and ( v,..., v m ) are orthogonal and satisfy u i v j for all i and j. Show that ( u,..., u k, v,..., v m ) is orthogonal.. () Show that if ( u,..., u n ) is an orthonormal basis for R n, then for all x R n, x = ( x u ) u + + ( x u n ) u n 7. () Show that for all x, y R n,. () Prove Proposition 6... x y = x + y x y.. (+) Show that if ( u,..., u k ) is orthogonal, then u + + u k = u + + u k.. (+) Show that if ( u,..., u k ) is orthonormal and c,..., c k are scalars, then. Prove Theorem 6.. using Definition c u + + c n u k = c + + c k. 6. The goal of this problem is to give another proof of Theorem 6... Fix x, y R n, and consider the function f : R R given by f(c) = x c y. (a) () Find the minimum value of f and where it occurs. (b) () Deduce that x y x y. 7. () Show that for any orthogonal list ( u,..., u k ) in R n with k < n, there exists u k+ R n so that ( u,..., u k, u k+ ) is orthogonal. 8. (+) Prove Proposition () Show that for all u,..., u k R n, and scalars c,..., c k, c u + + c k u k c u + + c k u k.. () Show that for all x, y R n, x y x y.. Suppose T : R n R n is linear and diagonalizable with nonnegative eigenvalues λ, λ,..., λ n and corresponding eigenbasis ( v,..., v n ), so that λ λ λ n. (a) () If ( v,..., v n ) is orthogonal, show that for all x R n, λ x T ( x) λ n x. (b) () Does either inequality in (a) need to hold if ( v,..., v n ) is not orthogonal? Why or why not?. Suppose L : R n R satisfies the properties in Proposition 6... L need not coincide with the length function from this section! Then, define x, y = L( x + y) L( x y). Show that the following hold for all x, y, z R n : (i) () x, x = L( x). (ii) () x, y = y, x. (iii) () x, y = x, y.
8 8 (iv) () x + y, z = x, z + y, z. (v) () n x, y = n x, y for all positive integers n. (vi) (+) r x, y = r x, y for all rational scalars r, where r = a b for some integers a, b. (vii) () (Requires a bit of Real Analysis) c x, y = c x, y for all scalars c.
y 1 y 2 . = x 1y 1 + x 2 y x + + x n y n y n 2 7 = 1(2) + 3(7) 5(4) = 4.
. Length, Angle, and Orthogonality In this section, we discuss the defintion of length and angle for vectors. We also define what it means for two vectors to be orthogonal. Then we see that linear systems
More informationDot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.
Dot Products K. Behrend April 3, 008 Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Contents The dot product 3. Length of a vector........................
More informationProjection Theorem 1
Projection Theorem 1 Cauchy-Schwarz Inequality Lemma. (Cauchy-Schwarz Inequality) For all x, y in an inner product space, [ xy, ] x y. Equality holds if and only if x y or y θ. Proof. If y θ, the inequality
More informationInner Product Spaces
Inner Product Spaces Introduction Recall in the lecture on vector spaces that geometric vectors (i.e. vectors in two and three-dimensional Cartesian space have the properties of addition, subtraction,
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
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 informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationVector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis.
Vector spaces DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Vector space Consists of: A set V A scalar
More informationMath 24 Spring 2012 Sample Homework Solutions Week 8
Math 4 Spring Sample Homework Solutions Week 8 Section 5. (.) Test A M (R) for diagonalizability, and if possible find an invertible matrix Q and a diagonal matrix D such that Q AQ = D. ( ) 4 (c) A =.
More informationCHAPTER II HILBERT SPACES
CHAPTER II HILBERT SPACES 2.1 Geometry of Hilbert Spaces Definition 2.1.1. Let X be a complex linear space. An inner product on X is a function, : X X C which satisfies the following axioms : 1. y, x =
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationExercise Sheet 1.
Exercise Sheet 1 You can download my lecture and exercise sheets at the address http://sami.hust.edu.vn/giang-vien/?name=huynt 1) Let A, B be sets. What does the statement "A is not a subset of B " mean?
More information7.1 Projections and Components
7. Projections and Components As we have seen, the dot product of two vectors tells us the cosine of the angle between them. So far, we have only used this to find the angle between two vectors, but cosines
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationLinear Algebra I. Ronald van Luijk, 2015
Linear Algebra I Ronald van Luijk, 2015 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents Dependencies among sections 3 Chapter 1. Euclidean space: lines and hyperplanes 5 1.1. Definition
More informationMIDTERM I LINEAR ALGEBRA. Friday February 16, Name PRACTICE EXAM SOLUTIONS
MIDTERM I LIEAR ALGEBRA MATH 215 Friday February 16, 2018. ame PRACTICE EXAM SOLUTIOS Please answer the all of the questions, and show your work. You must explain your answers to get credit. You will be
More informationON GENERALIZED n-inner PRODUCT SPACES
Novi Sad J Math Vol 41, No 2, 2011, 73-80 ON GENERALIZED n-inner PRODUCT SPACES Renu Chugh 1, Sushma Lather 2 Abstract The primary purpose of this paper is to derive a generalized (n k) inner product with
More informationx n -2.5 Definition A list is a list of objects, where multiplicity is allowed, and order matters. For example, as lists
Vectors, Linear Combinations, and Matrix-Vector Mulitiplication In this section, we introduce vectors, linear combinations, and matrix-vector multiplication The rest of the class will involve vectors,
More informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
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 informationMTH 2310, FALL Introduction
MTH 2310, FALL 2011 SECTION 6.2: ORTHOGONAL SETS Homework Problems: 1, 5, 9, 13, 17, 21, 23 1, 27, 29, 35 1. Introduction We have discussed previously the benefits of having a set of vectors that is linearly
More informationHILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define
HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,
More informationInner products. Theorem (basic properties): Given vectors u, v, w in an inner product space V, and a scalar k, the following properties hold:
Inner products Definition: An inner product on a real vector space V is an operation (function) that assigns to each pair of vectors ( u, v) in V a scalar u, v satisfying the following axioms: 1. u, v
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More information22m:033 Notes: 6.1 Inner Product, Length and Orthogonality
m:033 Notes: 6. Inner Product, Length and Orthogonality Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman April, 00 The inner product Arithmetic is based on addition and
More informationLinear Equations and Vectors
Chapter Linear Equations and Vectors Linear Algebra, Fall 6 Matrices and Systems of Linear Equations Figure. Linear Algebra, Fall 6 Figure. Linear Algebra, Fall 6 Figure. Linear Algebra, Fall 6 Unique
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 informationChapter 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
More informationThis pre-publication material is for review purposes only. Any typographical or technical errors will be corrected prior to publication.
This pre-publication material is for review purposes only. Any typographical or technical errors will be corrected prior to publication. Copyright Pearson Canada Inc. All rights reserved. Copyright Pearson
More informationORTHOGONALITY AND LEAST-SQUARES [CHAP. 6]
ORTHOGONALITY AND LEAST-SQUARES [CHAP. 6] Inner products and Norms Inner product or dot product of 2 vectors u and v in R n : u.v = u 1 v 1 + u 2 v 2 + + u n v n Calculate u.v when u = 1 2 2 0 v = 1 0
More informationFourier and Wavelet Signal Processing
Ecole Polytechnique Federale de Lausanne (EPFL) Audio-Visual Communications Laboratory (LCAV) Fourier and Wavelet Signal Processing Martin Vetterli Amina Chebira, Ali Hormati Spring 2011 2/25/2011 1 Outline
More informationMTHSC 3190 Section 2.9 Sets a first look
MTHSC 3190 Section 2.9 Sets a first look Definition A set is a repetition free unordered collection of objects called elements. Definition A set is a repetition free unordered collection of objects called
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationSection 7.5 Inner Product Spaces
Section 7.5 Inner Product Spaces With the dot product defined in Chapter 6, we were able to study the following properties of vectors in R n. ) Length or norm of a vector u. ( u = p u u ) 2) Distance of
More informationOctober 25, 2013 INNER PRODUCT SPACES
October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal
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 informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
More informationWorksheet for Lecture 25 Section 6.4 Gram-Schmidt Process
Worksheet for Lecture Name: Section.4 Gram-Schmidt Process Goal For a subspace W = Span{v,..., v n }, we want to find an orthonormal basis of W. Example Let W = Span{x, x } with x = and x =. Give an orthogonal
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 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 information2. Review of Linear Algebra
2. Review of Linear Algebra ECE 83, Spring 217 In this course we will represent signals as vectors and operators (e.g., filters, transforms, etc) as matrices. This lecture reviews basic concepts from linear
More informationwhich has a check digit of 9. This is consistent with the first nine digits of the ISBN, since
vector Then the check digit c is computed using the following procedure: 1. Form the dot product. 2. Divide by 11, thereby producing a remainder c that is an integer between 0 and 10, inclusive. The check
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More informationDefinition Suppose S R n, V R m are subspaces. A map U : S V is linear if
.6. Restriction of Linear Maps In this section, we restrict linear maps to subspaces. We observe that the notion of linearity still makes sense for maps whose domain and codomain are subspaces of R n,
More informationMTH 2032 SemesterII
MTH 202 SemesterII 2010-11 Linear Algebra Worked Examples Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2011 ii Contents Table of Contents
More informationTopic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C
Topic 1 Quiz 1 text A reduced row-echelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correct-choice may have 0, 1, 2, or 3 choice may have 0,
More informationOrthogonality and Least Squares
6 Orthogonality and Least Squares 6.1 INNER PRODUCT, LENGTH, AND ORTHOGONALITY INNER PRODUCT If u and v are vectors in, then we regard u and v as matrices. n 1 n The transpose u T is a 1 n matrix, and
More informationProf. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India
CHAPTER 9 BY Prof. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India E-mail : mantusaha.bu@gmail.com Introduction and Objectives In the preceding chapters, we discussed normed
More informationFunctional Analysis MATH and MATH M6202
Functional Analysis MATH 36202 and MATH M6202 1 Inner Product Spaces and Normed Spaces Inner Product Spaces Functional analysis involves studying vector spaces where we additionally have the notion of
More informationThe Transpose of a Vector
8 CHAPTER Vectors The Transpose of a Vector We now consider the transpose of a vector in R n, which is a row vector. For a vector u 1 u. u n the transpose is denoted by u T = [ u 1 u u n ] EXAMPLE -5 Find
More information22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices
m:33 Notes: 7. Diagonalization of Symmetric Matrices Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman May 3, Symmetric matrices Definition. A symmetric matrix is a matrix
More informationINNER PRODUCTS ON n-inner PRODUCT SPACES
SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp. 389-398, October 2002 INNER PRODUCTS ON n-inner PRODUCT SPACES BY HENDRA GUNAWAN Abstract. In this note, we show that in any n-inner product space with
More information3 Scalar Product. 3.0 The Dot Product. ~v ~w := v 1 w 1 + v 2 w v n w n.
3 Scalar Product Copyright 2017, Gregory G. Smith 28 September 2017 Although vector products on R n are rare, every coordinate space R n is equipped with a binary operation that sends two vectors to a
More informationwhich are not all zero. The proof in the case where some vector other than combination of the other vectors in S is similar.
It follows that S is linearly dependent since the equation is satisfied by which are not all zero. The proof in the case where some vector other than combination of the other vectors in S is similar. is
More informationWe wish the reader success in future encounters with the concepts of linear algebra.
Afterword Our path through linear algebra has emphasized spaces of vectors in dimension 2, 3, and 4 as a means of introducing concepts which go forward to IRn for arbitrary n. But linear algebra does not
More informationCambridge University Press The Mathematics of Signal Processing Steven B. Damelin and Willard Miller Excerpt More information
Introduction Consider a linear system y = Φx where Φ can be taken as an m n matrix acting on Euclidean space or more generally, a linear operator on a Hilbert space. We call the vector x a signal or input,
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationVector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.
Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +
More informationSystems of Linear Equations
Systems of Linear Equations Math 108A: August 21, 2008 John Douglas Moore Our goal in these notes is to explain a few facts regarding linear systems of equations not included in the first few chapters
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationMathematics Department Stanford University Math 61CM/DM Inner products
Mathematics Department Stanford University Math 61CM/DM Inner products Recall the definition of an inner product space; see Appendix A.8 of the textbook. Definition 1 An inner product space V is a vector
More informationLINEAR ALGEBRA: THEORY. Version: August 12,
LINEAR ALGEBRA: THEORY. Version: August 12, 2000 13 2 Basic concepts We will assume that the following concepts are known: Vector, column vector, row vector, transpose. Recall that x is a column vector,
More information1.2 LECTURE 2. Scalar Product
6 CHAPTER 1. VECTOR ALGEBRA Pythagean theem. cos 2 α 1 + cos 2 α 2 + cos 2 α 3 = 1 There is a one-to-one crespondence between the components of the vect on the one side and its magnitude and the direction
More informationx 1 + 2x 2 + 3x 3 = 0 x 1 + 2x 2 + 3x 3 = 0, x 2 + x 3 = 0 x 3 3 x 3 1
. Orthogonal Complements and Projections In this section we discuss orthogonal complements and orthogonal projections. The orthogonal complement of a subspace S is the complement that is orthogonal to
More informationHomework 2. Solutions T =
Homework. s Let {e x, e y, e z } be an orthonormal basis in E. Consider the following ordered triples: a) {e x, e x + e y, 5e z }, b) {e y, e x, 5e z }, c) {e y, e x, e z }, d) {e y, e x, 5e z }, e) {
More informationPart 1a: Inner product, Orthogonality, Vector/Matrix norm
Part 1a: Inner product, Orthogonality, Vector/Matrix norm September 19, 2018 Numerical Linear Algebra Part 1a September 19, 2018 1 / 16 1. Inner product on a linear space V over the number field F A map,
More informationNotes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.
Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where
More informationSUMMARY OF MATH 1600
SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You
More informationInner Product and Orthogonality
Inner Product and Orthogonality P. Sam Johnson October 3, 2014 P. Sam Johnson (NITK) Inner Product and Orthogonality October 3, 2014 1 / 37 Overview In the Euclidean space R 2 and R 3 there are two concepts,
More informationFamily Feud Review. Linear Algebra. October 22, 2013
Review Linear Algebra October 22, 2013 Question 1 Let A and B be matrices. If AB is a 4 7 matrix, then determine the dimensions of A and B if A has 19 columns. Answer 1 Answer A is a 4 19 matrix, while
More informationLinear Algebra. Alvin Lin. August December 2017
Linear Algebra Alvin Lin August 207 - December 207 Linear Algebra The study of linear algebra is about two basic things. We study vector spaces and structure preserving maps between vector spaces. A vector
More informationj=1 [We will show that the triangle inequality holds for each p-norm in Chapter 3 Section 6.] The 1-norm is A F = tr(a H A).
Math 344 Lecture #19 3.5 Normed Linear Spaces Definition 3.5.1. A seminorm on a vector space V over F is a map : V R that for all x, y V and for all α F satisfies (i) x 0 (positivity), (ii) αx = α x (scale
More information1. Foundations of Numerics from Advanced Mathematics. Linear Algebra
Foundations of Numerics from Advanced Mathematics Linear Algebra Linear Algebra, October 23, 22 Linear Algebra Mathematical Structures a mathematical structure consists of one or several sets and one or
More informationSpectral Theory, with an Introduction to Operator Means. William L. Green
Spectral Theory, with an Introduction to Operator Means William L. Green January 30, 2008 Contents Introduction............................... 1 Hilbert Space.............................. 4 Linear Maps
More informationAbstract & Applied Linear Algebra (Chapters 1-2) James A. Bernhard University of Puget Sound
Abstract & Applied Linear Algebra (Chapters 1-2) James A. Bernhard University of Puget Sound Copyright 2018 by James A. Bernhard Contents 1 Vector spaces 3 1.1 Definitions and basic properties.................
More informationSome Results in Generalized n-inner Product Spaces
International Mathematical Forum, 4, 2009, no. 21, 1013-1020 Some Results in Generalized n-inner Product Spaces Renu Chugh and Sushma 1 Department of Mathematics M.D. University, Rohtak - 124001, India
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationSIMPLE AND POSITIVE ROOTS
SIMPLE AND POSITIVE ROOTS JUHA VALKAMA MASSACHUSETTS INSTITUTE OF TECHNOLOGY Let V be a Euclidean space, i.e. a real finite dimensional linear space with a symmetric positive definite inner product,. We
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More information(, ) : R n R n R. 1. It is bilinear, meaning it s linear in each argument: that is
17 Inner products Up until now, we have only examined the properties of vectors and matrices in R n. But normally, when we think of R n, we re really thinking of n-dimensional Euclidean space - that is,
More informationhomogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45
address 12 adjoint matrix 118 alternating 112 alternating 203 angle 159 angle 33 angle 60 area 120 associative 180 augmented matrix 11 axes 5 Axiom of Choice 153 basis 178 basis 210 basis 74 basis test
More informationDefinitions and Properties of R N
Definitions and Properties of R N R N as a set As a set R n is simply the set of all ordered n-tuples (x 1,, x N ), called vectors. We usually denote the vector (x 1,, x N ), (y 1,, y N ), by x, y, or
More informationIntroduction to Signal Spaces
Introduction to Signal Spaces Selin Aviyente Department of Electrical and Computer Engineering Michigan State University January 12, 2010 Motivation Outline 1 Motivation 2 Vector Space 3 Inner Product
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 informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationINNER PRODUCT SPACE. Definition 1
INNER PRODUCT SPACE Definition 1 Suppose u, v and w are all vectors in vector space V and c is any scalar. An inner product space on the vectors space V is a function that associates with each pair of
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More informationSPACES: FROM ANALYSIS TO GEOMETRY AND BACK
SPACES: FROM ANALYSIS TO GEOMETRY AND BACK MASS 2011 LECTURE NOTES 1. Lecture 1 (8/22/11): Introduction There are many problems in analysis which involve constructing a function with desirable properties
More informationADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS
J. OPERATOR THEORY 44(2000), 243 254 c Copyright by Theta, 2000 ADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS DOUGLAS BRIDGES, FRED RICHMAN and PETER SCHUSTER Communicated by William B. Arveson Abstract.
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 informationInner product spaces. Layers of structure:
Inner product spaces Layers of structure: vector space normed linear space inner product space The abstract definition of an inner product, which we will see very shortly, is simple (and by itself is pretty
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 informationMA677 Assignment #3 Morgan Schreffler Due 09/19/12 Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1:
Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1: f + g p f p + g p. Proof. If f, g L p (R d ), then since f(x) + g(x) max {f(x), g(x)}, we have f(x) + g(x) p
More informationLinear Algebra. Session 12
Linear Algebra. Session 12 Dr. Marco A Roque Sol 08/01/2017 Example 12.1 Find the constant function that is the least squares fit to the following data x 0 1 2 3 f(x) 1 0 1 2 Solution c = 1 c = 0 f (x)
More informationChapter 2: Vector Geometry
Chapter 2: Vector Geometry Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 2: Vector Geometry Semester 1 2018 1 / 32 Goals of this chapter In this chapter, we will answer the following geometric
More informationVector Spaces. Addition : R n R n R n Scalar multiplication : R R n R n.
Vector Spaces Definition: The usual addition and scalar multiplication of n-tuples x = (x 1,..., x n ) R n (also called vectors) are the addition and scalar multiplication operations defined component-wise:
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More information