Unit 3: The Straight Line in Space & Skew Lines
Comprehensive analysis of lines in three dimensions: vector, symmetric, and general two-plane representations, coplanarity criteria, and the complete derivation and computation of the shortest distance between skew lines.
ยง3.1 3.1 Parametric, Symmetric, and General (Two-Plane) Forms of a 3D Line
A straight line in $\mathbb{R}^3$ is uniquely determined either by:
- A point through which it passes and its direction in space (specified by a direction vector or direction cosines).
- The intersection of two non-parallel planes.
1. Vector and Parametric Equations
Let a line $\mathcal{L}$ pass through a fixed point $A$ with position vector $\vec{a} = x_1\hat{i} + y_1\hat{j} + z_1\hat{k}$ and be parallel to a direction vector $\vec{d} = l\hat{i} + m\hat{j} + n\hat{k}$.
If $P$ with position vector $\vec{r} = x\hat{i} + y\hat{j} + z\hat{k}$ is any arbitrary point on the line, the vector $\vec{AP} = \vec{r} - \vec{a}$ is collinear with $\vec{d}$. Hence, there exists a scalar parameter $t \in \mathbb{R}$ such that:
Equating components along the standard basis vectors:
These are the parametric equations of the straight line.
2. Symmetrical (Standard) Cartesian Form
Eliminating the scalar parameter $t$ from the parametric equations (assuming $l, m, n \neq 0$):
This is the canonical symmetrical form of a line passing through $(x_1, y_1, z_1)$ with direction ratios $(l, m, n)$.
Convention when a direction ratio vanishes: If one direction ratio is zero, say $n = 0$, the line lies in a plane parallel to the $xy$-plane ($z = z_1$). We write:
If $l, m, n$ are normalized to actual direction cosines $(\cos\alpha, \cos\beta, \cos\gamma)$, then the parameter $r = t$ represents the actual directed algebraic distance along the line from $(x_1, y_1, z_1)$ to $(x, y, z)$.
3. Two-Point Form of a Line
If the line passes through two distinct points $A(x_1, y_1, z_1)$ and $B(x_2, y_2, z_2)$, its direction vector is $\vec{d} = \vec{AB} = (x_2 - x_1)\hat{i} + (y_2 - y_1)\hat{j} + (z_2 - z_1)\hat{k}$. The symmetric equations become:
4. Non-Symmetric Form (General Equation as Two Planes)
A straight line in $\mathbb{R}^3$ can also be represented as the simultaneous intersection of two non-parallel planes:
where the normal vectors $\vec{n}_1 = (a_1, b_1, c_1)$ and $\vec{n}_2 = (a_2, b_2, c_2)$ are not proportional ($\vec{n}_1 \times \vec{n}_2 \neq \vec{0}$).
Algorithm: Reduction from General Form to Symmetrical Form
To convert the two-plane system into symmetrical form $\frac{x - x_0}{l} = \frac{y - y_0}{m} = \frac{z - z_0}{n}$:
1. Find the Direction Ratios $(l, m, n)$:
Since the line lies entirely in both $\Pi_1$ and $\Pi_2$, its direction vector $\vec{d}$ must be perpendicular to both normals $\vec{n}_1$ and $\vec{n}_2$. Thus:
Hence, $(l, m, n) = (b_1 c_2 - b_2 c_1, \; c_1 a_2 - c_2 a_1, \; a_1 b_2 - a_2 b_1)$.
2. Find a Specific Point $(x_0, y_0, z_0)$ on the Line:
Set one coordinate to a convenient constant (frequently $z = 0$, provided $a_1 b_2 - a_2 b_1 \neq 0$) and solve the resulting system of two linear equations in two variables:
Using Cramer's Rule:
The symmetrical equation is then immediately established.
ยง3.2 3.2 Intersection, Angle, and Coplanarity of Two Straight Lines
1. Angle Between Two Straight Lines
Let two lines $\mathcal{L}_1$ and $\mathcal{L}_2$ have direction ratios $(l_1, m_1, n_1)$ and $(l_2, m_2, n_2)$ respectively. The angle $\theta$ between them is the angle between their direction vectors:
- Perpendicularity: $l_1 l_2 + m_1 m_2 + n_1 n_2 = 0$.
- Parallelism: $\frac{l_1}{l_2} = \frac{m_1}{m_2} = \frac{n_1}{n_2}$.
2. Coplanarity Criterion for Two Lines
Consider two lines in space given in symmetric form:
Let $A(x_1, y_1, z_1)$ lie on $\mathcal{L}_1$ and $B(x_2, y_2, z_2)$ lie on $\mathcal{L}_2$. Their direction vectors are $\vec{d}_1 = (l_1, m_1, n_1)$ and $\vec{d}_2 = (l_2, m_2, n_2)$.
Two straight lines are coplanar (lie in a single shared plane) if and only if they either intersect at a unique point or are strictly parallel. In both cases, the displacement vector connecting points on the two lines, $\vec{AB} = (x_2 - x_1)\hat{i} + (y_2 - y_1)\hat{j} + (z_2 - z_1)\hat{k}$, must lie in the plane spanned by $\vec{d}_1$ and $\vec{d}_2$.
Consequently, the scalar triple product of $\vec{AB}$, $\vec{d}_1$, and $\vec{d}_2$ must vanish:
Expanding this into determinant form yields the fundamental condition of coplanarity:
3. Equation of the Plane Containing Coplanar Lines
If the coplanarity determinant vanishes and the lines are not parallel ($\vec{d}_1 \times \vec{d}_2 \neq \vec{0}$), they span a unique plane $\Pi$. Since the plane contains point $(x_1, y_1, z_1)$ and both direction vectors $\vec{d}_1$ and $\vec{d}_2$, the equation of the plane is:
Alternatively, using the reference point $(x_2, y_2, z_2)$ yields an identical plane.
ยง3.3 3.3 Skew Lines and the Shortest Distance
In two dimensions, any two non-parallel lines must intersect. In three dimensions, this is no longer true.
1. Definition of Skew Lines
Two straight lines in $\mathbb{R}^3$ are defined as skew lines if they are neither parallel nor intersecting. Skew lines do not lie in any common plane; they exist in distinct, non-parallel planes.
2. Derivation of the Shortest Distance (S.D.) Formula
Let $\mathcal{L}_1$ pass through $A(\vec{a}_1)$ with direction $\vec{d}_1$, and $\mathcal{L}_2$ pass through $B(\vec{a}_2)$ with direction $\vec{d}_2$.
The shortest distance between $\mathcal{L}_1$ and $\mathcal{L}_2$ is measured along their common perpendicular โ the unique line that intersects both $\mathcal{L}_1$ and $\mathcal{L}_2$ at right angles.
Let $\vec{n}$ be a vector perpendicular to both lines. By definition:
The unit vector in this common normal direction is:
Consider the connecting vector $\vec{AB} = \vec{a}_2 - \vec{a}_1$. The shortest distance $d$ is precisely the absolute length of the orthogonal projection of $\vec{AB}$ onto the common normal $\hat{n}$:
3. Cartesian Determinant Form of Shortest Distance
Substituting $\vec{a}_1 = (x_1, y_1, z_1)$, $\vec{a}_2 = (x_2, y_2, z_2)$, $\vec{d}_1 = (l_1, m_1, n_1)$, and $\vec{d}_2 = (l_2, m_2, n_2)$:
The numerator is the determinant:
The cross product in the denominator is:
Its magnitude is:
Thus, the exact Cartesian formula for the shortest distance is:
4. Equations of the Line of Shortest Distance
The line of shortest distance (the common perpendicular $\mathcal{L}_{SD}$) can be represented as the intersection of two planes:
- The plane containing $\mathcal{L}_1$ and parallel to the common normal $\vec{n} = \vec{d}_1 \times \vec{d}_2$.
- The plane containing $\mathcal{L}_2$ and parallel to the common normal $\vec{n} = \vec{d}_1 \times \vec{d}_2$.
Let $(l, m, n)$ be the direction ratios of the common perpendicular $\vec{n} = \vec{d}_1 \times \vec{d}_2$. Then the two defining planes are:
The simultaneous solution of these two plane equations defines the exact straight line of shortest distance in $\mathbb{R}^3$.
Step-by-Step Solved Examination Problems
Comprehensive analytical derivations, multi-tier solutions (Foundational, Intermediate Exam, and Honors/Proof Challenge) with complete line-by-line verification.
Find the symmetrical form of the line given as the intersection of the two planes:
Hence, find its direction ratios and a specific point on the line.
Step 1: Compute the direction vector of the line The normal vectors to the planes are:
The direction vector $\vec{d} = (l, m, n)$ of the line is perpendicular to both $\vec{n}_1$ and $\vec{n}_2$:
Expanding by components:
Thus, the direction ratios are $(l, m, n) = (1, -3, -5)$.
Step 2: Find a point on the line Set $z = 0$ in both plane equations:
Multiply the second equation by 2 and add to the first:
Substitute $x = 1$ back:
Thus, the point $P_0(1, 1, 0)$ lies on the line.
Step 3: Write the symmetrical equation
Or equivalently, multiplying direction ratios by $-1$:
Find the shortest distance between the two skew lines:
Determine also whether the lines intersect.
Step 1: Identify reference points and direction vectors
- Line $\mathcal{L}_1$: passes through $A(x_1, y_1, z_1) = (3, 5, 7)$ with direction $\vec{d}_1 = (1, -2, 1)$.
- Line $\mathcal{L}_2$: passes through $B(x_2, y_2, z_2) = (-1, -1, -1)$ with direction $\vec{d}_2 = (7, -6, 1)$.
The connecting vector $\vec{AB} = \vec{r}_2 - \vec{r}_1$ is:
Step 2: Compute the cross product $\vec{d}_1 \times \vec{d}_2$
Thus, $\vec{d}_1 \times \vec{d}_2 = 4\hat{i} + 6\hat{j} + 8\hat{k}$.
Its magnitude is:
Step 3: Evaluate the scalar triple product (numerator)
Step 4: Compute the shortest distance
Numerically, $2\sqrt{29} \approx 2 \times 5.3852 = 10.77$ units. Since $d \neq 0$, the lines do not intersect; they are skew.
Prove that the two lines:
are coplanar. Find: (a) The coordinates of their unique point of intersection. (b) The Cartesian equation of the plane containing both lines.
Part (a): Test for Coplanarity From $\mathcal{L}_1$: $A(x_1, y_1, z_1) = (1, 2, 3)$, direction $(l_1, m_1, n_1) = (2, 3, 4)$. From $\mathcal{L}_2$: $B(x_2, y_2, z_2) = (2, 3, 4)$, direction $(l_2, m_2, n_2) = (3, 4, 5)$.
Difference vector:
Construct the coplanarity determinant:
Perform row operations: $R_2 \to R_2 - 2R_1$ and $R_3 \to R_3 - 3R_1$:
Since $\Delta = 0$ and the direction vectors are linearly independent ($\frac{2}{3} \neq \frac{3}{4}$), the two lines are coplanar and intersect at a unique point.
Part (b): Coordinates of the Point of Intersection Express general points on both lines using parameters $s$ and $t$:
Equating coordinates:
From $3 \times (1) - 2 \times (2)$:
Substituting $t = -1$ into (1):
Check third coordinate for consistency:
Substituting $s = -1$ into $P_1$:
Thus, the lines intersect at $(-1, -1, -1)$.
Part (c): Equation of the Common Plane The plane contains point $A(1, 2, 3)$ and direction vectors $(2, 3, 4)$ and $(3, 4, 5)$:
Expanding along the first row:
Multiplying by $-1$:
This is the exact Cartesian equation of the plane containing both lines.