About

1.3 Vector Equations

Theory: Vector Equations

Sections 1.1–1.2 looked at a linear system row by row (equations). Sections 1.3–1.4 look at the same system column by column (vectors). The punchline: solving a system, writing b\mathbf{b} as a linear combination of vectors, and solving Ax=bA\mathbf{x} = \mathbf{b} are the same problem, and all three are solved by row reducing the same augmented matrix.

Vectors in Rn\mathbb{R}^n (Lay §1.3)

A vector in Rn\mathbb{R}^n is an ordered list of nn real numbers, written as a column (an n×1n \times 1 matrix):

x=[x1x2⋮xn]∈Rn\mathbf{x} = \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_n \end{bmatrix} \in \mathbb{R}^n

Two vectors are equal iff their corresponding entries are equal, so [74]≠[47]\begin{bmatrix} 7 \\ 4 \end{bmatrix} \ne \begin{bmatrix} 4 \\ 7 \end{bmatrix} (order matters). The zero vector 0\mathbf{0} has every entry 00.

Size convention: an m×nm \times n matrix has mm rows and nn columns (row first). Each column of an m×nm \times n matrix is a vector in Rm\mathbb{R}^m.

Vector operations are done entry by entry:

u+v=[u1+v1⋮un+vn],c u=[c u1⋮c un]\mathbf{u} + \mathbf{v} = \begin{bmatrix} u_1 + v_1 \\ \vdots \\ u_n + v_n \end{bmatrix}, \qquad c\,\mathbf{u} = \begin{bmatrix} c\,u_1 \\ \vdots \\ c\,u_n \end{bmatrix}

For example, with u=[1−2]\mathbf{u} = \begin{bmatrix} 1 \\ -2 \end{bmatrix}, v=[2−5]\mathbf{v} = \begin{bmatrix} 2 \\ -5 \end{bmatrix}:  4u−3v=[4−8]+[−615]=[−27]\ 4\mathbf{u} - 3\mathbf{v} = \begin{bmatrix} 4 \\ -8 \end{bmatrix} + \begin{bmatrix} -6 \\ 15 \end{bmatrix} = \begin{bmatrix} -2 \\ 7 \end{bmatrix}.

Geometry (in R2\mathbb{R}^2 and R3\mathbb{R}^3): a vector is an arrow from the origin to the point (x1,x2)(x_1, x_2).

Algebraic properties of Rn\mathbb{R}^n (for all u,v,w\mathbf{u}, \mathbf{v}, \mathbf{w} and scalars c,dc, d): u+v=v+u\mathbf{u} + \mathbf{v} = \mathbf{v} + \mathbf{u}; (u+v)+w=u+(v+w)(\mathbf{u} + \mathbf{v}) + \mathbf{w} = \mathbf{u} + (\mathbf{v} + \mathbf{w}); u+0=u\mathbf{u} + \mathbf{0} = \mathbf{u}; u+(−u)=0\mathbf{u} + (-\mathbf{u}) = \mathbf{0}; c(u+v)=cu+cvc(\mathbf{u} + \mathbf{v}) = c\mathbf{u} + c\mathbf{v}; (c+d)u=cu+du(c + d)\mathbf{u} = c\mathbf{u} + d\mathbf{u}; c(du)=(cd)uc(d\mathbf{u}) = (cd)\mathbf{u}; 1u=u1\mathbf{u} = \mathbf{u}. In short: vectors behave just like numbers under ++ and scaling.

Linear Combinations & Weights

Given kk vectors v1,…,vk∈Rn\mathbf{v}_1, \dots, \mathbf{v}_k \in \mathbb{R}^n and scalars c1,…,ckc_1, \dots, c_k, the vector

y=c1v1+c2v2+⋯+ckvk\mathbf{y} = c_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k

is a linear combination of v1,…,vk\mathbf{v}_1, \dots, \mathbf{v}_k with weights c1,…,ckc_1, \dots, c_k. Weights can be any real numbers, including 00 and negatives. For example, 3 v1+v2\sqrt{3}\,\mathbf{v}_1 + \mathbf{v}_2, 12v1\tfrac{1}{2}\mathbf{v}_1 and 0=0v1+0v2\mathbf{0} = 0\mathbf{v}_1 + 0\mathbf{v}_2 are all linear combinations of v1,v2\mathbf{v}_1, \mathbf{v}_2.

