Section 12.1

Chapter Problems

[35/100%]
Show
LaTeX
Problem 12.1.1

Consider the vectors in C4\mathbb {C}^{4}

v→=(i1−1−i),w→=(i00i). \overrightarrow {v} = \begin{pmatrix} i \\ 1 \\ -1 \\ -i \end{pmatrix}, \quad \overrightarrow {w} = \begin{pmatrix} i \\ 0 \\ 0 \\ i \end{pmatrix}.

Find the Euclidean norm and then normalize the vectors. Are the vectors orthogonal to each other?

?
Problem 12.1.2

Consider the vectors in R3\mathbb {R}^{3}

v→1=(111),v→2=(1−11),v→3=(1−1−1). \overrightarrow {v}_{1} = \begin{pmatrix} 1 \\ 1 \\ 1 \end{pmatrix}, \quad \overrightarrow {v}_{2} = \begin{pmatrix} 1 \\ -1 \\ 1 \end{pmatrix}, \quad \overrightarrow {v}_{3} = \begin{pmatrix} 1 \\ -1 \\ -1 \end{pmatrix}.
?
(i)

Show that the vectors are linearly independent.

(ii)

Apply the Gram-Schmidt orthonormalization process to these vectors.

Problem 12.1.3

Let A\mathbf{A} be an n×nn \times n matrix over R\mathbb {R}. The spectral norm is

∥A∥2:=max⁡x→≠0→∥Ax→∥2∥x→∥2. \left\| \mathbf{A}\right\| _{2} := \max _{\overrightarrow {x} \neq \overrightarrow {0}} \frac{\left\| \mathbf{A}\overrightarrow {x}\right\| _{2}}{\left\| \overrightarrow {x}\right\| _{2}}.

It can be shown that ∥A∥2\left\| \mathbf{A}\right\|_{2} can also be calculated as

∥A∥2=largest eigenvalue of ATA. \left\| \mathbf{A}\right\| _{2} = \sqrt{\text{largest eigenvalue of } \mathbf{A}^{T}\mathbf{A}}.

The eigenvalues of ATA\mathbf{A}^{T}\mathbf{A} are real and nonnegative. Consider the 2×22 \times 2 matrix

A=(2513). \mathbf{A} = \begin{pmatrix} 2 & 5 \\ 1 & 3 \end{pmatrix}.

Calculate ∥A∥2\left\| \mathbf{A}\right\|_{2} using this method.

?
Problem 12.1.4

Let {v→j:j=1,…,r}\left\{ \overrightarrow {v}_{j} : j = 1, \ldots , r\right\} be an orthogonal set of vectors in Rn\mathbb {R}^{n} with r≤nr \leq n. Show that

∥∑j=1rv→j∥2=∑j=1r∥v→j∥2. \left\| \sum _{j=1}^{r}\overrightarrow {v}_{j}\right\| ^{2} = \sum _{j=1}^{r}\left\| \overrightarrow {v}_{j}\right\| ^{2}.
?
Problem 12.1.5

Consider the 2×22 \times 2 matrix A\mathbf{A} over C\mathbb {C}. Find the norm of A\mathbf{A} implied by the scalar product ⟨A,A⟩=tr⁡(AA∗)\left\langle \mathbf{A}, \mathbf{A} \right\rangle = \sqrt{\operatorname {tr}(\mathbf{A}\mathbf{A}^{*})}.

?
Problem 12.1.6

Let A\mathbf{A}, B\mathbf{B} be n×nn \times n matrices over C\mathbb {C}. A scalar product can be defined as

⟨A,B⟩:=tr⁡(AB∗). \left\langle \mathbf{A}, \mathbf{B} \right\rangle := \operatorname {tr}(\mathbf{A}\mathbf{B}^{*}).

