Vectors in ℝⁿ: Components, Magnitude and Algebra

55 min
0/18 practice checks

Rn\mathbf{R}^n as a set and as a space

Fix a positive integer nn. As a set, Rn\mathbf{R}^n is the collection of all ordered nn-tuples of real numbers:

Rn={(v1,v2,,vn)  :  v1,,vnR}.\mathbf{R}^n = \{\,(v_1, v_2, \ldots, v_n) \; : \; v_1, \ldots, v_n \in \mathbf{R}\,\}.

The word ordered carries weight: (1,2)(1,2) and (2,1)(2,1) are different elements of R2\mathbf{R}^2. Two elements of Rn\mathbf{R}^n are equal if and only if they agree in every position, so one vector equation is nn scalar equations at once. This last remark is used in almost every calculation that follows.

As a space, R2\mathbf{R}^2 is the coordinate plane and R3\mathbf{R}^3 is coordinate three-space. For n4n \geq 4 no picture is available, but every algebraic statement below holds verbatim for all nn, and that is exactly why the algebra is set up carefully rather than left to the diagram.

Columns, and the transpose

Convention. An element of Rn\mathbf{R}^n is a column:

v=[v1v2vn].\mathbf{v} = \begin{bmatrix} v_1 \\ v_2 \\ \vdots \\ v_n \end{bmatrix}.

The real numbers v1,,vnv_1, \ldots, v_n are the components (or entries) of v\mathbf{v}, and viv_i is the ii-th component. Vectors are set in bold; scalars, which here always means real numbers, are not.

Columns consume vertical space, so running text uses the transpose. For any rectangular array of numbers, the transpose is the array obtained by interchanging its rows with its columns, and is written with a superscript T\mathsf{T}. For a column v\mathbf{v} this gives the single row

vT=[v1v2vn].\mathbf{v}^{\mathsf{T}} = \begin{bmatrix} v_1 & v_2 & \cdots & v_n \end{bmatrix}.

Hence (3,1,4)T(3,-1,4)^{\mathsf{T}} denotes the column of R3\mathbf{R}^3 with entries 33, 1-1 and 44, and this is how vectors are written inline from here on. Transposing twice returns the original: (vT)T=v(\mathbf{v}^{\mathsf{T}})^{\mathsf{T}} = \mathbf{v}.

Points and displacement vectors

The tuple (3,2)T(3,2)^{\mathsf{T}} admits two readings, and both are in constant use.

  • As a point: the location in the plane reached from the origin by moving 33 units in the xx-direction and 22 units in the yy-direction. A point has position and no direction.
  • As a displacement vector: the instruction move 33 units in the xx-direction and 22 in the yy-direction, carried out from wherever one currently is. A displacement has magnitude and direction and no position.

Nothing in the symbols distinguishes the two; the reader supplies the interpretation from context. Because that is an unsatisfactory state of affairs, the convention is fixed now and relied on for the rest of the course.

Convention. A point PP of Rn\mathbf{R}^n is identified with its position vector p\mathbf{p}, the displacement from the origin OO to PP. Under this identification, points and displacement vectors are both elements of Rn\mathbf{R}^n and may be combined by the operations defined below. Where the distinction matters it will be stated in words.

Consequence. If PP and QQ are points with position vectors p\mathbf{p} and q\mathbf{q}, then the displacement from PP to QQ is

PQ=qp,\overrightarrow{PQ} = \mathbf{q} - \mathbf{p},

because travelling from PP to OO and then from OO to QQ is the net displacement p+q-\mathbf{p} + \mathbf{q}. The order matters: QP=PQ\overrightarrow{QP} = -\overrightarrow{PQ}.

The two operations

Definition (addition). For u,vRn\mathbf{u}, \mathbf{v} \in \mathbf{R}^n, the sum u+vRn\mathbf{u} + \mathbf{v} \in \mathbf{R}^n is defined componentwise: (u+v)i=ui+vi(\mathbf{u}+\mathbf{v})_i = u_i + v_i for i=1,,ni = 1, \ldots, n. Addition is defined only between vectors with the same number of components.

Definition (scalar multiplication). For cRc \in \mathbf{R} and vRn\mathbf{v} \in \mathbf{R}^n, the scalar multiple cvRnc\mathbf{v} \in \mathbf{R}^n is defined by (cv)i=cvi(c\mathbf{v})_i = c\,v_i.