Vector Equation   ⟺  \iff Augmented Matrix

Question type: “Is b\mathbf{b} a linear combination of a1,…,an\mathbf{a}_1, \dots, \mathbf{a}_n?” This asks whether the vector equation

x1a1+x2a2+⋯+xnan=bx_1\mathbf{a}_1 + x_2\mathbf{a}_2 + \cdots + x_n\mathbf{a}_n = \mathbf{b}

has a solution. Writing it out entry by entry gives an ordinary linear system, whose augmented matrix simply has the vectors as its columns.

Key fact (Lay §1.3): The vector equation x1a1+⋯+xnan=bx_1\mathbf{a}_1 + \cdots + x_n\mathbf{a}_n = \mathbf{b} has the same solution set as the linear system whose augmented matrix is [a1a2⋯anb].\left[\begin{array}{cccc|c} \mathbf{a}_1 & \mathbf{a}_2 & \cdots & \mathbf{a}_n & \mathbf{b} \end{array}\right]. In particular, b\mathbf{b} is a linear combination of a1,…,an\mathbf{a}_1, \dots, \mathbf{a}_n iff this system is consistent.

Mini-example (Lay §1.3, Example 1)

Is b=[74−3]\mathbf{b} = \begin{bmatrix} 7 \\ 4 \\ -3 \end{bmatrix} a linear combination of a1=[1−2−5]\mathbf{a}_1 = \begin{bmatrix} 1 \\ -2 \\ -5 \end{bmatrix}, a2=[256]\mathbf{a}_2 = \begin{bmatrix} 2 \\ 5 \\ 6 \end{bmatrix}? Row reduce [a1 a2 b][\mathbf{a}_1\ \mathbf{a}_2\ \mathbf{b}] with R2←R2+2R1R_2 \leftarrow R_2 + 2R_1, R3←R3+5R1R_3 \leftarrow R_3 + 5R_1, then R3←R3−169R2R_3 \leftarrow R_3 - \tfrac{16}{9}R_2:

[127−254−56−3]∼[127091801632]∼[1270918000]\left[\begin{array}{cc|c} 1 & 2 & 7 \\ -2 & 5 & 4 \\ -5 & 6 & -3 \end{array}\right] \sim \left[\begin{array}{cc|c} 1 & 2 & 7 \\ 0 & 9 & 18 \\ 0 & 16 & 32 \end{array}\right] \sim \left[\begin{array}{cc|c} 1 & 2 & 7 \\ 0 & 9 & 18 \\ 0 & 0 & 0 \end{array}\right]

Consistent: x2=2x_2 = 2, x1=7−4=3x_1 = 7 - 4 = 3. So b=3a1+2a2\mathbf{b} = 3\mathbf{a}_1 + 2\mathbf{a}_2 (check: 3(1,−2,−5)+2(2,5,6)=(7,4,−3)3(1,-2,-5) + 2(2,5,6) = (7,4,-3) ✓).

Recognising inconsistency: if the echelon form has a row [ 0 ⋯ 0∣b ][\,0\ \cdots\ 0 \mid b\,] with b≠0b \ne 0, the augmented column contains a pivot, the system is inconsistent, and b\mathbf{b} is not a linear combination of the ai\mathbf{a}_i. You only need echelon form (not RREF) to decide this.

Span{v1,…,vp}\{\mathbf{v}_1, \dots, \mathbf{v}_p\}

The set of all linear combinations of v1,…,vp\mathbf{v}_1, \dots, \mathbf{v}_p is called the span:

Span⁡{v1,…,vp}={c1v1+⋯+cpvp:c1,…,cp∈R}\operatorname{Span}\{\mathbf{v}_1, \dots, \mathbf{v}_p\} = \{c_1\mathbf{v}_1 + \cdots + c_p\mathbf{v}_p : c_1, \dots, c_p \in \mathbb{R}\}

So “Is b∈Span⁡{v1,…,vp}\mathbf{b} \in \operatorname{Span}\{\mathbf{v}_1, \dots, \mathbf{v}_p\}?” is exactly the question “Does x1v1+⋯+xpvp=bx_1\mathbf{v}_1 + \cdots + x_p\mathbf{v}_p = \mathbf{b} have a solution?”, i.e. “Is [v1 ⋯ vp∣b][\mathbf{v}_1\ \cdots\ \mathbf{v}_p \mid \mathbf{b}] consistent?”

