Skip to content
Hub Nexus

No author yetClaim it

Version 1Updated 11 min read

Support

"Higher-dimensional geometry" sounds exotic. It is exotic— interesting and eye-opening. But it isn't distant or unreachable.

We begin by defining one-dimensional space to be the set {ℝ}^{1}. To see that definition is reasonable, draw a one-dimensional space

and make the usual correspondence with ℝ: pick a point to label 0 and another to label 1.

Now, with a scale and a direction, finding the point corresponding to, say + 2.17, is easy— start at 0 and head in the direction of 1 (i.e., the positive direction), but don't stop there, go 2.17 times as far.

The basic idea here, combining magnitude with direction, is the key to extending to higher dimensions.

An object comprised of a magnitude and a direction is a vector (we will use the same word as in the previous section because we shall show below how to describe such an object with a column vector). We can draw a vector as having some length, and pointing somewhere.

There is a subtlety here— these vectors

are equal, even though they start in different places, because they have equal lengths and equal directions. Again: those vectors are not just alike, they are equal.

How can things that are in different places be equal? Think of a vector as representing a displacement ("vector" is Latin for "carrier" or "traveler"). These squares undergo the same displacement, despite that those displacements start in different places.

Sometimes, to emphasize this property vectors have of not being anchored, they are referred to as free vectors. Thus, these free vectors are equal as each is a displacement of one over and two up.

More generally, vectors in the plane are the same if and only if they have the same change in first components and the same change in second components: the vector extending from ( {a}_{1} , {a}_{2} ) to ( {b}_{1} , {b}_{2} ) equals the vector from ( {c}_{1} , {c}_{2} ) to ( {d}_{1} , {d}_{2} ) if and only if {b}_{1} − {a}_{1} = {d}_{1} − {c}_{1} and {b}_{2} − {a}_{2} = {d}_{2} − {c}_{2}.

An expression like "the vector that, were it to start at ( {a}_{1} , {a}_{2} ), would extend to ( {b}_{1} , {b}_{2} )" is awkward. We instead describe such a vector as

( \begin{matrix}{b}_{1} − {a}_{1} \\ {b}_{2} − {a}_{2}\end{matrix} )

so that, for instance, the "one over and two up" arrows shown above picture this vector.

( \begin{matrix}1 \\ 2\end{matrix} )

We often draw the arrow as starting at the origin, and we then say it is in the canonical position (or natural position). When the vector

( \begin{matrix}{b}_{1} − {a}_{1} \\ {b}_{2} − {a}_{2}\end{matrix} )

is in its canonical position then it extends to the endpoint ( {b}_{1} − {a}_{1} , {b}_{2} − {a}_{2} ).

We typically just refer to "the point

( \begin{matrix}1 \\ 2\end{matrix} )"
rather than "the endpoint of the canonical position of" that vector.

Thus, we will call both of these sets {ℝ}^{2}.

\{ ( {x}_{1} , {x}_{2} ) \ | \ {x}_{1} , {x}_{2} ∈ ℝ \} \ \{ ( \begin{matrix}{x}_{1} \\ {x}_{2}\end{matrix} ) \ | \ {x}_{1} , {x}_{2} ∈ ℝ \}

In the prior section we defined vectors and vector operations with an algebraic motivation;

r ⋅ ( \begin{matrix}{v}_{1} \\ {v}_{2}\end{matrix} ) = ( \begin{matrix}r {v}_{1} \\ r {v}_{2}\end{matrix} ) \ ( \begin{matrix}{v}_{1} \\ {v}_{2}\end{matrix} ) + ( \begin{matrix}{w}_{1} \\ {w}_{2}\end{matrix} ) = ( \begin{matrix}{v}_{1} + {w}_{1} \\ {v}_{2} + {w}_{2}\end{matrix} )

we can now interpret those operations geometrically. For instance, if \overset{→}{v} represents a displacement then ${}3 \overset{→}{v} $ represents a displacement in the same direction but three times as far, and $− 1 \overset{→}{v} $ represents a displacement of the same distance as $\overset{→}{v} $ but in the opposite direction.

And, where \overset{→}{v} and \overset{→}{w} represent displacements, \overset{→}{v} + \overset{→}{w} represents those displacements combined.

The long arrow is the combined displacement in this sense: if, in one minute, a ship's motion gives it the displacement relative to the earth of \overset{→}{v} and a passenger's motion gives a displacement relative to the ship's deck of \overset{→}{w}, then \overset{→}{v} + \overset{→}{w} is the displacement of the passenger relative to the earth.

Another way to understand the vector sum is with the parallelogram rule. Draw the parallelogram formed by the vectors {\overset{→}{v}}_{1} , {\overset{→}{v}}_{2} and then the sum {\overset{→}{v}}_{1} + {\overset{→}{v}}_{2} extends along the diagonal to the far corner.

