Q.Find the shortest distance between the lines $l_1$ and $l_2$: $l_1 : \vec{r} = \hat{i}+\hat{j}+\lambda(2\hat{i}-\hat{j}+\hat{k})$ and $l_2 : \vec{r} = 2\hat{i}+\hat{j}-\hat{k}+\mu(3\hat{i}-5\hat{j}+2\hat{k})$ OR Find the image of the point $(1, 6, 3)$ in the line $\frac{x}{1} = \frac{y-1}{2} = \frac{z-2}{3}$.

Skew Lines

In a plane, two straight lines have only two possibilities: they meet, or they are parallel. In three dimensions a third possibility appears — lines that neither meet nor run parallel. These are skew lines.

What Makes Lines Skew

Two lines in space are skew if they are not parallel and do not intersect. The deeper reason is that skew lines do not lie in the same plane — they are non-coplanar. Parallel lines and intersecting lines always share a plane; skew lines never do.

The Three Cases in Space

How to Test for Skew Lines

Take two lines $\vec{r} = \vec{a_1} + \lambda\vec{b_1}$ and $\vec{r} = \vec{a_2} + \mu\vec{b_2}$.

1. Not parallel: $\vec{b_1}$ and $\vec{b_2}$ are not proportional (so $\vec{b_1}\times\vec{b_2}\neq\vec{0}$).
2. Do not intersect: no values of $\lambda,\mu$ make the points coincide.

Both conditions are captured by one scalar triple product. The lines are skew exactly when

If this value is zero, the lines are coplanar (they intersect or are parallel); if it is non-zero, they are skew.

Shortest Distance Between Skew Lines

Because skew lines miss each other, there is a well-defined shortest distance between them, measured along their common perpendicular:

$d = \frac{\left|(\vec{a_2}-\vec{a_1})\cdot(\vec{b_1}\times\vec{b_2})\right|}{\left|\vec{b_1}\times\vec{b_2}\right|}.$ …