Intersection of 2 planes (HL)

See also system of 3-variable linear equations

Two planes can be identical (the same), parallel, or intersecting.

Example: Let’s find the intersection between

3x+4yz=133x + 4y - z = 13
2x+3y4z=52x + 3y - 4z = -5

Contents

Method using cross product

The line of intersection is perpendicular to both normals n1\bm {n_1} and n2\bm {n_2}.

step 1: direction vector

The direction vector of the line is (l,m,n)=n1×n2(l, m, n) = \bm {n_1} \times \bm {n_2}.

(3,4,1)×(2,3,4)=(13,10,1)(3, 4, -1)\times(2, 3, -4) = (-13, 10, 1)

step 2: a point

For the component of (l,m,n)(l, m, n) that is closest to 00, but is not 00, guess the corresponding component of a point.

In our example, since n=1n = 1 is the closest component to 00, let’s guess z0=0z_0 = 0. (You can also guess z0=1z_0 = 1, for instance, but 00 is often easier)

This means

3x+4y=133x + 4y = 13
2x+3y=52x + 3y = -5

which has solution x=59x = 59, y=41y = -41

The final answer is r=(13,10,1)λ+(59,41,0)\bm r = (-13, 10, 1)\lambda + (59, -41, 0) \qed

Method using row reduction

In this context, scalar multiplication means multiplying the row by a non-zero constant.

The rules are

  1. Each elementary row operation uses some or all rows from the previous step.
  2. Two rows may be swapped.
  3. Each changed row must involve the corresponding row from previous step, unless two rows are swapped. Eg the new row 2 must involve a non-zero multiple of the old row 2, unless swapping row 2 with another.
  4. Each row can become a scalar multiple of itself, and/or added a scalar multiple of any other row(s). Eg new row 1 can be 2-2 times old row 1 plus half times old row 3.

The goal is to get the it to look like

[10AB01CD]\begin{align*} \left[\begin{array}{ccc|c} 1 & 0 & A & B \\ 0 & 1 & C & D \\ \end{array}\right] \end{align*}

where at most a single column on the left side does not contain a one and a zero.

Our starting point is

[341132345]\begin{align*} \left[\begin{array}{ccc|c} 3 & 4 & -1 & 13 \\ 2 & 3 & -4 & -5 \\ \end{array}\right] \\ \end{align*}

Generally speaking we focus on getting one column into the desired state, in a left-to-right order.

We can first subtract row 2 from row 1

R1R2R1[113182345]R_1 - R_2 \to R_1 \\ \begin{align*} \left[\begin{array}{ccc|c} 1 & 1 & 3 & 18 \\ 2 & 3 & -4 & -5 \\ \end{array}\right] \end{align*}

Subtract twice of row 1 from row 2

R22R1R2[11318011041]R_2 - 2R_1 \to R_2 \\ \begin{align*} \left[\begin{array}{ccc|c} 1 & 1 & 3 & 18 \\ 0 & 1 & -10 & -41 \\ \end{array}\right] \end{align*}

Subtract row 2 from row 1

R1R2R1[101359011041]R_1 - R_2 \to R_1 \\ \begin{align*} \left[\begin{array}{ccc|c} 1 & 0 & 13 & 59 \\ 0 & 1 & -10 & -41 \\ \end{array}\right] \end{align*}

This corresponds to the system

x+13z=59x + 13z = 59
y10z=41y -10z = -41

zz can be used to parametrize both xx and yy, as it appears in both equations.

Let z=tz = t

This means

x=13t+59x = -13t + 59
y=10t41y = 10t -41 \qed

which are the same equations as before, but in a different form. In both cases we assumed z0=0z_0 = 0 for the point. Had we used different assumptions, we would end up with different points.