1/23
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
a function is a linear transformation if it
preserves vector addition and scalar multiplication i.e. T(x + y) = T(x) + T(y) and T(cx) = cT(x)
linear operator
when dimension of linear transformation stays the same
matrix that induces a transformation
A is [ T(e1) … T(en) ]
ghgfhds
gfsadkhjldfh
matrix of a counterclockwise rotation by angle theta/ clockwise rotation by angle -theta
[cos theta -sin theta]
[sin theta cos theta}
matrix for a reflection across y axis
[-1 0]
[0 1]
matrix for horizontal shear
[1 -1]
[0 1]
what happens in a horizontal shear
ever point is displaced horizontally by an amount proportional to its y coordinate
matrix for reflection over x = y
[ 0 1]
[1 0 ]
projection matrix onto the line spanned by u
P = uuT/uTu
reflection matrix over the line spanned by u
2P - I where P is the projection matrix
a vector w in Rm is said to be hit by T: Rn → Rm if w =
Tv for some v in Rn
the kernel of T is defined by
ker T = { v in Rn such that T(v) = 0 }; the subspace of Rn containing those the map onto the zero vector in Rm
the image of T is defined by
im T = { T(v) such that v is in Rn }; the subspace of Rm that T maps onto
if the m x n matrix A induces the linear transformation Ta(x) = Ax, then imTa =
col A
T is said to be injective/one to one if
T(v) = T(w) implies v = w, so no element of Rm gets hit twice
T is said to be surjective/onto if
im T = Rm, so that every vector in Rm is hit at least once
T is one to one iff
ker T = {0}
if T: Rn → Rm, then n =
dim(kerT) + dim(imT)
if T: Rn → Rn
T injective → T surjective and vice versa
properties of one to one
solutions to T(x) = b are unique if exist, all columns of its matrix are linearly independent, and ker T = {0}
properties of onto
solutions to T(x) = b exist for every b in Rm, all rows of its matrix are linearly independent, and image = codomain
properties of invertible
combines those of one to one and onto
number of LI columns of A equals
number of LI rows