The scalar product implies a norm ∥A∥2=⟨A,A⟩=tr⁡(AA∗)\left\| \mathbf{A}\right\|^{2} = \left\langle \mathbf{A}, \mathbf{A} \right\rangle = \operatorname {tr}(\mathbf{A}\mathbf{A}^{*}). This norm is called the Hilbert-Schmidt norm.

?
(i)

Consider the two Dirac matrices

γ0:=(1000010000−10000−1),γ1:=(000100100−100−1000). \gamma _{0} := \begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & -1 & 0 \\ 0 & 0 & 0 & -1 \end{pmatrix}, \quad \gamma _{1} := \begin{pmatrix} 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \\ 0 & -1 & 0 & 0 \\ -1 & 0 & 0 & 0 \end{pmatrix}.

Calculate ⟨γ0,γ1⟩\left\langle \gamma_{0}, \gamma_{1} \right\rangle.

(ii)

Let UU be a unitary n×nn \times n matrix. Find ⟨UA,UB⟩\left\langle U\mathbf{A}, U\mathbf{B} \right\rangle.

(iii)

Let C\mathbf{C}, D\mathbf{D} be m×mm \times m matrices over C\mathbb {C}. Find ⟨A⊗C,B⊗D⟩\left\langle \mathbf{A} \otimes \mathbf{C}, \mathbf{B} \otimes \mathbf{D} \right\rangle.

(iv)

Let UU be a unitary matrix. Calculate ⟨U,U⟩\left\langle U, U \right\rangle. Then find the norm implied by the scalar product.

(v)

Calculate ∥U∥:=max⁡∥v→∥=1∥Uv→∥\left\| U\right\| := \max_{\left\| \overrightarrow {v}\right\| =1}\left\| U\overrightarrow {v}\right\|.

Problem 12.1.7
?
(i)

Let {x→j:j=1,…,n}\left\{ \overrightarrow {x}_{j} : j = 1, \ldots , n\right\}, {y→j:j=1,…,n}\left\{ \overrightarrow {y}_{j} : j = 1, \ldots , n\right\} be orthonormal bases in Cn\mathbb {C}^{n}. Show that

(Ujk):=(x→j∗y→k) (U_{jk}) := (\overrightarrow {x}_{j}^{*}\overrightarrow {y}_{k})

is a unitary matrix, where x→j∗y→k\overrightarrow {x}_{j}^{*}\overrightarrow {y}_{k} is the scalar product of the vectors x→j\overrightarrow {x}_{j} and y→k\overrightarrow {y}_{k}. This means showing that UU∗=InUU^{*} = I_{n}.

(ii)

Consider the two orthonormal bases in C2\mathbb {C}^{2}

x→1=12(11),x→2=12(1−1);y→1=12(1i),y→2=12(1−i). \overrightarrow {x}_{1} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ 1 \end{pmatrix}, \quad \overrightarrow {x}_{2} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ -1 \end{pmatrix}; \qquad \overrightarrow {y}_{1} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ i \end{pmatrix}, \quad \overrightarrow {y}_{2} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ -i \end{pmatrix}.

Use these bases to construct the corresponding 2×22 \times 2 unitary matrix.

Problem 12.1.8

Find the norm ∥A∥=tr⁡(A∗A)\left\| \mathbf{A}\right\| = \sqrt{\operatorname {tr}(\mathbf{A}^{*}\mathbf{A})} of the skew-hermitian matrix

A=(i2+i−2+i3i) \mathbf{A} = \begin{pmatrix} i & 2+i \\ -2+i & 3i \end{pmatrix}

without calculating A∗\mathbf{A}^{*}.

?
Problem 12.1.9

Let A\mathbf{A} and B\mathbf{B} be 2×22 \times 2 diagonal matrices over R\mathbb {R}. Assume that

tr⁡(AAT)=tr⁡(BBT) \operatorname {tr}(\mathbf{A}\mathbf{A}^{T}) = \operatorname {tr}(\mathbf{B}\mathbf{B}^{T})

and

