Professional Documents
Culture Documents
7 Special Matrics II
7 Special Matrics II
Outline
Discovery Journey
References
Definitions
Definitions
A matrix A ∈ Cn×n is
Definitions
A matrix A ∈ Cn×n is
▸ unitary if
AAH = AH A = I.
Definitions
A matrix A ∈ Cn×n is
▸ unitary if
AAH = AH A = I.
▸ orthogonal if
AAT = AT A = I.
Definitions
A matrix A ∈ Cn×n is
▸ unitary if
AAH = AH A = I.
▸ orthogonal if
AAT = AT A = I.
Remarks:
Definitions
A matrix A ∈ Cn×n is
▸ unitary if
AAH = AH A = I.
▸ orthogonal if
AAT = AT A = I.
Remarks:
▸ A unitary matrix: columns (or rows) constitute an
orthonormal basis for Cn .
Definitions
A matrix A ∈ Cn×n is
▸ unitary if
AAH = AH A = I.
▸ orthogonal if
AAT = AT A = I.
Remarks:
▸ A unitary matrix: columns (or rows) constitute an
orthonormal basis for Cn .
▸ A orthogonal matrix: columns (or rows) constitute an
orthonormal basis for Rn .
Definitions
A matrix A ∈ Cn×n is
▸ unitary if
AAH = AH A = I.
▸ orthogonal if
AAT = AT A = I.
Remarks:
▸ A unitary matrix: columns (or rows) constitute an
orthonormal basis for Cn .
▸ A orthogonal matrix: columns (or rows) constitute an
orthonormal basis for Rn .
▸ The identity matrix is orthogonal as well as unitary.
Matrix Theory Special Matrices - 3/23
Application 1: Givens rotation
Outline
Discovery Journey
References
Givens rotation
Givens rotation
∣c∣2 + ∣s∣2 = 1.
Givens rotation
∣c∣2 + ∣s∣2 = 1.
The matrices
c s c s
( ), ( )
−s c s −c
are unitary.
Definition
If c, s ∈ C so that
∣c∣2 + ∣s∣2 = 1,
Definition
If c, s ∈ C so that
∣c∣2 + ∣s∣2 = 1,
c s
( )
−s c
Definition
If c, s ∈ C so that
∣c∣2 + ∣s∣2 = 1,
c s
( )
−s c
c s
( )
−s c
is orthogonal.
Matrix Theory Special Matrices - 6/23
Application 1: Givens rotation
Some remarks
▸ When a Givens rotation is real, then both diagonal elements
are the same.
Some remarks
▸ When a Givens rotation is real, then both diagonal elements
are the same.
▸ When a Givens rotation is complex, then the diagonal
elements are complex conjugates of each other.
Some remarks
▸ When a Givens rotation is real, then both diagonal elements
are the same.
▸ When a Givens rotation is complex, then the diagonal
elements are complex conjugates of each other.
▸ A unitary matrix of the form
−c s
( )
s c
where the real parts of the diagonal elements have different
signs, is a reflection; it is not a Givens rotation.
Some remarks
▸ When a Givens rotation is real, then both diagonal elements
are the same.
▸ When a Givens rotation is complex, then the diagonal
elements are complex conjugates of each other.
▸ A unitary matrix of the form
−c s
( )
s c
where the real parts of the diagonal elements have different
signs, is a reflection; it is not a Givens rotation.
Some remarks
▸ When a Givens rotation is real, then both diagonal elements
are the same.
▸ When a Givens rotation is complex, then the diagonal
elements are complex conjugates of each other.
▸ A unitary matrix of the form
−c s
( )
s c
where the real parts of the diagonal elements have different
signs, is a reflection; it is not a Givens rotation.
Outline
Discovery Journey
References
Recall: Permutation
A permutation p on {1, 2, . . . , n} is
▸ even: if p can be restored to natural order by an even
number of interchanges.
Recall: Permutation
A permutation p on {1, 2, . . . , n} is
▸ even: if p can be restored to natural order by an even
number of interchanges.
▸ odd: if p can be restored to natural order by an odd
number of interchanges.
Example of permutation
Example of permutation
n! (n factorial)
Examples
The following are permutation matrices.
Examples
The following are permutation matrices.
▸ The identity matrix I.
Examples
The following are permutation matrices.
▸ The identity matrix I.
▸ The exchange matrix (an anti-diagonal matrix)
⎛ 1 ⎞
⎜
J =⎜ ..
. ⎟,
⎟
⎝ 1 ⎠
Examples
The following are permutation matrices.
▸ The identity matrix I.
▸ The exchange matrix (an anti-diagonal matrix)
⎛ x1 ⎞
⎛ 1 ⎞
⎜ . ⎟, ⎜ x2 ⎟
J =⎜ .. ⎟ J⎜ ⎟
⎜ ⋮ ⎟
⎝ 1 ⎠ ⎝ ⎠
xn
Examples
The following are permutation matrices.
▸ The identity matrix I.
▸ The exchange matrix (an anti-diagonal matrix)
⎛ x1 ⎞ ⎛ xn ⎞
⎛ 1 ⎞
⎜ . ⎟, ⎜ x2 ⎟ ⎜ ⋮ ⎟
J =⎜ .. ⎟ J⎜ ⎟ =⎜ ⎟
⎜ ⋮ ⎟ ⎜ x2 ⎟
⎝ 1 ⎠ ⎝ ⎠ ⎝ x1 ⎠
xn
Examples
The following are permutation matrices.
▸ The identity matrix I.
▸ The exchange matrix (an anti-diagonal matrix)
⎛ x1 ⎞ ⎛ xn ⎞
⎛ 1 ⎞
⎜ . ⎟, ⎜ x2 ⎟ ⎜ ⋮ ⎟
J =⎜ .. ⎟ J⎜ ⎟ =⎜ ⎟
⎜ ⋮ ⎟ ⎜ x2 ⎟
⎝ 1 ⎠ ⎝ ⎠ ⎝ x1 ⎠
xn
⎛ 0 1 ⎞
⎜ 0 1 ⎟
⎜ ⎟
⎜
Z =⎜ ⋱ ⋱ ⎟,
⎟
⎜ ⋱ 1 ⎟
⎜ ⎟
⎝ 1 0 ⎠
Examples
The following are permutation matrices.
▸ The identity matrix I.
▸ The exchange matrix (an anti-diagonal matrix)
⎛ x1 ⎞ ⎛ xn ⎞
⎛ 1 ⎞
⎜ . ⎟, ⎜ x2 ⎟ ⎜ ⋮ ⎟
J =⎜ .. ⎟ J⎜ ⎟ =⎜ ⎟
⎜ ⋮ ⎟ ⎜ x2 ⎟
⎝ 1 ⎠ ⎝ ⎠ ⎝ x1 ⎠
xn
⎛ 0 1 ⎞ ⎛ x1 ⎞
⎜ 0 1 ⎟ ⎜ x2 ⎟
⎜ ⎟ ⎜ ⎟
⎜
Z =⎜ ⋱ ⋱ ⎟, Z⎜ ⋮ ⎟
⎟ ⎜ ⎟
⎜ ⋱ 1 ⎟ ⎜ ⎟
⎜ ⎟ ⎜ xn−1 ⎟
⎝ 1 0 ⎠ ⎝ xn ⎠
Examples
The following are permutation matrices.
▸ The identity matrix I.
▸ The exchange matrix (an anti-diagonal matrix)
⎛ x1 ⎞ ⎛ xn ⎞
⎛ 1 ⎞
⎜ . ⎟, ⎜ x2 ⎟ ⎜ ⋮ ⎟
J =⎜ .. ⎟ J⎜ ⎟ =⎜ ⎟
⎜ ⋮ ⎟ ⎜ x2 ⎟
⎝ 1 ⎠ ⎝ ⎠ ⎝ x1 ⎠
xn
⎛ 0 1 ⎞ ⎛ x1 ⎞ ⎛ x2 ⎞
⎜ 0 1 ⎟ ⎜ x2 ⎟ ⎜ x3 ⎟
⎜ ⎟ ⎜ ⎟ ⎜ ⎟
⎜
Z =⎜ ⋱ ⋱ ⎟, Z⎜ ⋮ ⎟ =⎜ ⋮ ⎟
⎟ ⎜ ⎟ ⎜ ⎟
⎜ ⋱ 1 ⎟ ⎜ ⎟ ⎜ x ⎟
⎜ ⎟ ⎜ xn−1 ⎟ ⎜ n ⎟
⎝ 1 0 ⎠ ⎝ xn ⎠ ⎝ x1 ⎠
PP T = P T P = PP H = P H P = I.
PP T = P T P = PP H = P H P = I.
Hints to understand:
n n
1, for i = j;
(P T P)ij = ∑ pik
T
pkj = ∑ pki pkj = {
k=1 k=1
0, for i ≠ j.
Hints to understand:
Hints to understand:
Suppose you have two permutation matrices X and Y .
So by definition both X and Y are n × n matrices having precisely one
non-zero entry in each row and column, and these entries all take the
value 1.
Hints to understand:
Suppose you have two permutation matrices X and Y .
So by definition both X and Y are n × n matrices having precisely one
non-zero entry in each row and column, and these entries all take the
value 1.
If the non-zero entry in the first row of X is in the ith column, then what
will the first row of the matrix X ⋅ Y be?
Hints to understand:
Suppose you have two permutation matrices X and Y .
So by definition both X and Y are n × n matrices having precisely one
non-zero entry in each row and column, and these entries all take the
value 1.
If the non-zero entry in the first row of X is in the ith column, then what
will the first row of the matrix X ⋅ Y be?
By definition of matrix multiplication it will be
Outline
Discovery Journey
References
Things to do
Things to do
Things to do
Things to do
Things to do
Things to do
Things to do
Things to do
Things to do
Things to do
Things to do
6 Partitioned Unitary Matrices.
Things to do
6 Partitioned Unitary Matrices.
A = ( A1 A2 ) ,
where, A1 has k columns, and A2 has n − k columns.
Show that
1 A1 = Ik ,
AH 2 A2 = In−k , and A1 A2 = 0.
AH H
Things to do
6 Partitioned Unitary Matrices.
A = ( A1 A2 ) ,
where, A1 has k columns, and A2 has n − k columns.
Show that
1 A1 = Ik ,
AH 2 A2 = In−k , and A1 A2 = 0.
AH H
Tips:
I = AH A
Things to do
6 Partitioned Unitary Matrices.
A = ( A1 A2 ) ,
where, A1 has k columns, and A2 has n − k columns.
Show that
1 A1 = Ik ,
AH 2 A2 = In−k , and A1 A2 = 0.
AH H
Tips:
AH
1 )( A
I = AH A = ( 1 A2 )
AH
2
Things to do
6 Partitioned Unitary Matrices.
A = ( A1 A2 ) ,
where, A1 has k columns, and A2 has n − k columns.
Show that
1 A1 = Ik ,
AH 2 A2 = In−k , and A1 A2 = 0.
AH H
Tips:
AH
1 )( A AH H
1 A1 A1 A2 )
I = AH A = ( H 1 A2 ) = (
A2 A2 A1 AH
H
2 A2
Things to do
7 Let x ∈ Cn and x H x = 1.
Things to do
7 Let x ∈ Cn and x H x = 1.
Prove: In − 2xx H is Hermitian and unitary.
Things to do
7 Let x ∈ Cn and x H x = 1.
Prove: In − 2xx H is Hermitian and unitary.
Things to do
7 Let x ∈ Cn and x H x = 1.
Prove: In − 2xx H is Hermitian and unitary.
Tips: I = AH A = AA
Outline
Discovery Journey
References
Extension reading
Homework
QUESTIONS ?