Solution Manual Exercise 1 Linear Algebra

Exercise 2.2
It should be easy to see that A is given by
A =
_
0 1
1 0
_
Let us try to nd what A looks like in the {|+ , |}-basis. We have
|0 =
|0 + |1
2
+
|0 |1
2
=
|+ + |

2
|1 =
|0 + |1
2

|0 |1
2
=
|+ |

2
So A takes
1

2
_
1
1
_

into
1

2
_
1
1
_

and vice versa. It should be easy to see that

A =
_
1 0
0 1
_

does the job.

Exercise 2.5
(1)
_
|v ,

j
|w
j

_
=

i
v

j
w
ij
=

i
v

i
w
ij
=

j
(|v , |w
j
)
(2) (|v , |w) =

i
v

i
w
i
=

i
w

i
v

i
= (|w , |v)

(3) (|v , |v) =

i
v

i
v
i
=

i
|v
i
|
2
0
We get equality if and only if all v
i
= 0 which means that |v = 0
1
Exercise 2.7
Two vectors are orthogonal if their inner product is zero.
v | w =
_
1 1
_
_
1
1
_
= 1 1 = 0
Normalized forms:
|w
N
=
|w
_
w | w
=
1

2
_
1
1
_
|v
N
=
|v
_
v | v
=
1

2
_
1
1
_
Exercise 2.9

x
=
_
0 1
1 0
_
= |10| + |01|

y
=
_
0 i
i 0
_
= i|10| i|01|

z
=
_
1 0
0 1
_
= |00| |11|
Exercise 2.11
The eigenvalues are denoted
1
and
2
, and their corresponding normalized
eigenvectors are |v
1
and |v
2
.

x
:
1
= 1,
2
= 1, |v
1
=
1

2
_
1
1
_
, |v
2
=
1

2
_
1
1
_

y
:
1
= 1,
2
= 1, |v
1
=
1

2
_
1
i
_
, |v
2
=
1

2
_
1
i
_

z
:
1
= 1,
2
= 1, |v
1
=
_
1
0
_
, |v
2
=
_
0
1
_
2
The diagonal representation is given by =

i
|v
i
v
i
|

x
=
1
2
__
|0 + |1
__
0| + 1|
_

_
|0 |1
__
0| 1|
__

y
=
1
2
__
|0 + i|1
__
0| + i1|
_

_
|0 i|1
__
0| i1|
__

z
= |00| |11|.
Note that all the sigma matrices can be written written as
_
1 0
0 1
_
when we use the corresponding eigenvectors as basis
Exercise 2.17
Any normal matrix A has a spectral decomposition
A =

i
|ii|
where
i
are the eigenvalues and |i the corresponding eigenvectors. We then
have
A

i
|ii|
If then A is hermitian, A = A

, we have
i
=

i
. Then all s has to be
real. The implication the other way is just as easy, when all eigenvalues of a
normal matrix A are real we see from the spectral composition that A = A

so A is hermitian
Exercise 2.18
Let |u be a eigenvector of U with eigenvalue
u
. Then
U |u =
u
|u and u| U

= u|

u
This gives
u| U

U |u = u| |
u
|
2
|u = |
u
|
2
But since U

= U
1
u| U

U |u = 1
So |
u
|
2
= 1 and
u
= e
i
.
3
Exercise 2.24
Note that if a matrix T is Hermitian we have:
v| T |v = v| T

|v = (v| T |v)

= (v| T |v)

for any |v. This means that v| T |v must be real for any Hermitian T. We
then dene
B =
1
2
_
A + A

_
and C =
i
2
_
A A

_
.
It is easy to check that A = B + iC, and that B and C are Hermitian. If A
is positive, v|A|v 0 for any |v, we have
v|A|v = v|B|v + iv|C|v = + i
Since B og C are Hermitian, and must be real. To keep v| A|v positive
we must have = 0. Since |v is arbitary, this means that C must be zero,
which gives A = A

, i.e. A is Hermitian.
4