Class 12 Maths, Worked in Full Past papersGet updates
Chapter 11 · Three Dimensional Geometry

Miscellaneous · Q4: Shortest distance between lines through 6i^+2j^+2k^6\hat i + 2\hat j + 2\hat k and −4i^−k^-4\hat i - \hat k

Miscellaneous ExerciseShortest distance between skew lines · Section 11.5.1
The question

Find the shortest distance between lines r⃗=6i^+2j^+2k^+λ(i^−2j^+2k^)\vec r = 6\hat i + 2\hat j + 2\hat k + \lambda(\hat i - 2\hat j + 2\hat k) and r⃗=−4i^−k^+μ(3i^−2j^−2k^)\vec r = -4\hat i - \hat k + \mu(3\hat i - 2\hat j - 2\hat k)⁠.

Exam answer

Comparing with r⃗=a⃗1+λb⃗1\vec r = \vec a_1 + \lambda\vec b_1 and r⃗=a⃗2+μb⃗2\vec r = \vec a_2 + \mu\vec b_2⁠:

a⃗1=6i^+2j^+2k^\vec a_1 = 6\hat i + 2\hat j + 2\hat k⁠, b⃗1=i^−2j^+2k^\vec b_1 = \hat i - 2\hat j + 2\hat k

a⃗2=−4i^−k^\vec a_2 = -4\hat i - \hat k⁠, b⃗2=3i^−2j^−2k^\vec b_2 = 3\hat i - 2\hat j - 2\hat k

a⃗2−a⃗1=−10i^−2j^−3k^\vec a_2 - \vec a_1 = -10\hat i - 2\hat j - 3\hat k b⃗1×b⃗2=∣i^j^k^1−223−2−2∣=(4+4)i^−(−2−6)j^+(−2+6)k^=8i^+8j^+4k^\begin{aligned} \vec b_1\times\vec b_2 &= \begin{vmatrix} \hat i & \hat j & \hat k \\ 1 & -2 & 2 \\ 3 & -2 & -2 \end{vmatrix} \\ &= (4 + 4)\hat i - (-2 - 6)\hat j \\ &\quad + (-2 + 6)\hat k \\ &= 8\hat i + 8\hat j + 4\hat k \end{aligned} ∣b⃗1×b⃗2∣=64+64+16=144=12\begin{aligned} |\vec b_1\times\vec b_2| &= \sqrt{64 + 64 + 16} \\ &= \sqrt{144} = 12 \end{aligned} (b⃗1×b⃗2)⋅(a⃗2−a⃗1)=8(−10)+8(−2)+4(−3)=−80−16−12=−108\begin{aligned} &(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1) \\ &= 8(-10) + 8(-2) + 4(-3) \\ &= -80 - 16 - 12 = -108 \end{aligned}

The shortest distance is

d=∣(b⃗1×b⃗2)⋅(a⃗2−a⃗1)∣b⃗1×b⃗2∣∣=∣−10812∣\begin{aligned} d &= \left|\frac{(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1)}{|\vec b_1\times\vec b_2|}\right| \\ &= \left|\frac{-108}{12}\right| \end{aligned}

∴\therefore The shortest distance is 9 units.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

The shortest segment between two skew lines is perpendicular to both lines, so it points along b⃗1×b⃗2\vec b_1\times\vec b_2⁠. The shortest distance is the length of the shadow of any joining vector, here a⃗2−a⃗1\vec a_2 - \vec a_1⁠, on that direction.

Given, to find, and the plan
Given
l1l_1⁠: r⃗=6i^+2j^+2k^+λ(i^−2j^+2k^)\vec r = 6\hat i + 2\hat j + 2\hat k + \lambda(\hat i - 2\hat j + 2\hat k)⁠; l2l_2⁠: r⃗=−4i^−k^\vec r = -4\hat i - \hat k + μ(3i^−2j^−2k^)+\ \mu(3\hat i - 2\hat j - 2\hat k)⁠.
To find
The shortest distance dd between l1l_1 and l2l_2⁠.
Plan
(1) Read off a⃗1,b⃗1,a⃗2,b⃗2\vec a_1, \vec b_1, \vec a_2, \vec b_2⁠. (2) Find a⃗2−a⃗1\vec a_2 - \vec a_1⁠. (3) Find b⃗1×b⃗2\vec b_1\times\vec b_2⁠. (4) Its length. (5) The dot product. (6) The formula. (7) Check by finding the closest points.