max⁡∥x→∥=1∥Ax→∥=max⁡∥x→∥=1∥Bx→∥. \max _{\left\| \overrightarrow {x}\right\| =1}\left\| \mathbf{A}\overrightarrow {x}\right\| = \max _{\left\| \overrightarrow {x}\right\| =1}\left\| \mathbf{B}\overrightarrow {x}\right\| .

Can we conclude that A=B\mathbf{A} = \mathbf{B}?

?
Problem 12.1.10

Let A\mathbf{A} be an n×nn \times n matrix over C\mathbb {C}. Let ∥⋅∥\left\| \cdot \right\| be a subordinate matrix norm for which ∥In∥=1\left\| I_{n}\right\| = 1. Assume that ∥A∥<1\left\| \mathbf{A}\right\| < 1.

?
(i)

Show that the matrix (In−A)(I_{n}-\mathbf{A}) is nonsingular.

(ii)

Show that ∥(In−A)−1∥≤(1−∥A∥)−1\left\| (I_{n}-\mathbf{A})^{-1}\right\| \leq (1-\left\| \mathbf{A}\right\| )^{-1}.

Problem 12.1.11

Let A\mathbf{A} be an n×nn \times n matrix. Assume that ∥A∥<1\left\| \mathbf{A}\right\| < 1. Show that

∥(In−A)−1−In∥≤∥A∥1−∥A∥. \left\| (I_{n}-\mathbf{A})^{-1}-I_{n}\right\| \leq \frac{\left\| \mathbf{A}\right\| }{1-\left\| \mathbf{A}\right\| }.
?
Problem 12.1.12

Let A\mathbf{A} be an n×nn \times n nonsingular matrix and B\mathbf{B} an n×nn \times n matrix. Assume that ∥A−1B∥<1\left\| \mathbf{A}^{-1}\mathbf{B}\right\| < 1.

?
(i)

Show that A−B\mathbf{A}-\mathbf{B} is nonsingular.

(ii)

Show that

∥A−1−(A−B)−1∥∥A−1∥≤∥A−1B∥1−∥A−1B∥. \frac{\left\| \mathbf{A}^{-1}-(\mathbf{A}-\mathbf{B})^{-1}\right\| }{\left\| \mathbf{A}^{-1}\right\| } \leq \frac{\left\| \mathbf{A}^{-1}\mathbf{B}\right\| }{1-\left\| \mathbf{A}^{-1}\mathbf{B}\right\| }.
Problem 12.1.13

Let A\mathbf{A}, B\mathbf{B} be n×nn \times n matrices over R\mathbb {R} and t∈Rt \in \mathbb {R}. Let ∥⋅∥\left\| \cdot \right\| be a matrix norm. Show that

∥etAetB−In∥≤exp(∣t∣(∥A∥+∥B∥))−1. \left\| e^{t\mathbf{A}}e^{t\mathbf{B}}-I_{n}\right\| \leq \mathrm{exp}\left(\left|t\right|(\left\| \mathbf{A}\right\| +\left\| \mathbf{B}\right\| )\right)-1.
?
Problem 12.1.14

Let A1,A2,…,Ap\mathbf{A}_{1}, \mathbf{A}_{2}, \ldots , \mathbf{A}_{p} be m×mm \times m matrices over C\mathbb {C}. Then we have the inequality

∥exp(∑j=1pAj)−(eA1/n⋯eAp/n)n∥≤2n(∑j=1p∥Aj∥)2exp(n+2n∑j=1p∥Aj∥) \left\| \mathrm{exp}\left(\sum _{j=1}^{p}\mathbf{A}_{j}\right)-(e^{\mathbf{A}_{1}/n} \cdots e^{\mathbf{A}_{p}/n})^{n}\right\| \leq \frac{2}{n}\left(\sum _{j=1}^{p}\left\| \mathbf{A}_{j}\right\| \right)^{2}\mathrm{exp}\left(\frac{n+2}{n}\sum _{j=1}^{p}\left\| \mathbf{A}_{j}\right\| \right)

