Multiplication of a matrix by a column vector forms the linear combination of its columns with coefficients from that vector. Hereso . Equating this expression with reproduces the original three linear equations.
For , a nonzero coefficient vector with is precisely a linear dependence of the three columns. Three vectors in three dimensions are linearly dependent exactly when the determinant of their column matrix, or their scalar triple product, is zero. ThusFor this square homogeneous linear system, the condition is also sufficient.
Subtract twice the second row from the third row when computing the determinant. The last row becomes , soIts zeros give exactly the parameter values with a nontrivial null space:
At , the first equation gives , and the second then gives . All nonzero solutions areAt , the first equation gives . The second then gives , and the third is twice the second. Choosing an integer direction vector, all nonzero solutions areEach full null space, including the zero solution, is a line through the origin. Geometrically, the three homogeneous constraint planes have that common intersection; in each case only two of their equations are independent.
At , , while and are independent. Their span is a plane. A solution requires to lie in that plane, so every scalar triple product formed from two columns and must vanish. The product with vanishes identically; the other two give the plane condition.
Explicitly, , soThus is necessary and, since the two columns span the plane, sufficient. The equations then give and , soThe solution is an affine line parallel to the homogeneous null space from part (c), obtained by intersecting the compatible constraint planes. Every point on it is nonzero because .
Articles by others on the same topic
There are currently no matching articles.