Linear Algebra: Solved Problems and Transformations between Bases, Exams of Linear Algebra

Commented solutions for selected problems of test 3 in linear algebra. It covers topics such as forming matrices, transition matrices, matrix representations of linear transformations, and finding the wronskian matrix. The document also includes a bonus section on consistent and inconsistent equations and the rank of compositions.

Typology: Exams

Pre 2010

Uploaded on 09/02/2009

koofers-user-abh
koofers-user-abh 🇺🇸

8 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MAT 342 Linear Algebra October 29, 2003
Commented sample solutions for selected problems of test 3
1.a. Form the matrix S= (A|B|F) whose columns are A, B and F. Since rref(S) = I3,βis linearly
independent. And because |β|= 3, βalso spans R3, i.e. βis a basis for R3.
(MATLAB: A=[1 1 1]’,B=[-1 1 1]’,F=[-1 1 -1]’,E=[1 1 -1]’,ABF=[A B F], rref(ABF))
b. Note that S=ε[id]βis the transition matrix that transforms coordinates w.r.t. βinto coord.’s
w.r.t. the standard basis (e.g. [A]β= (1,0,0)T, and S·(1,0,0)T=A= [A]ε, i.e. S·[A]β= [A]ε).
Hence [E]β=S1E= (1,1,1)T. (MATLAB: ABF\E. Geometrically note: A+F=B+E)
c. Form the matrix Ywhose columns are (the coord.’s w.r.t. the standard basis εof ) the images of
the vectors in βunder the map L, i.e., Y= (L(A)|L(B)|L(F)) = (B|E|E) [LONG SENTENCE!].
Note that this is the matrix representation for Lw.r.t. the basis βfor the input and w.r.t. the
standard basis εfor the output, e.g. B=Y·(1,0,0)T
and [A]β= (1,0,0)T, or [B]ε=ε[L]β·[A]β. Hence
ε[L]ε=ε[L]β·β[id]ε=ε[L]β·(ε[id]β)1=Y S1,and
β[L]β=β[id]ε·ε[L]β= (ε[id]β)1·ε[L]β=S1Y.
d. L(C) = [L(C)]ε=ε[L]ε·[C]ε= (1,1,1)T=H.
ε[L]ε=Y·S1=
1 0 0
0 1 0
1 0 0
β[L]β=S1·Y=
011
111
011
(In MATLAB: eLb=[B,E,E], eLe=eLb/ABF, bLb=ABF\eLb, LC=eLe*C)
Bonus: Because {A, D, F }are linearly dependent (compare a.) the given equations are overdeter-
mined. These may be consistent or inconsistent. Geometrically, since F=D,T(F) must equal
T(D) = T(D) = E=C. Algebraically, with the usual abuse of notation, we want a matrix
Xsuch that X·(A|D|F) = (A|E|F), i.e. (A|D|F)T·XT= (A|E|F)T.
Thus (in)consistency and possible solutions can be read off of the rref(³(A|D|F)T|(A|E|F)T´.
If e.g. T(F) = Cwas specified, we may pick any vector vthat is linearly independent from {A, D},
and completely freely specify T(v)R3. Then ε[T]γ= (A|E|T(v)) is the matrix representation
for the desired map Tw.r.t. the basis γ={A, D, v}for the input and εfor the output.
2. The rank of the composition can be no larger than the minimum of the ranks of the individual
maps, i.e. at most 2. On the other hand the dimension of the kernel (nullity) of the composition
can be no larger than the sum of the dimensions of the kernels of the individual maps, i.e. at most
2. Hence the rank of the composition must be at least 3 2 = 1.
For example, T1: (x1, x2, x3)7→ (x1, x2,0) and T2: (x1, x2, x3)7→ (x1,0, x3) have both rank 2, while
T1T1=T1and T2T1: (x1, x2, x3)7→ (x1,0,0) have rank 2 and 1, respectively
4.a. The Wronskian matrix of the functions {e3x, xe3x, x2e3x}evaluated at x= 0 is lower tri-
angular with nonzero entries along the diagonal. Hence the Wronskian has full rank. Thus βis
linearly independent. Since βspans by defn., it is a basis for V.b. [(2 5x2)e3x]β= (2,0,5)T
c. Suppose cRand y1, y2V. Then L(cy1+y2) = (cy1+y2)0=cy0
1+y0
2=cL(y1) + L(y2).
d. For viβcalculate the coordinates of L(vi) w.r.t. β.
They are the columns of the desired matrix.
e. Since β[L]βhas full rank, ker(L) = {0}and a basis is the
empty set { }.f. Calculate β[L]1
β[f(x)]β= (8
9,10
9,5
3)T.
Hence ³8
9+10
9x+5
3x2´e3xis the desired antiderivative.
Bonus. Compare 4.d. This interesting pair of linear maps
whose commutator ε[XDDX]ε=I3is the identity is
useful e.g. as a mathematical model in quantum mechanics.
β[L]β=
3 1 0
03 2
0 0 3
ε[DX]ε=
300
020
001
ε[XD]ε=
200
010
000
.

Partial preview of the text

Download Linear Algebra: Solved Problems and Transformations between Bases and more Exams Linear Algebra in PDF only on Docsity!

MAT 342 Linear Algebra October 29, 2003

Commented sample solutions for selected problems of test 3 ♥

1.a. Form the matrix S = (A|B|F ) whose columns are A, B and F. Since rref(S) = I 3 , β is linearly independent. And because |β| = 3, β also spans R^3 , i.e. β is a basis for R^3. (MATLAB: A=[1 1 1]’,B=[-1 1 1]’,F=[-1 1 -1]’,E=[1 1 -1]’,ABF=[A B F], rref(ABF)) b. Note that S = (^) ε[id]β is the transition matrix that transforms coordinates w.r.t. β into coord.’s w.r.t. the standard basis (e.g. [A]β = (1, 0 , 0)T^ , and S · (1, 0 , 0)T^ = A = [A]ε, i.e. S · [A]β = [A]ε). Hence [E]β = S−^1 E = (1, − 1 , 1)T^. (MATLAB: ABF\E. Geometrically note: A + F = B + E) c. Form the matrix Y whose columns are (the coord.’s w.r.t. the standard basis ε of) the images of the vectors in β under the map L, i.e., Y = (L(A)|L(B)|L(F )) = (B|E|E) [LONG SENTENCE!]. Note that this is the matrix representation for L w.r.t. the basis β for the input and w.r.t. the standard basis ε for the output, e.g. B = Y · (1, 0 , 0)T and [A]β = (1, 0 , 0)T^ , or [B]ε = (^) ε[L]β · [A]β. Hence ε[L]ε =^ ε[L]β ·^ β [id]ε =^ ε[L]β ·^ (ε[id]β )

− (^1) = Y S− (^1) , and

β [L]β =^ β [id]ε ·^ ε[L]β = (ε[id]β )−^1 ·^ ε[L]β =^ S−^1 Y. d. L(C) = [L(C)]ε = (^) ε[L]ε · [C]ε = (1, − 1 , −1)T^ = H.

ε[L]ε =^ Y^ ·^ S−^1 =

 

 

β [L]β =^ S−^1 ·^ Y^ =

 

 

(In MATLAB: eLb=[B,E,E], eLe=eLb/ABF, bLb=ABF\eLb, LC=eLe*C) Bonus: Because {A, D, F } are linearly dependent (compare a.) the given equations are overdeter- mined. These may be consistent or inconsistent. Geometrically, since F = −D, T (F ) must equal T (−D) = −T (D) = −E = C. Algebraically, with the usual abuse of notation, we want a matrix X such that X · (A|D|F ) = (A|E|F ), i.e. (A|D|F )T^ · XT^ = (A|E|F )T^. Thus (in)consistency and possible solutions can be read off of the rref(

( (A|D|F )T^ | (A|E|F )T^

) . If e.g. T (F ) = C was specified, we may pick any vector v that is linearly independent from {A, D}, and completely freely specify T (v) ∈ R^3. Then (^) ε[T ]γ = (A|E|T (v)) is the matrix representation for the desired map T w.r.t. the basis γ = {A, D, v} for the input and ε for the output.

  1. The rank of the composition can be no larger than the minimum of the ranks of the individual maps, i.e. at most 2. On the other hand the dimension of the kernel (nullity) of the composition can be no larger than the sum of the dimensions of the kernels of the individual maps, i.e. at most
    1. Hence the rank of the composition must be at least 3 − 2 = 1. For example, T 1 : (x 1 , x 2 , x 3 ) 7 → (x 1 , x 2 , 0) and T 2 : (x 1 , x 2 , x 3 ) 7 → (x 1 , 0 , x 3 ) have both rank 2, while T 1 ◦ T 1 = T 1 and T 2 ◦ T 1 : (x 1 , x 2 , x 3 ) 7 → (x 1 , 0 , 0) have rank 2 and 1, respectively

4.a. The Wronskian matrix of the functions {e−^3 x, xe−^3 x, x^2 e−^3 x} evaluated at x = 0 is lower tri- angular with nonzero entries along the diagonal. Hence the Wronskian has full rank. Thus β is linearly independent. Since β spans by defn., it is a basis for V. b. [(2 − 5 x^2 )e−^3 x]β = (2, 0 , −5)T c. Suppose c ∈ R and y 1 , y 2 ∈ V. Then L(cy 1 + y 2 ) = (cy 1 + y 2 )′^ = cy 1 ′ + y′ 2 = cL(y 1 ) + L(y 2 ).

d. For vi ∈ β calculate the coordinates of L(vi) w.r.t. β. They are the columns of the desired matrix. e. Since (^) β [L]β has full rank, ker(L) = { 0 } and a basis is the empty set { }. f. Calculate (^) β [L]− β 1 [f (x)]β = (−^89 , 109 , 53 )T^. Hence

( −^89 + 109 x + 53 x^2

) e−^3 x^ is the desired antiderivative.

Bonus. Compare 4.d. This interesting pair of linear maps whose commutator (^) ε[X ◦ D − D ◦ X]ε = I 3 is the identity is useful e.g. as a mathematical model in quantum mechanics.

β [L]β =

 

 

ε[D^ ◦^ X]ε =

 

 

ε[X^ ◦^ D]ε =

 

 .