The above drawings show how vectors and vector operations behave in {ℝ}^{2}. We can extend to {ℝ}^{3}, or to even higher-dimensional spaces where we have no pictures, with the obvious generalization: the free vector that, if it starts at ( {a}_{1} , … , {a}_{n} ), ends at ( {b}_{1} , … , {b}_{n} ), is represented by this column

( \begin{matrix}{b}_{1} − {a}_{1} \\ ⋮ \\ {b}_{n} − {a}_{n}\end{matrix} )

(vectors are equal if they have the same representation), we aren't too careful to distinguish between a point and the vector whose canonical representation ends at that point,

{ℝ}^{n} = \{ ( \begin{matrix}{v}_{1} \\ ⋮ \\ {v}_{n}\end{matrix} ) \ | \ {v}_{1} , … , {v}_{n} ∈ ℝ \}

and addition and scalar multiplication are component-wise.

Having considered points, we now turn to the lines.

In {ℝ}^{2}, the line through ( 1 , 2 ) and ( 3 , 1 ) s comprised of (the endpoints of) the vectors in this set

\{ ( \begin{matrix}1 \\ 2\end{matrix} ) + t ⋅ ( \begin{matrix}2 \\ − 1\end{matrix} ) \ | \ t ∈ ℝ \}

That description expresses this picture.

The vector associated with the parameter t has its whole body in the line— it is a direction vector for the line. Note that points on the line to the left of x = 1 are described using negative values of t.

In {ℝ}^{3}, the line through ( 1 , 2 , 1 ) and ( 2 , 3 , 2 ) is the set of (endpoints of) vectors of this form

and lines in even higher-dimensional spaces work in the same way.

If a line uses one parameter, so that there is freedom to move back and forth in one dimension, then a plane must involve two. For example, the plane through the points ( 1 , 0 , 5 ), ( 2 , 1 , − 3 ), and ( − 2 , 4 , 0.5 ) consists of (endpoints of) the vectors in

\{ ( \begin{matrix}1 \\ 0 \\ 5\end{matrix} ) + t ⋅ ( \begin{matrix}1 \\ 1 \\ − 8\end{matrix} ) + s ⋅ ( \begin{matrix}− 3 \\ 4 \\ − 4.5\end{matrix} ) \ | \ t , s ∈ ℝ \}

(the column vectors associated with the parameters

( \begin{matrix}1 \\ 1 \\ − 8\end{matrix} ) = ( \begin{matrix}2 \\ 1 \\ − 3\end{matrix} ) − ( \begin{matrix}1 \\ 0 \\ 5\end{matrix} ) \ ( \begin{matrix}− 3 \\ 4 \\ − 4.5\end{matrix} ) = ( \begin{matrix}− 2 \\ 4 \\ 0.5\end{matrix} ) − ( \begin{matrix}1 \\ 0 \\ 5\end{matrix} )

are two vectors whose whole bodies lie in the plane). As with the line, note that some points in this plane are described with negative t's or negative s's or both.

A description of planes that is often encountered in algebra and calculus uses a single equation as the condition that describes the relationship among the first, second, and third coordinates of points in a plane.

The translation from such a description to the vector description that we favor in this book is to think of the condition as a one-equation linear system and parametrize x = ( 1 / 2 ) ( 4 − y − z ).

Generalizing from lines and planes, we define a k-dimensional linear surface (or k-flat) in {ℝ}^{n} to be \{ \overset{→}{p} + {t}_{1} {\overset{→}{v}}_{1} + {t}_{2} {\overset{→}{v}}_{2} + ⋯ + {t}_{k} {\overset{→}{v}}_{k} \ | \ {t}_{1} , … , {t}_{k} ∈ ℝ \} where {\overset{→}{v}}_{1} , … , {\overset{→}{v}}_{k} ∈ {ℝ}^{n}. For example, in {ℝ}^{4},

\{ ( \begin{matrix}2 \\ π \\ 3 \\ − 0.5\end{matrix} ) + t ( \begin{matrix}1 \\ 0 \\ 0 \\ 0\end{matrix} ) \ | \ t ∈ ℝ \}

is a line,

\{ ( \begin{matrix}0 \\ 0 \\ 0 \\ 0\end{matrix} ) + t ( \begin{matrix}1 \\ 1 \\ 0 \\ − 1\end{matrix} ) + s ( \begin{matrix}2 \\ 0 \\ 1 \\ 0\end{matrix} ) \ | \ t , s ∈ ℝ \}

is a plane, and