Geometric readings. Addition is tip-to-tail: draw u\mathbf{u}, then draw v\mathbf{v} starting where u\mathbf{u} ended; the arrow from the start of u\mathbf{u} to the end of v\mathbf{v} is u+v\mathbf{u}+\mathbf{v}. Drawing both from a common start point instead gives the parallelogram reading: u+v\mathbf{u}+\mathbf{v} is the diagonal from that common start. The two pictures agree, which is a geometric statement of commutativity. Scalar multiplication by cc stretches a vector by the factor c|c|, keeping its direction when c>0c > 0 and reversing it when c<0c < 0; multiplying by 00 collapses it to a point.

Two distinguished elements. The zero vector 0=(0,0,,0)T\mathbf{0} = (0,0,\ldots,0)^{\mathsf{T}} satisfies v+0=v\mathbf{v} + \mathbf{0} = \mathbf{v} for every v\mathbf{v}; it is the displacement that goes nowhere, and it is the only vector with no direction. The negative of v\mathbf{v} is v=(1)v-\mathbf{v} = (-1)\mathbf{v}, the vector of the same magnitude pointing the opposite way; it satisfies v+(v)=0\mathbf{v} + (-\mathbf{v}) = \mathbf{0}.

Definition (subtraction). uv:=u+(v)\mathbf{u} - \mathbf{v} := \mathbf{u} + (-\mathbf{v}), so componentwise (uv)i=uivi(\mathbf{u}-\mathbf{v})_i = u_i - v_i. Geometrically uv\mathbf{u}-\mathbf{v} is the displacement from the tip of v\mathbf{v} to the tip of u\mathbf{u} when both are drawn from a common start: it is the unique vector x\mathbf{x} with v+x=u\mathbf{v} + \mathbf{x} = \mathbf{u}.

Worked example. Let u=(4,1,2)T\mathbf{u} = (4,-1,2)^{\mathsf{T}} and v=(0,3,5)T\mathbf{v} = (0,3,-5)^{\mathsf{T}}. Then

3u2v=(12,3,6)T(0,6,10)T=(120,  36,  6+10)T=(12,9,16)T.3\mathbf{u} - 2\mathbf{v} = (12,-3,6)^{\mathsf{T}} - (0,6,-10)^{\mathsf{T}} = (12-0,\; -3-6,\; 6+10)^{\mathsf{T}} = (12,-9,16)^{\mathsf{T}}.

Each component was handled separately; no component ever interacts with another under these two operations.

The algebraic laws

The following hold for all u,v,wRn\mathbf{u}, \mathbf{v}, \mathbf{w} \in \mathbf{R}^n and all scalars c,dRc, d \in \mathbf{R}.

  1. u+v=v+u\mathbf{u} + \mathbf{v} = \mathbf{v} + \mathbf{u} (commutativity of addition)
  2. (u+v)+w=u+(v+w)(\mathbf{u} + \mathbf{v}) + \mathbf{w} = \mathbf{u} + (\mathbf{v} + \mathbf{w}) (associativity of addition)
  3. v+0=v\mathbf{v} + \mathbf{0} = \mathbf{v} (additive identity)
  4. v+(v)=0\mathbf{v} + (-\mathbf{v}) = \mathbf{0} (additive inverse)
  5. c(u+v)=cu+cvc(\mathbf{u} + \mathbf{v}) = c\mathbf{u} + c\mathbf{v} (distributivity over a vector sum)
  6. (c+d)v=cv+dv(c + d)\mathbf{v} = c\mathbf{v} + d\mathbf{v} (distributivity over a scalar sum)
  7. c(dv)=(cd)vc(d\mathbf{v}) = (cd)\mathbf{v} (compatibility of scalar products)
  8. 1v=v1\mathbf{v} = \mathbf{v} (the scalar 11 acts trivially)

These are not assumptions. Each is a consequence of the corresponding law for real numbers, applied one component at a time. For law 5, the ii-th component of the left-hand side is c(ui+vi)c(u_i + v_i), the ii-th component of the right-hand side is cui+cvic u_i + c v_i, and these are equal because multiplication distributes over addition in R\mathbf{R}; since the two vectors agree in every component, they are equal. The remaining seven are established the same way, and a reader who has not done so should verify at least laws 2, 6 and 7 in this manner.

