This section shows us how to think of the solution set of a linear system geometrically, in terms of vectors. The main trick is to find the solution of a related system, the homogeneous system, and then find a particular solution to the system.
The solutions are some sorts of parametric representations of points (if only a trivial solution of the homogeneous equation exists), lines, planes, hyper-planes, etc.
The homogeneous equation has a nontrivial solution
(that is, other than the zero vector
) if and only if the system
of equations has at least one free variable.
Theorem 6: Suppose the equation is consistent for
some given vector
, and let
be a particular solution. Then
the solution set of
is the set of all vectors of the form
, where
is any solution of the
homogeneous equation
.
Example: Proof (by linearity): #25, p. 56
Suppose is a solution of
, so that
. Let
be any solution of the homogeneous
equation
, and let
. Show
that
is a solution of
.
Let be any solution of
, and define
Show that
is a solution of
. This shows that every solution of
has the form
, with
a particular solution of
and
a
solution of
.
Example: #8, p. 55 [
]
Example: #9, p. 55
Summary
You might relate the solutions of these equations to your history from calculus as follows:
is the same as
It says that the row vector (which we might call ) is
perpendicular, or orthogonal, to the solution vector
.
Then
is the same as
and
i.e., that the is orthogonal to both row vector (
and
).
Now if
this says that
That is, that the projection of onto
is equal to b
You remember what this means: that
where is the angle between the vectors. Hence
says: ``the projections of x onto the rows of A make up the components
of '', and if
then is orthogonal to every row of A; or, alternatively
``x is orthogonal to the span of the row vectors of A''.
The bang is still this: the solution set of is the set of all vectors of the form
, where
is any solution of the
homogeneous equation
.
Example: #35, p. 56
Example: #37, p. 56 - assumptions matter!