Lines in Space

A line in space is the set of all points satisfying $r = r_{0} + t d$ , the locus of a point moving in a fixed direction $d$ through a base point $r_{0}$ . Key result: a line in $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).

A line in three-dimensional space is a one-dimensional affine subspace: the collection of all points obtained by starting at a fixed point and adding all scalar multiples of a fixed nonzero direction vector. It matters because lines are the simplest non-trivial geometric objects in space, serving as the building blocks for planes, rays, segments, and the tangent objects of calculus and differential geometry. Unlike lines in the plane, a single linear equation in $R^{3}$ describes a plane, not a line — a line requires two simultaneous linear equations, or equivalently a parametric description. A surprising fact: most pairs of lines in space neither meet nor are parallel; they are skew, a phenomenon impossible in two dimensions.

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 $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

Line in Space — Vector / Parametric Form

Let $r_{0} = (x_{0}, y_{0}, z_{0})$ be a fixed point in $R^{3}$ and $d = (a, b, c) \neq = 0$ a nonzero direction vector. The line $ℓ$ through $r_{0}$ with direction $d$ is:

ℓ = {r_{0} + t d : t \in R}

⟳every displacement along the line is parallel to

d

, so it equals

t d

for some scalar

t

; add this to the base point.

Here $t$ is the parameter, $r = (x, y, z)$ the position vector of a generic point, $r_{0}$ the base point, and $d = (a, b, c)$ the direction with components called direction numbers. Writing components separately gives the parametric equations:

x = x_{0} + a t, y = y_{0} + b t, z = z_{0} + c t

⟳read off each coordinate of the vector equation

r = r_{0} + t d

If $a, b, c$ are all nonzero, eliminating $t$ yields the symmetric (Cartesian) equations:

\frac{x - x _{0}}{a} = \frac{y - y _{0}}{b} = \frac{z - z _{0}}{c}

⟳solve each equation in [2] for

t

and equate the three expressions.

Line as Intersection of Two Planes

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

