Chapter 5

Norms, Inner Products, and Orthogonality

[208/100%]
Show
LaTeX
Problem 5.1.1

Find the 1-, 2-, and ∞\infty-norms of x=(21−4−2)x = \begin{pmatrix} 2 \\ 1 \\ -4 \\ -2 \end{pmatrix} and x=(1+i1−i14i)x = \begin{pmatrix} 1+i \\ 1-i \\ 1 \\ 4i \end{pmatrix}.

?
(a)
(b)
Problem 5.1.2

Consider the euclidean norm with u=(21−4−2)u = \begin{pmatrix} 2 \\ 1 \\ -4 \\ -2 \end{pmatrix} and v=(1−11−1)v = \begin{pmatrix} 1 \\ -1 \\ 1 \\ -1 \end{pmatrix}.

?
(a)

Determine the distance between uu and vv.

(b)

Verify that the triangle inequality holds for uu and vv.

(c)

Verify that the CBS inequality holds for uu and vv.

Problem 5.1.3

Show that (α1+α2+⋯+αn)2≤n(α12+α22+⋯+αn2)\left(\alpha_{1} + \alpha_{2} + \cdots + \alpha_{n}\right)^{2} \leq n \left(\alpha_{1}^{2} + \alpha_{2}^{2} + \cdots + \alpha_{n}^{2}\right) for αi∈R\alpha_{i} \in \mathbb {R}.

?
Problem 5.1.4
?
(a)

Using the euclidean norm, describe the solid ball in Rn\mathbb {R}^{n} centered at the origin with unit radius.

(b)

Describe a solid ball centered at the point c=(ξ1  ξ2  ⋯  ξn)c = \left(\xi_{1} \; \xi_{2} \; \cdots \; \xi_{n}\right) with radius ρ\rho.

Problem 5.1.5

If x,y∈Rnx, y \in \mathbb {R}^{n} such that ∥x−y∥2=∥x+y∥2\left\| x-y\right\|_{2} = \left\| x+y\right\|_{2}, what is xTyx^{T}y?

?
Problem 5.1.6

Explain why ∥x−y∥=∥y−x∥\left\| x-y\right\| = \left\| y-x\right\| is true for all norms.

?
Problem 5.1.7

For every vector norm on Cn\mathbb {C}^{n}, prove that ∥v∥\left\| v\right\| depends continuously on the components of vv in the sense that for each ε>0\varepsilon > 0, there corresponds a δ>0\delta > 0 such that ∣∥x∥−∥y∥∣<ε\left|\left\| x\right\| - \left\| y\right\| \right| < \varepsilon whenever ∣xi−yi∣<δ\left|x_{i} - y_{i}\right| < \delta for each ii.

?
Problem 5.1.8
?
(a)

For x∈Cn×1x \in \mathbb {C}^{n \times 1}, explain why ∥x∥1≥∥x∥2≥∥x∥∞\left\| x\right\|_{1} \geq \left\| x\right\|_{2} \geq \left\| x\right\|_{\infty }.

(b)

For x∈Cn×1x \in \mathbb {C}^{n \times 1}, show that ∥x∥i≤α∥x∥j\left\| x\right\|_{i} \leq \alpha \left\| x\right\|_{j}, where α\alpha is the (i,j)(i,j)-entry in the following matrix. (See Exercise 5.12.3 for a similar statement regarding matrix norms.)

([ccc]12∞1∗nn2∗∗n∞∗∗∗) \begin{pmatrix} [ccc] & 1 & 2 & \infty \\ 1 & * & \sqrt{n} & n \\ 2 & * & * & \sqrt{n} \\ \infty & * & * & * \end{pmatrix}
Problem 5.1.9

For x,y∈Cnx, y \in \mathbb {C}^{n}, x≠0x \neq 0, explain why equality holds in the CBS inequality if and only if y=αxy = \alpha x, where α=x∗y/x∗x\alpha = x^{*}y / x^{*}x.

?
Remark.
?

Formula (5.1.4), from the proof of the CBS inequality, states that for α=x∗y/x∗x\alpha = x^{*}y/x^{*}x,

0≤∥αx−y∥2=∥y∥2∥x∥2−(x∗y)(y∗x)∥x∥2. 0 \leq \left\| \alpha x - y\right\| _{2} = \left\| y\right\| _{2}\left\| x\right\| _{2} - \frac{(x^{*}y)(y^{*}x)}{\left\| x\right\| _{2}}.
Problem 5.1.10

For nonzero vectors x,y∈Cnx, y \in \mathbb {C}^{n} with the euclidean norm, prove that equality holds in the triangle inequality if and only if y=αxy = \alpha x, where α\alpha is real and positive.

?
Problem 5.1.11

Use Holder's inequality

∣x∗y∣≤∥x∥p∥y∥q \left|x^{*}y\right| \leq \left\| x\right\| _{p}\left\| y\right\| _{q}

(where p>1p>1, q>1q>1, 1/p+1/q=11/p+1/q=1) to prove that if the components of x∈Rn×1x \in \mathbb {R}^{n \times 1} sum to zero (i.e., xTe=0x^{T}e = 0 for eT=(1,1,…,1)e^{T} = (1,1,\ldots ,1)), then

∣xTy∣≤∥x∥1(ymax⁡−ymin⁡2) \left|x^{T}y\right| \leq \left\| x\right\| _{1} \left(\frac{y_{\max }-y_{\min }}{2}\right)

for all y∈Rn×1y \in \mathbb {R}^{n \times 1}.

?
Remark.
?

For "zero sum" vectors xx, this bound is at least as sharp, and usually sharper, than Holder's inequality itself, because (ymax⁡−ymin⁡)/2≤max⁡i∣yi∣=∥y∥∞(y_{\max }-y_{\min })/2 \leq \max_{i} \left|y_{i}\right| = \left\| y\right\|_{\infty }.

Problem 5.1.12

The classical form of Holder's inequality states that if p>1p>1 and q>1q>1 are real numbers such that 1/p+1/q=11/p+1/q=1, then

∑i=1n∣xiyi∣≤(∑i=1n∣xi∣p)1/p(∑i=1n∣yi∣q)1/q. \sum _{i=1}^{n} \left|x_{i}y_{i}\right| \leq \left(\sum _{i=1}^{n} \left|x_{i}\right|^{p}\right)^{1/p} \left(\sum _{i=1}^{n} \left|y_{i}\right|^{q}\right)^{1/q}.

Derive this inequality by executing the following steps:

?
(a)

By considering the function f(t)=(1−λ)+λt−tλf(t) = (1-\lambda ) + \lambda t - t^{\lambda } for 0<λ<10 < \lambda < 1, establish the inequality

αλβ1−λ≤λα+(1−λ)β \alpha ^{\lambda }\beta ^{1-\lambda } \leq \lambda \alpha + (1-\lambda )\beta

for nonnegative real numbers α\alpha and β\beta.

(b)

Let x^=x/∥x∥p\hat{x} = x/\left\| x\right\|_{p} and y^=y/∥y∥q\hat{y} = y/\left\| y\right\|_{q}, and apply the inequality of part (a) to obtain

∑i=1n∣x^iy^i∣≤1p∑i=1n∣x^i∣p+1q∑i=1n∣y^i∣q=1. \sum _{i=1}^{n} \left|\hat{x}_{i}\hat{y}_{i}\right| \leq \frac{1}{p}\sum _{i=1}^{n} \left|\hat{x}_{i}\right|^{p} + \frac{1}{q}\sum _{i=1}^{n} \left|\hat{y}_{i}\right|^{q} = 1.
(c)

Deduce the classical form of Holder's inequality, and then explain why this means that ∣x∗y∣≤∥x∥p∥y∥q\left|x^{*}y\right| \leq \left\| x\right\|_{p}\left\| y\right\|_{q}.

Problem 5.1.13

The triangle inequality ∥x+y∥p≤∥x∥p+∥y∥p\left\| x+y\right\|_{p} \leq \left\| x\right\|_{p}+\left\| y\right\|_{p} for a general pp-norm is really the classical Minkowski inequality, which states that for p≥1p \geq 1,

(∑i=1n∣xi+yi∣p)1/p≤(∑i=1n∣xi∣p)1/p+(∑i=1n∣yi∣p)1/p. \left(\sum _{i=1}^{n} \left|x_{i}+y_{i}\right|^{p}\right)^{1/p} \leq \left(\sum _{i=1}^{n} \left|x_{i}\right|^{p}\right)^{1/p} + \left(\sum _{i=1}^{n} \left|y_{i}\right|^{p}\right)^{1/p}.

Derive Minkowski's inequality.

?
Problem 5.2.1

Evaluate the Frobenius matrix norm for each matrix below.

A=(1−2−12),B=(010001100),C=(4−24−21−24−24). A = \begin{pmatrix} 1 & -2 \\ -1 & 2 \end{pmatrix}, \quad B = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{pmatrix}, \quad C = \begin{pmatrix} 4 & -2 & 4 \\ -2 & 1 & -2 \\ 4 & -2 & 4 \end{pmatrix}.
?
Problem 5.2.2

Evaluate the induced 1-, 2-, and ∞\infty-matrix norm for each of the three matrices given in Exercise 5.2.1: A=(1−2−12)A = \begin{pmatrix} 1 & -2 \\ -1 & 2 \end{pmatrix}, B=(010001100)B = \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \end{pmatrix}, C=(4−24−21−24−24)C = \begin{pmatrix} 4 & -2 & 4 \\ -2 & 1 & -2 \\ 4 & -2 & 4 \end{pmatrix}.

?
(a)
(b)
(c)
Problem 5.2.3
?
(a)

Explain why ∥I∥=1\left\| I\right\| = 1 for every induced matrix norm ∥A∥=max⁡∥x∥=1∥Ax∥\left\| A\right\| = \max_{\left\| x\right\| =1} \left\| Ax\right\|.

(b)

What is ∥In×n∥F\left\| I_{n \times n}\right\|_{F}?

Problem 5.2.4

Explain why ∥A∥F=∥A∗∥F\left\| A\right\|_{F} = \left\| A^{*}\right\|_{F} for the Frobenius matrix norm ∥A∥F2=∑i,j∣aij∣2=trace⁡(A∗A)\left\| A\right\|_{F}^{2} = \sum_{i,j} \left|a_{ij}\right|^{2} = \operatorname {trace}(A^{*}A).

?
Problem 5.2.5

For matrices AA and BB and for vectors xx, establish the following compatibility properties between a vector norm defined on every Cp\mathbb {C}^{p} and the associated induced matrix norm ∥A∥=max⁡∥x∥=1∥Ax∥\left\| A\right\| = \max_{\left\| x\right\| =1} \left\| Ax\right\|.

?
(a)

Show that ∥Ax∥≤∥A∥∥x∥\left\| Ax\right\| \leq \left\| A\right\| \left\| x\right\|.

(b)

Show that ∥AB∥≤∥A∥∥B∥\left\| AB\right\| \leq \left\| A\right\| \left\| B\right\|.

(c)

Explain why ∥A∥=max⁡∥x∥≤1∥Ax∥\left\| A\right\| = \max_{\left\| x\right\| \leq 1} \left\| Ax\right\|.

Problem 5.2.6

Establish the following properties of the matrix 2-norm.

?
(a)

∥A∥2=max⁡∥x∥2=1,∥y∥2=1∣y∗Ax∣\left\| A\right\|_{2} = \max_{\left\| x\right\|_{2}=1, \left\| y\right\|_{2}=1} \left|y^{*}Ax\right|,

(b)

∥A∥2=∥A∗∥2\left\| A\right\|_{2} = \left\| A^{*}\right\|_{2},

(c)

∥A∗A∥2=∥A∥22\left\| A^{*}A\right\|_{2} = \left\| A\right\|_{2}^{2},

(d)

∥([cc]A00B)∥2=max⁡{∥A∥2,∥B∥2}\left\| \begin{pmatrix} [cc] A & 0 \\ 0 & B \end{pmatrix}\right\|_{2} = \max \left\{ \left\| A\right\|_{2}, \left\| B\right\|_{2}\right\} (take A,BA, B to be real),

(e)

∥U∗AV∥2=∥A∥2\left\| U^{*}AV\right\|_{2} = \left\| A\right\|_{2} when UU∗=IUU^{*} = I and V∗V=IV^{*}V = I.

Problem 5.2.7

Using the induced matrix norm ∥A∥=max⁡∥x∥=1∥Ax∥\left\| A\right\| = \max_{\left\| x\right\| =1} \left\| Ax\right\|, prove that if AA is nonsingular, then

∥A∥=1min⁡∥x∥=1∥A−1x∥or, equivalently,∥A−1∥=1min⁡∥x∥=1∥Ax∥. \left\| A\right\| = \frac{1}{\min _{\left\| x\right\| =1} \left\| A^{-1}x\right\| } \quad \text{or, equivalently,} \quad \left\| A^{-1}\right\| = \frac{1}{\min _{\left\| x\right\| =1} \left\| Ax\right\| }.
?
Problem 5.2.8

For A∈Cn×nA \in \mathbb {C}^{n \times n} and a parameter z∈Cz \in \mathbb {C}, the matrix R(z)=(zI−A)−1R(z) = (zI-A)^{-1} is called the resolvent of AA. Prove that if ∣z∣>∥A∥\left|z\right| > \left\| A\right\| for any induced matrix norm, then

∥R(z)∥≤1∣z∣−∥A∥. \left\| R(z)\right\| \leq \frac{1}{\left|z\right| - \left\| A\right\| }.
?
Remark.
?

The backward triangle inequality (Example 5.1.1) states that ∣∥x∥−∥y∥∣≤∥x−y∥\left|\left\| x\right\| -\left\| y\right\| \right| \leq \left\| x-y\right\|.

Problem 5.3.1

For x=(x1x2x3)x = \begin{pmatrix} x_{1} \\ x_{2} \\ x_{3} \end{pmatrix}, y=(y1y2y3)y = \begin{pmatrix} y_{1} \\ y_{2} \\ y_{3} \end{pmatrix}, determine which of the following are inner products for R3×1\mathbb {R}^{3 \times 1}.

?
(a)

⟨x,y⟩=x1y1+x3y3\left\langle x, y \right\rangle = x_{1}y_{1} + x_{3}y_{3},

(b)

⟨x,y⟩=x1y1−x2y2+x3y3\left\langle x, y \right\rangle = x_{1}y_{1} - x_{2}y_{2} + x_{3}y_{3},

(c)

⟨x,y⟩=2x1y1+x2y2+4x3y3\left\langle x, y \right\rangle = 2x_{1}y_{1} + x_{2}y_{2} + 4x_{3}y_{3},

(d)

⟨x,y⟩=x12y12+x22y22+x32y32\left\langle x, y \right\rangle = x_{1}^{2}y_{1}^{2} + x_{2}^{2}y_{2}^{2} + x_{3}^{2}y_{3}^{2}.

Remark.
?

An inner product on a real vector space VV is a function ⟨x,y⟩\left\langle x, y \right\rangle of ordered pairs of vectors satisfying: ⟨x,x⟩\left\langle x, x \right\rangle is real with ⟨x,x⟩≥0\left\langle x, x \right\rangle \geq 0, and ⟨x,x⟩=0\left\langle x, x \right\rangle = 0 if and only if x=0x = 0; ⟨x,αy⟩=α⟨x,y⟩\left\langle x, \alpha y \right\rangle = \alpha \left\langle x, y \right\rangle for all scalars α\alpha; ⟨x,y+z⟩=⟨x,y⟩+⟨x,z⟩\left\langle x, y+z \right\rangle = \left\langle x, y \right\rangle + \left\langle x, z \right\rangle; and ⟨x,y⟩=⟨y,x⟩\left\langle x, y \right\rangle = \left\langle y, x \right\rangle.

Problem 5.3.2

For a general inner-product space VV, explain why each of the following statements must be true.

?
(a)

If ⟨x,y⟩=0\left\langle x, y \right\rangle = 0 for all x∈Vx \in V, then y=0y = 0.

(b)

⟨αx,y⟩=α⟨x,y⟩\left\langle \alpha x, y \right\rangle = \alpha \left\langle x, y \right\rangle for all x,y∈Vx, y \in V and for all scalars α\alpha.

(c)

⟨x+y,z⟩=⟨x,z⟩+⟨y,z⟩\left\langle x+y, z \right\rangle = \left\langle x, z \right\rangle + \left\langle y, z \right\rangle for all x,y,z∈Vx, y, z \in V.

Problem 5.3.3

Let VV be an inner-product space with an inner product ⟨x,y⟩\left\langle x, y \right\rangle. Explain why the function defined by ∥⋆∥=⟨⋆,⋆⟩\left\| \star \right\| = \sqrt{ \left\langle \star , \star \right\rangle } satisfies the first two general-matrix-norm properties ∥A∥≥0\left\| A\right\| \geq 0 with ∥A∥=0  ⟺  A=0\left\| A\right\| =0 \iff A=0, and ∥αA∥=∣α∣∥A∥\left\| \alpha A\right\| = \left|\alpha \right|\left\| A\right\|.

?
Problem 5.3.4

For a real inner-product space with ∥⋆∥2=⟨⋆,⋆⟩\left\| \star \right\|^{2} = \left\langle \star , \star \right\rangle, derive the inequality

⟨x,y⟩≤∥x∥2+∥y∥22. \left\langle x, y \right\rangle \leq \frac{\left\| x\right\| ^{2}+\left\| y\right\| ^{2}}{2}.
?
Problem 5.3.5

For n×nn \times n matrices AA and BB, explain why each of the following inequalities is valid.

?
(a)

∣trace⁡(B)∣2≤n trace⁡(B∗B)\left|\operatorname {trace}(B)\right|^{2} \leq n \, \operatorname {trace}(B^{*}B).

(b)

trace⁡(B2)≤trace⁡(BTB)\operatorname {trace}(B^{2}) \leq \operatorname {trace}(B^{T}B) for real matrices.

(c)

trace⁡(ATB)≤trace⁡(ATA)+trace⁡(BTB)2\operatorname {trace}(A^{T}B) \leq \dfrac {\operatorname {trace}(A^{T}A) + \operatorname {trace}(B^{T}B)}{2} for real matrices.

Remark.
?

Example 5.3.3: for A,B∈Rm×nA, B \in \mathbb {R}^{m \times n} equipped with the standard matrix inner product ⟨A,B⟩=trace⁡(ATB)\left\langle A, B \right\rangle = \operatorname {trace}(A^{T}B) and associated Frobenius norm ∥A∥F=⟨A,A⟩=trace⁡(ATA)\left\| A\right\|_{F} = \sqrt{ \left\langle A, A \right\rangle } = \sqrt{\operatorname {trace}(A^{T}A)}, the CBS inequality ⟨A,B⟩2≤∥A∥F2∥B∥F2\left\langle A, B \right\rangle^{2} \leq \left\| A\right\|_{F}^{2}\left\| B\right\|_{F}^{2} gives trace⁡(ATB)2≤trace⁡(ATA)trace⁡(BTB)\operatorname {trace}(A^{T}B)^{2} \leq \operatorname {trace}(A^{T}A)\operatorname {trace}(B^{T}B).

