Lines in Space

⚡ Key Takeaways

A line in space is the set of all points satisfying r=r0+td\mathbf{r} = \mathbf{r}_0 + t\mathbf{d}, the locus of a point moving in a fixed direction d\mathbf{d} through a base point r0\mathbf{r}_0. Key result: a line in R3\mathbb{R}^3 is determined by a point and a direction vector (4 effective parameters), and two lines are either intersecting, parallel, or skew. Where it applies: analytic geometry, computer graphics, linear algebra, robotics, physics. Who/when: rooted in Euclid (~300 BCE), made algebraic by Descartes (1637) and vectorial by Gibbs and Heaviside (late 1800s).

💡 The Core Insight

A line is the orbit of a single point under translation in one fixed direction. Everything else — distances, angles, intersections — follows from comparing direction vectors and the vectors connecting base points. In R3\mathbb{R}^3, the "missing dimension" compared to the plane forces a third category of relative position (skew lines) and means a line cannot be captured by one scalar equation.

Formal Statement

DefinitionLine in Space — Vector / Parametric Form

Let r0=(x0,y0,z0)\mathbf{r}_0 = (x_0, y_0, z_0) be a fixed point in R3\mathbb{R}^3 and d=(a,b,c)≠0\mathbf{d} = (a, b, c) \neq \mathbf{0} a nonzero direction vector. The line ℓ\ell through r0\mathbf{r}_0 with direction d\mathbf{d} is:

1
ℓ={ r0+t d  :  t∈R }\quad \ell = \{\, \mathbf{r}_0 + t\,\mathbf{d} \;:\; t \in \mathbb{R} \,\}

Derivation hint: every displacement along the line is parallel to d\mathbf{d}, so it equals tdt\mathbf{d} for some scalar tt; add this to the base point. Here tt is the parameter, r=(x,y,z)\mathbf{r} = (x,y,z) the position vector of a generic point, r0\mathbf{r}_0 the base point, and d=(a,b,c)\mathbf{d}=(a,b,c) the direction with components called direction numbers. Writing components separately gives the parametric equations:

2
x=x0+at,y=y0+bt,z=z0+ct\quad x = x_0 + at,\qquad y = y_0 + bt,\qquad z = z_0 + ct

Derivation hint: read off each coordinate of the vector equation r=r0+td\mathbf{r}=\mathbf{r}_0+t\mathbf{d}. If a,b,ca,b,c are all nonzero, eliminating tt yields the symmetric (Cartesian) equations:

3
x−x0a=y−y0b=z−z0c\quad \frac{x - x_0}{a} = \frac{y - y_0}{b} = \frac{z - z_0}{c}

Derivation hint: solve each equation in [2] for tt and equate the three expressions.

DefinitionLine as Intersection of Two Planes

Equivalently, a line is the solution set of two independent linear equations:

