This document provides a cheat sheet summarizing key concepts in linear algebra, including definitions of basis, linear combinations, linear independence, diagonalizable matrices, eigenvectors and eigenvalues, Gram-Schmidt orthogonalization, vector spaces, linear transformations, ranks, null spaces, and spanning sets. The cheat sheet is organized with headings defining each concept and listing their essential properties in bullet points.
This document provides a cheat sheet summarizing key concepts in linear algebra, including definitions of basis, linear combinations, linear independence, diagonalizable matrices, eigenvectors and eigenvalues, Gram-Schmidt orthogonalization, vector spaces, linear transformations, ranks, null spaces, and spanning sets. The cheat sheet is organized with headings defining each concept and listing their essential properties in bullet points.
This document provides a cheat sheet summarizing key concepts in linear algebra, including definitions of basis, linear combinations, linear independence, diagonalizable matrices, eigenvectors and eigenvalues, Gram-Schmidt orthogonalization, vector spaces, linear transformations, ranks, null spaces, and spanning sets. The cheat sheet is organized with headings defining each concept and listing their essential properties in bullet points.
Basis Diagonalizable Matrices Gram-Schmidt Linear Combo
Orthonormalization A set S is a basis for V if A is diagonalizable when A is v is a linear combo of u_1 ... u_n
1. S spans V similar to a diagonal matrix. 1. B = {v1, v2, ..., vn} .
That is, A is diagonalizable when 2. B' = {w1, w2, ..., wn}: 2. S is LI. there exists an invertible matrix P Linear Independence If S is a basis for V then every such that P-1AP is a diagonal w1 = v1 vector in V can be written in one matrix a set of vectors S is LI if c1v1 +...+ and only one way as a linear w2 = v2 - projw1v2 ckvk = 0 has only the trivial combo of vectors in S and every Dot Products Etc. w3 = v3 - projw1v3 - projw2v3 solution. set containing more than n vectors If there are other solutions S is LD. length/norm ||v|| = sqrt(v_12 +...+ wn = vn - ... is LD. A set S is LI iff one of its vectors v_n2 can 3. B'' = {u1, u2, ..., un}: be written as a combo of other S Basis Test ||cv|| = |c| ||v|| vectors. 1. If S is a LI set of vectors in V, v / ||v|| is the unit vector ui = wi/||wi|| then S is a basis for V distance d(u,v) = ||u-v|| Linear Transformation 2. If S spans V, then S is a basis Dot product u•v = (u_1v_1 +...+ B'' is an orthonormal basis for V V & W are Vspaces. T:V->W is a for V u_nv_n) span(B) = span(B'') linear transformation of V into W if: n cos(theta) = u•v / (||u|| ||v||) Change of Basis 1. T(u+v) = T(u) = T(v) u&v are orthagonal when dot(u,v) = Important Vector Spaces 2. T(cu) = cT(u) P[x]_B' = [x]_B 0 Rn [x]_B' = P-1 [x]_B Non-Homogeny Eigenshit C(-inf, +inf) [B B'] -> [ I P-1 ] C[a, b] If xp is a solution to Ax = b then The scalar lambda(Y) is called an [B' B ] -> [ I P ] every solution to the system can be Eigenvalue of A when there is a P written as x = xp nonzero vector x such that Ax = P_n Cross Product Yx. M_m,n Nullity if u = u1i + u2j + u3k Vector x is an Eigenvector of A AND corresponding to Y. Nullspace(A) = {x ε Rn : Ax = 0 Inner Products Nullity(A) = dim(Nullspace(A)) v = v1i + v2j + v3k The set of all eigenvectors with the ||u|| = sqrt<u,u> = n - rank(A) THEN zero vector is a subspace of Rn called the Eigenspace of Y. d(u,v) = ||u-v|| u x v = (u2v3 - u3v2)i - (u1v3 - Orthogonal Sets cos(theta) = <u,v> / (||u|| ||v||) u3v1)j + (u1v2 - u2v1)k 1. Find Eigenvalues: det(YI - A) = 0 u&v are orthagonal when <u,v> = 0 Set S in V is orthogonal when every 2. Find Eigenvectors: (YI - A)x = 0 pair of vectors in S is orthogonal. If Definition of a Vector Space proj_v u = <u,v>/<v,v> * v If A is a triangular matrix then its each vector is a unit vector, then S u + v is within V eigenvalues are on its main is orthonormal diagonal Kernal u+v = v+u For T:V->W The set of all vectors v u+(v+w) = (u+v)+w in V that satisfies T(v)=0 is the u+0 = u kernal of T. ker(T) is a subspace of u-u = 0 v. For T:Rn ->Rm by T(x)=Ax ker(T) = cu is within V solution space of Ax=0 & c(u+v) = cu+cv Cspace(A) = range(T) (c+d)u = cu+du
c(du) = (cd)u
1*u = u
By spoopyy Published 4th June, 2016. Sponsored by ApolloPad.com
cheatography.com/spoopyy/ Last updated 4th June, 2016. Everyone has a novel in them. Finish Yours! Page 1 of 2. https://apollopad.com Linear Algebra Cheat Sheet by spoopyy via cheatography.com/28376/cs/8341/
One-to-One and Onto
T is one-to-one iff ker(T) = {0}
T is onto iff rank(T) = dim(W)
If dim(T) = dim(W) then T is one-to-one iff it is onto
Rank and Nullity of T
nullity(T) = dim(kernal)
rank(T) = dim(range)
range(T) + nullity(T) = n (in m_x n)
dim(domain) = dim(range) + dim(kernal)
Rank of a Matrix
Rank(A) = dim(Rspace) = dim(Cspace)
Similar Matrices
For square matrices A and A' of order n, A' is similar to A when
there exits an invertible matrix P such that A' = P -1 AP
Spanning Sets
S = {v1...vk} is a subset of vector space V. S spans V if every
vector in v can be written as a linear combo of vectors in S.
Test for Subspace
1. u+v are in W
2. cu is in w
By spoopyy Published 4th June, 2016. Sponsored by ApolloPad.com
cheatography.com/spoopyy/ Last updated 4th June, 2016. Everyone has a novel in them. Finish Yours! Page 2 of 2. https://apollopad.com