Colorado State University, Pueblo; Spring 2012
Math 307 — Introduction to Linear Algebra
Course Schedule & Homework Assignments
Here is a link back to the course
syllabus/policy page.
In the following all sections and page numbers refer to the required course
textbook, Linear Algebra, A Modern Introduction
(2nd edition), by David Poole.
This schedule is will be changing very frequently, please check it at
least every class day, and before starting work on any assignment (in case the
content of the assignment has changed).
- M:
- Content:
- bureaucracy and introductions
- what is Linear Algebra (the study of vector spaces and linear
transformations...)
- why do we do so much abstraction and formality at this point of
the mathematics curriculum: what abstraction is good for
- Miniquiz 0
- T:
- Read: To the Student, p. xxiii and §§
1.1–1.3
- Miniquiz 1
- Journals are not due today; it's a bit too early in the
term. (First Journal entry will be due next Tuesday.)
- Content:
- some basic terminology and notation:
- logical and basic set theoretic terminology/notation
- some basic sets of numbers
- natural numbers $\NN$
- integers $\ZZ$
- rationals $\QQ$
- real numbers $\RR$
- starting good definitional style, including
- all variables must be "bound"
- clearly identify the symbol and/or terminology being
defined
- clearly identify the type of object being defined
- vectors in $\RR^n$
- vector addtion
- scalar multiplication
- the dot product
- norms
- some basic properties
- of vector arithmetic
- of dot products and norms
- the triangle inequality
- Do HW0: Send me e-mail (to jonathan.poritz@gmail.com) telling me:
- Your name.
- Your e-mail address. (Please give me one that you actually check
fairly frequently, since I may use it to contact you during the
term.)
- Your year/program/major at CSUP.
- The reason you are taking this course.
- What you intend to do after CSUP, in so far as you have an idea.
- Past math classes you've had.
- Other math and science classes you are taking this term, and
others you intend to take in coming terms.
- Your favorite mathematical subject.
- Your favorite mathematical
result/theorem/technique/example/problem.
- Anything else you think I should know (disabilities, employment
or other things that take a lot of time, etc.)
- [Optional:] If you were going to be trapped on a desert
island alone for ten years, what music would you like to have?
- W:
- Read: §§ 2.1 & 2.2
- Miniquiz 2
- Content:
- more basic terminology and notation...
- complex numbers
- angles between vectors
- quantifiers $\forall$ and $\exists$
- more on what makes a good defintion
- [systems of] linear equations
- solutions of linear systems, the solution set
and its structure
- a[n in]consistent linear system
- the coefficient and augmented matrices of a
linear system
- elemenatry row operations (EROs)
- row-equivalent matrices
- [in]homogeneous linear systems
- more basic properties
- solution sets of linear systems are either empty, have
exactly one point, or have an infinite number of points
- F:
- [Re]Read: §2.2
- Content:
- yet more basic terminology and notation...
- angles between vectors
- orthogonal vectors
- a [non]trivial solution of a linear system
- relation between [non]trivial solutions, [non]homogeneous
linear systems, and [non]unique solutions
- more on what makes a good defintion
- what makes a good statement of a result (theorem, propostion,
etc.)
- [starting on] what makes a good proof
- proof structures:
- unpacking ("follow your nose")
- contradiction ("it can't not be true")
- many more to come...
- the [reduced] row-echelon form of a matrix
- row-reduction
- free variables
- the rank of a matrix
- more basic properties
- Maxiquiz 1 handed out today, due on Monday
- Today [Friday] is the last day to add classes.
- M:
- [Re]Read: §2.2 and Read §2.3
- Content:
- terminology we needed to say out loud:
- Gaussian elimination
- Gauss-Jordan elimination
- noticing that the definition we gave of the angle between
two vectors needed $|\vec{v}\cdot\vec{w}| < 1$ in order to
make sense; this is the content of the
Cauchy-Scharz-Buniakowsky Inequality
- discussion: we say that some new term is well-defined if
its definition makes sense, e.g.:
- any formulæ in the definition can be successfully
computed (as, for example, the Cauchy inequality shows we can
compute the $\arccos$ in the definition of the angle
between two vectors)
- any value expressed in a definition must be clear,
unambiguous, and unique (as, for example, the number of
non-zero rows in the RRE version of a matrix is a uniquely
defined number, which makes the rank of a matrix be
well-defined)
- linear combination
- span
- Hand in HW1: 1.2.62, 2.2.44, 2.2.47
- Hand in Maxiquiz 1
- Miniquiz 3
- T:
- [Re]Read: §2.3
- Content:
- going over Miniquiz 3, Maxiquiz 1 and HW1
- context and type for definitions ... see the
handout on definitions for more on
this theme
- some elementary facts about $\Span$ such as that each of
the vectors $\vec{0},\vec{v}_1,\dots,\vec{v}_k$ is in the set
$\Span(\vec{v}_1,\dots,\vec{v}_k)$.
- linearly [in]dependent vectors — note it is important
that the scalars in the definition are not all zero
- examples of linearly [in]dependent vectors
- starting the discussion of the relationship between
[in]dependence and matrix multiplication by a matrix whose
columns are the vectors under consideration
- Miniquiz 4
- W:
- [Re]Read: §2.3
- Content:
- more examples of linearly [in]dependent vectors
- proving vectors are linearly [in]dependent
- the relationship of linear [in]dependence and the linear
system whose coefficient matrix has columns which are the vectors
under consideration:
- there will be a solution to the system if and only if the
RHS vector is in the span of the columns
- there will be a non-trivial solution of the homogeneous
linear system with that coefficient if and only if the
vectors are linearly dependent
- Miniquiz 5
- F:
- Read: §3.1
- Content:
- proofs by induction (e.g., 3.1.37)
- Hand in HW2: 2.3.43 and Chapter 2 Review problem 18
(on p.133)
- Maxiquiz 2 today
- M:
- [Re]Read: §3.1 and Read §3.2
- Content:
- going over Maxiquiz 2 — the moral was write down
the definitions, it's often enough!
- recall from Math 207 and your reading of the book the basic
terminology:
- matrices
- matrix addition
- scalar multiplication with matrices
- matrix multiplication
- the identity matrix
- matrix algebra
- in class we recalled the definition of transpose
- starting the proof (by induction!) that the transpose of the
sum of $k$ matrices is the sum of the transposes of those
matrices, $\forall k$.
- Miniquiz 6
- Today [Monday] is the last day to drop classes without a grade
being recorded
- T:
- [Re]Read: §3.2 and Read §3.3
- Content:
- finishing the induction proof that the transpose of the
sum of $k$ matrices is the sum of the transposes of those
matrices, for any $k$.
- how to submit electronic Journal entries and HWs.
- some work with matrix multiplication:
- a very condensed version of the definition
- remember: this operation is very rarely commutatitve
- stated without proof that the transpose of the product of $k$
square matrices is the product in the opposite order of the
transposes of those matrices; noted that a proof of this would also
use induction.
- [skew-]symmetric matrices, properties:
- symmetric and skew-symmetric matrices must be square
- a skew-symmetric matrix always has zeros on the diagonal
- Hand in HW3: 3.1.37
- Hand in (or submit electronically) your Journal 1 on
§§1.1-1.3, 2.1, & 2.2 and Journal 2 on
§§2.3, 3.1, & 3.2. See
this link (or Blackboard) for more info
on what is expected of you and how to do it.
- Miniquiz 7
- W:
- [Re]Read: §3.3
- Content:
- going over HW2
- style is important in proofs! ... Be stylish!
- it helps to have a guess as to what you want to prove, then
simply to write down all the definitions and see how they
relate to each other (the unpacking strategy, after you
decide what you want to unpack)
- a very logical day:
- the details of an if–then statement, i.e.,
one in the form $P\Rightarrow Q$
- the converse of $P\Rightarrow Q$ (which is
$\neg P\Rightarrow\neg Q$).
- the contrapositive of $P\Rightarrow Q$ (which is
$\neg Q\Rightarrow\neg P$).
- the negation of $P\Rightarrow Q$ (which is
$P\land\neg Q$)
- if $P\Rightarrow Q$ is true, the converse may or may not be
true
- an "if-then" statement is true if and only if its
contrapositive is true
- the negation of a statement of the form $\forall x\ P(x)$
is $\exists x\ \neg P(x)$
- the negation of a statement of the form $\exists x\ P(x)$
is $\forall x\ \neg P(x)$
- therefore, discussing what is the negation of the statement
$\forall a,b,c\in\RR\ (a\vec{u}+b\vec{v}+c\vec{w}=\vec{0}\Rightarrow a=b=c=0)$
- F:
- Hand in HW4: 3.2.33 and 3.3.46
- Content:
- going over some recent HW and miniquizzes
- discussion of how thinking of and writing down proofs is a
serious new skill we are working on in this class, so we should
definitely not expect it to be terrifically easy and or to
come quickly
- definition of the inverse of a matrix, and what it means
for a matrix to be invertible
- proved the Theorem: Given $A$ and $B$ invertible matrices,
$A\,B$ will be invertible, and $(A\,B)^{-1}=B^{-1}\,A^{-1}$.
- Maxiquiz 3 today
- M:
- [Re]Read: §3.3
- Content:
- going over Maxiquiz 3 — the morals were:
- "repeat until terms are gone..." really means
induction, which would be better to write out
explicitly
- when you do induction, you must:
- clearly write down the statement $S(n)$ over which you
are inducting -- the hint will be if the thing to be
proven has the structure $\forall n\in\NN\ S(n)$.
- make sure you do a reasonable base case
- clearly enunciate the logic of each step, with lots of
transition words/phrases
- be careful with induction, if you are not, you can
make mistakes — e.g., in class we discussed an
inductive proof that all pigs are yellow [which is unfortunately
incorrect ... extra credit points to whomever can find the flaw
in the proof!] — so your best bet is to stick carefully
to the standard structure of induction proofs and to check over
each step very carefully
- discussion of where incautious induction can lead to false proofs
(e.g., the proof that all pigs are yellow)
- elementary matrices
- the Fundamental Theorem of Invertible Matrices (version
1.0)
- discussion about how it is a very good idea to read the proofs
in the book, they will be a source of inspiration for your
own proofs in the future.
- T:
- Read: §3.5
- Content:
- discussed why the "all pigs are yellow" proof fails -- the
inductive step doesn't work unless $n > 2$, so either that step
needs a better proof, or one needs a different base case.
- the idea of a subspace of $\RR^n$
- examples of subspaces of $\RR^2$ (in fact, these are all
possible subspaces):
- $\{\vec{0}\}$, the trivial subspace
- any line through the origin
- all of $\RR^2$
- notice all subspaces of $\RR^n$ have either exactly one vector in
them (in which case we're talking about the trivial subspace), or
an infinite number of vectors
- $\forall n,k\in\NN$ and
$\forall\vec{v}_1,\dots,\vec{v}_k\in\RR^n$,
$\Span(\vec{v}_1,\dots,\vec{v_k})$ is a subspace of $\RR^n$
- subspaces associated with a given matrix:
- the row space
- the column space
- Journal 3 on §§3.5 & 3.6 is NOT due this
week... but don't forget to start thinking about it, there is a lot of
material in these two sections. It will be due next Tuesday.
- Miniquiz 8
- W:
- [Re]Read: §3.5
- Content:
- note that the definition of a subspce of $\RR^n$ would be
equivalent to the one we use even without the specific requirement
that $\vec{0}$ is in the subset, as long as the other parts are
retained
- basis, examples of bases
- dimension, computations of dimensions for simple cases
- Miniquiz 9
- F:
- [Re]Read: §3.5
- Content:
- rank
- the Fundamental Theorem of Invertible Matrices 2.0
- Hand in HW5: 3.5.4, 3.5.34
- Maxiquiz 4 today
- M:
- Read: §3.6
- Content:
- going over Maxiquiz 4
- the null space of a matrix
- nullity
- The Rank[-Nullity] Theorem
- Hand in HW6: 3.5.56, 3.5.60 (these are serious problems
— don't hesitate to contact me and ask for a hint).
- T:
- [Re]Read: §3.6
- Content:
- The Basis Theorem
- coordinates w.r.t. a basis (what amounts to Theorem
3.29 in §3.5)
- a linear transformation
- examples of linear transformations:
- the trivial transformation which sends every input to
$\vec{0}$.
- some random formulæ
- rotations of $\RR^2$
- reflections of $\RR^2$
- a Proposition: If $f:\RR^n\to\RR^M$ is a linear
transformation, then $f(\vec{0})=\vec{0}$.
- Journal 3 on §3.5 is due today
- Miniquiz 10
- W:
- [Re]Read: §3.6
- Content:
- more examples of linear transformations
- a linear transformation coming from matrix multiplication —
what the book (and almost no one else) calls a "matrix
transformation"
- a linear transformation is determined by what it does to a basis
- the matrix $[T]$ of a linear transformation $T$, with
examples:
- a counterclockwise rotation of $\RR^2$ by the angle $\theta$
has matrix $\begin{pmatrix}\cos\theta&\sin\theta\\ -\sin\theta&\cos\theta\end{pmatrix} $.
- a reflection of $\RR^2$ across the $y$-axis has matrix
$\begin{pmatrix}-1&0\\ 0&1\end{pmatrix}$ .
- projection onto the $x$-axis in $\RR^2$ has matrix
$\begin{pmatrix}1&0\\ 0&0\end{pmatrix}$ .
- composition of linear transformations
- it's linear, too
- its matrix is the product of the matrices of the consituent
transformations
- Miniquiz 11
- F:
- Read: §4.2
- Content:
- recall about determinants:
- the determinant determines if a matrix is
invertible: $\det(A)=0\ \Leftrightarrow\ A$ is invertible.
- $\forall A,B,\ \det(AB)=\det(A)\cdot\det(B)$ — which is
amazing, because matrix multiplication is highly
non-commutative, while multiplication of real numbers is
commutative, yet $\det(\cdot)$ turns one into the other
- Maxiquiz 5 today
- Hand in HW7: 3.6.4, 3.6.8, 3.6.44
- M:
- [Re]Read: §4.2 and Read: §4.1
- Content:
- going over Maxiquiz 5
- the identity transformation of $\RR^n$
- the inverse of a linear/matrix transformation
- definition of the determinant
- for $1\times 1$ matrices
- for $2\times 2$ matrices
- recursively for $n\times n$ matrices, where $n\ge 3$ —
which is essentially Laplace's Expansion Theorem
- [there is actually a direct (=non-recursive) formula]
- properties of determinants:
- $\det(A)=0\ \Leftrightarrow\ A$ is invertible.
- $\forall A,\ \det(A)=\det(A^T)$
- $\forall A,B,\ \det(AB)=\det(A)\cdot\det(B)$
- determinants for triangular matrices
- Miniquiz 12
- T:
- [Re]Read: §4.1 and Read: §4.3
- Content:
- eigenvectors, eigenvalues, and eigenspaces
- an eigenspace is always a subspace of $\RR^n$; in fact, it is
the nullspace of $A-\lambda I$.
- the characteristic polynomial/equation of an $n\times n$
matrix
- the algebraic multiplicity of an eigenvalue
- Journal 4 on §§3.6 & 4.2 is due today
- Hand in HW8: 4.2.53, 4.2.54, 4.2.69
- Miniquiz 13
- W:
- [Re]Read: §4.4 and Read: §4.4
- Content:
- the geometric multiplicity of an eigenvalue
- eigenvalues of triangular matrices
- eigenvalues of invertible matrices
- linear independence of eigenvectors corresponding to distinct
eigenvalues
- how eigenvalues (don't) change when we change the matrix:
similar matrices
- properties of matrix similarity:
- reflexive
- symmetric
- transitive
- ...so it's an equivalence relation
- common properties of similar matrices
- diagonalizable matrices
- building a basis for the ambient $\RR^n$ out of bases of all
eigenspaces of an $n\times n$ matrix
- an inequality between the algebraic and geometric multiplicities
of an eigenvalue
- The Diagonalization Theorem
- Miniquiz 14
- F:
- [Re]Read: §4.3
- Content:
-
- Maxiquiz 6 today
- Hand in HW9: 4.1.35, 4.1.37, 4.3.20-22
- M:
- Content:
- going over Maxiquiz 6
- review for Midterm I; see this
review sheet
- discuss HW10 — you are responsible for these problems
for tomorrow's midterm!
- Journal 5 on §§4.1 & 4.3 is due today —
show it to me or submit it electronically, but you can keep it to
study from, if you like, and hand it in for real tomorrow
- Miniquiz 15
- T:
- Hand in Journal 5, if you are doing it on paper
- Hand in HW10: 4.4.40-42, 4.4.47-48
- Midterm I in class today
- W:
- Read: §5.1
- Content:
- going over Midterm I
- orthogonal sets of vectors in $\RR^n$
- F:
- [Re}Read: §5.1
- Content:
- orthogonal and linearly independent sets of vectors in $\RR^n$
- an orthonormal basis [ONB]
- coordinates with respect to an ONB
- orthogonal matrices:
- definition
- alternative characterizations
- their effect on the dot product or the norm
- the set of such is closed under products and inverses
[Hence we call the set of $n\times n$ orthogonal matrices
the orthogonal group and write it $O(n)$.]
- determinants of orthogonal matrices
- Hand in revised solutions to Midterm 1, if you like
- Miniquiz 16
- NOTE: Friday is the last day to withdraw (with a W) from
classes
- Spring Break! No classes, of course.
- Exam week, no classes.
- Our FINAL EXAM is scheduled for Monday, April 30th
and Tuesday, May 1st, both 8:00-10:20 in our usual classroom.