SOLVER7 Study. Nothing Else.
Exercise 11.2 Q14

Find the shortest distance between the lines whose vector equations are \(\overrightarrow{r}=(\overset{\frown}{i}+2\overset{\frown}{j}+3\overset{\frown}{k})+\lambda(\overset{\frown}{i}-3\overset{\frown}{j}+2\overset{\frown}{k})\) and \(\overrightarrow{r}=4\overset{\frown}{i}+5\overset{\frown}{j}+6\overset{\frown}{k}+\mu(2\overset{\frown}{i}+3\overset{\frown}{j}+\overset{\frown}{k})\)

CBSE Class 12 Maths · Three Dimensional Geometry

Solution

👶 Simple Explanation

Simple Explanation

Imagine two train tracks floating in the air, going in different directions and never crossing. The shortest distance between them is like stretching a tiny rubber band straight across, touching both tracks at once. That rubber band is always perfectly perpendicular to both tracks. Here, we find exactly how long that rubber band is between two such floating lines in space. The answer turns out to be \( \frac{3\sqrt{19}}{19} \) units.

Answer: The shortest distance between the two lines is \[ d = \frac{3}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \text{ units} \]

📖 Shortest Distance Between Two Skew Lines

Detailed Explanation

Two lines in space can be parallel, intersecting, or skew (neither parallel nor intersecting). When lines do not meet, there is a unique shortest distance between them, measured along the common perpendicular. If a line passes through point \( \vec{a_1} \) with direction \( \vec{b_1} \), and another passes through \( \vec{a_2} \) with direction \( \vec{b_2} \), the shortest distance is found by projecting the joining vector \( \vec{a_2} - \vec{a_1} \) onto the common perpendicular direction \( \vec{b_1} \times \vec{b_2} \). The cross product \( \vec{b_1} \times \vec{b_2} \) gives a vector perpendicular to both lines, and its magnitude scales the projection correctly.

Formula Used

For lines \( \vec{r} = \vec{a_1} + \lambda \vec{b_1} \) and \( \vec{r} = \vec{a_2} + \mu \vec{b_2} \), the shortest distance is \[ 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| \]

Solution

  1. Step 1: Identify the point vectors and direction vectors from each line. For the first line, \( \vec{a_1} = \hat{i} + 2\hat{j} + 3\hat{k} \) and \( \vec{b_1} = \hat{i} - 3\hat{j} + 2\hat{k} \). For the second line, \( \vec{a_2} = 4\hat{i} + 5\hat{j} + 6\hat{k} \) and \( \vec{b_2} = 2\hat{i} + 3\hat{j} + \hat{k} \).
  2. Step 2: Find the joining vector between the two given points. \[ \vec{a_2} - \vec{a_1} = (4-1)\hat{i} + (5-2)\hat{j} + (6-3)\hat{k} \] \[ \vec{a_2} - \vec{a_1} = 3\hat{i} + 3\hat{j} + 3\hat{k} \]
  3. Step 3: Compute the cross product \( \vec{b_1} \times \vec{b_2} \), which gives a direction perpendicular to both lines. \[ \vec{b_1} \times \vec{b_2} = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 1 & -3 & 2 \\ 2 & 3 & 1 \end{vmatrix} \] Expanding along the first row: \[ \hat{i}((-3)(1) - (2)(3)) - \hat{j}((1)(1) - (2)(2)) + \hat{k}((1)(3) - (-3)(2)) \] \[ = \hat{i}(-3 - 6) - \hat{j}(1 - 4) + \hat{k}(3 + 6) \] \[ = -9\hat{i} + 3\hat{j} + 9\hat{k} \]
  4. Step 4: Find the magnitude of the cross product, which appears in the denominator. \[ |\vec{b_1} \times \vec{b_2}| = \sqrt{(-9)^2 + 3^2 + 9^2} \] \[ = \sqrt{81 + 9 + 81} = \sqrt{171} = 3\sqrt{19} \]
  5. Step 5: Compute the dot product of the cross product with the joining vector, which is the numerator. \[ (\vec{b_1} \times \vec{b_2}) \cdot (\vec{a_2} - \vec{a_1}) = (-9)(3) + (3)(3) + (9)(3) \] \[ = -27 + 9 + 27 = 9 \]
  6. Step 6: Substitute the numerator and denominator into the shortest distance formula. \[ d = \left| \frac{9}{3\sqrt{19}} \right| = \frac{3}{\sqrt{19}} \] Rationalising the denominator: \[ d = \frac{3}{\sqrt{19}} \times \frac{\sqrt{19}}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \]

Final Answer

The shortest distance between the two lines is \[ d = \frac{3}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \text{ units} \]

Common Mistake

