The three vectors are coplanar precisely when their scalar triple product vanishes:This includes linearly dependent or zero vectors. It expresses that the determinant with those vectors as columns is zero.
For the two moving particles, distinguish closest approach at a common time from the geometric distance between their supporting lines. For fixed reference times, putTheir relative position is . If , the closest approach of two uniformly moving particles occurs atIf , the distance is constant. If only is permitted, replace by before evaluating the distance.
Now suppose the velocities are nonparallel, and allow the relative starting-time offset to be chosen so that the particles reach the closest points of the two lines simultaneously. Write , , , and . The independent line parameters at the closest points satisfyThese equations make the connecting vector perpendicular to both velocities. Solving the two-by-two linear system givesThe corresponding distance between skew lines is . Simultaneous arrival requires , so . Since the vector triple product givesthis condition is preciselyThus the printed formula has a valid interpretation as a synchronization condition for attaining the line-distance lower bound. It is not an identity that must hold for arbitrary fixed reference times at the time of closest approach.
For a counterexample to that stronger reading, take , , , and . The actual squared distance is , minimized at . The printed right-hand side is , whereas the fixed difference is zero. The line-distance bound is one, but it is not attained by that synchronized motion. Parallel velocities also require separate treatment because the displayed denominator then vanishes.
Articles by others on the same topic
There are currently no matching articles.
