Lecture 4: Linear independence, span, and bases (1)

 Regina Underwood
 5 months 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 Warmup 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). Warmup 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 xaxis, V 2 = the yaxis, 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 jdimensional 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 ith 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 finitedimensional 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 finitedimensional, 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 finitedimensional is called infinitedimensional. 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 finitedimensional 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 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 informationTravis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)
Lecture 13: Proof of existence of uppertriangular matrices for complex linear transformations; invariant subspaces and block uppertriangular matrices for real linear transformations (1) Travis Schedler
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 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 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 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 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 informationMath 2331 Linear Algebra
4.5 The Dimension of a Vector Space Math 233 Linear Algebra 4.5 The Dimension of a Vector Space ShangHuan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ ShangHuan
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 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 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 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 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 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 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 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 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 informationHomework 5 M 373K Mark Lindberg and Travis Schedler
Homework 5 M 373K Mark Lindberg and Travis Schedler 1. Artin, Chapter 3, Exercise.1. Prove that the numbers of the form a + b, where a and b are rational numbers, form a subfield of C. Let F be the numbers
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 informationLinear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Linear Independence MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Given a set of vectors {v 1, v 2,..., v r } and another vector v span{v 1, v 2,...,
More informationMath 4377/6308 Advanced Linear Algebra
2. Linear Transformations Math 4377/638 Advanced Linear Algebra 2. Linear Transformations, Null Spaces and Ranges Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More informationDetermining a span. λ + µ + ν = x 2λ + 2µ 10ν = y λ + 3µ 9ν = z.
Determining a span Set V = R 3 and v 1 = (1, 2, 1), v 2 := (1, 2, 3), v 3 := (1 10, 9). We want to determine the span of these vectors. In other words, given (x, y, z) R 3, when is (x, y, z) span(v 1,
More informationNOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS. Contents. 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4. 1.
NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS Contents 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4 1. Introduction These notes establish some basic results about linear algebra over
More informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationTangent spaces, normals and extrema
Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3space, with a point a S where S looks smooth, i.e., without any fold or cusp or selfcrossing, we can intuitively define the tangent
More informationMath 396. An application of GramSchmidt to prove connectedness
Math 396. An application of GramSchmidt to prove connectedness 1. Motivation and background Let V be an ndimensional vector space over R, and define GL(V ) to be the set of invertible linear maps V V
More informationMAT LINEAR ALGEBRA I UNIVERSITY OF OTTAWA
MAT 2141  LINEAR ALGEBRA I UNIVERSITY OF OTTAWA ALISTAIR SAVAGE Contents About the course 3 Notation 4 1. Sets with operations (magmas) 5 1.1. Operations on sets 5 1.2. Use of parentheses 6 1.3. Identity
More information4. Linear transformations as a vector space 17
4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation
More informationApprentice Linear Algebra, 1st day, 6/27/05
Apprentice Linear Algebra, 1st day, 6/7/05 REU 005 Instructor: László Babai Scribe: Eric Patterson Definitions 1.1. An abelian group is a set G with the following properties: (i) ( a, b G)(!a + b G) (ii)
More informationAbstract Vector Spaces and Concrete Examples
LECTURE 18 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.
More informationMAT 242 CHAPTER 4: SUBSPACES OF R n
MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)
More informationEigenvalues and Eigenvectors
LECTURE 3 Eigenvalues and Eigenvectors Definition 3.. Let A be an n n matrix. The eigenvalueeigenvector problem for A is the problem of finding numbers λ and vectors v R 3 such that Av = λv. If λ, v are
More informationMath 3013 Problem Set 6
Math 3013 Problem Set 6 Problems from 31 (pgs 189190 of text): 11,16,18 Problems from 32 (pgs 140141 of text): 4,8,12,23,25,26 1 (Problems 3111 and 31 16 in text) Determine whether the given set is closed
More informationFinitedimensional spaces. C n is the space of ntuples 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 prehilbert space, or a unitary space) if there is a mapping (, )
More informationLecture 10: Vector Algebra: Orthogonal Basis
Lecture 0: Vector Algebra: Orthogonal Basis Orthogonal Basis of a subspace Computing an orthogonal basis for a subspace using GramSchmidt Orthogonalization Process Orthogonal Set Any set of vectors that
More informationLecture 18: Section 4.3
Lecture 18: Section 4.3 Shuanglin Shao November 6, 2013 Linear Independence and Linear Dependence. We will discuss linear independence of vectors in a vector space. Definition. If S = {v 1, v 2,, v r }
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationis an isomorphism, and V = U W. Proof. Let u 1,..., u m be a basis of U, and add linearly independent
Lecture 4. GModules PCMI Summer 2015 Undergraduate Lectures on Flag Varieties Lecture 4. The categories of Gmodules, mostly for finite groups, and a recipe for finding every irreducible Gmodule of a
More informationSpan and Linear Independence
Span and Linear Independence It is common to confuse span and linear independence, because although they are different concepts, they are related. To see their relationship, let s revisit the previous
More informationModern Control Systems
Modern Control Systems Matthew M. Peet Arizona State University Lecture 2: Mathematical Preliminaries Mathematics  Sets and Subsets Definition 1. A set, D, is any collection of elements, d. Denoted d
More informationMath 396. Quotient spaces
Math 396. Quotient spaces. Definition Let F be a field, V a vector space over F and W V a subspace of V. For v, v V, we say that v v mod W if and only if v v W. One can readily verify that with this definition
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationMA20216: Algebra 2A. Notes by Fran Burstall
MA20216: Algebra 2A Notes by Fran Burstall Corrections by: Callum Kemp Carlos Galeano Rios Kate Powell Tobias Beith Krunoslav Lehman Pavasovic Dan Corbie Phaidra Anastasiadou Louise Hannon Vlad Brebeanu
More informationMath 581 Problem Set 5 Solutions
Math 581 Problem Set 5 Solutions 1. Show that the set { 2, 2 + i, 3 i} is linearly independent over Q. Proof: Suppose there exists a 0, a 1, and a 2 in Q so that a 0 2 + a1 ( 2 + i) + a 2 ( 3 i) = 0. Then
More informationSolutions to Math 51 First Exam April 21, 2011
Solutions to Math 5 First Exam April,. ( points) (a) Give the precise definition of a (linear) subspace V of R n. (4 points) A linear subspace V of R n is a subset V R n which satisfies V. If x, y V then
More informationExam in TMA4110 Calculus 3, June 2013 Solution
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 8 Exam in TMA4 Calculus 3, June 3 Solution Problem Let T : R 3 R 3 be a linear transformation such that T = 4,
More informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationLecture 1s Isomorphisms of Vector Spaces (pages )
Lecture 1s Isomorphisms of Vector Spaces (pages 246249) Definition: L is said to be onetoone if L(u 1 ) = L(u 2 ) implies u 1 = u 2. Example: The mapping L : R 4 R 2 defined by L(a, b, c, d) = (a, d)
More information1 Linear transformations; the basics
Linear Algebra Fall 2013 Linear Transformations 1 Linear transformations; the basics Definition 1 Let V, W be vector spaces over the same field F. A linear transformation (also known as linear map, or
More informationTopological Vector Spaces III: Finite Dimensional Spaces
TVS III c Gabriel Nagy Topological Vector Spaces III: Finite Dimensional Spaces Notes from the Functional Analysis Course (Fall 07  Spring 08) Convention. Throughout this note K will be one of the fields
More informationMath 115A: Linear Algebra
Math 115A: Linear Algebra Michael Andrews UCLA Mathematics Department February 9, 218 Contents 1 January 8: a little about sets 4 2 January 9 (discussion) 5 2.1 Some definitions: union, intersection, set
More informationAn Introduction to NonStandard Analysis and its Applications
An Introduction to NonStandard Analysis and its Applications Kevin O Neill March 6, 2014 1 Basic Tools 1.1 A Shortest Possible History of Analysis When Newton and Leibnitz practiced calculus, they used
More informationR b. x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 1 1, x h. , x p. x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9
The full solution of Ax b x x p x h : The general solution is the sum of any particular solution of the system Ax b plus the general solution of the corresponding homogeneous system Ax. ) Reduce A b to
More informationBASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x
BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationALGEBRAIC STRUCTURE AND DEGREE REDUCTION
ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S F n. We define deg(s) to be the minimal degree of a nonzero polynomial that vanishes on S. We have seen that for a finite set S, deg(s) n S 1/n. In fact,
More information80 min. 65 points in total. The raw score will be normalized according to the course policy to count into the final score.
This is a closed book, closed notes exam You need to justify every one of your answers unless you are asked not to do so Completely correct answers given without justification will receive little credit
More informationftuiowamath2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST
me me ftuiowamath255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following
More informationDSGA 1002 Lecture notes 10 November 23, Linear models
DSGA 2 Lecture notes November 23, 2 Linear functions Linear models A linear model encodes the assumption that two quantities are linearly related. Mathematically, this is characterized using linear functions.
More informationThe Jordan Canonical Form
The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finitedimensional vector space over an algebraically closed field. Here we develop
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationADVANCED CALCULUS  MTH433 LECTURE 4  FINITE AND INFINITE SETS
ADVANCED CALCULUS  MTH433 LECTURE 4  FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITEDIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITEDIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationTHE MINIMAL POLYNOMIAL AND SOME APPLICATIONS
THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise
More informationCriteria for Determining If A Subset is a Subspace
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for inclass presentation
More informationThe Cross Product of Two Vectors
The Cross roduct of Two Vectors In proving some statements involving surface integrals, there will be a need to approximate areas of segments of the surface by areas of parallelograms. Therefore it is
More informationCartan s Criteria. Math 649, Dan Barbasch. February 26
Cartan s Criteria Math 649, 2013 Dan Barbasch February 26 Cartan s Criteria REFERENCES: Humphreys, I.2 and I.3. Definition The CartanKilling form of a Lie algebra is the bilinear form B(x, y) := Tr(ad
More informationIntroduction to Vectors
Introduction to Vectors K. Behrend January 31, 008 Abstract An introduction to vectors in R and R 3. Lines and planes in R 3. Linear dependence. 1 Contents Introduction 3 1 Vectors 4 1.1 Plane vectors...............................
More informationMATH 12 CLASS 4 NOTES, SEP
MATH 12 CLASS 4 NOTES, SEP 28 2011 Contents 1. Lines in R 3 1 2. Intersections of lines in R 3 2 3. The equation of a plane 4 4. Various problems with planes 5 4.1. Intersection of planes with planes or
More informationHomework set 5  Solutions
Homework set 5  Solutions Math 469 Renato Feres 1. Hall s textbook, Exercise 4.9.2, page 105. Show the following: (a) The adjoint representation and the standard representation are isomorphic representations
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationWHY POLYNOMIALS? PART 1
WHY POLYNOMIALS? PART 1 The proofs of finite field Kakeya and joints and short and clean, but they also seem strange to me. They seem a little like magic tricks. In particular, what is the role of polynomials
More informationALGEBRA 8: Linear algebra: characteristic polynomial
ALGEBRA 8: Linear algebra: characteristic polynomial Characteristic polynomial Definition 8.1. Consider a linear operator A End V over a vector space V. Consider a vector v V such that A(v) = λv. This
More informationConics and their duals
9 Conics and their duals You always admire what you really don t understand. Blaise Pascal So far we dealt almost exclusively with situations in which only points and lines were involved. Geometry would
More information47831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 2 Date: 03/18/2010
47831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture Date: 03/18/010 We saw in the previous lecture that a lattice Λ can have many bases. In fact, if Λ is a lattice of a subspace L with
More informationComplex Analysis Homework 4: Solutions
Complex Analysis Fall 2007 Homework 4: Solutions 1.5.2. a The function fz 3z 2 +7z+5 is a polynomial so is analytic everywhere with derivative f z 6z + 7. b The function fz 2z + 3 4 is a composition of
More informationExercise Sheet 8 Linear Algebra I
Fachbereich Mathematik Martin Otto Achim Blumensath Nicole Nowak Pavol Safarik Winter Term 2008/2009 (E8.1) [Morphisms] Exercise Sheet 8 Linear Algebra I Let V be a finite dimensional Fvector space and
More informationMidterm #2 Solutions
Naneh Apkarian Math F Winter Midterm # Solutions Here is a solution key for the second midterm. The solutions presented here are more complete and thorough than your responses needed to be  in order to
More informationLECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
LECTURE VII: THE JORDAN CANONICAL FORM MAT 204  FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue
More informationMath 24 Winter 2010 Sample Solutions to the Midterm
Math 4 Winter Sample Solutions to the Midterm (.) (a.) Find a basis {v, v } for the plane P in R with equation x + y z =. We can take any two noncollinear vectors in the plane, for instance v = (,, )
More informationColumn 3 is fine, so it remains to add Row 2 multiplied by 2 to Row 1. We obtain
Section Exercise : We are given the following augumented matrix 3 7 6 3 We have to bring it to the diagonal form The entries below the diagonal are already zero, so we work from bottom to top Adding the
More informationChapter 3: Theory Review: Solutions Math 308 F Spring 2015
Chapter : Theory Review: Solutions Math 08 F Spring 05. What two properties must a function T : R m R n satisfy to be a linear transformation? (a) For all vectors u and v in R m, T (u + v) T (u) + T (v)
More informationMath 2331 Linear Algebra
6.2 Orthogonal Sets Math 233 Linear Algebra 6.2 Orthogonal Sets Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math233 Jiwen He, University of Houston
More informationThe Theory of Finite Dimensional Vector Spaces
Chapter 4 The Theory of Finite Dimensional Vector Spaces 4.1 Some Basic concepts Vector spaces which are spanned by a finite number of vectors are said to be finite dimensional. The purpose of this chapter
More informationChapter 3. Abstract Vector Spaces. 3.1 The Definition
Chapter 3 Abstract Vector Spaces 3.1 The Definition Let s look back carefully at what we have done. As mentioned in thebeginning,theonly algebraic or arithmetic operations we have performed in R n or C
More informationCS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works
CS68: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant April 20, 206 Introduction Last lecture introduced the idea of principal components analysis (PCA). The
More informationThe next sequence of lectures in on the topic of Arithmetic Algorithms. We shall build up to an understanding of the RSA publickey cryptosystem.
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 10 The next sequence of lectures in on the topic of Arithmetic Algorithms. We shall build up to an understanding of the RSA publickey cryptosystem.
More informationCAAM 336 DIFFERENTIAL EQUATIONS IN SCI AND ENG Examination 1
CAAM 6 DIFFERENTIAL EQUATIONS IN SCI AND ENG Examination Instructions: Time limit: uninterrupted hours There are four questions worth a total of 5 points Please do not look at the questions until you begin
More informationSecond Exam. Math , Spring March 2015
Second Exam Math 3454, Spring 25 3 March 25. This exam has 8 questions and 2 pages. Make sure you have all pages before you begin. The eighth question is bonus (and worth less than the others). 2. This
More information