Problem 5.3.6

Extend the proof of the parallelogram identity's converse to include complex spaces.

?
Remark.
?

The parallelogram identity states that for a given norm ∥⋆∥\left\| \star \right\| on a vector space VV, there exists an inner product on VV such that ⟨⋆,⋆⟩=∥⋆∥2\left\langle \star , \star \right\rangle = \left\| \star \right\|^{2} if and only if ∥x+y∥2+∥x−y∥2=2(∥x∥2+∥y∥2)\left\| x+y\right\|^{2} + \left\| x-y\right\|^{2} = 2\left(\left\| x\right\|^{2}+\left\| y\right\|^{2}\right) holds for all x,y∈Vx, y \in V. For a real space satisfying this identity, the inner product recovering the norm is ⟨x,y⟩=14(∥x+y∥2−∥x−y∥2)\left\langle x, y \right\rangle = \frac{1}{4}\left(\left\| x+y\right\|^{2} - \left\| x-y\right\|^{2}\right).

Problem 5.3.7

Explain why there does not exist an inner product on Cn\mathbb {C}^{n} (n≥2n \geq 2) such that ∥⋆∥∞=⟨⋆,⋆⟩\left\| \star \right\|_{\infty } = \sqrt{ \left\langle \star , \star \right\rangle }.

?
Problem 5.3.8

Explain why the Frobenius matrix norm on Cn×n\mathbb {C}^{n \times n} must satisfy the parallelogram identity.

?
Problem 5.3.9

For n≥2n \geq 2, is either the matrix 1-, 2-, or ∞\infty-norm generated by an inner product on Cn×n\mathbb {C}^{n \times n}?

?
Problem 5.4.1

Using the standard inner product, determine which of the following pairs are orthogonal vectors in the indicated space.

?
(a)

x=(1−34)x = \begin{pmatrix} 1 \\ -3 \\ 4 \end{pmatrix} and y=(−222)y = \begin{pmatrix} -2 \\ 2 \\ 2 \end{pmatrix} in R3\mathbb {R}^{3},

(b)

x=(i1+i21−i)x = \begin{pmatrix} i \\ 1+i \\ 2 \\ 1-i \end{pmatrix} and y=(01+i−21−i)y = \begin{pmatrix} 0 \\ 1+i \\ -2 \\ 1-i \end{pmatrix} in C4\mathbb {C}^{4},

(c)

x=(1−234)x = \begin{pmatrix} 1 \\ -2 \\ 3 \\ 4 \end{pmatrix} and y=(42−11)y = \begin{pmatrix} 4 \\ 2 \\ -1 \\ 1 \end{pmatrix} in R4\mathbb {R}^{4},

(d)

x=(1+i1i)x = \begin{pmatrix} 1+i \\ 1 \\ i \end{pmatrix} and y=(1−i−3−i)y = \begin{pmatrix} 1-i \\ -3 \\ -i \end{pmatrix} in C3\mathbb {C}^{3},

(e)

x=(00⋮0)x = \begin{pmatrix} 0 \\ 0 \\ \vdots \\ 0 \end{pmatrix} and y=(y1y2⋮yn)y = \begin{pmatrix} y_{1} \\ y_{2} \\ \vdots \\ y_{n} \end{pmatrix} in Rn\mathbb {R}^{n}.

Problem 5.4.2

Find two vectors of unit norm that are orthogonal to u=(3−2)u = \begin{pmatrix} 3 \\ -2 \end{pmatrix}.

?
Problem 5.4.3

Consider the following set of three vectors:

x1=(1−102),x2=(1110),x3=(−1−120). x_{1} = \begin{pmatrix} 1 \\ -1 \\ 0 \\ 2 \end{pmatrix}, \quad x_{2} = \begin{pmatrix} 1 \\ 1 \\ 1 \\ 0 \end{pmatrix}, \quad x_{3} = \begin{pmatrix} -1 \\ -1 \\ 2 \\ 0 \end{pmatrix}.
?
(a)

Using the standard inner product in R4\mathbb {R}^{4}, verify that these vectors are mutually orthogonal.

(b)

Find a nonzero vector x4x_{4} such that {x1,x2,x3,x4}\left\{ x_{1},x_{2},x_{3},x_{4}\right\} is a set of mutually orthogonal vectors.

(c)

Convert the resulting set into an orthonormal basis for R4\mathbb {R}^{4}.

Problem 5.4.4

Using the standard inner product, determine the Fourier expansion of xx with respect to BB, where

x=(10−2),B={12(1−10),  13(111),  16(−1−12)}. x = \begin{pmatrix} 1 \\ 0 \\ -2 \end{pmatrix}, \qquad B = \left\{ \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ -1 \\ 0 \end{pmatrix}, \; \frac{1}{\sqrt{3}}\begin{pmatrix} 1 \\ 1 \\ 1 \end{pmatrix}, \; \frac{1}{\sqrt{6}}\begin{pmatrix} -1 \\ -1 \\ 2 \end{pmatrix}\right\} .
?
Problem 5.4.5

With respect to the inner product for matrices ⟨A,B⟩=trace⁡(ATB)\left\langle A, B \right\rangle = \operatorname {trace}(A^{T}B), verify that the set

B={12(0110),  12(100−1),  12(1−111),  12(11−11)} B = \left\{ \frac{1}{\sqrt{2}}\begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \; \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}, \; \frac{1}{2}\begin{pmatrix} 1 & -1 \\ 1 & 1 \end{pmatrix}, \; \frac{1}{2}\begin{pmatrix} 1 & 1 \\ -1 & 1 \end{pmatrix}\right\}

is an orthonormal basis for R2×2\mathbb {R}^{2 \times 2}, and then compute the Fourier expansion of A=(1111)A = \begin{pmatrix} 1 & 1 \\ 1 & 1 \end{pmatrix} with respect to BB.

?
Problem 5.4.6

Determine the angle between x=(2−11)x = \begin{pmatrix} 2 \\ -1 \\ 1 \end{pmatrix} and y=(112)y = \begin{pmatrix} 1 \\ 1 \\ 2 \end{pmatrix}.

?
Problem 5.4.7

Given an orthonormal basis BB for a space VV, explain why the Fourier expansion for x∈Vx \in V is uniquely determined by BB.

?
Problem 5.4.8

Explain why the columns of Un×nU_{n \times n} are an orthonormal basis for Cn\mathbb {C}^{n} if and only if U∗=U−1U^{*} = U^{-1}.

?
Remark.
?

Such matrices are said to be unitary; their properties are studied in a later section.

Problem 5.4.9

Matrices with the property A∗A=AA∗A^{*}A = AA^{*} are said to be normal (hermitian matrices as well as real symmetric matrices are included in this class). Prove that if AA is normal, then R(A)⊥N(A)\mathcal{R}(A) \perp \mathcal{N}(A) — i.e., every vector in the range of AA is orthogonal to every vector in the nullspace of AA.

?
Remark.
?

For A∈Cm×nA \in \mathbb {C}^{m \times n}, equations (4.5.5)-(4.5.6) state R(A∗A)=R(A∗)\mathcal{R}(A^{*}A) = \mathcal{R}(A^{*}), R(AA∗)=R(A)\mathcal{R}(AA^{*}) = \mathcal{R}(A), N(A∗A)=N(A)\mathcal{N}(A^{*}A) = \mathcal{N}(A), and N(AA∗)=N(A∗)\mathcal{N}(AA^{*}) = \mathcal{N}(A^{*}).

Problem 5.4.10

Using the trace inner product ⟨A,B⟩=trace⁡(ATB)\left\langle A, B \right\rangle = \operatorname {trace}(A^{T}B), determine the angle between the following pairs of matrices.

?
(a)

I=(1001)I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} and B=(1111)B = \begin{pmatrix} 1 & 1 \\ 1 & 1 \end{pmatrix}.

(b)

A=(1324)A = \begin{pmatrix} 1 & 3 \\ 2 & 4 \end{pmatrix} and B=(2−220)B = \begin{pmatrix} 2 & -2 \\ 2 & 0 \end{pmatrix}.

Problem 5.4.11

Why is the definition for cos⁡θ=⟨x,y⟩/∥x∥∥y∥\cos \theta = \left\langle x, y \right\rangle /\left\| x\right\| \left\| y\right\| not good for Cn\mathbb {C}^{n}? Explain how to define cos⁡θ\cos \theta so that it makes sense in Cn\mathbb {C}^{n}.

?
Problem 5.4.12

If {u1,u2,…,un}\left\{ u_{1}, u_{2}, \ldots , u_{n}\right\} is an orthonormal basis for an inner-product space VV, explain why

⟨x,y⟩=∑i⟨x,ui⟩⟨ui,y⟩ \left\langle x, y \right\rangle = \sum _{i} \left\langle x, u_{i} \right\rangle \left\langle u_{i}, y \right\rangle

holds for every x,y∈Vx, y \in V.

?
Problem 5.4.13

Consider a real inner-product space, where ∥⋆∥2=⟨⋆,⋆⟩\left\| \star \right\|^{2} = \left\langle \star , \star \right\rangle.

?
(a)

Prove that if ∥x∥=∥y∥\left\| x\right\| = \left\| y\right\|, then (x+y)⊥(x−y)(x+y) \perp (x-y).

(b)

For the standard inner product in R2\mathbb {R}^{2}, draw a picture of this. That is, sketch the location of x+yx+y and x−yx-y for two vectors with equal norms.

Problem 5.4.14

Let VV be a general inner-product space in which ∥⋆∥2=⟨⋆,⋆⟩\left\| \star \right\|^{2} = \left\langle \star , \star \right\rangle.

?
(a)

When VV is a real space, prove that x⊥yx \perp y if and only if ∥x+y∥2=∥x∥2+∥y∥2\left\| x+y\right\|^{2} = \left\| x\right\|^{2} + \left\| y\right\|^{2}.

(b)

Construct an example to show that one of the implications in part (a) does not hold when VV is a complex space.

(c)

When VV is a complex space, prove that x⊥yx \perp y if and only if ∥αx+βy∥2=∥αx∥2+∥βy∥2\left\| \alpha x + \beta y\right\|^{2} = \left\| \alpha x\right\|^{2} + \left\| \beta y\right\|^{2} for all scalars α\alpha and β\beta.

Problem 5.4.15

Let B={u1,u2,…,un}B = \left\{ u_{1}, u_{2}, \ldots , u_{n}\right\} be an orthonormal basis for an inner-product space VV, and let x=∑iξiuix = \sum_{i} \xi_{i}u_{i} be the Fourier expansion of x∈Vx \in V.

?
(a)

If VV is a real space, and if θi\theta_{i} is the angle between uiu_{i} and xx, explain why ξi=∥x∥cos⁡θi\xi_{i} = \left\| x\right\| \cos \theta_{i}. Sketch a picture of this in R2\mathbb {R}^{2} or R3\mathbb {R}^{3} to show why the component ξiui\xi_{i}u_{i} represents the orthogonal projection of xx onto the line determined by uiu_{i}, and thus illustrate the fact that a Fourier expansion is nothing more than simply resolving xx into mutually orthogonal components.

(b)

Derive Parseval's identity, which says ∑i=1n∣ξi∣2=∥x∥2\sum_{i=1}^{n} \left|\xi_{i}\right|^{2} = \left\| x\right\|^{2}.

Problem 5.4.16

Let B={u1,u2,…,uk}B = \left\{ u_{1}, u_{2}, \ldots , u_{k}\right\} be an orthonormal set in an nn-dimensional inner-product space VV. Derive Bessel's inequality, which says that if x∈Vx \in V and ξi=⟨ui,x⟩\xi_{i} = \left\langle u_{i}, x \right\rangle, then

∑i=1k∣ξi∣2≤∥x∥2. \sum _{i=1}^{k} \left|\xi _{i}\right|^{2} \leq \left\| x\right\| ^{2}.

Explain why equality holds if and only if x∈⟨u1,u2,…,uk⟩x \in \left\langle u_{1}, u_{2}, \ldots , u_{k}\right\rangle.

?
Problem 5.4.17

Construct an example using the standard inner product in Rn\mathbb {R}^{n} to show that two vectors xx and yy can have an angle between them that is close to π/2\pi /2 without xTyx^{T}y being close to 00.

?
Problem 5.4.18

Example 5.4.3 shows that yy is linearly correlated with xx in the sense that y≈β0e+β1xy \approx \beta_{0}e + \beta_{1}x if and only if the standardization vectors zx=(x−μxe)/σxz_{x} = (x-\mu_{x}e)/\sigma_{x} and zy=(y−μye)/σyz_{y} = (y-\mu_{y}e)/\sigma_{y} are "close" in the sense that they are almost on the same line in Rn\mathbb {R}^{n} (where μx,σx\mu_{x}, \sigma_{x} are the mean and standard deviation of xx's entries, and similarly for yy). Explain why simply measuring ∥zx−zy∥2\left\| z_{x}-z_{y}\right\|_{2} does not always gauge the degree of linear correlation.

?
Problem 5.4.19

Let θ\theta be the angle between two vectors xx and yy from a real inner-product space.

?
(a)

Prove that cos⁡θ=1\cos \theta = 1 if and only if y=αxy = \alpha x for α>0\alpha > 0.

(b)

Prove that cos⁡θ=−1\cos \theta = -1 if and only if y=αxy = \alpha x for α<0\alpha < 0.

Problem 5.4.20

With respect to the orthonormal set

B={12π,  cos⁡tπ,  cos⁡2tπ,…,  sin⁡tπ,  sin⁡2tπ,  sin⁡3tπ,…}, B = \left\{ \frac{1}{\sqrt{2\pi }}, \; \frac{\cos t}{\sqrt{\pi }}, \; \frac{\cos 2t}{\sqrt{\pi }}, \ldots , \; \frac{\sin t}{\sqrt{\pi }}, \; \frac{\sin 2t}{\sqrt{\pi }}, \; \frac{\sin 3t}{\sqrt{\pi }}, \ldots \right\} ,

determine the Fourier series expansion of the saw-toothed function defined by f(t)=tf(t) = t for −π<t<π-\pi < t < \pi (extended periodically).

The periodic extension of the saw-toothed function f(t)=t on (-\pi ,\pi ).The periodic extension of the saw-toothed function f(t)=t on (-\pi ,\pi ).

?
Problem 5.5.1

Let S=⟨x1=(111−1),  x2=(2−1−11),  x3=(−1221)⟩S = \left\langle x_{1} = \begin{pmatrix} 1 \\ 1 \\ 1 \\ -1 \end{pmatrix}, \; x_{2} = \begin{pmatrix} 2 \\ -1 \\ -1 \\ 1 \end{pmatrix}, \; x_{3} = \begin{pmatrix} -1 \\ 2 \\ 2 \\ 1 \end{pmatrix}\right\rangle.

?
(a)

Use the classical Gram-Schmidt algorithm (with exact arithmetic) to determine an orthonormal basis for SS.

(b)

Verify directly that the Gram-Schmidt sequence produced in part (a) is indeed an orthonormal basis for SS.

(c)

Repeat part (a) using the modified Gram-Schmidt algorithm, and compare the results.

Problem 5.5.2

Use the Gram-Schmidt procedure to find an orthonormal basis for the four fundamental subspaces of A=(1−23−12−46−23−69−3)A = \begin{pmatrix} 1 & -2 & 3 & -1 \\ 2 & -4 & 6 & -2 \\ 3 & -6 & 9 & -3 \end{pmatrix}.

?
Problem 5.5.3

Apply the Gram-Schmidt procedure with the standard inner product for C3\mathbb {C}^{3} to {(iii),(0ii),(00i)}\left\{ \begin{pmatrix} i \\ i \\ i \end{pmatrix}, \begin{pmatrix} 0 \\ i \\ i \end{pmatrix}, \begin{pmatrix} 0 \\ 0 \\ i \end{pmatrix}\right\}.

?
Problem 5.5.4

Explain what happens when the Gram-Schmidt process is applied to an orthonormal set of vectors.

?
Problem 5.5.5

Explain what happens when the Gram-Schmidt process is applied to a linearly dependent set of vectors.

?
Problem 5.5.6

Let A=(10−112111−3011)A = \begin{pmatrix} 1 & 0 & -1 \\ 1 & 2 & 1 \\ 1 & 1 & -3 \\ 0 & 1 & 1 \end{pmatrix} and b=(1111)b = \begin{pmatrix} 1 \\ 1 \\ 1 \\ 1 \end{pmatrix}.

?
(a)

Determine the rectangular QR factorization of AA.

(b)

Use the QR factors from part (a) to determine the least squares solution to Ax=bAx = b.

Problem 5.5.7

Given a linearly independent set of vectors S={x1,x2,…,xn}S = \left\{ x_{1},x_{2},\ldots ,x_{n}\right\} in an inner-product space, let Sk=⟨x1,x2,…,xk⟩S_{k} = \left\langle x_{1},x_{2},\ldots ,x_{k}\right\rangle for k=1,2,…,nk=1,2,\ldots ,n. Give an induction argument to prove that if Ok={u1,u2,…,uk}O_{k} = \left\{ u_{1},u_{2},\ldots ,u_{k}\right\} is the Gram-Schmidt sequence

u1=x1∥x1∥,uk+1=xk+1−∑i=1k⟨ui,xk+1⟩uiνk+1   for k>0, where νk+1=∥xk+1−∑i=1k⟨ui,xk+1⟩ui∥, u_{1} = \frac{x_{1}}{\left\| x_{1}\right\| }, \qquad u_{k+1} = \frac{x_{k+1} - \sum _{i=1}^{k} \left\langle u_{i}, x_{k+1} \right\rangle u_{i}}{\nu _{k+1}} \; \text{ for } k>0, \text{ where } \nu _{k+1} = \left\| x_{k+1}-\sum _{i=1}^{k} \left\langle u_{i}, x_{k+1} \right\rangle u_{i}\right\| ,

then OkO_{k} is indeed an orthonormal basis for Sk=⟨x1,x2,…,xk⟩S_{k} = \left\langle x_{1},x_{2},\ldots ,x_{k}\right\rangle for each k=1,2,…,nk=1,2,\ldots ,n.

?
Problem 5.5.8

Prove that if rk⁡(Am×n)=n\operatorname {rk}\left(A_{m \times n}\right) = n, then the rectangular QR factorization of AA is unique. That is, if A=QRA = QR, where Qm×nQ_{m \times n} has orthonormal columns and Rn×nR_{n \times n} is upper triangular with positive diagonal entries, then QQ and RR are unique.

?
Remark.
?

Equation (5.5.6) shows that if A=QRA = QR with QQ having orthonormal columns, then ATA=RTRA^{T}A = R^{T}R. Example 3.10.7 states that the Cholesky factorization of a positive definite matrix is unique.

Problem 5.5.9
?
(a)

Apply classical Gram-Schmidt with 3-digit floating-point arithmetic to {x1=(1010−3),x2=(100),x3=(110−30)}\left\{ x_{1} = \begin{pmatrix} 1 \\ 0 \\ 10^{-3} \end{pmatrix}, x_{2} = \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix}, x_{3} = \begin{pmatrix} 1 \\ 10^{-3} \\ 0 \end{pmatrix}\right\}. You may assume that fl⁡(2)=1.41\operatorname {fl}(\sqrt{2}) = 1.41.