and (Trotter formula)

lim⁡n→∞(eA1/neA2/n⋯eAp/n)n=exp(∑j=1pAj). \lim _{n \rightarrow \infty }(e^{\mathbf{A}_{1}/n}e^{\mathbf{A}_{2}/n} \cdots e^{\mathbf{A}_{p}/n})^{n} = \mathrm{exp}\left(\sum _{j=1}^{p}\mathbf{A}_{j}\right).

Let p=2p = 2. Find the estimate for the 2×22 \times 2 matrices

A1=(0110),A2=(1002). \mathbf{A}_{1} = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \quad \mathbf{A}_{2} = \begin{pmatrix} 1 & 0 \\ 0 & 2 \end{pmatrix}.
?
Problem 12.1.15

Let U1U_{1}, U2U_{2} be unitary n×nn \times n matrices. Let v→\overrightarrow {v} be a normalized vector in Cn\mathbb {C}^{n}. Consider the norm of a k×kk \times k matrix MM

∥M∥=max⁡∥v→∥=1∥Mv→∥ \left\| M\right\| = \max _{\left\| \overrightarrow {v}\right\| =1}\left\| M\overrightarrow {v}\right\|

where ∥v→∥\left\| \overrightarrow {v}\right\| denotes the Euclidean norm. Show that if ∥U1−U2∥≤ϵ\left\| U_{1}-U_{2}\right\| \leq \epsilon then ∥U1v→−U2v→∥≤ϵ\left\| U_{1}\overrightarrow {v}-U_{2}\overrightarrow {v}\right\| \leq \epsilon.

?
Problem 12.1.16

Given the 2×22 \times 2 matrix (rotation matrix)

R(α)=(cos⁡(α)−sin⁡(α)sin⁡(α)cos⁡(α)). R(\alpha ) = \begin{pmatrix} \cos (\alpha ) & -\sin (\alpha ) \\ \sin (\alpha ) & \cos (\alpha ) \end{pmatrix}.

Calculate ∥R(α)∥=sup⁡∥x→∥=1∥R(α)x→∥\left\| R(\alpha )\right\| = \sup_{\left\| \overrightarrow {x}\right\| =1}\left\| R(\alpha )\overrightarrow {x}\right\|.

?
Problem 12.1.17

Let A\mathbf{A} be an n×nn \times n matrix. Let ρ(A)\rho (\mathbf{A}) be the spectral radius of A\mathbf{A}. Then we have

ρ(A)≤min⁡{max⁡1≤i≤n∑j=1n∣aij∣,max⁡1≤j≤n∑i=1n∣aij∣}. \rho (\mathbf{A}) \leq \min \left\{ \max _{1 \leq i \leq n}\sum _{j=1}^{n}\left|a_{ij}\right|, \max _{1 \leq j \leq n}\sum _{i=1}^{n}\left|a_{ij}\right|\right\} .

Let

A=(012345678). \mathbf{A} = \begin{pmatrix} 0 & 1 & 2 \\ 3 & 4 & 5 \\ 6 & 7 & 8 \end{pmatrix}.

Calculate ρ(A)\rho (\mathbf{A}) and the right-hand side of the inequality.

?
Problem 12.1.18

Let t∈Rt \in \mathbb {R}. Consider the symmetric 3×33 \times 3 matrix over R\mathbb {R}

A(t)=(t101t101t). \mathbf{A}(t) = \begin{pmatrix} t & 1 & 0 \\ 1 & t & 1 \\ 0 & 1 & t \end{pmatrix}.

Find the condition on tt such that ρ(A(t))<1\rho (\mathbf{A}(t)) < 1, where ρ(A(t))\rho (\mathbf{A}(t)) denotes the spectral radius of A(t)\mathbf{A}(t).

?
Problem 12.1.19
?
(i)