A common mistake is forgetting to take the absolute value of the numerator, which can give a negative distance. Distance must always be non-negative, so the final result is enclosed in a modulus.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read off the position vectors and direction vectors from each line. From the first line: \( \vec{a_1} = \hat{i} + 2\hat{j} + 3\hat{k} \) and \( \vec{b_1} = \hat{i} - 3\hat{j} + 2\hat{k} \). From the second line: \( \vec{a_2} = 4\hat{i} + 5\hat{j} + 6\hat{k} \) and \( \vec{b_2} = 2\hat{i} + 3\hat{j} + \hat{k} \). — Reason: Identifying these four vectors is the essential first step before applying the shortest-distance formula.
  2. Step 2: Compute the vector joining the two base points: \[ \vec{a_2} - \vec{a_1} = (4-1)\hat{i} + (5-2)\hat{j} + (6-3)\hat{k} = 3\hat{i} + 3\hat{j} + 3\hat{k} \] — Reason: This joining vector connects a point on each line and is needed for the numerator of the distance formula.
  3. Step 3: Calculate the cross product \( \vec{b_1} \times \vec{b_2} \) using the determinant form: \[ \vec{b_1} \times \vec{b_2} = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 1 & -3 & 2 \\ 2 & 3 & 1 \end{vmatrix} \] Expanding along the first row: \( \hat{i}[(-3)(1) - (2)(3)] - \hat{j}[(1)(1) - (2)(2)] + \hat{k}[(1)(3) - (-3)(2)] \) which gives \( \hat{i}(-3 - 6) - \hat{j}(1 - 4) + \hat{k}(3 + 6) \), so \[ \vec{b_1} \times \vec{b_2} = -9\hat{i} + 3\hat{j} + 9\hat{k} \] — Reason: The cross product yields a vector perpendicular to both lines, which defines the direction of the common perpendicular (the shortest path between the skew lines).
  4. Step 4: Find the magnitude of \( \vec{b_1} \times \vec{b_2} \): \[ |\vec{b_1} \times \vec{b_2}| = \sqrt{(-9)^2 + 3^2 + 9^2} = \sqrt{81 + 9 + 81} = \sqrt{171} = 3\sqrt{19} \] — Reason: This magnitude serves as the denominator of the distance formula, normalising the projection so we get the true perpendicular distance.
  5. Step 5: Compute the dot product of \( \vec{b_1} \times \vec{b_2} \) with \( \vec{a_2} - \vec{a_1} \): \[ (-9\hat{i} + 3\hat{j} + 9\hat{k}) \cdot (3\hat{i} + 3\hat{j} + 3\hat{k}) = (-9)(3) + (3)(3) + (9)(3) = -27 + 9 + 27 = 9 \] — Reason: This dot product projects the joining vector onto the common perpendicular direction, giving the signed length along that perpendicular.
  6. Step 6: Substitute all computed values into the shortest-distance formula: \[ d = \left| \frac{9}{3\sqrt{19}} \right| = \frac{3}{\sqrt{19}} \] Rationalising the denominator: \[ d = \frac{3}{\sqrt{19}} \times \frac{\sqrt{19}}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \] — Reason: Taking the absolute value ensures distance is non-negative, and rationalising the denominator puts the answer in the standard simplified form.

Final Answer

The shortest distance between the two lines is \[ d = \frac{3}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \text{ units} \]

Common Mistake

One common mistake: Students often forget to take the absolute value of the dot product in the numerator, which can yield a negative distance when the joining vector points opposite to the cross product direction — distance is always a non-negative quantity.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( \vec{a_1} = \hat{i} + 2\hat{j} + 3\hat{k} \), \( \vec{b_1} = \hat{i} - 3\hat{j} + 2\hat{k} \), \( \vec{a_2} = 4\hat{i} + 5\hat{j} + 6\hat{k} \), \( \vec{b_2} = 2\hat{i} + 3\hat{j} + \hat{k} \), so \( \vec{a_2} - \vec{a_1} = 3\hat{i} + 3\hat{j} + 3\hat{k} \).
  2. Step 2: \[ \vec{b_1} \times \vec{b_2} = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 1 & -3 & 2 \\ 2 & 3 & 1 \end{vmatrix} = (-3-6)\hat{i} - (1-4)\hat{j} + (3+6)\hat{k} = -9\hat{i} + 3\hat{j} + 9\hat{k} \]
  3. Step 3: \( |\vec{b_1} \times \vec{b_2}| = \sqrt{(-9)^2 + 3^2 + 9^2} = \sqrt{81 + 9 + 81} = \sqrt{171} = 3\sqrt{19} \) and \( (\vec{b_1} \times \vec{b_2}) \cdot (\vec{a_2} - \vec{a_1}) = (-9)(3) + (3)(3) + (9)(3) = -27 + 9 + 27 = 9 \).
  4. Step 4: \[ d = \left| \frac{9}{3\sqrt{19}} \right| = \frac{3}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \]

