Direct Sums and Invariant Subspaces

Section 5.4 Direct Sums and Invariant Subspaces

This section continues the discussion of direct sums (from Section 1.8) and invariant subspaces (from Section 4.1), to better understand the structure of linear operators.

🔗

Subsection 5.4.1 Invariant subspaces

🔗

Definition 5.4.1.

🔗

Given an operator

T : V \to V,

we say that a subspace

U \subseteq V

T

-invariant if

T (u) \in U

for all

u \in U .

🔗

Given a basis

B = {u_{1}, u_{2}, \dots, u_{k}}

U,

note that

U

T

-invariant if and only if

T (u_{i}) \in U

for each

i = 1, 2, \dots, k .

🔗

For any operator

T : V \to V,

there are four subspaces that are always

T

-invariant:

{0}, V, \ker T, and im T .

🔗

Of course, some of these subspaces might be the same; for example, if

T

is invertible, then

\ker T = {0}

and

im T = V .

🔗

Exercise 5.4.2.

🔗

Show that for any linear operator

T,

the subspaces

\ker T

and

im T

are

T

-invariant.

Hint.

In each case, choose an element

v

of the subspace. What does the definition of the space tell you about that element? (For example, if

v \in \ker T,

what is the value of

T (v) ?

) Then show that

T (v)

also fits the defintion of that space.

🔗

A subspace

U

T

-invariant if

T

does not map any vectors in

U

outside of

U .

Notice that if we shrink the domain of

T

U,

then we get an operator from

U

U,

since the image

T (U)

is contained in

U .

🔗

Definition 5.4.3.

🔗

Let

T : V \to V

be a linear operator, and let

U

be a

T

-invariant subspace. The restriction of

T

U,

denoted

T |_{U},

is the operator

T |_{U} : U \to U

defined by

T |_{U} (u) = T (u)

for all

u \in U .

🔗

Exercise 5.4.4.

🔗

True or false: the restriction

T |_{U}

is the same function as the operator

T .

True.
The definition of a function includes its domain and codomain. Since the domain of $T |_{U}$ is different from that of $T,$ they are not the same function.
False.
The definition of a function includes its domain and codomain. Since the domain of $T |_{U}$ is different from that of $T,$ they are not the same function.

🔗

A lot can be learned by studying the restrictions of an operator to invariant subspaces. Indeed, the textbook by Axler does almost everything from this point of view. One reason to study invariant subspaces is that they allow us to put the matrix of

T

into simpler forms.

🔗

Theorem 5.4.5.

🔗

Let

T : V \to V

be a linear operator, and let

U

be a

T

-invariant subspace. Let

B_{U} = {u_{1}, u_{2}, \dots, u_{k}}

be a basis of

U,

and extend this to a basis

B = {u_{1}, \dots, u_{k}, w_{1}, \dots, w_{n - k}}

🔗

V .

Then the matrix

M_{B} (T)

with respect to this basis has the block-triangular form

M_{B} (T) = [\begin{matrix} M_{B_{U}} (T_{U}) & P \\ 0 & Q \end{matrix}]

🔗

for some

(n - k) \times (n - k)

matrix

Q .

🔗

Reducing a matrix to block triangular form is useful, because it simplifies computations such as determinants and eigenvalues (and determinants and eigenvalues are computationally expensive). In particular, if a matrix

A

has the block form

A = [\begin{matrix} A_{11} & A_{12} & \dots & A_{1 n} \\ 0 & A_{22} & \dots & A_{2 n} \\ ⋮ & ⋮ & ⋱ & ⋮ \\ 0 & 0 & \dots & A_{n n} \end{matrix}],

🔗

where the diagonal blocks are square matrices, then

det (A) = det (A_{11}) det (A_{22}) \dots det (A_{n n})

and

c_{A} (x) = c_{A_{11}} (x) c_{A_{22}} (x) \dots c_{A_{n n}} (x) .

🔗

Subsection 5.4.2 Eigenspaces

🔗

An important source of invariant subspaces is eigenspaces. Recall that for any real number

λ,

and any operator

T : V \to V,

we define

E_{λ} (T) = \ker (T - λ 1_{V}) = {v \in V | T (v) = λ v} .

🔗

For most values of

λ,

we’ll have

E_{λ} (T) = {0} .

The values of

λ

for which

E_{λ} (T)

is non-trivial are precisely the eigenvalues of

T .

Note that since similar matrices have the same characteristic polynomial, any matrix representation

M_{B} (T)

will have the same eigenvalues. They do not generally have the same eigenspaces, but we do have the following.

🔗

Theorem 5.4.6.

🔗

Let

T : V \to V

be a linear operator. For any scalar

λ,

the eigenspace

E_{λ} (T)

T

-invariant. Moreover, for any ordered basis

B

V,

the coefficient isomorphism

C_{B} : V \to R^{n}

induces an isomorphism

C_{B} |_{E_{λ} (T)} : E_{λ} (T) \to E_{λ} (M_{B} (T)) .

🔗

In other words, the two eigenspaces are isomorphic, although the isomorphism depends on a choice of basis.

🔗

Subsection 5.4.3 Direct Sums

🔗

Recall that for any subspaces

U, W

of a vector space

V,

the sets

\begin{aligned} U + W & = {u + w | u \in U and w \in W} \\ U \cap W & = {v \in V | v \in U and v \in W} \end{aligned}

🔗

are subspaces of

V .

Saying that

v \in U + W

means that

v

can be written as a sum of a vector in

U

