Linear Transformations and Vector Spaces: Homework 8 for Math 121A, Assignments of Linear Algebra

Homework problems related to linear transformations and vector spaces for math 121a. Topics include finite rank linear transformations, finding the matrix of a linear transformation in a given basis and its dual, the relationship between determinants of a linear transformation and its adjoint, and weak formulations in functional analysis and control theory.

Typology: Assignments

Pre 2010

Uploaded on 09/17/2009

koofers-user-6zd-1
koofers-user-6zd-1 🇺🇸

8 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Homework 8
Math 121A, Lecture A, S’08
In what follows, U, V, W are vector spaces over the same field F. Specific choices
of the spaces and of Fare made in some of the problems.
1. A linear transformation A L(U, V ) is said to be of finite rank if the range
Ran(A) of Ais finite-dimensional. If Ais of finite rank, then the dimension of
Ran(A) is called the rank of Aand (in this course) is denoted Rk(A). If the
kernel of Ais finite-dimensional, the dimension is called the nullity of Aand
(in this course) denoted Nlty(A).
Prove that if Uis finite-dimensional, then dim(U) = Rk(A) + Nlty(A).
2. Suppose Vis finite-dimensional, X={~x1. . . , ~xn}is a basis of V, and X0=
{~x0
1. . . , ~x0
n}is the dual basis. The matrix of a linear transformation A L(V)
in the basis Xis known to be [A]X= (αi,j)i,j . Find the matrix of A0in X0.
How are det(A) and det(A0) related?
3. Recall that, if Sis a subspace of V, the annihilator of Sis the set of all
functionals fV0such that
[~s, f ] = 0 for all ~s S
The annihilator of Sis denoted S0.
Let V=UW, and suppose A L(V) is a projection on Ualong W. Prove
that A0is the projection on W0along U0.
THE REST OF THIS HOMEWORK ASSIGNMENT IS OPTIONAL.
ITS SOLE PURPOSE IS TO EXPOSE THOSE INTERESTED TO
WEAK FORMULATIONS (OCCURRING IN FUNCTIONAL ANAL-
YSIS, FINITE ELEMENTS), LINEAR ORDINARY DIFFEREN-
TIAL EQUATIONS, AND CONTROL THEORY.
4. Let ~y be a fixed element of V, and let A L(V). One often seeks at least one solution ~x of
the equation
A~x =~y (1)
(a) Prove that ~x is a solution of (1) if and only if
[~x, f ]=[~y , A0f] for all fV0,(2)
where A0is the adjoint of A.
1
pf3

Partial preview of the text

Download Linear Transformations and Vector Spaces: Homework 8 for Math 121A and more Assignments Linear Algebra in PDF only on Docsity!

Homework 8

Math 121A, Lecture A, S’

In what follows, U, V, W are vector spaces over the same field F. Specific choices

of the spaces and of F are made in some of the problems.

1. A linear transformation A ∈ L(U, V ) is said to be of finite rank if the range

Ran(A) of A is finite-dimensional. If A is of finite rank, then the dimension of

Ran(A) is called the rank of A and (in this course) is denoted Rk(A). If the

kernel of A is finite-dimensional, the dimension is called the nullity of A and

(in this course) denoted Nlty(A).

Prove that if U is finite-dimensional, then dim(U ) = Rk(A) + Nlty(A).

2. Suppose V is finite-dimensional, X = {~x 1... , ~xn} is a basis of V , and X ′^ =

{~x′ 1... , ~x′ n} is the dual basis. The matrix of a linear transformation A ∈ L(V )

in the basis X is known to be [A]X = (αi,j )i,j. Find the matrix of A′^ in X ′.

How are det(A) and det(A′) related?

3. Recall that, if S is a subspace of V , the annihilator of S is the set of all

functionals f ∈ V ′^ such that

[~s, f ] = 0 for all ~s ∈ S

The annihilator of S is denoted S^0.

Let V = U ⊕ W , and suppose A ∈ L(V ) is a projection on U along W. Prove

that A′^ is the projection on W 0 along U 0.

THE REST OF THIS HOMEWORK ASSIGNMENT IS OPTIONAL.

ITS SOLE PURPOSE IS TO EXPOSE THOSE INTERESTED TO

WEAK FORMULATIONS (OCCURRING IN FUNCTIONAL ANAL-

YSIS, FINITE ELEMENTS), LINEAR ORDINARY DIFFEREN-

TIAL EQUATIONS, AND CONTROL THEORY.

  1. Let ~y be a fixed element of V , and let A ∈ L(V ). One often seeks at least one solution ~x of the equation A~x = ~y (1)

(a) Prove that ~x is a solution of (1) if and only if

[~x, f ] = [~y, A′f ] for all f ∈ V ′, (2)

where A′^ is the adjoint of A.

(b) The requirement that ~x satisfy (2) is sometimes too strong to be readily satisfied. In such cases, it is weakened by restricting the choice of the functional f to a certain subset T of V ′. A vector ~x ∈ V is called a T -weak solution of (1) if [A~x, f ] = [~y, f ] for all f ∈ T ; (3) the elements of T are then called test functionals. Suppose A is invertible. Under what conditions on T is a T -weak solution of (1) unique? (c) Equation (3) can be written in the form [~x, A′f ] = [~y, f ] for all f ∈ T However, finding A′^ is sometimes much less practical than replacing A′^ by a “weaker version.” An operator A′ T ∈ L(V ) is called the T -weak adjoint of A if [~x, f ] = [~y, A′ T f ] for all f ∈ T ; (4) Is the weak T -adjoint generally unique? (d) We now give an example in which equation (1) fails to have a solution, yet has a T -weak solution for a suitable choice of T. Let

  • F be R
  • V consist of all continuous functions x(t) from [− 1 , 1] to R
  • U be the subspace of V consisting of all functions φ(t) that are continuous on [− 1 , 1], differentiable on ] − 1 , 1[ and zero on the endpoints on t = −1 and t = 1. For each φ ∈ U , define the test functional fφ ∈ V ′^ by

[x, fφ] =

− 1

x(t)φ(t)dt

Take the set T to consist of all such fφ (with φ ∈ U ). Let

y(t) =

− 1 if − 1 ≤ t ≤ 0 1 if 0 < t ≤ 1

thus, y(t) is an element of V. Let A = (^) dtd , i. Prove that with this choice of A and ~y = y(t), equation (1) has no solution. ii. Calculate A′ T. iii. Prove that a T -weak solution x(t) of (4) exists, by finding at least one such solution. If x(t) is such a solution, then y(t) is called the weak derivative of x(t). iv. Prove that if x(t) is differentiable and if y(t) is its weak derivative y(t), then ∫ (^1)

− 1

[x′(t) − y(t)φ(t)dt = 0

Does this mean that x′(t) = y(t) at every t?

  1. Let F = R and U = Rn^ for some positive integer n. Recall that a representative element of U is an ordered n-tuple ~x = (x 1 ,... , xn) of real numbers. A U -valued function of (a real variable) t is a mapping ~x : R → U. Such a mapping will be denoted ~x(t); it is, in fact, an n-tuple ~x(t) = (x 1 (t),... , xn(t)) of functions from R to R. In this problem, U -valued functions of t are to be assumed differentiable. All power series occurring in this problem are to be manipulated formally, i.e. without worrying about convergence. Let A ∈ L(U ), and ~x 0 a fixed element of U.