

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A section from a linear algebra textbook focusing on linear independence. The author explains the importance of this concept, providing examples from differential equations and geometric settings. The definition of linear combinations and linear independence, and presents theorems characterizing linearly dependent and independent sets. The section goals include understanding the connection between linear independence and trivial solutions to homogeneous equations.
Typology: Study notes
1 / 2
This page cannot be seen from the preview
Don't miss anything!


MATH-332: Linear Algebra 1-
MATH-332: Linear Algebra Chapter: 07
pgs. 65-72 June 22, 2009
Topics:
Linear Combinations Linear Independence Characterizations of Linearly Dependent Sets
Problems Prac: 1 - 4 Prob: 9, 15, 17, 19, 21, 27
This is one of the most important sections in the text. Many other linear algebra textbooks leave this material for much later when it hinders more than it helps. The author can do this by initially highlighting the four-fold description of a linear system. 1 Particularly, the vector description found in section 1.3 pushes the concept of a linear combination to the forefront and this concept can now be used to bread the notion of linear independence. The idea of linear independence of vectors is one of the most fundamental concepts in mathe- matics. A great example is found in differential equations. Given,
dY dt =^ AY,^ (1) has a solution that can be described in terms of the linear combination,
Y(t) = k 1 v 1 eλ^1 t^ + k 2 v 2 eλ^2 t, (2)
so long as the eigenvectors v 1 , v 2 are linearly independent. 2 This theme is seen in more general settings where the prescription is this:
MATH-332: Linear Algebra 1-
Now you have a general technique that can be used to ‘write down’ solutions to ‘problems.’ Well, at least up to finding some coefficients, but often much can be said without finding these coefficients. 6
Section Goals
Section Objectives
(^5) We will typically use the row-reduction algorithm, but there are cases when this is not a useful tool. (^6) Consider the differential equation y′′ (^) + y = 0 a quick check of the solution y(t) = k 1 sin(t) + k 2 cos(t) shows the oscillations and frequency of oscillations. Finding k 1 , k 2 only tells you the amplitudes of oscillation, which may not be as important as its other features.