Lecture 4: Linear independence, span, and bases (1)
|
|
- Regina Underwood
- 6 years ago
- Views:
Transcription
1 Lecture 4: Linear independence, span, and bases (1) Travis Schedler Tue, Sep 20, 2011 (version: Wed, Sep 21, 6:30 PM) Goals (2) Understand linear independence and examples Understand span and examples Understand basis and examples Preview dimension Prove the main theorem on linear independence and span, for the finitedimensional situation Warm-up exercise 1 (3) What are all of the subspaces of R 2? Try to define them also using set notation; e.g., {(a, b) R 2 ab = 1} or {(a, 1 a ) a R, a 0} would describe the hyperbola xy = 1. Answer: The subspaces are {0} (otherwise denoted by 0), R 2 itself, and all of the lines through the origin, L λ,µ = {(a, b) R 2 µa + λb = 0} = {(λt, µt) t R}, where λ and µ are not both zero. (Note that L λ,µ = L cλ,cµ for nonzero c R). Warm-up exercise 2 (4) True or false: If true, explain why. If false, give a counterexample: Suppose V = V 1 + V 2 + V 3. Then, V = V 1 V 2 V 3 if and only if 0 = V 1 V 2 = V 1 V 3 = V 2 V 3. Answer: False: one counterexample is V = R 2, with V 1 = the x-axis, V 2 = the y-axis, and V 3 = the line x = y. Then, V = R 2 = V 1 + V 2 + V 3, but V i V j = 0 for all i j. 1
2 Linear (in)dependence (5) Recall from the book: Definition 1. A list (v 1,..., v m ) is linearly independent if the only choice of a 1,..., a m F such that a 1 v a m v m = 0 (0.1) is a 1 = = a m = 0. The list is linearly dependent if there exists a 1,..., a m F, not all zero, such that (0.1) holds. Examples (6) Any sublist of a linearly independent list is still linearly independent. For any nonzero vector v V, the list (v), just containing the vector v only, is linearly independent. Any list containing zero is linearly dependent. A list (v, w) of two elements is linearly independent if and only if v 0 and w is not a scalar multiple of v. The case of R 3 : The list ((1, 0, 0), (0, 1, 0), (0, 0, 1)) is linearly independent. The list ((1, 1, 2), (2, 2, 4)) is linearly dependent. The list ((1, 0, 0), (0, 1, 1), (1, 2, 2)) is linearly dependent. In general, (u, v, w) is linearly independent if and only if they do not all lie in the same plane through the origin. Any list of length four or more turns out to be linearly dependent (why?) Span (7) Definition 2. The span of a list (v 1,..., v m ) of vectors in V is the vector subspace Span(v 1,..., v m ) := {a 1 v a m v m a 1,..., a m F}. (0.2) Given a vector space V, a list (v 1,..., v m ) of elements of V is a spanning list for V if V = Span(v 1,..., v m ). Note that, in a definition, if really means if and only if, since we are making a definition. Exercises: 2
3 Show that the set Span(v 1,..., v m ) is always a vector subspace. Show that Span(v 1,..., v m ) = Span(v 1 ) + + Span(v m ). This relates span to sum! Show that (v 1,..., v m ) is linearly independent if and only if Span(v 1,..., v m ) = Span(v 1 ) Span(v m ) and all the v i are nonzero. Examples (8) If we append any vectors to a spanning list, the result is still spanning. Span(0) = {0}. In general, Span(v 1,..., v m ) = {0} if and only if all of v 1,..., v m are zero. For nonzero v, Span(v) = {λv λ F} is the line through v and the origin. For nonzero v and for w not a multiple of v, Span(v, w) = {av +bw a, b F} is the plane through the origin containing v and w. Span(x, x 2,..., x n ) = the space of degree n polynomials which are multiples of x (i.e., which vanish at 0). The linear dependence lemma (9) We strengthen (a) from Lemma 2.4 and state it differently: Lemma 3. (a) A list (v 1,..., v m ) is linearly independent if and only if v 1 0 and, for all 2 j m, v j / Span(v 1,..., v j 1 ). (b) If the list is linearly dependent and v j Span(v 1,..., v j 1 ), then the span of the list (v 1,..., v j 1, v j+1,..., v m ) obtained by removing v j is the same as the span of (v 1,..., v m ). Intuitive idea: As we saw, a list (v 1,..., v m ) in R n is linearly independent if and only if v 1 spans a line, (v 1, v 2 ) spans a plane, etc., and (v 1,..., v j ) spans a j-dimensional space for all 1 j m, i.e., each v j is not in the span of the previous v 1,..., v j 1. For part (b), the idea is: if v j Span(v 1,..., v j 1 ), then we can replace v j by a linear combination of v 1,..., v j 1, so the span is unchanged if we discard v j. Proof of lemma (10) Proof. Axler proves half of (a) and all of (b): If (v 1,..., v m ) is linearly dependent, then either v 1 = 0 or, for some j, v j Span(v 1,..., v j 1 ) [half of part (a)]. In the latter case, the span of (v 1,..., v m ) is the same as the span of the list obtained by removing v j [part (b)]. 3
4 Using this, it remains to prove the other half of part (a). Suppose that v 1 = 0. Then (0, v 2,..., v m ) is linearly dependent: 1 v 1 +0 v v m = 0. Suppose that j 2 and v j Span(v 1,..., v j 1 ). Write v j = a 1 v a j 1 v j 1. Then a 1 v a j 1 v j 1 + ( 1) v j = 0. So (v 1,..., v m ) is linearly dependent. Bases (11) Definition 4. A basis of V is a list (v 1,..., v m ) of vectors in V that is both linearly independent and a spanning list. Main (characterizing) property: Proposition 0.3 (Proposition 2.8). A list (v 1,..., v m ) in V is a basis if and only if, for every vector v V, there exist unique a 1,..., a m F such that v = a 1 v a m v m. Proof: Read it in Axler and understand it! Idea of proof: Break into parts: (a) The list (v 1,..., v m ) is spanning if and only if every vector v can be written in at least one way as v = a 1 v a m v m. (b) The list (v 1,..., v m ) is linearly independent if and only if every vector v can be written in at most one way as v = a 1 v a m v m. Exercise: Read the proof in Axler and use it to prove (a) and (b) separately. Examples (12) A basis of R 2 : ((1, 0), (0, 1)). More generally, (u, v) where u 0 and v is not a multiple of u. The standard basis of R n : (v 1,..., v n ), where v i = (0, 0,..., 0, 1, 0, 0,..., 0), with 1 in the i-th place. Functions {1, 2,..., n} F: a basis is the collection of delta functions, (δ 1,..., δ n ), where δ i (j) = 0 if i j, and δ i (i) = 1. Deep result we will prove: For F n or the space of functions {1,..., n} F, a spanning list is a basis if and only if it has length n. Similarly, again for F n or the space of functions {1,..., n} F, a linearly independent list is a basis if and only if it has length n. 4
5 Preview on Dimension (13) The above deep properties are saying that F n and {1,..., n} F have dimension n. Definition 5. A vector space V is finite-dimensional if and only if there is a (finite) spanning list (v 1,..., v m ). A deep result we will prove next time: Proposition 0.4. If V is finite-dimensional, then the following numbers coincide: (a) The minimum length of a spanning list; (b) the maximum length of a linearly independent list; (c) the length of every basis. This number is called the dimension of V. A vector space which is not finite-dimensional is called infinite-dimensional. This includes P(F) and F. Main theorem on finite spanning and linearly independent lists (14) The key ingredient in the proof of the previous proposition on dimension is our main theorem: Theorem 6. In a finite-dimensional vector space, the length of every linearly independent list is less than or equal to the length of every spanning list. Proof: Let (w 1,..., w n ) be a spanning list and (u 1,..., u m ) be a linearly independent list. We have to show m n. In fact, we will show that (u 1,..., u m ) can be extended to a spanning list of length n by adding some w j s, so in particular m n. To do so, we go backwards, beginning with (w 1,..., w n ), and at each step replacing a w j with a u i. Proof of main theorem continued (15) First, let us append u 1. Form the list (u 1, w 1,..., w m ). Since u 1 Span(w 1,..., w n ), this list is linearly dependent. By the linear dependence lemma, since u 1 0, for some j, w j Span(u 1, w 1,..., w j 1 ). Then the list (u 1, w 1,..., w j 1, w j+1,..., w m ) is also spanning. Inductively, suppose that we have a spanning list of length n, beginning with u 1,..., u i, and ending with n i of the w s. Append u i+1 to the list. Since u i+1 is in the span of the other vectors, the result is linearly dependent. 5
6 Reorder the list to begin with u 1,..., u i+1. By the linear dependence lemma, either u j Span(u 1,..., u j 1 ) (impossible since (u 1,..., u i+1 ) is linearly independent), or else one of the v s, say v k, is in the span of the previous elements in the list. Now discard v k, completing the induction. We get a spanning list of length n, beginning with u 1,..., u m. So m n. For next time: Read all of Chapter 2, and understand the proofs of Theorems 2.10 and 2.12; bring questions to class. 6
Lecture 6: Corrections; Dimension; Linear maps
Lecture 6: Corrections; Dimension; Linear maps Travis Schedler Tues, Sep 28, 2010 (version: Tues, Sep 28, 4:45 PM) Goal To briefly correct the proof of the main Theorem from last time. (See website for
More informationLecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)
Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Travis Schedler Tue, Oct 18, 2011 (version: Tue, Oct 18, 6:00 PM) Goals (2) Solving systems of equations
More informationProblem set #4. Due February 19, x 1 x 2 + x 3 + x 4 x 5 = 0 x 1 + x 3 + 2x 4 = 1 x 1 x 2 x 4 x 5 = 1.
Problem set #4 Due February 19, 218 The letter V always denotes a vector space. Exercise 1. Find all solutions to 2x 1 x 2 + x 3 + x 4 x 5 = x 1 + x 3 + 2x 4 = 1 x 1 x 2 x 4 x 5 = 1. Solution. First we
More information1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
More informationMATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
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 informationMath 4153 Exam 1 Review
The syllabus for Exam 1 is Chapters 1 3 in Axler. 1. You should be sure to know precise definition of the terms we have used, and you should know precise statements (including all relevant hypotheses)
More informationTravis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)
Lecture 13: Proof of existence of upper-triangular matrices for complex linear transformations; invariant subspaces and block upper-triangular matrices for real linear transformations (1) Travis Schedler
More informationOHSX XM511 Linear Algebra: Multiple Choice Exercises for Chapter 2
OHSX XM5 Linear Algebra: Multiple Choice Exercises for Chapter. In the following, a set is given together with operations of addition and scalar multiplication. Which is not a vector space under the given
More informationMATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.
MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v
More informationChapter 3. More about Vector Spaces Linear Independence, Basis and Dimension. Contents. 1 Linear Combinations, Span
Chapter 3 More about Vector Spaces Linear Independence, Basis and Dimension Vincent Astier, School of Mathematical Sciences, University College Dublin 3. Contents Linear Combinations, Span Linear Independence,
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 informationLecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1)
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1) Travis Schedler Thurs, Nov 17, 2011 (version: Thurs, Nov 17, 1:00 PM) Goals (2) Polar decomposition
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 informationLecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1)
Lecture 19: Polar and singular value decompositions; generalized eigenspaces; the decomposition theorem (1) Travis Schedler Thurs, Nov 17, 2011 (version: Thurs, Nov 17, 1:00 PM) Goals (2) Polar decomposition
More informationWorksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases
Worksheet for Lecture 5 (due October 23) Name: Section 4.3 Linearly Independent Sets; Bases Definition An indexed set {v,..., v n } in a vector space V is linearly dependent if there is a linear relation
More informationMath 235: Linear Algebra
Math 235: Linear Algebra Midterm Exam 1 October 15, 2013 NAME (please print legibly): Your University ID Number: Please circle your professor s name: Friedmann Tucker The presence of calculators, cell
More informationWorksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases
Worksheet for Lecture 5 (due October 23) Name: Section 4.3 Linearly Independent Sets; Bases Definition An indexed set {v,..., v n } in a vector space V is linearly dependent if there is a linear relation
More informationLecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1)
Lecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1) Travis Schedler Tue, Nov 29, 2011 (version: Tue, Nov 29, 1:00 PM) Goals
More informationLecture 03. Math 22 Summer 2017 Section 2 June 26, 2017
Lecture 03 Math 22 Summer 2017 Section 2 June 26, 2017 Just for today (10 minutes) Review row reduction algorithm (40 minutes) 1.3 (15 minutes) Classwork Review row reduction algorithm Review row reduction
More informationMATH 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture : Null and Column Spaces Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./8 Announcements Study Guide posted HWK posted Math 9Applied
More informationLecture 9: Vector Algebra
Lecture 9: Vector Algebra Linear combination of vectors Geometric interpretation Interpreting as Matrix-Vector Multiplication Span of a set of vectors Vector Spaces and Subspaces Linearly Independent/Dependent
More informationSUPPLEMENT TO CHAPTER 3
SUPPLEMENT TO CHAPTER 3 1.1 Linear combinations and spanning sets Consider the vector space R 3 with the unit vectors e 1 = (1, 0, 0), e 2 = (0, 1, 0), e 3 = (0, 0, 1). Every vector v = (a, b, c) R 3 can
More informationAlgorithms to Compute Bases and the Rank of a Matrix
Algorithms to Compute Bases and the Rank of a Matrix Subspaces associated to a matrix Suppose that A is an m n matrix The row space of A is the subspace of R n spanned by the rows of A The column space
More informationLecture Notes for Math 414: Linear Algebra II Fall 2015, Michigan State University
Lecture Notes for Fall 2015, Michigan State University Matthew Hirn December 11, 2015 Beginning of Lecture 1 1 Vector Spaces What is this course about? 1. Understanding the structural properties of a wide
More informationMATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element
More informationLecture 17: Section 4.2
Lecture 17: Section 4.2 Shuanglin Shao November 4, 2013 Subspaces We will discuss subspaces of vector spaces. Subspaces Definition. A subset W is a vector space V is called a subspace of V if W is itself
More informationDefinition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition
6 Vector Spaces with Inned Product Basis and Dimension Section Objective(s): Vector Spaces and Subspaces Linear (In)dependence Basis and Dimension Inner Product 6 Vector Spaces and Subspaces Definition
More informationAdvanced Linear Algebra Math 4377 / 6308 (Spring 2015) March 5, 2015
Midterm 1 Advanced Linear Algebra Math 4377 / 638 (Spring 215) March 5, 215 2 points 1. Mark each statement True or False. Justify each answer. (If true, cite appropriate facts or theorems. If false, explain
More informationThe Gram Schmidt Process
u 2 u The Gram Schmidt Process Now we will present a procedure, based on orthogonal projection, that converts any linearly independent set of vectors into an orthogonal set. Let us begin with the simple
More informationThe Gram Schmidt Process
The Gram Schmidt Process Now we will present a procedure, based on orthogonal projection, that converts any linearly independent set of vectors into an orthogonal set. Let us begin with the simple case
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 informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
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 informationMath 2331 Linear Algebra
4.5 The Dimension of a Vector Space Math 233 Linear Algebra 4.5 The Dimension of a Vector Space Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan
More informationMath 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.
Math 453 Exam 3 Review The syllabus for Exam 3 is Chapter 6 (pages -2), Chapter 7 through page 37, and Chapter 8 through page 82 in Axler.. You should be sure to know precise definition of the terms we
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 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 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 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 information6. The scalar multiple of u by c, denoted by c u is (also) in V. (closure under scalar multiplication)
Definition: A subspace of a vector space V is a subset H of V which is itself a vector space with respect to the addition and scalar multiplication in V. As soon as one verifies a), b), c) below for H,
More informationReview of Linear Algebra
Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space
More informationSection 6.2, 6.3 Orthogonal Sets, Orthogonal Projections
Section 6. 6. Orthogonal Sets Orthogonal Projections Main Ideas in these sections: Orthogonal set = A set of mutually orthogonal vectors. OG LI. Orthogonal Projection of y onto u or onto an OG set {u u
More informationMath 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix
Math 34H EXAM I Do all of the problems below. Point values for each of the problems are adjacent to the problem number. Calculators may be used to check your answer but not to arrive at your answer. That
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 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 equations in linear algebra
Linear equations in linear algebra Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra Pearson Collections Samy T. Linear
More informationWriting proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases
Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof
More informationx 2 For example, Theorem If S 1, S 2 are subspaces of R n, then S 1 S 2 is a subspace of R n. Proof. Problem 3.
.. Intersections and Sums of Subspaces Until now, subspaces have been static objects that do not interact, but that is about to change. In this section, we discuss the operations of intersection and addition
More informationGENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION
GENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION FRANZ LUEF Abstract. Our exposition is inspired by S. Axler s approach to linear algebra and follows largely his exposition
More informationLinear Combination. v = a 1 v 1 + a 2 v a k v k
Linear Combination Definition 1 Given a set of vectors {v 1, v 2,..., v k } in a vector space V, any vector of the form v = a 1 v 1 + a 2 v 2 +... + a k v k for some scalars a 1, a 2,..., a k, is called
More information(II.B) Basis and dimension
(II.B) Basis and dimension How would you explain that a plane has two dimensions? Well, you can go in two independent directions, and no more. To make this idea precise, we formulate the DEFINITION 1.
More informationMathematics 206 Solutions for HWK 13b Section 5.2
Mathematics 206 Solutions for HWK 13b Section 5.2 Section Problem 7ac. Which of the following are linear combinations of u = (0, 2,2) and v = (1, 3, 1)? (a) (2, 2,2) (c) (0,4, 5) Solution. Solution by
More informationSolutions: We leave the conversione between relation form and span form for the reader to verify. x 1 + 2x 2 + 3x 3 = 0
6.2. Orthogonal Complements and Projections In this section we discuss orthogonal complements and orthogonal projections. The orthogonal complement of a subspace S is the set of all vectors orthgonal to
More information19. Basis and Dimension
9. Basis and Dimension In the last Section we established the notion of a linearly independent set of vectors in a vector space V and of a set of vectors that span V. We saw that any set of vectors that
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 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 informationElementary Operations and Matrices
LECTURE 4 Elementary Operations and Matrices In the last lecture we developed a procedure for simplying the set of generators for a given subspace of the form S = span F (v 1,..., v k ) := {α 1 v 1 + +
More informationSOLUTIONS TO EXERCISES FOR MATHEMATICS 133 Part 1. I. Topics from linear algebra
SOLUTIONS TO EXERCISES FOR MATHEMATICS 133 Part 1 Winter 2009 I. Topics from linear algebra I.0 : Background 1. Suppose that {x, y} is linearly dependent. Then there are scalars a, b which are not both
More informationGENERAL VECTOR SPACES AND SUBSPACES [4.1]
GENERAL VECTOR SPACES AND SUBSPACES [4.1] General vector spaces So far we have seen special spaces of vectors of n dimensions denoted by R n. It is possible to define more general vector spaces A vector
More informationChapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.
Chapter 3 Directions: For questions 1-11 mark each statement True or False. Justify each answer. 1. (True False) Asking whether the linear system corresponding to an augmented matrix [ a 1 a 2 a 3 b ]
More informationMATH 110: LINEAR ALGEBRA HOMEWORK #2
MATH 11: LINEAR ALGEBRA HOMEWORK #2 1.5: Linear Dependence and Linear Independence Problem 1. (a) False. The set {(1, ), (, 1), (, 1)} is linearly dependent but (1, ) is not a linear combination of the
More informationPractice Midterm Solutions, MATH 110, Linear Algebra, Fall 2013
Student ID: Circle your GSI and section: If none of the above, please explain: Scerbo 8am 200 Wheeler Scerbo 9am 3109 Etcheverry McIvor 12pm 3107 Etcheverry McIvor 11am 3102 Etcheverry Mannisto 12pm 3
More informationA Do It Yourself Guide to Linear Algebra
A Do It Yourself Guide to Linear Algebra Lecture Notes based on REUs, 2001-2010 Instructor: László Babai Notes compiled by Howard Liu 6-30-2010 1 Vector Spaces 1.1 Basics Definition 1.1.1. A vector space
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 informationMidterm solutions. (50 points) 2 (10 points) 3 (10 points) 4 (10 points) 5 (10 points)
Midterm solutions Advanced Linear Algebra (Math 340) Instructor: Jarod Alper April 26, 2017 Name: } {{ } Read all of the following information before starting the exam: You may not consult any outside
More informationSolutions to Section 2.9 Homework Problems Problems 1 5, 7, 9, 10 15, (odd), and 38. S. F. Ellermeyer June 21, 2002
Solutions to Section 9 Homework Problems Problems 9 (odd) and 8 S F Ellermeyer June The pictured set contains the vector u but not the vector u so this set is not a subspace of The pictured set contains
More informationLast lecture: linear combinations and spanning sets. Let X = {x 1, x 2,..., x k } be a set of vectors in a vector
Last lecture: linear combinations and spanning sets Let X = { k } be a set of vectors in a vector space V A linear combination of k is any vector of the form r + r + + r k k V for r + r + + r k k for scalars
More informationM.6. Rational canonical form
book 2005/3/26 16:06 page 383 #397 M.6. RATIONAL CANONICAL FORM 383 M.6. Rational canonical form In this section we apply the theory of finitely generated modules of a principal ideal domain to study the
More informationMathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps
Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps We start with the definition of a vector space; you can find this in Section A.8 of the text (over R, but it works
More information10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns.
10. Rank-nullity Definition 10.1. Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns. The nullity ν(a) of A is the dimension of the kernel. The
More informationif b is a linear combination of u, v, w, i.e., if we can find scalars r, s, t so that ru + sv + tw = 0.
Solutions Review # Math 7 Instructions: Use the following problems to study for Exam # which will be held Wednesday Sept For a set of nonzero vectors u v w} in R n use words and/or math expressions to
More informationChapter 3. Vector spaces
Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say
More information1.3 Linear Dependence & span K
( ) Conversely, suppose that every vector v V can be expressed uniquely as v = u +w for u U and w W. Then, the existence of this expression for each v V is simply the statement that V = U +W. Moreover,
More informationLecture notes - Math 110 Lec 002, Summer The reference [LADR] stands for Axler s Linear Algebra Done Right, 3rd edition.
Lecture notes - Math 110 Lec 002, Summer 2016 BW The reference [LADR] stands for Axler s Linear Algebra Done Right, 3rd edition. 1 Contents 1 Sets and fields - 6/20 5 1.1 Set notation.................................
More informationb for the linear system x 1 + x 2 + a 2 x 3 = a x 1 + x 3 = 3 x 1 + x 2 + 9x 3 = 3 ] 1 1 a 2 a
Practice Exercises for Exam Exam will be on Monday, September 8, 7. The syllabus for Exam consists of Sections One.I, One.III, Two.I, and Two.II. You should know the main definitions, results and computational
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 informationVector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture
Week9 Vector Spaces 9. Opening Remarks 9.. Solvable or not solvable, that s the question Consider the picture (,) (,) p(χ) = γ + γ χ + γ χ (, ) depicting three points in R and a quadratic polynomial (polynomial
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture : Orthogonal Projections, Gram-Schmidt Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./ Orthonormal Sets A set of vectors {u, u,...,
More informationLinear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016
Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:
More informationVECTORS [PARTS OF 1.3] 5-1
VECTORS [PARTS OF.3] 5- Vectors and the set R n A vector of dimension n is an ordered list of n numbers Example: v = [ ] 2 0 ; w = ; z = v is in R 3, w is in R 2 and z is in R? 0. 4 In R 3 the R stands
More informationAbstract Vector Spaces
CHAPTER 1 Abstract Vector Spaces 1.1 Vector Spaces Let K be a field, i.e. a number system where you can add, subtract, multiply and divide. In this course we will take K to be R, C or Q. Definition 1.1.
More informationof A in U satisfies S 1 S 2 = { 0}, S 1 + S 2 = R n. Examples 1: (a.) S 1 = span . 1 (c.) S 1 = span, S , S 2 = span 0 (d.
. Complements and Projection Maps In this section, we explore the notion of subspaces being complements. Then, the unique decomposition of vectors in R n into two pieces associated to complements lets
More informationIntroduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 3 Dr. Ted Ralphs IE406 Lecture 3 1 Reading for This Lecture Bertsimas 2.1-2.2 IE406 Lecture 3 2 From Last Time Recall the Two Crude Petroleum example.
More informationJORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5
JORDAN NORMAL FORM KATAYUN KAMDIN Abstract. This paper outlines a proof of the Jordan Normal Form Theorem. First we show that a complex, finite dimensional vector space can be decomposed into a direct
More informationOrthonormal Bases; Gram-Schmidt Process; QR-Decomposition
Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 205 Motivation When working with an inner product space, the most
More informationMATH Linear Algebra
MATH 304 - Linear Algebra In the previous note we learned an important algorithm to produce orthogonal sequences of vectors called the Gramm-Schmidt orthogonalization process. Gramm-Schmidt orthogonalization
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationNotice that the set complement of A in U satisfies
Complements and Projection Maps In this section, we explore the notion of subspaces being complements Then, the unique decomposition of vectors in R n into two pieces associated to complements lets us
More informationVector Spaces. (1) Every vector space V has a zero vector 0 V
Vector Spaces 1. Vector Spaces A (real) vector space V is a set which has two operations: 1. An association of x, y V to an element x+y V. This operation is called vector addition. 2. The association of
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 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 informationVector space and subspace
Vector space and subspace Math 112, week 8 Goals: Vector space, subspace, span. Null space, column space. Linearly independent, bases. Suggested Textbook Readings: Sections 4.1, 4.2, 4.3 Week 8: Vector
More information6 Basis. 6.1 Introduction
6 Basis 6 Introduction If x, e, and e 2 are as pictured, then using the geometrical rules for scaling and adding vectors we see that x = 7e +4e 2 We say that x has e -coordinate 7 and e 2 -coordinate 4
More informationSolution: (a) S 1 = span. (b) S 2 = R n, x 1. x 1 + x 2 + x 3 + x 4 = 0. x 4 Solution: S 5 = x 2. x 3. (b) The standard basis vectors
.. Dimension In this section, we introduce the notion of dimension for a subspace. For a finite set, we can measure its size by counting its elements. We are interested in a measure of size on subspaces
More information2 Lecture Span, Basis and Dimensions
2 Lecture 2 2.1 Span, Basis and Dimensions Related to the concept of a linear combination is that of the span. The span of a collection of objects is the set of all linear combinations of those objects
More informationMath 102, Winter 2009, Homework 7
Math 2, Winter 29, Homework 7 () Find the standard matrix of the linear transformation T : R 3 R 3 obtained by reflection through the plane x + z = followed by a rotation about the positive x-axes by 6
More information18.06 Problem Set 3 - Solutions Due Wednesday, 26 September 2007 at 4 pm in
8.6 Problem Set 3 - s Due Wednesday, 26 September 27 at 4 pm in 2-6. Problem : (=2+2+2+2+2) A vector space is by definition a nonempty set V (whose elements are called vectors) together with rules of addition
More informationSolution. That ϕ W is a linear map W W follows from the definition of subspace. The map ϕ is ϕ(v + W ) = ϕ(v) + W, which is well-defined since
MAS 5312 Section 2779 Introduction to Algebra 2 Solutions to Selected Problems, Chapters 11 13 11.2.9 Given a linear ϕ : V V such that ϕ(w ) W, show ϕ induces linear ϕ W : W W and ϕ : V/W V/W : Solution.
More information