Answer: The shortest distance between the two lines is \[ d = \frac{3}{\sqrt{19}} = \frac{3\sqrt{19}}{19} \text{ units} \]

➕ More Examples

More Examples

Example 1

Question: Find the shortest distance between the lines whose vector equations are \(\vec{r} = (2\hat{i} - \hat{j} + 3\hat{k}) + \lambda(\hat{i} + 2\hat{j} - \hat{k})\) and \(\vec{r} = (3\hat{i} + \hat{j} - \hat{k}) + \mu(2\hat{i} - \hat{j} + 3\hat{k})\).

Solution: We identify the components from the two lines. For the first line: \(\vec{a_1} = 2\hat{i} - \hat{j} + 3\hat{k}\) and \(\vec{b_1} = \hat{i} + 2\hat{j} - \hat{k}\). For the second line: \(\vec{a_2} = 3\hat{i} + \hat{j} - \hat{k}\) and \(\vec{b_2} = 2\hat{i} - \hat{j} + 3\hat{k}\). Step 1: Compute \(\vec{a_2} - \vec{a_1}\). \[\vec{a_2} - \vec{a_1} = (3-2)\hat{i} + (1-(-1))\hat{j} + (-1-3)\hat{k} = \hat{i} + 2\hat{j} - 4\hat{k}\] Step 2: Compute \(\vec{b_1} \times \vec{b_2}\). \[\vec{b_1} \times \vec{b_2} = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 1 & 2 & -1 \\ 2 & -1 & 3 \end{vmatrix}\] Expanding along the first row: \[\vec{b_1} \times \vec{b_2} = \hat{i}\bigl((2)(3) - (-1)(-1)\bigr) - \hat{j}\bigl((1)(3) - (-1)(2)\bigr) + \hat{k}\bigl((1)(-1) - (2)(2)\bigr)\] \[= \hat{i}(6 - 1) - \hat{j}(3 + 2) + \hat{k}(-1 - 4)\] \[= 5\hat{i} - 5\hat{j} - 5\hat{k}\] Step 3: Compute \(|\vec{b_1} \times \vec{b_2}|\). \[|\vec{b_1} \times \vec{b_2}| = \sqrt{5^2 + (-5)^2 + (-5)^2} = \sqrt{25 + 25 + 25} = \sqrt{75} = 5\sqrt{3}\] Step 4: Compute \((\vec{a_2} - \vec{a_1}) \cdot (\vec{b_1} \times \vec{b_2})\). \[(\hat{i} + 2\hat{j} - 4\hat{k}) \cdot (5\hat{i} - 5\hat{j} - 5\hat{k})\] \[= (1)(5) + (2)(-5) + (-4)(-5) = 5 - 10 + 20 = 15\] Step 5: Apply the shortest distance formula. \[d = \frac{|15|}{5\sqrt{3}} = \frac{15}{5\sqrt{3}} = \frac{3}{\sqrt{3}} = \frac{3\sqrt{3}}{3} = \sqrt{3}\]

Answer: The shortest distance between the two lines is \(\sqrt{3}\) units.

Example 2

Question: Find the shortest distance between the lines whose vector equations are \(\vec{r} = (\hat{i} - \hat{j} + 2\hat{k}) + \lambda(3\hat{i} + \hat{j} + 2\hat{k})\) and \(\vec{r} = (2\hat{i} + 3\hat{j} - \hat{k}) + \mu(\hat{i} - 2\hat{j} + 3\hat{k})\).