(b)

Again using 3-digit floating-point arithmetic, apply the modified Gram-Schmidt algorithm to {x1,x2,x3}\left\{ x_{1},x_{2},x_{3}\right\}, and compare the result with that of part (a).

Problem 5.5.10

Depending on how the inner products rijr_{ij} are defined, verify that the following code implements both the classical and modified Gram-Schmidt algorithms applied to a set of vectors {x1,x2,…,xn}\left\{ x_{1},x_{2},\ldots ,x_{n}\right\}. For j=1j = 1 to nn uj←xju_{j} \leftarrow x_{j} For i=1i = 1 to j−1j-1 rij←{⟨ui,xj⟩(classical Gram-Schmidt)⟨ui,uj⟩(modified Gram-Schmidt)r_{ij} \leftarrow \begin{cases} \left\langle u_{i}, x_{j} \right\rangle & \text{(classical Gram-Schmidt)} \\ \left\langle u_{i}, u_{j} \right\rangle & \text{(modified Gram-Schmidt)} \end{cases} uj←uj−rijuiu_{j} \leftarrow u_{j} - r_{ij}u_{i} End rjj←∥uj∥r_{jj} \leftarrow \left\| u_{j}\right\| If rjj=0r_{jj} = 0 quit (because xj∈⟨x1,…,xj−1⟩x_{j} \in \left\langle x_{1},\ldots ,x_{j-1}\right\rangle) Else uj←uj/rjju_{j} \leftarrow u_{j}/r_{jj} End If exact arithmetic is used, will the inner products rijr_{ij} be the same for both implementations?

?
Problem 5.5.11

Let VV be the inner-product space of real-valued continuous functions defined on the interval [−1,1][-1,1], where the inner product is defined by ⟨f,g⟩=∫−11f(x)g(x) dx\left\langle f, g \right\rangle = \int_{-1}^{1} f(x)g(x)\, dx, and let SS be the subspace of VV that is spanned by the three linearly independent polynomials q0=1q_{0}=1, q1=xq_{1}=x, q2=x2q_{2}=x^{2}.

?
(a)

Use the Gram-Schmidt process to determine an orthonormal set of polynomials {p0,p1,p2}\left\{ p_{0},p_{1},p_{2}\right\} that spans SS. These polynomials are the first three normalized Legendre polynomials.

(b)

Verify that pnp_{n} satisfies Legendre's differential equation (1−x2)y′′−2xy′+n(n+1)y=0(1-x^{2})y'' - 2xy' + n(n+1)y = 0 for n=0,1,2n=0,1,2.

Problem 5.6.1

Determine which of the following matrices are isometries.

?
(a)

(1/2−1/201/61/6−2/61/31/31/3)\begin{pmatrix} 1/\sqrt{2} & -1/\sqrt{2} & 0 \\ 1/\sqrt{6} & 1/\sqrt{6} & -2/\sqrt{6} \\ 1/\sqrt{3} & 1/\sqrt{3} & 1/\sqrt{3} \end{pmatrix}.

(b)

(10110−1010)\begin{pmatrix} 1 & 0 & 1 \\ 1 & 0 & -1 \\ 0 & 1 & 0 \end{pmatrix}.

(c)

(0010100000010100)\begin{pmatrix} 0 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 0 \end{pmatrix}.

(d)

(eiθ10⋯00eiθ2⋯0⋮⋮⋱⋮00⋯eiθn)\begin{pmatrix} e^{i\theta_{1}} & 0 & \cdots & 0 \\ 0 & e^{i\theta_{2}} & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & e^{i\theta_{n}} \end{pmatrix}.

Problem 5.6.2

Is (1+i31+i6i3−2i6)\begin{pmatrix} \dfrac {1+i}{\sqrt{3}} & \dfrac {1+i}{\sqrt{6}} \\ \dfrac {i}{\sqrt{3}} & \dfrac {-2i}{\sqrt{6}} \end{pmatrix} a unitary matrix?

?
Problem 5.6.3
?
(a)

How many 3×33 \times 3 matrices are both diagonal and orthogonal?

(b)

How many n×nn \times n matrices are both diagonal and orthogonal?

(c)

How many n×nn \times n matrices are both diagonal and unitary?

Problem 5.6.4
?
(a)

Under what conditions on the real numbers α\alpha and β\beta will P=(α+ββ−αα−ββ+α)P = \begin{pmatrix} \alpha +\beta & \beta -\alpha \\ \alpha -\beta & \beta +\alpha \end{pmatrix} be an orthogonal matrix?

(b)

Under what conditions on the real numbers α\alpha and β\beta will U=(0α0iβα0iβ00iβ0αiβ0α0)U = \begin{pmatrix} 0 & \alpha & 0 & i\beta \\ \alpha & 0 & i\beta & 0 \\ 0 & i\beta & 0 & \alpha \\ i\beta & 0 & \alpha & 0 \end{pmatrix} be a unitary matrix?

Problem 5.6.5

Let UU and VV be two n×nn \times n unitary (orthogonal) matrices.

?
(a)

Explain why the product UVUV must be unitary (orthogonal).

(b)

Explain why the sum U+VU+V need not be unitary (orthogonal).

(c)

Explain why (Un×n00Vm×m)\begin{pmatrix} U_{n \times n} & 0 \\ 0 & V_{m \times m} \end{pmatrix} must be unitary (orthogonal).

Problem 5.6.6

Prove, as Cayley did in 1846, that if AA is skew hermitian (or real skew symmetric), then U=(I−A)(I+A)−1=(I+A)−1(I−A)U = (I-A)(I+A)^{-1} = (I+A)^{-1}(I-A) is unitary (orthogonal) by first showing that (I+A)−1(I+A)^{-1} exists for skew-hermitian matrices, and that (I−A)(I+A)−1=(I+A)−1(I−A)(I-A)(I+A)^{-1} = (I+A)^{-1}(I-A).

?
Remark.
?

Exercise 3.7.6 establishes that A(I+A)−1=(I+A)−1AA(I+A)^{-1} = (I+A)^{-1}A whenever I+AI+A is nonsingular. There is a more direct approach to this exercise, but it requires the diagonalization theorem for normal matrices (Exercise 7.5.5).

Problem 5.6.7

Suppose that RR and SS are elementary reflectors.

?
(a)

Is (I00R)\begin{pmatrix} I & 0 \\ 0 & R \end{pmatrix} an elementary reflector?

(b)

Is (R00S)\begin{pmatrix} R & 0 \\ 0 & S \end{pmatrix} an elementary reflector?

Problem 5.6.8
?
(a)

Explain why the standard inner product is invariant under a unitary transformation. That is, if UU is any unitary matrix, and if u=Uxu = Ux and v=Uyv = Uy, then u∗v=x∗yu^{*}v = x^{*}y.

(b)

Given any two vectors x,y∈Rnx, y \in \mathbb {R}^{n}, explain why the angle between them is invariant under an orthogonal transformation. That is, if u=Pxu = Px and v=Pyv = Py, where PP is an orthogonal matrix, then cos⁡θu,v=cos⁡θx,y\cos \theta_{u,v} = \cos \theta_{x,y}.

Problem 5.6.9

Let Um×rU_{m \times r} be a matrix with orthonormal columns, and let Vk×nV_{k \times n} be a matrix with orthonormal rows. For an arbitrary A∈Cr×kA \in \mathbb {C}^{r \times k}, solve the following problems using the matrix 2-norm and the Frobenius matrix norm.

?
(a)

Determine the values of ∥U∥2\left\| U\right\|_{2}, ∥V∥2\left\| V\right\|_{2}, ∥U∥F\left\| U\right\|_{F}, and ∥V∥F\left\| V\right\|_{F}.

(b)

Show that ∥UAV∥2=∥A∥2\left\| UAV\right\|_{2} = \left\| A\right\|_{2}.

(c)

Show that ∥UAV∥F=∥A∥F\left\| UAV\right\|_{F} = \left\| A\right\|_{F}.

Remark.
?

In particular, these properties are valid when UU and VV are unitary matrices. Because of parts (b) and (c), the 2-norm and the Frobenius norm are said to be unitarily invariant norms.

Problem 5.6.10

Let u=(−213−1)u = \begin{pmatrix} -2 \\ 1 \\ 3 \\ -1 \end{pmatrix} and v=(140−1)v = \begin{pmatrix} 1 \\ 4 \\ 0 \\ -1 \end{pmatrix}.

?
(a)

Determine the orthogonal projection of uu onto ⟨v⟩\left\langle v\right\rangle.

(b)

Determine the orthogonal projection of vv onto ⟨u⟩\left\langle u\right\rangle.

(c)

Determine the orthogonal projection of uu onto v⊥v^{\perp }.

(d)

Determine the orthogonal projection of vv onto u⊥u^{\perp }.

Remark.
?

Equation (5.6.6): for a nonzero vector u∈Cnu \in \mathbb {C}^{n}, the orthogonal projector onto ⟨u⟩\left\langle u\right\rangle is uu∗u∗u\dfrac {uu^{*}}{u^{*}u}, and the orthogonal projector onto u⊥u^{\perp } is I−uu∗u∗uI - \dfrac {uu^{*}}{u^{*}u}.

Problem 5.6.11

Consider elementary orthogonal projectors Q=I−uu∗Q = I - uu^{*} (where ∥u∥=1\left\| u\right\| =1).

?
(a)

Prove that QQ is singular.

(b)

Now prove that if QQ is n×nn \times n, then rk⁡(Q)=n−1\operatorname {rk}\left(Q\right) = n-1.

Problem 5.6.12

For vectors u,x∈Cnu, x \in \mathbb {C}^{n} such that ∥u∥=1\left\| u\right\| =1, let pp be the orthogonal projection of xx onto ⟨u⟩\left\langle u\right\rangle. Explain why ∥p∥≤∥x∥\left\| p\right\| \leq \left\| x\right\| with equality holding if and only if xx is a scalar multiple of uu.

?
Remark.
?

Equation (5.6.5) states ∥p∥=∣u∗x∣\left\| p\right\| = \left|u^{*}x\right|. The CBS inequality (5.1.3) states ∣u∗x∣≤∥u∥∥x∥\left|u^{*}x\right| \leq \left\| u\right\| \left\| x\right\|.

Problem 5.6.13

Let x=13(1−2−2)x = \dfrac {1}{3}\begin{pmatrix} 1 \\ -2 \\ -2 \end{pmatrix}.

?
(a)

Determine an elementary reflector RR such that RxRx lies on the xx-axis.

(b)

Verify by direct computation that your reflector RR is symmetric, orthogonal, and involutory.

(c)

Extend xx to an orthonormal basis for R3\mathbb {R}^{3} by using an elementary reflector.

Problem 5.6.14

Let R=I−2uu∗R = I - 2uu^{*}, where ∥un×1∥=1\left\| u_{n \times 1}\right\| = 1. If xx is a fixed point for RR in the sense that Rx=xRx = x, and if n>1n>1, prove that xx must be orthogonal to uu, and then sketch a picture of this situation in R3\mathbb {R}^{3}.

The fixed-point plane u^{\perp } of the reflector R = I - 2uu^{*}, with u and a fixed point x shown.The fixed-point plane u^{\perp } of the reflector R = I - 2uu^{*}, with u and a fixed point x shown.

?
Problem 5.6.15

Let x,y∈Rnx, y \in \mathbb {R}^{n} be vectors such that ∥x∥=∥y∥\left\| x\right\| = \left\| y\right\| but x≠yx \neq y. Explain how to construct an elementary reflector RR such that Rx=yRx = y.

?
Remark.
?

The vector uu that defines RR can be determined visually in R3\mathbb {R}^{3} by considering the reflection-about-a-plane picture from the elementary-reflector construction (source Figure 5.6.2).

Problem 5.6.16

Let xn×1x_{n \times 1} be a vector such that ∥x∥=1\left\| x\right\| = 1, and partition xx as x=(x1x~)x = \begin{pmatrix} x_{1} \\ \tilde{x} \end{pmatrix}, where x~\tilde{x} is (n−1)×1(n-1) \times 1.

?
(a)

If the entries of xx are real, and if x1≠1x_{1} \neq 1, show that P=(x1x~Tx~I−αx~x~T)P = \begin{pmatrix} x_{1} & \tilde{x}^{T} \\ \tilde{x} & I - \alpha \tilde{x}\tilde{x}^{T} \end{pmatrix}, where α=11−x1\alpha = \dfrac {1}{1-x_{1}}, is an orthogonal matrix.

(b)

Suppose the entries of xx are complex. If ∣x1∣≠1\left|x_{1}\right| \neq 1, and if μ\mu is the number defined by μ=1\mu = 1 if x1x_{1} is real, μ=x1/∣x1∣\mu = x_{1}/\left|x_{1}\right| if x1x_{1} is not real, show that the matrix U=(x1μ2x~∗x~μ(I−αx~x~∗))U = \begin{pmatrix} x_{1} & \mu^{2}\tilde{x}^{*} \\ \tilde{x} & \mu (I-\alpha \tilde{x}\tilde{x}^{*}) \end{pmatrix}, where α=11−∣x1∣\alpha = \dfrac {1}{1-\left|x_{1}\right|}, is unitary.

Remark.
?

These results provide an easy way to extend a given vector to an orthonormal basis for the entire space Rn\mathbb {R}^{n} or Cn\mathbb {C}^{n}.

Problem 5.6.17

Perform the following sequence of rotations in R3\mathbb {R}^{3} beginning with v0=(11−1)v_{0} = \begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}.

  1. Rotate v0v_{0} counterclockwise 45°45° around the xx-axis to produce v1v_{1}.

  2. Rotate v1v_{1} clockwise 90°90° around the yy-axis to produce v2v_{2}.

  3. Rotate v2v_{2} counterclockwise 30°30° around the zz-axis to produce v3v_{3}. Determine the coordinates of v3v_{3} as well as an orthogonal matrix QQ such that Qv0=v3Qv_{0} = v_{3}.

?
Remark.
?

The counterclockwise rotation matrices around each coordinate axis through an angle θ\theta are Px(θ)=(1000cos⁡θ−sin⁡θ0sin⁡θcos⁡θ)P_{x}(\theta ) = \begin{pmatrix} 1 & 0 & 0 \\ 0 & \cos \theta & -\sin \theta \\ 0 & \sin \theta & \cos \theta \end{pmatrix}, Py(θ)=(cos⁡θ0sin⁡θ010−sin⁡θ0cos⁡θ)P_{y}(\theta ) = \begin{pmatrix} \cos \theta & 0 & \sin \theta \\ 0 & 1 & 0 \\ -\sin \theta & 0 & \cos \theta \end{pmatrix}, Pz(θ)=(cos⁡θ−sin⁡θ0sin⁡θcos⁡θ0001)P_{z}(\theta ) = \begin{pmatrix} \cos \theta & -\sin \theta & 0 \\ \sin \theta & \cos \theta & 0 \\ 0 & 0 & 1 \end{pmatrix}; a clockwise rotation through θ\theta is P⋆(−θ)P_{\star }(-\theta ).

Problem 5.6.18

Does it matter in what order rotations in R3\mathbb {R}^{3} are performed? For example, suppose that a vector v∈R3v \in \mathbb {R}^{3} is first rotated counterclockwise around the xx-axis through an angle θ\theta, and then that vector is rotated counterclockwise around the yy-axis through an angle φ\varphi. Is the result the same as first rotating vv counterclockwise around the yy-axis through an angle φ\varphi followed by a rotation counterclockwise around the xx-axis through an angle θ\theta?

?
Problem 5.6.19

For each nonzero vector u∈Cnu \in \mathbb {C}^{n}, prove that dim⁡u⊥=n−1\dim u^{\perp } = n-1.

?
Problem 5.6.20

A matrix satisfying A2=IA^{2} = I is said to be an involution or an involutory matrix, and a matrix PP satisfying P2=PP^{2} = P is called a projector or is said to be an idempotent matrix. Show that there is a one-to-one correspondence between the set of involutions and the set of projectors in Cn×n\mathbb {C}^{n \times n}.

?
Remark.
?

Equations (5.6.6)-(5.6.7) show that an elementary reflector R=I−2uu∗/u∗uR = I - 2uu^{*}/u^{*}u (an involution) is built from the projector P=uu∗/u∗uP = uu^{*}/u^{*}u via R=I−2PR = I - 2P.

Problem 5.6.21

When using a computer to generate and display a three-dimensional convex polytope, it is desirable to not draw those faces that should be hidden from the perspective of a viewer. The cross product in R3\mathbb {R}^{3} can be used to decide which faces are visible and which are not: if u=(u1u2u3)u = \begin{pmatrix} u_{1} \\ u_{2} \\ u_{3} \end{pmatrix} and v=(v1v2v3)v = \begin{pmatrix} v_{1} \\ v_{2} \\ v_{3} \end{pmatrix}, then u×v=(u2v3−u3v2u3v1−u1v3u1v2−u2v1)u \times v = \begin{pmatrix} u_{2}v_{3}-u_{3}v_{2} \\ u_{3}v_{1}-u_{1}v_{3} \\ u_{1}v_{2}-u_{2}v_{1} \end{pmatrix} is a vector orthogonal to both uu and vv, with direction given by the right-hand rule.

Left: the viewer positioned on the positive x-axis looking toward the origin (source Figure 5.6.6). Middle: the right-hand rule for u \times v (source Figure 5.6.8). Right: a face with vertices p_0,p_1,p_2 and outward normal n (source Figure 5.6.9).Left: the viewer positioned on the positive x-axis looking toward the origin (source Figure 5.6.6). Middle: the right-hand rule for u \times v (source Figure 5.6.8). Right: a face with vertices p_0,p_1,p_2 and outward normal n (source Figure 5.6.9).