Every span contains 0\mathbf{0} (all weights zero) and every vi\mathbf{v}_i (weight 11 on vi\mathbf{v}_i, 00 elsewhere).

Geometric picture in R3\mathbb{R}^3:

SetPicture
Span⁡{v}\operatorname{Span}\{\mathbf{v}\}, v≠0\mathbf{v} \ne \mathbf{0}all multiples cvc\mathbf{v}: a line through the origin
Span⁡{u,v}\operatorname{Span}\{\mathbf{u}, \mathbf{v}\}, v\mathbf{v} not a multiple of u\mathbf{u}a plane through the origin containing u\mathbf{u} and v\mathbf{v}
Span⁡{u,v}\operatorname{Span}\{\mathbf{u}, \mathbf{v}\}, v=cu\mathbf{v} = c\mathbf{u}only the line through u\mathbf{u} (the second vector adds nothing new)

“Is b\mathbf{b} in the plane spanned by a1\mathbf{a}_1 and a2\mathbf{a}_2?” is a span question. If [a1 a2∣b][\mathbf{a}_1\ \mathbf{a}_2 \mid \mathbf{b}] is inconsistent, b\mathbf{b} sticks out of that plane.


Solved Examples (Textbook Questions)

Exercise 1

(Adapted from Lay §1.3, Exercises 5 and 6)

Write a system of equations that is equivalent to the given vector equation.

(a)  x1[6−15]+x2[−340]=[1−7−5]\ x_1\begin{bmatrix} 6 \\ -1 \\ 5 \end{bmatrix} + x_2\begin{bmatrix} -3 \\ 4 \\ 0 \end{bmatrix} = \begin{bmatrix} 1 \\ -7 \\ -5 \end{bmatrix}

(b)  x1[−23]+x2[85]+x3[1−6]=[00]\ x_1\begin{bmatrix} -2 \\ 3 \end{bmatrix} + x_2\begin{bmatrix} 8 \\ 5 \end{bmatrix} + x_3\begin{bmatrix} 1 \\ -6 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}

Show solution ↓
Solution

Scale each vector by its weight, add entry by entry, and set equal to the right-hand side.

(a)

[6x1−x15x1]+[−3x24x20]=[1−7−5] ⟹ [6x1−3x2−x1+4x25x1]=[1−7−5]\begin{bmatrix} 6x_1 \\ -x_1 \\ 5x_1 \end{bmatrix} + \begin{bmatrix} -3x_2 \\ 4x_2 \\ 0 \end{bmatrix} = \begin{bmatrix} 1 \\ -7 \\ -5 \end{bmatrix} \ \Longrightarrow\ \begin{bmatrix} 6x_1 - 3x_2 \\ -x_1 + 4x_2 \\ 5x_1 \end{bmatrix} = \begin{bmatrix} 1 \\ -7 \\ -5 \end{bmatrix}

Equating entries:

6x1−3x2=1−x1+4x2=−75x1=−5\begin{aligned} 6x_1 - 3x_2 &= 1 \\ -x_1 + 4x_2 &= -7 \\ 5x_1 &= -5 \end{aligned}

(b)

[−2x1+8x2+x33x1+5x2−6x3]=[00] ⟹ −2x1+8x2+x3=03x1+5x2−6x3=0\begin{bmatrix} -2x_1 + 8x_2 + x_3 \\ 3x_1 + 5x_2 - 6x_3 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \ \Longrightarrow\ \begin{aligned} -2x_1 + 8x_2 + x_3 &= 0 \\ 3x_1 + 5x_2 - 6x_3 &= 0 \end{aligned}

(In exams the intermediate vector step is usually not required, but it shows where each equation comes from: equation ii uses entry ii of every vector.)

Exercise 2

(Adapted from Lay §1.3, Exercises 9 and 10)

Write a vector equation that is equivalent to the given system.

(a) x2+5x3=04x1+6x2−x3=0−x1+3x2−8x3=0\quad \begin{aligned} x_2 + 5x_3 &= 0 \\ 4x_1 + 6x_2 - x_3 &= 0 \\ -x_1 + 3x_2 - 8x_3 &= 0 \end{aligned}

(b) 4x1+x2+3x3=9x1−7x2−2x3=28x1+6x2−5x3=15\quad \begin{aligned} 4x_1 + x_2 + 3x_3 &= 9 \\ x_1 - 7x_2 - 2x_3 &= 2 \\ 8x_1 + 6x_2 - 5x_3 &= 15 \end{aligned}