Basics you need

1Shortest distance between skew lines

For r⃗=a⃗1+λb⃗1\vec r = \vec a_1 + \lambda\vec b_1 and r⃗=a⃗2+μb⃗2\vec r = \vec a_2 + \mu\vec b_2 (Section 11.5.1):

d=∣(b⃗1×b⃗2)⋅(a⃗2−a⃗1)∣b⃗1×b⃗2∣∣.d = \left|\frac{(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1)}{|\vec b_1\times\vec b_2|}\right|.

Lesson: project onto the common perpendicular

2The cross product

b⃗1×b⃗2\vec b_1\times\vec b_2 is perpendicular to both b⃗1\vec b_1 and b⃗2\vec b_2⁠; it is computed as a determinant with i^,j^,k^\hat i, \hat j, \hat k in the top row (Section 10.6.3). Basics: the cross product

3Projection

The projection of v⃗\vec v on the direction of n⃗\vec n has length ∣v⃗⋅n⃗∣∣n⃗∣\frac{|\vec v\cdot\vec n|}{|\vec n|} (Section 10.6.2). Basics: the shadow on the gap direction

4Skew lines

Lines in space that are neither parallel nor intersecting (Section 11.5). Lesson: skew lines

Solution

  1. Read off the points and directions

    a⃗1=6i^+2j^+2k^,b⃗1=i^−2j^+2k^,a⃗2=−4i^−k^,b⃗2=3i^−2j^−2k^.\begin{aligned} \vec a_1 &= 6\hat i + 2\hat j + 2\hat k, & \vec b_1 &= \hat i - 2\hat j + 2\hat k, \\ \vec a_2 &= -4\hat i - \hat k, & \vec b_2 &= 3\hat i - 2\hat j - 2\hat k. \end{aligned}
    The vector multiplied by the parameter is the direction, the rest is a point. a⃗2=−4i^−k^\vec a_2 = -4\hat i - \hat k has no j^\hat j term, so its j^\hat j-component is 0. So l1l_1 passes through S(6,2,2)S(6, 2, 2) and l2l_2 through T(−4,0,−1)T(-4, 0, -1)⁠.
    Vector equation of a line, Section 11.3.1. Basics: a⃗ + λb⃗
  2. The joining vector a⃗2−a⃗1\vec a_2 - \vec a_1

    a⃗2−a⃗1=(−4−6)i^+(0−2)j^+(−1−2)k^=−10i^−2j^−3k^.\begin{aligned} \vec a_2 - \vec a_1 &= (-4 - 6)\hat i + (0 - 2)\hat j \\ &\quad + (-1 - 2)\hat k \\ &= -10\hat i - 2\hat j - 3\hat k. \end{aligned}
    This is ST→\overrightarrow{ST}⁠, from SS on l1l_1 to TT on l2l_2⁠: terminal minus initial. Writing the missing j^\hat j-component of a⃗2\vec a_2 as 0 avoids a slip.
    Vector joining two points (Section 10.5.2). Basics: points in space
  3. The cross product b⃗1×b⃗2\vec b_1\times\vec b_2

    b⃗1×b⃗2=∣i^j^k^1−223−2−2∣=((−2)(−2)−(2)(−2))i^−((1)(−2)−(2)(3))j^+((1)(−2)−(−2)(3))k^=8i^+8j^+4k^.\begin{aligned} \vec b_1\times\vec b_2 &= \begin{vmatrix} \hat i & \hat j & \hat k \\ 1 & -2 & 2 \\ 3 & -2 & -2 \end{vmatrix} \\ &= \big((-2)(-2) - (2)(-2)\big)\hat i \\ &\quad - \big((1)(-2) - (2)(3)\big)\hat j \\ &\quad + \big((1)(-2) - (-2)(3)\big)\hat k \\ &= 8\hat i + 8\hat j + 4\hat k. \end{aligned}
    The j^\hat j term is −(−2−6)=+8-(-2 - 6) = +8⁠: the minus sign of the middle term and the negative bracket cancel. Check: 8(1)+8(−2)+4(2)=08(1) + 8(-2) + 4(2) = 0 and 8(3)+8(−2)+4(−2)=08(3) + 8(-2) + 4(-2) = 0⁠, so it is perpendicular to both lines; it is not 0⃗\vec 0⁠, so the lines are not parallel.
    Determinant form of the cross product (Section 10.6.3). Basics: a⃗ × b⃗ stands up from both
  4. Its length

    ∣b⃗1×b⃗2∣=82+82+42=64+64+16=144=12.\begin{aligned} |\vec b_1\times\vec b_2| &= \sqrt{8^2 + 8^2 + 4^2} \\ &= \sqrt{64 + 64 + 16} \\ &= \sqrt{144} = 12. \end{aligned}
    144 is a perfect square, 12212^2⁠, so the length is a whole number.
    Length of a vector. Basics: Pythagoras in 3D
  5. The dot product

    (b⃗1×b⃗2)⋅(a⃗2−a⃗1)=(8)(−10)+(8)(−2)+(4)(−3)=−80−16−12=−108.\begin{aligned} &(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1) \\ &= (8)(-10) + (8)(-2) + (4)(-3) \\ &= -80 - 16 - 12 = -108. \end{aligned}
    Multiply matching components and add. The result is negative only because b⃗1×b⃗2\vec b_1\times\vec b_2 happens to point against ST→\overrightarrow{ST}⁠; the modulus in the formula removes the sign.
    a⃗⋅b⃗=a1b1+a2b2+a3b3\vec a\cdot\vec b = a_1b_1 + a_2b_2 + a_3b_3⁠. Basics: the dot product
  6. Put it into the formula

    d=∣(b⃗1×b⃗2)⋅(a⃗2−a⃗1)∣b⃗1×b⃗2∣∣=∣−10812∣=∣−9∣=9.\begin{aligned} d &= \left|\frac{(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1)}{|\vec b_1\times\vec b_2|}\right| \\ &= \left|\frac{-108}{12}\right| = |-9| = 9. \end{aligned}
    This is the length of the projection of ST→\overrightarrow{ST} on the unit vector along the common perpendicular. A distance is never negative, so we take the modulus. The final formula for dd on page 387 of the book (set in bold) prints (a⃗2×a⃗1)(\vec a_2 \times \vec a_1) where (a⃗2−a⃗1)(\vec a_2 - \vec a_1) is meant; the derivation just before it uses the difference.
    Section 11.5.1, shortest distance between skew lines. Lesson: the shortest distance
  7. Check: find the closest points

    Let P=a⃗1+λb⃗1P = \vec a_1 + \lambda\vec b_1 on l1l_1 and Q=a⃗2+μb⃗2Q = \vec a_2 + \mu\vec b_2 on l2l_2⁠. Then

    PQ→=(−10+3μ−λ)i^+(−2−2μ+2λ)j^+(−3−2μ−2λ)k^.\begin{aligned} \overrightarrow{PQ} &= (-10 + 3\mu - \lambda)\hat i \\ &\quad + (-2 - 2\mu + 2\lambda)\hat j \\ &\quad + (-3 - 2\mu - 2\lambda)\hat k. \end{aligned}

    PQ→⋅b⃗1=0\overrightarrow{PQ}\cdot\vec b_1 = 0 and PQ→⋅b⃗2=0\overrightarrow{PQ}\cdot\vec b_2 = 0 give

    −12−9λ+3μ=0,−20−3λ+17μ=0,\begin{aligned} -12 - 9\lambda + 3\mu &= 0, \\ -20 - 3\lambda + 17\mu &= 0, \end{aligned}

    so λ=−1\lambda = -1 and μ=1\mu = 1⁠. Then P(5,4,0)P(5, 4, 0)⁠, Q(−1,−2,−3)Q(-1, -2, -3) and

    PQ→=−6i^−6j^−3k^,PQ=36+36+9=81=9.\begin{aligned} \overrightarrow{PQ} &= -6\hat i - 6\hat j - 3\hat k, \\ PQ &= \sqrt{36 + 36 + 9} = \sqrt{81} = 9. \end{aligned}
    S(6, 2, 2) T(−4, 0, −1) P(5, 4, 0) Q(−1, −2, −3) l₁ l₂ d = 9
    Oblique projection, not to scale (lengths and right angles are not shown true). l1l_1 passes through S(6,2,2)S(6, 2, 2) and l2l_2 through T(−4,0,−1)T(-4, 0, -1)⁠. The common perpendicular joins P(5,4,0)P(5, 4, 0) and Q(−1,−2,−3)Q(-1, -2, -3) and has length 9; STST (dashed) is 113\sqrt{113}⁠.
    The first condition gives μ=4+3λ\mu = 4 + 3\lambda⁠; putting it into the second gives −20−3λ+68+51λ=0-20 - 3\lambda + 68 + 51\lambda = 0⁠, so 48λ=−4848\lambda = -48⁠, λ=−1\lambda = -1 and μ=1\mu = 1⁠. Then P=(6−1,2+2,2−2)P = (6 - 1, 2 + 2, 2 - 2) and Q=(−4+3,0−2,−1−2)Q = (-4 + 3, 0 - 2, -1 - 2)⁠. PQ→=−34(8i^+8j^+4k^)\overrightarrow{PQ} = -\frac34(8\hat i + 8\hat j + 4\hat k) lies along the common perpendicular, and its length 9 agrees with the formula. Since d≠0d \ne 0 and the lines are not parallel, they are skew.
    The line of shortest distance is perpendicular to both lines (Section 11.5). Lesson: skew lines