Law 8 looks vacuous but is not: it rules out a scalar multiplication that scales by cc and also does something else, and without it the list would not pin the structure down. Note also a derived fact worth recording: 0v=00\mathbf{v} = \mathbf{0} for every v\mathbf{v}, since 0v=(0+0)v=0v+0v0\mathbf{v} = (0+0)\mathbf{v} = 0\mathbf{v} + 0\mathbf{v} by law 6, and adding (0v)-(0\mathbf{v}) to both sides gives 0=0v\mathbf{0} = 0\mathbf{v}. The scalar 00 on the left and the vector 0\mathbf{0} on the right are different objects; the notation is standard and the context disambiguates.

Looking ahead. In Section 5 this list is read backwards. Rather than proving the eight laws about Rn\mathbf{R}^n, they are imposed as axioms on an arbitrary set with an addition and a scalar multiplication, and any such set is called a vector space. The point of that move is that sets other than Rn\mathbf{R}^n satisfy the same eight laws: polynomials of degree at most 33, 2×22 \times 2 matrices, continuous functions on an interval. Every theorem proved from the eight laws alone then applies to all of them at once. Nothing further is needed about this here; the objects of this section are arrows and tuples.

Magnitude, unit vectors, and the standard notation ei\mathbf{e}_i

In R2\mathbf{R}^2 the vector v=(v1,v2)T\mathbf{v} = (v_1, v_2)^{\mathsf{T}} is the hypotenuse of a right triangle with legs v1|v_1| and v2|v_2|, so Pythagoras gives its length as v12+v22\sqrt{v_1^2 + v_2^2}. In R3\mathbf{R}^3, apply Pythagoras twice: the horizontal shadow of (v1,v2,v3)T(v_1,v_2,v_3)^{\mathsf{T}} has length v12+v22\sqrt{v_1^2+v_2^2}, and this shadow is perpendicular to the vertical rise v3|v_3|, giving (v12+v22)2+v32=v12+v22+v32\sqrt{(\sqrt{v_1^2+v_2^2})^2 + v_3^2} = \sqrt{v_1^2+v_2^2+v_3^2}.

Definition (magnitude / norm). For vRn\mathbf{v} \in \mathbf{R}^n,

v=v12+v22++vn2.\|\mathbf{v}\| = \sqrt{v_1^2 + v_2^2 + \cdots + v_n^2}.

For n3n \leq 3 this is a theorem about lengths; for n4n \geq 4 it is the definition of length, chosen because it preserves every property the n3n \leq 3 case enjoys. Note that v\|\mathbf{v}\| is a scalar, never a vector, and v0\|\mathbf{v}\| \geq 0 always, with v=0\|\mathbf{v}\| = 0 if and only if v=0\mathbf{v} = \mathbf{0}.

Proposition (scaling). cv=cv\|c\mathbf{v}\| = |c|\,\|\mathbf{v}\| for every scalar cc. Proof. cv=i(cvi)2=c2ivi2=c2ivi2=cv\|c\mathbf{v}\| = \sqrt{\sum_i (c v_i)^2} = \sqrt{c^2 \sum_i v_i^2} = \sqrt{c^2}\,\sqrt{\sum_i v_i^2} = |c|\,\|\mathbf{v}\|. The absolute value cannot be dropped: with c=3c = -3 and v=7\|\mathbf{v}\| = 7 the magnitude is 2121, not 21-21, since a magnitude is never negative. \square

Definition (unit vector, normalisation). A vector u\mathbf{u} is a unit vector if u=1\|\mathbf{u}\| = 1. For v0\mathbf{v} \neq \mathbf{0}, the vector

v^=1vv\hat{\mathbf{v}} = \frac{1}{\|\mathbf{v}\|}\,\mathbf{v}

is a unit vector pointing the same way as v\mathbf{v}; forming it is called normalising v\mathbf{v}. It is a unit vector because v^=1/vv=1\|\hat{\mathbf{v}}\| = \big|1/\|\mathbf{v}\|\big|\,\|\mathbf{v}\| = 1 by the proposition. The hypothesis v0\mathbf{v} \neq \mathbf{0} cannot be dropped: 0\mathbf{0} has no direction and 1/01/\|\mathbf{0}\| is undefined. Consequently the vector of length LL in the direction of v\mathbf{v} is Lv^L\hat{\mathbf{v}}.

Example. v=(6,8)T\mathbf{v} = (6,-8)^{\mathsf{T}} has v=36+64=10\|\mathbf{v}\| = \sqrt{36+64} = 10, so v^=(3/5,4/5)T\hat{\mathbf{v}} = (3/5, -4/5)^{\mathsf{T}}, and indeed (3/5)2+(4/5)2=9/25+16/25=1(3/5)^2 + (4/5)^2 = 9/25 + 16/25 = 1.