Solution: We identify the components from the two lines. For the first line: \(\vec{a_1} = \hat{i} - \hat{j} + 2\hat{k}\) and \(\vec{b_1} = 3\hat{i} + \hat{j} + 2\hat{k}\). For the second line: \(\vec{a_2} = 2\hat{i} + 3\hat{j} - \hat{k}\) and \(\vec{b_2} = \hat{i} - 2\hat{j} + 3\hat{k}\). Step 1: Compute \(\vec{a_2} - \vec{a_1}\). \[\vec{a_2} - \vec{a_1} = (2-1)\hat{i} + (3-(-1))\hat{j} + (-1-2)\hat{k} = \hat{i} + 4\hat{j} - 3\hat{k}\] Step 2: Compute \(\vec{b_1} \times \vec{b_2}\). \[\vec{b_1} \times \vec{b_2} = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 3 & 1 & 2 \\ 1 & -2 & 3 \end{vmatrix}\] Expanding along the first row: \[\vec{b_1} \times \vec{b_2} = \hat{i}\bigl((1)(3) - (2)(-2)\bigr) - \hat{j}\bigl((3)(3) - (2)(1)\bigr) + \hat{k}\bigl((3)(-2) - (1)(1)\bigr)\] \[= \hat{i}(3 + 4) - \hat{j}(9 - 2) + \hat{k}(-6 - 1)\] \[= 7\hat{i} - 7\hat{j} - 7\hat{k}\] Step 3: Compute \(|\vec{b_1} \times \vec{b_2}|\). \[|\vec{b_1} \times \vec{b_2}| = \sqrt{7^2 + (-7)^2 + (-7)^2} = \sqrt{49 + 49 + 49} = \sqrt{147} = 7\sqrt{3}\] Step 4: Compute \((\vec{a_2} - \vec{a_1}) \cdot (\vec{b_1} \times \vec{b_2})\). \[(\hat{i} + 4\hat{j} - 3\hat{k}) \cdot (7\hat{i} - 7\hat{j} - 7\hat{k})\] \[= (1)(7) + (4)(-7) + (-3)(-7) = 7 - 28 + 21 = 0\] Step 5: Apply the shortest distance formula. \[d = \frac{|0|}{7\sqrt{3}} = 0\] Since the shortest distance is 0, the two lines are intersecting (they meet at a point).

Answer: The shortest distance between the two lines is \(0\) units, meaning the lines intersect.

🎯 Try a Similar Question

Try a Similar Question

Question: Find the shortest distance between the lines whose vector equations are \(\vec{r} = (2\hat{i} + 3\hat{j} + \hat{k}) + \lambda(\hat{i} - 2\hat{j} + 3\hat{k})\) and \(\vec{r} = (3\hat{i} + \hat{j} - 2\hat{k}) + \mu(2\hat{i} + \hat{j} - \hat{k})\).

Solution

  1. Step 1: Identify the vectors: From the two lines, we identify: \(\vec{a_1} = 2\hat{i} + 3\hat{j} + \hat{k}\), \(\vec{b_1} = \hat{i} - 2\hat{j} + 3\hat{k}\) \(\vec{a_2} = 3\hat{i} + \hat{j} - 2\hat{k}\), \(\vec{b_2} = 2\hat{i} + \hat{j} - \hat{k}\)
  2. Step 2: Compute \(\vec{a_2} - \vec{a_1}\): \[\vec{a_2} - \vec{a_1} = (3-2)\hat{i} + (1-3)\hat{j} + (-2-1)\hat{k} = \hat{i} - 2\hat{j} - 3\hat{k}\]
  3. Step 3: Compute \(\vec{b_1} \times \vec{b_2}\): We compute the cross product using the determinant form: \[\vec{b_1} \times \vec{b_2} = \begin{vmatrix} \hat{i} & \hat{j} & \hat{k} \\ 1 & -2 & 3 \\ 2 & 1 & -1 \end{vmatrix}\] Expanding along the first row: \(\hat{i}\) component: \((-2)(-1) - (3)(1) = 2 - 3 = -1\) \(\hat{j}\) component: \(-[(1)(-1) - (3)(2)] = -[-1 - 6] = 7\) \(\hat{k}\) component: \((1)(1) - (-2)(2) = 1 + 4 = 5\) So \(\vec{b_1} \times \vec{b_2} = -\hat{i} + 7\hat{j} + 5\hat{k}\)
  4. Step 4: Compute \(|\vec{b_1} \times \vec{b_2}|\): \[|\vec{b_1} \times \vec{b_2}| = \sqrt{(-1)^2 + 7^2 + 5^2} = \sqrt{1 + 49 + 25} = \sqrt{75} = 5\sqrt{3}\]
  5. Step 5: Compute the dot product \((\vec{a_2} - \vec{a_1}) \cdot (\vec{b_1} \times \vec{b_2})\): \[(\hat{i} - 2\hat{j} - 3\hat{k}) \cdot (-\hat{i} + 7\hat{j} + 5\hat{k})\] \[= (1)(-1) + (-2)(7) + (-3)(5) = -1 - 14 - 15 = -30\]
  6. Step 6: Apply the shortest distance formula: \[d = \frac{|(\vec{a_2} - \vec{a_1}) \cdot (\vec{b_1} \times \vec{b_2})|}{|\vec{b_1} \times \vec{b_2}|} = \frac{|-30|}{5\sqrt{3}} = \frac{30}{5\sqrt{3}} = \frac{6}{\sqrt{3}} = \frac{6\sqrt{3}}{3} = 2\sqrt{3}\]

Answer: The shortest distance between the two given lines is \(2\sqrt{3}\) units.

Everything you get with Solver7

More questions in Three Dimensional Geometry