4
{A1x+B1y+C1z=D1A2x+B2y+C2z=D2\quad \begin{cases} A_1 x + B_1 y + C_1 z = D_1 \\ A_2 x + B_2 y + C_2 z = D_2 \end{cases}

Derivation hint: each equation is a plane with normal ni=(Ai,Bi,Ci)\mathbf{n}_i=(A_i,B_i,C_i); if the normals are not parallel, the planes meet in a line. The direction of this line is d=n1×n2\mathbf{d} = \mathbf{n}_1 \times \mathbf{n}_2, the cross product of the two plane normals.

TheoremClassification of Two Lines in Space

Two distinct lines ℓ1:r1+s d1\ell_1: \mathbf{r}_1 + s\,\mathbf{d}_1 and ℓ2:r2+t d2\ell_2: \mathbf{r}_2 + t\,\mathbf{d}_2 in R3\mathbb{R}^3 fall into exactly one category: 1. Parallel if d1∥d2\mathbf{d}_1 \parallel \mathbf{d}_2 (i.e. d1×d2=0\mathbf{d}_1 \times \mathbf{d}_2 = \mathbf{0}). 2. Intersecting if d1∦d2\mathbf{d}_1 \nparallel \mathbf{d}_2 and (r2−r1)⋅(d1×d2)=0(\mathbf{r}_2 - \mathbf{r}_1) \cdot (\mathbf{d}_1 \times \mathbf{d}_2) = 0. 3. Skew if d1∦d2\mathbf{d}_1 \nparallel \mathbf{d}_2 and (r2−r1)⋅(d1×d2)≠0(\mathbf{r}_2 - \mathbf{r}_1) \cdot (\mathbf{d}_1 \times \mathbf{d}_2) \neq 0. The scalar triple product (r2−r1)⋅(d1×d2)(\mathbf{r}_2 - \mathbf{r}_1) \cdot (\mathbf{d}_1 \times \mathbf{d}_2) is the coplanarity test: it vanishes iff the four points/vectors lie in a common plane.

Why It Holds / Derivation

ProofDistance Between Two Skew Lines

We derive the minimum distance between skew lines ℓ1:r1+s d1\ell_1: \mathbf{r}_1 + s\,\mathbf{d}_1 and ℓ2:r2+t d2\ell_2: \mathbf{r}_2 + t\,\mathbf{d}_2.

Step 1. The shortest connecting segment must be perpendicular to both lines, so its direction is parallel to n=d1×d2\mathbf{n} = \mathbf{d}_1 \times \mathbf{d}_2 (nonzero since the lines are not parallel).

Step 2. Take any vector joining the lines, e.g. w=r2−r1\mathbf{w} = \mathbf{r}_2 - \mathbf{r}_1, connecting base points.

Step 3. The distance equals the length of the projection of w\mathbf{w} onto the common normal direction n^=n/∥n∥\hat{\mathbf{n}} = \mathbf{n}/\|\mathbf{n}\|:

5
d=∣w⋅n^∣=∣(r2−r1)⋅(d1×d2)∣∥d1×d2∥\quad d = \left| \mathbf{w} \cdot \hat{\mathbf{n}} \right| = \frac{\left| (\mathbf{r}_2 - \mathbf{r}_1) \cdot (\mathbf{d}_1 \times \mathbf{d}_2) \right|}{\|\mathbf{d}_1 \times \mathbf{d}_2\|}

Derivation hint: project the base-to-base vector onto the unit common normal; the components along d1,d2\mathbf{d}_1,\mathbf{d}_2 contribute nothing because n⊥d1,d2\mathbf{n}\perp\mathbf{d}_1,\mathbf{d}_2.

Step 4. The numerator is precisely the coplanarity triple product, confirming d=0  ⟺  d=0 \iff the lines are coplanar (intersecting), consistent with the classification theorem. ■\blacksquare

∎
ProofDistance From a Point to a Line

The distance from point PP (position p\mathbf{p}) to line ℓ:r0+td\ell: \mathbf{r}_0 + t\mathbf{d} is found by the area of the parallelogram spanned by (p−r0)(\mathbf{p}-\mathbf{r}_0) and d\mathbf{d}:

6
d=∥(p−r0)×d∥∥d∥\quad d = \frac{\| (\mathbf{p} - \mathbf{r}_0) \times \mathbf{d} \|}{\|\mathbf{d}\|}

Derivation hint: the parallelogram area is ∥(p−r0)×d∥\|(\mathbf{p}-\mathbf{r}_0)\times\mathbf{d}\|; dividing by the base length ∥d∥\|\mathbf{d}\| gives the height, which is the perpendicular distance.

∎
mathematician · René Descartes | 1596–1650

Descartes' La Géométrie (1637) fused algebra with Euclid's geometry, replacing pure constructions with coordinate equations. Though his work was largely two-dimensional, the coordinate method he pioneered made the algebraic description of lines and surfaces in three dimensions possible. The full vector formulation we use today emerged much later, but every parametric and symmetric equation traces back to Descartes' insight that points are number-tuples and geometric loci are equations.

Building Intuition

🧠 Intuition

Picture walking in a fixed compass direction across a flat field while also climbing a uniform slope — your path traces a line in space. The base point r0\mathbf{r}_0 is where you start; the direction d\mathbf{d} encodes how much you move east, north, and up per unit of tt. The parameter tt is "how far along" — negative tt walks backward. Two roads in a city are intersecting if they cross, parallel if they run side by side forever, but a highway overpass crossing a road beneath it is skew: the two never touch yet never stay equidistant either. That third possibility is the signature of three-dimensionality.

Figure
Three relative positions of lines in space: intersecting, parallel, and skew
Intersecting d=0 Parallel d=const Skew d>0, no meet Line: r = r₀ + t d r₀ d r = r₀ + t d

Worked Examples

ExampleLine Through Two Points & a Distance

Given: Points A=(1,2,3)A=(1,2,3) and B=(4,0,5)B=(4,0,5). Find the parametric equations of line ABAB, then the distance from P=(2,2,2)P=(2,2,2) to this line.

Step 1 — direction: d=B−A=(4−1, 0−2, 5−3)=(3,−2,2)\mathbf{d}=B-A=(4-1,\,0-2,\,5-3)=(3,-2,2).

Step 2 — parametric equations: using base AA,

x=1+3t,y=2−2t,z=3+2t.x=1+3t,\quad y=2-2t,\quad z=3+2t.

Step 3 — distance from PP: compute p−r0=P−A=(1,0,−1)\mathbf{p}-\mathbf{r}_0 = P-A = (1,0,-1). Cross product (p−r0)×d(\mathbf{p}-\mathbf{r}_0)\times\mathbf{d}:

∣ijk10−13−22∣=i(0⋅2−(−1)(−2))−j(1⋅2−(−1)3)+k(1⋅(−2)−0⋅3)\begin{vmatrix}\mathbf{i}&\mathbf{j}&\mathbf{k}\\1&0&-1\\3&-2&2\end{vmatrix} = \mathbf{i}(0\cdot2-(-1)(-2)) - \mathbf{j}(1\cdot2-(-1)3) + \mathbf{k}(1\cdot(-2)-0\cdot3)
=i(−2)−j(5)+k(−2)=(−2,−5,−2).= \mathbf{i}(-2)-\mathbf{j}(5)+\mathbf{k}(-2)=(-2,-5,-2).

Step 4 — magnitudes: ∥(−2,−5,−2)∥=4+25+4=33\|(-2,-5,-2)\|=\sqrt{4+25+4}=\sqrt{33}; ∥d∥=9+4+4=17\|\mathbf{d}\|=\sqrt{9+4+4}=\sqrt{17}.

Boxed answer:

 d=3317=3317≈1.393 (length units) \boxed{\,d = \frac{\sqrt{33}}{\sqrt{17}} = \sqrt{\tfrac{33}{17}} \approx 1.393 \text{ (length units)}\,}
ExampleSkew Lines and Their Minimum Distance

Given: ℓ1: (1,0,0)+s(1,1,0)\ell_1:\ (1,0,0)+s(1,1,0) and ℓ2: (0,1,0)+t(0,1,1)\ell_2:\ (0,1,0)+t(0,1,1). Determine their relation and the distance between them.

Step 1 — directions: d1=(1,1,0)\mathbf{d}_1=(1,1,0), d2=(0,1,1)\mathbf{d}_2=(0,1,1). Not parallel (not scalar multiples).

Step 2 — common normal: d1×d2=∣ijk110011∣=(1⋅1−0⋅1, 0⋅0−1⋅1, 1⋅1−1⋅0)=(1,−1,1)\mathbf{d}_1\times\mathbf{d}_2 = \begin{vmatrix}\mathbf{i}&\mathbf{j}&\mathbf{k}\\1&1&0\\0&1&1\end{vmatrix}=(1\cdot1-0\cdot1,\,0\cdot0-1\cdot1,\,1\cdot1-1\cdot0)=(1,-1,1).

Step 3 — base-to-base: w=r2−r1=(0−1,1−0,0−0)=(−1,1,0)\mathbf{w}=\mathbf{r}_2-\mathbf{r}_1=(0-1,1-0,0-0)=(-1,1,0).

Step 4 — coplanarity test: w⋅(d1×d2)=(−1)(1)+(1)(−1)+(0)(1)=−2≠0\mathbf{w}\cdot(\mathbf{d}_1\times\mathbf{d}_2)=(-1)(1)+(1)(-1)+(0)(1)=-2\neq0. So the lines are skew.

Step 5 — distance: ∥d1×d2∥=1+1+1=3\|\mathbf{d}_1\times\mathbf{d}_2\|=\sqrt{1+1+1}=\sqrt{3}.

d=∣−2∣3=23.d=\frac{|-2|}{\sqrt{3}}=\frac{2}{\sqrt{3}}.

Boxed answer:

 Lines are skew, d=23=233≈1.155 (length units) \boxed{\,\text{Lines are skew, } d=\frac{2}{\sqrt{3}}=\frac{2\sqrt{3}}{3}\approx1.155 \text{ (length units)}\,}

Common Misconceptions

⚠️ Common mistake

A single linear equation does NOT define a line in space. In R2\mathbb{R}^2, ax+by=cax+by=c is a line, but in R3\mathbb{R}^3, ax+by+cz=dax+by+cz=d is a plane. A line in space needs two equations (two intersecting planes) or a parametric form. Forgetting this is the most common source of dimension errors when students transfer plane intuition to three dimensions.

⚠️ Common mistake

Direction vectors are not unique, and neither are base points. The same line is described by r0+td\mathbf{r}_0+t\mathbf{d} and r0′+t(kd)\mathbf{r}_0'+t(k\mathbf{d}) for any k≠0k\neq0 and any base point r0′\mathbf{r}_0' on the line. When comparing two lines, always check parallelism of directions (cross product zero), not literal equality of vectors.

Counterexample

"If two lines don't intersect, they must be parallel." False in space. The lines ℓ1:(0,0,0)+s(1,0,0)\ell_1:(0,0,0)+s(1,0,0) (the xx-axis) and ℓ2:(0,0,1)+t(0,1,0)\ell_2:(0,0,1)+t(0,1,0) (a line at height z=1z=1 running in yy) never meet — the first stays at z=0z=0, the second at z=1z=1 — yet their directions (1,0,0)(1,0,0) and (0,1,0)(0,1,0) are perpendicular, not parallel. They are skew. This configuration has no analogue in the plane.

Connections

connection

Lines in space are the affine span of one vector and connect directly to many neighbouring topics. They are degree-one cases of Planes in Space (a plane needs two independent directions; a line needs one). The classification by direction vectors rests on the Cross Product and Dot Product from Vector Algebra. As one-dimensional affine subspaces they are special cases studied in Linear Algebra and Affine Geometry. The tangent line to a curve is the calculus-limit object built from the same parametric form, linking to Vector-Valued Functions and Differential Geometry of Curves. Pairs of skew lines also seed the study of Ruled Surfaces and the line geometry of Projective Space.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- ~300 BCE — Euclid's Elements treats lines synthetically; Book XI begins solid geometry, defining lines and planes in space without coordinates.
- ~250 BCE — Apollonius studies conics, implicitly handling lines as chords, tangents, and axes.
- 1637 — Descartes' La Géométrie introduces coordinate geometry, enabling algebraic equations for geometric loci.
- 1748 — Euler's Introductio in analysin infinitorum systematically develops analytic geometry in three dimensions, including space curves and lines.
- 1827 — Möbius introduces barycentric/homogeneous coordinates, paving the way for projective treatment of lines.
- 1844 — Grassmann's Ausdehnungslehre lays the abstract algebraic foundation (exterior algebra) underlying line and subspace representation.
- 1865 — Plücker introduces Plücker coordinates, a six-component representation of lines in space, founding line geometry.
- 1880s — Gibbs and Heaviside develop modern vector analysis, giving the cross-product/dot-product formulas for distances and classification used today.
- 1900s onward — Linear and affine algebra formalize lines as one-dimensional affine subspaces, the standard undergraduate framework.

Subtleties & Limits

open-problem

The parametric description breaks down gracefully but instructively at boundaries. Direction with zero components: if a=0a=0, the symmetric form [3] fails (x−x0x-x_0 over 00 is undefined); one must split into a pair like x=x0x=x_0 and (y−y0)/b=(z−z0)/c(y-y_0)/b=(z-z_0)/c. Plücker coordinates (d,r0×d)(\mathbf{d}, \mathbf{r}_0\times\mathbf{d}) give a representation-free (up to scale) encoding of lines as points on the Klein quadric in projective 5-space; understanding which 6-tuples are valid lines (the Plücker relation ∑pijpkl=0\sum p_{ij}p_{kl}=0) is a gateway to algebraic geometry. Open-ended generalizations: lines in Rn\mathbb{R}^n remain one-dimensional but the "generic relative position" becomes ever more disjoint; in projective space, parallel lines meet "at infinity," dissolving the parallel/skew distinction. The geometry of families of lines (line congruences and complexes) and the enumeration of lines satisfying constraints (e.g. the classic 27 lines on a cubic surface) remain rich areas connecting elementary line geometry to deep modern mathematics.

See Also

Planes in Space · Vector Algebra · Cross Product · Dot Product · Distance Problems in 3D Geometry · Vector-Valued Functions · Affine Geometry · Projective Space · Ruled Surfaces