The vector triple product identity is
Thus the expression lies in the linear span of and , with respective scalar coefficients and . The order and the minus sign matter because the cross product is not an associative operation.
The nonzero vectors are normal vectors to the two planes. If , then for some nonzero real . Their equations are therefore and .
When , the planes coincide and their intersection is an entire plane. Otherwise they are distinct parallel planes and have no intersection. Neither case has exactly a line as its intersection. Hence is necessary for intersection in a line. It means that the two normal vectors are not parallel; in that case it is also sufficient.
Apply the vector triple product identity and the two plane constraints:
Put . If is one intersection point, subtraction gives , so is parallel to . Conversely, adding any multiple of preserves both plane constraints because is orthogonal to both normal vectors. The whole intersection is therefore
Such an exists: choose and solve the two-by-two linear system with determinant . This also proves sufficiency rather than assuming a nonempty intersection.
The squared Euclidean distance along the line is
Its minimum occurs at exactly when its derivative there vanishes, so . Since are independent, their linear span is the two-dimensional orthogonal complement of . Consequently
for unique real . This is the closest point on the intersection of two planes; the positive quadratic coefficient proves that the stationary distance is a strict global minimum.
With , substitute into the plane constraints. They become and , giving
The Pythagorean theorem for the two orthogonal terms in then gives the closest distance
Zero values of either scalar are allowed, including zero distance if both planes contain the origin.

Articles by others on the same topic (0)

There are currently no matching articles.