Result

The shortest distance between the lines is 9 units. The lines are skew.

(Textbook answer: 9.)

Check it with numbers

ST=100+4+9=113≈10.630146ST = \sqrt{100 + 4 + 9} = \sqrt{113} \approx 10.630146⁠, longer than d=9d = 9⁠, as it must be. The ratio 9113≈0.846649\frac{9}{\sqrt{113}} \approx 0.846649 is the cosine of the angle between ST→\overrightarrow{ST} and the common perpendicular, about 32.15∘32.15^\circ⁠.

Common mistakes
  1. Misreading a⃗2=−4i^−k^\vec a_2 = -4\hat i - \hat k as −4i^−j^-4\hat i - \hat j⁠, or dropping its 0 j^\hat j-component: a⃗2−a⃗1\vec a_2 - \vec a_1 has j^\hat j-component 0−2=−20 - 2 = -2⁠.
  2. The sign of the j^\hat j term: −((1)(−2)−(2)(3))=−(−8)=+8-\big((1)(-2) - (2)(3)\big) = -(-8) = +8⁠.
  3. Using a⃗2×a⃗1\vec a_2\times\vec a_1, copying the misprint in the final formula for dd on page 387 (set in bold), instead of a⃗2−a⃗1\vec a_2 - \vec a_1⁠.
  4. Leaving the answer as −9-9⁠. The modulus makes the distance positive.