Assume the origin is interior to the polytope, and consider a particular face and three vertices p0,p1,p2p_{0}, p_{1}, p_{2} on the face, listed counterclockwise as seen from outside the face. The vector n=(p1−p0)×(p2−p1)n = (p_{1}-p_{0}) \times (p_{2}-p_{1}) is orthogonal to the face, and it points in the outward direction. Explain why the outside of the face is visible from the perspective of a viewer positioned on the positive xx-axis looking toward the origin if and only if the first component of the outward normal vector nn is positive. In other words, the face is drawn if and only if n1>0n_{1} > 0.

?
Problem 5.7.1
?
(a)

Using Householder reduction, compute the QR factors of A=(119−34−2−5202837)A = \begin{pmatrix} 1 & 19 & -34 \\ -2 & -5 & 20 \\ 2 & 8 & 37 \end{pmatrix}.

(b)

Repeat part (a) using Givens reduction.

Problem 5.7.2

For A∈Rm×nA \in \mathbb {R}^{m \times n}, suppose that rk⁡(A)=n\operatorname {rk}\left(A\right) = n, and let PP be an orthogonal matrix such that PA=T=(Rn×n0)PA = T = \begin{pmatrix} R_{n \times n} \\ 0 \end{pmatrix}, where RR is upper triangular. If PTP^{T} is partitioned as PT=[Xm×n∣Y]P^{T} = \left[X_{m \times n} \mid Y\right], explain why the columns of XX constitute an orthonormal basis for R(A)\mathcal{R}(A).

?
Problem 5.7.3

By using Householder reduction, find an orthonormal basis for R(A)\mathcal{R}(A), where A=(4−342−14−3−21401−715)A = \begin{pmatrix} 4 & -3 & 4 \\ 2 & -14 & -3 \\ -2 & 14 & 0 \\ 1 & -7 & 15 \end{pmatrix}.

?
Remark.
?

Equation (5.7.1): given A∗1A_{*1}, the first column of AA, set u=A∗1±μ∥A∗1∥e1u = A_{*1} \pm \mu \left\| A_{*1}\right\| e_{1} (with μ\mu as in (5.6.10)) and build the elementary reflector R1=I−2uu∗/u∗uR_{1} = I - 2uu^{*}/u^{*}u, which annihilates every entry below the first pivot of AA.

Problem 5.7.4

Use Householder reduction to compute the least squares solution for Ax=bAx=b, where A=(4−342−14−3−21401−715)A = \begin{pmatrix} 4 & -3 & 4 \\ 2 & -14 & -3 \\ -2 & 14 & 0 \\ 1 & -7 & 15 \end{pmatrix} and b=(5−15030)b = \begin{pmatrix} 5 \\ -15 \\ 0 \\ 30 \end{pmatrix}.

?
Problem 5.7.5

If A=QRA = QR is the QR factorization for AA, explain why ∥A∥F=∥R∥F\left\| A\right\|_{F} = \left\| R\right\|_{F}.

?
Problem 5.7.6

Find an orthogonal matrix PP such that PTAP=HP^{T}AP = H is in upper-Hessenberg form, where A=(−23−43−2550−45025)A = \begin{pmatrix} -2 & 3 & -4 \\ 3 & -25 & 50 \\ -4 & 50 & 25 \end{pmatrix}.

?
Problem 5.7.7

Let HH be an upper-Hessenberg matrix, and suppose that H=QRH = QR, where RR is a nonsingular upper-triangular matrix. Prove that QQ as well as the product RQRQ must also be in upper-Hessenberg form.

?
Problem 5.7.8

Approximately how many multiplications are needed to reduce an n×nn \times n nonsingular upper-Hessenberg matrix to upper-triangular form by using plane rotations?

?
Problem 5.8.1

Evaluate the following convolutions (using the convolution ⊙\odot of two vectors, as defined in this section: for a=(α0,…,αn−1)Ta = (\alpha_{0},\ldots ,\alpha_{n-1})^{T}, b=(β0,…,βn−1)Tb=(\beta_{0},\ldots ,\beta_{n-1})^{T}, the vector a⊙ba \odot b of size 2n2n whose kkth entry is ∑j=0kαjβk−j\sum_{j=0}^{k} \alpha_{j}\beta_{k-j}, padding αi,βi=0\alpha_{i},\beta_{i}=0 for i≥ni \geq n).

?
(a)

(123)⊙(456)\begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix} \odot \begin{pmatrix} 4 \\ 5 \\ 6 \end{pmatrix}.

(b)

(−101)⊙(10−1)\begin{pmatrix} -1 \\ 0 \\ 1 \end{pmatrix} \odot \begin{pmatrix} 1 \\ 0 \\ -1 \end{pmatrix}.

(c)

(111)⊙(α0α1α2)\begin{pmatrix} 1 \\ 1 \\ 1 \end{pmatrix} \odot \begin{pmatrix} \alpha_{0} \\ \alpha_{1} \\ \alpha_{2} \end{pmatrix}.

Problem 5.8.2
?
(a)

Evaluate the discrete Fourier transform F4xF_{4}x of x=(1−i−1i)x = \begin{pmatrix} 1 \\ -i \\ -1 \\ i \end{pmatrix}.

(b)

Evaluate the inverse transform F4−1xF_{4}^{-1}x of x=(1i−1−i)x = \begin{pmatrix} 1 \\ i \\ -1 \\ -i \end{pmatrix}.

Remark.
?

Example 5.8.1 gives F4=(11111−i−1i1−11−11i−1−i)F_{4} = \begin{pmatrix} 1 & 1 & 1 & 1 \\ 1 & -i & -1 & i \\ 1 & -1 & 1 & -1 \\ 1 & i & -1 & -i \end{pmatrix} and F4−1=14F4F_{4}^{-1} = \frac{1}{4}F_{4} (using F4‾=F4−1⋅4\overline{F_{4}} = F_{4}^{-1}\cdot 4, i.e.F4−1F_{4}^{-1} has the same entries as 14F4‾\frac{1}{4}\overline{F_{4}}, which for this real-symmetric-conjugate case coincides with 14F4\frac{1}{4}F_{4} up to conjugation of each entry).

Problem 5.8.3

Verify directly that F4=(F2D2F2F2−D2F2)P4F_{4} = \begin{pmatrix} F_{2} & D_{2}F_{2} \\ F_{2} & -D_{2}F_{2} \end{pmatrix} P_{4}, where F4,P4,D2F_{4}, P_{4}, D_{2} are as defined in the Fourier-matrix decomposition (5.8.15): for n=2rn=2^{r}, Fn=(Fn/2Dn/2Fn/2Fn/2−Dn/2Fn/2)PnF_{n} = \begin{pmatrix} F_{n/2} & D_{n/2}F_{n/2} \\ F_{n/2} & -D_{n/2}F_{n/2} \end{pmatrix}P_{n}, where Dn/2=diag⁡(1,ξ,ξ2,…,ξn/2−1)D_{n/2} = \operatorname {diag}(1,\xi ,\xi^{2},\ldots ,\xi^{n/2-1}) (ξ\xi the primitive nnth root of unity used throughout this section) and PnT=[e0  e2  e4  ⋯  en−2∣e1  e3  e5  ⋯  en−1]P_{n}^{T} = \left[e_{0}\; e_{2}\; e_{4}\; \cdots \; e_{n-2} \mid e_{1}\; e_{3}\; e_{5}\; \cdots \; e_{n-1}\right] is the even-odd permutation matrix.

?
Problem 5.8.4

Use the following vectors to perform the indicated computations: a=(α0α1)a = \begin{pmatrix} \alpha_{0} \\ \alpha_{1} \end{pmatrix}, b=(β0β1)b = \begin{pmatrix} \beta_{0} \\ \beta_{1} \end{pmatrix}, a^=(α0α100)\hat{a} = \begin{pmatrix} \alpha_{0} \\ \alpha_{1} \\ 0 \\ 0 \end{pmatrix}, b^=(β0β100)\hat{b} = \begin{pmatrix} \beta_{0} \\ \beta_{1} \\ 0 \\ 0 \end{pmatrix}.

?
(a)

Compute a⊙ba \odot b, F4(a⊙b)F_{4}(a \odot b), and (F4a^)×(F4b^)(F_{4}\hat{a}) \times (F_{4}\hat{b}) (where ×\times is the entrywise product).

(b)

By using F4−1F_{4}^{-1} as given in Example 5.8.1, compute F4−1[(F4a^)×(F4b^)]F_{4}^{-1}\left[(F_{4}\hat{a}) \times (F_{4}\hat{b})\right]. Compare this with the results guaranteed by the convolution theorem.

Problem 5.8.5

For p(x)=2x−3p(x) = 2x-3 and q(x)=3x−4q(x) = 3x-4, compute the product p(x)q(x)p(x)q(x) by using the convolution theorem.

?
Remark.
?

The convolution theorem: for a,b∈Cna,b \in \mathbb {C}^{n} with padded forms a^,b^∈C2n\hat{a},\hat{b} \in \mathbb {C}^{2n}, and F=F2nF = F_{2n}, F(a⊙b)=(Fa^)×(Fb^)F(a\odot b) = (F\hat{a}) \times (F\hat{b}), so a⊙b=F−1[(Fa^)×(Fb^)]a \odot b = F^{-1}\left[(F\hat{a})\times (F\hat{b})\right]. By Example 5.8.4, if p(x)=∑αkxkp(x)=\sum \alpha_{k}x^{k} and q(x)=∑βkxkq(x) = \sum \beta_{k}x^{k} (coefficients padded into a,b∈Cna,b \in \mathbb {C}^{n}), then the coefficient vector of p(x)q(x)p(x)q(x) is exactly a⊙ba \odot b.

Problem 5.8.6

Use convolutions to form the following products.

?
(a)

4310×211043_{10} \times 21_{10}.

(b)

1238×6018123_{8} \times 601_{8}.

(c)

10102×110121010_{2} \times 1101_{2}.

Remark.
?

Interpreting each number's base-bb digit string as the coefficient vector of a polynomial evaluated at x=bx=b reduces multiplication to convolution (Example 5.8.4), followed by carrying (substituting k×bj=bj+1+(k−b)×bjk \times b^{j} = b^{j+1} + (k-b)\times b^{j} wherever a digit meets or exceeds the base bb).

Problem 5.8.7

Let aa and bb be n×1n \times 1 vectors, where nn is a power of 2.

?
(a)

Show that the number of multiplications required to form a⊙ba \odot b by using the definition of convolution is n2n^{2}.

(b)

Show that the number of multiplications required to form a⊙ba \odot b by using the FFT in conjunction with the convolution theorem is 3nlog⁡2n+7n3n\log_{2}n + 7n.

Remark.
?

For part (a): 1+2+⋯+k=k(k+1)/21+2+\cdots +k = k(k+1)/2. For part (b): compare a plotted graph of 3nlog⁡2n3n\log_{2}n (dropping the less significant 7n7n term) against n2n^{2} to see the size of the FFT's advantage for large nn.

Problem 5.8.8

A waveform given by a finite sum x(τ)=∑k(αkcos⁡2πfkτ+βksin⁡2πfkτ)x(\tau ) = \sum_{k} (\alpha_{k}\cos 2\pi f_{k}\tau + \beta_{k}\sin 2\pi f_{k}\tau ), in which the fkf_{k}'s are integers and max⁡{fk}≤3\max \left\{ f_{k}\right\} \leq 3, is sampled at eight equally spaced points between τ=0\tau =0 and τ=1\tau =1. Let x=(x(0/8)x(1/8)x(2/8)x(3/8)x(4/8)x(5/8)x(6/8)x(7/8))Tx = \begin{pmatrix} x(0/8) & x(1/8) & x(2/8) & x(3/8) & x(4/8) & x(5/8) & x(6/8) & x(7/8) \end{pmatrix}^{T}, and suppose that

y=14F8x=(0−5i1−3i4041+3i5i). y = \frac{1}{4}F_{8}x = \begin{pmatrix} 0 \\ -5i \\ 1-3i \\ 4 \\ 0 \\ 4 \\ 1+3i \\ 5i \end{pmatrix}.

What is the equation of the waveform?

?
Remark.
?

Equations (5.8.7)-(5.8.8) show that y=2nFnx=∑kαk(efk+en−fk)+i∑kβk(−efk+en−fk)y = \frac{2}{n}F_{n}x = \sum_{k} \alpha_{k}(e_{f_{k}}+e_{n-f_{k}}) + i\sum_{k} \beta_{k}(-e_{f_{k}}+e_{n-f_{k}}), so each pair of pulses at index fkf_{k} and n−fkn-f_{k} in yy reveals αk\alpha_{k} (from the sum of the two entries) and βk\beta_{k} (from their difference, divided by ii).

Problem 5.8.9

Prove that a⊙b=b⊙aa \odot b = b \odot a for all a,b∈Cna, b \in \mathbb {C}^{n} — i.e., convolution is a commutative operation.

?
Problem 5.8.10

For p(x)=∑k=0n−1αkxkp(x) = \sum_{k=0}^{n-1} \alpha_{k}x^{k} and the nnth roots of unity ξk\xi^{k}, let a=(α0α1⋯αn−1)Ta = \begin{pmatrix} \alpha_{0} & \alpha_{1} & \cdots & \alpha_{n-1} \end{pmatrix}^{T} and p=(p(1)p(ξ)⋯p(ξn−1))Tp = \begin{pmatrix} p(1) & p(\xi ) & \cdots & p(\xi^{n-1}) \end{pmatrix}^{T}. Explain why Fna=pF_{n}a = p and a=Fn−1pa = F_{n}^{-1}p.

?
Problem 5.8.11

For two polynomials p(x)=∑k=0n−1αkxkp(x) = \sum_{k=0}^{n-1}\alpha_{k}x^{k} and q(x)=∑k=0n−1βkxkq(x) = \sum_{k=0}^{n-1}\beta_{k}x^{k}, let p=(p(1)p(ξ)⋯p(ξ2n−1))Tp = \begin{pmatrix} p(1) & p(\xi ) & \cdots & p(\xi^{2n-1}) \end{pmatrix}^{T} and q=(q(1)q(ξ)⋯q(ξ2n−1))Tq = \begin{pmatrix} q(1) & q(\xi ) & \cdots & q(\xi^{2n-1}) \end{pmatrix}^{T}, where 1,ξ,ξ2,…,ξ2n−11,\xi ,\xi^{2},\ldots ,\xi^{2n-1} are now the 2n2nth roots of unity. Explain why the coefficients in the product p(x)q(x)=γ0+γ1x+⋯+γ2n−2x2n−2p(x)q(x) = \gamma_{0}+\gamma_{1}x+\cdots +\gamma_{2n-2}x^{2n-2} must be given by

(γ0γ1⋮)=F2n−1(p(1)q(1)p(ξ)q(ξ)⋮). \begin{pmatrix} \gamma _{0} \\ \gamma _{1} \\ \vdots \end{pmatrix} = F_{2n}^{-1}\begin{pmatrix} p(1)q(1) \\ p(\xi )q(\xi ) \\ \vdots \end{pmatrix}.
?
Problem 5.8.12

A circulant matrix is defined to be a square matrix that has the form C=(c0cn−1cn−2⋯c1c1c0cn−1⋯c2c2c1c0⋯c3⋮⋮⋮⋮cn−1cn−2cn−3⋯c0)n×nC = \begin{pmatrix} c_{0} & c_{n-1} & c_{n-2} & \cdots & c_{1} \\ c_{1} & c_{0} & c_{n-1} & \cdots & c_{2} \\ c_{2} & c_{1} & c_{0} & \cdots & c_{3} \\ \vdots & \vdots & \vdots & & \vdots \\ c_{n-1} & c_{n-2} & c_{n-3} & \cdots & c_{0} \end{pmatrix}_{n\times n} — i.e., the entries in each column are the same as the previous column, but shifted one position downward and wrapped around at the top; the (j,k)(j,k)-entry is cjk=cj−k(modn)c_{jk} = c_{j-k \pmod{n}}.

?
(a)

If QQ is the circulant matrix defined by Q=(00⋯0110⋯0001⋯00⋮⋮⋱⋮⋮00⋯10)n×nQ = \begin{pmatrix} 0 & 0 & \cdots & 0 & 1 \\ 1 & 0 & \cdots & 0 & 0 \\ 0 & 1 & \cdots & 0 & 0 \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & \cdots & 1 & 0 \end{pmatrix}_{n\times n}, and if p(x)=c0+c1x+⋯+cn−1xn−1p(x) = c_{0}+c_{1}x+\cdots +c_{n-1}x^{n-1}, verify that C=p(Q)=c0I+c1Q+⋯+cn−1Qn−1C = p(Q) = c_{0}I + c_{1}Q + \cdots + c_{n-1}Q^{n-1}.

(b)

Explain why the Fourier matrix of order nn diagonalizes QQ in the sense that FQF−1=D=diag⁡(1,ξ,…,ξn−1)FQF^{-1} = D = \operatorname {diag}(1,\xi ,\ldots ,\xi^{n-1}), where the ξk\xi^{k}'s are the nnth roots of unity.

(c)

Prove that the Fourier matrix of order nn diagonalizes every n×nn \times n circulant in the sense that FCF−1=diag⁡(p(1),p(ξ),…,p(ξn−1))FCF^{-1} = \operatorname {diag}(p(1),p(\xi ),\ldots ,p(\xi^{n-1})), where p(x)=c0+c1x+⋯+cn−1xn−1p(x) = c_{0}+c_{1}x+\cdots +c_{n-1}x^{n-1}.

(d)

If C1C_{1} and C2C_{2} are any pair of n×nn\times n circulants, explain why C1C2=C2C1C_{1}C_{2} = C_{2}C_{1} — i.e., all circulants commute with each other.

Problem 5.8.13

For a nonsingular circulant Cn×nC_{n\times n}, explain how to use the FFT algorithm to efficiently perform the following operations.

?
(a)

Solve a system Cx=bCx = b.

(b)

Compute C−1C^{-1}.

(c)

Multiply two circulants C1C2C_{1}C_{2}.

Problem 5.8.14

For the vectors a=(α0α1⋮αn−1)a = \begin{pmatrix} \alpha_{0} \\ \alpha_{1} \\ \vdots \\ \alpha_{n-1} \end{pmatrix}, b=(β0β1⋮βn−1)b = \begin{pmatrix} \beta_{0} \\ \beta_{1} \\ \vdots \\ \beta_{n-1} \end{pmatrix}, a^=(α0⋮αn−10⋮0)2n×1\hat{a} = \begin{pmatrix} \alpha_{0} \\ \vdots \\ \alpha_{n-1} \\ 0 \\ \vdots \\ 0 \end{pmatrix}_{2n \times 1}, and b^=(β0⋮βn−10⋮0)2n×1\hat{b} = \begin{pmatrix} \beta_{0} \\ \vdots \\ \beta_{n-1} \\ 0 \\ \vdots \\ 0 \end{pmatrix}_{2n \times 1}, let CC be the 2n×2n2n\times 2n circulant matrix (Exercise 5.8.12) whose first column is a^\hat{a}.