\{ ( \begin{matrix}3 \\ 1 \\ − 2 \\ 0.5\end{matrix} ) + r ( \begin{matrix}0 \\ 0 \\ 0 \\ − 1\end{matrix} ) + s ( \begin{matrix}1 \\ 0 \\ 1 \\ 0\end{matrix} ) + t ( \begin{matrix}2 \\ 0 \\ 1 \\ 0\end{matrix} ) \ | \ r , s , t ∈ ℝ \}

is a three-dimensional linear surface. Again, the intuition is that a line permits motion in one direction, a plane permits motion in combinations of two directions, etc.

A linear surface description can be misleading about the dimension— this

L = \{ ( \begin{matrix}1 \\ 0 \\ − 1 \\ − 2\end{matrix} ) + t ( \begin{matrix}1 \\ 1 \\ 0 \\ − 1\end{matrix} ) + s ( \begin{matrix}2 \\ 2 \\ 0 \\ − 2\end{matrix} ) \ | \ t , s ∈ ℝ \}

is a degenerate plane because it is actually a line.

L = \{ ( \begin{matrix}1 \\ 0 \\ − 1 \\ − 2\end{matrix} ) + r ( \begin{matrix}1 \\ 1 \\ 0 \\ − 1\end{matrix} ) \ | \ r ∈ ℝ \}

We shall see in the Linear Independence section of Chapter Two what relationships among vectors causes the linear surface they generate to be degenerate.

We finish this subsection by restating our conclusions from the first section in geometric terms. First, the solution set of a linear system with n unknowns is a linear surface in {ℝ}^{n}. Specifically, it is a k-dimensional linear surface, where k is the number of free variables in an echelon form version of the system. Second, the solution set of a homogeneous linear system is a linear surface passing through the origin. Finally, we can view the general solution set of any linear system as being the solution set of its associated homogeneous system offset from the origin by a vector, namely by any particular solution.

Exercises

This exercise is recommended for all readers.

Problem 1

Find the canonical name for each vector.

  • the vector from ( 2 , 1 ) to ( 4 , 2 ) in {ℝ}^{2}
  • the vector from ( 3 , 3 ) to ( 2 , 5 ) in {ℝ}^{2}
  • the vector from ( 1 , 0 , 6 ) to ( 5 , 0 , 3 ) in {ℝ}^{3}
  • the vector from ( 6 , 8 , 8 ) to ( 6 , 8 , 8 ) in {ℝ}^{3}

This exercise is recommended for all readers.

Problem 2

Decide if the two vectors are equal.

  • the vector from ( 5 , 3 ) to ( 6 , 2 ) and the vector
    from ( 1 , − 2 ) to ( 1 , 1 )
  • the vector from ( 2 , 1 , 1 ) to ( 3 , 0 , 4 ) and the vector

from ( 5 , 1 , 4 ) to ( 6 , 0 , 7 )

This exercise is recommended for all readers.

Problem 3

Does ( 1 , 0 , 2 , 1 ) lie on the line through
( − 2 , 1 , 1 , 0 ) and ( 5 , 10 , − 1 , 4 )?

This exercise is recommended for all readers.

Problem 4

  • Describe the plane through ( 1 , 1 , 5 , − 1 ),
    ( 2 , 2 , 2 , 0 ), and ( 3 , 1 , 0 , 4 ).
  • Is the origin in that plane?

Problem 5

Describe the plane that contains the following point and line.

( \begin{matrix}2 \\ 0 \\ 3\end{matrix} ) \ \{ ( \begin{matrix}− 1 \\ 0 \\ − 4\end{matrix} ) + ( \begin{matrix}1 \\ 1 \\ 2\end{matrix} ) t \ | \ t ∈ ℝ \}

This exercise is recommended for all readers.

Problem 6

Find the intersection of these planes:

\{ ( \begin{matrix}1 \\ 1 \\ 1\end{matrix} ) t + ( \begin{matrix}0 \\ 1 \\ 3\end{matrix} ) s \ | \ t , s ∈ ℝ \} , \ \{ ( \begin{matrix}1 \\ 1 \\ 0\end{matrix} ) + ( \begin{matrix}0 \\ 3 \\ 0\end{matrix} ) k + ( \begin{matrix}2 \\ 0 \\ 4\end{matrix} ) m \ | \ k , m ∈ ℝ \} .

This exercise is recommended for all readers.

Problem 7

Find the intersection of each of the following pair, if possible.

  • \{ ( \begin{matrix}1 \\ 1 \\ 2\end{matrix} ) + t ( \begin{matrix}0 \\ 1 \\ 1\end{matrix} ) \ | \ t ∈ ℝ \} ,

\{ ( \begin{matrix}1 \\ 3 \\ − 2\end{matrix} ) + s ( \begin{matrix}0 \\ 1 \\ 2\end{matrix} ) \ | \ s ∈ ℝ \} .

  • \{ ( \begin{matrix}2 \\ 0 \\ 1\end{matrix} ) + t ( \begin{matrix}1 \\ 1 \\ − 1\end{matrix} ) \ | \ t ∈ ℝ \} ,

