Book

Jim Hefferon
http://joshua.smcvt.edu/linearalgebra
Linear
Algebra
Notation
R, R+ , Rn
N, C
(a .. b), [a .. b]
h. . .i
V, W, U
~v, w
~ , ~0, ~0V
~ ~
B, D, ,
En = h~e1 , . . . , ~en i
RepB (~v)
Pn
Mnm
[S]
MN
W
V=
h, g
H, G
t, s
T, S
RepB,D (h)
hi,j
Znm , Z, Inn , I
|T |
R(h), N (h)
R (h), N (h)
real numbers, reals greater than 0, n-tuples of reals

natural numbers: {0, 1, 2, . . . }, complex numbers
interval (open, closed) of reals between a and b
sequence; like a set but order matters
vector spaces
vectors, zero vector, zero vector of V
bases, basis vectors
standard basis for Rn
matrix representing the vector
set of degree n polynomials
set of nm matrices
span of the set S
direct sum of subspaces
isomorphic spaces
homomorphisms, linear maps
matrices
transformations; maps from a space to itself
square matrices
matrix representing the map h
matrix entry from row i, column j
zero matrix, identity matrix
determinant of the matrix T
range space and null space of the map h
generalized range space and null space
Lower case Greek alphabet, with pronounciation

character
name
alpha AL-fuh
beta BAY-tuh
gamma GAM-muh
delta DEL-tuh
epsilon EP-suh-lon
zeta ZAY-tuh
eta AY-tuh
theta THAY-tuh
iota eye-OH-tuh
kappa KAP-uh
lambda LAM-duh
mu MEW
character
name
nu NEW
xi KSIGH
omicron OM-uh-CRON
pi PIE
rho ROW
sigma SIG-muh
tau TOW as in cow
upsilon OOP-suh-LON
phi FEE, or FI as in hi
chi KI as in hi
psi SIGH, or PSIGH
omega oh-MAY-guh
Preface
This book helps students to master the material of a standard US undergraduate
first course in Linear Algebra.
The material is standard in that the subjects covered are Gaussian reduction,
vector spaces, linear maps, determinants, and eigenvalues and eigenvectors.
Another standard is books audience: sophomores or juniors, usually with
a background of at least one semester of calculus. The help that it gives to
students comes from taking a developmental approach this books presentation
emphasizes motivation and naturalness, using many examples as well as extensive
and careful exercises.
The developmental approach is what most recommends this book so I will
elaborate. Courses at the beginning of a mathematics program focus less on
theory and more on calculating. Later courses ask for mathematical maturity: the
ability to follow different types of arguments, a familiarity with the themes that
underlie many mathematical investigations such as elementary set and function
facts, and a capacity for some independent reading and thinking. Some programs
have a separate course devoted to developing maturity and some do not. In
either case, a Linear Algebra course is an ideal spot to work on this transition.
It comes early in a program so that progress made here pays off later but also
comes late enough that students are serious about mathematics. The material
is accessible, coherent, and elegant. There are a variety of argument styles,
including direct proofs, proofs by contradiction, and proofs by induction. And,
examples are plentiful.
Helping readers start the transition to being serious students of mathematics
requires taking the mathematics seriously so all of the results here are proved.
On the other hand, we cannot assume that students have already arrived and so
in contrast with more advanced texts this book is filled with examples, often
quite detailed.
Some books that assume a not-yet-sophisticated reader begin with extensive
computations of linear systems, matrix multiplications, and determinants. Then,
when vector spaces and linear maps finally appear and definitions and proofs
start, the abrupt change can bring students to an abrupt stop. While this book
begins with linear reduction, from the start we do more than compute. The
first chapter includes proofs showing that linear reduction gives a correct and
complete solution set. Then, with the linear systems work as motivation so that
the study of linear combinations is natural, the second chapter starts with the
definition of a real vector space. In the schedule below this happens before the
third week.
Another example of this books emphasis on motivation and naturalness
is that the third chapter on linear maps does not begin with the definition of
homomorphism. Instead it begins with the definition of isomorphism, which is
natural: students themselves observe that some spaces are the same as others.
After that, the next section takes the reasonable step of isolating the operationpreservation idea to define homomorphism. This approach loses mathematical
slickness but it is a good trade because it gives to students a large gain in
sensibility.
A student progresses most in mathematics while doing exercises. In this
book problem sets start with simple checks and range up to reasonably involved
proofs. Since instructors usually assign about a dozen exercises I have tried to
put two dozen in each set, thereby giving a selection. There are even a few that
are puzzles taken from various journals, competitions, or problems collections.
These are marked with a ? and as part of the fun I have retained the original
wording as much as possible.
That is, as with the rest of the book the exercises are aimed to both build
an ability at, and help students experience the pleasure of, doing mathematics.
Students should see how the ideas arise and should be able to picture themselves
doing the same type of work.
Applications and computers. The point of view taken here, that students should
think of Linear Algebra as about vector spaces and linear maps, is not taken to
the complete exclusion of others. Applications and computing are interesting
and vital aspects of the subject. Consequently each of this books chapters closes
with a few topics in those areas. They are brief enough that an instructor can do
one in a days class or can assign them as independent or small-group projects.
Most simply give a reader a taste of the subject, discuss how Linear Algebra
comes in, point to some further reading, and give a few exercises. Whether they
figure formally in a course or not these help readers see for themselves that
Linear Algebra is a tool that a professional must master.
Availability. This book is freely available. In particular, instructors can print
copies for students and sell them out of a college bookstore. See http://joshua.
smcvt.edu/linearalgebra for the license details. That page also has the latest
version, exercise answers, beamer slides, and LATEX source.
A text is a large and complex project. One of the lessons of software
development is that such a project will have errors. I welcome bug reports and I
periodically issue revisions. My contact information is on the web page.
ii
If you are reading this on your own. This books emphasis on motivation and
development, and its availability, make it widely used for self-study. If you are
an independent student then good for you; I admire your industry. However,
you may find some advice helpful.
While an experienced instructor knows what subjects and pace suit their
class, you may find useful a timetable for a semester. (This is adapted from one
contributed by George Ashline.)
week
1
2
3
4
5
6
7
8
9
10
11
12
13
14
Monday
One.I.1
One.I.3
Two.I.1
Two.II.1
Two.III.2
exam
Three.I.2
Three.II.1
Three.III.1
Three.IV.2, 3
Three.V.1
exam
Five.II.1
Five.II.1, 2
Wednesday
One.I.1, 2
One.III.1
Two.I.1, 2
Two.III.1
Two.III.2, 3
Three.I.1
Three.I.2
Three.II.2
Three.III.2
Three.IV.4
Three.V.2
Four.I.2
Thanksgiving
Five.II.2
Friday
One.I.2, 3
One.III.2
Two.I.2
Two.III.2
Two.III.3
Three.I.1
Three.II.1
Three.II.2
Three.IV.1, 2
Three.V.1
Four.I.1
Four.III.1
break
Five.II.3
This timetable supposes that you already know Section One.II, the elements of
vectors. Note that in addition to the exams and the final exam that is not shown,
an important part of the above course is that there are required take-home
problem sets that include proofs. The computations are important in this course
but so are the proofs.
In the table of contents I have marked subsections as optional if some
instructors will pass over them in favor of spending more time elsewhere.
You might pick one or two topics that appeal to you from the end of each
chapter. Youll get more from these if you have access to software for calculations.
I recommend Sage, freely available from http://sagemath.org.
My main advice is: do many exercises. I have marked a good sample with
Xs in the margin. For all of them, you must justify your answer either with a
computation or with a proof. Be aware that few inexperienced people can write
correct proofs; try to find a knowledgeable person to work with you on these.
Finally, a caution for all students, independent or not: I cannot overemphasize
that the statement, I understand the material but its only that I have trouble
with the problems shows a misconception. Being able to do things with the
ideas is their entire point. The quotes below express this sentiment admirably.
They capture the essence of both the beauty and the power of mathematics and
iii
science in general, and of Linear Algebra in particular. (I took the liberty of

formatting them as poetry).
I know of no better tactic
than the illustration of exciting principles
by well-chosen particulars.
Stephen Jay Gould
If you really wish to learn
then you must mount the machine
and become acquainted with its tricks
by actual trial.
Wilbur Wright
Jim Hefferon
Mathematics, Saint Michaels College
Colchester, Vermont USA 05439
http://joshua.smcvt.edu/linearalgebra
2012-Feb-29
Authors Note. Inventing a good exercise, one that enlightens as well as tests,
is a creative act and hard work. The inventor deserves recognition. But texts
have traditionally not given attributions for questions. I have changed that here
where I was sure of the source. I would be glad to hear from anyone who can
help me to correctly attribute others of the questions.
iv
Contents
Chapter One:
Linear Systems
I Solving Linear Systems . . . . . . . . . . .
I.1 Gausss Method . . . . . . . . . . . .
I.2 Describing the Solution Set . . . . . .
I.3 General = Particular + Homogeneous .
II Linear Geometry . . . . . . . . . . . . . .
II.1 Vectors in Space* . . . . . . . . . . .
II.2 Length and Angle Measures* . . . . .
III Reduced Echelon Form . . . . . . . . . . .
III.1 Gauss-Jordan Reduction . . . . . . . .
III.2 The Linear Combination Lemma . . .
Topic: Computer Algebra Systems . . . . . .
Topic: Input-Output Analysis . . . . . . . . .
Topic: Accuracy of Computations . . . . . . .
Topic: Analyzing Networks . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
2
11
20
32
32
39
46
46
51
59
61
65
69
Chapter Two:
Vector Spaces
I Definition of Vector Space . . . . . . .
I.1 Definition and Examples . . . . .
I.2 Subspaces and Spanning Sets . . .
II Linear Independence . . . . . . . . . .
II.1 Definition and Examples . . . . .
III Basis and Dimension . . . . . . . . . .
III.1 Basis . . . . . . . . . . . . . . . . .
III.2 Dimension . . . . . . . . . . . . .
III.3 Vector Spaces and Linear Systems
III.4 Combining Subspaces* . . . . . . .
Topic: Fields . . . . . . . . . . . . . . . . .
Topic: Crystals . . . . . . . . . . . . . . .
Topic: Voting Paradoxes . . . . . . . . . .
Topic: Dimensional Analysis . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
76
76
87
97
97
109
109
115
121
128
137
139
143
149
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Chapter Three: Maps Between Spaces

I Isomorphisms . . . . . . . . . . . . . . . . . .
I.1 Definition and Examples . . . . . . . . .
I.2 Dimension Characterizes Isomorphism . .
II Homomorphisms . . . . . . . . . . . . . . . .
II.1 Definition . . . . . . . . . . . . . . . . . .
II.2 Range space and Null space . . . . . . . .
III Computing Linear Maps . . . . . . . . . . . .
III.1 Representing Linear Maps with Matrices
III.2 Any Matrix Represents a Linear Map* . .
IV Matrix Operations . . . . . . . . . . . . . . .
IV.1 Sums and Scalar Products . . . . . . . . .
IV.2 Matrix Multiplication . . . . . . . . . . .
IV.3 Mechanics of Matrix Multiplication . . .
IV.4 Inverses . . . . . . . . . . . . . . . . . . .
V Change of Basis . . . . . . . . . . . . . . . . .
V.1 Changing Representations of Vectors . . .
V.2 Changing Map Representations . . . . . .
VI Projection . . . . . . . . . . . . . . . . . . . .
VI.1 Orthogonal Projection Into a Line* . . .
VI.2 Gram-Schmidt Orthogonalization* . . . .
VI.3 Projection Into a Subspace* . . . . . . . .
Topic: Line of Best Fit . . . . . . . . . . . . . . .
Topic: Geometry of Linear Maps . . . . . . . . .
Topic: Magic Squares . . . . . . . . . . . . . . . .
Topic: Markov Chains . . . . . . . . . . . . . . .
Topic: Orthonormal Matrices . . . . . . . . . . .
Chapter Four: Determinants
I Definition . . . . . . . . . . . . . .
I.1 Exploration* . . . . . . . . . .
I.2 Properties of Determinants . .
I.3 The Permutation Expansion .
I.4 Determinants Exist* . . . . . .
II Geometry of Determinants . . . . .
II.1 Determinants as Size Functions
III Laplaces Expansion . . . . . . . .
III.1 Laplaces Expansion Formula*
Topic:
Topic:
Topic:
Topic:
. .
. .
. .
. .
. .
. .
. .
. .
. .
Cramers Rule . . . . . . . . . . . .
Speed of Calculating Determinants
Chis Method . . . . . . . . . . . .
Projective Geometry . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
157
157
166
173
173
180
191
191
201
209
209
212
220
229
236
236
240
248
248
252
257
266
271
277
282
288
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
296
296
301
305
313
320
320
326
326
331
334
337
341
Chapter Five:
Similarity
I Complex Vector Spaces . . . . . . . . . . . . . . .
I.1 Review of Factoring and Complex Numbers*
I.2 Complex Representations . . . . . . . . . . .
II Similarity . . . . . . . . . . . . . . . . . . . . . .
II.1 Definition and Examples . . . . . . . . . . .
II.2 Diagonalizability . . . . . . . . . . . . . . . .
II.3 Eigenvalues and Eigenvectors . . . . . . . . .
III Nilpotence . . . . . . . . . . . . . . . . . . . . . .
III.1 Self-Composition* . . . . . . . . . . . . . . .
III.2 Strings* . . . . . . . . . . . . . . . . . . . . .
IV Jordan Form . . . . . . . . . . . . . . . . . . . . .
IV.1 Polynomials of Maps and Matrices* . . . . .
IV.2 Jordan Canonical Form* . . . . . . . . . . . .
Topic: Method of Powers . . . . . . . . . . . . . . . .
Topic: Stable Populations . . . . . . . . . . . . . . .
Topic: Page Ranking . . . . . . . . . . . . . . . . . .
Topic: Linear Recurrences . . . . . . . . . . . . . . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
353
354
356
358
358
360
364
373
373
377
387
387
395
408
412
414
418
Appendix
Propositions . . . . . . . . . . .
Quantifiers . . . . . . . . . . .
Techniques of Proof . . . . . .
Sets, Functions, and Relations .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
A-1
A-3
A-4
A-6
Starred subsections are optional.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Chapter One
Linear Systems
I
Solving Linear Systems
Systems of linear equations are common in science and mathematics. These two
examples from high school science [Onan] give a sense of how they arise.
The first example is from Statics. Suppose that we have three objects, one
with a mass known to be 2 kg and we want to find the unknown masses. Suppose
further that experimentation with a meter stick produces these two balances.
40
50
25
50
2
15
25
For the masses to balance we must have that the sum of moments on the left
equals the sum of moments on the right, where the moment of an object is its
mass times its distance from the balance point. That gives a system of two
equations.
40h + 15c = 100
25c = 50 + 50h
The second example of a linear system is from Chemistry. We can mix,
under controlled conditions, toluene C7 H8 and nitric acid HNO3 to produce
trinitrotoluene C7 H5 O6 N3 along with the byproduct water (conditions have
to be very well controlled trinitrotoluene is better known as TNT). In what
proportion should we mix them? The number of atoms of each element present
before the reaction
x C7 H8 + y HNO3
z C7 H5 O6 N3 + w H2 O
Chapter One. Linear Systems
must equal the number present afterward. Applying that in turn to the elements
C, H, N, and O gives this system.
7x = 7z
8x + 1y = 5z + 2w
1y = 3z
3y = 6z + 1w
Both examples come down to solving a system of equations. In each system,
the equations involve only the first power of each variable. This chapter shows
how to solve any such system.
I.1
Gausss Method
1.1 Definition A linear combination of x1 , . . . , xn has the form

a1 x1 + a2 x2 + a3 x3 + + an xn
where the numbers a1 , . . . , an R are the combinations coefficients. A linear
equation in the variables x1 , . . . , xn has the form a1 x1 + a2 x2 + a3 x3 + +
an xn = d where d R is the constant .
An n-tuple (s1 , s2 , . . . , sn ) Rn is a solution of, or satisfies, that equation
if substituting the numbers s1 , . . . , sn for the variables gives a true statement:
a1 s1 + a2 s2 + + an sn = d. A system of linear equations
a1,1 x1 + a1,2 x2 + + a1,n xn = d1
a2,1 x1 + a2,2 x2 + + a2,n xn = d2
..
.
am,1 x1 + am,2 x2 + + am,n xn = dm
has the solution (s1 , s2 , . . . , sn ) if that n-tuple is a solution of all of the equations
in the system.
1.2 Example The combination 3x1 + 2x2 of x1 and x2 is linear. The combination
3x21 + 2 sin(x2 ) is not linear, nor is 3x21 + 2x2 .
1.3 Example The ordered pair (1, 5) is a solution of this system.
3x1 + 2x2 = 7
x1 + x2 = 6
In contrast, (5, 1) is not a solution.
Finding the set of all solutions is solving the system. We dont need guesswork
or good luck; there is an algorithm that always works. This algorithm is Gausss
Method (or Gaussian elimination or linear elimination).
Section I. Solving Linear Systems
1.4 Example To solve this system

3x3 = 9
x1 + 5x2 2x3 = 2
1
=3
3 x1 + 2x2
we transform it, step by step, until it is in a form that we can easily solve.
The first transformation rewrites the system by interchanging the first and
third row.
swap row 1 with row 3
1
3 x1
+ 2x2
=3
x1 + 5x2 2x3 = 2
3x3 = 9
The second transformation rescales the first row by multiplying both sides of
the equation by 3.
multiply row 1 by 3
x1 + 6x2
=9
x1 + 5x2 2x3 = 2
3x3 = 9
The third transformation is the only nontrivial one in this example. We mentally
multiply both sides of the first row by 1, mentally add that to the second row,
and write the result in as the new second row.
add 1 times row 1 to row 2
x1 + 6x2
= 9
x2 2x3 = 7
3x3 = 9
The point of these steps is that weve brought the system to a form where we can
easily find the value of each variable. The bottom equation shows that x3 = 3.
Substituting 3 for x3 in the middle equation shows that x2 = 1. Substituting
those two into the top equation gives that x1 = 3. Thus the system has a unique
solution; the solution set is { (3, 1, 3) }.
Most of this subsection and the next one consists of examples of solving
linear systems by Gausss Method. We will use it throughout the book. It is fast
and easy. But before we do those examples we will first show that this Method
is also safe in that it never loses solutions or picks up extraneous solutions.
1.5 Theorem (Gausss Method) If a linear system is changed to another by one of
these operations
(1) an equation is swapped with another
(2) an equation has both sides multiplied by a nonzero constant
(3) an equation is replaced by the sum of itself and a multiple of another
then the two systems have the same set of solutions.
Each of the three Gausss Method operations has a restriction. Multiplying

a row by 0 is not allowed because obviously that can change the solution set
of the system. Similarly, adding a multiple of a row to itself is not allowed
because adding 1 times the row to itself has the effect of multiplying the row
by 0. Finally, we disallow swapping a row with itself to make some results in
the fourth chapter easier to state and remember, and also because its pointless.
Proof We will cover the equation swap operation here. The other two cases
are Exercise 31.

Consider the swap of row i with row j. The tuple (s1 , . . . , sn ) satisfies the
system before the swap if and only if substituting the values for the variables,
the ss for the xs, gives a conjunction of true statements: a1,1 s1 + a1,2 s2 +
+ a1,n sn = d1 and . . . ai,1 s1 + ai,2 s2 + + ai,n sn = di and . . . aj,1 s1 +
aj,2 s2 + + aj,n sn = dj and . . . am,1 s1 + am,2 s2 + + am,n sn = dm .
In a list of statements joined with and we can rearrange the order of the
statements. Thus this requirement is met if and only if a1,1 s1 + a1,2 s2 + +
a1,n sn = d1 and . . . aj,1 s1 + aj,2 s2 + + aj,n sn = dj and . . . ai,1 s1 + ai,2 s2 +
+ ai,n sn = di and . . . am,1 s1 + am,2 s2 + + am,n sn = dm . This is exactly
the requirement that (s1 , . . . , sn ) solves the system after the row swap. QED
1.6 Definition The three operations from Theorem 1.5 are the elementary reduction operations, or row operations, or Gaussian operations. They are
swapping, multiplying by a scalar (or rescaling), and row combination.
When writing out the calculations, we will abbreviate row i by i . For
instance, we will denote a row combination operation by ki + j , with the row
that changes written second. To save writing we will often combine addition
steps when they use the same i ; see the next example.
1.7 Example Gausss Method systematically applies the row operations to solve
a system. Here is a typical case.
x+ y
=0
2x y + 3z = 3
x 2y z = 3
We begin by using the first row to eliminate the 2x in the second row and the x
in the third. To get rid of the 2x, we mentally multiply the entire first row by
2, add that to the second row, and write the result in as the new second row.
To eliminate the x leading the third row, we multiply the first row by 1, add
that to the third row, and write the result in as the new third row.
x+
21 +2
1 +3
y
=0
3y + 3z = 3
3y z = 3
To finish we transform the second system into a third system, where the last
equation involves only one unknown. We use the second row to eliminate y from
the third row.

x+
2 +3
y
=0
3y + 3z = 3
4z = 0
Now the systems solution is easy to find. The third row shows that z = 0.
Substitute that back into the second row to get y = 1 and then substitute
back into the first row to get x = 1.
1.8 Example For the Physics problem from the start of this chapter, Gausss
Method gives this.
40h + 15c = 100
50h + 25c = 50
40h +
5/41 +2
15c = 100
(175/4)c = 175
So c = 4, and back-substitution gives that h = 1. (We will solve the Chemistry

problem later.)
1.9 Example The reduction
x+ y+ z=9
2x + 4y 3z = 1
3x + 6y 5z = 0
x+ y+ z= 9
2y 5z = 17
3y 8z = 27
21 +2
31 +3
(3/2)2 +3
x+ y+
2y
z=
9
5z =
17
(1/2)z = (3/2)
shows that z = 3, y = 1, and x = 7.

As illustrated above, the point of Gausss Method is to use the elementary
reduction operations to set up back-substitution.
1.10 Definition In each row of a system, the first variable with a nonzero coefficient
is the rows leading variable. A system is in echelon form if each leading
variable is to the right of the leading variable in the row above it (except for the
leading variable in the first row).
1.11 Example The prior three examples only used the operation of row combination. This linear system requires the swap operation to get it into echelon form
because after the first combination
x y
=0
2x 2y + z + 2w = 4
y
+ w=0
2z + w = 5
xy
21 +2
=0
z + 2w = 4
y
+ w=0
2z + w = 5
the second equation has no leading y. To get one, we put in place a lower-down
row that has a leading y.
2 3
xy
y
=0
+ w=0
z + 2w = 4
2z + w = 5
(Had there been more than one suitable row below the second then we could
have swapped in any one.) With that, Gausss Method proceeds as before.
23 +4
xy
y
= 0
+ w= 0
z + 2w = 4
3w = 3
Back-substitution gives w = 1, z = 2 , y = 1, and x = 1.

The row rescaling operation is not needed, strictly speaking, to solve linear
systems. But we will use it later in this chapter as part of a variation on Gausss
Method, the Gauss-Jordan Method.
All of the systems seen so far have the same number of equations as unknowns.
All of them have a solution, and for all of them there is only one solution. We
finish this subsection by seeing some other things that can happen.
1.12 Example This system has more equations than variables.
x + 3y = 1
2x + y = 3
2x + 2y = 2
Gausss Method helps us understand this system also, since this
x + 3y = 1
5y = 5
4y = 4
21 +2
21 +3
shows that one of the equations is redundant. Echelon form

(4/5)2 +3
x + 3y = 1
5y = 5
0= 0
gives that y = 1 and x = 2. The 0 = 0 reflects the redundancy.

Gausss Method is also useful on systems with more variables than equations.
Many examples are in the next subsection.
Another way that linear systems can differ from the examples shown earlier
is that some linear systems do not have a unique solution. This can happen in
two ways.
The first is that a system can fail to have any solution at all.
1.13 Example Contrast the system in the last example with this one.
x + 3y = 1
2x + y = 3
2x + 2y = 0
21 +2
21 +3
x + 3y = 1
5y = 5
4y = 2
Here the system is inconsistent: no pair of numbers satisfies all of the equations
simultaneously. Echelon form makes this inconsistency obvious.
(4/5)2 +3
x + 3y = 1
5y = 5
0= 2
The solution set is empty.

1.14 Example The prior system has more equations than unknowns, but that
is not what causes the inconsistency Example 1.12 has more equations than
unknowns and yet is consistent. Nor is having more equations than unknowns
necessary for inconsistency, as we see with this inconsistent system that has the
same number of equations as unknowns.
x + 2y = 8
2x + 4y = 8
21 +2
x + 2y = 8
0 = 8
The other way that a linear system can fail to have a unique solution, besides
having no solutions, is to have many solutions.
1.15 Example In this system
x+ y=4
2x + 2y = 8
any pair of real numbers (s1 , s2 ) satisfying the first equation also satisfies the
second. The solution set {(x, y) x + y = 4} is infinite; some of its members
are (0, 4), (1, 5), and (2.5, 1.5).
The result of applying Gausss Method here contrasts with the prior example
because we do not get a contradictory equation.
21 +2
x+y=4
0=0
Dont be fooled by the final system in that example. A 0 = 0 equation is

not the signal that a system has many solutions.
1.16 Example The absence of a 0 = 0 does not keep a system from having
many different solutions. This system is in echelon form has no 0 = 0, but has
infinitely many solutions.
x+y+z=0
y+z=0
Some solutions are: (0, 1, 1), (0, 1/2, 1/2), (0, 0, 0), and (0, , ). There are
infinitely many solutions because any triple whose first component is 0 and
whose second component is the negative of the third is a solution.
Nor does the presence of a 0 = 0 mean that the system must have many
solutions. Example 1.12 shows that. So does this system, which does not have
any solutions at all despite that in echelon form it has a 0 = 0 row.

2x
2z = 6
y+ z=1
2x + y z = 7
3y + 3z = 0
2x
2z = 6
y+ z=1
y+ z=1
3y + 3z = 0
2x
2z = 6
y+ z= 1
0= 0
0 = 3
1 +3
2 +3
32 +4
We will finish this subsection with a summary of what weve seen so far
about Gausss Method.
Gausss Method uses the three row operations to set a system up for back
substitution. If any step shows a contradictory equation then we can stop with
the conclusion that the system has no solutions. If we reach echelon form without
a contradictory equation, and each variable is a leading variable in its row, then
the system has a unique solution and we find it by back substitution. Finally,
if we reach echelon form without a contradictory equation, and there is not a
unique solution that is, at least one variable is not a leading variable then
the system has many solutions.
The next subsection deals with the third case. We will see that such a system
must have infinitely many solutions and we will describe the solution set.
Note For all exercises, you must justify your answer. For instance, if a
question asks whether a system has a solution then you must justify a
yes response by producing the solution and must justify a no response by
showing that no solution exists.
Exercises
X 1.17 Use Gausss Method to find the unique solution for each system.
x
z=0
2x + 3y = 13
(a)
(b) 3x + y
=1
x y = 1
x + y + z = 4
X 1.18 Use Gausss Method to solve each system or conclude many solutions or no
solutions.
(a) 2x + 2y = 5
(b) x + y = 1
(c) x 3y + z = 1
(d) x y = 1
x 4y = 0
x+y=2
x + y + 2z = 14
3x 3y = 2
(e)
4y + z = 20
(f) 2x
+ z+w= 5
2x 2y + z = 0
y
w = 1
x
+z= 5
3x
zw= 0
x + y z = 10
4x + y + 2z + w = 9
X 1.19 We can solve linear systems by methods other than Gausss. One often taught
in high school is to solve one of the equations for a variable, then substitute the
resulting expression into other equations. Then we repeat that step until there
is an equation with only one variable. From that we get the first number in the
solution and then we get the rest with back-substitution. This method takes longer
than Gausss Method, since it involves more arithmetic operations, and is also
more likely to lead to errors. To illustrate how it can lead to wrong conclusions,
we will use the system
x + 3y = 1
2x + y = 3
2x + 2y = 0
from Example 1.13.
(a) Solve the first equation for x and substitute that expression into the second
equation. Find the resulting y.
(b) Again solve the first equation for x, but this time substitute that expression
into the third equation. Find this y.
What extra step must a user of this method take to avoid erroneously concluding a
system has a solution?
X 1.20 For which values of k are there no solutions, many solutions, or a unique
solution to this system?
x y=1
3x 3y = k
X 1.21 This system is not linear, in some sense,
2 sin cos + 3 tan = 3
4 sin + 2 cos 2 tan = 10
6 sin 3 cos + tan = 9
and yet we can nonetheless apply Gausss Method. Do so. Does the system have a
solution?
X 1.22 [Anton] What conditions must the constants, the bs, satisfy so that each of
these systems has a solution? Hint. Apply Gausss Method and see what happens
to the right side.
(a) x 3y = b1
(b) x1 + 2x2 + 3x3 = b1
3x + y = b2
2x1 + 5x2 + 3x3 = b2
x + 7y = b3
x1
+ 8x3 = b3
2x + 4y = b4
1.23 True or false: a system with more unknowns than equations has at least one
solution. (As always, to say true you must prove it, while to say false you must
produce a counterexample.)
1.24 Must any Chemistry problem like the one that starts this subsection a balance
the reaction problem have infinitely many solutions?
X 1.25 Find the coefficients a, b, and c so that the graph of f(x) = ax2 + bx + c passes
through the points (1, 2), (1, 6), and (2, 3).
1.26 After Theorem 1.5 we note that multiplying a row by 0 is not allowed because
that could change a solution set. Give an example of a system with solution set S0
where after multiplying a row by 0 the new system has a solution set S1 and S0 is
a proper subset of S1 . Give an example where S0 = S1 .
1.27 Gausss Method works by combining the equations in a system to make new
equations.
(a) Can we derive the equation 3x 2y = 5 by a sequence of Gaussian reduction
steps from the equations in this system?
x+y=1
4x y = 6
10

(b) Can we derive the equation 5x 3y = 2 with a sequence of Gaussian reduction
steps from the equations in this system?
2x + 2y = 5
3x + y = 4
(c) Can we derive 6x 9y + 5z = 2 by a sequence of Gaussian reduction steps
from the equations in the system?
2x + y z = 4
6x 3y + z = 5
1.28 Prove that, where a, b, . . . , e are real numbers and a 6= 0, if
ax + by = c
has the same solution set as
ax + dy = e
then they are the same equation. What if a = 0?
X 1.29 Show that if ad bc 6= 0 then

ax + by = j
cx + dy = k
has a unique solution.
X 1.30 In the system
ax + by = c
dx + ey = f
each of the equations describes a line in the xy-plane. By geometrical reasoning,
show that there are three possibilities: there is a unique solution, there is no
solution, and there are infinitely many solutions.
1.31 Finish the proof of Theorem 1.5.
1.32 Is there a two-unknowns linear system whose solution set is all of R2 ?
X 1.33 Are any of the operations used in Gausss Method redundant? That is, can we
make any of the operations from a combination of the others?
1.34 Prove that each operation of Gausss Method is reversible. That is, show that
if two systems are related by a row operation S1 S2 then there is a row operation
to go back S2 S1 .
? 1.35 [Anton] A box holding pennies, nickels and dimes contains thirteen coins with
a total value of 83 cents. How many coins of each type are in the box?
? 1.36 [Con. Prob. 1955] Four positive integers are given. Select any three of the
integers, find their arithmetic average, and add this result to the fourth integer.
Thus the numbers 29, 23, 21, and 17 are obtained. One of the original integers
is:
(a) 19
(b) 21
(c) 23
(d) 29
(e) 17
? X 1.37 [Am. Math. Mon., Jan. 1935] Laugh at this: AHAHA + TEHE = TEHAW. It
resulted from substituting a code letter for each digit of a simple example in
addition, and it is required to identify the letters and prove the solution unique.
? 1.38 [Wohascum no. 2] The Wohascum County Board of Commissioners, which has
20 members, recently had to elect a President. There were three candidates (A, B,
and C); on each ballot the three candidates were to be listed in order of preference,
with no abstentions. It was found that 11 members, a majority, preferred A over
B (thus the other 9 preferred B over A). Similarly, it was found that 12 members
preferred C over A. Given these results, it was suggested that B should withdraw,
to enable a runoff election between A and C. However, B protested, and it was
11
then found that 14 members preferred B over C! The Board has not yet recovered
from the resulting confusion. Given that every possible order of A, B, C appeared
on at least one ballot, how many members voted for B as their first choice?
? 1.39 [Am. Math. Mon., Jan. 1963] This system of n linear equations with n unknowns, said the Great Mathematician, has a curious property.
Good heavens! said the Poor Nut, What is it?
Note, said the Great Mathematician, that the constants are in arithmetic
progression.
Its all so clear when you explain it! said the Poor Nut. Do you mean like
6x + 9y = 12 and 15x + 18y = 21?
Quite so, said the Great Mathematician, pulling out his bassoon. Indeed,
the system has a unique solution. Can you find it?
Good heavens! cried the Poor Nut, I am baffled.
Are you?
I.2
Describing the Solution Set
A linear system with a unique solution has a solution set with one element. A
linear system with no solution has a solution set that is empty. In these cases
the solution set is easy to describe. Solution sets are a challenge to describe only
when they contain many elements.
2.1 Example This system has many solutions because in echelon form
2x
+z=3
xyz=1
3x y
=4
2x
+
z=
3
y (3/2)z = 1/2
y (3/2)z = 1/2
2x
+
z=
3
y (3/2)z = 1/2
0=
0
(1/2)1 +2
(3/2)1 +3
2 +3
not all of the variables are leading variables. Theorem 1.5 shows that an (x, y, z)
satisfies the first system if
and only if it satisfies the third. So we can describe
the solution set {(x, y, z) 2x + z = 3 and x y z = 1 and 3x y = 4 } in this
way.

{ (x, y, z) 2x + z = 3 and y 3z/2 = 1/2 }
()
This description is better because it has two equations instead of three but it is
not optimal because it still has some hard to understand interactions among the
variables.
To improve it, use the variable that does not lead any equation, z, to describe
the variables that do lead, x and y. The second equation gives y = (1/2)(3/2)z
and the first equation gives x = (3/2)(1/2)z. Thus we can describe the solution
set in this way.

{(x, y, z) = ((3/2) (1/2)z, (1/2) (3/2)z, z) z R}
()
12
Compared with (), the advantage of () is that z can be any real number.
This makes the job of deciding which tuples are in the solution set much easier.
For instance, taking z = 2 shows that (1/2, 5/2, 2) is a solution.
2.2 Definition In an echelon form linear system the variables that are not leading
are free.
2.3 Example Reduction of a linear system can end with more than one variable
free. On this system Gausss Method
x+ y+ z w= 1
y z + w = 1
3x
+ 6z 6w = 6
y + z w = 1
x+
31 +3
32 +3
2 +4
y+ z w= 1
y z + w = 1
3y + 3z 3w = 3
y + z w = 1
x+y+zw= 1
y z + w = 1
0= 0
0= 0
leaves x and y leading, and both z and w free. To get the description that we
prefer we work from the bottom. We first express the leading variable y in terms
of z and w, with y = 1 + z w. Moving up to the top equation, substituting
for y gives x + (1 + z w) + z w = 1 and solving for x leaves x = 2 2z + 2w.
The solution set

{(2 2z + 2w, 1 + z w, z, w) z, w R }
()
has the leading variables in terms of the free variables.
2.4 Example The list of leading variables may skip over some columns. After
this reduction
2x 2y
=0
z + 3w = 2
3x 3y
=0
x y + 2z + 6w = 4
2x 2y
=0
z + 3w = 2
0=0
2z + 6w = 4
2x 2y
=0
z + 3w = 2
0=0
0=0
(3/2)1 +3
(1/2)1 +4
22 +4
x and z are the leading variables, not x and y. The free variables
are y and w
and so we can describe the solution set as {(y, y, 2 3w, w) y, w R }. For
instance, (1, 1, 2, 0) satisfies the system take y = 1 and w = 0. The four-tuple
(1, 0, 5, 4) is not a solution since its first coordinate does not equal its second.
A variable that we use to describe a family of solutions is a parameter. We
say that the solution set in the prior example is parametrized with y and w.
13
(The terms parameter and free variable do not mean the same thing. In the
prior example y and w are free because in the echelon form system they do not
lead while they are parameters because of how we used them to describe the set
of solutions. Had we instead rewritten the second equation as w = 2/3 (1/3)z
then the free variables would still be y and w but the parameters would be y
and z.)
In the rest of this book we will solve linear systems by bringing them to
echelon form and then using the free variables as parameters in the description
of the solution set.
2.5 Example This is another system with infinitely many solutions.
x + 2y
=1
2x
+z
=2
3x + 2y + z w = 4
21 +2
31 +3
2 +3
x + 2y
=1
4y + z
=0
4y + z w = 1
x + 2y
4y + z
=1
=0
w = 1
The leading variables are x, y, and w. The variable z is free. Notice that,
although there are infinitely many solutions, the value of w doesnt vary but is
constant at 1. To parametrize, write w in terms of z with w = 1 + 0z. Then
y = (1/4)z. Substitute for y in the first equation to get x = 1 (1/2)z. The
solution set is {(1 (1/2)z, (1/4)z, z, 1) z R }.
Parametrizing solution sets shows that systems with free variables have
infinitely many solutions. In the prior example, z takes on all real number values,
each associated with an element of the solution set, and so there are infinitely
many such elements.
We finish this subsection by developing a streamlined notation for linear
systems and their solution sets.
2.6 Definition An mn matrix is a rectangular array of numbers with m rows
and n columns. Each number in the matrix is an entry.
Matrices are usually named by upper case roman letters such as A. For
instance,
!
1 2.2
5
A=
3
4 7
has 2 rows and 3 columns and so is a 23 matrix. Read that aloud as twoby-three; the number of rows is always first. We denote entries with the
corresponding lower-case letter so that ai,j is the number in row i and column j
of the array. The entry in the second row and first column is a2,1 = 3. Note
that the order of the subscripts matters: a1,2 6= a2,1 since a1,2 = 2.2. (The
parentheses around the array are so that when two matrices are adjacent then
we can tell where one ends and the next one begins.)
14
Matrices occur throughout this book. We shall use Mnm to denote the
collection of nm matrices.
2.7 Example We can abbreviate this linear system
x + 2y
=4
y z=0
x
+ 2z = 4
with this matrix.
0
1
2
1
0
0
1
2
0
4
The vertical bar just reminds a reader of the difference between the coefficients
on the systems left hand side and the constants on the right. With a bar, this
is an augmented matrix. In this notation the clerical load of Gausss Method
the copying of variables, the writing of +s and =s is lighter.
1
2
0 4
1 2
0 4
1 2
0 4
1 +3
22 +3
1 1 0 0 1 1 0
0 1 1 0 0
1 0
2 4
0 2
2 0
0 0
0 0
The second row stands for y z= 0 and the first row stands for x + 2y = 4 so
the solution set is {(4 2z, z, z) z R }.
We will also use the matrix notation to clarify the
descriptions of solution sets.
The description {(2 2z + 2w, 1 + z w, z, w) z, w R} from Example 2.3
is hard to read. We will rewrite it to group all the constants together, all the
coefficients of z together, and all the coefficients of w together. We will write
them vertically, in one-column matrices.

2
2
2
1 1
1

{ + z + w z, w R}
0 1
0
0
0
1
For instance, the top line says that x = 2 2z + 2w and the second line says
that y = 1 + z w. The next section gives a geometric interpretation that will
help us picture the solution sets.
2.8 Definition A vector (or column vector ) is a matrix with a single column.
A matrix with a single row is a row vector . The entries of a vector are its
components. A column or row vector whose components are all zeros is a zero
vector.
Vectors are an exception to the convention of representing matrices with
capital roman letters. We use lower-case roman or greek letters overlined with an
15
~ . . . (boldface is also common: a or ). For instance,

arrow: a
~ , ~b, . . . or
~ , ,
this is a column vector with a third component of 7.

1

~v = 3
7
A zero vector is denoted ~0. There are many different zero vectors, e.g., the
one-tall zero vector, the two-tall zero vector, etc. Nonetheless we will usually
say the zero vector, expecting that the size will be clear from the context.
2.9 Definition The linear equation a1 x1 + a2 x2 + + an xn = d with unknowns
x1 , . . . , xn is satisfied by

s1
..
~s = .
sn
if a1 s1 + a2 s2 + + an sn = d. A vector satisfies a linear system if it satisfies
each equation in the system.
The style of description of solution sets that we use involves adding the
vectors, and also multiplying them by real numbers, such as the z and w. We
need to define these operations.
2.10 Definition The vector sum of ~u and ~v is the vector of the sums.

u1
v1
u 1 + v1
. .
..
~u + ~v = .. + .. =
.
un
vn
u n + vn
Note that the vectors must have the same number of entries for the addition
to be defined. This entry-by-entry addition works for any pair of matrices, not
just vectors, provided that they have the same number of rows and columns.
2.11 Definition The scalar multiplication of the real number r and the vector ~v
is the vector of the multiples.
v1
rv1
. .
r ~v = r .. = ..
vn
rvn
As with the addition operation, the entry-by-entry scalar multiplication

operation extends beyond just vectors to any matrix.
We write scalar multiplication in either order, as r ~v or ~v r, or without the
symbol: r~v. (Do not refer to scalar multiplication as scalar product because
we use that name for a different operation.)
16
2.12 Example

7
1
4 28

7 =
1 7
21
3

2
3
2+3
5

3 + 1 = 3 1 = 2
1
4
1+4
5
Notice that the definitions of vector addition and scalar multiplication agree
where they overlap, for instance, ~v + ~v = 2~v.
With the notation defined, we can now solve systems in the way that we will
use from now on.
2.13 Example This system
2x + y
w
=4
y
+ w+u=4
x
z + 2w
=0
reduces in this way.
2 1
0 1 0
0
1 1
0 1
1 0 1
2 0
4
0
(1/2)1 +3
(1/2)2 +3
2
1
0 1 0
4
4
1
0
1 1
0
0 1/2 1 5/2 0 2
2 1
0 1
0 4
0
1
1 4
0 1
0 0 1
3 1/2 0

The solution set is { (w + (1/2)u, 4 w u, 3w + (1/2)u, w, u) w, u R }. We
write that in vector form.

x
0
1
1/2
y 4 1
1

{ z = 0 + 3 w + 1/2 u w, u R }

w 0 1
0
u
0
0
1
Note how well vector notation sets off the coefficients of each parameter. For
instance, the third row of the vector form shows plainly that if u is fixed then z
increases three times as fast as w. Another thing shown plainly is that setting
both w and u to zero gives that this vector

x
0
y 4

z = 0

w 0
u
0
is a particular solution of the linear system.
17
2.14 Example In the same way, this system

x y+ z=1
3x
+ z=3
5x 2y + 3z = 5
reduces
1 1 1
0 1
3
5 2 3
1
1
31 +2
3 0
51 +3
5
0
1
3
3
1
2
2
1
1
2 +3
0 0
0
0
1
3
0
1
2
0
0
0
to a one-parameter solution set.

1
1/3

{ 0 + 2/3 z z R}
0
1
As in the prior example, the vector not associated with the parameter

1

0
0
is a particular solution of the system.
Before the exercises, we will consider what we have accomplished and what
we have yet to do.
So far we have done the mechanics of Gausss Method. Except for one result,
Theorem 1.5 which we did because it says that the method gives the right
answers we have not stopped to consider any of the interesting questions that
arise.
For example, can we prove that we can always describe solution sets as above,
with a particular solution vector added to an unrestricted linear combination
of some other vectors? Weve noted that the solution sets we described in this
way have infinitely many solutions so an answer to this question would tell us
about the size of solution sets. It will also help us understand the geometry of
the solution sets.
Many questions arise from our observation that we can do Gausss Method
in more than one way (for instance, when swapping rows we may have a choice
of more than one row). Theorem 1.5 says that we must get the same solution
set no matter how we proceed but if we do Gausss Method in two ways must
we get the same number of free variables in each echelon form system? Must
those be the same variables, that is, is solving a problem one way to get y and
w free and solving it another way to get y and z free impossible?
In the rest of this chapter we will answer these questions. The answer to
each is yes. We do the first one, the proof about the description of solution sets,
in the next subsection. Then, in the chapters second section, we will describe
18
the geometry of solution sets. After that, in this chapters final section, we will
settle the questions about the parameters. When we are done we will not only
have a solid grounding in the practice of Gausss Method, we will also have
a solid grounding in the theory. We will know exactly what can and cannot
happen in a reduction.
Exercises
X 2.15 Find the indicated entry of the matrix, if it is defined.

1
3 1
A=
2 1 4
(a) a2,1
(b) a1,2
(c) a2,2
(d) a3,1
X 2.16 Give the size of each

matrix.

1
1
1 0 4
5 10
(a)
(b) 1
(c)
1
2 1 5
10
5
3 1
X 2.17 Do the indicated vector operation, if it is defined.

2
3
1
3
4
2
3
(a) 1 + 0
(b) 5
(c) 5 1
(d) 7
+9
1
1
5
1
4
1
1

1
3
2
1
1
(e)
+ 2
(f) 6 1 4 0 + 2 1
2
3
1
3
5
X 2.18 Solve each system using matrix notation. Express the solution using vectors.
(a) 3x + 6y = 18
(b) x + y = 1
(c) x1
+ x3 = 4
x + 2y = 6
x y = 1
x1 x2 + 2x3 = 5
4x1 x2 + 5x3 = 17
(d) 2a + b c = 2
(e) x + 2y z
=3
(f) x
+z+w=4
2a
+c=3
2x + y
+w=4
2x + y
w=2
ab
=0
x y+z+w=1
3x + y + z
=7
X 2.19 Solve each system using matrix notation. Give each solution set in vector
notation.
(a) 2x + y z = 1
(b) x
z
=1
(c) x y + z
=0
4x y
=3
y + 2z w = 3
y
+w=0
x + 2y + 3z w = 7
3x 2y + 3z + w = 0
y
w=0
(d) a + 2b + 3c + d e = 1
3a b + c + d + e = 3
X 2.20 The vector is in the set. What value of the parameters produces that vector?

5
1
(a)
,{
k k R}
5
1

1
2
3

(b) 2, { 1 i + 0 j i, j R }
1
0
1

0
1
2

(c) 4, { 1 m + 0 n m, n R }
2
0
1
19
2.21 Decide
the vector
is in the set.
if

3
6
(a)
,{
k k R}
1
2

5
5
(b)
,{
j j R}
4
4

2
0
1

(c) 1, { 3 + 1 r r R }
1
7
3

1
2
3

(d) 0, { 0 j + 1 k j, k R }
1
1
1
2.22 [Cleary] A farmer with 1200 acres is considering planting three different crops,
corn, soybeans, and oats. The farmer wants to use all 1200 acres. Seed corn costs
$20 per acre, while soybean and oat seed cost $50 and $12 per acre respectively.
The farmer has $40 000 available to buy seed and intends to spend it all.
(a) Use the information above to formulate two linear equations with three
unknowns and solve it.
(b) Solutions to the system are choices that the farmer can make. Write down
two reasonable solutions.
(c) Suppose that in the fall when the crops mature, the farmer can bring in
revenue of $100 per acre for corn, $300 per acre for soybeans and $80 per acre
for oats. Which of your two solutions in the prior part would have resulted in a
larger revenue?
2.23 Parametrize the solution set of this one-equation system.
x1 + x2 + + xn = 0
X 2.24
(a) Apply Gausss Method to the left-hand side to solve

x + 2y
w=a
2x
+z
=b
x+ y
+ 2w = c
for x, y, z, and w, in terms of the constants a, b, and c.

(b) Use your answer from the prior part to solve this.
x + 2y
w= 3
2x
+z
= 1
x+ y
+ 2w = 2
X 2.25 Why is the comma needed in the notation ai,j for matrix entries?
X 2.26 Give the 44 matrix whose i, j-th entry is
(a) i + j;
(b) 1 to the i + j power.
2.27 For any matrix A, the transpose of A, written Atrans , is the matrix whose
columns are the rows of A. Find the transpose of each of these.

1
1 2 3
2 3
5 10
(a)
(b)
(c)
(d) 1
4 5 6
1
1
10
5
0
X 2.28 (a) Describe all functions f(x) = ax2 + bx + c such that f(1) = 2 and f(1) = 6.
(b) Describe all functions f(x) = ax2 + bx + c such that f(1) = 2.
2.29 Show that any set of five points from the plane R2 lie on a common conic section,
that is, they all satisfy some equation of the form ax2 + by2 + cxy + dx + ey + f = 0
where some of a, . . . , f are nonzero.
20

2.30 Make up a four equations/four unknowns system having
(a) a one-parameter solution set;
(b) a two-parameter solution set;
(c) a three-parameter solution set.
? 2.31 [Shepelev] This puzzle is from a Russian web-site http://www.arbuz.uz/ and

there are many solutions to it, but mine uses linear algebra and is very naive.
Theres a planet inhabited by arbuzoids (watermeloners, to translate from Russian).
Those creatures are found in three colors: red, green and blue. There are 13 red
arbuzoids, 15 blue ones, and 17 green. When two differently colored arbuzoids
meet, they both change to the third color.
The question is, can it ever happen that all of them assume the same color?
? 2.32 [USSR Olympiad no. 174]
(a) Solve the system of equations.
ax + y = a2
x + ay = 1
For what values of a does the system fail to have solutions, and for what values
of a are there infinitely many solutions?
(b) Answer the above question for the system.
ax + y = a3
x + ay = 1
? 2.33 [Math. Mag., Sept. 1952] In air a gold-surfaced sphere weighs 7588 grams. It
is known that it may contain one or more of the metals aluminum, copper, silver,
or lead. When weighed successively under standard conditions in water, benzene,
alcohol, and glycerin its respective weights are 6588, 6688, 6778, and 6328 grams.
How much, if any, of the forenamed metals does it contain if the specific gravities
of the designated substances are taken to be as follows?
Aluminum
2.7
Alcohol
0.81
Copper
8.9
Benzene
0.90
Gold
19.3
Glycerin 1.26
Lead
11.3
Water
1.00
Silver
10.8
I.3
General = Particular + Homogeneous
In the prior subsection the descriptions of solution sets all fit a pattern. They
have a vector that is a particular solution of the system added to an unrestricted combination of some other vectors. The solution set from Example 2.13
illustrates.

0
1
1/2
4
1
1

{ 0 + w 3 + u 1/2 w, u R }

0
1
0
0
0
1
particular
solution
unrestricted
combination
21
The combination is unrestricted in that w and u can be any real numbers

there is no condition like such that 2w u = 0 that would restrict which pairs
w, u we can use.
That example shows an infinite solution set fitting the pattern. The other
two kinds of solution sets also fit. A one-element solution set fits because it has
a particular solution and the unrestricted combination part is trivial. (That is,
instead of being a combination of two vectors or of one vector, it is a combination
of no vectors. We are using the convention that the sum of an empty set of
vectors is the vector of all zeros.) A zero-element solution set fits the pattern
because there is no particular solution and so there are no sums of that form.
3.1 Theorem Any linear systems solution set has the form

~ 1 + + ck
~ k c1 , . . . , ck R }
{~p + c1
~ 1, . . . ,
where ~p is any particular solution and where the number of vectors
~ k equals the number of free variables that the system has after a Gaussian
reduction.
The solution description has two parts, the particular solution ~p and the
~
unrestricted linear combination of the s.
We shall prove the theorem in two
corresponding parts, with two lemmas.
We will focus first on the unrestricted combination. For that we consider
systems that have the vector of zeroes as a particular solution so that we can
~ 1 + + ck
~ k to c1
~ 1 + + ck
~ k.
shorten ~p + c1
3.2 Definition A linear equation is homogeneous if it has a constant of zero, so
that it can be written as a1 x1 + a2 x2 + + an xn = 0.
3.3 Example With any linear system like
3x + 4y = 3
2x y = 1
we associate a system of homogeneous equations by setting the right side to
zeros.
3x + 4y = 0
2x y = 0
Our interest in this comes from comparing the reduction of the original system
3x + 4y = 3
2x y = 1
(2/3)1 +2
3x +
4y = 3
(11/3)y = 1
with the reduction of the associated homogeneous system.

3x + 4y = 0
2x y = 0
(2/3)1 +2
3x +
4y = 0
(11/3)y = 0
22
Obviously the two reductions go in the same way. We can study how to reduce
a linear systems by instead studying how to reduce the associated homogeneous
system.
Studying the associated homogeneous system has a great advantage over
studying the original system. Nonhomogeneous systems can be inconsistent.
But a homogeneous system must be consistent since there is always at least one
solution, the zero vector.
3.4 Example Some homogeneous systems have the zero vector as their only
solution.
3x + 2y + z = 0
6x + 4y
=0
y+z=0
3x + 2y +
z=0
2z = 0
y+ z=0
21 +2
2 3
3x + 2y +
y+
z=0
z=0
2z = 0
3.5 Example Some homogeneous systems have many solutions. One example is
the Chemistry problem from the first page of this book.
7x
7z
=0
8x + y 5z 2w = 0
y 3z
=0
3y 6z w = 0
7x
7z
=0
y + 3z 2w = 0
y 3z
=0
3y 6z w = 0
7x
y+
7x
7z
=0
y + 3z 2w = 0
6z + 2w = 0
0=0
(8/7)1 +2
2 +3
32 +4
(5/2)3 +4
The solution set
7z
=0
3z 2w = 0
6z + 2w = 0
15z + 5w = 0
1/3
1

{
w w R}
1/3
1
has many vectors besides the zero vector (if we interpret w as a number of
molecules then solutions make sense only when w is a nonnegative multiple of
3).
~ 1, . . . ,
~k
3.6 Lemma For any homogeneous linear system there exist vectors
such that the solution set of the system is

~ 1 + + ck
~ k c1 , . . . , ck R}
{ c1
where k is the number of free variables in an echelon form version of the system.
23
We will make two points before the proof. The first point is that the basic
idea of the proof is straightforward. Consider a system of homogeneous equations
in echelon form.
x + y + 2z + s + t = 0
y+ z+st=0
s+t=0
Start at the bottom, expressing its leading variable in terms of the free variables
with s = t. For the next row up, substitute the expression giving s as a
combination of free variables y + z + (t) t = 0 and solve for its leading
variable y = z + 2t. Iterate: on the next row up, substitute expressions derived
from prior rows x + (z + 2t) + 2z + (t) + t = 0 and solve for the leading
variable x = z 2t. Now to finish, write the solution in vector notation

x
1
2
y 1
2

z, t R
z = 1 z + 0 t

s 0
1
t
0
1
~ 1 and
~ 2 of the lemma are the vectors associated with
and recognize that the
the free variables z and t.
The prior paragraph is a sketch, not a proof; for instance, a proof would have
to hold no matter how many equations are in the system.
The second point we will make about the proof concerns its style. The
above sketch moves row-by-row up the system, using the equations derived for
the earlier rows to do the next row. This suggests a proof by mathematical
induction. Induction is an important and non-obvious proof technique that we
shall use a number of times in this book.
We prove a statement by mathematical induction using two steps, a base
step and an inductive step. In the base step we establish that the statement is
true for some first instance, here that for the bottom equation we can write the
leading variable in terms of the free variables. In the inductive step we must
verify an implication, that if the statement is true for all prior cases then it
follows for the present case also. Here we will argue that if we can express the
leading variables from the bottom-most t rows in terms of the free variables then
we can express the leading variable of the next row up the t + 1-th row from
the bottom in terms of the free variables. Those two steps together prove the
statement because by the base step it is true for the bottom equation, and by
the inductive step the fact that it is true for the bottom equation shows that
it is true for the next one up. Then another application of the inductive step
implies that it is true for the third equation up, etc.
Proof Apply Gausss Method to get to echelon form. We may get some
0 = 0 equations (if the entire system consists of such equations then the result
More information on mathematical induction is in the appendix.
24
is trivially true) but because the system is homogeneous we cannot get any
contradictory equations. We will use induction to show this statement: each
leading variable can be expressed in terms of free variables. That will finish the
~
proof because we can then use the free variables as the parameters and the s
are the vectors of coefficients of those free variables.
For the base step, consider the bottommost equation that is not 0 = 0. Call
it equation m so we have
am,`m x`m + am,`m +1 x`m +1 + + am,n xn = 0
where am,`m 6= 0. (The ` means leading so that x`m is the leading variable
in row m.) This is the bottom row so any variables x`m +1 , . . . after the leading
variable in this equation must be free variables. Move these to the right side
and divide by am,`m
x`m = (am,`m +1 /am,`m )x`m +1 + + (am,n /am,`m )xn
to express the leading variable in terms of free variables. (If there are no variables
to the right of xlm then x`m = 0; see the tricky point following this proof.)
For the inductive step assume that for the m-th equation, and the (m 1)-th
equation, etc., up to and including the (m t)-th equation (where 0 6 t < m),
we can express the leading variable in terms of free variables. We must verify that
this statement also holds for the next equation up, the (m (t + 1))-th equation.
As in the earlier sketch, take each variable that leads in a lower-down equation
x`m , . . . , x`mt and substitute its expression in terms of free variables. (We only
need do this for the leading variables from lower-down equations because the
system is in echelon form and so in this equation none of the variables leading
higher up equations appear.) The result has the form
am(t+1),`m(t+1) x`m(t+1) + a linear combination of free variables = 0
with am(t+1),`m(t+1) 6= 0. Move the free variables to the right side and divide
by am(t+1),`m(t+1) to end with x`m(t+1) expressed in terms of free variables.
Because we have shown both the base step and the inductive step, by the
principle of mathematical induction the proposition is true.
QED

~
~
We say that the set {c1 1 + + ck k c1 , . . . , ck R } is generated by or
~ 1, . . . ,
~ k }.
spanned by the set of vectors {
There is a tricky point to this. We rely on the convention that the sum of an
empty set of vectors is the zero vector. In particular, we need this in the case
where a homogeneous system has a unique solution. Then the homogeneous
case fits the pattern of the other solution sets: in the proof above, we derive the
solution set by taking the cs to be the free variables and if there is a unique
solution then there are no free variables.
Note that the proof shows, as discussed after Example 2.4, that we can always
parametrize solution sets using the free variables.
The next lemma finishes the proof of Theorem 3.1 by considering the particular solution part of the solution sets description.
25
3.7 Lemma For a linear system, where ~p is any particular solution, the solution
set equals this set.

{~p + ~h ~h satisfies the associated homogeneous system}
Proof We will show mutual set inclusion, that any solution to the system is in
the above set and that anything in the set is a solution to the system.
For set inclusion the first way, that if a vector solves the system then it is in
the set described above, assume that ~s solves the system. Then ~s ~p solves the
associated homogeneous system since for each equation index i,
ai,1 (s1 p1 ) + + ai,n (sn pn )
= (ai,1 s1 + + ai,n sn ) (ai,1 p1 + + ai,n pn ) = di di = 0
where pj and sj are the j-th components of ~p and ~s. Express ~s in the required
~p + ~h form by writing ~s ~p as ~h.
For set inclusion the other way, take a vector of the form ~p + ~h, where ~p
solves the system and ~h solves the associated homogeneous system and note
that ~p + ~h solves the given system: for any equation index i,
ai,1 (p1 + h1 ) + + ai,n (pn + hn )
= (ai,1 p1 + + ai,n pn ) + (ai,1 h1 + + ai,n hn ) = di + 0 = di
where pj and hj are the j-th components of ~p and ~h.
QED
The two lemmas above together establish Theorem 3.1. We remember that
theorem with the slogan, General = Particular + Homogeneous.
3.8 Example This system illustrates Theorem 3.1.
x + 2y z = 1
2x + 4y
=2
y 3z = 0
Gausss Method
21 +2
x + 2y z = 1
2z = 0
y 3z = 0
2 3
x + 2y z = 1
y 3z = 0
2z = 0
shows that the general solution is a singleton set.

1

{ 0 }
0
More information on equality of sets is in the appendix.
26
That single vector is obviously a particular solution. The associated homogeneous

system reduces via the same row operations
x + 2y z = 0
2x + 4y
=0
y 3z = 0
21 +2 2 3
x + 2y z = 0
y 3z = 0
2z = 0
to also give a singleton set.

0

{ 0 }
0
So, as discussed at the start of this subsection, in this single-solution case the
general solution results from taking the particular solution and adding to it the
unique solution of the associated homogeneous system.
3.9 Example Also discussed at the start of this subsection is that the case
where the general solution set is empty also fits the General = Particular +
Homogeneous pattern. This system illustrates. Gausss Method
x
+ z + w = 1
2x y
+ w= 3
x + y + 3z + 2w = 1
x
21 +2
1 +3
+ z + w = 1
y 2z w = 5
y + 2z + w = 2
shows that it has no solutions because the final two equations are in conflict.
The associated homogeneous system has a solution, because all homogeneous
systems have at least one solution.
x
+ z+ w=0
2x y
+ w=0
x + y + 3z + 2w = 0
x
21 +2 2 +3
1 +3
+ z+w=0
y 2z w = 0
0=0
In fact the solution set of this homogeneous system is infinite.

1
1
2
1

{ z + w z, w R }
1
0
0
1
However, because no particular solution of the original system exists, the general
solution set is empty there are no vectors of the form ~p + ~h because there are
no ~p s.
3.10 Corollary Solution sets of linear systems are either empty, have one element,
or have infinitely many elements.
Proof Weve seen examples of all three happening so we need only prove that
there are no other possibilities.

First, notice a homogeneous system with at least one non-~0 solution ~v has
infinitely many solutions. This is because the set of multiples of ~v is infinite if
27
s, t R are unequal then s~v 6= t~v because s~v t~v = (s t)~v is non-~0, since any
non-0 component of ~v when rescaled by the non-0 factor s t will give a non-0
value.
Now apply Lemma 3.7 to conclude that a solution set

{~p + ~h ~h solves the associated homogeneous system }
is either empty (if there is no particular solution ~p), or has one element (if there
is a ~p and the homogeneous system has the unique solution ~0), or is infinite (if
there is a ~p and the homogeneous system has a non-~0 solution, and thus by the
prior paragraph has infinitely many solutions).
QED
This table summarizes the factors affecting the size of a general solution.
number of solutions of the
homogeneous system
particular yes
solution
exists? no
one
unique
solution
no
solutions
infinitely many
infinitely many
solutions
no
solutions
The dimension on the top of the table is the simpler one. When we perform
Gausss Method on a linear system, ignoring the constants on the right side and
so paying attention only to the coefficients on the left-hand side, we either end
with every variable leading some row or else we find that some variable does not
lead a row, that is, we find that some variable is free. (We formalize ignoring
the constants on the right by considering the associated homogeneous system.)
A notable special case is systems having the same number of equations as
unknowns. Such a system will have a solution, and that solution will be unique,
if and only if it reduces to an echelon form system where every variable leads its
row (since there are the same number of variables as rows), which will happen if
and only if the associated homogeneous system has a unique solution.
3.11 Definition A square matrix is nonsingular if it is the matrix of coefficients
of a homogeneous system with a unique solution. It is singular otherwise, that
is, if it is the matrix of coefficients of a homogeneous system with infinitely many
solutions.
3.12 Example The first of these matrices is nonsingular while the second is
singular
!
!
1 2
1 2
3 4
3 6
because the first of these homogeneous systems has a unique solution while the
second has infinitely many solutions.
x + 2y = 0
3x + 4y = 0
x + 2y = 0
3x + 6y = 0
28
We have made the distinction in the definition because a system with the same
number of equations as variables behaves in one of two ways, depending on
whether its matrix of coefficients is nonsingular or singular. A system where the
matrix of coefficients is nonsingular has a unique solution for any constants on
the right side: for instance, Gausss Method shows that this system
x + 2y = a
3x + 4y = b
has the unique solution x = b 2a and y = (3a b)/2. On the other hand, a
system where the matrix of coefficients is singular never has a unique solution
it has either no solutions or else has infinitely many, as with these.
x + 2y = 1
3x + 6y = 2
x + 2y = 1
3x + 6y = 3
We use the word singular because it means departing from general expectation and people often, naively, expect that systems with the same number of
variables as equations will have a unique solution. Thus, we can think of the
word as connoting troublesome, or at least not ideal. (That singular applies
to those systems that do not have one solution is ironic, but it is the standard
term.)
3.13 Example The systems from Example 3.3, Example 3.4, and Example 3.8
each have an associated homogeneous system with a unique solution. Thus these
matrices are nonsingular.
!
3
2 1
1 2 1
3
4
0
6 4 0
2 4
2 1
0
1 1
0 1 3
The Chemistry problem from Example 3.5 is a homogeneous system with more
than one solution so its matrix is singular.
7 0 7
0
8 1 5 2
0 1 3
0
0 3 6 1
The above table has two dimensions. We have considered the one on top: we
can tell into which column a given linear system goes solely by considering the
systems left-hand side the constants on the right-hand side play no role in
this factor.
The tables other dimension, determining whether a particular solution exists,
is tougher. Consider these two
3x + 2y = 5
3x + 2y = 5
3x + 2y = 5
3x + 2y = 4
29
with the same left sides but different right sides. The first has a solution while the
second does not, so here the constants on the right side decide if the system has
a solution. We could conjecture that the left side of a linear system determines
the number of solutions while the right side determines if solutions exist but
that guess is not correct. Compare these two systems
3x + 2y = 5
4x + 2y = 4
3x + 2y = 5
3x + 2y = 4
with the same right sides but different left sides. The first has a solution but the
second does not. Thus the constants on the right side of a system dont decide
alone whether a solution exists; rather, it depends on some interaction between
the left and right sides.
For some intuition about that interaction, consider this system with one of
the coefficients left as the parameter c.
x + 2y + 3z = 1
x+ y+ z=1
cx + 3y + 4z = 0
If c = 2 then this system has no solution because the left-hand side has the
third row as a sum of the first two, while the right-hand does not. If c 6= 2
then this system has a unique solution (try it with c = 1). For a system to
have a solution, if one row of the matrix of coefficients on the left is a linear
combination of other rows, then on the right the constant from that row must
be the same combination of constants from the same rows.
More intuition about the interaction comes from studying linear combinations.
That will be our focus in the second chapter, after we finish the study of Gausss
Method itself in the rest of this chapter.
Exercises
X 3.14 Solve each system. Express the solution set using vectors. Identify the particular
solution and the solution set of the homogeneous system.
(a) 3x + 6y = 18
(b) x + y = 1
(c) x1
+ x3 = 4
x + 2y = 6
x y = 1
x1 x2 + 2x3 = 5
4x1 x2 + 5x3 = 17
(d) 2a + b c = 2
(e) x + 2y z
=3
(f) x
+z+w=4
2a
+c=3
2x + y
+w=4
2x + y
w=2
ab
=0
x y+z+w=1
3x + y + z
=7
3.15 Solve each system, giving the solution set in vector notation. Identify the
particular solution and the solution of the homogeneous system.
(a) 2x + y z = 1
(b) x
z
=1
(c) x y + z
=0
4x y
=3
y + 2z w = 3
y
+w=0
x + 2y + 3z w = 7
3x 2y + 3z + w = 0
y
w=0
(d) a + 2b + 3c + d e = 1
3a b + c + d + e = 3
30
X 3.16 For the system

2x y
w= 3
y + z + 2w = 2
x 2y z
= 1
which of these can be used as the particular solution part of some general solution?

0
2
1
3
1
4
(a)
(b)
(c)
5
1
8
0
0
1
X 3.17 Lemma 3.7 says that we can use any particular solution for ~p. Find, if possible,
a general solution to this system
x y
+w=4
2x + 3y z
=0
y+z+w=4
that uses the given vector as its

0
5
0
1
(a)
(b)
(c)
0
7
4
10
particular solution.

2
1

1
1
3.18 One
while
theother is singular. Which is which?
is nonsingular

1
3
1
3
(a)
(b)
4 12
4 12
X 3.19 Singular
or nonsingular?

1
2
1 2
(b)
(a)
3 6
1 3
1 2 1
2 2
(d) 1 1 3
(e) 1 0
3 4 7
1 1
(c)
1
5

1
1
2
3
1
1

(Careful!)
X 3.20 Isthe
given
vector
in the set generated by the given set?
2
1
1
(a)
,{
,
}
3
4
5

1
2
1
(b) 0 , { 1 , 0 }
1
0
1

1
1
2
3
4
(c) 3 , { 0 , 1 , 3 , 2 }
0
4
5
0
1

1
2
3
0 1 0

(d)
1 , { 0 , 0 }
1
3.21 Prove that any linear system with a nonsingular matrix of coefficients has a
solution, and that the solution is unique.
3.22 In the proof of Lemma 3.6, what happens if there are no non-0 = 0 equations?
X 3.23 Prove that if ~s and ~t satisfy a homogeneous system then so do these vectors.
31
(a) ~s + ~t
(b) 3~s
(c) k~s + m~t for k, m R
Whats wrong with this argument: These three show that if a homogeneous system
has one solution then it has many solutions any multiple of a solution is another
solution, and any sum of solutions is a solution also so there are no homogeneous
systems with exactly one solution.?
3.24 Prove that if a system with only rational coefficients and constants has a
solution then it has at least one all-rational solution. Must it have infinitely many?
32
II
Linear Geometry
If you have seen the elements of vectors before then this section is an
optional review. However, later work will refer to this material so if this is
not a review then it is not optional.
In the first section, we had to do a bit of work to show that there are only
three types of solution sets singleton, empty, and infinite. But in the special
case of systems with two equations and two unknowns this is easy to see with a
picture. Draw each two-unknowns equation as a line in the plane and then the
two lines could have a unique intersection, be parallel, or be the same line.
Unique solution
Infinitely many
solutions
No solutions
3x + 2y = 7
x y = 1
3x + 2y = 7
3x + 2y = 4
3x + 2y = 7
6x + 4y = 14
These pictures arent a short way to prove the results from the prior section,
because those apply to any number of linear equations and any number of
unknowns. But they do help us understand those results. This section develops
the ideas that we need to express our results geometrically. In particular, while
the two-dimensional case is familiar, to extend to systems with more than two
unknowns we shall need some higher-dimensional geometry.
II.1
Vectors in Space
Higher-dimensional geometry sounds exotic. It is exotic interesting and

eye-opening. But it isnt distant or unreachable.
We begin by defining one-dimensional space to be R1 . To see that the
definition is reasonable, we picture a one-dimensional space
and make a correspondence with R by picking a point to label 0 and another to

label 1.
0
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, but dont stop there, go 2.17
times as far.
The basic idea here, combining magnitude with direction, is the key to
extending to higher dimensions.
Section II. Linear Geometry
33
An object comprised of a magnitude and a direction is a vector (we use the

same word as in the prior 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 (the word vector is Latin for carrier or traveler).
These two squares undergo equal displacements, despite that those displacements
start in different places.
Sometimes, to emphasize this property vectors have of not being anchored, we

can refer to them 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 (a1 , a2 ) to (b1 , b2 ) equals the vector from (c1 , c2 ) to
(d1 , d2 ) if and only if b1 a1 = d1 c1 and b2 a2 = d2 c2 .
Saying the vector that, were it to start at (a1 , a2 ), would extend to (b1 , b2 )
would be unwieldy. We instead describe that vector as
!
b1 a1
b2 a2
so that the one over and two up arrows shown above picture this vector.
!
1
2
We often draw the arrow as starting at the origin, and we then say it is in the
canonical position (or natural position or standard position). When the
34
vector
v1
v2
is in canonical position then it extends to the endpoint (v1 , v2 ).

We typically just refer to the point
!
1
2
rather than the endpoint of the canonical position of that vector. Thus, we
will call each of these R2 .
!

x1

{(x1 , x2 ) x1 , x2 R}
{
x1 , x2 R }
x2
In the prior section we defined vectors and vector operations with an algebraic
motivation;
!
!
!
!
!
v1
rv1
v1
w1
v1 + w1
r
=
+
=
v2
rv2
v2
w2
v2 + w2
we can now understand those operations geometrically.
For instance, if
~v represents a displacement then 3~v represents a displacement in the same
direction but three times as far, and 1~v represents a displacement of the same
distance as ~v but in the opposite direction.
~v
3~v
~v
And, where ~v and w

~ represent displacements, ~v+~
w represents those displacements
combined.
~
v+w
~
w
~
~
v
The long arrow is the combined displacement in this sense: if, in one minute, a
ships motion gives it the displacement relative to the earth of ~v and a passengers
motion gives a displacement relative to the ships deck of w
~ , then ~v + 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 ~v and w
~ . Then the sum ~v + w
~
extends along the diagonal to the far corner.
~
v+w
~
w
~
~
v
35
The above drawings show how vectors and vector operations behave in R2 .
We can extend to R3 , or to even higher-dimensional spaces where we have no
pictures, with the obvious generalization: the free vector that, if it starts at
(a1 , . . . , an ), ends at (b1 , . . . , bn ), is represented by this column.
b1 a1
..
.
bn an
Vectors are equal if they have the same representation. We arent too careful
about distinguishing between a point and the vector whose canonical representation ends at that point.

v1
..
n
R = { . v1 , . . . , v n R }
vn
And, we do addition and scalar multiplication component-wise.
Having considered points, we now turn to the lines. In R2 , the line through
(1, 2) and (3, 1) is comprised of (the endpoints of) the vectors in this set.
!
!
1
2
{
+t
t R}
2
1
That description expresses this picture.

2
1

=

3
1
1
2
The vector associated with the parameter t

!
!
2
3
=
1
1
1
2
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 R3 , the line through (1, 2, 1) and (2, 3, 2) is the set of (endpoints of) vectors
of this form

1
1
{ 2 + t 1 t R }
1
1
36
and lines in even higher-dimensional spaces work in the same way.

In R3 , a line uses one parameter so that a particle on that line is free to
move back and forth in one dimension, and a plane involves two parameters.
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
1
1
3

{ 0 + t 1 + s
4 t, s R}
5
8
4.5
(the column vectors associated with the

1
2
1

=
1 1 0
8
3
5
parameters

3
2
1
4 4 0
4.5
0.5
5
are two vectors whose whole bodies lie in the plane). As with the line, note that
we describe some points in this plane with negative ts or negative ss or both.
In algebra and calculus we often use a description of planes involving a single
equation as the condition that describes the relationship among the first, second,
and third coordinates of points in a plane.

x
P = { y 2x + y + z = 4 }
z
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 = 2 y/2 z/2.

2
1/2
1/2
x
1 + z
0 y, z R }
P = { y = 0 + y
0
0
1
z

Generalizing, a set of the form {~p + t1~v1 + t2~v2 + + tk~vk t1 , . . . , tk R}
where ~v1 , . . . ,~vk Rn and k 6 n is a k-dimensional linear surface (or k-flat ).
For example, in R4

2
1

0

{
+ t t R}
0
3
0.5
0
37
is a line,

2
1
0
0
1
0

{ + t + s t, s R}
1
0
0
0
1
0
is a plane, and

2
1
0
3
0
0
0
1

{ + r + s + t r, s, t R}
1
1
0
2
0
0
1
0.5
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. (When the dimension of the linear surface is one less than the dimension of
the space, that is, when we have an n 1-flat in Rn , then the surface is called a
hyperplane.)
A description of a linear surface can be misleading about the dimension. For
example, this

1
1
2
0
1
2

L = { + t + s t, s R }
1
0
0
2
1
2
is a degenerate plane because it is actually a line, since the vectors are multiples
of each other so we can merge the two into one.

1
1
0
1

L = { + r r R}
1
0
2
1
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 earlier in geometric
terms. First, the solution set of a linear system with n unknowns is a linear
surface in Rn . 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
X 1.1 Find the canonical name for each vector.
(a) the vector from (2, 1) to (4, 2) in R2
38
X
X
?X

(b) the vector from (3, 3) to (2, 5) in R2
(c) the vector from (1, 0, 6) to (5, 0, 3) in R3
(d) the vector from (6, 8, 8) to (6, 8, 8) in R3
1.2 Decide if the two vectors are equal.
(a) the vector from (5, 3) to (6, 2) and the vector from (1, 2) to (1, 1)
(b) the vector from (2, 1, 1) to (3, 0, 4) and the vector from (5, 1, 4) to (6, 0, 7)
1.3 Does (1, 0, 2, 1) lie on the line through (2, 1, 1, 0) and (5, 10, 1, 4)?
1.4 (a) Describe the plane through (1, 1, 5, 1), (2, 2, 2, 0), and (3, 1, 0, 4).
(b) Is the origin in that plane?
1.5 Describe the plane that contains this point and line.

2
1
1

0
{ 0 + 1 t t R }
3
4
2
1.6 Intersect these planes.

1
0
1
0
2

{ 1 t + 1 s t, s R }
{ 1 + 3 k + 0 m k, m R }
1
3
0
0
4
1.7 Intersect each pair, if possible.

1
0
1
0
(a) { 1 + t 1 t R }, { 3 + s 1 s R }
2
1
2
2

2
1
0
0
(b) { 0 + t 1 t R }, { s 1 + w 4 s, w R }
1
1
2
1
1.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

2
0.5
0.5

{ 0 +
1 y +
0 z y, z R }
0
0
1
and the three vectors with endpoints (2, 0, 0), (1.5, 1, 0), and (1.5, 0, 1).
(a) 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?
(b) 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?
1.9 Show that the line segments (a1 , a2 )(b1 , b2 ) and (c1 , c2 )(d1 , d2 ) have the same
lengths and slopes if b1 a1 = d1 c1 and b2 a2 = d2 c2 . Is that only if?
1.10 How should we define R0 ?
1.11 [Math. Mag., Jan. 1957] 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 winds velocity?
1.12 Euclid describes a plane as a surface which lies evenly with the straight lines
on itself. Commentators such as 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], pp.
171-172.) Do planes, as described in this section, have that property? Does this
description adequately define planes?
II.2
39
Length and Angle Measures
Weve translated the first sections results about solution sets into geometric
terms, to better understand those sets. But we must be careful not to be misled
by our own terms
labeling subsets of Rk of the forms {~p + t~v t R } and

{~p + t~v + s~
w t, s R} as lines and planes doesnt make them act like the
lines and planes of our past experience. Rather, we must ensure that the names
suit the sets. While we cant prove that the sets satisfy our intuition we
cant prove anything about intuition in this subsection well observe that a
result familiar from R2 and R3 , when generalized to arbitrary Rn , supports the
idea that a line is straight and a plane is flat. Specifically, well see how to do
Euclidean geometry in a plane by giving a definition of the angle between two
Rn vectors in the plane that they generate.
2.1 Definition The length (or norm) of a vector ~v Rn is the square root of the
sum of the squares of its components.
q
k~v k = v21 + + v2n
2.2 Remark This is a natural generalization of the Pythagorean Theorem. A
classic discussion is in [Polya].
Note that for any nonzero ~v, the vector ~v/k~vk has length one. We say that
the second vector normalizes ~v to length one.
We can use that to get a formula for the angle between two vectors. Consider
two vectors in R3 where neither is a multiple of the other
~
v
u
~
(the special case of multiples will prove below not to be an exception). They
determine a two-dimensional plane for instance, put them in canonical poistion
and take the plane formed by the origin and the endpoints. In that plane consider
the triangle with sides ~u, ~v, and ~u ~v.
Apply the Law of Cosines: k~u ~v k2 = k~u k2 + k~v k2 2 k~u k k~v k cos where
40
is the angle between the vectors. The left side gives

(u1 v1 )2 + (u2 v2 )2 + (u3 v3 )2
= (u21 2u1 v1 + v21 ) + (u22 2u2 v2 + v22 ) + (u23 2u3 v3 + v23 )
while the right side gives this.
(u21 + u22 + u23 ) + (v21 + v22 + v23 ) 2 k~u k k~v k cos
Canceling squares u21 , . . . , v23 and dividing by 2 gives the formula.
= arccos(
u1 v1 + u 2 v2 + u 3 v3
)
k~u k k~v k
To give a definition of angle that works in higher dimensions we cannot draw

pictures but we can make the argument analytically.
First, the form of the numerator is clear it comes from the middle terms
of (ui vi )2 .
2.3 Definition The dot product (or inner product or scalar product ) of two
n-component real vectors is the linear combination of their components.
~u ~v = u1 v1 + u2 v2 + + un vn
Note that the dot product of two vectors is a real number, not a vector, and
that the dot product of a vector from Rn with a vector from Rm is not defined
unless n equals m. Note also this relationship between dot product and length:
~u ~u = u1 u1 + + un un = k~u k2 .
2.4 Remark Some authors require that the first vector be a row vector and that
the second vector be a column vector. We shall not be that strict and will allow
the dot product operation between two column vectors.
Still reasoning with letters but guided by the pictures, we use the next
theorem to argue that the triangle formed by ~u, ~v, and ~u ~v in Rn lies in the
planar subset of Rn generated by ~u and ~v.
2.5 Theorem (Triangle Inequality) For any ~u,~v Rn ,
k~u + ~v k 6 k~u k + k~v k
with equality if and only if one of the vectors is a nonnegative scalar multiple of
the other one.
This is the source of the familiar saying, The shortest distance between two
points is in a straight line.
finish
u
~ +~
v
start
u
~
~
v
41
Proof (Well use some algebraic properties of dot product that we have not yet
checked, for instance that ~u (~

a + ~b) = ~u a
~ + ~u ~b and that ~u ~v = ~v ~u. See
Exercise 18.) Since all the numbers are positive, the inequality holds if and only
if its square holds.
k~u + ~v k2 6 ( k~u k + k~v k )2
( ~u + ~v ) ( ~u + ~v ) 6 k~u k2 + 2 k~u k k~v k + k~v k2
~u ~u + ~u ~v + ~v ~u + ~v ~v 6 ~u ~u + 2 k~u k k~v k + ~v ~v
2 ~u ~v 6 2 k~u k k~v k
That, in turn, holds if and only if the relationship obtained by multiplying both
sides by the nonnegative numbers k~u k and k~v k
2 ( k~v k ~u ) ( k~u k~v ) 6 2 k~u k2 k~v k2
and rewriting
0 6 k~u k2 k~v k2 2 ( k~v k ~u ) ( k~u k~v ) + k~u k2 k~v k2
is true. But factoring shows that it is true
0 6 ( k~u k~v k~v k ~u ) ( k~u k~v k~v k ~u )
since it only says that the square of the length of the vector k~u k~v k~v k ~u is
not negative. As for equality, it holds when, and only when, k~u k~v k~v k ~u is
~0. The check that k~u k~v = k~v k ~u if and only if one vector is a nonnegative real
scalar multiple of the other is easy.
QED
This result supports the intuition that even in higher-dimensional spaces,
lines are straight and planes are flat. We can easily check from the definition
that linear surfaces have the property that for any two points in that surface,
the line segment between them is contained in that surface. But if the linear
surface were not flat then that would allow for a shortcut.
Because the Triangle Inequality says that in any Rn the shortest cut between
two endpoints is simply the line segment connecting them, linear surfaces have
no bends.
Back to the definition of angle measure. The heart of the Triangle Inequalitys
proof is the ~u ~v 6 k~u k k~v k line. We might wonder if some pairs of vectors
satisfy the inequality in this way: while ~u ~v is a large number, with absolute
value bigger than the right-hand side, it is a negative large number. The next
result says that does not happen.
42
2.6 Corollary (Cauchy-Schwartz Inequality) For any ~u,~v Rn ,

| ~u ~v | 6 k ~u k k~v k
with equality if and only if one vector is a scalar multiple of the other.
Proof The Triangle Inequalitys proof shows that ~
u ~v 6 k~u k k~v k so if ~u ~v is
positive or zero then we are done. If ~u ~v is negative then this holds.

| ~u ~v | = ( ~u ~v ) = (~u ) ~v 6 k ~u k k~v k = k~u k k~v k
The equality condition is Exercise 19.
QED
The Cauchy-Schwartz inequality assures us that the next definition makes

sense because the fraction has absolute value less than or equal to one.
2.7 Definition The angle between two nonzero vectors ~u,~v Rn is
= arccos(
~u ~v
)
k~u k k~v k
(by definition, the angle between the zero vector and any other vector is right).
2.8 Corollary Vectors from Rn are orthogonal, that is, perpendicular, if and only
if their dot product is zero.
2.9 Example These vectors are orthogonal.
1
1
1
1
!
=0
Weve drawn the arrows away from canonical position but nevertheless the
vectors are orthogonal.
2.10 Example The R3 angle formula given at the start of this subsection is a
special case of the definition. Between these two

0
3
2

1
1
0
the angle is
(1)(0) + (1)(3) + (0)(2)
3
arccos(
) = arccos( )
2
2
2
2
2
2
1 +1 +0 0 +3 +2
2 13
43
approximately 0.94 radians. Notice that these vectors are not orthogonal. Although the yz-plane may appear to be perpendicular to the xy-plane, in fact
the two planes are that way only in the weak sense that there are vectors in each
orthogonal to all vectors in the other. Not every vector in each is orthogonal to
all vectors in the other.
Exercises
X 2.11 Find the length of each vector.

4
3
1
(a)
(b)
(c) 1
1
2
1
1
1
(e)
1
0
X 2.12 Find the angle between each two, if it is defined.

1
0
1
1
1
1
(a)
,
(b) 2 , 4
(c)
, 4
2
4
2
0
1
1
X 2.13 [Ohanian] During maneuvers preceding the Battle of Jutland, the British battle
cruiser Lion moved as follows (in nautical miles): 1.2 miles north, 6.1 miles 38
degrees east of south, 4.0 miles at 89 degrees east of north, and 6.5 miles at 31
degrees east of north. Find the distance between starting and ending positions.
(Ignore the earths curvature.)

0
(d) 0
0
2.14 Find k so that these two vectors are perpendicular.

k
4
1
3
2.15 Describe the set of vectors in R3 orthogonal to this one.

1
3
1
X 2.16 (a) Find the angle between the diagonal of the unit square in R2 and one of
the axes.
(b) Find the angle between the diagonal of the unit cube in R3 and one of the
axes.
(c) Find the angle between the diagonal of the unit cube in Rn and one of the
axes.
(d) What is the limit, as n goes to , of the angle between the diagonal of the
unit cube in Rn and one of the axes?
2.17 Is any vector perpendicular to itself?
X 2.18 Describe the algebraic properties of dot product.
~ = ~u w
~ + ~v w
~?
(a) Is it right-distributive over addition: (~u + ~v) w
(b) Is it left-distributive (over addition)?
(c) Does it commute?
(d) Associate?
(e) How does it interact with scalar multiplication?
As always, you must back any assertion with either a proof or an example.
2.19 Verify the equality condition in Corollary 2.6, the Cauchy-Schwartz Inequality.
(a) Show that if ~u is a negative scalar multiple of ~v then ~u ~v and ~v ~u are less
than or equal to zero.
44

(b) Show that |~u ~v| = k~u k k~v k if and only if one vector is a scalar multiple of the
other.
2.20 Suppose that ~u ~v = ~u w
~ and ~u 6= ~0. Must ~v = w
~?
X 2.21 Does any vector have length zero except a zero vector? (If yes, produce an
example. If no, prove it.)
X 2.22 Find the midpoint of the line segment connecting (x1 , y1 ) with (x2 , y2 ) in R2 .
Generalize to Rn .
2.23 Show that if ~v 6= ~0 then ~v/k~v k has length one. What if ~v = ~0?
2.24 Show that if r > 0 then r~v is r times as long as ~v. What if r < 0?
X 2.25 A vector ~v Rn of length one is a unit vector. Show that the dot product
of two unit vectors has absolute value less than or equal to one. Can less than
happen? Can equal to ?
2.26 Prove that k~u + ~v k2 + k~u ~v k2 = 2k~u k2 + 2k~v k2 .
2.27 Show that if ~x ~y = 0 for every ~y then ~x = ~0.
2.28 Is k~u1 + + ~un k 6 k~u1 k + + k~un k? If it is true then it would generalize
the Triangle Inequality.
2.29 What is the ratio between the sides in the Cauchy-Schwartz inequality?
2.30 Why is the zero vector defined to be perpendicular to every vector?
2.31 Describe the angle between two vectors in R1 .
2.32 Give a simple necessary and sufficient condition to determine whether the angle
between two vectors is acute, right, or obtuse.
X 2.33 Generalize to Rn the converse of the Pythagorean Theorem, that if ~u and ~v are
perpendicular then k~u + ~v k2 = k~u k2 + k~v k2 .
2.34 Show that k~u k = k~v k if and only if ~u + ~v and ~u ~v are perpendicular. Give an
example in R2 .
2.35 Show that if a vector is perpendicular to each of two others then it is perpendicular to each vector in the plane they generate. (Remark. They could generate a
degenerate plane a line or a point but the statement remains true.)
2.36 Prove that, where ~u,~v Rn are nonzero vectors, the vector
~u
~v
+
k~u k k~v k
bisects the angle between them. Illustrate in R2 .
2.37 Verify that the definition of angle is dimensionally correct: (1) if k > 0 then the
cosine of the angle between k~u and ~v equals the cosine of the angle between ~u and
~v, and (2) if k < 0 then the cosine of the angle between k~u and ~v is the negative of
the cosine of the angle between ~u and ~v.
X 2.38 Show that the inner product operation is linear : for ~u,~v, w
~ Rn and k, m R,
~u (k~v + m~
w) = k(~u ~v) + m(~u w
~ ).
X 2.39 The geometric mean of two positive reals x, y is xy. It is analogous to the
arithmetic mean (x + y)/2. Use the Cauchy-Schwartz inequality to show that the
geometric mean of any x, y R is less than or equal to the arithmetic mean.
? 2.40 [Cleary] Astrologers claim to be able to recognize trends in personality and
fortune that depend on an individuals birthday by somehow incorporating where
the stars were 2000 years ago, during the Hellenistic period. Suppose that instead
of star-gazers coming up with stuff, math teachers who like linear algebra (well
call them vectologers) had come up with a similar system as follows: Consider your
birthday as a row vector (month day). For instance, I was born on July 12 so my
45
vector would be (7 12). Vectologers have made the rule that how well individuals
get along with each other depends on the angle between vectors. The smaller the
angle, the more harmonious the relationship.
(a) Compute the angle between your vector and mine, expressing the answer in
radians.
(b) Would you get along better with me, or with a professor born on September 19?
(c) For maximum harmony in a relationship, when should the other person be
born?
(d) Is there a person with whom you have a worst case relationship, i.e., your
vector and theirs are orthogonal? If so, what are the birthdate(s) for such people?
If not, explain why not.
? 2.41 [Am. Math. Mon., Feb. 1933] A ship is sailing with speed and direction ~v1 ; the
wind blows apparently (judging by the vane on the mast) in the direction of a
vector a
~ ; on changing the direction and speed of the ship from ~v1 to ~v2 the apparent
wind is in the direction of a vector ~b.
Find the vector velocity of the wind.
2.42 Verify the Cauchy-Schwartz inequality by first proving Lagranges identity:
!
!
!2
X
X
X
X
2
2
aj b j
=
aj
bj
(ak bj aj bk )2
16j6n
16j6n
16j6n
16k<j6n
and then noting that the final term is positive. (Recall the meaning
X
aj bj = a1 b1 + a2 b2 + + an bn
16j6n
and
aj 2 = a1 2 + a2 2 + + an 2
16j6n
of the notation.) This result is an improvement over Cauchy-Schwartz because it

gives a formula for the difference between the two sides. Interpret that difference
in R2 .
46
III
Reduced Echelon Form
After developing the mechanics of Gausss Method, we observed that it can be

done in more than one way. For example, from this matrix
!
2 2
4 3
we could derive any of these three echelon form matrices.
!
!
!
2
2
1
1
2
0
0 1
0 1
0 1
The first results from 21 + 2 . The second comes from following (1/2)1 with
41 + 2 . The third comes from 21 + 2 followed by 22 + 1 (after the
first row combination the matrix is already in echelon form so the second one is
extra work but it is nonetheless a legal row operation).
The fact that echelon form is not unique raises questions. Will any two
echelon form versions of a linear system have the same number of free variables?
If yes, will the two have exactly the same free variables? In this section we will
give a way to decide if one linear system can be derived from another by row
operations. The answers to both questions, both yes, will follow from this.
III.1
Gauss-Jordan Reduction
Gaussian elimination coupled with back-substitution solves linear systems but

it is not the only method possible. Here is an extension of Gausss Method that
has some advantages.
1.1 Example To solve
x + y 2z = 2
y + 3z = 7
x
z = 1
we can start as usual by going to echelon form.
1 1
1
1 2 2
1 +3
2 +3
0
1
3
7 0 1
0 1
1
1
0 0
2
3
4
7
8
We can keep going to a second stage by making the leading entries into 1s
1 1 2 2
(1/4)3
0 1
3
7
0 0
1
2
Section III. Reduced Echelon Form

and then to a third stage that uses the leading entries
other entries in each column by combining upwards.
1 0
1 1 0 2
33 +2
2 +1
0 1 0 1 0 1
23 +1
0 0 1 2
0 0
47
to eliminate all of the
0
0
1
1
2
The answer is x = 1, y = 1, and z = 2.

Using one entry to clear out the rest of a column is pivoting on that entry.
Note that the row combination operations in the first stage move left to right,
from column one to column three, while the combination operations in the third
stage move right to left.
1.2 Example The middle stage operations that turn the leading entries into 1s
dont interact, so we can combine multiple ones into a single step.
!
!
7
2
1 7
2
1
21 +2
4 2 6
0 4 8
!
1 1/2 7/2
(1/2)1
0
1
2
(1/4)2
!
1 0 5/2
(1/2)2 +1
0 1
2
The answer is x = 5/2 and y = 2.
This extension of Gausss Method is Gauss-Jordan reduction.
1.3 Definition A matrix or linear system is in reduced echelon form if, in addition
to being in echelon form, each leading entry is a one and is the only nonzero
entry in its column.
The cost of using Gauss-Jordan reduction to solve a system is the additional
arithmetic. The benefit is that we can just read off the solution set from the
reduced echelon form.
In any echelon form, reduced or not, we can read off when the system has an
empty solution set because there is a contradictory equation. We can read off
when the system has a one-element solution set because there is no contradiction
and every variable is the leading variable in some row. And, we can read off
when the system has an infinite solution set because there is no contradiction
and at least one variable is free.
In reduced echelon form we can read off not just the size of the solution set
but also its description. We have no trouble describing the solution set when it
is empty, of course. Example 1.1 and 1.2 show how in a single element solution
set case the single element is in the column of constants. The next example
shows how to read the parametrization of an infinite solution set from reduced
echelon form.
48
1.4 Example
2 6
0 3
0 3
1 2
1 4
1 2
2
5
2 +3
1
0
5
0
6
3
0
(1/2)1
(4/3)3 +2
(1/3)2
(1/2)3
3 +1
1
4
1 0
32 +1
0 1
0 0
1
2
1
4
0 2
1/2 0
1/3 0
0 1
9/2
3
2
As a linear system this is

x1
1/2x3
x2 + 1/3x3
= 9/2
=
3
x4 = 2
so a solution set description is this.

x1
9/2
1/2
x
3
2
1/3
S = { =
+
x3 x3 R}
x3
0
1
x4
2
0
Thus echelon form isnt some kind of one best form for systems. Other forms,
such as reduced echelon form, have advantages and disadvantages. Instead of
picturing linear systems (and the associated matrices) as things we operate
on, always directed toward the goal of echelon form, we can think of them as
interrelated when we can get from one to another by row operations. The rest
of this subsection develops this relationship.
1.5 Lemma Elementary row operations are reversible.
Proof For any matrix A, the effect of swapping rows is reversed by swapping
them back, multiplying a row by a nonzero k is undone by multiplying by 1/k,

and adding a multiple of row i to row j (with i 6= j) is undone by subtracting
the same multiple of row i from row j.
i j j i
ki (1/k)i
A A
(We need the i 6= j condition; see Exercise 16.)
ki +j ki +j
A
QED
Again, the point of view that we are developing, buttressed now by this
lemma, is that the term reduces to is misleading: where A B, we shouldnt
think of B as after A or simpler than A. Instead we should think of them
as inter-reducible or interrelated. Below is a picture of the idea. It shows the
matrices from the start of this section and their reduced echelon form version in
a cluster as inter-reducible.

2
0

2
4
2
3
49
0
1

1
0
1
1

2
0

1
0
0
1
2
1
We say that matrices that reduce to each other are equivalent with respect
to the relationship of row reducibility. The next result justifies this using the
definition of an equivalence.
1.6 Lemma Between matrices, reduces to is an equivalence relation.
Proof We must check the conditions (i) reflexivity, that any matrix reduces
to itself, (ii) symmetry, that if A reduces to B then B reduces to A, and

(iii) transitivity, that if A reduces to B and B reduces to C then A reduces to C.
Reflexivity is easy; any matrix reduces to itself in zero row operations.
The relationship is symmetric by the prior lemma if A reduces to B by
some row operations then also B reduces to A by reversing those operations.
For transitivity, suppose that A reduces to B and that B reduces to C.
Following the reduction steps from A B with those from B C
gives a reduction from A to C.
QED
1.7 Definition Two matrices that are inter-reducible by elementary row operations
are row equivalent.
The diagram below shows the collection of all matrices as a box. Inside that
box, each matrix lies in some class. Matrices are in the same class if and only if
they are interreducible. The classes are disjoint no matrix is in two distinct
classes. We have partitioned the collection of matrices into row equivalence
classes.
A
B
...
One of the classes in this partition is the cluster of matrices from the start of this
section shown above, expanded to include all of the nonsingular 22 matrices.
The next subsection proves that the reduced echelon form of a matrix is
unique. Rephrased in terms of the row-equivalence relationship, we shall prove
that every matrix is row equivalent to one and only one reduced echelon form
matrix. In terms of the partition what we shall prove is: every equivalence class
contains one and only one reduced echelon form matrix. So each reduced echelon
form matrix serves as a representative of its class.
More information on equivalence relations is in the appendix.

More information on partitions and class representatives is in the appendix.
50
Exercises
X 1.8 Use Gauss-Jordan reduction to solve each system.
(a) x + y = 2
(b) x
z=4
(c) 3x 2y = 1
xy=0
2x + 2y
=1
6x + y = 1/2
(d) 2x y
= 1
x + 3y z = 5
y + 2z = 5
X 1.9 Find the reduced echelon
form of each
matrix.

1
3
1
1 0 3 1
2 1
(a)
(b) 2
(c) 1 4 2 1
0
4
1 3
1 3 3
3 4 8 1
0 1 3 2
(d) 0 0 5 6
2
5
2
1 5 1 5
X 1.10 Find each solution set by using Gauss-Jordan reduction and then reading off
the parametrization.
(a) 2x + y z = 1
(b) x
z
=1
(c) x y + z
=0
4x y
=3
y + 2z w = 3
y
+w=0
x + 2y + 3z w = 7
3x 2y + 3z + w = 0
y
w=0
(d) a + 2b + 3c + d e = 1
3a b + c + d + e = 3
1.11 Give two distinct echelon form versions of this matrix.
2 1 1 3
6 4 1 2
1 5 1 5
X 1.12 List the reduced echelon forms possible for each size.
(a) 22
(b) 23
(c) 32
(d) 33
X 1.13 What results from applying Gauss-Jordan reduction to a nonsingular matrix?
1.14 [Cleary] Consider the following relationship on the set of 22 matrices: we say
that A is sum-what like B if the sum of all of the entries in A is the same as the
sum of all the entries in B. For instance, the zero matrix would be sum-what like
the matrix whose first row had two sevens, and whose second row had two negative
sevens. Prove or disprove that this is an equivalence relation on the set of 22
matrices.
1.15 [Cleary] Consider the set of students in a class. Which of the following relationships are equivalence relations? Explain each answer in at least a sentence.
(a) Two students x and y are related if x has taken at least as many math classes
as y.
(b) Students x and y are related if x and y have names that start with the same
letter.
1.16 The proof of Lemma 1.5 contains a reference to the i 6= j condition on the row
combination operation.
(a) The definition of row operations has an i 6= j condition on the swap operation
i j i j
i j . Show that in A
A this condition is not needed.
(b) Write down a 22 matrix with nonzero entries, and show that the 1 1 + 1
operation is not reversed by 1 1 + 1 .
51
(c) Expand the proof of that lemma to make explicit exactly where it uses the
i 6= j condition on combining.
III.2
The Linear Combination Lemma
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 crucial observation concerns how row operations act to transform one
matrix into another: they combine the rows linearly.
2.1 Example In this reduction
2 1
1 3
0
5
(1/2)1 +2
2
0
1
5/2
0
5
(1/2)1
(2/5)2
1
0
1/2
1
(1/2)2 +1
0
2
1
0
0
1
1
2
denoting those matrices A D G B and writing the rows of A as 1 and

2 , etc., we have this.
!
!
1
1 = 1
(1/2)1 +2
2
2 = (1/2)1 + 2
!
1 = (1/2)1
(1/2)1
2 = (1/5)1 + (2/5)2
(2/5)2
!
1 = (3/5)1 (1/5)2
(1/2)2 +1
2 = (1/5)1 + (2/5)2
2.2 Example This also holds if there is a row swap. With this A, D, G, and B
!
!
!
!
0 2 1 2 1 1 (1/2)2 1 1 2 +1 1 0
1 1
0 2
0 1
0 1
we get these linear relationships.
~1
~2
1 2
~1 =
~2
~2 =
~1
(1/2)2
~1 =
~2
~2 = (1/2)~
1
2 +1
~ 1 = (1/2)~
1 + 1
~2
~ 2 = (1/2)~
In summary, Gausss Method systemmatically finds a suitable sequence of

linear combinations of the rows.
52
2.3 Lemma (Linear Combination Lemma) A linear combination of linear combinations is a linear combination.
Proof Given the set c1,1 x1 + + c1,n xn through cm,1 x1 + + cm,n xn of
linear combinations of the xs, consider a combination of those

d1 (c1,1 x1 + + c1,n xn ) + + dm (cm,1 x1 + + cm,n xn )
where the ds are scalars along with the cs. Distributing those ds and regrouping
gives
= (d1 c1,1 + + dm cm,1 )x1 + + (d1 c1,n + + dm cm,n )xn
which is also a linear combination of the xs.
QED
2.4 Corollary Where one matrix reduces to another, each row of the second is a
linear combination of the rows of the first.
The proof uses induction. Before we proceed, here is an outline of the
argument. For the base step, we will verify that the proposition is true when
reduction can be done in zero row operations. For the inductive step, we will
argue that if being able to reduce the first matrix to the second in some number
t > 0 of operations implies that each row of the second is a linear combination
of the rows of the first, then being able to reduce the first to the second in t + 1
operations implies the same thing. Together these prove the result because the
base step shows that it is true in the zero operations case, and then the inductive
step implies that it is true in the one operation case, and then the inductive
step applied again gives that it is therefore true for two operations, etc.
Proof We proceed by induction on the minimum number of row operations that
take a first matrix A to a second one B. In the base step, that zero reduction
operations suffice, the two matrices are equal and each row of B is trivially a
~i = 0
combination of As rows:
~1 + + 1
~i + + 0
~ m.
For the inductive step, assume the inductive hypothesis: with t > 0, any
matrix that can be derived from A in t or fewer operations then has rows
that are linear combinations of As rows. Suppose that reducing from A to
B requires t + 1 operations. There must be a next-to-last matrix G so that
A G B. The inductive hypothesis applies to this G because it is
only t operations away from A. That is, each row of G is a linear combination
of the rows of A.
If the operation taking G to B is a row swap then the rows of B are just the
rows of G reordered, and thus each row of B is a linear combination of the rows
of G. If the operation taking G to B is multiplication of some row i by a scalar c
then the rows of B are a linear combination of the rows of G; in particular,
~ i = c~i . And if the operation is adding a multiple of one row to another then
More information on mathematical induction is in the appendix.
53
clearly the rows of B are linear combinations of the rows of G. In all three cases
the Linear Combination Lemma applies to show that each row of B is a linear
combination of the rows of A.
With both a base step and an inductive step, the proposition follows by the
principle of mathematical induction.
QED
We now have the insight that Gausss Method builds linear combinations
of the rows. But of course the goal is to end in echelon form since it is a
particularly basic version of a linear system, because echelon form is suitable for
back substitution as it has isolated the variables. For instance, in this matrix
2 3 7 8 0 0
0 0 1 5 1 1
R=
0 0 0 3 3 0
0 0 0 0 2 1
x1 has been removed from x5 s equation. That is, Gausss Method has made
x5 s row independent of x1 s row, in some sense.
The following result makes this precise. What Gausss linear elimination
method eliminates is linear relationships among the rows.
2.5 Lemma In an echelon form matrix, no nonzero row is a linear combination
of the other nonzero rows.
Proof Let R be in echelon form and consider the non-~0 rows. First observe
that if we have a row written as a combination of the others ~i = c1~1 + +

ci1~i1 + ci+1~i+1 + + cm~m then we can rewrite that equation as
~0 = c1~1 + + ci1~i1 + ci~i + ci+1~i+1 + + cm~m
()
where not all the coefficients are zero; specifically, ci = 1. The converse
holds also: given equation () where some ci 6= 0 then we could express ~i as a
combination of the other rows by moving ci~i to the left side and dividing by
ci . Therefore we will have proved the theorem if we show that in () all of the
coefficients are 0. For that we use induction on the row index i.
The base case is the first row i = 1 (if there is no such nonzero row, so R is
the zero matrix, then the lemma holds vacuously). Recall our notation that ì
is the column number of the leading entry in row i. Equation () applied to the
entries of the rows from column `1 gives this.
0 = c1 r1,`1 + c2 r2,`1 + + cm rm,`1
The matrix is in echelon form so every row after the first has a zero entry in
that column r2,`1 = = rm,`1 = 0. Thus c1 = 0 because r1,`1 6= 0, as it leads
the row.
The inductive step is to prove this implication: if for each row index k
{1, . . . , i} the coefficient ck is 0 then ci+1 is also 0. Consider the entries from
column ì+1 in equation ().
0 = c1 r1,ì+1 + + ci+1 ri+1,ì+1 + + cm rm,ì+1
54
By the inductive hypothesis the coefficients c1 , . . . ci are all 0 so the equation

reduces to 0 = ci+1 ri+1,ì+1 + + cm rm,ì+1 . As in the base case, because the
matrix is in echelon form ri+2,ì+1 = = rm,ì+1 = 0 and ri+1,ì+1 6= 0. Thus
ci+1 = 0.
QED
2.6 Theorem Each matrix is row equivalent to a unique reduced echelon form
matrix.
Proof [Yuster] Fix a number of rows m. We will proceed by induction on the
number of columns n.
The base case is that the matrix has n = 1 column. If this is the zero matrix
then its unique echelon form is the zero matrix. If instead it has any nonzero
entries then when the matrix is brought to reduced echelon form it must have
at least one nonzero entry, so it has a 1 in the first row. Either way, its reduced
echelon form is unique.
For the inductive step we assume that n > 1 and that all m row matrices
with fewer than n columns have a unique reduced echelon form. Consider an
mn matrix A and suppose that B and C are two reduced echelon form matrices
derived from A. We will show that these two must be equal.
be the matrix consisting of the first n 1 columns of A. Observe
Let A
that any sequence of row operations that bring A to reduced echelon form will
to reduced echelon form. By the inductive hypothesis this reduced
also bring A
is unique, so if B and C differ then the difference must occur
echelon form of A
in their n-th columns.
We finish the inductive step, and the argument, by showing that the two
cannot differ only in that column. Consider a homogeneous system of equations
for which A is the matrix of coefficients.
a1,1 x1 + a1,2 x2 + + a1,n xn = 0
a2,1 x1 + a2,2 x2 + + a2,n xn = 0
..
.
am,1 x1 + am,2 x2 + + am,n xn = 0
()
By Theorem One.I.1.5 the set of solutions to that system is the same as the set
of solutions to Bs system
b1,1 x1 + b1,2 x2 + + b1,n xn = 0
b2,1 x1 + b2,2 x2 + + b2,n xn = 0
...
bm,1 x1 + bm,2 x2 + + bm,n xn = 0
()
and to Cs.
c1,1 x1 + c1,2 x2 + + c1,n xn = 0
c2,1 x1 + c2,2 x2 + + c2,n xn = 0
..
.
cm,1 x1 + cm,2 x2 + + cm,n xn = 0
()
55
With B and C different only in column n, suppose that they differ in row i.
Subtract row i of () from row i of () to get the equation (bi,n ci,n )xn = 0.
Weve assumed that bi,n 6= ci,n so the system solution includes that xn = 0.
Thus in () and () the n-th column contains a leading entry, or else the
variable xn would be free. Thats a contradiction because with B and C equal on
the first n 1 columns, the leading entries in the n-th column would have to be
in the same row, and with both matrices in reduced echelon form, both leading
entries would have to be 1, and would have to be the only nonzero entries in
that column. Thus B = C.
QED
That result answers the two questions that we posed in the introduction to
this section: do any two echelon form versions of a linear system have the same
number of free variables, and if so are they exactly the same variables? We get
from any echelon form version to the reduced echelon form by pivoting up, and
so uniqueness of reduced echelon form implies that the same variables are free
in all echelon form version of a system. Thus both questions are answered yes.
There is no linear system and no combination of row operations such that, say,
we could solve the system one way and get y and z free but solve it another way
and get y and w free.
We end this section with a recap. In Gausss Method we start with a matrix
and then derive a sequence of other matrices. We defined two matrices to be
related if we can derive one from the other. That relation is an equivalence
relation, called row equivalence, and so partitions the set of all matrices into
row equivalence classes.
1 3
27
1 3
01
...
(There are infinitely many matrices in the pictured class, but weve only got
room to show two.) We have proved there is one and only one reduced echelon
form matrix in each row equivalence class. So the reduced echelon form is a
canonical form for row equivalence: the reduced echelon form matrices are
representatives of the classes.
?
?
?
1 0
01
...
?
More information on canonical representatives is in the appendix.
56
The underlying theme here is that one way to understand a mathematical

situation is by being able to classify the cases that can happen. We have seen
this theme several times already. We classified solution sets of linear systems
into the no-elements, one-element, and infinitely-many elements cases. We also
classified linear systems with the same number of equations as unknowns into
the nonsingular and singular cases. These classifications helped us understand
the situations that we were investigating. Here, where we are investigating row
equivalence, we know that the set of all matrices breaks into the row equivalence
classes and we now have a way to put our finger on each of those classes we
can think of the matrices in a class as derived by row operations from the unique
reduced echelon form matrix in that class.
Put in more operational terms, uniqueness of reduced echelon form lets us
answer questions about the classes by translating them into questions about the
representatives. For instance, we now (as promised in this sections opening)
can decide whether one matrix can be derived from another by row reduction.
We apply the Gauss-Jordan procedure to both and see if they yield the same
reduced echelon form.
2.7 Example These matrices are not row equivalent
!
!
1 3
1 3
2
6
2
5
because their reduced echelon forms are not equal.
!
!
1 3
1 0
0
0
0 1
2.8 Example Any nonsingular 33 matrix
1 0
0 1
0 0
Gauss-Jordan reduces to this.
0
1
2.9 Example We can describe all the classes by listing all possible reduced echelon
form matrices. Any 22 matrix lies in one of these: the class of matrices row
equivalent to this,
!
0 0
0 0
the infinitely many classes of matrices row equivalent to one of this type
!
1 a
0 0
where a R (including a = 0), the class of matrices row equivalent to this,
!
0 1
0 0
57
and the class of matrices row equivalent to this

!
1 0
0 1
(this is the class of nonsingular 22 matrices).
Exercises
X 2.10 Decide if the matrices are row equivalent.

1
0 2
1 0
2
1 2
0 1
(a)
,
(b) 3 1 1 , 0 2 10
4 8
1 2
5 1 5
2 0
4

2 1 1
1 1 1
0 3 1
1 0
2
(c) 1 1
(d)
,
0 ,
0 2 10
1 2 2
2 2
5
4 3 1

1 1 1
0
1 2
(e)
,
0 0 3
1 1 1
2.11 Describe the matrices in each of the classes represented in Example 2.9.
2.12 Describe
the row equivalence
class of these.

all matrices
in

1 0
1 2
1 1
(a)
(b)
(c)
0 0
2 4
1 3
2.13 How many row equivalence classes are there?
2.14 Can row equivalence classes contain different-sized matrices?
2.15 How big are the row equivalence classes?
(a) Show that for any matrix of all zeros, the class is finite.
(b) Do any other classes contain only finitely many members?
X 2.16 Give two reduced echelon form matrices that have their leading entries in the
same columns, but that are not row equivalent.
X 2.17 Show that any two nn nonsingular matrices are row equivalent. Are any two
singular matrices row equivalent?
X 2.18 Describe all of the row equivalence classes containing these.
(a) 2 2 matrices
(b) 2 3 matrices
(c) 3 2 matrices
(d) 33 matrices
~ 0 is a linear combination of members of the set
2.19 (a) Show that a vector
~
~
~ 0 + + cn
~n
{ 1 , . . . , n } if and only if there is a linear relationship ~0 = c0
~
~
where c0 is not zero. (Hint. Watch out for the 0 = 0 case.)
(b) Use that to simplify the proof of Lemma 2.5.
X 2.20 [Trono] Three truck drivers went into a roadside cafe. One truck driver purchased four sandwiches, a cup of coffee, and ten doughnuts for $8.45. Another
driver purchased three sandwiches, a cup of coffee, and seven doughnuts for $6.30.
What did the third truck driver pay for a sandwich, a cup of coffee, and a doughnut?
X 2.21 The Linear Combination Lemma says which equations can be gotten from
Gaussian reduction of a given linear system.
(1) Produce an equation not implied by this system.
3x + 4y = 8
2x + y = 3
(2) Can any equation be derived from an inconsistent system?
58

2.22 [Hoffman & Kunze] Extend the definition of row equivalence to linear systems.
Under your definition, do equivalent systems have the same solution set?
X 2.23 In this matrix
1
3
1
2
0
4
3
3
5
the first and second columns add to the third.

(a) Show that remains true under any row operation.
(b) Make a conjecture.
(c) Prove that it holds.
Topic
Computer Algebra Systems
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 commercial
packages such as Maple, Mathematica, or MATLAB, or free packages such as
Sage.
For example, in the Topic on Networks, we need to solve this.
i0 i1 i2
i1
i2
= 0
i5
= 0
i4 + i5
= 0
i3 + i4
i6 = 0
5i1
+ 10i3
= 10
2i2
+ 4i4
= 10
5i1 2i2
+ 50i5
= 0
i3
We could do this by hand but it would take a while and be error-prone. Using a
computer is better.
We illustrate by solving that system under Sage.
sage: var(i0,i1,i2,i3,i4,i5,i6)
(i0, i1, i2, i3, i4, i5, i6)
sage: network_system=[i0-i1-i2==0, i1-i3-i5==0,
....:
i2-i4+i5==0,, i3+i4-i6==0, 5*i1+10*i3==10,
....:
2*i2+4*i4==10, 5*i1-2*i2+50*i5==0]
sage: solve(network_system, i0,i1,i2,i3,i4,i5,i6)
[[i0 == (7/3), i1 == (2/3), i2 == (5/3), i3 == (2/3),
i4 == (5/3), i5 == 0, i6 == (7/3)]]
Magic.
Here is the same system solved under Maple. We enter the array of coefficients
and the vector of constants, and then we get the solution.
> A:=array( [[1,-1,-1,0,0,0,0],
[0,1,0,-1,0,-1,0],
[0,0,1,0,-1,1,0],
[0,0,0,1,1,0,-1],
[0,5,0,10,0,0,0],
[0,0,2,0,4,0,0],
[0,5,-2,0,0,50,0]] );
> u:=array( [0,0,0,0,10,10,0] );
> linsolve(A,u);
60
7 2 5 2 5
7
[ -, -, -, -, -, 0, - ]
3 3 3 3 3
3
If a system has infinitely many solutions then the program will return a
parametrization.
Exercises
1 Use the computer to solve the two problems that opened this chapter.
(a) This is the Statics problem.
40h + 15c = 100
25c = 50 + 50h
(b) This is the Chemistry problem.
7h = 7j
8h + 1i = 5j + 2k
1i = 3j
3i = 6j + 1k
2 Use the computer to solve these systems from the first subsection, or conclude
many solutions or no solutions.
(a) 2x + 2y = 5
(b) x + y = 1
(c) x 3y + z = 1
(d) x y = 1
x 4y = 0
x+y=2
x + y + 2z = 14
3x 3y = 2
(e)
4y + z = 20
(f) 2x
+ z+w= 5
2x 2y + z = 0
y
w = 1
x
+z= 5
3x
zw= 0
x + y z = 10
4x + y + 2z + w = 9
3 Use the computer to solve these systems from the second subsection.
(a) 3x + 6y = 18
(b) x + y = 1
(c) x1
+ x3 = 4
x + 2y = 6
x y = 1
x1 x2 + 2x3 = 5
4x1 x2 + 5x3 = 17
(d) 2a + b c = 2
(e) x + 2y z
=3
(f) x
+z+w=4
2a
+c=3
2x + y
+w=4
2x + y
w=2
ab
=0
x y+z+w=1
3x + y + z
=7
4 What does the computer give for the solution of the general 22 system?
ax + cy = p
bx + dy = q
Topic
Input-Output Analysis
An economy is an immensely complicated network of interdependence. 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
and mathematical models using systems of linear equations have emerged as a
key tool. One is Input-Output Analysis, pioneered by W. Leontief, who won the
1973 Nobel Prize in Economics.
Consider an economy with many parts, two of which are the steel industry
and the auto industry. These two interact tightly as they work to meet the
demand for their product from other parts of the economy, that is, from users
external to the steel and auto sectors. For instance, should the external demand
for autos go up, that would increase in the auto industrys usage of steel. Or,
should the external demand for steel fall, then it would lead lower steels purchase
of autos. The type of Input-Output model that we will consider takes in the
external demands and then predicts how the two interact to meet those demands.
We start with a listing of production and consumption statistics. (These
numbers, giving dollar values in millions, are from [Leontief 1965], describing
the 1958 U.S. economy. Todays statistics would be different, both because of
inflation and because of technical changes in the industries.)
value of
steel
value of
auto
used by
steel
used by
auto
used by
others
5 395
2 664
25 448
48
9 030
30 346
total
For instance, the dollar value of steel used by the auto industry in this year is
2, 664 million. Note that industries may consume some of their own output.
We can fill in the blanks for the external demand. This years value of the
steel used by others is 17, 389 and this years value of the auto used by others is
21, 268. With that, we have a complete description of the external demands and
of how auto and steel interact, this year, to meet them.
Now, imagine that the external demand for steel has recently been going up
by 200 per year and so we estimate that next year it will be 17, 589. We also
62
estimate that next years external demand for autos will be down 25 to 21, 243.
We wish to predict next years total outputs.
That prediction isnt as simple as adding 200 to this years steel total and
subtracting 25 from this years auto total. For one thing, a rise in steel will cause
that industry to have an increased demand for autos, which will mitigate to
some extent the loss in external demand for autos. On the other hand, the drop
in external demand for autos will cause the auto industry to use less steel and so
lessen somewhat the upswing in steels business. In short, these two industries
form a system, and we need to predict where the system as a whole will settle.
We have these equations.
next years production of steel = next years use of steel by steel
+ next years use of steel by auto
+ next years use of steel by others
next years production of autos = next years use of autos by steel
+ next years use of autos by auto
+ next years use of autos by others
On the left side put the unknowns s be next years total production of steel
and a for next years total output of autos. At the ends of the right sides
go our external demand estimates for next year 17, 589 and 21, 243. For the
remaining four terms, we look to the table of this years information about how
the industries interact.
For next years use of steel by steel, we note that this year the steel industry
used 5395 units of steel input to produce 25, 448 units of steel output. So next
year, when the steel industry will produce s units out, we expect that doing so
will take s (5395)/(25 448) units of steel input this is simply the assumption
that input is proportional to output. (We are assuming that the ratio of input to
output remains constant over time; in practice, models may try to take account
of trends of change in the ratios.)
Next years use of steel by the auto industry is similar. This year, the auto
industry uses 2664 units of steel input to produce 30346 units of auto output. So
next year, when the auto industrys total output is a, we expect it to consume
a (2664)/(30346) units of steel.
Filling in the other equation in the same way gives this system of linear
equations.
5 395
2 664
s+
a + 17 589 = s
25 448
30 346
48
9 030
s+
a + 21 243 = a
25 448
30 346
Gausss Method
(20 053/25 448)s (2 664/30 346)a = 17 589
(48/25 448)s + (21 316/30 346)a = 21 243
gives s = 25 698 and a = 30 311.
Topic: Input-Output Analysis
63
Looking back, recall that above we described why the prediction of next
years totals isnt as simple as adding 200 to last years steel total and subtracting
25 from last years auto total. In fact, comparing these totals for next year to
the ones given at the start for the current year shows that, despite the drop
in external demand, the total production of the auto industry will rise. The
increase in internal demand for autos caused by steels sharp rise in business
more than makes up for the loss in external demand for autos.
One of the advantages of having a mathematical model is that we can ask
What if . . . ? questions. For instance, we can ask What if the estimates for
next years external demands are somewhat off? To try to understand how
much the models predictions change in reaction to changes in our estimates, we
can try revising our estimate of next years external steel demand from 17, 589
down to 17, 489, while keeping the assumption of next years external demand
for autos fixed at 21, 243. The resulting system
(20 053/25 448)s (2 664/30 346)a = 17 489
(48/25 448)s + (21 316/30 346)a = 21 243
when solved gives s = 25 571 and a = 30 311. This is sensitivity analysis. We
are seeing how sensitive the predictions of our model are to the accuracy of the
assumptions.
Naturally, we can consider larger models that detail the interactions among
more sectors of an economy; these models are typically solved on a computer.
Naturally also, a single model does not suit every case and assuring that the
assumptions underlying a model are reasonable for a particular prediction
requires the judgments of experts. With those caveats however, this model has
proven in practice to be a useful and accurate tool for economic analysis. For
further reading, try [Leontief 1951] and [Leontief 1965].
Exercises
Hint: these systems are easiest to solve on a computer.
1 With the steel-auto system given above, estimate next years total productions in
these cases.
(a) Next years external demands are: up 200 from this year for steel, and
unchanged for autos.
(b) Next years external demands are: up 100 for steel, and up 200 for autos.
(c) Next years external demands are: up 200 for steel, and up 200 for autos.
2 In the steel-auto system, the ratio for the use of steel by the auto industry is
2 664/30 346, about 0.0878. Imagine that a new process for making autos reduces
this ratio to .0500.
(a) How will the predictions for next years total productions change compared
to the first example discussed above (i.e., taking next years external demands
to be 17, 589 for steel and 21, 243 for autos)?
(b) Predict next years totals if, in addition, the external demand for autos rises
to be 21, 500 because the new cars are cheaper.
64

3 This table gives the numbers for the auto-steel system from a different year, 1947
(see [Leontief 1951]). The units here are billions of 1947 dollars.
used by used by used by
steel
auto
others
total
value of
6.90
1.28
18.69
steel
value of
0
4.40
14.27
autos
(a) Solve for total output if next years external demands are: steels demand up
10% and autos demand up 15%.
(b) How do the ratios compare to those given above in the discussion for the 1958
economy?
(c) Solve the 1947 equations with the 1958 external demands (note the difference
in units; a 1947 dollar buys about what $1.30 in 1958 dollars buys). How far off
are the predictions for total output?
4 Predict next years total productions of each of the three sectors of the hypothetical
economy shown below
used by used by
used by
used by
farm
rail
shipping
others
total
value of
25
50
100
800
farm
value of
25
50
50
300
rail
value of
15
10
0
500
shipping
if next years external demands are as stated.
(a) 625 for farm, 200 for rail, 475 for shipping
(b) 650 for farm, 150 for rail, 450 for shipping
5 This table gives the interrelationships among three segments of an economy (see
[Clark & Coupe]).
used by
used by
used by used by
food
wholesale
retail
others
total
value of
food
0
2 318
4 679
11 869
value of
393
1 089
22 459
122 242
wholesale
value of
retail
3
53
75
116 041
We will do an Input-Output analysis on this system.
(a) Fill in the numbers for this years external demands.
(b) Set up the linear system, leaving next years external demands blank.
(c) Solve the system where we get next years external demands by taking this
years external demands and inflating them 10%. Do all three sectors increase
their total business by 10%? Do they all even increase at the same rate?
(d) Solve the system where we get next years external demands by taking this
years external demands and reducing them 7%. (The study from which these
numbers come concluded that because of the closing of a local military facility,
overall personal income in the area would fall 7%, so this might be a first guess
at what would actually happen.)
Topic
Accuracy of Computations
Gausss Method lends itself nicely to computerization. The code below illustrates.
It operates on an nn matrix a, doing row combinations using the first row,
then the second row, etc.
for(row=1;row<=n-1;row++){
for(row_below=row+1;row_below<=n;row_below++){
multiplier=a[row_below,row]/a[row,row];
for(col=row; col<=n; col++){
a[row_below,col]-=multiplier*a[row,col];
}
}
}
This is in the C language. The loop for(row=1;row<=n-1;row++){ .. } initializes row at

1 and then iterates while row is less than or equal to n 1, each time through
incrementing row by one with the ++ operation. The other non-obvious language
construct is that the -= in the innermost loop amounts to the a[row_below,col] =
multiplier a[row,col] + a[row_below,col] operation.
This code provides a quick take on how mechanizing Gausss Method. But
it is naive in many ways. For one thing, it assumes that the entry in the row, row
position is nonzero. One way that the code needs additional development to
make it practical is to cover the case where finding a zero in that location leads
to a row swap or to the conclusion that the matrix is singular.
Adding some if statements to cover those cases is not hard, but we will
instead consider some other ways in which the code is naive. It is prone to
pitfalls arising from the computers reliance on finite-precision floating point
arithmetic.
For example, we have seen above that we must handle as a separate case a
system that is singular. But systems that are nearly singular also require care.
Consider this one.
x + 2y = 3
1.000 000 01x + 2y = 3.000 000 01
We can easily spot the solution x = 1, y = 1. But a computer has more trouble. If
it represents real numbers to eight significant places, called single precision, then
it will represent the second equation internally as 1.000 000 0x + 2y = 3.000 000 0,
losing the digits in the ninth place. Instead of reporting the correct solution, this
66
computer will report something that is not even close this computer thinks
that the system is singular because the two equations are represented internally
as equal.
For some intuition about how the computer could come up with something
that far off, we graph the system.
(1, 1)
At the scale that we have drawn this graph we cannot tell the two lines apart.
This system is nearly singular in the sense that the two lines are nearly the
same line. Near-singularity gives this system the property that a small change
in the system can cause a large change in its solution; for instance, changing the
3.000 000 01 to 3.000 000 03 changes the intersection point from (1, 1) to (3, 0).
This system changes radically depending on a ninth digit, which explains why an
eight-place computer has trouble. A problem that is very sensitive to inaccuracy
or uncertainties in the input values is ill-conditioned.
The above example gives one way in which a system can be difficult to solve
on a computer and it has the advantage that the picture of nearly-equal lines
gives a memorable insight into one way that numerical difficulties can arise.
Unfortunately this insight isnt useful when we wish to solve some large system.
We cannot, typically, hope to understand the geometry of an arbitrary large
system. In addition, there are ways that a computers results may be unreliable
other than that the angle between some of the linear surfaces is small.
For an example, consider the system below, from [Hamming].
0.001x + y = 1
xy=0
()
The second equation gives x = y, so x = y = 1/1.001 and thus both variables

have values that are just less than 1. A computer using two digits represents
the system internally in this way (we will do this example in two-digit floating
point arithmetic, but inventing a similar one with eight digits is easy).
(1.0 102 )x + (1.0 100 )y = 1.0 100
(1.0 100 )x (1.0 100 )y = 0.0 100
The computers row reduction step 10001 + 2 produces a second equation
1001y = 999, which the computer rounds to two places as (1.0 103 )y =
1.0 103 . Then the computer decides from the second equation that y = 1
and from the first equation that x = 0. This y value is fairly good, but the x
is very bad. Thus, another cause of unreliable output is a mixture of floating
point arithmetic and a reliance on using leading entries that are small.
Topic: Accuracy of Computations
67
An experienced programmer may respond by going to double precision

that retains sixteen significant digits. This will indeed solve many problems.
However, double precision has twice the memory requirements and besides,
we can obviously tweak the above systems to give the same trouble in the
seventeenth digit, so double precision isnt a panacea. We need is a strategy to
minimize the numerical trouble arising from solving systems on a computer as
well as some guidance as to how far we can trust the reported solutions.
A basic improvement on the naive code above is to not simply take the entry
in the row , row position to determine the factor to use for the row combination,
but rather to look at all of the entries in the row column below the row , row
entry and take the one that is most likely to give reliable results (e.g., take one
that is not too small). This is partial pivoting.
For example, to solve the troublesome system () above, we start by looking
at both equations for a best entry to use, and taking the 1 in the second
equation as more likely to give good results. Then, the combination step of
.0012 + 1 gives a first equation of 1.001y = 1, which the computer will
represent as (1.0 100 )y = 1.0 100 , leading to the conclusion that y = 1 and,
after back-substitution, x = 1, both of which are close to right. We can adapt
the code from above to this purpose.
for(row=1;row<=n-1;row++){
/* find the largest entry in this column (in row max) */
max=row;
if (abs(a[row_below,row]) > abs(a[max,row]));
max = row_below;
}
/* swap rows to move that best entry up */
for(col=row;col<=n;col++){
temp=a[row,col];
a[row,col]=a[max,col];
a[max,col]=temp;
}
/* proceed as before */
multiplier=a[row_below,row]/a[row,row];
for(col=row;col<=n;col++){
a[row_below,col]-=multiplier*a[row,col];
}
}
}
A full analysis of the best way to implement Gausss Method is outside the
scope of the book (see [Wilkinson 1965]), but the method recommended by most
experts first finds the best entry among the candidates and then scales it to a
number that is less likely to give trouble. This is scaled partial pivoting.
In addition to returning a result that is likely to be reliable, most well-done
code will return a number, the conditioning number that describes the factor
by which uncertainties in the input numbers could be magnified to become
inaccuracies in the results returned (see [Rice]).
The lesson is that, just because Gausss Method always works in theory, and
just because computer code correctly implements that method, doesnt mean
that the answer is reliable. In practice, always use a package where experts have
68
worked hard to counter what can go wrong.

Exercises
1 Using two decimal places, add 253 and 2/3.
2 This intersect-the-lines problem contrasts with the example discussed above.
(1, 1)
x + 2y = 3
3x 2y = 1
Illustrate that in this system some small change in the numbers will produce only
a small change in the solution by changing the constant in the bottom equation to
1.008 and solving. Compare it to the solution of the unchanged system.
3 Solve this system by hand ([Rice]).
0.000 3x + 1.556y = 1.569
0.345 4x 2.346y = 1.018
(a) Solve it accurately, by hand.
four significant digits.
(b) Solve it by rounding at each step to
4 Rounding inside the computer often has an effect on the result. Assume that your
machine has eight significant digits.
(a) Show that the machine will compute (2/3) + ((2/3) (1/3)) as unequal to
((2/3) + (2/3)) (1/3). Thus, computer arithmetic is not associative.
(b) Compare the computers version of (1/3)x + y = 0 and (2/3)x + 2y = 0. Is
twice the first equation the same as the second?
5 Ill-conditioning is not only dependent on the matrix of coefficients. This example
[Hamming] shows that it can arise from an interaction between the left and right
sides of the system. Let be a small real.
3x + 2y + z =
6
2x + 2y + 2z = 2 + 4
x + 2y z = 1 +
(a) Solve the system by hand. Notice that the s divide out only because there is
an exact cancellation of the integer parts on the right side as well as on the left.
(b) Solve the system by hand, rounding to two decimal places, and with = 0.001.
Topic
Analyzing Networks
The diagram below shows some of a cars electrical network. The battery is on
the left, drawn as stacked line segments. The wires are lines, shown straight and
with sharp right angles for neatness. Each light is a circle enclosing a loop.
Off
12V
Dimmer
Hi
Lo
R
Brake
Lights
R
Parking
Lights
Dome
Light
Light
Switch
Brake
Actuated
Switch
R
Rear
Lights
Door
Actuated
Switch
Headlights
The designer of such a network needs to answer questions like: How much
electricity flows when both the hi-beam headlights and the brake lights are on?
We will use linear systems to analyze simple electrical networks.
For the analysis we need two facts about electricity and two facts about
electrical networks.
The first fact about electricity is that a battery is like a pump, providing a
force impelling the electricity to flow, if there is a path. We say that the battery
provides a potential to flow. For instance, when the driver steps on the brake
then the switch makes contact and so makes a circuit on the left side of the
diagram, so the batterys force creates a current flowing through that circuit to
turn on the brake lights.
The second electrical fact is that in some kinds of network components the
amount of flow is proportional to the force provided by the battery. That is, for
each such component there is a number, its resistance, such that the potential
is equal to the flow times the resistance. Potential is measured in volts, the
rate of flow is in amperes, and resistance to the flow is in ohms; these units are
defined so that volts = amperes ohms.
70
Components with this property, that the voltage-amperage response curve is a

line through the origin, are resistors. For example, if a resistor measures 2 ohms
then wiring it to a 12 volt battery results in a flow of 6 amperes. Conversely, if
electrical current of 2 amperes flows through that resistor then there must be
a 4 volt potential difference between its ends. This is the voltage drop across
the resistor. One way to think of the electrical circuits that we consider here is
that the battery provides a voltage rise while the other components are voltage
drops.
The two facts that we need about networks are Kirchhoffs Laws.
Current Law. For any point in a network, the flow in equals the flow out.
Voltage Law. Around any circuit the total drop equals the total rise.
We start with the network below. It has a battery that provides the potential
to flow and three resistors, drawn as zig-zags. When components are wired one
after another, as here, they are in series.
20 volt
potential
2 ohm
resistance
3 ohm
resistance
5 ohm
resistance
By Kirchhoffs Voltage Law, because the voltage rise is 20 volts, the total voltage
drop must also be 20 volts. Since the resistance from start to finish is 10 ohms
(the resistance of the wire connecting the components is negligible), the current
is (20/10) = 2 amperes. Now, by Kirchhoffs Current Law, there are 2 amperes
through each resistor. Therefore the voltage drops are: 4 volts across the 2 oh m
resistor, 10 volts across the 5 ohm resistor, and 6 volts across the 3 ohm resistor.
The prior network is simple enough that we didnt use a linear system but
the next one is more complicated. Here the resistors are in parallel.
20 volt
12 ohm
8 ohm
We begin by labeling the branches as below. Let the current through the left
branch of the parallel portion be i1 and that through the right branch be i2 ,
and also let the current through the battery be i0 . Note that we dont need to
know the actual direction of flow if current flows in the direction opposite to
our arrow then we will get a negative number in the solution.
Topic: Analyzing Networks
71
i0
i1
i2
The Current Law, applied to the point in the upper right where the flow i0
meets i1 and i2 , gives that i0 = i1 + i2 . Applied to the lower right it gives
i1 + i2 = i0 . In the circuit that loops out of the top of the battery, down the
left branch of the parallel portion, and back into the bottom of the battery,
the voltage rise is 20 while the voltage drop is i1 12, so the Voltage Law gives
that 12i1 = 20. Similarly, the circuit from the battery to the right branch and
back to the battery gives that 8i2 = 20. And, in the circuit that simply loops
around in the left and right branches of the parallel portion (taken clockwise,
arbitrarily), there is a voltage rise of 0 and a voltage drop of 8i2 12i1 so the
Voltage Law gives that 8i2 12i1 = 0.
i0
i0 +
i1 i2 = 0
i1 + i2 = 0
12i1
= 20
8i2 = 20
12i1 + 8i2 = 0
The solution is i0 = 25/6, i1 = 5/3, and i2 = 5/2, all in amperes. (Incidentally,

this illustrates that redundant equations can arise in practice.)
Kirchhoffs laws can establish the electrical properties of very complex networks. The next diagram shows five resistors, wired in a series-parallel way.
5 ohm
2 ohm
50 ohm
10 volt
10 ohm
4 ohm
This network is a Wheatstone bridge (see Exercise 4). To analyze it, we can
place the arrows in this way.
i1 .
& i2
i5
i0
i3 &
. i4
72
Kirchhoffs Current Law, applied to the top node, the left node, the right node,
and the bottom node gives these.
i0 = i1 + i2
i1 = i3 + i5
i2 + i5 = i4
i3 + i4 = i0
Kirchhoffs Voltage Law, applied to the inside loop (the i0 to i1 to i3 to i0 loop),
the outside loop, and the upper loop not involving the battery, gives these.
5i1 + 10i3 = 10
2i2 + 4i4 = 10
5i1 + 50i5 2i2 = 0
Those suffice to determine the solution i0 = 7/3, i1 = 2/3, i2 = 5/3, i3 = 2/3,
i4 = 5/3, and i5 = 0.
We can understand many kinds of networks in this way. For instance, the
exercises analyze some networks of streets.
Exercises
1 Calculate the amperages in each part of each network.
(a) This is a simple network.
3 ohm
9 volt
2 ohm
2 ohm
(b) Compare this one with the parallel case discussed above.
3 ohm
9 volt
2 ohm
2 ohm
2 ohm
(c) This is a reasonably complicated network.

3 ohm
9 volt
3 ohm
3 ohm
2 ohm
2 ohm
4 ohm
2 ohm
2 In the first network that we analyzed, with the three resistors in series, we just
added to get that they acted together like a single resistor of 10 ohms. We can do
Topic: Analyzing Networks
73
a similar thing for parallel circuits. In the second circuit analyzed,
20 volt
12 ohm
8 ohm
the electric current through the battery is 25/6 amperes. Thus, the parallel portion
is equivalent to a single resistor of 20/(25/6) = 4.8 ohms.
(a) What is the equivalent resistance if we change the 12 ohm resistor to 5 ohms?
(b) What is the equivalent resistance if the two are each 8 ohms?
(c) Find the formula for the equivalent resistance if the two resistors in parallel
are r1 ohms and r2 ohms.
3 For the car dashboard example that opens this Topic, solve for these amperages
(assume that all resistances are 2 ohms).
(a) If the driver is stepping on the brakes, so the brake lights are on, and no other
circuit is closed.
(b) If the hi-beam headlights and the brake lights are on.
4 Show that, in this Wheatstone Bridge,
r1
r3
rg
r2
r4
r2 /r1 equals r4 /r3 if and only if the current flowing through rg is zero. (In practice,
we place an unknown resistance at r4 . At rg we place a meter that shows the
current. We vary the three resistances r1 , r2 , and r3 (typically they each have
a calibrated knob) until the current in the middle reads 0, and then the above
equation gives the value of r4 .)
There are networks other than electrical ones, and we can ask how well Kirchhoff s laws apply to them. The remaining questions consider an extension to
networks of streets.
5 Consider this traffic circle.
North Avenue
Main Street
Pier Boulevard
This is the traffic volume, in units of cars per five minutes.
North Pier Main
into
100
150
25
out of
75
150
50
We can set up equations to model how the traffic flows.
(a) Adapt Kirchhoffs Current Law to this circumstance. Is it a reasonable
modeling assumption?
74

(b) Label the three between-road arcs in the circle with a variable. Using the
(adapted) Current Law, for each of the three in-out intersections state an equation
describing the traffic flow at that node.
(c) Solve that system.
(d) Interpret your solution.
(e) Restate the Voltage Law for this circumstance. How reasonable is it?
6 This is a network of streets.
Shelburne St
Willow
Jay Ln
west
east
Winooski Ave
We can observe the hourly flow of cars into this networks entrances, and out of its
exits.
east Winooski west Winooski Willow Jay Shelburne
into
80
50
65
40
out of
30
5
70
55
75
(Note that to reach Jay a car must enter the network via some other road first,
which is why there is no into Jay entry in the table. Note also that over a long
period of time, the total in must approximately equal the total out, which is why
both rows add to 235 cars.) Once inside the network, the traffic may flow in different
ways, perhaps filling Willow and leaving Jay mostly empty, or perhaps flowing in
some other way. Kirchhoffs Laws give the limits on that freedom.
(a) Determine the restrictions on the flow inside this network of streets by setting
up a variable for each block, establishing the equations, and solving them. Notice
that some streets are one-way only. (Hint: this will not yield a unique solution,
since traffic can flow through this network in various ways; you should get at
least one free variable.)
(b) Suppose that someone proposes construction for Winooski Avenue East between Willow and Jay, and traffic on that block will be reduced. What is the least
amount of traffic flow that can we can allow on that block without disrupting
the hourly flow into and out of the network?
Chapter Two
Vector Spaces
The first chapter began by introducing Gauss Method and finished with a
fair understanding, keyed on the Linear Combination Lemma, of how it finds
the solution set of a linear system. Gauss Method systematically takes linear
combinations of the rows. With that insight, we now move to a general study of
linear combinations.
We need a setting. At times in the first chapter weve combined vectors
from R2 , at other times vectors from R3 , and at other times vectors from even
higher-dimensional spaces. So our first impulse might be to work in Rn , leaving
n unspecified. This would have the advantage that any of the results would hold
for R2 and for R3 and for many other spaces, simultaneously.
But if having the results apply to many spaces at once is advantageous then
sticking only to Rn s is overly restrictive. Wed like the results to also apply to
combinations of row vectors, as in the final section of the first chapter. Weve
even seen some spaces that are not just a collection of all of the same-sized column
vectors or row vectors. For instance, weve seen an example of a homogeneous
systems solution set that is a plane, inside of R3 . This solution set is a closed
system in the sense that a linear combination of these solutions is also a solution.
But it is not just a collection of all of the three-tall column vectors; only some
of them are in the set.
We want the results about linear combinations to apply anywhere that linear
combinations make sense. We shall call any such set a vector space. Our results,
instead of being phrased as Whenever we have a collection in which we can
sensibly take linear combinations . . . , will be stated as In any vector space
. . . .
Such a statement describes at once what happens in many spaces. To
understand the advantages of moving from studying a single space at a time to
studying a class of spaces, consider this analogy. Imagine that the government
made laws one person at a time: Leslie Jones cant jay walk. That would be
a bad idea; statements have the virtue of economy when they apply to many
cases at once. Or suppose that they ruled, Kim Ke must stop when passing an
accident. Contrast that with, Any doctor must stop when passing an accident.
More general statements, in some ways, are clearer.
76
Chapter Two. Vector Spaces
Definition of Vector Space
We shall study structures with two operations, an addition and a scalar multiplication, that are subject to some simple conditions. We will reflect more on
the conditions later, but on first reading notice how reasonable they are. For
instance, surely any operation that can be called an addition (e.g., column vector
addition, row vector addition, or real number addition) will satisfy conditions
(1) through (5) below.
I.1
Definition and Examples
1.1 Definition A vector space (over R) consists of a set V along with two
operations + and subject to these conditions.
Where ~v, w
~ V, (1) their vector sum ~v + w
~ is an element of V. If ~u,~v, w
~ V
then (2) ~v + w
~ =w
~ + ~v and (3) (~v + w
~ ) + ~u = ~v + (~
w + ~u). (4) There is a zero
vector ~0 V such that ~v + ~0 = ~v for all ~v V. (5) Each ~v V has an additive
inverse w
~ V such that w
~ + ~v = ~0.
If r, s are scalars, members of R, and ~v, w
~ V then (6) each scalar multiple
r ~v is in V. If r, s R and ~v, w
~ V then (7) (r + s) ~v = r ~v + s ~v, and
(8) r (~v + w
~ ) = r ~v + r w
~ , and (9) (rs) ~v = r (s ~v), and (10) 1 ~v = ~v.
1.2 Remark The definition involves two kinds of addition and two kinds of
multiplication and so may at first seem confused. For instance, in condition (7)
the + on the left is addition between two real numbers while the + on the right
represents vector addition in V. These expressions arent ambiguous because,
for example, r and s are real numbers so r + s can only mean real number
addition.
The best way to go through the examples below is to check all ten conditions
in the definition. We write that check out at length in the first example. Use it
as a model for the others. Especially important are the closure conditions, (1)
and (6). They specify that the addition and scalar multiplication operations are
always sensible they are defined for every pair of vectors and every scalar and
vector, and the result of the operation is a member of the set (see Example 1.4).
1.3 Example The set R2 is a vector space if the operations + and have their
usual meaning.
!
!
!
!
!
x1
y1
x1 + y1
x1
rx1
+
=
r
=
x2
y2
x2 + y2
x2
rx2
We shall check all of the conditions.
There are five conditions in the paragraph having to do with addition. For
(1), closure of addition, note that for any v1 , v2 , w1 , w2 R the result of the
Section I. Definition of Vector Space

sum
v1
v2
!
+
w1
w2
77
!
=
v1 + w1
v2 + w2
is a column array with two real entries, and so is in R2 .

of vectors commutes, take all entries to be real numbers
!
!
!
!
v1
w1
v1 + w1
w1 + v1
+
=
=
=
v2
w2
v2 + w2
w2 + v2
For (2), that addition

and compute
!
!
w1
v1
+
w2
v2
(the second equality follows from the fact that the components of the vectors are
real numbers, and the addition of real numbers is commutative). Condition (3),
associativity of vector addition, is similar.
!
!
!
!
v1
w1
u1
(v1 + w1 ) + u1
(
+
)+
=
v2
w2
u2
(v2 + w2 ) + u2
!
v1 + (w1 + u1 )
=
v2 + (w2 + u2 )
!
!
!
v1
w1
u1
=
+(
+
)
v2
w2
u2
For the fourth condition we must produce a zero element the vector of zeroes
is it.
!
!
!
v1
0
v1
+
=
v2
0
v2
For (5), to produce an additive inverse, note that for any v1 , v2 R we have
!
!
!
v1
v1
0
+
=
v2
v2
0
so the first vector is the desired additive inverse of the second.
The checks for the five conditions having to do with scalar multiplication are
similar. For (6), closure under scalar multiplication, where r, v1 , v2 R,
!
!
v1
rv1
r
=
v2
rv2
is a column array with two real entries, and so is in R2 . Next, this checks (7).
!
!
!
!
!
v1
(r + s)v1
rv1 + sv1
v1
v1
(r + s)
=
=
=r
+s
v2
(r + s)v2
rv2 + sv2
v2
v2
For (8), that scalar multiplication distributes from the left over vector addition,
we have this.
!
!
!
!
!
!
v1
w1
r(v1 + w1 )
rv1 + rw1
v1
w1
r(
+
)=
=
=r
+r
v2
w2
r(v2 + w2 )
rv2 + rw2
v2
w2
78
The ninth
(rs)
v1
v2
!
=
(rs)v1
(rs)v2
!
=
r(sv1 )
r(sv2 )
and tenth conditions are also straightforward.

!
!
v1
1v1
1
=
=
v2
1v2
!
= r (s
v1
v2
!
v1
)
v2
In a similar way, each Rn is a vector space with the usual operations of vector
addition and scalar multiplication. (In R1 , we usually do not write the members
as column vectors, i.e., we usually do not write (). Instead we just write .)
1.4 Example This subset of R3 that is a plane through the origin

x

P = { y x + y + z = 0 }
z
is a vector space if + and are interpreted in this way.

x1
x2
x1 + x2
x
rx

r y = ry
y1 + y2 = y1 + y2
z1
z2
z1 + z2
z
rz
The addition and scalar multiplication operations here are just the ones of R3 ,
reused on its subset P. We say that P inherits these operations from R3 . This
example of an addition in P

1
1
0

1 + 0 = 1
2
1
1
illustrates that P is closed under addition. Weve added two vectors from P
that is, with the property that the sum of their three entries is zero and the
result is a vector also in P. Of course, this example of closure is not a proof of
closure. To prove that P is closed under addition, take two elements of P.

x1
x2

y
y
1 2
z1
z2
Membership in P means that x1 + y1 + z1 = 0 and x2 + y2 + z2 = 0. Observe
that their sum
x1 + x2
y1 + y2
z1 + z2
79
is also in P since its entries add (x1 + x2 ) + (y1 + y2 ) + (z1 + z2 ) = (x1 + y1 +

z1 ) + (x2 + y2 + z2 ) to 0. To show that P is closed under scalar multiplication,
start with a vector from P

x

y
z
where x + y + z = 0, and then for r R observe that the scalar multiple

x
rx

r y = ry
z
rz
gives rx + ry + rz = r(x + y + z) = 0. Thus the two closure conditions are
satisfied. Verification of the other conditions in the definition of a vector space
are just as straightforward.
1.5 Example Example 1.3 shows that the set of all two-tall vectors with real
entries is a vector space. Example 1.4 gives a subset of an Rn that is also a
vector space. In contrast with those two, consider the set of two-tall columns
with entries that are integers (under the obvious operations). This is a subset of
a vector space but it is not itself a vector space. The reason is that this set is
not closed under scalar multiplication, that is, it does not satisfy condition (6).
Here is a column with integer entries and a scalar such that the outcome of the
operation
!
!
4
2
0.5
=
3
1.5
is not a member of the set, since its entries are not all integers.
1.6 Example The singleton set

0
0

{ }
0
0
is a vector space under the operations

0
0
0
0 0 0

+ =
0 0 0
0
0
0

0
0
0 0

r =
0 0
0
0
that it inherits from R4 .

A vector space must have at least one element, its zero vector. Thus a
one-element vector space is the smallest possible.
80
1.7 Definition A one-element vector space is a trivial space.

The examples so far involve sets of column vectors with the usual operations.
But vector spaces need not be collections of column vectors, or even of row
vectors. Below are some other types of vector spaces. The term vector space
does not mean collection of columns of reals. It means something more like
collection in which any linear combination is sensible.

1.8 Example Consider P3 = {a0 + a1 x + a2 x2 + a3 x3 a0 , . . . , a3 R }, the set
of polynomials of degree three or less (in this book, well take constant polynomials, including the zero polynomial, to be of degree zero). It is a vector space
under the operations
(a0 + a1 x + a2 x2 + a3 x3 ) + (b0 + b1 x + b2 x2 + b3 x3 )
= (a0 + b0 ) + (a1 + b1 )x + (a2 + b2 )x2 + (a3 + b3 )x3
and
r (a0 + a1 x + a2 x2 + a3 x3 ) = (ra0 ) + (ra1 )x + (ra2 )x2 + (ra3 )x3
(the verification is easy). This vector space is worthy of attention because these
are the polynomial operations familiar from high school algebra. For instance,
3 (1 2x + 3x2 4x3 ) 2 (2 3x + x2 (1/2)x3 ) = 1 + 7x2 11x3 .
Although this space is not a subset of any Rn , there is a sense in which we
can think of P3 as the same as R4 . If we identify these two spaces elements in
this way

a0
a
1
a0 + a1 x + a2 x2 + a3 x3 corresponds to
a2
a3
then the operations also correspond. Here is an example of corresponding
additions.

3
2
1
2
3
1 2x + 0x + 1x
2 3 1

+ 2 + 3x + 7x2 4x3
corresponds to + =
0 7 7
3 + 1x + 7x2 3x3
3
4
1
Things we are thinking of as the same add to the same sum. Chapter Three
makes precise this idea of vector space correspondence. For now we shall just
leave it as an intuition.
1.9 Example The set M22 of 22 matrices with real number entries is a vector
space under the natural entry-by-entry operations.
!
!
!
!
!
a b
w x
a+w b+x
a b
ra rb
+
=
r
=
c d
y z
c+y d+z
c d
rc rd
As in the prior example, we can think of this space as the same as R4 .
81

1.10 Example The set {f f : N R} of all real-valued functions of one natural
number variable is a vector space under the operations
(f1 + f2 ) (n) = f1 (n) + f2 (n)
(r f) (n) = r f(n)
so that if, for example, f1 (n) = n2 + 2 sin(n) and f2 (n) = sin(n) + 0.5 then
(f1 + 2f2 ) (n) = n2 + 1.
We can view this space as a generalization of Example 1.3 instead of 2-tall
vectors, these functions are like infinitely-tall vectors.
n
0
1
2
3
..
.
f(n) = n2 + 1
1
2
5
10
..
.
corresponds to
1
2

5

10

..
.
Addition and scalar multiplication are component-wise, as in Example 1.3. (We

can formalize infinitely-tall by saying that it means an infinite sequence, or
that it means a function from N to R.)
1.11 Example The set of polynomials with real coefficients

{ a0 + a1 x + + an xn n N and a0 , . . . , an R }
makes a vector space when given the natural +
(a0 + a1 x + + an xn ) + (b0 + b1 x + + bn xn )
= (a0 + b0 ) + (a1 + b1 )x + + (an + bn )xn
and .
r (a0 + a1 x + . . . an xn ) = (ra0 ) + (ra1 )x + . . . (ran )xn
This space differs from the space P3 of Example 1.8. This space contains
not just degree three polynomials, but degree thirty polynomials and degree
three hundred polynomials, too. Each individual polynomial of course is of a
finite degree, but the set has no single bound on the degree of all of its members.
We can think of this example, like the prior one, in terms of infinite-tuples.
For instance, we can think of 1 + 3x + 5x2 as corresponding to (1, 3, 5, 0, 0, . . .).
However, this space differs from the one in Example 1.10. Here, each member of
the set has a finite degree, that is, under the correspondence there is no element
from this space matching (1, 2, 5, 10, . . . ). Vectors in this space correspond to
infinite-tuples that end in zeroes.

1.12 Example The set {f f : R R } of all real-valued functions of one real
variable is a vector space under these.
(f1 + f2 ) (x) = f1 (x) + f2 (x)
(r f) (x) = r f(x)
The difference between this and Example 1.10 is the domain of the functions.
82

1.13 Example The set F = {a cos + b sin a, b R} of real-valued functions of
the real variable is a vector space under the operations
(a1 cos + b1 sin ) + (a2 cos + b2 sin ) = (a1 + a2 ) cos + (b1 + b2 ) sin
and
r (a cos + b sin ) = (ra) cos + (rb) sin
inherited from the space in the prior example. (We can think of F as the same
as R2 in that a cos + b sin corresponds to the vector with components a and
b.)
1.14 Example The set
d2 f
{f : R R
+ f = 0}
dx2
is a vector space under the, by now natural, interpretation.
(f + g) (x) = f(x) + g(x)
(r f) (x) = r f(x)
In particular, notice that closure is a consequence

d2 (f + g)
d2 f
d2 g
+ (f + g) = ( 2 + f) + ( 2 + g)
2
dx
dx
dx
and
d2 (rf)
d2 f
+
(rf)
=
r(
+ f)
dx2
dx2
of basic Calculus. This turns out to equal the space from the prior example
functions satisfying this differential equation have the form a cos + b sin
but this description suggests an extension to solutions sets of other differential
equations.
1.15 Example The set of solutions of a homogeneous linear system in n variables is
a vector space under the operations inherited from Rn . For example, for closure
under addition consider a typical equation in that system c1 x1 + + cn xn = 0
and suppose that both these vectors
v1
.
~v = ..
vn
w1
.
w
~ = ..
wn
satisfy the equation. Then their sum ~v + w

~ also satisfies that equation: c1 (v1 +
w1 ) + + cn (vn + wn ) = (c1 v1 + + cn vn ) + (c1 w1 + + cn wn ) = 0. The
checks of the other vector space conditions are just as routine.
As weve done in those equations, we often omit the multiplication symbol
between the scalar and the vector. We can distinguish the multiplication in
c1 v1 from that in r~v by context, since if both multiplicands are real numbers
then it must be real-real multiplication while if one is a vector then it must be
scalar-vector multiplication.
83
Example 1.15 has brought us full circle since it is one of our motivating
examples. Now, with some feel for the kinds of structures that satisfy the
definition of a vector space, we can reflect on that definition. For example, why
specify in the definition the condition that 1 ~v = ~v but not a condition that
0 ~v = ~0?
One answer is that this is just a definition it gives the rules of the game
from here on, and if you dont like it, move on to something else.
Another answer is perhaps more satisfying. People in this area have worked
hard to develop the right balance of power and generality. This definition is
shaped so that it contains the conditions needed to prove all of the interesting
and important properties of spaces of linear combinations. As we proceed, we
shall derive all of the properties natural to collections of linear combinations
from the conditions given in the definition.
The next result is an example. We do not need to include these properties
in the definition of vector space because they follow from the properties already
listed there.
1.16 Lemma In any vector space V, for any ~v V and r R, we have (1) 0 ~v = ~0,
and (2) (1 ~v) + ~v = ~0, and (3) r ~0 = ~0.
Proof For (1), note that ~v = (1 + 0) ~v = ~v + (0 ~v). Add to both sides the
additive inverse of ~v, the vector w

~ such that w
~ + ~v = ~0.
w
~ + ~v = w
~ + ~v + 0 ~v
~0 = ~0 + 0 ~v
~0 = 0 ~v
Item (2) is easy: (1 ~v) +~v = (1 + 1) ~v = 0 ~v = ~0 shows that we can write
~v for the additive inverse of ~v without worrying about possible confusion
with (1) ~v.
For (3) r ~0 = r (0 ~0) = (r 0) ~0 = ~0 will do.
QED
We finish with a recap. Our study in Chapter One of Gaussian reduction
led us to consider collections of linear combinations. So in this chapter we have
defined a vector space to be a structure in which we can form such combinations,
expressions of the form c1 ~v1 + + cn ~vn (subject to simple conditions on
the addition and scalar multiplication operations). In a phrase: vector spaces
are the right context in which to study linearity.
Finally, a comment. From the fact that it forms a whole chapter, and
especially because that chapter is the first one, a reader could suppose that
our purpose is the study of linear systems. The truth is, we will not so much
use vector spaces in the study of linear systems as we will instead have linear
systems start us on the study of vector spaces. The wide variety of examples
from this subsection shows that the study of vector spaces is interesting and
important in its own right, aside from how it helps us understand linear systems.
84
Linear systems wont go away. But from now on our primary objects of study
will be vector spaces.
Exercises
1.17 Name the zero vector for each of these vector spaces.
(a) The space of degree three polynomials under the natural operations.
(b) The space of 24 matrices.

(c) The space { f : [0..1] R f is continuous }.
(d) The space of real-valued functions of one natural number variable.
X 1.18 Find the additive inverse, in the vector space, of the vector.
(a) In P3 , the vector 3 2x + x2 .
(b) In the space 22,

1 1
.
0
3

(c) In { aex + bex a, b R }, the space of functions of the real variable x under
the natural operations, the vector 3ex 2ex .
X 1.19 For each, list three elements and then show it is a vector space.
(a) The set of linear polynomials P1 = { a0 + a1 x a0 , a1 R } under the usual
polynomial addition and scalar multiplication operations.

(b) The set of linear polynomials { a0 + a1 x a0 2a1 = 0 }, under the usual polynomial addition and scalar multiplication operations.
Hint. Use Example 1.3 as a guide. Most of the ten conditions are just verifications.
1.20 For each, list three elements and then show it is a vector space.
(a) The set of 22 matrices with real entries under the usual matrix operations.
(b) The set of 22 matrices with real entries where the 2, 1 entry is zero, under
the usual matrix operations.
X 1.21 For each, list three elements and then show it is a vector space.
(a) The set of three-component row vectors with their usual operations.
(b) The set

x
y

4
{
z R x + y z + w = 0}
w
under the operations inherited from R4 .
X 1.22 Show that each of these is not a vector space. (Hint. Check closure by listing
two members of each set and trying some operations on them.)
(a) Under the operations inherited from R3 , this set

x

{ y R3 x + y + z = 1 }
z
(b) Under the operations inherited from R3 , this set

x

{ y R3 x2 + y2 + z2 = 1 }
z
(c) Under the usual matrix operations,

a 1
{
a, b, c R }
b c
85
(d) Under the usual polynomial operations,

{ a0 + a1 x + a2 x2 a0 , a1 , a2 R+ }
where R+ is the set of reals greater than zero
(e) Under the inherited operations,

x
{
R2 x + 3y = 4 and 2x y = 3 and 6x + 4y = 10 }
y
1.23 Define addition and scalar multiplication operations to make the complex
numbers a vector space over R.
X 1.24 Is the set of rational numbers a vector space over R under the usual addition
and scalar multiplication operations?
1.25 Show that the set of linear combinations of the variables x, y, z is a vector space
under the natural addition and scalar multiplication operations.
1.26 Prove that this is not a vector space: the set of two-tall column vectors with
real entries subject to these operations.

x1
x2
x1 x2
x
rx
+
=
r
=
y1
y2
y1 y2
y
ry
1.27 Prove or disprove that R3 is a vector space under these operations.

x1
x2
0
x
rx
(a) y1 + y2 = 0 and r y = ry
z1
z2
0
z
rz

x1
x2
0
x
0
(b) y1 + y2 = 0 and r y = 0
z1
z2
0
z
0
X 1.28 For each, decide if it is a vector space; the intended operations are the natural
ones.
(a) The diagonal 22 matrices

a 0
{
a, b R }
0 b
(b) This set of 22 matrices

x
{
x+y
x+y
y

x, y R }
(c) This set

x
y

4
{
z R x + y + w = 1}
w

(d) The set of functions { f : R R df/dx + 2f = 0 }

(e) The set of functions { f : R R df/dx + 2f = 1 }
X 1.29 Prove or disprove that this is a vector space: the real-valued functions f of one
real variable such that f(7) = 0.
X 1.30 Show that the set R+ of positive reals is a vector space when we interpret x + y
to mean the product of x and y (so that 2 + 3 is 6), and we interpret r x as the
r-th power of x.

1.31 Is { (x, y) x, y R } a vector space under these operations?
(a) (x1 , y1 ) + (x2 , y2 ) = (x1 + x2 , y1 + y2 ) and r (x, y) = (rx, y)
(b) (x1 , y1 ) + (x2 , y2 ) = (x1 + x2 , y1 + y2 ) and r (x, y) = (rx, 0)
86

1.32 Prove or disprove that this is a vector space: the set of polynomials of degree
greater than or equal to two, along with the zero polynomial.
1.33 At this point the same is only an intuition, but nonetheless for each vector
space identify the k for which the space is the same as Rk .
(a) The 23 matrices under the usual operations
(b) The nm matrices (under their usual operations)
(c) This set of 22 matrices

a 0
{
a, b, c R }
b c
(d) This set of 22 matrices

a
{
b
0
c

a + b + c = 0}
~ to represent vector addition and ~ for scalar multiplication, restate

X 1.34 Using +
the definition of vector space.
X 1.35 Prove these.
(a) Any vector is the additive inverse of the additive inverse of itself.
(b) Vector addition left-cancels: if ~v,~s, ~t V then ~v + ~s = ~v + ~t implies that ~s = ~t.
1.36 The definition of vector spaces does not explicitly say that ~0 + ~v = ~v (it instead
says that ~v + ~0 = ~v). Show that it must nonetheless hold in any vector space.
X 1.37 Prove or disprove that this is a vector space: the set of all matrices, under the
usual operations.
1.38 In a vector space every element has an additive inverse. Can some elements
have two or more?
1.39 (a) Prove that every point, line, or plane thru the origin in R3 is a vector
space under the inherited operations.
(b) What if it doesnt contain the origin?
X 1.40 Using the idea of a vector space we can easily reprove that the solution set of
a homogeneous linear system has either one element or infinitely many elements.
Assume that ~v V is not ~0.
(a) Prove that r ~v = ~0 if and only if r = 0.
(b) Prove that r1 ~v = r2 ~v if and only if r1 = r2 .
(c) Prove that any nontrivial vector space is infinite.
(d) Use the fact that a nonempty solution set of a homogeneous linear system is
a vector space to draw the conclusion.
1.41 Is this a vector space under the natural operations: the real-valued functions of
one real variable that are differentiable?
1.42 A vector space over the complex numbers C has the same definition as a vector
space over the reals except that scalars are drawn from C instead of from R. Show
that each of these is a vector space over the complex numbers. (Recall how complex
numbers add and multiply: (a0 + a1 i) + (b0 + b1 i) = (a0 + b0 ) + (a1 + b1 )i and
(a0 + a1 i)(b0 + b1 i) = (a0 b0 a1 b1 ) + (a0 b1 + a1 b0 )i.)
(a) The set of degree two polynomials with complex coefficients
(b) This set

0 a
{
a, b C and a + b = 0 + 0i }
b 0
1.43 Name a property shared by all of the Rn s but not listed as a requirement for a
vector space.
87
X 1.44 (a) Prove that for any four vectors ~v1 , . . . ,~v4 V we can associate their sum
in any way without changing the result.
((~v1 + ~v2 ) + ~v3 ) + ~v4 = (~v1 + (~v2 + ~v3 )) + ~v4 = (~v1 + ~v2 ) + (~v3 + ~v4 )
= ~v1 + ((~v2 + ~v3 ) + ~v4 ) = ~v1 + (~v2 + (~v3 + ~v4 ))
This allows us to write ~v1 + ~v2 + ~v3 + ~v4 without ambiguity.
(b) Prove that any two ways of associating a sum of any number of vectors give
the same sum. (Hint. Use induction on the number of vectors.)
1.45 Example 1.5 gives a subset of R2 that is not a vector space, under the obvious
operations, because while it is closed under addition, it is not closed under scalar
multiplication. Consider the set of vectors in the plane whose components have
the same sign or are 0. Show that this set is closed under scalar multiplication but
not addition.
1.46 For any vector space, a subset that is itself a vector space under the inherited
3
operations (e.g., a plane through the
origin inside of R ) is a subspace.
2
(a) Show that { a0 + a1 x + a2 x a0 + a1 + a2 = 0 } is a subspace of the vector
space of degree two polynomials.
(b) Show that this is a subspace of the 22 matrices.

a b
{
a + b = 0}
c 0
(c) Show that a nonempty subset S of a real vector space is a subspace if and only
if it is closed under linear combinations of pairs of vectors: whenever c1 , c2 R
and ~s1 ,~s2 S then the combination c1~v1 + c2~v2 is in S.
I.2
Subspaces and Spanning Sets
One of the examples that led us to introduce the idea of a vector space was the
solution set of a homogeneous system. For instance, weve seen in Example 1.4
such a space that is a planar subset of R3 . There, the vector space R3 contains
inside it another vector space, the plane.
2.1 Definition For any vector space, a subspace is a subset that is itself a vector
space, under the inherited operations.
2.2 Example The plane from the prior subsection,

x

P = { y x + y + z = 0 }
z
is a subspace of R3 . As specified in the definition, the operations are the ones
that are inherited from the larger space, that is, vectors add in P as they add in
R3

x1
x2
x1 + x2

y1 + y2 = y1 + y2
z1
z2
z 1 + z2
88
and scalar multiplication is also the same as it is in R3 . To show that P is a

subspace, we need only note that it is a subset and then verify that it is a space.
Checking that P satisfies the conditions in the definition of a vector space is
routine. For instance, for closure under addition, note that if the summands
satisfy that x1 + y1 + z1 = 0 and x2 + y2 + z2 = 0 then the sum satisfies that
(x1 + x2 ) + (y1 + y2 ) + (z1 + z2 ) = (x1 + y1 + z1 ) + (x2 + y2 + z2 ) = 0.
2.3 Example The x-axis in R2 is a subspace where the addition and scalar
multiplication operations are the inherited ones.
!
!
!
!
!
x1
x2
x1 + x2
x
rx
+
=
r
=
0
0
0
0
0
As above, to verify that this is a subspace we simply note that it is a subset and
then check that it satisfies the conditions in definition of a vector space. For
instance, the two closure conditions are satisfied: (1) adding two vectors with a
second component of zero results in a vector with a second component of zero,
and (2) multiplying a scalar times a vector with a second component of zero
results in a vector with a second component of zero.
2.4 Example Another subspace of R2 is its trivial subspace.
!
0
{
}
0
Any vector space has a trivial subspace {~0 }. At the opposite extreme, any
vector space has itself for a subspace. These two are the improper subspaces.
Other subspaces are proper .
2.5 Example The definition requires that the addition and scalar multiplication
operations must be the ones inherited from the larger space. The set S = {1 } is
a subset of R1 . And, under the operations 1 + 1 = 1 and r 1 = 1 the set S is
a vector space, specifically, a trivial space. However, S is not a subspace of R1
because those arent the inherited operations, since of course R1 has 1 + 1 = 2.
2.6 Example All kinds of vector spaces, not just Rn s, have subspaces. The vector
3
space of cubic polynomials {a + bx + cx2 + dx
a, b, c, d R } has a subspace

comprised of all linear polynomials {m + nx m, n R }.
2.7 Example Another example of a subspace not taken from an Rn is one from the
examples following the definition of a vector space. The space of all real-valued
functions of one real variable f : R R has a subspace of functions satisfying
the restriction (d2 f/dx2 ) + f = 0.
2.8 Example Being vector spaces themselves, subspaces must satisfy the closure
conditions. The set R+ is not a subspace of the vector space R1 because with
the inherited operations it is not closed under scalar multiplication: if ~v = 1
then 1 ~v 6 R+ .
The next result says that Example 2.8 is prototypical. The only way that
a subset can fail to be a subspace, if it is nonempty and under the inherited
operations, is if it isnt closed.
89
2.9 Lemma For a nonempty subset S of a vector space, under the inherited
operations, the following are equivalent statements.
(1) S is a subspace of that vector space
(2) S is closed under linear combinations of pairs of vectors: for any vectors
~s1 ,~s2 S and scalars r1 , r2 the vector r1~s1 + r2~s2 is in S
(3) S is closed under linear combinations of any number of vectors: for any
vectors ~s1 , . . . ,~sn S and scalars r1 , . . . , rn the vector r1~s1 + + rn~sn is
in S.
Briefly, a subset is a subspace if it is closed under linear combinations.
Proof The following are equivalent means that each pair of statements are
equivalent.
(1) (2)
(2) (3)
(3) (1)
We will prove the equivalence by establishing that (1) = (3) = (2) = (1).
This strategy is suggested by the observation that (1) = (3) and (3) = (2)
are easy and so we need only argue the single implication (2) = (1).
Assume that S is a nonempty subset of a vector space V that is S closed
under combinations of pairs of vectors. We will show that S is a vector space by
checking the conditions.
The first item in the vector space definition has five conditions. First, for
closure under addition, if ~s1 ,~s2 S then ~s1 + ~s2 S, as ~s1 + ~s2 = 1 ~s1 + 1 ~s2 .
Second, for any ~s1 ,~s2 S, because addition is inherited from V, the sum ~s1 +~s2
in S equals the sum ~s1 + ~s2 in V, and that equals the sum ~s2 + ~s1 in V (because
V is a vector space, its addition is commutative), and that in turn equals the
sum ~s2 + ~s1 in S. The argument for the third condition is similar to that for the
second. For the fourth, consider the zero vector of V and note that closure of S
under linear combinations of pairs of vectors gives that (where ~s is any member
of the nonempty set S) 0 ~s + 0 ~s = ~0 is in S; showing that ~0 acts under the
inherited operations as the additive identity of S is easy. The fifth condition is
satisfied because for any ~s S, closure under linear combinations shows that the
vector 0 ~0 + (1) ~s is in S; showing that it is the additive inverse of ~s under
the inherited operations is routine.
The checks for the scalar multiplication conditions are similar; see Exercise 33.
QED
We will usually verify that a subset is a subspace with (2) = (1).

2.10 Remark At the start of this chapter we introduced vector spaces as collections
in which linear combinations make sense. Theorem 2.9s statements (1)-(3)
say that we can always make sense of an expression like r1~s1 + r2~s2 without
restrictions on the rs in that the vector described is in the set S.
For a contrast, consider the set T of two-tall vectors whose entries add to
a number greater than or equal to zero. Here we cannot just write a linear
More
information on equivalence of statements is in the appendix.
90
combination such as 2~t1 3~t2 and be sure the result is an element of T , that is,
T doesnt satisfy statement (2).
Lemma 2.9 suggests that a good way to think of a vector space is as a
collection of unrestricted linear combinations. The next two examples take some
spaces and recasts their descriptions to be in that form.
2.11 Example We can show that this plane through the origin subset of R3

x

S = { y x 2y + z = 0 }
z
is a subspace under the usual addition and scalar multiplication operations
of column vectors by checking that it is nonempty and closed under linear
combinations of two vectors as in Example 2.2. But there is another way. Think
of x2y+z = 0 as a one-equation linear system and paramatrize it by expressing
the leading variable in terms of the free variables x = 2y z.

2y z
2
1

S = { y y, z R} = {y 1 + z 0 y, z R }
(*)
z
0
1
Now, to show that this is a subspace consider r1~s1 + r2~s2 . Each ~si is a linear
combination of the two vectors in () so this is a linear combination of linear
combinations.

2
1
2
1

r1 (y1 1 + z1 0) + r2 (y2 1 + z2 0)
0
1
0
1
The Linear Combination Lemma, Lemma One.III.2.3, shows that this is a linear
combination of the two vectors and so Theorem 2.9s statement (2) is satisified.
2.12 Example This is a subspace of the 22 matrices M22 .
!
a 0
L={
a + b + c = 0}
b c
To parametrize, express the condition as a = b c.
!
!
b c 0
1 0
1
b, c R} = {b
+c
L={
b
c
1 0
0
0
1
!

b, c R}
As above, weve described the subspace as a collection of unrestricted linear

combinations. To show it is a subspace, note that a linear combination of vectors
from L is a linear combination of linear combinations and so statement (2) is
true.
91
2.13 Definition The span (or linear closure) of a nonempty subset S of a vector
space is the set of all linear combinations of vectors from S.

[S] = {c1~s1 + + cn~sn c1 , . . . , cn R and ~s1 , . . . ,~sn S}
The span of the empty subset of a vector space is the trivial subspace.
No notation for the span is completely standard. The square brackets used here
are common but so are span(S) and sp(S).
2.14 Remark In Chapter One, after we showed that we can
write the solution
~ 1 + + ck
~ k c1 , . . . , ck R }, we
set of a homogeneous linear system as {c1
~
described that as the set generated by the s.
We now call that the span of
~
~
{ 1 , . . . , k }.
Recall also the discussion of the tricky point in that proof. The span of
the empty set is defined to be the set {~0 } because we follow the convention that
a linear combination of no vectors sums to ~0. Besides, defining the empty sets
span to be the trivial subspace is convenient in that it keeps results like the next
one from needing exceptions for the empty set.
2.15 Lemma In a vector space, the span of any subset is a subspace.
Proof If the subset S is empty then by definition its span is the trivial subspace.
If S is not empty then by Lemma 2.9 we need only check that the span [S]
is closed under linear combinations. For a pair of vectors from that span,
~v = c1~s1 + + cn~sn and w
~ = cn+1~sn+1 + + cm~sm , a linear combination
p (c1~s1 + + cn~sn ) + r (cn+1~sn+1 + + cm~sm )
= pc1~s1 + + pcn~sn + rcn+1~sn+1 + + rcm~sm
(p, r scalars) is a linear combination of elements of S and so is in [S] (possibly
some of the ~si s from ~v equal some of the ~sj s from w
~ , but it does not matter).
QED
The converse of the lemma holds: any subspace is the span of some set,
because a subspace is obviously the span of the set of its members. Thus a
subset of a vector space is a subspace if and only if it is a span. This fits the
intuition that a good way to think of a vector space is as a collection in which
linear combinations are sensible.
Taken together, Lemma 2.9 and Lemma 2.15 show that the span of a subset
S of a vector space is the smallest subspace containing all the members of S.

2.16 Example In any vector space V, for any vector ~v the set {r ~v r R} is a
3
subspace of V. For instance,
line through the origin
for any vector ~v R the
3

containing that vector {k~v k R } is a subspace of R . This is true even when
~v is the zero vector, in which case the subspace is the degenerate line, the trivial
subspace.
92
2.17 Example The span of this set is all of R2 .

!
!
1
1
{
,
}
1
1
To check this we must show that any member of R2 is a linear combination of
these two vectors. So we ask: for which vectors (with real components x and y)
are there scalars c1 and c2 such that this holds?
!
!
!
1
1
x
c1
+ c2
=
1
1
y
Gausss Method
c1 + c2 = x
c1 c2 = y
1 +2
c1 +
c2 =
x
2c2 = x + y
with back substitution gives c2 = (x y)/2 and c1 = (x + y)/2. These two

equations show that for any x and y there are appropriate coefficients c1 and c2
making the above vector equation true. For instance, for x = 1 and y = 2 the
coefficients c2 = 1/2 and c1 = 3/2 will do. That is, we can write any vector in
R2 as a linear combination of the two given vectors.
Since spans are subspaces, and we know that a good way to understand a
subspace is to parametrize its description, we can try to understand a sets span
in that way.
2.18 Example Consider, in P2 , the span of the set { 3x x2 , 2x }. By the definition of span, it is the set of unrestricted linear combinations of the two
{ c1 (3x x2 ) + c2 (2x) c1 , c2 R }. Clearly polynomials in this span must have
a constant term of zero. Is that necessary condition also sufficient?
We are asking: for which members a2 x2 + a1 x + a0 of P2 are there c1 and
c2 such that a2 x2 + a1 x + a0 = c1 (3x x2 ) + c2 (2x)? Since polynomials are
equal if and only if their coefficients are equal, we are looking for conditions on
a2 , a1 , and a0 satisfying these.
c1
= a2
3c1 + 2c2 = a1
0 = a0
Gausss Method gives that c1 = a2 , c2 = (3/2)a2 + (1/2)a1 , and 0 = a0 . Thus
the only condition on polynomials in the span is the condition that we knew
of as long as a0 = 0, we can give appropriate coefficients c1 and c2 to describe
the polynomial a0 + a1 x + a2 x2 as in the span. For instance, for the polynomial
0 4x + 3x2 , the coefficients
c1 = 3 and c2 = 5/2 will do. So the span of the

given set is {a1 x + a2 x2 a1 , a2 R }.
This shows, incidentally, that the set { x, x2 } also spans this subspace. A space
can have more than one spanning set. Two other sets spanning this subspace
are {x, x2 , x + 2x2 } and {x, x + x2 , x + 2x2 , . . . }. (Naturally, we usually prefer
to work with spanning sets that have only a few members.)
93
2.19 Example These are the subspaces of R3 that we now know of, the trivial
subspace, the lines through the origin, the planes through the origin, and the
whole space (of course, the picture shows only a few of the infinitely many
subspaces). In the next section we will prove that R3 has no other type of
subspaces, so in fact this picture shows them all.

1
0
0
{ x 0 + y 1 + z 0 }
0
0
1

1
0
{ x 0 + y 1 }
0
0

1
{ x 0 }
0

1
0
{ x 0 + z 0 }
0
1

A HH
H
A

H
0
{ y 1 }
0

2
{ y 1 }
0
1
0
{ x 1 + z 0 }
0
1

1
{ y 1 }
1
XXX PP
XXXPPHHH @
XXP
H
H@
XP
XP
XP
X
...
...

0
{ 0 }
0
We have described the subspaces as spans of sets with a minimal number of

members and shown them connected to their supersets. Note that the subspaces
fall naturally into levels planes on one level, lines on another, etc. according
to how many vectors are in a minimal-sized spanning set.
So far in this chapter we have seen that to study the properties of linear
combinations, the right setting is a collection that is closed under these combinations. In the first subsection we introduced such collections, vector spaces, and
we saw a great variety of examples. In this subsection we saw still more spaces,
ones that happen to be subspaces of others. In all of the variety weve seen a
commonality. Example 2.19 above brings it out: vector spaces and subspaces
are best understood as a span, and especially as a span of a small number of
vectors. The next section studies spanning sets that are minimal.
Exercises
X 2.20 Which of these subsets of the vector space of 2 2 matrices are subspaces
under the inherited operations? For each one that is a subspace, parametrize its
description.
For each that is not, give a condition that fails.

a 0
(a) {
a, b R }
0 b

a 0
(b) {
a + b = 0}
0 b

a 0
(c) {
a + b = 5}
0 b

a c
(d) {
a + b = 0, c R }
0 b

X 2.21 Is this a subspace of P2 : { a0 + a1 x + a2 x2 a0 + 2a1 + a2 = 4 }? If it is then
parametrize its description.
94
X 2.22 Decide if the vector lies in the span of the set, inside of the space.

2
1
0
(a) 0, { 0 , 0 }, in R3
1
0
1
(b) x x3 , { x2 , 2x + x2 , x + x3 }, in P3

0 1
1 0
2 0
(c)
,{
,
}, in M22
4 2
1 1
2 3
2.23 Which of these are members of the span [{ cos2 x, sin2 x }] in the vector space of
real-valued functions of one real variable?
(a) f(x) = 1
(b) f(x) = 3 + x2
(c) f(x) = sin x
(d) f(x) = cos(2x)
X 2.24 Which of these sets spans R3 ? That is, which of these sets has the property
that any three-tall vector can be expressed as a suitable linear combination of the
sets elements?

1
0
0
2
1
0
1
3
(a) { 0 , 2 , 0 }
(b) { 0 , 1 , 0 }
(c) { 1 , 0 }
0
0
3
1
0
1
0
0

1
3
1
2
2
3
5
6
(d) { 0 , 1 , 0 , 1 }
(e) { 1 , 0 , 1 , 0 }
1
0
0
5
1
1
2
2
X 2.25 Parametrize each subspaces description. Then express each subspace as a
span.

(a) The subset { (a b c) a c = 0 } of the three-wide row vectors
(b) This subset of M22

a b
{
a + d = 0}
c d
(c) This subset of M22

a
{
c
b
d

2a c d = 0 and a + 3b = 0 }

(d) The subset { a + bx + cx3 a 2b + c = 0 } of P3
(e) The subset of P2 of quadratic polynomials p such that p(7) = 0
X 2.26 Find a set to span the given subspace of the given space. (Hint. Parametrize
each.)
(a) the xz-plane in R3

x
(b) { y 3x + 2y + z = 0 } in R3
z

x
y
2x + y + w = 0 and y + 2z = 0 } in R4
(c) {
z
w

(d) { a0 + a1 x + a2 x2 + a3 x3 a0 + a1 = 0 and a2 a3 = 0 } in P3
(e) The set P4 in the space P4
(f) M22 in M22
2.27 Is R2 a subspace of R3 ?
X 2.28 Decide if each is a subspace of the vector space of real-valued functions of one
real variable.

(a) The even functions { f : R R f(x) = f(x) for all x }. For example, two
members of this set are f1 (x) = x2 and f2 (x) = cos(x).
95

(b) The odd functions { f : R R f(x) = f(x) for all x }. Two members are
f3 (x) = x3 and f4 (x) = sin(x).
2.29 Example 2.16
says that for any vector ~v that is an element of a vector space
V, the set { r ~v r R } is a subspace of V. (This is of course, simply the span of
the singleton set {~v }.) Must any such subspace be a proper subspace, or can it be
improper?
2.30 An example following the definition of a vector space shows that the solution
set of a homogeneous linear system is a vector space. In the terminology of this
subsection, it is a subspace of Rn where the system has n variables. What about
a non-homogeneous linear system; do its solutions form a subspace (under the
inherited operations)?
2.31 [Cleary] Give an example of each or explain why it would be impossible to do
so.
(a) A nonempty subset of M22 that is not a subspace.
(b) A set of two vectors in R2 that does not span the space.
2.32 Example 2.19 shows that R3 has infinitely many subspaces. Does every nontrivial space have infinitely many subspaces?
2.33 Finish the proof of Lemma 2.9.
2.34 Show that each vector space has only one trivial subspace.
X 2.35 Show that for any subset S of a vector space, the span of the span equals the
span [[S]] = [S]. (Hint. Members of [S] are linear combinations of members of S.
Members of [[S]] are linear combinations of linear combinations of members of S.)
2.36 All of the subspaces that weve seen use zero in their description in some way.
For example, the subspace in Example 2.3 consists of all the vectors from R2 with
a second component of zero. In contrast, the collection of vectors from R2 with a
second component of one does not form a subspace (it is not closed under scalar
multiplication). Another example is Example 2.2, where the condition on the
vectors is that the three components add to zero. If the condition were that the
three components add to one then it would not be a subspace (again, it would fail
to be closed). This exercise shows that a reliance on zero is not strictly necessary.
Consider the set

x
{ y x + y + z = 1 }
z
under these operations.

x1
x2
x1 + x2 1
x
rx r + 1
y 1 + y 2 = y 1 + y 2
r y =
ry
z1
z2
z1 + z 2
rz
(a) Show that it is not a subspace of R3 . (Hint. See Example 2.5).

(b) Show that it is a vector space. Note that by the prior item, Lemma 2.9 can
not apply.
(c) Show that any subspace of R3 must pass through the origin, and so any
subspace of R3 must involve zero in its description. Does the converse hold?
Does any subset of R3 that contains the origin become a subspace when given
the inherited operations?
2.37 We can give a justification for the convention that the sum of zero-many vectors
equals the zero vector. Consider this sum of three vectors ~v1 + ~v2 + ~v3 .
(a) What is the difference between this sum of three vectors and the sum of the
first two of these three?
96

(b) What is the difference between the prior sum and the sum of just the first
one vector?
(c) What should be the difference between the prior sum of one vector and the
sum of no vectors?
(d) So what should be the definition of the sum of no vectors?
2.38 Is a space determined by its subspaces? That is, if two vector spaces have the
same subspaces, must the two be equal?
2.39 (a) Give a set that is closed under scalar multiplication but not addition.
(b) Give a set closed under addition but not scalar multiplication.
(c) Give a set closed under neither.
2.40 Show that the span of a set of vectors does not depend on the order in which
the vectors are listed in that set.
2.41 Which trivial subspace is the span of the empty set? Is it

0
{ 0 } R3 , or { 0 + 0x } P1 ,
0
or some other subspace?
2.42 Show that if a vector is in the span of a set then adding that vector to the set
wont make the span any bigger. Is that also only if ?
X 2.43 Subspaces are subsets and so we naturally consider how is a subspace of

interacts with the usual set operations.
(a) If A, B are subspaces of a vector space, must their intersection A B be a
subspace? Always? Sometimes? Never?
(b) Must the union A B be a subspace?
(c) If A is a subspace, must its complement be a subspace?
(Hint. Try some test subspaces from Example 2.19.)
X 2.44 Does the span of a set depend on the enclosing space? That is, if W is a
subspace of V and S is a subset of W (and so also a subset of V), might the span
of S in W differ from the span of S in V?
2.45 Is the relation is a subspace of transitive? That is, if V is a subspace of W
and W is a subspace of X, must V be a subspace of X?
X 2.46 Because span of is an operation on sets we naturally consider how it interacts
with the usual set operations.
(a) If S T are subsets of a vector space, is [S] [T ]? Always? Sometimes?
Never?
(b) If S, T are subsets of a vector space, is [S T ] = [S] [T ]?
(c) If S, T are subsets of a vector space, is [S T ] = [S] [T ]?
(d) Is the span of the complement equal to the complement of the span?
2.47 Reprove Lemma 2.15 without doing the empty set separately.
2.48 Find a structure that is closed under linear combinations, and yet is not a
vector space. (Remark. This is a bit of a trick question.)
Section II. Linear Independence
II
97
Linear Independence
The prior section shows how to understand a vector space as a span, as an

unrestricted linear combination
of some of its elements. For example, the space
of linear polynomials {a + bx a, b R } is spanned by the set { 1, x }. The prior
section also showed that a space can have many sets that span it. Two more
sets that span the space of linear polynomials are {1, 2x} and {1, x, 2x}.
At the end of that section we described some spanning sets as minimal
but we never precisely defined that word. We could mean that a spanning set
is minimal if it contains the smallest number of members of any set with the
same span, so that { 1, x, 2x} is not minimal because it has three members while
weve given spanning sets with two. Or we could mean that a spanning set is
minimal when it has no elements that we can remove without changing the span.
Under this meaning { 1, x, 2x} is not minimal because removing the 2x to get
{1, x } leaves the span unchanged.
The first sense of minimality appears to be a global requirement, in that
to check if a spanning set is minimal we seemingly must look at all the sets
that span and find one with the least number of elements. The second sense
of minimality is local since we need to look only at the set and consider the
span with and without various elements. For instance, using the second sense
we could compare the span of {1, x, 2x} with the span of { 1, x } and note that the
2x is a repeat in that its removal doesnt shrink the span.
In this section we will use the second sense of minimal spanning set because
of this technical convenience. However, the most important result of this book
is that the two senses coincide. We will prove that in the next section.
II.1
1.1 Example Recall the Statics example from the opening of Section One.I. We
first got a balance with the unknown-mass objects at 40 cm and 15 cm and then
got another balance at 50 cm and 25 cm. With those two pieces of information
we could compute values of the unknown masses. Had we instead gotten the
second balance at 20 cm and 7.5 cm then we would not have been able to find the
unknown values. The difficulty is that the (20 7.5) information is a repeat of
the (40 15) information. That is, (20 7.5) is in the span of the set {(40 15) }
and so we would be trying to solve a two-unknowns problem with essentially
one piece of information.
As that example shows, to know whether adding a vector to a set will increase
the span or conversely whether removing that vector will decrease the span, we
need to know whether the vector is a linear combination of other members of
the set.
98
1.2 Definition A multiset subset of a vector space is linearly independent if none

of its elements is a linear combination of the others. Otherwise it is linearly
dependent .
Observe that, although this way of writing one vector as a combination of
the others
~s0 = c1~s1 + c2~s2 + + cn~sn
visually sets ~s0 off from the other vectors, algebraically there is nothing special
about it in that equation. For any ~si with a coefficient ci that is non-0 we can
rewrite the relationship to set off ~si .
~si = (1/ci )~s0 + + (ci1 /ci )~si1 + (ci+1 /ci )~si+1 + + (cn /ci )~sn
When we dont want to single out any vector by writing it alone on one side of
the equation we will instead say that ~s0 ,~s1 , . . . ,~sn are in a linear relationship
and write the relationship with all of the vectors on the same side. The next
result rephrases the linear independence definition in this style. It is how we
usually compute whether a finite set is dependent or independent.
1.3 Lemma A subset S of a vector space is linearly independent if and only if
among the elements ~s1 , . . . ,~sn S the only linear relationship
c1~s1 + + cn~sn = ~0
c1 , . . . , cn R
is the trivial one c1 = 0, . . . , cn = 0.

Proof If S is linearly independent then no vector ~si is a linear combination
of other vectors from S so there is no linear relationship where some of the ~s s

have nonzero coefficients.
If S is not linearly independent then some ~si is a linear combination ~si =
c1~s1 + + ci1~si1 + ci+1~si+1 + + cn~sn of other vectors from S. Subtracting
~si from both sides gives a relationship involving a nonzero coefficient, the 1 in
front of ~si .
QED
1.4 Example In the vector space of two-wide row vectors, the two-element set
{ (40 15), (50 25) } is linearly independent. To check this, take
c1 (40
15) + c2 (50
25) = (0
0)
and solving the resulting system

40c1 50c2 = 0
15c1 + 25c2 = 0
(15/40)1 +2
40c1
50c2 = 0
(175/4)c2 = 0
shows that both c1 and c2 are zero. So the only linear relationship between the
two given row vectors is the trivial relationship.
More
information on multisets is in the appendix.
99
In the same vector space, { (40 15), (20 7.5) } is linearly dependent since
we can satisfy
c1 (40 15) + c2 (20 7.5) = (0 0)
with c1 = 1 and c2 = 2.
1.5 Example The set { 1 + x, 1 x} is linearly independent in P2 , the space of
quadratic polynomials with real coefficients, because
0 + 0x + 0x2 = c1 (1 + x) + c2 (1 x) = (c1 + c2 ) + (c1 c2 )x + 0x2
gives
c1 + c2 = 0
c1 c2 = 0
c1 + c2 = 0
2c2 = 0
1 +2
since polynomials are equal only if their coefficients are equal. Thus, the only
linear relationship between these two members of P2 is the trivial one.
1.6 Example The rows of this matrix
2
3
A = 0 1
0
0
1
0
0 2
0
1
form a linearly independent set. This is easy to check in this case, but also recall
that Lemma One.III.2.5 shows that the rows of any echelon form matrix form a
linearly independent set.
1.7 Example In R3 , where

3

~v1 = 4
5

2

~v2 = 9
2
4

~v3 = 18
4
the set S = {~v1 ,~v2 ,~v3 } is linearly dependent because this is a relationship
0 ~v1 + 2 ~v2 1 ~v3 = ~0
where not all of the scalars are zero (the fact that some of the scalars are zero
doesnt matter).
That example illustrates why, although Definition 1.2 is a clearer statement
of what independence is, Lemma 1.3 is more useful for computations. Working
straight from the definition, someone trying to compute whether S is linearly
independent would start by setting ~v1 = c2~v2 + c3~v3 and concluding that there
are no such c2 and c3 . But knowing that the first vector is not dependent on the
other two is not enough. This person would have to go on to try ~v2 = c1~v1 +c3~v3
to find the dependence c1 = 0, c3 = 1/2. Lemma 1.3 gets the same conclusion
with only one computation.
1.8 Example The empty subset of a vector space is linearly independent. There
is no nontrivial linear relationship among its members as it has no members.
100
1.9 Example In any vector space, any subset containing the zero vector is linearly
dependent. For example, in the space P2 of quadratic polynomials, consider the
subset { 1 + x, x + x2 , 0 }.
One way to see that this subset is linearly dependent is to use Lemma 1.3: we
have 0 ~v1 + 0 ~v2 + 1 ~0 = ~0, and this is a nontrivial relationship as not all of the
coefficients are zero. Another way to see that this subset is linearly dependent is
to go straight to Definition 1.2: we can express the third member of the subset
as a linear combination of the first two, namely, we can satisfy c1~v1 + c2~v2 = ~0
by taking c1 = 0 and c2 = 0 (in contrast to the lemma, the definition allows all
of the coefficients to be zero).
There is subtler way to see that this subset is dependent. The zero vector is
equal to the trivial sum, the sum of the empty set. So a set containing the zero
vector has an element that is a combination of a subset of other vectors from
the set, specifically, the zero vector is a combination of the empty subset.
1.10 Remark [Velleman] Definition 1.2 says that when we decide whether some S
is linearly independent, we must consider it as a multiset. Here is an example
showing that we can need multiset rather than set (recall that in a set repeated
elements collapse so that the set {0, 1, 0 } equals the set { 0, 1 }, whereas in a
multiset they do not collapse so that the multiset { 0, 1, 0 } contains the element 0
twice). In the next chapter we will look at functions. Let the function f : P1 R
be f(a + bx) = a; for instance, f(1 + 2x) = 1. Consider the subset B = { 1, 1 + x}
of the domain. The images of the elements are f(1) = 1 and f(1 + x) = 1.
Because in a set repeated elements collapse to be a single element these images
form the one-element set {1 }, which is linearly independent. But in a multiset
repeated elements do not collapse so these images form a linearly dependent
multiset {1, 1 }. The second case is the correct one: B is linearly independent but
its image under f is linearly dependent.
Most of the time we wont need the set-multiset distinction and we will
typically follow the standard convention of referring to a linearly independent
or dependent set.
This section began with a discussion and an example about when a set
contains repeat elements, ones that we can omit without shrinking the span.
The next result characterizes when this happens. And, it supports the definition
of linear independence because it says that such a set is a minimal spanning set
in that we cannot omit any element without changing its span.
1.11 Lemma If ~v is a member of a vector space V and S V then [S {~v }] [S].
Also: (1) if ~v S then [S {~v }] = [S] if and only if ~v [S {~v }] and (2) the
condition that removal of any ~v S shrinks the span [S {~v }] 6= [S] holds if and
only if S is linearly independent.
Proof First, [S{~v }] [S] because an element of [S{~v }] is a linear combination
of elements of S {~v }, and so is a linear combination of elements of S, and so is

an element of [S].
101
For statement (1), one half of the if and only if is easy: if ~v 6 [S {~v }] then
[S {~v }] 6= [S] since the set on the right contains ~v while the set on the left does
not.
The other half of the if and only if assumes that ~v [S {~v }], so that it
is a combination ~v = c1~s1 + + cn~sn of members of S {~v }. To show that
[S {~v }] = [S], by the first paragraph we need only show that each element
of [S] is an element of [S {~v }]. So consider a linear combination d1~sn+1 +
+ dm~sn+m + dm+1~v [S] (we can assume that each ~sn+j is unequal to ~v).
Substitute for ~v
d1~sn+1 + + dm~sn+m + dm+1 (c1~s1 + + cn~sn )
to get a linear combination of linear combinations of members of [S {~v }], which
is a member of [S {~v }].
For statement (2) assume first that S is linearly independent and that ~v S.
If removal of ~v did not shrink the span, so that ~v [S {~v }], then we would have
~v = c1~s1 + + cn~sn , which would be a linear dependence among members of
S, contradicting that S is independent. Hence ~v 6 [S {~v }] and the two sets are
not equal.
Do the other half of this if and only if statement by assuming that S is not
linearly independent, so that some linear dependence ~s = c1~s1 + + cn~sn
holds among its members (with no ~si equal to ~s). Then ~s [S {~s }] and by
statement (1) its removal will not shrink the span [S {~s }] = [S].
QED
We can also express that in terms of adding vectors rather than of omitting
them.
1.12 Lemma If ~v is a member of the vector space V and S is a subset of V then
[S] [S {~v }]. Also: (1) adding ~v to S does not increase the span [S] = [S {~v }]
if and only if ~v [S], and (2) if S is linearly independent then adjoining ~v to S
gives a set that is also linearly independent if and only if ~v 6 [S].
Proof The first sentence and statement (1) are translations of the first sentence
and statement (1) from the prior result.

For statement (2) assume that S is linearly independent. Suppose first
that ~v 6 [S]. If adjoining ~v to S resulted in a nontrivial linear relationship
c1~s1 + c2~s2 + + cn~sn + cn+1~v = ~0 then because the linear independence of S
implies that cn+1 6= 0 (or else the equation would be a nontrivial relationship
among members of S), we could rewrite the relationship as ~v = (c1 /cn+1 )~s1
(cn /cn+1 )~sn to get the contradiction that ~v [S]. Therefore if ~v 6 [S] then
the only linear relationship is trivial.
Conversely, if we suppose that ~v [S] then there is a dependence ~v =
c1~s1 + + cn~sn (~si S) inside of S with ~v adjoined.
QED
102
1.13 Example This subset of R3 is linearly independent.

1

S = { 0 }
0
The span of S is the x-axis. Here are two supersets, one that is linearly dependent
and the other independent.

1
3
1
0

dependent: { 0 , 0 }
independent: { 0 , 1 }
0
0
0
0
This illustrates Lemma 1.12: we got the dependent superset by adding a vector
in the x-axis and so the span did not grow, while we got the independent superset
by adding a vector that isnt in [S] because it has a nonzero y component.
For the independent set

1
0

S = { 0 , 1 }
0
0
the span [S] is the xy-plane. Here are two supersets.

1
0
3
1
0
0

dependent: { 0 , 1 , 2 }
independent: { 0 , 1 , 0 }
0
0
0
0
0
1
As above, the additional member of the dependent superset comes from [S], here
the xy-plane, while the additional member of the independent superset comes
from outside of that plane.
Now consider this independent set [S] = R3 .

1
0
0

S = { 0 , 1 , 0 }
0
0
1
Here is a linearly dependent superset

1
0
0
2

dependent: { 0 , 1 , 0 , 1 }
0
0
1
3
but there is no linearly independent superset. One way to see that is to note
that for any vector that we would add to S, the equation

x
1
0
0

y = c1 0 + c2 1 + c3 0
z
0
0
1
has a solution c1 = x, c2 = y, and c3 = z. Another way to see it is Lemma 1.12
we cannot add any vectors from outside of the span [S] because that span is all
of R3 .
103
1.14 Corollary In a vector space, any finite set has a linearly independent subset
with the same span.
Proof If S = {~s1 , . . . ,~sn } is linearly independent then S itself satisfies the
statement, so assume that it is linearly dependent.

By the definition of dependence, S contains a vector ~v1 that is a linear
combination of the others. Define the set S1 = S {~v1 }. By Lemma 1.11 the
span does not shrink: [S1 ] = [S] (since adding ~v1 to S would not cause the span
to grow).
If S1 is linearly independent then we are done. Otherwise iterate: take a
vector ~v2 that is a linear combination of other members of S1 and discard it
to derive S2 = S1 {~v2 } such that [S2 ] = [S1 ]. Repeat this until a linearly
independent set Sj appears; one must appear eventually because S is finite and
the empty set is linearly independent. (Formally, this argument uses induction
on the number of elements in S. Exercise 38 asks for the details.)
QED
1.15 Example This set spans R3 (the check is routine) but is not linearly independent.

1
0
1
0
3

S = { 0 , 2 , 2 , 1 , 3 }
0
0
0
1
0
We will find vectors to drop to get a subset that is independent but has the
same span. This linear relationship

1
0
1
0
3
0

c1 0 + c2 2 + c3 2 + c4 1 + c5 3 = 0
()
0
0
0
1
0
0
gives this system
c1
+ c3 + + 3c5 = 0
2c2 + 2c3 c4 + 3c5 = 0
c4
=0
whose solution set has this parametrization.

c1
1
3
c
1
3/2
2

{ c3 = c3 1 + c5
0 c3 , c5 R}

c4
0
0
c5
0
1
If we set one of the free variables to 1, and the other to 0, then we get c1 = 3,
c2 = 3/2, and c4 = 0. We have this instance of ().

1
0
1
0
3
0
3

3 0 2 + 0 2 + 0 1 + 1 3 = 0
2
0
0
1
0
0
0
104
Thus the vector associated with the free variable c5 is in the span of the set of
vectors associated with the leading variables c1 and c2 . Lemma 1.11 says that
we can discard the fifth vector without shrinking the span.
Similarly, in the parametrization of the solution set let c3 = 1, and c5 = 0,
to get an instance of () showing that we can discard the third vector without
shrinking the span.
Thus this set

1
0
0

S = { 0 , 2 , 1 }
0
0
1
has the same span as S. We can easily check that it is linearly independent and
so discarding any of its elements will shrink the span.
1.16 Corollary A subset S = {~s1 , . . . ,~sn } of a vector space is linearly dependent
if and only if some s~i is a linear combination of the vectors ~s1 , . . . , ~si1 listed
before it.
Proof Consider S0 = { }, S1 = { s~1 }, S2 = {~s1 ,~s2 }, etc. Some index i > 1 is the
first one with Si1 {~si } linearly dependent, and there ~si [Si1 ].
QED
The proof of Corollary 1.14 describes producing a linearly independent set by

shrinking, that is, by taking subsets. And the proof of Corollary 1.16 describes
finding a linearly dependent set by taking supersets. We finish this subsection
by considering how linear independence and dependence interact with the subset
relation between sets.
1.17 Lemma Any subset of a linearly independent set is also linearly independent.
Any superset of a linearly dependent set is also linearly dependent.
Proof Both are clear.
QED
Restated, subset preserves independence and superset preserves dependence.

Those are two of the four possible cases. The third case, whether subset
preserves linear dependence, is covered by Example 1.15, which gives a linearly
dependent set S with one subset that is linearly dependent and another that is
independent. The fourth case, whether superset preserves linear independence,
is covered by Example 1.13, which gives cases where a linearly independent set
has both an independent and a dependent superset.
This table summarizes.
S independent
S dependent
S1 S
S1 S
S1 must be independent
S1 may be either
S1 may be either
S1 must be dependent
Example 1.13 has something else to say about the interaction between linear
independence and superset. It names a linearly independent set that is maximal
105
in that it has no supersets that are linearly independent. By Lemma 1.12 a

linearly independent set is maximal if and only if it spans the entire space,
because that is when no vector exists that is not already in the span. This nicely
complements the fact that Lemma 1.11 shows that a spanning set is minimal if
and only if it is linearly independent.
In summary, we have introduced the definition of linear independence to
formalize the idea of the minimality of a spanning set. We have developed some
properties of this idea. The most important is Lemma 1.12, which tells us that
a linearly independent set is maximal when it spans the space.
Exercises
X 1.18 Decide whether each subset of R3 is linearly dependent or linearly independent.
1
2
4
(a) { 3 , 2 , 4 }
5
4
14

1
2
3
(b) { 7 , 7 , 7 }
7
7
7

0
1
(c) { 0 , 0 }
1
4

2
3
12
9
(d) { 9 , 0 , 5 , 12 }
0
1
4
1
X 1.19 Which of these subsets of P3 are linearly dependent and which are independent?
(a) { 3 x + 9x2 , 5 6x + 3x2 , 1 + 1x 5x2 }
(b) { x2 , 1 + 4x2 }
(c) { 2 + x + 7x2 , 3 x + 2x2 , 4 3x2 }
(d) { 8 + 3x + 3x2 , x + 2x2 , 2 + 2x + 2x2 , 8 2x + 5x2 }
X 1.20 Prove that each set { f, g } is linearly independent in the vector space of all
functions from R+ to R.
(a) f(x) = x and g(x) = 1/x
(b) f(x) = cos(x) and g(x) = sin(x)
(c) f(x) = ex and g(x) = ln(x)
X 1.21 Which of these subsets of the space of real-valued functions of one real variable
is linearly dependent and which is linearly independent? (Note that we have
abbreviated some constant functions; e.g., in the first item, the 2 stands for the
constant function f(x) = 2.)
(a) { 2, 4 sin2 (x), cos2 (x) }
(b) { 1, sin(x), sin(2x) }
(c) { x, cos(x) }
(d) { (1 + x)2 , x2 + 2x, 3 }
(e) { cos(2x), sin2 (x), cos2 (x) }
(f) { 0, x, x2 }
1.22 Does the equation sin2 (x)/ cos2 (x) = tan2 (x) show that this set of functions
{ sin2 (x), cos2 (x), tan2 (x) } is a linearly dependent subset of the set of all real-valued
functions with domain the interval (/2../2) of real numbers between /2 and
/2)?
1.23 Is the xy-plane subset of the vector space R3 linearly independent?
106
X 1.24 Show that the nonzero rows of an echelon form matrix form a linearly independent set.
X 1.25 (a) Show that if the set {~u,~v, w
~ } is linearly independent then so is the set
{~u, ~u + ~v, ~u + ~v + w
~ }.
(b) What is the relationship between the linear independence or dependence of
{~u,~v, w
~ } and the independence or dependence of {~u ~v,~v w
~ ,w
~ ~u }?
1.26 Example 1.8 shows that the empty set is linearly independent.
(a) When is a one-element set linearly independent?
(b) How about a set with two elements?
1.27 In any vector space V, the empty set is linearly independent. What about all
of V?
1.28 Show that if {~x, ~y, ~z } is linearly independent then so are all of its proper
subsets: {~x, ~y }, {~x, ~z }, {~y, ~z }, {~x },{~y }, {~z }, and { }. Is that only if also?
1.29
(a) Show that this

1
1
S = { 1 , 2 }
0
is a linearly independent subset of R .

(b) Show that

3
2
0
is in the span of S by finding c1 and c2 giving a linear relationship.

1
1
3
c1 1 + c2 2 = 2
0
0
0
Show that the pair c1 , c2 is unique.
(c) Assume that S is a subset of a vector space and that ~v is in [S], so that ~v is a
linear combination of vectors from S. Prove that if S is linearly independent then
a linear combination of vectors from S adding to ~v is unique (that is, unique up
to reordering and adding or taking away terms of the form 0 ~s). Thus S as a
spanning set is minimal in this strong sense: each vector in [S] is a combination
of elements of S a minimum number of times only once.
(d) Prove that it can happen when S is not linearly independent that distinct
linear combinations sum to the same vector.
1.30 Prove that a polynomial gives rise to the zero function if and only if it is
the zero polynomial. (Comment. This question is not a Linear Algebra matter,
but we often use the result. A polynomial gives rise to a function in the natural
way: x 7 cn xn + + c1 x + c0 .)
1.31 Return to Section 1.2 and redefine point, line, plane, and other linear surfaces
to avoid degenerate cases.
1.32 (a) Show that any set of four vectors in R2 is linearly dependent.
(b) Is this true for any set of five? Any set of three?
(c) What is the most number of elements that a linearly independent subset of
R2 can have?
X 1.33 Is there a set of four vectors in R3 , any three of which form a linearly independent
set?
107
1.34 Must every linearly dependent set have a subset that is dependent and a subset
that is independent?
1.35 In R4 , what is the biggest linearly independent set you can find? The smallest?
The biggest linearly dependent set? The smallest? (Biggest and smallest mean
that there are no supersets or subsets with the same property.)
X 1.36 Linear independence and linear dependence are properties of sets. We can thus
naturally ask how the properties of linear independence and dependence act with
respect to the familiar elementary set relations and operations. In this body of this
subsection we have covered the subset and superset relations. We can also consider
the operations of intersection, complementation, and union.
(a) How does linear independence relate to intersection: can an intersection of
linearly independent sets be independent? Must it be?
(b) How does linear independence relate to complementation?
(c) Show that the union of two linearly independent sets can be linearly independent.
(d) Show that the union of two linearly independent sets need not be linearly
independent.
1.37 Continued from prior exercise. What is the interaction between the property
of linear independence and the operation of union?
(a) We might conjecture that the union ST of linearly independent sets is linearly
independent if and only if their spans have a trivial intersection [S] [T ] = {~0 }.
What is wrong with this argument for the if direction of that conjecture? If
the union S T is linearly independent then the only solution to c1~s1 + +
cn~sn + d1~t1 + + dm~tm = ~0 is the trivial one c1 = 0, . . . , dm = 0. So any
member of the intersection of the spans must be the zero vector because in
c1~s1 + + cn~sn = d1~t1 + + dm~tm each scalar is zero.
(b) Give an example showing that the conjecture is false.
(c) Find linearly independent sets S and T so that the union of S (S T ) and
T (S T ) is linearly independent, but the union S T is not linearly independent.
(d) Characterize when the union of two linearly independent sets is linearly
independent, in terms of the intersection of spans.
X 1.38 For Corollary 1.14,
(a) fill in the induction for the proof;
(b) give an alternate proof that starts with the empty set and builds a sequence
of linearly independent subsets of the given finite set until one appears with the
same span as the given set.
1.39 With a some calculation we can get formulas to determine whether or not a set
of vectors is linearly independent.
(a) Show that this subset of R2

a
b
{
,
}
c
d
is linearly independent if and only if ad bc 6= 0.
(b) Show that this subset of R3

a
b
c
{ d , e , f }
g
h
i
is linearly independent iff aei + bfg + cdh hfa idb gec 6= 0.
108

(c) When is this subset of R3

a
b
{ d , e }
g
h
linearly independent?
(d) This is an opinion question: for a set of four vectors from R4 , must there be a
formula involving the sixteen entries that determines independence of the set?
(You neednt produce such a formula, just decide if one exists.)
X 1.40 (a) Prove that a set of two perpendicular nonzero vectors from Rn is linearly
independent when n > 1.
(b) What if n = 1? n = 0?
(c) Generalize to more than two vectors.
1.41 Consider the set of functions from the open interval (1..1) to R.
(a) Show that this set is a vector space under the usual operations.
(b) Recall the formula for the sum of an infinite geometric series: 1 + x + x2 + =
1/(1 x) for all x (1..1). Why does this not express a dependence inside of
the set { g(x) = 1/(1 x), f0 (x) = 1, f1 (x) = x, f2 (x) = x2 , . . . } (in the vector space
that we are considering)? (Hint. Review the definition of linear combination.)
(c) Show that the set in the prior item is linearly independent.
This shows that some vector spaces exist with linearly independent subsets that
are infinite.
1.42 Show that, where S is a subspace of V, if a subset T of S is linearly independent
in S then T is also linearly independent in V. Is that only if ?
Section III. Basis and Dimension
III
109
Basis and Dimension
The prior section ends with the statement that a spanning set is minimal when it
is linearly independent and a linearly independent set is maximal when it spans
the space. So the notions of minimal spanning set and maximal independent set
coincide. In this section we will name this idea and study its properties.
III.1
Basis
1.1 Definition A basis for a vector space is a sequence of vectors that is linearly
independent and that spans the space.
~ 1,
~ 2 , . . .i because this is a sequence,
We denote a basis with angle brackets h
meaning that the order of the elements is significant. Bases are different if they
contain the same elements but in different orders.
(We say that a sequence is linearly independent if the multiset consisting of
the elements of the sequence is independent. Similarly, a sequence spans the
space if the set of the elements of the sequence spans the space.)
1.2 Example This is a basis for R2 .
!
!
2
1
h
,
i
4
1
It is linearly independent
!
!
!
2
1
0
c1
+ c2
=
4
1
0
2c1 + 1c2 = 0
4c1 + 1c2 = 0
c1 = c2 = 0
and it spans R2 .
2c1 + 1c2 = x
4c1 + 1c2 = y
c2 = 2x y and c1 = (y x)/2
1.3 Example This basis for R2

!
!
1
2
h
,
i
1
4
differs from the prior one because the vectors are in a different order. The
verification that it is a basis is just as in the prior example.
1.4 Example The space R2 has many bases. Another one is this.
!
!
1
0
h
,
i
0
1
More information on sequences is in the appendix.
110
The verification is easy.

1.5 Definition For any Rn

0
1

0 1

En = h
.. , .. , . . . ,
. .
0
0

0

0
. i
.
.
1
is the standard (or natural) basis. We denote these vectors ~e1 , . . . , ~en .
Calculus books refer to R2 s standard basis vectors ~ and ~ instead of ~e1 and ~e2 ,
and they refer to R3 s standard basis vectors ~, ~, and ~k instead of ~e1 , ~e2 , and
~e3 . Note that ~e1 means something different in a discussion of R3 than it means
in a discussion of R2 .

1.6 Example Consider the space {a cos + b sin a, b R} of functions of
the real variable . This is a natural basis.
h1 cos + 0 sin , 0 cos + 1 sin i = hcos , sin i
Another, more generic, basis is hcos sin , 2 cos + 3 sin i. Verification that
these two are bases is Exercise 22.
1.7 Example A natural basis for the vector space of cubic polynomials P3 is
h1, x, x2 , x3 i. Two other bases for this space are hx3 , 3x2 , 6x, 6i and h1, 1 + x, 1 +
x + x2 , 1 + x + x2 + x3 i. Checking that these are linearly independent and span
the space is easy.
1.8 Example The trivial space {~0 } has only one basis, the empty one hi.
1.9 Example The space of finite-degree polynomials has a basis with infinitely
many elements h1, x, x2 , . . .i.
1.10 Example We have seen bases before. In the first chapter we described the
solution set of homogeneous systems such as this one
x+y
w=0
z+w=0
by parametrizing.

1
1
1
0

{ y + w y, w R }
0
1
0
1
Thus the vector space of solutions is the span of a two-element set. This twovector set is also linearly independent; that is easy to check. Therefore the
solution set is a subspace of R4 with a basis comprised of the above two elements.
111
1.11 Example Parametrization helps find bases for other vector spaces, not just
for solution sets of homogeneous systems. To find a basis for this subspace of
M22
!
a b
{
a + b 2c = 0 }
c 0
we rewrite the condition as a = b + 2c.
!
b + 2c b
1
{
b, c R } = { b
c
0
0
1
0
2
+c
1
0
0
!

b, c R }
Thus, this is a natural candidate for a basis.

!
!
1 1
2 0
h
,
i
0 0
1 0
The above work shows that it spans the space. Linear independence is also easy.
Consider again Example 1.2. To verify linearly independence we looked at
~1 +
linear combinations of the sets members that total to the zero vector c1

0
~2 =
c2
0 . The resulting calculation shows that such a combination is unique,
that c1 must be 0 and c2 must be 0. To verify that the set spans the space we
~ 1 +c2
~2 =
looked at linear combinations that total to any member of the space c1

x
y . We only noted in that example that such a combination exists, that for each
x, y there is a c1 , c2 , but in fact the calculation also shows that the combination
is unique: c1 must be (y x)/2 and c2 must be 2x y.
1.12 Theorem In any vector space, a subset is a basis if and only if each vector
in the space can be expressed as a linear combination of elements of the subset
in a unique way.
We consider linear combinations to be the same if they differ only in the order
~
of summands or in the addition or deletion of terms of the form 0 .
Proof A sequence is a basis if and only if its vectors form a set that spans and
that is linearly independent. And, a subset is a spanning set if and only if each
vector in the space is a linear combination of elements of that subset in at least
one way. Thus we need only show that a spanning subset is linearly independent
if and only if every vector in the space is a linear combination of elements from
the subset in at most one way.
Consider two expressions of a vector as a linear combination of the members
of the subset. We can rearrange the two sums and if necessary add some
~ i terms so that the two sums combine the same s
~ in the same order:
0
~
~
~
~
~
~ n . Now
~v = c1 1 + c2 2 + + cn n and ~v = d1 1 + d2 2 + + dn
~ 1 + c2
~ 2 + + cn
~ n = d1
~ 1 + d2
~ 2 + + dn
~n
c1
holds if and only if
~ 1 + + (cn dn )
~ n = ~0
(c1 d1 )
112
holds. So, asserting that each coefficient in the lower equation is zero is the same
thing as asserting that ci = di for each i, that is, that every vector is expressible
~ in a unique way.
as a linear combination of the s
QED
1.13 Definition In a vector space with basis B the representation of ~v with
respect to B is the column vector of the coefficients used to express ~v as a linear
combination of the basis vectors:

c1

c2
RepB (~v) =
..
.
cn
~ 1, . . . ,
~ n i and ~v = c1
~ 1 + c2
~ 2 + + cn
~ n . The cs are the
where B = h
coordinates of ~v with respect to B.
Definition 1.1 requires that a basis is a sequence, that the order of the
basis elements matters, in order to make this definition possible. Without that
requirement we couldnt write these ci s in order.
We will later do representations in contexts that involve more than one basis.
To help keep straight which representation is with respect to which basis we
shall often write the basis name as a subscript on the column vector.
1.14 Example In P3 , with respect to the basis B = h1, 2x, 2x2 , 2x3 i, the representation of x + x2 is
0
1/2
RepB (x + x2 ) =
1/2
0 B
(note that the coordinates are scalars, not vectors). With respect to a different
basis D = h1 + x, 1 x, x + x2 , x + x3 i, the representation

0
0

RepD (x + x2 ) =
1
0 D
is different.
1.15 Remark This use of column notation and the term coordinates has both a
down side and an up side.
The down side is that representations look like vectors from Rn , which can
be confusing when the vector space we are working with is Rn , especially since
we sometimes omit the subscript base. We must then infer the intent from the

context. For example, the phrase in R2 , where ~v = 32 refers to the plane
vector that, when in canonical position, ends at (3, 2). To find the coordinates
113
of that vector with respect to the basis

!
!
1
0
B=h
,
i
1
2
we solve
c1
1
1
!
+ c2
0
2
!
=
3
2
to get that c1 = 3 and c2 = 1/2. Then we have this.

!
3
RepB (~v) =
1/2
Here, although weve omitted the subscript B from the column, the fact that
the right side is a representation is clear from the context.
The advantage of the notation and the term coordinates is that they
generalize the familiar case: in Rn and with respect to the standard basis En , the
vector starting at the origin and ending at (v1 , . . . , vn ) has this representation.

v1
v1
..
..
RepEn ( . ) = .
vn
vn E
Our main use of representations will come in the third chapter. The definition
appears here because the fact that every vector is a linear combination of basis
vectors in a unique way is a crucial property of bases, and also to help make two
points. First, we fix an order for the elements of a basis so that we can state the
coordinates in that order. Second, for calculation of coordinates, among other
things, we shall restrict our attention to spaces with bases having only finitely
many elements. We will see that in the next subsection.
Exercises
X 1.16 Decide
each
for R3
.
if
isa basis

1
3
0
1
3
0
1
2
(a) h2 , 2 , 0i
(b) h2 , 2i
(c) h 2 , 1 , 5i
3
1
1
3
1
1
1
0

0
1
1
(d) h 2 , 1 , 3i
1
1
0
X 1.17 Represent
the
vector

with
respect to the basis.
1
1
1
(a)
,B=h
,
i R2
2
1
1
(b) x2 + x3 , D = h1, 1 + x, 1 + x + x2 , 1 + x + x2 + x3 i P3

0
1
4
(c)
0, E4 R
1
114
1.18 Find a basis for P2 , the space of all quadratic polynomials. Must any such
basis contain a polynomial of each degree: degree zero, degree one, and degree two?
1.19 Find a basis for the solution set of this system.
x1 4x2 + 3x3 x4 = 0
2x1 8x2 + 6x3 2x4 = 0
X 1.20 Find a basis for M22 , the space of 22 matrices.
X 1.21 Find a basis for each.

(a) The subspace { a2 x2 + a1 x + a0 a2 2a1 = a0 } of P2
(b) The space of three-wide row vectors whose first and second components add
to zero
(c) This subspace of the 22 matrices

a b
{
c 2b = 0 }
0 c
1.22 Check Example 1.6.
X 1.23 Find the span of each set and then find a basis for that span.
(a) { 1 + x, 1 + 2x } in P2
(b) { 2 2x, 3 + 4x2 } in P2
X 1.24 Find a basis for each of these subspaces of the space P3 of cubic polynomials.
(a) The subspace of cubic polynomials p(x) such that p(7) = 0
(b) The subspace of polynomials p(x) such that p(7) = 0 and p(5) = 0
(c) The subspace of polynomials p(x) such that p(7) = 0, p(5) = 0, and p(3) = 0
(d) The space of polynomials p(x) such that p(7) = 0, p(5) = 0, p(3) = 0,
and p(1) = 0
1.25 Weve seen that the result of reordering a basis can be another basis. Must it
be?
1.26 Can a basis contain a zero vector?
~ 1,
~ 2,
~ 3 i be a basis for a vector space.
X 1.27 Let h
~ 1 , c2
~ 2 , c3
~ 3 i is a basis when c1 , c2 , c3 6= 0. What happens
(a) Show that hc1
when at least one ci is 0?
~1 +
~ i.
(b) Prove that h~
1 ,
~ 2,
~ 3 i is a basis where
~i =
1.28 Find one vector ~v that will make each into a basis for the space.

1
0
1
2
(a) h
,~vi in R
(b) h1 , 1 ,~vi in R3
(c) hx, 1 + x2 ,~vi in P2
1
0
0
~
~
X 1.29 Where h1 , . . . , n i is a basis, show that in this equation
~ 1 + + ck
~ k = ck+1
~ k+1 + + cn
~n
c1
each of the ci s is zero. Generalize.
1.30 A basis contains some of the vectors from a vector space; can it contain them
all?
1.31 Theorem 1.12 shows that, with respect to a basis, every linear combination is
unique. If a subset is not a basis, can linear combinations be not unique? If so,
must they be?
X 1.32 A square matrix is symmetric if for all indices i and j, entry i, j equals entry
j, i.
(a) Find a basis for the vector space of symmetric 22 matrices.
(b) Find a basis for the space of symmetric 33 matrices.
(c) Find a basis for the space of symmetric nn matrices.
115
X 1.33 We can show that every basis for R3 contains the same number of vectors.
(a) Show that no linearly independent subset of R3 contains more than three
vectors.
(b) Show that no spanning subset of R3 contains fewer than three vectors. Hint:
recall how to calculate the span of a set and show that this method cannot yield
all of R3 when we apply it to fewer than three vectors.
1.34 One of the exercises in the Subspaces subsection shows that the set

x
{ y x + y + z = 1 }
z
is a vector space under these operations.

x2
x1 + x2 1
x1
y 1 + y 2 = y 1 + y 2
z1
z2
z1 + z 2
x
rx r + 1
r y =
ry
z
rz
Find a basis.
III.2
Dimension
In the prior subsection we defined the basis of a vector space and we saw that
a space can have many different bases. So we cannot talk about the basis
for a vector space. True, some vector spaces have bases that strike us as more
natural than others, for instance, R2 s basis E2 or P2 s basis h1, x, x2 i. But for
the vector space { a2 x2 + a1 x + a0 2a2 a0 = a1 }, no particular basis leaps
out at us as the natural one. We cannot, in general, associate with a space any
single basis that best describes that space.
We can however find something about the bases that is uniquely associated
with the space. This subsection shows that any two bases for a space have the
same number of elements. So with each space we can associate a number, the
number of vectors in any of its bases.
Before we start, we first limit our attention to spaces where at least one basis
has only finitely many members.
2.1 Definition A vector space is finite-dimensional if it has a basis with only
finitely many vectors.
One space that is not finite-dimensional is the set of polynomials with real
coefficients Example 1.11 (this space is not spanned by any finite subset since
that would contain a polynomial of largest degree but this space has polynomials
of all degrees). These spaces are interesting and important, but we will focus in
a different direction. From now on we will study only finite-dimensional vector
spaces. We shall take the term vector space to mean finite-dimensional vector
space.
116
2.2 Remark One reason for sticking to finite-dimensional spaces is so that the
representation of a vector with respect to a basis is a finitely-tall vector and we
can easily write it. Another reason is that the statement any infinite-dimensional
vector space has a basis is equivalent to a statement called the Axiom of Choice
[Blass 1984] and so covering this would move us far past this books scope. (A
discussion of the Axiom of Choice is in the Frequently Asked Questions list for
sci.math, and another accessible one is [Rucker].)
To prove the main theorem we shall use a technical result, the Exchange
Lemma. We first illustrate it with an example.
2.3 Example Here is a basis for R3 and a vector given as a linear combination of
members of that basis.

1
1
0
1
1
1
0

B = h0 , 1 , 0i
2 = (1) 0 + 2 1 + 0 0
0
0
2
0
0
0
2
Two of the basis vectors have non-zero coefficients. Pick one, for instance the
first. Replace it with the vector that weve expressed as the combination

1
1
0

= h
B
,
,
2
1
0i
0
0
2
and the result is another basis for R3 .
~ 1, . . . ,
~ n i is a basis for a
2.4 Lemma (Exchange Lemma) Assume that B = h
~ 1 + c2
~2 + +
vector space, and that for the vector ~v the relationship ~v = c1
~ n has ci 6= 0. Then exchanging
~ i for ~v yields another basis for the space.
cn
= h
~ 1, . . . ,
~ i1 ,~v,
~ i+1 , . . . ,
~ n i.
Proof Call the outcome of the exchange B
is linearly independent. Any relationship d1
~1 + +
We first show that B
~
~
di~v + + dn n = 0 among the members of B, after substitution for ~v,
~ 1 + + di (c1
~ 1 + + ci
~ i + + cn
~ n ) + + dn
~ n = ~0
d1
()
gives a linear relationship among the members of B. The basis B is linearly

~ i is zero. Because we assumed that ci is
independent, so the coefficient di ci of
nonzero, di = 0. Using this in equation () above gives that all of the other ds
is linearly independent.
are also zero. Therefore B
has the same span as B. Half of this argument,
We finish by showing that B
~ 1 + +di~v+ +dn
~ n of [B]
that [B] [B], is easy; we can write any member d1
~ 1 + +di (c1
~ 1 + +cn
~ n )+ +dn
~ n , which is a linear combination
as d1
half
of linear combinations of members of B, and hence is in [B]. For the [B] [B]
~ 1 + +cn
~ n with ci 6= 0, then we can
of the argument, recall that when ~v = c1
~ i = (c1 /ci )
~ 1 + + (1/ci )~v + + (cn /ci )
~ n.
rearrange the equation to
~
~
~
Now, consider any member d1 1 + + di i + + dn n of [B], substitute for
117
and recognize,
~ i its expression as a linear combination of the members of B,
as in the first half of this argument, that the result is a linear combination of
and hence is in [B].
linear combinations of members of B,

QED
2.5 Theorem In any finite-dimensional vector space, all bases have the same
number of elements.
Proof Fix a vector space with at least one finite basis. Choose, from among
~ 1, . . . ,
~ n i of minimal size. We will show
all of this spaces bases, one B = h
~
~
that any other basis D = h1 , 2 , . . .i also has the same number of members, n.
Because B has minimal size, D has no fewer than n vectors. We will argue that
it cannot have more than n vectors.
The basis B spans the space and ~1 is in the space, so ~1 is a nontrivial linear
combination of elements of B. By the Exchange Lemma, we can swap ~1 for a
vector from B, resulting in a basis B1 , where one element is ~1 and all of the
~
n 1 other elements are s.
The prior paragraph forms the basis step for an induction argument. The
inductive step starts with a basis Bk (for 1 6 k < n) containing k members of D
and n k members of B. We know that D has at least n members so there is a
~k+1 . Represent it as a linear combination of elements of Bk . The key point: in
that representation, at least one of the nonzero scalars must be associated with
~ i or else that representation would be a nontrivial linear relationship among
a
~ i to get a new
elements of the linearly independent set D. Exchange ~k+1 for
~ fewer than the previous basis Bk .
basis Bk+1 with one ~ more and one
~ remain, so that Bn contains ~1 , . . . , ~n .
Repeat the inductive step until no s
Now, D cannot have more than these n vectors because any ~n+1 that remains
would be in the span of Bn (since it is a basis) and hence would be a linear
combination of the other ~s, contradicting that D is linearly independent. QED
2.6 Definition The dimension of a vector space is the number of vectors in any
of its bases.
2.7 Example Any basis for Rn has n vectors since the standard basis En has n
vectors. Thus, this definition generalizes the most familiar use of term, that Rn
is n-dimensional.
2.8 Example The space Pn of polynomials of degree at most n has dimension
n+1. We can show this by exhibiting any basis h1, x, . . . , xn i comes to mind
and counting its members.
2.9 Example A trivial space is zero-dimensional since its basis is empty.
Again, although we sometimes say finite-dimensional as a reminder, in
the rest of this book we assume that all vector spaces are finite-dimensional.
An instance of this is that in the next result the word space means finitedimensional vector space.
118
2.10 Corollary No linearly independent set can have a size greater than the
dimension of the enclosing space.
Proof The proof of Theorem 2.5 never uses that D spans the space, only that
it is linearly independent.
QED
2.11 Example Recall the subspace diagram from the prior section showing the
subspaces of R3 . Each subspace shown is described with a minimal spanning set,
for which we now have the term basis. The whole space has a basis with three
members, the plane subspaces have bases with two members, the line subspaces
have bases with one member, and the trivial subspace has a basis with zero
members. When we saw that diagram we could not show that these are R3 s
only subspaces. We can show it now. The prior corollary proves that the only
subspaces of R3 are either three-, two-, one-, or zero-dimensional. Therefore, the
diagram indicates all of the subspaces. There are no subspaces somehow, say,
between lines and planes.
2.12 Corollary Any linearly independent set can be expanded to make a basis.
Proof If a linearly independent set is not already a basis then it must not span
the space. Adding to the set a vector that is not in the span will preserve linear
independence. Keep adding until the resulting set does span the space, which
the prior corollary shows will happen after only a finite number of steps. QED
2.13 Corollary Any spanning set can be shrunk to a basis.
Proof Call the spanning set S. If S is empty then it is already a basis (the
space must be a trivial space). If S = {~0 } then it can be shrunk to the empty
basis, thereby making it linearly independent, without changing its span.
Otherwise, S contains a vector ~s1 with ~s1 6= ~0 and we can form a basis
B1 = h~s1 i. If [B1 ] = [S] then we are done. If not then there is a ~s2 [S] such
that ~s2 6 [B1 ]. Let B2 = h~s1 , s~2 i; if [B2 ] = [S] then we are done.
We can repeat this process until the spans are equal, which must happen in
at most finitely many steps.
QED
2.14 Corollary In an n-dimensional space, a set composed of n vectors is linearly
independent if and only if it spans the space.
Proof First we will show that a subset with n vectors is linearly independent if
and only if it is a basis. The if is trivially true bases are linearly independent.
Only if holds because a linearly independent set can be expanded to a basis,
but a basis has n elements, so this expansion is actually the set that we began
with.
To finish, we will show that any subset with n vectors spans the space if and
only if it is a basis. Again, if is trivial. Only if holds because any spanning
set can be shrunk to a basis, but a basis has n elements and so this shrunken
set is just the one we started with.
QED
119
The main result of this subsection, that all of the bases in a finite-dimensional
vector space have the same number of elements, is the single most important
result in this book because, as Example 2.11 shows, it describes what vector
spaces and subspaces there can be. We will see more in the next chapter.
One immediate consequence brings us back to when we considered the two
things that could be meant by the term minimal spanning set. At that point we
defined minimal as linearly independent but we noted that another reasonable
interpretation of the term is that a spanning set is minimal when it has the
fewest number of elements of any set with the same span. Now that we have
shown that all bases have the same number of elements, we know that the two
senses of minimal are equivalent.
Exercises
Assume that all spaces are finite-dimensional unless otherwise stated.
X 2.15 Find a basis for, and the dimension of, P2 .
2.16 Find a basis for, and the dimension of, the solution set of this system.
x1 4x2 + 3x3 x4 = 0
2x1 8x2 + 6x3 2x4 = 0
X 2.17 Find a basis for, and the dimension of, M22 , the vector space of 22 matrices.
2.18 Find the dimension of the vector space of matrices

a b
c d
subject to each condition.
(a) a, b, c, d R
(b) a b + 2c = 0 and d R
(c) a + b + c = 0, a + b c = 0, and d R
X 2.19 Find the dimension of each.
(a) The space of cubic polynomials p(x) such that p(7) = 0
(b) The space of cubic polynomials p(x) such that p(7) = 0 and p(5) = 0
(c) The space of cubic polynomials p(x) such that p(7) = 0, p(5) = 0, and p(3) = 0
(d) The space of cubic polynomials p(x) such that p(7) = 0, p(5) = 0, p(3) = 0,
and p(1) = 0
2.20 What is the dimension of the span of the set { cos2 , sin2 , cos 2, sin 2 }? This
span is a subspace of the space of all real-valued functions of one real variable.
2.21 Find the dimension of C47 , the vector space of 47-tuples of complex numbers.
2.22 What is the dimension of the vector space M35 of 35 matrices?
X 2.23 Show that this is a basis for R4 .

1
1
1
1
0 1 1 1

h
0 , 0 , 1 , 1i
0
(We can use the results of this subsection to simplify this job.)
2.24 Refer to Example 2.11.
(a) Sketch a similar subspace diagram for P2 .
(b) Sketch one for M22 .
120
X 2.25 Where S is a set, the functions f : S R form a vector space under the natural
operations: the sum f + g is the function given by f + g (s) = f(s) + g(s) and the
scalar product is r f (s) = r f(s). What is the dimension of the space resulting for
each domain?
(a) S = { 1 }
(b) S = { 1, 2 }
(c) S = { 1, . . . , n }
2.26 (See Exercise 25.) Prove that this is an infinite-dimensional space: the set of
all functions f : R R under the natural operations.
2.27 (See Exercise 25.) What is the dimension of the vector space of functions
f : S R, under the natural operations, where the domain S is the empty set?
2.28 Show that any set of four vectors in R2 is linearly dependent.
2.29 Show that h~
1 ,
~ 2,
~ 3 i R3 is a basis if and only if there is no plane through
the origin containing all three vectors.
2.30 (a) Prove that any subspace of a finite dimensional space has a basis.
(b) Prove that any subspace of a finite dimensional space is finite dimensional.
2.31 Where is the finiteness of B used in Theorem 2.5?
X 2.32 Prove that if U and W are both three-dimensional subspaces of R5 then U W
is non-trivial. Generalize.
2.33 A basis for a space consists of elements of that space. So we are naturally led to
how the property is a basis interacts with operations and and . (Of course,
a basis is actually a sequence in that it is ordered, but there is a natural extension
of these operations.)
(a) Consider first how bases might be related by . Assume that U, W are
subspaces of some vector space and that U W. Can there exist bases BU for U
and BW for W such that BU BW ? Must such bases exist?
For any basis BU for U, must there be a basis BW for W such that BU BW ?
For any basis BW for W, must there be a basis BU for U such that BU BW ?
For any bases BU , BW for U and W, must BU be a subset of BW ?
(b) Is the of bases a basis? For what space?
(c) Is the of bases a basis? For what space?
(d) What about the complement operation?
(Hint. Test any conjectures against some subspaces of R3 .)
X 2.34 Consider how dimension interacts with subset. Assume U and W are both
subspaces of some vector space, and that U W.
(a) Prove that dim(U) 6 dim(W).
(b) Prove that equality of dimension holds if and only if U = W.
(c) Show that the prior item does not hold if they are infinite-dimensional.
? 2.35 [Wohascum no. 47] For any vector ~v in Rn and any permutation of the
numbers 1, 2, . . . , n (that is, is a rearrangement of those numbers into a new
order), define (~v) to be the vector whose components are v(1) , v(2) , . . . , and
v(n) (where (1) is the first
number in the rearrangement, etc.). Now fix ~v and
let V be the span of { (~v) permutes 1, . . . , n }. What are the possibilities for
the dimension of V?
III.3
121
Vector Spaces and Linear Systems
We will now reconsider linear systems and Gausss Method, aided by the tools
and terms of this chapter. We will make three points.
For the first point, recall the insight from the first chapter that if two
matrices are related by row operations A B then each row of B is a
linear combination of the rows of A. That is, Gausss Method works by taking
linear combinations of rows. Therefore, the right setting in which to study row
operations in general, and Gausss Method in particular, is the following vector
space.
3.1 Definition The row space of a matrix is the span of the set of its rows. The
row rank is the dimension of the row space, the number of linearly independent
rows.
3.2 Example If
A=
2
4
3
6
then Rowspace(A) is this subspace of the space of two-component row vectors.

{c1 (2 3) + c2 (4 6) c1 , c2 R}
The second is linearly dependent
on the first and so we can simplify this

description to {c (2 3) c R}.
3.3 Lemma If two matrices A and B are related by a row operation
i j
ki
ki +j
A B or A B or A B
(for i 6= j and k 6= 0) then their row spaces are equal. Hence, row-equivalent
matrices have the same row space and therefore the same row rank.
Proof Corollary One.III.2.4 shows that when A B then each row of B is a
linear combination of the rows of A. That is, in the above terminology, each row
of B is an element of the row space of A. Then Rowspace(B) Rowspace(A)
follows because a member of the set Rowspace(B) is a linear combination of the
rows of B, so it is a combination of combinations of the rows of A, and so by
the Linear Combination Lemma is also a member of Rowspace(A).
For the other set containment, recall Lemma One.III.1.5, that row operations
are reversible, that A B if and only if B A. Then Rowspace(A)
Rowspace(B) follows as in the previous paragraph.
QED
Thus, row operations leave the row space unchanged. But of course, Gausss
Method performs the row operations systematically, with the goal of echelon
form.
122
3.4 Lemma The nonzero rows of an echelon form matrix make up a linearly
independent set.
Proof Lemma One.III.2.5 says that no nonzero row of an echelon form matrix is
a linear combination of the other rows. This restates that result in this chapters
terminology.
QED
Thus, in the language of this chapter, Gaussian reduction works by eliminating
linear dependences among rows, leaving the span unchanged, until no nontrivial
linear relationships remain among the nonzero rows. In short, Gausss Method
produces a basis for the row space.
3.5 Example From any matrix, we can produce a basis for the row space by
performing Gausss Method and taking the nonzero rows of the resulting echelon
form matrix. For instance,
1
2
3
4
0
1
5
1 +2 62 +3
21 +3
0
0
3
1
0
0
3
produces the basis h(1 3 1), (0 1 0), (0 0 3)i for the row space. This is
a basis for the row space of both the starting and ending matrices, since the two
row spaces are equal.
Using this technique, we can also find bases for spans not directly involving
row vectors.
3.6 Definition The column space of a matrix is the span of the set of its columns.
The column rank is the dimension of the column space, the number of linearly
independent columns.
Our interest in column spaces stems from our study of linear systems. An
example is that this system
c1 + 3c2 + 7c3 = d1
2c1 + 3c2 + 8c3 = d2
c2 + 2c3 = d3
4c1
+ 4c3 = d4
has a solution if and only if the vector of ds is a linear combination of the other
column vectors,

1
3
7
d1
2
3
8 d

2
c1 + c2 + c3 =
0
1
2 d3
4
0
4
d4
meaning that the vector of ds is in the column space of the matrix of coefficients.
123
3.7 Example Given this matrix,
1
2
0
4
3
3
1
0
7
8
2
4
to get a basis for the column space, temporarily turn the columns into rows and
reduce.
1 2 0 4
1
2 0
4
31 +2 22 +3
3 3 1 0
0 3 1 12
71 +3
7 8 2 4
0
0 0
0
Now turn the rows back to columns.

1
0
2 3

h ,
i
0 1
4
12
The result is a basis for the column space of the given matrix.
3.8 Definition The transpose of a matrix is the result of interchanging the rows
and columns of that matrix, so that column j of the matrix A is row j of Atrans ,
and vice versa.
So we can summarize the prior example as transpose, reduce, and transpose
back.
We can even, at the price of tolerating the as-yet-vague idea of vector spaces
being the same, use Gausss Method to find bases for spans in other types of
vector spaces.
3.9 Example To get a basis for the span of {x2 + x4 , 2x2 + 3x4 , x2 3x4 } in
the space P4 , think of these three polynomials as the same as the row vectors (0 0 1 0 1), (0 0 2 0 3), and (0 0 1 0 3), apply Gausss
Method
0 0
1 0
1
0 0 1 0 1
21 +2 22 +3
2 0
3
0 0
0 0 0 0 1
1 +3
0 0 1 0 3
0 0 0 0 0
and translate back to get the basis hx2 + x4 , x4 i. (As mentioned earlier, we will
make the phrase the same precise at the start of the next chapter.)
Thus, our first point in this subsection is that the tools of this chapter give
us a more conceptual understanding of Gaussian reduction.
For the second point of this subsection, observe that row operations on a
matrix can change its column space.
!
!
1 2
1 2
21 +2
2 4
0 0
124
The column space of the left-hand matrix contains vectors with a second component that is nonzero but the column space of the right-hand matrix is different
because it contains only vectors whose second component is zero. It is this
observation that makes next result surprising.
3.10 Lemma Row operations do not change the column rank.
Proof Restated, if A reduces to B then the column rank of B equals the column
rank of A.
We will be done if we can show that row operations do not affect linear
relationships among columns because the column rank is just the size of the
largest set of unrelated columns. That is, we will show that a relationship exists
among columns (such as that the fifth column is twice the second plus the
fourth) if and only if that relationship exists after the row operation. But this
is exactly the first theorem of this book, Theorem One.I.1.5: in a relationship
among columns,

a1,1
a1,n
0
a2,1
a2,n 0

c1
.. + + cn .. = ..
.
. .
am,1
am,n
0
row operations leave unchanged the set of solutions (c1 , . . . , cn ).
QED
Another way, besides the prior result, to state that Gausss Method has
something to say about the column space as well as about the row space is with
Gauss-Jordan reduction. Recall that it ends with the reduced echelon form of a
matrix, as here.
1 3 1 6
1 3 0 2
2 6 3 16 0 0 1 4
1 3 1 6
0 0 0 0
Consider the row space and the column space of this result. Our first point made
above says that a basis for the row space is easy to get: simply collect together all
of the rows with leading entries. However, because this is a reduced echelon form
matrix, a basis for the column space is just as easy: take the columns containing
the leading entries, that is, h~e1 , ~e2 i. (Linear independence is obvious. The other
columns are in the span of this set, since they all have a third component of
zero.) Thus, for a reduced echelon form matrix, we can find bases for the row
and column spaces in essentially the same way: by taking the parts of the matrix,
the rows or columns, containing the leading entries.
3.11 Theorem The row rank and column rank of a matrix are equal.
Proof Bring the matrix to reduced echelon form. At that point, the row rank
equals the number of leading entries since that equals the number of nonzero
125
rows. Also at that point, the number of leading entries equals the column rank
because the set of columns containing leading entries consists of some of the ~ei s
from a standard basis, and that set is linearly independent and spans the set of
columns. Hence, in the reduced echelon form matrix, the row rank equals the
column rank, because each equals the number of leading entries.
But Lemma 3.3 and Lemma 3.10 show that the row rank and column rank
are not changed by using row operations to get to reduced echelon form. Thus
the row rank and the column rank of the original matrix are also equal. QED
3.12 Definition The rank of a matrix is its row rank or column rank.
So our second point in this subsection is that the column space and row
space of a matrix have the same dimension. Our third and final point is that
the concepts that weve seen arising naturally in the study of vector spaces are
exactly the ones that we have studied with linear systems.
3.13 Theorem For linear systems with n unknowns and with matrix of coefficients
A, the statements
(1) the rank of A is r
(2) the space of solutions of the associated homogeneous system has dimension
nr
are equivalent.
So if the system has at least one particular solution then for the set of solutions,
the number of parameters equals n r, the number of variables minus the rank
of the matrix of coefficients.
Proof The rank of A is r if and only if Gaussian reduction on A ends with r
nonzero rows. Thats true if and only if echelon form matrices row equivalent
to A have r-many leading variables. That in turn holds if and only if there are
n r free variables.
QED
3.14 Remark [Munkres] Sometimes that result is mistakenly remembered to say
that the general solution of an n unknown system of m equations uses n m
parameters. The number of equations is not the relevant figure, rather, what
matters is the number of independent equations (the number of equations in
a maximal independent set). Where there are r independent equations, the
general solution involves n r parameters.
3.15 Corollary Where the matrix A is nn, the statements
(1) the rank of A is n
(2) A is nonsingular
(3) the rows of A form a linearly independent set
(4) the columns of A form a linearly independent set
(5) any linear system whose matrix of coefficients is A has one and only one
solution
are equivalent.
126
Proof Clearly (1) (2) (3) (4). The last, (4) (5), holds
because a set of n column vectors is linearly independent if and only if it is a

basis for Rn , but the system

a1,1
a1,n
d1

a2,1
a2,n d2

c1
.. + + cn .. = ..
.
. .
am,1
am,n
dm
has a unique solution for all choices of d1 , . . . , dn R if and only if the vectors
of as form a basis.
QED
Exercises
3.16 Transpose each.

2 1
2
(a)
(b)
3 1
1
(e) (1

1
3

1
(c)
6
4
7
3
8

0
(d) 0
0
2)
X 3.17 Decide

2
(a)
3
if the vector is in the row space of the matrix.

0 1 3
1
, (1 0)
(b) 1 0 1, (1 1 1)
1
1 2 7
X 3.18 Decide if the vector is in the column space.

1
3
1
1
1 1
1
(a)
,
(b) 2
0
4, 0
1 1
3
1 3 3
0
X 3.19 Decide if the vector is in the column space of the matrix.

1 1
2 1
1
4 8
0
(a)
,
(b)
,
(c) 1
1
2 5
3
2 4
1
1 1
X 3.20 Find a basis for the row space of this matrix.
2 0
3
4
0 1
1 1
3 1
0
2
1
X 3.21 Find
of each matrix.
the rank
2
1 3
1 1
(a) 1 1 2
(b) 3 3
1
0 3
2
2
0 0 0
(d) 0 0 0
2
6
4
0 0 0
X 3.22 Find a basis for the span of each set.
(a) { (1 3), (1 3), (1 4), (2 1) } M12

1
3
1
(b) { 2 , 1 , 3 } R3
1
1
3
(c) { 1 + x, 1 x2 , 3 + 2x x2 } P3
1
(c) 5
6
3
1
4
2
1
3

1
2
1, 0
1
0
127

1 0
1
1 0 3
1
0 5
,
,
} M23
3 1 1
2 1 4
1 1 9
3.23 Which matrices have rank zero? Rank one?
X 3.24 Given a, b, c R, what choice of d will cause this matrix to have the rank of
one?

a b
c d
3.25 Find the column rank of this matrix.

1 3 1 5 0 4
2 0
1 0 4 1
3.26 Show that a linear system with at least one solution has at most one solution if
and only if the matrix of coefficients has rank equal to the number of its columns.
X 3.27 If a matrix is 59, which set must be dependent, its set of rows or its set of
columns?
3.28 Give an example to show that, despite that they have the same dimension, the
row space and column space of a matrix need not be equal. Are they ever equal?
3.29 Show that the set { (1, 1, 2, 3), (1, 1, 2, 0), (3, 1, 6, 6) } does not have the
same span as { (1, 0, 1, 0), (0, 2, 0, 3) }. What, by the way, is the vector space?
X 3.30 Show that this set of column vectors

d1
3x + 2y + 4z = d1
{ d2 there are x, y, and z such that: x
z = d2 }
d3
2x + 2y + 5z = d3
(d) {
is a subspace of R3 . Find a basis.

3.31 Show that the transpose operation is linear :
(rA + sB)trans = rAtrans + sBtrans
for r, s R and A, B Mmn .
X 3.32 In this subsection we have shown that Gaussian reduction finds a basis for the
row space.
(a) Show that this basis is not unique different reductions may yield different
bases.
(b) Produce matrices with equal row spaces but unequal numbers of rows.
(c) Prove that two matrices have equal row spaces if and only if after Gauss-Jordan
reduction they have the same nonzero rows.
3.33 Why is there not a problem with Remark 3.14 in the case that r is bigger than
n?
3.34 Show that the row rank of an mn matrix is at most m. Is there a better
bound?
X 3.35 Show that the rank of a matrix equals the rank of its transpose.
3.36 True or false: the column space of a matrix equals the row space of its transpose.
X 3.37 We have seen that a row operation may change the column space. Must it?
3.38 Prove that a linear system has a solution if and only if that systems matrix of
coefficients has the same rank as its augmented matrix.
3.39 An mn matrix has full row rank if its row rank is m, and it has full column
rank if its column rank is n.
(a) Show that a matrix can have both full row rank and full column rank only if
it is square.
(b) Prove that the linear system with matrix of coefficients A has a solution for
any d1 , . . . , dn s on the right side if and only if A has full row rank.
128

(c) Prove that a homogeneous system has a unique solution if and only if its
matrix of coefficients A has full column rank.
(d) Prove that the statement if a system with matrix of coefficients A has any
solution then it has a unique solution holds if and only if A has full column
rank.
3.40 How would the conclusion of Lemma 3.3 change if Gausss Method were changed
to allow multiplying a row by zero?
X 3.41 What is the relationship between rank(A) and rank(A)? Between rank(A)
and rank(kA)? What, if any, is the relationship between rank(A), rank(B), and
rank(A + B)?
III.4
Combining Subspaces
This subsection is optional. It is required only for the last sections of

Chapter Three and Chapter Five and for occasional exercises, and can be
passed over without loss of continuity.
One way to understand something is to see how to build it from component
parts. For instance, we sometimes think of R3 as in some way put together
from the x-axis, the y-axis, and z-axis. In this subsection we will describe how
to decompose a vector space into a combination of some of its subspaces. In
developing this idea of subspace combination, we will keep the R3 example in
mind as a prototype.
Subspaces are subsets and sets combine via union. But taking the combination
operation for subspaces to be the simple union operation isnt what we want.
For instance, the union of the x-axis, the y-axis, and z-axis is not all of R3 and
in fact this union of subspaces is not a subspace because it is not closed under
addition:

1
0
0
1

+
+
=
0
1
0
1
0
0
1
1
is in none of the three axes and hence is not in the union. Therefore, in addition
to the members of the subspaces we must at least also include all of the linear
combinations.
4.1 Definition Where W1 , . . . , Wk are subspaces of a vector space, their sum is
the span of their union W1 + W2 + + Wk = [W1 W2 Wk ].
Writing + here fits with the practice of using this symbol for a natural accumulation operation.
4.2 Example The R3 prototype works with this. Any vector w
~ R3 is a linear
combination c1~v1 + c2~v2 + c3~v3 where ~v1 is a member of the x-axis, etc., in this
129
way

w1
w1
0
0

=
1
+
1
+
1
w
0
w
2

2
0
w3
0
0
w3
and so R3 = x-axis + y-axis + z-axis.
4.3 Example A sum of subspaces can be less than the
entire space. Inside of P4 ,
let L be the subspace of linear polynomials{a + bx a, b R} and let C be the
subspace of purely-cubic polynomials
{cx3 c R}. Then L + C is not all of P4 .

3
Instead, L + C = {a + bx + cx a, b, c R}.
4.4 Example A space can be described as a combination of subspaces in more
than one way. Besides the decomposition R3 = x-axis + y-axis + z-axis, we can
also write R3 = xy-plane + yz-plane. To check this, note that any w
~ R3 can
be written as a linear combination of a member of the xy-plane and a member
of the yz-plane; here are two such combinations.

w1
0
0
w1
w1
w1

w2 = 1 w2 + 1 0
w2 = 1 w2 /2 + 1 w2 /2
w3
0
w3
w3
0
w3
The above definition gives one way in which we can think of a space as a
combination of some of its parts. However, the prior example shows that there is
at least one interesting property of our benchmark model that is not captured by
the definition of the sum of subspaces. In the familiar decomposition of R3 , we
often speak of a vectors x part or y part or z part. That is, in our prototype
each vector has a unique decomposition into parts that come from the parts
making up the whole space. But in the decomposition used in Example 4.4, we
cannot refer to the xy part of a vector these three sums

1
1
0
1
0
1
0

2 = 2 + 0 = 0 + 2 = 1 + 1
3
0
3
0
3
0
3
all describe the vector as comprised of something from the first plane plus
something from the second plane, but the xy part is different in each.
That is, when we consider how R3 is put together from the three axes we
might mean in such a way that every vector has at least one decomposition,
and that leads to the definition above. But if we take it to mean in such a way
that every vector has one and only one decomposition then we need another
condition on combinations. To see what this condition is, recall that vectors are
uniquely represented in terms of a basis. We can use this to break a space into a
sum of subspaces such that any vector in the space breaks uniquely into a sum
of members of those subspaces.
4.5 Example Consider R3 with its standard basis E3 = h~e1 , ~e2 , ~e3 i. The subspace
with the basis B1 = h~e1 i is the x-axis. The subspace with the basis B2 = h~e2 i is
130
the y-axis. The subspace with the basis B3 = h~e3 i is the z-axis. The fact that
any member of R3 is expressible as a sum of vectors from these subspaces

x
x
0
0

y = 0 + y + 0
z
0
0
z
is a reflection of the fact that E3 spans the space this equation

x
1
0
0

y = c1 0 + c2 1 + c3 0
z
0
0
1
has a solution for any x, y, z R. And, the fact that each such expression is
unique reflects that fact that E3 is linearly independent any equation like the
one above has a unique solution.
4.6 Example We dont have to take the basis vectors one at a time, the same
idea works if we conglomerate them into larger sequences. Consider again the
space R3 and the vectors from the standard basis E3 . The subspace with the
basis B1 = h~e1 , ~e3 i is the xz-plane. The subspace with the basis B2 = h~e2 i is
the y-axis. As in the prior example, the fact that any member of the space is a
sum of members of the two subspaces in one and only one way

x
x
0

y = 0 + y
z
z
0
is a reflection of the fact that these vectors form a basis this system

x
1
0
0

y = (c1 0 + c3 0) + c2 1
z
0
1
0
has one and only one solution for any x, y, z R.
These examples illustrate a natural way to decompose a space into a sum of
subspaces in such a way that each vector decomposes uniquely into a sum of
vectors from the parts.
~ 1,1 , . . . ,
~ 1,n1 i, . . . ,
4.7 Definition The concatenation of the sequences B1 = h
~ k,1 , . . . ,
~ k,nk i adjoins them into a single sequence.
Bk = h
B1
B2
~ 1,1 , . . . ,
~ 1,n1 ,
~ 2,1 , . . . ,
~ k,nk i
Bk = h
4.8 Lemma Let V be a vector space that is the sum of some of its subspaces
V = W1 + + Wk . Let B1 , . . . , Bk be bases for these subspaces. The following
are equivalent.
131
(1) The expression of any ~v V as a combination ~v = w

~ 1 + + w
~ k with
w
~ i Wi is unique.
_
_
(2) The concatenation B1 Bk is a basis for V.
(3) The nonzero members of { w
~ 1, . . . , w
~ k }, with w
~ i Wi , form a linearly
independent set.
Proof We will show that (1) = (2), that (2) = (3), and finally that
(3) = (1). For these arguments, observe that we can pass from a combination
~
of w
~ s to a combination of s
d1 w
~ 1 + + dk w
~k
~ 1,1 + + c1,n1
~ 1,n1 ) + + dk (ck,1
~ k,1 + + ck,nk
~ k,nk )
= d1 (c1,1
~ 1,1 + + dk ck,nk
~ k,nk
= d1 c1,1
()
and vice versa (we can move from the bottom to the top by taking each di to
be 1).
For (1) = (2), assume that all decompositions are unique. We will show
_
_
that B1 Bk spans the space and is linearly independent. It spans the
space because the assumption that V = W1 + + Wk means that every ~v
can be expressed as ~v = w
~ 1 + + w
~ k , which translates by equation () to an
~ from the concatenation. For
expression of ~v as a linear combination of the s
linear independence, consider this linear relationship.
~0 = c1,1
~ 1,1 + + ck,nk
~ k,nk
Regroup as in () (that is, move from bottom to top) to get the decomposition
~0 = w
~ 1 + + w
~ k . Because the zero vector obviously has the decomposition
~0 = ~0 + + ~0, the assumption that decompositions are unique shows that each
~ i,1 + + ci,ni
~ i,ni = ~0. Thus,
w
~ i is the zero vector. This means that ci,1
since each Bi is a basis, we have the desired conclusion that all of the cs are
zero.
_
_
For (2) = (3), assume that B1 Bk is a basis for the space. Consider
a linear relationship among nonzero vectors from different Wi s,
~0 = + di w
~ i +
in order to show that it is trivial. (The relationship is written in this way
because we are considering a combination of nonzero vectors from only some
of the Wi s; for instance, there might not be a w
~ 1 in this combination.) As in
~ i,1 + + ci,ni
~ i,ni ) + = + di ci,1
~ i,1 + +
(), ~0 = + di (ci,1
_
_
~
di ci,ni i,ni + and the linear independence of B1 Bk gives that each
coefficient di ci,j is zero. Now, w
~ i is a nonzero vector, so at least one of the ci,j s
is not zero, and thus di is zero. This holds for each di , and therefore the linear
relationship is trivial.
132
Finally, for (3) = (1), assume that, among nonzero vectors from different
Wi s, any linear relationship is trivial. Consider two decompositions of a vector
~v = w
~ 1 + + w
~ k and ~v = ~u1 + + ~uk in order to show that the two are the
same. We have
~0 = (~
w1 + + w
~ k ) (~u1 + + ~uk ) = (~
w1 ~u1 ) + + (~
wk ~uk )
which violates the assumption unless each w
~ i ~ui is the zero vector. Hence,
decompositions are unique.
QED
4.9 Definition A collection of subspaces {W1 , . . . , Wk } is independent if no
nonzero vector from any Wi is a linear combination of vectors from the other
subspaces W1 , . . . , Wi1 , Wi+1 , . . . , Wk .
4.10 Definition A vector space V is the direct sum (or internal direct sum)
of its subspaces W1 , . . . , Wk if V = W1 + W2 + + Wk and the collection
{ W1 , . . . , Wk } is independent. We write V = W1 W2 Wk .
4.11 Example Our prototype works: R3 = x-axis y-axis z-axis.
4.12 Example The space of 22 matrices is this direct sum.
!
!
!
0 b
0 0
a 0
{
a, d R } {
b R} {
c R}
0 d
0 0
c 0
It is the direct sum of subspaces in many other ways as well; direct sum
decompositions are not unique.
4.13 Corollary The dimension of a direct sum is the sum of the dimensions of its
summands.
Proof In Lemma 4.8, the number of basis vectors in the concatenation equals the
sum of the number of vectors in the sub-bases that make up the concatenation.
QED
The special case of two subspaces is worth mentioning separately.

4.14 Definition When a vector space is the direct sum of two of its subspaces
then they are complements.
4.15 Lemma A vector space V is the direct sum of two of its subspaces W1 and
W2 if and only if it is the sum of the two V = W1 + W2 and their intersection
is trivial W1 W2 = {~0 }.
Proof Suppose first that V = W1 W2 . By definition, V is the sum of the two.
To show that they have a trivial intersection, let ~v be a vector from W1 W2
and consider the equation ~v = ~v. On the left side of that equation is a member
133
of W1 , and on the right side is a member of W2 , which we can think of as a

linear combination of members (of only one member) of W2 . But the spaces are
independent so the only way a member of W1 can be a linear combination of
members of W2 is if it is the zero vector ~v = ~0.
For the other direction, suppose that V is the sum of two spaces with a trivial
intersection. To show that V is a direct sum of the two, we need only show that
the spaces are independent no nonzero member of the first is expressible as a
linear combination of members of the second, and vice versa. This is true because
any relationship w
~ 1 = c1 w
~ 2,1 + + ck w
~ 2,k (with w
~ 1 W1 and w
~ 2,j W2 for
all j) shows that the vector on the left is also in W2 , since the right side is a
combination of members of W2 . The intersection of these two spaces is trivial,
so w
~ 1 = ~0. The same argument works for any w
~ 2.
QED
4.16 Example In the space R2 , the x-axis and the y-axis are complements, that
is, R2 = x-axis y-axis. A space can have more than one pair of complementary
subspaces; another pair here are the subspaces consisting of the lines y = x and
y = 2x.

In the space F = { a cos + b sin a, b R }, the subspaces W1 =
4.17 Example

{a cos a R } and W2 = {b sin b R } are complements. In addition to
the fact that a space like F can have more than one pair of complementary
subspaces, inside of the space a single subspace like W1 can have more than one
complement another complement of W1 is W3 = { b sin + b cos b R}.
4.18 Example In R3 , the xy-plane and the yz-planes are not complements, which
is the point of the discussion following Example 4.4. One complement of the
xy-plane is the z-axis. A complement of the yz-plane is the line through (1, 1, 1).
Following Lemma 4.15, here is a natural question: is the simple sum V =
W1 + + Wk also a direct sum if and only if the intersection of the subspaces
is trivial?
4.19 Example If there are more than two subspaces then having a trivial intersection is not enough to guarantee unique decomposition (i.e., is not enough to
ensure that the spaces are independent). In R3 , let W1 be the x-axis, let W2 be
the y-axis, and let W3 be this.

q

W3 = { q q, r R}
r
The check that R3 = W1 + W2 + W3 is easy. The intersection W1 W2 W3 is
trivial, but decompositions arent unique.

x
0
0
x
xy
0
y

y = 0 + y x + x = 0 + 0 + y
z
0
0
z
0
0
z
(This example also shows that this requirement is also not enough: that all
pairwise intersections of the subspaces be trivial. See Exercise 30.)
134
In this subsection we have seen two ways to regard a space as built up from
component parts. Both are useful; in particular we will use the direct sum
definition to do the Jordan Form construction at the end of the fifth chapter.
Exercises
2
X 4.20 Decide ifR
is the direct sumofeach W1 and W2 .
x
x
(a) W1 = {
x R }, W2 = {
x R}
0
x

s
s
s R}
(b) W1 = {
s R }, W2 = {
s
1.1s
(c) W1 = R2 , W2 = {~0 }

t
(d) W1 = W2 = {
t R}
t

1
x
1
0
(e) W1 = {
+
x R }, W2 = {
+
y R}
0
0
0
y
X 4.21 Show that R3 is the direct sum of the xy-plane with each of these.
(a) the z-axis
(b) the line

z
{ z z R }
z

4.22 Is P2 the direct sum of { a + bx2 a, b R } and { cx c R }?
X 4.23 In Pn , the even polynomials are the members of this set

E = { p Pn p(x) = p(x) for all x }
and the odd polynomials are the members of this set.

O = { p Pn p(x) = p(x) for all x }
Show that these are complementary subspaces.
4.24 Which of these subspaces of R3
W1 : the x-axis, W2 : the y-axis, W3 : the z-axis,
W4 : the plane x + y + z = 0, W5 : the yz-plane
can be combined to
(a) sum to R3 ?
(b) direct sum to R3 ?

X 4.25 Show that Pn = { a0 a0 R } . . . { an xn an R }.
4.26 What is W1 + W2 if W1 W2 ?
4.27 Does Example 4.5 generalize? That is, is this true or false: if a vector space V
~ 1, . . . ,
~ n i then it is the direct sum of the spans of the one-dimensional
has a basis h
~ 1 }] . . . [{
~ n }]?
subspaces V = [{
4
4.28 Can R be decomposed as a direct sum in two different ways? Can R1 ?
4.29 This exercise makes the notation of writing + between sets more natural.
Prove that, where W1 , . . . , Wk are subspaces of a vector space,

W1 + + Wk = { w
~1+w
~ 2 + + w
~k w
~ 1 W1 , . . . , w
~ k Wk },
and so the sum of subspaces is the subspace of all sums.
4.30 (Refer to Example 4.19. This exercise shows that the requirement that pairwise
intersections be trivial is genuinely stronger than the requirement only that the
intersection of all of the subspaces be trivial.) Give a vector space and three
subspaces W1 , W2 , and W3 such that the space is the sum of the subspaces,
the intersection of all three subspaces W1 W2 W3 is trivial, but the pairwise
intersections W1 W2 , W1 W3 , and W2 W3 are nontrivial.
135
X 4.31 Prove that if V = W1 . . . Wk then Wi Wj is trivial whenever i 6= j. This

shows that the first half of the proof of Lemma 4.15 extends to the case of more
than two subspaces. (Example 4.19 shows that this implication does not reverse;
the other half does not extend.)
4.32 Recall that no linearly independent set contains the zero vector. Can an
independent set of subspaces contain the trivial subspace?
X 4.33 Does every subspace have a complement?
X 4.34 Let W1 , W2 be subspaces of a vector space.
(a) Assume that the set S1 spans W1 , and that the set S2 spans W2 . Can S1 S2
span W1 + W2 ? Must it?
(b) Assume that S1 is a linearly independent subset of W1 and that S2 is a linearly
independent subset of W2 . Can S1 S2 be a linearly independent subset of
W1 + W2 ? Must it?
4.35 When we decompose a vector space as a direct sum, the dimensions of the
subspaces add to the dimension of the space. The situation with a space that is
given as the sum of its subspaces is not as simple. This exercise considers the
two-subspace special case.
(a) For these subspaces of M22 find W1 W2 , dim(W1 W2 ), W1 + W2 , and
dim(W1 + W2 ).

0 0
0 b
W1 = {
c, d R }
W2 = {
b, c R }
c d
c 0
(b) Suppose that U and W are subspaces of a vector space. Suppose that the
~ 1, . . . ,
~ k i is a basis for U W. Finally, suppose that the prior
sequence h
~ 1, . . . ,
~ k i that is a
sequence has been expanded to give a sequence h~1 , . . . , ~j ,
~
~
basis for U, and a sequence h1 , . . . , k ,
~ 1, . . . ,
~ p i that is a basis for W. Prove
that this sequence
~ 1, . . . ,
~ k,
h~1 , . . . , ~j ,
~ 1, . . . ,
~ pi
is a basis for the sum U + W.
(c) Conclude that dim(U + W) = dim(U) + dim(W) dim(U W).
(d) Let W1 and W2 be eight-dimensional subspaces of a ten-dimensional space.
List all values possible for dim(W1 W2 ).
4.36 Let V = W1 Wk and for each index i suppose that Si is a linearly
independent subset of Wi . Prove that the union of the Si s is linearly independent.
4.37 A matrix is symmetric if for each pair of indices i and j, the i, j entry equals
the j, i entry. A matrix is antisymmetric if each i, j entry is the negative of the j, i
entry.
(a) Give a symmetric 22 matrix and an antisymmetric 22 matrix. (Remark.
For the second one, be careful about the entries on the diagonal.)
(b) What is the relationship between a square symmetric matrix and its transpose?
Between a square antisymmetric matrix and its transpose?
(c) Show that Mnn is the direct sum of the space of symmetric matrices and the
space of antisymmetric matrices.
4.38 Let W1 , W2 , W3 be subspaces of a vector space. Prove that (W1 W2 ) + (W1
W3 ) W1 (W2 + W3 ). Does the inclusion reverse?
4.39 The example of the x-axis and the y-axis in R2 shows that W1 W2 = V does
not imply that W1 W2 = V. Can W1 W2 = V and W1 W2 = V happen?
X 4.40 Consider Corollary 4.13. Does it work both ways that is, supposing that V =
W1 + +Wk , is V = W1 Wk if and only if dim(V) = dim(W1 )+ +dim(Wk )?
136
4.41 We know that if V = W1 W2 then there is a basis for V that splits into a
basis for W1 and a basis for W2 . Can we make the stronger statement that every
basis for V splits into a basis for W1 and a basis for W2 ?
4.42 We can ask about the algebra of the + operation.
(a) Is it commutative; is W1 + W2 = W2 + W1 ?
(b) Is it associative; is (W1 + W2 ) + W3 = W1 + (W2 + W3 )?
(c) Let W be a subspace of some vector space. Show that W + W = W.
(d) Must there be an identity element, a subspace I such that I + W = W + I = W
for all subspaces W?
(e) Does left-cancellation hold: if W1 + W2 = W1 + W3 then W2 = W3 ? Right
cancellation?
4.43 Consider the algebraic properties of the direct sum operation.
(a) Does direct sum commute: does V = W1 W2 imply that V = W2 W1 ?
(b) Prove that direct sum is associative: (W1 W2 ) W3 = W1 (W2 W3 ).
(c) Show that R3 is the direct sum of the three axes (the relevance here is that by
the previous item, we neednt specify which two of the three axes are combined
first).
(d) Does the direct sum operation left-cancel: does W1 W2 = W1 W3 imply
W2 = W3 ? Does it right-cancel?
(e) There is an identity element with respect to this operation. Find it.
(f) Do some, or all, subspaces have inverses with respect to this operation: is
there a subspace W of some vector space such that there is a subspace U with
the property that U W equals the identity element from the prior item?
Topic
Fields
Computations involving only integers or only rational numbers are much easier
than those with real numbers. Could other algebraic structures, such as the
integers or the rationals, work in the place of R in the definition of a vector
space?
Yes and no. If we take work to mean that the results of this chapter remain
true then an analysis of the properties of the reals that we have used in this
chapter gives a list of conditions that a structure needs in order to work in the
place of R.
0.1 Definition A field is a set F with two operations + and such that
(1) for any a, b F the result of a + b is in F and
a+b=b+a
if c F then a + (b + c) = (a + b) + c
(2) for any a, b F the result of a b is in F and
ab=ba
if c F then a (b c) = (a b) c
(3) if a, b, c F then a (b + c) = a b + a c
(4) there is an element 0 F such that
if a F then a + 0 = a
for each a F there is an element a F such that (a) + a = 0
(5) there is an element 1 F such that
if a F then a 1 = a
for each element a 6= 0 of F there is an element a1 F such that
a1 a = 1.
The algebraic structure consisting of the set of real numbers along with its
138
usual addition and multiplication operation is a field, naturally. Another field is

the set of rational numbers with its usual addition and multiplication operations.
An example of an algebraic structure that is not a field is the integers, because
it fails the final condition.
Some examples are surprising. The set {0, 1 } under these operations:
+
0
1
0
0
1
1
1
0
0
1
0
0
0
1
0
1
is a field (see Exercise 5).

We could in this book develop Linear Algebra as the theory of vector spaces
with scalars from an arbitrary field. In that case, almost all of the statements here
would carry over by replacing R with F, that is, by taking coefficients, vector
entries, and matrix entries to be elements of F (the exceptions are statements
involving distances or angles). Here are some examples; each applies to a vector
space V over a field F.
For any ~v V and a F, (i) 0 ~v = ~0, (ii) 1 ~v +~v = ~0, and (iii) a ~0 = ~0.
The span, the set of linear combinations, of a subset of V is a subspace of
V.
Any subset of a linearly independent set is also linearly independent.
In a finite-dimensional vector space, any two bases have the same number
of elements.
(Even statements that dont explicitly mention F use field properties in their
proof.)
We will not develop vector spaces in this more general setting because the
additional abstraction can be a distraction. The ideas we want to bring out
already appear when we stick to the reals.
The only exception is Chapter Five. There we must factor polynomials, so
we will switch to considering vector spaces over the field of complex numbers.
Exercises
2 Show that the real numbers form a field.
3 Prove that these are fields.
(a) The rational numbers Q
(b) The complex numbers C
4 Give an example that shows that the integer number system is not a field.
5 Consider the set B = { 0, 1 } subject to the operations given above. Show that it is
a field.
6 Give suitable operations to make the set { 0, 1, 2 } a field.
Topic
Crystals
Everyone has noticed that table salt comes in little cubes.
The explanation for the cubical external shape is the simplest one that we could
imagine: the internal shape, the way the atoms lie, is also cubical. The internal
structure is pictured below. Salt is sodium chloride, and the small spheres shown
are sodium while the big ones are chloride. To simplify the view, it only shows
the sodiums and chlorides on the front, top, and right.
The specks of salt that we see have many repetitions of this fundamental unit.
A solid, such as table salt, with a regular internal structure is a crystal.
We can restrict our attention to the front face. There we have a square
repeated many times.
The distance between the corners of the square cell is about 3.34 ngstroms (an
ngstrom is 1010 meters). Obviously that unit is unwieldy. Instead we can
140
take as a unit the length of each squares side. That is, we naturally adopt this
basis.
!
!
3.34
0
h
,
i
0
3.34
Then we can describe, say, the corner in the upper right of the picture above as
~ 1 + 2
~ 2.
3
Another crystal from everyday experience is pencil lead. It is graphite,
formed from carbon atoms arranged in this shape.
This is a single plane of graphite, called graphene. A piece of graphite consists

of millions of these planes layered in a stack. The chemical bonds between the
planes are much weaker than the bonds inside the planes, which explains why
pencils write the graphite can be sheared so that the planes slide off and are
left on the paper.
We can get a convenient unit of length by decomposing the hexagonal ring
into three regions that are rotations of this unit cell.
The vectors that form the sides of that unit cell make a convenient basis. The
distance along the bottom and slant is 1.42 ngstroms, so this
!
!
1.42
1.23
h
,
i
0
.71
is a good basis.
Another familiar crystal formed from carbon is diamond. Like table salt it
is built from cubes but the structure inside each cube is more complicated. In
addition to carbons at each corner,
there are carbons in the middle of each face.
Topic: Crystals
141
(To show the new face carbons clearly, the corner carbons are reduced to dots.)
There are also four more carbons inside the cube, two that are a quarter of the
way up from the bottom and two that are a quarter of the way down from the
top.
(As before, carbons shown earlier have are reduced here to dots.) The distance
along any edge of the cube is 2.18 ngstroms. Thus, a natural basis for describing
the locations of the carbons and the bonds between them, is this.
2.18
0
0
h 0 , 2.18 , 0 i
0
0
2.18
The examples here show that the structures of crystals is complicated enough
to need some organized system to give the locations of the atoms and how they
are chemically bound. One tool for that organization is a convenient basis. This
application of bases is simple but it shows a natural science context where the
idea arises naturally.
Exercises
1 How many fundamental regions are there in one face of a speck of salt? (With a
ruler, we can estimate that face is a square that is 0.1 cm on a side.)
2 In the graphite picture, imagine that we are interested in a point 5.67 ngstroms
over and 3.14 ngstroms up from the origin.
(a) Express that point in terms of the basis given for graphite.
(b) How many hexagonal shapes away is this point from the origin?
(c) Express that point in terms of a second basis, where the first basis vector is
the same, but the second is perpendicular to the first (going up the plane) and
of the same length.
3 Give the locations of the atoms in the diamond cube both in terms of the basis,
and in ngstroms.
4 This illustrates how we could compute the dimensions of a unit cell from the
shape in which a substance crystallizes ([Ebbing], p. 462).
(a) Recall that there are 6.022 1023 atoms in a mole (this is Avogadros number).
From that, and the fact that platinum has a mass of 195.08 grams per mole,
calculate the mass of each atom.
(b) Platinum crystallizes in a face-centered cubic lattice with atoms at each lattice
point, that is, it looks like the middle picture given above for the diamond crystal.
Find the number of platinums per unit cell (hint: sum the fractions of platinums
that are inside of a single cell).
142

(c) From that, find the mass of a unit cell.
(d) Platinum crystal has a density of 21.45 grams per cubic centimeter. From
this, and the mass of a unit cell, calculate the volume of a unit cell.
(e) Find the length of each edge.
(f) Describe a natural three-dimensional basis.
Topic
Voting Paradoxes
Imagine that a Political Science class studying the American presidential process
holds a mock election. The 29 class members rank the Democratic Party,
Republican Party, and Third Party nominees, from most preferred to least
preferred (> means is preferred to).
preference order
number with
that preference
Democrat > Republican > Third

Democrat > Third > Republican
Republican > Democrat > Third
Republican > Third > Democrat
Third > Democrat > Republican
Third > Republican > Democrat
5
4
2
8
8
2
What is the preference of the group as a whole?

Overall, the group prefers the Democrat to the Republican by five votes;
seventeen voters ranked the Democrat above the Republican versus twelve the
other way. And the group prefers the Republican to the Thirds nominee, fifteen
to fourteen. But, strangely enough, the group also prefers the Third to the
Democrat, eighteen to eleven.
Democrat
5 voters
7 voters
Third
Republican
1 voter
This is a voting paradox , specifically, a majority cycle.

Mathematicians study voting paradoxes in part because of their implications
for practical politics. For instance, the instructor of this class can manipulate
them into choosing the Democrat as the overall winner by first asking for a vote
to choose between the Republican and the Third, and then asking for a vote to
choose between the winner of that contest, the Republican, and the Democrat.
144
The instructor can make any of the other two candidates come out as the winner
by similar manipulations. (Here we will stick to three-candidate elections but
the same thing happens in larger elections.)
Mathematicians also study voting paradoxes simply because they are interesting. One interesting aspect is that the groups overall majority cycle occurs
despite that each single voters preference list is rational, in a straight-line order.
That is, the majority cycle seems to arise in the aggregate without being present
in the components of that aggregate, the preference lists. However we can use
linear algebra to argue that a tendency toward cyclic preference is actually
present in each voters list and that it surfaces when there is more adding of the
tendency than canceling.
For this, abbreviating the choices as D, R, and T , we can describe how a
voter with preference order D > R > T contributes to the above cycle.
D
1 voter
1 voter
R
1 voter
(The negative sign is here because the arrow describes T as preferred to D, but
this voter likes them the other way.) The descriptions for the other preference
lists are in the table on page 146.
Now, to conduct the election we linearly combine these descriptions; for
instance, the Political Science mock election
D
D
1
+4
+ + 2
R
1
yields the circular group preference shown earlier.

Of course, taking linear combinations is linear algebra. The graphical cycle
notation is suggestive but inconvenient so we use column vectors by starting at
the D and taking the numbers from the cycle in counterclockwise order. Thus,
we represent the mock election and a single D > R > T vote in this way.

7

1
5
and

1

1
1
We will decompose vote vectors into two parts, one cyclic and the other
acyclic. For the first part, we say that a vector is purely cyclic if it is in this
subspace of R3 .

k
1

C = { k k R} = {k 1 k R}
k
1
Topic: Voting Paradoxes
145
For the second part, consider the set of vectors that are perpendicular to all of
the vectors in C. Exercise 6 shows that this is a subspace.

c1
c1
k

C = { c2 c2 k = 0 for all k R}
c3
c3
k

c1
1
1

= { c2 c1 + c2 + c3 = 0 } = {c2 1 + c3 0 c2 , c3 R }
c3
0
1
(Read the name as C perp.) So we are led to this basis for R3 .

1
1
1

h1 , 1 , 0 i
1
0
1
We can represent votes with respect to this basis, and thereby decompose them
into a cyclic part and an acyclic part. (Note for readers who have covered the
optional section in this chapter: that is, the space is the direct sum of C
and C .)
For example, consider the D > R > T voter discussed above. We represent it
with respect to the basis
c1 c2 c3 = 1
c1 + c2
= 1
c1
+ c3 = 1
1 +2 (1/2)2 +3
1 +3
c1 c2
2c2 +
c3 = 1
c3 = 2
(3/2)c3 = 1
using the coordinates c1 = 1/3, c2 = 2/3, and c3 = 2/3. Then

1
1
1
1
1/3
4/3
1 2 2

1 = 1 + 1 + 0 = 1/3 + 2/3
3
3
3
1
1
0
1
1/3
2/3
gives the desired decomposition into a cyclic part and an acyclic part.
D
D
1
D
1/3 4/3
1/3
2/3
1/3
R
2/3
Thus we can see that this D > R > T voters rational preference list does have a
cyclic part.
The T > R > D voter is opposite to the one just considered in that the >
symbols are reversed. This voters decomposition
D
D
1
R
1
D
1/3 4/3
1/3
T
1/3
2/3
2/3
shows that these opposite preferences have decompositions that are opposite.
We say that the first voter has positive spin since the cycle part is with the
146
direction that we have chosen for the arrows, while the second voters spin is
negative.
The fact that these opposite voters cancel each other is reflected in the fact
that their vote vectors add to zero. This suggests an alternate way to tally an
election. We could first cancel as many opposite preference lists as possible, and
then determine the outcome by adding the remaining lists.
The rows of the table below contain the three pairs of opposite preference
lists. The columns group those pairs by spin. For instance, the first row contains
the two voters just considered.
positive spin
negative spin
Democrat > Republican > Third

D
D
1
2/3
1/3
1/3
1/3
2/3
D
1/3
2/3
1/3
4/3
1/3
2/3
Republican > Democrat > Third

D
D
2/3
2/3
2/3
D
1
D
1/3
2/3
D
1/3
Democrat > Third > Republican
Third > Democrat > Republican

D
1/3
4/3 1
2/3
D
1/3 4/3
1/3
D
1/3
1/3
2/3
Republican > Third > Democrat

D
1/3 4/3
1/3
Third > Republican > Democrat
4/3
D
1/3
2/3
1/3
1/3
2/3
R
4/3
If we conduct the election as just described then after the cancellation of as

many opposite pairs of voters as possible then there will be left three sets of
preference lists: one set from the first row, one from the second row, and one
from the third row. We will finish by proving that a voting paradox can happen
only if the spins of these three sets are in the same direction. That is, for a
voting paradox to occur, the three remaining sets must all come from the left of
the table or all come from the right (see Exercise 3). This shows that there is
some connection between the majority cycle and the decomposition that we are
using a voting paradox can happen only when the tendencies toward cyclic
preference reinforce each other.
For the proof, assume that we have cancelled opposite preference orders and
we are left with one set of preference lists from each of the three rows. Consider
the sum of these three (here, the numbers a, b, and c could be positive, negative,
or zero).
D
T
R
a
D
a
R
b
D
c
R
c
ab+c
a + b + c
a+bc
A voting paradox occurs when the three numbers on the right, a b + c and
a + b c and a + b + c, are all nonnegative or all nonpositive. On the left,
Topic: Voting Paradoxes
147
at least two of the three numbers a and b and c are both nonnegative or both
nonpositive. We can assume that they are a and b. That makes four cases: the
cycle is nonnegative and a and b are nonnegative, the cycle is nonpositive and
a and b are nonpositive, etc. We will do only the first case, since the second is
similar and the other two are also easy.
So assume that the cycle is nonnegative and that a and b are nonnegative.
The conditions 0 6 a b + c and 0 6 a + b + c add to give that 0 6 2c, which
implies that c is also nonnegative, as desired. That ends the proof.
This result says only that having all three spin in the same direction is a
necessary condition for a majority cycle. It is not sufficient; see Exercise 4.
Voting theory and associated topics are the subject of current research. There
are many intriguing results, most notably the one produced by K Arrow [Arrow],
who won the Nobel Prize in part for this work, showing that no voting system
is entirely fair (for a reasonable definition of fair). For more information, some
good introductory articles are [Gardner, 1970], [Gardner, 1974], [Gardner, 1980],
and [Neimi & Riker]. [Taylor] is a readable recent book. The long list of cases
from recent American political history in [Poundstone] shows these paradoxes
are routinely manipulated in practice.
This Topic is largely drawn from [Zwicker]. (Authors Note: I would like
to thank Professor Zwicker for his kind and illuminating discussions.)
Exercises
1 Here is a reasonable way in which a voter could have a cyclic preference. Suppose
that this voter ranks each candidate on each of three criteria.
(a) Draw up a table with the rows labeled Democrat, Republican, and Third,
and the columns labeled character, experience, and policies. Inside each
column, rank some candidate as most preferred, rank another as in the middle,
and rank the remaining one as least preferred.
(b) In this ranking, is the Democrat preferred to the Republican in (at least) two
out of three criteria, or vice versa? Is the Republican preferred to the Third?
(c) Does the table that was just constructed have a cyclic preference order? If
not, make one that does.
So it is possible for a voter to have a cyclic preference among candidates. The
paradox described above, however, is that even if each voter has a straight-line
preference list, a cyclic preference can still arise for the entire group.
2 Compute the values in the table of decompositions.
3 Do the cancellations of opposite preference orders for the Political Science classs
mock election. Are all the remaining preferences from the left three rows of the
table or from the right?
4 The necessary condition that is proved above a voting paradox can happen only
if all three preference lists remaining after cancellation have the same spinis not
also sufficient.
(a) Continuing the positive cycle case considered in the proof, use the two inequalities 0 6 a b + c and 0 6 a + b + c to show that |a b| 6 c.
(b) Also show that c 6 a + b, and hence that |a b| 6 c 6 a + b.
(c) Give an example of a vote where there is a majority cycle, and addition of
one more voter with the same spin causes the cycle to go away.
148

(d) Can the opposite happen; can addition of one voter with a wrong spin cause
a cycle to appear?
(e) Give a condition that is both necessary and sufficient to get a majority cycle.
5 A one-voter election cannot have a majority cycle because of the requirement that
weve imposed that the voters list must be rational.
(a) Show that a two-voter election may have a majority cycle. (We consider the
group preference a majority cycle if all three group totals are nonnegative or if
all three are nonpositivethat is, we allow some zeros in the group preference.)
(b) Show that for any number of voters greater than one, there is an election
involving that many voters that results in a majority cycle.

6 Let U be a subspace of R3 . Prove that the set U = {~v ~v ~u = 0 for all ~u U }
of vectors that are perpendicular to each vector in U is also subspace of R3 . Does
this hold if U is not a subspace?
Topic
Dimensional Analysis
You cant add apples and oranges, the old saying goes. It reflects our experience
that in applications the quantities have units and keeping track of those units
can help with problems. Everyone has done calculations such as this one that
use the units as a check.
60
min
hr
day
sec
sec
60
24
365
= 31 536 000
min
hr
day
year
year
However, we can take the idea of including the units beyond bookkeeping. We
can use units to draw conclusions about what relationships are possible among
the physical quantities.
To start, consider the falling body equation distance = 16 (time)2 . If the
distance is in feet and the time is in seconds then this is a true statement.
However it is not correct in other unit systems, because 16 isnt the right
constant in those systems. We can fix that by attaching units to the 16, making
it a dimensional constant .
dist = 16
ft
(time)2
sec2
Now the equation holds also in the meter-second system because when we align
the units (a foot is approximately 0.30 meters),
distance in meters = 16
0.30 m
m
(time in sec)2 = 4.8
(time in sec)2
sec2
sec2
the constant gets adjusted. So, in order to look at equations that are correct
across unit systems, we restrict our attention to those that use dimensional
constants; such an equation is said to be complete.
Moving away from a specific unit system allows us to just say that we measure
all quantities here in combinations of some units of length L, mass M, and time T .
These three are our dimensions. For instance, we could measure velocity in
feet/second or fathoms/hour but at all events it involves a unit of length divided
by a unit of time so the dimensional formula of velocity is L/T . Similarly, we
could state densitys dimensional formula as M/L3 .
To write the dimensional formula we shall use negative exponents instead of
fractions and we shall include the dimensions with a zero exponent. Thus we
150
will write the dimensional formula of velocity as L1 M0 T 1 and that of density

as L3 M1 T 0 .
Thus, you cant add apples to oranges becomes the advice to check that
all of an equations terms have the same dimensional formula. An example is
this version of the falling body equation d gt2 = 0. The dimensional formula
of the d term is L1 M0 T 0 . For the other term, the dimensional formula of g
is L1 M0 T 2 (g is given above as 16 ft/sec2 ) and the dimensional formula of t
is L0 M0 T 1 so that of the entire gt2 term is L1 M0 T 2 (L0 M0 T 1 )2 = L1 M0 T 0 .
Thus the two terms have the same dimensional formula. An equation with this
property is dimensionally homogeneous.
Quantities with dimensional formula L0 M0 T 0 are dimensionless. For example, we measure an angle by taking the ratio of the subtended arc to the
radius
arc
r
which is the ratio of a length to a length (L1 M0 T 0 )(L1 M0 T 0 )1 and thus angles
have the dimensional formula L0 M0 T 0 .
The classic example of using the units for more than bookkeeping, using
them to draw conclusions, considers the formula for the period of a pendulum.
p = some expression involving the length of the string, etc.
The period is in units of time L0 M0 T 1 . So the quantities on the other side of
the equation must have dimensional formulas that combine in such a way that
their Ls and Ms cancel and only a single T remains. The table on page 151 has
the quantities that an experienced investigator would consider possibly relevant
to the period of a pendulum. The only dimensional formulas involving L are for
the length of the string and the acceleration due to gravity. For the Ls of these
two to cancel, when they appear in the equation they must be in ratio, e.g., as
(`/g)2 , or as cos(`/g), or as (`/g)1 . Therefore the period is a function of `/g.
This is a remarkable result: with a pencil and paper analysis, before we ever
took out the pendulum and made measurements, we have determined something
about what makes up its period.
To do dimensional analysis systematically, we need to know two things
(arguments for these are in [Bridgman], Chapter II and IV). The first is that
each equation relating physical quantities that we shall see involves a sum of
terms, where each term has the form
p2
pk
1
mp
1 m2 m k
for numbers m1 , . . . , mk that measure the quantities.

For the second, observe that an easy way to construct a dimensionally
homogeneous expression is by taking a product of dimensionless quantities
or by adding such dimensionless terms. Buckinghams Theorem states that
Topic: Dimensional Analysis
151
any complete relationship among quantities with dimensional formulas can be

algebraically manipulated into a form where there is some function f such that
f(1 , . . . , n ) = 0
for a complete set { 1 , . . . , n } of dimensionless products. (The first example
below describes what makes a set of dimensionless products complete.) We
usually want to express one of the quantities m1 for instance, in terms of the
others, and for that we will assume that the above equality can be rewritten
2
k
2 , . . . , n )
m1 = mp
mp
f(
2
k
pk
2
where 1 = m1 mp
2 mk is dimensionless and the products 2 , . . . , n dont
involve m1 (as with f, here f is just some function, this time of n 1 arguments).
Thus, to do dimensional analysis we should find which dimensionless products
are possible.
For example, consider again the formula for a pendulums period.
quantity
period p
length of string `
mass of bob m
acceleration due to gravity g
arc of swing
dimensional
formula
L0 M0 T 1
L1 M0 T 0
L0 M1 T 0
L1 M0 T 2
L0 M0 T 0
By the first fact cited above, we expect the formula to have (possibly sums of
terms of) the form pp1 `p2 mp3 gp4 p5 . To use the second fact, to find which
combinations of the powers p1 , . . . , p5 yield dimensionless products, consider
this equation.
(L0 M0 T 1 )p1 (L1 M0 T 0 )p2 (L0 M1 T 0 )p3 (L1 M0 T 2 )p4 (L0 M0 T 0 )p5 = L0 M0 T 0
It gives three conditions on the powers.
p2
p3
p1
+ p4 = 0
=0
2p4 = 0
Note that p3 = 0 so the mass of the bob does not affect the period. Gaussian
reduction and parametrization of that system gives this

p1
1
0
p 1/2
0
2

{ p 3 =
0 p1 + 0 p5 p1 , p5 R }

p4 1/2
0
p5
0
1
(weve taken p1 as one of the parameters in order to express the period in terms
of the other quantities).
152
The set of dimensionless products contains all terms pp1 `p2 mp3 ap4 p5
subject to the conditions above. This set forms a vector space under the +
operation of multiplying two such products and the operation of raising such
a product to the power of the scalar (see Exercise 5). The term complete set of
dimensionless products in Buckinghams Theorem means a basis for this vector
space.
We can get a basis by first taking p1 = 1, p5 = 0, and then taking p1 = 0,
p5 = 1. The associated dimensionless products are 1 = p`1/2 g1/2 and 2 = .
Because the set {1 , 2 } is complete, Buckinghams Theorem says that
p
= `/g f()
p = `1/2 g1/2 f()

where f is a function that we cannot determine from this analysis (a first year
physics text will show by other means that for small angles it is approximately
= 2).
the constant function f()
Thus, analysis of the relationships that are possible between the quantities
with the given dimensional formulas has given us a fair amount of information: a
pendulums period does not depend on the mass of the bob, and it rises with
the square root of the length of the string.
For the next example we try to determine the period of revolution of two
bodies in space orbiting each other under mutual gravitational attraction. An
experienced investigator could expect that these are the relevant quantities.
quantity
period p
mean separation r
first mass m1
second mass m2
gravitational constant G
dimensional
formula
L0 M0 T 1
L1 M0 T 0
L0 M1 T 0
L0 M1 T 0
L3 M1 T 2
To get the complete set of dimensionless products we consider the equation

(L0 M0 T 1 )p1 (L1 M0 T 0 )p2 (L0 M1 T 0 )p3 (L0 M1 T 0 )p4 (L3 M1 T 2 )p5 = L0 M0 T 0
which results in a system
p2
p1
+ 3p5 = 0
p3 + p4 p5 = 0
2p5 = 0
with this solution.

1
0
3/2
0

{ 1/2 p1 + 1 p4 p1 , p4 R}
1
0
1/2
0
153
As earlier, the set of dimensionless products of these quantities forms a

vector space and we want to produce a basis for that space, a complete set of
dimensionless products. One such set, gotten from setting p1 = 1 and p4 = 0
1/2
and also setting p1 = 0 and p4 = 1 is { 1 = pr3/2 m1 G1/2 , 2 = m1
1 m2 }.
With that, Buckinghams Theorem says that any complete relationship among
these quantities is stateable this form.
1/2
p = r3/2 m1
3/2
1 m2 ) = r
2 /m1 )
G1/2 f(m
f(m
1
Gm1
Remark. An important application of the prior formula is when m1 is the

mass of the sun and m2 is the mass of a planet. Because m1 is very much greater
than m2 , the argument to f is approximately 0, and we can wonder whether
this part of the formula remains approximately constant as m2 varies. One way
to see that it does is this. The sun is so much larger than the planet that the
mutual rotation is approximately about the suns center. If we vary the planets
mass m2 by a factor of x (e.g., Venuss mass is x = 0.815 times Earths mass),
then the force of attraction is multiplied by x, and x times the force acting on
x times the mass gives, since F = ma, the same acceleration, about the same
center (approximately). Hence, the orbit will be the same and so its period
will be the same, and thus the right side of the above equation also remains
2 /m1 ) is approximately constant as
unchanged (approximately). Therefore, f(m
m2 varies. This is Keplers Third Law: the square of the period of a planet is
proportional to the cube of the mean radius of its orbit about the sun.
The final example was one of the first explicit applications of dimensional
analysis. Lord Raleigh considered the speed of a wave in deep water and
suggested these as the relevant quantities.
quantity
velocity of the wave v
density of the water d
acceleration due to gravity g
wavelength
dimensional
formula
L1 M0 T 1
L3 M1 T 0
L1 M0 T 2
L1 M0 T 0
The equation
(L1 M0 T 1 )p1 (L3 M1 T 0 )p2 (L1 M0 T 2 )p3 (L1 M0 T 0 )p4 = L0 M0 T 0
gives this system
p1 3p2 + p3 + p4 = 0
p2
=0
p1
2p3
=0
with this solution space.
{
p1 p1 R }
1/2
1/2
154
There is one dimensionless product, 1 = vg1/2 1/2 , and so v is g times

a constant; f is constant since it is a function of no arguments. The quantity d
is not involved in the relationship.
The three examples above show that dimensional analysis can bring us far
toward expressing the relationship among the quantities. For further reading,
the classic reference is [Bridgman] this brief book is delightful. Another source
is [Giordano, Wells, Wilde]. A description of dimensional analysiss place in
modeling is in [Giordano, Jaye, Weir].
Exercises
1 [de Mestre] Consider a projectile, launched with initial velocity v0 , at an angle .
To study its motion we may guess that these are the relevant quantities.
dimensional
quantity formula
horizontal position x L1 M0 T 0
vertical position y L1 M0 T 0
initial speed v0 L1 M0 T 1
angle of launch L0 M0 T 0
acceleration due to gravity g L1 M0 T 2
time t L0 M0 T 1
(a) Show that { gt/v0 , gx/v20 , gy/v20 , } is a complete set of dimensionless products.
(Hint. One way to go is to find the appropriate free variables in the linear system
that arises but there is a shortcut that uses the properties of a basis.)
(b) These two equations of motion for projectiles are familiar: x = v0 cos()t and
y = v0 sin()t (g/2)t2 . Manipulate each to rewrite it as a relationship among
the dimensionless products of the prior item.
2 [Einstein] conjectured that the infrared characteristic frequencies of a solid maight
be determined by the same forces between atoms as determine the solids ordinary
elastic behavior. The relevant quantities are these.
dimensional
quantity formula
characteristic frequency L0 M0 T 1
compressibility k L1 M1 T 2
number of atoms per cubic cm N L3 M0 T 0
mass of an atom m L0 M1 T 0
Show that there is one dimensionless product. Conclude that, in any complete
relationship among quantities with these dimensional formulas, k is a constant
times 2 N1/3 m1 . This conclusion played an important role in the early study
of quantum phenomena.
3 [Giordano, Wells, Wilde] The torque produced by an engine has dimensional
formula L2 M1 T 2 . We may first guess that it depends on the engines rotation
rate (with dimensional formula L0 M0 T 1 ), and the volume of air displaced (with
dimensional formula L3 M0 T 0 ).
(a) Try to find a complete set of dimensionless products. What goes wrong?
(b) Adjust the guess by adding the density of the air (with dimensional formula
L3 M1 T 0 ). Now find a complete set of dimensionless products.
4 [Tilley] Dominoes falling make a wave. We may conjecture that the wave speed v
depends on the spacing d between the dominoes, the height h of each domino, and
the acceleration due to gravity g.
(a) Find the dimensional formula for each of the four quantities.
155
(b) Show that { 1 = h/d, 2 = dg/v2 } is a complete set of dimensionless products.

(c) Show that if h/d is fixed then the propagation speed is proportional to the
square root of d.
~ operation
5 Prove that the dimensionless products form a vector space under the +
of multiplying two such products and the ~ operation of raising such the product
to the power of the scalar. (The vector arrows are a precaution against confusion.)
That is, prove that, for any particular homogeneous system, this set of products of
powers of m1 , . . . , mk

p
p
{ m 1 . . . m k p1 , . . . , pk satisfy the system }
1
is a vector space under:

p
p +q1
~ m1 1 . . . m k k = m1 1
m1 1 . . . m k k +
p +qk
. . . mk k
and
p
rp1
r~(m1 1 . . . mkk ) = m1
rpk
. . . mk
(assume that all variables represent real numbers).

6 The advice about apples and oranges is not right. Consider the familiar equations
for a circle C = 2r and A = r2 .
(a) Check that C and A have different dimensional formulas.
(b) Produce an equation that is not dimensionally homogeneous (i.e., it adds
apples and oranges) but is nonetheless true of any circle.
(c) The prior item asks for an equation that is complete but not dimensionally
homogeneous. Produce an equation that is dimensionally homogeneous but not
complete.
(Just because the old saying isnt strictly right, doesnt keep it from being a
useful strategy. Dimensional homogeneity is often used to check the plausibility
of equations used in models. For an argument that any complete equation can
easily be made dimensionally homogeneous, see [Bridgman], Chapter I, especially
page 15.)
156
Chapter Three
Maps Between Spaces

I
Isomorphisms
In the examples following the definition of a vector space we expressed the idea
that some spaces are the same as others. For instance, the space of two-tall
column vectors and the space of two-wide row vectors are not equal because
their elements column vectors and row vectors are not equal, but we have
the idea that these spaces differ only in how their elements appear. We will now
make this intuition precise.
This section illustrates a common aspect of a mathematical investigation.
With the help of some examples, weve gotten an idea. We will next give a formal
definition and then we will produce some results backing our contention that
the definition captures the idea. Weve seen this happen already, for instance in
the first section of the Vector Space chapter. There, the study of linear systems
led us to consider collections closed under linear combinations. We defined such
a collection as a vector space and we followed it with some supporting results.
That definition wasnt an end point, instead it led to new insights such as the
idea of a basis. Here too, after producing a definition and supporting it, we will
get two surprises (pleasant ones). First, we will find that the definition applies
to some unforeseen, and interesting, cases. Second, the study of the definition
will lead to new ideas. In this way, our investigation will build momentum.
I.1
We start with two examples that suggest the right definition.

1.1 Example The space of two-wide row vectors and the space of two-tall column
vectors are the same in that if we associate the vectors that have the same
components, e.g.,
!
1
(1 2)
2
158
Chapter Three. Maps Between Spaces
then this correspondence preserves the operations, for instance this addition
!
!
!
1
3
4
(1 2) + (3 4) = (4 6)
+
=
2
4
6
and this scalar multiplication.
5 (1
2) = (5
10)
1
2
5
10
More generally stated, under the correspondence

(a0
a1 )
a0
a1
both operations are preserved:

(a0
a1 ) + (b0
b1 ) = (a0 + b0
a1 + b1 )
a0
a1
and
r (a0
a1 ) = (ra0
ra1 )
a0
a1
b0
b1
!
=
!
=
ra0
ra1
a0 + b0
a1 + b1
(all of the variables are real numbers).

1.2 Example Another two spaces we can think of as the same are P2 , the space
of quadratic polynomials, and R3 . A natural correspondence is this.

a0
1

a0 + a1 x + a2 x2 a1
(e.g., 1 + 2x + 3x2 2)
a2
3
This preserves structure: corresponding elements add in a corresponding way

a0 + a1 x + a2 x2
a0
b0
a0 + b0

+ b0 + b1 x + b2 x2 a1 + b1 = a1 + b1
a2
b2
a2 + b2
(a0 + b0 ) + (a1 + b1 )x + (a2 + b2 )x2
and scalar multiplication also corresponds.
r (a0 + a1 x + a2 x2 ) = (ra0 ) + (ra1 )x + (ra2 )x2
a0
ra0

r a1 = ra1
a2
ra2
1.3 Definition An isomorphism between two vector spaces V and W is a map

f : V W that
(1) is a correspondence: f is one-to-one and onto;
Section I. Isomorphisms
159
(2) preserves structure: if ~v1 ,~v2 V then

f(~v1 + ~v2 ) = f(~v1 ) + f(~v2 )
and if ~v V and r R then
f(r~v) = rf(~v)
W, read V is isomorphic to W, when such a map exists).
(we write V =
(Morphism means map, so isomorphism means a map expressing sameness.)

1.4 Example The vector space G = {c1 cos + c2 sin c1 , c2 R } of functions
of is isomorphic to the vector space R2 under this map.
f
c1 cos + c2 sin 7
c1
c2
We will check this by going through the conditions in the definition.

We will first verify condition (1), that the map is a correspondence between
the sets underlying the spaces.
To establish that f is one-to-one, we must prove that f(~
a) = f(~b) only when
~
a
~ = b. If
f(a1 cos + a2 sin ) = f(b1 cos + b2 sin )
then, by the definition of f,
a1
a2
!
=
b1
b2
from which we can conclude that a1 = b1 and a2 = b2 because column vectors

are equal only when they have equal components.
To check that f is onto we must prove that any member of the codomain R2
is the image of some member of the domain G. But thats clear since
x
y
is the image under f of x cos + y sin .

Next we will verify condition (2), that f preserves structure.
More
information on one-to-one and onto maps is in the appendix.
160

This computation shows that f preserves addition.
f (a1 cos + a2 sin ) + (b1 cos + b2 sin )
= f (a1 + b1 ) cos + (a2 + b2 ) sin

!
a1 + b1
=
a2 + b2
!
!
a1
b1
=
+
a2
b2
= f(a1 cos + a2 sin ) + f(b1 cos + b2 sin )

A similar computation shows that f preserves scalar multiplication.

f r (a1 cos + a2 sin ) = f( ra1 cos + ra2 sin )
!
ra1
=
ra2
!
a1
=r
a2
= r f(a1 cos + a2 sin )
With that, conditions (1) and (2) are verified, so we know that f is an
R2 .
isomorphism and we can say that the spaces are isomorphic G =

1.5 Example Let V be the space {c1 x + c2 y + c3 z c1 , c2 , c3 R } of linear combinations of three variables x, y, and z, under the natural addition and scalar
multiplication operations. Then V is isomorphic to P2 , the space of quadratic
polynomials.
To show this we will produce an isomorphism map. There is more than one
possibility; for instance, here are four.
c1 x + c2 y + c3 z
1
7
c1 + c2 x + c3 x2
f2
c2 + c3 x + c1 x2
f3
c1 c2 x c3 x2
f4
c1 + (c1 + c2 )x + (c1 + c3 )x2
7
7
7
The first map is the more natural correspondence in that it just carries the
coefficients over. However, below we shall verify that the second one is an
isomorphism, to underline that there are isomorphisms other than just the
obvious one (showing that f1 is an isomorphism is Exercise 13).
To show that f2 is one-to-one, we will prove that if f2 (c1 x + c2 y + c3 z) =
f2 (d1 x + d2 y + d3 z) then c1 x + c2 y + c3 z = d1 x + d2 y + d3 z. The assumption
that f2 (c1 x + c2 y + c3 z) = f2 (d1 x + d2 y + d3 z) gives, by the definition of f2 , that
c2 + c3 x + c1 x2 = d2 + d3 x + d1 x2 . Equal polynomials have equal coefficients,
so c2 = d2 , c3 = d3 , and c1 = d1 . Therefore f2 is one-to-one.
161
The map f2 is onto because any member a + bx + cx2 of the codomain is

the image of a member of the domain, namely cx + ay + bz. For instance,
2 + 3x 4x2 is f2 (4x + 2y + 3z).
The computations for structure preservation are like those in the prior
example. This map preserves addition

f2 (c1 x + c2 y + c3 z) + (d1 x + d2 y + d3 z)

= f2 (c1 + d1 )x + (c2 + d2 )y + (c3 + d3 )z
= (c2 + d2 ) + (c3 + d3 )x + (c1 + d1 )x2
= (c2 + c3 x + c1 x2 ) + (d2 + d3 x + d1 x2 )
= f2 (c1 x + c2 y + c3 z) + f2 (d1 x + d2 y + d3 z)
and scalar multiplication.

f2 r (c1 x + c2 y + c3 z) = f2 (rc1 x + rc2 y + rc3 z)
= rc2 + rc3 x + rc1 x2
= r (c2 + c3 x + c1 x2 )
= r f2 (c1 x + c2 y + c3 z)
P2 .
Thus f2 is an isomorphism and we write V =
Every space is isomorphic to itself under the identity map.
1.6 Definition An automorphism is an isomorphism of a space with itself.
1.7 Example A dilation map ds : R2 R2 that multiplies all vectors by a nonzero
scalar s is an automorphism of R2 .
d1.5 (~
u)
d1.5
u
~
d1.5 (~
v)
~
v
A rotation or turning map t : R2 R2 that rotates all vectors through an

angle is an automorphism.
t/6
t/6 (~
u)
u
~
A third type of automorphism of R2 is a map f` : R2 R2 that flips or reflects

all vectors over a line ` through the origin.
f` (~
u)
u
~
f`
162
Checking that these are automorphisms is Exercise 30.

1.8 Example Consider the space P5 of polynomials of degree 5 or less and the
map f that sends a polynomial p(x) to p(x 1). For instance, under this map
x2 7 (x 1)2 = x2 2x + 1 and x3 + 2x 7 (x 1)3 + 2(x 1) = x3 3x2 + 5x 3.
This map is an automorphism of this space; the check is Exercise 22.
This isomorphism of P5 with itself does more than just tell us that the space
is the same as itself. It gives us some insight into the spaces structure. For
instance, below is shown a family of parabolas, graphs of members of P5 . Each
has a vertex at y = 1, and the left-most one has zeroes at 2.25 and 1.75,
the next one has zeroes at 1.25 and 0.75, etc.
p0
p1
Substitution of x 1 for x in any functions argument shifts its graph to the

right by one. Thus, f(p0 ) = p1 . Notice that the picture before f is applied is the
same as the picture after f is applied because while each parabola moves to the
right, another one comes in from the left to take its place. This also holds true
for cubics, etc. So the automorphism f expresses the idea that P5 has a certain
horizontal-homogeneity, that this space looks the same near x = 1 as near x = 0.
As described in the opening to this section, having given the definition of
isomorphism, we next support the contention that it captures our intuition of
vector spaces being the same. Of course, the definition itself is persuasive: a
vector space consists of a set and some structure and the definition simply
requires that the sets correspond and that the structures correspond also. Also
persuasive are the examples above, such as Example 1.1 giving the isomorphism
between the space of two-wide row vectors and the space of two-tall column
vectors, which dramatize that isomorphic spaces are the same in all relevant
W, that W is just V painted
respects. Sometimes people say, where V =
green differences are merely cosmetic.
The results below further support our contention that under an isomorphism
all the things of interest in the two vector spaces correspond. Because we
introduced vector spaces to study linear combinations, of interest means
pertaining to linear combinations. Not of interest is the way that the vectors
are presented typographically (or their color!).
1.9 Lemma An isomorphism maps a zero vector to a zero vector.
Proof Where f : V W is an isomorphism, fix any ~v V. Then f(~0V ) =
f(0 ~v) = 0 f(~v) = ~0W .
QED
163
1.10 Lemma For any map f : V W between vector spaces these statements are
equivalent.
(1) f preserves structure
f(~v1 + ~v2 ) = f(~v1 ) + f(~v2 )
and f(c~v) = c f(~v)
(2) f preserves linear combinations of two vectors

f(c1~v1 + c2~v2 ) = c1 f(~v1 ) + c2 f(~v2 )
(3) f preserves linear combinations of any finite number of vectors
f(c1~v1 + + cn~vn ) = c1 f(~v1 ) + + cn f(~vn )
Proof Since the implications (3) = (2) and (2) = (1) are clear, we need
only show that (1) = (3). Assume statement (1). We will prove statement (3)
by induction on the number of summands n.
The one-summand base case, that f(c~v1 ) = c f(~v1 ), is covered by the assumption of statement (1).
For the inductive step assume that statement (3) holds whenever there are k
or fewer summands, that is, whenever n = 1, or n = 2, . . . , or n = k. Consider
the k + 1-summand case. Use the first half of (1) to breaking the sum along the
final +.
f(c1~v1 + + ck~vk + ck+1~vk+1 ) = f(c1~v1 + + ck~vk ) + f(ck+1~vk+1 )
Use the inductive hypothesis to break up the k-term sum on the left.
= f(c1~v1 ) + + f(ck~vk ) + f(ck+1~vk+1 )
Now the second half of (1) gives
= c1 f(~v1 ) + + ck f(~vk ) + ck+1 f(~vk+1 )
when applied k + 1 times.
QED
Using item (2) is a standard way to verify that a map preserves structure.
We close with a summary. In the prior chapter, after giving the definition
of a vector space, we looked at examples and some of them seemed to be
and have argued
essentially the same. Here we have defined the relation =
that it is the right way to say precisely what we mean by the same because it
preserves the features of interest in a vector space in particular, it preserves
linear combinations. In the next section we will show that isomorphism is an
equivalence relation and so partitions the collection of vector spaces into cases.
Exercises
X 1.11 Verify, using Example 1.4 as a model, that the two correspondences given before
the definition are isomorphisms.
164

(a) Example 1.1
(b) Example 1.2
X 1.12 For the map f : P1 R2 given by

f
a + bx 7

ab
b
Find the image of each of these elements of the domain.

(a) 3 2x
(b) 2 + 2x
(c) x
Show that this map is an isomorphism.
1.13 Show that the natural map f1 from Example 1.5 is an isomorphism.
X 1.14 Decide whether each map is an isomorphism (if it is an isomorphism then prove
it and if it isnt then state a condition that it fails to satisfy).
(a) f : M22 R given by

a b
7 ad bc
c d
(b) f : M22 R4 given by
a+b+c+d
a+b+c
a+b
a

a
c
b
d
(c) f : M22 P3 given by

a b
7 c + (d + c)x + (b + a)x2 + ax3
c d
(d) f : M22 P3 given by

a b
7 c + (d + c)x + (b + a + 1)x2 + ax3
c d
1.15 Show that the map f : R1 R1 given by f(x) = x3 is one-to-one and onto. Is it
an isomorphism?
X 1.16 Refer to Example 1.1. Produce two more isomorphisms (of course, you must
also verify that they satisfy the conditions in the definition of isomorphism).
1.17 Refer to Example 1.2. Produce two more isomorphisms (and verify that they
satisfy the conditions).
X 1.18 Show that, although R2 is not itself a subspace of R3 , it is isomorphic to the
xy-plane subspace of R3 .
1.19 Find two isomorphisms between R16 and M44 .
X 1.20 For what k is Mmn isomorphic to Rk ?
1.21 For what k is Pk isomorphic to Rn ?
1.22 Prove that the map in Example 1.8, from P5 to P5 given by p(x) 7 p(x 1),
is a vector space isomorphism.
1.23 Why, in Lemma 1.9, must there be a ~v V? That is, why must V be nonempty?
1.24 Are any two trivial spaces isomorphic?
1.25 In the proof of Lemma 1.10, what about the zero-summands case (that is, if n
is zero)?
1.26 Show that any isomorphism f : P0 R1 has the form a 7 ka for some nonzero
real number k.
X 1.27 These prove that isomorphism is an equivalence relation.
(a) Show that the identity map id : V V is an isomorphism. Thus, any vector
space is isomorphic to itself.
165
(b) Show that if f : V W is an isomorphism then so is its inverse f1 : W V.

Thus, if V is isomorphic to W then also W is isomorphic to V.
(c) Show that a composition of isomorphisms is an isomorphism: if f : V W is
an isomorphism and g : W U is an isomorphism then so also is g f : V U.
Thus, if V is isomorphic to W and W is isomorphic to U, then also V is isomorphic
to U.
1.28 Suppose that f : V W preserves structure. Show that f is one-to-one if and
only if the unique member of V mapped by f to ~0W is ~0V .
1.29 Suppose that f : V W is an isomorphism. Prove that the set {~v1 , . . . ,~vk } V
is linearly dependent if and only if the set of images { f(~v1 ), . . . , f(~vk ) } W is
linearly dependent.
X 1.30 Show that each type of map from Example 1.7 is an automorphism.
(a) Dilation ds by a nonzero scalar s.
(b) Rotation t through an angle .
(c) Reflection f` over a line through the origin.
Hint. For the second and third items, polar coordinates are useful.
1.31 Produce an automorphism of P2 other than the identity map, and other than a
shift map p(x) 7 p(x k).
1.32 (a) Show that a function f : R1 R1 is an automorphism if and only if it has
the form x 7 kx for some k 6= 0.
(b) Let f be an automorphism of R1 such that f(3) = 7. Find f(2).
(c) Show that a function f : R2 R2 is an automorphism if and only if it has the
form

x
ax + by
7
y
cx + dy
for some a, b, c, d R with ad bc 6= 0. Hint. Exercises in prior subsections
have shown that

a
b
is not a multiple of
d
c
if and only if ad bc 6= 0.
(d) Let f be an automorphism of R2 with

1
2
1
0
f(
)=
and f(
)=
.
3
1
4
1
Find

0
f(
).
1
1.33 Refer to Lemma 1.9 and Lemma 1.10. Find two more things preserved by
isomorphism.
1.34 We show that isomorphisms can be tailored to fit in that, sometimes, given
vectors in the domain and in the range we can produce an isomorphism associating
those vectors.
~ 1,
~ 2,
~ 3 i be a basis for P2 so that any ~p P2 has a unique
(a) Let B = h
~ 1 + c2
~ 2 + c3
~ 3 , which we denote in this way.
representation as ~p = c1

c1
RepB (~p) = c2
c3
Show that the RepB () operation is a function from P2 to R3 (this entails showing
that with every domain vector ~v P2 there is an associated image vector in R3 ,
and further, that with every domain vector ~v P2 there is at most one associated
image vector).
166

(b) Show that this RepB () function is one-to-one and onto.
(c) Show that it preserves structure.
(d) Produce an isomorphism from P2 to R3 that fits these specifications.

1
0
x + x2 7 0 and 1 x 7 1
0
0
1.35 Prove that a space is n-dimensional if and only if it is isomorphic to Rn . Hint.

Fix a basis B for the space and consider the map sending a vector over to its
representation with respect to B.
1.36 (Requires the subsection on Combining Subspaces, which is optional.) Let
U and W be vector
spaces. Define a new vector space, consisting of the set

U W = { (~u, w
~ ) ~u U and w
~ W } along with these operations.
(~u1 , w
~ 1 ) + (~u2 , w
~ 2 ) = (~u1 + ~u2 , w
~1+w
~ 2)
and
r (~u, w
~ ) = (r~u, r~
w)
This is a vector space, the external direct sum of U and W.

(a) Check that it is a vector space.
(b) Find a basis for, and the dimension of, the external direct sum P2 R2 .
(c) What is the relationship among dim(U), dim(W), and dim(U W)?
(d) Suppose that U and W are subspaces of a vector space V such that V = U W
(in this case we say that V is the internal direct sum of U and W). Show that
the map f : U W V given by
f
(~u, w
~ ) 7 ~u + w
~
is an isomorphism. Thus if the internal direct sum is defined then the internal
and external direct sums are isomorphic.
I.2
Dimension Characterizes Isomorphism
In the prior subsection, after stating the definition of an isomorphism, we gave

some results supporting the intuition that such a map describes spaces as the
same. Here we will develop this intuition. When two spaces that are isomorphic
are not equal, we think of them as almost equal, as equivalent. We shall show
that the relationship is isomorphic to is an equivalence relation.
2.1 Lemma The inverse of an isomorphism is also an isomorphism.
Proof Suppose that V is isomorphic to W via f : V W. Because an isomor-
phism is a correspondence, f has an inverse function f1 : W V that is also a

correspondence.
To finish we will show that because f preserves linear combinations, so also
More information on equivalence relations and equivalence classes is in the appendix.

More information on inverse functions is in the appendix.
167
does f1 . Let w
~ 1 = f(~v1 ) and w
~ 2 = f(~v2 )
f1 (c1 w
~ 1 + c2 w
~ 2 ) = f1 c1 f(~v1 ) + c2 f(~v2 )

= f1 ( f c1~v1 + c2~v2 )
= c1~v1 + c2~v2
= c1 f1 (~
w1 ) + c2 f1 (~
w2 )
since f1 (~
w1 ) = ~v1 and f1 (~
w2 ) = ~v2 . With that, by Lemma 1.10 this map
preserves structure.
QED
2.2 Theorem Isomorphism is an equivalence relation between vector spaces.
Proof We must prove that the relation is symmetric, reflexive, and transitive.
To check reflexivity, that any space is isomorphic to itself, consider the

identity map. It is clearly one-to-one and onto. This calculation shows that it
also preserves linear combinations.
id(c1 ~v1 + c2 ~v2 ) = c1~v1 + c2~v2 = c1 id(~v1 ) + c2 id(~v2 )
Symmetry, that if V is isomorphic to W then also W is isomorphic to V,
holds by Lemma 2.1 since an isomprphism map from V to W is paired with an
isomorphism from W to V.
Finally, we must check transitivity, that if V is isomorphic to W and if W is
isomorphic to U then also V is isomorphic to U. Let f : V W and g : W U
be isomorphisms and consider the composition g f : V U. The composition of
correspondences is a correspondence so we need only check that the composition
preserves linear combinations.

g f c1 ~v1 + c2 ~v2 = g f(c1 ~v1 + c2 ~v2 )
= g c1 f(~v1 ) + c2 f(~v2 )
= c1 g f(~v1 )) + c2 g(f(~v2 )
= c1 (g f) (~v1 ) + c2 (g f) (~v2 )
Thus the composition is an isomorphism.
QED
Therefore, isomorphism partitions the universe of vector spaces into classes.

Every space is in one and only one isomorphism class.
All finite dimensional
vector spaces:
W
V=
V
W
...
2.3 Theorem Vector spaces are isomorphic if and only if they have the same
dimension.
168

Weve broken the proof into two halves.
2.4 Lemma If spaces are isomorphic then they have the same dimension.
Proof We shall show that an isomorphism of two spaces gives a correspon-
dence between their bases. That is, we shall show that if f : V W is an

~ 1, . . . ,
~ n i, then the image
isomorphism and a basis for the domain V is B = h
~
~
set D = hf(1 ), . . . , f(n )i is a basis for the codomain W. The other half of
the correspondence that for any basis of W the inverse image is a basis for
V follows from Lemma 2.1, that if f is an isomorphism then f1 is also an
isomorphism, and applying the prior sentence to f1 .
To see that D spans W, fix any w
~ W, note that f is onto and so there is a
~v V with w
~ = f(~v), and expand ~v as a combination of basis vectors.
~ 1 + + vn
~ n ) = v1 f(
~ 1 ) + + vn f(
~ n)
w
~ = f(~v) = f(v1
For linear independence of D, if
~0W = c1 f(
~ 1 ) + + cn f(
~ n ) = f(c1
~ 1 + + cn
~ n)
then, since f is one-to-one and so the only vector sent to ~0W is ~0V , we have that
~0V = c1
~ 1 + + cn
~ n , implying that all of the cs are zero.
QED
2.5 Lemma If spaces have the same dimension then they are isomorphic.
Proof We will prove that any space of dimension n is isomorphic to Rn . Then
we will have that all such spaces are isomorphic to each other by transitivity,
which was shown in Theorem 2.2.
~ 1, . . . ,
~ n i for the domain V.
Let V be n-dimensional. Fix a basis B = h
Consider the operation of representing the members of V with respect to B as a
function from V to Rn .

v1
RepB .
~
~
~v = v1 1 + + vn n 7 ..
vn
(It is well-defined since every ~v has one and only one such representation
see Remark 2.6 below).
This function is one-to-one because if
~ 1 + + un
~ n ) = RepB (v1
~ 1 + + vn
~ n)
RepB (u1
then

u1
v1
.. ..
. = .
un
vn
More information on well-defined is in the appendix.
169
~1 +
and so u1 = v1 , . . . , un = vn , implying that the original arguments u1
~
~
~
+ un n and v1 1 + + vn n are equal.
This function is onto; any member of Rn

w1
..
w
~ = .
wn
~ 1 + + wn
~ n ).
is the image of some ~v V, namely w
~ = RepB (w1
Finally, this function preserves structure.
~ 1 + + (run + svn )
~n )
RepB (r ~u + s ~v) = RepB ( (ru1 + sv1 )
ru1 + sv1
..
=
.
run + svn

u1
v1
..
..
=r . +s .
un
vn
= r RepB (~u) + s RepB (~v)
Thus, the RepB function is an isomorphism and therefore any n-dimensional
space is isomorphic to Rn .
QED
2.6 Remark The parenthetical comment in that proof about the role played by
the one and only one representation result can do with some amplification. A
contrasting example, where an association doesnt have this property, will help
illuminate the issue. Consider this subset of P2 , which is not a basis.
A = {1 + 0x + 0x2 , 0 + 1x + 0x2 , 0 + 0x + 1x2 , 1 + 1x + 2x2 }
Call those polynomials
~ 1, . . . ,
~ 4 . If, as in the proof, we try to write the
members of P2 as ~p = c1
~ 1 + c2
~ 2 + c3
~ 3 + c4
~ 4 in order to associate ~p with
the 4-tall vector with components c1 , . . . , c4 then we have a problem. For,
consider ~p(x) = 1 + x + x2 . Both
~p(x) = 1~
1 + 1~
2 + 1~
3 + 0~
4
and ~p(x) = 0~
1 + 0~
2 1~
3 + 1~
4
so we are trying to associate ~p with more than one 4-tall vector

1
0
1
0

and
1
1
1
0
(of course, ~ps decomposition is not unique because A is not linearly independent).
That is, the input ~p is not associated with a well-defined i.e., unique output
value.
170
In general, any time that we define a function we must check that output
values are well-defined. In the above proof we must check that for a fixed B each
vector in the domain is associated by RepB with one and only one vector in the
codomain. That check is Exercise 19.
We say that the isomorphism classes are characterized by dimension because
we can describe each class simply by giving the number that is the dimension of
all of the spaces in that class.
2.7 Corollary A finite-dimensional vector space is isomorphic to one and only one
of the Rn .
This gives us a collection of representatives of the isomorphism classes.
All finite dimensional
vector spaces:
? R0
? R2
? R3
...
One representative
per class
? R1
The proofs above pack many ideas into a small space. Through the rest of
this chapter well consider these ideas again, and fill them out. For a taste of
this, we will expand here on the proof of Lemma 2.5.
2.8 Example The space M22 of 22
basis for the domain
!
1 0
0
B=h
,
0 0
0
matrices is isomorphic to R4 . With this

!
1
0
,
0
1
!
0
0
,
0
0
!
0
i
1
the isomorphism given in the lemma, the representation map f1 = RepB , carries
the entries over.

a
!
a b f1
b
7
c
c d
d
One way to think of the map f1 is: fix the basis B for the domain and the basis
~ 1 with ~e1 , and
~ 2 with ~e2 , etc. Then
E4 for the codomain, and associate
extend this association to all of the members of two spaces.

a
!
b
a b
f1
~ 1 + b
~ 2 + c
~ 3 + d
~ 4 7 a~e1 + b~e2 + c~e3 + d~e4 =
= a
c
c d
d
We say that the map has been extended linearly from the bases to the spaces.
We can do the same thing with different bases, for instance, taking this basis
for the domain.
!
!
!
!
2 0
0 2
0 0
0 0
A=h
,
,
,
i
0 0
0 0
2 0
0 2
171
Associating corresponding members of A and E4 and extending linearly

!
a b
= (a/2)~
1 + (b/2)~
2 + (c/2)~
3 + (d/2)~
4
c d
a/2
b/2
f2
7
(a/2)~e1 + (b/2)~e2 + (c/2)~e3 + (d/2)~e4 =
c/2
d/2
gives rise to an isomorphism that is different than f1 .
The prior map arose by changing the basis for the domain. We can also
change the basis for the codomain. Starting with

1
0
0
0
0 1 0 0

B and D = h , , , i
0 0 0 1
0
0
1
0
~ 1 with ~1 , etc., and then linearly extending that correspondence to
associating
all of the two spaces

a
!
a b
b
3
~ 1 + b
~ 2 + c
~ 3 + d
~ 4 7f
= a
a~1 + b~2 + c~3 + d~4 =
d
c d
c
gives still another isomorphism.
We close this section with a summary. Recall that in the first chapter we
defined two matrices as row equivalent if they can be derived from each other
by elementary row operations. We showed that is an equivalence relation and so
the collection of matrices is partitioned into classes, where all the matrices that
are row equivalent fall together into a single class. Then, for insight into which
matrices are in each class, we gave representatives for the classes, the reduced
echelon form matrices.
In this section we have followed that outline, except that the appropriate notion of sameness here is vector space isomorphism. First we defined isomorphism,
saw some examples, and established some properties. As before, we developed
a list of class representatives to help us understand the partition. It is just a
classification of spaces by dimension.
In the second chapter, with the definition of vector spaces, we seemed to
have opened up our studies to many examples of new structures besides the
familiar Rn s. We now know that isnt the case. Any finite-dimensional vector
space is actually the same as a real space. We are thus considering exactly the
structures that we need to consider.
Exercises
X 2.9 Decide if the spaces are isomorphic.
172

(a) R2 , R4
(b) P5 , R5
(e) M2k , Ck
(c) M23 , R6
(d) P5 , M23
X 2.10 Consider the isomorphism RepB () : P1 R2 where B = h1, 1 + xi. Find the
image of each of these elements of the domain.
(a) 3 2x;
(b) 2 + 2x;
(c) x
X 2.11 Show that if m 6= n then Rm =
6 Rn .
Mnm ?
X 2.12 Is Mmn =
X 2.13 Are any two planes through the origin in R3 isomorphic?
2.14 Find a set of equivalence class representatives other than the set of Rn s.
2.15 True or false: between any n-dimensional space and Rn there is exactly one
isomorphism.
2.16 Can a vector space be isomorphic to one of its (proper) subspaces?
X 2.17 This subsection shows that for any isomorphism, the inverse map is also an
isomorphism. This subsection also shows that for a fixed basis B of an n-dimensional
vector space V, the map RepB : V Rn is an isomorphism. Find the inverse of
this map.
X 2.18 Prove these facts about matrices.
(a) The row space of a matrix is isomorphic to the column space of its transpose.
(b) The row space of a matrix is isomorphic to its column space.
2.19 Show that the function from Theorem 2.3 is well-defined.
2.20 Is the proof of Theorem 2.3 valid when n = 0?
2.21 For each,
decide if it is a set of isomorphism class representatives.

(a) { Ck k N }

(b) { Pk k { 1, 0, 1, . . . } }

(c) { Mmn m, n N }
2.22 Let f be a correspondence between vector spaces V and W (that is, a map that
is one-to-one and onto). Show that the spaces V and W are isomorphic via f if and
only if there are bases B V and D W such that corresponding vectors have the
same coordinates: RepB (~v) = RepD (f(~v)).
2.23 Consider the isomorphism RepB : P3 R4 .
(a) Vectors in a real space are orthogonal if and only if their dot product is zero.
Give a definition of orthogonality for polynomials.
(b) The derivative of a member of P3 is in P3 . Give a definition of the derivative
of a vector in R4 .
X 2.24 Does every correspondence between bases, when extended to the spaces, give
an isomorphism?
2.25 (Requires the subsection on Combining Subspaces, which is optional.) Suppose that V = V1 V2 and that V is isomorphic to the space U under the map f.
Show that U = f(V1 ) f(U2 ).
2.26 Show that this is not a well-defined function from the rational numbers to the
integers: with each fraction, associate the value of its numerator.
Section II. Homomorphisms
II
173
Homomorphisms
The definition of isomorphism has two conditions. In this section we will consider
the second one. We will study maps that are required only to preserve structure,
maps that are not also required to be correspondences.
Experience shows that these maps are tremendously useful. For one thing
we shall see in the second subsection below that while isomorphisms describe
how spaces are the same, we can think of these maps as describe how spaces are
alike.
II.1
Definition
1.1 Definition A function between vector spaces h : V W that preserves the

operations of addition
if ~v1 ,~v2 V then h(~v1 + ~v2 ) = h(~v1 ) + h(~v2 )
and scalar multiplication
if ~v V and r R then h(r ~v) = r h(~v)
is a homomorphism or linear map.
1.2 Example The projection map : R3 R2

!
x
x

y 7
y
z
is a homomorphism. It preserves addition

!
x1
x2
x1 + x2
x1
x2
x1 + x2

(y1 + y2 ) = (y1 + y2 ) =
= (y1 ) + (y2 )
y1 + y2
z1
z2
z 1 + z2
z1
z2
and scalar multiplication.

x1
rx1

(r y1 ) = (ry1 ) =
z1
rz1
rx1
ry1
x1

= r (y1 )
z1
This is not an isomorphism since it is not one-to-one. For instance, both ~0 and
~e3 in R3 map to the zero vector in R2 .
1.3 Example Of course, the domain and codomain can be other than spaces
of column vectors. Both of these are homomorphisms; the verifications are
straightforward.
174
(1) f1 : P2 P3 given by
a0 + a1 x + a2 x2 7 a0 x + (a1 /2)x2 + (a2 /3)x3
(2) f2 : M22 R given by
a
c
b
d
!
7 a + d
1.4 Example Between any two spaces there is a zero homomorphism, mapping
every vector in the domain to the zero vector in the codomain.
1.5 Example These two suggest why we use the term linear map.
(1) The map g : R3 R given by

x
g
y 7 3x + 2y 4.5z
z
: R3 R
is linear, that is, is a homomorphism. In contrast, the map g
given by

x
g
y 7 3x + 2y 4.5z + 1
z
is not.

0
1

(0 + 0) = 4
g
0
0

0
1

(0) + g
(0) = 5
g
0
0
To show that a map is not linear we need only produce a single linear
combination that the map does not preserve.
(2) The first of these two maps t1 , t2 : R3 R2 is linear while the second is
not.

!
!
x
x
5x 2y
5x 2y
t1
t2
7
y 7
y
x+y
xy
z
z
Finding a linear combination that the second map does not preserve is
easy.
The homomorphisms have coordinate functions that are linear combinations of
the arguments.
Any isomorphism is a homomorphism, since an isomorphism is a homomorphism that is also a correspondence. So one way to think of homomorphism is
as a generalization of isomorphism motivated by the observation that many
of the properties of isomorphisms have only to do with the maps structure
175
preservation property and not to do with being a correspondence. The next

two results are examples of that thinking. The proof for each given in the prior
section does not use one-to-one-ness or onto-ness and therefore applies here.
1.6 Lemma A homomorphism sends a zero vector to a zero vector.
1.7 Lemma For any map f : V W between vector spaces, the following are
equivalent.
(1) f is a homomorphism
(2) f(c1 ~v1 + c2 ~v2 ) = c1 f(~v1 ) + c2 f(~v2 ) for any c1 , c2 R and ~v1 ,~v2 V
(3) f(c1 ~v1 + + cn ~vn ) = c1 f(~v1 ) + + cn f(~vn ) for any c1 , . . . , cn R
and ~v1 , . . . ,~vn V
1.8 Example The function f : R2 R4 given by
x/2
!
x
f 0
7
x + y
y
3y
is linear since it satisfies item (2).
r1 (x1 /2) + r2 (x2 /2)

x1 /2
x2 /2
0
0
0
= r1
+ r2
r1 (x1 + y1 ) + r2 (x2 + y2 )
x1 + y1
x2 + y2
r1 (3y1 ) + r2 (3y2 )
3y1
3y2
However, some of the things that we have seen for isomorphisms fail to hold
for homomorphisms in general. One example is the proof of Lemma I.2.4, which
shows that an isomorphism between spaces gives a correspondence between
their bases. Homomorphisms do not give any such correspondence; Example 1.2
shows this and another example is the zero map between two nontrivial spaces.
Instead, for homomorphisms a weaker but still very useful result holds.
~ 1, . . . ,
~ ni
1.9 Theorem A homomorphism is determined by its action on a basis: if h
is a basis of a vector space V and w
~ 1, . . . , w
~ n are elements of a vector space W
(perhaps not distinct elements) then there exists a homomorphism from V to W
~ i to w
sending each
~ i , and that homomorphism is unique.
~ i with w
Proof We will define the map by associating each
~ i and then extending
linearly to all of the domain. That is, given the input ~v, we find its coordinates
~ 1 + + cn
~ n and define the associated
with respect to the basis ~v = c1
output by using the same ci coordinates h(~v) = c1 w
~ 1 + + cn w
~ n . This is a
well-defined function because, with respect to the basis, the representation of
each domain vector ~v is unique.
176
This map is a homomorphism since it preserves linear combinations; where

~ 1 + + cn
~ n and v~2 = d1
~ 1 + + dn
~ n then we have this.
v~1 = c1
~ 1 + + (r1 cn + r2 dn )
~ n)
h(r1~v1 + r2~v2 ) = h((r1 c1 + r2 d1 )
= (r1 c1 + r2 d1 )~
w1 + + (r1 cn + r2 dn )~
wn
= r1 h(~v1 ) + r2 h(~v2 )
: V W is another homomorphism satisfying
This map is unique since if h

agree on all of the vectors in the
~ i) = w
~ i for each i, then h and h
that h(
domain.
v) = h(c
1

~ 1 + + cn
~ n ) = c1 h(
~ 1 ) + + cn h(
~ n)
h(~
= c1 w
~ 1 + + cn w
~ n = h(~v)
are the same map.
Thus, h and h
QED
2
1.10 Example If we specify a map h : R R

E2 in this way
!
!
1
1
h(
)=
h(
0
1
that acts on the standard basis
!
0
)=
1
4
4
then we have also specified the action of h on any other member of the domain.
For instance, the value of h on this argument
!
!
!
!
!
!
3
1
0
1
0
5
h(
) = h(3
2
) = 3 h(
) 2 h(
)=
2
0
1
0
1
5
is a direct consequence of the value of h on the basis vectors.
So we can construct a homomorphism by selecting a basis for the domain
and specifying where the map sends those basis vectors. The prior lemma shows
that we can always extend the action on the map linearly to the entire domain.
Later in this chapter we shall develop a convenient scheme for computations like
this one, using matrices.
Just as the isomorphisms of a space with itself are useful and interesting, so
too are the homomorphisms of a space with itself.
1.11 Definition A linear map from a space into itself t : V V is a linear transformation.
1.12 Remark In this book we use linear transformation only in the case where
the codomain equals the domain but it is often used instead as a synonym for
homomorphism.
1.13 Example The map on R2 that projects all vectors down to the x-axis
!
!
x
x
7
y
0
is a linear transformation.
177
1.14 Example The derivative map d/dx : Pn Pn

d/dx
a0 + a1 x + + an xn 7 a1 + 2a2 x + 3a3 x2 + + nan xn1

is a linear transformation as this result from calculus shows: d(c1 f + c2 g)/dx =
c1 (df/dx) + c2 (dg/dx).
1.15 Example The matrix transpose operation
!
!
a b
a c
7
c d
b d
is a linear transformation of M22 . (Transpose is one-to-one and onto and so in
fact it is an automorphism.)
We finish this subsection about maps by recalling that we can linearly combine
maps. For instance, for these maps from R2 to itself
!
!
!
!
x
2x
x
0
g
f
7
and
7
y
3x 2y
y
5x
the linear combination 5f 2g is also a map from R2 to itself.
!
!
x 5f2g
10x
7
y
5x 10y
1.16 Lemma For vector spaces V and W, the set of linear functions from V to
W is itself a vector space, a subspace of the space of all functions from V to W.
We denote the space of linear maps by L(V, W).
Proof This set is non-empty because it contains the zero homomorphism. So
to show that it is a subspace we need only check that it is closed under the
operations. Let f, g : V W be linear. Then the sum of the two is linear
(f + g)(c1~v1 + c2~v2 ) = f(c1~v1 + c2~v2 ) + g(c1~v1 + c2~v2 )
= c1 f(~v1 ) + c2 f(~v2 ) + c1 g(~v1 ) + c2 g(~v2 )

= c1 f + g (~v1 ) + c2 f + g (~v2 )
and any scalar multiple of a map is also linear.
(r f)(c1~v1 + c2~v2 ) = r(c1 f(~v1 ) + c2 f(~v2 ))
= c1 (r f)(~v1 ) + c2 (r f)(~v2 )
Hence L(V, W) is a subspace.
QED
We started this section by defining homomorphisms as a generalization

of isomorphisms, isolating the structure preservation property. Some of the
properties of isomorphisms carried over unchanged while we adapted others.
178
However, if we thereby get an impression that the idea of homomorphism

is in some way secondary to that of isomorphism then that is mistaken. In the
rest of this chapter we shall work mostly with homomorphisms. This is partly
because any statement made about homomorphisms is automatically true about
isomorphisms but more because, while the isomorphism concept is more natural,
experience shows that the homomorphism concept is more fruitful and more
central to further progress.
Exercises
3
2
X 1.17 Decide
ifeach h : R R is linear.

x
x
x
x
0
1
(a) h(y) =
(b) h(y) =
(c) h(y) =
x+y+z
0
1
z
z
z

x
2x + y
(d) h(y) =
3y 4z
z
X 1.18 Decide if each map h : M22 R is linear.

a b
(a) h(
)=a+d
c d

a b
(b) h(
) = ad bc
c d

a b
) = 2a + 3b + c d
(c) h(
c d

a b
(d) h(
) = a2 + b2
c d
X 1.19 Show that these two maps are homomorphisms.
(a) d/dx : P3 P2 given by a0 + a1 x + a2 x2 + a3 x3 maps to a1 + 2a2 x + 3a3 x2
R
(b) : P2 P3 given by b0 + b1 x + b2 x2 maps to b0 x + (b1 /2)x2 + (b2 /3)x3
Are these maps inverse to each other?
1.20 Is (perpendicular) projection from R3 to the xz-plane a homomorphism? Projection to the yz-plane? To the x-axis? The y-axis? The z-axis? Projection to the
origin?
1.21 Show that, while the maps from Example 1.3 preserve linear operations, they
are not isomorphisms.
1.22 Is an identity map a linear transformation?
X 1.23 Stating that a function is linear is different than stating that its graph is a
line.
(a) The function f1 : R R given by f1 (x) = 2x 1 has a graph that is a line.
Show that it is not a linear function.
(b) The function f2 : R2 R given by

x
7 x + 2y
y
does not have a graph that is a line. Show that it is a linear function.
X 1.24 Part of the definition of a linear function is that it respects addition. Does a
linear function respect subtraction?
~ 1, . . . ,
~ n i is a basis
1.25 Assume that h is a linear transformation of V and that h
of V. Prove each statement.
~ i ) = ~0 for each basis vector then h is the zero map.
(a) If h(
179
~ i) =
~ i for each basis vector then h is the identity map.
(b) If h(
~ i ) = r
~ i for each basis vector then h(~v) = r~v
(c) If there is a scalar r such that h(
for all vectors in V.
X 1.26 Consider the vector space R+ where vector addition and scalar multiplication
are not the ones inherited from R but rather are these: a + b is the product of
a and b, and r a is the r-th power of a. (This was shown to be a vector space
in an earlier exercise.) Verify that the natural logarithm map ln : R+ R is a
homomorphism between these two spaces. Is it an isomorphism?
X 1.27 Consider this transformation of R2 .

x
x/2
7
y
y/3
Find the image under this map of this ellipse.

x 2
{
(x /4) + (y2 /9) = 1 }
y
X 1.28 Imagine a rope wound around the earths equator so that it fits snugly (suppose
that the earth is a sphere). How much extra rope must we add to raise the circle
to a constant six feet off the ground?
X 1.29 Verify that this map h : R3 R

x
x
3
y 7 y 1 = 3x y z
z
z
1
is linear. Generalize.
1.30 Show that every homomorphism from R1 to R1 acts via multiplication by a
scalar. Conclude that every nontrivial linear transformation of R1 is an isomorphism.
Is that true for transformations of R2 ? Rn ?
1.31 (a) Show that for any scalars a1,1 , . . . , am,n this map h : Rn Rm is a homomorphism.
x1
a1,1 x1 + + a1,n xn
.
..
. 7
.
.
xn
am,1 x1 + + am,n xn
(b) Show that for each i, the i-th derivative operator di /dxi is a linear
formation of Pn . Conclude that for any scalars ck , . . . , c0 this map is a
transformation of that space.
dk
dk1
d
f 7
f
+
c
f + + c1 f + c0 f
k1
dxk
dxk1
dx
1.32 Lemma 1.16 shows that a sum of linear functions is linear and that a
multiple of a linear function is linear. Show also that a composition of
functions is linear.
translinear
scalar
linear
X 1.33 Where f : V W is linear, suppose that f(~v1 ) = w

~ 1 , . . . , f(~vn ) = w
~ n for some
vectors w
~ 1, . . . , w
~ n from W.
(a) If the set of w
~ s is independent, must the set of ~v s also be independent?
(b) If the set of ~v s is independent, must the set of w
~ s also be independent?
(c) If the set of w
~ s spans W, must the set of ~v s span V?
(d) If the set of ~v s spans V, must the set of w
~ s span W?
1.34 Generalize Example 1.15 by proving that for every appropriate domain and
codomain the matrix transpose map is linear. What are the appropriate domains
and codomains?
180
1.35 (a) Where ~u,~v Rn , by definition the line segment connecting them is the set
` = { t ~u + (1 t) ~v t [0..1] }. Show that the image, under a homomorphism
h, of the segment between ~u and ~v is the segment between h(~u) and h(~v).
(b) A subset of Rn is convex if, for any two points in that set, the line segment
joining them lies entirely in that set. (The inside of a sphere is convex while the
skin of a sphere is not.) Prove that linear maps from Rn to Rm preserve the
property of set convexity.
X 1.36 Let h : Rn Rm be a homomorphism.
(a) Show that the image under h of a line in Rn is a (possibly degenerate) line in
Rm .
(b) What happens to a k-dimensional linear surface?
1.37 Prove that the restriction of a homomorphism to a subspace of its domain is
another homomorphism.
1.38 Assume that h : V W is linear.

(a) Show that the range space of this map { h(~v) ~v V } is a subspace of the
codomain W.

(b) Show that the null space of this map {~v V h(~v) = ~0W } is a subspace of the
domain V.

(c) Show that if U is a subspace of the domain V then its image { h(~u) ~u U } is
a subspace of the codomain W. This generalizes the first item.
(d) Generalize the second item.
1.39 Consider the set of isomorphisms from a vector space to itself. Is this a subspace
of the space L(V, V) of homomorphisms from the space to itself?
~ 1, . . . ,
~ n i is a basis? That is, can we still get a
1.40 Does Theorem 1.9 need that h
well-defined and unique homomorphism if we drop either the condition that the
~ be linearly independent, or the condition that it span the domain?
set of s
1.41 Let V be a vector space and assume that the maps f1 , f2 : V R1 are linear.
(a) Define a map F : V R2 whose component functions are the given linear ones.

f1 (~v)
~v 7
f2 (~v)
Show that F is linear.
(b) Does the converse hold is any linear map from V to R2 made up of two
linear component maps to R1 ?
(c) Generalize.
II.2
Range space and Null space
Isomorphisms and homomorphisms both preserve structure. The difference is

that homomorphisms are subject to fewer restrictions because they neednt
be onto and neednt be one-to-one. We will examine what can happen with
homomorphisms that cannot happen with isomorphisms.
We first consider the effect of not requiring that a homomorphism be onto
its codomain. Of course, each homomorphism is onto some set, namely its range.
181
For example, the injection map : R2 R3

!
x
x

7 y
y
0
is a homomorphism that is not onto. But, is onto the xy-plane subset of R3 .
2.1 Lemma Under a homomorphism, the image of any subspace of the domain is
a subspace of the codomain. In particular, the image of the entire space, the
range of the homomorphism, is a subspace of the codomain.
Proof Let h : V W be linear and let S be a subspace of the domain V. The
image h(S) is a subset of the codomain W, which is nonempty because S is

nonempty. Thus, to show that h(S) is a subspace of W we need only show that
it is closed under linear combinations of two vectors. If h(~s1 ) and h(~s2 ) are
members of h(S) then c1 h(~s1 )+c2 h(~s2 ) = h(c1 ~s1 )+h(c2 ~s2 ) = h(c1 ~s1 +c2 ~s2 )
is also a member of h(S) because it is the image of c1 ~s1 + c2 ~s2 from S. QED
2.2 Definition The range space of a homomorphism h : V W is

R(h) = {h(~v) ~v V }
sometimes denoted h(V). The dimension of the range space is the maps rank.
We shall soon see the connection between the rank of a map and the rank of a
matrix.
2.3 Example For the derivative map d/dx : P3 P3 given by a0 + a1 x + a2 x2 +
a3 x3 7 a1 + 2a2 x + 3a3 x2 the range space R(d/dx) is the set of quadratic
polynomials {r + sx + tx2 r, s, t R}. Thus, this maps rank is 3.
2.4 Example With this homomorphism h : M22 P3
!
a b
7 (a + b + 2d) + cx2 + cx3
c d
an image vector in the range can have any constant term, must have an x
coefficient of zero, and must have the same
coefficient of x2 as of x3 . That is,

the range space is R(h) = {r + sx2 + sx3 r, s R } and so the rank is 2.
The prior result shows that, in passing from the definition of isomorphism to
the more general definition of homomorphism, omitting the onto requirement
doesnt make an essential difference. Any homomorphism is onto its range space.
However, omitting the one-to-one condition does make a difference. A
homomorphism may have many elements of the domain that map to one element
of the codomain. Below is a bean sketch of a many-to-one map between
sets. It shows three elements of the codomain that are each the image of many
members of the domain.
More information on many-to-one maps is in the appendix.
182
Recall that for any function h : V W, the set

of elements of V that map to
w
~ W is the inverse image h1 (~
w) = {~v V h(~v) = w
~ }. Above, the left side
shows three inverse image sets.
2.5 Example Consider the projection : R3 R2

!
x
x

y 7
y
z
which is a homomorphism that is many-to-one. An inverse image set is a vertical
line of vectors in the domain.
R2
R3
w
~
One example is this.

1
1

1 (
) = { 3 z R }
3
z
!
2.6 Example This homomorphism h : R2 R1

!
x
h
7 x + y
y
is also many-to-one. For a fixed w R1 , the inverse image h1 (w)
R2
R1
w
is the set of plane vectors whose components add to w.

In generalizing from isomorphisms to homomorphisms by dropping the oneto-one condition, we lose the property that weve stated intuitively as that
the domain is the same as the range. We lose that the domain corresponds
perfectly to the range. What we retain, as the examples below illustrate, is that
a homomorphism describes how the domain is like or analogous to the range.
183
2.7 Example We think of R3 as like R2 except that vectors have an extra

component. That is, we think of the vector with components x, y, and z as
somehow like the vector with components x and y. In defining the projection
map , we make precise which members of the domain we are thinking of as
related to which members of the codomain.
To understanding how the preservation conditions in the definition of homomorphism show that the domain elements are like the codomain elements,
we start by picturing R2 as the xy-plane inside of R3 . (Of course, R2 is not
the xy plane inside of R3 since the xy plane is a set of three-tall vectors with
a third component of zero, but there is a natural correspondence.) Then the
preservation of addition property says that vectors in R3 act like their shadows
in the plane.

x1
x2
x1 + y1
x
x
x1 + x2
1
2
y1 above
plus y2 above
equals y1 + y2 above
y1
y2
y1 + y2
z1
z2
z1 + z2
Thinking of (~v) as the shadow of ~v in the plane gives this restatement: the
sum of the shadows (~v1 ) + (~v2 ) equals the shadow of the sum (~v1 + ~v2 ).
Preservation of scalar multiplication is similar.
Redrawing by showing the codomain R2 on the right gives a picture that is
uglier but is more faithful to the bean sketch.
w
~2
w
~1 +w
~2
w
~1
Again, the domain vectors that map to w

~ 1 lie in a vertical line; the picture
shows one in gray. Call any member of this inverse image 1 (~
w1 ) a w
~ 1 vector.
Similarly, there is a vertical line of w
~ 2 vectors and a vertical line of w
~1+
w
~ 2 vectors. Now, saying that is a homomorphism is recognizing that if
(~v1 ) = w
~ 1 and (~v2 ) = w
~ 2 then (~v1 + ~v2 ) = (~v1 ) + (~v2 ) = w
~1+w
~ 2 . That
is, the classes add: any w
~ 1 vector plus any w
~ 2 vector equals a w
~1+w
~ 2 vector.
Scalar multiplication is similar.
So although R3 and R2 are not isomorphic describes a way in which they
are alike: vectors in R3 add as do the associated vectors in R2 vectors add as
their shadows add.
2.8 Example A homomorphism can express an analogy between spaces that is
184
more subtle than the prior one. For the map from Example 2.6
!
x
h
7 x + y
y
fix two numbers w1 , w2 in the range R. A ~v1 that maps to w1 has components
that add to w1 , so the inverse image h1 (w1 ) is the set of vectors with endpoint
on the diagonal line x + y = w1 . Think of these as w1 vectors. Similarly we
have w2 vectors and w1 + w2 vectors. The addition preservation property
says this.
~
v1 + ~
v2
~
v1
a w1 vector
~
v2
plus
a w2 vector
equals
a w1 + w2 vector
Restated, if we add a w1 vector to a w2 vector then h maps the result to a

w1 + w2 vector. Briefly, the sum of the images is the image of the sum. Even
more briefly, h(~v1 ) + h(~v2 ) = h(~v1 + ~v2 ).
2.9 Example The inverse images can be structures other than lines. For the linear
map h : R3 R2

!
x
x

y 7
x
z
the inverse image sets are planes x = 0, x = 1, etc., perpendicular to the x-axis.
We wont describe how every homomorphism that we will use is an analogy

because the formal sense that we make of alike in that . . . is a homomorphism
exists such that . . . . Nonetheless, the idea that a homomorphism between two
spaces expresses how the domains vectors fall into classes that act like the
ranges vectors is a good way to view homomorphisms.
Another reason that we wont treat all of the homomorphisms that we see as
above is that many vector spaces are hard to draw, e.g., a space of polynomials.
But there is nothing wrong with leveraging those spaces that we can draw. We
derive two insights from the three examples 2.7, 2.8, and 2.9.
The first insight is that in all three examples the inverse image of the ranges
zero vector is a line or plane through the origin, a subspace of the domain.
185
2.10 Lemma For any homomorphism, the inverse image of a subspace of the
range is a subspace of the domain. In particular, the inverse image of the trivial
subspace of the range is a subspace of the domain.
2.11 Remark The examples above consider inverse images of
single vectors but
this result is about inverse images of sets h1 (S) = {~v V h(~v) S}. We use
the same term in both cases by defining the inverse image of a single element
h1 (~
w) as the inverse image of the one-element set h1 ({ w
~ }).
Proof Let h : V W be a homomorphism and let S be a subspace of the
range space of h. Consider the inverse image of S. It is nonempty because it

contains ~0V , since h(~0V ) = ~0W and ~0W is an element of S, as S is a subspace.
To finish we show that it is closed under linear combinations. Let ~v1 and ~v2
be two elements of h1 (S). Then h(~v1 ) and h(~v2 ) are elements of S. That
implies that c1~v1 + c2~v2 is an element of the inverse image h1 (S) because
h(c1~v1 + c2~v2 ) = c1 h(~v1 ) + c2 h(~v2 ) is a member of S.
QED
2.12 Definition The null space or kernel of a linear map h : V W is the inverse
image of ~0W .

N (h) = h1 (~0W ) = {~v V h(~v) = ~0W }
The dimension of the null space is the maps nullity.
0V
0W
2.13 Example The map

from Example 2.3 has this null space N (d/dx) =
{a0 + 0x + 0x2 + 0x3 a0 R} so its nullity is 1.
2.14 Example The map from Example 2.4 has this null space and nullity 2.
!

a
b
a, b R }
N (h) = {
0 (a + b)/2
Now for the second insight from the above pictures. In Example 2.7 each of
the vertical lines squashes down to a single point in passing from the domain
to the range, takes all of these one-dimensional vertical lines and maps them to
a point, leaving the range one dimension smaller than the domain. Similarly, in
Example 2.8 the two-dimensional domain compresses to a one-dimensional range
by breaking the domain into the diagonal lines and maps each of those to a single
member of the range. Finally, in Example 2.9 the domain breaks into planes
which get squashed to a point and so the map starts with a three-dimensional
domain but ends with a one-dimensional range. (In this third example the
codomain is two-dimensional but the range of the map is only one-dimensional
and it is the dimension of the range that matters.)
186
2.15 Theorem A linear maps rank plus its nullity equals the dimension of its
domain.
~ 1, . . . ,
~ k i be a basis for
Proof Let h : V W be linear and let BN = h
~ 1, . . . ,
~ k,
~ k+1 , . . . ,
~ n i for
the null space. Expand that to a basis BV = h
the entire domain, using Corollary Two.III.2.12. We shall show that BR =
~ k+1 ), . . . , h(
~ n )i is a basis for the range space. With that, counting the
hh(
size of these bases gives the result.
~ k+1 ) + +
To see that BR is linearly independent, consider ~0W = ck+1 h(
~ n ). The function is linear so we have ~0W = h(ck+1
~ k+1 + + cn
~ n)
cn h(
~ k+1 + + cn
~ n is in the null space of h. As BN is a basis
and therefore ck+1
for the null space there are scalars c1 , . . . , ck satisfying this relationship.
~ 1 + + ck
~ k = ck+1
~ k+1 + + cn
~n
c1
But this is an equation among the members of BV , which is a basis for V, so
each ci equals 0. Therefore BR is linearly independent.
To show that BR spans the range space, consider h(~v) R(h) and write ~v as
~ 1 + + cn
~ n of members of BV . This gives h(~v) =
a linear combination ~v = c1
~
~
~
~ k ) + ck+1 h(
~ k+1 ) + + cn h(
~ n)
h(c1 1 + + cn n ) = c1 h(1 ) + + ck h(
~ 1, . . . ,
~ k are in the null space, we have that h(~v) = ~0 + + ~0 +
and since
~
~ n ). Thus, h(~v) is a linear combination of members
ck+1 h(k+1 ) + + cn h(
of BR , and so BR spans the range space.
QED
2.16 Example Where h : R3 R4 is

x
x

h 0
y 7
y
z
0
the range space and null space are

a
0

R(h) = { a, b R}
b
0
and

0

N (h) = { 0 z R}
z
and so the rank of h is 2 while the nullity is 1.

2.17 Example If t : R R is the linear transformation x 7 4x, then the range
is R(t) = R1 . The rank is 1 and the nullity is 0.
2.18 Corollary The rank of a linear map is less than or equal to the dimension of
the domain. Equality holds if and only if the nullity of the map is 0.
We know that an isomorphism exists between two spaces if and only if the
dimension of the range equals the dimension of the domain. We have now seen
187
that for a homomorphism to exist a necessary condition is that the dimension of

the range must be less than or equal to the dimension of the domain. For instance,
there is no homomorphism from R2 onto R3 . There are many homomorphisms
from R2 into R3 , but none onto.
The range space of a linear map can be of dimension strictly less than the
dimension of the domain and so linearly independent sets in the domain may
map to linearly dependent sets in the range. (Example 2.3s derivative transformation on P3 has a domain of dimension 4 but a range of dimension 3 and the
derivative sends {1, x, x2 , x3 } to {0, 1, 2x, 3x2 }). That is, under a homomorphism
independence may be lost. In contrast, dependence stays.
2.19 Lemma Under a linear map, the image of a linearly dependent set is linearly
dependent.
Proof Suppose that c1~v1 + + cn~vn = ~0V with some ci nonzero. Apply h to
both sides: h(c1~v1 + + cn~vn ) = c1 h(~v1 ) + + cn h(~vn ) and h(~0V ) = ~0W .

Thus we have c1 h(~v1 ) + + cn h(~vn ) = ~0W with some ci nonzero.
QED
When is independence not lost? The obvious sufficient condition is when
the homomorphism is an isomorphism. This condition is also necessary; see
Exercise 35. We will finish this subsection comparing homomorphisms with
isomorphisms by observing that a one-to-one homomorphism is an isomorphism
from its domain onto its range.
2.20 Example This one-to-one homomorphism : R2 R3

!
x
x

7 y
y
0
gives a correspondence between R2 and the xy-plane subset of R3 .
2.21 Theorem In an n-dimensional vector space V, these are equivalent statements

about a linear map h : V W.
(1) h is one-to-one
(2) h has an inverse from its range to its domain that is linear
(3) N (h) = {~0 }, that is, nullity(h) = 0
(4) rank(h) = n
~ 1, . . . ,
~ n i is a basis for V then hh(
~ 1 ), . . . , h(
~ n )i is a basis for R(h)
(5) if h
Proof We will first show that (1) (2). We will then show that (1) =
(3) = (4) = (5) = (2).

For (1) = (2), suppose that the linear map h is one-to-one and so has an
inverse h1 : R(h) V. The domain of that inverse is the range of h and thus
a linear combination of two members of it has the form c1 h(~v1 ) + c2 h(~v2 ). On
188
that combination, the inverse h1 gives this.

h1 (c1 h(~v1 ) + c2 h(~v2 )) = h1 (h(c1~v1 + c2~v2 ))
= h1 h (c1~v1 + c2~v2 )
= c1~v1 + c2~v2
= c1 h1 (h(~v1 )) + c2 h1 (h(~v2 ))
Thus if a linear map has an inverse, then the inverse must be linear. But this also
gives the (2) = (1) implication, because the inverse itself must be one-to-one.
Of the remaining implications, (1) = (3) holds because any homomorphism
maps ~0V to ~0W , but a one-to-one map sends at most one member of V to ~0W .
Next, (3) = (4) is true since rank plus nullity equals the dimension of the
domain.
~ 1 ), . . . , h(
~ n )i is a basis for the range
For (4) = (5), to show that hh(
space we need only show that it is a spanning set, because by assumption
the range has dimension n. Consider h(~v) R(h). Expressing ~v as a linear
~ 1 + c2
~ 2 + + cn
~ n ),
combination of basis elements produces h(~v) = h(c1
~ 1 ) + + cn h(
~ n ), as desired.
which gives that h(~v) = c1 h(
~ 1, . . . ,
~ n i is a basis
Finally, for the (5) = (2) implication, assume that h
~ 1 ), . . . , h(
~ n )i is a basis for R(h). Then every w
for V so that hh(
~ R(h) has
~
~
the unique representation w
~ = c1 h(1 ) + + cn h(n ). Define a map from
R(h) to V by
~ 1 + c2
~ 2 + + cn
~n
w
~ 7 c1
(uniqueness of the representation makes this well-defined). Checking that it is
linear and that it is the inverse of h are easy.
QED
We have now seen that a linear map expresses how the structure of the
domain is like that of the range. We can think of such a map as organizing the
domain space into inverse images of points in the range. In the special case that
the map is one-to-one, each inverse image is a single point and the map is an
isomorphism between the domain and the range.
Exercises
X 2.22 Let h : P3 P4 be given by p(x) 7 x p(x). Which of these are in the null
space? Which are in the range space?
(a) x3
(b) 0
(c) 7
(d) 12x 0.5x3
(e) 1 + 3x2 x3
X 2.23 Find the null space, nullity, range space, and rank of each map.
(a) h : R2 P3 given by

a
7 a + ax + ax2
b
(b) h : M22 R given by

a
c
b
d

7 a + d
(c) h : M22 P2 given by

a
c
b
d
7 a + b + c + dx2
189
(d) the zero map Z : R3 R4

X 2.24 Find the nullity of each map.
(b) h : P3 P3 of rank one
(a) h : R5 R8 of rank five
(c) h : R6 R3 , an onto map
(d) h : M33 M33 , onto
X 2.25 What is the null space of the differentiation transformation d/dx : Pn Pn ?
What is the null space of the second derivative, as a transformation of Pn ? The
k-th derivative?
2.26 Example 2.7 restates the first condition in the definition of homomorphism as
the shadow of a sum is the sum of the shadows. Restate the second condition in
the same style.
2.27 For the homomorphism h : P3 P3 given by h(a0 + a1 x + a2 x2 + a3 x3 ) =
a0 + (a0 + a1 )x + (a2 + a3 )x3 find these.
(a) N (h)
(b) h1 (2 x3 )
(c) h1 (1 + x2 )
2
X 2.28 For the map f : R R given by

x
f(
) = 2x + y
y
sketch these inverse image sets: f1 (3), f1 (0), and f1 (1).
X 2.29 Each of these transformations of P3 is one-to-one. Find the inverse of each.
(a) a0 + a1 x + a2 x2 + a3 x3 7 a0 + a1 x + 2a2 x2 + 3a3 x3
(b) a0 + a1 x + a2 x2 + a3 x3 7 a0 + a2 x + a1 x2 + a3 x3
(c) a0 + a1 x + a2 x2 + a3 x3 7 a1 + a2 x + a3 x2 + a0 x3
(d) a0 +a1 x+a2 x2 +a3 x3 7 a0 +(a0 +a1 )x+(a0 +a1 +a2 )x2 +(a0 +a1 +a2 +a3 )x3
2.30 Describe the null space and range space of a transformation given by ~v 7 2~v.
2.31 List all pairs (rank(h), nullity(h)) that are possible for linear maps from R5 to
R3 .
2.32 Does the differentiation map d/dx : Pn Pn have an inverse?
X 2.33 Find the nullity of the map h : Pn R given by
Z x=1
a0 + a1 x + + an xn 7
a0 + a1 x + + an xn dx.
x=0
2.34 (a) Prove that a homomorphism is onto if and only if its rank equals the
dimension of its codomain.
(b) Conclude that a homomorphism between vector spaces with the same dimension is one-to-one if and only if it is onto.
2.35 Show that a linear map is one-to-one if and only if it preserves linear independence.
2.36 Corollary 2.18 says that for there to be an onto homomorphism from a vector
space V to a vector space W, it is necessary that the dimension of W be less
than or equal to the dimension of V. Prove that this condition is also sufficient;
use Theorem 1.9 to show that if the dimension of W is less than or equal to the
dimension of V, then there is a homomorphism from V to W that is onto.
X 2.37 Recall that the null space is a subset of the domain and the range space is a
subset of the codomain. Are they necessarily distinct? Is there a homomorphism
that has a nontrivial intersection of its null space and its range space?
2.38 Prove that the image of a span equals the span of the images. That is, where
h : V W is linear, prove that if S is a subset of V then h([S]) equals [h(S)]. This
generalizes
Lemma 2.1 since it shows that if U is any subspace of V then its image

{ h(~u) ~u U } is a subspace of W, because the span of the set U is U.
190
X 2.39 (a) Prove that for any linear map h : V W and any w
~ W, the set h1 (~
w)
has the form

{~v + n
~ n
~ N (h) }
for ~v V with h(~v) = w
~ (if h is not onto then this set may be empty). Such a
set is a coset of N (h) and we denote it as ~v + N (h).
(b) Consider the map t : R2 R2 given by

x
ax + by
t
7
y
cx + dy
for some scalars a, b, c, and d. Prove that t is linear.
(c) Conclude from the prior two items that for any linear system of the form
ax + by = e
cx + dy = f
we can write the solution set (the vectors are members of R2 )

{~p + ~h ~h satisfies the associated homogeneous system }
where ~p is a particular solution of that linear system (if there is no particular
solution then the above set is empty).
(d) Show that this map h : Rn Rm is linear

x1
a1,1 x1 + + a1,n xn
.
..
. 7
.
.
xn
am,1 x1 + + am,n xn
for any scalars a1,1 , . . . , am,n . Extend the conclusion made in the prior item.
(e) Show that the k-th derivative map is a linear transformation of Pn for each k.
Prove that this map is a linear transformation of that space
dk
dk1
d
f 7
f
+
c
f + + c1 f + c0 f
k1
dxk
dxk1
dx
for any scalars ck , . . . , c0 . Draw a conclusion as above.
2.40 Prove that for any transformation t : V V that is rank one, the map given by
composing the operator with itself t t : V V satisfies t t = r t for some real
number r.
2.41 Let h : V R be a homomorphism, but not the zero homomorphism. Prove
~ 1, . . . ,
~ n i is a basis for the null space and if ~v V is not in the null space
that if h
~ 1, . . . ,
~ n i is a basis for the entire domain V.
then h~v,
2.42 Show that for any space V of dimension n, the dual space

L(V, R) = { h : V R h is linear }
V.
is isomorphic to Rn . It is often denoted V . Conclude that V =
2.43 Show that any linear map is the sum of maps of rank one.
2.44 Is is homomorphic to an equivalence relation? (Hint: the difficulty is to decide
on an appropriate meaning for the quoted phrase.)
2.45 Show that the range spaces and null spaces of powers of linear maps t : V V
form descending
V R(t) R(t2 ) . . .
and ascending
{~0 } N (t) N (t2 ) . . .
chains. Also show that if k is such that R(tk ) = R(tk+1 ) then all following range
spaces are equal: R(tk ) = R(tk+1 ) = R(tk+2 ) . . . . Similarly, if N (tk ) = N (tk+1 )
then N (tk ) = N (tk+1 ) = N (tk+2 ) = . . . .
Section III. Computing Linear Maps
III
191
Computing Linear Maps
The prior section shows that a linear map is determined by its action on a basis.
The equation
~ 1 + + cn
~ n ) = c1 h(
~ 1 ) + + cn h(
~ n)
h(~v) = h(c1
describes how we get the value of the map on any vector ~v by starting from the
~ i in a basis and extending linearly.
value of the map on the vectors
~ 1 ),
This section gives a convenient scheme to use the representations of h(
~ n ) to compute, from the representation of a vector in the domain
. . . , h(
RepB (~v), the representation of that vectors image in the codomain RepD (h(~v)).
III.1
Representing Linear Maps with Matrices
1.1 Example For the spaces R2 and R3 fix

!
B=h
2
1
,
i
0
4
and

1
0
1

D = h0 , 2 , 0i
0
0
1
as the bases. Consider the map h : R2 R3 with this action.
2
0

1
h
7 1
1
4

1
h
7 2
To compute the action of this map on any vector at all from the domain we first
~ 1)
express, with respect to the codomains basis, h(

0
1
1
1

1
1 = 0 0 2 + 1 0
2
0
1
1
0
~ 1 )) =
RepD (h(
1/2
1
so
~ 2 ).
and h(

1
0
1
1

=
1
1
+
0
2
0
2

0

1
0
0
0
so
~ 2 )) =
RepD (h(
1
0
192
~ i )s.
Then for any member ~v of the domain we can compute h(~v) using the h(
!
!
2
1
h(~v) = h(c1
+ c2
)
0
4
!
!
2
1
= c1 h(
) + c2 h(
)
0
4

0
1
1
0
1
1

1
= c1 (0 0 2 + 1 0) + c2 (1 0 1 2 + 0 0)
2
0
1
0
0
1
0

1
0
1
1

= (0c1 + 1c2 ) 0 + ( c1 1c2 ) 2 + (1c1 + 0c2 ) 0
2
0
0
1
Thus,
if RepB (~v) =
c1
c2
0c1 + 1c2
then RepD ( h(~v) ) = (1/2)c1 1c2 .

1c1 + 0c2
For instance,
!
since RepB (
4
)=
8
1
2
2
4
we have RepD ( h(
) ) = 5/2.
8
1
!
We express computations like the one above with a matrix notation.
!
0
1
0c1 + 1c2
c1
= (1/2)c1 1c2
1/2 1
c2
B
1
0
1c1 + 0c2
B,D
In the middle is the argument ~v to the map, represented with respect to the
domains basis B by the column vector with components c1 and c2 . On the
right is the value of the map on that argument h(~v), represented with respect to
the codomains basis D. The matrix on the left is the new thing. We will use it
to represent the map and we will think of the above equation as representing an
application of the map to the matrix.
That matrix consists of the coefficients from the vector on the right, 0 and
1 from the first row, 1/2 and 1 from the second row, and 1 and 0 from the
~ i )s.
third row. That is, we make it by adjoining the vectors representing the h(
..
.
RepD ( h(
~ 1) )
..
.
..
.
~ 2) )
RepD ( h(
..
.
193
1.2 Definition Suppose that V and W are vector spaces of dimensions n and m
with bases B and D, and that h : V W is a linear map. If
h1,1
h1,n
h2,1
h2,n
~ n )) =
~ 1 )) =
RepD (h(
...
RepD (h(
..
..
.
.
hm,1
then
hm,n
h1,1
h2,1
RepB,D (h) =
hm,1
h1,2
h2,2
..
.
hm,2
h1,n
h2,n
hm,n B,D
...
...
...
is the matrix representation of h with respect to B, D.

In that matrix the number of columns n is the dimension of the maps domain
while the number of rows m is the dimension of the codomain.
We use lower case letters for a map, upper case for the matrix, and lower case
again for the entries of the matrix. Thus for the map h, the matrix representing
it is H, with entries hi,j .
1.3 Example If h : R3 P1 is

a1
h
a2 7 (2a1 + a2 ) + (a3 )x
a3
then where

0
0
2

B = h0 , 2 , 0i
1
0
0
the action of h on B is this.

0
h
0 7 x
1
D = h1 + x, 1 + xi
and

2
h
0 7 4
0

0
h
2 7 2
0
A simple calculation
RepD (x) =
1/2
1/2
!
RepD (2) =
D
1
1
!
RepD (4) =
D
2
2
shows that this is the matrix representing h with respect to the bases.
!
1/2
1
2
RepB,D (h) =
1/2 1 2
B,D
194
1.4 Theorem Assume that V and W are vector spaces of

with bases B and D, and that h : V W is a linear map.
h1,1 h1,2 . . . h1,n
h2,1 h2,2 . . . h2,n

RepB,D (h) =
..
hm,1 hm,2 . . . hm,n
dimensions n and m
If h is represented by
B,D
and ~v V is represented by
c1

c2
RepB (~v) =
..
.
cn B
then the representation of the image of ~v is this.
h1,1 c1 + h1,2 c2 + + h1,n cn
h2,1 c1 + h2,2 c2 + + h2,n cn

RepD ( h(~v) ) =
..
hm,1 c1 + hm,2 c2 + + hm,n cn
Proof This formalizes Example 1.1. See Exercise 29.
QED
1.5 Definition The matrix-vector product of a mn matrix and a n1 vector

is this.

a1,1 a1,2 . . . a1,n
a1,1 c1 + + a1,n cn
c1
a2,1 a2,2 . . . a2,n . a2,1 c1 + + a2,n cn
..
..
.. =
.
.
cn
am,1 am,2 . . . am,n
am,1 c1 + + am,n cn
Briefly, application of a linear map is represented by the matrix-vector
product of the maps representative and the vectors representative.
1.6 Remark In some sense Theorem 1.4 is not at all surprising because we chose
the matrix representative in Definition 1.2 precisely to make Theorem 1.4 true.
If the theorem were not true then we would adjust the definition. Nonetheless,
we need the verification that the definition is right.
1.7 Example For the matrix from Example 1.3 we can calculate where that map
sends this vector.

4

~v = 1
0
195
With respect to the domain basis B the representation of this vector is
RepB (~v) = 1/2

2
B
and so the matrix-vector product gives the representation of the value h(~v) with
respect to the codomain basis D.
!
0
1/2
1
2
RepD (h(~v)) =
1/2
1/2 1 2
B,D
2
!
!B
(1/2) 0 + 1 (1/2) + 2 2
9/2
=
=
(1/2) 0 1 (1/2) 2 2
9/2
D
To find h(~v) itself, not its representation, take (9/2)(1 + x) (9/2)(1 + x) = 9.

1.8 Example Let : R3 R2 be projection onto the xy-plane. To give a matrix
representing this map, we first fix some bases.

!
!
1
1
1
2
1

D=h
B = h0 , 1 , 0i
,
i
1
1
0
0
1
For each vector in the domains basis, we

!
1
1
1

0

1 7
0
0
0
find its image under the map.

!
!
1
1
1

0 7
1
0
1
Then we find the representation of each image with respect to the codomains
basis.
!
!
!
!
!
!
1
1
1
0
1
1
RepD (
)=
RepD (
)=
RepD (
)=
0
1
1
1
0
1
Finally, adjoining these representations gives the matrix representing with
respect to B, D.
!
1 0 1
RepB,D () =
1 1
1
B,D
We can illustrate Theorem 1.4 by computing the matrix-vector product representing the following statement about the projection map.

!
2
2

(2) =
2
1
196
Representing this vector from the domain with respect to the domains basis

2
1

RepB (2) = 2
1
1
B
gives this matrix-vector product.

2
1 0

RepD ( (1) ) =
1 1
1

1
1

2 =
1
B,D
1
!
0
2
Expanding this representation into a linear combination of vectors from D

!
!
!
2
1
2
0
+2
=
1
1
2
checks that the maps action is indeed reflected in the operation of the matrix.
(We will sometimes compress these three displayed equations into one

!
!
2
1
0
2
h

=
2 = 2 7
H
2
2
D
1
1
B
in the course of a calculation.)

We now have two ways to compute the effect of projection, the straightforward formula that drops each three-tall vectors third component to make a
two-tall vector, and the above formula that uses representations and matrixvector multiplication. Compared to the first way, the second way might seem
complicated. However, it has advantages. The next example shows that this
new scheme simplifies the formula for some maps.
1.9 Example To represent a rotation map t : R2 R2 that turns all vectors in
the plane counterclockwise through an angle
t/6
t/6 (~
u)
u
~
we start by fixing bases. Using E2 both as a domain basis and as a codomain

basis is natural, Now, we find the image under the map of each vector in the
domains basis.
!
!
!
!
1 t cos
0 t sin
7
7
0
sin
1
cos
Then we represent these images with respect to the codomains basis. Because
this basis is E2 , vectors represent themselves. Adjoining the representations
197
gives the matrix representing the map.
RepE2 ,E2 (t ) =
!
cos sin
sin cos
The advantage of this scheme is that by knowing how to represent the image of
just the two basis vectors we get a formula for the image of any vector at all;
here we rotate a vector by = /6.
3
2
t/6
!
!
3/2 1/2
3
1/2
3/2
2
3.598
0.232
(We are again using the fact that with respect to the standard basis, vectors
represent themselves.)
1.10 Example In the definition of matrix-vector product the width of the matrix
equals the height of the vector. Hence, the first product below is defined while
the second is not.
1
4
0
3

! 1
0
0
1
2
1
4
0
3
! !
0
1
1
0
One reason that this product is not defined is the purely formal one that the
definition requires that the sizes match and these sizes dont match. Behind
the formality, though, is a sensible reason to leave it undefined: the three-wide
matrix represents a map with a three-dimensional domain while the two-tall
vector represents a member of a two-dimensional space.
Earlier we saw the operations of addition and scalar multiplication operations
of matrices and the dot product of vectors. Matrix-vector multiplication is a new
operation in the arithmetic of vectors and matrices. Nothing in Definition 1.5
requires us to view it in terms of representations. We can get some insight by
focusing on how the entries combine.
A good way to view matrix-vector product is as the dot products of the rows
of the matrix with the column vector.
ai,1
..
.
ai,2
..
.
c1
..

.
c2
ai,n
.. = ai,1 c1 + ai,2 c2 + . . . + ai,n cn
.
..
.
cn
...
Looked at in this row-by-row way, this new operation generalizes dot product.
198

We can also view the operation column-by-column.

h1,1 c1 + h1,2 c2 + + h1,n cn
c1
h1,1 h1,2 . . . h1,n

h2,1 h2,2 . . . h2,n c2 h2,1 c1 + h2,2 c2 + + h2,n cn
..
..
.. =
.
.
.
hm,1 c1 + hm,2 c2 + + hm,n cn
cn
hm,1 hm,2 . . . hm,n
h1,n
h1,1
h2,n
h2,1
= c1 . + + cn .
..
..
hm,n
hm,1
1.11 Example
1 0
2 0
!
!
!
2
1
0
1
1
1
+1
=
1 = 2
2
0
3
3
1
!
1
7
The result has the columns of the matrix weighted by the entries of the vector.
This way of looking at it brings us back to the objective stated at the start of
~ 1 + + cn
~ n ) as c1 h(
~ 1 ) + + cn h(
~ n ).
this section, to compute h(c1
We began this section by noting that the equality of these two enables us to
~ 1 ), . . . , h(
~ n ). We
compute the action of h on any argument knowing only h(
have developed this into a scheme to compute the action of the map by taking
the matrix-vector product of the matrix representing the map with the vector
representing the argument. In this way, with respect to any bases, any linear
map has a matrix representing it. The next subsection will show the converse,
that if we fix bases then for any matrix there is an associated linear map.
Exercises
X 1.12 Multiply the matrix
1
0
1
3
1
1
1
2
0
by each vector (or state not defined).

0
2
2
(a) 1
(b)
(c) 0
2
0
0
1.13 Perform, if possible, each matrix-vector multiplication.

1

2
1
4
1 1 0
1
(a)
(b)
(c)
3
3 1/2
2
2 1 0
2
1
X 1.14 Solve this matrix equation.

2
1 1
x
8
0
1 3 y = 4
1 1 2
z
4

1
1
3
1
1

199
X 1.15 For a homomorphism from P2 to P3 that sends

1 7 1 + x,
x 7 1 + 2x,
and
x2 7 x x3
where does 1 3x + 2x2 go?

X 1.16 Assume that h : R2 R3 is determined by this action.

2
0
1
0
7 2
7 1
0
1
0
1
Using the standard bases, find
(a) the matrix representing this map;
(b) a general formula for h(~v).
X 1.17 Let d/dx : P3 P3 be the derivative transformation.
(a) Represent d/dx with respect to B, B where B = h1, x, x2 , x3 i.
(b) Represent d/dx with respect to B, D where D = h1, 2x, 3x2 , 4x3 i.
X 1.18 Represent each linear map with respect to each pair of bases.
(a) d/dx : Pn Pn with respect to B, B where B = h1, x, . . . , xn i, given by
(b)
(c)
by
a0 + a1 x + a2 x2 + + an xn 7 a1 + 2a2 x + + nan xn1

: Pn Pn+1 with respect to Bn , Bn+1 where Bi = h1, x, . . . , xi i, given by
an n+1
a1 2
x + +
x
a0 + a1 x + a2 x2 + + an xn 7 a0 x +
2
n+1
R1
0:
Pn R with respect to B, E1 where B = h1, x, . . . , xn i and E1 = h1i, given
a1
an
+ +
2
n+1
(d) eval3 : Pn R with respect to B, E1 where B = h1, x, . . . , xn i and E1 = h1i,
given by
a0 + a1 x + a2 x2 + + an xn 7 a0 +
a0 + a1 x + a2 x2 + + an xn 7 a0 + a1 3 + a2 32 + + an 3n
(e) slide1 : Pn Pn with respect to B, B where B = h1, x, . . . , xn i, given by
a0 + a1 x + a2 x2 + + an xn 7 a0 + a1 (x + 1) + + an (x + 1)n
1.19 Represent the identity map on any nontrivial space with respect to B, B, where
B is any basis.
1.20 Represent, with respect to the natural basis, the transpose transformation on
the space M22 of 22 matrices.
~ 1,
~ 2,
~ 3,
~ 4 i is a basis for a vector space. Represent with
1.21 Assume that B = h
respect to B, B the transformation that is determined by each.
~ 1 7
~ 2,
~ 2 7
~ 3,
~ 3 7
~ 4,
~ 4 7 ~0
(a)
~
~
~
~
~
~
~
(b) 1 7 2 , 2 7 0, 3 7 4 , 4 7 ~0
~ 1 7
~ 2,
~ 2 7
~ 3,
~ 3 7 ~0,
~ 4 7 ~0
(c)
1.22 Example 1.9 shows how to represent the rotation transformation of the plane
with respect to the standard basis. Express these other transformations also with
respect to the standard basis.
(a) the dilation map ds , which multiplies all vectors by the same scalar s
(b) the reflection map f` , which reflects all all vectors across a line ` through the
origin
X 1.23 Consider a linear transformation of R2 determined by these two.

1
2
1
1
7
7
1
0
0
0
(a) Represent this transformation with respect to the standard bases.
200
(b) Where does the transformation send this vector?

0
5
(c) Represent this transformation with respect to these bases.

1
1
2
1
B=h
,
i
D=h
,
i
1
1
2
1
(d) Using B from the prior item, represent the transformation with respect to
B, B.
1.24 Suppose that h : V W is one-to-one so that by Theorem 2.21, for any basis B =
~ 1 ), . . . , h(
~ n )i is a basis for W.
~ 1, . . . ,
~ n i V the image h(B) = hh(
h
(a) Represent the map h with respect to B, h(B).
(b) For a member ~v of the domain, where the representation of ~v has components
c1 , . . . , cn , represent the image vector h(~v) with respect to the image basis h(B).
1.25 Give a formula for the product of a matrix and ~ei , the column vector that is
all zeroes except for a single one in the i-th position.
X 1.26 For each vector space of functions of one real variable, represent the derivative
transformation with respect
to B, B.

(a) { a cos x + b sin x a, b R }, B = hcos x, sin xi

(b) { aex + be2x a, b R }, B = hex , e2x i

(c) { a + bx + cex + dxex a, b, c, d R }, B = h1, x, ex , xex i
1.27 Find the range of the linear transformation of R2 represented with respect to
the standard

bases byeach matrix.

1 0
0 0
a
b
(a)
(b)
(c) a matrix of the form
0 0
3 2
2a 2b
X 1.28 Can one matrix represent two different linear maps? That is, can RepB,D (h) =
RepB,
D
(h)?
1.29 Prove Theorem 1.4.
X 1.30 Example 1.9 shows how to represent rotation of all vectors in the plane through
an angle about the origin, with respect to the standard bases.
(a) Rotation of all vectors in three-space through an angle about the x-axis is a
transformation of R3 . Represent it with respect to the standard bases. Arrange
the rotation so that to someone whose feet are at the origin and whose head is
at (1, 0, 0), the movement appears clockwise.
(b) Repeat the prior item, only rotate about the y-axis instead. (Put the persons
head at ~e2 .)
(c) Repeat, about the z-axis.
(d) Extend the prior item to R4 . (Hint: we can restate rotate about the z-axis
as rotate parallel to the xy-plane.)
1.31 (Schurs Triangularization Lemma)
(a) Let U be a subspace of V and fix bases BU BV . What is the relationship
between the representation of a vector from U with respect to BU and the
representation of that vector (viewed as a member of V) with respect to BV ?
(b) What about maps?
~ 1, . . . ,
~ n i for V and observe that the spans
(c) Fix a basis B = h
~
~
~ 1 }] [{
~ 1,
~ 2 }] [B] = V
[{ 0 }] = { 0 } [{
form a strictly increasing chain of subspaces. Show that for any linear map
h : V W there is a chain W0 = {~0 } W1 Wm = W of subspaces of W
such that
~ 1, . . . ,
~ i }]) Wi
h([{
201
for each i.
(d) Conclude that for every linear map h : V W there are bases B, D so the
matrix representing h with respect to B, D is upper-triangular (that is, each
entry hi,j with i > j is zero).
(e) Is an upper-triangular representation unique?
III.2
Any Matrix Represents a Linear Map
The prior subsection shows that the action of a linear map h is described by a
matrix H, with respect to appropriate bases, in this way.

v1
h1,1 v1 + + h1,n vn
h
.
..
()
~v = ..
7 h(~v) =
.
H
vn B
hm,1 v1 + + hm,n vn D
Here we will show the converse, that each
So we start with a matrix
h1,1 h1,2
h2,1 h2,2
H=
..
hm,1 hm,2
matrix represents a linear map.

...
...
...
h1,n
h2,n
hm,n
and we will describe how it defines a map h. We require that the map be
represented by the matrix so first note that in () the dimension of the maps
domain is the number of columns n of the matrix and the dimension of the
codomain is the number of rows m. Thus, for hs domain fix an n-dimensional
vector space V and for the codomain fix an m-dimensional space W. Also fix
~ 1, . . . ,
~ n i and D = h~1 , . . . , ~m i for those spaces.
bases B = h
Now let h : V W be: where ~v in the domain has the representation

v1
..
RepB (~v) = .
vn B
then its image h(~v) is the member the codomain with this representation.
h1,1 v1 + + h1,n vn
..
RepD ( h(~v) ) =
.
hm,1 v1 + + hm,n vn D
That is, to compute the action of h on any ~v V, first express ~v with respect to
~ 1 + + vn
~ n and then h(~v) = (h1,1 v1 + + h1,n vn ) ~1 +
the basis ~v = v1
+ (hm,1 v1 + + hm,n vn ) ~m .
202
Above we have made some arbitrary choices, for instance V can be any
n-dimensional space and B could be any basis for V, so H does not define a
unique function. However, note also that once we have fixed V, B, W, and D
then h is well-defined since ~v has a unique representation with respect to the
basis B by Theorem II.1.12 and the calculation of w
~ from its representation is
also uniquely determined.
2.1 Example Consider this matrix.
H = 3
5
4
6
It is 32 so any map that it defines must carry a dimension 2 domain to a

dimension 3 codomain. Let the domain and codomain be R2 and P2 , with these
bases.
!
!
1
1
B=h
,
i
D = hx2 , x2 + x, x2 + x + 1i
1
1
Let h : R2 P2 be the function defined by H and we will compute the image
under h of this member of the domain.
!
3
~v =
2
We have
RepD (h(~v)) = H RepB (~v) = 3

5
!
2
11/2
1/2
= 23/2
4
5/2
6
35/2
From its representation computation of w

~ is routine (11/2)(x2 ) (23/2)(x2 +
2
2
x) (35/2)(x + x + 1) = (69/2)x (58/2)x (35/2).
2.2 Theorem Any matrix represents a homomorphism between vector spaces of
appropriate dimensions, with respect to any pair of bases.
Proof We must check that for any matrix H and any domain and codomain
bases B, D, the defined map h is linear. If ~v, ~u V are such that

v1
u1
..
..
RepB (~v) = . and RepB (~u) = .
vn
un
and c, d R then the calculation

h(c~v + d~u) = h1,1 (cv1 + du1 ) + + h1,n (cvn + dun ) ~1 +

+ hm,1 (cv1 + du1 ) + + hm,n (cvn + dun ) ~m
= c h(~v) + d h(~u)
supplies that check.
More information on well-defined is in the appendix.
QED
203
2.3 Example Even if the domain and codomain are the same, the map that the
matrix represents depends on the bases that we choose. If
!
!
!
!
!
1 0
1
0
0
1
H=
, B1 = D1 = h
,
i, and B2 = D2 = h
,
i,
0 0
0
1
1
0
then h1 : R2 R2 represented by H with respect to B1 , D1 maps
!
!
!
!
c1
c1
c1
c1
=
7
=
c2
c2
0
0
B1
D1
while h2 : R2 R2 represented by H with respect to B2 , D2 is this map.

!
!
!
!
c1
c2
c2
0
=
7
=
c2
c1
0
c2
B2
D2
These are different functions. The first is projection onto the x-axis, while the
second is projection onto the y-axis.
This result means that we can, when convenient, work solely with matrices,
just doing the computations without having to worry whether a matrix of interest
represents a linear map on some pair of spaces. When we are working with a
matrix but we do not have particular spaces or bases in mind then we often
take the domain and codomain to be Rn and Rm and use the standard bases.
This is convenient because with the standard bases vector representation is
transparent the representation of ~v is ~v. (In this case the column space of the
matrix equals the range of the map and consequently the column space of H is
often denoted by R(H).)
We finish this section by illustrating how a matrix can give us information
about the associated maps.
2.4 Theorem The rank of a matrix equals the rank of any map that it represents.
Proof Suppose that the matrix H is mn. Fix domain and codomain spaces
~ 1, . . . ,
~ n i and D. Then H
V and W of dimension n and m with bases B = h
represents some linear map h between those spaces with respect to these bases
whose range space

~ 1 + + cn
~ n ) c1 , . . . , cn R}
{h(~v) ~v V } = {h(c1

~ 1 ) + + cn h(
~ n ) c1 , . . . , cn R}
= {c1 h(
~ 1 ), . . . , h(
~ n ) }]. The rank of the map h is the dimension of this
is the span [{ h(
range space.
The rank of the matrix is the dimension of its column space, the span of the
~ 1 )), . . . , RepD (h(
~ n )) }].
set of its columns [{ RepD (h(
To see that the two spans have the same dimension, recall from the proof
of Lemma I.2.5 that if we fix a basis then representation with respect to that
204
basis gives an isomorphism RepD : W Rm . Under this isomorphism there is a

linear relationship among members of the range space if and only if the same
~ 1 ) + + cn h(
~ n ) if
relationship holds in the column space, e.g, ~0 = c1 h(
~
~
~
and only if 0 = c1 RepD (h(1 )) + + cn RepD (h(n )). Hence, a subset of
the range space is linearly independent if and only if the corresponding subset
of the column space is linearly independent. Therefore the size of the largest
linearly independent subset of the range space equals the size of the largest
linearly independent subset of the column space, and so the two spaces have the
same dimension.
QED
2.5 Example Any map represented by
1
1
0
0
2
2
0
0
2
1
3
2
must be from a three-dimensional domain to a four-dimensional codomain. In

addition, because the rank of this matrix is two (we can spot this by eye or get it
with Gausss Method), any map represented by this matrix has a two-dimensional
range space.
2.6 Corollary Let h be a linear map represented by a matrix H. Then h is onto
if and only if the rank of H equals the number of its rows, and h is one-to-one if
and only if the rank of H equals the number of its columns.
Proof For the onto half, the dimension of the range space of h is the rank
of h, which equals the rank of H by the theorem. Since the dimension of the
codomain of h equals the number of rows in H, if the rank of H equals the
number of rows then the dimension of the range space equals the dimension
of the codomain. But a subspace with the same dimension as its superspace
must equal that superspace (because any basis for the range space is a linearly
independent subset of the codomain whose size is equal to the dimension of the
codomain, and thus so this basis for the range space must also be a basis for the
codomain).
For the other half, a linear map is one-to-one if and only if it is an isomorphism
between its domain and its range, that is, if and only if its domain has the same
dimension as its range. But the number of columns in h is the dimension of hs
domain, and by the theorem the rank of H equals the dimension of hs range.
QED
The above results settle the apparent ambiguity in our use of the same word
rank to apply both to matrices and to maps.
2.7 Definition A linear map that is one-to-one and onto is nonsingular , otherwise
it is singular . That is, a linear map is nonsingular if and only if it is an
isomorphism.
205
2.8 Remark Some authors use nonsingular as a synonym for one-to-one while
others use it the way that we have here. The difference is slight because any
map is onto its range space, so a one-to-one map is an isomorphism with its
range.
In the first chapter we defined a matrix to be nonsingular if it is square and
is the matrix of coefficients of a linear system with a unique solution. The next
result justifies our dual use of the term.
2.9 Lemma A nonsingular linear map is represented by a square matrix. A
square matrix represents nonsingular maps if and only if it is a nonsingular
matrix. Thus, a matrix represents isomorphisms if and only if it is square and
nonsingular.
Proof Assume that the map h : V W is nonsingular. Corollary 2.6 says that
for any matrix H representing that map, because h is onto the number of rows
of H equals the rank of H and because h is one-to-one the number of columns
of H is also equal to the rank of H. Thus H is square.
Next assume that H is square, n n. The matrix H is nonsingular if
and only if its row rank is n, which is true if and only if Hs rank is n by
Theorem Two.III.3.11, which is true if and only if hs rank is n by Theorem 2.4,
which is true if and only if h is an isomorphism by Theorem I.2.3. (The last
holds because the domain of h is n-dimensional as it is the number of columns
in H.)
QED
2.10 Example Any map from R2 to P1 represented with respect to any pair of
bases by
!
1 2
0 3
is nonsingular because this matrix has rank two.
2.11 Example Any map g : V W represented by
!
1 2
3 6
is singular because this matrix is singular.
Weve now seen that the relationship between maps and matrices goes both
ways: for a particular pair of bases, any linear map is represented by a matrix
and any matrix describes a linear map. That is, by fixing spaces and bases we
get a correspondence between maps and matrices. In the rest of this chapter
we will explore this correspondence. For instance, weve defined for linear maps
the operations of addition and scalar multiplication and we shall see what the
corresponding matrix operations are. We shall also see the matrix operation
that represent the map operation of composition. And, we shall see how to find
the matrix that represents a maps inverse.
206
Exercises
X 2.12 Let h be the linear map defined by this matrix on the domain P1 and
codomain R2 with respect to the given bases.

2 1
1
1
H=
B = h1 + x, xi, D = h
,
i
4 2
1
0
What is the image under h of the vector ~v = 2x 1?
X 2.13 Decide if each vector lies in the range of the map from R3 to R2 represented
with respect
to the
bases

standard

by thematrix.

1 1 3
1
2 0 3
1
(a)
,
(b)
,
0 1 4
3
4 0 6
1
X 2.14 Consider this matrix, representing a transformation of R2 , and these bases for
that space.

1
1 1
0
1
1
1
B=h
,
i D=h
,
i
1 1
1
0
1
1
2
(a) To what vector in the codomain is the first member of B mapped?
(b) The second member?
(c) Where is a general vector from the domain (a vector with components x and
y) mapped? That is, what transformation of R2 is represented with respect to
B, D by this matrix?

2.15 What transformation of F = { a cos + b sin a, b R } is represented with
respect to B = hcos sin , sin i and D = hcos + sin , cos i by this matrix?

0 0
1 0
X 2.16 Decide whether 1 + 2x is in the range of the map from R3 to P2 represented
with respect to E3 and h1, 1 + x2 , xi by this matrix.
1 3 0
0 1 0
1 0 1
2.17 Example 2.11 gives a matrix that is nonsingular and is therefore associated
with maps that are nonsingular.
(a) Find the set of column vectors representing the members of the null space of
any map represented by this matrix.
(b) Find the nullity of any such map.
(c) Find the set of column vectors representing the members of the range space
of any map represented by this matrix.
(d) Find the rank of any such map.
(e) Check that rank plus nullity equals the dimension of the domain.
2.18 This is an alternative proof of Lemma 2.9. Given an n n matrix H, fix a
domain V and codomain W of appropriate dimension n, and bases B, D for those
spaces, and consider the map h represented by the matrix.
(a) Show that h is onto if and only if there is at least one RepB (~v) associated by
H with each RepD (~
w).
(b) Show that h is one-to-one if and only if there is at most one RepB (~v) associated
by H with each RepD (~
w).
(c) Consider the linear system HRepB (~v) = RepD (~
w). Show that H is nonsingular
if and only if there is exactly one solution RepB (~v) for each RepD (~
w).
207
X 2.19 Because the rank of a matrix equals the rank of any map it represents, if
one matrix represents two different maps H = RepB,D (h) = RepB,

D
(h) (where
: V W) then the dimension of the range space of h equals the dimension of
h, h
Must these equal-dimensioned range spaces actually be the
the range space of h.
same?
X 2.20 Let V be an n-dimensional space with bases B and D. Consider a map that
sends, for ~v V, the column vector representing ~v with respect to B to the column
vector representing ~v with respect to D. Show that map is a linear transformation
of Rn .
2.21 Example 2.3 shows that changing the pair of bases can change the map that
a matrix represents, even though the domain and codomain remain the same.
Could the map ever not change? Is there a matrix H, vector spaces V and W,
and associated pairs of bases B1 , D1 and B2 , D2 (with B1 6= B2 or D1 6= D2 or
both) such that the map represented by H with respect to B1 , D1 equals the map
represented by H with respect to B2 , D2 ?
X 2.22 A square matrix is a diagonal matrix if it is all zeroes except possibly for the
entries on its upper-left to lower-right diagonal its 1, 1 entry, its 2, 2 entry, etc.
Show that a linear map is an isomorphism if there are bases such that, with respect
to those bases, the map is represented by a diagonal matrix with no zeroes on the
diagonal.
2.23 Describe geometrically the action on R2 of the map represented with respect
to the standard bases E2 , E2 by this matrix.

3 0
0 2
Do the same for these.

1
0

0
0
0
1
1
0
1
0

3
1
2.24 The fact that for any linear map the rank plus the nullity equals the dimension
of the domain shows that a necessary condition for the existence of a homomorphism
between two spaces, onto the second space, is that there be no gain in dimension.
That is, where h : V W is onto, the dimension of W must be less than or equal
to the dimension of V.
(a) Show that this (strong) converse holds: no gain in dimension implies that
there is a homomorphism and, further, any matrix with the correct size and
correct rank represents such a map.
(b) Are there bases for R3 such that this matrix
1 0 0
H = 2 0 0
0 1 0
represents a map from R3 to R3 whose range is the xy plane subspace of R3 ?
2.25 Let V be an n-dimensional space and suppose that ~x Rn . Fix a basis
B for V and consider the map h~x : V R given ~v 7 ~x RepB (~v) by the dot
product.
(a) Show that this map is linear.
(b) Show that for any linear map g : V R there is an ~x Rn such that g = h~x .
(c) In the prior item we fixed the basis and varied the ~x to get all possible linear
maps. Can we get all possible linear maps by fixing an ~x and varying the basis?
208
2.26 Let V, W, X be vector spaces with bases B, C, D.

(a) Suppose that h : V W is represented with respect to B, C by the matrix H.
Give the matrix representing the scalar multiple rh (where r R) with respect
to B, C by expressing it in terms of H.
(b) Suppose that h, g : V W are represented with respect to B, C by H and G.
Give the matrix representing h + g with respect to B, C by expressing it in terms
of H and G.
(c) Suppose that h : V W is represented with respect to B, C by H and g : W X
is represented with respect to C, D by G. Give the matrix representing g h
with respect to B, D by expressing it in terms of H and G.
Section IV. Matrix Operations
IV
209
Matrix Operations
The prior section shows how matrices represent linear maps. When we see a new
idea, a good strategy is to explore how it interacts with things that we already
understand. In the first subsection below we will see how the representation
of a scalar product r f relates to the representation of f, and also how the
representation of the sum of two maps f + g relates to the representations of f
and g. In the later subsections we will explore the representation of linear map
composition and inverse.
IV.1
Sums and Scalar Products
We start with an example showing the relationship between the representation

of a function and the representation of a scalar multiple of that function.
1.1 Example Let f : V W be a linear function represented with respect to some
bases by this matrix.
!
1 0
RepB,D (f) =
1 1
Consider the scalar multiple map 5f : V W. We want to see how to compute
RepB,D (5f) from RepB,D (f).
The difference between the functions is that if f takes ~v 7 w
~ then 5f takes
~v 7 5~
w. So consider the representations of the domain and codomain vectors
that are associated by f.
RepB (~v) =
v1
v2
!
RepD (~
w) =
w1
w2
The representation above says that w

~ = w1~1 + w2~2 (where the basis D is
~
~
~
~
h1 , 2 i). Since 5~
w = 5 (w1 1 + w2 2 ) = (5w1 )~1 + (5w2 )~2 we have that 5f
associates ~v with the vector having this representation.
RepD (5~
w) =
5w1
5w2
So, changing the map from f to 5f has the effect of changing the representation
of the codomain vector by multiplying its entries by 5.
That gives us the relationship between the representation of the action of f
and the representation of the action of 5f.
1
1
0
1
v1
v2
!
=
v1
v1 + v2
!
RepB,D (5f)
v1
v2
!
=
5v1
5v1 + 5v2
210
Clearly
5
5
RepB,D (5f) =
0
5
and so going from the matrix representing f to the matrix representing 5f just
means multiplying all the entries by 5.
We can also consider how to compute the representation of the sum of two
maps from the representation of those maps.
1.2 Example Suppose that two linear maps with the same domain and codomain
f, g : R2 R3 are represented with respect to some bases B and D by these
matrices.
!
!
1 3
2 1
RepB,D (f) =
RepB,D (g) =
2 0
2
4
Recall the definition of the sum of two functions: if f takes ~v 7 ~u and g takes
~v 7 w
~ then f + g is the function that takes ~v 7 ~u + w
~ . Note that where these
are the representations of the vectors
!
!
!
v1
u1
w1
RepB (~v) =
RepD (~u) =
RepD (~
w) =
v2
u2
w2
we have ~u + w
~ = (u1~1 + u2~2 ) + (w1~1 + w2~2 ) = (u1 + w1 )~1 + (u2 + w2 )~2
and so this is the representation of the vector sum.
!
u1 + w1
RepD (~u + w
~)=
u2 + w2
Hence, since these represent the actions of f and g
!
!
!
!
!
1 3
v1
v1 + 3v2
2 1
v1
=
=
2 0
v2
2v1
2
4
v2
2v1 v2
2v1 + 4v2
this represents the action of f + g.

RepB,D (f + g)
v1
v2
!
=
v1 + 2v2
4v1 + 4v2
Therefore, we compute the matrix representing the function sum by adding the
entries of the two matrices representing the functions.
!
1 2
RepB,D (f + g)
4 4
1.3 Definition The scalar multiple of a matrix is the result of entry-by-entry
scalar multiplication. The sum of two same-sized matrices is their entry-by-entry
sum.
211
These operations extend the first chapters addition and scalar multiplication
operations on vectors.
1.4 Theorem Let h, g : V W be linear maps represented with respect to bases
B, D by the matrices H and G, and let r be a scalar. Then the map h + g : V W
is represented with respect to B, D by H + G, and the map r h : V W is
represented with respect to B, D by rH.
Proof Exercise 9; generalize the examples above.
QED
1.5 Remark Recall Remark III.1.6 following Theorem III.1.4. That theorem says
that matrix-vector multiplication represents the application of a linear map and
the remark notes that the theorem simply justifies the definition of matrix-vector
multiplication. In some sense the theorem has to hold, because if it didnt then
we would adjust the definition to make the theorem hold. The above theorem is
another example of such a result; it shows that our definition of the operations
is sensible.
A special case of scalar multiplication is multiplication by zero. For any map
0 h is the zero homomorphism and for any matrix 0 H is the matrix with all
entries zero.
1.6 Definition A zero matrix has all entries 0. We write Znm or simply Z
(another common notation is 0nm or just 0).
1.7 Example The zero map from any three-dimensional space to any twodimensional space is represented by the 23 zero matrix
!
0 0 0
Z=
0 0 0
no matter what domain and codomain bases we use.
Exercises
X 1.8 Perform
the indicated
if defined.

operations,

5 1 2
2 1 4
(a)
+
6
1 1
3 0 5

2 1 1
(b) 6
1
2
3

2 1
2 1
(c)
+
0 3
0 3

1
2
1 4
(d) 4
+5
3 1
2 1

2 1
1 1 4
(e) 3
+2
3 0
3 0 5
1.9 Prove Theorem 1.4.
(a) Prove that matrix addition represents addition of linear maps.
(b) Prove that matrix scalar multiplication represents scalar multiplication of
linear maps.
212
X 1.10 Prove each, assuming that the operations are defined, where G, H, and J are
matrices, where Z is the zero matrix, and where r and s are scalars.
(a) Matrix addition is commutative G + H = H + G.
(b) Matrix addition is associative G + (H + J) = (G + H) + J.
(c) The zero matrix is an additive identity G + Z = G.
(d) 0 G = Z
(e) (r + s)G = rG + sG
(f) Matrices have an additive inverse G + (1) G = Z.
(g) r(G + H) = rG + rH
(h) (rs)G = r(sG)
1.11 Fix domain and codomain spaces. In general, one matrix can represent many
different maps with respect to different bases. However, prove that a zero matrix
represents only a zero map. Are there other such matrices?
X 1.12 Let V and W be vector spaces of dimensions n and m. Show that the space
L(V, W) of linear maps from V to W is isomorphic to Mmn .
X 1.13 Show that it follows from the prior questions that for any six transformations
t1 , . . . , t6 : R2 R2 there are scalars c1 , . . . , c6 R such that c1 t1 + + c6 t6 is
the zero map. (Hint: this is a bit of a misleading question.)
1.14 The trace of a square matrix is the sum of the entries on the main diagonal
(the 1, 1 entry plus the 2, 2 entry, etc.; we will see the significance of the trace in
Chapter Five). Show that trace(H + G) = trace(H) + trace(G). Is there a similar
result for scalar multiplication?
1.15 Recall that the transpose of a matrix M is another matrix, whose i, j entry is
the j, i entry of M. Verify these identities.
(a) (G + H)trans = Gtrans + Htrans
(b) (r H)trans = r Htrans
X 1.16 A square matrix is symmetric if each i, j entry equals the j, i entry, that is, if
the matrix equals its transpose.
(a) Prove that for any H, the matrix H+Htrans is symmetric. Does every symmetric
matrix have this form?
(b) Prove that the set of nn symmetric matrices is a subspace of Mnn .
X 1.17 (a) How does matrix rank interact with scalar multiplication can a scalar
product of a rank n matrix have rank less than n? Greater?
(b) How does matrix rank interact with matrix addition can a sum of rank n
matrices have rank less than n? Greater?
IV.2
Matrix Multiplication
After representing addition and scalar multiplication of linear maps in the prior
subsection, the natural next map operation to consider is composition.
2.1 Lemma The composition of linear maps is linear.
Proof (This argument has appeared earlier, as part of the proof of Theo-
213
rem I.2.2.) Let h : V W and g : W U be linear. The calculation

g h c1 ~v1 + c2 ~v2 = g h(c1 ~v1 + c2 ~v2 ) = g c1 h(~v1 ) + c2 h(~v2 )

= c1 g h(~v1 )) + c2 g(h(~v2 ) = c1 (g h)(~v1 ) + c2 (g h)(~v2 )
shows that g h : V U preserves linear combinations.
QED
To see how the representation of the composite relates to the representations

of the compositors, consider an example.
2.2 Example Let h : R4 R2 and g : R2 R3 , fix bases B R4 , C R2 ,
D R3 , and let these be the representations.
!
1 1
4 6 8 2
H = RepB,C (h) =
G = RepC,D (g) = 0 1
5 7 9 3
B,C
1 0
C,D
To represent the composition g h : R R we start with a ~v, represent h of

~v, and then represent g of that. The representation of h(~v) is the product of hs
matrix and ~vs vector.

v1
!
!
v
4v1 + 6v2 + 8v3 + 2v4
4 6 8 2
2
RepC ( h(~v) ) =
=
v3
5 7 9 3
5v1 + 7v2 + 9v3 + 3v4
B,C
C
v4 B
The representation of g( h(~v) ) is the product of gs matrix and h(~v)s vector.
!
1 1
4v1 + 6v2 + 8v3 + 2v4
RepD ( g(h(~v)) ) = 0 1
5v1 + 7v2 + 9v3 + 3v4
C
1 0
C,D
1 (4v1 + 6v2 + 8v3 + 2v4 ) + 1 (5v1 + 7v2 + 9v3 + 3v4 )
= 0 (4v1 + 6v2 + 8v3 + 2v4 ) + 1 (5v1 + 7v2 + 9v3 + 3v4 )

1 (4v1 + 6v2 + 8v3 + 2v4 ) + 0 (5v1 + 7v2 + 9v3 + 3v4 )
D
Distributing and regrouping on the vs gives
(1 4 + 1 5)v1 + (1 6 + 1 7)v2 + (1 8 + 1 9)v3 + (1 2 + 1 3)v4
= (0 4 + 1 5)v1 + (0 6 + 1 7)v2 + (0 8 + 1 9)v3 + (0 2 + 1 3)v4

(1 4 + 0 5)v1 + (1 6 + 0 7)v2 + (1 8 + 0 9)v3 + (1 2 + 0 3)v4
which we recognize as the result of this matrix-vector product.
14+15 16+17 18+19
= 0 4 + 1 5 0 6 + 1 7 0 8 + 1 9
14+05 16+07 18+09

v1
12+13
v
2
0 2 + 1 3

v3
12+03
B,D
v4 D
Thus the matrix representing g h has the rows of G combined with the columns
of H.
214
2.3 Definition The matrix-multiplicative product of the mr matrix G and the

rn matrix H is the mn matrix P, where
pi,j = gi,1 h1,j + gi,2 h2,j + + gi,r hr,j
that is, the i, j-th entry of the product is the dot product of the i-th row of the
first matrix with the j-th column of the second.
h1,j
..
..
.
.
. . . h2,j . . .
= . . . pi,j . . .
GH =
..

gi,1 gi,2 . . . gi,r
..
..
.
.
hr,j
2.4 Example The
14+15
0 4 + 1 5
14+05
2.5 Example
4
8
matrices from Example 2.2 combine in this way.

16+17 18+19 12+13
9 13

0 6 + 1 7 0 8 + 1 9 0 2 + 1 3 = 5 7
16+07 18+09 12+03
4 6
0
1
6
5
2
3
7
21+05
= 4 1 + 6 5
81+25

2
23+07

4 3 + 6 7 = 34
18
83+27
17
9
8
3
2
54
38
We next check that our definition of the matrix-matrix multiplication operation does what we intend.
2.6 Theorem A composition of linear maps is represented by the matrix product
of the representatives.
Proof This argument generalizes Example 2.2. Let h : V W and g : W X
be represented by H and G with respect to bases B V, C W, and D X, of

sizes n, r, and m. For any ~v V, the k-th component of RepC ( h(~v) ) is
hk,1 v1 + + hk,n vn
and so the i-th component of RepD ( g h (~v) ) is this.
gi,1 (h1,1 v1 + + h1,n vn ) + gi,2 (h2,1 v1 + + h2,n vn )
+ + gi,r (hr,1 v1 + + hr,n vn )
Distribute and regroup on the vs.
= (gi,1 h1,1 + gi,2 h2,1 + + gi,r hr,1 ) v1
+ + (gi,1 h1,n + gi,2 h2,n + + gi,r hr,n ) vn
215
Finish by recognizing that the coefficient of each vj

gi,1 h1,j + gi,2 h2,j + + gi,r hr,j
matches the definition of the i, j entry of the product GH.
QED
This arrow diagram pictures the relationship between maps and matrices
(wrt abbreviates with respect to).
Wwrt C
g
h
G
Vwrt B
gh
GH
Xwrt D
Above the arrows, the maps show that the two ways of going from V to X,
straight over via the composition or else in two steps by way of W, have the
same effect
gh
g
h
~v 7 g(h(~v))
~v 7 h(~v) 7 g(h(~v))
(this is just the definition of composition). Below the arrows, the matrices
indicate that the product does the same thing multiplying GH into the column
vector RepB (~v) has the same effect as multiplying the column vector first by H
and then multiplying the result by G.
RepB,D (g h) = GH
RepC,D (g) RepB,C (h) = GH
2.7 Example Because the number of columns on the left does not equal the
number of rows on the right, this product is not defined.
!
!
1 2
0
0 0
0 10 1.1
0 2
One way to understand why the combination in the prior example is undefined
has to do with the underlying maps. We require that the sizes match because
we want that the underlying function composition is possible.
h
dimension n space dimension r space dimension m space

So the matrix product has an mr matrix G times an rn matrix F to get an
mn result GF. Briefly, mr times rn equals mn.
2.8 Remark The order in which these things are written can be confusing. In
the prior equation, the number written first m is the dimension of gs codomain
and is thus the number that appears last in the map dimension description
above. The explanation is that while h is done first and then g, we write the
composition as g h, from the notation g(h(~v)). (Some people try to lessen
confusion by reading g h aloud as g following h.) That right to left order
carries over to matrices: g h is represented by GH.
216
We can get insight into matrix-matrix product operation by studying how

the entries combine. For instance, an alternative way to understand why we
require above that the sizes match is that the row of the left-hand matrix must
have the same number of entries as the column of the right-hand matrix, or else
some entry will be left without a matching entry from the other matrix.
Another aspect of the combinatorics of matrix multiplication is that in the
definition of the i, j entry
pi,j = gi, 1 h
1 ,j
+ gi, 2 h
2 ,j
+ + gi, r h
r ,j
the highlighted subscripts on the gs are column indices while those on the hs
indicate rows. That is, the summation takes place over the columns of G but
over the rows of H the definition treats left differently than right. So we may
reasonably suspect that GH can be unequal to HG.
2.9 Example Matrix multiplication is not commutative.
!
!
!
!
!
1 2
5 6
19 22
5 6
1 2
=
=
3 4
7 8
43 50
7 8
3 4
23
31
34
46
2.10 Example Commutativity can fail more dramatically:

!
!
!
5 6
1 2 0
23 34 0
=
7 8
3 4 0
31 46 0
while
1
3
2
4
!
0
5
0
7
6
8
isnt even defined.

2.11 Remark The fact that matrix multiplication is not commutative can be
puzzling at first, perhaps because most operations that people see in prior
mathematics courses are commutative. But matrix multiplication represents
function composition, which is not commutative: if f(x) = 2x and g(x) = x + 1
then g f(x) = 2x + 1 while f g(x) = 2(x + 1) = 2x + 2. (True, this g is not
linear and we might have hoped that linear functions would commute but this
shows that the failure of commutativity for matrix multiplication fits into a
larger context.)
Except for the lack of commutativity, matrix multiplication is algebraically
well-behaved. Below are some nice properties and more are in Exercise 24 and
Exercise 25.
2.12 Theorem If F, G, and H are matrices, and the matrix products are defined,
then the product is associative (FG)H = F(GH) and distributes over matrix
addition F(G + H) = FG + FH and (G + H)F = GF + HF.
217
Proof Associativity holds because matrix multiplication represents function
composition, which is associative: the maps (f g) h and f (g h) are equal

as both send ~v to f(g(h(~v))).
Distributivity is similar. For instance, the first one goes f (g + h) (~v) =

f (g + h)(~v) = f g(~v) + h(~v) = f(g(~v)) + f(h(~v)) = f g(~v) + f h(~v) (the
third equality uses the linearity of f).
QED
2.13 Remark We could instead prove that result by slogging through the indices.
For example, for associativity the i, j-th entry of (FG)H is
(fi,1 g1,1 + fi,2 g2,1 + + fi,r gr,1 )h1,j
+ (fi,1 g1,2 + fi,2 g2,2 + + fi,r gr,2 )h2,j
..
.
+ (fi,1 g1,s + fi,2 g2,s + + fi,r gr,s )hs,j
(where F, G, and H are mr, rs, and sn matrices), distribute
fi,1 g1,1 h1,j + fi,2 g2,1 h1,j + + fi,r gr,1 h1,j
+ fi,1 g1,2 h2,j + fi,2 g2,2 h2,j + + fi,r gr,2 h2,j
..
.
+ fi,1 g1,s hs,j + fi,2 g2,s hs,j + + fi,r gr,s hs,j
and regroup around the fs
fi,1 (g1,1 h1,j + g1,2 h2,j + + g1,s hs,j )
+ fi,2 (g2,1 h1,j + g2,2 h2,j + + g2,s hs,j )
..
.
+ fi,r (gr,1 h1,j + gr,2 h2,j + + gr,s hs,j )
to get the i, j entry of F(GH).
Contrast the two ways of verifying associativity. The argument just above
is hard to understand in that while the calculations are easy to check, the
arithmetic seems unconnected to any idea. The argument in the proof is shorter
and says why this property really holds. This illustrates the comments made at
the start of the chapter on vector spaces at least some of the time an argument
from higher-level constructs is clearer.
We have now seen how to construct the representation of the composition of
two linear maps from the representations of the two maps. We have called the
combination the product of the two matrices. We will explore this operation
more in the next subsection.
Exercises
X 2.14 Compute, or state not defined.
218

(a)
(c)
3
4

2
7

1
0
5
2
0 0.5

1 0
7
1 1
4
3 8
X 2.15 Where
A=

1
2
2
1
3
3
3

5 2
1
(d)
3 1
3

1
(b)
4
1
0

1
0

5
4
5
1
4
compute or state not defined.

(a) AB
(b) (AB)C
(c) BC
B=

2
4
1
1
1
1
1
1

2
5
C=

2
4
3
1
(d) A(BC)
2.16 Which products are defined?

(b) 2 3 times 3 2
(a) 3 2 times 2 3
(d) 33 times 22
(c) 2 2 times 3 3
X 2.17 Give the size of the product or state not defined.

(a) a 23 matrix times a 31 matrix
(b) a 112 matrix times a 121 matrix
(c) a 23 matrix times a 21 matrix
(d) a 22 matrix times a 22 matrix
X 2.18 Find the system of equations resulting from starting with
h1,1 x1 + h1,2 x2 + h1,3 x3 = d1
h2,1 x1 + h2,2 x2 + h2,3 x3 = d2
and making this change of variable (i.e., substitution).
x1 = g1,1 y1 + g1,2 y2
x2 = g2,1 y1 + g2,2 y2
x3 = g3,1 y1 + g3,2 y2
2.19 As Definition 2.3 points out, the matrix product operation generalizes the dot
product. Is the dot product of a 1n row vector and a n1 column vector the
same as their matrix-multiplicative product?
X 2.20 Represent the derivative map on Pn with respect to B, B where B is the natural
basis h1, x, . . . , xn i. Show that the product of this matrix with itself is defined;
what the map does it represent?
2.21 [Cleary] Match each type of matrix with all these descriptions that could fit:
(i) can be multiplied by its transpose to make a 11 matrix, (ii) is similar to the
33 matrix of all zeros, (iii) can represent a linear map from R3 to R2 that is not
onto, (iv) can represent an isomorphism from R3 to P2 .
(a) a 23 matrix whose rank is 1
(b) a 33 matrix that is nonsingular
(c) a 22 matrix that is singular
(d) an n1 column vector
2.22 Show that composition of linear transformations on R1 is commutative. Is this
true for any one-dimensional space?
2.23 Why is matrix multiplication not defined as entry-wise multiplication? That
would be easier, and commutative too.
X 2.24 (a) Prove that Hp Hq = Hp+q and (Hp )q = Hpq for positive integers p, q.
(b) Prove that (rH)p = rp Hp for any positive integer p and scalar r R.
X 2.25 (a) How does matrix multiplication interact with scalar multiplication: is
r(GH) = (rG)H? Is G(rH) = r(GH)?
219
(b) How does matrix multiplication interact with linear combinations: is F(rG +
sH) = r(FG) + s(FH)? Is (rF + sG)H = rFH + sGH?
2.26 We can ask how the matrix product operation interacts with the transpose
operation.
(a) Show that (GH)trans = Htrans Gtrans .
(b) A square matrix is symmetric if each i, j entry equals the j, i entry, that is,
if the matrix equals its own transpose. Show that the matrices HHtrans and
Htrans H are symmetric.
X 2.27 Rotation of vectors in R3 about an axis is a linear map. Show that linear maps
do not commute by showing geometrically that rotations do not commute.
2.28 In the proof of Theorem 2.12 we used some maps. What are the domains and
codomains?
2.29 How does matrix rank interact with matrix multiplication?
(a) Can the product of rank n matrices have rank less than n? Greater?
(b) Show that the rank of the product of two matrices is less than or equal to the
minimum of the rank of each factor.
2.30 Is commutes with an equivalence relation among nn matrices?
X 2.31 (We will use this exercise in the Matrix Inverses exercises.) Here is another
property of matrix multiplication that might be puzzling at first sight.
(a) Prove that the composition of the projections x , y : R3 R3 onto the x and
y axes is the zero map despite that neither one is itself the zero map.
(b) Prove that the composition of the derivatives d2 /dx2 , d3 /dx3 : P4 P4 is the
zero map despite that neither is the zero map.
(c) Give a matrix equation representing the first fact.
(d) Give a matrix equation representing the second.
When two things multiply to give zero despite that neither is zero we say that each
is a zero divisor.
2.32 Show that, for square matrices, (S + T )(S T ) need not equal S2 T 2 .
X 2.33 Represent the identity transformation id : V V with respect to B, B for any
basis B. This is the identity matrix I. Show that this matrix plays the role in matrix
multiplication that the number 1 plays in real number multiplication: HI = IH = H
(for all matrices H for which the product is defined).
2.34 In real number algebra, quadratic equations have at most two solutions. That
is not so with matrix algebra. Show that the 22 matrix equation T 2 = I has more
than two solutions, where I is the identity matrix (this matrix has ones in its 1, 1
and 2, 2 entries and zeroes elsewhere; see Exercise 33).
2.35 (a) Prove that for any 22 matrix T there are scalars c0 , . . . , c4 that are not
all 0 such that the combination c4 T 4 + c3 T 3 + c2 T 2 + c1 T + c0 I is the zero matrix
(where I is the 22 identity matrix, with 1s in its 1, 1 and 2, 2 entries and zeroes
elsewhere; see Exercise 33).
(b) Let p(x) be a polynomial p(x) = cn xn + + c1 x + c0 . If T is a square
matrix we define p(T ) to be the matrix cn T n + + c1 T + I (where I is the
appropriately-sized identity matrix). Prove that for any square matrix there is a
polynomial such that p(T ) is the zero matrix.
(c) The minimal polynomial m(x) of a square matrix is the polynomial of least
degree, and with leading coefficient 1, such that m(T ) is the zero matrix. Find
the minimal polynomial of this matrix.

3/2
1/2
1/2
3/2
220
(This is the representation with respect to E2 , E2 , the standard basis, of a rotation

through /6 radians counterclockwise.)
2.36 The infinite-dimensional space P of all finite-degree polynomials gives a memorable example of the non-commutativity of linear maps. Let d/dx : P P be the
usual derivative and let s : P P be the shift map.
s
a0 + a1 x + + an xn 7 0 + a0 x + a1 x2 + + an xn+1
Show that the two maps dont commute d/dx s 6= s d/dx; in fact, not only is
(d/dx s) (s d/dx) not the zero map, it is the identity map.
2.37 Recall the notation for the sum of the sequence of numbers a1 , a2 , . . . , an .
n
X
ai = a1 + a2 + + an
i=1
In this notation, the i, j entry of the product of G and H is this.

r
X
pi,j =
gi,k hk,j
k=1
Using this notation,

(a) reprove that matrix multiplication is associative;
(b) reprove Theorem 2.6.
IV.3
Mechanics of Matrix Multiplication
In this subsection we consider matrix multiplication as a mechanical process,

putting aside for the moment any implications about the underlying maps.
The striking thing about matrix multiplication is the way rows and columns
combine. The i, j entry of the matrix product is the dot product of row i of the
left matrix with column j of the right one. For instance, here a second row and
a third column combine to make a 2, 3 entry.
!
1 1
9 13
17 5
8 2
4 6
= 5 7
9 3
0 1
5 7
9 3
4 6
8 2
1 0
We can view this as the left matrix acting by multiplying its rows, one at a time,
into the columns of the right matrix. Or, another perspective is that the right
matrix uses its columns to act on the left matrixs rows. Below, we will examine
actions from the left and from the right for some simple matrices.
The action of a zero matrix is easy.
3.1 Example Multiplying by an appropriately-sized zero matrix from the left or
from the right results in a zero matrix.
!
!
!
!
!
!
0 0
1 3
2
0 0 0
2 3
0 0
0 0
=
=
0 0
1 1 1
0 0 0
1 4
0 0
0 0
The next easiest to understand matrices, after the zero matrices, are the ones
with a single nonzero entry.
221
3.2 Definition A matrix with all 0s except for a 1 in the i, j entry is an i, j unit
matrix.
3.3 Example This is the 1, 2
multiplying from the left.
0
0
unit matrix with three rows and two columns,
1
5
0
7
0
6
8
= 0
0
0
0
Acting from the left, an i, j unit matrix copies row j of the multiplicand into
row i of the result. From the right an i, j unit matrix picks out column i of the
multiplicand and copies it into column j of the result.
1 2 3
0 1
0 1
4 5 6 0 0 = 0 4
7 8 9
0 0
0 7
3.4 Example Rescaling these matrices simply rescales the result. This is the
action from the left of the matrix that is twice the one in the prior example.
!
0 2
14 16
5 6
= 0 0
0 0
7 8
0 0
0 0
And this is the action of
example.
4
7
the matrix that is 3 times the one from the prior

2
5
8
3
0
6 0
9
0

3
0

0 = 0
0
0
12
21
Next in complication are matrices with two nonzero entries. There are two
cases. If a left-multiplier has entries in different rows then their actions dont
interact.
3.5 Example
1 0
0 0
0 0
0
1
2 4
0
7
2
5
8
3
1
6 = (0
9
0
= 0
0
= 14
0

0
0 0

0 + 0 0
0
0 0

2 3
0 0

0 0 + 14 16
0 0
0 0
2
3
16 18
0
0
0
0
0

0
1

2) 4
0
7
18
0
2
5
8
6
9
222
But if the left-multipliers nonzero entries are in the same row then that row of
the result is a combination.
3.6 Example
0
0
2
1
0 4
0
7
0
0
0
2
5
8
3
1
6 = (0
9
0
= 0
0
15
= 0
0

0
0 0

0 + 0 0
0
0 0

2 3
14 16

0 0 + 0 0
0 0
0 0
18 21
0
0
0
0

2
1

0) 4
0
7
18
0
0
0
0
0
2
5
8
6
9
Right-multiplication acts in the same way, but with columns.

These observations about simple matrices extend to arbitrary ones.
3.7 Example Consider the columns of the product of two 22 matrices.
g1,1
g2,1
g1,2
g2,2
h1,1
h2,1
h1,2
h2,2
!
=
g1,1 h1,1 + g1,2 h2,1

g2,1 h1,1 + g2,2 h2,1
g1,1 h1,2 + g1,2 h2,2

g2,1 h1,2 + g2,2 h2,2
Each column is the result of multiplying G by the corresponding column of H.

h1,1
G
h2,1
!
=
g1,1 h1,1 + g1,2 h2,1

g2,1 h1,1 + g2,2 h2,1
h1,2
G
h2,2
!
=
g1,1 h1,2 + g1,2 h2,2

g2,1 h1,2 + g2,2 h2,2
3.8 Lemma In a product of two matrices G and H, the columns of GH are formed
by taking G times the columns of H
.
.
.
~
G
h1
..
.
.. ..
. .
~hn = G ~h1

..
..
.
.
..
.
G ~hn
..
.
and the rows of GH are formed by taking the rows of G times H
~g1 H
~g1
..
..
H=
.
.
~gr
~gr H
(ignoring the extra parentheses).

Proof We will check that in a product of 22 matrices, the rows of the product
223
equal the product of the rows of G with the entire matrix H.

!
!
!
(g1,1 g1,2 )H
g1,1 g1,2
h1,1 h1,2
=
g2,1 g2,2
h2,1 h2,2
(g2,1 g2,2 )H
=
(g1,1 h1,1 + g1,2 h2,1

(g2,1 h1,1 + g2,2 h2,1
g1,1 h1,2 + g1,2 h2,2 )

g2,1 h1,2 + g2,2 h2,2 )
We will leave the more general check as an exercise.
QED
An application of those observations is that there is a matrix that just copies

out the rows and columns.
3.9 Definition The main diagonal (or principle diagonal or diagonal) of a
square matrix goes from the upper left to the lower right.
3.10 Definition An identity matrix is square and every entry is 0 except for 1s
in the main diagonal.
1 0 ... 0
0 1 . . . 0
Inn =
..
0 0 ... 1
3.11 Example Here is the 22 identity matrix leaving its multiplicand unchanged
when it acts from the right.
1 2
1 2
!
0 2 1 0
0 2
1 1 0 1
1 1
4
3
4
3
3.12 Example Here the 33 identity leaves its multiplicand unchanged both from
the left
1 0 0
2 3 6
2 3 6
0 1 0 1 3 8 = 1 3 8
0 0 1
7 1 0
7 1 0
and from the right.
1
7
3
3
1
6
1
8 0
0
0
0
1
0

0
2

0 = 1
1
7
3
3
1
8
0
In short, an identity matrix is the identity element of the set of nn matrices

with respect to the operation of matrix multiplication.
We next see two ways to generalize the identity matrix. The first is that if
we relax the ones to arbitrary reals then the resulting matrix will rescale whole
rows or columns.
224
3.13 Definition A diagonal matrix is square and has 0s off the main diagonal.
a1,1
0
...
0
a2,2 . . .
0
0
..
...
an,n
3.14 Example From the left, the action of multiplication by a diagonal matrix is
to rescales the rows.
!
!
!
2
0
2 1 4 1
4
2
8 2
=
0 1
1 3 4
4
1 3 4 4
From the right such a matrix rescales the columns.
! 3 0
0
1 2 1
3 4
0 =
0 2
2 2 2
6 4
0 0 2
2
4
The second generalization of identity matrices is that we can put a single one
in each row and column in ways other than putting them down the diagonal.
3.15 Definition A permutation matrix is square and is all 0s except for a single 1
in each row and column.
3.16 Example From the left these matrices permute

0 0 1
1 2 3
7

1 0 0 4 5 6 = 1
0 1 0
7 8 9
4
From the right they permute columns.
0 0
1 2 3
4 5 6 1 0
7 8 9
0 1

1
2

0 = 5
8
0
rows.
8
2
5
3
6
3
6
9
4
7
We finish this subsection by applying these observations to get matrices that

perform Gausss Method and Gauss-Jordan reduction.
3.17 Example We have seen how to produce a matrix that will rescale rows.
Multiplying by this diagonal matrix rescales the second row of the other matrix
by a factor of three.
1 0 0
0
2 1
1
0 2 1
1
0 3 0 0 1/3 1 1 = 0 1 3 3
0 0 1
1
0 2
0
1 0 2
0
225
We have seen how to produce a matrix that will swap rows. Multiplying by this
permutation matrix swaps the first and third rows.
0 0 1
0 2 1
1
1 0 2
0
0 1 0 0 1 3 3 = 0 1 3 3
1 0 0
1 0 2
0
0 2 1
1
To see how to perform a row combination, we observe something about those
two examples. The matrix that rescales the second row by a factor of three
arises in this way from the identity.
1 0 0
1 0 0
32
0 1 0 0 3 0
0 0 1
0 0 1
Similarly, the matrix that swaps first and third
1 0 0
0
1 3
0 1 0 0
0 0 1
1
rows arises in this way.
0 1
1 0
0 0
3.18 Example The 33 matrix that arises as
1
1 0 0
22 +3
0 1 0 0
0 0 1
0
0
1
2
will, when it acts from the left,
1
0 0
1
0
1
0
0
0 2 1
0
0
1
perform the combination operation 22 + 3 .

1 0
2
0
0 2
0

1 3 3 = 0 1
3 3
2 1
1
0 0 5
7
3.19 Definition The elementary reduction matrices result from applying a one
Gaussian operation to an identity matrix.
ki
(1) I Mi (k) for k 6= 0

i j
(2) I Pi,j for i 6= j

ki +j
(3) I Ci,j (k) for i 6= j

3.20 Lemma Gaussian reduction can be done through matrix multiplication.
ki
(1) If H G then Mi (k)H = G.

i j
(2) If H G then Pi,j H = G.

ki +j
(3) If H G then Ci,j (k)H = G.
226
Proof Clear.
QED
3.21 Example This is the first system, from the first chapter, on which we
performed Gausss Method.
3x3 = 9
x1 + 5x2 2x3 = 2
(1/3)x1 + 2x2
=3
We can reduce it
0
1
with matrix multiplication. Swap the first and third rows,
0 1
0 0
3 9
1/3 2
0 3
1 0 1 5 2 2 = 1 5 2 2
0 0
1/3 2
0 3
0 0
3 9
triple the first row,
3 0
0 1
0 0
and then add 1
1
0
0
1/3
0 1
1
0
2
5
0

3
1 6

2 = 1 5
9
0 0
0
2
3
2
9
the second.

9
1
6

2 = 0 1
9
0
0
0
2
3
7
9
0
2
3
times the first row to
1 6
0
0 0
1 0 1 5 2
0 1
0 0
3
Now back substitution will give the solution.

3.22 Example Gauss-Jordan reduction works the same way. For the matrix ending
the prior example, first adjust the leading entries
1
0
0
1
6
0
9
1 6 0 9
0 0 1 2 7 = 0 1 2 7
0 1
0
0
3
0 0 1 3
0
0 1/3
9
and to finish, clear the third column and
1 6 0
1 0
0
1
1 0 0 1 2 0
0
0
0 1
0 0
1
0
then the second column.

1 0 0 3
6 0 9

1 2 7 = 0 1 0 1
0 1 3
0 0 1 3
3.23 Corollary For any matrix H there are elementary reduction matrices R1 , . . . ,
Rr such that Rr Rr1 R1 H is in reduced echelon form.
Until now we have taken the point of view that our primary objects of study
are vector spaces and the maps between them, and have adopted matrices only
for computational convenience. This subsection show that this isnt the whole
story. Understanding matrices operations by how the entries combine can be
useful also. In the rest of this book we shall continue to focus on maps as the
primary objects but we will be pragmatic if the matrix point of view gives
some clearer idea then we will go with it.
227
Exercises
X 3.24 Predict the result of each multiplication by an elementary reduction matrix,
and then
check
by multiplying

it out.

3 0
1 2
4 0
1 2
1 0
1 2
(a)
(b)
(c)
0 0
3 4
0 2
3 4
2 1
3 4

1 2
1 1
1 2
0 1
(d)
(e)
3 4
0
1
3 4
1 0
X 3.25 This table gives the number of hours of each type done by each worker, and
the associated pay rates. Use matrices to compute the wages due.
regular overtime
wage
Alan
40
12
regular
$25.00
Betty
overtime $45.00
35
6
40
18
Catherine
Donald
28
0
Remark. This illustrates that in practice we often want to compute linear combinations of rows and columns in a context where we really arent interested in any
associated linear maps.
X 3.26 The need to take linear combinations of rows and columns in tables of numbers
arises often in practice. For instance, this is a map of part of Vermont and New
York.
Swanton
In part because of Lake Champlain,

there are no roads directly connecting some pairs of towns. For instance, there is no way to go from
Winooski to Grand Isle without going through Colchester. (To simplify the graph many other roads
and towns have been omitted. From
top to bottom of this map is about
forty miles.)
Grand Isle
Colchester
Winooski
Burlington
(a) The incidence matrix of a map is the square matrix whose i, j entry is the
number of roads from city i to city j. Produce the incidence matrix of this map
(take the cities in alphabetical order).
(b) A matrix is symmetric if it equals its transpose. Show that an incidence
matrix is symmetric. (These are all two-way streets. Vermont doesnt have many
one-way streets.)
(c) What is the significance of the square of the incidence matrix? The cube?
3.27 Find the product of this matrix with its transpose.

cos sin
sin
cos
X 3.28 Prove that the diagonal matrices form a subspace of Mnn . What is its
dimension?
3.29 Does the identity matrix represent the identity map if the bases are unequal?
228
3.30 Show that every multiple of the identity commutes with every square matrix.
Are there other matrices that commute with all square matrices?
3.31 Prove or disprove: nonsingular matrices commute.
X 3.32 Show that the product of a permutation matrix and its transpose is an identity
matrix.
3.33 Show that if the first and second rows of G are equal then so are the first and
second rows of GH. Generalize.
3.34 Describe the product of two diagonal matrices.
3.35 Write

1 0
3 3
as the product of two elementary reduction matrices.
X 3.36 Show that if G has a row of zeros then GH (if defined) has a row of zeros. Does
that work for columns?
3.37 Show that the set of unit matrices forms a basis for Mnm .
3.38 Find the formula for the n-th power of this matrix.

1 1
1 0
X 3.39 The trace of a square matrix is the sum of the entries on its diagonal (its
significance appears in Chapter Five). Show that Tr(GH) = Tr(HG).
X 3.40 A square matrix is upper triangular if its only nonzero entries lie above, or
on, the diagonal. Show that the product of two upper triangular matrices is upper
triangular. Does this hold for lower triangular also?
3.41 A square matrix is a Markov matrix if each entry is between zero and one and
the sum along each row is one. Prove that a product of Markov matrices is Markov.
X 3.42 Give an example of two matrices of the same rank with squares of differing
rank.
3.43 Combine the two generalizations of the identity matrix, the one allowing entries
to be other than ones, and the one allowing the single one in each row and column
to be off the diagonal. What is the action of this type of matrix?
3.44 On a computer multiplications have traditionally been more costly than additions, so people have tried to in reduce the number of multiplications used to
compute a matrix product.
(a) How many real number multiplications do we need in the formula we gave for
the product of a mr matrix and a rn matrix?
(b) Matrix multiplication is associative, so all associations yield the same result.
The cost in number of multiplications, however, varies. Find the association
requiring the fewest real number multiplications to compute the matrix product
of a 510 matrix, a 1020 matrix, a 205 matrix, and a 51 matrix.
(c) (Very hard.) Find a way to multiply two 2 2 matrices using only seven
multiplications instead of the eight suggested by the naive approach.
? 3.45 [Putnam, 1990, A-5] If A and B are square matrices of the same size such that
ABAB = 0, does it follow that BABA = 0?
3.46 [Am. Math. Mon., Dec. 1966] Demonstrate these four assertions to get an alternate proof that column rank equals row rank.
(a) ~y ~y = ~0 iff ~y = ~0.
(b) A~x = ~0 iff Atrans A~x = ~0.
(c) dim(R(A)) = dim(R(Atrans A)).
229
(d) col rank(A) = col rank(Atrans ) = row rank(A).

3.47 [Ackerson] Prove (where A is an nn matrix and so defines a transformation of
any n-dimensional space V with respect to B, B where B is a basis) that dim(R(A)
N (A)) = dim(R(A)) dim(R(A2 )). Conclude
(a) N (A) R(A) iff dim(N (A)) = dim(R(A)) dim(R(A2 ));
(b) R(A) N (A) iff A2 = 0;
(c) R(A) = N (A) iff A2 = 0 and dim(N (A)) = dim(R(A)) ;
(d) dim(R(A) N (A)) = 0 iff dim(R(A)) = dim(R(A2 )) ;
(e) (Requires the Direct Sum subsection, which is optional.) V = R(A) N (A)
iff dim(R(A)) = dim(R(A2 )).
IV.4
Inverses
We finish this section by considering how to represent the inverse of a linear

map.
We first recall some things about inverses. Where : R3 R2 is the
projection map and : R2 R3 is the embedding

!
!
x
x
x
x

7 y
y 7
y
y
z
0
then the composition is the identity map = id on R2 .

!
!
x
x
x

7 y 7
y
y
0
We say that is a right inverse of or, what is the same thing, that is a
left inverse of . However, composition in the other order doesnt give the
identity map here is a vector that is not sent to itself under .

!
0
0
0

7 0
0 7
0
1
0
In fact, has no left inverse at all. For, if f were to be a left inverse of then
we would have

!
x
x
x
f

7 y
y 7
y
z
z
for all of the infinitely many zs. But no function can send a single argument to
more than one value. (An example of a function with no inverse on either side
is the zero transformation on R2 .)
More information on function inverses is in the appendix.
230
Some functions have a two-sided inverse, another function that is the inverse
of the first both from the left and from the right. For instance, the map given
by ~v 7 2 ~v has the two-sided inverse ~v 7 (1/2) ~v. The appendix shows that a
function has a two-sided inverse if and only if it is both one-to-one and onto.
The appendix also shows that if a function f has a two-sided inverse then it is
unique, and so we call it the inverse and denote it f1 .
In addition, recall that we have shown in Theorem II.2.21 that if a linear
map has a two-sided inverse then that inverse is also linear.
Thus, our goal in this subsection is, where a linear h has an inverse, to find
the relationship between RepB,D (h) and RepD,B (h1 ).
4.1 Definition A matrix G is a left inverse matrix of the matrix H if GH is the
identity matrix. It is a right inverse matrix if HG is the identity. A matrix H
with a two-sided inverse is an invertible matrix. That two-sided inverse is the
inverse matrix and is denoted H1 .
Because of the correspondence between linear maps and matrices, statements
about map inverses translate into statements about matrix inverses.
4.2 Lemma If a matrix has both a left inverse and a right inverse then the two
are equal.
4.3 Theorem A matrix is invertible if and only if it is nonsingular.
Proof (For both results.) Given a matrix H, fix spaces of appropriate dimension
for the domain and codomain. Fix bases for these spaces. With respect to these
bases, H represents a map h. The statements are true about the map and
therefore they are true about the matrix.
QED
4.4 Lemma A product of invertible matrices is invertible: if G and H are invertible
and if GH is defined then GH is invertible and (GH)1 = H1 G1 .
Proof Because the two matrices are invertible they are square. Because their
product is defined they must be square of the same dimension, nn. So by fixing
a basis for Rn we can use the standard basis we get maps g, h : Rn Rn
that are associated with the matrices, G = RepEn ,En (g) and H = RepEn ,En (h).
Consider h1 g1 . By the prior paragraph this composition is defined. This
map is a two-sided inverse of gh since (h1 g1 )(gh) = h1 (id)h = h1 h = id
and (gh)(h1 g1 ) = g(id)g1 = gg1 = id. the matrices representing the maps
reflect this equality.
QED
This is the arrow diagram giving the relationship between map inverses and
matrix inverses. It is a special case of the diagram for function composition and
matrix multiplication.
231
Wwrt C
h1
h
H
id
I
Vwrt B
Vwrt B
Beyond its place in our general program of seeing how to represent map
operations, another reason for our interest in inverses comes from solving linear
systems. A linear system is equivalent to a matrix equation, as here.
!
!
!
x1 + x2 = 3
1
1
x1
3
=
()
2x1 x2 = 2
2 1
x2
2
By fixing spaces and bases (for instance, R2 , R2 with the standard bases), we
take the matrix H to represent a map h. The matrix equation then becomes
this linear map equation.
h(~x) = ~d
()
Asking for a solution to () is the same as asking in () for the domain vector ~x
that h maps to the result ~d . If we had a left inverse map g then we could apply
it to both sides g h(~x) = g(~d), which simplifies to ~x = g(~d). In terms of the
matrices, we multiply RepC,B (g) RepC (~d) to get RepB (~x).
4.5 Example We can find a left inverse for the matrix just given
!
!
!
m n
1
1
1 0
=
p q
2 1
0 1
by using Gausss Method to solve the resulting linear system.
m + 2n
m n
=1
=0
p + 2q = 0
p q=1
Answer: m = 1/3, n = 1/3, p = 2/3, and q = 1/3. This matrix is actually the
two-sided inverse of H; the check is easy. With it we can solve the system ()
above.
!
! !
!
x
1/3
1/3
3
5/3
=
=
y
2/3 1/3
2
4/3
4.6 Remark Why do this when we have Gausss Method? Beyond the conceptual
appeal of representing the map inverse operation, solving linear systems this
way has at least two advantages.
First, once we have done the work of finding an inverse then solving a system
with the same coefficients but different constants is fast: if we change the entries
on the right of the system () then we get a related problem
!
!
!
1
1
x
5
=
2 1
y
1
232
that our inverse method solves quickly.

!
! !
x
1/3
1/3
5
=
=
y
2/3 1/3
1
2
3
Another advantage of inverses is that we can explore a systems sensitivity

to changes in the constants. For example, tweaking the 3 on the right of the
system () to
!
!
!
1
2
1
1
x1
x2
and solving with the inverse

!
!
1/3
1/3
3.01
=
2/3 1/3
2
3.01
2
(1/3)(3.01) + (1/3)(2)
(2/3)(3.01) (1/3)(2)
shows that the first component of the solution changes by 1/3 of the tweak,
while the second component moves by 2/3 of the tweak. This is sensitivity
analysis. For instance, we could use it to decide how accurately we must specify
the data in a linear model to ensure that the solution has a desired accuracy.
We finish by describing the computational procedure that we shall use to
find the inverse matrix.
4.7 Lemma A matrix H is invertible if and only if it can be written as the product
of elementary reduction matrices. We can compute the inverse by applying
to the identity matrix the same row steps, in the same order, as we use to
Gauss-Jordan reduce H.
Proof The matrix H is invertible if and only if it is nonsingular and thus
Gauss-Jordan reduces to the identity. By Corollary 3.23 we can do this reduction

with elementary matrices.
Rr Rr1 . . . R1 H = I
(*)
For the first sentence of the result, note that elementary matrices are invertible
(because elementary row operations are reversible) and that their inverses are
1
also elementary. Apply R1
r from the left to both sides of (). Then apply Rr1 ,
1
etc. The result gives H as the product of elementary matrices H = R1
1 Rr I
(the I here covers the trivial r = 0 case).
For the second sentence, rewrite () as (Rr Rr1 . . . R1 ) H = I to recognize
that H1 = Rr Rr1 . . . R1 I. Restated, applying R1 to the identity, followed
by R2 , etc., yields the inverse of H.
QED
4.8 Example To find the inverse of
1
2
1
1
233
we do Gauss-Jordan reduction, meanwhile performing the same operations on

the identity. For clerical convenience we write the matrix and the identity
side-by-side, and do the reduction steps together.
!
!
1
1
1 0
1
1 1 0
21 +2
2 1 0 1
0 3 2 1
!
1 1
1
0
1/32
0 1 2/3 1/3
!
1 0 1/3
1/3
2 +1
0 1 2/3 1/3
This calculation has found the inverse.
!1
1
1
=
2 1
1/3
2/3
1/3
1/3
4.9 Example This one happens to start with a row swap.
0
3 1 1 0 0
1
0
1
1 2
1
0
1
0
1
0
0
3
1
1 1
0 0 0 1
1 1
0
1
0
1
1 +3
3 1
0
0 1 1
0
1
0
0
1
0
0
1
1 0
0 0
1 1
1
0
0
..
.
0
0
0
1
0
0
0
1
1/4
1/4
1/4
1/4
1/4
3/4
3/4
1/4
3/4
4.10 Example We can detect a non-invertible matrix when the left half wont
reduce to the identity.
!
!
1 1 1 0 21 +2 1 1
1 0
2 2 0 1
0 0 2 1
With this procedure we can give a formula for the inverse of a general 22
matrix, which is worth memorizing. But larger matrices have more complex
formulas so we will wait for more explanation in the next chapter.
4.11 Corollary The inverse for a 22 matrix exists and equals
a
c
if and only if ad bc 6= 0.
b
d
!1
1
=
ad bc
d
c
b
a
234
Proof This computation is Exercise 21.
QED
We have seen here, as in the Mechanics of Matrix Multiplication subsection,

that we can exploit the correspondence between linear maps and matrices. So
we can fruitfully study both maps and matrices, translating back and forth to
whichever helps the most.
Over this whole section we have developed an algebra system for matrices.
We can compare it with the familiar algebra system for the real numbers. Here
we are working not with numbers but with matrices. We have matrix addition
and subtraction operations, and they work in much the same way as the real
number operations, except that they only combine same-sized matrices. We
have scalar multiplication, which is in some ways another extension of real
number multiplication. We also have a matrix multiplication operation and
a multiplicative inverse. These operations are somewhat like the familiar real
number ones (associativity, and distributivity over addition, for example), but
there are differences (failure of commutativity). This matrix system provides an
example that algebra systems other than the elementary real number system
can be interesting and useful.
Exercises
4.12 Supply the intermediate steps in Example 4.9.
X 4.13 Use
has an inverse.
Corollary
4.11 to
decideif each matrix

2 1
0
4
2 3
(a)
(b)
(c)
1 1
1 3
4
6
X 4.14 For each invertible matrix in the prior problem, use Corollary 4.11 to find its
inverse.
X 4.15 Find the inverse, if it exists, by using the Gauss-Jordan Method. Check the
answers for the 22 matrices with Corollary 4.11.

1 1 3
3 1
2 1/2
2 4
(a)
(b)
(c)
(d) 0 2 4
0 2
3
1
1
2
1 1 0
0
1
5
2
2
3
(e) 0 2
(f) 1 2 3
4
2
3 2
4 2 3
X 4.16 What matrix has this one for its
inverse?

1 3
2 5
4.17 How does the inverse operation interact with scalar multiplication and addition
of matrices?
(a) What is the inverse of rH?
(b) Is (H + G)1 = H1 + G1 ?
X 4.18 Is (T k )1 = (T 1 )k ?
4.19 Is H1 invertible?
4.20 For each real number let t : R2 R2 be represented with respect to the
standard bases by this matrix.

cos sin
sin
cos
Show that t1 +2 = t1 t2 . Show also that t 1 = t .
X
X
235
4.21 Do the calculations for the proof of Corollary 4.11.

4.22 Show that this matrix

1 0 1
H=
0 1 0
has infinitely many right inverses. Show also that it has no left inverse.
4.23 In the review of inverses example, starting this subsection, how many left
inverses has ?
4.24 If a matrix has infinitely many right-inverses, can it have infinitely many
left-inverses? Must it have?
4.25 Assume that g : V W is linear. One of these is true, the other is false. Which
is which?
(a) If f : W V is a left inverse of g then f must be linear.
(b) If f : W V is a right inverse of g then f must be linear.
4.26 Assume that H is invertible and that HG is the zero matrix. Show that G is a
zero matrix.
4.27 Prove that if H is invertible then the inverse commutes with a matrix GH1 =
H1 G if and only if H itself commutes with that matrix GH = HG.
4.28 Show that if T is square and if T 4 is the zero matrix then (IT )1 = I+T +T 2 +T 3 .
Generalize.
4.29 Let D be diagonal. Describe D2 , D3 , . . . , etc. Describe D1 , D2 , . . . , etc.
Define D0 appropriately.
4.30 Prove that any matrix row-equivalent to an invertible matrix is also invertible.
4.31 The first question below appeared as Exercise 29.
(a) Show that the rank of the product of two matrices is less than or equal to the
minimum of the rank of each.
(b) Show that if T and S are square then T S = I if and only if ST = I.
4.32 Show that the inverse of a permutation matrix is its transpose.
4.33 The first two parts of this question appeared as Exercise 26.
(a) Show that (GH)trans = Htrans Gtrans .
(b) A square matrix is symmetric if each i, j entry equals the j, i entry (that is, if
the matrix equals its transpose). Show that the matrices HHtrans and Htrans H
are symmetric.
(c) Show that the inverse of the transpose is the transpose of the inverse.
(d) Show that the inverse of a symmetric matrix is symmetric.
4.34 The items starting this question appeared as Exercise 31.
(a) Prove that the composition of the projections x , y : R3 R3 is the zero
map despite that neither is the zero map.
(b) Prove that the composition of the derivatives d2 /dx2 , d3 /dx3 : P4 P4 is the
zero map despite that neither map is the zero map.
(c) Give matrix equations representing each of the prior two items.
When two things multiply to give zero despite that neither is zero, each is said to
be a zero divisor. Prove that no zero divisor is invertible.
4.35 In real number algebra, there are exactly two numbers, 1 and 1, that are
their own multiplicative inverse. Does H2 = I have exactly two solutions for 22
matrices?
4.36 Is the relation is a two-sided inverse of transitive? Reflexive? Symmetric?
4.37 [Am. Math. Mon., Nov. 1951] Prove: if the sum of the elements of a square
matrix is k, then the sum of the elements in each row of the inverse matrix is 1/k.
236
Change of Basis
Representations vary with the bases. For instance, ~e1 R2 has two different
representations
!
!
1
1/2
RepE2 (~e1 ) =
RepB (~e1 ) =
0
1/2
with respect to the standard basis and this one.
!
!
1
1
B=h
,
i
1
1
The same is true for maps; with respect to the basis pairs E2 , E2 and E2 , B, the
identity map has two different representations.
!
!
1 0
1/2
1/2
RepE2 ,E2 (id) =
RepE2 ,B (id) =
0 1
1/2 1/2
With our point of view that the objects of our studies are vectors and maps, by
fixing bases we are adopting a scheme of tags or names for these objects that
are convenient for calculations. We will now see how to translate among these
names, so we will see exactly how the representations vary as the bases vary.
V.1
Changing Representations of Vectors
In converting RepB (~v) to RepD (~v) the underlying vector ~v doesnt change. Thus,
this translation is accomplished by the identity map on the space, described
so that the domain space vectors are represented with respect to B and the
codomain space vectors are represented with respect to D.
Vwrt B
idy
Vwrt D
(The diagram is vertical to fit with the ones in the next subsection.)
1.1 Definition The change of basis matrix for bases B, D V is the representation of the identity map id : V V with respect to those bases.
..
.
~
RepB,D (id) =
RepD (1 )
..
.
..
.
~ n )
RepD (
..
.
Section V. Change of Basis
237
1.2 Remark Perhaps a better name would be change of representation matrix

but this one is standard.
1.3 Lemma Left-multiplication by the change of basis matrix for B, D converts
a representation with respect to B to one with respect to D. Conversely, if
left-multiplication by a matrix changes bases M RepB (~v) = RepD (~v) then M is
a change of basis matrix.
Proof The first sentence holds because matrix-vector multiplication represents
a map application RepB,D (id) RepB (~v) = RepD ( id(~v) ) = RepD (~v) for each ~v.
For the second sentence, with respect to B, D the matrix M represents a linear
map whose action is to map each vector to itself, and is therefore the identity
map.
QED
1.4 Example With these bases for R2 ,
!
!
2
1
B=h
,
i
1
0
!
!
1
1
D=h
,
i
1
1
because
!
2
RepD ( id(
)) =
1
1/2
3/2
!
D
!
1
RepD ( id(
)) =
0
!
1/2
1/2
the change of basis matrix is this.

RepB,D (id) =
1/2
3/2
!
1/2
1/2
For instance, if we finding the representations of ~e2

!
!
!
0
1
0
RepB (
)=
RepD (
)=
1
2
1
then the matrix will do the conversion.
!
!
1/2 1/2
1
=
3/2
1/2
2
1/2
1/2
1/2
1/2
We finish this subsection by recognizing that the change of basis matrices

form a familiar set.
1.5 Lemma A matrix changes bases if and only if it is nonsingular.
Proof For the only if direction, if left-multiplication by a matrix changes
bases then the matrix represents an invertible function, simply because we can
invert the function by changing the bases back. Such a matrix is itself invertible,
and so is nonsingular.
238
To finish we will show that any nonsingular matrix M performs a change of

basis operation from any given starting basis B to some ending basis. Because the
matrix is nonsingular it will Gauss-Jordan reduce to the identity. If the matrix
is the identity I then the statement is obvious. Otherwise there are elementary
reduction matrices such that Rr R1 M = I with r > 1. Elementary matrices
are invertible and their inverses are also elementary so multiplying both sides of
that equation from the left by Rr 1 , then by Rr1 1 , etc., gives M as a product
of elementary matrices M = R1 1 Rr 1 . (Weve combined Rr 1 I to make
Rr 1 ; because r > 1 we can always make the I disappear in this way, which we
need to do because it isnt an elementary matrix.)
Thus, we will be done if we show that elementary matrices change a given
basis to another basis, for then Rr 1 changes B to some other basis Br , and
Rr1 1 changes Br to some Br1 , etc., and the net effect is that M changes B
to B1 . We will prove this by covering the three types of elementary matrices
separately; here are the three cases.

c1
c1
c1
c1

.. ..
..
..
. .
.
c1
c1
.
. .
c c
c c
.. ..
i
j
i
i

.. ..
..
..
Mi (k) ci = kci Pi,j . = . Ci,j (k) . =

.
. .
. .
. .
cj ci
cj kci + cj
.. ..
..
..
cn
cn
. .
.
.
cn
cn
cn
cn
Applying a row-multiplication matrix Mi (k) changes a representation with

~ 1, . . . ,
~ i, . . . ,
~ n i to one with respect to h
~ 1 , . . . , (1/k)
~ i, . . . ,
~ n i.
respect to h
~ 1 + + ci
~ i + + cn
~n
~v = c1
~ 1 + + kci (1/k)
~ i + + cn
~ n = ~v
7 c1
We can easily see that the second one is a basis, given that the first is a basis
and that k 6= 0 is a restriction in the definition of a row-multiplication matrix.
Similarly, left-multiplication by a row-swap matrix Pi,j changes a representation
~ 1, . . . ,
~ i, . . . ,
~ j, . . . ,
~ n i into one with respect to
with respect to the basis h
~
~
~
~
this basis h1 , . . . , j , . . . , i , . . . , n i.
~ 1 + + ci
~ i + + cj
~ j + + cn
~n
~v = c1
~ 1 + + cj
~ j + + ci
~ i + + cn
~ n = ~v
7 c1
~ 1, . . . ,
~ i, . . . ,
~ j, . . . ,
~ n i changes via
And, a representation with respect to h
left-multiplication by a row-combination matrix Ci,j (k) into a representation
~ 1, . . . ,
~ i k
~ j, . . . ,
~ j, . . . ,
~ ni
with respect to h
~ 1 + + ci
~ i + cj
~ j + + cn
~n
~v = c1
~ 1 + + ci (
~ i k
~ j ) + + (kci + cj )
~ j + + cn
~ n = ~v
7 c1
239
(the definition of reduction matrices specifies that i 6= j and k 6= 0).
QED
1.6 Corollary A matrix is nonsingular if and only if it represents the identity map
with respect to some pair of bases.
In the next subsection we will see how to translate among representations
of maps, that is, how to change RepB,D (h) to RepB,
D
(h). The above corollary
is a special case of this, where the domain and range are the same space, and
where the map is the identity map.
Exercises
X 1.7 In R2 , where
D=h

2
2
,
i
1
4
find the change of basis matrices from D to E2 and from E2 to D. Multiply the
two.
X 1.8 Find the change of basis matrix for B, D R2 .
1
1
(b) B = E2 , D = h
,
i
(a) B = E2 , D = h~e2 , ~e1 i
2
4

1
1
1
2
0
1
(c) B = h
,
i, D = E2
(d) B = h
,
i, D = h
,
i
2
4
1
2
4
3
1.9 For the bases in Exercise 8, find the change of basis matrix in the other direction,
from D to B.
X 1.10 Find the change of basis matrix for each B, D P2 .
(a) B = h1, x, x2 i, D = hx2 , 1, xi
(b) B = h1, x, x2 i, D = h1, 1 + x, 1 + x + x2 i
(c) B = h2, 2x, x2 i, D = h1 + x2 , 1 x2 , x + x2 i
2
X 1.11 Decide
ifeach changes

bases
on R. To what
basis is E2 changed?

5 0
2 1
1
4
1 1
(a)
(b)
(c)
(d)
0 4
3 1
2 8
1
1
1.12 Find bases such that this matrix represents the identity map with respect to
those bases.
3
1 4
2 1 1
1.13 Consider the vector space of real-valued functions with basis hsin(x), cos(x)i.
Show that h2 sin(x) + cos(x), 3 cos(x)i is also a basis for this space. Find the change
of basis matrix in each direction.
1.14 Where does this matrix

cos(2)
sin(2)
sin(2)
cos(2)
send the standard basis for R2 ? Any other bases? Hint. Consider the inverse.
X 1.15 What is the change of basis matrix with respect to B, B?
1.16 Prove that a matrix changes bases if and only if it is invertible.
1.17 Finish the proof of Lemma 1.5.
X 1.18 Let H be a nn nonsingular matrix. What basis of Rn does H change to the
standard basis?
240

(a) In P3 with basis B = h1+x, 1x, x2 +x3 , x2 x3 i we have this representation.

0
1
2
3
RepB (1 x + 3x x ) =
1
2 B
Find a basis D giving this different representation for the same polynomial.

1
0
2
3
RepD (1 x + 3x x ) =
2
0 D
X 1.19
(b) State and prove that we can change any nonzero vector representation to any
other.
Hint. The proof of Lemma 1.5 is constructive it not only says the bases change,
it shows how they change.
be bases for V and D, D
be bases for
1.20 Let V, W be vector spaces, and let B, B
W. Where h : V W is linear, find a formula relating RepB,D (h) to RepB,
D
(h).
X 1.21 Show that the columns of an n n change of basis matrix form a basis for
Rn . Do all bases appear in that way: can the vectors from any Rn basis make the
columns of a change of basis matrix?
X 1.22 Find a matrix having this effect.

1
4
7
3
1
That is, find a M that left-multiplies the starting vector to yield the ending vector.
Is there
two
effects?
amatrix
having
these

1
1
2
1
1
1
2
1
(a)
7
7
(b)
7
7
3
1
1
1
3
1
6
1
Give a necessary and sufficient condition for there to be a matrix such that ~v1 7 w
~1
and ~v2 7 w
~ 2.
V.2
Changing Map Representations
The first subsection shows how to convert the representation of a vector with
respect to one basis to the representation of that same vector with respect to
another basis. Here we will see how to convert the representation of a map with
respect to one pair of bases to the representation of that map with respect to a
different pair, how to change RepB,D (h) to RepB,
D
(h).
That is, we want the relationship between the matrices in this arrow diagram.
h
Vwrt B Wwrt D
H
idy
idy
h
Vwrt B Wwrt D
To move from the lower-left of this diagram to the lower-right we can either
go straight over, or else up to VB then over to WD and then down. So we
241
= Rep (h) either by simply using B

and D,
or else by first
can calculate H
B,D
changing bases with RepB,B
(id) then multiplying by H = RepB,D (h) and then
changing bases with RepD,D
(id).
This equation summarizes.
= Rep (id) H Rep (id)
H
D,D
B,B
()
(To compare this equation with the sentence before it, remember to read the
equation from right to left because we read function composition from right to
left and matrix multiplication represents composition.)
2.1 Example The matrix
cos(/6) sin(/6)
sin(/6)
cos(/6)
T=
!
=
3/2 1/2
3/2
1/2
represents, with respect to E2 , E2 , the transformation t : R2 R2 that rotates

vectors /6 radians counterclockwise.

(3 + 3)/2
(1 + 3 3)/2

1
3
t/6
We can translate that to a representation with respect to

! !
! !
1
0
1
2
=h
=h
B
i
D
i
1
2
0
3
by using the arrow diagram and formula () above.
t
R2wrt E2 R2wrt E2
T
idy
idy
T = RepE2 ,D
(id) T RepB,E
2 (id)
R2wrt B R2wrt D
Note that RepE2 ,D

(id) is the matrix inverse of RepD,E
2 (id).
RepB,
D
(t) =
=
!1
!
2
3/2 1/2
1
3
1/2
3/2
1
!
(5 3)/6 (3 + 2 3)/3
(1 + 3)/6
3/3
1
0
0
2
Although the new matrix is messier, the map that it represents is the same. For
instance, to replicate the effect of t in the picture, start with B,

!
!
1
1
RepB (
)=
3
1
B
242
apply T ,
(5 3)/6
(1 + 3)/6
and check it against D
11 + 3 3
(3 + 2 3)/3
3/3
B,D
1
0
1+3 3
+
1
1
!
=
2
3
(11 + 3 3)/6
(1 + 3 3)/6
!
=
(3 + 3)/2
(1 + 3 3)/2
and it gives the same outcome as above.

2.2 Example We may make the matrix simpler by changing bases. On R3 the
map

x
y+z
t
y 7 x + z
z
x+y
is represented with respect to the standard basis
0 1
RepE3 ,E3 (t) = 1 0

1 1
in this way.
1
0
Represented with respect to

1
1
1

B = h1 , 1 , 1i
2
1
0
gives a matrix that is diagonal.
RepB,B (t) = 0
0
0
1
0
0
2
Naturally we usually prefer basis changes that make the representation easier
to understand. We say that a map or matrix has been diagonalized when its
representation is diagonal with respect to B, B, that is, with respect to equal
starting and ending bases. In Chapter Five we shall see which maps and matrices
are diagonalizable. In the rest of this subsection we consider the easier case
where representations are with respect to B, D, which are possibly different
starting and ending bases. Recall that the prior subsection shows that a matrix
changes bases if and only if it is nonsingular. That gives us another version of
the above arrow diagram and equation () from the start of this subsection.
are matrix equivalent if there are
2.3 Definition Same-sized matrices H and H
nonsingular matrices P and Q such that H = PHQ.
243
2.4 Corollary Matrix equivalent matrices represent the same map, with respect
to appropriate pairs of bases.
Exercise 19 checks that matrix equivalence is an equivalence relation. Thus
it partitions the set of matrices into matrix equivalence classes.
All matrices:
H matrix equivalent
to H
...
We can get some insight into the classes by comparing matrix equivalence with
row equivalence (remember that matrices are row equivalent when they can
= PHQ, the matrices P
be reduced to each other by row operations). In H
and Q are nonsingular and thus we can write each as a product of elementary
reduction matrices (Lemma 4.7). Left-multiplication by the reduction matrices
making up P has the effect of performing row operations. Right-multiplication
by the reduction matrices making up Q performs column operations. Therefore,
matrix equivalence is a generalization of row equivalence two matrices are row
equivalent if one can be converted to the other by a sequence of row reduction
steps, while two matrices are matrix equivalent if one can be converted to the
other by a sequence of row reduction steps followed by a sequence of column
reduction steps.
Thus, if matrices are row equivalent then they are also matrix equivalent
(since we can take Q to be the identity matrix and so perform no column
operations). The converse, however, does not hold: two matrices can be matrix
equivalent but not row equivalent.
2.5 Example These two
1
0
0
0
1
0
1
0
are matrix equivalent because the second reduces to the first by the column
operation of taking 1 times the first column and adding to the second. They
are not row equivalent because they have different reduced echelon forms (in
fact, both are already in reduced form).
We will close this section by finding a set of representatives for the matrix
equivalence classes.
2.6 Theorem Any mn matrix of rank k is matrix equivalent to the mn matrix
More information on class representatives is in the appendix.
244
that is all zeros except that the first k diagonal entries are ones.
1
0
0
1
..
.
0
0
..
.
0
...
...
0
0
0
0
...
...
...
...
1
0
0
0
...
...
...
...
0
0
This is a block partial-identity form.

I
Z
Z
Z
Proof As discussed above, Gauss-Jordan reduce the given matrix and combine
all the reduction matrices used there to make P. Then use the leading entries to
do column reduction and finish by swapping columns to put the leading ones on
the diagonal. Combine the reduction matrices used for those column operations
into Q.
QED
2.7 Example We illustrate the proof
0
2
by finding the P and Q for this matrix.
2 1 1
0 1 1
4 2 2
First Gauss-Jordan row-reduce.
1 1 0
1 0 0
1
1 0 0 1 0 0
0
0
0 1
2 0 1
2
2
0
4

1 1
1

1 1 = 0
2 2
0
2
0
0
Then column-reduce, which involves right-multiplication.
1 2 0 0
1 0 0 0
1 2 0
0
1
1 0 0 0 1 0 0
0
= 0
0 0 1 1
0
0 1 0 0 0 1 1
0 0 0
0
0
0
0 0 1
0 0 0 1
0
0
1 1
0
0
0
0
0
Finish by swapping columns.
0
0
0
0
0
0
1
0
1
0
0
0
0
0
0
0
0
1
0
0
1
0
0
0
1
0
= 0
0
0
1
0
1
0
0
0
0
0
0
0
1
0
0
0
245
Finally, combine the left-multipliers together as P and the right-multipliers

together as Q to get the PHQ equation.
1 0 2 0
1 1 0
1 2 1 1
1 0 0 0
1 0
0 0
1 0 0 0 1 1
= 0 1 0 0
0
0 1
0 1
2
0 1
2 4 2 2
0 0 0 0
0 0
0 1
2.8 Corollary Two same-sized matrices are matrix equivalent if and only if they
have the same rank.
That is, the matrix equivalence classes are characterized by rank.
Proof Two same-sized matrices with the same rank are equivalent to the same
block partial-identity matrix.
QED
2.9 Example The 22 matrices have only three possible ranks: zero, one, or two.
Thus there are three matrix-equivalence classes.
?
00
00

?
All 22 matrices:
?
10
01
10
00
Three equivalence
classes
Each class consists of all of the 22 matrices with the same rank. There is only
one rank zero matrix so that class has only one member. The other two classes
have infinitely many members.
In this subsection we have seen how to change the representation of a map
with respect to a first pair of bases to one with respect to a second pair. That
led to a definition describing when matrices are equivalent in this way. Finally
we noted that, with the proper choice of (possibly different) starting and ending
bases, any map can be represented in block partial-identity form.
One of the nice things about this representation is that, in some sense, we
can completely understand the map when we express it in this way: if the bases
~ 1, . . . ,
~ n i and D = h~1 , . . . , ~m i then the map sends
are B = h
~ 1 + + ck
~ k + ck+1
~ k+1 + + cn
~ n 7 c1~1 + + ck~k + ~0 + + ~0
c1
where k is the maps rank. Thus, we can understand any linear map as a kind
of projection.

c1
c1
.
.
.
.
..

c
c
k
k
7
ck+1
0

..
..
.
.
cn B
0 D
Of course, understanding a map expressed in this way requires that we understand the relationship between B and D. Nonetheless, this is a good classification
of linear maps.
246
Exercises
X 2.10 Decide
if these

matrices are
matrix equivalent.
1 3 0
2 2
1
(a)
,
2 3 0
0 5 1

0 3
4 0
(b)
,
1 1
0 5

1 3
1
3
(c)
,
2 6
2 6
X 2.11 Find the canonical representative of the matrix-equivalence class of each matrix.

0 1 0
2
2 1 0
(a)
(b) 1 1 0
4
4 2 0
3 3 3 1
2.12 Suppose that, with respect to

1
1
B = E2
D=h
,
i
1
1
the transformation t : R2 R2 is represented by this matrix.

1 2
3 4
Use change ofbasis
matricesto represent
t with respect to each pair.
0
1
1
2
=h
=h
(a) B
,
i, D
,
i
1
1
0
1

= h 1 , 1 i, D
=h 1 , 2 i
(b) B
2
0
2
1
= PHQ?
X 2.13 What sizes are P and Q in the equation H
X 2.14 Use Theorem 2.6 to show that a square matrix is nonsingular if and only if it
is equivalent to an identity matrix.
X 2.15 Show that, where A is a nonsingular square matrix, if P and Q are nonsingular
square matrices such that PAQ = I then QP = A1 .
X 2.16 Why does Theorem 2.6 not show that every matrix is diagonalizable (see
Example 2.2)?
2.17 Must matrix equivalent matrices have matrix equivalent transposes?
2.18 What happens in Theorem 2.6 if k = 0?
X 2.19 Show that matrix-equivalence is an equivalence relation.
X 2.20 Show that a zero matrix is alone in its matrix equivalence class. Are there
other matrices like that?
2.21 What are the matrix equivalence classes of matrices of transformations on R1 ?
R3 ?
2.22 How many matrix equivalence classes are there?
2.23 Are matrix equivalence classes closed under scalar multiplication? Addition?
2.24 Let t : Rn Rn represented by T with respect to En , En .
(a) Find RepB,B (t) in this specific case.

1
1
1
1
T=
B=h
,
i
3 1
2
1
~ 1, . . . ,
~ n i.
(b) Describe RepB,B (t) in the general case where B = h
2.25 (a) Let V have bases B1 and B2 and suppose that W has the basis D. Where
h : V W, find the formula that computes RepB2 ,D (h) from RepB1 ,D (h).
247
(b) Repeat the prior question with one basis for V and two bases for W.
2.26 (a) If two matrices are matrix-equivalent and invertible, must their inverses
be matrix-equivalent?
(b) If two matrices have matrix-equivalent inverses, must the two be matrixequivalent?
(c) If two matrices are square and matrix-equivalent, must their squares be
matrix-equivalent?
(d) If two matrices are square and have matrix-equivalent squares, must they be
matrix-equivalent?
X 2.27 Square matrices are similar if they represent the same transformation, but
each with respect to the same ending as starting basis. That is, RepB1 ,B1 (t) is
similar to RepB2 ,B2 (t).
(a) Give a definition of matrix similarity like that of Definition 2.3.
(b) Prove that similar matrices are matrix equivalent.
(c) Show that similarity is an equivalence relation.
(d) Show that if T is similar to T then T 2 is similar to T 2 , the cubes are similar,
etc. Contrast with the prior exercise.
(e) Prove that there are matrix equivalent matrices that are not similar.
248
VI
Projection
This section is optional. It is only required for the last two sections of
Chapter Five.
We have described the projection from R3 into its xy-plane subspace as a
shadow map. This shows why, but it also shows that some shadows fall upward.

1
2
2
1
2
1
So perhaps a better description is: the projection of ~v is the ~p in the plane with
the property that someone standing on ~p and looking directly up or down sees
~v. In this section we will generalize this to other projections, both orthogonal
and non-orthogonal.
VI.1
Orthogonal Projection Into a Line
We first consider orthogonal projection of a vector ~v into a line `. This picture

shows someone walking out on the line until they are at a point ~p such that
the tip of ~v is directly above them, where above does not mean parallel to the
y-axis but instead means orthogonal to the line.

Since we can describe the line as the span of some vector ` = { c ~s c R }, this
person has found the coefficient c~p with the property that ~v c~p~s is orthogonal
to c~p~s.
~v
~v c~p ~s
c~p ~s
To solve for this coefficient, observe that because ~v c~p~s is orthogonal to a

scalar multiple of ~s, it must be orthogonal to ~s itself. Then (~v c~p~s) ~s = 0
gives that c~p = ~v ~s/~s ~s.
Section VI. Projection
249
1.1 Definition The orthogonal projection of ~v into the line spanned by a

nonzero ~s is this vector.
~v ~s
~s
proj[~s ] (~v) =
~s ~s
1.2 Remark That definition says spanned by ~s instead the more formal the
span of the set {~s }. This more casual phrase is common.

1.3 Example To orthogonally project the vector 23 into the line y = 2x, we first
pick a direction vector for the line.
!
1
~s =
2
The calculation is easy.

2 1

3 2
8
1
1
8/5

=
=
2
2
16/5
5
1 1

2 2

1.4 Example In R3 , the orthogonal projection of a general vector

x

y
z
into the y-axis is

0
x

y
1
0
0
0
z

1 = y
0
0
0
0

1 1
0
0
which matches our intuitive expectation.
The picture above with the stick figure walking out on the line until ~vs tip
is overhead is one way to think of the orthogonal projection of a vector into a
line. We finish this subsection with two other ways.
1.5 Example A railroad car left on an east-west track without its brake is pushed
by a wind blowing toward the northeast at fifteen miles per hour; what speed
will the car reach?
250
For the wind we use a vector of length 15 that points toward the northeast.
!
p
15p1/2
~v =
15 1/2
The car is only affected by the part of the wind blowing in the east-west
direction the part of ~v in the direction of the x-axis is this (the picture has
the same perspective as the railroad car picture above).
!
p
north
15 1/2
~p =
0
east
So the car will reach a velocity of 15
p
1/2 miles per hour toward the east.
Thus, another way to think of the picture that precedes the definition is that
it shows ~v as decomposed into two parts, the part ~p with the line, and the part
that is orthogonal to the line (shown above on the north-south axis). These
two are non-interacting in the sense that the east-west car is not at all affected
by the north-south part of the wind (see Exercise 11). So we can think of the
orthogonal projection of ~v into the line spanned by ~s as the part of ~v that lies
in the direction of ~s.
Still another useful way to think of orthogonal projection is to have the
person stand not on the line but on the vector. This person holds a rope with a
loop over the line `.
When they pull the rope tight, the loop slides on ` until the rope is orthogonal
to that line. That is, we can think of the projection ~p as being the vector in
the line that is closest to ~v (see Exercise 17).
1.6 Example A submarine is tracking a ship moving along the line y = 3x + 2.
Torpedo range is one-half mile. If the sub stays where it is, at the origin on the
chart below, will the ship pass within range?
north
east
The formula for projection into a line does not immediately apply because the
line doesnt pass through the origin, and so isnt the span of any ~s. To adjust
for this, we start by shifting the entire map down two units. Now the line is
y = 3x, a subspace. We project to get the point ~p on the line closest to
!
0
~v =
2
251
the subs shifted position.
~p =
!
!
1
0
3
2
!
!
1
1
3
3
1
3
!
=
!
3/5
9/5
The distance between ~v and ~p is about 0.63 miles. The ship will not be in range.
This subsection has developed a natural projection map, orthogonal projection into a line. As suggested by the examples, we use it often in applications.
The next subsection shows how the definition of orthogonal projection into a line
gives us a way to calculate especially convenient bases for vector spaces, again
something that we often see in applications. The final subsection completely
generalizes projection, orthogonal or not, into any subspace at all.
Exercises
X 1.7 Project the first vector orthogonally into the line spanned by the second vector.

1
1
1
3
2
3
2
3
(a)
,
(b)
,
(c) 1, 2
(d) 1, 3
1
2
1
0
4
1
4
12
X 1.8 Project the vector orthogonally into the line.

2
3
1

(a) 1 , { c
c R}
(b)
, the line y = 3x
1
1
4
3
1.9 Although pictures guided our development of Definition 1.1, we are not restricted
to spaces that we can draw. In R4 project this vector into this line.

1
1
2
1

~v =
` = {c
1
1 c R }
3
1
X 1.10 Definition 1.1 uses two vectors ~s and ~v. Consider the transformation of R2
resulting from fixing

3
~s =
1
and projecting ~v into the line that is the span of ~s. Apply it to these vectors.

1
0
(a)
(b)
2
4
Show that in general the projection transformation is this.

x1
(x1 + 3x2 )/10
7
x2
(3x1 + 9x2 )/10
Express the action of this transformation with a matrix.
1.11 Example 1.5 suggests that projection breaks ~v into two parts, proj[~s ] (~v ) and
~v proj[~s ] (~v ), that are non-interacting. Recall that the two are orthogonal. Show
that any two nonzero orthogonal vectors make up a linearly independent set.
1.12 (a) What is the orthogonal projection of ~v into a line if ~v is a member of that
line?
252
X
X
(b) Show that if ~v is not a member of the line then the set {~v,~v proj[~s ] (~v ) } is
linearly independent.
1.13 Definition 1.1 requires that ~s be nonzero. Why? What is the right definition
of the orthogonal projection of a vector into the (degenerate) line spanned by the
zero vector?
1.14 Are all vectors the projection of some other vector into some line?
1.15 Show that the projection of ~v into the line spanned by ~s has length equal to
the absolute value of the number ~v ~s divided by the length of the vector ~s .
1.16 Find the formula for the distance from a point to a line.
1.17 Find the scalar c such that the point (cs1 , cs2 ) is a minimum distance from the
point (v1 , v2 ) by using calculus (i.e., consider the distance function, set the first
derivative equal to zero, and solve). Generalize to Rn .
1.18 Prove that the orthogonal projection of a vector into a line is shorter than the
vector.
1.19 Show that the definition of orthogonal projection into a line does not depend
on the spanning vector: if ~s is a nonzero multiple of ~q then (~v ~s/~s ~s ) ~s equals
(~v ~q/~q ~q ) ~q.
1.20 Consider the function mapping the plane to itself that takes a vector to its
projection into the line y = x. These two each show that the map is linear, the first
one in a way that is coordinate-bound (that is, it fixes a basis and then computes)
and the second in a way that is more conceptual.
(a) Produce a matrix that describes the functions action.
(b) Show that we can obtain this map by first rotating everything in the plane
/4 radians clockwise, then projecting into the x-axis, and then rotating /4 radians counterclockwise.
1.21 For a
~ , ~b Rn let ~v1 be the projection of a
~ into the line spanned by ~b, let ~v2 be
the projection of ~v1 into the line spanned by a
~ , let ~v3 be the projection of ~v2 into
the line spanned by ~b, etc., back and forth between the spans of a
~ and ~b. That is,
~vi+1 is the projection of ~vi into the span of a
~ if i + 1 is even, and into the span
of ~b if i + 1 is odd. Must that sequence of vectors eventually settle down must
there be a sufficiently large i such that ~vi+2 equals ~vi and ~vi+3 equals ~vi+1 ? If so,
what is the earliest such i?
VI.2
Gram-Schmidt Orthogonalization
This subsection is optional. We only need the work done here in the final
two sections of Chapter Five. Also, this subsection requires material from
the previous subsection, which itself was optional.
The prior subsection suggests that projecting into the line spanned by ~s
decomposes a vector ~v into two parts
~
v
~
v proj[~s] (~
p)
~v = proj[~s ] (~v) + ~v proj[~s ] (~v)

proj[~s] (~
p)
253
that are orthogonal and so are not-interacting. We will now develop that
suggestion.
2.1 Definition Vectors ~v1 , . . . ,~vk Rn are mutually orthogonal when any two
are orthogonal: if i 6= j then the dot product ~vi ~vj is zero.
2.2 Theorem If the vectors in a set {~v1 , . . . ,~vk } Rn are mutually orthogonal
and nonzero then that set is linearly independent.
Proof Consider a linear relationship c1~v1 +c2~v2 + +ck~vk = ~0. If i {1, .. , k }
then taking the dot product of ~vi with both sides of the equation
~vi (c1~v1 + c2~v2 + + ck~vk ) = ~vi ~0
ci (~vi ~vi ) = 0
shows, since ~vi 6= ~0, that ci = 0.
QED
2.3 Corollary In a k dimensional vector space, if the vectors in a size k set are
mutually orthogonal and nonzero then that set is a basis for the space.
Proof Any linearly independent size k subset of a k dimensional space is a
basis.
QED
Of course, the converse of Corollary 2.3 does not hold not every basis of
every subspace of Rn has mutually orthogonal vectors. However, we can get
the partial converse that for every subspace of Rn there is at least one basis
consisting of mutually orthogonal vectors.
~ 1 and
~ 2 of this basis for R2 are not orthogonal.
2.4 Example The members

4
1
B=h
,
i
2
3
~2
~1
However, we can derive from B a new basis for the same space that does have
mutually orthogonal members. For the first member of the new basis we simply
~ 1.
use
!
4
~1 =
2
~ 2 the part in the
For the second member of the new basis, we subtract from
~
direction of ~1 . This leaves the part of 2 that is orthogonal to ~1 .
~2 =

1
1
1
2
1
proj[~1 ] (
)=
=
3
3
3
1
2
~2
254
By the corollary h~1 , ~2 i is a basis for R2 .

2.5 Definition An orthogonal basis for a vector space is a basis of mutually
orthogonal vectors.
2.6 Example To turn this basis for R3

1
0
1

B = h1 , 2 , 0i
1
0
3
into an orthogonal basis we take the first vector as it is.

1

~1 = 1
1
~ 2 and subtracting the part in the direction of ~1 .
We get ~2 by starting with

0
0
0
2/3
2/3

~2 = 2 proj[~1 ] (2) = 2 2/3 = 4/3

0
0
0
2/3
2/3
~ 3 and subtracting the part in the direction of ~1 and also
We get ~3 by taking
the part in the direction of ~2 .

1
1
1
1

~3 = 0 proj[~1 ] (0) proj[~2 ] (0) = 0
3
3
3
1
Again, the corollary gives the result is a basis for R3 .

1
2/3
1

h1 , 4/3 , 0i
1
2/3
1
~ 1, . . .
~ k i is a basis for a sub2.7 Theorem (Gram-Schmidt orthogonalization) If h
n
space of R then the vectors
~1
~1 =
~ 2 proj[~ ] (
~ 2)
~2 =
1
~ 3 proj[~ ] (
~ 3 ) proj[~ ] (
~ 3)
~3 =
1
2
..
.
~ k proj[~ ] (
~ k ) proj[~ ] (
~ k)
~k =
1
k1
form an orthogonal basis for the same subspace.
255
2.8 Remark This is restricted to Rn only because we have not given a definition
of orthogonality for any other spaces.
Proof We will use induction to check that each ~
i is nonzero, is in the span of
~ 1, . . .
~ i i, and is orthogonal to all preceding vectors ~1 ~i = = ~i1 ~i = 0.
h
Then with Corollary 2.3 we will have that h~1 , . . . ~k i is a basis for the same
~ 1, . . .
~ k i.
space as is h
We shall only cover the cases up to i = 3, to give the sense of the argument.
The remaining details are Exercise 25.
~ 1 makes it a nonzero vector
The i = 1 case is trivial; setting ~1 equal to
~ 1 is a member of a basis, it is obviously in the span of
~ 1 , and the
since
orthogonal to all preceding vectors condition is satisfied vacuously.
In the i = 2 case the expansion
~
~
~ 2 proj[~ ] (
~ 2) =
~ 2 2 ~1 ~1 =
~ 2 2 ~1
~1
~2 =
1
~1 ~1
~1 ~1
shows that ~2 6= ~0 or else this would be a non-trivial linear dependence among
~ (it is nontrivial because the coefficient of
~ 2 is 1). It also shows that ~2
the s
~
is in the span of the first two s.
And, ~2 is orthogonal to the only preceding
vector
~ 2 proj[~ ] (
~ 2 )) = 0
~1 ~2 = ~1 (
1
because this projection is orthogonal.
The i = 3 case is the same as the i = 2 case except for one detail. As in the
i = 2 case, expand the definition.
~ 3 ~1
~ 3 ~2
~1
~2
~1 ~1
~2 ~2
~
~
~

~ 3 3 ~1
~ 1 3 ~2
~ 2 2 ~1
~1
=
~1 ~1
~2 ~2
~1 ~1
~3
~3 =
~ 3 isnt in the span [

~ 1,
~ 2 ] and therefore by the
By the first line ~3 6= ~0, since
inductive hypothesis it isnt in the span [~1 , ~2 ]. By the second line ~3 is in
~
the span of the first three s.
Finally, the calculation below shows that ~3 is
orthogonal to ~1 . (There is a difference between this calculation and the one
in the i = 2 case. Here the second line has two kinds of terms. As happened
for i = 2, the first term is 0 because this projection is orthogonal. But here
the second term is 0 because ~1 is orthogonal to ~2 and so is orthogonal to any
vector in the line spanned by ~2 .)

~ 3 proj[~ ] (
~ 3 ) proj[~ ] (
~ 3)
~1 ~3 = ~1
1
2

~ 3 proj[~ ] (
~ 3 ) ~1 proj[~ ] (
~ 3)
= ~1
1
=0
A similar check shows that ~3 is also orthogonal to ~2 .
QED
Beyond having the vectors in the basis be orthogonal, we can also normalize
each vector by dividing by its length, to end with an orthonormal basis..
256
2.9 Example From the orthogonal basis of Example 2.6, normalizing produces
this orthonormal basis.

1/ 6
1/ 2
1/ 3

h1/ 3 , 2/ 6 ,
0 i

1/ 3
1/ 6
1/ 2
Besides its intuitive appeal, and its analogy with the standard basis En for
Rn , an orthonormal basis also simplifies some computations. An example is in
Exercise 19.
Exercises
2
of
these
2.10 Perform
the
Gram-Schmidt
process
on each
bases
for R .
1
2
0
1
0
1
(a) h
,
i
(b) h
,
i
(c) h
,
i
1
1
1
3
1
0
Then turn those orthogonal bases into orthonormal bases.
X 2.11 Perform the Gram-Schmidt process on each of these bases for R3 .

2
1
0
1
0
2
(a) h2 , 0 , 3i
(b) h1 , 1 , 3i
2
1
1
0
0
1
Then turn those orthogonal bases into orthonormal bases.
X 2.12 Find an orthonormal basis for this subspace of R3 : the plane x y + z = 0.
2.13 Find an orthonormal basis for this subspace of R4 .

x
y

{
z x y z + w = 0 and x + z = 0 }
w
2.14 Show that any linearly independent subset of Rn can be orthogonalized without
changing its span.
2.15 What happens if we try to apply the Gram-Schmidt process to a finite set that
is not a basis?
X 2.16 What happens if we apply the Gram-Schmidt process to a basis that is already
orthogonal?
2.17 Let h~1 , . . . , ~k i be a set of mutually orthogonal vectors in Rn .
(a) Prove that for any ~v in the space, the vector ~v (proj[~1 ] (~v ) + + proj[~vk ] (~v ))
is orthogonal to each of ~1 , . . . , ~k .
(b) Illustrate the prior item in R3 by using ~e1 as ~1 , using ~e2 as ~2 , and taking ~v
to have components 1, 2, and 3.
(c) Show that proj[~1 ] (~v ) + + proj[~vk ] (~v ) is the vector in the span of the set of
~s that is closest to ~v. Hint. To the illustration done for the prior part, add a
vector d1~1 + d2~2 and apply the Pythagorean Theorem to the resulting triangle.
2.18 Find a vector in R3 that is orthogonal to both of these.

1
2
5
2
1
0
X 2.19 One advantage of orthogonal bases is that they simplify finding the representation of a vector with respect to that basis.
(a) For this vector and this non-orthogonal basis for R2

2
1
1
~v =
B=h
,
i
3
1
0
257
first represent the vector with respect to the basis. Then project the vector into
~ 1 ] and [
~ 2 ].
the span of each basis vector [
(b) With this orthogonal basis for R2

1
1
K=h
,
i
1
1
represent the same vector ~v with respect to the basis. Then project the vector
into the span of each basis vector. Note that the coefficients in the representation
and the projection are the same.
(c) Let K = h~1 , . . . , ~k i be an orthogonal basis for some subspace of Rn . Prove
that for any ~v in the subspace, the i-th component of the representation RepK (~v )
is the scalar coefficient (~v ~i )/(~i ~i ) from proj[~i ] (~v ).
(d) Prove that ~v = proj[~1 ] (~v ) + + proj[~k ] (~v ).
2.20 Bessels Inequality. Consider these orthonormal sets
B1 = {~e1 } B2 = {~e1 , ~e2 } B3 = {~e1 , ~e2 , ~e3 } B4 = {~e1 , ~e2 , ~e3 , ~e4 }
along with the vector ~v R4 whose components are 4, 3, 2, and 1.
(a) Find the coefficient c1 for the projection of ~v into the span of the vector in
B1 . Check that k~v k2 > |c1 |2 .
(b) Find the coefficients c1 and c2 for the projection of ~v into the spans of the
two vectors in B2 . Check that k~v k2 > |c1 |2 + |c2 |2 .
(c) Find c1 , c2 , and c3 associated with the vectors in B3 , and c1 , c2 , c3 , and
c4 for the vectors in B4 . Check that k~v k2 > |c1 |2 + + |c3 |2 and that k~v k2 >
|c1 |2 + + |c4 |2 .
Show that this holds in general: where {~1 , . . . , ~k } is an orthonormal set and ci is
coefficient of the projection of a vector ~v from the space then k~v k2 > |c1 |2 + +|ck |2 .
Hint. One way is to look at the inequality 0 6 k~v (c1~1 + + ck~k )k2 and
expand the cs.
2.21 Prove or disprove: every vector in Rn is in some orthogonal basis.
2.22 Show that the columns of an nn matrix form an orthonormal set if and only
if the inverse of the matrix is its transpose. Produce such a matrix.
2.23 Does the proof of Theorem 2.2 fail to consider the possibility that the set of
vectors is empty (i.e., that k = 0)?
~ 1, . . . ,
~ k i to
2.24 Theorem 2.7 describes a change of basis from any basis B = h
one that is orthogonal K = h~1 , . . . , ~k i. Consider the change of basis matrix
RepB,K (id).
(a) Prove that the matrix RepK,B (id) changing bases in the direction opposite to
that of the theorem has an upper triangular shape all of its entries below the
main diagonal are zeros.
(b) Prove that the inverse of an upper triangular matrix is also upper triangular
(if the matrix is invertible, that is). This shows that the matrix RepB,K (id)
changing bases in the direction described in the theorem is upper triangular.
2.25 Complete the induction argument in the proof of Theorem 2.7.
VI.3
Projection Into a Subspace
This subsection is optional. It also uses material from the optional earlier
subsection on Combining Subspaces.
258
The prior subsections project a vector into a line by decomposing it into two
parts: the part in the line proj[~s ] (~v ) and the rest ~v proj[~s ] (~v ). To generalize
projection to arbitrary subspaces we will follow this decomposition idea.
3.1 Definition For any direct sum V = M N and any ~v V, the projection of
~v into M along N is
projM,N (~v ) = m
~
where ~v = m
~ +n
~ with m
~ M, n
~ N.
We can apply this definition in spaces where we dont have a ready definition
of orthogonal. (Definitions of orthogonality for spaces other than the Rn are
perfectly possible but we havent seen any in this book.)
3.2 Example The space M22 of 22 matrices is the direct sum of these two.
!
!
a b
0 0
M={
a, b R}
N={
c, d R }
0 0
c d
To project
A=
3
0
1
4
into M along N, we first fix bases for the two subspaces.

!
!
!
1 0
0 1
0 0
0
BM = h
,
i
BN = h
,
0 0
0 0
1 0
0
!
0
i
1
The concatenation of these

B = BM
BN
1
=h
0
!
0
0
,
0
0
!
1
0
,
0
1
!
0
0
,
0
0
!
0
i
1
is a basis for the entire space because M22 is the direct sum. So we can use it
to represent A.
!
!
!
!
!
3 1
1 0
0 1
0 0
0 0
=3
+1
+0
+4
0 4
0 0
0 0
1 0
0 1
The projection of A into M along N keeps the M part and drops the N part.
!
!
!
!
3 1
1 0
0 1
3 1
projM,N (
)=3
+1
=
0 4
0 0
0 0
0 0
3.3 Example Both subscripts on projM,N (~v ) are significant. The first subscript
M matters because the result of the projection is a member of M. For an
example showing that the second one matters, fix this plane subspace of R3 and
its basis.

x
1
0

M = { y y 2z = 0 }
BM = h0 , 2i
z
0
1
259
Compare the projections along these (verification that R3 = M N and R3 =

is routine).
MN

0
0

= {k
N = {k 0 k R }
N
1 k R }
1
2
The projections are different because they have different effects on this vector.

2

~v = 2
5
For the first one we find a basis for N
BN

0

= h0i
1
_
and represent ~v with respect to the concatenation BM BN .

2
1
0
0

2 = 2 0 + 1 2 + 4 0
5
0
1
1
We find the projection of ~v into M along N by dropping the N component.

1
0
2

projM,N (~v ) = 2 0 + 1 2 = 2
0
1
1
this basis is natural.
For N,
BN
0

= h 1 i
2
Representing ~v with respect to the concatenation

2
1
0
0

2 = 2 0 + (9/5) 2 (8/5) 1
5
0
1
2
and then keeping only the M part gives this.

1
0
2

projM,N
v ) = 2 0 + (9/5) 2 = 18/5
(~
0
1
9/5
Therefore projection along different subspaces may yield different results.
These pictures compare the two maps. Both show that the projection is
indeed into the plane and along the line.
260

N
N
M
Notice that the projection along N is not orthogonal there are members of the
plane M that are not orthogonal to the dotted line. But the projection along N
is orthogonal.
A natural question is: what is the relationship between the projection operation defined above, and the operation of orthogonal projection into a line?
The second picture above suggests the answer orthogonal projection into a
line is a special case of the projection defined above; it is just projection along a
subspace perpendicular to the line.
N
M
3.4 Definition The orthogonal complement of a subspace M of Rn is

M = {~v Rn ~v is perpendicular to all vectors in M}
(read M perp). The orthogonal projection projM (~v ) of a vector is its projection into M along M .
3.5 Example In R3 , to find the orthogonal complement of the plane

x

P = { y 3x + 2y z = 0 }
z
we start with a basis for P.

1
0

B = h0 , 1i
3
2
Any ~v perpendicular to every vector in B is perpendicular to every vector in the
span of B (the proof of this is Exercise 19). Therefore, the subspace P consists
of the vectors that satisfy these two conditions.

1
v1
0
v1

0 v2 = 0
1 v2 = 0
3
2
v3
v3
261
We can express those conditions more compactly as a linear system.

! v
!
v1
1
0
1 0 3
P = { v 2
}
v2 =
0 1 2
0
v3
v3
We are thus left with finding the null space of the map represented by the matrix,
that is, with calculating the solution set of a homogeneous linear system.

3
v1
+ 3v3 = 0

= P = { k 2 k R }
v2 + 2v3 = 0
1
Instead of the term orthogonal complement, this is sometimes called the line
normal to the plane.
3.6 Example Where M is the xy-plane subspace of R3 , what is M ? A common
first reaction is that M is the yz-plane, but thats not right. Some vectors
from the yz-plane are not perpendicular to every vector in the xy-plane.

1
0
1 6 3
0
= arccos(
10+13+02

) 0.94 rad
2 13
Instead M is the z-axis, since proceeding as in the prior example and taking
the natural basis for the xy-plane gives this.

! x
!
x
x
1 0 0
0

M = { y
=
}
=
{
y
y

x = 0 and y = 0 }
0 1 0
0
z
z
z
3.7 Lemma If M is a subspace of Rn then orthogonal complement M is also a
subspace. The space is the direct sum of the two Rn = M M . And, for any
~v Rn , the vector ~v projM (~v ) is perpendicular to every vector in M.
Proof First, the orthogonal complement M is a subspace of Rn because, as
noted in the prior two examples, it is a null space.

Next, start with any basis BM = h~1 , . . . , ~k i for M and expand it to a basis
for the entire space. Apply the Gram-Schmidt process to get an orthogonal basis
K = h~1 , . . . , ~n i for Rn . This K is the concatenation of two bases: h~1 , . . . , ~k i
with the same number of members k as BM , and h~k+1 , . . . , ~n i. The first is a
basis for M so if we show that the second is a basis for M then we will have
that the entire space is the direct sum of the two subspaces.
Exercise 19 from the prior subsection proves this about any orthogonal
basis: each vector ~v in the space is the sum of its orthogonal projections onto
the lines spanned by the basis vectors.
~v = proj[~1 ] (~v ) + + proj[~n ] (~v )
()
262
To check this, represent the vector as ~v = r1~1 + + rn~n , apply ~i to both

sides ~v ~i = (r1~1 + + rn~n ) ~i = r1 0 + + ri (~i ~i ) + + rn 0,
and solve to get ri = (~v ~i )/(~i ~i ), as desired.
Since obviously any member of the span of h~k+1 , . . . , ~n i is orthogonal to
any vector in M, to show that this is a basis for M we need only show the
other containment that any w
~ M is in the span of this basis. The prior
paragraph does this. Any w
~ M gives this on projections into basis vectors
~
from M: proj[~1 ] (~
w ) = 0, . . . , proj[~k ] (~
w ) = ~0. Therefore equation () gives
that w
~ is a linear combination of ~k+1 , . . . , ~n . Thus this is a basis for M and
Rn is the direct sum of the two.
The final sentence of the statement of this result is proved in much the same
way. Write ~v = proj[~1 ] (~v ) + + proj[~n ] (~v ). Then projM (~v ) keeps only the
M part and dropping the M part projM (~v ) = proj[~k+1 ] (~v ) + + proj[~k ] (~v ).
Therefore ~v projM (~v ) consists of a linear combination of elements of M and
so is perpendicular to every vector in M.
QED
We can find the orthogonal projection into a subspace by following the steps
of the proof but the next result gives a convenient formula.
3.8 Theorem Let ~v be a vector in Rn and let M be a subspace of Rn with basis
~ 1, . . . ,
~ k i. If A is the matrix whose columns are the s
~ then projM (~v ) =
h
~ 1 + +ck
~ k where the coefficients ci are the entries of the vector (Atrans A)1 Atrans
c1
~v. That is, projM (~v ) = A(Atrans A)1 Atrans ~v.
Proof The vector projM (~v) is a member of M and so it is a linear combination
~
~ 1 + + ck
~ k . Since As columns are the s,
of basis vectors c1
that
k
can be expressed as: there is a ~c R such that projM (~v ) = A~c. The vector
~v projM (~v ) is perpendicular to each member of the basis so we have this.

~0 = Atrans ~v A~c = Atrans~v Atrans A~c
Solving for ~c (showing that Atrans A is invertible is an exercise)
~c = Atrans A
1
Atrans ~v
gives the formula for the projection matrix as projM (~v ) = A ~c.
3.9 Example To orthogonally project this vector into this subspace

x
1

P = { y x + z = 0 }
~v = 1
z
1
first make a matrix whose columns are a basis for the subspace
0
1
A = 1
0
0 1
QED
263
and then compute.
A Atrans A
1
Atrans
= 1
0
1
1
0
0
1
1/2 0
=
0 1
1/2 0
0
1/2
0
1
1
0
!
0
1
1/2
0
1/2
With the matrix, calculating the orthogonal projection of any vector into P is
easy.

1/2 0 1/2
1
0

projP (~v) =
0 1
0 1 = 1
1/2 0
1/2
1
0
Note, as a check, that this result is indeed in P.
Exercises
X 3.10 Project
the vectors
into
M along N.

3
x
x
(a)
, M={
x + y = 0 }, N = {
x 2y = 0 }
2
y
y

1
x
x
(b)
, M={
x y = 0 }, N = {
2x + y = 0 }
2
y
y

3
x
1
(c) 0 , M = { y x + y = 0 }, N = { c 0 c R }
1
z
1
X 3.11 Find M .

x
x
2x + 3y = 0 }
x + y = 0}
(b) M = {
(a) M = {
y
y

x
x
(c) M = {
x y = 0}
(d) M = {~0 }
(e) M = {
x = 0}
y
y

x
x
(f) M = { y x + 3y + z = 0 }
(g) M = { y x = 0 and y + z = 0 }
z
z
3.12 This subsection shows how to project orthogonally in two ways, the method of
Example 3.2 and 3.3, and the method of Theorem 3.8. To compare them, consider
the plane P specified by 3x + 2y z = 0 in R3 .
(a) Find a basis for P.
(b) Find P and a basis for P .
(c) Represent this vector with respect to the concatenation of the two bases from
the prior item.

1
~v = 1
2
(d) Find the orthogonal projection of ~v into P by keeping only the P part from
the prior item.
(e) Check that against the result from applying Theorem 3.8.
264
X 3.13 We have three ways to find the orthogonal projection of a vector into a line,
the Definition 1.1 way from the first subsection of this section, the Example 3.2
and 3.3 way of representing the vector with respect to a basis for the space and
then keeping the M part, and the way of Theorem 3.8. For these cases, do all three
ways.

1
x
(a) ~v =
, M={
x + y = 0}
3
y

0
x
(b) ~v = 1 , M = { y x + z = 0 and y = 0 }
2
z
3.14 Check that the operation of Definition 3.1 is well-defined. That is, in Example 3.2 and 3.3, doesnt the answer depend on the choice of bases?
3.15 What is the orthogonal projection into the trivial subspace?
3.16 What is the projection of ~v into M along N if ~v M?
3.17 Show that if M Rn is a subspace with orthonormal basis h~1 , . . . , ~n i then
the orthogonal projection of ~v into M is this.
(~v ~1 ) ~1 + + (~v ~n ) ~n
X 3.18 Prove that the map p : V V is the projection into M along N if and only
if the map id p is the projection into N along M. (Recall the definition of the
difference of two maps: (id p) (~v) = id(~v) p(~v) = ~v p(~v).)
X 3.19 Show that if a vector is perpendicular to every vector in a set then it is
perpendicular to every vector in the span of that set.
3.20 True or false: the intersection of a subspace and its orthogonal complement is
trivial.
3.21 Show that the dimensions of orthogonal complements add to the dimension of
the entire space.
X 3.22 Suppose that ~v1 ,~v2 Rn are such that for all complements M, N Rn , the
projections of ~v1 and ~v2 into M along N are equal. Must ~v1 equal ~v2 ? (If so, what
if we relax the condition to: all orthogonal projections of the two are equal?)
X 3.23 Let M, N be subspaces of Rn . The perp operator acts on subspaces; we can
ask how it interacts with other such operations.
(a) Show that two perps cancel: (M ) = M.
(b) Prove that M N implies that N M .
(c) Show that (M + N) = M N .
X 3.24 The material in this subsection allows us to express a geometric relationship
that we have not yet seen between the range space and the null space of a linear
map.
(a) Represent f : R3 R given by

v1
v2 7 1v1 + 2v2 + 3v3
v3
with respect to the standard bases and show that

1
2
3
is a member of the perp of the null space. Prove that N (f) is equal to the
span of this vector.
265
(b) Generalize that to apply to any f : Rn R.

(c) Represent f : R3 R2

v1
v2 7 1v1 + 2v2 + 3v3
4v1 + 5v2 + 6v3
v3
with respect to the standard bases and show that

1
4
2 , 5
3
6
are both members of the perp of the null space. Prove that N (f) is the span
of these two. (Hint. See the third item of Exercise 23.)
(d) Generalize that to apply to any f : Rn Rm .
In [Strang 93] this is called the Fundamental Theorem of Linear Algebra
3.25 Define a projection to be a linear transformation t : V V with the property
that repeating the projection does nothing more than does the projection alone: (t
t) (~v) = t(~v) for all ~v V.
(a) Show that orthogonal projection into a line has that property.
(b) Show that projection along a subspace has that property.
~ 1, . . . ,
~ n i for V such that
(c) Show that for any such t there is a basis B = h

~ i i = 1, 2, . . . , r
~ i) =
t(
~0
i = r + 1, r + 2, . . . , n
where r is the rank of t.
(d) Conclude that every projection is a projection along a subspace.
(e) Also conclude that every projection has a representation
!
I Z
RepB,B (t) =
Z Z
in block partial-identity form.
3.26 A square matrix is symmetric if each i, j entry equals the j, i entry (i.e., if the
matrix equals its transpose). Show that the projection matrix A(Atrans A)1 Atrans
is symmetric. [Strang 80] Hint. Find properties of transposes by looking in the
index under transpose.
Topic
Line of Best Fit
This Topic requires the formulas from the subsections on Orthogonal Projection Into a Line and Projection Into a Subspace.
Scientists are often presented with a system that has no solution and they
must find an answer anyway. More precisely stated, they must find a best
answer.
For instance, this is the result of flipping a penny, including some intermediate
numbers.
number of flips
number of heads
30
16
60
34
90
51
In an experiment we can expect that samples will vary here, sometimes the
experimental ratio of heads to flips overestimates this pennys long-term ratio
and sometimes it underestimates. So we expect that the system derived from
the experiment has no solution.
30m = 16
60m = 34
90m = 51
That is, the vector of data that we collected is not in the subspace where in
theory we should find it.

16
30

34 6 {m 60 m R }
51
90
We have to do something, so we look for the m that most nearly works. An
orthogonal projection of the data vector into the line subspace gives this best
guess.

16
30

34
60
30
30
51
90
7110

60
60 =
12600
30
30
90
90

60 60
90
90
Topic: Line of Best Fit
267
The estimate (m = 7110/12600 0.56) is a bit more than one half, but not
much, so probably the penny is fair enough.
The line with the slope m 0.56 is the line of best fit for this data.
heads
60
30
30
60
90
flips
Minimizing the distance between the given vector and the vector used as the
right-hand side minimizes the total of these vertical lengths, and consequently
we say that the line comes from fitting by least-squares
(we have exaggerated the vertical scale by ten to make the lengths visible).
In the above equation the line must pass through (0, 0), because we take it
to be the line whose slope is this coins true proportion of heads to flips. We
can also handle cases where the line need not pass through the origin.
For example, the different denominations of US money have different average
times in circulation.[Federal Reserve] (The $2 bill is a special case because
Americans mistakenly believe that it is collectible and do not circulate these
bills.) How long should a $25 bill last?
denomination
average life (mos)
1
22.0
5
15.9
10
18.3
20
24.3
50
55.4
100
88.8
The data plot below looks roughly linear. It isnt a perfect line, i.e., the linear
system with equations b + 1m = 1.5, . . . , b + 100m = 20 has no solution, but
we can again use orthogonal projection to find a best approximation. Consider
the matrix of coefficients of that linear system and also its vector of constants,
the experimentally-determined values.
1
1
A=
1
1
1
1
5
10
20
50
100
22.0
15.9
18.3
~v =
24.3
55.4
88.8
The ending result in the subsection on Projection into a Subspace says that
coefficients b and m so that the linear combination of the columns of A is as
close as possible to the vector ~v are the entries of (Atrans A)1 Atrans ~v. Some
calculation gives an intercept of b = 14.16 and a slope of m = 0.75.
268

life (yrs)
8
4
10
30
50
70
90
denom
Plugging x = 25 into the equation of the line shows that such a bill should last
about two and three-quarters years.
We close by considering the progression of world record times for the mens
mile race [Oakley & Baker]. In the early 1900s many people wondered when
this record would fall below the four minute mark. Here are the times that were
in force on January first of each decade through the first half of that century. (Restricting ourselves to the times at the start of each decade reduces the data entry
burden and gives much the same result. There are different sequences of times
from competing standards bodies but these are from [Wikipedia Mens Mile].)
year
secs
1870
268.8
1880
264.5
1890
258.4
1900
255.6
1910
255.6
1920
252.6
1930
250.4
1940
246.4
1950
241.4
We can use this to predict the date for 240 seconds, and we can then compare
to the actual date.
Sage gives the slope and intercept.
sage: data=[[1870,268.8], [1880,264.5], [1890,258.4],
....: [1900,255.6], [1910,255.6], [1920,252.6],
....: [1930,250.4], [1940,246.4], [1950,241.4]]
sage: var(slope,intercept)
(slope, intercept)
sage: model(x) = slope*x+intercept
sage: find_fit(data,model)
[intercept == 837.0872267857003,
slope == -0.30483333572258886]
(People in the year 0 didnt run very fast!) Plotting the data and the line
sage: points(data)
....: +plot(model(intercept=find_fit(data,model)[0].rhs(),
....:
slope=find_fit(data,model)[1].rhs()),
....:
(x,1860,1960),color=red,figsize=3,fontsize=7)
gives this graph.
Topic: Line of Best Fit
269
Note that the progression is surprisingly linear. We predict 1958.73; the actual
date of Roger Bannisters record was 1954-May-06.
Exercises
The calculations here are best done on a computer. Some of the problems require
more data that is available in your library, on the Internet, or in the Answers
to the Exercises.
1 Use least-squares to judge if the coin in this experiment is fair.
flips 8 16 24 32 40
heads 4
9
13 17 20
2 For the mens mile record, rather than give each of the many records and its exact
date, weve smoothed the data somewhat by taking a periodic sample. Do the
longer calculation and compare the conclusions.
3 Find the line of best fit for the mens 1500 meter run. How does the slope compare
with that for the mens mile? (The distances are close; a mile is about 1609 meters.)
4 Find the line of best fit for the records for womens mile.
5 Do the lines of best fit for the mens and womens miles cross?
6 (This illustrates that there are data sets for which a linear model is not right,
and that the line of best fit doesnt in that case have any predictive value.) In a
highway restaurant a trucker told me that his boss often sends him by a roundabout
route, using more gas but paying lower bridge tolls. He said that New York State
calibrates the toll for each bridge across the Hudson, playing off the extra gas to
get there from New York City against a lower crossing cost, to encourage people to
go upstate. This table, from [Cost Of Tolls] and [Google Maps], lists for each toll
crossing of the Hudson River, the distance to drive from Times Square in miles
and the cost in US dollars for a passenger car (if a crossings has a one-way toll
then it shows half that number).
Crossing
Distance Toll
Lincoln Tunnel
2
6.00
Holland Tunnel
7
6.00
George Washington Bridge
8
6.00
Verrazano-Narrows Bridge
16
6.50
Tappan Zee Bridge
27
2.50
Bear Mountain Bridge
47
1.00
Newburgh-Beacon Bridge
67
1.00
Mid-Hudson Bridge
82
1.00
Kingston-Rhinecliff Bridge
102
1.00
Rip Van Winkle Bridge
120
1.00
Find the line of best fit and graph the data to show that the driver was practicing
on my credulity.
7 When the space shuttle Challenger exploded in 1986, one of the criticisms made
of NASAs decision to launch was in the way they did the analysis of number of
O-ring failures versus temperature (O-ring failure caused the explosion). Four
O-ring failures would be fatal. NASA had data from 24 previous flights.
temp F
53 75 57 58 63 70 70 66 67 67 67
failures
3
2
1
1
1
1
1
0
0
0
0
68 69 70 70 72 73 75 76 76 78 79 80 81
0
0
0
0
0
0
0
0
0
0
0
0
0
270
The temperature that day was forecast to be 31 F.

(a) NASA based the decision to launch partially on a chart showing only the
flights that had at least one O-ring failure. Find the line that best fits these
seven flights. On the basis of this data, predict the number of O-ring failures
when the temperature is 31, and when the number of failures will exceed four.
(b) Find the line that best fits all 24 flights. On the basis of this extra data,
predict the number of O-ring failures when the temperature is 31, and when the
number of failures will exceed four.
Which do you think is the more accurate method of predicting? (An excellent
discussion is in [Dalal, et. al.].)
8 This table lists the average distance from the sun to each of the first seven planets,
using Earths average as a unit.
Mercury Venus Earth Mars Jupiter Saturn Uranus
0.39
0.72
1.00
1.52
5.20
9.54
19.2
(a) Plot the number of the planet (Mercury is 1, etc.) versus the distance. Note
that it does not look like a line, and so finding the line of best fit is not fruitful.
(b) It does, however look like an exponential curve. Therefore, plot the number
of the planet versus the logarithm of the distance. Does this look like a line?
(c) The asteroid belt between Mars and Jupiter is what is left of a planet that
broke apart. Renumber so that Jupiter is 6, Saturn is 7, and Uranus is 8, and
plot against the log again. Does this look better?
(d) Use least squares on that data to predict the location of Neptune.
(e) Repeat to predict where Pluto is.
(f) Is the formula accurate for Neptune and Pluto?
This method was used to help discover Neptune (although the second item is
misleading about the history; actually, the discovery of Neptune in position 9
prompted people to look for the missing planet in position 5). See [Gardner, 1970]
Topic
Geometry of Linear Maps
The pictures below contrast the nonlinear maps f1 (x) = ex and f2 (x) = x2 with
the linear maps h1 (x) = 2x and h2 (x) = x. Each shows the domain R1 on the
left mapped to the codomain R1 on the right. Arrows trace where each map
sends x = 0, x = 1, x = 2, x = 1, and x = 2.
Note how the nonlinear maps distort the domain in transforming it into the
range. For instance, f1 (1) is further from f1 (2) than it is from f1 (0) the map
spreads the domain out unevenly so that in moving from domain to range an
interval near x = 2 spreads apart more than is an interval near x = 0.
The linear maps are nicer, more regular, in that for each map all of the domain
spreads by the same factor.
5
-5
-5
-5
-5
272
The only linear maps from R1 to R1 are multiplications by a scalar but in

higher dimensions more can happen. For instance, this linear transformation of
R2 rotates vectors counterclockwise.

x cos y sin
x
7
x sin + y cos
y
The transformation of R3 that projects vectors into the xz-plane is also not
simply a rescaling.

x
x
y70
z
z
Nonetheless, even in higher dimensions the linear maps behave nicely. Consider a linear map h : Rn Rm We will use the standard bases to represent it
by a matrix H. Recall that any such H factors as H = PBQ, where P and Q
are nonsingular and B is a partial-identity matrix. Recall also that nonsingular
matrices factor into elementary matrices PBQ = Tn Tn1 Tj BTj1 T1 , which
are matrices that come from the identity I after one Gaussian step
ki
I Mi (k)
i j
I Pi,j
ki +j
I Ci,j (k)
for i 6= j, k 6= 0. So if we understand the effect of a linear map described

by a partial-identity matrix and the effect of the linear maps described by the
elementary matrices then we will in some sense understand the effect of any linear
map. (To understand them we mean to give a description of their geometric
effect; the pictures below stick to transformations of R2 for ease of drawing but
the principles extend for maps from any Rn to any Rm .)
The geometric effect of the linear transformation represented by a partialidentity matrix is projection.

x

y
z
1
0
0
0
1
0
0
0
0
!
E ,E
3
3

x

y
0
The geometric effect of the Mi (k) matrices is to stretch vectors by a factor

of k along the i-th axis. This map stretches by a factor of 3 along the x-axis.

x
3x
7
y
y
Topic: Geometry of Linear Maps
273
If 0 6 k < 1 or if k < 0 then the i-th component goes the other way, here to the
left.

x
2x
7
y
y
Either of these is a dilation.

A transformation represented by a Pi,j matrix interchanges the i-th and j-th
axes. This is reflection about the line xi = xj .

y
x
7
x
y
Permutations involving more than two axes decompose into a combination of

swaps of pairs of axes; see Exercise 5.
The remaining matrices have the form Ci,j (k). For instance C1,2 (2) performs
21 + 2 .
!
! 1 0
2
1 E ,E
x
x
2
2
y
2x + y
In the picture below, the vector ~u with the first component of 1 is affected less
than the vector ~v with the first component of 2 h(~u) is only 2 higher than ~u
while h(~v) is 4 higher than ~v.
h(~
v)
h(~
u)
u
~
~
v

x
x
7
y
2x + y
Any vector with a first component of 1 would be affected in the same way as
~u; it would slide up by 2. And any vector with a first component of 2 would
slide up 4, as was ~v. That is, the transformation represented by Ci,j (k) affects
vectors depending on their i-th component.
Another way to see this point is to consider the action of this map on the unit
square. In the next picture, vectors with a first component of 0, like the origin,
are not pushed vertically at all but vectors with a positive first component slide
up. Here, all vectors with a first component of 1, the entire right side of the
square, slide to the same extent. In general, vectors on the same vertical line
slide by the same amount, by twice their first component. The shape of the
result, a rhombus, has the same base and height as the square (and thus the
same area) but the right angle corners are gone.

x
x
7
y
2x + y
274
For contrast the next picture shows the effect of the map represented by

C2,1 (1). Here vectors are affected according to their second component: yx
slides horizontally by twice y.

x + 2y
x
7
y
y
This kind of map is a skew.

With that, we understand the geometric effect of the four types of components
in the expansion H = Tn Tn1 Tj BTj1 T1 , and so, in some sense, we have
an understanding of the action of any matrix H.
We will illustrate the usefulness of our understanding in two ways. The
first is that we will use it to prove something about linear maps. Recall that
under a linear map, the image of a subspace is a subspace and thus the linear
transformation h represented by H maps lines through the origin to lines through
the origin. (The dimension of the image space cannot be greater than the
dimension of the domain space, so a line cant map onto, say, a plane.) We will
show that h maps any line, not just one through the origin, to a line. The proof
is simple: the partial-identity projection B and the elementary Ti s each turn a
line input into a line output (verifying the four cases is Exercise 6). Therefore
their composition also preserves lines.
The second way that we will illustrate the usefulness of our understanding
is to apply it to Calculus. Below is a picture of the action of the one-variable
real function y(x) = x2 + x. As we noted at that start of this Topic, overall the
geometric effect of this map is irregular in that at different domain points it
has different effects; for example as the domain point x goes from 2 to 2, the
associated range point f(x) at first decreases, then pauses instantaneously, and
then increases.
But in Calculus we focus less on the map overall, and more on the local effect
of the map. The picture below looks closely at what this map does near x = 1.
The derivative is dy/dx = 2x + 1 so that near x = 1 we have y 3 x. That
is, in a neighborhood of x = 1, in carrying the domain to the codomain this map
causes it to grow by a factor of 3 it is, locally, approximately, a dilation. The
picture below shows a small interval in the domain (1 x .. 1 + x) carried
Topic: Geometry of Linear Maps
275
over to an interval in the codomain (2 y .. 2 + y) that is three times as wide

y 3 x.
y=2
x=1
In higher dimensions the idea is the same but more can happen than in the
R1 -to-R1 scalar multiplication case. For a function y : Rn Rm and a point
~x Rn , the derivative is defined to be the linear map h : Rn Rm that best
approximates how y changes near y(~x). So the geometry studied above directly
applies to the derivatives.
We will close this Topic by remarking how this point of view makes clear
an often misunderstood but very important result about derivatives, the Chain
Rule. Recall that, with suitable conditions on the two functions, the derivative
of the composition is this.
d (g f)
dg
df
(x) =
(f(x))
(x)
dx
dx
dx
For instance the derivative of sin(x2 + 3x) is cos(x2 + 3x) (2x + 3).
Where does this come from? Consider the f, g : R1 R1 picture.
g(f(x))
f(x)
x
The first map f dilates the neighborhood of x by a factor of

df
(x)
dx
and the second map g follows that by dilating a neighborhood of f(x) by a factor
of
dg
( f(x) )
dx
and when combined, the composition dilates by the product of the two. In
higher dimensions the map expressing how a function changes near a point is
276
a linear map, and is represented by a matrix. The Chain Rule multiplies the
matrices.
Thus, the geometry of linear maps h : Rn Rm is appealing both for its
simplicity and for its usefulness.
Exercises
1 Let h : R2 R2 be the transformation that rotates vectors clockwise by /4 radians.
(a) Find the matrix H representing h with respect to the standard bases. Use
Gausss Method to reduce H to the identity.
(b) Translate the row reduction to a matrix equation Tj Tj1 T1 H = I (the prior
item shows both that H is similar to I, and that we need no column operations
to derive I from H).
(c) Solve this matrix equation for H.
(d) Sketch how H is a combination of dilations, flips, skews, and projections (the
identity is a trivial projection).
2 What combination of dilations, flips, skews, and projections produces a rotation
counterclockwise by 2/3 radians?
3 What combination of dilations, flips, skews, and projections produces the map
h : R3 R3 represented with respect to the standard bases by this matrix?
1 2 1
3 6 0
1 2 2
4 Show that any linear transformation of R1 is the map that multiplies by a scalar
x 7 kx.
5 Show that for any permutation (that is, reordering) p of the numbers 1, . . . , n,
the map

x1
xp(1)
x
x
2
p(2)
. 7 .
.
.
.
.
xn
xp(n)
can be done with a composition of maps, each of which only swaps a single pair of
coordinates. Hint: you can use induction on n. (Remark: in the fourth chapter we
will show this and we will also show that the parity of the number of swaps used is
determined by p. That is, although a particular permutation could be expressed in
two different ways with two different numbers of swaps, either both ways use an
even number of swaps, or both use an odd number.)
6 Show that linear maps preserve the linear structures of a space.
(a) Show that for any linear map from Rn to Rm , the image of any line is a line.
The image may be a degenerate line, that is, a single point.
(b) Show that the image of any linear surface is a linear surface. This generalizes
the result that under a linear map the image of a subspace is a subspace.
(c) Linear maps preserve other linear ideas. Show that linear maps preserve
betweeness: if the point B is between A and C then the image of B is between
the image of A and the image of C.
7 Use a picture like the one that appears in the discussion of the Chain Rule to
answer: if a function f : R R has an inverse, whats the relationship between how
the function locally, approximately dilates space, and how its inverse dilates
space (assuming, of course, that it has an inverse)?
Topic
Magic Squares
A Chinese legend tells the story of a flood by the Lo river. The people offered
sacrifices to appease the river. But each time a turtle emerged, walked around the
sacrifice, and returned to the water. Fuh-Hi, the founder of Chinese civilization,
interpreted this to mean that the river was still annoyed. Fortunately, a child
noticed that on its shell the turtle had the pattern on the left below, which is
today called Lo Shu (river scroll).
4
3
8
9
5
1
2
7
6
The dots make the matrix on the right where the rows, columns, and diagonals
add to 15. Now that the people knew how much to sacrifice, the rivers anger
cooled.
A square matrix is magic if each row, column, and diagonal add to the same
value, the matrixs magic number.
Another example of a magic square appears in the engraving Melencolia I
by Albrecht Drer.
278
One interpretation is that it depicts melancholy, a depressed state. The figure,

genius, has a wealth of fascinating things to explore including the compass, the
geometrical solid, the scale, and the hourglass. But the figure is unmoved; all of
these things lie unused. One of the potential delights, in the upper right, is a
44 matrix whose rows, columns, and diagonals add to 34.
16
5
9
4
3
10
6
15
2
11
7
14
13
8
12
1
The middle entries on the bottom row give 1514, the date of the engraving.
The above two squares are arrangements of 1 . . . n2 . They are normal. The
1 1 square whose sole entry is 1 is normal, there is no normal 2 2 magic
square by Exercise 2, and there are normal magic squares of every other size; see
[Wikipedia Magic Square]. Finding the number of normal magic squares of each
size is an unsolved problem; see [Online Encyclopedia of Integer Sequences].
If we dont require that the squares be normal then we can say much more.
Every 11 square is magic, trivially. If the rows, columns, and diagonals of a
22 matrix
!
a b
c d
add to s then a + b = s, c + d = s, a + c = s, b + d = s, a + d = s, and b + c = s.
Exercise 2 shows that this system has the unique solution a = b = c = d = s/2.
So the set of 22 magic squares is a one-dimensional subspace of M22 .
In general, a sum of two same-sized magic squares is magic and a scalar
multiple of a magic square is magic so the set of nn magic squares Mn is
a vector space, a subspace of Mnn . This Topic shows that for n > 3 the
dimension of Mn is n2 n. The set Mn,0 of nn magic squares with magic
number 0 is another subspace, and we will find the formula for its dimension
also: n2 2n 1 when n > 3.
We will first prove that dim Mn = dim Mn,0 + 1. Define the trace of a
matrix to be the sum down its upper-left to lower-right diagonal Tr(M) =
m1,1 + + mn,n . Consider the restriction of the trace to the magic squares
Tr : Mn R. The null space N (Tr) is the set of magic squares with magic
number zero Mn,0 . Observe that the trace is onto because for any r in the
codomain R the nn matrix whose entries are all r/n is a magic square with
magic number r. Theorem Two.II.2.15 says that for any linear map the dimension
of the domain equals the dimension of the range space plus the dimension of the
null space, the maps rank plus its nullity. Here the domain is Mn , the range
space is R and the null space is Mn,0 , so we have that dim Mn = 1 + dim Mn,0 .
We will finish by showing that dim Mn,0 = n2 2n 1 for n > 3. (For
n = 1 the dimension is clearly 0. Exercise 3 shows it is also 0 for n = 2.) If the
Topic: Magic Squares
279
rows, columns, and diagonals of a matrix
a b c
d e f
g h i
add to zero then we have an (2n + 2)n2 linear system.
a+b+c
=0
=0
g+h+i=0
+d
+g
=0
+e
+h
=0
c
+f
+i=0
+e
+i=0
c
+e
+g
=0
d+e+f
a
b
a
The matrix of coefficients for the particular cases of n = 3 and n = 4 are

below, with the rows and columns numbered to help in reading the proof. With
2
respect to the standard basis, each represents a linear map h : Rn R2n+2 .
The domain has dimension n2 so if we show that the rank of the matrix is 2n + 1
then we will have what we want, that the dimension of the null space Mn,0 is
n2 (2n + 1).
~1
~2
~3
1 2
1 1
0 0
0 0
3
1
0
0
4 5 6
0 0 0
1 1 1
0 0 0
7 8 9
0 0 0
0 0 0
1 1 1
~4
~5
~6
1
0
0
0
1
0
0
0
1
1
0
0
0
1
0
0
0
1
1
0
0
0
1
0
0
0
1
~7
~8
1
0
0
0
0
1
0
0
1
1
0
0
0
1
0
0
1
0
~1
~2
~3
~4
1 2
1 1
0 0
0 0
0 0
3 4
1 1
0 0
0 0
0 0
5
0
1
0
0
6
0
1
0
0
7
0
1
0
0
8
0
1
0
0
9 10 11
0 0 0
0 0 0
1 1 1
0 0 0
12 13 14
0 0 0
0 0 0
1 0 0
0 1 1
15
0
0
0
1
16
0
0
0
1
~5
~6
~7
~8
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
~9
~10
1
0
0
0
0
0
0
1
0
0
1
0
0
1
0
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
1
0
280
We want to show that the rank of the matrix of coefficients, the number of
rows in a maximal linearly independent set, is 2n + 1. The first n rows of the
matrix of coefficients add to the same vector as the second n rows, the vector of
all ones. So a maximal linearly independent must omit at least one row. We will
show that the set of all rows but the first {~2 . . . ~2n+2 } is linearly independent.
So consider this linear relationship.
c2~2 + + c2n~2n + c2n+1~2n+1 + c2n+2~2n+2 = ~0
(*)
Now it gets messy. In the final two rows, in the first n columns, is a subrow
that is all zeros except that it starts with a one in column 1 and a subrow
that is all zeros except that it ends with a one in column n. With ~1 not in
(), each of those columns contains only two ones and so we can conclude that
c2n+1 = cn+1 as well as that c2n+2 = c2n .
Next consider the columns between those two in the n = 3 illustration
above this includes only the second column while in the n = 4 matrix it includes
both the second and third columns. Each such column has a single one. That is,
for each column index j {2 . . . n 2} the column consists of only zeros except
for a one in row n + j, and hence cn+j = 0.
On to the next block of columns, from n + 1 through 2n. Column n + 1 has
only two ones (because n > 3 the ones in the last two rows do not fall in the first
column of this block). Thus c2 = cn+1 and therefore c2 = c2n+1 . Likewise,
from column 2n we conclude that c2 = c2n and so c2 = c2n+2 .
Because n > 3 there is at least one column between column n + 1 and
column 2n 1. In at least one of those columns a one appears in ~2n+1 . If a
one also appears in that column in ~2n+2 then we have c2 = (c2n+1 + c2n+2 )
(recall that cn+j = 0 for j {2 . . . n 2}). If a one does not appear in that
column in ~2n+2 then we have c2 = c2n+1 . In either case c2 = 0, and thus
c2n+1 = c2n+2 = 0 and cn+1 = c2n = 0.
If the next block of n-many columns is not the last then similarly conclude
from its first column that c3 = cn+1 = 0.
Keep this up until we reach the last block of columns, those numbered
(n 1)n + 1 through n2 . Because cn+1 = = c2n = 0 column n2 gives that
cn = c2n+1 = 0.
Therefore the rank of the matrix is 2n + 1, as required.
The classic source on normal magic squares is [Ball & Coxeter]. More on
the Lo Shu square is at [Wikipedia Lo Shu Square]. The proof given here began
with [Ward].
Exercises
1 Let M be a 33 magic square with magic number s.
(a) Prove that the sum of Ms entries is 3s.
(b) Prove that s = 3 m2,2 .
(c) Prove that m2,2 is the average of the entries in its row, its column, and in
each diagonal.
Topic: Magic Squares
281
(d) Prove that m2,2 is the median of Ms entries.

2 Solve the system a + b = s, c + d = s, a + c = s, b + d = s, a + d = s, and b + c = s.
3 Show that dim M2,0 = 0.
4 Let the trace function be Tr(M) = m1,1 + + mn,n . Define also the sum down
the other diagonal Tr (M) = m1,n + + mn,1 .
(a) Show that the two functions Tr, Tr : Mnn R are linear.
(b) Show that the function : Mnn R2 given by (M) = (Tr(M), Tr (m)) is
linear.
(c) Generalize the prior item.
5 A square matrix is semimagic if the rows and columns add to the same value,
that is, if we drop the condition on the diagonals.
(a) Show that the set of semimagic squares Hn is a subspace of Mnn .
(b) Show that the set Hn,0 of nn semimagic squares with magic number 0 is
also a subspace of Mnn .
6 [Beardon] Here is a slicker proof of the result of this Topic, when n > 3. See the
prior two exercises for some definitions and needed results.
(a) First show that dim Mn,0 = dim Hn,0 + 2. To do this, consider the function
: Mn R2 sending a matrix M to the ordered pair (Tr(M), Tr (M)). Specifically, consider the restriction of that map : Hn R2 to the semimagic squares.
Clearly its null space is Mn,0 . Show that when n > 3 this restriction is onto.
(Hint: we need only find a basis for R2 that is the image of two members of Hn )
(b) Let the function : Mnn M(n1)(n1) be the identity map except that
where m
i,j = mi,j for all
it drops the final row and column: (M) = M
i, j {1 . . . n 1}. The check that is linear is easy. Consider s restriction to
the semimagic squares with magic number zero : Hn,0 M(n1)(n1) . Show
that is one-to-one
(c) Show that is onto.
(d) Conclude that Hn,0 has dimension (n 1)2 .
(e) Conclude that dim(Mn ) = n2 n
Topic
Markov Chains
Here is a simple game: a player bets on coin tosses, a dollar each time, and the
game ends either when the player has no money or is up to five dollars. If the
player starts with three dollars, what is the chance that the game takes at least
five flips? Twenty-five flips?
At any point, this player has either $0, or $1, . . . , or $5. We say that the
player is in the state s0 , s1 , . . . , or s5 . In the game the player moves from state
to state. For instance, a player now in state s3 has on the next flip a 0.5 chance
of moving to state s2 and a 0.5 chance of moving to s4 . The boundary states
are a bit different; a player never leaves state s0 or state s5 .
Let pi (n) be the probability that the player is in state si after n flips. Then,
for instance, we have that the probability of being in state s0 after flip n + 1 is
p0 (n + 1) = p0 (n) + 0.5 p1 (n). This matrix equation summarizes.
1.0
0.0
0.0
0.0
0.0
0.0
0.5
0.0
0.5
0.0
0.0
0.0
0.0
0.5
0.0
0.5
0.0
0.0
0.0
0.0
0.5
0.0
0.5
0.0
0.0
0.0
0.0
0.5
0.0
0.5
0.0
p0 (n)
p0 (n + 1)
0.0
p1 (n) p1 (n + 1)
0.0 p2 (n) p2 (n + 1)
0.0
p (n)
p (n + 1)
3 3
0.0 p4 (n) p4 (n + 1)
1.0
p5 (n)
p5 (n + 1)
With the initial condition that the player starts with three dollars, these are
components of the resulting vectors.
n=0
0
0
0
1
0
0
n=1
0
0
0.5
0
0.5
0
n=2
0
0.25
0
0.5
0
0.25
n=3
0.125
0
0.375
0
0.25
0.25
n=4
0.125
0.1875
0
0.3125
0
0.375
n = 24
0.39600
0.00276
0
0.00447
0
0.59676
This exploration suggests that the game is not likely to go on for long, with
the player quickly moving to an ending state. For instance, after the fourth flip
there is a 0.50 probability that the game is already over.
Topic: Markov Chains
283
This is a Markov chain, named for A.A. Markov, who worked in the first half
of the 1900s. Each vector is a probability vector , whose entries are nonnegative
real numbers that sum to 1. The matrix is a transition matrix or stochastic
matrix, whose entries are nonnegative reals and whose columns sum to 1.
A characteristic feature of a Markov chain model is that it is historyless in
that the next state depends only on the current state, not on any prior ones.
Thus, a player who arrives at s2 by starting in state s3 and then going to state s2
has exactly the same chance of moving next to s3 as does a player whose history
was to start in s3 then go to s4 then to s3 and then to s2 .
Here is a Markov chain from sociology. A study ([Macdonald & Ridge],
p. 202) divided occupations in the United Kingdom into three levels: executives
and professionals, supervisors and skilled manual workers, and unskilled workers.
They asked about two thousand men, At what level are you, and at what level
was your father when you were fourteen years old? Here the Markov model
assumption about history may seem reasonable we may guess that while a
parents occupation has a direct influence on the occupation of the child, the
grandparents occupation likely has no such direct influence. This summarizes
the studys conclusions.
.60
.26
.14
.29
.37
.34
.16
pU (n)
pU (n + 1)
.27 pM (n) = pM (n + 1)
.57
pL (n)
pL (n + 1)
For instance, looking at the middle class for the next generation, a child of an
upper class worker has a 0.26 probability of becoming middle class, a child of
a middle class worker has a 0.37 chance of being middle class, and a child of a
lower class worker has a 0.27 probability of becoming middle class. With the
initial distribution of the respondents fathers given below, this table gives the
next five generations.
n=0
.12
.32
.56
n=1
.23
.34
.42
n=2
.29
.34
.37
n=3
.31
.34
.35
n=4
.32
.33
.34
n=5
.33
.33
.34
One more example. In professional American baseball there are two leagues,
the American League and the National League. At the end of the annual season
the team winning the American League and the team winning the National
League play the World Series. The winner is the first team to take four games.
That means that a series is in one of twenty-four states: 0-0 (no games won
yet by either team), 1-0 (one game won for the American League team and no
games for the National League team), etc.
Consider a series with a probability p that the American League team wins
284
each game. We have this.
0
p
1 p
..
.
0
0
0
p
1p
0
..
.
0
0
0
0
p
1p
..
.
p0-0 (n + 1)
p0-0 (n)
0 ...
0 . . .
p1-0 (n) p1-0 (n + 1)
0 . . . p0-1 (n) p0-1 (n + 1)
0 . . . p2-0 (n) = p2-0 (n + 1)
0 . . .
p1-1 (n) p1-1 (n + 1)
p0-2 (n) p0-2 (n + 1)
0 . . .
..
..
..
.
.
.
An especially interesting special case is when the teams are evenly matched,
p = 0.50. This table below lists the resulting components of the n = 0 through
n = 7 vectors. (The code to generate this table in the computer algebra system
Octave follows the exercises.)
Note that evenly-matched teams are likely to have a long series there is a
probability of 0.625 that the series goes at least six games.
00
10
01
20
11
02
30
21
12
03
40
31
22
13
04
41
32
23
14
42
33
24
43
34
n=0 n=1
1
0
0
0.5
0
0.5
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
n=2
0
0
0
0.25
0.5
0.25
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
n=3
0
0
0
0
0
0
0.125
0.375
0.375
0.125
0
0
0
0
0
0
0
0
0
0
0
0
0
0
n=4
0
0
0
0
0
0
0
0
0
0
0.0625
0.25
0.375
0.25
0.0625
0
0
0
0
0
0
0
0
0
n=5
0
0
0
0
0
0
0
0
0
0
0.0625
0
0
0
0.0625
0.125
0.3125
0.3125
0.125
0
0
0
0
0
n=6
0
0
0
0
0
0
0
0
0
0
0.0625
0
0
0
0.0625
0.125
0
0
0.125
0.15625
0.3125
0.15625
0
0
n=7
0
0
0
0
0
0
0
0
0
0
0.0625
0
0
0
0.0625
0.125
0
0
0.125
0.15625
0
0.15625
0.15625
0.15625
Markov chains are a widely-used applications of matrix operations. They

also give us an example of the use of matrices where we do not consider the
significance of the maps represented by the matrices. For more on Markov chains,
there are many sources such as [Kemeny & Snell] and [Iosifescu].
285
Exercises
Use a computer for these problems. You can, for instance, adapt the Octave
script given below.
1 These questions refer to the coin-flipping game.
(a) Check the computations in the table at the end of the first paragraph.
(b) Consider the second row of the vector table. Note that this row has alternating
0s. Must p1 (j) be 0 when j is odd? Prove that it must be, or produce a
counterexample.
(c) Perform a computational experiment to estimate the chance that the player
ends at five dollars, starting with one dollar, two dollars, and four dollars.
2 [Feller] We consider throws of a die, and say the system is in state si if the largest
number yet appearing on the die was i.
(a) Give the transition matrix.
(b) Start the system in state s1 , and run it for five throws. What is the vector at
the end?
3 [Kelton] There has been much interest in whether industries in the United States
are moving from the Northeast and North Central regions to the South and West,
motivated by the warmer climate, by lower wages, and by less unionization. Here
is the transition matrix for large firms in Electric and Electronic Equipment.
NE
NC
S
W
Z
NE
0.787
0
0.021
NC
0
0.966
0.063
0.009
0
0.034
0.937
0.074
0.005
0.111
0
0.612
0.010
0.102
0
0.314
0.954
For example, a firm in the Northeast region will be in the West region next year
with probability 0.111. (The Z entry is a birth-death state. For instance, with
probability 0.102 a large Electric and Electronic Equipment firm from the Northeast
will move out of this system next year: go out of business, move abroad, or move to
another category of firm. There is a 0.021 probability that a firm in the National
Census of Manufacturers will move into Electronics, or be created, or move in
from abroad, into the Northeast. Finally, with probability 0.954 a firm out of the
categories will stay out, according to this research.)
(a) Does the Markov model assumption of lack of history seem justified?
(b) Assume that the initial distribution is even, except that the value at Z is 0.9.
Compute the vectors for n = 1 through n = 4.
(c) Suppose that the initial distribution is this.
NE
NC
S
W
Z
0.0000 0.6522 0.3478 0.0000 0.0000
Calculate the distributions for n = 1 through n = 4.
(d) Find the distribution for n = 50 and n = 51. Has the system settled down to
an equilibrium?
4 [Wickens] Here is a model of some kinds of learning The learner starts in an
undecided state sU . Eventually the learner has to decide to do either response A
(that is, end in state sA ) or response B (ending in sB ). However, the learner doesnt
jump right from undecided to sure that A is the correct thing to do (or B). Instead,
the learner spends some time in a tentative-A state, or a tentative-B state,
trying the response out (denoted here tA and tB ). Imagine that once the learner has
286

decided, it is final, so once in sA or sB , the learner stays there. For the other state
changes, we can posit transitions with probability p in either direction.
(a) Construct the transition matrix.
(b) Take p = 0.25 and take the initial vector to be 1 at sU . Run this for five steps.
What is the chance of ending up at sA ?
(c) Do the same for p = 0.20.
(d) Graph p versus the chance of ending at sA . Is there a threshold value for p,
above which the learner is almost sure not to take longer than five steps?
5 A certain town is in a certain country (this is a hypothetical problem). Each year

ten percent of the town dwellers move to other parts of the country. Each year one
percent of the people from elsewhere move to the town. Assume that there are two
states sT , living in town, and sC , living elsewhere.
(a) Construct the transition matrix.
(b) Starting with an initial distribution sT = 0.3 and sC = 0.7, get the results for
the first ten years.
(c) Do the same for sT = 0.2.
(d) Are the two outcomes alike or different?
6 For the World Series application, use a computer to generate the seven vectors for
p = 0.55 and p = 0.6.
(a) What is the chance of the National League team winning it all, even though
they have only a probability of 0.45 or 0.40 of winning any one game?
(b) Graph the probability p against the chance that the American League team
wins it all. Is there a threshold value a p above which the better team is
essentially ensured of winning?
7 Above we define a transition matrix to have each entry nonnegative and each
column sum to 1.
(a) Check that the three transition matrices shown in this Topic meet these two
conditions. Must any transition matrix do so?
(b) Observe that if A~v0 = ~v1 and A~v1 = ~v2 then A2 is a transition matrix from
~v0 to ~v2 . Show that a power of a transition matrix is also a transition matrix.
(c) Generalize the prior item by proving that the product of two appropriatelysized transition matrices is a transition matrix.
Computer Code
This script markov.m for the computer algebra system Octave generated the
table of World Series outcomes. (The hash character # marks the rest of a line
as a comment.)
# Octave script file to compute chance of World Series outcomes.
function w = markov(p,v)
q = 1-p;
A=[0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 0-0
p,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 1-0
q,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 0-1_
0,p,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 2-0
0,q,p,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 1-1
0,0,q,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 0-2__
0,0,0,p,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 3-0
0,0,0,q,p,0, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 2-1
0,0,0,0,q,p, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 1-2_
0,0,0,0,0,q, 0,0,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 0-3
0,0,0,0,0,0, p,0,0,0,1,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 4-0
0,0,0,0,0,0, q,p,0,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 3-1__
0,0,0,0,0,0, 0,q,p,0,0,0, 0,0,0,0,0,0, 0,0,0,0,0,0; # 2-2
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
w = A * v;
endfunction
0,0,q,p,0,0,
0,0,0,q,0,0,
0,0,0,0,0,p,
0,0,0,0,0,q,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0,
287
0,0,0,0,0,0,
0,0,1,0,0,0,
0,0,0,1,0,0,
p,0,0,0,0,0,
q,p,0,0,0,0,
0,q,0,0,0,0,
0,0,0,0,p,0,
0,0,0,0,q,p,
0,0,0,0,0,q,
0,0,0,0,0,0,
0,0,0,0,0,0,
0,0,0,0,0,0;
0,0,0,0,0,0;
0,0,0,0,0,0;
0,0,0,0,0,0;
0,0,0,0,0,0;
1,0,0,0,0,0;
0,1,0,0,0,0;
0,0,0,0,0,0;
0,0,0,1,0,0;
0,0,p,0,1,0;
0,0,q,0,0,1];
#
#
#
#
#
#
#
#
#
#
#
1-3
0-4_
4-1
3-2
2-3__
1-4
4-2
3-3_
2-4
4-3
3-4
Then the Octave session was this.

>
>
>
>
v0=[1;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0]
p=.5
v1=markov(p,v0)
v2=markov(p,v1)
...
Translating to another computer algebra system should be easy all have

commands similar to these.
Topic
Orthonormal Matrices
In The Elements, Euclid considers two figures to be the same if they have
the same size and shape. That is, while the triangles below are not equal
because they are not the same set of points, they are congruent essentially
indistinguishable for Euclids purposes because we can imagine picking the
plane up, sliding it over and rotating it a bit, although not warping or stretching
it, and then putting it back down, to superimpose the first figure on the second.
(Euclid never explicitly states this principle but he uses it often [Casey].)
P2
P1
Q2
P3
Q1
Q3
In modern terminology, picking the plane up . . . is considering a map from

the plane to itself. Euclid considers only transformations of the plane that may
slide or turn the plane but not bend or stretch it. Accordingly, we define a map
f : R2 R2 to be distance-preserving or a rigid motion or an isometry, if for
all points P1 , P2 R2 , the distance from f(P1 ) to f(P2 ) equals the distance from
P1 to P2 . We also define a plane figure to be a set of points in the plane and we
say that two figures are congruent if there is a distance-preserving map from
the plane to itself that carries one figure onto the other.
Many statements from Euclidean geometry follow easily from these definitions.
Some are: (i) collinearity is invariant under any distance-preserving map (that is,
if P1 , P2 , and P3 are collinear then so are f(P1 ), f(P2 ), and f(P3 )), (ii) betweeness
is invariant under any distance-preserving map (if P2 is between P1 and P3 then
so is f(P2 ) between f(P1 ) and f(P3 )), (iii) the property of being a triangle is
invariant under any distance-preserving map (if a figure is a triangle then the
image of that figure is also a triangle), (iv) and the property of being a circle
is invariant under any distance-preserving map. In 1872, F. Klein suggested
that we can define Euclidean geometry as the study of properties that are
invariant under these maps. (This forms part of Kleins Erlanger Program,
which proposes the organizing principle that we can describe each kind of
geometry Euclidean, projective, etc. as the study of the properties that are
Topic: Orthonormal Matrices
289
invariant under some group of transformations. The word group here means
more than just collection, but that lies outside of our scope.)
We can use linear algebra to characterize the distance-preserving maps of
the plane.
We must first observe that there are distance-preserving transformations of
the plane that are not linear. The obvious example is this translation.
!
!
!
!
x
x
1
x+1
7
+
=
y
y
0
y
However, this example turns out to be the only example, in the sense that if f is
distance-preserving and sends ~0 to ~v0 then the map ~v 7 f(~v) ~v0 is linear. That
will follow immediately from this statement: a map t that is distance-preserving
and sends ~0 to itself is linear. To prove this equivalent statement, let
!
!
a
c
t(~e1 ) =
t(~e2 ) =
b
d
for some a, b, c, d R. Then to show that t is linear we can show that it can be
represented by a matrix, that is, that t acts in this way for all x, y R.
!
!
ax + cy
x
t
~v =
7
()
y
bx + dy
Recall that if we fix three non-collinear points then we can determine any point
by giving its distance from those three. So we can determine any point ~v in
the domain by its distance from ~0, ~e1 , and ~e2 . Similarly, we can determine
any point t(~v) in the codomain by its distance from the three fixed points t(~0),
t(~e1 ), and t(~e2 ) (these three are not collinear because, as mentioned above,
collinearity is invariant and ~0, ~e1 , and ~e2 are not collinear). In fact, because
t is distance-preserving, we can say more: for the point ~v in the plane that is
determined by being the distance d0 from ~0, the distance d1 from ~e1 , and the
distance d2 from ~e2 , its image t(~v) must be the unique point in the codomain
that is determined by being d0 from t(~0), d1 from t(~e1 ), and d2 from t(~e2 ).
Because of the uniqueness, checking that the action in () works in the d0 , d1 ,
and d2 cases
!
!
!
x ~
x
ax
+
cy
dist(
, 0) = dist(t(
), t(~0)) = dist(
, ~0)
y
y
bx + dy
(we assumed that t maps ~0 to itself)
!
!
!
!
x
x
ax + cy
a
dist(
, ~e1 ) = dist(t(
), t(~e1 )) = dist(
,
)
y
y
bx + dy
b
and
!
!
!
!
x
x
ax + cy
c
dist(
, ~e2 ) = dist(t(
), t(~e2 )) = dist(
,
)
y
y
bx + dy
d
290
suffices to show that () describes t. Those checks are routine.

Thus we can write any distance-preserving f : R2 R2 as f(~v) = t(~v) + ~v0
for some constant vector ~v0 and linear map t that is distance-preserving. So
what is left in order to understand distance-preserving maps is to understand
distance-preserving linear maps.
Not every linear map is distance-preserving. For example ~v 7 2~v does not
preserve distances.
But there is a neat characterization: a linear transformation t of the plane
is distance-preserving if and only if both kt(~e1 )k = kt(~e2 )k = 1, and t(~e1 ) is
orthogonal to t(~e2 ). The only if half of that statement is easy because t
is distance-preserving it must preserve the lengths of vectors and because t
is distance-preserving the Pythagorean theorem shows that it must preserve
orthogonality. To show the if half we can check that the map preserves lengths
of vectors because then for all ~p and ~q the distance between the two is preserved
kt(~p ~q )k = kt(~p) t(~q )k = k~p ~q k. For that check let
~v =
x
y
!
t(~e1 ) =
a
b
!
t(~e2 ) =
c
d
and with the if assumptions that a2 + b2 = c2 + d2 = 1 and ac + bd = 0 we

have this.
kt(~v )k2 = (ax + cy)2 + (bx + dy)2
= a2 x2 + 2acxy + c2 y2 + b2 x2 + 2bdxy + d2 y2
= x2 (a2 + b2 ) + y2 (c2 + d2 ) + 2xy(ac + bd)
= x2 + y2
= k~v k2
One thing that is neat about this characterization is that we can easily
recognize matrices that represent such a map with respect to the standard
bases: the columns are of length one and are mutually orthogonal. This is an
orthonormal matrix or orthogonal matrix (people often use the second term
to mean not just that the columns are orthogonal but also that they have length
one).
We can use this to understand the geometric actions of distance-preserving
maps. Because kt(~v )k = k~v k, the map t sends any ~v somewhere on the circle
about the origin that has radius equal to the length of ~v. In particular, ~e1 and ~e2
map to the unit circle. Whats more, once we fix the unit vector ~e1 as mapped
to the vector with components a and b then there are only two places where ~e2
can go if its image is to be perpendicular to the first vectors image: it can map
either to one where ~e2 maintains its position a quarter circle clockwise from ~e1

b
a
291

a
b
RepE2 ,E2 (t) =
a
b
b
a
or to one where it goes a quarter circle counterclockwise.

a
b
RepE2 ,E2 (t) =
a
b
!
b
a
b
a
We can geometrically describe these two cases. Let be the counterclockwise

angle between the x-axis and the image of ~e1 . The first matrix above represents,
with respect to the standard bases, a rotation of the plane by radians.

b
a

a
b
x
y
!
t
!
x cos y sin
x sin + y cos
The second matrix above represents a reflection of the plane through the line
bisecting the angle between ~e1 and t(~e1 ).

a
b
x
y

!
t
!
x cos + y sin
x sin y cos
b
a
(This picture shows ~e1 reflected up into the first quadrant and ~e2 reflected down
into the fourth quadrant.)
Note: in the domain the angle between ~e1 and ~e2 runs counterclockwise, and
in the first map above the angle from t(~e1 ) to t(~e2 ) is also counterclockwise,
so it preserves the orientation of the angle. But the second map reverses the
orientation. A distance-preserving map is direct if it preserves orientations and
opposite if it reverses orientation.
So, we have characterized the Euclidean study of congruence. It considers,
for plane figures, the properties that are invariant under combinations of (i) a
rotation followed by a translation, or (ii) a reflection followed by a translation
(a reflection followed by a non-trivial translation is a glide reflection).
Another idea, besides congruence of figures, encountered in elementary
geometry is that figures are similar if they are congruent after a change of scale.
These two triangles are similar since the second is the same shape as the first,
but 3/2-ths the size.
292

P2
P1
Q2
Q1
P3
Q3
From the above work we have that figures are similar if there is an orthonormal
matrix T such that the points ~q on one figure are the images of the points ~p on
the other figure by ~q = (kT )~v + ~p0 for some nonzero real number k and constant
vector ~p0 .
Although these ideas are from Euclid, mathematics is timeless and they are
still in use today. One application of the maps studied above is in computer
graphics. We can, for example, animate this top view of a cube by putting
together film frames of it rotating; thats a rigid motion.
Frame 1
Frame 2
Frame 3
We could also make the cube appear to be moving away from us by producing
film frames of it shrinking, which gives us figures that are similar.
Frame 1:
Frame 2:
Frame 3:
Computer graphics incorporates techniques from linear algebra in many other

ways (see Exercise 4).
A beautiful book that explores some of this area is [Weyl]. More on groups,
of transformations and otherwise, is in any book on Modern Algebra, for instance
[Birkhoff & MacLane]. More on Klein and the Erlanger Program is in [Yaglom].
Exercises
1 Decide
each of these
is an orthonormal matrix.
if
1/2 1/2
(a)
1/ 2 1/ 2

1/3 1/3
(b)
1/ 3 1/ 3

1/3 2/3
(c)
2/ 3
1/ 3
2 Write down the formula for each of these distance-preserving maps.
(a) the map that rotates /6 radians, and then translates by ~e2
(b) the map that reflects about the line y = 2x
(c) the map that reflects about y = 2x and translates over 1 and up 1
3
(a) The proof that a map that is distance-preserving and sends the zero vector
to itself incidentally shows that such a map is one-to-one and onto (the point
in the domain determined by d0 , d1 , and d2 corresponds to the point in the
293
codomain determined by those three). Therefore any distance-preserving map

has an inverse. Show that the inverse is also distance-preserving.
(b) Prove that congruence is an equivalence relation between plane figures.
4 In practice the matrix for the distance-preserving linear transformation and the
translation are often combined into one. Check that these two computations yield
the same first two components.

a c e
x
a c
x
e
b d f y
+
b d
y
f
0 0 1
1
(These are homogeneous coordinates; see the Topic on Projective Geometry).
5
(a) Verify that the properties described in the second paragraph of this Topic as
invariant under distance-preserving maps are indeed so.
(b) Give two more properties that are of interest in Euclidean geometry from
your experience in studying that subject that are also invariant under distancepreserving maps.
(c) Give a property that is not of interest in Euclidean geometry and is not
invariant under distance-preserving maps.
294
Chapter Four
Determinants
In the first chapter we highlighted the special case of linear systems with the
same number of equations as unknowns, those of the form T~x = ~b where T is
a square matrix. We noted a distinction between two classes of T s. If T is
associated with a unique solution for any vector ~b of constants, such as for the
homogeneous system T~x = ~0, then T is associated with a unique solution for
every vector ~b. We call such a matrix of coefficients nonsingular. The other
kind of T , where every linear system for which it is the matrix of coefficients has
either no solution or infinitely many solutions, is singular.
In our work since then the value of this distinction has been a theme. For
instance, we now know that an nn matrix T is nonsingular if and only if each
of these holds:
any system T~x = ~b has a solution and that solution is unique;
Gauss-Jordan reduction of T yields an identity matrix;
the rows of T form a linearly independent set;
the columns of T form a linearly independent set, and a basis for Rn ;
any map that T represents is an isomorphism;
an inverse matrix T 1 exists.
So when we look at a particular square matrix, one of the first things that we
ask is whether it is nonsingular.
Naturally there is a formula that determines whether T is nonsingular. This
chapter develops that formula. More precisely, we will develop infinitely many
formulas, one for 11 matrices, one for 22 matrices, etc. These formulas are
related, that is, we will develop a family of formulas, a scheme that describes
the formula for each size.
Since we will restrict the discussion to square matrices, in this chapter we
will often simply say matrix in place of square matrix.
296
Chapter Four. Determinants
Definition
Determining nonsingularity is trivial for 11 matrices.

is nonsingular iff a 6= 0
a
Corollary Three.IV.4.11 gives the formula for the inverse of a 22 matrix.
!
a b
is nonsingular iff ad bc 6= 0
c d
We can produce the 33 formula as we did the prior one, although the computation is intricate (see Exercise 9).
a b c
d e f is nonsingular iff aei + bfg + cdh hfa idb gec 6= 0

g h i
With these cases in mind, we posit a family of formulas: a, ad bc, etc. For
each n the formula gives rise to a determinant function detnn : Mnn R
such that an nn matrix T is nonsingular if and only if detnn (T ) 6= 0. (We
usually omit the subscript nn because the size of T tells us which determinant
function we mean.)
I.1
Exploration
This is an optional motivation of the general definition, suggesting how a

person might develop that formula. The definition is in the next subsection.
Above, in each case the matrix is nonsingular if and only if some formula
is nonzero. But the three cases dont show an obvious pattern for the formula.
We may spot that the 11 term a has one letter, that the 22 terms ad and
bc have two letters, and that the 33 terms aei, etc., have three letters. We
may also spot that in those terms there is a letter from each row and column of
the matrix, e.g., in the cdh term one letter comes from each row and from each
column.
h
But these observations are perhaps more puzzling than enlightening. For instance,
we might wonder why we add some of the terms while we subtract others.
A good problem solving strategy is to see what properties a solution must
have and then search for something with those properties. So we shall start by
asking what properties we require of the formulas.
Section I. Definition
297
At this point, our main way to decide whether a matrix is singular or

nonsingular is to do Gaussian reduction and then check whether the diagonal
of resulting echelon form matrix has any zeroes (that is, to check whether the
product down the diagonal is zero). So we could guess that whatever formula
we find, the proof that it is right may involve applying Gausss Method to the
matrix to show that in the end the product down the diagonal is zero if and
only if our formula gives zero.
This suggests a plan: we will look for a family of determinant formulas that
are unaffected by row operations and such that the determinant of an echelon
form matrix is the product of its diagonal entries. In the rest of this subsection
we will test this plan against the 22 and 33 formulas. In the end we will
have to modify the unaffected by row operations part, but not by much.
The first step in testing this plan is to see whether the 22 and 33 formulas
are unaffected by the row operation of combining: if
ki +j
T T
then is det(T ) = det(T )? This check of the 22 determinant after the k1 + 2

operation
!
a
b
det(
) = a(kb + d) (ka + c)b = ad bc
ka + c kb + d
shows that it is indeed unchanged, and the other 22 combination k2 + 1
gives the same result. The 33 combination k3 + 2 leaves the determinant
unchanged
a
b
c
det(kg + d kh + e ki + f) = a(kh + e)i + b(ki + f)g + c(kg + d)h

h(ki + f)a i(kg + d)b g(kh + e)c
g
h
i
= aei + bfg + cdh hfa idb gec
as do the other 33 row combination operations.
So there seems to be promise in the plan. Of course, perhaps if we had
worked out the 44 determinant formula and tested it then we might have found
that it is affected by row combinations. This is an exploration and we do not
yet have all the facts. Nonetheless, so far, so good.
Next is to compare det(T ) with det(T ) for row swaps. We now hit a snag:
the 22 row swap 1 2 does not yield ad bc.
!
c d
det(
) = cb ad
a b
And this 1 3 swap
g h
det(d e
a b
inside of a 33 matrix
f ) = gec + hfa + idb bfg cdh aei

c
298
also does not give the same determinant as before the swap; again there is a sign
change. Trying a different 33 swap 1 2
d e f
det(a b c) = dbi + ecg + fah hcd iae gbf

g h i
also gives a change of sign.
So row swaps seem to change the sign of a determinant formula. This does
not wreck our plan entirely. We intend to decide nonsingularity by considering
only whether the formula gives zero, not by considering its sign. Therefore,
instead of expecting determinant formulas to be entirely unaffected by row
operations, we modify our plan to have them to change sign on a swap.
To finish we compare det(T ) to det(T ) for the operation of multiplying a row
by a scalar k 6= 0. This
!
a
b
det(
) = a(kd) (kc)b = k (ad bc)
kc kd
ends with the determinant multiplied by k, and the other 22 case has the same
result. This 33 case ends the same way
a
b
c
det( d
e
f ) = ae(ki) + bf(kg) + cd(kh)
(kh)fa (ki)db (kg)ec
kg kh ki
= k (aei + bfg + cdh hfa idb gec)
and the other two are similar. These make us suspect that multiplying a row
by k multiplies the determinant by k. As before, this modifies our plan but does
not wreck it. We are asking only that the zeroness of the determinant formula
be unchanged and we are not focusing on the its sign or magnitude.
So, our modified plan is to look for determinants that remain unchanged
under the operation of row combination, that change sign on a row swap, and
that rescale on the rescaling of a row. In the next two subsections we will find
that for each n there is such a function, and is unique.
For the next subsection, note that scalars factor out of a row without affecting
other rows: here
3 3
9
1 1
3
det(2 1
1) = 3 det(2 1
1)
5 10 5
5 10 5
the 3 comes only out of the top row only, leaving the other rows unchanged.
So in the definition of determinant we will write it as a function of the rows
det(~1 , ~2 , . . . ~n ), not as det(T ) or as a function of the entries det(t1,1 , . . . , tn,n ).
Exercises
X 1.1 Evaluate the determinant of each.

(a)
3
1

1
1
299
2
(b) 3
1
0
1
0
1
1
1
4
(c) 0
1
1.2 Evaluate the determinant

of each.

2
1
1
2 0
(a)
(b) 0
5 2
1 3
1 3
4
2
(c) 5
8
1
1
1
0
0
3
3
6
9
4
7
1
X 1.3 Verify that the determinant of an upper-triangular 33 matrix is the product

down the diagonal.
a b c
det( 0 e f ) = aei
0 0 i
Do lower-triangular matrices work the same way?
X 1.4 Usethe
2
(a)
3
determinant
or nonsingular.

to decide
if each
is singular

4 2
1
0
1
(b)
(c)
1
1 1
2 1
1.5 Singular or
2 1
(a) 3 2
0 1
nonsingular? Use the determinant to decide.
1
1 0 1
2
1 0
(b) 2 1 1
(c) 3 2 0
2
4
4 1 3
1
0 0
X 1.6 Each pair of matrices differ by one row operation. Use this operation to compare
det(A) with det(B).

1 2
1
2
(a) A =
B=
2 3
0 1
3 1 0
3 1 0
(b) A = 0 0 1 B = 0 1 2
0 1 2
0 0 1
1 1
3
1 1
3
(c) A = 2
2 6 B = 1
1 3
1
0
4
1
0
4
1.7 Show this.
1
det( a
a2
1
b
b2
1
c ) = (b a)(c a)(c b)
c2
X 1.8 Which real numbers x make this matrix singular?

12 x
4
8
8x
1.9 Do the Gaussian reduction to check the formula for 33 matrices stated in the
preamble to this section.
a b c
d e f is nonsingular iff aei + bfg + cdh hfa idb gec 6= 0
g h i
1.10 Show that the equation of a
this determinant.
x
det(x1
x2
line in R2 thru (x1 , y1 ) and (x2 , y2 ) is given by

y
y1
y2
1
1) = 0
1
x1 6= x2
300
X 1.11 Many people know this mnemonic for the determinant of a 33 matrix: first
repeat the first two columns and then sum the products on the forward diagonals
and subtract the products on the backward diagonals. That is, first write
h1,1 h1,2 h1,3 h1,1 h1,2

h2,1 h2,2 h2,3 h2,1 h2,2
h3,1 h3,2 h3,3 h3,1 h3,2
and then calculate this.
h1,1 h2,2 h3,3 + h1,2 h2,3 h3,1 + h1,3 h2,1 h3,2
h3,1 h2,2 h1,3 h3,2 h2,3 h1,1 h3,3 h2,1 h1,2
(a) Check that this agrees with the formula given in the preamble to this section.
(b) Does it extend to other-sized determinants?
1.12 The cross product of the vectors

x1
~x = x2
x3

y1
~y = y2
y3
is the vector computed as this determinant.
~e1 ~e2
~x ~y = det( x1 x2
y1 y2
~e3
x3 )
y3
Note that the first rows entries are vectors, the vectors from the standard basis for
R3 . Show that the cross product of two vectors is perpendicular to each vector.
1.13 Prove that each statement holds for 22 matrices.
(a) The determinant of a product is the product of the determinants det(ST ) =
det(S) det(T ).
(b) If T is invertible then the determinant of the inverse is the inverse of the
determinant det(T 1 ) = ( det(T ) )1 .
Matrices T and T 0 are similar if there is a nonsingular matrix P such that T 0 = PT P1 .
(This definition is in Chapter Five.) Show that similar 22 matrices have the same
determinant.
X 1.14 Prove that the area of this region in the plane

x2
y2

x1
y1
is equal to the value of this determinant.

x1
det(
y1

x2
)
y2
Compare with this.

det(
x2
y2

x1
)
y1
1.15 Prove that for 22 matrices, the determinant of a matrix equals the determinant
of its transpose. Does that also hold for 33 matrices?
X 1.16 Is the determinant function linear is det(x T + y S) = x det(T ) + y det(S)?
1.17 Show that if A is 33 then det(c A) = c3 det(A) for any scalar c.
301
1.18 Which real numbers make

cos sin
sin
cos
singular? Explain geometrically.
? 1.19 [Am. Math. Mon., Apr. 1955] If a third order determinant has elements 1, 2,
. . . , 9, what is the maximum value it may have?
I.2
Properties of Determinants
We want a formula to determine whether an nn matrix is nonsingular. We

will not begin by stating such a formula. Instead, we will begin by considering
the function that such a formula calculates. We will define this function by
its properties, then prove that the function with these properties exist and is
unique, and also describe formulas that compute this function. (Because we will
eventually show that the function exists and is unique, from the start we will
say det(T ) instead of if there is a unique determinant function then det(T ).)
2.1 Definition A nn determinant is a function det : Mnn R such that
(1) det(~1 , . . . , k ~i + ~j , . . . , ~n ) = det(~1 , . . . , ~j , . . . , ~n ) for i 6= j
(2) det(~1 , . . . , ~j , . . . , ~i , . . . , ~n ) = det(~1 , . . . , ~i , . . . , ~j , . . . , ~n ) for i 6= j
(3) det(~1 , . . . , k~i , . . . , ~n ) = k det(~1 , . . . , ~i , . . . , ~n ) for any scalar k
(4) det(I) = 1 where I is an identity matrix
(the ~ s are the rows of the matrix). We often write |T | for det(T ).
2.2 Remark Property (2) is redundant since
i +j j +i i +j i
swaps rows i and j. We have listed it only for convenience.

2.3 Remark In Gausss Method the operation of multiplying a row by a constant k
had a restriction that k 6= 0. Property (3) does not have the restriction because
the next result shows that we do not need it here.
2.4 Lemma A matrix with two identical rows has a determinant of zero. A matrix
with a zero row has a determinant of zero. A matrix is nonsingular if and only
if its determinant is nonzero. The determinant of an echelon form matrix is the
product down its diagonal.
Proof To verify the first sentence, swap the two equal rows. The sign of the
determinant changes but the matrix is the same and so its determinant is the
same. Thus the determinant is zero.
302
The second sentence follows from property (3). Multiply the zero row by
two. That doubles the determinant but it also leaves the row unchanged and
hence leaves the determinant unchanged. Thus the determinant must be zero.
For the third sentence, where T T is the Gauss-Jordan reduction,
by the definition the determinant of T is zero if and only if the determinant of T
is zero (although the two could differ in sign or magnitude). A nonsingular T
Gauss-Jordan reduces to an identity matrix and so has a nonzero determinant.
A singular T reduces to a T with a zero row; by the second sentence of this
lemma its determinant is zero.
The fourth sentence has two cases. If the echelon form matrix is singular
then it has a zero row. Thus it has a zero on its diagonal, so the product down
its diagonal is zero. By the third sentence the determinant is zero and therefore
this matrixs determinant equals the product down its diagonal.
If the echelon form matrix is nonsingular then none of its diagonal entries is
zero so we can use property (3) to get 1s on the diagonal (again, the vertical
bars | | indicate the determinant operation).

t
1,1

0

0
t1,2
t2,2
..

1 t /t
t1,n
1,2 1,1

t2,n
1
0
= t1,1 t2,2 tn,n

0
tn,n
..

t1,n /t1,1

t2,n /t2,2

1
Then the Jordan half of Gauss-Jordan elimination, using property (1) of the
definition, leaves the identity matrix.

1

0
= t1,1 t2,2 tn,n

0
0
1
..

0

0
= t1,1 t2,2 tn,n 1

1
So in this case also, the determinant is the product down the diagonal.
QED
That gives us a way to compute the value of a determinant function on a

matrix: do Gaussian reduction, keeping track of any changes of sign caused by
row swaps and any scalars that we factor out, and finish by multiplying down
the diagonal of the echelon form result. This algorithm is just as fast as Gausss
Method and so practical on all of the matrices that we will see.
2.5 Example Doing 22 determinants with Gausss Method

2

1

4 2
=
3 0

4
= 10
5
doesnt give a big time savings because the 22 determinant formula is easy.
However, a 33 determinant is often easier to calculate with Gausss Method
303
than with the formula given earlier.

2
2
2
6
2 6 2

0 9 = 0
4 3 = 0
4

0
0 3 5 0 3
5
2.6 Example
procedure.

1 0

0 1

0 0

0 1
2
3
0

6

5 = 54

9
Determinants bigger than 33 go quickly with the Gausss Method

1
1
0
0

3 1
4 0
=
5 0

1 0
0
1
0
0

1
1
3

0
1
4

=
0
0
5

0
1 3
0
1
0
0

1
3
1
4
= (5) = 5
1 3

0
5
The prior example illustrates an important point. Although we have not yet
found a 44 determinant formula, if one exists then we know what value it gives
to the matrix if there is a function with properties (1)-(4) then on the above
matrix the function must return 5.
2.7 Lemma For each n, if there is an nn determinant function then it is unique.
Proof Perform Gausss Method on the matrix, keeping track of how the sign
alternates on row swaps, and then get the value by multiplying down the diagonal
of the echelon form result. By the definition and the lemma, all nn determinant
functions must return this value on the matrix.
QED
The if there is an nn determinant function emphasizes that although we
can use Gausss Method to compute the only value that a determinant function
could possibly return, we havent yet shown that such a function exists for all n.
In the rest of the section we will do that.
Exercises
For these, assume that an nn determinant function exists for all n.
X 2.8 Use Gausss Method to find each determinant.

1 0 0 1
3 1 2

2 1 1 0

(a) 3 1 0
(b)

0 1 4
1 0 1 0
1 1 1 0
2.9 Use Gausss Methodto

1
2 1

3
(a)
(b)

1 1
5
find each.

1 0
0 2
2 2
2.10 For which values of k does this system have a unique solution?
x + zw=2
y 2z
=3
x + kz
=4
zw=2
X 2.11 Express each of these in terms of |H|.

h3,1 h3,2 h3,3

(a) h2,1 h2,2 h2,3
h
h
h
1,1
1,2
1,3
304

h1,1
h1,2
h1,3

(b) 2h2,1 2h2,2 2h2,3
3h
3h3,2 3h3,3
3,1

h1,1 + h3,1 h1,2 + h3,2 h1,3 + h3,3

(c) h2,1
h2,2
h2,3

5h

5h
5h
3,1
3,2
3,3
X 2.12 Find the determinant of a diagonal matrix.
2.13 Describe the solution set of a homogeneous linear system if the determinant of
the matrix of coefficients is nonzero.
X 2.14 Show that this determinant
is zero.

y + z x + z x + y

x
y
z

1
1
1
2.15 (a) Find the 11, 22, and 33 matrices with i, j entry given by (1)i+j .
(b) Find the determinant of the square matrix with i, j entry (1)i+j .
2.16 (a) Find the 11, 22, and 33 matrices with i, j entry given by i + j.
(b) Find the determinant of the square matrix with i, j entry i + j.
X 2.17 Show that determinant functions are not linear by giving a case where |A + B| 6=
|A| + |B|.
2.18 The second condition in the definition, that row swaps change the sign of a
determinant, is somewhat annoying. It means we have to keep track of the number
of swaps, to compute how the sign alternates. Can we get rid of it? Can we replace
it with the condition that row swaps leave the determinant unchanged? (If so
then we would need new 11, 22, and 33 formulas, but that would be a minor
matter.)
2.19 Prove that the determinant of any triangular matrix, upper or lower, is the
product down its diagonal.
2.20 Refer to the definition of elementary matrices in the Mechanics of Matrix
Multiplication subsection.
(a) What is the determinant of each kind of elementary matrix?
(b) Prove that if E is any elementary matrix then |ES| = |E||S| for any appropriately
sized S.
(c) (This question doesnt involve determinants.) Prove that if T is singular
then a product T S is also singular.
(d) Show that |T S| = |T ||S|.
(e) Show that if T is nonsingular then |T 1 | = |T |1 .
2.21 Prove that the determinant of a product is the product of the determinants
|T S| = |T | |S| in this way. Fix the n n matrix S and consider the function
d : Mnn R given by T 7 |T S|/|S|.
(a) Check that d satisfies property (1) in the definition of a determinant function.
(b) Check property (2).
(c) Check property (3).
(d) Check property (4).
(e) Conclude the determinant of a product is the product of the determinants.
2.22 A submatrix of a given matrix A is one that we get by deleting some of the
rows and columns of A. Thus, the first matrix here is a submatrix of the second.

3
4
1
3 1
0
9 2
2 5
2 1
5
305
Prove that for any square matrix, the rank of the matrix is r if and only if r is the
largest integer such that there is an rr submatrix with a nonzero determinant.
X 2.23 Prove that a matrix with rational entries has a rational determinant.
? 2.24 [Am. Math. Mon., Feb. 1953] Find the element of likeness in (a) simplifying a
fraction, (b) powdering the nose, (c) building new steps on the church, (d) keeping
emeritus professors on campus, (e) putting B, C, D in the determinant

1
a a 2 a3
3

a
1
a a2

.
B a3 1
a

C D a3 1
I.3
The Permutation Expansion
The prior subsection defines a function to be a determinant if it satisfies four

conditions and shows that there is at most one nn determinant function for
each n. What is left is to show that for each n such a function exists.
But, we easily compute determinants: use Gausss Method, keeping track of
the sign changes from row swaps, and end by multiplying down the diagonal.
So how could such a function not exist?
The difficulty is to show that the computation gives a well-defined that
is, unique result. Consider these two Gausss Method reductions of the same
matrix, the first without any row swap
!
!
1 2 31 +2 1
2
3 4
0 2
and the second with one.
!
1 2 1 2
3 4
3
1
4
2
(1/3)1 +2
3
0
4
2/3
Both yield the determinant 2 since in the second one we note that the row
swap changes the sign of the result we get by multiplying down the diagonal. To
illustrate how a computation that is like the ones that we are doing could fail to
be well-defined, suppose that Definition 2.1 did not include condition (2). That
is, suppose that we instead tried to define determinants so that the value would
not change on a row swap. Then first reduction above would yield 2 while the
second would yield +2. We could still do computations but they wouldnt give
consistent outcomes there is no function that satisfies conditions (1), (3), (4),
and also this altered second condition.
Of course, observing that Definition 2.1 does the right thing with these two
reductions of the above matrix is not enough. That is, the way that we have
given to compute determinant values does not plainly eliminate the possibility
that there might be, say, two reductions of some 77 matrix that lead to different
306
determinant value outputs. In that case we would not have a function, since the
definition of a function is that for each input there must be exactly one output.
In the rest of this section we will show that there is never a conflict.
To do this we will define an alternative way to find the value of a determinant.
(This new way is less useful in practice since it makes the computations awkward
and slow, which is why we didnt start with it. But it is useful for theory and
it makes the proof that we need easier.) The key idea is in property (3) of
Definition 2.1. It shows that the determinant function is not linear.
3.1 Example For this matrix
A=
2
1
1
3
det(2A) 6= 2 det(A). Instead, scalars come out of each of the rows separately.

2 1
2 1
4 2

=2
=4

1 3
2 6
2 6
Since scalars come out a row at a time, we might guess that determinants
are linear a row at a time.
3.2 Definition Let V be a vector space. A map f : V n R is multilinear if
(1) f(~1 , . . . ,~v + w
~ , . . . , ~n ) = f(~1 , . . . ,~v, . . . , ~n ) + f(~1 , . . . , w
~ , . . . , ~n )
(2) f(~1 , . . . , k~v, . . . , ~n ) = k f(~1 , . . . ,~v, . . . , ~n )
for ~v, w
~ V and k R.
3.3 Lemma Determinants are multilinear.
Proof Property (2) here is just condition (3) in Definition 2.1 so we need only
verify property (1).

There are two cases. If the set of other rows {~1 , . . . , ~i1 , ~i+1 , . . . , ~n }
is linearly dependent then all three matrices are singular and so all three
determinants are zero and the equality is trivial.
Therefore assume that the set of other rows is linearly independent. This
set has n 1 members so we can make a basis by adding one more vector
~ ~i+1 , . . . , ~n i. Express ~v and w
h~1 , . . . , ~i1 , ,
~ with respect to this basis
~ + vi+1~i+1 + + vn~n
~v = v1~1 + + vi1~i1 + vi
~ + wi+1~i+1 + + wn~n
w
~ = w1~1 + + wi1~i1 + wi
and add.
~ + + (vn + wn )~n
~v + w
~ = (v1 + w1 )~1 + + (vi + wi )
Consider the left side of property (1) and expand ~v + w
~.
~ + + (vn + wn )~n , . . . , ~n ) (*)
det(~1 , . . . , (v1 + w1 )~1 + + (vi + wi )
307
By the definition of determinants condition (1), the value of () is unchanged

by the operation of adding (v1 + w1 )~1 to the i-th row ~v + w
~ . The i-th row
becomes this.
~ + + (vn + wn )~n
~v + w
~ (v1 + w1 )~1 = (v2 + w2 )~2 + + (vi + wi )
Next add (v2 + w2 )~2 , etc., to eliminate all of the terms from the other rows.
Apply the definition of determinants condition (3).
det(~1 , . . . ,~v + w
~ , . . . , ~n )
~ . . . , ~n )
= det(~1 , . . . , (vi + wi ) ,
~ . . . , ~n )
= (vi + wi ) det(~1 , . . . , ,
~ . . . , ~n ) + wi det(~1 , . . . , ,
~ . . . , ~n )
= vi det(~1 , . . . , ,
Now this is a sum of two determinants. To finish, bring vi and wi back inside
~ and use row combinations again, this time to reconstruct the
in front of the s
expressions of ~v and w
~ in terms of the basis. That is, start with the operations
~
of adding v1~1 to vi and w1~1 to wi~1 , etc., to get the expansions of ~v and w
~.
QED
Multilinearity allows us to expand a determinant into a sum of determinants,

each of which involves a simple matrix.
3.4 Example Use property (1) of multilinearity to break up the first row

2 1 2 0 0 1

=
+

4 3 4 3 4 3
and then break each of those two along the second row.

2 0 2 0 0 1 0 1

=
+

+
+
4 0 0 3 4 0 0 3
We are left with four determinants such that in each row of each of the four
there is a single entry from the original matrix.
3.5 Example In the same way, a 33 determinant separates into a sum of many
simpler determinants. Splitting along the first row produces three determinants
(we have highlighted the zero in the 1, 3 position to set it off visually from the
zeroes that appear as part of the splitting).

2 1 1 2 0 0 0 1 0 0 0 1

0 = 4 3 0 + 4 3 0 + 4 3
0
4 3

2 1
5 2 1 5 2 1 5 2 1
5
Each of these splits in three along the second row. Each of the nine splits in
three along the third row, resulting in twenty seven determinants such that each
row contains a single entry from the starting matrix.

2 0 0 2 0 0 2 0 0 2 0 0
0 0 1

= 4 0 0 + 4 0 0 + 4 0 0 + 0 3 0 + + 0 0
0

2 0 0 0 1 0 0 0 5 2 0 0
0 0
5
308
So with multilinearity, an n n determinant expands into a sum of nn

determinants where each row of each summand contains a single entry from the
starting matrix. However, many of these summand determinants are zero.
3.6 Example In each of these examples from the prior expansion, two of the
entries from the original matrix are in the same column.

2 0 0
0 0 1
0 1 0

0
4 0 0
0 3
0 0 0

0 1 0
0 0
0 0 5
5
For instance in the first matrix, the 2 and the 4 both come from the first column
of the original matrix. Any such matrix is singular because one row is a multiple
of the other. Thus, any such determinant is zero, by Lemma 2.4.
With that observation the above expansion of the 33 determinant into the
sum of the twenty seven determinants simplifies to the sum of these six, the
ones where the entries from the original matrix come not just one per row but
also one per column.

2 1 1 2 0 0 2 0 0

0 = 0 3 0 + 0 0 0
4 3

2 1
5 0 0 5 0 1 0

0 1 0 0 1 0

+ 4 0 0 + 0 0 0

0 0 5 2 0 0

0 0 1 0 0 1

+ 4 0
0 + 0 3
0

0 1
0 2 0
0
We can bring out the scalars.

1 0 0
1 0 0

= (2)(3)(5) 0 1 0 + (2)( 0 )(1) 0 0 1

0 0 1
0 1 0

0 1 0
0 1 0

+ (1)(4)(5) 1 0 0 + (1)( 0 )(2) 0 0 1

0 0 1
1 0 0

0 0 1
0 0

+ (1)(4)(1) 1 0 0 + (1)(3)(2) 0 1

0 1 0
1 0

1

0

0
To finish, we evaluate those six determinants by row-swapping them to the

identity matrix, keeping track of the sign changes.
= 30 (+1) + 0 (1)
+ 20 (1) + 0 (+1)
4 (+1) 6 (1) = 12
309
That example captures the new calculation scheme. Multilinearity gives us

many separate determinants, each with one entry per row from the original
matrix. Most of these have one row that is a multiple of another so we can omit
them. We are left with those determinants that have one entry per row and
column from the original matrix. By factoring out the scalars we can further
reduce the determinants that we must compute to those one-entry-per-row-andcolumn matrices where all the entries are 1s.
Recall Definition Three.IV.3.15, that a permutation matrix is square and
all entries are 0s except for a 1 in each row and column. We now introduce a
notation for permutation matrices.
3.7 Definition An n-permutation is a function on the first n positive integers
: {1, . . . , n} {1, . . . , n} that is one-to-one and onto.
In other words, in a permutation each number 1, . . . , n appears as output
for one and only one input. Alternatively, we may denote a permutation as the
sequence = h(1), (2), . . . , (n)i.
3.8 Example The 2-permutations are the functions 1 : {1, 2 } {1, 2 } given by
1 (1) = 1, 1 (2) = 2, and 2 : {1, 2 } {1, 2 } given by 2 (1) = 2, 2 (2) = 1.
The sequence notation is shorter: 1 = h1, 2i and 2 = h2, 1i.
In the sequence notation the 3-permutations are 1 = h1, 2, 3i, 2 = h1, 3, 2i,
3 = h2, 1, 3i, 4 = h2, 3, 1i, 5 = h3, 1, 2i, and 6 = h3, 2, 1i.
Let j be the row vector that is all 0s except for a 1 in entry j, so that the
four-wide 2 is (0 1 0 0). Then our notation will associate permutations
with permutation matrices in this way: with any = h(1), . . . , (n)i associate
the matrix whose rows are (1) , . . . , (n) . For instance, associated with the 4permutation = h3, 2, 1, 4i we have the matrix whose rows are the corresponding
s.

3
0 0 1 0
0 1 0 0
2
P = =
1 1 0 0 0
4
0 0 0 1
3.9 Example These are the permutation matrices for the 2-permutations listed
in Example 3.8.
!
!
!
!
1
1 0
2
0 1
P1 =
=
P2 =
=
2
0 1
1
1 0
For instance, P2 s first row is 2 (1) = 2 and its second is 2 (2) = 1 .
Consider the 3-permutation 5 = h3, 1, 2i. The permutation matrix P5 has
rows 5 (1) = 3 , 5 (2) = 1 , and 5 (3) = 2 .
0 0 1
P5 = 1 0 0
0 1 0
310
3.10 Definition

t
1,1

t2,1

tn,1
The permutation expansion for determinants is

t1,2 . . . t1,n

t2,2 . . . t2,n
= t1, (1) t2, (2) tn, (n) |P |
..
1
1
1
1

.

+ t1,2 (1) t2,2 (2) tn,2 (n) |P2 |
tn,2 . . . tn,n
..
.
+ t1,k (1) t2,k (2) tn,k (n) |Pk |
where 1 , . . . , k are all of the n-permutations.

This formula is often written in summation notation
X
|T | =
t1,(1) t2,(2) tn,(n) |P |
permutations
read aloud as, the sum, over all permutations , of terms having the form
t1,(1) t2,(2) tn,(n) |P |.
3.11 Example The familiar 22 determinant formula follows from the above.

t
1,1 t1,2

= t1,1 t2,2 |P1 | + t1,2 t2,1 |P2 |
t2,1 t2,2

0 1
1 0

= t1,1 t2,2
+ t1,2 t2,1

1 0
0 1
= t1,1 t2,2 t1,2 t2,1
So does the

t
1,1 t1,2

t2,1 t2,2

t3,1 t3,2
33 determinant formula.

t1,3

t2,3 = t1,1 t2,2 t3,3 |P1 | + t1,1 t2,3 t3,2 |P2 | + t1,2 t2,1 t3,3 |P3 |

t3,3
+ t1,2 t2,3 t3,1 |P4 | + t1,3 t2,1 t3,2 |P5 | + t1,3 t2,2 t3,1 |P6 |
= t1,1 t2,2 t3,3 t1,1 t2,3 t3,2 t1,2 t2,1 t3,3
+ t1,2 t2,3 t3,1 + t1,3 t2,1 t3,2 t1,3 t2,2 t3,1
Computing a determinant by permutation expansion usually takes longer

than Gausss Method. However, while it is not often used in practice, we use it
for the theory, to prove that the determinant function is well-defined.
We will just state the result here and defer its proof to the following subsection.
3.12 Theorem For each n there is an nn determinant function.
Also in the next subsection is the proof of this result (these two proofs share
some features).
311
3.13 Theorem The determinant of a matrix equals the determinant of its transpose.
Because of this theorem, while we have so far stated determinant results in
terms of rows (e.g., determinants are multilinear in their rows, row swaps change
the sign, etc.), all of the results also hold in terms of columns.
3.14 Corollary A matrix with two equal columns is singular. Column swaps
change the sign of a determinant. Determinants are multilinear in their columns.
Proof For the first statement, transposing the matrix results in a matrix with
the same determinant, and with two equal rows, and hence a determinant of
zero. Prove the other two in the same way.
QED
We finish this subsection with a summary: determinant functions exist, are
unique, and we know how to compute them. As for what determinants are
about, perhaps these lines [Kemp] help make it memorable.
Determinant none,
Solution: lots or none.
Determinant some,
Solution: just one.
Exercises
This summarizes the notation
i
1
1 (i) 1
2 (i) 2
that we use for the 22

i
1
2
1 (i) 1
1
2 (i) 1
3 (i) 2
4 (i) 2
5 (i) 3
6 (i) 3
and 3- permutations.
2 3
2 3
3 2
1 3
3 1
1 2
2 1
X 3.15 Compute
the
by using
the permutation expansion.

determinant

1 2 3
2

2
1

(a) 4 5 6
(b) 3 1 0
7 8 9
2
0 5
X 3.16 Compute these both with Gausss Method and the permutation expansion
formula.

0 1 4
2 1

(a)
(b) 0 2 3

3 1
1 5 1
X 3.17 Use the permutation expansion formula to derive the formula for 33 determinants.
3.18 List all of the 4-permutations.
3.19 A permutation, regarded as a function from the set { 1, .., n } to itself, is one-toone and onto. Therefore, each permutation has an inverse.
(a) Find the inverse of each 2-permutation.
(b) Find the inverse of each 3-permutation.
312
3.20 Prove that f is multilinear if and only if for all ~v, w

~ V and k1 , k2 R, this
holds.
f(~1 , . . . , k1~v1 + k2~v2 , . . . , ~n ) = k1 f(~1 , . . . ,~v1 , . . . , ~n ) + k2 f(~1 , . . . ,~v2 , . . . , ~n )
X
X
3.21 How would determinants change if we changed property (4) of the definition to
read that |I| = 2?
3.22 Verify the second and third statements in Corollary 3.14.
3.23 Show that if an nn matrix has a nonzero determinant then we can express
any column vector ~v Rn as a linear combination of the columns of the matrix.
3.24 [Strang 80] True or false: a matrix whose entries are only zeros or ones has a
determinant equal to zero, one, or negative one.
3.25 (a) Show that there are 120 terms in the permutation expansion formula of a
55 matrix.
(b) How many are sure to be zero if the 1, 2 entry is zero?
3.26 How many n-permutations are there?
3.27 Show that the inverse of a permutation matrix is its transpose.
3.28 A matrix A is skew-symmetric if Atrans = A, as in this matrix.

0 3
A=
3 0
Show that nn skew-symmetric matrices with nonzero determinants exist only for
even n.
3.29 What is the smallest number of zeros, and the placement of those zeros, needed
to ensure that a 44 matrix has a determinant of zero?
3.30 If we have n data points (x1 , y1 ), (x2 , y2 ), . . . , (xn , yn ) and want to find a
polynomial p(x) = an1 xn1 + an2 xn2 + + a1 x + a0 passing through those
points then we can plug in the points to get an n equation/n unknown linear
system. The matrix of coefficients for that system is the Vandermonde matrix.
Prove that the determinant of the transpose of that matrix of coefficients

1
1
...
1

x
x2
...
xn
1
x 2
2
x2
...
xn 2
1

..

.

x1 n1 x2 n1 . . . xn n1
equals the product, over all indices i, j { 1, . . . , n } with i < j, of terms of the form
xj xi . (This shows that the determinant is zero, and the linear system has no
solution, if and only if the xi s in the data are not distinct.)
3.31 We can divide a matrix into blocks, as here,
1 2
0
3 4
0
0 0 2
which shows four blocks, the square 22 and 11 ones in the upper left and lower
right, and the zero blocks in the upper right and lower left. Show that if a matrix
is such that we can partition it as

J
Z2
T=
Z1 K
where J and K are square, and Z1 and Z2 are all zeroes, then |T | = |J| |K|.
3.32 Prove that for any nn matrix T there are at most n distinct reals r such that
the matrix T rI has determinant zero (we shall use this result in Chapter Five).
313
? 3.33 [Math. Mag., Jan. 1963, Q307] The nine positive digits can be arranged into
33 arrays in 9! ways. Find the sum of the determinants of these arrays.
3.34 [Math. Mag., Jan. 1963, Q237]

x 2

x + 1

x 4
Show that
x3
x1
x7

x 4
x 3 = 0.
x 10
? 3.35 [Am. Math. Mon., Jan. 1949] Let S be the sum of the integer elements of a
magic square of order three and let D be the value of the square considered as a
determinant. Show that D/S is an integer.
? 3.36 [Am. Math. Mon., Jun. 1931] Show that the determinant of the n2 elements in
the upper left corner of the Pascal triangle
1
1
1
1
.
.
1
2
3
.
1
3
.
.
1
.
.
.
.
has the value unity.
I.4
Determinants Exist
This subsection is optional. It proves two results from the prior subsection.
These proofs involve the properties of permutations, which will use again
only in the optional Jordan Canonical Form subsection.
The prior subsection develops the permutation expansion formula for determinants.

t

1,1 t1,2 . . . t1,n

t2,1 t2,2 . . . t2,n

= t1, (1) t2, (2) tn, (n) |P |
..
1
1
1
1

.

+ t1,2 (1) t2,2 (2) tn,2 (n) |P2 |
tn,1 tn,2 . . . tn,n
..
.
+ t1,k (1) t2,k (2) tn,k (n) |Pk |

X
t1,(1) t2,(2) tn,(n) |P |
permutations
This reduces the problem of showing that for any size n the determinant function
on all nn matrices is well-defined to only showing that the determinant is
well-defined on the set of permutation matrices of that size.
A permutation matrix can be row-swapped to the identity matrix and so we
can calculate its determinant by keeping track of the number of swaps. However,
we still must show that the result is well-defined. Recall what the difficulty
314
is: the determinant of
0
1
P =
0
0
1
0
0
0
0
0
0
1
0
0
1
0
could be computed with one swap
1 2 0
P
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
2 3

0
1
0
1
0
0
1
0
0
0
0
0
1 3

0
1
or with three.
3 1 1
P
0
0
0
0
1
0
1
0
0
0
0
0
1
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
Both reductions have an odd number of swaps so we figure that |P | = 1 but

if there were some way to do it with an even number of swaps then we would
have two different answers to one question. Below, Corollary 4.4 proves that
this cannot happen there is no permutation matrix that can be row-swapped
to an identity matrix in two ways, one with an even number of swaps and the
other with an odd number of swaps.
So the critical step will be a way to calculate whether the number of swaps
that it takes could be even or odd.
4.1 Definition In a permutation = h. . . , k, . . . , j, . . .i elements such that k > j
are in an inversion of their natural order. Similarly, in a permutation matrix
two rows

..
.

k
.
P =
..

j

..
.
such that k > j are in an inversion.
4.2 Example This permutation matrix

3
0

2 = 0
1
1
0
1
0
0
0
has three inversions: 3 precedes 1 , 3 precedes 2 , and 2 precedes 1 .
315
4.3 Lemma A row-swap in a permutation matrix changes the number of inversions

from even to odd, or from odd to even.
Proof Consider a swap of rows j and k, where k > j. If the two rows are
adjacent
..
.
k j
P = (j)
(k)
..
.
..
.
(k)
(j)
..
.
then since inversions involving rows not in this pair are not affected, the swap
changes the total number of inversions by one, either removing or producing one
inversion depending on whether (j) > (k) or not. Consequently, the total
number of inversions changes from odd to even or from even to odd.
If the rows are not adjacent then we can swap them via a sequence of adjacent
swaps, first bringing row k up
.
.
..
.
.
(j)
(k)
(j+1)
(j)
k k1 k1 k2
j+1 j
(j+2)
(j+1)
..
..
.
.
(k)
(k1)
..
..
.
.
and then bringing row j down.
j+1 j+2 j+2 j+3
k1 k
..
.
(k)
(j+1)
(j+2)
..
.
(j)
..
.
Each of these adjacent swaps changes the number of inversions from odd to even
or from even to odd. There are an odd number (k j) + (k j 1) of them.
The total change in the number of inversions is from even to odd or from odd to
even.
QED
4.4 Corollary If a permutation matrix has an odd number of inversions then
swapping it to the identity takes an odd number of swaps. If it has an even
number of inversions then swapping to the identity takes an even number of
swaps.
316
Proof The identity matrix has zero inversions. To change an odd number to
zero requires an odd number of swaps, and to change an even number to zero
requires an even number of swaps.
QED
4.5 Definition The signum of a permutation sgn() is 1 if the number of
inversions in is odd and is +1 if the number of inversions is even.
4.6 Example In the notation
P1 = 0
0
for the 3-permutations from Example 3.8 we have
0 0
1 0 0
1 0 and P2 = 0 0 1
0 1
0 1 0
so sgn(1 ) = 1 because there are no inversions, while sgn(2 ) = 1 because

there is one.
We still have not shown that the determinant function is well-defined because
we have not considered row operations on permutation matrices other than row
swaps. We will finesse this issue. We will define a function d : Mnn R by
altering the permutation expansion formula, replacing |P | with sgn().
X
d(T ) =
t1,(1) t2,(2) tn,(n) sgn()
permutations
This gives the same value as the permutation expansion because the corollary
shows that det(P ) = sgn(). The advantage of this formula is that the number
of inversions is clearly well-defined just count them. Therefore, we will finish
showing that an nn determinant function exists by showing that this d satisfies
the conditions in the determinants definition.
4.7 Lemma The function d above is a determinant. Hence determinants exist
for every n.
Proof We must check that it has the four properties from the definition.
Property (4) is easy; where I is the nn identity, in

X
d(I) =
1,(1) 2,(2) n,(n) sgn()
perm
all of the terms in the summation are zero except for the product down the
diagonal, which is one.
ki
For property (3) consider d(T ) where T T .
X
t1,(1) ti,(i) tn,(n) sgn()
perm
t1,(1) kti,(i) tn,(n) sgn()
317
Factor out the k to get the desired equality.

X
=k
t1,(1) ti,(i) tn,(n) sgn() = k d(T )
i j
For (2) suppose that T T . We must show this is the negative of d(T ).
X
t1,(1) ti,(i) tj,(j) tn,(n) sgn()
d(T ) =
(*)
perm
We will show that each term in () is associated with a term in d(t), and that the
two terms are negatives of each other. Consider the matrix from the multilinear
expansion of d(T ) giving the term t1,(1) ti,(i) tj,(j) tn,(n) sgn().
t
i,(i)
..
.
..
.
tj,(j)
..
.
It is the result of the i j operation performed on this matrix.
..
.
ti,(j)
..
tj,(i)
..
.
That is, the term with hatted ts is associated with this term from the d(T )
expansion: t1,(1) tj,(j) ti,(i) tn,(n) sgn(), where the permutation
equals but with the i-th and j-th numbers interchanged, (i) = (j) and
(j) = (i). The two terms have the same multiplicands t1,(1) = t1,(1) ,
. . . , including the entries from the swapped rows ti,(i) = tj,(i) = tj,(j) and
tj,(j) = ti,(j) = ti,(i) . But the two terms are negatives of each other since
sgn() = sgn() by Lemma 4.3.
Now, any permutation can be derived from some other permutation by
such a swap, in one and only one way. Therefore the summation in () is in fact
a sum over all permutations, taken once and only once.
X
t1,(1) ti,(i) tj,(j) tn,(n) sgn()
d(T ) =
perm
t1,(1) tj,(j) ti,(i) tn,(n) sgn()
perm
Thus d(T ) = d(T ).
318
ki +j
For property (1) suppose that T T and consider the effect of a row
combination.
X
t1,(1) ti,(i) tj,(j) tn,(n) sgn()
d(T ) =
perm
t1,(1) ti,(i) (kti,(j) + tj,(j) ) tn,(n) sgn()
Do the algebra.
X
=
t1,(1) ti,(i) kti,(j) tn,(n) sgn()
+ t1,(1) ti,(i) tj,(j) tn,(n) sgn()
t1,(1) ti,(i) kti,(j) tn,(n) sgn()

X
+
t1,(1) ti,(i) tj,(j) tn,(n) sgn()
X
= k
t1,(1) ti,(i) ti,(j) tn,(n) sgn()
=
+ d(T )
Finish by observing that the terms t1,(1) ti,(i) ti,(j) tn,(n) sgn()
add to zero: this sum represents d(S) where S is a matrix equal to T except
that row j of S is a copy of row i of T (because the factor is ti,(j) , not tj,(j) )
and so S has two equal rows, rows i and j. Since we have already shown that d
changes sign on row swaps, as in Lemma 2.4 we conclude that d(S) = 0. QED
We have now shown that determinant functions exist for each size. We
already know that for each size there is at most one determinant. Therefore, the
permutation expansion computes the one and only determinant.
We end this subsection by proving the other result remaining from the prior
subsection.
4.8 Theorem The determinant of a matrix equals the determinant of its transpose.
Proof Call the matrix T and denote the entries of T trans with ss so that
ti,j = sj,i . Substitution gives this

X
X
|T | =
t1,(1) tn,(n) sgn() =
s(1),1 s(n),n sgn()
perms
and we will finish the argument by manipulating the expression on the right
to be recognizable as the determinant of the transpose. We have written all
permutation expansions with the row indices ascending. To rewrite the expression
on the right in this way, note that because is a permutation the row indices
(1), . . . , (n) are just the numbers 1, . . . , n, rearranged. Apply commutativity
to have these ascend, giving s1,1 (1) sn,1 (n) .
=
X
1
s1,1 (1) sn,1 (n) sgn(1 )
319
Exercise 14 shows that sgn(1 ) = sgn(). Since every permutation is the

inverse of another, a sum over all inverses 1 is a sum over all permutations
X

=
s1,( 1) . . . sn,(n) sgn() = T trans
perms
as required.
QED
Exercises
These summarize the notation
i
1
1 (i) 1
2 (i) 2
X
X
used in this book for the 2- and 3- permutations.

2
1 2 3
i
2
1 (i) 1 2 3
2 (i) 1 3 2
1
3 (i) 2 1 3
4 (i) 2 3 1
5 (i) 3 1 2
6 (i) 3 2 1
4.9 Give the permutation expansion of a general 22 matrix and its transpose.
4.10 This problem appears also in the prior subsection.
(a) Find the inverse of each 2-permutation.
(b) Find the inverse of each 3-permutation.
4.11 (a) Find the signum of each 2-permutation.
(b) Find the signum of each 3-permutation.
4.12 Find the only nonzero term in the permutation expansion of this matrix.

0 1 0 0

1 0 1 0

0 1 0 1

0 0 1 0
Compute that determinant by finding the signum of the associated permutation.
4.13 [Strang 80] What is the signum of the n-permutation = hn, n 1, . . . , 2, 1i?
4.14 Prove these.
(a) Every permutation has an inverse.
(b) sgn(1 ) = sgn()
(c) Every permutation is the inverse of another.
4.15 Prove that the matrix of the permutation inverse is the transpose of the matrix
of the permutation P1 = P trans , for any permutation .
4.16 Show that a permutation matrix with m inversions can be row swapped to the
identity in m steps. Contrast this with Corollary 4.4.
4.17 For any permutation let g() be the integer defined in this way.
Y
g() =
[(j) (i)]
i<j
(This is the product, over all indices i and j with i < j, of terms of the given
form.)
(a) Compute the value of g on all 2-permutations.
(b) Compute the value of g on all 3-permutations.
(c) Prove that g() is not 0.
(d) Prove this.
g()
sgn() =
|g()|
Many authors give this formula as the definition of the signum function.
320
II
Geometry of Determinants
The prior section develops the determinant algebraically, by considering formulas

satisfying certain properties. This section complements that with a geometric
approach. One advantage of this approach is that while we have so far only
considered whether or not a determinant is zero, here we shall give a meaning to
the value of the determinant. (The prior section treats determinants as functions
of the rows but in this section we focus on columns.)
II.1
Determinants as Size Functions
This parallelogram picture is familiar from the construction of the sum of the
two vectors.

x2
y2

x1
y1
1.1 Definition In Rn the

box (or parallelepiped) formed by h~v1 , . . . ,~vn i is the
set { t1~v1 + + tn~vn t1 , . . . , tn [0..1] }.

Thus, the parallelogram shown above is the box defined by h yx11 , yx22 i.
We are interested in the area of the box. One way to compute it is to draw
this rectangle and subtract the area of each subregion.
y2
y1 C
F
E
x2
x1
area of parallelogram
= area of rectangle area of A area of B
area of F
= (x1 + x2 )(y1 + y2 ) x2 y1 x1 y1 /2
x2 y2 /2 x2 y2 /2 x1 y1 /2 x2 y1
= x1 y2 x2 y1
The fact that the area equals the value of the determinant

x

1 x2

= x1 y2 x2 y1
y1 y2
is no coincidence. The properties from the definition of determinants make
good postulates for a function that measures the size of the box defined by the
matrixs columns.
For instance, a function that measures the size of the box should have the
property that multiplying one of the box-defining vectors by a scalar (here
k = 1.4) will multiply the size by that scalar.
Section II. Geometry of Determinants
w
~
321
w
~
~
v
k~
v
(On the right the rescaled region is in solid lines with the original region in
shade for comparison.) That is, we can reasonably expect of a size measure that
size(. . . , k~v, . . . ) = k size(. . . ,~v, . . . ). Of course, this property is familiar from
the definition of determinants.
Another property of determinants that should apply to any function giving
the size of a box is that it is unaffected by combining rows. Here are beforecombining and after-combining boxes (the scalar shown is k = 0.35). The box
formed by v and k~v + w
~ is more slanted than the original one but the two have
the same base and the same height and hence the same area.
k~
v+w
~
w
~
~
v
~
v
(As before, the figure on the right has the original region in shade for comparison.)
So we expect that size(. . . ,~v, . . . , w
~ , . . . ) = size(. . . ,~v, . . . , k~v + w
~ , . . . ); again, a
restatement of a determinant postulate.
Lastly, we expect that size(~e1 , ~e2 ) = 1
~
e2
~
e1
and we naturally extend that to any number of dimensions size(~e1 , . . . , ~en ) = 1.

Because property (2) of determinants is redundant (as remarked following
the definition) we have that the properties of the determinant function are
reasonable to expect of a function that gives the size of boxes. The prior section
starts with these properties and shows that the determinant exists and is unique,
so we know that these postulates are consistent and that we do not need any
more postulates. Thus, we will interpret det(~v1 , . . . ,~vn ) as the size of the box
formed by the vectors.
1.2 Remark Although property (2) of the definition of determinants is redundant
it raises an important point. Consider these two.
~v
~v
~u

4

2

1
= 10
3
~u

1

3

4
= 10
2
Swapping changes the sign. On the left we take ~u first in the matrix and then
follow the counterclockwise arc to ~v, following the counterclockwise arc, and get
a positive size. On the right following the clockwise arc gives a negative size.
322
The sign returned by the size function reflects the orientation or sense of the
box. (We see the same thing if we picture the effect of scalar multiplication by a
negative scalar.)
Although it is both interesting and important, we dont need the idea of
orientation for the development below and so we will pass it by. (See Exercise 27.)
1.3 Definition The volume of a box is the absolute value of the determinant of a
matrix with those vectors as columns.
1.4 Example By the formula that takes the area of the base times the height, the
volume of this parallelepiped is 12. That agrees with the determinant.
1
0
1

2
0
2

0
3
1

2

0

2
0
3
1

1

0 = 12

1
We can also compute the volume as the absolute value of this determinant.

0 2 0

3 0 3 = 12

1 2 1
The next result describes some of the geometry of the linear functions that
act on Rn .
1.5 Theorem A transformation t : Rn Rn changes the size of all boxes by the
same factor, namely the size of the image of a box |t(S)| is |T | times the size of
the box |S|, where T is the matrix representing t with respect to the standard
basis.
That is, for all nn matrices, the determinant of a product is the product
of the determinants |T S| = |T | |S|.
The two sentences say the same thing, first in map terms and then in matrix
terms. This is because |t(S)| = |T S|, as both give the size of the box that is
the image of the unit box En under the composition t s (where s is the map
represented by S with respect to the standard basis).
Proof First consider the |T | = 0 case. A matrix has a zero determinant if and
only if it is not invertible. Observe that if T S is invertible then there is an M

such that (T S)M = I, so T (SM) = I, which shows that T is invertible, with
inverse SM. By contrapositive, if T is not invertible then neither is T S if
|T | = 0 then |T S| = 0.
Now consider the case that |T | 6= 0, that T is nonsingular. Recall that any
nonsingular matrix factors into a product of elementary matrices T = E1 E2 Er .
323
To finish this argument we will verify that |ES| = |E| |S| for all matrices S and
elementary matrices E. The result will then follow because |T S| = |E1 Er S| =
|E1 | |Er | |S| = |E1 Er | |S| = |T | |S|.
There are three kinds of elementary matrix. We will cover the Mi (k) case;
the Pi,j and Ci,j (k) checks are similar. We have that Mi (k)S equals S except
that row i is multiplied by k. The third property of determinant functions
then gives that |Mi (k)S| = k |S|. But |Mi (k)| = k, again by the third property
because Mi (k) is derived from the identity by multiplication of row i by k. Thus
|ES| = |E| |S| holds for E = Mi (k).
QED
1.6 Example Application of the map t represented with respect to the standard
bases by
!
1 1
2 0
will double sizes of boxes, e.g., from this
~
v
w
~

2

1

1
=3
2
to this
t(~
v)
t(w)
~

3

4

3
=6
2
1.7 Corollary If a matrix is invertible then the determinant of its inverse is the
inverse of its determinant |T 1 | = 1/|T |.
Proof 1 = |I| = |T T 1 | = |T | |T 1 |
QED
Recall that determinants are not additive homomorphisms, that det(A + B)

need not equal det(A) + det(B). In contrast, the above theorem says that
determinants are multiplicative homomorphisms: det(AB) equals det(A) det(B).
Exercises
1.8 Find
the
volume
of the region defined by the vectors.
1
1
(a) h
,
i
3
4

2
3
8
(b) h1 , 2 , 3i
0
4
8

1
2
1
0
2 2 3 1

(c) h
0 , 2 , 0 , 0i
1
2
5
7
324
X 1.9 Is

4
1
2
inside of the box formed by these three?

3
2
3 6
1
1

1
0
5
X 1.10 Find the volume of this region.
X 1.11 Suppose that |A| = 3. By what factor do these change volumes?

(a) A
(b) A2
(c) A2
X 1.12 By what factor does each transformation change the size of boxes?

x
xy
x
2x
x
3x y
(a)
7
(b)
7
(c) y 7 x + y + z
y
3y
y
2x + y
z
y 2z
1.13 What is the area of the image of the rectangle [2..4] [2..5] under the action of
this matrix?

2
3
4 1
1.14 If t : R3 R3 changes volumes by a factor of 7 and s : R3 R3 changes volumes
by a factor of 3/2 then by what factor will their composition changes volumes?
1.15 In what way does the definition of a box differ from the definition of a span?
X 1.16 Why doesnt this picture contradict Theorem 1.5?

2 1
0 1
area is 2
determinant is 2
X 1.17 Does |T S| = |ST |? |T (SP)| = |(T S)P|?
area is 5
1.18 (a) Suppose that |A| = 3 and that |B| = 2. Find |A2 Btrans B2 Atrans |.
(b) Assume that |A| = 0. Prove that |6A3 + 5A2 + 2A| = 0.
X 1.19 Let T be the matrix representing (with respect to the standard bases) the map
that rotates plane vectors counterclockwise thru radians. By what factor does T
change sizes?
X 1.20 Must a transformation t : R2 R2 that preserves areas also preserve lengths?
X 1.21 What is the volume of a parallelepiped in R3 bounded by a linearly dependent
set?
X 1.22 Find the area of the triangle in R3 with endpoints (1, 2, 1), (3, 1, 4), and
(2, 2, 2). (Area, not volume. The triangle defines a plane what is the area of the
triangle in that plane?)
X 1.23 An alternate proof of Theorem 1.5 uses the definition of determinant functions.
(a) Note that the vectors forming S make a linearly dependent set if and only if
|S| = 0, and check that the result holds in this case.
(b) For the |S| 6= 0 case, to show that |T S|/|S| = |T | for all transformations, consider
the function d : Mnn R given by T 7 |T S|/|S|. Show that d has the first
property of a determinant.
325
(c) Show that d has the remaining three properties of a determinant function.
(d) Conclude that |T S| = |T | |S|.
1.24 Give a non-identity matrix with the property that Atrans = A1 . Show that if
Atrans = A1 then |A| = 1. Does the converse hold?
1.25 The algebraic property of determinants that factoring a scalar out of a single
row will multiply the determinant by that scalar shows that where H is 33, the
determinant of cH is c3 times the determinant of H. Explain this geometrically,
that is, using Theorem 1.5. (The observation that increasing the linear size of a
three-dimensional object by a factor of c will increase its volume by a factor of c3
while only increasing its surface area by an amount proportional to a factor of c2
is the Square-cube law [Wikipedia Square-cube Law].)
X 1.26 We say that matrices H and G are similar if there is a nonsingular matrix P
such that H = P1 GP (we will study this relation in Chapter Five). Show that
similar matrices have the same determinant.
1.27 We usually represent vectors in R2 with respect to the standard basis so vectors
in the first quadrant have both coordinates positive.

~
v
+3
RepE2 (~v) =
+2
Moving counterclockwise around
the
origin,
we cycle
thru four regions:

+
+
Using this basis

0
1
B=h
,
i
1
0
gives the same counterclockwise cycle. We say these two bases have the same
orientation.
(a) Why do they give the same cycle?
(b) What other configurations of unit vectors on the axes give the same cycle?
(c) Find the determinants of the matrices formed from those (ordered) bases.
(d) What other counterclockwise cycles are possible, and what are the associated
determinants?
(e) What happens in R1 ?
(f) What happens in R3 ?
A fascinating general-audience discussion of orientations is in [Gardner].
1.28 This question uses material from the optional Determinant Functions Exist
subsection. Prove Theorem 1.5 by using the permutation expansion formula for
the determinant.
X 1.29 (a) Show that this gives the equation of a line in R2 thru (x2 , y2 ) and (x3 , y3 ).

x x2 x3

y y2 y3 = 0

1 1
1
(b) [Petersen] Prove that the area of a triangle with vertices (x1 , y1 ), (x2 , y2 ), and
(x3 , y3 ) is

x
x2 x3
1 1
y1 y2 y3 .
2
1
1
1
(c) [Math. Mag., Jan. 1973] Prove that the area of a triangle with vertices at
(x1 , y1 ), (x2 , y2 ), and (x3 , y3 ) whose coordinates are integers has an area of N or
N/2 for some positive integer N.
326
III
Laplaces Expansion
Determinants are a font of interesting and amusing formulas. Here is one that is
often used to compute determinants by hand.
III.1
Laplaces Expansion Formula
1.1 Example In this permutation expansion

t

1 0
1,1 t1,2 t1,3

t2,1 t2,2 t2,3 = t1,1 t2,2 t3,3 0 1

t3,1 t3,2 t3,3
0 0

0

+ t1,2 t2,1 t3,3 1

0

0

+ t1,3 t2,1 t3,2 1

0

1 0
0

0 + t1,1 t2,3 t3,2 0 0

0 1
1

0
1 0

0 0 + t1,2 t2,3 t3,1 0

1
0 1

0
0 1

0 0 + t1,3 t2,2 t3,1 0

1
1 0

0

1

0
1
0
0
0
1
0
we can factor out the entries from the first row t1,1 , t1,2 , t1,3

1 0 0
1 0 0

= t1,1 t2,2 t3,3 0 1 0 + t2,3 t3,2 0 0 1

0 0 1
0 1 0

0 1 0
0 1 0

+ t1,2 t2,1 t3,3 1 0 0 + t2,3 t3,1 0 0 1

1 0 0
0 0 1

0 0 1
0 0 1

+ t1,3 t2,1 t3,2 1 0 0 + t2,2 t3,1 0 1 0

0 1 0
1 0 0
and in the permutation matrices swap to get the first rows into place.

1 0 0
1 0 0

= t1,1 t2,2 t3,3 0 1 0 + t2,3 t3,2 0 0 1

0 0 1
0 1 0

1 0 0
1 0 0

t1,2 t2,1 t3,3 0 1 0 + t2,3 t3,1 0 0 1

0 0 1
0 1 0

1 0 0
1 0 0

+ t1,3 t2,1 t3,2 0 1 0 + t2,2 t3,1 0 0 1

0 1 0
0 0 1

0

1

0

1

0

0
Section III. Laplaces Expansion
327
The point of the swapping (one swap to each of the permutation matrices on
the second line and two swaps to each on the third line) is that the three lines
simplify to three terms.

t

t

t

2,2 t2,3
2,1 t2,3
2,1 t2,2
= t1,1
t1,2
+ t1,3

t3,2 t3,3
t3,1 t3,3
t3,1 t3,2
The formula given in Theorem 1.5, which generalizes this example, is a recurrence the determinant is expressed as a combination of determinants. This
formula isnt circular because, as here, the determinant is expressed in terms of
determinants of matrices of smaller size.
1.2 Definition For any nn matrix T , the (n 1)(n 1) matrix formed by
deleting row i and column j of T is the i, j minor of T . The i, j cofactor Ti,j of
T is (1)i+j times the determinant of the i, j minor of T .
1.3 Example The 1, 2 cofactor of the matrix from Example 1.1 is the negative of
the second 22 determinant.

t

2,1 t2,3
T1,2 = 1

t3,1 t3,3
1.4 Example Where
T = 4
7
these are the 1, 2 and 2, 2 cofactors.

4 6

T1,2 = (1)1+2
=6
7 9
2
5
8
T2,2
6
9

1

= (1)2+2
7

3
= 12
9
1.5 Theorem (Laplace Expansion of Determinants) Where T is an nn matrix, we

can find the determinant by expanding by cofactors on any row i or column j.
|T | = ti,1 Ti,1 + ti,2 Ti,2 + + ti,n Ti,n
= t1,j T1,j + t2,j T2,j + + tn,j Tn,j
Proof Exercise 27.
QED
1.6 Example We can compute the determinant

1 2 3

|T | = 4 5 6

7 8 9
by expanding along the first row, as in Example 1.1.

5 6
4 6
4 5

|T | = 1 (+1)
+ 2 (1)
+ 3 (+1)
= 3 + 12 9 = 0
8 9
7 9
7 8
328
Alternatively, we can expand down the second column.

1 3
1 3
4 6

|T | = 2 (1)
= 12 60 + 48 = 0
+ 8 (1)
+ 5 (+1)
4 6
7 9
7 9
1.7 Example A row or column with many zeroes suggests a Laplace expansion.

1
5 0
1 5
1
2

5
1

1 1 = 0 (+1)
= 16
+ 0 (+1)
+ 1 (1)
2
2 1
3 1
3 1

3 1 0
We finish by applying this result to derive a new formula for the inverse
of a matrix. With Theorem 1.5, we can calculate the determinant of an nn
matrix T by taking linear combinations of entries from a row and their associated
cofactors.
ti,1 Ti,1 + ti,2 Ti,2 + + ti,n Ti,n = |T |
()
Recall that a matrix with two identical rows has a zero determinant. Thus, for
any matrix T , weighing the cofactors by entries from row k with k 6= i gives zero
ti,1 Tk,1 + ti,2 Tk,2 + + ti,n Tk,n = 0
()
because it represents the expansion along the row k of a matrix with row i equal
to row k. This summarizes () and ().
t1,1 t1,2 . . . t1,n

T1,1 T2,1 . . . Tn,1
|T | 0 . . . 0
t2,1 t2,2 . . . t2,n T1,2 T2,2 . . . Tn,2 0 |T | . . . 0
..
..
..
.
.
.
tn,1 tn,2 . . . tn,n

T1,n T2,n . . . Tn,n
0
0 . . . |T |
Note that the order of the subscripts in the matrix of cofactors is opposite to
the order of subscripts in the other matrix; e.g., along the first row of the matrix
of cofactors the subscripts are 1, 1 then 2, 1, etc.
1.8 Definition The matrix adjoint to the square matrix T is
T1,1 T2,1 . . . Tn,1
T1,2 T2,2 . . . Tn,2
adj(T ) =
..
T1,n T2,n . . . Tn,n

where Tj,i is the j, i cofactor.
1.9 Theorem Where T is a square matrix, T adj(T ) = adj(T ) T = |T | I.
Proof Equations () and ().
QED
Section III. Laplaces Expansion
329
1.10 Example If
1
1
1 0
T = 2 1
1 0
then adj(T ) is
T1,1
T1,2
T1,3
T2,1
T2,2
T2,3

0

1 1

0

0
1

T3,1

2 1 1
T3,2 =

1
1 1

T3,3

1

2 1

1
1 0

4
4 0

1 1 1

1
1
4
4

=
3

2 1
1
1

1 0
0

2 1
0
0
3
0
9
1
and taking the product with T gives the diagonal matrix |T | I.
1 0
4
1
0 4
3
0
0
9 = 0 3
0
2 1 1 3 3
1 0
1
1
0
1
0
0 3
1.11 Corollary If |T | 6= 0 then T 1 = (1/|T |) adj(T ).
1.12 Example The inverse of the matrix from Example 1.10 is (1/ 3) adj(T ).
1/3
0/3 4/3
1/3 0
4/3
T 1 = 3/3 3/3
9/3 =
1 1
3
1/3
0/3
1/3
1/3 0 1/3
The formulas from this section are often used for by-hand calculation and
are sometimes useful with special types of matrices. However, they are not the
best choice for computation with arbitrary matrices because they require more
arithmetic than, for instance, the Gauss-Jordan method.
Exercises
X 1.13 Find the cofactor.
1
T = 1
0
(a) T2,3
(b) T3,2
2
3
1
(c) T1,3
X 1.14 Find the determinant by expanding

3 0

1 2

1 3
(a) on the first row
0
1
2

1
2
0
(b) on the second row
1.15 Find the adjoint of the matrix in Example 1.6.

X 1.16 Find the matrix adjoint to each.
(c) on the third column.
330
2
(a) 1
1
X 1.17 Find the

1 4
1 4 3
3
1
1
1
(b)
(c)
(d) 1 0 3
0 2
2
4
5 0
0 1
1 8 9
inverse of each matrix in the prior question with Theorem 1.9.
1.18 Find the matrix adjoint to this one.
2 1
1 2
0 1
0 0
0
1
2
1
0
0
1
2
X 1.19 Expand across the first row to derive the formula for the determinant of a 22
matrix.
X 1.20 Expand across the first row to derive the formula for the determinant of a 33
matrix.
X 1.21 (a) Give a formula for the adjoint of a 22 matrix.
(b) Use it to derive the formula for the inverse.
X 1.22 Can we compute a determinant by expanding down the diagonal?
1.23 Give a formula for the adjoint of a diagonal matrix.
X 1.24 Prove that the transpose of the adjoint is the adjoint of the transpose.
1.25 Prove or disprove: adj(adj(T )) = T .
1.26 A square matrix is upper triangular if each i, j entry is zero in the part above
the diagonal, that is, when i > j.
(a) Must the adjoint of an upper triangular matrix be upper triangular? Lower
triangular?
(b) Prove that the inverse of a upper triangular matrix is upper triangular, if an
inverse exists.
1.27 This question requires material from the optional Determinants Exist subsection. Prove Theorem 1.5 by using the permutation expansion.
1.28 Prove that the determinant of a matrix equals the determinant of its transpose
using Laplaces expansion and induction on the size of the matrix.
? 1.29 Show that

1

1

Fn = 0

0

.
1
1
1
0
.
1
0
1
1
.
1
1
0
1
.
1
0
1
0
.
1
1
0
1
.

. . .
. . .

. . .

. . .

. . .
where Fn is the n-th term of 1, 1, 2, 3, 5, . . . , x, y, x + y, . . . , the Fibonacci sequence,

and the determinant is of order n 1. [Am. Math. Mon., Jun. 1949]
Topic
Cramers Rule
We have seen that a linear system
x1 + 2x2 = 6
3x1 + x2 = 8
is equivalent to a linear relationship among vectors.
!
!
!
1
2
6
x1
+ x2
=
3
1
8

This pictures that vector equation. A parallelogram with sides formed from 13

and 21 is nested inside a parallelogram with sides formed from x1 13 and x2 21 .

6
8

1
x1
3

1
3

2
1

2
x2
1
That is, we can restate the algebraic question of finding the solution of a linear
system in geometric terms: by what factors x1 and x2 must we dilate the vectors
to expand the small parallelogram so that it will fill the larger one?
We can apply the geometric significance of determinants to that picture to
get a new formula. Compare the sizes of these shaded boxes.

6
8

1
x1
3

1
3

2
1

2
1

2
1
332

The second is defined by the vectors x1 13 and 21 , and one of the properties of
the size function the determinant is that therefore the size of the second
box is x1 times the size of the first box. Since the third box is defined by the

vector x1 13 + x2 21 = 68 and the vector 21 , and since the determinant does
not change when we add x2 times the second column to the first column, the
size of the third box equals that of the second.

6

8

1
2 x1 1 2

=
= x1
3
1 x1 3 1

2

1
Solving gives the value of one of the variables.

6 2

8 1
10
=
x1 =
=2

5
1 2

3 1
The generalization of this example is Cramers Rule: if |A| 6= 0 then the
system A~x = ~b has the unique solution xi = |Bi |/|A| where the matrix Bi is
formed from A by replacing column i with the vector ~b. The proof is Exercise 3.
For instance, to solve this system for x2
2
1
0
1
0

4
x1
2

1 x2 = 1
1
x3
1
we do this computation.

1
2
4

1 1
2

1 1
1
18
=
x2 =

3
4
1 0

2 1 1

1 0
1
Cramers Rule allows us to solve simple two equations/two unknowns systems
by eye (they must be simple in that we can mentally compute with the numbers
in the system). With practice a person can also do simple three equations/three
unknowns systems. But computing large determinants takes a long time so
solving large systems by Cramers Rule is not practical.
Exercises
1 Use Cramers Rule to solve each for each of the variables.
Topic: Cramers Rule
333
x y= 4
2x + y = 2
(b)
x + 2y = 7
x 2y = 2
2 Use Cramers Rule to solve this system for z.
(a)
2x + y + z = 1
3x
+z=4
xyz=2
3 Prove Cramers Rule.
4 Here is an alternative proof of Cramers Rule that doesnt overtly contain any
geometry. Write Xi for the identity matrix with column i replaced by the vector ~x
of unknowns x1 , . . . , xn .
(a) Observe that AXi = Bi .
(b) Take the determinant of both sides.
5 Suppose that a linear system has as many equations as unknowns, that all of
its coefficients and constants are integers, and that its matrix of coefficients has
determinant 1. Prove that the entries in the solution are all integers. (Remark.
This is often used to invent linear systems for exercises. If an instructor makes
the linear system with this property then the solution is not some disagreeable
fraction.)
6 Use Cramers Rule to give a formula for the solution of a two equations/two
unknowns linear system.
7 Can Cramers Rule tell the difference between a system with no solutions and one
with infinitely many?
8 The first picture in this Topic (the one that doesnt use determinants) shows a
unique solution case. Produce a similar picture for the case of infinitely many
solutions, and the case of no solutions.
Topic
Speed of Calculating Determinants
The permutation expansion formula for computing determinants is useful for
proving theorems, but the method of using row operations is a much better for
finding the determinants of a large matrix. We can make this statement precise
by considering, as computer algorithm designers do, the number of arithmetic
operations that each method uses.
We measure the speed of an algorithm by finding how the time taken by
the computer grows as the size of its input data set grows. For instance, if we
increase the size of the input data by a factor of ten does the time taken by the
computer grow by a factor of ten, or by a factor of a hundred, or by a factor of
a thousand? That is, is the time proportional to the size of the data set, or to
the square of that size, or to the cube of that size, etc.?
Recall the permutation expansion formula for determinants.

t

1,1 t1,2 . . . t1,n

X
t2,1 t2,2 . . . t2,n

=
t1,(1) t2,(2) tn,(n) |P |
..

permutations
.

tn,1 tn,2 . . . tn,n
There are n! = n (n 1) (n 2) 2 1 different n-permutations. This factorial
function grows quickly; for instance when n is only 10 then the expansion
above has 10! = 3, 628, 800 terms, each with n multiplications. Doing n! many
operations is doing more than n2 many operations (roughly: multiplying the
first two factors in n! gives n (n 1), which for large n is approximately
n2 and then multiplying in more factors will make the factorial even larger).
Similarly, the factorial function grows faster than the cube or the fourth power
or any polynomial function. So a computer program that uses the permutation
expansion formula, and thus performs a number of operations that is greater
than or equal to the factorial of the number of rows, would be very slow. It
would take a time longer than the square of the number of rows, longer than
the cube, etc.
In contrast, the time taken by the row reduction method does not grow
so fast. The fragment of row-reduction code shown below is in the computer
language FORTRAN, which is widely used for numeric code. The matrix is in
Topic: Speed of Calculating Determinants
335
the N N array A. The programs outer loop runs through each ROW between 1
and N-1 and does the entry-by-entry combination PIVINV ROW + I with the
lower rows.
DO 10 ROW=1, N-1
PIVINV=1.0/A(ROW,ROW)
DO 20 I=ROW+1, N
DO 30 J=I, N
A(I,J)=A(I,J)-PIVINV*A(ROW,J)
30 CONTINUE
20 CONTINUE
10 CONTINUE
(This code is naive; for example it does not handle the case that the A(ROW,ROW)
is zero. Analysis of a finished version that includes all of the tests and subcases
is messier but gives the same conclusion.) For each ROW, the nested I and J
loops perform the combination with the lower rows by doing arithmetic on the
entries in A that are below and to the right of A(ROW,ROW). There are (N ROW)2
such entries. On average, ROW will be N/2. Therefore, this program will perform
the arithmetic about (N/2)2 times, that is, this program will run in a time
proportional to the square of the number of equations. Taking into account the
outer loop, we estimate that the running time of the algorithm is proportional
to the cube of the number of equations.
Finding the fastest algorithm to compute the determinant is a topic of current
research. So far, people have found algorithms that run in time between the
square and cube of N.
The contrast between these two methods for computing determinants makes
the point that although in principle they give the same answer, in practice we
want the one that is fast.
Exercises
Most of these presume access to a computer.
1 Computer systems generate random numbers (of course, these are only pseudorandom, in that they come from an algorithm, but they pass a number of reasonable
statistical tests for randomness).
(a) Fill a 55 array with random numbers (say, in the range [0..1)). See if it is
singular. Repeat that experiment a few times. Are singular matrices frequent or
rare (in this sense)?
(b) Time your computer algebra system at finding the determinant of ten 55
arrays of random numbers. Find the average time per array. Repeat the prior
item for 1515 arrays, 2525 arrays, 3535 arrays, etc. You may find that you
need to get above a certain size to get a timing that you can use. (Notice that,
when an array is singular, we can sometimes decide that quickly, for instance if
the first row equals the second. In the light of your answer to the first part, do
you expect that singular systems play a large role in your average?)
(c) Graph the input size versus the average time.
2 Compute the determinant of each of these by hand using the two methods discussed
above.

2

1
0 0

3 1

1
2

1
1
3
2 0

(a)
(b) 1 0
(c)
5

5 3
1 2 2
0 1 2 1
0
0 2 1
336

Count the number of multiplications and divisions used in each case, for each of
the methods. (On a computer, multiplications and divisions take much longer than
additions and subtractions, so algorithm designers worry about them more.)
3 What 1010 array can you invent that takes your computer system the longest
to reduce? The shortest?
4 The FORTRAN language specification requires that arrays be stored by column,
that is, the entire first column is stored contiguously, then the second column, etc.
Does the code fragment given take advantage of this, or can it be rewritten to
make it faster, by taking advantage of the fact that computer fetches are faster
from contiguous locations?
Topic
Chis Method
When doing Gausss Method on a matrix that contains only integers
2 1 1
A = 3 4 1
1 5 1
people often prefer to keep it that way. Instead of the row operations (3/2)1 +
2 and (1/2)1 + 3 they may start by multiplying the rows below the top
one by 2
2 1
1
22
6 8 2
()
23
2 10 2
and then the elimination in the first column goes like this.
2 1 1
31 +2
0 5 5
1 +3
0 8 0
()
An all-integer approach is easier for mental calculations. And, using integer

arithmetic on a computer avoids some sticky issues involving floating point
calculations [Kahan]. So there are sound reasons to take this approach.
Another reason comes from observing that we can easily apply Laplaces
expansion to the first column of () and then we get the determinant of A by
remembering to divide by 4 because of ().
Here is the general 33 case of this approach to finding the determinant.
First rescale all rows except the top one.
a1,1 a1,2 a1,3

a1,1
a1,2
a1,3
a1,1 2
A = a2,1 a2,2 a2,3 a2,1 a1,1 a2,2 a1,1 a2,3 a1,1

a1,1 3
a3,1 a3,2 a3,3
a3,1 a1,1 a3,2 a1,1 a3,3 a1,1
This rescales the determinant by a21,1 . Now eliminate down the first column.
a1,1
a1,2
a1,3
a2,1 1 +2
a2,2 a1,1 a2,1 a1,2 a2,3 a1,1 a2,1 a1,3

0
a3,1 1 +3
0
a3,2 a1,1 a3,1 a1,2 a3,3 a1,1 a3,1 a1,3
338
Let C be the 1, 1 minor. By Laplace the determinant of the above matrix is

a1,1 det(C). We thus have a21,1 det(A) = a1,1 det(C) and if a1,1 6= 0 then this
33 case gives det(A) = det(C)/a1,1 .
To expand this approach to nn matrices with n > 3 we must see how to
compute the minors entries. The pattern is: each element of the minor is a
22 determinant. For instance, the entry in the minors upper left a2,2 a1,1
a2,1 a1,2 , which is the 2, 2 entry in the above matrix, is the determinant of the
matrix of these four elements of A.
a1,1 a1,2 a1,3
a2,1 a2,2 a2,3

a3,1 a3,2 a3,3
And the minors lower left, the 3, 2 entry from above, is the determinant of the
matrix of these four.
a1,1 a1,2 a1,3
a2,1 a2,2 a2,3

a3,1 a3,2 a3,3
So, where A is nn for n > 3, we let Chis matrix C be the (n 1)(n 1)
matrix whose i, j entry is the determinant

a
a1,j+1
1,1

ai+1,1 ai+1,j+1
where 1 < i, j 6 n. Chis Method for finding the determinant of A is that if
a1,1 6= 0 then det(A) = det(C)/an2
1,1 .
By the way, nothing in Chis formula requires that the numbers be integers;
it applies to reals as well.
We illustrate by finding the determinant of this 33 matrix.
A = 3
1
We derive this Chis matrix.

2

3
C =
2

1

1

4

1

5
1
4
5
1
1

2 1

3 1

=
2 1

1 1
5
9
5
1
The formula for 33 matrices det(A) = det(C)/a1,1 gives det(A) = (50/2) = 25.
For a larger determinant we must do multiple steps but each involves only
2 2 determinants and so we can often write down only some intermediate
Topic: Chis Method
339
information. For instance, given this 44 matrix
3
1
A=
2
1
we can find Chis matrix by
only noting the 33 result.

3 0

1 2

3 0
C3 =
2 1

3 0

1 0
0
2
1
0
1
0
0
0
1
1
3
1
mentally doing each of the 22 calculations and

3

1

3

2

3

1

1

0

1

0

1

0

3

1

3

2

3

1

1

1

6
1
= 3
3

1

1
1
2
1
7
2
2
We should also note that the determinant of this is a42
1,1 = 3 times the
determinant of the 44 matrix A.
We can finish by repeating the process with the 33 matrix. This is Chis
matrix of it; note that the determinant of this matrix is 6 times the determinant
of C3 .

6 1 6 2

!
3 2 3 7
15 48
C2 =

=
6 2
6 1
6 12

0 1
0 2
The determinant of C2 is 108. We have det(A) = 108/(32 6) = 2.

Laplaces expansion formula for evaluating determinants is recursive because
it reduces the calculation of an nn determinant to the evaluation of a number
of (n 1)(n 1) ones. Chis formula is also recursive, so it is similar in spirit,
but it reduces an nn determinant to a single (n 1)(n 1) determinant, the
calculation of which requires a number of 22 determinants. However, for large
matrices Gausss Method is better than either; for instance, it takes roughly half
as many operations as Chis Method [Fuller & Logan].
Exercises
1 Use Chis Method to find each

2 1 4
1 2 3

0 1 4
(b)
(a) 4 5 6
7 8 9
1 1 1
0 2 1
2 What if a1,1 is zero?
determinant.

0

0
1
1
340
3 The Rule of Sarrus is a mnemonic that students often learn in prior courses
for the 33 determinant formula. On the right of the matrix copy the first two
columns.
a b c a b
d e f d e
g h i g h
The determinant is the sum of the three upper-left to lower-right diagonals minus
the three lower-left to upper-right diagonals aei + bfg + cdh gec hfa idb.
Count the operations involved in Sarruss formula and Chis formula for the 33
case and see which uses fewer.
4 Prove Chis Formula.
Computer Code
This implements Chis Method. It is in the computer language Python but to
make it as readable as possible the code avoids some Python facilities. Note the
recursive call in the final line of chio_det.
#!/usr/bin/python
# chio.py
# Calculate a determinant using Chios method.
# Jim Hefferon; PD
# For demonstration only; does not handle the M[0][0]=0 case!
def det_two(a,b,c,d):
"""Return the determinant of the 2x2 matrix [[a,b], [c,d]]"""
return a*d-b*c
def chio_mat(M):
"""Return the Chio matrix as a list of the rows
M nxn matrix, list of rows"""
dim=len(M)
C=[]
for row in range(1,dim):
C.append([])
for col in range(1,dim):
C[-1].append(det_two(M[0][0], M[0][col], M[row][0], M[row][col]))
return C
def chio_det(M,show=None):
"""Find the determinant of M by Chios method
M mxm matrix, list of rows"""
dim=len(M)
key_elet=M[0][0]
if dim==1:
return key_elet
return chio_det(chio_mat(M))/(key_elet**(dim-2))
if __name__==__main__:
M=[[2,1,1], [3,4,-1], [1,5,1]]
print "M=",M
print "Chio det is", chio_det(M)
This is the result of calling the program from my command line.

$ python chio.py
M=[[2, 1, 1], [3, 4, -1], [1, 5, 1]]
Chio det is 25
Topic
Projective Geometry
There are geometries other than the familiar Euclidean one. One such geometry
arose in art, where people observed that what a viewer sees is not necessarily
what is there. This is Leonardo da Vincis The Last Supper.
Look at where the ceiling meets the left and right walls. In the room those lines
are parallel but as viewers we see lines that, if extended, would intersect. The
intersection point is the vanishing point. This aspect of perspective is familiar
as an image of railroad tracks that appear to converge at the horizon.
To depict the room da Vinci has adopted a model of how we see, of how we
project the three dimensional scene to a two dimensional image. This model
is only a first approximation: it does not take into account the curve of our
retina, that our lens bends the light, that we have binocular vision, or that our
brains processing greatly affects what we see. Nonetheless it is interesting, both
artistically and mathematically.
This is a central projection from a single point to the plane of the canvas.
A
B
C
342
It is not a orthogonal projection since the line from the viewer to C is not
orthogonal to the image plane.
The operation of central projection preserves some geometric properties, for
instance lines project to lines. However, it fails to preserve some others, for
instance equal length segments can project to segments of unequal length (AB
is longer than BC, because the segment projected to AB is closer to the viewer
and closer things look bigger). The study of the effects of central projections is
projective geometry.
There are three cases of central projection. The first is the projection done
by a movie projector.
projector P
source S
image I
We can think that each source point is pushed from the domain plane outward
to the image point in the codomain plane. The second case of projection is that
of the artist pulling the source back to the canvas.
painter P
image I
source S
The two are different because in the first case S is in the middle while in the
second case I is in the middle. One more configuration is possible, with P in the
middle. An example of this is when we use a pinhole to shine the image of a
solar eclipse onto a piece of paper.
source S
pinhole P
image I
Topic: Projective Geometry
343
Although the three are not exactly the same, they are similar. We shall say
that each is a central projection by P of S to I. We next look at three models of
central projection, of increasing abstractness but also of increasing uniformity.
The last will bring out the linear algebra.
Consider again the effect of railroad tracks that appear to converge to a point.
We model this with parallel lines in a domain plane S and a projection via a P
to a codomain plane I. (The gray lines are parallel to S and I planes.)
S
P
All three projection cases appear in this one setting. The first picture below
shows P acting as a movie projector by pushing points from part of S out to
image points on the lower half of I. The middle picture shows P acting as the
artist by pulling points from another part of S back to image points in the
middle of I. In the third picture P acts as the pinhole, projecting points from
S to the upper part of I. This third picture is the trickiest the points that
are projected near to the vanishing point are the ones that are far out on the
bottom left of S. Points in S that are near to the vertical gray line are sent high
up on I.
S
P
S
P
S
P
There are two awkward things about this situation. The first is that neither
of the two points in the domain nearest to the vertical gray line (see below)
has an image because a projection from those two is along the gray line that is
parallel to the codomain plane (we sometimes say that these two are projected
to infinity). The second awkward thing is that the vanishing point in I isnt the
image of any point from S because a projection to this point would be along
the gray line that is parallel to the domain plane (we sometimes say that the
vanishing point is the image of a projection from infinity).
344
S
P
For a model that eliminates this awkwardness, put the projector P at the
origin. Imagine that we cover P with a glass hemispheric dome. As P looks
outward, anything in the line of vision is projected to the same spot on the
dome. This includes things on the line between P and the dome, as in the case
of projection by the movie projector. It includes things on the line further from
P than the dome, as in the case of projection by the painter. It also includes
things on the line that lie behind P, as in the case of projection by a pinhole.

1
` = { k 2 k R }
3
From this perspective P, all of the spots on the line are the same point. Accordingly, for any nonzero vector ~v R3 , we define the associated point v in the
projective plane to be the set {k~v k R and k 6= 0 } of nonzero vectors lying
on the same line through the origin as ~v. To describe a projective point we can
give any representative member of the line, so that the projective point shown
above can be represented in any of these three ways.

1
1/3
2

2
2/3
4
3
1
6
Each of these is a homogeneous coordinate vector for v.
This picture and definition clarifies the description of central projection but
there is something awkward about the dome model: what if the viewer looks
down? If we draw Ps line of sight so that the part coming toward us, out of the
page, goes down below the dome then we can trace the line of sight backward,
up past P and toward the part of the hemisphere that is behind the page. So
in the dome model, looking down gives a projective point that is behind the
viewer. Therefore, if the viewer in the picture above drops the line of sight
toward the bottom of the dome then the projective point drops also and as the
line of sight continues down past the equator, the projective point suddenly
shifts from the front of the dome to the back of the dome. (This brings out that
345
in fact the dome is not quite an entire hemisphere, or else when the viewer is
looking exactly along the equator then there are two points in the line on the
dome. Instead we define it so that the points on the equator with a positive y
coordinate, as well as the point where y = 0 and x is positive, are on the dome
but the other equatorial points are not.) This discontinuity means that we often
have to treat equatorial points as a separate case. That is, while the railroad
track discussion of central projection has three cases, the dome model has two.
We can do better, we can reduce to having no separate cases. Consider a
sphere centered at the origin. Any line through the origin intersects the sphere
in two spots, which are antipodal. Because we associate each line through the
origin with a point in the projective plane, we can draw such a point as a pair
of antipodal spots on the sphere. Below, we show the two antipodal spots
connected by a dashed line to emphasize that they are not two different points,
the pair of spots together make one projective point.
While drawing a point as a pair of antipodal spots is not as natural as the

one-spot-per-point dome mode, on the other hand the awkwardness of the dome
model is gone, in that if as a line of view slides from north to south, no sudden
changes happen. This model of central projection is uniform.
So far we have described points in projective geometry. What about lines?
What a viewer at the origin sees as a line is shown below as a great circle, the
intersection of the model sphere with a plane through the origin.
(Weve included one of the projective points on this line to bring out a subtlety.
Because two antipodal spots together make up a single projective point, the
great circles behind-the-paper part is the same set of projective points as its
in-front-of-the-paper part.) Just as we did with each projective point, we will
also describe a projective line with a triple of reals. For instance, the members
of this plane through the origin in R3

x

{ y x + y z = 0 }
z
project to a line that we can describe with the row vector (1 1 1) (we use a
row vector to typographically set lines apart from points). In general, for any
346
nonzero three-wide row vector ~L we define the associated line in the projective
plane, to be the set L = { k~L k R and k 6= 0 } of nonzero multiples of ~L.
The reason that this description of a line as a triple is convenient is that
in the projective plane, a point v and a line L are incident the point lies
on the line, the line passes through the point if and only if a dot product
of their representatives v1 L1 + v2 L2 + v3 L3 is zero (Exercise 4 shows that this
is independent of the choice of representatives ~v and ~L). For instance, the
projective point described above by the column vector with components 1, 2,
and 3 lies in the projective line described by (1 1 1), simply because any
vector in R3 whose components are in ratio 1 : 2 : 3 lies in the plane through the
origin whose equation is of the form 1k x + 1k y 1k z = 0 for any nonzero k.
That is, the incidence formula is inherited from the three-space lines and planes
of which v and L are projections.
Thus, we can do analytic projective geometry. For instance, the projective
line L = (1 1 1) has the equation 1v1 + 1v2 1v3 = 0, because points
incident on the line have the property that their representatives satisfy this
equation. One difference from familiar Euclidean analytic geometry is that in
projective geometry we talk about the equation of a point. For a fixed point like

1

v = 2
3
the property that characterizes lines through this point (that is, lines incident on
this point) is that the components of any representatives satisfy 1L1 +2L2 +3L3 =
0 and so this is the equation of v.
This symmetry of the statements about lines and points brings up the Duality
Principle of projective geometry: in any true statement, interchanging point
with line results in another true statement. For example, just as two distinct
points determine one and only one line, in the projective plane two distinct lines
determine one and only one point. Here is a picture showing two lines that cross
in antipodal spots and thus cross at one projective point.
()
Contrast this with Euclidean geometry, where two distinct lines may have a
unique intersection or may be parallel. In this way, projective geometry is
simpler, more uniform, than Euclidean geometry.
That simplicity is relevant because there is a relationship between the two
spaces: we can view the projective plane as an extension of the Euclidean plane.
Take the sphere model of the projective plane to be the unit sphere in R3 and
take Euclidean space to be the plane z = 1. This gives us a way of viewing some
347
points in projective space as corresponding to points in Euclidean space, because

all of the points on the plane are projections of antipodal spots from the sphere.
()
Note though that projective points on the equator dont project up to the plane.
Instead, these project out to infinity. We can thus think of projective space
as consisting of the Euclidean plane with some extra points adjoined the
Euclidean plane is embedded in the projective plane. These extra points, the
equatorial points, are the ideal points or points at infinity and the equator is
the ideal line or line at infinity (it is not a Euclidean line, it is a projective
line).
The advantage of the extension to the projective plane is that some of the
awkwardness of Euclidean geometry disappears. For instance, the projective
lines shown above in () cross at antipodal spots, a single projective point, on
the spheres equator. If we put those lines into () then they correspond to
Euclidean lines that are parallel. That is, in moving from the Euclidean plane to
the projective plane, we move from having two cases, that lines either intersect
or are parallel, to having only one case, that lines intersect (possibly at a point
at infinity).
The projective case is nicer in many ways than the Euclidean case but has
the problem that we dont have the same experience or intuitions with it. Thats
one advantage of doing analytic geometry where the equations can lead us to the
right conclusions. Analytic projective geometry uses linear algebra. For instance,
for three points of the projective plane t, u, and v, setting up the equations
for those points by fixing vectors representing each, shows that the three are
collinear incident in a single line if and only if the resulting three-equation
system has infinitely many row vector solutions representing that line. That, in
turn, holds if and only if this determinant is zero.

t u v
1
1
1

t2 u2 v2

t3 u3 v3
Thus, three points in the projective plane are collinear if and only if any three
representative column vectors are linearly dependent. Similarly (and illustrating
the Duality Principle), three lines in the projective plane are incident on a
single point if and only if any three row vectors representing them are linearly
dependent.
The following result is more evidence of the niceness of the geometry of the
projective plane, compared with the Euclidean case. These two triangles in
perspective from the point O because their corresponding vertices are collinear.
348

O
T1
V1
U1
T2
V2
U2
Consider the pairs of corresponding sides: the sides T1 U1 and T2 U2 , the sides
T1 V1 and T2 V2 , and the sides U1 V1 and U2 V2 . Desargues Theorem is that
when we extend the three pairs of corresponding sides to full lines, they intersect
(shown here as the point T U, the point T V, and the point UV), and further,
those three intersection points are collinear.
UV
TV
TU
We will prove this theorem, using projective geometry. (Weve drawn these
as Euclidean figures because it is the more familiar image. To consider them
as projective figures, we can imagine that, although the line segments shown
are parts of great circles and so are curved, the model has such a large radius
compared to the size of the figures that the sides appear in this sketch to be
straight.)
For this proof we need a preliminary lemma [Coxeter]: if W, X, Y, Z are four
points in the projective plane (no three of which are collinear) then there are
homogeneous coordinate vectors w
~ , ~x, ~y, and ~z for the projective points, and a
basis B for R3 , satisfying this.

1
0
0
1

RepB (~
w) = 0 RepB (~x) = 1 RepB (~y) = 0 RepB (~z) = 1
0
0
1
1
For the proof, because W, X, and Y are not on the same projective line, any
homogeneous coordinate vectors w
~ 0 , ~x0 , and ~y0 do not line on the same plane
through the origin in R3 and so form a spanning set for R3 . Thus any homogeneous coordinate vector for Z is a combination ~z0 = a w
~ 0 + b ~x0 + c ~y0 .
Then, we can take w
~ = aw
~ 0 , ~x = b ~x0 , ~y = c ~y0 , and ~z = ~z0 , where the basis
is B = h~
w, ~x, ~yi.
Now, to prove Desargues Theorem use the lemma to fix homogeneous
coordinate vectors and a basis.

1
0
0
1

~
RepB (t1 ) = 0 RepB (~u1 ) = 1 RepB (~v1 ) = 0 RepB (~o) = 1
0
0
1
1
349
Because the projective point T2 is incident on the projective line OT1 , any
homogeneous coordinate vector for T2 lies in the plane through the origin in R3
that is spanned by homogeneous coordinate vectors of O and T1 :

1
1

RepB (~t2 ) = a 1 + b 0
1
0
for some scalars a and b. That is, the homogeneous coordinate vectors of
members T2 of the line OT1 are of the form on the left below, and the forms for
U2 and V2 are similar.

t2
1
1

RepB (~t2 ) = 1
RepB (~u2 ) = u2
RepB (~v2 ) = 1
1
1
v2
The projective line T1 U1 is the image of a plane through the origin in R3 . One
way to get its equation is to note that any vector in it is linearly dependent on
the vectors for T1 and U1 and so this determinant is zero.

1 0 x

=
z=0
0 1 y = 0

0 0 z
The equation of the plane in R3 whose image is the projective line T2 U2 is this.

t

2 1 x

=
(1 u2 ) x + (1 t2 ) y + (t2 u2 1) z = 0
1 u 2 y = 0

1
1 z
Finding the intersection of the two is routine.
t2 1
T1 U1 T2 U2 = 1 u2
0
(This is, of course, the homogeneous coordinate vector of a projective point.)
The other two intersections are similar.
1 t2
0
T1 V1 T2 V2 = 0
U1 V1 U2 V2 = u2 1
v2 1
1 v2
Finish the proof by noting that these projective points are on one projective
line because the sum of the three homogeneous coordinate vectors is zero.
Every projective theorem has a translation to a Euclidean version, although
the Euclidean result may be messier to state and prove. Desargues theorem
illustrates this. In the translation to Euclidean space, we must treat separately
350
the case where O lies on the ideal line, for then the lines T1 T2 , U1 U2 , and V1 V2
are parallel.
The parenthetical remark following the statement of Desargues Theorem
suggests thinking of the Euclidean pictures as figures from projective geometry
for a model of very large radius. That is, just as a small area of the world seems
to people living there to be flat, the projective plane is locally Euclidean.
Although its local properties are familiar, the projective plane has a global
property that is quite different from Euclidean space. The picture below shows
a projective point. At that point we have drawn Cartesian axes, xy-axes. Of
course, the axes appear in the picture at two antipodal spots, one in the northern
hemisphere (that is, shown on the right, in black) and the other in the south.
In the northern hemisphere a person who puts their right hand on the sphere,
palm down, with their fingers pointing along the x-axis in the positive direction
will have their thumb point in the positive direction on the y-axis. But the
antipodal axes give the opposite: if a person puts their right hand on the southern
hemisphere spot on the sphere, palm on the spheres surface, with their fingers
pointing toward positive infinity on the x-axis, then their thumb points on the
y-axis toward negative infinity. Instead, to have their fingers point positively on
the x-axis and their thumb point positively on the y, a person must use their
left hand. Briefly, the projective plane is not orientable in this geometry, left
and right handedness are not fixed properties of figures.
The sequence of pictures below dramatizes this non-orientability. They sketch a

trip around this space in the direction of the y part of the xy-axis. (Warning:
the trip shown is not halfway around, it is a full circuit. True, if we made this
into a movie then we could watch the northern hemisphere spots in the drawing
above gradually rotate about halfway around the sphere to the last picture below.
And we could watch the southern hemisphere spots in the picture above slide
through the south pole and up through the equator to the last picture. But: the
spots at either end of the dashed line are the same projective point. We dont
need to continue on much further; we are pretty much back to the projective
point where we started by the last picture.)
At the end of the circuit, the x part of the xy-axes sticks out in the other
direction. Thus, in the projective plane we cannot describe a figure as right- or
351
left-handed (another way to make this point is that we cannot describe a spiral
as clockwise or counterclockwise).
This exhibition of the existence of a non-orientable space raises a question: is
our universe orientable? For instance, could an astronaut leave earth righthanded and return left-handed? [Gardner] is a nontechnical reference. [Clarke]
is a classic science fiction story about orientation reversal.
So projective geometry is mathematically interesting, in addition to the
natural way in which it arises in art. It is more than just a technical device to
shorten some proofs. For an overview, see [Courant & Robbins]. The approach
weve taken here, the analytic approach, leads to quick theorems and most
importantly for us illustrates the power of linear algebra (see [Hanes], [Ryan],
and [Eggar]). But another approach, the synthetic approach of deriving the
results from an axiom system, is both extraordinarily beautiful and is also the
historical route of development. Two fine sources for this approach are [Coxeter]
or [Seidenberg]. An interesting and easy application is [Davies]
Exercises
1 What is the equation of this point?

1
0
0
(a) Find the line incident on these points in the projective plane.

1
4
2 , 5
3
(b) Find the point incident on both of these projective lines.

(1
3), (4
6)
3 Find the formula for the line incident on two projective points. Find the formula
for the point incident on two projective lines.
4 Prove that the definition of incidence is independent of the choice of the representatives of p and L. That is, if p1 , p2 , p3 , and q1 , q2 , q3 are two triples of
homogeneous coordinates for p, and L1 , L2 , L3 , and M1 , M2 , M3 are two triples of
homogeneous coordinates for L, prove that p1 L1 + p2 L2 + p3 L3 = 0 if and only if
q1 M1 + q2 M2 + q3 M3 = 0.
5 Give a drawing to show that central projection does not preserve circles, that a
circle may project to an ellipse. Can a (non-circular) ellipse project to a circle?
6 Give the formula for the correspondence between the non-equatorial part of the
antipodal modal of the projective plane, and the plane z = 1.
7 (Pappuss Theorem) Assume that T0 , U0 , and V0 are collinear and that T1 , U1 ,
and V1 are collinear. Consider these three points: (i) the intersection V2 of the lines
T0 U1 and T1 U0 , (ii) the intersection U2 of the lines T0 V1 and T1 V0 , and (iii) the
intersection T2 of U0 V1 and U1 V0 .
(a) Draw a (Euclidean) picture.
(b) Apply the lemma used in Desargues Theorem to get simple homogeneous
coordinate vectors for the T s and V0 .
(c) Find the resulting homogeneous coordinate vectors for Us (these must each
involve a parameter as, e.g., U0 could be anywhere on the T0 V0 line).
352

(d) Find the resulting homogeneous coordinate vectors for V1 . (Hint: it involves
two parameters.)
(e) Find the resulting homogeneous coordinate vectors for V2 . (It also involves
two parameters.)
(f) Show that the product of the three parameters is 1.
(g) Verify that V2 is on the T2 U2 line.
Chapter Five
Similarity
We have shown that for any homomorphism there are bases B and D such that
the representation matrix has a block partial-identity form.
!
Identity Zero
RepB,D (h) =
Zero
Zero
~ 1 + + cn
~ n to c1~1 +
This representation describes the map as sending c1
+ ck~k + ~0 + + ~0, where n is the dimension of the domain and k is the
dimension of the range. So, under this representation the action of the map is
easy to understand because most of the matrix entries are zero.
This chapter considers the special case where the domain and codomain are
the same. We naturally ask for the basis for the domain and codomain be the
same, that is, we want a B so that RepB,B (t) is as simple as possible (we will
take simple to mean that it has many zeroes). We will find that we cannot
always get a matrix having the above block partial-identity form but we will
develop a form that comes close, a representation that is nearly diagonal.
Complex Vector Spaces
This chapter requires that we factor polynomials, but many polynomials do

not factor over the real numbers. For instance, x2 + 1 does not factor into
a product of two linear polynomials with real coefficients, instead it requires
complex numbers x2 + 1 = (x i)(x + i).
Therefore, in this chapter we shall use complex numbers for our scalars,
including entries in vectors and matrices. That is, we are shifting from studying
vector spaces over the real numbers to vector spaces over the complex numbers.
Any real number is a complex number and in this chapter most of the
examples use only real numbers. Nonetheless, the critical theorems require that
354
Chapter Five. Similarity
the scalars be complex so the first section is a quick review of complex numbers.
In this book, our approach is to shift to this more general context of taking
scalars to be complex only for the pragmatic reason that we must do so now
in order to move forward. However, the idea of doing vector spaces by taking
scalars from a structure other than the real numbers is an interesting and useful
one. Delightful presentations that take this approach from the start are in
[Halmos] and [Hoffman & Kunze].
I.1
Review of Factoring and Complex Numbers
This subsection is a review only and we take the main results as known.
For proofs, see [Birkhoff & MacLane] or [Ebbinghaus].
We consider a polynomial p(x) = cn xn + + c1 x + c0 with leading
coefficient cn 6= 0. The degree of the polynomial is n if n > 1. If n = 0 then
p is a constant polynomial p(x) = c0 . Constant polynomials that are not the
zero polynomial, c0 6= 0, have degree zero. We define the zero polynomial to
have degree .
Just as integers have a division operation e.g., 4 goes 5 times into 21 with
remainder 1 so do polynomials.
1.1 Theorem (Division Theorem for Polynomials) Let c(x) be a polynomial. If m(x)
is a non-zero polynomial then there are quotient and remainder polynomials
q(x) and r(x) such that
c(x) = m(x) q(x) + r(x)
where the degree of r(x) is strictly less than the degree of m(x).
1.2 Remark Defining the degree of the zero polynomial to be , which most
but not all authors do, allows the equation degree(fg) = degree(f) + degree(g)
to hold for all polynomial functions f and g.
The point of the integer division statement 4 goes 5 times into 21 with
remainder 1 is that the remainder is less than 4 while 4 goes 5 times, it does
not go 6 times. In the same way, the point of the polynomial division statement
is its final clause.
1.3 Example If c(x) = 2x3 3x2 + 4x and m(x) = x2 + 1 then q(x) = 2x 3 and
r(x) = 2x + 3. Note that r(x) has a lower degree than m(x).
1.4 Corollary The remainder when c(x) is divided by x is the constant

polynomial r(x) = c().
Section I. Complex Vector Spaces
355
Proof The remainder must be a constant polynomial because it is of degree less
than the divisor x , To determine the constant, take m(x) from the theorem
to be x and substitute for x to get c() = ( ) q() + r(x).
QED
If a divisor m(x) goes into a dividend c(x) evenly, meaning that r(x) is the
zero polynomial, then m(x) is a factor of c(x). Any root of the factor (any
R such that m() = 0) is a root of c(x) since c() = m() q() = 0.
1.5 Corollary If is a root of the polynomial c(x) then x divides c(x) evenly,
that is, x is a factor of c(x).
Proof By the above corollary c(x) = (x ) q(x) + c(). Since is a root,
c() = 0 so x is a factor.
QED
Finding the roots and factors of a high-degree polynomial can be hard.

But for second-degree polynomials we have the quadratic formula: the roots of
ax2 + bx + c are
b + b2 4ac
b b2 4ac
1 =
2 =
2a
2a
(if the discriminant b2 4ac is negative then the polynomial has no real number
roots). A polynomial that cannot be factored into two lower-degree polynomials
with real number coefficients is irreducible over the reals.
1.6 Theorem Any constant or linear polynomial is irreducible over the reals. A
quadratic polynomial is irreducible over the reals if and only if its discriminant
is negative. No cubic or higher-degree polynomial is irreducible over the reals.
1.7 Corollary Any polynomial with real coefficients can be factored into linear
and irreducible quadratic polynomials. That factorization is unique; any two
factorizations have the same powers of the same factors.
Note the analogy with the prime factorization of integers. In both cases, the
uniqueness clause is very useful.
1.8 Example Because of uniqueness we know, without multiplying them out, that
(x + 3)2 (x2 + 1)3 does not equal (x + 3)4 (x2 + x + 1)2 .
1.9 Example By uniqueness, if c(x) = m(x)q(x) then where c(x) = (x3)2 (x+2)3
and m(x) = (x 3)(x + 2)2 , we know that q(x) = (x 3)(x + 2).
While x2 + 1 has no real roots and so doesnt factor over the real numbers,
if we imagine a root traditionally denoted i so that i2 + 1 = 0 then x2 + 1
factors into a product of linears (x i)(x + i).
So we adjoin this root i to the reals and close the new system with respect
to addition, multiplication, etc. (i.e., we also add 3 + i, and 2i, and 3 + 2i, etc.,
putting in all linear combinations of 1 and i). We then get a new structure, the
complex numbers C.
356
In C we can factor (obviously, at least some) quadratics that would be

irreducible if we were to stick to the real numbers. Surprisingly, in C we can
not only factor x2 + 1 and its close relatives, we can factor any quadratic.
2
ax + bx + c = a x
b +
b b2 4ac
b2 4ac
x
2a
2a
1.10 Example The second degree polynomial x2 + x + 1 factors over the complex
numbers into the product of two first degree polynomials.
1 + 3
1 3
1
3
1
3
x
x
= x ( +
i) x (
i)
2
2
2
2
2
2
1.11 Theorem (Fundamental Theorem of Algebra) Polynomials with complex coefficients factor into linear polynomials with complex coefficients. The factorization
is unique.
I.2
Complex Representations
Recall the definitions of the complex number addition

(a + bi) + (c + di) = (a + c) + (b + d)i
and multiplication.
(a + bi)(c + di) = ac + adi + bci + bd(1)
= (ac bd) + (ad + bc)i
2.1 Example For instance, (1 2i) + (5 + 4i) = 6 + 2i and (2 3i)(4 0.5i) =
6.5 13i.
Handling scalar operations with those rules, all of the operations that weve
covered for real vector spaces carry over unchanged.
2.2 Example Matrix multiplication is the same, although the scalar arithmetic
involves more bookkeeping.
1 + 1i
i
=
2 0i
2 + 3i
1 + 0i
3i
1 0i
i
(1 + 1i) (1 + 0i) + (2 0i) (3i)

(i) (1 + 0i) + (2 + 3i) (3i)
!
1 + 7i 1 1i
9 5i 3 + 3i
(1 + 1i) (1 0i) + (2 0i) (i)

(i) (1 0i) + (2 + 3i) (i)
Section I. Complex Vector Spaces
357
We shall also carry over unchanged from the previous chapters everything
that we can. For instance, we shall call this
1 + 0i
0 + 0i
0 + 0i
0 + 0i
h . , . . . , .
i
..
..
0 + 0i
1 + 0i
the standard basis for Cn as a vector space over C and again denote it En .
358
II
Similarity
to be matrix equivalent if there are

Weve defined two matrices H and H
nonsingular P and Q such that H = PHQ. We were motivated by this diagram

representing a map, h but with respect to different pairs
showing both H and H
of bases, B, D and B, D.
h
Vwrt B Wwrt D
H
idy
idy
h
Vwrt B Wwrt D
We now consider the special case where the codomain equals the domain
and in particular we add the requirement that the codomains basis equals the
domains basis, so we are considering representations with respect to B, B and
D, D.
t
Vwrt B Vwrt B
S
idy
idy
t
Vwrt D Vwrt D
T
In matrix terms, RepD,D (t) = RepB,D (id) RepB,B (t) RepB,D (id)
II.1
1
1.1 Definition The matrices T and S are similar if there is a nonsingular P such
that T = PSP1 .
Since nonsingular matrices are square, T and S must be square and of the same
size. Exercise 12 checks that similarity is an equivalence relation.
1.2 Example Calculation with these two,
!
2 1
P=
S=
1 1
2
1
3
1
gives that S is similar to this matrix.

T=
0
1
1
1
1.3 Example The only matrix similar to the zero matrix is itself: PZP1 = PZ = Z.
The identity matrix has the same property: PIP1 = PP1 = I.
Section II. Similarity
359
Since matrix similarity is a special case of matrix equivalence, if two matrices

are similar then they are matrix equivalent. What about the converse: must
any two matrix equivalent square matrices be similar? No; the prior example
shows that the similarity classes are different from the matrix equivalence classes
because the matrix equivalence class of an identity consists of all nonsingular
matrices of that size. Thus these two are matrix equivalent but not similar.
!
!
1 0
1 2
T=
S=
0 1
0 3
So some matrix equivalence classes split into two or more similarity classes
similarity gives a finer partition than does equivalence. This pictures some
matrix equivalence classes subdivided into similarity classes.
S
T
...
To understand the similarity relation we shall study the similarity classes.

We approach this question in the same way that weve studied both the row
equivalence and matrix equivalence relations, by finding a canonical form for
representatives of the similarity classes, called Jordan form. With this canonical
form, we can decide if two matrices are similar by checking whether they are in
a class with the same representative. Weve also seen with both row equivalence
and matrix equivalence that a canonical form gives us insight into the ways in
which members of the same class are alike (e.g., two identically-sized matrices
are matrix equivalent if and only if they have the same rank).
Exercises
1.4 For

S=
1
2
3
6

T=
0
11/2

0
5

P=
4
3

2
2
check that T = PSP1 .

X 1.5 Example 1.3 shows that the only matrix similar to a zero matrix is itself and
that the only matrix similar to the identity is itself.
(a) Show that the 11 matrix (2), also, is similar only to itself.
(b) Is a matrix of the form cI for some scalar c similar only to itself?
(c) Is a diagonal matrix similar only to itself?
X 1.6 Show that these matrices are not similar.
1 0 4
1
1 1 3
0
2 1 7
3
0
1
1
1
1
2
1.7 Consider the transformation t : P2 P2 described by x2 7 x + 1, x 7 x2 1,

and 1 7 3.
(a) Find T = RepB,B (t) where B = hx2 , x, 1i.
More information on representatives is in the appendix.
360

(b) Find S = RepD,D (t) where D = h1, 1 + x, 1 + x + x2 i.
(c) Find the matrix P such that T = PSP1 .
X 1.8 Exhibit an nontrivial similarity relationship in this way: let t : C2 C2 act by

3
1
1
1
7
7
2
0
1
2
and pick two bases, and represent t with respect to then T = RepB,B (t) and
S = RepD,D (t). Then compute the P and P1 to change bases from B to D and
back again.
1.9 Explain Example 1.3 in terms of maps.
X 1.10 [Halmos] Are there two matrices A and B that are similar while A2 and B2 are
not similar?
X 1.11 Prove that if two matrices are similar and one is invertible then so is the other.
X 1.12 Show that similarity is an equivalence relation.
1.13 Consider a matrix representing, with respect to some B, B, reflection across
the x-axis in R2 . Consider also a matrix representing, with respect to some D, D,
reflection across the y-axis. Must they be similar?
1.14 Prove that similarity preserves determinants and rank. Does the converse hold?
1.15 Is there a matrix equivalence class with only one matrix similarity class inside?
One with infinitely many similarity classes?
1.16 Can two different diagonal matrices be in the same similarity class?
X 1.17 Prove that if two matrices are similar then their k-th powers are similar when
k > 0. What if k 6 0?
X 1.18 Let p(x) be the polynomial cn xn + + c1 x + c0 . Show that if T is similar to
S then p(T ) = cn T n + + c1 T + c0 I is similar to p(S) = cn Sn + + c1 S + c0 I.
1.19 List all of the matrix equivalence classes of 11 matrices. Also list the similarity
classes, and describe which similarity classes are contained inside of each matrix
equivalence class.
1.20 Does similarity preserve sums?
1.21 Show that if T I and N are similar matrices then T and N + I are also
similar.
II.2
Diagonalizability
The prior subsection shows that although similar matrices are necessarily matrix
equivalent, the converse does not hold. Some matrix equivalence classes break
into two or more similarity classes; for instance, the nonsingular 22 matrices
form one matrix equivalence class but more than one similarity class.
Thus we cannot use the canonical form for matrix equivalence, a block
partial-identity matrix, as a canonical form for matrix similarity. The diagram
below illustrates. The stars are similarity class representatives. Each dashed-line
similarity class subdivision has one star but each solid-curve matrix equivalence
class division has only one partial identity matrix.
361
?
?
?
?
? ?
?
?
...
To develop a canonical form for representatives of the similarity classes we

naturally build on previous work. This means first that the partial identity
matrices should represent the similarity classes into which they fall. Beyond
that, the representatives should be as simple as possible and the partial identities
are simple in that they consist mostly of zero entries. The simplest extension of
the partial identity form is the diagonal form.
2.1 Definition A transformation is diagonalizable if it has a diagonal representation with respect to the same basis for the codomain as for the domain. A
diagonalizable matrix is one that is similar to a diagonal matrix: T is diagonalizable if there is a nonsingular P such that PT P1 is diagonal.
4
1
2
1
4
1
is diagonalizable.
2
0
0
3
!
=
1
1
2
1
2
1
1
1
2
1
!1
2.3 Example This matrix is not diagonalizable

!
0 0
N=
1 0
because it is not the zero matrix but its square is the zero matrix. The fact that
N is not the zero matrix means that it cannot be similar to the zero matrix,
by Example 1.3. So if N is similar to a diagonal matrix D then D has at least
one nonzero entry on its diagonal. The fact that Ns square is the zero matrix
means that for any map n that N represents, the composition n n is the zero
map. The only matrix representing the zero map is the zero matrix and thus D2
would have to be the zero matrix. But D2 cannot be the zero matrix because
the square of a diagonal matrix is the diagonal matrix whose entries are the
squares of the entries from the starting matrix, and D is not the zero matrix.
That example shows that a diagonal form will not suffice as a canonical
form we cannot find a diagonal matrix in each matrix similarity class. However,
the canonical form that we are developing has the property that if a matrix can
be diagonalized then the diagonal matrix is the canonical representative of its
similarity class.
362
2.4 Lemma A transformation t is diagonalizable if and only if there is a basis

~ 1, . . . ,
~ n i and scalars 1 , . . . , n such that t(
~ i ) = i
~ i for each i.
B = h
Proof Consider a diagonal representation matrix.
..
.
~ 1 ))
RepB,B (t) =
Rep
(t(
..
.

..
1
.
.
~ n )) = .
RepB (t(
.
..
0
.
..
0
..
.
n
Consider the representation of a member of this basis with respect to the basis
~ i ). The product of the diagonal matrix and the representation vector
RepB (

0
0
. .
. .
1
0
. .

.
.
.
~ i )) = .
. . .. 1
RepB (t(
=
.
. .i

0
n
.. ..
0
0
has the stated action.
QED
2.5 Example To diagonalize

T=
3
0
2
1
we take it as the representation of a transformation with respect to the standard

~ 1,
~ 2 i such that
basis T = RepE2 ,E2 (t) and we look for a basis B = h
!
1 0
RepB,B (t) =
0 2
~ 1 ) = 1
~ 1 and t(
~ 2 ) = 2
~ 2.
that is, such that t(
!
!
3 2 ~
3 2 ~
~
~2
1 = 1 1
2 = 2
0 1
0 1
We are looking for scalars x such that this equation
!
!
!
3 2
b1
b1
=x
0 1
b2
b2
has solutions b1 and b2 , which are not both zero (the zero vector is not the
member of any basis). Thats a linear system.
(3 x) b1 +
2 b2 = 0
(1 x) b2 = 0
()
Focus first on the bottom equation. The two numbers multiply to give zero only
if at least one of them is zero so there are two cases, b2 = 0 or x = 1. In the
363
b2 = 0 case, the first equation gives that either b1 = 0 or x = 3. Since weve

disallowed the case of both b1 = 0 and b2 = 0, we are left with 1 = 3. Then
the first equation in () is 0 b1 + 2 b2 = 0 and so associated with 1 = 3 are
vectors with a second component of zero and a first component that is free.
3
0
2
1
b1
0
!
=3
b1
0
Choose any nonzero b1 to have a first basis vector.

~1 =
1
0
The second case for the bottom equation of () is 2 = 1. The first equation in
() is then 2 b1 + 2 b2 = 0 and so associated with 1 are vectors such that their
second component is the negative of their first.
3
0
2
1
b1
b1
!
=1
b1
b1
Choose a nonzero one of these to have a second basis vector.

!
1
~
2 =
1
Now drawing the similarity diagram
t
R2wrt E2 R2wrt E2
T
idy
idy
t
R2wrt B R2wrt B
D
and noting that the matrix RepB,E2 (id) is easy gives us this diagonalization.
3
0
0
1
!
=
1
0
1
1
!1
3
0
2
1
1
0
1
1
In the next subsection, we will expand on that example by considering more

closely the property of Lemma 2.4. This includes seeing another way, the way
that we will routinely use, to find the s.
Exercises
X 2.6 Repeat Example 2.5 for the matrix from Example 2.2.
2.7 Diagonalize these upper triangular matrices.
364

2 1
5 4
(b)
0 2
0 1
X 2.8 What form do the powers of a diagonal matrix have?
2.9 Give two same-sized diagonal matrices that are not similar. Must any two
different diagonal matrices come from different similarity classes?
2.10 Give a nonsingular diagonal matrix. Can a diagonal matrix ever be singular?
X 2.11 Show that the inverse of a diagonal matrix is the diagonal of the the inverses, if
no element on that diagonal is zero. What happens when a diagonal entry is zero?
2.12 The equation ending Example 2.5

1

1
1
3 2
1
1
3 0
=
0 1
0 1
0 1
0 1
is a bit jarring because for P we must take the first matrix, which is shown as an
inverse, and for P1 we take the inverse of the first matrix, so that the two 1
powers cancel and this matrix is shown without a superscript 1.
(a) Check that this nicer-appearing equation holds.

1
3 0
1
1
3 2
1
1
=
0 1
0 1
0 1
0 1
(a)
(b) Is the previous item a coincidence? Or can we always switch the P and the
P1 ?
2.13 Show that the P used to diagonalize in Example 2.5 is not unique.
2.14 Find a formula for the powers of this matrix Hint : see Exercise 8.

3 1
4 2
X 2.15 Diagonalize

these.

1 1
0 1
(a)
(b)
0 0
1 0
2.16 We can ask how diagonalization interacts with the matrix operations. Assume
that t, s : V V are each diagonalizable. Is ct diagonalizable for all scalars c?
What about t + s? t s?
X 2.17 Show that matrices of this form are not diagonalizable.

1 c
c 6= 0
0 1
2.18 Show
is diagonalizable.
that
each ofthese
1 2
x y
(a)
(b)
x, y, z scalars
2 1
y z
II.3
Eigenvalues and Eigenvectors
In this subsection we will focus on the property of Lemma 2.4.

3.1 Definition A transformation t : V V has a scalar eigenvalue if there is a
nonzero eigenvector ~ V such that t(~) = ~.
(Eigen is German for characteristic of or peculiar to. Some authors call
these characteristic values and vectors. No one calls them peculiar.)
365
3.2 Remark This definition requires that the eigenvector be non-~0. Some authors
allow ~0 as an eigenvector for as long as there are also non-~0 vectors associated
with . Neither style of definition is clearly better; both involve small tradeoffs.
In both styles the key point is to not allow a case where is such that t(~v) = ~v
for only the single vector ~v = ~0.
Also, note that could be 0. The issue is whether ~ could be ~0.
3.3 Example The projection map

x
x

y 7 y
z
0
x, y, z C
has an eigenvalue of 1 associated with any eigenvector of the form

x

y

0
where x and y are scalars that are not both zero. On the other hand, 2 is not
an eigenvalue of since no non-~0 vector is doubled.
3.4 Example The only transformation on the trivial space {~0 } is ~0 7 ~0. This
map has no eigenvalues because there are no non-~0 vectors ~v mapped to a scalar
multiple ~v of themselves.
3.5 Example Consider the homomorphism t : P1 P1 given by c0 + c1 x 7
(c0 + c1 ) + (c0 + c1 )x. While the codomain
P1 of t is two-dimensional, its range

is one-dimensional R(t) = { c + cx c C}. Application of t to a vector in that
range will simply rescale the vector c + cx 7 (2c) + (2c)x. That is, t has an
eigenvalue of 2 associated with eigenvectors of the form c + cx where c 6= 0.
This map also has an eigenvalue of 0 associated with eigenvectors of the form
c cx where c 6= 0.
3.6 Definition A square matrix T has a scalar eigenvalue associated with the
nonzero eigenvector ~ if T ~ = ~.
Although this extension from maps to matrices is natural, we need to make
one observation. Eigenvalues of a map are also the eigenvalues of matrices
representing that map and so similar matrices have the same eigenvalues. But the
eigenvectors can different similar matrices need not have the same eigenvectors.
3.7 Example Consider again the transformation t : P1 P1 from Example 3.5
given by c0 + c1 x 7 (c0 + c1 ) + (c0 + c1 )x. One of its eigenvalues is 2, associated
with the eigenvectors c + cx where c 6= 0. If we represent t with respect to
B = h1 + 1x, 1 1xi
!
T = RepB,B (t) =
2
0
0
0
366
then 2 is an eigenvalue of the matrix T , associated with these eigenvectors.

c0
{
c1
2
0
0
0
c0
c1
!
=
!
!
2c0
c0
}={
c0 C, c0 6= 0 }
2c1
0
On the other hand, if we represent t with respect to D = h2 + 1x, 1 + 0xi

S = RepD,D (t) =
3
3
1
1
then the eigenvectors associated with the eigenvalue 2 are these.

c0
{
c1
3
3
1
1
c0
c1
!
=
!
!
2c0
0
}={
c1 C, c1 6= 0 }
2c1
c1
3.8 Remark Here is an informal description of the reason for the difference.
The underlying transformation doubles the eigenvectors ~v 7 2 ~v. But when
the matrix representing the transformation is T = RepB,B (t) then the matrix
assumes that column vectors are representations with respect to B. In contrast,
S = RepD,D (t) assumes that column vectors are representations with respect
to D. So the column vector representations that get doubled by each matrix are
different.
The next example shows the basic tool for finding eigenvectors and eigenvalues.
3.9 Example If
1 2
T = 2 0
1 2
2
3
then to find the scalars x such that T ~ = x~ for nonzero eigenvectors ~, bring
everything to the left-hand side
1 2
2 0
1 2

1
z1
z1

2 z2 x z2 = ~0
3
z3
z3
and factor (T xI)~ = ~0. (Note that it says T xI. The expression T x doesnt
make sense because T is a matrix while x is a scalar.) This homogeneous linear
system

1x
2
1
z1
0

0 x 2 z2 = 0
2
1
2
3x
z3
0
has a nonzero solution ~z if and only if the matrix is singular. We can determine
367
when that happens.

0 = |T xI|

1 x
2
1

= 2
0 x 2

1
2
3 x
= x3 4x2 + 4x
= x(x 2)2
The eigenvalues are 1 = 0 and 2 = 2. To find the associated eigenvectors plug
in each eigenvalue. Plugging in 1 = 0 gives

z1
0
z1
a
10
2
1

0 0 2 z2 = 0 = z2 = a
2
1
2
30
z3
0
z3
a
for a 6= 0 (a is non-0 because eigenvectors must be non-~0). Plugging in 2 = 2
gives

12
2
1
z1
0
z1
b

0 2 2 z2 = 0 = z2 = 0
2
1
2
32
z3
0
z3
b
with b 6= 0.
3.10 Example If
S=
1
0 3
(here is not a projection map, it is the number 3.14 . . .) then

x
1

= (x )(x 3)
0
3 x
so S has eigenvalues of 1 = and 2 = 3. To find associated eigenvectors, first
plug in 1 for x
!
!
!
!
!
1
z1
0
z1
a
=
=
=
0
3
z2
0
z2
0
for a scalar a 6= 0. Then plug in 2
!
!
!
3
1
z1
0
=
0
33
z2
0
where b 6= 0.
z1
z2
!
=
b/( 3)
b
368
3.11 Definition The characteristic polynomial of a square matrix T is the

determinant |T xI| where x is a variable. The characteristic equation is
|T xI| = 0. The characteristic polynomial of a transformation t is the
characteristic polynomial of any matrix representatation RepB,B (t).
Exercise 32 checks that the characteristic polynomial of a transformation is
well-defined, that is, that the characteristic polynomial is the same no matter
which basis B we use for the representation.
3.12 Lemma A linear transformation on a nontrivial vector space has at least
one eigenvalue.
Proof Any root of the characteristic polynomial is an eigenvalue. Over the
complex numbers, any polynomial of degree one or greater has a root.
QED
3.13 Remark This result is the reason that in this chapter weve changed to using
scalars that are complex.
3.14 Definition The eigenspace
of a transformation t associated with the

eigenvalue is V = { ~ t(~ ) = ~ }. The eigenspace of a matrix is analogous.
3.15 Lemma An eigenspace is a subspace.
Proof An eigenspace is nonempty because it contains the zero vector since for
any linear transformation t(~0) = ~0, which equals ~0. Thus we need only check
closure of linear combinations. Take ~1 , . . . , ~n V and verify
t(c1 ~1 + c2 ~2 + + cn ~n ) = c1 t(~1 ) + + cn t(~n )
= c1 ~1 + + cn ~n
= (c1 ~1 + + cn ~n )
that the combination is also in V (despite that the zero vector isnt an eigenvector, the second equality holds even if some ~i is ~0 since t(~0) = ~0 = ~0).
QED
3.16 Example In Example 3.10 the eigenspace associated with the eigenvalue
and the eigenspace associated with the eigenvalue 3 are these.
!
!
a
b/( 3)
V = {
a C}
V3 = {
b C}
0
b
3.17 Example In Example 3.9 these are the eigenspaces associated with the
eigenvalues 0 and 2.

a
b

V0 = { a a C },
V2 = { 0 b C}.
a
b
369
The characteristic equation in Example 3.9 is 0 = x(x 2)2 so in some sense

2 is an eigenvalue twice. However there are not twice as many eigenvectors in
that the dimension of the associated eigenspace V2 is one, not two. The next
example is a case where a number is a double root of the characteristic equation
and the dimension of the associated eigenspace is two.
3.18 Example With respect to the standard bases, this matrix
1 0 0
0 1 0
0 0 0
represents projection.

x
x

y 7 y
z
0
x, y, z C
Its eigenspace associated with the eigenvalue 0 and its eigenspace associated
with the eigenvalue 1 are easy to find.

0
c1

V0 = { 0 c3 C }
V1 = { c2 c1 , c2 C}
c3
0
By Lemma 3.15 if two eigenvectors ~v1 and ~v2 are associated with the same
eigenvalue then a linear combination of those two is also an eigenvector, associated
with the same eigenvalue. Thus, referring to the prior example, this sum of two
members of V1

1
0

0 + 1
0
0
yields another member of V1 .
The next result speaks to the situation where the vectors come from different
eigenspaces.
3.19 Theorem For any set of distinct eigenvalues of a map or matrix, a set of
associated eigenvectors, one per eigenvalue, is linearly independent.
Proof We will use induction on the number of eigenvalues. If there is no
eigenvalue then the set of associated vectors is empty, and is linearly independent.
If there is only one eigenvalue then the set of associated eigenvectors is a singleton
set with a non-~0 member, and so is linearly independent.
For induction assume that the theorem is true for any set of k distinct
eigenvalues. Consider distinct eigenvalues 1 , . . . , k+1 and let ~v1 , . . . ,~vk+1
be associated eigenvectors. Suppose that ~0 = c1~v1 + + ck~vk + ck+1~vk+1 .
Derive two equations from that, the first by multiplying k+1 on both sides
370
~0 = c1 k+1~v1 + + ck+1 k+1~vk+1 and the second by applying the map to both
sides ~0 = c1 t(~v1 ) + + ck+1 t(~vk+1 ) = c1 1~v1 + + ck+1 k+1~vk+1 (applying
the matrix gives the same result). Subtract the second equation from the first
~0 = c1 (k+1 1 )~v1 + + ck (k+1 k )~vk + ck+1 (k+1 k+1 )~vk+1
so that the ~vk+1 term vanishes. Then the induction hypothesis gives that
c1 (k+1 1 ) = 0, . . . , ck (k+1 k ) = 0. All of the eigenvalues are distinct
so c1 , . . . , ck are all 0. With that, ck+1 must be 0 because we are left with the
equation ~0 = ck+1~vk+1 .
QED
3.20 Example The eigenvalues of
0
4
2
1
8
1
3
are distinct: 1 = 1, 2 = 2, and 3 = 3. A set of associated eigenvectors

2
9
2

{ 1 , 4 , 1 }
0
4
2
is linearly independent.
3.21 Corollary An nn matrix with n distinct eigenvalues is diagonalizable.
Proof Form a basis of eigenvectors. Apply Lemma 2.4.
QED
Exercises
3.22 For each, find
polynomial
the characteristic

and theeigenvalues.

10 9
1 2
0 3
0 0
(a)
(b)
(c)
(d)
4 2
4 3
7 0
0 0

1 0
(e)
0 1
X 3.23 For each matrix, find the characteristic equation, and the eigenvalues and
associated
eigenvectors.

3
0
3 2
(a)
(b)
8 1
1 0
3.24 Find the characteristic equation, and the eigenvalues and associated eigenvectors
for this matrix. Hint. The eigenvalues are complex.

2 1
5
2
3.25 Find the characteristic polynomial, the eigenvalues, and the associated eigenvectors of this matrix.
1 1 1
0 0 1
0 0 1
X 3.26 For each matrix, find the characteristic equation, and the eigenvalues and
associated eigenvectors.
3
(a) 2
0
2
3
0
0
0
5
371
0
(b) 0
4
1
0
17
0
1
8
X 3.27 Let t : P2 P2 be
a0 + a1 x + a2 x2 7 (5a0 + 6a1 + 2a2 ) (a1 + 8a2 )x + (a0 2a2 )x2 .
Find its eigenvalues and the associated eigenvectors.
3.28 Find the eigenvalues and eigenvectors of this map t : M2 M2 .

a b
2c
a+c
7
c d
b 2c
d
X 3.29 Find the eigenvalues and associated eigenvectors of the differentiation operator
d/dx : P3 P3 .
3.30 Prove that the eigenvalues of a triangular matrix (upper or lower triangular)
are the entries on the diagonal.
X 3.31 Find the formula for the characteristic polynomial of a 22 matrix.
3.32 Prove that the characteristic polynomial of a transformation is well-defined.
3.33 Prove or disprove: if all the eigenvalues of a matrix are 0 then it must be the
zero matrix.
X 3.34 (a) Show that any non-~0 vector in any nontrivial vector space can be a
eigenvector. That is, given a ~v 6= ~0 from a nontrivial V, show that there is a
transformation t : V V having a scalar eigenvalue R such that ~v V .
(b) What if we are given a scalar ? Can any non-~0 member of any nontrivial
vector space be an eigenvector associated with ?
X 3.35 Suppose that t : V V and T = RepB,B (t). Prove that the eigenvectors of T
associated with are the non-~0 vectors in the kernel of the map represented (with
respect to the same bases) by T I.
3.36 Prove that if a, . . . , d are all integers and a + b = c + d then

a b
c d
has integral eigenvalues, namely a + b and a c.
X 3.37 Prove that if T is nonsingular and has eigenvalues 1 , . . . , n then T 1 has
eigenvalues 1/1 , . . . , 1/n . Is the converse true?
X 3.38 Suppose that T is nn and c, d are scalars.
(a) Prove that if T has the eigenvalue with an associated eigenvector ~v then ~v is
an eigenvector of cT + dI associated with eigenvalue c + d.
(b) Prove that if T is diagonalizable then so is cT + dI.
X 3.39 Show that is an eigenvalue of T if and only if the map represented by T I
is not an isomorphism.
3.40 [Strang 80]
(a) Show that if is an eigenvalue of A then k is an eigenvalue of Ak .
(b) What is wrong with this proof generalizing that? If is an eigenvalue of A
and is an eigenvalue for B, then is an eigenvalue for AB, for, if A~x = ~x and
B~x = ~x then AB~x = A~x = A~x = ~x?
3.41 Do matrix equivalent matrices have the same eigenvalues?
3.42 Show that a square matrix with real entries and an odd number of rows has at
least one real eigenvalue.
372
3.43 Diagonalize.
1
2
3
2
2
6
2
2
6
3.44 Suppose that P is a nonsingular n n matrix. Show that the similarity

transformation map tP : Mnn Mnn sending T 7 PT P1 is an isomorphism.
? 3.45 [Math. Mag., Nov. 1967] Show that if A is an n square matrix and each row
(column) sums to c then c is a characteristic root of A. (Characteristic root is a
synonym for eigenvalue.)
Section III. Nilpotence
III
373
Nilpotence
The goal of this chapter is to show that every square matrix is similar to one
that is a sum of two kinds of simple matrices. The prior section focused on the
first simple kind, diagonal matrices. We now consider the other.
III.1
Self-Composition
Because a linear transformation t : V V has the same domain as codomain,

we can find the composition of t with itself t2 = t t, and t3 = t t t, etc.
~v
t(~v )
t2 (~v )
Note that the superscript power notation tj for iterates of the transformations
dovetails with the notation that weve used for their square matrix representations
because if RepB,B (t) = T then RepB,B (tj ) = T j .
1.1 Example For the derivative map d/dx : P3 P3 given by
d/dx
a + bx + cx2 + dx3 7 b + 2cx + 3dx2

the second power is the second derivative
d2 /dx2
a + bx + cx2 + dx3 7 2c + 6dx

the third power is the third derivative
d3 /dx3
a + bx + cx2 + dx3 7 6d
and any higher power is the zero map.
1.2 Example This transformation of the space of 22 matrices
!
!
a b
b a
t
7
c d
d 0
has this second power
a
c
b
d
t2
a
0
b
0
More information on function iteration is in the appendix.
374
and this third power.

a
c
b
d
t3
b
0
a
0
After that, t4 = t2 and t5 = t3 , etc.

1.3 Example Consider the shift transformation t : C3 C3 .

0
x
t
y 7 x
z
y
We have that

x
0
0
0
t t t
y 7 x 7 0 7 0
z
y
x
0
so the range spaces descend to the trivial subspace.

0
0
0

2
3
R(t) = { a a, b C } R(t ) = { 0 c C } R(t ) = { 0 }
b
c
0
These examples suggest that after some number of iterations the map settles
down.
1.4 Lemma For any transformation t : V V, the range spaces of the powers
form a descending chain
V R(t) R(t2 )
and the null spaces form an ascending chain.
{~0 } N (t) N (t2 )
Further, there is a k such that for powers less than k the subsets are proper so that
if j < k then R(tj ) R(tj+1 ) and N (tj ) N (tj+1 ) while for higher powers the
sets are equal, that is, if j > k then R(tj ) = R(tj+1 ) and N (tj ) = N (tj+1 )).
Proof First recall that for any map the dimension of its range space plus
the dimension of its null space equals the dimension of its domain, So if the
dimensions of the range spaces shrink then the dimensions of the null spaces must
grow. We will do the range space half here and leave the rest for Exercise 14.
We start by showing that the range spaces form a chain. If w
~ R(tj+1 ), so
j+1
j
j
that w
~ = t (~v), then w
~ = t ( t(~v) ). Thus w
~ R(t ).
Next we verify the further property: while the subsets in the chain of
range spaces may be proper for a while, from some power k onward the range
spaces are equal. We first show that if any pair of adjacent range spaces in
the chain are equal R(tk ) = R(tk+1 ) then all subsequent ones are also equal
375
R(tk+1 ) = R(tk+2 ), etc. This holds because t : R(tk+1 ) R(tk+2 ) is the same
map, with the same domain, as t : R(tk ) R(tk+1 ) and it therefore has the
same range R(tk+1 ) = R(tk+2 ) (it holds for all higher powers by induction). So
if the chain of range spaces ever stops strictly decreasing then from that point
onward it is stable.
We end by showing that the chain must eventually stop decreasing. Each
range space is a subspace of the one before it. For it to be a proper subspace it
must be of strictly lower dimension (see Exercise 12). These spaces are finitedimensional and so the chain can fall for only finitely-many steps, that is, the
power k is at most the dimension of V.
QED
d/dx
1.5 Example The derivative map a + bx + cx2 + dx3 7 b + 2cx + 3dx2 on P3

has this chain of range spaces
R(t0 ) = P3 R(t1 ) = P2 R(t2 ) = P1 R(t3 ) = P0 R(t4 ) = {~0 }
(all later elements of the chain are the trivial space). And it has this chain of
null spaces
N (t0 ) = {~0 } N (t1 ) = P0 N (t2 ) = P1 N (t3 ) = P2 N (t4 ) = P3
(later elements are the entire space).
1.6 Example Let t : P2 P2 be the map c0 + c1 x + c2 x2 7 2c0 + c2 x. As the
lemma describes, on iteration the range space shrinks

R(t0 ) = P2 R(t) = {a + bx a, b C} R(t2 ) = { a a C }
and then stabilizes R(t2 ) = R(t3 ) = while the null space grows

N (t0 ) = {0 } N (t) = {cx c C} N (t2 ) = {cx + d c, d C }
and then stabilizes N (t2 ) = N (t3 ) = .
1.7 Example The transformation : C3 C3 projecting onto the first two coordinates

c1
c1

c
2
c2
c3
0
has C3 R() = R(2 ) = and {~0 } N () = N (2 ) = where this is
the range space and the null space.

a
0

R() = { b a, b C}
N () = { 0 c C}
0
c
1.8 Definition Let t be a transformation on an n-dimensional space. The generalized range space (or the closure of the range space) is R (t) = R(tn ) The
generalized null space (or the closure of the null space) is N (t) = N (tn ).
376
This graph illustrates. The horizontal axis gives the power j of a transformation. The vertical axis gives the dimension of the range space of tj as the
distance above zero, and thus also shows the dimension of the null space because
the two add to the dimension n of the domain.
n
nullity(tj )
dim(N (t))
rank(tj )
...
dim(R (t))
0
0 1 2
On iteration the rank falls and the nullity rises until there is some k such
that the map reaches a steady state R(tk ) = R(tk+1 ) = R (t) and N (tk ) =
N (tk+1 ) = N (t). This must happen by the n-th iterate.
Exercises
X 1.9 Give the chains of range spaces and null spaces for the zero and identity transformations.
X 1.10 For each map, give the chain of range spaces and the chain of null spaces, and
the generalized range space and the generalized null space.
(a) t0 : P2 P2 , a + bx + cx2 7 b + cx2
(b) t1 : R2 R2 ,

a
0
7
b
a
(c) t2 : P2 P2 , a + bx + cx2 7 b + cx + ax2
(d) t3 : R3 R3 ,

a
a
b 7 a
c
1.11 Prove that function composition is associative (t t) t = t (t t) and so we

can write t3 without specifying a grouping.
1.12 Check that a subspace must be of dimension less than or equal to the dimension
of its superspace. Check that if the subspace is proper (the subspace does not equal
the superspace) then the dimension is strictly less. (This is used in the proof of
Lemma 1.4.)
X 1.13 Prove that the generalized range space R (t) is the entire space, and the
generalized null space N (t) is trivial, if the transformation t is nonsingular. Is
this only if also?
1.14 Verify the null space half of Lemma 1.4.
X 1.15 Give an example of a transformation on a three dimensional space whose range
has dimension two. What is its null space? Iterate your example until the range
space and null space stabilize.
1.16 Show that the range space and null space of a linear transformation need not
be disjoint. Are they ever disjoint?
III.2
377
Strings
This subsection requires material from the optional Direct Sum subsection.
The prior subsection shows that as j increases, the dimensions of the R(tj )s
fall while the dimensions of the N (tj )s rise, in such a way that this rank and
nullity split between them the dimension of V. Can we say more; do the two
split a basis is V = R(tj ) N (tj )?
The answer is yes for the smallest power j = 0 since V = R(t0 ) N (t0 ) =
V {~0 }. The answer is also yes at the other extreme.
2.1 Lemma For any linear t : V V the function t : R (t) R (t) is one-toone.
Proof Let the dimension of V be n. Because R(tn ) = R(tn+1 ), the map
t : R (t) R (t) is a dimension-preserving homomorphism. Therefore, by

Theorem Two.II.2.21 it is one-to-one.
QED
2.2 Corollary Where t : V V is a linear transformation, the space is the direct
sum V = R (t)N (t). That is, both (1) dim(V) = dim(R (t))+dim(N (t))
and (2) R (t) N (t) = {~0 }.
Proof Let the dimension of V be n. We will verify the second sentence, which
is equivalent to the first. Clause (1) is true because any transformation satisfies
that its rank plus its nullity equals the dimension of the space, and in particular
this holds for the transformation tn . Thus we need only verify clause (2).
Assume that ~v R (t) N (t) to prove that ~v = ~0. Because ~v is in
the generalized null space, tn (~v) = ~0. On the other hand, by the lemma
t : R (t) R (t) is one-to-one, and a composition of one-to-one maps is oneto-one, so tn : R (t) R (t) is one-to-one. Only ~0 is sent by a one-to-one
linear map to ~0 so the fact that tn (~v) = ~0 implies that ~v = ~0.
QED
2.3 Remark Technically there is a difference between the map t : V V and the
map on the subspace t : R (t) R (t) if the generalized range space is not
equal to V, because the domains are different. The second is the restriction of
the first to R (t).
For powers between j = 0 and j = n, the space V might not be the direct
sum of R(tj ) and N (tj ). The next example shows that the two can have a
nontrivial intersection.
2.4 Example Consider the transformation of C2 defined by this action on the
elements of the standard basis.
!
!
!
!
!
1
0
0
0
0 0
n
n
7
7
N = RepE2 ,E2 (n) =
0
1
1
0
1 0
More information on map restrictions is in the appendix.
378
This is a shift map.

x
y
!
0
x
Another way to depict this maps action is with a string.

~e1 7 ~e2 7 ~0
The vector
~e2 =
0
1
is in both the range space and null space.

: C4 C4 whose action on E4 is given by the string
2.5 Example A map n
~e1 7 ~e2 7 ~e3 7 ~e4 7 ~0
has R(
n) N (
n) equal to the span [{~e4 }], has R(
n2 ) N (
n2 ) = [{~e3 , ~e4 }], and
3
3
has R(
n ) N (
n ) = [{~e4 }]. The matrix representation is all zeros except for
some subdiagonal ones.
0 0 0 0
1 0 0 0
= RepE ,E (
N
n
)
=
4
4
0 1 0 0
0 0 1 0
2.6 Example Transformations can act via more than one string. A transformation
~ 1, . . . ,
~ 5 i by
t acting on a basis B = h
~1
~ 2 7
~ 3 7 ~0
7
~
~
~0
4
7 5
7
is represented by a matrix that is all zeros except for blocks of subdiagonal ones
0 0 0 0 0
1 0 0 0 0
RepB,B (t) = 0 1 0 0 0
0 0 0 0 0
0 0 0 1 0
(the lines just visually organize the blocks).
In those examples all vectors are eventually transformed to zero.
2.7 Definition A nilpotent transformation is one with a power that is the zero
map. A nilpotent matrix is one with a power that is the zero matrix. In either
case, the least such power is the index of nilpotency.
2.8 Example In Example 2.4 the index of nilpotency is two. In Example 2.5 it is
four. In Example 2.6 it is three.
379
2.9 Example The differentiation map d/dx : P2 P2 is nilpotent of index three

since the third derivative of any quadratic polynomial is zero. This maps action
is described by the string x2 7 2x 7 2 7 0 and taking the basis B = hx2 , 2x, 2i
gives this representation.
0 0 0
RepB,B (d/dx) = 1 0 0
0 1 0
Not all nilpotent matrices are all zeros except for blocks of subdiagonal ones.
from Example 2.5, and this four-vector basis
2.10 Example With the matrix N

1
0
1
0
0 2 1 0

D = h , , , i
1 1 1 0
0
0
0
1
a change of basis operation produces this representation with respect to D, D.
1
0
1
0
0
2
1
0
1
1
1
0
0
0
0
1
0 0
1
0
0
0
1
0
0
0
0
1
0
1
0
0
0 1
0
0
0
2
1
0
1
1
1
0
1
0
1
3
0
=
2
0
1
2
0
2
1
1
1 0
5 0
3 0
2 0
The new matrix is nilpotent; its fourth power is the zero matrix. We could
verify this with a tedious computation, or we can observe that it is nilpotent
4.
since it is similar to the nilpotent matrix N
1 )4 = PNP
1 PNP
1 PNP
1 PNP
1 = PN
4 P1
(PNP
The goal of this subsection is to show that the prior example is prototypical
in that every nilpotent matrix is similar to one that is all zeros except for blocks
of subdiagonal ones.
2.11 Definition Let t be a nilpotent transformation on V. A t-string of length
k generated by ~v V is a sequence h~v, t(~v), . . . , tk1 (~v)i. A t-string basis is a
basis that is a concatenation of t-strings.
Note that the strings cannot form a basis under concatenation if they are
not disjoint because a basis cannot have a repeated vector.
~ 1,
~ 2,
~ 3 i and
2.12 Example In Example 2.6, we can concatenate the t-strings h
~ 4,
~ 5 i, of length three and two, to make a basis for the domain of t.
h
2.13 Lemma If a space has a basis of t-strings then the longest string in that
basis has length equal to the index of nilpotency of t.
380
Proof Suppose not. Those strings cannot be longer; if the index is k then
tk sends any vector including those starting the string to ~0. So suppose
instead that there is a transformation t of index k on some space, such that
the space has a t-string basis where all of the strings are shorter than length
k. Because t has index k, there is a vector ~v such that tk1 (~v) 6= ~0. Represent
~v as a linear combination of basis elements and apply tk1 . We are supposing
that tk1 sends each basis element to ~0 but that it does not send ~v to ~0. That
is impossible.
QED
We shall show that every nilpotent map has an associated string basis.
Looking for a counterexample, a nilpotent map without an associated string
basis that is disjoint, will suggest the idea for the proof. Consider the map
t : C5 C5 with this action.
~e1
~e2 7
~e3 7 ~0
~e4 7 ~e5 7 ~0
0
0
RepE5 ,E5 (t) = 1
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
These three strings arent disjoint. The first two strings ~e1 7 ~e3 7 ~0 and
~e1 7 ~e3 7 ~0 overlap, even after omitting ~0. But that doesnt mean that there
is no t-string basis; it only means that E5 is not one.
To find a basis we first find the number and lengths of its strings. Since ts
index of nilpotency is two, Lemma 2.13 says that at least one string in the basis
has length two. Thus the map must act on a string basis in one of these two
ways.
~1
7
~
3
7
~5
~2
7 ~0
~
4
7 ~0
~0
~1
~3
~4
~5
7
7
~ 2 7 ~0
~0
~0
~0
Now, the key point. A transformation with the left-hand action has a null space
of dimension three since thats how many basis vectors are mapped to zero. A
transformation with the right-hand action has a null space of dimension four.
Using the matrix representation above, calculation of ts null space
x
x

N (t) = { z x, z, r C }

0
r
shows that it is three-dimensional, meaning that we want the left-hand action.
381
~ 2 and
~ 4 from R(t) N (t)
To produce a string basis, first pick

0
0
0
0

~4 =
~2 =
0
1

0
0
1
0
~ 2,
~ 4 } is linearly independent).
(other choices are possible, just be sure that {
~
~ 2,
~ 4 }.
For 5 pick a vector from N (t) that is not in the span of {

1
1

~5 =
0

0
0
~ 1 and
~ 3 such that t(
~ 1) =
~ 2 and t(
~ 3) =
~ 4.
Finally, take

0
0
1
0

~1 =
~3 =
0
0

0
1
0
0
~ 1, . . . ,
~ 5 i, the matrix of t is as desired.
Now, with respect to B = h
0 0 0 0 0
1 0 0 0 0
RepB,B (t) = 0 0 0 0 0
0 0 1 0 0
0 0 0 0 0
2.14 Theorem Any nilpotent transformation t is associated with a t-string basis.
While the basis is not unique, the number and the length of the strings is
determined by t.
This illustrates the argument below, which describes three kinds of basis
vectors (we shown them in squares if they are in the null space and in circles if
they are not).
3k 7
3k 7
..
.
k
3 7
1k7
1k7
1k7 7 1k7 1 7 ~0
7
..
.
~0
~0
7 1k7 1 7 ~0
7 1k7 1
7 ~0
382
Proof Fix a vector space V. We will argue by induction on the index of
nilpotency. If the map t : V V has index of nilpotency 1 then it is the zero

~ 1 7 ~0, . . . ,
~ n 7 ~0.
map and any basis is a string basis
For the inductive step, assume that the theorem holds for any transformation
t : V V with an index of nilpotency between 1 and k 1 (with k > 1) and
consider the index k case.
Observe that the restriction of t to the range space t : R(t) R(t) is also
nilpotent, of index k 1. Apply the inductive hypothesis to get a string basis
for R(t), where the number and length of the strings is determined by t.
_
~ 1 , t(
~ 1 ), . . . , th1 (
~ 1 )i h
~ 2 , . . . , t h2 (
~ 2 )i h
~ i , . . . , t hi (
~ i )i
B = h
(In the illustration above these are the vectors of kind 1.)
Note that taking the final nonzero vector in each of these strings gives a basis
~ 1 ), . . . , thi (
~ i )i for the intersection R(t) N (t). This is because a
C = hth1 (
member of R(t) maps to zero if and only if it is a linear combination of those
basis vectors that map to zero. (The illustration shows these as 1s in squares.)
Now extend C to a basis for all of N (t).
= C _ h~1 , . . . , ~p i
C
is the
(In the illustration the ~s are the vectors of kind 2 and so the set C
~
set of all vectors in a square.) While which vectors we choose isnt uniquely
determined by t, what is uniquely determined is the number of them: it is the
dimension of N (t) minus the dimension of R(t) N (t).
_
is a basis for R(t) + N (t) because any sum of something in the
Finally, B C
range space with something in the null space can be represented using elements
for the part from the null space.
of B for the range space part and elements of C
Note that

dim R(t) + N (t) = dim(R(t)) + dim(N (t)) dim(R(t) N (t))
= rank(t) + nullity(t) i
= dim(V) i
_
to a basis for all of V by the addition of i more vectors,
and so we can extend B C
provided they are not linearly dependent on what we have already. Recall that
with vectors ~v1 , . . . ,~vi such that
~ 1, . . . ,
~ i is in R(t), and extend B_ C
each of
~ 1 , . . . , t(~vi ) =
~ i . (In the illustration these are the 3s.) The check
t(~v1 ) =
that this extension preserves linear independence is Exercise 30.
QED
2.15 Corollary Every nilpotent matrix is similar to a matrix that is all zeros except
for blocks of subdiagonal ones. That is, every nilpotent map is represented with
respect to some basis by such a matrix.
This form is unique in the sense that if a nilpotent matrix is similar to two
such matrices then those two simply have their blocks ordered differently. Thus
this is a canonical form for the similarity classes of nilpotent matrices provided
that we order the blocks, say, from longest to shortest.
383

1
1
M=
1
1
has an index of nilpotency of two, as this calculation shows.

Mp
power p
1
M=
M2 =
1
1
1
1
!
0 0
0 0
N (Mp )
!

{ x x C}
x
C2
The calculation also describes how a map m represented by M must act on any
string basis. With one map application the null space has dimension one and so
one vector of the basis maps to zero. On a second application, the null space has
dimension two and so the other basis vector maps to zero. Thus, the action of
~ 1 7
~ 2 7 ~0 and the canonical form of the matrix
the linear transformation is
is this.
!
0 0
1 0
We can exhibit such a m-string basis and the change of basis matrices
witnessing the matrix similarity. For the basis, take M to represent m with
respect to the standard bases. (We could take M to be a representative with
respect to some other basis but the standard basis is convenient.) Pick a
~ 2 N (m) and also pick a
~ 1 so that m(
~ 1) =
~ 2.
!
!
1
1
~2 =
~1 =
1
0
Recall the similarity diagram.
m
C2wrt E2 C2wrt E2
M
idyP
idyP
m
C2wrt B C2wrt B
The canonical form equals RepB,B (m) = PMP1 , where
!
1 1
1
P = RepB,E2 (id) =
P = (P1 )1 =
0 1
and the verification of the matrix calculation is routine.
!
!
!
!
1 1
1 1
1 1
0 0
=
0
1
1 1
0 1
1 0
1
0
1
1
384
0
1
0
1
0
0
1
1
0
0
0
0
0
1 1
0
0
1
1
0
0
0
1
is nilpotent.
Np
power p
0 0
0
1 0
0
1
1 1
0 1
0
1 0 1
0 0 0
0 0 0
1 0 0
1 0 0
0 0 0
0
0
1
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
zero matrix
N (Np )
0
0

{
u v u, v C}
u
v

0
y

{
z y, z, u, v C }

u
v
C5
That table shows that any string basis must satisfy: the null space after one
map application has dimension two so two basis vectors map directly to zero,
the null space after the second application has dimension four so two additional
basis vectors map to zero by the second iteration, and the null space after three
applications is of dimension five so the final basis vector maps to zero in three
hops.
~ 1 7
~ 2 7
~ 3 7 ~0
~ 4 7
~ 5 7 ~0
To produce such a basis, first pick two independent vectors from N (n)

0
0
0
0

~

~3 =
1
5 = 0

1
1
0
1
~ 2) =
~ 3 and n(
~ 4) =
~5
~ 2,
~ 4 N (n2 ) such that n(
then add

0
0
1
1

~

~2 =
0
4 = 0

0
1
0
0
385
~ 1 N (n3 ) = C5 such that n(

~ 1) =
~ 2.
and finish by adding

1
0

~1 =
1

0
0
Exercises
X 2.18 What is the index of nilpotency of the left-shift operator, here acting on the
space of triples of reals?
(x, y, z) 7 (0, x, y)
X 2.19 For each string basis state the index of nilpotency and give the dimension of
the range space and null space of each iteration of the nilpotent map.
~ 1 7
~ 2 7 ~0
(a)
~ 3 7
~ 4 7 ~0
~
~ 2 7
~ 3 7 ~0
(b) 1 7
~
~
4 7 0
~ 5 7 ~0
~ 6 7 ~0
~ 1 7
~ 2 7
~ 3 7 ~0
(c)
Also give the canonical form of the matrix.
2.20 Decide which of these matrices are nilpotent.

3 2 1
2 4
3 1
(a)
(b)
(c) 3 2 1
1 2
1 3
3 2 1
45 22 19
(e) 33 16 14
69 34 29
X 2.21 Find the canonical form of this matrix.
0 1 1 0 1
0 0 1 1 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1
(d) 3
5
1
0
2
4
1
7
X 2.22 Consider the matrix from Example 2.17.

(a) Use the action of the map on the string basis to give the canonical form.
(b) Find the change of basis matrices that bring the matrix to canonical form.
(c) Use the answer in the prior item to check the answer in the first item.
X 2.23 Each of these matrices is nilpotent.

0
0 0
1/2 1/2
(a)
(b) 0 1 1
1/2 1/2
0 1 1
Put each in canonical form.
1
(c) 1
1
1
0
1
1
1
1
2.24 Describe the effect of left or right multiplication by a matrix that is in the
canonical form for nilpotent matrices.
2.25 Is nilpotence invariant under similarity? That is, must a matrix similar to a
nilpotent matrix also be nilpotent? If so, with the same index?
386
X 2.26 Show that the only eigenvalue of a nilpotent matrix is zero.

2.27 Is there a nilpotent transformation of index three on a two-dimensional space?
2.28 In the proof of Theorem 2.14, why isnt the proofs base case that the index of
nilpotency is zero?
X 2.29 Let t : V V be a linear transformation and suppose ~v V is such that
tk (~v) = ~0 but tk1 (~v) 6= ~0. Consider the t-string h~v, t(~v), . . . , tk1 (~v)i.
(a) Prove that t is a transformation on the span of the set of vectors in the string,
that is, prove that t restricted to the span has a range that is a subset of the
span. We say that the span is a t-invariant subspace.
(b) Prove that the restriction is nilpotent.
(c) Prove that the t-string is linearly independent and so is a basis for its span.
(d) Represent the restriction map with respect to the t-string basis.
2.30 Finish the proof of Theorem 2.14.
2.31 Show that the terms nilpotent transformation and nilpotent matrix, as
given in Definition 2.7, fit with each other: a map is nilpotent if and only if it is
represented by a nilpotent matrix. (Is it that a transformation is nilpotent if an
only if there is a basis such that the maps representation with respect to that basis
is a nilpotent matrix, or that any representation is a nilpotent matrix?)
2.32 Let T be nilpotent of index four. How big can the range space of T 3 be?
2.33 Recall that similar matrices have the same eigenvalues. Show that the converse
does not hold.
2.34 Lemma 2.1 shows that any for any linear transformation t : V V the restriction
t : R (t) R (t) is one-to-one. Show that it is also onto, so it is an automorphism.
Must it be the identity map?
2.35 Prove that a nilpotent matrix is similar to one that is all zeros except for blocks
of super-diagonal ones.
X 2.36 Prove that if a transformation has the same range space as null space. then
the dimension of its domain is even.
2.37 Prove that if two nilpotent matrices commute then their product and sum are
also nilpotent.
2.38 Consider the transformation of Mnn given by tS (T ) = ST T S where S is an
nn matrix. Prove that if S is nilpotent then so is tS .
2.39 Show that if N is nilpotent then I N is invertible. Is that only if also?
Section IV. Jordan Form
IV
387
Jordan Form
This section uses material from three optional subsections: Direct Sum,
Determinants Exist, and Laplaces Expansion Formula.
The chapter on linear maps shows that every h : V W can be represented
by a partial identity matrix with respect to some bases B V and D W
that is, that the partial identity form is a canonical form for matrix equivalence.
This chapter considers the special case that the map is a linear transformation
t : V V. The general result still applies so we can get a partial identity with
respect to B, D, but with the codomain equal to the domain we naturally ask
what is possible when the two bases are also equal so that we have RepB,B (t)
we will find a canonical form for matrix similarity.
We began by noting that while a partial identity matrix is the canonical form
for the B, D case, in the B, B case there are some matrix similarity classes without
one. We therefore extended the forms of interest to the natural generalization,
diagonal matrices, and showed that the map or matrix can be diagonalized if its
eigenvalues are distinct. But we also gave an example of a matrix that cannot
be diagonalized (because it is nilpotent), and thus diagonal form wont do as
the canonical form for all matrices.
The prior section developed that example. We showed that a linear map is
nilpotent if and only if there is a basis on which it acts via disjoint strings. That
gave us a canonical form that applied to nilpotent matrices.
This section wraps up the chapter by showing that the two cases weve
studied are exhaustive in that for any linear transformation there is a basis such
that the matrix representation RepB,B (t) is the sum of a diagonal matrix and a
nilpotent matrix. This is Jordan canonical form.
IV.1
Polynomials of Maps and Matrices
Recall that the set of square matrices is a vector space under entry-by-entry
addition and scalar multiplication, and that this space Mnn has dimension n2 .
2
Thus, for any nn matrix T the n2 + 1-member set {I, T, T 2 , . . . , T n } is linearly
dependent and so there are scalars c0 , . . . , cn2 , not all zero, such that
2
cn2 T n + + c1 T + c0 I
is the zero matrix. That is, every transformation has a kind of generalized
nilpotency: the powers of a square matrix cannot climb forever without a
repeat.
1.1 Example Rotation of plane vectors /6 radians counterclockwise is represented
388
with respect to the standard basis by

T=
3/2
1/2
!
1/2
3/2
and verifying that 0T 4 + 0T 3 + 1T 2 2T 1I equals the zero matrix is easy.

1.2 Definition For any polynomial f(x) = cn xn + + c1 x + c0 , where t is a
linear transformation then f(t) is the transformation cn tn + + c1 t + c0 (id)
on the same space, and where T is a square matrix then f(T ) is the matrix
cn T n + + c1 T + c0 I.
The polynomial of the matrix represents the polynomial of the map: if T =
RepB,B (t) then f(T ) = RepB,B (f(t)). This is because T j = RepB,B (tj ), and
cT = RepB,B (ct), and T1 + T2 = RepB,B (t1 + t2 ).
1.3 Remark Most authors write the matrix polynomial slightly differently than the
map polynomial. For instance, if f(x) = x 3 then most authors explicitly write
the identity matrix f(T ) = T 3I but dont write the identity map f(t) = t 3.
We shall follow this convention.
Consider again Example 1.1. Although T M22 , which is a dimension four
space, we exhibited a polynomial of T that gave the zero matrix and was of
degree less than four. So for any particular map or matrix, degree n2 will suffice
but there may be a smaller degree polynomial that works.
1.4 Definition The minimal polynomial m(x) of a transformation t or a square
matrix T is the polynomial of least degree and with leading coefficient one such
that m(t) is the zero map or m(T ) is the zero matrix.
The fact that leading coefficient must be one keeps a minimal polynomial from
being the zero polynomial. That is, a minimal polynomial must have degree at
least one. Thus, the zero matrix has minimal polynomial p(x) = x while the
(x) = x 1.
identity matrix has minimal polynomial p
1.5 Lemma Any transformation or square matrix has a unique minimal polynomial.
Proof We first show existence. The earlier observation that degree n2 suffices
shows that there is at least one nonzero polynomial p(x) = ck xk + + c0 that

takes the map or matrix to zero (p is not the zero polynomial because the earlier
observation includes that at least one of the coefficients is nonzero). From among
all nonzero polynomials taking the map or matrix to zero, there must be at least
one of minimal degree. Divide this p by ck to get a leading one. Thus for any
map or matrix a minimal polynomial exists.
We now show uniqueness. Suppose that m(x) and m(x)

both take the map
or matrix to zero, are both of minimal degree and are thus of equal degree, and
389
both have a leading one. In their difference d(x) = m(x) m(x)

the leading
If d were to have a
terms cancel. So d is of smaller degree than m and m.
leading coefficent that is nonzero then we could divide by it to get a polynomial
that takes the map or matrix to zero and has leading coefficient one. This
as of minimal degree. Thus the leading
would contradict the choice of m and m
coefficient of d is zero, so m(x) m(x)

is the zero polynomial, and so the two
are equal.
QED
1.6 Example We can see that m(x) = x2 2x 1 is minimal for the matrix of
Example 1.1 by computing the powers of T up to the power n2 = 4.
!
!
!
1/2 3/2
0 1
1/2 3/2
2
3
4
T =
T =
T =
3/2
1/2
1
0
3/2
1/2
Put c4 T 4 + c3 T 3 + c2 T 2 + c1 T + c0 I equal to the zero matrix
(1/2)c4
+ (1/2)c2 + ( 3/2)c1 + c0 = 0
( 3/2)c4 c3 ( 3/2)c2 (1/2)c1

=0
=0
( 3/2)c4 + c3 + ( 3/2)c2 + (1/2)c1
(1/2)c4
+ (1/2)c2 + ( 3/2)c1 + c0 = 0
and use Gauss Method.
c4
c
2
c3 + 3c2 +
3c1 2c0 = 0
2c1 + 3c0 = 0
Setting c4 , c3 , and c2 to zero forces c1 and c0 to also come out as zero. To get
a leading one, the most we can do is to set c4 and c3 to zero. Thus the minimal
polynomial is quadratic.
Using the method of that example to find the minimal polynomial of a 33
matrix would be tedious because it would mean doing Gaussian reduction on a
system with nine equations in ten unknowns. We shall develop an alternative.
1.7 Lemma Suppose that the polynomial f(x) = cn xn + + c1 x + c0 factors
as k(x 1 )q1 (x z )qz . If t is a linear transformation then these two are
equal maps.
cn tn + + c1 t + c0 = k (t 1 )q1 (t z )qz
Consequently, if T is a square matrix then f(T ) and k (T 1 I)q1 (T z I)qz
are equal matrices.
Proof We use induction on the degree of the polynomial. The cases where
the polynomial is of degree zero and degree one are clear. The full induction
argument is Exercise 1.7 but we will give its sense with the degree two case.
A quadratic polynomial factors into two linear terms f(x) = k(x 1 ) (x
2 ) = k(x2 + (1 + 2 )x + 1 2 ) (the roots 1 and 2 could be equal). We can
390
check that substituting t for x in the factored and unfactored versions gives the
same map.

k (t 1 ) (t 2 ) (~v) = k (t 1 ) (t(~v) 2~v)
= k t(t(~v)) t(2~v) 1 t(~v) 1 2~v

= k t t (~v) (1 + 2 )t(~v) + 1 2~v
= k (t2 (1 + 2 )t + 1 2 ) (~v)
The third equality holds because the scalar 2 comes out of the second term,
since t is linear.
QED
In particular, if a minimal polynomial m(x) for a transformation t factors
as m(x) = (x 1 )q1 (x z )qz then m(t) = (t 1 )q1 (t z )qz is
the zero map. Since m(t) sends every vector to zero, at least one of the maps
t i sends some nonzero vectors to zero. Exactly the same holds in the matrix
case if m is minimal for T then m(T ) = (T 1 I)q1 (T z I)qz is the zero
matrix and at least one of the matrices T i I sends some nonzero vectors to
zero. That is, in both cases at least some of the i are eigenvalues. (Exercise 29
expands on this.)
The next result is that every root of the minimal polynomial is an eigenvalue,
and further that every eigenvalue is a root of the minimal polynomial (i.e, below
it says 1 6 qi and not just 0 6 qi ). For that result, recall that to find
eigenvalues we solve |T xI| = 0 and this determinant gives a polynomial in x,
called the characteristic polynomial, whose roots are the eigenvalues.
1.8 Theorem (Cayley-Hamilton) If the characteristic polynomial of a transformation or square matrix factors into
k (x 1 )p1 (x 2 )p2 (x z )pz
then its minimal polynomial factors into
(x 1 )q1 (x 2 )q2 (x z )qz
where 1 6 qi 6 pi for each i between 1 and z.
The proof takes up the next three lemmas. We will state them in matrix terms
but they apply equally well to maps. (The matrix version is convenient for the
first proof.)
The first result is the key. For the proof, observe that we can view a matrix
of polynomials as a polynomial with matrix coefficients.
2x2 + 3x 1
3x2 + 4x + 1
x2 + 2
2
4x + x + 1
!
=
2
3
!
1 2
x +
4
3
4
!
0
x+
1
1
1
2
1
391
1.9 Lemma If T is a square matrix with characteristic polynomial c(x) then c(T )
is the zero matrix.
Proof Let C be T xI, the matrix whose determinant is the characteristic
polynomial c(x) = cn xn + + c1 x + c0 .
t1,1 x
t1,2
...
t
t
x
2,1
2,2
C=
..
..
.
.
tn,n x
Recall Theorem Four.III.1.9, that the product of a matrix with its adjoint equals
the determinant of the matrix times the identity.
c(x) I = adj(C)C = adj(C)(T xI) = adj(C)T adj(C) x
()
The left side of () is cn Ixn +cn1 Ixn1 + +c1 Ix+c0 I. For the right side, the
entries of adj(C) are polynomials, each of degree at most n 1 since the minors
of a matrix drop a row and column. As suggested before the proof, rewrite it
as a polynomial with matrix coefficients: adj(C) = Cn1 xn1 + + C1 x + C0
where each Ci is a matrix of scalars. Now this is the right side of ().
[(Cn1 T )xn1 + + (C1 T )x + C0 T ] [Cn1 xn Cn2 xn1 C0 x]
Equate the left and right side of ()s coefficients of xn , of xn1 , etc.
cn I = Cn1
cn1 I = Cn2 + Cn1 T
..
.
c1 I = C0 + C1 T
c0 I = C 0 T
Multiply, from the right, both sides of the first equation by T n , both sides of
the second equation by T n1 , etc.
cn T n = Cn1 T n
cn1 T n1 = Cn2 T n1 + Cn1 T n
..
.
c1 T = C0 T + C1 T 2
c0 I = C 0 T
Add. The left is cn T n + cn1 T n1 + + c0 I. The right telescopes; for instance
Cn1 T n from the first line combines with the +Cn1 T n half of the second
line, and the total on the right is the zero matrix.
QED
392
We refer to that result by saying that a matrix or map satisfies its characteristic polynomial.
1.10 Lemma Where f(x) is a polynomial, if f(T ) is the zero matrix then f(x)
is divisible by the minimal polynomial of T . That is, any polynomial that is
satisfied by T is divisible by T s minimal polynomial.
Proof Let m(x) be minimal for T . The Division Theorem for Polynomials gives
f(x) = q(x)m(x) + r(x) where the degree of r is strictly less than the degree of
m. Plugging in T shows that r(T ) is the zero matrix, because T satisfies both f
and m. That contradicts the minimality of m unless r is the zero polynomial.
QED
Combining the prior two lemmas gives that the minimal polynomial divides
the characteristic polynomial. Thus, any root of the minimal polynomial is
also a root of the characteristic polynomial. That is, so far we have that if
m(x) = (x1 )q1 (xi )qi then c(x) has the form (x1 )p1 (xi )pi (x
i+1 )pi+1 (x z )pz where each qj is less than or equal to pj . We finish
the proof of the Cayley-Hamilton Theorem by showing that the characteristic
polynomial has no additional roots, that is, there are no i+1 , i+2 , etc.
1.11 Lemma Each linear factor of the characteristic polynomial of a square matrix
is also a linear factor of the minimal polynomial.
Proof Let T be a square matrix with minimal polynomial m(x) and assume
that x is a factor of the characteristic polynomial of T , that is an eigenvalue

of T . We must show that x is a factor of m, i.e., that m() = 0.
Suppose that is an eigenvalue of T with associated eigenvector ~v. Then
T 2 has the eigenvalue 2 associated with ~v because T T~v = T ~v = T~v = 2~v.
Similarly T k has the eigenvalue n associated with ~v.
With that we have that for any polynomial function p(x), application of the
matrix p(T ) to ~v equals the result of multiplying ~v by the scalar p().
p(T ) ~v = (ck T k + + c1 T + c0 I) ~v = ck T k~v + + c1 T~v + c0~v
= ck k~v + + c1 ~v + c0~v = p() ~v
Since m(T ) is the zero matrix, ~0 = m(T )(~v) = m() ~v for all ~v, and hence
m() = 0.
QED
That concludes the proof of the Cayley-Hamilton Theorem.
1.12 Example We can use the Cayley-Hamilton Theorem to find the minimal
polynomial of this matrix.
2 0 0
1
1 2 0
2
T =
0 0 2 1
0 0 0
1
393
First we find its characteristic polynomial c(x) = (x 1)(x 2)3 with the
usual determinant. Now the Cayley-Hamilton Theorem says that T s minimal
polynomial is either (x 1)(x 2) or (x 1)(x 2)2 or (x 1)(x 2)3 . We can
decide among the choices just by computing
1 0 0
1
0 0 0
1
0 0 0 0
1 1 0
2
2
1 0 0
1 0 0 1
(T 1I)(T 2I) =
0 0 1 1 0 0 0 1 0 0 0 0
0 0 0
0
0 0 0 1
0 0 0 0
and
0
1
(T 1I)(T 2I)2 =
0
0
0
0
0
0
0
0
1 1
0 0
0
0
0
0
0
0

0
0
1
0
2 0
=
0 1 0
0
0 1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
and so m(x) = (x 1)(x 2)2 .

Exercises
X 1.13 What are the possible minimal polynomials if a matrix has the given characteristic polynomial?
(a) 8 (x 3)4
(b) (1/3) (x + 1)3 (x 4)
(c) 1 (x 2)2 (x 5)2
(d) 5 (x + 3)2 (x 1)(x 2)2
What is the degree of each possibility?
X 1.14 Find the minimal polynomial of each matrix.
3 0 0
3 0 0
3 0
(a) 1 3 0
(b) 1 3 0
(c) 1 3
0 0 4
0 0 3
0 1
1
4
0 0
0
0
2 2 1
3
0 0
0
(e) 0 6 2
(f) 0 4 1 0
0
3 9 4 2 1
0 0 2
1
5
4 1
4
1.15 Find the minimal polynomial of this matrix.
0 1 0
0 0 1
1 0 0
0
0
3
2
(d) 0
0
0
6
0
1
2
2
X 1.16 What is the minimal polynomial of the differentiation operator d/dx on Pn ?

X 1.17 Find the minimal polynomial of
0
1
0 1
matrices of this form
0 ...
0
0
0
..
0
...
where the scalar is fixed (i.e., is not a variable).
394
X
X
1.18 What is the minimal polynomial of the transformation of Pn that sends p(x)
to p(x + 1)?
1.19 What is the minimal polynomial of the map : C3 C3 projecting onto the
first two coordinates?
1.20 Find a 33 matrix whose minimal polynomial is x2 .
1.21 What is wrong with this claimed proof of Lemma 1.9: if c(x) = |T xI| then
c(T ) = |T T I| = 0? [Cullen]
1.22 Verify Lemma 1.9 for 22 matrices by direct calculation.
1.23 Prove that the minimal polynomial of an nn matrix has degree at most n
(not n2 as a person might guess from this subsections opening). Verify that this
maximum, n, can happen.
1.24 Show that, on a nontrivial vector space, a linear transformation is nilpotent if
and only if its only eigenvalue is zero.
1.25 What is the minimal polynomial of a zero map or matrix? Of an identity map
or matrix?
1.26 Interpret the minimal polynomial of Example 1.1 geometrically.
1.27 What is the minimal polynomial of a diagonal matrix?
1.28 A projection is any transformation t such that t2 = t. (For instance, consider
the transformation of the plane R2 projecting each vector onto its first coordinate.
If we project twice then we get the same result as if we project just once.) What is
the minimal polynomial of a projection?
1.29 The first two items of this question are review.
(a) Prove that the composition of one-to-one maps is one-to-one.
(b) Prove that if a linear map is not one-to-one then at least one nonzero vector
from the domain maps to the zero vector in the codomain.
(c) Verify the statement, excerpted here, that precedes Theorem 1.8.
. . . if a minimal polynomial m(x) for a transformation t factors as
m(x) = (x 1 )q1 (x z )qz then m(t) = (t 1 )q1 (t z )qz
is the zero map. Since m(t) sends every vector to zero, at least one of
the maps t i sends some nonzero vectors to zero. . . . That is, . . .
at least some of the i are eigenvalues.
1.30 True or false: for a transformation on an n dimensional space, if the minimal

polynomial has degree n then the map is diagonalizable.
1.31 Let f(x) be a polynomial. Prove that if A and B are similar matrices then f(A)
is similar to f(B).
(a) Now show that similar matrices have the same characteristic polynomial.
(b) Show that similar matrices have the same minimal polynomial.
(c) Decide if these are similar.

1 3
4 1
2 3
1
1
1.32 (a) Show that a matrix is invertible if and only if the constant term in its
minimal polynomial is not 0.
(b) Show that if a square matrix T is not invertible then there is a nonzero matrix
S such that ST and T S both equal the zero matrix.
X 1.33 (a) Finish the proof of Lemma 1.7.
(b) Give an example to show that the result does not hold if t is not linear.
1.34 Any transformation or square matrix has a minimal polynomial. Does the
converse hold?
IV.2
395
Jordan Canonical Form
We are looking for a canonical form for matrix similarity. This subsection
completes this program by moving from the canonical form for the classes of
nilpotent matrices to the canonical form for all classes.
2.1 Lemma A linear transformation on a nontrivial vector space is nilpotent if
and only if its only eigenvalue is zero.
Proof Let the linear transformation be t : V V. If t is nilpotent then there
is an n such that tn is the zero map, so t satisfies the polynomial p(x) = xn =

(x 0)n . By Lemma 1.10 the minimal polynomial of t divides p, so the minimal
polynomial has only zero for a root. By Cayley-Hamilton, Theorem 1.8, the
characteristic polynomial has only zero for a root. Thus the only eigenvalue of t
is zero.
Conversely, if a transformation t on an n-dimensional space has only the
single eigenvalue of zero then its characteristic polynomial is xn . Lemma 1.9
says that a map satisfies its characteristic polynomial so tn is the zero map.
Thus t is nilpotent.
QED
~
The phrase nontrivial vector space is there because on a trivial space { 0 } the
only transformation is the zero map, which has no eigenvalues because there are
no associated nonzero eigenvectors.
2.2 Corollary The transformation t is nilpotent if and only if ts only eigenvalue
is .
Proof The transformation t is nilpotent if and only if t s only eigenvalue
is 0. That holds if and only if ts only eigenvalue is , because t(~v) = ~v if and

only if (t ) (~v) = 0 ~v.
QED
We already have the canonical form that we want for the case of nilpotent
matrices, that is, for each matrix whose only eigenvalue is zero. Corollary III.2.15
says that each such matrix is similar to one that is all zeroes except for blocks
of subdiagonal ones.
2.3 Lemma If the matrices T I and N are similar then T and N + I are also
similar, via the same change of basis matrices.
Proof With N = P(T I)P1 = PT P1 P(I)P1 we have N = PT P1
PP1 (I) since the diagonal matrix I commutes with anything, and so N =
PT P1 I. Therefore N + I = PT P1 .
QED
2.4 Example The characteristic polynomial of
!
2 1
T=
1
4
396
is (x 3)2 and so T has only the single eigenvalue 3. Thus for

!
1 1
T 3I =
1
1
the only eigenvalue is 0 and T 3I is nilpotent. Finding the null spaces is routine;
to ease this computation we take T to represent a transformation t : C2 C2
with respect to the standard basis (we shall do this for the rest of the chapter).
!
y
N (t 3) = {
y C}
N ((t 3)2 ) = C2
y
The dimensions of these null spaces show that the action of the map t 3 on a
~ 1 7
~ 2 7 ~0. Thus, here is the canonical form for t 3 with one
string basis is
choice for a string basis.
!
!
!
0 0
1
2
RepB,B (t 3) = N =
B=h
,
i
1 0
1
2
By Lemma 2.3, T is similar to this matrix.
RepB,B (t) = N + 3I =
3
1
0
3
We can produce the similarity computation. Recall how to find the change of
basis matrices P and P1 to express N as P(T 3I)P1 . The similarity diagram
t3
C2wrt E2 C2wrt E2
T 3I
idyP
idyP
t3
C2wrt B C2wrt B
N
describes that to move from the lower left to the upper left we multiply by
!
1
1 2
1
P = RepE2 ,B (id)
= RepB,E2 (id) =
1
2
and to move from the upper right to the lower right we multiply by this matrix.
P=
1
1
2
2
!1
=
1/2
1/4
So this equation expresses the similarity.

!
!
3 0
1/2 1/2
2
=
1 3
1/4 1/4
1
1
4
1/2
1/4
1
1
2
2
397
2.5 Example This matrix has characteristic polynomial (x 4)4
4 1 0 1
0 3 0
1
T =
0 0 4
0
1 0 0
5
and so has the single eigenvalue 4. The nullities are: the null space of t 4 has
dimension two, the null space of (t 4)2 has dimension three, and the null space
of (t 4)3 has dimension four. Thus, t 4 has the action on a string basis of
~ 1 7
~ 2 7
~ 3 7 ~0 and
~ 4 7 ~0. This gives the canonical form N for t 4,
which in turn gives the form for t.
4 0 0 0
1 4 0 0
N + 4I =
0 1 4 0
0 0 0 4
An array that is all zeroes, except for some number down the diagonal and
blocks of subdiagonal ones, is a Jordan block. We have shown that Jordan block
matrices are canonical representatives of the similarity classes of single-eigenvalue
matrices.
2.6 Example The 33 matrices whose only eigenvalue is 1/2 separate into three
similarity classes. The three classes have these canonical representatives.
1/2
0
0
1/2
0
0
1/2
0
0
0
0
0
0 1/2
1 1/2
1 1/2
0
0 1/2
0
0 1/2
0
1 1/2
In particular, this matrix
1/2
0
0
0
1/2
1
0
1/2
belongs to the similarity class represented by the middle one, because we have
adopted the convention of ordering the blocks of subdiagonal ones from the
longest block to the shortest.
We will now finish the program of this chapter by extending this work to
cover maps and matrices with multiple eigenvalues. The best possibility for
general maps and matrices would be if we could break them into a part involving
their first eigenvalue 1 (which we represent using its Jordan block), a part with
2 , etc.
This best possibility is what happens. For any transformation t : V V, we
shall break the space V into the direct sum of a part on which t 1 is nilpotent,
a part on which t 2 is nilpotent, etc.
Suppose that t : V V is a linear transformation. The restriction of t to a
subspace M need not be a linear transformation on M because there may be an
More information on restrictions of functions is in the appendix.
398
m
~ M with t(m)
~ 6 M (for instance, the transformation that rotates the plane
by a quarter turn does not map most members of the x = y line subspace back
within that subspace). To ensure that the restriction of a transformation to a
part of a space is a transformation on the part we need the next condition.
2.7 Definition Let t : V V be a transformation. A subspace M is t invariant
if whenever m
~ M then t(m)
~ M (shorter: t(M) M).
Recall that Lemma III.1.4 shows that for any transformation t on an n dimensional space the rangespaces of iterates are stable
R(tn ) = R(tn+1 ) = = R (t)
as are the null spaces.
N (tn ) = N (tn+1 ) = = N (t)
Thus, the generalized null space N (t) and the generalized rangespace R (t)
are t invariant. In particular, N (t i ) and R (t i ) are t i invariant.
The action of the transformation t i on N (t i ) is especially easy to
understand. Observe that any transformation t is nilpotent on N (t), because if
~v N (t) then by definition tn (~v) = ~0. Thus t i is nilpotent on N (t i ).
We shall take three steps to prove this sections major result. The next result
is the first.
2.8 Lemma A subspace is t invariant if and only if it is t invariant for all
scalars . In particular, if i is an eigenvalue of a linear transformation t then
for any other eigenvalue j the spaces N (t i ) and R (t i ) are t j
invariant.
Proof For the first sentence we check the two implications separately. The
if half is easy: if the subspace is t invariant for all scalars then using
= 0 shows that it is t invariant. For only if suppose that the subspace is t
invariant, so that if m
~ M then t(m)
~ M, and let be a scalar. The subspace
M is closed under linear combinations and so if t(m)
~ M then t(m)
~ m
~ M.
Thus if m
~ M then (t ) (m)
~ M.
The second sentence follows from the first. The two spaces are ti invariant
so they are t invariant. Apply the first sentence again to conclude that they are
also t j invariant.
QED
The second step of the three that we will take to prove this sections major
result makes use of an additional property of N (t i ) and R (t i ), that
they are complementary. Recall that if a space is the direct sum of two others
V = N R then any vector ~v in the space breaks into two parts ~v = n
~ + ~r
where n
~ N and ~r R, and recall also that if BN and BR are bases for N
_
and R then the concatenation BN BR is linearly independent (and so the two
parts of ~v do not overlap). The next result says that for any subspaces N and
399
R that are complementary as well as t invariant, the action of t on ~v breaks into

the non-overlapping actions of t on n
~ and on ~r.
2.9 Lemma Let t : V V be a transformation and let N and R be t invariant
complementary subspaces of V. Then we can represent t by a matrix with blocks
of square submatrices T1 and T2
!
T1 Z2 } dim(N )-many rows
Z1
T2
} dim(R)-many rows
where Z1 and Z2 are blocks of zeroes.

Proof Since the two subspaces are complementary, the concatenation of a basis
for N and a basis for R makes a basis B = h~1 , . . . , ~p , ~1 , . . . , ~q i for V. We

shall show that the matrix
..
..
.
.
RepB,B (t) =
RepB (t(~1 )) RepB (t(~q ))
..
..
.
.
has the desired form.
Any vector ~v V is a member of N if and only if when it is represented
with respect to B its final q coefficients are zero. As N is t invariant, each of
the vectors RepB (t(~1 )), . . . , RepB (t(~p )) has this form. Hence the lower left
of RepB,B (t) is all zeroes. The argument for the upper right is similar. QED
To see that we have decomposed t into its action on the parts, let BN =
h~1 , . . . , ~p i and BR = h~1 , . . . , ~q i. Observe that the restrictions of t to the
subspaces N and R are represented with respect to the bases BN , BN and
BR , BR by the matrices T1 and T2 . So with subspaces that are invariant and
complementary we can split the problem of examining a linear transformation into two lower-dimensional subproblems. The next result illustrates this
decomposition into blocks.
2.10 Lemma If T is a matrix with square submatrices T1 and T2
!
T1 Z 2
T=
Z 1 T2
where the Zs are blocks of zeroes, then |T | = |T1 | |T2 |.
Proof Suppose that T is nn, that T1 is pp, and that T2 is qq. In the
permutation formula for the determinant

|T | =
X
permutations
t1,(1) t2,(2) tn,(n) sgn()
400
each term comes from a rearrangement of the column numbers 1, . . . , n into a

new order (1), . . . , (n). The upper right block Z2 is all zeroes, so if a has
at least one of p + 1, . . . , n among its first p column numbers (1), . . . , (p)
then the term arising from does not contribute to the sum because it is zero,
e.g., if (1) = n then t1,(1) t2,(2) . . . tn,(n) = 0 t2,(2) . . . tn,(n) = 0.
So the above formula reduces to a sum over all permutations with two
halves: any contributing is the composition of a 1 that rearranges only
1, . . . , p and a 2 that rearranges only p + 1, . . . , p + q. Now, the distributive
law and the fact that the signum of a composition is the product of the signums
gives that this
|T1 | |T2 | =

t1,1 (1) tp,1 (p) sgn(1 )
perms 1
of 1,...,p

tp+1,2 (p+1) tp+q,2 (p+q) sgn(2 )
perms 2
of p+1,...,p+q
equals |T | =
contributing t1,(1) t2,(2)
tn,(n) sgn().
QED
2.11 Example

2

1

0

0
0
2
0
0
0
0
3
0

0
0 2
=
0 1

3

0 3

2 0

0
= 36
3
From Lemma 2.10 we conclude that if two subspaces are complementary and
t invariant then t is one-to-one if and only if its restriction to each subspace is
nonsingular.
Now for the promised third, and final, step to the main result.
2.12 Lemma If a linear transformation t : V V has the characteristic polynomial
(x 1 )p1 . . . (x j )pj then (1) V = N (t 1 ) N (t j ) and
(2) dim(N (t i )) = pi .
Proof We start by proving that N (t i ) N (t j ) = {~0 } when i 6= j. This
shows that the bases for the generalized null spaces, when concatenated, form a
linearly independent subset of the space V. We will then show that clause (2)
holds because with that, since the degree p1 + + pk of the characteristic
polynomial equals the dimension of the space V, we will have proved clause (1)
also.
So consider N (t i ) N (t j ) when i 6= j. By Lemma 2.8 both
N (t i ) and N (t j ) are t invariant. The intersection of t invariant
subspaces is t invariant and so the restriction of t to N (t i ) N (t j )
is a linear transformation. Now, t i is nilpotent on N (t i ) and t j
is nilpotent on N (t j ), so both t i and t j are nilpotent on the
intersection. Therefore by Lemma 2.1 and the observation following it, if t has
401
any eigenvalues on the intersection then the only eigenvalue is both i and j .
This cannot be, so the restriction has no eigenvalues: N (t i ) N (t j )
is the trivial space (Lemma 3.12 shows that the only transformation that is
without any eigenvalues is the transformation on the trivial space).
To prove clause (2), decompose V as N (t i ) R (t i ) and apply
Lemma 2.9.
!
T1 Z2 } dim( N (t i ) )-many rows
T=
Z1 T2 } dim( R (t i ) )-many rows
Lemma 2.10 says that |T xI| = |T1 xI| |T2 xI|. By the uniqueness clause of
the Fundamental Theorem of Algebra, the determinants of the blocks have the
same factors as the characteristic polynomial |T1 xI| = (x 1 )q1 (x z )qz
and |T2 xI| = (x 1 )r1 (x z )rz , where q1 + r1 = p1 , . . . , qz + rz = pz .
Theorem I.1.11. We will finish by establishing that (i) qj = 0 for all j 6= i, and
(ii) qi = pi . Together these prove clause (2) because they show that the degree
of the polynomial |T1 xI| is qi , and the degree of that polynomial equals the
dimension of the generalized null space N (t i ).
For (i), because the restriction of t i to N (t i ) is nilpotent on that
space, ts only eigenvalue on that space is i , by Lemma 2.2. So qj = 0 for j 6= i.
For (ii), consider the restriction of t to R (t i ). By Lemma III.2.1, the
map t i is one-to-one on R (t i ) and so i is not an eigenvalue of t on
that subspace. Therefore x i is not a factor of |T2 xI|, so ri = 0, and so
qi = pi .
QED
Recall the goal of this chapter, to give a canonical form for matrix similarity.
That result is next. It translates the above steps into matrix terms.
2.13 Theorem Any square matrix is similar to one in Jordan form
J1
zeroes
J2
..
Jk1
zeroes
Jk
where each J is the Jordan block associated with an eigenvalue of the original matrix (that is, is all zeroes except for s down the diagonal and some
subdiagonal ones).
Proof Given an nn matrix T , consider the linear map t : Cn Cn that it
represents with respect to the standard bases. Use the prior lemma to write
Cn = N (t 1 ) N (t z ) where 1 , . . . , z are the eigenvalues of t.
Because each N (t i ) is t invariant, Lemma 2.9 and the prior lemma show
that t is represented by a matrix that is all zeroes except for square blocks along
the diagonal. To make those blocks into Jordan blocks, pick each Bi to be a
string basis for the action of t i on N (t i ).
QED
402
2.14 Corollary Every square matrix is similar to the sum of a diagonal matrix
and a nilpotent matrix.
Strictly speaking, to make Jordan form a canonical form for matrix similarity
classes it must be unique. That is, for any square matrix there needs to be one
and only one matrix J similar to it and of the specified form. As we have stated
it, the theorem allows us to rearrange the Jordan blocks. We could make this
form unique, say by arranging the Jordan blocks from the least eigenvalue to
greatest and arranging the blocks of subdiagonal ones inside each Jordan block
from longest to shortest.
2.15 Example This matrix has the characteristic polynomial (x 2)2 (x 6).
T = 0
0
0
6
0
2
2
We will handle the eigenvalues 2 and 6 separately.

First the eigenvalue 2. Computation of the powers of T 2I, and of the null
spaces and nullities, is routine. (Recall from Example 2.4 our convention of
taking T to represent a transformation t : C3 C3 with respect to the standard
basis.)
p
(T
2I)p
0 1
4 2
0 0
0 0
16 8
0 0
0
0
64 32
0
0
N ((t 2)p )

x

{ 0 x C }

0
{ z/2 x, z C }
nullity
same
same
So the generalized null space N (t 2) has dimension two. We know that the
restriction of t 2 is nilpotent on this subspace. From the way that the nullities
~ 1 7
~ 2 7 ~0. Thus
grow we know that the action of t 2 on a string basis is
we can represent the restriction in the canonical form

!
1
2
0 0

N2 =
= RepB,B (t 2)
B2 = h 1 , 0i
1 0
2
0
403
(other choices of basis are possible). Consequently, the action of the restriction
of t to N (t 2) is represented by this matrix.
!
2 0
J2 = N2 + 2I = RepB2 ,B2 (t) =
1 2
The second eigenvalues computations are easier. Because the power of x 6
in the characteristic polynomial is one, the restriction of t 6 to N (t 6) must
~ 3 7 ~0 and since
be nilpotent of index one. Its action on a string basis must be
it is the zero map, its canonical form N6 is the 11 zero matrix. Consequently,
the canonical form J6 for the action of t on N (t 6) is the 11 matrix with the
single entry 6. For the basis we can use any nonzero vector from the generalized
null space.

0

B6 = h1i
0
Taken together, these two give that the Jordan form of T is
2 0 0
RepB,B (t) = 1 2 0
0 0 6
where B is the concatenation of B2 and B6 .
2.16 Example Contrast the prior example with
2 2 1
T = 0 6 2
0 0 2
which has the same characteristic polynomial (x 2)2 (x 6).
While the characteristic polynomial is the same,
p
1
(T 6I)p
4 3
1
2
0 0
0 0 4
16 12 2
0 8
0
0
0 16
N ((t 6)p )
x

{
(4/3)x x C }
0
nullity
same
here the action of t 2 is stable after only one application the restriction of
t 2 to N (t 2) is nilpotent of index one. The restriction of t 2 to the
~ 1 7 ~0 and
~ 2 7 ~0, and we get
generalized null space acts on a string basis as
this Jordan block associated with the eigenvalue 2.
!
2 0
J2 =
0 2
404
So the contrast with the prior example is that while the characteristic
polynomial tells us to look at the action of t 2 on its generalized null space, the
characteristic polynomial does not completely describe t 2s action. We must
do some computations to find that the minimal polynomial is (x 2)(x 6).
For the eigenvalue 6 the arguments for the second eigenvalue of the prior
example apply again. The restriction of t 6 to N (t 6) is nilpotent of
index one (it cant be of index less than one and since x 6 is a factor of the
characteristic polynomial with the exponent one it cant be of index more than
one either). Thus t 6s canonical form N6 is the 11 zero matrix, and the
associated Jordan block J6 is the 11 matrix with entry 6.
RepB,B (t) = 0
0
0
2
0
0
6

1
0
2
_

B = B2 B6 = h0 , 1 , 4i
0
2
0
Checking that the third vector in B is in the null space of t 6 is routine.

2.17 Example A bit of computing with
1
4
0
3
T = 0 4
3 9
1
5
0
0
1
4
4
0
0
0
2
1
0
0
1
4
shows that its characteristic polynomial is (x 3)3 (x + 1)2 . This table
N ((t 3)p )
nullity

(u + v)/2
4
0
0
0
0
0
0
0
(u + v)/2

{
2
4 4
0
0 (u + v)/2 u, v C }
u
9 4 1 1
v
5
4
1
1

16
0 0 0
z
z
0
0 0 0

{
3
16
16 0 0
z z, u, v C }

u
32
16 0 0
16 16 0 0
v
64
0 0 0
0
0 0 0
same
same
64 64 0 0
128 64 0 0
64
64 0 0
(T 3I)p
p
4
0
3
1
16
0
16
0
64
0
64
0
shows that the restriction of t 3 to N (t 3) acts on a string basis via the

~ 1 7
~ 2 7 ~0 and
~ 3 7 ~0.
two strings
405
A similar calculation for the other eigenvalue

(T + 1I)p
0
4
0
0
4
0
0 4
0
3 9 4
1
5
4
0
16
0
0
16
0
0 16
0
8 40 16
8
24
16
0
0
3
1
0
0
0
8
8
N ((t + 1)p )
(u + v)
{ v u, v C }
nullity
same
same
24
shows that the restriction of t + 1 to its generalized null space acts on a string
~ 4 7 ~0 and
~ 5 7 ~0.
basis via the two separate strings
Therefore T is similar to this Jordan form matrix.
1
0 0 0 0
0 1 0 0 0
0 3 0 0
0
0
0 1 3 0
0
0 0 0 3
Exercises
2.18 Do the check for Example 2.4.
2.19 Each matrix is in Jordan form. State its characteristic polynomial and its
minimal polynomial.

2 0
0
3 0 0
3 0
1
0
(a)
(b)
(c) 1 2
(d) 1 3 0
0
1 3
0 1
0 0 1/2
0 1 3
3 0 0 0
4 0
0
0
5 0 0
1 3 0 0
1 4
0
0
(e)
(f)
(g) 0 2 0
0 0 3 0
0 0 4
0
0 0 3
0 0 1 3
0 0
1 4
5 0 0 0
5 0 0 0
0 2 0 0
0 2 0 0
(h)
(i)
0 0 2 0
0 1 2 0
0 0 0 3
0 0 0 3
X 2.20 Find the Jordan form from the given data.
(a) The matrix T is 55 with the single eigenvalue 3. The nullities of the powers
are: T 3I has nullity two, (T 3I)2 has nullity three, (T 3I)3 has nullity four,
and (T 3I)4 has nullity five.
406

(b) The matrix S is 55 with two eigenvalues. For the eigenvalue 2 the nullities
are: S 2I has nullity two, and (S 2I)2 has nullity four. For the eigenvalue 1
the nullities are: S + 1I has nullity one.
2.21 Find the change of basis matrices for each example.

(a) Example 2.15
(b) Example 2.16
(c) Example 2.17
X 2.22 Find the Jordan form and a Jordan basis
for eachmatrix.

4 0 0
5
4
3
10
4
5 4
(a)
(b)
(c) 2 1 3
(d) 1
0 3
25 10
9 7
5 0 4
1 2
1
7 1
2
2
9
7
3
2
2 1
1 4 1 1
(e) 9 7 4
(f) 1 1
(g)
1
2 1
5 1
4
4
4
1 2
2
1 1
2
8
X 2.23 Find all possible Jordan forms of a transformation with characteristic polynomial
(x 1)2 (x + 2)2 .
2.24 Find all possible Jordan forms of a transformation with characteristic polynomial
(x 1)3 (x + 2).
X 2.25 Find all possible Jordan forms of a transformation with characteristic polynomial
(x 2)3 (x + 1) and minimal polynomial (x 2)2 (x + 1).
2.26 Find all possible Jordan forms of a transformation with characteristic polynomial
(x 2)4 (x + 1) and minimal polynomial (x 2)2 (x + 1).
X 2.27 Diagonalize

these.

1 1
0 1
(a)
(b)
0 0
1 0
X 2.28 Find the Jordan matrix representing the differentiation operator on P3 .
X 2.29 Decide if these two are similar.

1 1
4 3

1
1

0
1
2.30 Find the Jordan form of this matrix.

0 1
1
0
Also give a Jordan basis.
2.31 How many similarity classes are there for 33 matrices whose only eigenvalues
are 3 and 4?
X 2.32 Prove that a matrix is diagonalizable if and only if its minimal polynomial has
only linear factors.
2.33 Give an example of a linear transformation on a vector space that has no
non-trivial invariant subspaces.
2.34 Show that a subspace is t 1 invariant if and only if it is t 2 invariant.
2.35 Prove or disprove: two nn matrices are similar if and only if they have the
same characteristic and minimal polynomials.
2.36 The trace of a square matrix is the sum of its diagonal entries.
(a) Find the formula for the characteristic polynomial of a 22 matrix.
(b) Show that trace is invariant under similarity, and so we can sensibly speak of
the trace of a map. (Hint: see the prior item.)
(c) Is trace invariant under matrix equivalence?
(d) Show that the trace of a map is the sum of its eigenvalues (counting multiplicities).
407
(e) Show that the trace of a nilpotent map is zero. Does the converse hold?
2.37 To use Definition 2.7 to check whether a subspace is t invariant, we seemingly
have to check all of the infinitely many vectors in a (nontrivial) subspace to see if
they satisfy the condition. Prove that a subspace is t invariant if and only if its
~ is in the subspace.
subbasis has the property that for all of its elements, t()
X 2.38 Is t invariance preserved under intersection? Under union? Complementation?
Sums of subspaces?
2.39 Give a way to order the Jordan blocks if some of the eigenvalues are complex
numbers. That is, suggest a reasonable ordering for the complex numbers.
2.40 Let Pj (R) be the vector space over the reals of degree j polynomials. Show
that if j 6 k then Pj (R) is an invariant subspace of Pk (R) under the differentiation
operator. In P7 (R), does any of P0 (R), . . . , P6 (R) have an invariant complement?
2.41 In Pn (R), the vector space (over the reals) of degree n polynomials,

E = { p(x) Pn (R) p(x) = p(x) for all x }
and

O = { p(x) Pn (R) p(x) = p(x) for all x }
are the even and the odd polynomials; p(x) = x2 is even while p(x) = x3 is odd.
Show that they are subspaces. Are they complementary? Are they invariant under
the differentiation transformation?
2.42 Lemma 2.9 says that if M and N are invariant complements then t has a
representation in the given block form (with respect to the same ending as starting
basis, of course). Does the implication reverse?
2.43 A matrix S is the square root of another T if S2 = T . Show that any nonsingular
matrix has a square root.
Topic
Method of Powers
In applications the matrices can be quite large. Calculating eigenvalues and
eigenvectors by finding and solving the characteristic polynomial can be too slow
and too hard. There are techniques that avoid the characteristic polynomial.
Here we shall see such a method that is suitable for large matrices that are
sparse, meaning that the great majority of the entries are zero.
Suppose that the nn matrix T has n distinct eigenvalues 1 , 2 , . . . , n .
Then Cn has a basis made of the associated eigenvectors h~1 , . . . , ~n i. For any
~v Cn , writing ~v = c1 ~1 + + cn ~n and iterating T on ~v gives these.
T~v = c1 1 ~1 + c2 2 ~2 + + cn n ~n
T 2~v = c1 21 ~1 + c2 22 ~2 + + cn 2n ~n
T 3~v = c1 31 ~1 + c2 32 ~2 + + cn 3n ~n
..
.
T k~v = c1 k1 ~1 + c2 k2 ~2 + + cn kn ~n
Assuming that |1 | is the largest and dividing through
k
k
T k~v
~1 + c2 2 ~2 + + cn n ~n
=
c
1
k1
k1
k1
shows that as k gets larger the fractions go to zero and so 1 s term will dominate
the expression. Thus, the entire expression has a limit of c1 ~1 .
Thus if c1 6= 0, as k increases the vectors T k~v will tend toward the direction
of the eigenvectors associated with the dominant eigenvalue, and consequently
the ratios k T k~v k/k T k1~v k will tend toward that dominant eigenvalue.
For example the eigenvalues of the matrix
T=
3
8
0
1
are 3 and 1. If for instance ~v has the components 1 and 1 then
Topic: Method of Powers

~v
1
1
T~v
!
3
7
409
T 2~v
!
9
17
T 9~v
19 683
39 367
T 10~v
!
59 049
118 097
and the ratio between the lengths of the last two is 2.999 9.
We shall note two implementation issues. First, instead of finding the powers
of T and applying them to ~v, we will compute ~v1 as T~v and then compute ~v2 as
T~v1 , etc. (that is, we do not separately calculate T 2, T 3, . . . ). We can quickly
do these matrix-vector products even if T is large, provided that it is sparse.
The second issue is that to avoid generating numbers that are so large that they
overflow our computers capability, we can normalize the ~vi s at each step. For
instance, we can divide each ~vi by its length (other possibilities are to divide it
by its largest component, or simply by its first component). We thus implement
this method by generating
w
~ 0 = ~v0 /k~v0 k
~v1 = T w
~0
w
~ 1 = ~v1 /k~v1 k
~v2 = T w
~2
..
.
w
~ k1 = ~vk1 /k~vk1 k
~vk = T w
~k
until we are satisfied. Then ~vk is an approximation of an eigenvector, and the
approximation of the dominant eigenvalue is the ratio k~vk k/k~
wk1 k.
One way that we could be satisfied is to iterate until our approximation of
the eigenvalue settles down. We could decide for instance to stop the iteration
process not after some fixed number of steps, but instead when k~vk k differs from
k~vk1 k by less than one percent, or when they agree up to the second significant
digit.
The rate of convergence is determined by the rate at which the powers of
|2 /1 | go to zero, where 2 is the eigenvalue of second largest norm. If that
ratio is much less than one then convergence is fast but if it is only slightly
less than one then convergence can be quite slow. Consequently, the method of
powers is not the most commonly used way of finding eigenvalues (although it is
the simplest one, which is why it is here). Instead, there are a variety of methods
that generally work by first replacing the given matrix T with another that is
similar to it and so has the same eigenvalues, but is in some reduced form such
as tridiagonal form, where the only nonzero entries are on the diagonal, or just
above or below it. Then special techniques can find the eigenvalues. Once we
know the eigenvalues then we can easily compute the eigenvectors of T . These
other methods are outside of our scope. A good reference is [Goult, et al.]
410
Exercises
1 Use ten iterations to estimate the largest eigenvalue of these matrices, starting
from the vector with components 1 and 2. Compare the answer with the one
obtained
solving the
equation.
by
characteristic

1 5
3 2
(a)
(b)
0 4
1 0
2 Redo the prior exercise by iterating until k~vk k k~vk1 k has absolute value less
than 0.01 At each step, normalize by dividing each vector by its length. How many
iterations does it take? Are the answers significantly different?
3 Use ten iterations to estimate the largest eigenvalue of these matrices, starting
from the vector with components 1, 2, and 3. Compare the answer with the one
obtained by solving the characteristic equation.
4 0 1
1
2
2
(a) 2 1 0
(b) 2
2
2
2 0 1
3 6 6
4 Redo the prior exercise by iterating until k~vk k k~vk1 k has absolute value less
than 0.01. At each step, normalize by dividing each vector by its length. How
many iterations does it take? Are the answers significantly different?
5 What happens if c1 = 0? That is, what happens if the initial vector does not to
have any component in the direction of the relevant eigenvector?
6 How can we adapt the method of powers to find the smallest eigenvalue?
Computer Code
This is the code for the computer algebra system Octave that did the calculation
above. (It has been lightly edited to remove blank lines, etc.)
>T=[3, 0;
8, -1]
T=
3
0
8 -1
>v0=[1; 2]
v0=
1
1
>v1=T*v0
v1=
3
7
>v2=T*v1
v2=
9
17
>T9=T**9
T9=
19683 0
39368 -1
>T10=T**10
T10=
59049 0
118096 1
>v9=T9*v0
v9=
19683
39367
>v10=T10*v0
v10=
59049
118096
>norm(v10)/norm(v9)
ans=2.9999
Topic: Method of Powers
411
Remark. This does not use the full power of Octave; it has built-in functions to
automatically apply sophisticated methods to find eigenvalues and eigenvectors.
Topic
Stable Populations
Imagine a reserve park with animals from a species that we are trying to protect.
The park doesnt have a fence and so animals cross the boundary, both from
the inside out and from the outside in. Every year, 10% of the animals from
inside of the park leave and 1% of the animals from the outside find their way in.
We can ask if there is a stable level: are there populations for the park and the
rest of the world that will stay constant over time, with the number of animals
leaving equal to the number of animals entering?
Let pn be the year n population in the park and let rn be the population in
the rest of the world.
pn+1 = .90pn + .01rn
rn+1 = .10pn + .99rn
We have this matrix equation.
pn+1
rn+1
!
=
.90
.10
!
!
.01
pn
.99
rn
The population will be stable if pn+1 = pn and rn+1 = rn so that the matrix
equation ~vn+1 = T~vn becomes ~v = T~v. We are therefore looking for eigenvectors
for T that are associated with the eigenvalue = 1. The equation ~0 = (IT )~v =
(I T )~v is
!
!
!
0.10
0.10
0.01
0.01
p
r
0
0
which gives the eigenspace: vectors with the restriction that p = .1r. For example,
if we start with a park population p = 10, 000 animals, so that the rest of the
world has r = 100 000 animals then every year ten percent of those inside will
leave the park (this is a thousand animals), and every year one percent of those
from the rest of the world will enter the park (also a thousand animals). It is
stable, self-sustaining.
Now imagine that we are trying to raise the total world population of this
species. For instance we can try to have the world population grow at a regular
rate of 1% per year. This would make the population level stable in some sense,
Topic: Stable Populations
413
although it is a dynamic stability in contrast to the static population level of

the = 1 case. The equation ~vn+1 = 1.01 ~vn = T~vn leads to ((1.01I T )~v = ~0,
which gives this system.
!
!
!
0.11 0.01
p
0
=
0.10
0.02
r
0
This matrix is nonsingular and so the only solution is p = 0, r = 0. Thus there is
no nontrivial initial population that would lead to a regular annual one percent
growth rate in p and r.
We can look for the rates that allow an initial population for the park that
results in a steady growth behavior. We consider ~v = T~v and solve for .

.9
.01

0=
= ( .9)( .99) (.10)(.01) = 2 1.89 + .89
.10
.99
We already know that = 1 is one solution of this characteristic equation and
finding that the other eigenvalue is 0.89 is routine. Thus there are two ways to
have a dynamically stable p and r (where the two grow at the same rate despite
the leaky park boundaries): have a world population that is does not grow or
shrink, and have a world population that shrinks by 11% every year.
This is one way to look at eigenvalues and eigenvectors they give a stable
state for a system. If the eigenvalue is one then the system is static. If the
eigenvalue isnt one then it is a dynamic stability, where the parts of the system
grow or shrink together.
Exercises
1 For the park discussed above, what should be the initial park population in the
case where the populations decline by 11% every year?
2 What will happen to the population of the park in the event of a growth in world
population of 1% per year? Will it lag the world growth, or lead it? Assume
that the initial park population is ten thousand, and the world population is one
hundred thousand, and calculate over a ten year span.
3 The park discussed above is partially fenced so that now, every year, only 5% of
the animals from inside of the park leave (still, about 1% of the animals from the
outside find their way in). Under what conditions can the park maintain a stable
population now?
4 Suppose that a species of bird only lives in Canada, the United States, or in Mexico.
Every year, 4% of the Canadian birds travel to the US, and 1% of them travel to
Mexico. Every year, 6% of the US birds travel to Canada, and 4% go to Mexico.
From Mexico, every year 10% travel to the US, and 0% go to Canada.
(a) Give the transition matrix.
(b) Is there a way for the three countries to have constant populations?
(c) Find all stable situations.
Topic
Page Ranking
Imagine that you are looking for the best book on Linear Algebra. You probably
would try a web search engine such as Google. These lists pages ranked by importance. The ranking is defined, as Googles founders have said in [Brin & Page],
that a page is important if other important pages link to it: a page can have
a high PageRank if there are many pages that point to it, or if there are some
pages that point to it and have a high PageRank. But isnt that circular
how can they tell whether a page is important without first deciding on the
important pages? With eigenvalues and eigenvectors.
We will present a simplified version of the Page Rank algorithm. For that
we will model the World Wide Web as a collection of pages connected by links.
This diagram, from [Wills], shows the pages as circles, and the links as arrows;
for instance, page p1 has a link to page p2 .
p1
p2
p4
p3
The key idea is that pages that should be highly ranked if they are cited often
by other pages. That is, we raise the importance of a page pi if it is linked-to
from page pj . The increment depends on the importance of the linking page pj
divided by how many out-links aj are on that page.
X
I(pj )
I(pi ) =
aj
in-linking pages pj
This matrix stores the information.
0 0
1 0
0 1
0 0
1/3
1/3
0
1/3
0
0
0
0
Topic: Page Ranking
415
The algorithms inventors describe a way to think about that matrix.

PageRank can be thought of as a model of user behavior. We
assume there is a random surfer who is given a web page at random
and keeps clicking on links, never hitting back . . . The probability
that the random surfer visits a page is its PageRank. [Brin & Page]
In the diagram, a surfer on page p3 has a probability 1/3 of going next to each
of the other pages.
That leads us to the problem of page p4 . Many targets of links are dangling
or sink links, without any outbound links. (For instance, a page may link to an
image.) The simplest way to model what could happen next is to imagine that
when the surfer gets to a page like this then they go to a next page entirely at
random.
0 0 1/3 1/4
1 0 1/3 1/4
H=
0 1
0
1/4
0 0 1/3 1/4
We will find vector ~I whose components are the importance rankings of each
page I(pi ). With this notation, our requirements for the page rank are that
H~I = ~I. That is, we want an eigenvector of the matrix associated with the
eigenvalue = 1.
Here is Sages calculation of the eigenvectors (slightly edited to fit on the
page).
sage: H=matrix([[0,0,1/3,1/4], [1,0,1/3,1/4], [0,1,0,1/4], [0,0,1/3,1/4]])
sage: H.eigenvectors_right()
[(1, [
(1, 2, 9/4, 1)
], 1), (0, [
(0, 1, 3, -4)
], 1), (-0.3750000000000000? - 0.4389855730355308?*I,
[(1, -0.1250000000000000? + 1.316956719106593?*I,
-1.875000000000000? - 1.316956719106593?*I, 1)], 1),
(-0.3750000000000000? + 0.4389855730355308?*I,
[(1, -0.1250000000000000? - 1.316956719106593?*I,
-1.875000000000000? + 1.316956719106593?*I, 1)], 1)]
The eigenvector that Sage gives associated with the eigenvalue = 1 is this.
1
2
9/4
1
Of course, there are many vectors in that eigenspace. To get a page rank number
we normalize to length one.
sage: v=vector([1, 2, 9/4, 1])
sage: v/v.norm()
(4/177*sqrt(177), 8/177*sqrt(177), 3/59*sqrt(177), 4/177*sqrt(177))
sage: w=v/v.norm()
sage: w.n()
(0.300658411201132, 0.601316822402263, 0.676481425202546, 0.300658411201132)
416
So we rank the first and fourth pages as of equal importance. We rank the
second and third pages as much more important than those, and about equal in
importance as each other.
Well add one more refinement. We will allow the surfer to pick a new
page at random even if they are not on a dangling page. Let this happen with
probability .
0 0 1/3 1/4
1/4 1/4 1/4 1/4
1 0 1/3 1/4
1/4 1/4 1/4 1/4
G=
+ (1 )
0 1
1/4 1/4 1/4 1/4
0
1/4
0 0 1/3 1/4
1/4 1/4 1/4 1/4
This is the Google matrix .
In practice is typically between 0.85 and 0.99. Here are the ranks for the
four pages with a spread of s.
p1
p2
p3
p4
0.85
0.325
0.602
0.652
0.325
0.90
0.317
0.602
0.661
0.317
0.95
0.309
0.602
0.669
0.309
0.99
0.302
0.601
0.675
0.302
The details of the algorithms used by commercial search engines are secret, no doubt have many refinements, and also change frequently. But the
inventors of Google were gracious enough to outline the basis for their work in
[Brin & Page]. A more current source is [Wikipedia Google Page Rank]. Two
additional excellent expositions are [Wills] and [Austin].
Exercises
1 A square matrix is stochastic if the sum of the entries in each column is one. The
Google matrix is computed by taking a combination G = H + (1 ) S of two
stochastic matrices. Show that G must be stochastic.
2 For this web of pages, the importance of each page should be equal. Verify it for
= 0.85.
p1
p2
p4
p3
3 [Bryan & Leise] Give the importance ranking for this web of pages.
p1
p2
p4
p3
Topic: Page Ranking
417
(a) Use = 0.85.

(b) Use = 0.95.
(c) Observe that while p3 is linked-to from all other pages, and therefore seems
important, it is not the highest ranked page. What is the highest ranked page?
Explain.
Topic
Linear Recurrences
In 1202 Leonardo of Pisa, known as Fibonacci, posed this problem.
A certain man put a pair of rabbits in a place surrounded on all sides
by a wall. How many pairs of rabbits can be produced from that
pair in a year if it is supposed that every month each pair begets a
new pair which from the second month on becomes productive?
This moves past an elementary exponential growth model for populations to
include the fact that there is an initial period where newborns are not fertile.
However, it retains other simplifying assumptions such as that there is no
gestation period and no mortality.
To get next months total number of pairs we add the number of pairs alive
this month to the number of pairs that will be newly born next month. The
latter number is the number of pairs of parents that will be productive next
month, which is the number that next month will have been alive for at least
two months, and that is the number that were alive last month.
where f(0) = 0, f(1) = 1
f(n + 1) = f(n) + f(n 1)
We call this a recurrence relation because f recurs in its own defining equation.
With it we can answer Fibonaccis twelve-month question.
month
pairs
0
0
1
1
2
1
3
2
4
3
5
5
6
8
7
13
8
21
9
34
10
55
11
89
12
144
The sequence of numbers defined by the above equation is the Fibonacci sequence. We will give a formula to calculate f(n + 1) without having to first
calculate f(n), f(n 1), etc.
We can give the recurrence a matrix formulation.
!
!
!
!
!
1 1
f(n)
f(n + 1)
f(1)
1
=
where
=
1 0
f(n 1)
f(n)
f(0)
0
Writing T for the matrix and ~vn for the vector with components f(n + 1) and
f(n), we have that ~vn = T n~v0 . The advantage of this formulation comes from
diagonalizing T because then we have a fast way to compute its powers: if
Topic: Linear Recurrences
419
T = PDP1 then T n = PDn P1 and the n-th power of the diagonal matrix D
is the diagonal matrix whose entries are the n-th powers of the entries of D.
The characteristic equation of T is 2 1. The quadratic formula gives
its roots as (1 + 5)/2 and (1 5)/2. (Remark: these are sometimes called
golden ratios; see [Falbo].) Diagonalizing gives this.
!
!
!
!
1 5
1+ 5
1+ 5
1 5
1
(
)
1 1
0
5
2 5
2
2
2
=
1
1
5
5
1+
1 0
1
1
0
2
5
2 5
Introducing the vectors and taking the n-th power, we have

f(n + 1)
f(n)
=
!
=
1
1
1
0
!n
1+ 5
2
1 5
2
!
f(1)
f(0)
! n
1+ 5
2
0

n
1 5
2
1
5
1
5)
( 1
2 5
1+ 5
2 5
1
0
The calculation is ugly but not hard.

f(n + 1)
f(n)
!
=
1+ 5
2
!
1 5
2
n
1+ 5
2
1 5
2
n
!
1+ 5
1
1+ 5
1 5
2
2
5 2 n
1
1
15 12 5
n+1
n+1
1+ 5
1 5
1
1
2
5 2
5 n
n
1+ 5
1 5
1
1
2
2
5
5
0

0

n
1
5
15
We want the second component of that equation.

"
!n #
!n
1
1 5
1+ 5
f(n) =
2
2
5
This formula finds the value of any member of the sequence without having to
first find the intermediate values. Notice that (1 5)/2 0.618 has absolute
value less than one and so its powers go to zero. Thus the formula giving f(n)
is dominated by its first term.
Although we have extended the elementary model of population growth by
adding a delay period before the onset of fertility, we nonetheless still get a
function that is asymptotically exponential.
In general, a linear recurrence relation (or difference equation) has this
form.
f(n + 1) = an f(n) + an1 f(n 1) + + ank f(n k)
This recurrence relation is homogeneous because there is no constant term, i.e,
we can rewrite it into the form 0 = f(n + 1) + an f(n) + an1 f(n 1) + +
420
ank f(n k). We say that this relation is of order k. The relation along with
the initial conditions f(0), . . . , f(k) completely determines a sequence. For
instance, the Fibonacci relation is of order two and, along with the two initial
conditions f(0) = 0 and f(1) = 1, it determines the Fibonacci sequence simply
because we can compute any f(n) by first computing f(2), f(3), etc. We shall
see how to use linear algebra to solve a linear recurrence relation to find a
formula that computes the n-th member of the sequence without having to first
compute the values of the prior members.
Let V be the set of functions with domain N = {0, 1, 2, . . . }. (We shall use
the codomain R but we could use others, such as C. Below we sometimes have
domain {1, 2, . . . } but it is not an important difference.) This is a vector space
with the usual meaning for addition and scalar multiplication of functions, that
the action of f + g is x 7 f(x) + g(x) and the action of cf is x 7 c f(x).
If we omit the initial conditions then there may be many functions satisfying
a recurrence. For example, the function g whose first few values are g(0) = 1,
g(1) = 2, g(2) = 3, g(3) = 4, and g(4) = 7 solves the Fibonacci relation without
the Fibonacci initial conditions.
Fix a relation and consider the subset S of functions satisfying the relation
without initial conditions. We claim that it is a subspace of V. It is nonempty
because the zero function is a solution. It is closed under addition since if f1
and f2 are solutions, then this holds.
an+1 (f1 + f2 )(n + 1) + + ank (f1 + f2 )(n k)
= (an+1 f1 (n + 1) + + ank f1 (n k))
+ (an+1 f2 (n + 1) + + ank f2 (n k))
=0
It is also closed under scalar multiplication.
an+1 (rf1 )(n + 1) + + ank (rf1 )(n k)
= r(an+1 f1 (n + 1) + + ank f1 (n k))
=r0
=0
We can find the dimension of S. Consider this map from the set of functions S
to the set of k-tall vectors.
f(0)
f(1)
f 7 .
..
f(k)
Exercise 3 shows that this map is linear. Because any solution of the recurrence
is uniquely determined by the k initial conditions, this map is one-to-one and
onto. Thus it is an isomorphism and thus S has dimension k, the order of the
recurrence.
421
So we can describe the set of solutions of our linear homogeneous recurrence

relation of degree k (again, without any initial conditions) by taking linear
combinations of a set having only k-many linearly independent functions.
To produce those equations we give the recurrence f(n + 1) = an f(n) + +
ank f(n k) a matrix formulation.
an an1 an2 . . . ank+1 ank

1
0
0
...
0
0
f(n)
f(n + 1)
f(n)
1
0
f(n 1)
=
.
.
0
1
..
..
..
.
..
..
.. f(n k)
.
.
.
f(n k + 1)
0
...
We want the characteristic function of the matrix, the determinant of A I

where the above matrix is A. The pattern in the 22 case
!
an an1
= 2 an an1
1
and the 33 case
an
1
0
an1
an2
0 = 3 + an 2 + an1 + an2
leads us to expect (and Exercise 4 verifies) that this is the characteristic equation.

an

1

0

0

..
.

0
an1
1
0
..
.
0
an2
0
...
...
ank+1
0
..
.
...

ank
0

..
.

= (k + an k1 + an1 k2 + + ank+1 + ank )

The is irrelevant to find the roots so we will drop it. We say that the
polynomial is associated with the recurrence relation.
If k + an k1 + an1 k2 + + ank+1 + ank has no repeated roots
then the matrix is diagonalizable and we can, in theory, get a formula for f(n)
as in the Fibonacci case. But because we know that the subspace of solutions
has dimension k, we do not need to do the diagonalization calculation provided
that we can exhibit k linearly independent functions satisfying the relation.
Where r1 , r2 , . . . , rk are the distinct roots, consider the functions fr1 (n) = rn
1
through frk (n) = rn
of
powers
of
those
roots.
Exercise
5
shows
that
each
is
a
k
solution of the recurrence and that they form a linearly independent set. So if
the roots r1 , . . . , rk of the associated polynomial are distinct then any solution
422
n
n
of the relation has the form f(n) = c1 rn
1 + c2 r2 + + ck rk for c1 , . . . , cn R.
(The case of repeated roots is similar but we wont cover it here; see any text on
Discrete Mathematics.)
Now we bring in the initial conditions. Use them to solve for c1 , . . . , cn . For
instance, the polynomial associated with the Fibonacci relation is 2 + + 1,
whose roots are (1 5)/2 and so any solution of the Fibonacci equation has the
form f(n) = c1 ((1 + 5)/2)n + c2 ((1 5)/2)n . Including the initial conditions
for the cases n = 0 and n = 1 gives
c1 +
c2 = 0
(1 + 5/2)c1 + (1 5/2)c2 = 1
which yields c1 = 1/ 5 and c2 = 1/ 5, as we found above.

We close by considering the nonhomogeneous case, where the relation has
the form f(n + 1) = an f(n) + an1 f(n 1) + + ank f(n k) + b for some
nonzero b. We only need a small adjustment to make the transition from the
homogeneous case. This classic example illustrates.
In 1883, Edouard Lucas posed the following problem, today called the Tower
of Hanoi .
In the great temple at Benares, beneath the dome which marks
the center of the world, rests a brass plate in which are fixed three
diamond needles, each a cubit high and as thick as the body of a
bee. On one of these needles, at the creation, God placed sixty four
disks of pure gold, the largest disk resting on the brass plate, and
the others getting smaller and smaller up to the top one. This is the
Tower of Brahma. Day and night unceasingly the priests transfer
the disks from one diamond needle to another according to the fixed
and immutable laws of Bram-ah, which require that the priest on
duty must not move more than one disk at a time and that he must
place this disk on a needle so that there is no smaller disk below
it. When the sixty-four disks shall have been thus transferred from
the needle on which at the creation God placed them to one of the
other needles, tower, temple, and Brahmins alike will crumble into
dusk, and with a thunderclap the world will vanish. (Translation of
[De Parville] from [Ball & Coxeter].)
How many disk moves will it take? Instead of tackling the sixty four disk problem
right away, we will consider the problem for smaller numbers of disks, starting
with three.
To begin, all three disks are on the same needle.
423
After moving the small disk to the far needle, the mid-sized disk to the middle
needle, and then moving the small disk to the middle needle we have this.
Now we can move the big disk over. Then to finish we repeat the process of
moving the two smaller disks, this time so that they end up on the third needle,
on top of the big disk.
So to move the bottom disk at a minimum we must first move the smaller
disks to the middle needle, then move the big one, and then move all the smaller
ones from the middle needle to the ending needle. Since this minimum suffices,
we get this recurrence for the number of moves.
where T (1) = 1
T (n + 1) = T (n) + 1 + T (n) = 2T (n) + 1

We can easily compute the first few values of T .
n
T (n)
1
1
2
3
3
7
4
15
5
31
6
63
7
127
8
255
9
511
10
1023
Of course, those numbers are one less than a power of two. To derive this
equation instead of just guessing at it, we write the original relation as 1 =
T (n + 1) + 2T (n), consider the homogeneous relation 0 = T (n) + 2T (n 1),
get its associated polynomial + 2, which obviously has the single root r1 = 2,
and conclude that functions satisfying the homogeneous relation take the form
T (n) = c1 2n .
Thats the homogeneous solution. Now we need a particular solution. Because
the nonhomogeneous relation 1 = T (n + 1) + 2T (n) is so simple, in a few
minutes (or by remembering the table) we can spot a particular solution, T (n) =
1. So we have that (without yet considering the initial condition) any solution
of T (n + 1) = 2T (n) + 1 is the sum of the homogeneous solution and this
particular solution: T (n) = c1 2n 1. The initial condition T (1) = 1 now gives
that c1 = 1, and weve gotten the formula that generates the table: the n-disk
Tower of Hanoi problem requires a minimum of 2n 1 moves.
Finding a particular solution in more complicated cases is, unsurprisingly,
more complicated. A delightful and rewarding, but challenging, source on
recurrence relations is [Graham, Knuth, Patashnik]. For more on the Tower
of Hanoi, [Ball & Coxeter] or [Gardner 1957] are good starting points. So is
[Hofstadter]. Some computer code for trying some recurrence relations follows
the exercises.
Exercises
1 Solve each homogeneous linear recurrence relations.
(a) f(n + 1) = 5f(n) 6f(n 1)
424
(b) f(n + 1) = 4f(n 1)

(c) f(n + 1) = 5f(n) 2f(n 1) 8f(n 2)
2 Give a formula for the relations of the prior exercise, with these initial conditions.
(a) f(0) = 1, f(1) = 1
(b) f(0) = 0, f(1) = 1
(c) f(0) = 1, f(1) = 1, f(2) = 3.
3 Check that the isomorphism given between S and Rk is a linear map. We argue
above that this map is one-to-one. What is its inverse?
4 Show that the characteristic equation of the matrix is as stated, that is, is the
polynomial associated with the relation. (Hint: expanding down the final column,
and using induction will work.)
5 Given a homogeneous linear recurrence relation f(n+1) = an f(n)+ +ank f(n
k), let r1 , . . . , rk be the roots of the associated polynomial.
(a) Prove that each function fri (n) = rn
k satisfies the recurrence (without initial
conditions).
(b) Prove that no ri is 0.
(c) Prove that the set { fr1 , . . . , frk } is linearly independent.
6 (This refers to the value T (64) = 18, 446, 744, 073, 709, 551, 615 given in the computer code below.) Transferring one disk per second, how many years would it
take the priests at the Tower of Hanoi to finish the job?
Computer Code
This code allows the generation of the first few values of a function defined
by a recurrence and initial conditions. It is in the Scheme dialect of LISP
(specifically, it shows A. Jaffers free scheme interpreter SCM although any
Scheme implementation should work).
First, the Tower of Hanoi code is a straightforward implementation of the
recurrence.
(define (tower-of-hanoi-moves n)
(if (= n 1)
1
(+ (* (tower-of-hanoi-moves (- n 1))
2)
1) ) )
(Note for readers unused to recursive code: to compute T (64), the computer
wants to compute 2 T (63) 1, which requires computing T (63). The computer
puts the times 2 and the plus 1 aside for a moment to do that. It computes
T (63) by using this same piece of code (thats what recursive means), and to
do that it wants to compute 2 T (62) 1. This keeps up (the next step is to try
to do T (62) while it holds the other arithmetic in waiting), until after 63 steps
the computer tries to compute T (1). It then returns T (1) = 1, which allows
the computation of T (2) can proceed, etc., up until the original computation of
T (64) finishes.)
The next routine calculates a table of the first few values. (Some language
notes: () is the empty list, that is, the empty sequence, and cons pushes
something onto the start of a list. Note that, in the last line, the procedure proc
is called on argument n.)
(define (first-few-outputs proc n)

(first-few-outputs-helper proc n ()) )
;
(define (first-few-outputs-aux proc n lst)
(if (< n 1)
lst
(first-few-outputs-aux proc (- n 1) (cons (proc n) lst)) ) )
The session at the SCM prompt went like this.

>(first-few-outputs tower-of-hanoi-moves 64)
(1 3 7 15 31 63 127 255 511 1023 2047 4095 8191 16383 32767
65535 131071 262143 524287 1048575 2097151 4194303 8388607
16777215 33554431 67108863 134217727 268435455 536870911
1073741823 2147483647 4294967295 8589934591 17179869183
34359738367 68719476735 137438953471 274877906943 549755813887
1099511627775 2199023255551 4398046511103 8796093022207
17592186044415 35184372088831 70368744177663 140737488355327
281474976710655 562949953421311 1125899906842623
2251799813685247 4503599627370495 9007199254740991
18014398509481983 36028797018963967 72057594037927935
144115188075855871 288230376151711743 576460752303423487
1152921504606846975 2305843009213693951 4611686018427387903
9223372036854775807 18446744073709551615)
This is a list of T (1) through T (64).
425
Appendix
Mathematics is made of arguments (reasoned discourse that is, not crockerythrowing). This section sketches the background material and argument techniques that we use in the book.
This section only outlines these topics, giving an example or two and skiping
proofs. For more, these are classics: [Polya], [Quine], and [Halmos74]. [Beck] is
a recent book available online.
Propositions
The point at issue in an argument is the proposition. Mathematicians usually
write the point in full before the proof and label it either Theorem for major
points, Corollary for points that follow immediately from a prior one, or Lemma
for when it is chiefly used to prove other results.
The statements expressing propositions can be complex, with many subparts.
The truth or falsity of the entire proposition depends both on the truth value of
the parts and on how the statement is put together.
Not Where P is a proposition, it is not the case that P is true provided that
P is false. Thus, n is not prime is true only when n is the product of smaller
integers.
So not operates on statements, inverting their truth value. We can picture
it with a Venn diagram.
Where the box encloses all natural numbers, and inside the circle are the primes,
the shaded area holds numbers satisfying not P.
To prove that a not P statement holds, show that P is false.
And Consider the statement form P and Q. For it to be true both halves must
hold: 7 is prime and so is 3 is true, while 7 is prime and 3 is not is false.
Here is the Venn diagram for P and Q.
A-2
To prove P and Q, prove that each half holds.

Or A P or Q statement is true when either half holds: 7 is prime or 4 is prime
is true, while 7 is not prime or 4 is prime is false. We take or to mean that if
both halves are true 7 is prime or 4 is not then the statement as a whole is
true. (This is inclusive or. Occasionally in everyday speech people use or in an
exclusive way Live free or die does not intend both halves to hold but we
will not use or in that way.)
The Venn diagram includes all of both circles.
To prove P or Q, show that in all cases at least one half holds (perhaps
sometimes one half and sometimes the other, but always at least one).
If-then An if P then Q statement (sometimes stated as P implies Q or
P = Q or P is sufficient to give Q or Q if P) is true unless P is true while
Q is false.
There is a fine point here if P then Q is true when P is false, no matter
what value Q has: if 4 is prime then 7 is prime and if 4 is prime then 7 is not
are both true statements. (They are vacuously true.) Further, if P then Q is
true when Q is true, no matter what value P has: if 4 is prime then 7 is prime
and if 4 is not prime then 7 is prime are both true.
We adopt this definition of implication because we want statements such as
if n is a perfect square then n is not prime to be true no matter which number
n appears in that statement. For instance, we want if 5 is a perfect square
then 5 is not prime to be true so we want that if both P and Q are false then
P = Q is true.
The diagram
shows that Q holds whenever P does. Notice again that if P does not hold then
Q may or may not be in force.
A-3
There are two main ways to establish an implication. The first way is
direct: assume that P is true and use that assumption to prove Q. For instance,
to show if a number is divisible by 5 then twice that number is divisible by
10, assume that the number is 5n and deduce that 2(5n) = 10n. The second
way is indirect: prove the contrapositive statement: if Q is false then P is false
(rephrased, Q can only be false when P is also false). Thus to show if a number
is prime then it is not a perfect square, we can argue that if it were a square
p = n2 then it could be factored p = n n where n < p and so wouldnt be
prime (p = 0 or p = 1 dont give n < p but they are nonprime).
Note two things about this statement form.
First, an if P then Q result can sometimes be improved by weakening P
or strengthening Q. Thus, if a number is divisible by p2 then its square is
also divisible by p2 could be upgraded either by relaxing its hypothesis: if a
number is divisible by p then its square is divisible by p2 , or by tightening its
conclusion: if a number is divisible by p2 then its square is divisible by p4 .
Second, after showing if P then Q then a good next step is to look into
whether there are cases where Q holds but P does not. The idea is to better
understand the relationship between P and Q with an eye toward strengthening
the proposition.
Equivalence An if-then statement cannot be improved when not only does P
imply Q but also Q implies P. Some ways to say this are: P if and only if Q,
P iff Q, P and Q are logically equivalent, P is necessary and sufficient to give
Q, P Q. An example is a number is divisible by a prime if and only if
that number squared is divisible by the prime squared.
The picture shows that P and Q hold in exactly the same cases.
Although in simple arguments a chain like P if and only if R, which holds if

and only if S . . . may be practical, typically we show equivalence by showing
the two halves if P then Q and if Q then P separately.
Quantifiers
Compare these statements about natural numbers: there is an x such that x
is divisible by x2 is true, while for all numbers x, that x is divisible by x2 is
false. The there is and for all prefixes are quantifiers.
For all The for all prefix is the universal quantifier, symbolized .
In a sense the box we draw to border the Venn diagram shows the universal
quantifier since it dilineates the universe of possible members.
A-4
To prove that a statement holds in all cases, show that it holds in each case.
Thus to prove that every number divisible by p has its square divisible by p2 ,
take a single number of the form pn and square it (pn)2 = p2 n2 . This is a
typical element or generic element proof.
In this kind of argument we must be careful not to assume properties for that
element other than those in the hypothesis. Here is an example of a common
wrong argument: if n is divisible by a prime, say 2, so that n = 2k for some
natural number k, then n2 = (2k)2 = 4k2 and the square of n is divisible by the
square of the prime. That is an argument about the case p = 2 but it isnt a
proof for general p. Contrast it with a correct one: if n is divisible by a prime
so that n = pk for some natural number k, then n2 = (pk)2 = p2 k2 and so the
square of n is divisible by the square of the prime.
There exists The there exists prefix is the existential quantifier, symbolized .
A Venn diagram of there is a number such that P shows both that there
can be more than one and also that not all numbers need satisfy P.
We can prove an existence proposition by producing something satisfying

5
the property: once, to settle the question of primality of 22 + 1, Euler produced
the divisor 641 [Sandifer]. But there are proofs showing that something exists
without saying how to find it; Euclids argument given in the next subsection
shows there are infinitely many primes without giving a formula naming them.
In general, while demonstrating existence is better than nothing, giving an
example is better, and an exhaustive list of all instances is ideal.
Finally, along with Are there any?we often ask How many? So the question
of uniqueness often arises in conjunction with questions of existence. Many
times the two arguments are simpler if separated, so note that just as proving
something exists does not show it is unique, neither does proving something is
unique show that it exists. (Obviously the natural number halfway between
three and four would be unique, but no such number exists.)
Techniques of Proof
Induction Many proofs are iterative, Heres why the statement is true for the
number 1, it then follows for 2 and from there to 3 . . . . These are proofs by
A-5
induction. Such a proof has two steps. In the base step the proposition is
established for some first number, often 0 or 1. In the inductive step we show
that if the proposition holds for numbers up to and including some k then holds
for the next number k + 1.
Here is an example proving that 1 + 2 + 3 + + n = n(n + 1)/2.
For the base step we show that the formula holds when n = 1. Thats
easy, the sum of the first 1 number does indeed equal 1(1 + 1)/2.
For the inductive step, assume that the formula holds for the numbers
1, 2, . . . , k with k > 1. That is, assume all of these instances of the formula.
1 = 1(1 + 1)/2
and
and
1 + 2 = 2(2 + 1)/2
1 + 2 + 3 = 3(3 + 1)/2
..
.
and
1 + + k = k(k + 1)/2
This is the induction hypothesis. With this assumption we will deduce

that the formula also holds in the k + 1 next case.
1 + 2 + + k + (k + 1) =
k(k + 1)
(k + 1)(k + 2)
+ (k + 1) =
2
2
(The first equality follows from the induction hypothesis.)
Weve shown in the base case that the proposition holds for 1. Weve shown
in the inductive step that if it holds for the case of 1 then it also holds for 2;
therefore it does hold for 2. Weve also shown in the inductive step that if the
statement holds for the cases of 1 and 2 then it also holds for the next case 3.
Continuing in this way, we get that the statement holds for any natural number
greater than or equal to 1.
Here is another example, proving proof that every integer greater than 1 is a
product of primes.
The base step is easy: 2 is the product of a single prime.
For the inductive step assume that each of 2, 3, . . . , k is a product of primes,
aiming to show k+1 is also a product of primes. There are two possibilities.
First, if k + 1 is not divisible by a number smaller than itself then it is
a prime and so is the product of primes. The second possibility is that
k + 1 is divisible by a number smaller than itself, and then its factors can
be written as a product of primes by the inductive hypothesis. In either
case k + 1 can be rewritten as a product of primes.
There are two things to note about the next number in an induction
argument. One thing is that while induction works on the integers, its no good
on the reals since there is no next real. The other thing is that we sometimes
use induction to go down, say, from 10 to 9 to 8, etc., down to 0. So next
number could mean next lowest number. Of course, at the end we have not
shown the fact for all natural numbers, only for those less than or equal to 10.
A-6
Contradiction Another technique of proof is to show that something is true by
showing that it cannot be false.
The classic example of proof by contradiction is Euclids argument that there
are infinitely many primes.
Suppose there are only finitely many primes p1 , . . . , pk . Consider p1
p2 . . . pk + 1. None of the primes on this supposedly exhaustive list divides
that number evenly since each leaves a remainder of 1. But every number
is a product of primes so this cant be. Therefore there cannot be only
finitely many primes.
Every proof by contradiction assumes that the proposition is false and derives
some contradiction to known facts. Another example is this proof that 2 is

not a rational number.
Suppose that
2 = m/n.
2n2 = m2
and m = 2km m.
Rewrite.
Factor out any 2s, giving n = 2kn n
)2 = (2km m)
2
2 (2kn n
The Prime Factorization Theorem says that there must be the same
number of factors of 2 on both sides, but there are an odd number of them
1 + 2kn on the left and an even number of them 2km on the right. Thats
a contradiction, so a rational with a square of 2 is impossible.
Both of these examples aimed to prove something doesnt exist. A negative

proposition often suggests a proof by contradiction.
Sets, Functions, and Relations

Sets Mathematicians often work with collections.
The most basic kind of collection is a set. We can describe a set as a listing
between
curly braces as with {1, 4, 9, 16 } or by using set-builder notation as with

{ x x5 3x3 + 2 = 0 } (read the set of all x such that . . . ). We name sets with
capital roman letters, for instance the set of primes is P = {2, 3, 5, 7, 11, . . . }
(except that a few sets are so important that their names are reserved, such as
the real numbers R and the complex numbers C). To denote that something
is an element (or a member ) of a set we use , so that 7 {3, 5, 7 } while
8 6 { 3, 5, 7 }.
Sets satisfy the Principle of Extensionality, that two sets with the same
elements are equal. Because of this, the order of the elements does not matter
{ 2, } = {, 2 }, and repeats collapse { 7, 7 } = { 7 }.
We say that A is a subset of B, written A B, if any element of A is an
element of B. We use for the proper subset relationship that A is a subset
of B but A 6= B. An example is {2, } { 2, , 7 }. These symbols may be flipped,
for instance {2, , 5 } { 2, 5 }.
A-7
Because of Extensionality, to prove that two sets are equal A = B show that
they have the same members. Usually we show mutual inclusion, that both
A B and A B.
When a sets has no members then it is the empty set { }, symbolized .
Any set has the empty set for a subset by the vacuously true property of the
definition of implication.
Set operations Venn diagrams are handy here. For instance, we can picture
xP
P
x
and P Q.
This is a repeat of the diagram for if . . . then . . . because P Q means if

x P then x Q.
For every propositional logic operator
there is an associated set operator.

The complement of P is Pcomp = {x not(x P) }

the union is P Q = {x (x P) or (x Q) }

and the intersection is P Q = { x (x P) and (x Q) }.
A-8
Multisets A multiset is a collection in which order does not matter, just as
with sets, but in contrast with sets repeats do not collapse. Thus the multiset
{ 2, 1, 2 } is the same as the multiset { 1, 2, 2 } but differs from the multiset {1, 2 }.
Note that we use the same {. . . } notation as for sets. Also as with sets, we say
A is a multiset subset if A is a subset of B and A is a multiset.
Sequences In addition to sets and multisets, we also use collections where order
matters and where repeats do not collapse. These are sequences, denoted with
angle brackets: h2, 3, 7i 6= h2, 7, 3i. A sequence of length 2 is an ordered pair,
and is often written with parentheses: (, 3). We also sometimes say ordered
triple, ordered 4-tuple, etc. The set of ordered n-tuples of elements of a set A
is denoted An . Thus R2 is the set of pairs of reals.
Functions When we first learn about functions they are presented as formulas
such as f(x) = 16x2 100. But progressing to more advanced mathematics
reveals more general functions trigonometric ones, exponential and logarithmic
ones, and even constructs like absolute value that involve piecing together parts.
And some functions take inputs that are not numbers:
the function that returns
p
the R2 distance from a point to the origin x2 + y2 takes the ordered pair
(x, y) as its argument. So we see that functions arent formulas, instead the key
idea is that a function associates with each input x a single output f(x).
Consequently, a function or map is defined to be a set of ordered pairs
(x, f(x)) such that x suffices to determine f(x). Restated, that is: if x1 = x2 then
f(x1 ) = f(x2 ) (this is the requirement that a function must be well-defined).
Each input x is one of the functions arguments. Each output f(x) is a value
(often where x is the input the output is denoted y). The set of all arguments is
fs domain and the set of output values is its range. Usually we dont need to
know what is and is not in the range and we instead work with a convenient
superset of the range, the codomain. The notation for a function f with domain
X and codomain Y is f : X Y.
We also use the notation x 7 16x2 100, read x maps under f to 16x2 100
or 16x2 100 is the image of x.
A map such as x 7 sin(1/x) is a combinations of simple maps, here g(y) =
sin(y) applied to the image of f(x) = 1/x. The composition of g : Y Z with
f : X Y, is the map sending x X to g( f(x) ) Z. It is denoted g f : X Z.
This definition only makes sense if the range of f is a subset of the domain of g.
An identity map id : Y Y defined by id(y) = y has the property that for
any f : X Y, the composition id f is equal to f. So an identity map plays the
More
on this is in the section on isomorphisms
A-9
same role with respect to function composition that the number 0 plays in real
number addition or that 1 plays in multiplication.
In line with that analogy, we define a left inverse of a map f : X Y to be
a function g : range(f) X such that g f is the identity map on X. A right
inverse of f is a h : Y X such that f h is the identity.
A map that is both a left and right inverse of f is called simply an inverse.
An inverse, if one exists, is unique because if both g1 and g2 are inverses of f
then g1 (x) = g1 (f g2 ) (x) = (g1 f) g2 (x) = g2 (x) (the middle equality
comes from the associativity of function composition), so we often call it the
inverse, written f1 . For instance, the inverse of the function f : R R given
by f(x) = 2x 3 is the function f1 : R R given by f1 (x) = (x + 3)/2.
The superscript f1 notation for function inverse can be confusing since
it clashes with 1/f(x). But it fits into a larger scheme. Functions that have
the same codomain as domain can be iterated, so that where f : X X, we can
consider the composition of f with itself: f f, and f f f, etc. We write f f as
f2 and f f f as f3 , etc. Note that the familiar exponent rules for real numbers
hold: fi fj = fi+j and (fi )j = fij . Then where f is invertible, writing f1 for
the inverse and f2 for the inverse of f2 , etc., gives that these familiar exponent
rules continue to hold, once we define f0 to be the identity map.
If the codomain Y equals the range of f then we say that the function is onto.
A function has a right inverse if and only if it is onto (this is not hard to check).
If no two arguments share an image, if x1 6= x2 implies that f(x1 ) 6= f(x2 ), then
the function is one-to-one. A function has a left inverse if and only if it is
one-to-one (this is also not hard to check).
By the prior paragraph, a map has an inverse if and only if it is both onto
and one-to-one. Such a function is a correspondence. It associates one and
only one element of the domain with each element of the range. Because a
composition of one-to-one maps is one-to-one, and a composition of onto maps
is onto, a composition of correspondences is a correspondence.
We sometimes want to shrink the domain of a function. For instance, we may
take the function f : R R given by f(x) = x2 and, in order to have an inverse,
limit input arguments to nonnegative reals f: R+ R. Then f is a different
function than f; we call it the restriction of f to the smaller domain.
Relations For some familiar operations we most naturally interpret them as
functions: addition maps (5, 3) to 8. But what of < or = ? We can take the
approach of rephrasing 3 < 5 to (3, 5) is in the relation <. That is, define a
binary relation on a set A to be a set of
ordered pairs of elements of A. For
example, the < relation is the set {(a, b) a < b }; some elements of that set are
(3, 5), (3, 7), and (1, 100).
Another binary relation on the natural numbers is equality; this relation is
the set {. . . , (1,
1), (0, 0), (1, 1), . . . }. Still another example is closer than 10,
the set {(x, y) |x y| < 10 }. Some members of that relation are (1, 10), (10, 1),
and (42, 44). Neither (11, 1) nor (1, 11) is a member.
Those examples illustrate the generality of the definition. All kinds of
A-10
relationships (e.g., both numbers even or first number is the second with the
digits reversed) are covered.
Equivalence Relations We shall need to express that two objects are alike in
some way. They arent identical, but they are related (e.g., two integers that
give the same remainder when divided by 2).
A binary relation {(a, b), . . . } is an equivalence relation when it satisfies
(1) reflexivity: any object is related to itself, (2) symmetry: if a is related
to b then b is related to a, and (3) transitivity: if a is related to b and b is
related to c then a is related to c. Some examples (on the integers): = is an
equivalence relation, < does not satisfy symmetry, same sign is a equivalence,
while nearer than 10 fails transitivity.
Partitions In the same sign relation {(1, 3), (5, 7), (1, 1), . . . } there are
two kinds of pairs, the ones with both numbers positive and those with both
negative. So integers fall into exactly one of two classes, positive or negative.
A partition of a set S is a collection of subsets {S0 , S1 , S2 , . . . } such that
every element of S is in one and only one subset: S1 S2 = S, and if i 6= j
then Si Sj = . Picture that S is decomposed into non-overlapping parts.
S2
S1
S0
...
S3
Thus, the first paragraph says same sign partitions the integers into the positives
and the negatives. Similarly, the equivalence relation = partitions the integers
into one-element sets.

An example is the set of fractions S = { n/d n, d Z and d 6= 0 }. We define
two members n1 /d1 and n2 /d2 of S to be equivalent if n1 d2 = n2 d1 . We
can check that this is an equivalence relation, that it satisfies the above three
conditions. So S is partitioned.
.1/1
.2/2
.2/4
.2/4
.0/1
.0/3
.4/3
...
.8/6
Every equivalence relation induces a partition, and every partition is induced

by an equivalence. (This is routine to check.) Below are two examples.
Consider the equivalence relationship between two integers of give the
same remainder when divided by 2, the set P = {(1, 3), (2, 4), (0, 0), . . . }
(this is more briefly stated as same parity). In the set P are two kinds
of pairs, the ones with both members even and the ones with both members odd. This equivalence induces a partition where the parts are
found by:
for each x we define the set of numbers related to it Sx = { y (x, y) P }.
Some parts are S1 = {. . . , 3, 1, 1, 3, . . . }, and S2 = {. . . , 2, 0, 2, 4, . . .}, and
A-11
S1 = { . . . , 3, 1, 1, 3, . . . }. Note that there are only two parts; for instance
S1 = S1 is the odd numbers and S2 = S4 is the evens.
Now consider the partition of the natural numbers where two numbers are
in the same part if they leave the same remainder when divided by 10, that is,
if they have the same least significant digit. This partition is induced by the
equivalence relation R defined by: two numbers n, m are related if they are
together in the same part. The three conditions in the definition of equivalence
are straightforward. For example, 3 is related to 33, but 3 is not related to 102.
We call each part of a partition an equivalence class. We sometimes pick a
single element of each equivalence class to be the class representative.
?
?
?
...
Usually when we pick representatives we have some natural scheme in mind. In

that case we call them the canonical representatives.
An example is the simplest form of a fraction. The two fractions 3/5 and
9/15 are equivalent. In everyday work we often prefer to use the simplest form
or reduced form fraction 3/5 as the class representatives.
?1/1
?0/1
?4/3
?1/2
...
Bibliography
[Abbot] Edwin Abbott, Flatland, Dover.
[Ackerson] R. H. Ackerson, A Note on Vector Spaces, American Mathematical Monthly,
vol. 62 no. 10 (Dec. 1955), p. 721.
[Agnew] Jeanne Agnew, Explorations in Number Theory, Brooks/Cole, 1972.
[Am. Math. Mon., Jun. 1931] C. A. Rupp (proposer), H. T. R. Aude (solver), problem
3468, American Mathematical Monthly, vol. 37 no. 6 (June-July 1931), p. 355.
[Am. Math. Mon., Feb. 1933] V. F. Ivanoff (proposer), T. C. Esty (solver), problem
3529, American Mathematical Monthly, vol. 39 no. 2 (Feb. 1933), p. 118.
[Am. Math. Mon., Jan. 1935] W. R. Ransom (proposer), Hansraj Gupta (solver), Elementary problem 105, American Mathematical Monthly, vol. 42 no. 1 (Jan.
1935), p. 47.
[Am. Math. Mon., Jan. 1949] C. W. Trigg (proposer), R. J. Walker (solver), Elementary problem 813, American Mathematical Monthly, vol. 56 no. 1 (Jan. 1949),
p. 33.
[Am. Math. Mon., Jun. 1949] Don Walter (proposer), Alex Tytun (solver), Elementary
problem 834, American Mathematical Monthly, vol. 56 no. 6 (June-July 1949),
p. 409.
[Am. Math. Mon., Nov. 1951] Albert Wilansky, The Row-Sums of the Inverse Matrix,
American Mathematical Monthly, vol. 58 no. 9 (Nov. 1951), p. 614.
[Am. Math. Mon., Feb. 1953] Norman Anning (proposer), C. W. Trigg (solver), Elementary problem 1016, American Mathematical Monthly, vol. 60 no. 2 (Feb.
1953), p. 115.
[Am. Math. Mon., Apr. 1955] Vern Haggett (proposer), F. W. Saunders (solver), Elementary problem 1135, American Mathematical Monthly, vol. 62 no. 4 (Apr.
1955), p. 257.
[Am. Math. Mon., Jan. 1963] Underwood Dudley, Arnold Lebow (proposers), David
Rothman (solver), Elementary problem 1151, American Mathematical Monthly,
vol. 70 no. 1 (Jan. 1963), p. 93.
[Am. Math. Mon., Dec. 1966] Hans Liebeck, A Proof of the Equality of Column Rank
and Row Rank of a Matrix American Mathematical Monthly, vol. 73 no. 10
(Dec. 1966), p. 1114.
[Anton] Howard Anton, Elementary Linear Algebra, John Wiley & Sons, 1987.
[Arrow] Kenneth J. Arrow, Social Choice and Individual Values, Wiley, 1963.
[Austin] David Austin, How Google Finds Your Needle in the Webs Haystack,
http://www.ams.org/samplings/feature-column/fcarc-pagerank, retrieved
Feb. 2012.
[Ball & Coxeter] W.W. Rouse Ball, Mathematical Recreations and Essays, revised
by H.S.M. Coxeter, MacMillan, 1962.
[Beck] Matthias Beck, Ross Geoghegan, The Art of Proof, http://math.sfsu.edu/
beck/papers/aop.noprint.pdf, 2011-Aug-08.
[Beardon] A.F. Beardon, The Dimension of the Space of Magic Squares, The Mathematical Gazette, vol. 87, no. 508 (Mar. 2003), p. 112-114.
[Birkhoff & MacLane] Garrett Birkhoff, Saunders MacLane, Survey of Modern Algebra, third edition, Macmillan, 1965.
[Blass 1984] A. Blass, Existence of Bases Implies the Axiom of Choice, pp. 31 33,
Axiomatic Set Theory, J. E. Baumgartner, ed., American Mathematical Society,
Providence RI, 1984.
[Bridgman] P.W. Bridgman, Dimensional Analysis, Yale University Press, 1931.
[Brin & Page] Sergey Brin and Lawrence Page, The Anatomy of a Large-Scale Hypertextual Web Search Engine, http://infolab.stanford.edu/pub/papers/
google.pdf, retrieved Feb. 2012.
[Bryan & Leise] Kurt Bryan, Tanya Leise, The $25,000,000,000 Eigenvector: the
Linear Algebra Behind Google, SIAM Review, Vol. 48, no. 3 (2006), p. 569-81.
[Casey] John Casey, The Elements of Euclid, Books I to VI and XI, ninth edition,
Hodges, Figgis, and Co., Dublin, 1890.
[ChessMaster] User ChessMaster of StackOverflow, answer to Python determinant
calculation(without the use of external libraries), http://stackoverflow.com/
a/10037087/238366, answer posted 2012-Apr-05, accessed 2012-Jun-18.
[Clark & Coupe] David H. Clark, John D. Coupe, The Bangor Area Economy Its
Present and Future, report to the city of Bangor ME, Mar. 1967.
[Cleary] R. Cleary, private communication, Nov. 2011.
[Clarke] Arthur C. Clarke, Technical Error, Fantasy, December 1946, reprinted in
Great SF Stories 8 (1946), DAW Books, 1982.
[Con. Prob. 1955] The Contest Problem Book, 1955 number 38.
[Cost Of Tolls] Cost of Tolls, http://costoftolls.com/Tolls_in_New_York.html,
2012-Jan-07.
[Coxeter] H.S.M. Coxeter, Projective Geometry, second edition, Springer-Verlag, 1974.
[Courant & Robbins] Richard Courant, Herbert Robbins, What is Mathematics?,
Oxford University Press, 1978.
[Cullen] Charles G. Cullen, Matrices and Linear Transformations, second edition,
Dover, 1990.
[Dalal, et. al.] Siddhartha R. Dalal, Edward B. Fowlkes, & Bruce Hoadley, Lesson
Learned from Challenger: A Statistical Perspective, Stats: the Magazine for
Students of Statistics, Fall 1989, p. 3.
[Davies] Thomas D. Davies, New Evidence Places Peary at the Pole, National Geographic Magazine, vol. 177 no. 1 (Jan. 1990), p. 44.
[de Mestre] Neville de Mestre, The Mathematics of Projectiles in Sport, Cambridge
University Press, 1990.
[De Parville] De Parville, La Nature, Paris, 1884, part I, p. 285 286 (citation from
[Ball & Coxeter]).
[Duncan] W.J. Duncan, Method of Dimensions, in Encyclopaedic Dictionary of
Physics Macmillan, 1962.
[Ebbing] Darrell D. Ebbing, General Chemistry, fourth edition, Houghton Mifflin,
1993.
[Ebbinghaus] H. D. Ebbinghaus, Numbers, Springer-Verlag, 1990.
[Einstein] A. Einstein, Annals of Physics, v. 35, 1911, p. 686.
[Eggar] M.H. Eggar, Pinhole Cameras, Perspecitve, and Projective Geometry, American Mathematical Monthly, August-September 1998, p. 618 630.
[Falbo] Clement Falbo, The Golden Ratio a Contrary Viewpoint, College Mathematics Journal, vol. 36, no. 2, March 2005, p. 123 134.
[Feller] William Feller, An Introduction to Probability Theory and Its Applications
(vol. 1, 3rd ed.), John Wiley, 1968.
[Federal Reserve] Federal Reserve Bank of Richmond, FAQs Currency and Coin,
http://www.richmondfed.org/faqs/currency/ Jan 2012.
[Finkbeiner] Daniel T. Finkbeiner III, Introduction to Matrices and Linear Transformations, third edition, W. H. Freeman and Company, 1978.
[Fuller & Logan] L.E. Fuller & J.D. Logan, On the Evaluation of Determinants by
Chis Method, p 49-52, in Linear Algebra Gems, Carlson, et al, Mathematical
Association of America, 2002.
[Fraleigh & Beauregard] Fraleigh & Beauregard, Linear Algebra.
[Gardner] Martin Gardner, The New Ambidextrous Universe, third revised edition,
W. H. Freeman and Company, 1990.
[Gardner 1957] Martin Gardner, Mathematical Games: About the remarkable similarity between the Icosian Game and the Tower of Hanoi, Scientific American,
May 1957, p. 150 154.
[Gardner, 1970] Martin Gardner, Mathematical Games, Some mathematical curiosities embedded in the solar system, Scientific American, April 1970, p. 108
112.
[Gardner, 1980] Martin Gardner, Mathematical Games, From counting votes to making votes count: the mathematics of elections, Scientific American, October
1980.
[Gardner, 1974] Martin Gardner, Mathematical Games, On the paradoxical situations
that arise from nontransitive relations, Scientific American, October 1974.
[Giordano, Wells, Wilde] Frank R. Giordano, Michael E. Wells, Carroll O. Wilde,
Dimensional Analysis, UMAP Unit 526, in UMAP Modules, 1987, COMAP,
1987.
[Giordano, Jaye, Weir] Frank R. Giordano, Michael J. Jaye, Maurice D. Weir, The
Use of Dimensional Analysis in Mathematical Modeling, UMAP Unit 632, in
UMAP Modules, 1986, COMAP, 1986.
[Glazer] A.M. Glazer, The Structure of Crystals, Adam Hilger, 1987.
[Google Maps] Directions Google Maps,
directions/, 2012-Jan-07.
http://maps.google.com/help/maps/
[Goult, et al.] R.J. Goult, R.F. Hoskins, J.A. Milner, M.J. Pratt, Computational
Methods in Linear Algebra, Wiley, 1975.
[Graham, Knuth, Patashnik] Ronald L. Graham, Donald E. Knuth, Oren Patashnik,
Concrete Mathematics, Addison-Wesley, 1988.
[Halmos] Paul R. Halmos, Finite Dimensional Vector Spaces, second edition, Van
Nostrand, 1958.
[Halmos74] Paul R. Halmos, Naive Set Theory, Springer-Verlag, 1974.
[Hamming] Richard W. Hamming, Introduction to Applied Numerical Analysis, Hemisphere Publishing, 1971.
[Hanes] Kit Hanes, Analytic Projective Geometry and its Applications, UMAP Unit
710, UMAP Modules, 1990, p. 111.
[Heath] T. Heath, Euclids Elements, volume 1, Dover, 1956.
[Hoffman & Kunze] Kenneth Hoffman, Ray Kunze, Linear Algebra, second edition,
Prentice-Hall, 1971.
[Hofstadter] Douglas R. Hofstadter, Metamagical Themas: Questing for the Essence
of Mind and Pattern, Basic Books, 1985.
[Iosifescu] Marius Iofescu, Finite Markov Processes and Their Applications, John
Wiley, 1980.
`
Trick for Linear Equations with Integer Coef[Kahan] William Kahan, Chis
cients, http://www.cs.berkeley.edu/~wkahan/MathH110/chio.pdf, 1998, retrieved 2012-Jun-18.
[Kelton] Christina M.L. Kelton, Trends on the Relocation of U.S. Manufacturing,
UMI Research Press, 1983.
[Kemeny & Snell] John G. Kemeny, J. Laurie Snell, Finite Markov Chains, D. Van
Nostrand, 1960.
[Kemp] Franklin Kemp Linear Equations, American Mathematical Monthly, volume
89 number 8 (Oct. 1982), p. 608.
[Knuth] Donald E. Knuth, The Art of Computer Programming, Addison Wesley,
1988.
[Lang] Serge Lang, Linear Algebra, Addison-Wesley, 1966.
[Leontief 1951] Wassily W. Leontief, Input-Output Economics, Scientific American,
volume 185 number 4 (Oct. 1951), p. 15.
[Leontief 1965] Wassily W. Leontief, The Structure of the U.S. Economy, Scientific
American, volume 212 number 4 (Apr. 1965), p. 25.
[Lieberman] David Lieberman, The Big Bucks Ad Battles Over TVs Most Expensive
Minutes, TV Guide, Jan. 26 1991, p. 11.
[Macdonald & Ridge] Kenneth Macdonald, John Ridge, Social Mobility, in British
Social Trends Since 1900, A.H. Halsey, Macmillian, 1988.
[Macmillan Dictionary] William D. Halsey, Macmillan, 1979.
[Math. Mag., Sept. 1952] Dewey Duncan (proposer), W. H. Quelch (solver), Mathematics Magazine, volume 26 number 1 (Sept-Oct. 1952), p. 48.
[Math. Mag., Jan. 1957] M. S. Klamkin (proposer), Trickie T-27, Mathematics Magazine, volume 30 number 3 (Jan-Feb. 1957), p. 173.
[Math. Mag., Jan. 1963, Q237] D. L. Silverman (proposer), C. W. Trigg (solver),
Quickie 237, Mathematics Magazine, volume 36 number 1 (Jan. 1963).
[Math. Mag., Jan. 1963, Q307] C. W. Trigg (proposer). Quickie 307, Mathematics
Magazine, volume 36 number 1 (Jan. 1963), p. 77.
[Math. Mag., Nov. 1967] Clarence C. Morrison (proposer), Quickie, Mathematics Magazine, volume 40 number 4 (Nov. 1967), p. 232.
[Math. Mag., Jan. 1973] Marvin Bittinger (proposer), Quickie 578, Mathematics Magazine, volume 46 number 5 (Jan. 1973), p. 286, 296.
[Munkres] James R. Munkres, Elementary Linear Algebra, Addison-Wesley, 1964.
[Neimi & Riker] Richard G. Neimi, William H. Riker, The Choice of Voting Systems,
Scientific American, June 1976, p. 21 27.
[Nering] Evar D. Nering, Linear Algebra and Matrix Theory, second edition, John
Wiley, 1970.
[Niven & Zuckerman] I. Niven, H. Zuckerman, An Introduction to the Theory of
Numbers, third edition, John Wiley, 1972.
[Oakley & Baker] Cletus O. Oakley, Justine C. Baker, Least Squares and the 3 : 40
Mile, Mathematics Teacher, Apr. 1977.
[Ohanian] Hans OHanian, Physics, volume one, W. W. Norton, 1985.
[Onan] Onan, Linear Algebra.
[Online Encyclopedia of Integer Sequences] Number of different magic squares of
order n that can be formed from the numbers 1, . . . , n2 , http://oeis.org/
A006052, 2012-Feb-17.
[Petersen] G. M. Petersen, Area of a Triangle, American Mathematical Monthly,
volume 62 number 4 (Apr. 1955), p. 249.
[Polya] G. Polya, Mathematics and Plausible Reasoning, Princeton University Press,
1954
[Poundstone] W. Poundstone, Gaming the Vote, Hill and Wang, 2008. ISBN-13:
978-0-8090-4893-9
[Putnam, 1988, A-6] William Lowell Putnam Mathematical Competition, Problem
A-6, 1988, solution: American Mathematical Monthly, volume 96 number 8
(Oct. 1989), p. 688.
[Putnam, 1990, A-5] William Lowell Putnam Mathematical Competition, Problem
A-5, 1990.
[Rice] John R. Rice, Numerical Mathods, Software, and Analysis, second edition,
Academic Press, 1993.
[Quine] W. V. Quine, Methods of Logic, fourth edition, Harvard University Press,

1982.
[Rucker] Rudy Rucker, Infinity and the Mind, Birkhauser, 1982.
[Ryan] Patrick J. Ryan, Euclidean and Non-Euclidean Geometry: an Analytic
Approach, Cambridge University Press, 1986.
[Sandifer] Ed Sandifer, How Euler Did It, http://www.maa.org/editorial/euler/
How%20Euler%20Did%20It%2041%20factoring%20F5.pdf (version: 2012-Jan27).
[Schmidt] Jack Schmidt http://math.stackexchange.com/a/98558/12012 (version:
2012-01-12).
[Shepelev] Anton Shepelev, private communication, Feb 19, 2011.
[Seidenberg] A. Seidenberg, Lectures in Projective Geometry, Van Nostrand, 1962.
[Smith] Larry Smith, Linear Algebra, second edition, Springer-Verlag, 1984.
[Strang 93] Gilbert Strang The Fundamental Theorem of Linear Algebra, American
Mathematical Monthly, Nov. 1993, p. 848 855.
[Strang 80] Gilbert Strang, Linear Algebra and its Applications, second edition,
Harcourt Brace Jovanovich, 1980.
[Taylor] Alan D. Taylor, Mathematics and Politics: Strategy, Voting, Power, and
Proof, Springer-Verlag, 1995.
[Tilley] Burt Tilley, private communication, 1996.
[Trono] Tony Trono, compiler, University of Vermont Mathematics Department High
School Prize Examinations 1958-1991, mimeographed printing, 1991.
[USSR Olympiad no. 174] The USSR Mathematics Olympiad, number 174.
[Velleman] Dan Velleman, private communication.
[Weston] J. D. Weston, Volume in Vector Spaces, American Mathematical Monthly,
volume 66 number 7 (Aug./Sept. 1959), p. 575 577.
[Ward] James E. Ward III, Vector Spaces of Magic Squares, Mathematics Magazine,
vol 53 no 2 (Mar 1980), p 108 111.
[Weyl] Hermann Weyl, Symmetry, Princeton University Press, 1952.
[Wickens] Thomas D. Wickens, Models for Behavior, W.H. Freeman, 1982.
[Wilkinson 1965] Wilkinson, 1965
[Wikipedia Lo Shu Square] Lo Shu Square, http://en.wikipedia.org/wiki/Lo_Shu_
Square, 2012-Feb-17.
[Wikipedia Magic Square] Magic square,
square, 2012-Feb-17.
http://en.wikipedia.org/wiki/Magic_
[Wikipedia Mens Mile] Mile run world record progression, http://en.wikipedia.

org/wiki/Mile_run_world_record_progression, 2011-Apr-09.
[Wikipedia Square-cube Law] The Square-cube law,
wiki/Square-cube_law, 2011-Jan-17.
[Wikipedia Google Page Rank] Page
PageRank, 2012-Feb-27.
Rank,
http://en.wikipedia.org/
http://en.wikipedia.org/wiki/
[Wills] Rebecca S. Wills, Googles Page Rank, Mathematical Intelligencer, vol. 28,
no. 4, Fall 2006.
[Wohascum no. 2] The Wohascum County Problem Book problem number 2.
[Wohascum no. 47] The Wohascum County Problem Book problem number 47.
[Yaglom] I. M. Yaglom, Felix Klein and Sophus Lie: Evolution of the Idea of Symmetry in the Nineteenth Century, translated by Sergei Sossinsky, Birkhuser,
1988.
[Yuster] Thomas Yuster, The Reduced Row Echelon Form of a Matrix is Unique: a
Simple Proof, Mathematics Magazine, vol. 57, no. 2 (Mar. 1984), pp. 93-94.
[Zwicker] William S. Zwicker, The Voters Paradox, Spin, and the Borda Count,
Mathematical Social Sciences, vol. 22 (1991), p. 187 227.
Index
accuracy
of Gausss Method, 6568
rounding error, 66
adding rows, 4
addition
vector, 76
additive inverse, 76
adjoint matrix, 328
angle, 42
antipodal, 345
antisymmetric matrix, 135
argument, A-8
arrow diagram, 215, 230, 236, 240, 358
augmented matrix, 14
automorphism, 161
dilation, 161
reflection, 161
rotation, 161
C language, 65
canonical form
for matrix equivalence, 243
for nilpotent matrices, 382
for row equivalence, 55
for similarity, 401
canonical representative, A-11
Cauchy-Schwartz Inequality, 42
Cayley-Hamilton theorem, 390
central projection, 341
change of basis, 236247
characteristic
vectors, values, 364
characteristic equation, 368
characteristic polynomial, 368
satisfied by, 392
characteristic root, 372
characterized, 170
characterizes, 245
Chemistry problem, 1, 9
back-substitution, 5
chemistry problem, 22
base step
Chis formula, 338
of induction, A-5
Chis Method, 337
basis, 109120
Chis method, 340
change of, 236
circuits
definition, 109
parallel, 70
orthogonal, 254
series, 70
orthogonalization, 254
series-parallel, 71
orthonormal, 255
class
standard, 110, 357
equivalence, A-11
standard over the complex numbers,
357
closure, 91
string, 379
of null space, 375
best fit line, 267
of range space, 375
block matrix, 312
codomain, A-8
box, 320
cofactor, 327
orientation, 322
column, 13
sense, 322
rank, 122
vector, 14
volume, 322
column rank
full, 127
column space, 122
combining rows, 4
complement, A-7
complementary subspaces, 132
orthogonal, 260
complex numbers, 355
vector space over, 86
component, 14
composition, A-8
self, 373
computer algebra systems, 5960
concatenation, 130
conditioning number, 67
congruent figures, 288
congruent plane figures, 288
constant polynomial, 354
contradiction, A-6
contrapositive, A-3
convex set, 180
coordinates
homogeneous, 344
with respect to a basis, 112
corollary, A-1
correspondence, 158, A-9
coset, 190
Cramers rule, 331333
cross product, 300
crystals, 139142
diamond, 140
graphite, 140
salt, 139
unit cell, 140
da Vinci, Leonardo, 341
degree of polynomial, 354
determinant, 296, 301319
cofactor, 327
Cramers rule, 332
definition, 301
exists, 310, 316
Laplace expansion, 327
minor, 327
permutation expansion, 310, 313, 334
diagonal matrix, 207, 224
diagonalizable, 361364
difference equation, 419
homogeneous, 419
dilation, 161, 273
representing, 199
dimension, 117
physical, 149
dimensional constant, 149
dimensional formula, 149
direct map, 291
direct sum, 128136
definition, 132
external, 166
internal, 166
of two subspaces, 132
direction vector, 35
distance-preserving, 288
division theorem, 354
domain, A-8
dot product, 40
double precision, 67
dual space, 190
echelon form, 5
free variable, 12
leading variable, 5
reduced, 47
eigenspace, 368
eigenvalue, eigenvector
of a matrix, 365
of a transformation, 364
element, A-6
elementary
matrix, 225, 272
elementary reduction operations, 4
rescaling, 4
row combination, 4
swapping, 4
elementary row operations, 4
elimination, 2
empty set, A-7
entry, 13
equivalence
class, A-11
canonical representative, A-11
relation, A-10
representative, A-11
equivalence relation, A-10
isomorphism, 167
matrix equivalence, 242
matrix similarity, 358
row equivalence, 49
equivalent statements, A-3
Erlanger Program, 288
Euclid, 288
even functions, 94, 134
even polynomials, 407
external direct sum, 166
Fibonacci sequence, 418
field, 137138
definition, 137
finite-dimensional vector space, 115
flat, 36
free variable, 12
full column rank, 127
full row rank, 127
function, A-8
inverse image, 182
argument, A-8
codomain, A-8
composition, 214, A-8
correspondence, A-9
domain, A-8
even, 94
identity, A-8
inverse, 230, A-9
left inverse, 229
multilinear, 306
odd, 95
one-to-one, A-9
onto, A-9
range, A-8
restriction, A-9
right inverse, 229
structure preserving, 159, 163
see homomorphism 173
two-sided inverse, 230
value, A-8
well-defined, A-8
zero, 174
Fundamental Theorem
of Linear Algebra, 265
Gausss Method, 2
accuracy, 6568
back-substitution, 5
elementary operations, 4
Gauss-Jordan, 47
Gauss-Jordan, 47
Gaussian elimination, 2
generalized null space, 375
generalized range space, 375
Geometry of Linear Maps, 271276
Google matrix, 416

Gram-Schmidt process, 252257
historyless, 283
homogeneous coordinate vector, 344
homogeneous coordinates, 293
homogeneous equation, 21
homomorphism, 173
composition, 214
matrix representing, 191202
nonsingular, 204, 205
null space, 185
nullity, 185
range space, 181
rank, 203
singular, 204
zero, 174
hyperplane, 37
ideal line, 347
ideal point, 347
identity
function, A-8
matrix, 223
if-then statement, A-2
ill-conditioned, 66
image
under a function, A-8
improper subspace, 88
incidence matrix, 227
index
of nilpotency, 378
induction, 23, A-4
hypothesis, A-5
inductive step
of induction, A-5
inherited operations, 78
inner product, 40
Input-Output Analysis, 6164
internal direct sum, 132, 166
intersection, A-7
invariant
subspace, 386
invariant subspace
definition, 398
inverse, 230, A-9
additive, 76
exists, 230
left, 230, A-9
matrix, 329
right, 230, A-9

two-sided, A-9
inverse function, 230
inverse image, 182
inversion, 314
isometry, 288
isomorphism, 157172
characterized by dimension, 170
definition, 158
of a space with itself, 161
Jordan block, 397
Jordan form, 387407
represents similarity classes, 401
kernel, 185
Kirchhoffs Laws, 70
Klein, F., 288
Laplace expansion, 326330
computes determinant, 327
leading variable, 5
least squares, 266270
lemma, A-1
length, 39
Leontief, W., 61
line
best fit, 267
in projective plane, 346
line at infinity, 347
line of best fit, 266270
linear
transpose operation, 127
linear combination, 2
Linear Combination Lemma, 52
linear elimination, 2
linear equation, 2
coefficients, 2
constant, 2
homogeneous, 21
inconsistent systems, 266
satisfied by a vector, 15
solution of, 2
Gausss Method, 3
Gauss-Jordan, 47
solutions of
Cramers rule, 332
system of, 2
linear map
dilation, 273
reflection, 273, 291

rotation, 272, 291
seehomomorphism, 173
skew, 274
trace, 406
linear maps
space of, 177
linear recurrence, 419
linear recurrences, 418425
linear relationship, 98
linear surface, 36
linear transformation
seetransformation, 176
linearly dependent, 98
linearly independent, 98
LINPACK, 59
magic square, 277
normal, 278
magic squares, 277281
map, A-8
distance-preserving, 288
extended linearly, 170
restriction, 377
self composition, 373
Maple, 59
Markov chain, 283
historyless, 283
Markov chains, 282287
Mathematica, 59
mathematical induction, 23, A-5
MATLAB, 59
matrix, 13
adjoint, 328
antisymmetric, 135
augmented, 14
block, 244, 312
change of basis, 236
cofactor, 327
column, 13
column space, 122
conditioning number, 67
diagonal, 207, 224
diagonalizable, 361
diagonalized, 242
elementary reduction, 225, 272
entry, 13
equivalent, 242
Google, 416
method of powers, 408411
identity, 219, 223
minimal polynomial, 219, 388
incidence, 227
minor, 327
inverse, 229235, 329
morphism, 159
inverse, definition, 230
multilinear, 306
magic square, 277
multiplication
main diagonal, 223
matrix-matrix, 214
Markov, 228
matrix-vector, 194
matrix-vector product, 194
multiset, A-8
minimal polynomial, 219, 388
mutual inclusion, A-7
minor, 327
natural representative, A-11
multiplication, 214
networks, 6974
nilpotent, 378
Kirchhoffs Laws, 70
nilpotency
orthogonal, 290
index, 378
orthonormal, 288293
nilpotent, 377386
permutation, 224, 309
canonical form for, 382
rank, 203
definition, 378
representation, 193
matrix, 378
row, 13
transformation, 378
row equivalence, 49
row rank, 121
homomorphism, 204
row space, 121
matrix, 27
scalar multiple, 210
norm, 39
scalar multiplication, 15
normal, 261
similar, 325
similarity, 358
normalize, 39, 255
singular, 27
null space, 185
skew-symmetric, 312
closure of, 375
sparse, 408
generalized, 375
stochastic, 283, 416
nullity, 185
submatrix, 304
odd functions, 95, 134
sum, 15, 210
symmetric, 114, 135, 212, 219, 227, one-to-one function, A-9
onto function, A-9
265
opposite map, 291
trace, 212, 228, 278, 406
order
transition, 283
of a recurrence, 420
transpose, 19, 123, 212
ordered pair, A-8
triangular, 200, 228, 330
orientation, 322, 325
tridiagonal, 409
orientation preserving map, 291
unit, 221
orientation reversing map, 291
Vandermonde, 312
orthogonal, 42
zero, 211
basis, 254
matrix equivalence, 240247
complement, 260
canonical form, 243
mutually, 253
definition, 242
projection, 260
mean
orthogonal matrix, 290
arithmetic, 44
orthogonalization, 254
geometric, 44
member, A-6
orthonormal basis, 255
orthonormal matrix, 288293

page ranking, 414417
pair
ordered, A-8
parallelepiped, 320
parallelogram rule, 34
parameter, 12
parametrized, 12
partial pivoting, 67
partition, A-10A-11
matrix equivalence classes, 243, 245
row equivalence classes, 49
partitions
into isomorphism classes, 167
permutation, 309
inversions, 314
matrix, 224
signum, 316
permutation expansion, 310, 313, 334
permutation matrix, 309
perp, 260
perpendicular, 42
perspective
triangles, 347
pivoting, 47
full, 67
partial
scaled, 67
plane figure, 288
congruence, 288
point
at infinity, 347
in projective plane, 344
polynomial, 354
associated with recurrence, 421
constant, 354
degree, 354
division theorem, 354
even, 407
leading coefficent, 354
minimal, 388
of map, matrix, 387
populations, stable, 412413
potential, 69
powers, method of, 408411
preserves structure, 173
probability vector, 283
projection, 173, 182, 248, 265, 394
along a subspace, 258
central, 341
vanishing point, 341
into a line, 249
into a subspace, 258
orthogonal, 249, 260
Projective Geometry, 341352
projective geometry
Duality Principle, 346
projective plane
ideal line, 347
ideal point, 347
lines, 346
proof techniques
induction, 23
proper
subset, A-6
proper subspace, 88
proposition, A-1
propositions
equivalent, A-3
quantifier, A-3
existential, A-4
universal, A-3
quantifiers, A-3
range, A-8
range space, 181
closure of, 375
generalized, 375
rank, 125, 203
column, 122
of a homomorphism, 181, 186
recurrence, 327, 418, 419
associated polynomial, 421
homogeneous, 419
initial conditions, 420
reduced echelon form, 47
reflection, 273, 291
glide, 291
reflection (or flip) about a line, 161
reflexivity, A-10
relation, A-9
equivalence, A-10
reflexive, A-10
symmetric, A-10
transitive, A-10
relationship
linear, 98
representation
of a matrix, 193
of a vector, 112
representative, A-11
canonical, A-11
for row equivalence classes, 55
of matrix equivalence classes, 243
of similarity classes, 402
rescaling rows, 4
resistance, 69
resistance:equivalent, 73
resistor, 70
restriction, 377, A-9
rigid motion, 288
root
characteristic, 372
rotation, 272, 291
rotation (or turning), 161
represented, 196
row, 13
rank, 121
vector, 14
row equivalence, 49
row rank, 121
full, 127
row space, 121
Rule of Sarrus, 340
Sage, 59
Sarrus, Rule of, 340
scalar, 76
scalar multiple
matrix, 210
vector, 15, 34, 76
scalar multiplication
matrix, 15
scalar product, 40
scaled partial pivoting, 67
Schwartz Inequality, 42
self composition
of maps, 373
sense, 322
sensitivity analysis, 232
sequence, A-8
concatenation, 130
set, A-6
complement, A-7
element, A-6
empty, A-7
intersection, A-7
member, A-6
union, A-7
sets, A-6
dependent, independent, 98
empty, 99
mutual inclusion, A-7
proper subset, A-6
span of, 91
subset, A-6
sgn
seesignum, 316
signum, 316
similar, 300, 325
canonical form, 401
similar matrices, 358
similar triangles, 291
similarity, 358372
similarity transformation, 372
single precision, 65
singular
homomorphism, 204
matrix, 27
size, 320, 322
skew, 274
skew-symmetric, 312
span, 91
of a singleton, 95
sparse matrix, 408
spin, 145
square root, 407
stable populations, 412413
standard basis, 110
state, 282
Statics problem, 1, 5
stochastic matrix, 283, 416
string, 379
basis, 379
of basis vectors, 378
structure
preservation, 173
submatrix, 304
subspace, 8796
closed, 89
complementary, 132
definition, 87
direct sum, 132
improper, 88
independence, 132
invariant, 398
proper, 88
sum, 128
vacuously true, A-2

value, A-8
Vandermonde matrix, 312
vanishing point, 341
vector, 14, 33
angle, 42
canonical position, 33
column, 14
component, 14
cross product, 300
direction, 35
dot product, 40
free, 33
homogeneous coordinate, 344
length, 39
natural position, 33
norm, 39
theorem, A-1
normalize, 39
Tower of Hanoi, 422
orthogonal, 42
trace, 212, 228, 278, 406
perpendicular, 42
transformation
probability, 283
representation of, 112, 236
composed with itself, 373
row, 14
diagonalizable, 361
satisfies an equation, 15
scalar multiple, 15, 34, 76
eigenspace, 368
standard position, 33
eigenvalue, eigenvector, 364
sum, 15, 34, 76
Jordan form for, 401
unit, 44
minimal polynomial, 388
zero, 14, 76
nilpotent, 378
vector space, 7696
canonical representative, 382
basis, 109
projection, 394
closure, 76
size change, 322
complex scalars, 86
transition matrix, 283
definition, 76
transitivity, A-10
dimension, 117
translation, 289
dual, 190
transpose, 19, 123
finite dimensional, 115
homomorphism, 173
interaction with sum and scalar mulisomorphism, 158
tiplication, 212
map, 173
Triangle Inequality, 40
over complex numbers, 353
triangles
subspace, 87
similar, 291
trivial, 80, 110
triangular matrix, 228
Venn diagram, A-1
Triangularization, 200
voltage drop, 70
tridiagonal form, 409
volume, 322
trivial space, 80, 110
voting paradox, 143
turning map, 161
majority cycle, 143
union, A-7
rational preference order, 144
voting paradoxes, 143148
unit matrix, 221
sum
matrix, 15
of matrices, 210
of subspaces, 128
vector, 15, 34, 76
summation notation
for permutation expansion, 310
swapping rows, 4
symmetric matrix, 114, 135, 212, 219
symmetry, A-10
system of linear equations, 2
elimination, 2
Gausss Method, 2
Gaussian elimination, 2
linear elimination, 2
solving, 2
spin, 145
well-defined, A-8
Wheatstone bridge, 71
zero
zero
zero
zero
zero
zero
divisor, 219
division, 235
divisor, 219
homomorphism, 174
matrix, 211
vector, 14, 76

Book

Uploaded by

Copyright:

Available Formats

Book

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Book

Uploaded by

Copyright:

Available Formats

Jim Hefferon

real numbers, reals greater than 0, n-tuples of reals

Lower case Greek alphabet, with pronounciation

science in general, and of Linear Algebra in particular. (I took the liberty of

Chapter Three: Maps Between Spaces

Starred subsections are optional.

Solving Linear Systems

Chapter One. Linear Systems

1.1 Definition A linear combination of x1 , . . . , xn has the form

Section I. Solving Linear Systems

1.4 Example To solve this system

Chapter One. Linear Systems

Each of the three Gausss Method operations has a restriction. Multiplying

are Exercise 31.

Section I. Solving Linear Systems

the third row.

So c = 4, and back-substitution gives that h = 1. (We will solve the Chemistry

shows that z = 3, y = 1, and x = 7.

Chapter One. Linear Systems

Back-substitution gives w = 1, z = 2 , y = 1, and x = 1.

shows that one of the equations is redundant. Echelon form

gives that y = 1 and x = 2. The 0 = 0 reflects the redundancy.

Section I. Solving Linear Systems

The solution set is empty.

Dont be fooled by the final system in that example. A 0 = 0 equation is

Chapter One. Linear Systems

any solutions at all despite that in echelon form it has a 0 = 0 row.

Section I. Solving Linear Systems

Chapter One. Linear Systems

X 1.29 Show that if ad bc 6= 0 then

Section I. Solving Linear Systems

Describing the Solution Set

Chapter One. Linear Systems

Section I. Solving Linear Systems

Chapter One. Linear Systems

Section I. Solving Linear Systems

~ . . . (boldface is also common: a or ). For instance,

As with the addition operation, the entry-by-entry scalar multiplication

Chapter One. Linear Systems

Section I. Solving Linear Systems

2.14 Example In the same way, this system

to a one-parameter solution set.

Chapter One. Linear Systems

X 2.16 Give the size of each

Section I. Solving Linear Systems

(a) Apply Gausss Method to the left-hand side to solve

for x, y, z, and w, in terms of the constants a, b, and c.

Chapter One. Linear Systems

? 2.31 [Shepelev] This puzzle is from a Russian web-site http://www.arbuz.uz/ and

General = Particular + Homogeneous

Section I. Solving Linear Systems

The combination is unrestricted in that w and u can be any real numbers

with the reduction of the associated homogeneous system.

Chapter One. Linear Systems

The solution set

Section I. Solving Linear Systems

More information on mathematical induction is in the appendix.

Chapter One. Linear Systems

Section I. Solving Linear Systems

shows that the general solution is a singleton set.