Notation. Write eiRn\mathbf{e}_i \in \mathbf{R}^n for the vector whose ii-th component is 11 and whose other components are 00; thus in R3\mathbf{R}^3, e1=(1,0,0)T\mathbf{e}_1 = (1,0,0)^{\mathsf{T}}, e2=(0,1,0)T\mathbf{e}_2 = (0,1,0)^{\mathsf{T}}, e3=(0,0,1)T\mathbf{e}_3 = (0,0,1)^{\mathsf{T}}. Each ei\mathbf{e}_i is a unit vector, and (v1,,vn)T=v1e1++vnen(v_1,\ldots,v_n)^{\mathsf{T}} = v_1\mathbf{e}_1 + \cdots + v_n\mathbf{e}_n. These are commonly called the standard basis vectors, but basis is a technical term defined in Section 5; until then ei\mathbf{e}_i is notation only, and no property of a basis is being claimed.

Theorem (triangle inequality). For all u,vRn\mathbf{u}, \mathbf{v} \in \mathbf{R}^n,

u+vu+v,\|\mathbf{u} + \mathbf{v}\| \leq \|\mathbf{u}\| + \|\mathbf{v}\|,

with equality if and only if one of u,v\mathbf{u}, \mathbf{v} is a non-negative scalar multiple of the other, that is, when they point the same way (or one is 0\mathbf{0}). A proof is given in Section 3, where the inner product supplies the tool; the geometric content is that going directly is never longer than going by way of an intermediate point.

Concrete instance of strict inequality. Take u=(1,0)T\mathbf{u} = (1,0)^{\mathsf{T}} and v=(0,1)T\mathbf{v} = (0,1)^{\mathsf{T}}. Then u+v=(1,1)T\mathbf{u}+\mathbf{v} = (1,1)^{\mathsf{T}} and u+v=21.414\|\mathbf{u}+\mathbf{v}\| = \sqrt{2} \approx 1.414, whereas u+v=2\|\mathbf{u}\| + \|\mathbf{v}\| = 2. So u+v\|\mathbf{u}+\mathbf{v}\| and u+v\|\mathbf{u}\|+\|\mathbf{v}\| are genuinely different quantities. Instance of equality. Take u=(1,0)T\mathbf{u} = (1,0)^{\mathsf{T}} and v=(3,0)T\mathbf{v} = (3,0)^{\mathsf{T}}: then u+v=4=1+3\|\mathbf{u}+\mathbf{v}\| = 4 = 1 + 3.

Corollary (reverse triangle inequality). u+vuv\|\mathbf{u}+\mathbf{v}\| \geq \big|\,\|\mathbf{u}\| - \|\mathbf{v}\|\,\big|. Proof. u=(u+v)+(v)u+v+v\|\mathbf{u}\| = \|(\mathbf{u}+\mathbf{v}) + (-\mathbf{v})\| \leq \|\mathbf{u}+\mathbf{v}\| + \|\mathbf{v}\|, so uvu+v\|\mathbf{u}\| - \|\mathbf{v}\| \leq \|\mathbf{u}+\mathbf{v}\|; interchanging u\mathbf{u} and v\mathbf{v} gives vuu+v\|\mathbf{v}\| - \|\mathbf{u}\| \leq \|\mathbf{u}+\mathbf{v}\|, and together these bound the absolute value. \square So for u=5\|\mathbf{u}\| = 5 and v=9\|\mathbf{v}\| = 9, the only possible values of u+v\|\mathbf{u}+\mathbf{v}\| are those in [4,14][4, 14].

Distance. The distance between points PP and QQ with position vectors p,q\mathbf{p}, \mathbf{q} is qp\|\mathbf{q}-\mathbf{p}\|, the magnitude of the displacement between them. This is the same formula as the coordinate distance formula, restated in vector language.

Let u=(3,1,4)T\mathbf{u} = (3,-1,4)^{\mathsf{T}} and v=(2,5,1)T\mathbf{v} = (-2,5,1)^{\mathsf{T}} in R3\mathbf{R}^3, and put w=2u+v\mathbf{w} = 2\mathbf{u} + \mathbf{v}. Enter the second component w2w_2.

Compute v\|\mathbf{v}\| for v=(5,12)TR2\mathbf{v} = (-5,12)^{\mathsf{T}} \in \mathbf{R}^2.

Compute v\|\mathbf{v}\| for v=(2,3,6)TR3\mathbf{v} = (2,-3,6)^{\mathsf{T}} \in \mathbf{R}^3.