{A_{1} x + B_{1} y + C_{1} z = D_{1} A_{2} x + B_{2} y + C_{2} z = D_{2}

⟳each equation is a plane with normal

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 = n_{1} \times n_{2}$ , the cross product of the two plane normals.

Classification of Two Lines in Space

Two distinct lines $ℓ_{1} : r_{1} + s d_{1}$ and $ℓ_{2} : r_{2} + t d_{2}$ in $R^{3}$ fall into exactly one category:

Parallel if $d_{1} ∥ d_{2}$ (i.e. $d_{1} \times d_{2} = 0$ ).
Intersecting if $d_{1} ∦ d_{2}$ and $(r_{2} - r_{1}) \cdot (d_{1} \times d_{2}) = 0$ .
Skew if $d_{1} ∦ d_{2}$ and $(r_{2} - r_{1}) \cdot (d_{1} \times d_{2}) \neq = 0$ .

The scalar triple product $(r_{2} - r_{1}) \cdot (d_{1} \times d_{2})$ is the coplanarity test: it vanishes iff the four points/vectors lie in a common plane.

Why It Holds / Derivation

Distance Between Two Skew Lines

We derive the minimum distance between skew lines $ℓ_{1} : r_{1} + s d_{1}$ and $ℓ_{2} : r_{2} + t d_{2}$ .

Step 1. The shortest connecting segment must be perpendicular to both lines, so its direction is parallel to

n = d_{1} \times d_{2}

(nonzero since the lines are not parallel). Step 2. Take any vector joining the lines, e.g.

w = r_{2} - r_{1}

, connecting base points. Step 3. The distance equals the length of the projection of

w

onto the common normal direction

\hat{n} = n /∥ n ∥

d = ∣ w \cdot \hat{n} ∣ = \frac{∣ ( r _{2} - r _{1} ) \cdot ( d _{1} \times d _{2} ) ∣}{∥ d _{1} \times d _{2} ∥}

⟳project the base-to-base vector onto the unit common normal; the components along

d_{1}, d_{2}

contribute nothing because

n ⊥ d_{1}, d_{2}

Step 4. The numerator is precisely the coplanarity triple product, confirming

d = 0 ⟺

the lines are coplanar (intersecting), consistent with the classification theorem.

■

Distance From a Point to a Line

The distance from point $P$ (position $p$ ) to line $ℓ : r_{0} + t d$ is found by the area of the parallelogram spanned by $(p - r_{0})$ and $d$ :

d = \frac{∥ ( p - r _{0} ) \times d ∥}{∥ d ∥}

⟳the parallelogram area is

∥ (p - r_{0}) \times d ∥

; dividing by the base length

∥ d ∥

gives the height, which is the perpendicular distance.

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

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 $r_{0}$ is where you start; the direction $d$ encodes how much you move east, north, and up per unit of $t$ . The parameter $t$ is "how far along" — negative $t$ 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.

Three relative positions of lines in space: intersecting, parallel, and skew

Worked Examples

Line Through Two Points & a Distance

Given: Points

A = (1, 2, 3)

and

B = (4, 0, 5)

. Find the parametric equations of line

A B

, then the distance from

P = (2, 2, 2)

to this line. Step 1 — direction:

d = B - A = (4 - 1, 0 - 2, 5 - 3) = (3, - 2, 2)

. Step 2 — parametric equations: using base

A

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

Step 3 — distance from $P$ : compute

p - r_{0} = P - A = (1, 0, - 1)

Cross product $(p - r_{0}) \times d$ :

i 13 j 0 - 2 k - 1 2 = i (0 \cdot 2 - (- 1) (- 2)) - j (1 \cdot 2 - (- 1) 3) + k (1 \cdot (- 2) - 0 \cdot 3)

= i (- 2) - j (5) + k (- 2) = (- 2, - 5, - 2) .

Step 4 — magnitudes:

∥ (- 2, - 5, - 2) ∥ = 4 + 25 + 4 = 33

;

∥ d ∥ = 9 + 4 + 4 = 17

. Boxed answer:

d = \frac{33}{17} = \frac{33}{17} \approx 1.393 (length units)

Skew Lines and Their Minimum Distance

Given:

ℓ_{1} : (1, 0, 0) + s (1, 1, 0)

and

ℓ_{2} : (0, 1, 0) + t (0, 1, 1)

. Determine their relation and the distance between them. Step 1 — directions:

d_{1} = (1, 1, 0)

d_{2} = (0, 1, 1)

. Not parallel (not scalar multiples). Step 2 — common normal:

d_{1} \times d_{2} = i 10 j 11 k 01 = (1 \cdot 1 - 0 \cdot 1, 0 \cdot 0 - 1 \cdot 1, 1 \cdot 1 - 1 \cdot 0) = (1, - 1, 1)

. Step 3 — base-to-base:

w = r_{2} - r_{1} = (0 - 1, 1 - 0, 0 - 0) = (- 1, 1, 0)

. Step 4 — coplanarity test:

w \cdot (d_{1} \times d_{2}) = (- 1) (1) + (1) (- 1) + (0) (1) = - 2 \neq = 0

. So the lines are skew. Step 5 — distance:

∥ d_{1} \times d_{2} ∥ = 1 + 1 + 1 = 3

d = \frac{∣ - 2∣}{3} = \frac{2}{3} .

Boxed answer:

Lines are skew, d = \frac{2}{3} = \frac{2 3}{3} \approx 1.155 (length units)

Common Misconceptions

A single linear equation does NOT define a line in space. In

R^{2}

a x + b y = c

is a line, but in

R^{3}

a x + b y + 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. Direction vectors are not unique, and neither are base points. The same line is described by

r_{0} + t d

and

r_{0}^{'} + t (k d)

for any

k \neq = 0

and any base point

r_{0}^{'}

on the line. When comparing two lines, always check parallelism of directions (cross product zero), not literal equality of vectors. "If two lines don't intersect, they must be parallel." False in space. The lines

ℓ_{1} : (0, 0, 0) + s (1, 0, 0)

(the

x

-axis) and

ℓ_{2} : (0, 0, 1) + t (0, 1, 0)

(a line at height

z = 1

running in

y

) never meet — the first stays at

z = 0

, the second at

z = 1

— yet their directions

(1, 0, 0)

and

(0, 1, 0)

are perpendicular, not parallel. They are skew. This configuration has no analogue in the plane.

Connections

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

Computer graphics & ray tracing: every rendered pixel shoots a parametric ray $r_{0} + t d$ from the camera; intersection of these rays with surfaces drives all 3D rendering.
Robotics & motion planning: robot arm links and laser sightlines are modeled as line segments; collision detection uses point-to-line and line-to-line distance formulas.
Computer-aided design (CAD): edges of solids, extrusion axes, and mirror/rotation axes are stored as lines in parametric or two-plane form.
GPS and surveying: lines of sight and intersection of measured bearings (resection/triangulation) reduce to line intersection problems in 3D.
Aerospace collision avoidance: predicting whether two aircraft trajectories (approximated as lines over short intervals) pass within a safe distance uses the skew-line distance formula directly.
Crystallography: crystal lattice directions ([Miller indices] like $[110]$ ) are exactly direction numbers of lines through the lattice.
Physics — optics and mechanics: light rays, the instantaneous axis of rotation of a rigid body, and force lines of action are all spatial lines analyzed with these tools.

Historical Development

~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

The parametric description breaks down gracefully but instructively at boundaries. Direction with zero components: if $a = 0$ , the symmetric form [3] fails ( $x - x_{0}$ over $0$ is undefined); one must split into a pair like $x = x_{0}$ and $(y - y_{0}) / b = (z - z_{0}) / c$ . Plücker coordinates $(d, r_{0} \times 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 $\sum p_{ij} p_{k l} = 0$ ) is a gateway to algebraic geometry. Open-ended generalizations: lines in $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.