?
(a)

Show that the convolution operation can be described as a matrix-vector product by demonstrating that a⊙b=Cb^a \odot b = C\hat{b}.

(b)

Use this relationship to give an alternate proof of the convolution theorem.

Problem 5.8.15

The Kronecker product of two matrices Am×nA_{m\times n} and Bp×qB_{p\times q} is the mp×nqmp \times nq matrix A⊗B=(a11Ba12B⋯a1nBa21Ba22B⋯a2nB⋮⋮⋮am1Bam2B⋯amnB)A \otimes B = \begin{pmatrix} a_{11}B & a_{12}B & \cdots & a_{1n}B \\ a_{21}B & a_{22}B & \cdots & a_{2n}B \\ \vdots & \vdots & & \vdots \\ a_{m1}B & a_{m2}B & \cdots & a_{mn}B \end{pmatrix}, satisfying A⊗(B⊗C)=(A⊗B)⊗CA\otimes (B\otimes C) = (A\otimes B)\otimes C and (A⊗B)(C⊗D)=AC⊗BD(A\otimes B)(C\otimes D) = AC\otimes BD (when ACAC and BDBD exist).

?
(a)

If n=2rn=2^{r}, and if PnP_{n} is the even-odd permutation matrix from the Fourier-matrix decomposition (5.8.15), explain why Rn=(I2r−1⊗P21)(I2r−2⊗P22)⋯(I21⊗P2r−1)(I20⊗P2r)R_{n} = (I_{2^{r-1}}\otimes P_{2^{1}})(I_{2^{r-2}}\otimes P_{2^{2}})\cdots (I_{2^{1}}\otimes P_{2^{r-1}})(I_{2^{0}}\otimes P_{2^{r}}) is the permutation matrix associated with the bit-reversing (perfect shuffle) permutation.

(b)

Suppose n=2rn=2^{r}, and set Bn=(In/2Dn/2In/2−Dn/2)B_{n} = \begin{pmatrix} I_{n/2} & D_{n/2} \\ I_{n/2} & -D_{n/2} \end{pmatrix}. According to (5.8.15), the Fourier matrix can be written as Fn=Bn(I2⊗Fn/2)PnF_{n} = B_{n}(I_{2}\otimes F_{n/2})P_{n}. Prove that FnF_{n} can be factored as Fn=LnRnF_{n} = L_{n}R_{n}, where Ln=(I20⊗B2r)(I21⊗B2r−1)⋯(I2r−2⊗B22)(I2r−1⊗B21)L_{n} = (I_{2^{0}}\otimes B_{2^{r}})(I_{2^{1}}\otimes B_{2^{r-1}})\cdots (I_{2^{r-2}}\otimes B_{2^{2}})(I_{2^{r-1}}\otimes B_{2^{1}}), and RnR_{n} is the bit-reversing permutation of part (a).

Remark.
?

This says Fnx=LnRnxF_{n}x = L_{n}R_{n}x: the discrete Fourier transform of xx is obtained by first performing the bit-reversing permutation, then applying rr successive terms of LnL_{n} — this is the FFT algorithm in factored form.

Problem 5.8.16

For p(x)=α0+α1x+α2x2+⋯+αn−1xn−1p(x) = \alpha_{0}+\alpha_{1}x+\alpha_{2}x^{2}+\cdots +\alpha_{n-1}x^{n-1}, prove that

1n∑k=0n−1∣p(ξk)∣2=∣α0∣2+∣α1∣2+⋯+∣αn−1∣2, \frac{1}{n}\sum _{k=0}^{n-1} \left|p(\xi ^{k})\right|^{2} = \left|\alpha _{0}\right|^{2}+\left|\alpha _{1}\right|^{2}+\cdots +\left|\alpha _{n-1}\right|^{2},

where 1,ξ,ξ2,…,ξn−11,\xi ,\xi^{2},\ldots ,\xi^{n-1} are the nnth roots of unity.

?
Problem 5.8.17

Consider a waveform given by a finite sum x(τ)=∑k(αkcos⁡2πfkτ+βksin⁡2πfkτ)x(\tau ) = \sum_{k}(\alpha_{k}\cos 2\pi f_{k}\tau + \beta_{k}\sin 2\pi f_{k}\tau ), in which the fkf_{k}'s are distinct integers, and let x=∑k(αkcos⁡2πfkt+βksin⁡2πfkt)x = \sum_{k}(\alpha_{k}\cos 2\pi f_{k}t + \beta_{k}\sin 2\pi f_{k}t) be the vector containing the values of x(τ)x(\tau ) at n>2max⁡{fk}n > 2\max \left\{ f_{k}\right\} equally spaced points between τ=0\tau =0 and τ=1\tau =1 (Example 5.8.3). Use the discrete Fourier transform to prove that

∥x∥22=n2∑k(αk2+βk2). \left\| x\right\| _{2}^{2} = \frac{n}{2}\sum _{k}\left(\alpha _{k}^{2}+\beta _{k}^{2}\right).
?
Remark.
?

Equation (5.8.7): 2nFnx=∑kαk(efk+en−fk)+i∑kβk(−efk+en−fk)\frac{2}{n}F_{n}x = \sum_{k} \alpha_{k}(e_{f_{k}}+e_{n-f_{k}}) + i\sum_{k}\beta_{k}(-e_{f_{k}}+e_{n-f_{k}}).

Problem 5.8.18

Let η\eta be an arbitrary scalar, and let c=(1ηη2⋮η2n−1)c = \begin{pmatrix} 1 \\ \eta \\ \eta^{2} \\ \vdots \\ \eta^{2n-1} \end{pmatrix} and a=(α0α1⋮αn−1)a = \begin{pmatrix} \alpha_{0} \\ \alpha_{1} \\ \vdots \\ \alpha_{n-1} \end{pmatrix}. Prove that cT(a⊙a)=(cTa^)2c^{T}(a \odot a) = \left(c^{T}\hat{a}\right)^{2}.

?
Remark.
?

Example 5.8.4: if p(x)=∑k=0n−1αkxkp(x) = \sum_{k=0}^{n-1} \alpha_{k}x^{k}, then p(x)2=∑k=02n−2[a⊙a]kxkp(x)^{2} = \sum_{k=0}^{2n-2} \left[a\odot a\right]_{k} x^{k}.

Problem 5.8.19

Apply the FFT algorithm to the vector x8=(x0x1⋮x7)x_{8} = \begin{pmatrix} x_{0} \\ x_{1} \\ \vdots \\ x_{7} \end{pmatrix}, and then verify that your answer agrees with the result obtained by computing F8x8F_{8}x_{8} directly.

?
Problem 5.9.1

Let XX and YY be subspaces of R3\mathbb {R}^{3} whose respective bases are BX={(111),(122)}B_{X} = \left\{ \begin{pmatrix} 1 \\ 1 \\ 1 \end{pmatrix}, \begin{pmatrix} 1 \\ 2 \\ 2 \end{pmatrix}\right\} and BY={(123)}B_{Y} = \left\{ \begin{pmatrix} 1 \\ 2 \\ 3 \end{pmatrix}\right\}.

?
(a)

Explain why XX and YY are complementary subspaces of R3\mathbb {R}^{3}.

(b)

Determine the projector PP onto XX along YY as well as the complementary projector QQ onto YY along XX.

(c)

Determine the projection of v=(2−11)v = \begin{pmatrix} 2 \\ -1 \\ 1 \end{pmatrix} onto YY along XX.

(d)

Verify that PP and QQ are both idempotent.

(e)

Verify that R(P)=X=N(Q)\mathcal{R}(P) = X = \mathcal{N}(Q) and N(P)=Y=R(Q)\mathcal{N}(P) = Y = \mathcal{R}(Q).

Remark.
?

(5.9.4): X,YX, Y (with bases BX,BYB_{X},B_{Y}) are complementary subspaces of VV if and only if BX∩BY=∅B_{X}\cap B_{Y}=\emptyset and BX∪BYB_{X}\cup B_{Y} is a basis for VV. (5.9.12): if the columns of X,YX,Y (matrices) are bases for X,YX,Y, the projector onto XX along YY is P=[X∣0][X∣Y]−1P = \left[X\mid 0\right]\left[X\mid Y\right]^{-1}.

Problem 5.9.2

Construct an example of a pair of nontrivial complementary subspaces of R5\mathbb {R}^{5}, and explain why your example is valid.

?
Problem 5.9.3

Construct an example to show that if V=X+YV = X+Y but X∩Y≠0X \cap Y \neq 0, then a vector v∈Vv \in V can have two different representations as v=x1+y1v = x_{1}+y_{1} and v=x2+y2v = x_{2}+y_{2}, where x1,x2∈Xx_{1},x_{2} \in X and y1,y2∈Yy_{1},y_{2} \in Y, but x1≠x2x_{1} \neq x_{2} and y1≠y2y_{1} \neq y_{2}.

?
Problem 5.9.4

Explain why Rn×n=S⊕K\mathbb {R}^{n \times n} = S \oplus K, where SS and KK are the subspaces of n×nn\times n symmetric and skew-symmetric matrices, respectively. What is the projection of A=(123456789)A = \begin{pmatrix} 1& 2& 3 \\ 4& 5& 6 \\ 7& 8& 9 \end{pmatrix} onto SS along KK?

?
Remark.
?

Exercise 3.2.6 shows that every A∈Rn×nA \in \mathbb {R}^{n\times n} has the unique decomposition A=A+AT2+A−AT2A = \frac{A+A^{T}}{2} + \frac{A-A^{T}}{2}, a symmetric matrix plus a skew-symmetric matrix.

Problem 5.9.5

For a general vector space, let XX and YY be two subspaces with respective bases BX={x1,…,xm}B_{X} = \left\{ x_{1},\ldots ,x_{m}\right\} and BY={y1,…,yn}B_{Y} = \left\{ y_{1},\ldots ,y_{n}\right\}.

?
(a)

Prove that X∩Y=0X \cap Y = 0 if and only if {x1,…,xm,y1,…,yn}\left\{ x_{1},\ldots ,x_{m},y_{1},\ldots ,y_{n}\right\} is a linearly independent set.

(b)

Does BX∪BYB_{X}\cup B_{Y} being linearly independent imply X∩Y=0X \cap Y = 0?

(c)

If BX∪BYB_{X}\cup B_{Y} is a linearly independent set, does it follow that XX and YY are complementary subspaces? Why?

Problem 5.9.6

Let PP be a projector defined on a vector space VV. Prove that the range of a projector is the set of its "fixed points," i.e. R(P)={x∈V∣Px=x}\mathcal{R}(P) = \left\{ x \in V \mid Px=x\right\}.

?
Problem 5.9.7

Suppose that V=X⊕YV = X\oplus Y, and let PP be the projector onto XX along YY. Prove that R(P)=N(I−P)=X\mathcal{R}(P) = \mathcal{N}(I-P) = X and R(I−P)=N(P)=Y\mathcal{R}(I-P) = \mathcal{N}(P) = Y.

?
Problem 5.9.8

Explain why ∥P∥2≥1\left\| P\right\|_{2} \geq 1 for every projector P≠0P \neq 0. When is ∥P∥2=1\left\| P\right\|_{2} = 1?

?
Remark.
?

For a projector PP with R(P)=R\mathcal{R}(P)=R, N(P)=N\mathcal{N}(P)=N, the angle θ\theta between RR and NN (the "minimal angle," (5.9.16)) satisfies sin⁡θ=1/∥P∥2\sin \theta = 1/\left\| P\right\|_{2} (equation (5.9.18)).

Problem 5.9.9

Explain why ∥I−P∥2=∥P∥2\left\| I-P\right\|_{2} = \left\| P\right\|_{2} for all projectors that are not zero and not equal to the identity.

?
Problem 5.9.10

Prove that if u,v∈Rnu,v \in \mathbb {R}^{n} are vectors such that vTu=1v^{T}u=1, then ∥I−uvT∥2=∥uvT∥2=∥u∥2∥v∥2=∥uvT∥F\left\| I-uv^{T}\right\|_{2} = \left\| uv^{T}\right\|_{2} = \left\| u\right\|_{2}\left\| v\right\|_{2} = \left\| uv^{T}\right\|_{F}.

?
Problem 5.9.11

Suppose that XX and YY are complementary subspaces of Rn\mathbb {R}^{n}, and let B=[X∣Y]B = \left[X \mid Y\right] be a nonsingular matrix in which the columns of XX and YY constitute respective bases for XX and YY. For an arbitrary vector v∈Rnv \in \mathbb {R}^{n}, explain why the projection of vv onto XX along YY can be obtained by the following two-step process.

  1. Solve the system Bz=vBz=v for zz.

  2. Partition zz as z=(z1z2)z = \begin{pmatrix} z_{1} \\ z_{2} \end{pmatrix}, and set p=Xz1p = Xz_{1}.

?
Problem 5.9.12

Let PP and QQ be projectors.

?
(a)

Prove R(P)=R(Q)\mathcal{R}(P) = \mathcal{R}(Q) if and only if PQ=QPQ=Q and QP=PQP=P.

(b)

Prove N(P)=N(Q)\mathcal{N}(P) = \mathcal{N}(Q) if and only if PQ=PPQ=P and QP=QQP=Q.

(c)

Prove that if E1,E2,…,EkE_{1},E_{2},\ldots ,E_{k} are projectors with the same range, and if α1,…,αk\alpha_{1},\ldots ,\alpha_{k} are scalars such that ∑jαj=1\sum_{j}\alpha_{j}=1, then ∑jαjEj\sum_{j}\alpha_{j}E_{j} is a projector.

Problem 5.9.13

Prove that rk⁡(P)=trace⁡(P)\operatorname {rk}\left(P\right) = \operatorname {trace}(P) for every projector PP defined on Rn\mathbb {R}^{n}.

?
Problem 5.9.14

Let {Xi}i=1k\left\{ X_{i}\right\}_{i=1}^{k} be a collection of subspaces from a vector space VV, and let BiB_{i} denote a basis for XiX_{i}. Prove that the following statements are equivalent.

  1. V=X1+X2+⋯+XkV = X_{1}+X_{2}+\cdots +X_{k} and Xj∩(X1+⋯+Xj−1)=0X_{j}\cap (X_{1}+\cdots +X_{j-1})=0 for each j=2,3,…,kj=2,3,\ldots ,k.

  2. For each vector v∈Vv \in V, there is one and only one way to write v=x1+x2+⋯+xkv = x_{1}+x_{2}+\cdots +x_{k}, where xi∈Xix_{i}\in X_{i}.

  3. B=B1∪B2∪⋯∪BkB = B_{1}\cup B_{2}\cup \cdots \cup B_{k} with Bi∩Bj=∅B_{i}\cap B_{j}=\emptyset for i≠ji\neq j is a basis for VV.

?
Remark.
?

Whenever any one of these statements is true, VV is said to be the direct sum of the XiX_{i}'s, written V=X1⊕X2⊕⋯⊕XkV = X_{1}\oplus X_{2}\oplus \cdots \oplus X_{k}. For k=2k=2, (i) and (5.9.1) say the same thing, and (ii), (iii) reduce to (5.9.3), (5.9.4), respectively.

Problem 5.9.15

For complementary subspaces XX and YY of Rn\mathbb {R}^{n}, let PP be the projector onto XX along YY, and let Q=[X∣Y]Q = \left[X\mid Y\right], where the columns of XX and YY constitute bases for XX and YY, respectively. Prove that if Q−1An×nQQ^{-1}A_{n\times n}Q is partitioned as Q−1AQ=(A11A12A21A22)Q^{-1}AQ = \begin{pmatrix} A_{11}& A_{12} \\ A_{21}& A_{22} \end{pmatrix}, then

Q(A11000)Q−1=PAP,Q(0A1200)Q−1=PA(I−P),Q(00A210)Q−1=(I−P)AP,Q(000A22)Q−1=(I−P)A(I−P). Q\begin{pmatrix} A_{11}& 0 \\ 0& 0 \end{pmatrix}Q^{-1} = PAP, \quad Q\begin{pmatrix} 0& A_{12} \\ 0& 0 \end{pmatrix}Q^{-1} = PA(I-P), \quad Q\begin{pmatrix} 0& 0 \\ A_{21}& 0 \end{pmatrix}Q^{-1} = (I-P)AP, \quad Q\begin{pmatrix} 0& 0 \\ 0& A_{22} \end{pmatrix}Q^{-1} = (I-P)A(I-P).
?
Remark.
?

This means that if AA is a linear operator on Rn\mathbb {R}^{n}, and B=BX∪BYB = B_{X}\cup B_{Y} (the bases making up the columns of X,YX,Y), then the matrix representation of AA with respect to BB is [A]B=(A11A12A21A22)[A]_{B} = \begin{pmatrix} A_{11}& A_{12}\\ A_{21}& A_{22} \end{pmatrix}, where A11=[PAP/X]BXA_{11} = \left[PA P/X\right]_{B_{X}}, A12=[PA(I−P)/Y]BYBXA_{12} = \left[PA(I-P)/Y\right]_{B_{Y}B_{X}}, A21=[(I−P)AP/X]BXBYA_{21} = \left[(I-P)AP/X\right]_{B_{X}B_{Y}}, A22=[(I−P)A(I−P)/Y]BYA_{22} = \left[(I-P)A(I-P)/Y\right]_{B_{Y}} (each a matrix representation of a restricted operator).

Problem 5.9.16

Suppose that Rn=X⊕Y\mathbb {R}^{n} = X\oplus Y, where dim⁡X=r\dim X = r, and let PP be the projector onto XX along YY. Explain why there exist matrices Xn×rX_{n\times r} and Ar×nA_{r\times n} such that P=XAP = XA, where rk⁡(X)=rk⁡(A)=r\operatorname {rk}\left(X\right)=\operatorname {rk}\left(A\right)=r and AX=IrAX = I_{r}.

?
Remark.
?

This is a full-rank factorization for PP (Exercise 3.9.8).

Problem 5.9.17

For either a real or complex vector space, let EE be the projector onto X1X_{1} along Y1Y_{1}, and let FF be the projector onto X2X_{2} along Y2Y_{2}. Prove that E+FE+F is a projector if and only if EF=FE=0EF=FE=0, and under this condition, prove that R(E+F)=X1⊕X2\mathcal{R}(E+F) = X_{1}\oplus X_{2} and N(E+F)=Y1∩Y2\mathcal{N}(E+F) = Y_{1}\cap Y_{2}.

?
Problem 5.9.18