Let A\mathbf{A} be an n×nn \times n positive semidefinite matrix. Show that (In+A)−1(I_{n}+\mathbf{A})^{-1} exists.

(ii)

Let B\mathbf{B} be an arbitrary n×nn \times n matrix. Show that the inverse of In+B∗BI_{n}+\mathbf{B}^{*}\mathbf{B} exists.

Problem 12.1.20

Let A\mathbf{A} be an n×nn \times n matrix. One approach to calculate exp(A)\mathrm{exp}\left(\mathbf{A}\right) is to compute an eigenvalue decomposition A=XBX−1\mathbf{A} = XBX^{-1} and then apply the formula eA=XeBX−1e^{\mathbf{A}} = Xe^{B}X^{-1}. We have using the Schur decomposition

U∗AU=diag⁡(λ1,…,λn)+N U^{*}\mathbf{A}U = \operatorname {diag}(\lambda _{1}, \ldots , \lambda _{n})+N

where UU is unitary, the matrix N=(njk)N = (n_{jk}) is a strictly upper triangular (njk=0,j≥kn_{jk} = 0, j \geq k) and λ(A)={λ1,…,λn}\lambda (\mathbf{A}) = \left\{ \lambda_{1}, \ldots , \lambda_{n}\right\} is the spectrum of A\mathbf{A}. Using the Padé approximation to calculate eAe^{\mathbf{A}} we have

Rpq=(Dpq(A))−1Npq(A) R_{pq} = (D_{pq}(\mathbf{A}))^{-1}N_{pq}(\mathbf{A})

where

Npq(A):=∑j=0p(p+q−j)!p!(p+q)!j!(p−j)!Aj,Dpq(A):=∑j=0q(p+q−j)!q!(p+q)!j!(q−j)!(−A)j. N_{pq}(\mathbf{A}) := \sum _{j=0}^{p}\frac{(p+q-j)!p!}{(p+q)!j!(p-j)!}\mathbf{A}^{j}, \quad D_{pq}(\mathbf{A}) := \sum _{j=0}^{q}\frac{(p+q-j)!q!}{(p+q)!j!(q-j)!}(-\mathbf{A})^{j}.

Consider the nonnormal matrix

A=(0600006000060000). \mathbf{A} = \begin{pmatrix} 0 & 6 & 0 & 0 \\ 0 & 0 & 6 & 0 \\ 0 & 0 & 0 & 6 \\ 0 & 0 & 0 & 0 \end{pmatrix}.

Calculate ∥R11−eA∥2\left\| R_{11}-e^{\mathbf{A}}\right\|_{2}, where ∥⋅∥2\left\| \cdot \right\|_{2} denotes the 2-norm.

?
Problem 12.1.21

Let A\mathbf{A} be an n×nn \times n matrix with ∥A∥<1\left\| \mathbf{A}\right\| < 1. Then ln⁡(In+A)\ln (I_{n}+\mathbf{A}) exists. Show that

∥ln⁡(In+A)∥≤∥A∥1−∥A∥. \left\| \ln (I_{n}+\mathbf{A})\right\| \leq \frac{\left\| \mathbf{A}\right\| }{1-\left\| \mathbf{A}\right\| }.
?
Problem 12.1.22

Let A\mathbf{A}, B\mathbf{B} be n×nn \times n matrices over C\mathbb {C}. Show that ∥[A,B]∥≤2∥A∥∥B∥\left\| [\mathbf{A},\mathbf{B}]\right\| \leq 2\left\| \mathbf{A}\right\| \left\| \mathbf{B}\right\|.

?
Problem 12.1.23

Let A\mathbf{A}, B\mathbf{B} be n×nn \times n matrices over C\mathbb {C}. Then

∥[A,B]∥≤∥AB∥+∥BA∥≤2∥A∥∥B∥. \left\| [\mathbf{A},\mathbf{B}]\right\| \leq \left\| \mathbf{A}\mathbf{B}\right\| +\left\| \mathbf{B}\mathbf{A}\right\| \leq 2\left\| \mathbf{A}\right\| \left\| \mathbf{B}\right\| .