What to take away
  1. Skew lines: d=∣(b⃗1×b⃗2)⋅(a⃗2−a⃗1)∣∣b⃗1×b⃗2∣d = \frac{|(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1)|}{|\vec b_1\times\vec b_2|}⁠.
  2. Write every missing component as 0 before subtracting or multiplying.
  3. Check b⃗1×b⃗2\vec b_1\times\vec b_2 by dotting it with b⃗1\vec b_1 and b⃗2\vec b_2⁠: both must give 0.

Every fact used, and where it comes from

FactUsed inSource
Reading a⃗\vec a and b⃗\vec b from r⃗=a⃗+λb⃗\vec r = \vec a + \lambda\vec bStep 1Section 11.3.1 (Basics)
Vector joining two pointsStep 2Section 10.5.2
b⃗1×b⃗2\vec b_1\times\vec b_2 as a determinant; it is perpendicular to both vectorsStep 3Section 10.6.3 (Basics)
d=∣(b⃗1×b⃗2)⋅(a⃗2−a⃗1)∣b⃗1×b⃗2∣∣d = \left|\frac{(\vec b_1\times\vec b_2)\cdot(\vec a_2 - \vec a_1)}{|\vec b_1\times\vec b_2|}\right|⁠; the final formula for dd on p. 387 (set in bold) misprints a⃗2−a⃗1\vec a_2 - \vec a_1 as a⃗2×a⃗1\vec a_2\times\vec a_1Steps 4 to 6Section 11.5.1 (Lesson)
Dot product in componentsSteps 3, 5, 7Section 10.6.1 (Basics)
Shortest segment is perpendicular to both skew linesStep 7Section 11.5 (Lesson)
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →