Renjith Thazhathethil
Home
Research
Teaching
CV
×
Home
Research
Teaching
CV
Matrix Groups
Set of all Invertible Matrices
G
L
n
(
R
)
GL_n(\mathbb{R})
G
L
n
(
R
)
Algebraic Structure
: Forms a group under multiplication.
Boundedness
: Unbounded.
Topology
: Open in
M
n
(
R
)
M_n(\mathbb{R})
M
n
(
R
)
.
Components
: Has two connected components:
G
L
n
+
(
R
)
GL_n^+(\mathbb{R})
G
L
n
+
(
R
)
(
d
e
t
>
0
det > 0
d
e
t
>
0
) and
G
L
n
−
(
R
)
GL_n^-(\mathbb{R})
G
L
n
−
(
R
)
(
d
e
t
<
0
det < 0
d
e
t
<
0
).
Center
:
Z
(
G
L
n
(
R
)
)
=
{
λ
I
:
λ
∈
R
∖
{
0
}
}
Z(GL_n(\mathbb{R})) = \{ \lambda I : \lambda \in \mathbb{R} \setminus \{0\} \}
Z
(
G
L
n
(
R
))
=
{
λ
I
:
λ
∈
R
∖
{
0
}}
.
Functional Definition
:
d
e
t
−
1
(
R
∖
{
0
}
)
det^{-1}(\mathbb{R} \setminus \{0\})
d
e
t
−
1
(
R
∖
{
0
})
.
Connectivity
: Not Connected.
Determinant Range
:
d
e
t
(
G
L
n
(
R
)
)
=
R
∖
{
0
}
det(GL_n(\mathbb{R})) = \mathbb{R} \setminus \{0\}
d
e
t
(
G
L
n
(
R
))
=
R
∖
{
0
}
.
Density
: Dense in
M
n
(
R
)
M_n(\mathbb{R})
M
n
(
R
)
.
Intersects all open sets.
Any singular matrix can be approximated by
G
L
n
(
R
)
GL_n(\mathbb{R})
G
L
n
(
R
)
.
Approximation Logic:
A
+
δ
I
A + \delta I
A
+
δ
I
has eigenvalues
σ
(
A
)
+
δ
\sigma(A) + \delta
σ
(
A
)
+
δ
.
Nilpotent Matrices
Algebraic Structure
: Not a group under addition or multiplication.
Topology
: Closed in
M
n
(
R
)
M_n(\mathbb{R})
M
n
(
R
)
.
Functional Definition
:
⋃
k
=
1
n
f
k
−
1
(
{
0
}
)
\bigcup_{k=1}^{n} f_k^{-1}(\{0\})
⋃
k
=
1
n
f
k
−
1
({
0
})
where
f
k
(
A
)
=
A
k
f_k(A) = A^k
f
k
(
A
)
=
A
k
.
Spectrum
: All eigenvalues are
0
0
0
.
Trace/Det
:
T
r
a
c
e
(
A
)
=
0
Trace(A) = 0
T
r
a
ce
(
A
)
=
0
,
d
e
t
(
A
)
=
0
det(A) = 0
d
e
t
(
A
)
=
0
.
Example
: The set of strictly upper triangular matrices is a subset.
Boundedness
: Unbounded.
Density
: Not dense.
Connectivity
: Path Connected.
Note: Illustrated by points
A
A
A
and
B
B
B
where
A
A
A
and
B
B
B
are nilpotent, connected via a path through the origin
O
O
O
.
Idempotent Matrices
Algebraic Structure
: Not a subgroup under addition or multiplication.
Connectivity
: Not Connected.
Determinant Properties
: Determinant can take only 2 values:
{
0
,
1
}
\{0, 1\}
{
0
,
1
}
.
Trace Properties
:
T
r
a
c
e
(
Idem. Mat.
)
=
{
0
,
1
,
2
,
…
,
n
}
Trace(\text{Idem. Mat.}) = \{0, 1, 2, \dots, n\}
T
r
a
ce
(
Idem. Mat.
)
=
{
0
,
1
,
2
,
…
,
n
}
.
Eigenvalues
:
λ
∈
{
0
,
1
}
\lambda \in \{0, 1\}
λ
∈
{
0
,
1
}
.
Geometric Interpretation
: Represents a projection operator
P
:
V
→
V
P: V \to V
P
:
V
→
V
.
Rank-Trace Identity
:
R
a
n
k
(
A
)
=
T
r
a
c
e
(
A
)
Rank(A) = Trace(A)
R
ank
(
A
)
=
T
r
a
ce
(
A
)
.
Topology
: Closed, defined by
(
x
2
−
A
)
=
0
(x^2 - A) = 0
(
x
2
−
A
)
=
0
or
(
A
2
−
A
)
=
0
(A^2 - A) = 0
(
A
2
−
A
)
=
0
.
Boundedness
: Unbounded.
Example:
A
=
[
1
n
0
0
]
A = \begin{bmatrix} 1 & n \\ 0 & 0 \end{bmatrix}
A
=
[
1
0
n
0
]
(shows it is not bounded as
n
→
∞
n \to \infty
n
→
∞
).
Compactness
: Not Compact (hence no).
Special Linear Group
S
L
n
(
R
)
SL_n(\mathbb{R})
S
L
n
(
R
)
Definition
:
{
A
∈
G
L
n
(
R
)
:
d
e
t
A
=
1
}
\{A \in GL_n(\mathbb{R}) : det A = 1\}
{
A
∈
G
L
n
(
R
)
:
d
e
t
A
=
1
}
.
Algebraic Structure
: Subgroup of
G
L
n
(
R
)
GL_n(\mathbb{R})
G
L
n
(
R
)
.
Boundedness
: Unbounded.
Center
:
Z
(
S
L
n
(
R
)
)
=
{
λ
I
:
λ
n
=
1
}
Z(SL_n(\mathbb{R})) = \{ \lambda I : \lambda^n = 1 \}
Z
(
S
L
n
(
R
))
=
{
λ
I
:
λ
n
=
1
}
.
Topology
: Closed, defined by
d
e
t
−
1
(
{
1
}
)
det^{-1}(\{1\})
d
e
t
−
1
({
1
})
.
Connectivity
: Path Connected.
Density
: Not dense.
Orthogonal Matrices
O
n
(
R
)
O_n(\mathbb{R})
O
n
(
R
)
Definition
:
{
A
∈
M
n
(
R
)
:
A
A
T
=
I
}
\{A \in M_n(\mathbb{R}) : AA^T = I\}
{
A
∈
M
n
(
R
)
:
A
A
T
=
I
}
.
Properties
: Rows and columns form an orthonormal basis for
R
n
\mathbb{R}^n
R
n
.
Topology
: Closed and bounded.
Components
: Two connected components (
S
O
n
SO_n
S
O
n
and
O
n
∖
S
O
n
O_n \setminus SO_n
O
n
∖
S
O
n
).
Center
:
Z
(
O
n
(
R
)
)
=
{
±
I
}
Z(O_n(\mathbb{R})) = \{ \pm I \}
Z
(
O
n
(
R
))
=
{
±
I
}
.
Compactness
: Compact.
Functional Form
:
(
A
A
T
−
I
)
−
1
(
{
0
}
)
(AA^T - I)^{-1}(\{0\})
(
A
A
T
−
I
)
−
1
({
0
})
.
Connectivity
: Not Connected.
Determinant Range
:
d
e
t
(
O
n
(
R
)
)
=
{
1
,
−
1
}
det(O_n(\mathbb{R})) = \{1, -1\}
d
e
t
(
O
n
(
R
))
=
{
1
,
−
1
}
.
Special Orthogonal Matrices
S
O
n
(
R
)
SO_n(\mathbb{R})
S
O
n
(
R
)
Definition
:
{
A
∈
O
n
(
R
)
:
d
e
t
A
=
1
}
\{A \in O_n(\mathbb{R}) : det A = 1\}
{
A
∈
O
n
(
R
)
:
d
e
t
A
=
1
}
.
Common Name
: Called Rotation matrices.
Case
n
=
2
n=2
n
=
2
: Has a specific rotation form.
Case
n
=
3
n=3
n
=
3
:
1
1
1
is an eigenvalue.
Eigenvalue Analysis
:
If
n
n
n
is odd,
d
e
t
(
A
−
I
)
=
d
e
t
(
A
T
(
A
−
I
)
)
=
d
e
t
(
I
−
A
)
det(A - I) = det(A^T(A - I)) = det(I - A)
d
e
t
(
A
−
I
)
=
d
e
t
(
A
T
(
A
−
I
))
=
d
e
t
(
I
−
A
)
.
Since
d
e
t
(
I
−
A
)
=
(
−
1
)
n
d
e
t
(
A
−
I
)
det(I - A) = (-1)^n det(A - I)
d
e
t
(
I
−
A
)
=
(
−
1
)
n
d
e
t
(
A
−
I
)
, for
n
=
3
n=3
n
=
3
,
d
e
t
(
A
−
I
)
=
0
det(A - I) = 0
d
e
t
(
A
−
I
)
=
0
.
Therefore,
1
1
1
is an eigenvalue.
Except for trivial cases, eigenvalues are complex.
If eigenvalues are real, they must be
1
1
1
or
−
1
-1
−
1
; however,
−
1
-1
−
1
is not possible in
S
O
n
SO_n
S
O
n
for
n
=
3
n=3
n
=
3
without another
−
1
-1
−
1
to keep the determinant
1
1
1
.
Rotation Axis
: Eigenvector corresponding to the eigenvalue
1
1
1
is the axis of rotation.
Fundamental Group
: For
n
≥
3
n \ge 3
n
≥
3
,
π
1
(
S
O
n
(
R
)
)
≅
Z
2
\pi_1(SO_n(\mathbb{R})) \cong \mathbb{Z}_2
π
1
(
S
O
n
(
R
))
≅
Z
2
(Doubly connected).
Topology
: Path Connected and Compact.
Unitary Matrices
U
n
(
C
)
U_n(\mathbb{C})
U
n
(
C
)
Definition
:
{
A
∈
M
n
(
C
)
:
A
∗
A
=
I
}
\{A \in M_n(\mathbb{C}) : A^*A = I\}
{
A
∈
M
n
(
C
)
:
A
∗
A
=
I
}
, where
A
∗
A^*
A
∗
is the conjugate transpose.
Topology
: They are Compact (closed and bounded in
C
n
2
\mathbb{C}^{n^2}
C
n
2
).
Connectivity
:
U
n
(
C
)
U_n(\mathbb{C})
U
n
(
C
)
is Connected, unlike
O
n
(
R
)
O_n(\mathbb{R})
O
n
(
R
)
.
Determinant Range
: The determinant is a complex number on the unit circle (
∣
d
e
t
A
∣
=
1
|det A| = 1
∣
d
e
t
A
∣
=
1
).
Special Unitary Group
S
U
n
(
C
)
SU_n(\mathbb{C})
S
U
n
(
C
)
Definition
:
{
A
∈
U
n
(
C
)
:
d
e
t
A
=
1
}
\{A \in U_n(\mathbb{C}) : det A = 1\}
{
A
∈
U
n
(
C
)
:
d
e
t
A
=
1
}
.
Topology
: It is Compact and Simply Connected.
Relation to Rotation
:
S
U
(
2
)
SU(2)
S
U
(
2
)
is a "double cover" of
S
O
3
(
R
)
SO_3(\mathbb{R})
S
O
3
(
R
)
, meaning they are topologically related but
S
U
(
2
)
SU(2)
S
U
(
2
)
has no "holes" (it's simply connected).
Symmetric Matrices
S
n
(
R
)
S_n(\mathbb{R})
S
n
(
R
)
Definition
:
{
A
∈
M
n
(
R
)
:
A
=
A
T
}
\{A \in M_n(\mathbb{R}) : A = A^T\}
{
A
∈
M
n
(
R
)
:
A
=
A
T
}
.
Algebraic Structure
: They form a vector subspace of
M
n
(
R
)
M_n(\mathbb{R})
M
n
(
R
)
, not a group under multiplication.
Topology
: Since it is a subspace, it is Closed, Unbounded, and Connected (specifically, it is homeomorphic to
R
n
(
n
+
1
)
/
2
\mathbb{R}^{n(n+1)/2}
R
n
(
n
+
1
)
/2
).
Positive Definite Matrices
P
n
P_n
P
n
Definition
: Symmetric matrices with all strictly positive eigenvalues (
x
T
A
x
>
0
x^T A x > 0
x
T
A
x
>
0
for all
x
≠
0
x \neq 0
x
=
0
).
Topology
: They form an Open Cone within the space of symmetric matrices.
Connectivity
: They are Connected and Convex.
Closure
: The closure of
P
n
P_n
P
n
is the set of positive semi-definite matrices (eigenvalues
≥
0
\ge 0
≥
0
), which is a Closed set.
Hermitian Matrices
H
n
(
C
)
H_n(\mathbb{C})
H
n
(
C
)
Definition
:
{
A
∈
M
n
(
C
)
:
A
=
A
∗
}
\{A \in M_n(\mathbb{C}) : A = A^*\}
{
A
∈
M
n
(
C
)
:
A
=
A
∗
}
.
Key Property
: Like symmetric matrices, all eigenvalues of a Hermitian matrix are real.
Topology
: They form a real vector space and are Connected and Closed.