Let

A=(0110),B=12(111−1). \mathbf{A} = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \quad \mathbf{B} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}.

Calculate ∥[A,B]∥\left\| [\mathbf{A},\mathbf{B}]\right\|, ∥AB∥\left\| \mathbf{A}\mathbf{B}\right\|, ∥BA∥\left\| \mathbf{B}\mathbf{A}\right\|, ∥A∥\left\| \mathbf{A}\right\|, ∥B∥\left\| \mathbf{B}\right\| and thus verify the inequality for these matrices. The norm is given by ∥C∥=tr⁡(CC∗)\left\| \mathbf{C}\right\| = \sqrt{\operatorname {tr}(\mathbf{C}\mathbf{C}^{*})}.

?
Problem 12.1.24

Denote by ∥⋅∥HS\left\| \cdot \right\|_{HS} the Hilbert-Schmidt norm and by ∥⋅∥O\left\| \cdot \right\|_{O} the operator norm, i.e.

∥A∥HS:=tr⁡(AA∗),∥A∥O:=sup⁡∥x→∥=1∥Ax→∥=sup⁡λ∈C,∥x→∥=1(A∗A)x→=λx→λ \left\| \mathbf{A}\right\| _{HS} := \sqrt{\operatorname {tr}(\mathbf{A}\mathbf{A}^{*})}, \quad \left\| \mathbf{A}\right\| _{O} := \sup _{\left\| \overrightarrow {x}\right\| =1}\left\| \mathbf{A}\overrightarrow {x}\right\| = \sup _{\substack {\lambda \in \mathbb {C}, \left\| \overrightarrow {x}\right\| =1 \\ (\mathbf{A}^{*}\mathbf{A})\overrightarrow {x}=\lambda \overrightarrow {x}}}\sqrt{\lambda }

where A\mathbf{A} is an m×nm \times n matrix over C\mathbb {C}, x→∈Cn\overrightarrow {x} \in \mathbb {C}^{n} and ∥x→∥\left\| \overrightarrow {x}\right\| is the Euclidean norm.

?
(i)

Let

M=12(101101). M = \frac{1}{2}\begin{pmatrix} 1 & 0 & 1 \\ 1 & 0 & 1 \end{pmatrix}.

Calculate ∥M∥HS\left\| M\right\|_{HS} and ∥M∥O\left\| M\right\|_{O}.

(ii)

Let A\mathbf{A} be an m×nm \times n matrix over C\mathbb {C}. Find the conditions on A\mathbf{A} such that ∥A∥HS=∥A∥O\left\| \mathbf{A}\right\|_{HS} = \left\| \mathbf{A}\right\|_{O}.

Problem 12.1.25

Let A\mathbf{A} be an n×nn \times n matrix. The logarithmic norm is defined by

μ[A]:=lim⁡h→0+∥In+hA∥−1h. \mu [\mathbf{A}] := \lim _{h \rightarrow 0^{+}}\frac{\left\| I_{n}+h\mathbf{A}\right\| -1}{h}.

Let ∥A∥:=sup⁡x→=1∣Ax→∣\left\| \mathbf{A}\right\| := \sup_{\overrightarrow {x}=1}\left|\mathbf{A}\overrightarrow {x}\right|. Let A\mathbf{A} be the n×nn \times n identity matrix InI_{n}. Find μ[In]\mu [I_{n}].

?
Problem 12.1.26

Consider the Hilbert space Rn\mathbb {R}^{n} and x→,y→∈Rn\overrightarrow {x}, \overrightarrow {y} \in \mathbb {R}^{n}. The scalar product ⟨x→,y→⟩\left\langle \overrightarrow {x}, \overrightarrow {y} \right\rangle is given by