Show solution ↓
Solution

Read down each variable’s coefficients to build its column; missing variables get 00.

(a) Note x1x_1 is missing from the first equation, so its coefficient there is 00:

[x2+5x34x1+6x2−x3−x1+3x2−8x3]=[000] ⟹ x1[04−1]+x2[163]+x3[5−1−8]=[000]\begin{bmatrix} x_2 + 5x_3 \\ 4x_1 + 6x_2 - x_3 \\ -x_1 + 3x_2 - 8x_3 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix} \ \Longrightarrow\ x_1\begin{bmatrix} 0 \\ 4 \\ -1 \end{bmatrix} + x_2\begin{bmatrix} 1 \\ 6 \\ 3 \end{bmatrix} + x_3\begin{bmatrix} 5 \\ -1 \\ -8 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix}

(b)

x1[418]+x2[1−76]+x3[3−2−5]=[9215]x_1\begin{bmatrix} 4 \\ 1 \\ 8 \end{bmatrix} + x_2\begin{bmatrix} 1 \\ -7 \\ 6 \end{bmatrix} + x_3\begin{bmatrix} 3 \\ -2 \\ -5 \end{bmatrix} = \begin{bmatrix} 9 \\ 2 \\ 15 \end{bmatrix}
Exercise 3

(Adapted from Lay §1.3, Exercises 11 and 12)

Determine if b\mathbf{b} is a linear combination of a1,a2,a3\mathbf{a}_1, \mathbf{a}_2, \mathbf{a}_3.

(a)  a1=[1−20], a2=[012], a3=[5−68], b=[2−16]\ \mathbf{a}_1 = \begin{bmatrix} 1 \\ -2 \\ 0 \end{bmatrix},\ \mathbf{a}_2 = \begin{bmatrix} 0 \\ 1 \\ 2 \end{bmatrix},\ \mathbf{a}_3 = \begin{bmatrix} 5 \\ -6 \\ 8 \end{bmatrix},\ \mathbf{b} = \begin{bmatrix} 2 \\ -1 \\ 6 \end{bmatrix}

(b)  a1=[1−22], a2=[055], a3=[208], b=[−511−7]\ \mathbf{a}_1 = \begin{bmatrix} 1 \\ -2 \\ 2 \end{bmatrix},\ \mathbf{a}_2 = \begin{bmatrix} 0 \\ 5 \\ 5 \end{bmatrix},\ \mathbf{a}_3 = \begin{bmatrix} 2 \\ 0 \\ 8 \end{bmatrix},\ \mathbf{b} = \begin{bmatrix} -5 \\ 11 \\ -7 \end{bmatrix}

Show solution ↓
Solution

“Is b\mathbf{b} a linear combination of a1,a2,a3\mathbf{a}_1, \mathbf{a}_2, \mathbf{a}_3?” is the same as “Does x1a1+x2a2+x3a3=bx_1\mathbf{a}_1 + x_2\mathbf{a}_2 + x_3\mathbf{a}_3 = \mathbf{b} have a solution?”, i.e. “Is M=[a1 a2 a3∣b]M = [\mathbf{a}_1\ \mathbf{a}_2\ \mathbf{a}_3 \mid \mathbf{b}] consistent?” Row reduce until the pivots are visible.

(a) R2←R2+2R1R_2 \leftarrow R_2 + 2R_1, then R3←R3−2R2R_3 \leftarrow R_3 - 2R_2:

M=[1052−21−6−10286]∼[105201430286]∼[105201430000]M = \left[\begin{array}{ccc|c} 1 & 0 & 5 & 2 \\ -2 & 1 & -6 & -1 \\ 0 & 2 & 8 & 6 \end{array}\right] \sim \left[\begin{array}{ccc|c} 1 & 0 & 5 & 2 \\ 0 & 1 & 4 & 3 \\ 0 & 2 & 8 & 6 \end{array}\right] \sim \left[\begin{array}{ccc|c} 1 & 0 & 5 & 2 \\ 0 & 1 & 4 & 3 \\ 0 & 0 & 0 & 0 \end{array}\right]

No pivot in the augmented column, so the system is consistent: b\mathbf{b} is a linear combination of a1,a2,a3\mathbf{a}_1, \mathbf{a}_2, \mathbf{a}_3.