and a vector in

W .

However, this sum may not be unique. If

v \in U \cap W,

u \in U

and

w \in W,

then we can write

(u + v) + w = u + (v + w),

giving two different representations of a vector as an element of

U + W .

🔗

We proved in Theorem 1.8.9 in Section 1.8 that for any

v \in U + W,

there exist unique vectors

u \in U

and

w \in W

such that

v = u + w,

if and only if

U \cap W = {0} .

🔗

In Definition 1.8.8, we said that a sum

U + W

where

U \cap W = {0}

is called a direct sum, written as

U \oplus W .

🔗

Typically we are interested in the case that the two subspaces sum to

V .

Recall from Definition 1.8.11 that if

V = U \oplus W,

we say that

W

is a complement of

U .

We also say that

U \oplus W

is a direct sum decomposition of

V .

Of course, the orthogonal complement

U^{⊥}

of a subspace

U

is a complement in this sense, if

V

is equipped with an inner product. (Without an inner product we have no concept of “orthogonal”.) But even if we don’t have an inner product, finding a complement is not too difficult, as the next example shows.

🔗

Example 5.4.7. Finding a complement by extending a basis.

🔗

The easiest way to determine a direct sum decomposition (or equivalently, a complement) is through the use of a basis. Suppose

U

is a subspace of

V

with basis

{e_{1}, e_{2}, \dots, e_{k}},

and extend this to a basis

B = {e_{1}, \dots, e_{k}, e_{k + 1}, \dots, e_{n}}

🔗

V .

Let

W = span {e_{k + 1}, \dots, e_{n}} .

Then clearly

U + W = V,

and

U \cap W = {0},

since if

v \in U \cap W,

then

v \in U

and

v \in W,

so we have

v = a_{1} e_{1} + \dots + a_{k} e_{k} = b_{1} e_{k + 1} + \dots + b_{n - k} e_{n},

🔗

which gives

a_{1} e_{1} + \dots + a_{k} e_{k} - b_{1} e_{k + 1} - \dots - b_{n - k} e_{n} = 0,

🔗

a_{1} = \dots b_{n - k} = 0

by the linear independence of

B,

showing that

v = 0 .

🔗

Conversely, if

V = U \oplus W,

and we have bases

{u_{1}, u_{2}, \dots, u_{k}}

U

and

{v_{1}, v_{2}, \dots, v_{l}}

W,

then

B = {u_{1}, \dots, u_{k}, w_{1}, \dots, w_{l}}

🔗

is a basis for

V .

Indeed,

B

spans

V,

since every element of

V

can be written as

v = u + w

with

u \in U, w \in W .

Independence follows by reversing the argument above: if

a_{1} u_{1} + \dots + a_{k} u_{k} + b_{1} w_{1} + \dots b_{l} w_{l} = 0

🔗

then

a_{1} u_{1} + \dots + a_{k} u_{k} = - b_{1} w_{1} - \dots - b_{l} w_{l},

and equality is only possible if both sides belong to

U \cap W = {0} .

Since

{u_{1}, u_{2}, \dots, u_{k}}

is independent, the

a_{i}

have to be zero, and since

{w_{1}, w_{2}, \dots, w_{l}}

is independent, the

b_{j}

have to be zero.

🔗

The argument given in the second part of Example 5.4.7 has an immediate, but important consequence.

🔗

Theorem 5.4.8.

🔗

Suppose

V = U \oplus W,

where

\dim U = m

and

\dim W = n .

Then

V

is finite-dimensional, and

\dim V = m + n .

🔗

Example 5.4.9.

🔗

Suppose

V = U \oplus W,

where

U

and

W

are

T

-invariant subspaces for some operator

T : V \to V .

Let

B_{U} = {u_{1}, u_{2}, \dots, u_{m}}

and let

B_{W} = {w_{1}, w_{2}, \dots, w_{n}}

be bases for

U

and

W,

respectively. Determine the matrix of

T

with respect to the basis

B = B_{U} \cup B_{W}

V .

Solution.

Since we don’t know the map

T

or anything about the bases

B_{U}, B_{W},

we’re looking for a fairly general statement here. Since

U

T

-invariant, we must have

T (u_{i}) \in U

for each

i = 1, \dots, m .

Similarly,

T (w_{j}) \in W

for each

j = 1, \dots, n .

This means that we have

\begin{aligned} T (u_{1}) & = a_{11} u_{1} + \dots + a_{m 1} u_{m} + 0 w_{1} + \dots + 0 w_{n} \\ ⋮ \\ T (u_{m}) & = a_{1 m} u_{1} + \dots + a_{m m} u_{m} + 0 w_{1} + \dots + 0 w_{n} \\ T (w_{1}) & = 0 u_{1} + \dots + 0 u_{m} + b_{11} w_{1} + \dots + b_{n 1} w_{n} \\ ⋮ \\ T (w_{n}) & = 0 u_{1} + \dots + 0 u_{m} + b_{1 n} w_{1} + \dots + b_{n n} w_{n} \end{aligned}

for some scalars

a_{i j}, b_{i j} .

If we set

A = [a_{i j}]_{m \times m}

and

B = [b_{i j}]_{n \times n},

then we have

M_{B} (T) = [\begin{matrix} A & 0 \\ 0 & B \end{matrix}] .

Moreover, we can also see that

A = M_{B_{U}} (T |_{U}),

and

B = M_{B_{W}} (T |_{W}) .

You have attempted 1 of 3 activities on this page.

Prev Top Next