4 Flashcards
Linear transformations, change of basis
Suppose that V and W are (real) vector
spaces. A function T → V ! W is linear if for all u, v ∈ V and all α ∈ R, …
- T(u + v) = T(u) + T(v) and
- T(αu) = αT(u).
T is said to be a linear transformation (or linear mapping or linear function).
Equivalently, T is linear if for all u, v ∈ V and α, β ∈ R,
T(αu +βv) = αT(u) + βT(v):
Suppose that T is a linear transformation from vector space V to vector space W. Then the range, R(T), of T is
R(T) = {T(v) : v ∈ V}
Suppose that T is a linear transformation from vector space V to vector space W. Then the null space, N(T), of T is
N(T) = {v ∈ V : T(v) = 0};
where 0 denotes the zero vector of W.
The null space is often called the kernel, and may be denoted ker(T) in some texts.
Of course, for any matrix, R(TA) = R(A), and N(AT) = N(A).
If V and W are both finite dimensional, then so are R(T) and N(T). We define the rank of T, rank(T) to be … and the nullity of T, nullity(T), to be … .
rank(T) is dim (R(T))
nullity of T, nullity(T) = dim (N(T)).
Suppose that T is a linear transformation from the finite-dimensional vector space V to the vector space W (not necessarily finite-dimensional.
Then …
rank(T) + nullity(T) = dim(V)
For an m x n matrix A, if T = TA, then T is a linear transformation from V = Rn to W = Rm, and rank(T) = rank(A), nullity(T) = nullity(A), so…
rank(A) + nullity(A) = n
if we let PB be the matrix whose columns are the basis vectors (in order), PB = (x1x2 …xn), then for any x ∈ Rn, x =
x = PB [x]B
The matrix PB is invertible (because its columns are linearly independent, and hence its rank is n). So we can also write [x]B = PB-1 x
Suppose that T : Rn → Rm is a linear transformation, that B is a basis of Rn and B’ is a basis of Rm.
Let PB and PB’ be the matrices whose columns are, respectively, the vectors of B and B’.
Then the matrix representing T with respect to B and B’ is given by AT [B,B’] = PB’-1 ATPB;
where AT = (T(e1) T(e2) … T(en))
So, for all x, [T(x)]B’ = …
[T(x)]B’ = PB‘-1 ATPB[x]B
Suppose that T : Rn → Rn is a linear transformation and that B = {x1; x2… xn} is some basis of Rn. Let
P = (x1 x2… xn) be the matrix whose columns are the vectors of B.
Then for all x ∈ Rn,
[T(x)]B = P-1ATP[x]B;
where AT is the matrix corresponding to T,
AT = (T(e1) T(e2) … T(en)).
In other words, AT [B,B] = …
AT [B,B] = P-1ATP
The relationship between the matrices AT [B,B] and AT is an important one in the theory of linear algebra.
If there is an invertible (nonsingular) matrix P such that
B = P-1AP, we say that two square matrices A and B are
similar