⟨x→,y→⟩:=x→Ty→=∑j=1nxjyj. \left\langle \overrightarrow {x}, \overrightarrow {y} \right\rangle := \overrightarrow {x}^{T}\overrightarrow {y} = \sum _{j=1}^{n}x_{j}y_{j}.

Thus the norm is given by ∥x→∥=⟨x→,x→⟩\left\| \overrightarrow {x}\right\| = \sqrt{ \left\langle \overrightarrow {x}, \overrightarrow {x} \right\rangle }. Show that ∣x→Ty→∣≤∥x→∥⋅∥y→∥\left|\overrightarrow {x}^{T}\overrightarrow {y}\right| \leq \left\| \overrightarrow {x}\right\| \cdot \left\| \overrightarrow {y}\right\|.

?
Problem 12.1.27

Let A\mathbf{A} be an n×nn \times n hermitian matrix. Let u→,v→∈Cn\overrightarrow {u}, \overrightarrow {v} \in \mathbb {C}^{n} and λ∈C\lambda \in \mathbb {C}. Consider the equation

Au→−λu→=v→. \mathbf{A}\overrightarrow {u}-\lambda \overrightarrow {u} = \overrightarrow {v}.
?
(i)

Show that for λ\lambda nonreal (i.e. it has an imaginary part) the vector v→\overrightarrow {v} cannot vanish unless u→\overrightarrow {u} vanishes.

(ii)

Show that for λ\lambda nonreal we have

∥(A−λIn)−1v→∥≤1∣Im(λ)∣∥v→∥. \left\| (\mathbf{A}-\lambda I_{n})^{-1}\overrightarrow {v}\right\| \leq \frac{1}{\left|\mathrm{Im}\left(\lambda \right)\right|}\left\| \overrightarrow {v}\right\| .
Problem 12.1.28

Let MM be an m×nm \times n matrix over C\mathbb {C}. The Frobenius norm of MM is given by

∥M∥F:=tr⁡(M∗M)=tr⁡(MM∗). \left\| M\right\| _{F} := \sqrt{\operatorname {tr}(M^{*}M)} = \sqrt{\operatorname {tr}(MM^{*})}.

Let UmU_{m} be m×mm \times m unitary matrix and UnU_{n} be an n×nn \times n unitary matrix. Show that

∥UmM∥F=∥MUn∥F=∥M∥. \left\| U_{m}M\right\| _{F} = \left\| MU_{n}\right\| _{F} = \left\| M\right\| .

Show that ∥M∥F\left\| M\right\|_{F} is the square root of the sum of the squares of the singular values of MM.

?
Problem 12.1.29

Let MM be an m×nm \times n matrix over C\mathbb {C}. Find the rank-1 m×nm \times n matrix A\mathbf{A} over C\mathbb {C} which minimizes

∥M−A∥F. \left\| M-\mathbf{A}\right\| _{F}.

Apply the method to the 3×23 \times 2 matrix

M=(011001). M = \begin{pmatrix} 0 & 1 \\ 1 & 0 \\ 0 & 1 \end{pmatrix}.
?
Problem 12.1.30

Let A\mathbf{A} be an n×nn \times n matrix over C\mathbb {C}. The spectral radius of the matrix A\mathbf{A} is the nonnegative number ρ(A)\rho (\mathbf{A}) defined by

ρ(A):=max⁡{∣λj(A)∣:1≤j≤n} \rho (\mathbf{A}) := \max \left\{ \left|\lambda _{j}(\mathbf{A})\right| : 1 \leq j \leq n\right\}

where λj(A)\lambda_{j}(\mathbf{A}) (j=1,…,nj = 1, \ldots , n) are the eigenvalues of A\mathbf{A}. We define the norm of A\mathbf{A} as

∥A∥:=sup⁡∥x→∥=1∥Ax→∥ \left\| \mathbf{A}\right\| := \sup _{\left\| \overrightarrow {x}\right\| =1}\left\| \mathbf{A}\overrightarrow {x}\right\|