(Bonus: x3x_3 is free, x1=2−5x3x_1 = 2 - 5x_3, x2=3−4x3x_2 = 3 - 4x_3. Taking x3=0x_3 = 0: b=2a1+3a2\mathbf{b} = 2\mathbf{a}_1 + 3\mathbf{a}_2. Check: (2,−4,0)+(0,3,6)=(2,−1,6)(2, -4, 0) + (0, 3, 6) = (2, -1, 6) ✓. There are infinitely many choices of weights.)

(b) R2←R2+2R1R_2 \leftarrow R_2 + 2R_1, R3←R3−2R1R_3 \leftarrow R_3 - 2R_1, then R3←R3−R2R_3 \leftarrow R_3 - R_2:

M=[102−5−25011258−7]∼[102−505410543]∼[102−505410002]M = \left[\begin{array}{ccc|c} 1 & 0 & 2 & -5 \\ -2 & 5 & 0 & 11 \\ 2 & 5 & 8 & -7 \end{array}\right] \sim \left[\begin{array}{ccc|c} 1 & 0 & 2 & -5 \\ 0 & 5 & 4 & 1 \\ 0 & 5 & 4 & 3 \end{array}\right] \sim \left[\begin{array}{ccc|c} 1 & 0 & 2 & -5 \\ 0 & 5 & 4 & 1 \\ 0 & 0 & 0 & 2 \end{array}\right]

The last row says 0=20 = 2: the augmented column has a pivot, so the system is inconsistent. b\mathbf{b} is not a linear combination of a1,a2,a3\mathbf{a}_1, \mathbf{a}_2, \mathbf{a}_3.

Exercise 4

(Adapted from Lay §1.3, Exercises 13 and 14)

Determine if b\mathbf{b} is a linear combination of the vectors formed from the columns of the matrix AA.

(a)  A=[1−42035−28−4], b=[3−7−3]\ A = \begin{bmatrix} 1 & -4 & 2 \\ 0 & 3 & 5 \\ -2 & 8 & -4 \end{bmatrix},\ \mathbf{b} = \begin{bmatrix} 3 \\ -7 \\ -3 \end{bmatrix}

(b)  A=[1−2−60371−25], b=[11−59]\ A = \begin{bmatrix} 1 & -2 & -6 \\ 0 & 3 & 7 \\ 1 & -2 & 5 \end{bmatrix},\ \mathbf{b} = \begin{bmatrix} 11 \\ -5 \\ 9 \end{bmatrix}

Show solution ↓
Solution

Call the columns a1,a2,a3\mathbf{a}_1, \mathbf{a}_2, \mathbf{a}_3 and row reduce [a1 a2 a3∣b][\mathbf{a}_1\ \mathbf{a}_2\ \mathbf{a}_3 \mid \mathbf{b}] to echelon form.

(a) One operation does it: R3←R3+2R1R_3 \leftarrow R_3 + 2R_1:

[1−423035−7−28−4−3]∼[1−423035−70003]\left[\begin{array}{ccc|c} 1 & -4 & 2 & 3 \\ 0 & 3 & 5 & -7 \\ -2 & 8 & -4 & -3 \end{array}\right] \sim \left[\begin{array}{ccc|c} 1 & -4 & 2 & 3 \\ 0 & 3 & 5 & -7 \\ 0 & 0 & 0 & 3 \end{array}\right]

Row 3 reads 0=30 = 3, so the system is inconsistent: b\mathbf{b} is not a linear combination of the columns of AA.

(b) R3←R3−R1R_3 \leftarrow R_3 - R_1:

[1−2−611037−51−259]∼[1−2−611037−50011−2]\left[\begin{array}{ccc|c} 1 & -2 & -6 & 11 \\ 0 & 3 & 7 & -5 \\ 1 & -2 & 5 & 9 \end{array}\right] \sim \left[\begin{array}{ccc|c} 1 & -2 & -6 & 11 \\ 0 & 3 & 7 & -5 \\ 0 & 0 & 11 & -2 \end{array}\right]

This is echelon form with pivots in columns 1, 2, 3 and no pivot in the augmented column, so the system is consistent (in fact it has a unique solution). b\mathbf{b} is a linear combination of the columns of AA.

The question only asks whether b\mathbf{b} is a combination, so stop at echelon form. You do not need the actual weights (here they are messy fractions).