For either a real or complex vector space, let EE be the projector onto X1X_{1} along Y1Y_{1}, and let FF be the projector onto X2X_{2} along Y2Y_{2}. Prove that E−FE-F is a projector if and only if EF=FE=FEF=FE=F, and under this condition, prove that R(E−F)=X1∩Y2\mathcal{R}(E-F) = X_{1}\cap Y_{2} and N(E−F)=Y1⊕X2\mathcal{N}(E-F) = Y_{1}\oplus X_{2}.

?
Problem 5.9.19

For either a real or complex vector space, let EE be the projector onto X1X_{1} along Y1Y_{1}, and let FF be the projector onto X2X_{2} along Y2Y_{2}. Prove that if EF=P=FEEF=P=FE, then PP is the projector onto X1∩X2X_{1}\cap X_{2} along Y1+Y2Y_{1}+Y_{2}.

?
Problem 5.9.20

An inner pseudoinverse for Am×nA_{m\times n} is a matrix Xn×mX_{n\times m} such that AXA=AAXA=A, and an outer pseudoinverse for AA is a matrix XX satisfying XAX=XXAX=X. When XX is both an inner and outer pseudoinverse, XX is called a reflexive pseudoinverse.

?
(a)

If Ax=bAx=b is a consistent system of mm equations in nn unknowns, and if A−A^{-} is any inner pseudoinverse for AA, explain why the set of all solutions to Ax=bAx=b can be expressed as A−b+R(I−A−A)={A−b+(I−A−A)h∣h∈Rn}A^{-}b + \mathcal{R}(I-A^{-}A) = \left\{ A^{-}b + (I-A^{-}A)h \mid h \in \mathbb {R}^{n}\right\}.

(b)

Let MM and LL be respective complements of R(A)\mathcal{R}(A) and N(A)\mathcal{N}(A) so that Cm=R(A)⊕M\mathbb {C}^{m} = \mathcal{R}(A)\oplus M and Cn=L⊕N(A)\mathbb {C}^{n} = L\oplus \mathcal{N}(A). Prove that there is a unique reflexive pseudoinverse XX for AA such that R(X)=L\mathcal{R}(X) = L and N(X)=M\mathcal{N}(X) = M. Show that X=QA−PX = QA^{-}P, where A−A^{-} is any inner pseudoinverse for AA, PP is the projector onto R(A)\mathcal{R}(A) along MM, and QQ is the projector onto LL along N(A)\mathcal{N}(A).

Problem 5.10.1

If AA is a square matrix of index k>0k>0, prove that index⁡(Ak)=1\operatorname {index}(A^{k})=1.

?
Problem 5.10.2

If AA is a nilpotent matrix of index kk, describe the components in a core-nilpotent decomposition of AA.

?
Problem 5.10.3

Prove that if AA is a symmetric matrix, then index⁡(A)≤1\operatorname {index}(A) \leq 1.

?
Problem 5.10.4

A∈Cn×nA \in \mathbb {C}^{n\times n} is said to be a normal matrix whenever AA∗=A∗AAA^{*}=A^{*}A. Prove that if AA is normal, then index⁡(A)≤1\operatorname {index}(A) \leq 1.

?
Remark.
?

All symmetric matrices are normal, so this result includes Exercise 5.10.3 as a special case.

Problem 5.10.5

Find a core-nilpotent decomposition and the Drazin inverse of A=(−20−4424322)A = \begin{pmatrix} -2& 0& -4 \\ 4& 2& 4 \\ 3& 2& 2 \end{pmatrix}.

?
Problem 5.10.6

For a square matrix AA, any scalar λ\lambda that makes A−λIA-\lambda I singular is called an eigenvalue for AA. The index of an eigenvalue λ\lambda is defined to be index⁡(λ)=index⁡(A−λI)\operatorname {index}(\lambda ) = \operatorname {index}(A-\lambda I). Determine the eigenvalues and the index of each eigenvalue for the following matrices:

?
(a)

J=(1000001000001000002000002)J = \begin{pmatrix} 1& 0& 0& 0& 0 \\ 0& 1& 0& 0& 0 \\ 0& 0& 1& 0& 0 \\ 0& 0& 0& 2& 0 \\ 0& 0& 0& 0& 2 \end{pmatrix}.

(b)

J=(1100001100001000002100002)J = \begin{pmatrix} 1& 1& 0& 0& 0 \\ 0& 1& 1& 0& 0 \\ 0& 0& 1& 0& 0 \\ 0& 0& 0& 2& 1 \\ 0& 0& 0& 0& 2 \end{pmatrix}.

Problem 5.10.7

Let PP be a projector different from the identity.

?
(a)

Explain why index⁡(P)=1\operatorname {index}(P)=1. What is the index of II?

(b)

Determine the core-nilpotent decomposition for PP.

Problem 5.10.8

Let NN be a nilpotent matrix of index kk, and suppose that xx is a vector such that Nk−1x≠0N^{k-1}x \neq 0. Prove that the set C={x,Nx,N2x,…,Nk−1x}C = \left\{ x, Nx, N^{2}x, \ldots , N^{k-1}x\right\} is a linearly independent set.

?
Problem 5.10.9

Let AA be a square matrix of index kk, and let b∈R(Ak)b \in \mathcal{R}(A^{k}).

?
(a)

Explain why the linear system Ax=bAx=b must be consistent.

(b)

Explain why x=ADbx=A^{D}b is the unique solution in R(Ak)\mathcal{R}(A^{k}).

(c)

Explain why the general solution is given by ADb+N(A)A^{D}b + \mathcal{N}(A).

Problem 5.10.10

Suppose that AA is a square matrix of index kk, and let ADA^{D} be the Drazin inverse of AA. Explain why AADAA^{D} is the projector onto R(Ak)\mathcal{R}(A^{k}) along N(Ak)\mathcal{N}(A^{k}). What does I−AADI-AA^{D} project onto and along?

?
Problem 5.10.11

An algebraic group is a set GG together with an associative operation between its elements such that GG is closed with respect to this operation; GG possesses an identity element EE (unique); and every member A∈GA \in G has an inverse A#A^{\# } (unique). A matrix group is a set of square matrices that forms an algebraic group under ordinary matrix multiplication.

?
(a)

Show that the set of n×nn\times n nonsingular matrices is a matrix group.

(b)

Show that the set of n×nn\times n unitary matrices is a subgroup of the n×nn\times n nonsingular matrices.

(c)

Show that the set G={(αααα)  |  α≠0}G = \left\{ \begin{pmatrix} \alpha & \alpha \\ \alpha & \alpha \end{pmatrix} \; \middle |\; \alpha \neq 0\right\} is a matrix group. In particular, what does the identity element E∈GE \in G look like, and what does the inverse A#A^{\# } of A∈GA \in G look like?

Remark.
?

These axioms are essentially (A1), (A2), (A4), (A5) in the definition of a vector space.

Problem 5.10.12

For singular matrices, prove that the following statements are equivalent.

?
(a)

AA is a group matrix (i.e., AA belongs to a matrix group).

(b)

R(A)∩N(A)=0\mathcal{R}(A) \cap \mathcal{N}(A) = 0.

(c)

R(A)\mathcal{R}(A) and N(A)\mathcal{N}(A) are complementary subspaces.

(d)

index⁡(A)=1\operatorname {index}(A) = 1.

(e)

There are nonsingular matrices Qn×nQ_{n\times n} and Cr×rC_{r\times r} such that Q−1AQ=(Cr×r000)Q^{-1}AQ = \begin{pmatrix} C_{r\times r}& 0 \\ 0& 0 \end{pmatrix}, where r=rk⁡(A)r = \operatorname {rk}\left(A\right).

Problem 5.10.13

Let A∈GA \in G for some matrix group GG.

?
(a)

Show that the identity element E∈GE \in G is the projector onto R(A)\mathcal{R}(A) along N(A)\mathcal{N}(A) by arguing that EE must be of the form E=Q(Ir×r000)Q−1E = Q\begin{pmatrix} I_{r\times r}& 0 \\ 0& 0 \end{pmatrix}Q^{-1}.

(b)

Show that the group inverse of AA (the inverse of AA in GG) must be of the form A#=Q(C−1000)Q−1A^{\# } = Q\begin{pmatrix} C^{-1}& 0 \\ 0& 0 \end{pmatrix}Q^{-1}.

Problem 5.11.1

Verify the orthogonal decomposition theorem for A=(211−1−10−2−1−1)A = \begin{pmatrix} 2& 1& 1 \\ -1& -1& 0 \\ -2& -1& -1 \end{pmatrix}.

?
Remark.
?

The orthogonal decomposition theorem: for A∈Rm×nA \in \mathbb {R}^{m\times n}, R(A)⊥=N(AT)\mathcal{R}(A)^{\perp } = \mathcal{N}(A^{T}) and N(A)⊥=R(AT)\mathcal{N}(A)^{\perp } = \mathcal{R}(A^{T}), so Rm=R(A)⊕N(AT)\mathbb {R}^{m} = \mathcal{R}(A)\oplus \mathcal{N}(A^{T}) and Rn=N(A)⊕R(AT)\mathbb {R}^{n} = \mathcal{N}(A)\oplus \mathcal{R}(A^{T}).

Problem 5.11.2

For an inner-product space VV, what is V⊥V^{\perp }? What is 0⊥0^{\perp }?

?
Problem 5.11.3

Find a basis for the orthogonal complement of M=⟨(1203),(2416)⟩M = \left\langle \begin{pmatrix} 1\\ 2\\ 0\\ 3 \end{pmatrix}, \begin{pmatrix} 2\\ 4\\ 1\\ 6 \end{pmatrix}\right\rangle.

?
Problem 5.11.4

For every inner-product space VV, prove that if M⊆VM \subseteq V, then M⊥M^{\perp } is a subspace of VV.

?
Problem 5.11.5

If MM and NN are subspaces of an nn-dimensional inner-product space, prove that the following statements are true.

?
(a)

M⊆N  ⟹  N⊥⊆M⊥M \subseteq N \implies N^{\perp } \subseteq M^{\perp }.

(b)

(M+N)⊥=M⊥∩N⊥(M+N)^{\perp } = M^{\perp }\cap N^{\perp }.

(c)

(M∩N)⊥=M⊥+N⊥(M\cap N)^{\perp } = M^{\perp }+N^{\perp }.

Problem 5.11.6

Explain why the rank plus nullity theorem is a corollary of the orthogonal decomposition theorem.

?
Problem 5.11.7

Suppose A=URVTA = URV^{T} is a URV factorization of an m×nm\times n matrix of rank rr, and suppose UU is partitioned as U=[U1∣U2]U = \left[U_{1}\mid U_{2}\right], where U1U_{1} is m×rm\times r. Prove that P=U1U1TP = U_{1}U_{1}^{T} is the projector onto R(A)\mathcal{R}(A) along N(AT)\mathcal{N}(A^{T}).

?
Remark.
?

In this case, PP is said to be an orthogonal projector because its range is orthogonal to its nullspace. What is the orthogonal projector onto N(AT)\mathcal{N}(A^{T}) along R(A)\mathcal{R}(A)?

Problem 5.11.8

Use the Householder reduction method to compute a URV factorization as well as orthonormal bases for the four fundamental subspaces of A=(−4−2−4−22−221−41−4−2)A = \begin{pmatrix} -4& -2& -4& -2 \\ 2& -2& 2& 1 \\ -4& 1& -4& -2 \end{pmatrix}.

?
Problem 5.11.9

Compute a URV factorization for the matrix given in Exercise 5.11.8 by using elementary row operations together with Gram-Schmidt orthogonalization. Are the results the same as those of Exercise 5.11.8?

?
Problem 5.11.10

For the matrix AA of Exercise 5.11.8, find vectors x∈R(A)x \in \mathcal{R}(A) and y∈N(AT)y \in \mathcal{N}(A^{T}) such that v=x+yv = x+y, where v=(333)Tv = \begin{pmatrix} 3& 3& 3 \end{pmatrix}^{T}. Is there more than one choice for xx and yy?

?
Problem 5.11.11

Construct a square matrix such that R(A)∩N(A)=0\mathcal{R}(A)\cap \mathcal{N}(A) = 0, but R(A)\mathcal{R}(A) is not orthogonal to N(A)\mathcal{N}(A).

?
Problem 5.11.12

For An×nA_{n\times n} singular, explain why R(A)⊥N(A)\mathcal{R}(A)\perp \mathcal{N}(A) implies index⁡(A)=1\operatorname {index}(A)=1, but not conversely.

?
Problem 5.11.13

Prove that real-symmetric matrix   ⟹  \implies hermitian   ⟹  \implies normal   ⟹  \implies (complex) RPN (i.e., R(A)⊥N(A)\mathcal{R}(A) \perp \mathcal{N}(A)). Construct examples to show that none of the implications is reversible.

?
Problem 5.11.14

Let AA be a normal matrix.

?
(a)

Prove that R(A−λI)⊥N(A−λI)\mathcal{R}(A-\lambda I) \perp \mathcal{N}(A-\lambda I) for every scalar λ\lambda.

(b)

Let λ\lambda and μ\mu be scalars such that A−λIA-\lambda I and A−μIA-\mu I are singular matrices (eigenvalues of AA). Prove that if λ≠μ\lambda \neq \mu, then N(A−λI)⊥N(A−μI)\mathcal{N}(A-\lambda I) \perp \mathcal{N}(A-\mu I).

Problem 5.12.1

Following the derivation in the text, find an SVD for C=(−4−63−8)C = \begin{pmatrix} -4& -6 \\ 3& -8 \end{pmatrix}.

?
Problem 5.12.2

If σ1≥σ2≥⋯≥σr\sigma_{1}\geq \sigma_{2}\geq \cdots \geq \sigma_{r} are the nonzero singular values of AA, then it can be shown that the function νk(A)=(σ12+σ22+⋯+σk2)1/2\nu_{k}(A) = \left(\sigma_{1}^{2}+\sigma_{2}^{2}+\cdots +\sigma_{k}^{2}\right)^{1/2} defines a unitarily invariant norm (Exercise 5.6.9) for Rm×n\mathbb {R}^{m\times n} (or Cm×n\mathbb {C}^{m\times n}) for each k=1,2,…,rk=1,2,\ldots ,r. Explain why the 2-norm and the Frobenius norm are the extreme cases in the sense that ∥A∥22=σ12\left\| A\right\|_{2}^{2} = \sigma_{1}^{2} and ∥A∥F2=σ12+σ22+⋯+σr2\left\| A\right\|_{F}^{2} = \sigma_{1}^{2}+\sigma_{2}^{2}+\cdots +\sigma_{r}^{2}.

?
Remark.
?

Equation (5.12.4): σ1=max⁡∥x∥2=1∥Ax∥2=∥A∥2\sigma_{1} = \max_{\left\| x\right\|_{2}=1}\left\| Ax\right\|_{2} = \left\| A\right\|_{2}.

Problem 5.12.3