where ∥Ax→∥\left\| \mathbf{A}\overrightarrow {x}\right\| denotes the Euclidean norm. Is ρ(A)≤∥A∥\rho (\mathbf{A}) \leq \left\| \mathbf{A}\right\|? Prove or disprove.

?
Problem 12.1.31

Let A\mathbf{A} be an n×nn \times n matrix over C\mathbb {C} and ImI_{m} be the m×mm \times m unit matrix. Consider the norm of a k×kk \times k matrix MM

∥M∥=max⁡∥x→∥=1∥Mx→∥ \left\| M\right\| = \max _{\left\| \overrightarrow {x}\right\| =1}\left\| M\overrightarrow {x}\right\|

where ∥x→∥\left\| \overrightarrow {x}\right\| denotes the Euclidean norm. Show that ∥A⊗Im∥=∥A∥\left\| \mathbf{A} \otimes I_{m}\right\| = \left\| \mathbf{A}\right\|.

?
Problem 12.1.32

Find 2×22 \times 2 matrices A\mathbf{A} and B\mathbf{B} over C\mathbb {C} which minimize

∥(0000011001100000)−A⊗B∥F \left\| \begin{pmatrix} 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 0 \\ 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 \end{pmatrix}-\mathbf{A} \otimes \mathbf{B}\right\| _{F}

and determine the minimum.

?
Problem 12.1.33

Consider the 4×44 \times 4 matrix (Hamilton operator)

H^=ℏω2(σ1⊗σ1−σ2⊗σ2) \hat{H} = \frac{\hbar \omega }{2}(\sigma _{1} \otimes \sigma _{1}-\sigma _{2} \otimes \sigma _{2})

where ω\omega is the frequency and ℏ\hbar is the Planck constant divided by 2π2\pi. Find the norm of H^\hat{H}, i.e.

∥H^∥:=max⁡∥x→∥=1∥H^x→∥,x→∈C4 \left\| \hat{H}\right\| := \max _{\left\| \overrightarrow {x}\right\| =1}\left\| \hat{H}\overrightarrow {x}\right\| , \quad \overrightarrow {x} \in \mathbb {C}^{4}

applying two different methods. In the first method apply the Lagrange multiplier method, where the constraint is ∥x→∥=1\left\| \overrightarrow {x}\right\| = 1. In the second method we calculate H^∗H^\hat{H}^{*}\hat{H} and find the square root of the largest eigenvalue. This is then ∥H^∥\left\| \hat{H}\right\|. Note that H^∗H^\hat{H}^{*}\hat{H} is positive semi-definite.

?
Problem 12.1.34

Let A\mathbf{A} be an invertible n×nn \times n matrix over R\mathbb {R}. Consider the linear system Ax→=b→\mathbf{A}\overrightarrow {x} = \overrightarrow {b}. The condition number of A\mathbf{A} is defined as

Cond⁡(A):=∥A∥⋅∥A−1∥. \operatorname {Cond}(\mathbf{A}) := \left\| \mathbf{A}\right\| \cdot \left\| \mathbf{A}^{-1}\right\| .

Find the condition number for the matrix

A=(10.99990.99991) \mathbf{A} = \begin{pmatrix} 1 & 0.9999 \\ 0.9999 & 1 \end{pmatrix}

for the infinity norm, 1-norm and 2-norm.

?
Problem 12.1.35

Let A\mathbf{A}, B\mathbf{B} be nonsingular n×nn \times n matrices. Show that

Cond⁡(A⊗B)=Cond⁡(A)Cond⁡(B) \operatorname {Cond}(\mathbf{A} \otimes \mathbf{B}) = \operatorname {Cond}(\mathbf{A})\operatorname {Cond}(\mathbf{B})

for all matrix norms, where Cond⁡\operatorname {Cond} denotes the condition number.

?