Skip to content

Commit 284e2a5

Browse files
Tom's Jan 4 edits of SVD lecture
1 parent 4562461 commit 284e2a5

File tree

1 file changed

+90
-7
lines changed

1 file changed

+90
-7
lines changed

lectures/svd_intro.md

Lines changed: 90 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ A **singular value decomposition** of an $m \times n$ matrix $X$ of rank $p \leq
8282

8383
$$
8484
X = U \Sigma V^T
85-
$$
85+
$$ (eq:SVD101)
8686
8787
where
8888
@@ -114,10 +114,17 @@ The matrices $U,\Sigma,V$ entail linear transformations that reshape in vectors
114114
* multiplying vectors by the unitary matrices $U$ and $V$ **rotate** them, but leave **angles between vectors** and **lengths of vectors** unchanged.
115115
* multiplying vectors by the diagonal matrix $\Sigma$ leaves **angles between vectors** unchanged but **rescales** vectors.
116116
117-
Taken together the structure that the SVD provides for $X$ opens the door to constructing systems
117+
Thus, representation {eq}`eq:SVD101` asserts that multiplying an $n \times 1$ vector $y$ by the $m \times n$ matrix $X$
118+
amounts to performing the following three multiplcations of $y$ sequentially:
119+
120+
* **rotating** $y$ by computing $V^T y$
121+
* **rescaling** $V^T y$ by multipying it by $\Sigma$
122+
* **rotating** $\Sigma V^T y$ by multiplying it by $U$
123+
124+
This structure of the $m \times n$ matrix $X$ opens the door to constructing systems
118125
of data **encoders** and **decoders**, an idea that we shall apply later in this lecture.
119126
120-
What we have described here is called a **full** SVD.
127+
What we have described above is called a **full** SVD.
121128
122129
123130
@@ -131,6 +138,9 @@ Before we study a **reduced** SVD we'll say a little more about properties of a
131138
## Four Fundamental Subspaces
132139
133140
141+
Let ${\mathcal C}$ denote a column space, ${\mathcal N}$ denote a null space, and ${\mathcal R}$ denote a row space.
142+
143+
134144
Let's start by recalling the four fundamental subspaces of an $m \times n$
135145
matrix $X$ of rank $p$.
136146
@@ -167,9 +177,83 @@ V_L & = \begin{bmatrix}v_1 & \cdots & v_p \end{bmatrix} , \quad U_R = \begin{b
167177
$$
168178
169179
180+
Representation {eq}`eq:fullSVDpartition` implies that
181+
182+
$$
183+
X \begin{bmatrix} V_L & V_R \end{bmatrix} = \begin{bmatrix} U_L & U_R \end{bmatrix} \begin{bmatrix} \Sigma_p & 0 \cr 0 & 0 \end{bmatrix}
184+
$$
185+
186+
or
187+
188+
$$
189+
\begin{aligned}
190+
X V_L & = U_L \Sigma_p \cr
191+
X V_R & = 0
192+
\end{aligned}
193+
$$ (eq:Xfour1a)
194+
195+
or
196+
197+
$$
198+
\begin{aligned}
199+
X v_i & = \sigma_i u_i , \quad i = 1, \ldots, p \cr
200+
X v_i & = 0 , \quad i = p+1, \ldots, n
201+
\end{aligned}
202+
$$ (eq:orthoortho1)
203+
204+
Equations {eq}`eq:orthoortho1` tell how the transformation $X$ maps a pair of orthonormal vectors $v_i, v_j$ for $i$ and $j$ both less than or equal to the rank $p$ of $X$ into a pair of orthonormal vectors $u_i, u_j$.
205+
206+
Equations {eq}`eq:Xfour1a` assert that
207+
208+
$$
209+
\begin{aligned}
210+
{\mathcal C}(X) & = {\mathcal C}(U_L) \cr
211+
{\mathcal N}(X) & = {\mathcal C} (V_R)
212+
\end{aligned}
213+
$$
214+
215+
216+
Taking transposes on both sides of representation {eq}`eq:fullSVDpartition` implies
217+
218+
219+
$$
220+
X^T \begin{bmatrix} U_L & U_R \end{bmatrix} = \begin{bmatrix} V_L & V_R \end{bmatrix} \begin{bmatrix} \Sigma_p & 0 \cr 0 & 0 \end{bmatrix}
221+
$$
222+
223+
or
224+
225+
$$
226+
\begin{aligned}
227+
X^T U_L & = V_L \Sigma_p \cr
228+
X^T U_R & = 0
229+
\end{aligned}
230+
$$ (eq:Xfour1b)
231+
232+
or
233+
234+
$$
235+
\begin{aligned}
236+
X^T u_i & = \sigma_i v_i, \quad i=1, \ldots, p \cr
237+
X^T u_i & = 0 \quad i= p+1, \ldots, m
238+
\end{aligned}
239+
$$ (eq:orthoortho2)
240+
241+
Notice how equations {eq}`eq:orthoortho2` assert that the transformation $X^T$ maps a pairsof distinct orthonormal vectors $u_i, u_j$ for $i$ and $j$ both less than or equal to the rank $p$ of $X$ into a pair of distinct orthonormal vectors $v_i, v_j$ .
242+
243+
244+
Equations {eq}`eq:Xfour1b` assert that
245+
246+
$$
247+
\begin{aligned}
248+
{\mathcal R}(X) & \equiv {\mathcal C}(X^T) = {\mathcal C} (V_L) \cr
249+
{\mathcal N}(X^T) & = {\mathcal C}(U_R)
250+
\end{aligned}
251+
$$
252+
170253
171254
172-
These matrices are related to the four fundamental subspaces of $X$ in the following ways:
255+
Thus, taken together, the systems of quations {eq}`eq:Xfour1a` and {eq}`eq:Xfour1b`
256+
describe the four fundamental subspaces of $X$ in the following ways:
173257
174258
$$
175259
\begin{aligned}
@@ -182,7 +266,6 @@ $$
182266
$$ (eq:fourspaceSVD)
183267
184268
185-
Here ${\mathcal C}$ denotes a column space, ${\mathcal N}$ denotes a null space, and ${\mathcal R}$ denotes a row space.
186269
187270
Since $U$ and $V$ are both orthonormal matrices, collection {eq}`eq:fourspaceSVD` asserts that
188271
@@ -192,9 +275,9 @@ Since $U$ and $V$ are both orthonormal matrices, collection {eq}`eq:fourspaceSVD
192275
* $V_R$ is an orthonormal basis for the null space of $X$
193276
194277
195-
The four claims in {eq}`eq:fourspaceSVD` can be verified by performing the multiplications called for by the right side of {eq}`eq:fullSVDpartition` and interpreting them.
278+
We have verified the four claims in {eq}`eq:fourspaceSVD` simply by performing the multiplications called for by the right side of {eq}`eq:fullSVDpartition` and reading them.
196279
197-
Although we won't go through the details of that verification here, we will note that the claims in {eq}`eq:fourspaceSVD` and the fact that $U$ and $V$ are both unitary (i.e, orthonormal) matrices immediately implies
280+
The claims in {eq}`eq:fourspaceSVD` and the fact that $U$ and $V$ are both unitary (i.e, orthonormal) matrices imply
198281
that
199282
200283
* the column space of $X$ is orthogonal to the null space of of $X^T$

0 commit comments

Comments
 (0)