DOCSLIB.ORG

Overview Orthogonal Projection Orthonormal Bases

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Overview Orthogonal Projection Orthonormal Bases Overview Last time we discussed orthogonal projection. We’ll review this today before discussing the question of how to find an orthonormal basis for a given subspace. From Lay, §6.4 Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 1 / 24 Orthogonal projection Given a subspace W of Rn, you can write any vector y Rn as ∈ , y = yˆ + z = projW y + projW ⊥ y where yˆ W is the closest vector in W to y and z W . We call yˆ the ∈ ∈ ⊥ orthogonal projection of y onto W . Given an orthogonal basis u ,..., u for W , we have a formula to { 1 p} compute yˆ: y u y u yˆ = · 1 u + + · p u . u u 1 ··· u u p 1· 1 p· p If we also had an orthogonal basis u ,..., u for W , we could find z { p+1 n} ⊥ by projecting y onto W ⊥: y u y u z = · p+1 u + + · n u . u u p+1 ··· u u n p+1· p+1 n· n However, once we subtract off the projection of y to W , we’re left with z W . We’ll make heavy use of this observation today. ∈ ⊥ Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 2 / 24 Orthonormal bases In the case where we have an orthonormal basis u ,..., u for W , the { 1 p} computations are made even simpler: yˆ = (y u )u + (y u )u + + (y u )u . · 1 1 · 2 2 ··· · p p If = u ,..., u is an orthonormal basis for W and U is the matrix U { 1 p} whose columns are the ui, then UUT y = yˆ T U U = Ip Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 3 / 24 The Gram Schmidt Process The aim of this section is to find an orthogonal basis v ,..., v for a { 1 n} subspace W when we start with a basis x ,..., x that is not { 1 n} orthogonal. Start with v1 = x1. Now consider x2. If v1 and x2 are not orthogonal, we’ll modify x2 so that we get an orthogonal pair v1, v2 satisfying Span x , x = Span v , v . { 1 2} { 1 2} Then we modify x so get v satisfying v v = v v = 0 and 3 3 1 · 3 2 · 3 Span x , x , x = Span v , v , v . { 1 2 3} { 1 2 3} We continue this process until we’ve built a new orthogonal basis for W . Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 4 / 24 Example 1 1 2 Suppose that W = Span x , x where x = 1 and x = 2 . Find an { 1 2} 1 2 0 3 orthogonal basis v , v for W . { 1 2} To start the process we put v1 = x1. We then find 1 2 x v 4 yˆ = proj x = 2· 1 v = 1 = 2 . v1 2 v v 1 2 1· 1 0 0 Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 5 / 24 Now we define v = x yˆ; this is orthogonal to x = v : 2 2 − 1 1 2 2 0 x v v = x 2 · 1 v = x yˆ = 2 2 = 0 . 2 2 − v v 1 2 − − 1 · 1 3 0 3 So v2 is the component of x2 orthogonal to x1. Note that v2 is in W = Span x , x because it is a linear combination of v = x and x . { 1 2} 1 1 2 So we have that 1 0 v1 = 1 , v2 = 0 0 3 is an orthogonal basis forW . Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 6 / 24 Example 2 4 Suppose that x1, x2, x3 is a basis for a subspace W of R . Describe an { } orthogonal basis for W . As in the previous example, we put • x v v = x and v = x 2· 1 v . 1 1 2 2 − v v 1 1· 1 Then v , v is an orthogonal basis for W =Span x , x = Span v , v . { 1 2} 2 { 1 2} { 1 2} x v x v Now proj x = 3· 1 v + 3· 2 v and • W2 3 v v 1 v v 2 1· 1 2· 2 x v x v v = x proj x = x 3· 1 v 3· 2 v 3 3 − W2 3 3 − v v 1 − v v 2 1· 1 2· 2 is the component of x3 orthogonal to W2. Furthermore, v3 is in W because it is a linear combination of vectors in W . Thus we obtain that v , v , v is an orthogonal basis for W . • { 1 2 3} Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 7 / 24 Theorem (The Gram Schmidt Process) n Given a basis x1, x2,..., xp for a subspace W of R , define { } v = x 1 1 x v v = x 2· 1 v 2 2 − v v 1 1· 1 x3 v1 x3 v2 v3 = x3 · v1 · v2 − v1 v1 − v2 v2 . · · . xp v1 xp vp 1 vp = xp · v1 ... · − vp 1 − v1 v1 − − vp 1 vp 1 − · − · − Then v ,..., v is an orthogonal basis for W . Also { 1 p} Span v ,..., v = Span x ,..., x for 1 k p. { 1 k } { 1 k } ≤ ≤ Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 8 / 24 Example 3 The vectors 3 3 − x = 4 , x = 14 1 − 2 5 7 − form a basis for a subspace W . Use the Gram-Schmidt process to produce an orthogonal basis for W . Step 1 Put v1 = x1. Step 2 x v v = x 2· 1 v 2 2 − v v 1 1· 1 3 3 3 − ( 100) = 14 − 4 = 6 . − 50 − 7 5 3 − Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 9 / 24 Then v , v is an orthogonal basis for W . { 1 2} To construct an orthonormal basis for W we normalise the basis v , v : { 1 2} 3 1 1 u1 = v1 = 4 v1 √50 − k k 5 3 1 1 1 1 u2 = v2 = 6 = 2 v2 √54 √6 k k 3 1 Then u , u is an orthonormal basis for W . { 1 2} Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 10 / 24 Example 4 1 6 6 − 3 8 3 Let A = − . Use the Gram-Schmidt process to find an 1 2 6 − 1 4 3 − orthogonal basis for the column space of A. Let x1, x2, x3 be the three columns of A. 1 − 3 Step 1 Put v = x = . 1 1 1 1 Step 2 6 1 3 − x2 v1 8 ( 36) 3 1 v2 = x2 · v1 = − − = . − v1 v1 2 − 12 1 1 · − 4 1 1 − − Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 11 / 24 Step 3 x3 v1 x3 v2 v3 = x3 · v1 · v2 − v1 v1 − v2 v2 6 · 1 · 3 − 3 12 3 24 1 = 6 − 12 1 − 12 1 3 1 1 − 1 2 = − . 3 4 Thus an orthogonal basis for the column space of A is given by 1 3 1 − 3 1 2 , , − . 1 1 3 1 1 4 − Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 12 / 24 Example 5 The matrix A is given by 1 0 0 1 1 0 A = . 0 1 1 0 0 1 Use the Gram-Schmidt process to show that 1 1 1 − 1 1 1 , , − 0 2 1 0 0 3 is an orthogonal basis for Col A. Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 13 / 24 Let a1, a2, a3 be the three columns of A. 1 1 Step 1 Put v = a = . 1 1 0 0 Step 2 0 1 1/2 − a2 v1 1 1 1 1/2 v2 = a2 · v1 = = . − v1 v1 1 − 2 0 1 · 0 0 0 1 − 1 For convenience we take v = . (This is optional, but it makes v 2 2 2 0 easier to work with in the following calculation.) Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 14 / 24 Step 3 0 1 1/3 − a3 v1 a3 v2 0 2 1 1/3 v3 = a3 · v1 · v2 = 0 = − − v1 v1 − v2 v2 1 − − 6 2 1/3 · · 1 0 1 1 1 For convenience we take v = − . 3 1 3 Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 15 / 24 QR factorisation of matrices If an m n matrix A has linearly independent columns x ,..., x , then × 1 n A = QR for matrices Q is an m n matrix whose columns are an orthonormal basis for × Col(A), and R is an n n upper triangular invertible matrix. × This factorisation is used in computer algorithms for various computations. In fact, finding such a Q and R amounts to applying the Gram Schmidt process to the columns of A. (The proof that such a decomposition exists is given in the text.) Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 16 / 24 Example 6 Let 5 9 5/6 1/6 − 1 7 1/6 5/6 A = , Q = 3 5 3/6 1/6 − − − 1 5 1/6 3/6 where the columns of Q are obtained by applying the Gram-Schmidt process to the columns of A and then normalising the columns. Find R such that A = QR. As we have noted before, QT Q = I because the columns of Q are orthonormal. If we believe such an R exists, we have QT A = QT (QR) = (QT Q)R = IR = R. Therefore R = QT A. Dr Scott Morrison (ANU) MATH1014 Notes Second Semester 2015 17 / 24 In this case, R = QT A 5 9 5/6 1/6 3/6 1/6 1 7 = − " 1/6 5/6 1/6 3/6# 3 5 − − − 1 5 6 12 = "0 6 # An easy check shows that 5/6 1/6 5 9 − 1/6 5/6 6 12 1 7 QR = = = A.
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]
  • Orthonormal Bases in Hilbert Space APPM 5440 Fall 2017 Applied Analysis
    Orthonormal Bases in Hilbert Space APPM 5440 Fall 2017 Applied Analysis Stephen Becker November 18, 2017(v4); v1 Nov 17 2014 and v2 Jan 21 2016 Supplementary notes to our textbook (Hunter and Nachtergaele). These notes generally follow Kreyszig’s book. The reason for these notes is that this is a simpler treatment that is easier to follow; the simplicity is because we generally do not consider uncountable nets, but rather only sequences (which are countable). I have tried to identify the theorems from both books; theorems/lemmas with numbers like 3.3-7 are from Kreyszig. Note: there are two versions of these notes, with and without proofs. The version without proofs will be distributed to the class initially, and the version with proofs will be distributed later (after any potential homework assignments, since some of the proofs maybe assigned as homework). This version does not have proofs. 1 Basic Definitions NOTE: Kreyszig defines inner products to be linear in the first term, and conjugate linear in the second term, so hαx, yi = αhx, yi = hx, αy¯ i. In contrast, Hunter and Nachtergaele define the inner product to be linear in the second term, and conjugate linear in the first term, so hαx,¯ yi = αhx, yi = hx, αyi. We will follow the convention of Hunter and Nachtergaele, so I have re-written the theorems from Kreyszig accordingly whenever the order is important. Of course when working with the real field, order is completely unimportant. Let X be an inner product space. Then we can define a norm on X by kxk = phx, xi, x ∈ X.
    [Show full text]
  • Lecture 4: April 8, 2021 1 Orthogonality and Orthonormality
    Mathematical Toolkit Spring 2021 Lecture 4: April 8, 2021 Lecturer: Avrim Blum (notes based on notes from Madhur Tulsiani) 1 Orthogonality and orthonormality Definition 1.1 Two vectors u, v in an inner product space are said to be orthogonal if hu, vi = 0. A set of vectors S ⊆ V is said to consist of mutually orthogonal vectors if hu, vi = 0 for all u 6= v, u, v 2 S. A set of S ⊆ V is said to be orthonormal if hu, vi = 0 for all u 6= v, u, v 2 S and kuk = 1 for all u 2 S. Proposition 1.2 A set S ⊆ V n f0V g consisting of mutually orthogonal vectors is linearly inde- pendent. Proposition 1.3 (Gram-Schmidt orthogonalization) Given a finite set fv1,..., vng of linearly independent vectors, there exists a set of orthonormal vectors fw1,..., wng such that Span (fw1,..., wng) = Span (fv1,..., vng) . Proof: By induction. The case with one vector is trivial. Given the statement for k vectors and orthonormal fw1,..., wkg such that Span (fw1,..., wkg) = Span (fv1,..., vkg) , define k u + u = v − hw , v i · w and w = k 1 . k+1 k+1 ∑ i k+1 i k+1 k k i=1 uk+1 We can now check that the set fw1,..., wk+1g satisfies the required conditions. Unit length is clear, so let’s check orthogonality: k uk+1, wj = vk+1, wj − ∑ hwi, vk+1i · wi, wj = vk+1, wj − wj, vk+1 = 0. i=1 Corollary 1.4 Every finite dimensional inner product space has an orthonormal basis.
    [Show full text]
  • Ch 5: ORTHOGONALITY
    Ch 5: ORTHOGONALITY 5.5 Orthonormal Sets 1. a set fv1; v2; : : : ; vng is an orthogonal set if hvi; vji = 0, 81 ≤ i 6= j; ≤ n (note that orthogonality only makes sense in an inner product space since you need to inner product to check hvi; vji = 0. n For example fe1; e2; : : : ; eng is an orthogonal set in R . 2. fv1; v2; : : : ; vng is an orthogonal set =) v1; v2; : : : ; vn are linearly independent. 3. a set fv1; v2; : : : ; vng is an orthonormal set if hvi; vji = 0 and jjvijj = 1, 81 ≤ i 6= j; ≤ n (i.e. orthogonal and unit length). n For example fe1; e2; : : : ; eng is an orthonormal set in R . 4. given an orthogonal basis for a vector space V , we can always find an orthonormal basis for V by dividing each vector by its length (see Example 2 and 3 page 256) n 5. a space with an orthonormal basis behaves like the euclidean space R with the standard basis (it is easier to work with basis that are orthonormal, just like it is n easier to work with the standard basis versus other bases for R ) 6. if v is a vector in a inner product space V with fu1; u2; : : : ; ung an orthonormal basis, Pn Pn then we can write v = i=1 ciui = i=1hv; uiiui Pn 7. an easy way to find the inner product of two vectors: if u = i=1 aiui and v = Pn i=1 biui, where fu1; u2; : : : ; ung is an orthonormal basis for an inner product space Pn V , then hu; vi = i=1 aibi Pn 8.
    [Show full text]
  • Math 2331 – Linear Algebra 6.2 Orthogonal Sets
    6.2 Orthogonal Sets Math 2331 { Linear Algebra 6.2 Orthogonal Sets Jiwen He Department of Mathematics, University of Houston [email protected] math.uh.edu/∼jiwenhe/math2331 Jiwen He, University of Houston Math 2331, Linear Algebra 1 / 12 6.2 Orthogonal Sets Orthogonal Sets Basis Projection Orthonormal Matrix 6.2 Orthogonal Sets Orthogonal Sets: Examples Orthogonal Sets: Theorem Orthogonal Basis: Examples Orthogonal Basis: Theorem Orthogonal Projections Orthonormal Sets Orthonormal Matrix: Examples Orthonormal Matrix: Theorems Jiwen He, University of Houston Math 2331, Linear Algebra 2 / 12 6.2 Orthogonal Sets Orthogonal Sets Basis Projection Orthonormal Matrix Orthogonal Sets Orthogonal Sets n A set of vectors fu1; u2;:::; upg in R is called an orthogonal set if ui · uj = 0 whenever i 6= j. Example 82 3 2 3 2 39 < 1 1 0 = Is 4 −1 5 ; 4 1 5 ; 4 0 5 an orthogonal set? : 0 0 1 ; Solution: Label the vectors u1; u2; and u3 respectively. Then u1 · u2 = u1 · u3 = u2 · u3 = Therefore, fu1; u2; u3g is an orthogonal set. Jiwen He, University of Houston Math 2331, Linear Algebra 3 / 12 6.2 Orthogonal Sets Orthogonal Sets Basis Projection Orthonormal Matrix Orthogonal Sets: Theorem Theorem (4) Suppose S = fu1; u2;:::; upg is an orthogonal set of nonzero n vectors in R and W =spanfu1; u2;:::; upg. Then S is a linearly independent set and is therefore a basis for W . Partial Proof: Suppose c1u1 + c2u2 + ··· + cpup = 0 (c1u1 + c2u2 + ··· + cpup) · = 0· (c1u1) · u1 + (c2u2) · u1 + ··· + (cpup) · u1 = 0 c1 (u1 · u1) + c2 (u2 · u1) + ··· + cp (up · u1) = 0 c1 (u1 · u1) = 0 Since u1 6= 0, u1 · u1 > 0 which means c1 = : In a similar manner, c2,:::,cp can be shown to by all 0.
    [Show full text]
  • True False Questions from 4,5,6
    (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Math 217: True False Practice Professor Karen Smith 1. For every 2 × 2 matrix A, there exists a 2 × 2 matrix B such that det(A + B) 6= det A + det B. Solution note: False! Take A to be the zero matrix for a counterexample. 2. If the change of basis matrix SA!B = ~e4 ~e3 ~e2 ~e1 , then the elements of A are the same as the element of B, but in a different order. Solution note: True. The matrix tells us that the first element of A is the fourth element of B, the second element of basis A is the third element of B, the third element of basis A is the second element of B, and the the fourth element of basis A is the first element of B. 6 6 3. Every linear transformation R ! R is an isomorphism. Solution note: False. The zero map is a a counter example. 4. If matrix B is obtained from A by swapping two rows and det A < det B, then A is invertible. Solution note: True: we only need to know det A 6= 0. But if det A = 0, then det B = − det A = 0, so det A < det B does not hold. 5. If two n × n matrices have the same determinant, they are similar. Solution note: False: The only matrix similar to the zero matrix is itself. But many 1 0 matrices besides the zero matrix have determinant zero, such as : 0 0 6.
    [Show full text]
  • C Self-Adjoint Operators and Complete Orthonormal Bases
    C Self-adjoint operators and complete orthonormal bases The concept of the adjoint of an operator plays a very important role in many aspects of linear algebra and functional analysis. Here we will primar­ ily focus on s e ll~adjoint operators and how they can be used to obtain and characterize complete orthonormal sets of vectors in a Hilbert space. The main fact we will present here is that self-adjoint operators typically have orthogonal eigenvectors, and under some conditions, these eigenvectors can form a complete orthonormal basis for the Hilbert space. In particular, we will use this technique to find a variety of orthonormal bases for L2 [a, b] that satisfy different types of boundary conditions. We begin with the algebraic aspects of self-adjoint operators and their eigenvectors. Those algebraic properties are identical in the finite and infinite dimensional cases. The completeness arguments in infinite dimensions are more delicate, we will only state those results without complete proofs. We begin first by defining the adjoint. D efinition C.l. (Finite dimensional or bounded operator case) Let A H I -; H2 be a bounded operator between the Hilbert spaces HI and H 2. The adjomt A' : H2 ---; HI of Xis defined by the req1Lirement J (V2, AVI ) ~ = (A''V2, v])], (C.l) fOT all VI E HI--- and'V2 E H2· Note that for emphasis, we have written (. , .)] and (. , ')2 for the inner products in HI and H2 respectively. It remains to be shown that the relation (C.l) defines an operator A' from A uniquely. We will not do this here in general but will illustrate it with several examples.
    [Show full text]
  • Worksheet and Solutions
    Tuesday, December 6 ∗∗ Orthogonal bases & Orthogonal projections ∗∗ Solutions 1. A basis B is called an orthonormal basis if it is orthogonal and each basis vector has norm equal to 1. (a) Convert the orthogonal basis 80− 1 0 1 0 19 < 1 1 1 = B = @ 1 A , @ 1 A , @1A : 0 −2 1 ; into an orthonormal basis C . Solution. We just scale each basis vector by its length. The new, orthonormal, basis is 8 0−11 0 1 1 0119 < 1 1 1 = C = p @ 1 A , p @ 1 A , p @1A 2 6 3 : 0 −2 1 ; 011 0−41 (b) Find the coordinates of the vectors v1 = @3A and v2 = @ 2 A in the basis C . 5 7 Solution. The formula is the same as for a general orthogonal basis: writing u1, u2, and u3 for the basis vectors, the formula for each coordinate of v1 in the basis C is u · v i 1 = · 2 ui v1. kuik We compute to find 2 p −6 p 9 p u1 · v1 = p = 2, u2 · v1 = p = − 6, u3 · v1 = p = 3 3, 2 6 3 0 p 1 p2 B C so (v1)C = @−p 6A. Similarly, we get 3 3 r 6 p −16 2 5 u1 · v2 = p = 3 2, u2 · v2 = p = −8 , u3 · v2 = p , 2 6 3 3 0 p 1 3p 2 B C so (v2)C = @−8 p2/3A. 5/ 3 Orthonormal bases are very convenient for calculations. 2. (The Gram-Schmidt process) There is a standard process for converting a basis into an 3 orthogonal basis.
    [Show full text]
  • Inner Product Spaces
    CHAPTER 6 Woman teaching geometry, from a fourteenth-century edition of Euclid’s geometry book. Inner Product Spaces In making the definition of a vector space, we generalized the linear structure (addition and scalar multiplication) of R2 and R3. We ignored other important features, such as the notions of length and angle. These ideas are embedded in the concept we now investigate, inner products. Our standing assumptions are as follows: 6.1 Notation F, V F denotes R or C. V denotes a vector space over F. LEARNING OBJECTIVES FOR THIS CHAPTER Cauchy–Schwarz Inequality Gram–Schmidt Procedure linear functionals on inner product spaces calculating minimum distance to a subspace Linear Algebra Done Right, third edition, by Sheldon Axler 164 CHAPTER 6 Inner Product Spaces 6.A Inner Products and Norms Inner Products To motivate the concept of inner prod- 2 3 x1 , x 2 uct, think of vectors in R and R as x arrows with initial point at the origin. x R2 R3 H L The length of a vector in or is called the norm of x, denoted x . 2 k k Thus for x .x1; x2/ R , we have The length of this vector x is p D2 2 2 x x1 x2 . p 2 2 x1 x2 . k k D C 3 C Similarly, if x .x1; x2; x3/ R , p 2D 2 2 2 then x x1 x2 x3 . k k D C C Even though we cannot draw pictures in higher dimensions, the gener- n n alization to R is obvious: we define the norm of x .x1; : : : ; xn/ R D 2 by p 2 2 x x1 xn : k k D C C The norm is not linear on Rn.
    [Show full text]
  • Orthonormal Bases
    Math 108B Professor: Padraic Bartlett Lecture 3: Orthonormal Bases Week 3 UCSB 2014 In our last class, we introduced the concept of \changing bases," and talked about writ- ing vectors and linear transformations in other bases. In the homework and in class, we saw that in several situations this idea of \changing basis" could make a linear transformation much easier to work with; in several cases, we saw that linear transformations under a certain basis would become diagonal, which made tasks like raising them to large powers far easier than these problems would be in the standard basis. But how do we find these \nice" bases? What does it mean for a basis to be\nice?" In this set of lectures, we will study one potential answer to this question: the concept of an orthonormal basis. 1 Orthogonality To start, we should define the notion of orthogonality. First, recall/remember the defini- tion of the dot product: n Definition. Take two vectors (x1; : : : xn); (y1; : : : yn) 2 R . Their dot product is simply the sum x1y1 + x2y2 + : : : xnyn: Many of you have seen an alternate, geometric definition of the dot product: n Definition. Take two vectors (x1; : : : xn); (y1; : : : yn) 2 R . Their dot product is the product jj~xjj · jj~yjj cos(θ); where θ is the angle between ~x and ~y, and jj~xjj denotes the length of the vector ~x, i.e. the distance from (x1; : : : xn) to (0;::: 0). These two definitions are equivalent: 3 Theorem. Let ~x = (x1; x2; x3); ~y = (y1; y2; y3) be a pair of vectors in R .
    [Show full text]
  • 3. Hilbert Spaces
    3. Hilbert spaces In this section we examine a special type of Banach spaces. We start with some algebraic preliminaries. Definition. Let K be either R or C, and let Let X and Y be vector spaces over K. A map φ : X × Y → K is said to be K-sesquilinear, if • for every x ∈ X, then map φx : Y 3 y 7−→ φ(x, y) ∈ K is linear; • for every y ∈ Y, then map φy : X 3 y 7−→ φ(x, y) ∈ K is conjugate linear, i.e. the map X 3 x 7−→ φy(x) ∈ K is linear. In the case K = R the above properties are equivalent to the fact that φ is bilinear. Remark 3.1. Let X be a vector space over C, and let φ : X × X → C be a C-sesquilinear map. Then φ is completely determined by the map Qφ : X 3 x 7−→ φ(x, x) ∈ C. This can be see by computing, for k ∈ {0, 1, 2, 3} the quantity k k k k k k k Qφ(x + i y) = φ(x + i y, x + i y) = φ(x, x) + φ(x, i y) + φ(i y, x) + φ(i y, i y) = = φ(x, x) + ikφ(x, y) + i−kφ(y, x) + φ(y, y), which then gives 3 1 X (1) φ(x, y) = i−kQ (x + iky), ∀ x, y ∈ X. 4 φ k=0 The map Qφ : X → C is called the quadratic form determined by φ. The identity (1) is referred to as the Polarization Identity.
    [Show full text]
  • 17. Inner Product Spaces Definition 17.1. Let V Be a Real Vector Space
    17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function h ; i: V × V −! R; which is • symmetric, that is hu; vi = hv; ui: • bilinear, that is linear (in both factors): hλu, vi = λhu; vi; for all scalars λ and hu1 + u2; vi = hu1; vi + hu2; vi; for all vectors u1, u2 and v. • positive that is hv; vi ≥ 0: • non-degenerate that is if hu; vi = 0 for every v 2 V then u = 0. We say that V is a real inner product space. The associated quadratic form is the function Q: V −! R; defined by Q(v) = hv; vi: Example 17.2. Let A 2 Mn;n(R) be a real matrix. We can define a function n n h ; i: R × R −! R; by the rule hu; vi = utAv: The basic rules of matrix multiplication imply that this function is bi- linear. Note that the entries of A are given by t aij = eiAej = hei; eji: In particular, it is symmetric if and only if A is symmetric that is At = A. It is non-degenerate if and only if A is invertible, that is A has rank n. Positivity is a little harder to characterise. Perhaps the canonical example is to take A = In. In this case if t P u = (r1; r2; : : : ; rn) and v = (s1; s2; : : : ; sn) then u Inv = risi. Note 1 P 2 that if we take u = v then we get ri . The square root of this is the Euclidean distance.
    [Show full text]