Linear combinations, span, and linear independence
Testing spanning and independence beyond R^n — among polynomials, infinite sequences, and abstract vectors — and proving the zero vector lies in every span.
Matrix Theory and Linear Algebra, Linear combinations, span, and linear independence
4 exercises
Exercise 9.2.1
Let be a vector space and suppose is a set of vectors in . Show that is in .
Exercise 9.2.5
Let be a field, and consider the vector space of infinite sequences of scalars. A sequence is called finitely supported if all but finitely many elements of the sequence are zero. In other words, is finitely supported if there exists some such that for all . Let be the sequences from Example 9.19. Show that if and only if is finitely supported.
Exercise 9.2.8
Consider polynomials
Show that this collection of polynomials is linearly independent if and only if
is an invertible matrix.
Exercise 9.2.9
Assume are linearly independent elements of some vector space . Consider the set of vectors
Determine whether is linearly independent.
Adapted from Matrix Theory and Linear Algebra © 2017–2026 Peter Selinger, Lyryx Learning, and Ken Kuttler. Licensed under CC BY 4.0. Source: Matrix Theory and Linear Algebra. Imported at revision d74bc3a.