Explain why ∥A∥2≤∥A∥F≤n∥A∥2\left\| A\right\|_{2} \leq \left\| A\right\|_{F} \leq \sqrt{n}\left\| A\right\|_{2} (the (2,F)(2,F) and (F,2)(F,2) entries of the matrix-norm equivalence table from Exercise 5.1.8/5.12.3's own bound matrix).

?
Problem 5.12.4

Prove that if σ1≥σ2≥⋯≥σr\sigma_{1}\geq \sigma_{2}\geq \cdots \geq \sigma_{r} are the nonzero singular values of a rank rr matrix AA, and if ∥E∥2<σr\left\| E\right\|_{2} < \sigma_{r}, then rk⁡(A+E)≥rk⁡(A)\operatorname {rk}\left(A+E\right) \geq \operatorname {rk}\left(A\right).

?
Remark.
?

(5.12.10): if σ1≥⋯≥σr\sigma_{1}\geq \cdots \geq \sigma_{r} are the nonzero singular values of Am×nA_{m\times n}, then for each k<rk<r, the distance from AA to the closest matrix of rank kk is σk+1=min⁡rk⁡(B)=k∥A−B∥2\sigma_{k+1} = \min_{\operatorname {rk}\left(B\right)=k}\left\| A-B\right\|_{2}. This clarifies the meaning of "sufficiently small" in the fact that small perturbations can't reduce rank.

Problem 5.12.5

Extend the result on the image of the unit sphere to include singular and rectangular matrices by showing that if σ1≥σ2≥⋯≥σr>0\sigma_{1}\geq \sigma_{2}\geq \cdots \geq \sigma_{r}>0 are the nonzero singular values of Am×nA_{m\times n}, then the image A(S2)⊂RmA(S_{2}) \subset \mathbb {R}^{m} of the unit 2-sphere S2⊂RnS_{2}\subset \mathbb {R}^{n} is an ellipsoid (possibly degenerate) in which the kkth semiaxis is σkU∗k=AV∗k\sigma_{k}U_{*k} = AV_{*k}, where U∗kU_{*k} and V∗kV_{*k} are respective left-hand and right-hand singular vectors for AA.

?
Problem 5.12.6

Prove that if σr\sigma_{r} is the smallest nonzero singular value of Am×nA_{m\times n}, then

σr=min⁡∥x∥2=1x∈R(AT)∥Ax∥2=1/∥A†∥2. \sigma _{r} = \min _{\substack {\left\| x\right\| _{2}=1 \\ x \in \mathcal{R}(A^{T})}} \left\| Ax\right\| _{2} = 1/\left\| A^{\dagger }\right\| _{2}.
?
Problem 5.12.7

Extend the bound κ−1∥e∥/∥b∥≤∥x−x~∥/∥x∥≤κ∥e∥/∥b∥\kappa^{-1}\left\| e\right\| /\left\| b\right\| \leq \left\| x-\tilde{x}\right\| /\left\| x\right\| \leq \kappa \left\| e\right\| /\left\| b\right\| (where κ=∥A∥∥A−1∥\kappa = \left\| A\right\| \left\| A^{-1}\right\|, for a nonsingular system's uncertainty analysis) to include singular and rectangular matrices by showing that if xx and x~\tilde{x} are the respective minimum 2-norm solutions of consistent systems Ax=bAx=b and Ax~=b~=b−eA\tilde{x} = \tilde{b} = b-e, then

κ−1∥e∥∥b∥≤∥x−x~∥∥x∥≤κ∥e∥∥b∥,where κ=∥A∥∥A†∥. \kappa ^{-1}\frac{\left\| e\right\| }{\left\| b\right\| } \leq \frac{\left\| x-\tilde{x}\right\| }{\left\| x\right\| } \leq \kappa \frac{\left\| e\right\| }{\left\| b\right\| }, \qquad \text{where } \kappa = \left\| A\right\| \left\| A^{\dagger }\right\| .

Can the same reasoning as in the nonsingular uncertainty example be used to argue that for ∥⋆∥2\left\| \star \right\|_{2}, the upper and lower bounds are attainable for every AA?

?
Problem 5.12.8

Prove that if ∣ϵ∣<σr2\left|\epsilon \right| < \sigma_{r}^{2} for the smallest nonzero singular value of Am×nA_{m\times n}, then (ATA+ϵI)−1(A^{T}A+\epsilon I)^{-1} exists, and lim⁡ϵ→0(ATA+ϵI)−1AT=A†\lim_{\epsilon \to 0}(A^{T}A+\epsilon I)^{-1}A^{T} = A^{\dagger }.

?
Problem 5.12.9

Consider a system Ax=bAx=b in which A=(.835.667.333.266)A = \begin{pmatrix} .835& .667 \\ .333& .266 \end{pmatrix}, and suppose bb is subject to an uncertainty ee. Using ∞\infty-norms, determine the directions of bb and ee that give rise to the worst-case scenario ∥x−x~∥∞/∥x∥∞=κ∞∥e∥∞/∥b∥∞\left\| x-\tilde{x}\right\|_{\infty }/\left\| x\right\|_{\infty } = \kappa_{\infty }\left\| e\right\|_{\infty }/\left\| b\right\|_{\infty }.

?
Problem 5.12.10

An ill-conditioned matrix is suspected when a small pivot uiiu_{ii} emerges during the LU factorization of AA (because [U−1]ii=1/uii\left[U^{-1}\right]_{ii} = 1/u_{ii} is then large), but this is not an absolute test.

?
(a)

Construct an example of a matrix that is well conditioned but has a small pivot.

(b)

Construct an example of a matrix that is ill conditioned but has no small pivots.

Problem 5.12.11

Bound the relative uncertainty in the solution of a nonsingular system Ax=bAx=b for which there is some uncertainty in AA but not in bb, by showing that if (A−E)x~=b(A-E)\tilde{x}=b, where α=∥A−1E∥<1\alpha = \left\| A^{-1}E\right\| < 1 for any matrix norm with ∥I∥=1\left\| I\right\| =1, then

∥x−x~∥∥x∥≤κ1−α∥E∥∥A∥,where κ=∥A∥∥A−1∥. \frac{\left\| x-\tilde{x}\right\| }{\left\| x\right\| } \leq \frac{\kappa }{1-\alpha }\frac{\left\| E\right\| }{\left\| A\right\| }, \qquad \text{where } \kappa = \left\| A\right\| \left\| A^{-1}\right\| .
?
Remark.
?

If the 2-norm is used, ∥E∥2<σn\left\| E\right\|_{2}<\sigma_{n} insures α<1\alpha <1.

Problem 5.12.12

Now bound the relative uncertainty in the solution of a nonsingular system Ax=bAx=b for which there is some uncertainty in both AA and bb, by showing that if (A−E)x~=b−e(A-E)\tilde{x} = b-e, where α=∥A−1E∥<1\alpha = \left\| A^{-1}E\right\| < 1 for any matrix norm with ∥I∥=1\left\| I\right\| =1, then

∥x−x~∥∥x∥≤κ1−κ∥E∥/∥A∥(∥e∥∥b∥+∥E∥∥A∥),where κ=∥A∥∥A−1∥. \frac{\left\| x-\tilde{x}\right\| }{\left\| x\right\| } \leq \frac{\kappa }{1-\kappa \left\| E\right\| /\left\| A\right\| }\left(\frac{\left\| e\right\| }{\left\| b\right\| } + \frac{\left\| E\right\| }{\left\| A\right\| }\right), \qquad \text{where } \kappa = \left\| A\right\| \left\| A^{-1}\right\| .
?
Remark.
?

If the 2-norm is used, ∥E∥2<σn\left\| E\right\|_{2}<\sigma_{n} insures α<1\alpha <1. This exercise underscores the conclusion that if AA is well conditioned and the relative uncertainties in AA and bb are small, the relative uncertainty in xx must be small.

Problem 5.12.13

Consider the matrix A=(−4−2−4−22−221−41−4−2)A = \begin{pmatrix} -4& -2& -4& -2 \\ 2& -2& 2& 1 \\ -4& 1& -4& -2 \end{pmatrix}.

?
(a)

Use the URV factorization computed in Exercise 5.11.8 to determine A†A^{\dagger }.

(b)

Now use the URV factorization obtained in Exercise 5.11.9 to determine A†A^{\dagger }. Do your results agree with those of part (a)?

Problem 5.12.14

For matrix AA in Exercise 5.11.8, and for b=(−123−9)Tb = \begin{pmatrix} -12& 3& -9 \end{pmatrix}^{T}, find the solution of Ax=bAx=b that has minimum euclidean norm.

?
Remark.
?

Equation (5.12.17): when Ax=bAx=b is consistent, x=A†bx = A^{\dagger }b is the solution of minimal euclidean norm.

Problem 5.12.15

Suppose A=URVTA = URV^{T} is a URV factorization (so it could be an SVD) of an m×nm\times n matrix of rank rr, and suppose UU is partitioned as U=[U1∣U2]U = \left[U_{1}\mid U_{2}\right], where U1U_{1} is m×rm\times r. Prove that P=U1U1T=AA†P = U_{1}U_{1}^{T} = AA^{\dagger } is the projector onto R(A)\mathcal{R}(A) along N(AT)\mathcal{N}(A^{T}).

?
Remark.
?

In this case, PP is said to be an orthogonal projector because its range is orthogonal to its nullspace. What is the orthogonal projector onto N(AT)\mathcal{N}(A^{T}) along R(A)\mathcal{R}(A)?

Problem 5.12.16

Establish the following properties of A†A^{\dagger }.

?
(a)

A†=A−1A^{\dagger } = A^{-1} when AA is nonsingular.

(b)

(A†)†=A(A^{\dagger })^{\dagger } = A.

(c)

(A†)T=(AT)†(A^{\dagger })^{T} = (A^{T})^{\dagger }.

(d)

A†={(ATA)−1ATwhen rk⁡(Am×n)=n,AT(AAT)−1when rk⁡(Am×n)=m.A^{\dagger } = \begin{cases} (A^{T}A)^{-1}A^{T} & \text{when } \operatorname {rk}\left(A_{m\times n}\right)=n, \\ A^{T}(AA^{T})^{-1} & \text{when } \operatorname {rk}\left(A_{m\times n}\right)=m. \end{cases}

(e)

AT=ATAA†=A†AATA^{T} = A^{T}AA^{\dagger } = A^{\dagger }AA^{T} for all A∈Rm×nA \in \mathbb {R}^{m\times n}.

(f)

A†=AT(AAT)†=(ATA)†ATA^{\dagger } = A^{T}(AA^{T})^{\dagger } = (A^{T}A)^{\dagger }A^{T} for all A∈Rm×nA \in \mathbb {R}^{m\times n}.

(g)

R(A†)=R(AT)=R(A†A)\mathcal{R}(A^{\dagger }) = \mathcal{R}(A^{T}) = \mathcal{R}(A^{\dagger }A), and N(A†)=N(AT)=N(AA†)\mathcal{N}(A^{\dagger }) = \mathcal{N}(A^{T}) = \mathcal{N}(AA^{\dagger }).

(h)

(PAQ)†=QTA†PT(PAQ)^{\dagger } = Q^{T}A^{\dagger }P^{T} when PP and QQ are orthogonal matrices, but in general (AB)†≠B†A†(AB)^{\dagger } \neq B^{\dagger }A^{\dagger } (the reverse-order law fails).

(i)

(ATA)†=A†(AT)†(A^{T}A)^{\dagger } = A^{\dagger }(A^{T})^{\dagger } and (AAT)†=(AT)†A†(AA^{T})^{\dagger } = (A^{T})^{\dagger }A^{\dagger }.

Problem 5.12.17

Explain why A†=ADA^{\dagger } = A^{D} if and only if AA is an RPN matrix (i.e., R(A)⊥N(A)\mathcal{R}(A)\perp \mathcal{N}(A)).

?
Problem 5.12.18

Let X,Y∈Rm×nX, Y \in \mathbb {R}^{m\times n} be such that R(X)⊥R(Y)\mathcal{R}(X) \perp \mathcal{R}(Y).

?
(a)

Establish the Pythagorean theorem for matrices by proving ∥X+Y∥F2=∥X∥F2+∥Y∥F2\left\| X+Y\right\|_{F}^{2} = \left\| X\right\|_{F}^{2} + \left\| Y\right\|_{F}^{2}.

(b)

Give an example to show that the result of part (a) does not hold for the matrix 2-norm.

(c)

Demonstrate that A†A^{\dagger } is the best approximate inverse for AA in the sense that A†A^{\dagger } is the matrix of smallest Frobenius norm that minimizes ∥I−AX∥F\left\| I-AX\right\|_{F}.

Problem 5.13.1

Find the orthogonal projection of bb onto M=⟨u⟩M = \left\langle u\right\rangle, and then determine the orthogonal projection of bb onto M⊥M^{\perp }, where b=(48)Tb = \begin{pmatrix} 4 & 8 \end{pmatrix}^{T} and u=(31)Tu = \begin{pmatrix} 3 & 1 \end{pmatrix}^{T}.

?
Problem 5.13.2

Let A=(120241120)A = \begin{pmatrix} 1& 2& 0 \\ 2& 4& 1 \\ 1& 2& 0 \end{pmatrix} and b=(111)b = \begin{pmatrix} 1\\ 1\\ 1 \end{pmatrix}.

?
(a)

Compute the orthogonal projectors onto each of the four fundamental subspaces associated with AA.

(b)

Find the point in N(A)⊥\mathcal{N}(A)^{\perp } that is closest to bb.

Problem 5.13.3

For an orthogonal projector PP, prove that ∥Px∥2=∥x∥2\left\| Px\right\|_{2} = \left\| x\right\|_{2} if and only if x∈R(P)x \in \mathcal{R}(P).

?
Problem 5.13.4

Explain why ATPR(A)=ATA^{T}P_{\mathcal{R}(A)} = A^{T} for all A∈Rm×nA \in \mathbb {R}^{m\times n}.

?
Problem 5.13.5

Explain why PM=∑i=1ruiuiTP_{M} = \sum_{i=1}^{r} u_{i}u_{i}^{T} whenever B={u1,u2,…,ur}B = \left\{ u_{1},u_{2},\ldots ,u_{r}\right\} is an orthonormal basis for M⊆Rn×1M \subseteq \mathbb {R}^{n\times 1}.

?
Problem 5.13.6

Explain how to use orthogonal reduction techniques to compute the orthogonal projectors onto each of the four fundamental subspaces of a matrix A∈Rm×nA \in \mathbb {R}^{m\times n}.

?
Problem 5.13.7
?
(a)

Describe all 2×22\times 2 orthogonal projectors in R2×2\mathbb {R}^{2\times 2}.

(b)

Describe all 2×22\times 2 (oblique) projectors in R2×2\mathbb {R}^{2\times 2}.

Problem 5.13.8

The line LL in Rn\mathbb {R}^{n} passing through two distinct points uu and vv is L=u+⟨u−v⟩L = u + \left\langle u-v\right\rangle. If u≠0u \neq 0 and v≠αuv \neq \alpha u, then LL is a line not passing through the origin — i.e., LL is not a subspace. Explain how to project a vector bb orthogonally onto LL.

?
Problem 5.13.9

Explain why x^\hat{x} is a least squares solution for Ax=bAx=b if and only if ∥Ax^−b∥2=∥PN(AT)b∥2\left\| A\hat{x}-b\right\|_{2} = \left\| P_{\mathcal{N}(A^{T})}b\right\|_{2}.

?
Problem 5.13.10

Prove that if ε=Ax^−b\varepsilon = A\hat{x}-b, where x^\hat{x} is a least squares solution for Ax=bAx=b, then ∥ε∥22=∥b∥22−∥PR(A)b∥22\left\| \varepsilon \right\|_{2}^{2} = \left\| b\right\|_{2}^{2} - \left\| P_{\mathcal{R}(A)}b\right\|_{2}^{2}.

?
Problem 5.13.11

Let MM be an rr-dimensional subspace of Rn\mathbb {R}^{n}. If B={u1,u2,…,ur}B = \left\{ u_{1},u_{2},\ldots ,u_{r}\right\} is an orthonormal basis for MM, and if x∈Mx \in M, then xx equals its Fourier expansion with respect to BB: x=∑i=1r(uiTx)uix = \sum_{i=1}^{r}(u_{i}^{T}x)u_{i}. Show that when x∉Mx \notin M, this same sum ∑i=1r(uiTx)ui\sum_{i=1}^{r}(u_{i}^{T}x)u_{i} is the point in MM closest to xx — i.e., show ∑i=1r(uiTx)ui=PMx\sum_{i=1}^{r}(u_{i}^{T}x)u_{i} = P_{M}x.

?
Problem 5.13.12

Determine the orthogonal projection of bb onto MM, where

b=(5253)andM=⟨(−3/504/50),(0001),(4/503/50)⟩. b = \begin{pmatrix} 5\\ 2\\ 5\\ 3 \end{pmatrix} \qquad \text{and} \qquad M = \left\langle \begin{pmatrix} -3/5\\ 0\\ 4/5\\ 0 \end{pmatrix}, \begin{pmatrix} 0\\ 0\\ 0\\ 1 \end{pmatrix}, \begin{pmatrix} 4/5\\ 0\\ 3/5\\ 0 \end{pmatrix}\right\rangle .
?
Remark.
?

Is this spanning set in fact an orthonormal basis?

Problem 5.13.13

Let MM and NN be subspaces of a vector space VV, and consider the associated orthogonal projectors PMP_{M} and PNP_{N}.

?
(a)

Prove that PMPN=0P_{M}P_{N} = 0 if and only if M⊥NM \perp N.

(b)

Is it true that PMPN=0P_{M}P_{N}=0 if and only if PNPM=0P_{N}P_{M}=0? Why?

Problem 5.13.14

Let MM and NN be subspaces of the same vector space, and let PMP_{M} and PNP_{N} be orthogonal projectors onto MM and NN, respectively.

?
(a)

Prove that R(PM+PN)=R(PM)+R(PN)=M+N\mathcal{R}(P_{M}+P_{N}) = \mathcal{R}(P_{M}) + \mathcal{R}(P_{N}) = M+N.

(b)

Explain why M⊥NM\perp N if and only if PMPN=0P_{M}P_{N}=0.

(c)

Explain why PM+PNP_{M}+P_{N} is an orthogonal projector if and only if PMPN=0P_{M}P_{N}=0, in which case R(PM+PN)=M⊕N\mathcal{R}(P_{M}+P_{N}) = M\oplus N and M⊥NM\perp N.

Problem 5.13.15

Prove that if MM and NN are subspaces of the same vector space, then the orthogonal projector onto M∩NM\cap N is given by PM∩N=2PM(PM+PN)†PNP_{M\cap N} = 2P_{M}(P_{M}+P_{N})^{\dagger }P_{N}.

?
Remark.
?

This formula generalizes the resistance of a circuit composed of two resistors r1r_{1} and r2r_{2} connected in parallel, r1r2/(r1+r2)=r1(r1+r2)−1r2r_{1}r_{2}/(r_{1}+r_{2}) = r_{1}(r_{1}+r_{2})^{-1}r_{2}; PM(PM+PN)†PNP_{M}(P_{M}+P_{N})^{\dagger }P_{N} is called the parallel sum of PMP_{M} and PNP_{N}.

Problem 5.13.16

Given a square matrix XX, the matrix exponential is eX=I+X+X22!+X33!+⋯=∑n=0∞Xnn!e^{X} = I+X+\dfrac {X^{2}}{2!}+\dfrac {X^{3}}{3!}+\cdots = \sum_{n=0}^{\infty } \dfrac {X^{n}}{n!}, and it is legitimate to differentiate/integrate it term by term, giving deAt/dt=AeAt=eAtAde^{At}/dt = Ae^{At} = e^{At}A and ∫eAtA dt=eAt\int e^{At}A\, dt = e^{At}.

?
(a)

Use the fact that lim⁡t→∞e−ATAt=0\lim_{t\to \infty } e^{-A^{T}At} = 0 for all A∈Rm×nA \in \mathbb {R}^{m\times n} to show A†=∫0∞e−ATAtAT dtA^{\dagger } = \int_{0}^{\infty } e^{-A^{T}At}A^{T}\, dt.

(b)

If lim⁡t→∞e−Ak+1t=0\lim_{t\to \infty } e^{-A^{k+1}t} = 0, show AD=∫0∞e−Ak+1tAk dtA^{D} = \int_{0}^{\infty } e^{-A^{k+1}t}A^{k}\, dt, where k=index⁡(A)k = \operatorname {index}(A).

(c)

For nonsingular matrices, show that if lim⁡t→∞e−At=0\lim_{t\to \infty } e^{-At} = 0, then A−1=∫0∞e−At dtA^{-1} = \int_{0}^{\infty } e^{-At}\, dt.

Problem 5.13.17

An affine space v+M⊆Rnv+M \subseteq \mathbb {R}^{n} for which dim⁡M=n−1\dim M = n-1 is called a hyperplane.

?
(a)

Prove that for a given scalar β\beta and a nonzero vector u∈Rnu \in \mathbb {R}^{n}, the set H={x∣uTx=β}H = \left\{ x \mid u^{T}x = \beta \right\} is a hyperplane in Rn\mathbb {R}^{n}.

(b)

Explain why the orthogonal projection of b∈Rnb \in \mathbb {R}^{n} onto HH is p=b−(uTb−βuTu)up = b - \left(\dfrac {u^{T}b-\beta }{u^{T}u}\right)u.

Problem 5.13.18

For u,w∈Rnu,w \in \mathbb {R}^{n} such that uTw≠0u^{T}w \neq 0, let M=u⊥M = u^{\perp } and W=⟨w⟩W = \left\langle w\right\rangle.

?
(a)

Explain why Rn=M⊕W\mathbb {R}^{n} = M\oplus W.

(b)

For b∈Rnb \in \mathbb {R}^{n}, explain why the oblique projection of bb onto MM along WW is given by p=b−uTbuTwwp = b - \dfrac {u^{T}b}{u^{T}w}w.

(c)

For a given scalar β\beta, let HH be the hyperplane H={x∣uTx=β}H=\left\{ x \mid u^{T}x=\beta \right\}. Explain why the oblique projection of bb onto HH along WW should be given by p=b−(uTb−βuTw)wp = b - \left(\dfrac {u^{T}b-\beta }{u^{T}w}\right)w.

Problem 5.13.19

For a consistent system An×rx=bA_{n\times r}x=b with rk⁡(A)=r\operatorname {rk}\left(A\right)=r, scale the rows so that ∥Ai∗∥2=1\left\| A_{i*}\right\|_{2}=1 for each ii, and let Hi={x∣Ai∗x=bi}H_{i} = \left\{ x \mid A_{i*}x=b_{i}\right\} be the hyperplane defined by the iith equation. Beginning with an arbitrary vector p0p_{0}, the Kaczmarz sequence is generated by the double loop For k=0,1,2,3,…k=0,1,2,3,\ldots For i=1,2,…,ni=1,2,\ldots ,n pkn+i=pkn+i−1−(Ai∗pkn+i−1−bi)(Ai∗)Tp_{kn+i} = p_{kn+i-1} - (A_{i*}p_{kn+i-1}-b_{i})(A_{i*})^{T} Prove that the Kaczmarz sequence converges to the solution xx of Ax=bAx=b by showing

∥pkn+i−x∥22=∥pkn+i−1−x∥22−(Ai∗pkn+i−1−bi)2. \left\| p_{kn+i}-x\right\| _{2}^{2} = \left\| p_{kn+i-1}-x\right\| _{2}^{2} - (A_{i*}p_{kn+i-1}-b_{i})^{2}.
?
Problem 5.13.20

Assume a nonsingular system An×nx=bA_{n\times n}x=b has been row scaled so that ∥Ai∗∥2=1\left\| A_{i*}\right\|_{2}=1 for each ii, and let Hi={x∣Ai∗x=bi}H_{i} = \left\{ x \mid A_{i*}x=b_{i}\right\}. In theory, the system can be solved by n−1n-1 oblique projections (Exercise 5.13.18): an arbitrary point p1p_{1} in H1H_{1} is projected obliquely onto H2H_{2} along H1H_{1} to produce p2∈H1∩H2p_{2} \in H_{1}\cap H_{2}, then p2p_{2} is projected onto H3H_{3} along H1∩H2H_{1}\cap H_{2} to produce p3p_{3}, and so on. Since ⋂i=1kHi\bigcap_{i=1}^{k} H_{i} is generally unknown, the procedure is modified — use the following figure, showing the n=3n=3 case, as a guide.

Successive oblique projections for n=3: p_1^{(1)} is projected through p_2^{(1)}, p_3^{(1)} onto \mathcal{H}_2, producing points in \mathcal{H}_1 \cap \mathcal{H}_2.Successive oblique projections for n=3: p_1^{(1)} is projected through p_2^{(1)}, p_3^{(1)} onto \mathcal{H}_2, producing points in \mathcal{H}_1 \cap \mathcal{H}_2.

Step 0. Begin with any set {p1(1),p2(1),…,pn(1)}⊂H1\left\{ p_{1}^{(1)}, p_{2}^{(1)}, \ldots , p_{n}^{(1)}\right\} \subset H_{1} such that {p1(1)−p2(1),…,p1(1)−pn(1)}\left\{ p_{1}^{(1)}-p_{2}^{(1)}, \ldots , p_{1}^{(1)}-p_{n}^{(1)}\right\} is linearly independent and A2∗(p1(1)−pk(1))≠0A_{2*}(p_{1}^{(1)}-p_{k}^{(1)}) \neq 0 for k=2,…,nk=2,\ldots ,n. Step 1. In turn, project p1(1)p_{1}^{(1)} onto H2H_{2} through p2(1),…,pn(1)p_{2}^{(1)},\ldots ,p_{n}^{(1)} to produce {p2(2),…,pn(2)}⊂H1∩H2\left\{ p_{2}^{(2)},\ldots ,p_{n}^{(2)}\right\} \subset H_{1}\cap H_{2}. Step 2. Project p2(2)p_{2}^{(2)} onto H3H_{3} through p3(2),…,pn(2)p_{3}^{(2)},\ldots ,p_{n}^{(2)} to produce {p3(3),…,pn(3)}⊂H1∩H2∩H3\left\{ p_{3}^{(3)},\ldots ,p_{n}^{(3)}\right\} \subset H_{1}\cap H_{2}\cap H_{3}, and so on. Step n−1n-1. Project pn−1(n−1)p_{n-1}^{(n-1)} through pn(n−1)p_{n}^{(n-1)} to produce pn(n)∈⋂i=1nHip_{n}^{(n)} \in \bigcap_{i=1}^{n} H_{i}. Then x=pn(n)x = p_{n}^{(n)} is the solution. Explain why the following algorithm performs the computations of Steps 1,2,…,n−11,2,\ldots ,n-1. For i=2i=2 to nn For j=ij=i to nn xj←xj−(Ai∗xi−1−bi)xi−1−xjAi∗(xi−1−xj)x_{j} \leftarrow x_{j} - (A_{i*}x_{i-1}-b_{i})\dfrac {x_{i-1}-x_{j}}{A_{i*}(x_{i-1}-x_{j})} x←xnx \leftarrow x_{n} (the solution of the system)

?
Problem 5.13.21

Let MM be a subspace of Rn\mathbb {R}^{n}, and let R=I−2PMR = I-2P_{M}. Prove that the orthogonal distance between any point x∈Rnx \in \mathbb {R}^{n} and M⊥M^{\perp } is the same as the orthogonal distance between RxRx and M⊥M^{\perp } (i.e., RR reflects everything about M⊥M^{\perp }).

?
Problem 5.13.22

In 1938 the Italian mathematician Gianfranco Cimmino used the following elementary observation to construct an iterative algorithm for solving linear systems. For a 2×22\times 2 system Ax=bAx=b, let H1H_{1} and H2H_{2} be the two lines (hyperplanes) defined by the two equations. For an arbitrary guess r0r_{0}, let r1r_{1} be the reflection of r0r_{0} about the line H1H_{1}, and let r2r_{2} be the reflection of r0r_{0} about the line H2H_{2}. As illustrated below, the three points r0r_{0}, r1r_{1}, and r2r_{2} lie on a circle whose center is H1∩H2H_{1}\cap H_{2} (the solution of the system).

The reflections r_1, r_2 of an arbitrary point r_0 about lines \mathcal{H}_1, \mathcal{H}_2 lie, together with r_0, on a circle centered at \mathcal{H}_1 \cap \mathcal{H}_2.The reflections r_1, r_2 of an arbitrary point r_0 about lines \mathcal{H}_1, \mathcal{H}_2 lie, together with r_0, on a circle centered at \mathcal{H}_1 \cap \mathcal{H}_2.

The mean value m=(r1+r2)/2m = (r_{1}+r_{2})/2 is strictly inside the circle, so mm is a better approximation to the solution than r0r_{0}. It's visually evident that iteration produces a sequence that converges to the solution of Ax=bAx=b. Prove this in general by using the following blueprint.

?
(a)

For a scalar β\beta and a vector u∈Rnu \in \mathbb {R}^{n} such that ∥u∥2=1\left\| u\right\|_{2}=1, consider the hyperplane H={x∣uTx=β}H = \left\{ x \mid u^{T}x=\beta \right\} (Exercise 5.13.17). Show that the reflection of a vector bb about HH is r=b−2(uTb−β)ur = b - 2(u^{T}b-\beta )u.

(b)

For a system Ax=bAx=b in which the rows of A∈Rn×rA \in \mathbb {R}^{n\times r} have been scaled so that ∥Ai∗∥2=1\left\| A_{i*}\right\|_{2}=1 for each ii, let Hi={x∣Ai∗x=bi}H_{i} = \left\{ x \mid A_{i*}x=b_{i}\right\}. If r0∈Rrr_{0} \in \mathbb {R}^{r} is arbitrary, and rir_{i} is the reflection of r0r_{0} about HiH_{i}, explain why the mean value of the reflections {r1,…,rn}\left\{ r_{1},\ldots ,r_{n}\right\} is m=r0−(2/n)ATεm = r_{0} - (2/n)A^{T}\varepsilon, where ε=Ar0−b\varepsilon = Ar_{0}-b.

(c)

Iterating part (b) produces mk=mk−1−(2/n)ATεk−1m_{k} = m_{k-1} - (2/n)A^{T}\varepsilon_{k-1}, where εk−1=Amk−1−b\varepsilon_{k-1} = Am_{k-1}-b. Show that if AA is nonsingular, and x=A−1bx=A^{-1}b, then x−mk=(I−(2/n)ATA)k(x−m0)x-m_{k} = \left(I-(2/n)A^{T}A\right)^{k}(x-m_{0}).

Remark.
?

It can be proven that (I−(2/n)ATA)k→0\left(I-(2/n)A^{T}A\right)^{k} \to 0 as k→∞k\to \infty, so mk→xm_{k}\to x for all m0m_{0}, even if AA is rank deficient (converging to a solution if consistent, else a least squares solution). Cimmino's method also works with weighted means: if W=diag⁡(w1,…,wn)W = \operatorname {diag}(w_{1},\ldots ,w_{n}), wi>0w_{i}>0, ∑wi=1\sum w_{i}=1, then mk=mk−1−ωATWεk−1m_{k} = m_{k-1} - \omega A^{T}W\varepsilon_{k-1} converges for a relaxation parameter 0<ω<20<\omega <2.

Problem 5.14.1

For a matrix Zm×n=[zij]Z_{m\times n} = [z_{ij}] of random variables, E[Z]E[Z] is the m×nm\times n matrix whose (i,j)(i,j)-entry is E[zij]E[z_{ij}]. Consider the standard linear model y=Xm×nβ+εy = X_{m\times n}\beta + \varepsilon such that rk⁡(X)=n\operatorname {rk}\left(X\right)=n, E[ε]=0E[\varepsilon ]=0, Cov⁡[ε]=σ2I\operatorname {Cov}[\varepsilon ] = \sigma^{2}I, and let e^\hat{e} denote the vector of random variables defined by e^=y−Xβ^\hat{e} = y - X\hat{\beta }, in which β^=(XTX)−1XTy=X†y\hat{\beta } = (X^{T}X)^{-1}X^{T}y = X^{\dagger }y. Demonstrate that

σ^2=e^Te^m−n \hat{\sigma }^{2} = \frac{\hat{e}^{T}\hat{e}}{m-n}

is an unbiased estimator for σ2\sigma^{2}.

?
Remark.
?

(5.14.5): under the standard linear model, μyi=Xi∗β\mu_{y_i} = X_{i*}\beta and Cov⁡[yi,yj]=σ2\operatorname {Cov}[y_i,y_j] = \sigma^{2} if i=ji=j, 00 otherwise. Exercise 5.9.13: rk⁡(P)=trace⁡(P)\operatorname {rk}\left(P\right) = \operatorname {trace}(P) for any projector PP.

Problem 5.15.1

Determine the angles θmin⁡\theta_{\min } and θmax⁡\theta_{\max } between the following subspaces of R3\mathbb {R}^{3}.

?
(a)

M=xy-planeM = xy\text{-plane}, N=⟨(1,0,0),(0,1,1)⟩N = \left\langle (1,0,0),(0,1,1)\right\rangle.

(b)

M=xy-planeM = xy\text{-plane}, N=⟨(0,1,1)⟩N = \left\langle (0,1,1)\right\rangle.

Problem 5.15.2

Determine the principal angles between the following subspaces of R3\mathbb {R}^{3}.

?
(a)

M=xy-planeM = xy\text{-plane}, N=⟨(1,0,0),(0,1,1)⟩N = \left\langle (1,0,0),(0,1,1)\right\rangle.

(b)

M=xy-planeM = xy\text{-plane}, N=⟨(0,1,1)⟩N = \left\langle (0,1,1)\right\rangle.

Remark.
?

The principal angles between MM and NN are defined recursively: θ1=θmin⁡\theta_{1} = \theta_{\min }, with u1,v1u_{1}, v_{1} the unit vectors attaining the maximum in cos⁡θmin⁡=v1Tu1\cos \theta_{\min } = v_{1}^{T}u_{1}; then M2=u1⊥∩MM_{2} = u_{1}^{\perp } \cap M, N2=v1⊥∩NN_{2} = v_{1}^{\perp } \cap N, and θ2\theta_{2} is the minimal angle between M2M_{2} and N2N_{2}, and so on.

Problem 5.15.3

Let θmin⁡\theta_{\min } be the minimal angle between nonzero subspaces M,N⊆RnM, N \subseteq \mathbb {R}^{n}.

?
(a)

Explain why θmax⁡=0\theta_{\max }=0 if and only if M=NM=N.

(b)

Explain why θmin⁡=0\theta_{\min }=0 if and only if M∩N≠0M\cap N \neq 0.

(c)

Explain why θmin⁡=π/2\theta_{\min }=\pi /2 if and only if M⊥NM\perp N.

Remark.
?

Equation (5.15.16): the maximal angle satisfies sin⁡θmax⁡=gap⁡(M,N)=∥PM−PN∥2\sin \theta_{\max } = \operatorname {gap}(M,N) = \left\| P_{M}-P_{N}\right\|_{2}.

Problem 5.15.4

Let θmin⁡\theta_{\min } be the minimal angle between nonzero subspaces M,N⊂RnM, N \subset \mathbb {R}^{n}, and let θmin⁡⊥\theta_{\min }^{\perp } denote the minimal angle between M⊥M^{\perp } and N⊥N^{\perp }. Prove that if M⊕N=RnM\oplus N = \mathbb {R}^{n}, then θmin⁡=θmin⁡⊥\theta_{\min } = \theta_{\min }^{\perp }.

?
Remark.
?

Equation (5.15.4): if M,NM, N are complementary, sin⁡θmin⁡=1/∥(PM−PN)−1∥2\sin \theta_{\min } = 1/\left\| (P_{M} - P_{N})^{-1}\right\|_{2}.

Problem 5.15.5

For nonzero subspaces M,N⊂RnM, N \subset \mathbb {R}^{n}, let θ~min⁡\tilde{\theta }_{\min } denote the minimal angle between MM and N⊥N^{\perp }, and let θmax⁡\theta_{\max } be the maximal angle between MM and NN. Prove that if M⊕N⊥=RnM \oplus N^{\perp } = \mathbb {R}^{n}, then cos⁡θ~min⁡=sin⁡θmax⁡\cos \tilde{\theta }_{\min } = \sin \theta_{\max }.

?
Remark.
?
Problem 5.15.6

For subspaces M,N⊆RnM, N \subseteq \mathbb {R}^{n}, prove that PM−PNP_{M}-P_{N} is nonsingular if and only if MM and NN are complementary.

?
Remark.
?

Equation (5.15.7): with U = [U1 | U2], V = [V1 | V2] orthogonal matrices whose columns give orthonormal bases for M, M-perp, N-perp, N respectively (so that P_M = U1 U1^T, P_N = V2 V2^T), U^T (P_M - P_N) V = block-diag(U1^T V1, -U2^T V2).

Problem 5.15.7

For complementary spaces M,N⊂RnM, N \subset \mathbb {R}^{n}, let P=PMNP = P_{MN} be the oblique projector onto MM along NN, and let Q=PM⊥N⊥Q = P_{M^{\perp }N^{\perp }} be the oblique projector onto M⊥M^{\perp } along N⊥N^{\perp }.

?
(a)

Prove that (PM−PN)−1=P−Q(P_{M}-P_{N})^{-1} = P-Q.

(b)

If θmin⁡\theta_{\min } is the minimal angle between MM and NN, explain why sin⁡θmin⁡=1/∥P−Q∥2\sin \theta_{\min } = 1/\left\| P-Q\right\|_{2}.

(c)

Explain why ∥P−Q∥2=∥P∥2\left\| P-Q\right\|_{2} = \left\| P\right\|_{2}.

Problem 5.15.8

Prove that if f:V→Rf: V \to \mathbb {R} is a function defined on a space VV such that f(αx)=αf(x)f(\alpha x) = \alpha f(x) for scalars α≥0\alpha \geq 0, then max⁡∥x∥=1f(x)=max⁡∥x∥≤1f(x)\max_{\left\| x\right\| =1} f(x) = \max_{\left\| x\right\| \leq 1} f(x).

?
Problem 5.15.9

Let MM and NN be nonzero complementary subspaces of Rn\mathbb {R}^{n}.

?
(a)

Explain why PMN=[(I−PN)PM]†P_{MN} = \left[(I-P_{N})P_{M}\right]^{\dagger }, where PMP_{M} and PNP_{N} are the orthogonal projectors onto MM and NN, respectively, and PMNP_{MN} is the oblique projector onto MM along NN.

(b)

If θmin⁡\theta_{\min } is the minimal angle between MM and NN, explain why

sin⁡θmin⁡=∥[(I−PN)PM]†∥2−1=∥[PM(I−PN)]†∥2−1=∥[(I−PM)PN]†∥2−1=∥[PN(I−PM)]†∥2−1. \sin \theta _{\min } = \left\| \left[(I-P_{N})P_{M}\right]^{\dagger }\right\| _{2}^{-1} = \left\| \left[P_{M}(I-P_{N})\right]^{\dagger }\right\| _{2}^{-1} = \left\| \left[(I-P_{M})P_{N}\right]^{\dagger }\right\| _{2}^{-1} = \left\| \left[P_{N}(I-P_{M})\right]^{\dagger }\right\| _{2}^{-1}.
Problem 5.15.10

For complementary subspaces M,N⊂RnM, N \subset \mathbb {R}^{n}, let θmin⁡\theta_{\min } be the minimal angle between MM and NN, and let θˉmin⁡\bar{\theta }_{\min } denote the minimal angle between MM and N⊥N^{\perp }.

?
(a)

If PMNP_{MN} is the oblique projector onto MM along NN, prove that cos⁡θˉmin⁡=∥PMN†∥2\cos \bar{\theta }_{\min } = \left\| P_{MN}^{\dagger }\right\|_{2}.

(b)

Explain why sin⁡θmin⁡≤cos⁡θˉmin⁡\sin \theta_{\min } \leq \cos \bar{\theta }_{\min }.

Problem 5.15.11

Let U=[U1∣U2]U = \left[U_{1}\mid U_{2}\right] and V=[V1∣V2]V = \left[V_{1}\mid V_{2}\right] be the orthogonal matrices whose columns give orthonormal bases for M,M⊥,N⊥,NM, M^{\perp }, N^{\perp }, N respectively (as in the proof of (5.15.3)-(5.15.4)).

?
(a)

Prove that if U2TV2U_{2}^{T}V_{2} is nonsingular, then 1∥(U2TV2)−1∥22=1−∥U2TV1∥22\dfrac {1}{\left\| (U_{2}^{T}V_{2})^{-1}\right\|_{2}^{2}} = 1 - \left\| U_{2}^{T}V_{1}\right\|_{2}^{2}.

(b)

Prove that if U2TV1U_{2}^{T}V_{1} is nonsingular, then ∥U2TV2∥22=1−1∥(U2TV1)−1∥22\left\| U_{2}^{T}V_{2}\right\|_{2}^{2} = 1 - \dfrac {1}{\left\| (U_{2}^{T}V_{1})^{-1}\right\|_{2}^{2}}.