Linear Algebra 6: Column Space and Nullspace | MIT 18.06

Added:

Vector Spaces
Subspace Operations
Column Space
Solving Ax=b
Solvability Condition
Column Dependence
Null Space
Null Space Form
Subspace Verification
Non-homogeneous Systems

Vector Spaces

0:09
Playing Section
  • 1

    Defines vector spaces by closure under addition and scalar multiplication.

  • 2

    Illustrates with R³, planes, and lines through the origin as valid subspaces.

  • 3

    Highlights that subspaces must always contain the zero vector.

Understanding the formal definition of a vector space and its subspaces, including closure under addition and scalar multiplication.
Proficiency in matrix-vector multiplication, specifically understanding the formulation Ax as a linear combination of the columns of A.
Familiarity with systems of linear equations (Ax = b) and how to perform Gaussian elimination to reach row echelon form.
Core concepts of linear independence, spanning sets, and the definition of a basis.
Formulating the complete solution to Ax = b by combining a particular solution with the nullspace solutions (special solutions).
Studying the Four Fundamental Subspaces of a matrix (Column Space, Nullspace, Row Space, and Left Nullspace) and their geometric relationships.
Understanding the Rank-Nullity Theorem, which connects the dimensions of the column space and nullspace to the number of columns in a matrix.
Exploring projections and least squares approximations, which are used to find 'best-fit' solutions when b is not in the column space of A.
Connecting nullspaces to eigenvalues and eigenvectors, specifically defining eigenspaces as the nullspace of (A - λI).
1M views9.8Klikes46:01@mitocwOriginal Release: 2009-05-07

In linear algebra, the column space of a matrix A is the set of all possible linear combinations of its columns, forming a subspace of R^m (where m is the number of rows), and Ax = b has a solution exactly when b is in the column space; conversely, the nullspace (or kernel) of A is the set of all solutions x to Ax = 0, which always forms a subspace of R^n (where n is the number of columns), and unlike the column space which contains right-hand sides b, the nullspace contains the solution vectors x. Both subspaces are fundamental to understanding when and how systems of linear equations can be solved.