\{ s ( \begin{matrix}0 \\ 1 \\ 2\end{matrix} ) + w ( \begin{matrix}0 \\ 4 \\ 1\end{matrix} ) \ | \ s , w ∈ ℝ \} .

Problem 8

When a plane does not pass through the origin, performing operations on vectors whose bodies lie in it is more complicated than when the plane passes through the origin. Consider the picture in this subsection of the plane

\{ ( \begin{matrix}2 \\ 0 \\ 0\end{matrix} ) + ( \begin{matrix}− 0.5 \\ 1 \\ 0\end{matrix} ) y + ( \begin{matrix}− 0.5 \\ 0 \\ 1\end{matrix} ) z \ | \ y , z ∈ ℝ \}

and the three vectors it shows, with endpoints ( 2 , 0 , 0 ), ( 1.5 , 1 , 0 ), and ( 1.5 , 0 , 1 ).

  • Redraw the picture, including the vector
    in the plane that is twice as long as the one with
    endpoint ( 1.5 , 1 , 0 ).
    The endpoint of your vector is not ( 3 , 2 , 0 ); what is it?
  • Redraw the picture, including the parallelogram

in the plane that shows the sum of the vectors
ending at ( 1.5 , 0 , 1 ) and ( 1.5 , 1 , 0 ).
The endpoint of the sum, on the diagonal, is not ( 3 , 1 , 1 ); what is it?

Problem 9

Show that the line segments
\overset{‾}{( {a}_{1} , {a}_{2} ) ( {b}_{1} , {b}_{2} )} and
\overset{‾}{( {c}_{1} , {c}_{2} ) ( {d}_{1} , {d}_{2} )}
have the same lengths and slopes if
{b}_{1} − {a}_{1} = {d}_{1} − {c}_{1} and {b}_{2} − {a}_{2} = {d}_{2} − {c}_{2}.
Can we replace 'if' by 'if and only if'?

Problem 10

How should {ℝ}^{0} be defined?

This exercise is recommended for all readers.

? Problem 11

A person traveling eastward at a rate of 3 miles per hour finds that the wind appears to blow directly from the north. On doubling his speed it appears to come from the north east. What was the wind's velocity?
(Klamkin 1957)

This exercise is recommended for all readers.

Problem 12

Euclid describes a plane as "a surface which lies evenly with the straight lines on itself". Commentators (e.g., Heron) have interpreted this to mean "(A plane surface is) such that, if a straight line pass through two points on it, the line coincides wholly with it at every spot, all ways". (Translations from Heath 1956, pp. 171-172.) Do planes, as described in this section, have that property? Does this description adequately define planes?

Solutions

References

  • Klamkin, M. S. (proposer) (1957), "Trickie T-27", Mathematics Magazine, 30 (3): 173 {{citation}}: Unknown parameter |month= ignored (help).
  • Heath, T. (1956), Euclid's Elements, vol. 1, Dover.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Next in Linear Algebra

CC BY-SA 4.0
We've translated the first section's results about solution sets into geometric terms for insight into how those sets look. But we must watch out not to be mislead by our own terms; labeling subsets of ${ℝ}^{k}$ of the forms $\{ \overset{→}{p} + t \overset{→}{v} \ | \ t ∈ ℝ \}$ and $\{ \overset{→}{p
CC BY-SA 4.0
After developing the mechanics of Gauss' method, we observed that it can be done in more than one way. One example is that we sometimes have to swap rows and there can be more than one row to choose from. Another example is that from this matrix $( \begin{matrix}2 & 2 \\ 4 & 3\end{matrix} )$ Gauss'
CC BY-SA 4.0
Gaussian elimination coupled with back-substitution solves linear systems, but it's not the only method possible. Here is an extension of Gauss' method that has some advantages. Example 1.1 To solve $\begin{matrix}x & + & y & − & 2 z & = & − 2 \\ & & y & + & 3 z & = & 7 \\ x & & & − & z & = & − 1\en
CC BY-SA 4.0
We will close this section and this chapter by proving that every matrix is row equivalent to one and only one reduced echelon form matrix. The ideas that appear here will reappear, and be further developed, in the next chapter. The underlying theme here is that one way to understand a mathematical
CC BY-SA 4.0
The linear systems in this chapter are small enough that their solution by hand is easy. But large systems are easiest, and safest, to do on a computer. There are special purpose programs such as LINPACK for this job. Another popular tool is a general purpose computer algebra system, including both
CC BY-SA 4.0
An economy is an immensely complicated network of interdependences. Changes in one part can ripple out to affect other parts. Economists have struggled to be able to describe, and to make predictions about, such a complicated object. Mathematical models using systems of linear equations have emerged