Let v=(0,3,4)T\mathbf{v} = (0,-3,4)^{\mathsf{T}}. Normalise v\mathbf{v} to obtain the unit vector v^=v/v\hat{\mathbf{v}} = \mathbf{v}/\|\mathbf{v}\|, and enter its second component as an exact decimal.

Four arrows in the plane are described by their start and end points. Three of them represent the same displacement vector. Which one does not?

Let v=(2,5,0,4)TR4\mathbf{v} = (2,-5,0,4)^{\mathsf{T}} \in \mathbf{R}^4. Compute 3v-3\mathbf{v} and enter its fourth component.

Points PP and QQ in R3\mathbf{R}^3 have position vectors p=(2,1,3)T\mathbf{p} = (2,-1,3)^{\mathsf{T}} and q=(4,3,1)T\mathbf{q} = (4,3,-1)^{\mathsf{T}}. Find the distance between PP and QQ.

Let a=(1,2)T\mathbf{a} = (1,-2)^{\mathsf{T}}, b=(3,4)T\mathbf{b} = (3,4)^{\mathsf{T}} and c=(7,6)T\mathbf{c} = (7,6)^{\mathsf{T}}. Find the scalar tt for which a+tb=c\mathbf{a} + t\mathbf{b} = \mathbf{c}.

Let u=(3,5)T\mathbf{u} = (3,5)^{\mathsf{T}} and v=(1,2)T\mathbf{v} = (1,2)^{\mathsf{T}}. Compute 2u3v\|2\mathbf{u} - 3\mathbf{v}\|.

Let w=(3,4)T\mathbf{w} = (3,-4)^{\mathsf{T}}. Find the vector of length 1010 pointing in the same direction as w\mathbf{w}, and enter its second component.

Points PP and QQ have position vectors p=(3,4)T\mathbf{p} = (-3,4)^{\mathsf{T}} and q=(7,2)T\mathbf{q} = (7,-2)^{\mathsf{T}}. The point MM is defined by the geometric condition that the displacement from PP to MM is half the displacement from PP to QQ. Find the position vector of MM and enter it in the form (a,b).

Suppose vR5\mathbf{v} \in \mathbf{R}^5 satisfies v=7\|\mathbf{v}\| = 7. Compute 3v\|-3\mathbf{v}\|.

Asked for v\|\mathbf{v}\| where v=(6,3,2)T\mathbf{v} = (-6,3,-2)^{\mathsf{T}}, a reader reports the value 5-5. Which statement correctly identifies the mistake and gives the correct value?

For every scalar cc and all u,vRn\mathbf{u},\mathbf{v} \in \mathbf{R}^n the identity c(u+v)=cu+cvc(\mathbf{u}+\mathbf{v}) = c\mathbf{u} + c\mathbf{v} holds. Name the algebraic law that this identity states. One word is sufficient.

For which value of kk is w=(k,6,2k)T\mathbf{w} = (k,\,6,\,-2k)^{\mathsf{T}} a scalar multiple of v=(2,3,4)T\mathbf{v} = (2,\,-3,\,-4)^{\mathsf{T}}?

Vectors u,vR3\mathbf{u},\mathbf{v} \in \mathbf{R}^3 satisfy u=5\|\mathbf{u}\| = 5 and v=9\|\mathbf{v}\| = 9. Which of the following is a possible value of u+v\|\mathbf{u}+\mathbf{v}\|?

Consider the claim: if u,vRn\mathbf{u},\mathbf{v} \in \mathbf{R}^n are non-zero and u=v\|\mathbf{u}\| = \|\mathbf{v}\|, then u=v\mathbf{u} = \mathbf{v} or u=v\mathbf{u} = -\mathbf{v}. Must this be true?

The following argument is offered.

Claim. For v=(3,4,12)T\mathbf{v} = (3,-4,12)^{\mathsf{T}}, v=11\|\mathbf{v}\| = 11. Step 1. The components of v\mathbf{v} are 33, 4-4 and 1212. Step 2. The magnitude of v\mathbf{v} is the total of its components, so v=3+(4)+12\|\mathbf{v}\| = 3 + (-4) + 12. Step 3. 3+(4)+12=113 + (-4) + 12 = 11, so v=11\|\mathbf{v}\| = 11. Step 4. Hence the unit vector in the direction of v\mathbf{v} is 111v\tfrac{1}{11}\mathbf{v}.

At which step does the argument first fail, and why?