Math 260, Fall 2019, Assignment 9
From cartan.math.umb.edu
The moving power of mathematical invention is not reasoning but the imagination.
- - Augustus de Morgan
Read:[edit]
- Section 3.3.
Carefully define the following terms, then give one example and one non-example of each:[edit]
- Basis (for a subspace $S$).
- Dimension (of a subspace $S$).
- Coordinates (of a vector $\vec{v}$, with respect to the basis $\mathcal{B}=(\vec{v}_1,\dots,\vec{v}_k)$).
- $[\vec{v}]_{\mathcal{B}}$ (the coordinate vector of $\vec{v}$ with respect to the basis $\mathcal{B}=(\vec{v}_1,\dots,\vec{v}_k)$).
Carefully state the following theorems (you do not need to prove them):[edit]
- Theorem relating the size of a linearly independent set (in a given subspace $S$) to the size of a spanning set (for the same subspace $S$).
- Theorem relating the sizes of two bases for the same subspace $S$.
- Theorem concerning the refinement of spanning sets to bases.
- Theorem concerning the extension of linearly independent sets to bases.
- Theorem relating the dimensions of $V$ and $W$, when $V\subseteq W$.
- Theorem relating $V$ and $W$, when $V\subseteq W$ and $\dim V=\dim W$.
- Theorem concerning the unique expansion of $\vec{v}\in S$ as a linear combination of the vectors in a basis $\mathcal{B}=(\vec{v}_1,\dots,\vec{v}_k)$ for $S$.
Solve the following problems:[edit]
- Section 3.3, problems 1, 5, 7, 9, 15, 25, 27, 29, 30, and 33.
- Section 3.4, problems 1 and 3.
- Suppose $S$ is a $d$-dimensional subspace of $\mathbb{R}^n$. Is it possible to span $S$ with fewer than $d$ vectors? Carefully prove your answer.
- Suppose $S$ is a $d$-dimensional subspace of $\mathbb{R}^n$. Is it possible to make a list of more than $d$ linearly independent vectors in $S$? Carefully prove your answer.